{"id":"2308.00205","submitter":"Aboubacar Marcos","authors":"Aboubacar Marcos and Janvier Soninhekpon","title":"On eigenvalues problems for the $p(x)$-Laplacian","comments":"The introduction have been shortened, Assumption( 2-3) on page 4, has\n  been improved, the proof of proposition 2-11 0n page 5 has been improved,\n  Errors in proposition 3-2 page 14 have been corrected, the final remark at\n  the end of the document has been replaced by a conclusion. Tiltes of some\n  sections have been changed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies nonlinear eigenvalues problems with a double non\nhomogeneity governed by the $p(x)$-Laplacian operator, under the Dirichlet\nboundary condition on a bounded domain of $\\mathbb{R}^N(N\\geq2)$. According to\nthe type of the nonlinear part (sublinear, superlinear) we use the Lagrange\nmultiplier's method, the Ekeland's variational principle and the Mountain-Pass\ntheorem to show that the spectrum includes a continuous set of eigenvalues,\nwhich can in some contexts be all the set $\\mathbb{R_+^{*}}$. Moreover, we show\nthat the smallest eigenvalue obtained from the Lagrange multipliers is exactly\nthe first eigenvalue in the Ljusternik-Schnirelman eigenvalues sequence.\n  Key words: Nonlinear eigenvalue problems, $p(x)$-Laplacian, Lagrange\nmultipliers, Ekeland variational principle, Ljusternik-Schnirelman principle,\nMountain-Pass theorem.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 00:04:30 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 15:18:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Marcos","Aboubacar",""],["Soninhekpon","Janvier",""]]}
{"id":"2308.00206","submitter":"Karanpartap Singh","authors":"Kasra Naftchi-Ardebili, Karanpartap Singh, Reza Pourabolghasem, Pejman\n  Ghanouni, Gerald R. Popelka, Kim Butts Pauly","title":"SkullGAN: Synthetic Skull CT Generation with Generative Adversarial\n  Networks","comments":"The first two authors contributed equally. This work has been\n  submitted to Radiology: Artificial Intelligence 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.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning offers potential for various healthcare applications involving\nthe human skull but requires extensive datasets of curated medical images. To\novercome this challenge, we propose SkullGAN, a generative adversarial network\n(GAN), to create large datasets of synthetic skull CT slices, reducing reliance\non real images and accelerating the integration of machine learning into\nhealthcare. In our method, CT slices of 38 subjects were fed to SkullGAN, a\nneural network comprising over 200 million parameters. The synthetic skull\nimages generated were evaluated based on three quantitative radiological\nfeatures: skull density ratio (SDR), mean thickness, and mean intensity. They\nwere further analyzed using t-distributed stochastic neighbor embedding (t-SNE)\nand by applying the SkullGAN discriminator as a classifier. The results showed\nthat SkullGAN-generated images demonstrated similar key quantitative\nradiological features to real skulls. Further definitive analysis was\nundertaken by applying the discriminator of SkullGAN, where the SkullGAN\ndiscriminator classified 56.5% of a test set of real skull images and 55.9% of\nthe SkullGAN-generated images as reals (the theoretical optimum being 50%),\ndemonstrating that the SkullGAN-generated skull set is indistinguishable from\nthe real skull set - within the limits of our nonlinear classifier. Therefore,\nSkullGAN makes it possible to generate large numbers of synthetic skull CT\nsegments, necessary for training neural networks for medical applications\ninvolving the human skull. This mitigates challenges associated with preparing\nlarge, high-quality training datasets, such as access, capital, time, and the\nneed for domain expertise.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 00:05:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Naftchi-Ardebili","Kasra",""],["Singh","Karanpartap",""],["Pourabolghasem","Reza",""],["Ghanouni","Pejman",""],["Popelka","Gerald R.",""],["Pauly","Kim Butts",""]]}
{"id":"2308.00207","submitter":"Vaseem Shaik","authors":"Vaseem A. Shaik and Gwynn J. Elfring","title":"Densitaxis: Active particle motion in density gradients","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Organisms often swim through density stratified fluids. In this Letter, we\ninvestigate the dynamics of small active particles swimming in density\ngradients and report theoretical evidence of taxis as a result of density\nstratification ($\\textit{densitaxis}$). Specifically, we calculate the effect\nof density stratification on the dynamics of a force-free spherical squirmer\nand show that density stratification induces reorientation that tends to align\nswimming either parallel or normal to the gradient depending on the swimming\ngait. In particular, particles that propel by generating thrust in the front\n(pullers) rotate to swim parallel to gradients and hence display (positive or\nnegative) densitaxis, while particles that propel by generating thrust in the\nback (pushers) rotate to swim normal to the gradients. This work could be\nuseful to understand the motion of marine organisms in ocean, or be leveraged\nto sort or organize a suspension of active particles by modulating density\ngradients.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 00:13:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shaik","Vaseem A.",""],["Elfring","Gwynn J.",""]]}
{"id":"2308.00208","submitter":"Mario Centelles","authors":"P. Bano, S. P. Pattnaik, M. Centelles, X. Vi\\~nas, T. R. Routray","title":"Correlations between charge radii differences of mirror nuclei and\n  stellar observables","comments":"10 pages, 5 figures, 2 tables","journal-ref":"Phys. Rev. C 108, 015802 (2023)","doi":"10.1103/PhysRevC.108.015802","report-no":null,"categories":"nucl-th astro-ph.SR nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The correlation between the charge radii differences in mirror nuclei pairs\nand the neutron skin thickness has been studied with the so-called finite range\nsimple effective interaction over a wide mass region. The so far precisely\nmeasured charge radii difference data within their experimental uncertainty\nranges in the 34Ar-34S, 36Ca-36S, 38Ca-38Ar, and 54Ni-54Fe mirror pairs are\nused to ascertain an upper limit for the slope parameter of the nuclear\nsymmetry energy L $\\approx$ 100 MeV. This limiting value of L is found to be\nconsistent with the upper bound of the NICER PSR J0740+6620 constraint at\n1$\\sigma$ level for the radius R$_{1.4}$ of 1.4 M$_\\odot$ neutron stars. The\nlower bound of the NICER R$_{1.4}$ data constrains the lower limit of L to\n$\\approx$ 70 MeV. Within the range for L = 70-100 MeV the tidal deformability\n$\\Lambda^{1.4}$ constraint, which is extracted from the GW170817 event at\n2$\\sigma$ level, and the recent PREX-2 and CREX data on the neutron skin\nthickness are discussed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 00:43:41 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bano","P.",""],["Pattnaik","S. P.",""],["Centelles","M.",""],["Vi\u00f1as","X.",""],["Routray","T. R.",""]]}
{"id":"2308.00209","submitter":"Marina Bianchin","authors":"Marina Bianchin, Vivian U, Yiqing Song, Thomas S.-Y. Lai, Raymond P.\n  Remigio, Loreto Barcos-Munoz, Tanio Diaz-Santos, Lee Armus, Hanae Inami,\n  Kirsten L. Larson, Aaron S. Evans, Torsten Boker, Justin A. Kader, Sean T.\n  Linden, Vassilis Charmandaris, Matthew A. Malkan, Jeff Rich, Thomas Bohn,\n  Anne M. Medling, Sabrina Stierwalt, Joseph M. Mazzarella, David R. Law,\n  George C. Privon, Susanne Aalto, Philip Appleton, Michael J. I. Brown,\n  Victorine A. Buiten, Luke Finnerty, Christopher C. Hayward, Justin Howell,\n  Kazushi Iwasawa, Francisca Kemper, Jason Marshall, Jed McKinney, Francisco\n  Muller-Sanchez, Eric J. Murphy, Paul P. van der Werf, David B. Sanders, and\n  Jason Surace","title":"GOALS-JWST: Gas Dynamics and Excitation in NGC7469 revealed by NIRSpec","comments":"14 pages, 4 figures, 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 new JWST-NIRSpec IFS data for the luminous infrared galaxy\nNGC7469: a nearby (70.6Mpc) active galaxy with a Sy 1.5 nucleus that drives a\nhighly ionized gas outflow and a prominent nuclear star-forming ring. Using the\nsuperb sensitivity and high spatial resolution of the JWST instrument\nNIRSpec-IFS, we investigate the role of the Seyfert nucleus in the excitation\nand dynamics of the circumnuclear gas. Our analysis focuses on the [Fe ii], H2,\nand hydrogen recombination lines that trace the radiation/shocked-excited\nmolecular and ionized ISM around the AGN. We investigate the gas excitation\nthrough H2/Br{\\gamma} and [Fe ii]/Pa\\b{eta} emission line ratios and find that\nphotoionization by the AGN dominates within the central 300 pc of the galaxy\nand together with a small region show ing signatures of shock-heated gas; these\nshock-heated regions are likely associated with a compact radio jet. In\naddition, the velocity field and velocity dispersion maps reveal complex gas\nkinematics. Rotation is the dominant feature, but we also identify non-circular\nmotions consistent with gas inflows as traced by the velocity residuals and the\nspiral pattern in the Pa{\\alpha} velocity dispersion map. The inflow is\nconsistent with the mass outflow rate and two orders of magnitude higher than\nthe AGN accretion rate. The compact nuclear radio jet has enough power to drive\nthe highly ionized outflow. This scenario suggests that the inflow and outflow\nare in a self-regulating feeding-feedback process, with a contribution from the\nradio jet helping to drive the outflow.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 00:45:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bianchin","Marina",""],["U","Vivian",""],["Song","Yiqing",""],["Lai","Thomas S. -Y.",""],["Remigio","Raymond P.",""],["Barcos-Munoz","Loreto",""],["Diaz-Santos","Tanio",""],["Armus","Lee",""],["Inami","Hanae",""],["Larson","Kirsten L.",""],["Evans","Aaron S.",""],["Boker","Torsten",""],["Kader","Justin A.",""],["Linden","Sean T.",""],["Charmandaris","Vassilis",""],["Malkan","Matthew A.",""],["Rich","Jeff",""],["Bohn","Thomas",""],["Medling","Anne M.",""],["Stierwalt","Sabrina",""],["Mazzarella","Joseph M.",""],["Law","David R.",""],["Privon","George C.",""],["Aalto","Susanne",""],["Appleton","Philip",""],["Brown","Michael J. I.",""],["Buiten","Victorine A.",""],["Finnerty","Luke",""],["Hayward","Christopher C.",""],["Howell","Justin",""],["Iwasawa","Kazushi",""],["Kemper","Francisca",""],["Marshall","Jason",""],["McKinney","Jed",""],["Muller-Sanchez","Francisco",""],["Murphy","Eric J.",""],["van der Werf","Paul P.",""],["Sanders","David B.",""],["Surace","Jason",""]]}
{"id":"2308.00210","submitter":"Yuelin Xin","authors":"Yuelin Xin, Zihan Zhou, Yuxuan Xia","title":"Scene Separation & Data Selection: Temporal Segmentation Algorithm for\n  Real-Time Video Stream Analysis","comments":"5 pages, 4 figures, at IJCAI-ECAI 2022 workshop, First International\n  Workshop on Spatio-Temporal Reasoning and Learning, July 24, 2022, Vienna,\n  Austria","journal-ref":"CEUR.Workshop.Proceedings.2022.Vol-3190.paper2","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present 2SDS (Scene Separation and Data Selection algorithm), a temporal\nsegmentation algorithm used in real-time video stream interpretation. It\ncomplements CNN-based models to make use of temporal information in videos.\n2SDS can detect the change between scenes in a video stream by com-paring the\nimage difference between two frames. It separates a video into segments\n(scenes), and by combining itself with a CNN model, 2SDS can select the optimal\nresult for each scene. In this paper, we will be discussing some basic methods\nand concepts behind 2SDS, as well as presenting some preliminary experiment\nresults regarding 2SDS. During these experiments, 2SDS has achieved an overall\naccuracy of over 90%.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 00:53:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xin","Yuelin",""],["Zhou","Zihan",""],["Xia","Yuxuan",""]]}
{"id":"2308.00211","submitter":"Bowen Zheng","authors":"Yunxi Dong, Bowen Zheng, Hang Li, Hong Tang, Yi Huang, Sensong An,\n  Hualiang Zhang","title":"High-fidelity achromatic metalens imaging via deep neural network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Meta-optics are attracting intensive interest as alternatives to traditional\noptical systems comprising multiple lenses and diffractive elements. Among\napplications, single metalens imaging is highly attractive due to the potential\nfor achieving significant size reduction and simplified design. However, single\nmetalenses exhibit severe chromatic aberration arising from material dispersion\nand the nature of singlet optics, making them unsuitable for full-color imaging\nrequiring achromatic performance. In this work, we propose and validate a deep\nlearning-based single metalens imaging system to overcome chromatic aberration\nin varied scenarios. The developed deep learning networks computationally\nreconstruct raw imaging captures through reliably refocusing red, green and\nblue channels to eliminate chromatic aberration and enhance resolution without\naltering the metalens hardware. The networks demonstrate consistent enhancement\nacross different aperture sizes and focusing distances. Images outside the\ntraining set and real-world photos were also successfully reconstructed. Our\napproach provides a new means to achieve achromatic metalenses without complex\nengineering, enabling practical and simplified implementation to overcome\ninherent limitations of meta-optics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:04:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dong","Yunxi",""],["Zheng","Bowen",""],["Li","Hang",""],["Tang","Hong",""],["Huang","Yi",""],["An","Sensong",""],["Zhang","Hualiang",""]]}
{"id":"2308.00213","submitter":"Wen Huang","authors":"Zhenwei Huang and Wen Huang","title":"An increasing rank Riemannian method for generalized Lyapunov equations","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 consider finding a low-rank approximation to the solution\nof a large-scale generalized Lyapunov matrix equation in the form of $A X M + M\nX A = C$, where $A$ and $M$ are symmetric positive definite matrices. An\nalgorithm called an Increasing Rank Riemannian method for generalized Lyapunov\nequation (IRRLyap) is proposed by merging the increasing rank technique and\nRiemannian optimization techniques on the quotient manifold $\\mathbb{R}_*^{n\n\\times p} / \\mathcal{O}_p$. To efficiently solve the optimization problem on\n$\\mathbb{R}_*^{n \\times p} / \\mathcal{O}_p$, a line-search-based Riemannian\ninexact Newton method is developed with its global convergence and local\nsuperlinear convergence rate guaranteed. Moreover, we investigate the influence\nof the existing three Riemannian metrics on $\\mathbb{R}_*^{n \\times p} /\n\\mathcal{O}_p$ and derive new preconditioners which takes $M \\neq I$ into\nconsideration. Numerical experiments show that IRRLyap with one of the\nRiemannian metrics is most efficient and robust in general and is preferable\ncompared to the tested state-of-the-art methods when the lowest rank solution\nis desired.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:06:37 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Huang","Zhenwei",""],["Huang","Wen",""]]}
{"id":"2308.00214","submitter":"Chaochao Zhou","authors":"Chaochao Zhou, Syed Hasib Akhter Faruqui, Abhinav Patel, Ramez N.\n  Abdalla, Michael C. Hurley, Ali Shaibani, Matthew B. Potts, Babak S. Jahromi,\n  Leon Cho, Sameer A. Ansari, Donald R. Cantrell","title":"Robust Single-view Cone-beam X-ray Pose Estimation with Neural Tuned\n  Tomography (NeTT) and Masked Neural Radiance Fields (mNeRF)","comments":null,"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":"  Many tasks performed in image-guided, mini-invasive, medical procedures can\nbe cast as pose estimation problems, where an X-ray projection is utilized to\nreach a target in 3D space. Expanding on recent advances in the differentiable\nrendering of optically reflective materials, we introduce new methods for pose\nestimation of radiolucent objects using X-ray projections, and we demonstrate\nthe critical role of optimal view synthesis in performing this task. We first\ndevelop an algorithm (DiffDRR) that efficiently computes Digitally\nReconstructed Radiographs (DRRs) and leverages automatic differentiation within\nTensorFlow. Pose estimation is performed by iterative gradient descent using a\nloss function that quantifies the similarity of the DRR synthesized from a\nrandomly initialized pose and the true fluoroscopic image at the target pose.\nWe propose two novel methods for high-fidelity view synthesis, Neural Tuned\nTomography (NeTT) and masked Neural Radiance Fields (mNeRF). Both methods rely\non classic Cone-Beam Computerized Tomography (CBCT); NeTT directly optimizes\nthe CBCT densities, while the non-zero values of mNeRF are constrained by a 3D\nmask of the anatomic region segmented from CBCT. We demonstrate that both NeTT\nand mNeRF distinctly improve pose estimation within our framework. By defining\na successful pose estimate to be a 3D angle error of less than 3 deg, we find\nthat NeTT and mNeRF can achieve similar results, both with overall success\nrates more than 93%. However, the computational cost of NeTT is significantly\nlower than mNeRF in both training and pose estimation. Furthermore, we show\nthat a NeTT trained for a single subject can generalize to synthesize\nhigh-fidelity DRRs and ensure robust pose estimations for all other subjects.\nTherefore, we suggest that NeTT is an attractive option for robust pose\nestimation using fluoroscopic projections.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:12:29 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 04:00:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhou","Chaochao",""],["Faruqui","Syed Hasib Akhter",""],["Patel","Abhinav",""],["Abdalla","Ramez N.",""],["Hurley","Michael C.",""],["Shaibani","Ali",""],["Potts","Matthew B.",""],["Jahromi","Babak S.",""],["Cho","Leon",""],["Ansari","Sameer A.",""],["Cantrell","Donald R.",""]]}
{"id":"2308.00215","submitter":"Aida Damanpak Rizi","authors":"Aida Damanpak Rizi (1), Antika Roy (1), Rouhan Noor (1), Hyo Kang (1),\n  Nitin Varshney (1), Katja Jacob (2), Sindia Rivera-Jimenez (1), Nathan\n  Edwards (3), Volker J. Sorger (1), Hamed Dalir (1), Navid Asadizanjani (1)\n  ((1) University of Florida, Gainesville, FL, USA, (2) ZEISS Microscopy, Jena,\n  Germany, (3) US Partnership for Assured Electronics (USPAE))","title":"From Talent Shortage to Workforce Excellence in the CHIPS Act Era:\n  Harnessing Industry 4.0 Paradigms for a Sustainable Future in Domestic Chip\n  Production","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The CHIPS Act is driving the U.S. towards a self-sustainable future in\ndomestic chip production. Decades of outsourced manufacturing, assembly,\ntesting, and packaging has diminished the workforce ecosystem, imposing major\nlimitations on semiconductor companies racing to build new fabrication sites as\npart of the CHIPS Act. In response, a systemic alliance between academic\ninstitutions, the industry, government, various consortiums, and organizations\nhas emerged to establish a pipeline to educate and onboard the next generation\nof talent. Establishing a stable and continuous flow of talent requires\nsignificant time investments and comes with no guarantees, particularly\nfactoring in the low workplace desirability in current fabrication houses for\nU.S workforce. This paper will explore the feasibility of two paradigms of\nIndustry 4.0, automation and Augmented Reality(AR)/Virtual Reality(VR), to\ncomplement ongoing workforce development efforts and optimize workplace\ndesirability by catalyzing core manufacturing processes and effectively\nenhancing the education, onboarding, and professional realms-all with promising\ncapabilities amid the ongoing talent shortage and trajectory towards advanced\npackaging.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:15:51 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Rizi","Aida Damanpak",""],["Roy","Antika",""],["Noor","Rouhan",""],["Kang","Hyo",""],["Varshney","Nitin",""],["Jacob","Katja",""],["Rivera-Jimenez","Sindia",""],["Edwards","Nathan",""],["Sorger","Volker J.",""],["Dalir","Hamed",""],["Asadizanjani","Navid",""]]}
{"id":"2308.00216","submitter":"Kevin Araya Sossa","authors":"Kevin Araya-Sossa and Miguel Orszag","title":"Generation of entanglement via squeezing on a tripartite-optomechanical\n  system","comments":null,"journal-ref":"Phys. Rev. A 108, 012432. Published 25 July 2023","doi":"10.1103/PhysRevA.108.012432","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new strategy to regulate the quantum entanglement in a\ndispersive-hybrid system where a qubit is directly coupled to a cavity and a\nresonator. A dramatic transition takes place by only tuning the squeezing\nparameters associated with the vibrational mode. As the squeezing amplitude\nbecomes larger, the maximal entanglement abruptly falls to zero at specific\nsqueezing phases. It is also possible to generate entanglement for bipartitions\nfrom the qubit-cavity-resonator system after applying this strategy. Entangled\nqubit-cavity states are created through squeezing, even though there is no\ndirect interaction between them. We also analyze the effect of atomic, optical,\nand vibrational losses on the quantum entanglement. Finally, we discuss future\nrealizations to implement all these ideas and promote further studies to\ngeneralize the concept of monogamy in tripartite systems outside\nqubit-composite states, in particular, $(2 \\otimes 2 \\otimes n)$-dimensional\nsystems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:16:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Araya-Sossa","Kevin",""],["Orszag","Miguel",""]]}
{"id":"2308.00217","submitter":"Akashdeep Dey","authors":"Akashdeep Dey","title":"Existence of closed geodesics on certain non-compact Riemannian\n  manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $M$ be a complete Riemannian manifold. Suppose $M$ contains a bounded,\nconcave, open set $U$ with $C^0$ boundary. Moreover, we assume that $M\\setminus\nU$ is connected and either the relative homotopy set $\\pi_1(M,M\\setminus U)=0$\nor the image of the homomorphism $\\pi_1(M\\setminus U)\\rightarrow \\pi_1(M)$\n(induced by the inclusion $M\\setminus U\\hookrightarrow M$) is a finite index\nsubgroup or a normal subgroup of $\\pi_1(M)$ or the relative homology group\n$H_1(M,M\\setminus U)\\neq 0$. Then there exists a non-trivial closed geodesic on\n$M$. This partially proves a conjecture of Chambers, Liokumovich, Nabutovsky\nand Rotman.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:17:35 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dey","Akashdeep",""]]}
{"id":"2308.00218","submitter":"Xin Chen","authors":"Yubao Zhang, Xin Chen, Yi Gu, Zhicheng Li and Wu Kai","title":"Deep Reinforcement Learning-Based Battery Conditioning Hierarchical V2G\n  Coordination for Multi-Stakeholder Benefits","comments":null,"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":"  With the growing prevalence of electric vehicles (EVs) and advancements in EV\nelectronics, vehicle-to-grid (V2G) techniques and large-scale scheduling\nstrategies have emerged to promote renewable energy utilization and power grid\nstability. This study proposes a multi-stakeholder hierarchical V2G\ncoordination based on deep reinforcement learning (DRL) and the Proof of Stake\nalgorithm. Furthermore, the multi-stakeholders include the power grid, EV\naggregators (EVAs), and users, and the proposed strategy can achieve\nmulti-stakeholder benefits. On the grid side, load fluctuations and renewable\nenergy consumption are considered, while on the EVA side, energy constraints\nand charging costs are considered. The three critical battery conditioning\nparameters of battery SOX are considered on the user side, including state of\ncharge, state of power, and state of health. Compared with four typical\nbaselines, the multi-stakeholder hierarchical coordination strategy can enhance\nrenewable energy consumption, mitigate load fluctuations, meet the energy\ndemands of EVA, and reduce charging costs and battery degradation under\nrealistic operating conditions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:19:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Yubao",""],["Chen","Xin",""],["Gu","Yi",""],["Li","Zhicheng",""],["Kai","Wu",""]]}
{"id":"2308.00219","submitter":"Haru Kondoh","authors":"Haru Kondoh and Asako Kanezaki","title":"Multi-goal Audio-visual Navigation using Sound Direction Map","comments":"IROS2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over the past few years, there has been a great deal of research on\nnavigation tasks in indoor environments using deep reinforcement learning\nagents. Most of these tasks use only visual information in the form of\nfirst-person images to navigate to a single goal. More recently, tasks that\nsimultaneously use visual and auditory information to navigate to the sound\nsource and even navigation tasks with multiple goals instead of one have been\nproposed. However, there has been no proposal for a generalized navigation task\ncombining these two types of tasks and using both visual and auditory\ninformation in a situation where multiple sound sources are goals. In this\npaper, we propose a new framework for this generalized task: multi-goal\naudio-visual navigation. We first define the task in detail, and then we\ninvestigate the difficulty of the multi-goal audio-visual navigation task\nrelative to the current navigation tasks by conducting experiments in various\nsituations. The research shows that multi-goal audio-visual navigation has the\ndifficulty of the implicit need to separate the sources of sound. Next, to\nmitigate the difficulties in this new task, we propose a method named sound\ndirection map (SDM), which dynamically localizes multiple sound sources in a\nlearning-based manner while making use of past memories. Experimental results\nshow that the use of SDM significantly improves the performance of multiple\nbaseline methods, regardless of the number of goals.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:26:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kondoh","Haru",""],["Kanezaki","Asako",""]]}
{"id":"2308.00220","submitter":"Zhiming Luo","authors":"Fan Sun and Zhiming Luo and Shaozi Li","title":"Boundary Difference Over Union Loss For Medical Image Segmentation","comments":"MICCAI 2023","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 segmentation is crucial for clinical diagnosis. However,\ncurrent losses for medical image segmentation mainly focus on overall\nsegmentation results, with fewer losses proposed to guide boundary\nsegmentation. Those that do exist often need to be used in combination with\nother losses and produce ineffective results. To address this issue, we have\ndeveloped a simple and effective loss called the Boundary Difference over Union\nLoss (Boundary DoU Loss) to guide boundary region segmentation. It is obtained\nby calculating the ratio of the difference set of prediction and ground truth\nto the union of the difference set and the partial intersection set. Our loss\nonly relies on region calculation, making it easy to implement and training\nstable without needing any additional losses. Additionally, we use the target\nsize to adaptively adjust attention applied to the boundary regions.\nExperimental results using UNet, TransUNet, and Swin-UNet on two datasets (ACDC\nand Synapse) demonstrate the effectiveness of our proposed loss function. Code\nis available at https://github.com/sunfan-bvb/BoundaryDoULoss.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:27:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sun","Fan",""],["Luo","Zhiming",""],["Li","Shaozi",""]]}
{"id":"2308.00221","submitter":"KiYoon Yoo","authors":"KiYoon Yoo, Wonhyuk Ahn, Nojun Kwak","title":"Advancing Beyond Identification: Multi-bit Watermark for Language Models","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study aims to proactively tackle misuse of large language models beyond\nidentification of machine-generated text. While existing methods focus on\ndetection, some malicious misuses demand tracing the adversary user for\ncounteracting them. To address this, we propose \"Multi-bit Watermark through\nColor-listing\" (COLOR), embedding traceable multi-bit information during\nlanguage model generation. Leveraging the benefits of zero-bit watermarking\n(Kirchenbauer et al., 2023a), COLOR enables extraction without model access,\non-the-fly embedding, and maintains text quality, while allowing zero-bit\ndetection all at the same time. Preliminary experiments demonstrates successful\nembedding of 32-bit messages with 91.9% accuracy in moderate-length texts\n($\\sim$500 tokens). This work advances strategies to counter language model\nmisuse effectively.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:27:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yoo","KiYoon",""],["Ahn","Wonhyuk",""],["Kwak","Nojun",""]]}
{"id":"2308.00222","submitter":"Kevin Araya Sossa","authors":"Kevin Araya-Sossa and Miguel Orszag","title":"Influence of squeezing on the weak-to-strong measurement transition","comments":null,"journal-ref":"Phys. Rev. A 103, 052215. Published 27 May 2021","doi":"10.1103/PhysRevA.103.052215","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we study the measurement transition for a coherent squeezed\npointer state through a transition factor $\\Gamma$ that involves a\nsystem-pointer coupling by using an arbitrary measured observable $A$. In\naddition, we show that the shift in the pointer's position and momentum\nestablishes a relationship with a new value defined as the transition value,\nwhich generalizes the weak value as well as the conditional expectaction value.\nFurthermore, a new strategy is introduced to achieve different measurement\nregimes by just adjusting the $r$ and $\\phi_{\\xi}$ parameters of the coherent\nsqueezed pointer state, opening an interesting way to test quantum mechanics\nfoundations. Our scheme has been theoretically applied in a trapped ion\nilluminated by a bichromatic laser beam, with a high potential to be\nimplemented in future experimental setups.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:33:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Araya-Sossa","Kevin",""],["Orszag","Miguel",""]]}
{"id":"2308.00223","submitter":"Sergey Baryshev V","authors":"Sergey V. Baryshev and Matthias Muehle","title":"Scalable Production and Supply Chain of Diamond using Microwave Plasma:\n  a Mini-review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Discovered and reported exactly 40 years ago, microwave plasma assisted\nchemical vapor deposition (MPACVD) pointed out an economic technology that\ncould potentially produce lab-grown diamond stones at scale. After this\nbreakthrough discovery, demonstrating that diamond can be growth at low\npressure and temperature, the progress quickly curbed and synthetic single\ncrystal diamond (SCD) size and quality could not be improved toward attaining\nrequirements critical in solid-state electronics. This led to the early promise\nof MPACVD to not come true and slowed the level of investments, thereby further\nstalling the progress in diamond syntheses. With the invention of a few novel\nhomo- and hetero-epitaxy growth techniques, the diamond research and technology\nhas recently reinvigorated. This mini review attempts to capture the momentum\nof recent progress in diamond MPACVD that could finally bring scalable\nmanufacturing of high quality large size wafers for future electronics and\noptics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:34:17 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Baryshev","Sergey V.",""],["Muehle","Matthias",""]]}
{"id":"2308.00224","submitter":"Liwenhan Xie","authors":"Liwenhan Xie and Zhaoyu Zhou and Kerun Yu and Yun Wang and Huamin Qu\n  and Siming Chen","title":"Wakey-Wakey: Animate Text by Mimicking Characters in a GIF","comments":"Accepted in the 36th Annual ACM Symposium on User Interface Software\n  and Technology (UIST'23)","journal-ref":null,"doi":"10.1145/3586183.3606813","report-no":null,"categories":"cs.HC cs.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  With appealing visual effects, kinetic typography (animated text) has\nprevailed in movies, advertisements, and social media. However, it remains\nchallenging and time-consuming to craft its animation scheme. We propose an\nautomatic framework to transfer the animation scheme of a rigid body on a given\nmeme GIF to text in vector format. First, the trajectories of key points on the\nGIF anchor are extracted and mapped to the text's control points based on local\naffine transformation. Then the temporal positions of the control points are\noptimized to maintain the text topology. We also develop an authoring tool that\nallows intuitive human control in the generation process. A questionnaire study\nprovides evidence that the output results are aesthetically pleasing and well\npreserve the animation patterns in the original GIF, where participants were\nimpressed by a similar emotional semantics of the original GIF. In addition, we\nevaluate the utility and effectiveness of our approach through a workshop with\ngeneral users and designers.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:37:37 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xie","Liwenhan",""],["Zhou","Zhaoyu",""],["Yu","Kerun",""],["Wang","Yun",""],["Qu","Huamin",""],["Chen","Siming",""]]}
{"id":"2308.00225","submitter":"Itay Itzhak","authors":"Itay Itzhak, Gabriel Stanovsky, Nir Rosenfeld, Yonatan Belinkov","title":"Instructed to Bias: Instruction-Tuned Language Models Exhibit Emergent\n  Cognitive Bias","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent studies show that instruction tuning and learning from human feedback\nimprove the abilities of large language models (LMs) dramatically. While these\ntuning methods can make models generate high-quality text, we conjecture that\nmore implicit cognitive biases may arise in these fine-tuned models. Our work\nprovides evidence that these fine-tuned models exhibit biases that were absent\nor less pronounced in their pretrained predecessors. We examine the extent of\nthis phenomenon in three cognitive biases - the decoy effect, the certainty\neffect, and the belief bias - all of which are known to influence human\ndecision-making and reasoning. Our findings highlight the presence of these\nbiases in various models, especially those that have undergone instruction\ntuning, such as Flan-T5, GPT3.5, and GPT4. This research constitutes a step\ntoward comprehending cognitive biases in instruction-tuned LMs, which is\ncrucial for the development of more reliable and unbiased language models.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:39:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Itzhak","Itay",""],["Stanovsky","Gabriel",""],["Rosenfeld","Nir",""],["Belinkov","Yonatan",""]]}
{"id":"2308.00226","submitter":"Giulio Zucal","authors":"Giulio Zucal","title":"Action convergence of general hypergraphs and tensors","comments":"43 pages, preprint; comments and suggestions welcome. arXiv admin\n  note: text overlap with arXiv:1811.00626, arXiv:1302.1634 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.FA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Action convergence provides a limit theory for linear bounded operators\n$A_n:L^{\\infty}(\\Omega_n)\\longrightarrow L^1(\\Omega_n)$ where $\\Omega_n$ are\npotentially different probability spaces. This notion of convergence emerged in\ngraph limits theory as it unifies and generalizes many notions of graph limits.\nWe generalize the theory of action convergence to sequences of multi-linear\nbounded operators $A_n:L^{\\infty}(\\Omega_n)\\times \\ldots \\times\nL^{\\infty}(\\Omega_n)\\longrightarrow L^1(\\Omega_n)$. Similarly to the linear\ncase, we obtain that for a uniformly bounded (under an appropriate norm)\nsequence of multi-linear operators there exists an action convergent\nsubsequence. Additionally, we explain how to associate different types of\nmulti-linear operators to a tensor and we study the different notions of\nconvergence that we obtain for tensors and in particular for adjacency tensors\nof hypergraphs. We obtain several hypergraphs convergence notions and we link\nthese with the gerarchy of notions of quasirandomness for hypergraph sequences.\nThis convergence covers also sparse and inhomogeneous hypergraph sequences and\nit preserves many properties of adjacency tensors of hypergraphs. Moreover, we\nexplain how to obtain a meaningful convergence for sequences of non-uniform\nhypergraphs and, therefore, also for simplicial complexes. Additionally, we\nhighlight many connections with the theory of dense uniform hypergraph limits\n(hypergraphons) and we conjecture the equivalence of this theory with a special\ncase of multi-linear action convergence.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:44:52 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zucal","Giulio",""]]}
{"id":"2308.00227","submitter":"Jaechang Ko","authors":"Jaechang Ko, John Ajibefun, Wei Yan","title":"Experiments on Generative AI-Powered Parametric Modeling and BIM for\n  Architectural Design","comments":"18 pages, 11 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a new architectural design framework that utilizes\ngenerative AI tools including ChatGPT and Veras with parametric modeling and\nBuilding Information Modeling (BIM) to enhance the design process. The study\nexperiments with the potential of ChatGPT and generative AI in 3D architectural\ndesign, extending beyond its use in text and 2D image generation. The proposed\nframework promotes collaboration between architects and AI, facilitating a\nquick exploration of design ideas and producing context-sensitive, creative\ndesign generation. By integrating ChatGPT for scripting and Veras for\ngenerating design ideas with widely used parametric modeling and BIM tools, the\nframework provides architects with an intuitive and powerful method to convey\ndesign intent, leading to more efficient, creative, and collaborative design\nprocesses.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:51:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ko","Jaechang",""],["Ajibefun","John",""],["Yan","Wei",""]]}
{"id":"2308.00228","submitter":"Zhifeng Wang Mr","authors":"Zhifeng Wang and Ramesh Sankaranarayana","title":"Using Scene and Semantic Features for Multi-modal Emotion Recognition","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Automatic emotion recognition is a hot topic with a wide range of\napplications. Much work has been done in the area of automatic emotion\nrecognition in recent years. The focus has been mainly on using the\ncharacteristics of a person such as speech, facial expression and pose for this\npurpose. However, the processing of scene and semantic features for emotion\nrecognition has had limited exploration. In this paper, we propose to use\ncombined scene and semantic features, along with personal features, for\nmulti-modal emotion recognition. Scene features will describe the environment\nor context in which the target person is operating. The semantic feature can\ninclude objects that are present in the environment, as well as their\nattributes and relationships with the target person. In addition, we use a\nmodified EmbraceNet to extract features from the images, which is trained to\nlearn both the body and pose features simultaneously. By fusing both body and\npose features, the EmbraceNet can improve the accuracy and robustness of the\nmodel, particularly when dealing with partially missing data. This is because\nhaving both body and pose features provides a more complete representation of\nthe subject in the images, which can help the model to make more accurate\npredictions even when some parts of body are missing. We demonstrate the\nefficiency of our method on the benchmark EMOTIC dataset. We report an average\nprecision of 40.39\\% across the 26 emotion categories, which is a 5\\%\nimprovement over previous approaches.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:54:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wang","Zhifeng",""],["Sankaranarayana","Ramesh",""]]}
{"id":"2308.00229","submitter":"Alberto Rodriguez","authors":"Alberto D. Rodriguez, Katherine R. Dearstyne, Jane Cleland-Huang","title":"Prompts Matter: Insights and Strategies for Prompt Engineering in\n  Automated Software Traceability","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 the potential to revolutionize automated\ntraceability by overcoming the challenges faced by previous methods and\nintroducing new possibilities. However, the optimal utilization of LLMs for\nautomated traceability remains unclear. This paper explores the process of\nprompt engineering to extract link predictions from an LLM. We provide detailed\ninsights into our approach for constructing effective prompts, offering our\nlessons learned. Additionally, we propose multiple strategies for leveraging\nLLMs to generate traceability links, improving upon previous zero-shot methods\non the ranking of candidate links after prompt refinement. The primary\nobjective of this paper is to inspire and assist future researchers and\nengineers by highlighting the process of constructing traceability prompts to\neffectively harness LLMs for advancing automatic traceability.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:56:22 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Rodriguez","Alberto D.",""],["Dearstyne","Katherine R.",""],["Cleland-Huang","Jane",""]]}
{"id":"2308.00230","submitter":"Guoxing Wang","authors":"Robin van Bijleveld, Eric Laenen, Leonardo Vernazza and Guoxing Wang","title":"Next-to-leading power resummed rapidity distributions near threshold for\n  Drell-Yan and diphoton production","comments":"51 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider Drell-Yan production and QCD-induced diphoton production and\ncompute their rapidity distributions up to next-to-leading power (NLP) in the\nthreshold variable. We give results for rapidity distributions of the Drell-Yan\nprocess up to NNLO accuracy and show that a factorised structure occurs for the\nleading logarithms (LL) at NLP, generalising the result at leading power. For\ndiphoton production, we generalise methods based on kinematical shifts to find\nthe NLO cross section up to NLP for rapidity distributions. From the results\nfor these two processes, we derive resummed cross sections at NLP LL accuracy\nthat are double differential in the threshold variable and the rapidity\nvariable, which generalise results for single differential resummed cross\nsections.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:00:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["van Bijleveld","Robin",""],["Laenen","Eric",""],["Vernazza","Leonardo",""],["Wang","Guoxing",""]]}
{"id":"2308.00231","submitter":"Alexander Amini","authors":"Sadhana Lolla, Iaroslav Elistratov, Alejandro Perez, Elaheh Ahmadi,\n  Daniela Rus, Alexander Amini","title":"Capsa: A Unified Framework for Quantifying Risk in Deep Neural Networks","comments":"Neural Information Processing Systems (NeurIPS) 2022. Workshop on\n  Machine Learning for Autonomous Driving (ML4AD)","journal-ref":"Neural Information Processing Systems (NeurIPS) 2022. Workshop on\n  Machine Learning for Autonomous Driving (ML4AD)","doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The modern pervasiveness of large-scale deep neural networks (NNs) is driven\nby their extraordinary performance on complex problems but is also plagued by\ntheir sudden, unexpected, and often catastrophic failures, particularly on\nchallenging scenarios. Existing algorithms that provide risk-awareness to NNs\nare complex and ad-hoc. Specifically, these methods require significant\nengineering changes, are often developed only for particular settings, and are\nnot easily composable. Here we present capsa, a framework for extending models\nwith risk-awareness. Capsa provides a methodology for quantifying multiple\nforms of risk and composing different algorithms together to quantify different\nrisk metrics in parallel. We validate capsa by implementing state-of-the-art\nuncertainty estimation algorithms within the capsa framework and benchmarking\nthem on complex perception datasets. We demonstrate capsa's ability to easily\ncompose aleatoric uncertainty, epistemic uncertainty, and bias estimation\ntogether in a single procedure, and show how this approach provides a\ncomprehensive awareness of NN risk.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:07:47 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lolla","Sadhana",""],["Elistratov","Iaroslav",""],["Perez","Alejandro",""],["Ahmadi","Elaheh",""],["Rus","Daniela",""],["Amini","Alexander",""]]}
{"id":"2308.00232","submitter":"Eric D. Feigelson","authors":"Eric D. Feigelson, Federica B. Bianco and Rosaria Bonito","title":"An Evenly-Spaced LSST Cadence for Rapidly Variable Stars","comments":"Accepted for publication in Astrophysical Journal Supplements. 11\n  pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Stars exhibit a bewildering variety of rapidly variable behaviors ranging\nfrom explosive magnetic flares to stochastically changing accretion to periodic\npulsations or rotation. The principal Rubin Observatory Legacy Survey of Space\nand Time (LSST) surveys will have cadences too sparse and irregular to capture\nmany of these phenomena. We propose here a LSST micro-survey to observe a\nsingle Galactic field, rich in unobscured stars, in a continuous sequence of 30\nsecond exposures for one long winter night in a single photometric band. The\nresult will be a unique dataset of $\\sim 1$ million regularly spaced stellar\nlight curves (LCs). The LCs will constitute a comprehensive collection of\nlate-type stellar flaring, but also other classes like short-period binary\nsystems and cataclysmic variables, young stellar objects and ultra-short period\nexoplanets. An unknown variety of anomalous Solar System, Galactic and\nextragalactic variables and transients may also be present. A powerful array of\nstatistical procedures can be applied to individual LCs from the long-standing\nfields of time series analysis, signal processing and econometrics. Dozens of\n`features' describing the variability can be extracted and the ensemble of\nlight curves can be subject to advanced machine learning clustering procedures.\nThis will give a unique, authoritative, objective taxonomy of the rapidly\nvariable sky derived from identically cadenced LCs. This micro-survey is best\nperformed early in the Rubin Observatory program, and the results can inform\nthe wider community on the best approaches to variable star identification and\nclassification from the sparse, irregular cadences that dominate the planned\nsurveys.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:12:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Feigelson","Eric D.",""],["Bianco","Federica B.",""],["Bonito","Rosaria",""]]}
{"id":"2308.00233","submitter":"Zhoujian Cao Dr","authors":"Bing Sun and Jiachen An and Zhoujian Cao","title":"Probe the gravitational constant variation via the propagation of\n  gravitational waves","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The gravitational constant variation means the breakdown of the strong\nequivalence principle. As the cornerstone of general relativity, the validity\nof general relativity can be examined by studying the gravitational constant\nvariation. Such variations have the potential to affect both the generation and\npropagation of gravitational waves. In this paper, our focus lies on the effect\nof gravitational constant variation specifically on the propagation of\ngravitational waves. We employ two analytical methods, namely based on the\nFierz-Pauli action and the perturbation of Einstein-Hilbert action around\nMinkowski spacetime, both leading to the the same gravitational wave equation.\nBy solving this equation, we find the effects of gravitational constant\nvariation on gravitational wave propagation. The result is consistent with\nprevious investigations based on Maxwell-like equations for gravitational\nwaves. Notably, we find that small variations in the gravitational constant\nresult in an amplitude correction at the leading order and a phase correction\nat the sub-leading order for gravitational waves. These results provide\nvaluable insights for probing gravitational constant variation and can be\ndirectly applied to gravitational wave data analysis.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:20:00 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sun","Bing",""],["An","Jiachen",""],["Cao","Zhoujian",""]]}
{"id":"2308.00234","submitter":"Yu Zhu","authors":"Yu Zhu, Taikang Chen, Yongchang Li, Lei Qiao, Xiaonan Ma, Tao Hu, Heng\n  Gao, and Wei Ren","title":"Multipiezo effect in altermagnetic V2SeTeO monolayer","comments":"20 pages,9 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":"  Inspired by recent theoretical proposal on the interesting piezomagnetism and\nC-paired valley polarization in V2Se2O monolayer, we predict a stable\nantiferromagnetic Janus monolayer V2SeTeO with altermagnetic configuration\nusing density functional theory calculations. It exhibits a novel multi-piezo\neffect combining piezoelectric, piezovalley and piezomagnetism. Most\ninterestingly, the valley polarization and the net magnetization under strain\nin V2SeTeO exceed these in V2Se2O, along with the additional large\npiezoelectric coefficient of e31 (0.322*10-10 C m-1). The multi-piezo effect\nmakes antiferromagnetic Janus monolayer V2SeTeO a tantalizing material for\npotential applications in nanoelectronics, optoelectronics, spintronics and\nvalleytronics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:26:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhu","Yu",""],["Chen","Taikang",""],["Li","Yongchang",""],["Qiao","Lei",""],["Ma","Xiaonan",""],["Hu","Tao",""],["Gao","Heng",""],["Ren","Wei",""]]}
{"id":"2308.00235","submitter":"Alireza Ramezani","authors":"Eric Sihite, Filip Slezak, Ioannis Mandralis, Adarsh Salagame, Milad\n  Ramezani, Arash Kalantari, Alireza Ramezani, Morteza Gharib","title":"Demonstrating Autonomous 3D Path Planning on a Novel Scalable UGV-UAV\n  Morphing Robot","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":"  Some animals exhibit multi-modal locomotion capability to traverse a wide\nrange of terrains and environments, such as amphibians that can swim and walk\nor birds that can fly and walk. This capability is extremely beneficial for\nexpanding the animal's habitat range and they can choose the most energy\nefficient mode of locomotion in a given environment. The robotic biomimicry of\nthis multi-modal locomotion capability can be very challenging but offer the\nsame advantages. However, the expanded range of locomotion also increases the\ncomplexity of performing localization and path planning. In this work, we\npresent our morphing multi-modal robot, which is capable of ground and aerial\nlocomotion, and the implementation of readily available SLAM and path planning\nsolutions to navigate a complex indoor environment.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:28:38 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sihite","Eric",""],["Slezak","Filip",""],["Mandralis","Ioannis",""],["Salagame","Adarsh",""],["Ramezani","Milad",""],["Kalantari","Arash",""],["Ramezani","Alireza",""],["Gharib","Morteza",""]]}
{"id":"2308.00236","submitter":"Chengxiao Sun","authors":"Chengxiao Sun, Yan Xu, Jialun Pei, Haopeng Fang and He Tang","title":"Partitioned Saliency Ranking with Dense Pyramid Transformers","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, saliency ranking has emerged as a challenging task focusing\non assessing the degree of saliency at instance-level. Being subjective, even\nhumans struggle to identify the precise order of all salient instances.\nPrevious approaches undertake the saliency ranking by directly sorting the rank\nscores of salient instances, which have not explicitly resolved the inherent\nambiguities. To overcome this limitation, we propose the ranking by partition\nparadigm, which segments unordered salient instances into partitions and then\nranks them based on the correlations among these partitions. The ranking by\npartition paradigm alleviates ranking ambiguities in a general sense, as it\nconsistently improves the performance of other saliency ranking models.\nAdditionally, we introduce the Dense Pyramid Transformer (DPT) to enable global\ncross-scale interactions, which significantly enhances feature interactions\nwith reduced computational burden. Extensive experiments demonstrate that our\napproach outperforms all existing methods. The code for our method is available\nat \\url{https://github.com/ssecv/PSR}.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:33:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sun","Chengxiao",""],["Xu","Yan",""],["Pei","Jialun",""],["Fang","Haopeng",""],["Tang","He",""]]}
{"id":"2308.00237","submitter":"Zhiguang Fan","authors":"Zhiguang Fan, Yuedong Yang, Mingyuan Xu, Hongming Chen","title":"EC-Conf: An Ultra-fast Diffusion Model for Molecular Conformation\n  Generation with Equivariant Consistency","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite recent advancement in 3D molecule conformation generation driven by\ndiffusion models, its high computational cost in iterative diffusion/denoising\nprocess limits its application. In this paper, an equivariant consistency model\n(EC-Conf) was proposed as a fast diffusion method for low-energy conformation\ngeneration. In EC-Conf, a modified SE (3)-equivariant transformer model was\ndirectly used to encode the Cartesian molecular conformations and a highly\nefficient consistency diffusion process was carried out to generate molecular\nconformations. It was demonstrated that, with only one sampling step, it can\nalready achieve comparable quality to other diffusion-based models running with\nthousands denoising steps. Its performance can be further improved with a few\nmore sampling iterations. The performance of EC-Conf is evaluated on both\nGEOM-QM9 and GEOM-Drugs sets. Our results demonstrate that the efficiency of\nEC-Conf for learning the distribution of low energy molecular conformation is\nat least two magnitudes higher than current SOTA diffusion models and could\npotentially become a useful tool for conformation generation and sampling.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:35:35 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 07:46:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Fan","Zhiguang",""],["Yang","Yuedong",""],["Xu","Mingyuan",""],["Chen","Hongming",""]]}
{"id":"2308.00238","submitter":"Gangadharan Murugusundaramoorthy","authors":"Gangadharan Murugusundaramoorthy, kaliappan Vijaya, Hijaz Ahmad","title":"Gamma-Bazilevic functions related with generalized telephone numbers","comments":"Analytic functions, starlike functions, convex functions,\n  subordination, Fekete-Szeg\\\"{o} inequality, Poisson distribution series,\n  Borel distribution series Hadamard product","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The purpose of this paper is to consider coefficient estimates in a class of\nfunctions $\\mathfrak{G}_{\\vartheta}^{\\kappa}(\\mathcal{X},\\varkappa)$ consisting\nof analytic functions $f$ normalized by $f(0)=f'(0)-1=0$\\ in the open unit disk\n$\\Delta=\\{ z:z\\in \\mathbb{C}\\quad \\text{and}\\quad \\left\\vert z\\right\\vert <1\\}$\nsubordinating generalized telephone numbers, to derive certain coefficient\nestimates $a_2,a_3$ and Fekete-Szeg\\\"{o} inequality for\n$f\\in\\mathfrak{G}_{\\vartheta}^{\\kappa}(\\mathcal{X},\\varkappa)$. A similar\nresults have been done for the function $ f^{-1} $ and\n$\\log\\dfrac{f(z)}{z}.$Similarly application of our results to certain functions\ndefined by using convolution products with a normalized analytic function is\ngiven, and in particular we state Fekete-Szeg\"{o} inequalities for subclasses\ndescribed through Poisson Borel and Pascal distribution series.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:36:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Murugusundaramoorthy","Gangadharan",""],["Vijaya","kaliappan",""],["Ahmad","Hijaz",""]]}
{"id":"2308.00239","submitter":"Jing Zhao","authors":"Jing Zhao and Qianqian Su","title":"Verifiable Data Sharing Scheme for Dynamic Multi-Owner Setting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  One of scenarios in data-sharing applications is that files are managed by\nmultiple owners, and the list of file owners may change dynamically. However,\nmost existing solutions to this problem rely on trusted third parties and have\ncomplicated signature permission processes, resulting in additional overhead.\nTherefore, we propose a verifiable data-sharing scheme (VDS-DM) that can\nsupport dynamic multi-owner scenarios. We introduce a management entity that\ncombines linear secret-sharing technology, multi-owner signature generation,\nand an aggregation technique to allow multi-owner file sharing. Without the\nhelp of trusted third parties, VDS-DM can update file signatures for\ndynamically changing file owners, which helps save communication overhead.\nMoreover, users independently verify the integrity of files without resorting\nto a third party. We analyse the security of VDS-DM through a security game.\nFinally, we conduct enough simulation experiments and the outcomes of\nexperimental demonstrate the feasibility of VDS-DM.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:41:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhao","Jing",""],["Su","Qianqian",""]]}
{"id":"2308.00240","submitter":"Geyang Guo","authors":"Geyang Guo, Jiarong Yang, Fengyuan Lu, Jiaxin Qin, Tianyi Tang, Wayne\n  Xin Zhao","title":"Towards Effective Ancient Chinese Translation: Dataset, Model, and\n  Evaluation","comments":"Accepted by NLPCC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interpreting ancient Chinese has been the key to comprehending vast Chinese\nliterature, tradition, and civilization. In this paper, we propose Erya for\nancient Chinese translation. From a dataset perspective, we collect, clean, and\nclassify ancient Chinese materials from various sources, forming the most\nextensive ancient Chinese resource to date. From a model perspective, we devise\nErya training method oriented towards ancient Chinese. We design two\njointly-working tasks: disyllabic aligned substitution (DAS) and dual masked\nlanguage model (DMLM). From an evaluation perspective, we build a benchmark to\njudge ancient Chinese translation quality in different scenarios and evaluate\nthe ancient Chinese translation capacities of various existing models. Our\nmodel exhibits remarkable zero-shot performance across five domains, with over\n+12.0 BLEU against GPT-3.5 models and better human evaluation results than\nERNIE Bot. Subsequent fine-tuning further shows the superior transfer\ncapability of Erya model with +6.2 BLEU gain. We release all the\nabove-mentioned resources at https://github.com/RUCAIBox/Erya.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:43:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Guo","Geyang",""],["Yang","Jiarong",""],["Lu","Fengyuan",""],["Qin","Jiaxin",""],["Tang","Tianyi",""],["Zhao","Wayne Xin",""]]}
{"id":"2308.00241","submitter":"Robert Kwapisz","authors":"M. Fan, Roy A. Ready, H. Li, S. Kofford, R. Kwapisz, C. A. Holliman,\n  M. S. Ladabaum, A. N. Gaiser, J. R. Griswold, A. M. Jayich","title":"Laser cooling and trapping of $^{224}$Ra$^+$","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the first laser cooling and trapping of $^{224}$Ra$^+$ ions. This\nwas realized via the first loading of radium into an ion trap with two step\nphotoionization. A robust source for $^{224}$Ra atoms, 3.6 day half-life, was\nrealized with an effusive oven containing $^{228}$Th, 1.9 year half-life, which\ncontinuously generates $^{224}$Ra via its $\\alpha$-decay. We characterized the\nefficacy of this source and found that after depleting built up radium the\nthorium decay provides a continuous source of radium atoms suitable for ion\ntrapping. The vacuum system has been sealed for more than six months and\ncontinues to trap ions on demand. We also report a measurement of the\n$^{224}$Ra $7s^2\\ ^1$S$_0 \\rightarrow 7s7p\\ ^1$P$_1$ transition frequency: 621\n043 830(60) MHz, which is helpful for efficient photoionization. With this\nmeasurement and previous isotope shift measurements we recommend a correction\nto the same transition in $^{226}$Ra: 621 037 830(60) MHz, which is 660 MHz\nfrom the accepted value.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:48:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fan","M.",""],["Ready","Roy A.",""],["Li","H.",""],["Kofford","S.",""],["Kwapisz","R.",""],["Holliman","C. A.",""],["Ladabaum","M. S.",""],["Gaiser","A. N.",""],["Griswold","J. R.",""],["Jayich","A. M.",""]]}
{"id":"2308.00242","submitter":"Fei Ma","authors":"Fei Ma, Thushara D. Abhayapala, Prasanga N. Samarasinghe","title":"Circumvent spherical Bessel function nulls for open sphere microphone\n  arrays with physics informed neural network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open sphere microphone arrays (OSMAs) are simple to design and do not\nintroduce scattering fields, and thus can be advantageous than other arrays for\nimplementing spatial acoustic algorithms under spherical model decomposition.\nHowever, an OSMA suffers from spherical Bessel function nulls which make it\nhard to obtain some sound field coefficients at certain frequencies. This paper\nproposes to assist an OSMA for sound field analysis with physics informed\nneural network (PINN). A PINN models the measurement of an OSMA and predicts\nthe sound field on another sphere whose radius is different from that of the\nOSMA. Thanks to the fact that spherical Bessel function nulls vary with radius,\nthe sound field coefficients which are hard to obtain based on the OSMA\nmeasurement directly can be obtained based on the prediction. Simulations\nconfirm the effectiveness of this approach and compare it with the rigid sphere\napproach.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:50:32 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ma","Fei",""],["Abhayapala","Thushara D.",""],["Samarasinghe","Prasanga N.",""]]}
{"id":"2308.00243","submitter":"Sahar Barmomanesh","authors":"Sahar Barmomanesh and Victor Miranda-Soberanis","title":"Potential Biased Outcomes on Child Welfare and Racial Minorities in New\n  Zealand using Predictive Models: An Initial Review on Mitigation Approaches","comments":"9 pages, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Increasingly, the combination of clinical judgment and predictive risk\nmodelling have been assisting social workers to segregate children at risk of\nmaltreatment and recommend potential interventions of authorities. A critical\nconcern among governments and research communities worldwide is that\nmisinterpretations due to poor modelling techniques will often result in biased\noutcomes for people with certain characteristics (e.g., race, socioeconomic\nstatus). In the New Zealand care and protection system, the over-representation\nof M\\=aori might be incidentally intensified by predictive risk models leading\nto possible cycles of bias towards M\\=aori, ending disadvantaged or\ndiscriminated against, in decision-making policies. Ensuring these models can\nidentify the risk as accurately as possible and do not unintentionally add to\nan over-representation of M\\=aori becomes a crucial matter. In this article we\naddress this concern with the application of predictive risk modelling in the\nNew Zealand care and protection system. We study potential factors that might\nimpact the accuracy and fairness of such statistical models along with possible\napproaches for improvement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:53:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Barmomanesh","Sahar",""],["Miranda-Soberanis","Victor",""]]}
{"id":"2308.00244","submitter":"Hikaru Hoshino","authors":"Hikaru Hoshino, Yosuke Irie, Eiko Furutani","title":"Screening Curve Method for Economic Analysis of Photovoltaic\n  Self-Consumption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The profitability of the household photovoltaic (PV) self-consumption is\nexpected to boost the deployment of PV and battery storage systems. This paper\ndevelops a novel method for economic analysis of PV self-consumption using\nbattery storage based on an extension of the Screening Curve Method (SCM). The\nSCM enables quick and intuitive estimation of the least-cost generation mix for\na target load curve and has been used for generation planning of a bulk power\nsystem. In this paper, we generalize the framework of existing SCM to take into\naccount the intermittent nature of renewable energy sources and apply it to the\nproblem of optimal sizing of PV and battery storage systems for a household.\nNumerical studies are provided to verify the estimation accuracy of the\nproposed SCM and to illustrate its effectiveness in a sensitivity analysis\nowing to the ability to show intuitive plots of cost curves for researchers or\npolicy makers to understand the reasons behind the optimization results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:57:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hoshino","Hikaru",""],["Irie","Yosuke",""],["Furutani","Eiko",""]]}
{"id":"2308.00245","submitter":"Haonan Li","authors":"Haonan Li, Yu Hao, Yizhuo Zhai, Zhiyun Qian","title":"The Hitchhiker's Guide to Program Analysis: A Journey with Large\n  Language Models","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":"  Static analysis is a widely used technique in software engineering for\nidentifying and mitigating bugs. However, a significant hurdle lies in\nachieving a delicate balance between precision and scalability. Large Language\nModels (LLMs) offer a promising alternative, as recent advances demonstrate\nremarkable capabilities in comprehending, generating, and even debugging code.\nYet, the logic of bugs can be complex and require sophisticated reasoning and a\nlarge analysis scope spanning multiple functions. Therefore, at this point,\nLLMs are better used in an assistive role to complement static analysis. In\nthis paper, we take a deep dive into the open space of LLM-assisted static\nanalysis, using use-before-initialization (UBI) bugs as a case study. To this\nend, we develop LLift, a fully automated agent that interfaces with both a\nstatic analysis tool and an LLM. By carefully designing the agent and the\nprompts, we are able to overcome a number of challenges, including bug-specific\nmodeling, the large problem scope, the non-deterministic nature of LLMs, etc.\nTested in a real-world scenario analyzing nearly a thousand potential UBI bugs\nproduced by static analysis, LLift demonstrates an extremely potent capability,\nshowcasing a high precision (50%) and recall rate (100%). It even identified 13\npreviously unknown UBI bugs in the Linux kernel. This research paves the way\nfor new opportunities and methodologies in the use of LLMs for bug discovery in\nextensive, real-world datasets.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:57:43 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Haonan",""],["Hao","Yu",""],["Zhai","Yizhuo",""],["Qian","Zhiyun",""]]}
{"id":"2308.00246","submitter":"Prithila Angkan","authors":"Dustin Pulver, Prithila Angkan, Paul Hungler, and Ali Etemad","title":"EEG-based Cognitive Load Classification using Feature Masked\n  Autoencoding and Emotion Transfer Learning","comments":"This paper has been accepted to the 25th International Conference on\n  Multimodal Interaction (ICMI 2023). 8 pages, 6 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Cognitive load, the amount of mental effort required for task completion,\nplays an important role in performance and decision-making outcomes, making its\nclassification and analysis essential in various sensitive domains. In this\npaper, we present a new solution for the classification of cognitive load using\nelectroencephalogram (EEG). Our model uses a transformer architecture employing\ntransfer learning between emotions and cognitive load. We pre-train our model\nusing self-supervised masked autoencoding on emotion-related EEG datasets and\nuse transfer learning with both frozen weights and fine-tuning to perform\ndownstream cognitive load classification. To evaluate our method, we carry out\na series of experiments utilizing two publicly available EEG-based emotion\ndatasets, namely SEED and SEED-IV, for pre-training, while we use the CL-Drive\ndataset for downstream cognitive load classification. The results of our\nexperiments show that our proposed approach achieves strong results and\noutperforms conventional single-stage fully supervised learning. Moreover, we\nperform detailed ablation and sensitivity studies to evaluate the impact of\ndifferent aspects of our proposed solution. This research contributes to the\ngrowing body of literature in affective computing with a focus on cognitive\nload, and opens up new avenues for future research in the field of cross-domain\ntransfer learning using self-supervised pre-training.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:59:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Pulver","Dustin",""],["Angkan","Prithila",""],["Hungler","Paul",""],["Etemad","Ali",""]]}
{"id":"2308.00247","submitter":"Dan Zhang","authors":"Dan Zhang, Fangfang Zhou, Xiao Yang, Yuan Gu","title":"Unleashing the Power of Self-Supervised Image Denoising: A Comprehensive\n  Review","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The advent of deep learning has brought a revolutionary transformation to\nimage denoising techniques. However, the persistent challenge of acquiring\nnoise-clean pairs for supervised methods in real-world scenarios remains\nformidable, necessitating the exploration of more practical self-supervised\nimage denoising. This paper focuses on self-supervised image denoising methods\nthat offer effective solutions to address this challenge. Our comprehensive\nreview thoroughly analyzes the latest advancements in self-supervised image\ndenoising approaches, categorizing them into three distinct classes: General\nmethods, Blind Spot Network (BSN)-based methods, and Transformer-based methods.\nFor each class, we provide a concise theoretical analysis along with their\npractical applications. To assess the effectiveness of these methods, we\npresent both quantitative and qualitative experimental results on various\ndatasets, utilizing classical algorithms as benchmarks. Additionally, we\ncritically discuss the current limitations of these methods and propose\npromising directions for future research. By offering a detailed overview of\nrecent developments in self-supervised image denoising, this review serves as\nan invaluable resource for researchers and practitioners in the field,\nfacilitating a deeper understanding of this emerging domain and inspiring\nfurther advancements.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:00:36 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 04:30:16 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 10:12:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Dan",""],["Zhou","Fangfang",""],["Yang","Xiao",""],["Gu","Yuan",""]]}
{"id":"2308.00248","submitter":"Longjun Xiang","authors":"Miaomiao Wei, Longjun Xiang, Fuming Xu, Lei Zhang, Gaomin Tang, Jian\n  Wang","title":"Gapless superconducting state and mirage gap in altermagnets","comments":"four figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interplay between Rashba spin orbit interaction (SOI) and superconductivity\ncan give rise to many interesting effects where an in-plane magnetic field is\nessential. For instance, for a 2D system with strong Rashba SOI proximity\ncoupled to a s-wave superconductor, the in-plane magnetic field can drive the\nsystem into a gapless superconducting state while it can also induce a mirage\ngap at finite energies for an Ising superconductor while keeping the main gap\nat Fermi level intact. We show that when a s-wave superconductor proximitized\nto an altermagnet in the absence of SOI and in-plane magnetic field, the\ngapless superconducting state with mirage gap can emerge showing d-wave\nsignature, due to the anisotropic spin splitting of the altermagnet. When the\nRashba SOI is added, the system can turn into a gapped superconductor w ith\nmirage gap. Pairing mechanism and transport properties of mirage gap are\ninvestigated. Our result suggests that altermagnet is an ideal platform for\nstudying gapless superconducting state and mirage gap.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:06:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wei","Miaomiao",""],["Xiang","Longjun",""],["Xu","Fuming",""],["Zhang","Lei",""],["Tang","Gaomin",""],["Wang","Jian",""]]}
{"id":"2308.00249","submitter":"Jianda Wu","authors":"Xiao Wang, Konrad Puzniak, Karin Schmalzl, C. Balz, M. Matsuda, Akira\n  Okutani, M. Hagiwara, Jie Ma, Jianda Wu and Bella Lake","title":"Spin dynamics of the $E_8$ particles","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we report on inelastic neutron scattering measurements on a\nquasi-1D antiferromagnet BaCo$_2$V$_2$O$_8$ under a transverse magnetic field\napplied along the (0,1,0) direction. Combining results of inelastic neutron\nscattering experiments, analytical analysis, and numerical simulations, we\nprecisely studied the $E_8$ excitations appearing in the whole Brillouin zone\nat $B_c^{1D}\\approx 4.7$ T. The energy scan at $Q=(0,0,2)$ reveals a match\nbetween the data and the theoretical prediction of energies of multiple $E_8$\nexcitations. Furthermore, dispersions of the lightest three $E_8$ particles\nhave been clearly observed, confirming the existence of the $E_8$ particles in\nBaCo$_2$V$_2$O$_8$. Our results lay down a concrete ground to systematically\nstudy the physics of the exotic $E_8$ particles.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:09:16 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wang","Xiao",""],["Puzniak","Konrad",""],["Schmalzl","Karin",""],["Balz","C.",""],["Matsuda","M.",""],["Okutani","Akira",""],["Hagiwara","M.",""],["Ma","Jie",""],["Wu","Jianda",""],["Lake","Bella",""]]}
{"id":"2308.00250","submitter":"Ali Shokri","authors":"Ali Shokri, Alexandre Perez, Souma Chowdhury, Chen Zeng, Gerald\n  Kaloor, Ion Matei, Peter-Patel Schneider, Akshith Gunasekaran, Shantanu Rane","title":"CONSTRUCT: A Program Synthesis Approach for Reconstructing Control\n  Algorithms from Embedded System Binaries in Cyber-Physical Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a novel approach to automatically synthesize a mathematical\nrepresentation of the control algorithms implemented in industrial\ncyber-physical systems (CPS), given the embedded system binary. The output\nmodel can be used by subject matter experts to assess the system's compliance\nwith the expected behavior and for a variety of forensic applications. Our\napproach first performs static analysis on decompiled binary files of the\ncontroller to create a sketch of the mathematical representation. Then, we\nperform an evolutionary-based search to find the correct semantic for the\ncreated representation, i.e., the control law. We demonstrate the effectiveness\nof the introduced approach in practice via three case studies conducted on two\nreal-life industrial CPS.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:10:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shokri","Ali",""],["Perez","Alexandre",""],["Chowdhury","Souma",""],["Zeng","Chen",""],["Kaloor","Gerald",""],["Matei","Ion",""],["Schneider","Peter-Patel",""],["Gunasekaran","Akshith",""],["Rane","Shantanu",""]]}
{"id":"2308.00251","submitter":"Jin Zhu","authors":"Junxian Zhu, Jin Zhu, Borui Tang, Xuanyu Chen, Hongmei Lin, Xueqin\n  Wang","title":"Best-Subset Selection in Generalized Linear Models: A Fast and\n  Consistent Algorithm via Splicing Technique","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.CO stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In high-dimensional generalized linear models, it is crucial to identify a\nsparse model that adequately accounts for response variation. Although the best\nsubset section has been widely regarded as the Holy Grail of problems of this\ntype, achieving either computational efficiency or statistical guarantees is\nchallenging. In this article, we intend to surmount this obstacle by utilizing\na fast algorithm to select the best subset with high certainty. We proposed and\nillustrated an algorithm for best subset recovery in regularity conditions.\nUnder mild conditions, the computational complexity of our algorithm scales\npolynomially with sample size and dimension. In addition to demonstrating the\nstatistical properties of our method, extensive numerical experiments reveal\nthat it outperforms existing methods for variable selection and coefficient\nestimation. The runtime analysis shows that our implementation achieves\napproximately a fourfold speedup compared to popular variable selection\ntoolkits like glmnet and ncvreg.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:11:31 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhu","Junxian",""],["Zhu","Jin",""],["Tang","Borui",""],["Chen","Xuanyu",""],["Lin","Hongmei",""],["Wang","Xueqin",""]]}
{"id":"2308.00252","submitter":"Kaiqian Qu","authors":"Kaiqian Qu, Shuaishuai Guo, Jia Ye and Nasir Saeed","title":"Near-Field Integrated Sensing and Communications: Unlocking Potentials\n  and Shaping the Future","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The sixth generation (6G) communication networks are featured by integrated\nsensing and communications (ISAC), revolutionizing base stations (BSs) and\nterminals. Additionally, in the unfolding 6G landscape, a pivotal physical\nlayer technology, the Extremely Large-Scale Antenna Array (ELAA), assumes\ncenter stage. With its expansive coverage of the near-field region, ELAA's\nelectromagnetic (EM) waves manifest captivating spherical wave properties.\nEmbracing these distinctive features, communication and sensing capabilities\nscale unprecedented heights. Therefore, we systematically explore the\nprodigious potential of near-field ISAC technology. In particular, the\nfundamental principles of near-field are presented to unearth its benefits in\nboth communication and sensing. Then, we delve into the technologies\nunderpinning near-field communication and sensing, unraveling possibilities\ndiscussed in recent works. We then investigated the advantages of near-field\nISAC through rigorous case simulations, showcasing the benefits of near-field\nISAC and reinforcing its stature as a transformative paradigm. As we conclude,\nwe confront the open frontiers and chart the future directions for near-field\nISAC.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:19:36 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 10:20:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Qu","Kaiqian",""],["Guo","Shuaishuai",""],["Ye","Jia",""],["Saeed","Nasir",""]]}
{"id":"2308.00253","submitter":"Kaiqian Qu","authors":"Kaiqian Qu, Jia Ye, Xuran Li and Shuaishuai Guo","title":"Privacy and Security in Ubiquitous Integrated Sensing and Communication:\n  Threats, Challenges and Future Directions","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Integrated sensing and communication (ISAC) technology is one of the\nfeaturing technologies of the next-generation communication systems. When\nsensing capability becomes ubiquitous, more information can be collected, which\ncan facilitate many applications in intelligent transportation, unmanned aerial\nvehicle (UAV) surveillance and healthcare. However, it also faces many\ninformation privacy leakage and security issues. This article highlights the\npotential threats to privacy and security and the technical challenges to\nrealizing private and secure ISAC. Three promising combating solutions\nincluding artificial intelligence (AI)-enabled schemes, friendly jamming and\nreconfigurable intelligent surface (RIS)-assisted design are provided to\nmaintain user privacy and ensure information security. Case studies demonstrate\ntheir effectiveness.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:21:30 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 10:22:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Qu","Kaiqian",""],["Ye","Jia",""],["Li","Xuran",""],["Guo","Shuaishuai",""]]}
{"id":"2308.00254","submitter":"Hao Hu","authors":"Zirui Peng, Eren Metin El\\c{c}i, Youjin Deng, Hao Hu","title":"Sweeny dynamics for the random-cluster model with small $Q$","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Sweeny algorithm for the $Q$-state random-cluster model in two dimensions\nis shown to exhibit a rich mixture of critical dynamical scaling behaviors. As\n$Q$ decreases, the so-called critical speeding-up for non-local quantities\nbecomes more and more pronounced. However, for some quantity of specific local\npattern -- e.g., the number of half faces on the square lattice, we observe\nthat, as $Q \\to 0$, the integrated autocorrelation time $\\tau$ diverges as\n$Q^{-\\zeta}$, with $\\zeta \\simeq 1/2$, leading to the non-ergodicity of the\nSweeny method for $Q \\to 0$. Such $Q$-dependent critical slowing-down,\nattributed to the peculiar form of the critical bond weight $v=\\sqrt{Q}$, can\nbe eliminated by a combination of the Sweeny and the Kawasaki algorithm.\nMoreover, by classifying the occupied bonds into bridge bonds and backbone\nbonds, and the empty bonds into internal-perimeter bonds and external-perimeter\nbonds, one can formulate an improved version of the Sweeny-Kawasaki method such\nthat the autocorrelation time for any quantity is of order $O(1)$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:34:41 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Peng","Zirui",""],["El\u00e7i","Eren Metin",""],["Deng","Youjin",""],["Hu","Hao",""]]}
{"id":"2308.00255","submitter":"Guanyu Xu","authors":"Guanyu Xu, Jiawei Hao, Li Shen, Han Hu, Yong Luo, Hui Lin, Jialie Shen","title":"LGViT: Dynamic Early Exiting for Accelerating Vision Transformer","comments":"ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3611762","report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the efficient deployment and acceleration of powerful vision\ntransformers (ViTs) on resource-limited edge devices for providing multimedia\nservices have become attractive tasks. Although early exiting is a feasible\nsolution for accelerating inference, most works focus on convolutional neural\nnetworks (CNNs) and transformer models in natural language processing\n(NLP).Moreover, the direct application of early exiting methods to ViTs may\nresult in substantial performance degradation. To tackle this challenge, we\nsystematically investigate the efficacy of early exiting in ViTs and point out\nthat the insufficient feature representations in shallow internal classifiers\nand the limited ability to capture target semantic information in deep internal\nclassifiers restrict the performance of these methods. We then propose an early\nexiting framework for general ViTs termed LGViT, which incorporates\nheterogeneous exiting heads, namely, local perception head and global\naggregation head, to achieve an efficiency-accuracy trade-off. In particular,\nwe develop a novel two-stage training scheme, including end-to-end training and\nself-distillation with the backbone frozen to generate early exiting ViTs,\nwhich facilitates the fusion of global and local information extracted by the\ntwo types of heads. We conduct extensive experiments using three popular ViT\nbackbones on three vision datasets. Results demonstrate that our LGViT can\nachieve competitive performance with approximately 1.8 $\\times$ speed-up.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:35:32 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xu","Guanyu",""],["Hao","Jiawei",""],["Shen","Li",""],["Hu","Han",""],["Luo","Yong",""],["Lin","Hui",""],["Shen","Jialie",""]]}
{"id":"2308.00256","submitter":"Udaykrishna Thattarampilly","authors":"Ido Ben-Dayan, Udaykrishna Thattarampilly","title":"Requiem to \"Proof of Inflation\" or Sourced Fluctuations in a\n  Non-Singular Bounce","comments":"We have added more references that are relevant to our discussion in\n  the new version","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ph hep-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Popular wisdom suggests that measuring the tensor to scalar ratio $r$ on CMB\nscales is a \"proof of inflation\" since one generic prediction is a\nscale-invariant tensor spectrum while alternatives predict $r$ that is many\norders of magnitude below the sensitivity of future experiments. A bouncing\nUniverse with sourced fluctuations allows for nearly scale-invariant spectra of\nboth scalar and tensor perturbations challenging this point of view. Past works\nhave analyzed the model until the bounce, under the assumption that the bounce\nwill not change the final predictions. In this work, we discard this\nassumption. We explicitly follow the evolution of the Universe and fluctuations\nacross the bounce until reheating. The evolution is stable, and the existence\nof the sourced fluctuations does not destroy the bounce. The bounce enhances\nthe scalar spectrum while leaving the tensor spectrum unchanged. The\nenhancement depends on the duration of the bounce - a shorter bounce implies a\nlarger enhancement. The model matches current observations and predicts any\nviable tensor-to-scalar ratio $r\\lesssim 10^{-2}$, which may be observed in\nupcoming CMB experiments. Hence, a measurement of $r$ will no longer be a\n\"proof of inflation'', and a Sourced Bounce is a viable paradigm with distinct\npredictions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:36:26 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 14:17:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ben-Dayan","Ido",""],["Thattarampilly","Udaykrishna",""]]}
{"id":"2308.00257","submitter":"Therese Joseph","authors":"Therese Joseph, Tobias Fischer, Michael Milford","title":"Trajectory Tracking via Multiscale Continuous Attractor Networks","comments":"8 Pages, 8 Figures, accepted at IEEE/RSJ International Conference on\n  Intelligent Robots and Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Animals and insects showcase remarkably robust and adept navigational\nabilities, up to literally circumnavigating the globe. Primary progress in\nrobotics inspired by these natural systems has occurred in two areas: highly\ntheoretical computational neuroscience models, and handcrafted systems like\nRatSLAM and NeuroSLAM. In this research, we present work bridging the gap\nbetween the two, in the form of Multiscale Continuous Attractor Networks\n(MCAN), that combine the multiscale parallel spatial neural networks of the\nprevious theoretical models with the real-world robustness of the\nrobot-targeted systems, to enable trajectory tracking over large velocity\nranges. To overcome the limitations of the reliance of previous systems on\nhand-tuned parameters, we present a genetic algorithm-based approach for\nautomated tuning of these networks, substantially improving their usability. To\nprovide challenging navigational scale ranges, we open source a flexible\ncity-scale navigation simulator that adapts to any street network, enabling\nhigh throughput experimentation. In extensive experiments using the city-scale\nnavigation environment and Kitti, we show that the system is capable of stable\ndead reckoning over a wide range of velocities and environmental scales, where\na single-scale approach fails.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:40:11 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Joseph","Therese",""],["Fischer","Tobias",""],["Milford","Michael",""]]}
{"id":"2308.00258","submitter":"Zihao Zhao","authors":"Zihao Zhao, Yuzhu Mao, Zhenpeng Shi, Yang Liu, Tian Lan, Wenbo Ding,\n  and Xiao-Ping Zhang","title":"AQUILA: Communication Efficient Federated Learning with Adaptive\n  Quantization of Lazily-Aggregated Gradients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The widespread adoption of Federated Learning (FL), a privacy-preserving\ndistributed learning methodology, has been impeded by the challenge of high\ncommunication overheads, typically arising from the transmission of large-scale\nmodels. Existing adaptive quantization methods, designed to mitigate these\noverheads, operate under the impractical assumption of uniform device\nparticipation in every training round. Additionally, these methods are limited\nin their adaptability due to the necessity of manual quantization level\nselection and often overlook biases inherent in local devices' data, thereby\naffecting the robustness of the global model. In response, this paper\nintroduces AQUILA (adaptive quantization of lazily-aggregated gradients), a\nnovel adaptive framework devised to effectively handle these issues, enhancing\nthe efficiency and robustness of FL. AQUILA integrates a sophisticated device\nselection method that prioritizes the quality and usefulness of device updates.\nUtilizing the exact global model stored by devices, it enables a more precise\ndevice selection criterion, reduces model deviation, and limits the need for\nhyperparameter adjustments. Furthermore, AQUILA presents an innovative\nquantization criterion, optimized to improve communication efficiency while\nassuring model convergence. Our experiments demonstrate that AQUILA\nsignificantly decreases communication costs compared to existing methods, while\nmaintaining comparable model performance across diverse non-homogeneous FL\nsettings, such as Non-IID data and heterogeneous model architectures.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:41:47 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhao","Zihao",""],["Mao","Yuzhu",""],["Shi","Zhenpeng",""],["Liu","Yang",""],["Lan","Tian",""],["Ding","Wenbo",""],["Zhang","Xiao-Ping",""]]}
{"id":"2308.00259","submitter":"Jiawei Xu","authors":"Jiawei Xu, Diego S D'antonio, Dominic J Ammirato, David Salda\\~na","title":"SBlimp: Design, Model, and Translational Motion Control for a\n  Swing-Blimp","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present an aerial vehicle composed of a custom quadrotor with tilted\nrotors and a helium balloon, called SBlimp. We propose a novel control strategy\nthat takes advantage of the natural stable attitude of the blimp to control\ntranslational motion. Different from cascade controllers in the literature that\ncontrols attitude to achieve desired translational motion, our approach\ndirectly controls the linear velocity regardless of the heading orientation of\nthe vehicle. As a result, the vehicle swings during the translational motion.\nWe provide a planar analysis of the dynamic model, demonstrating stability for\nour controller. Our design is evaluated in numerical simulations with different\nphysical factors and validated with experiments using a real-world prototype,\nshowing that the SBlimp is able to achieve stable translation regardless of its\norientation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:41:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xu","Jiawei",""],["D'antonio","Diego S",""],["Ammirato","Dominic J",""],["Salda\u00f1a","David",""]]}
{"id":"2308.00260","submitter":"Snehinh Sen Mr.","authors":"Snehinh Sen","title":"Commuting Probability of Finite Groups (Extended)","comments":"18 pages, expository, extended version of an article which appeared\n  in Resonance, Indian Academy of Science","journal-ref":"Reson 28, 597-612 (2023)","doi":"10.1007/s12045-023-1585-5","report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The target of this article is to discuss the concept of \\textit{commuting\nprobability} of finite groups which, in short, is a probabilistic measure of\nhow abelian our group is. We shall compute the value of commuting probability\nfor many special classes of non-abelian groups and also establish some local\nand global bounds. We will conclude with a few topics for further reading.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:44:32 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sen","Snehinh",""]]}
{"id":"2308.00261","submitter":"Yuan Liu","authors":"Yuan Liu, Songyang Zhang, Jiacheng Chen, Zhaohui Yu, Kai Chen, Dahua\n  Lin","title":"Improving Pixel-based MIM by Reducing Wasted Modeling Capability","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There has been significant progress in Masked Image Modeling (MIM). Existing\nMIM methods can be broadly categorized into two groups based on the\nreconstruction target: pixel-based and tokenizer-based approaches. The former\noffers a simpler pipeline and lower computational cost, but it is known to be\nbiased toward high-frequency details. In this paper, we provide a set of\nempirical studies to confirm this limitation of pixel-based MIM and propose a\nnew method that explicitly utilizes low-level features from shallow layers to\naid pixel reconstruction. By incorporating this design into our base method,\nMAE, we reduce the wasted modeling capability of pixel-based MIM, improving its\nconvergence and achieving non-trivial improvements across various downstream\ntasks. To the best of our knowledge, we are the first to systematically\ninvestigate multi-level feature fusion for isotropic architectures like the\nstandard Vision Transformer (ViT). Notably, when applied to a smaller model\n(e.g., ViT-S), our method yields significant performance gains, such as 1.2\\%\non fine-tuning, 2.8\\% on linear probing, and 2.6\\% on semantic segmentation.\nCode and models are available at https://github.com/open-mmlab/mmpretrain.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:44:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Liu","Yuan",""],["Zhang","Songyang",""],["Chen","Jiacheng",""],["Yu","Zhaohui",""],["Chen","Kai",""],["Lin","Dahua",""]]}
{"id":"2308.00262","submitter":"Xuan Bac Nguyen","authors":"Xuan-Bac Nguyen, Xudong Liu, Xin Li, Khoa Luu","title":"The Algonauts Project 2023 Challenge: UARK-UAlbany Team Solution","comments":"The Algonauts Project 2023 Challenge","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work presents our solutions to the Algonauts Project 2023 Challenge. The\nprimary objective of the challenge revolves around employing computational\nmodels to anticipate brain responses captured during participants' observation\nof intricate natural visual scenes. The goal is to predict brain responses\nacross the entire visual brain, as it is the region where the most reliable\nresponses to images have been observed. We constructed an image-based brain\nencoder through a two-step training process to tackle this challenge.\nInitially, we created a pretrained encoder using data from all subjects. Next,\nwe proceeded to fine-tune individual subjects. Each step employed different\ntraining strategies, such as different loss functions and objectives, to\nintroduce diversity. Ultimately, our solution constitutes an ensemble of\nmultiple unique encoders. The code is available at\nhttps://github.com/uark-cviu/Algonauts2023\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:46:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Nguyen","Xuan-Bac",""],["Liu","Xudong",""],["Li","Xin",""],["Luu","Khoa",""]]}
{"id":"2308.00263","submitter":"Tom\\`as Ortega","authors":"Tomas Ortega, Hamid Jafarkhani","title":"Asynchronous Federated Learning with Bidirectional Quantized\n  Communications and Buffered Aggregation","comments":"Accepted at the 2023 ICML Workshop of Federated Learning and\n  Analytics in Practice","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Asynchronous Federated Learning with Buffered Aggregation (FedBuff) is a\nstate-of-the-art algorithm known for its efficiency and high scalability.\nHowever, it has a high communication cost, which has not been examined with\nquantized communications. To tackle this problem, we present a new algorithm\n(QAFeL), with a quantization scheme that establishes a shared \"hidden\" state\nbetween the server and clients to avoid the error propagation caused by direct\nquantization. This approach allows for high precision while significantly\nreducing the data transmitted during client-server interactions. We provide\ntheoretical convergence guarantees for QAFeL and corroborate our analysis with\nexperiments on a standard benchmark.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:50:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ortega","Tomas",""],["Jafarkhani","Hamid",""]]}
{"id":"2308.00264","submitter":"Ziwei Gong","authors":"Zehui Wu, Ziwei Gong, Jaywon Koo, Julia Hirschberg","title":"Multi-Modality Multi-Loss Fusion Network","comments":"First two authors contributed equally to the paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we investigate the optimal selection and fusion of features\nacross multiple modalities and combine these in a neural network to improve\nemotion detection. We compare different fusion methods and examine the impact\nof multi-loss training within the multi-modality fusion network, identifying\nuseful findings relating to subnet performance. Our best model achieves\nstate-of-the-art performance for three datasets (CMU-MOSI, CMU-MOSEI and\nCH-SIMS), and outperforms the other methods in most metrics. We have found that\ntraining on multimodal features improves single modality testing and designing\nfusion methods based on dataset annotation schema enhances model performance.\nThese results suggest a roadmap towards an optimized feature selection and\nfusion approach for enhancing emotion detection in neural networks.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:54:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wu","Zehui",""],["Gong","Ziwei",""],["Koo","Jaywon",""],["Hirschberg","Julia",""]]}
{"id":"2308.00265","submitter":"Zhenyuan Zhang","authors":"Zhenyuan Zhang, Zhenbo Song, Kaihao Zhang, Wenhan Luo, Zhaoxin Fan,\n  Jianfeng Lu","title":"Benchmarking Ultra-High-Definition Image Reflection Removal","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 based methods have achieved significant success in the task of\nsingle image reflection removal (SIRR). However, the majority of these methods\nare focused on High-Definition/Standard-Definition (HD/SD) images, while\nignoring higher resolution images such as Ultra-High-Definition (UHD) images.\nWith the increasing prevalence of UHD images captured by modern devices, in\nthis paper, we aim to address the problem of UHD SIRR. Specifically, we first\nsynthesize two large-scale UHD datasets, UHDRR4K and UHDRR8K. The UHDRR4K\ndataset consists of $2,999$ and $168$ quadruplets of images for training and\ntesting respectively, and the UHDRR8K dataset contains $1,014$ and $105$\nquadruplets. To the best of our knowledge, these two datasets are the first\nlargest-scale UHD datasets for SIRR. Then, we conduct a comprehensive\nevaluation of six state-of-the-art SIRR methods using the proposed datasets.\nBased on the results, we provide detailed discussions regarding the strengths\nand limitations of these methods when applied to UHD images. Finally, we\npresent a transformer-based architecture named RRFormer for reflection removal.\nRRFormer comprises three modules, namely the Prepossessing Embedding Module,\nSelf-attention Feature Extraction Module, and Multi-scale Spatial Feature\nExtraction Module. These modules extract hypercolumn features, global and\npartial attention features, and multi-scale spatial features, respectively. To\nensure effective training, we utilize three terms in our loss function: pixel\nloss, feature loss, and adversarial loss. We demonstrate through experimental\nresults that RRFormer achieves state-of-the-art performance on both the non-UHD\ndataset and our proposed UHDRR datasets. The code and datasets are publicly\navailable at\nhttps://github.com/Liar-zzy/Benchmarking-Ultra-High-Definition-Single-Image-Reflection-Removal.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:56:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Zhenyuan",""],["Song","Zhenbo",""],["Zhang","Kaihao",""],["Luo","Wenhan",""],["Fan","Zhaoxin",""],["Lu","Jianfeng",""]]}
{"id":"2308.00266","submitter":"Tamunonye Cheetham-West","authors":"Tamunonye Cheetham-West","title":"Profinite rigidity and hyperbolic four-punctured sphere bundles over the\n  circle","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that hyperbolic four-punctured $S^2-$bundles over $S^1$ are\ndistinguished by the finite quotients of their fundamental groups among all\n3-manifold groups. To do this, we upgrade a result of Liu to show that the\ntopological type of a fiber is detected by the profinite completion of the\nfundamental group of a fibered 3-manifold.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:00:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cheetham-West","Tamunonye",""]]}
{"id":"2308.00267","submitter":"Jin Saito","authors":"Jin Saito and Tsutomu Kobayashi","title":"Black hole perturbations in spatially covariant gravity with just two\n  tensorial degrees of freedom","comments":"15pages, 4figures,","journal-ref":null,"doi":null,"report-no":"RUP-23-14","categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study linear perturbations around a static and spherically symmetric black\nhole solution in spatially covariant gravity with just two tensorial degrees of\nfreedom. In this theory, gravity modification is characterized by a single\ntime-dependent function that appears in the coefficient of $K^2$ in the action,\nwhere $K$ is the trace of the extrinsic curvature. The background black hole\nsolution is given by the Schwarzschild solution foliated by the maximal slices\nand has a universal horizon at which the lapse function vanishes. We show that\nthe quadratic action for the odd-parity perturbations is identical to that in\ngeneral relativity upon performing an appropriate coordinate transformation.\nThis in particular implies that the odd-parity perturbations propagate at the\nspeed of light, with the inner boundary being the usual event horizon. We also\nderive the quadratic action for even-parity perturbations. In the even-parity\nsector, one of the two tensorial degrees of freedom is mixed with an\ninstantaneous scalar mode, rendering the system distinct from that in general\nrelativity. We find that monopole and dipole perturbations, which are composed\nsolely of the instantaneous scalar mode, have no solutions regular both at the\nuniversal horizon and infinity (except for the trivial one corresponding to the\nconstant shift of the mass parameter). We also consider stationary\nperturbations with higher multipoles. By carefully treating the locations of\nthe inner boundary, we show that also in this case there are no solutions\nregular both at the inner boundary and infinity. Thus, the black hole solution\nwe consider is shown to be perturbatively unique.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:00:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Saito","Jin",""],["Kobayashi","Tsutomu",""]]}
{"id":"2308.00268","submitter":"Shiraz Khan","authors":"Shiraz Khan, Yi-Chieh Sun, and Inseok Hwang","title":"Distributed Gaussian Mixture PHD Filtering under Communication\n  Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Gaussian Mixture Probability Hypothesis Density (GM-PHD) filter is an\nalmost exact closed-form approximation to the Bayes-optimal multi-target\ntracking algorithm. Due to its optimality guarantees and ease of\nimplementation, it has been studied extensively in the literature. However, the\nchallenges involved in implementing the GM-PHD filter efficiently in a\ndistributed (multi-sensor) setting have received little attention. The existing\nsolutions for distributed PHD filtering either have a high computational and\ncommunication cost, making them infeasible for resource-constrained\napplications, or are unable to guarantee the asymptotic convergence of the\ndistributed PHD algorithm to an optimal solution. In this paper, we develop a\ndistributed GM-PHD filtering recursion that uses a probabilistic communication\nrule to limit the communication bandwidth of the algorithm, while ensuring\nasymptotic optimality of the algorithm. We derive the convergence properties of\nthis recursion, which uses weighted average consensus of Gaussian mixtures\n(GMs) to lower (and asymptotically minimize) the Cauchy-Schwarz divergence\nbetween the sensors' local estimates. In addition, the proposed method is able\nto avoid the issue of false positives, which has previously been noted to\nimpact the filtering performance of distributed multi-target tracking. Through\nnumerical simulations, it is demonstrated that our proposed method is an\neffective solution for distributed multi-target tracking in\nresource-constrained sensor networks.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:01:09 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Khan","Shiraz",""],["Sun","Yi-Chieh",""],["Hwang","Inseok",""]]}
{"id":"2308.00269","submitter":"Daoji Li","authors":"Daoji Li and Jinzhao Yu and Hui Zhao","title":"CoxKnockoff: Controlled Feature Selection for the Cox Model Using\n  Knockoffs","comments":"22 pages including the Supporting Information","journal-ref":"Stat, 12(1), e607 (2023)","doi":"10.1002/sta4.607","report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Although there is a huge literature on feature selection for the Cox model,\nnone of the existing approaches can control the false discovery rate (FDR)\nunless the sample size tends to infinity. In addition, there is no formal power\nanalysis of the knockoffs framework for survival data in the literature. To\naddress those issues, in this paper, we propose a novel controlled feature\nselection approach using knockoffs for the Cox model. We establish that the\nproposed method enjoys the FDR control in finite samples regardless of the\nnumber of covariates. Moreover, under mild regularity conditions, we also show\nthat the power of our method is asymptotically one as sample size tends to\ninfinity. To the best of our knowledge, this is the first formal theoretical\nresult on the power for the knockoffs procedure in the survival setting.\nSimulation studies confirm that our method has appealing finite-sample\nperformance with desired FDR control and high power. We further demonstrate the\nperformance of our method through a real data example.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:04:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Daoji",""],["Yu","Jinzhao",""],["Zhao","Hui",""]]}
{"id":"2308.00270","submitter":"Francisco Frutos-Alfaro Dr. rer. nat.","authors":"Francisco Frutos-Alfaro","title":"An Approximate Kerr-Newman-like Metric Endowed with a Magnetic Dipole\n  and Mass Quadrupole","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Approximate all-terrain spacetimes for astrophysical applications are\npresented. The metrics possess five relativistic multipole moments, namely\nmass, rotation, mass quadrupole, charge, and magnetic dipole moment. All these\nspacetimes approximately satisfy the Einstein-Maxwell field equations. The\nfirst metric is generated by means of the Hoenselaers-Perjes method from the\ngiven relativistic multipoles. The second metric is a perturbation of the\nKerr-Newman metric, which makes it a relevant approximation for astrophysical\ncalculations. The last metric is an extension of the Hartle-Thorne metric that\nis important for obtaining internal models of compact objects perturbatively.\nThese spacetimes are relevant to infer properties of compact objects from\nastrophysical observations. Furthermore, the numerical implementations of these\nmetrics are straightforward, making them versatile for simulating the potential\nastrophysical applications.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:05:33 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 20:58:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Frutos-Alfaro","Francisco",""]]}
{"id":"2308.00271","submitter":"Rei Aso","authors":"Rei Aso, Sayaka Shiota and Hitoshi Kiya","title":"Enhanced Security with Encrypted Vision Transformer in Federated\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning is a learning method for training models over multiple\nparticipants without directly sharing their raw data, and it has been expected\nto be a privacy protection method for training data. In contrast, attack\nmethods have been studied to restore learning data from model information\nshared with clients, so enhanced security against attacks has become an urgent\nproblem. Accordingly, in this article, we propose a novel framework of\nfederated learning on the bases of the embedded structure of the vision\ntransformer by using the model information encrypted with a random sequence. In\nimage classification experiments, we verify the effectiveness of the proposed\nmethod on the CIFAR-10 dataset in terms of classification accuracy and\nrobustness against attacks.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:05:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Aso","Rei",""],["Shiota","Sayaka",""],["Kiya","Hitoshi",""]]}
{"id":"2308.00272","submitter":"Mauricio Godoy Molina","authors":"Mauricio Godoy Molina and Diego Lagos","title":"Lie algebras associated with labeled directed graphs","comments":"11 pages, 13 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.CO math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a construction of 2-step nilpotent Lie algebras using labeled\ndirected simple graphs, which allows us to give a criterion to detect certain\nideals and subalgebras by finding special subgraphs. We prove that if a label\noccurs only once, then reversing the orientation of that edge leads to an\nisomorphic Lie algebra. As a consequence, if every edge is labeled differently,\nthe Lie algebra depends only on the underlying undirected graph. In addition,\nwe construct the labeled directed graphs of all 2-step nilpotent Lie algebras\nof dimension $\\leq6$ and we compute the algebra of strata preserving\nderivations of the Lie algebra associated with the complete bipartite graph\n$K_{m,n}$ with two different labelings.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:08:12 GMT"},{"version":"v2","created":"Sun, 6 Aug 2023 19:17:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Molina","Mauricio Godoy",""],["Lagos","Diego",""]]}
{"id":"2308.00273","submitter":"Samantha Chen","authors":"Samantha Chen, Yusu Wang","title":"Neural approximation of Wasserstein distance via a universal\n  architecture for symmetric and factorwise group invariant functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning distance functions between complex objects, such as the Wasserstein\ndistance to compare point sets, is a common goal in machine learning\napplications. However, functions on such complex objects (e.g., point sets and\ngraphs) are often required to be invariant to a wide variety of group actions\ne.g. permutation or rigid transformation. Therefore, continuous and symmetric\nproduct functions (such as distance functions) on such complex objects must\nalso be invariant to the product of such group actions. We call these functions\nsymmetric and factor-wise group invariant (or SFGI functions in short). In this\npaper, we first present a general neural network architecture for approximating\nSFGI functions. The main contribution of this paper combines this general\nneural network with a sketching idea to develop a specific and efficient neural\nnetwork which can approximate the $p$-th Wasserstein distance between point\nsets. Very importantly, the required model complexity is independent of the\nsizes of input point sets. On the theoretical front, to the best of our\nknowledge, this is the first result showing that there exists a neural network\nwith the capacity to approximate Wasserstein distance with bounded model\ncomplexity. Our work provides an interesting integration of sketching ideas for\ngeometric problems with universal approximation of symmetric functions. On the\nempirical front, we present a range of results showing that our newly proposed\nneural network architecture performs comparatively or better than other models\n(including a SOTA Siamese Autoencoder based approach). In particular, our\nneural network generalizes significantly better and trains much faster than the\nSOTA Siamese AE. Finally, this line of investigation could be useful in\nexploring effective neural network design for solving a broad range of\ngeometric optimization problems (e.g., $k$-means in a metric space).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:11:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chen","Samantha",""],["Wang","Yusu",""]]}
{"id":"2308.00274","submitter":"Shiraz Khan","authors":"Shiraz Khan, Inseok Hwang, and James Goppert","title":"Exploiting Sparsity for Localization of Large-Scale Wireless Sensor\n  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":"  Wireless Sensor Network (WSN) localization refers to the problem of\ndetermining the position of each of the agents in a WSN using noisy measurement\ninformation. In many cases, such as in distance and bearing-based localization,\nthe measurement model is a nonlinear function of the agents' positions, leading\nto pairwise interconnections between the agents. As the optimal solution for\nthe WSN localization problem is known to be computationally expensive in these\ncases, an efficient approximation is desired. In this paper, we show that the\ninherent sparsity in this problem can be exploited to greatly reduce the\ncomputational effort of using an Extended Kalman Filter (EKF) for large-scale\nWSN localization. In the proposed method, which we call the Low-Bandwidth\nExtended Kalman Filter (LB-EKF), the measurement information matrix is\nconverted into a banded matrix by relabeling (permuting the order of) the\nvertices of the graph. Using a combination of theoretical analysis and\nnumerical simulations, it is shown that typical WSN configurations (which can\nbe modeled as random geometric graphs) can be localized in a scalable manner\nusing the proposed LB-EKF approach.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:18:00 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Khan","Shiraz",""],["Hwang","Inseok",""],["Goppert","James",""]]}
{"id":"2308.00275","submitter":"Simon Knapen","authors":"Simon Knapen","title":"Dark Matter scattering in low threshold detectors","comments":"Contribution to the 2023 Electroweak session of the 57th Rencontres\n  de Moriond","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The scattering of sub-GeV dark matter in direct detection experiments happens\nat characteristic wavelengths comparable or larger than the interparticle\nspacing. Collective effects in the target material must therefore be accounted\nfor when calculating the scattering rate. For dark matter-nucleon couplings,\nthis implies matching onto the appropriate phonon effective theory and\ncalculating single and multi-phonon scattering amplitudes. For dark\nmatter-electron couplings, we make use of the energy loss formalism to predict\nthe scattering rate. Combining both techniques allows us to derive a formula\nfor the Migdal effect in crystals, which differs from prior calculations\nperformed in atomic systems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:23:57 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Knapen","Simon",""]]}
{"id":"2308.00276","submitter":"Martin Obligado","authors":"N. Mazellier, M. Obligado","title":"Aerodynamics of the square-back Ahmed body under rainfall conditions","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 report an experimental investigation about the aerodynamics of a\nsimplified road vehicle, the so-called square-back Ahmed body, under rainfall\nconditions. A particular emphasis is put on the evolution of the body base\npressure distribution with respect to the operating conditions. It is found\nthat rainfall significantly damps both mean base pressure drag and wake\ndynamics in comparison to dry conditions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:26:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mazellier","N.",""],["Obligado","M.",""]]}
{"id":"2308.00277","submitter":"Marton Kalman Lajer","authors":"M\\'arton K. L\\'ajer and Robert M. Konik","title":"Krylov Spaces for Truncated Spectrum Methodologies","comments":"33 pages, 21 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose herein an extension of truncated spectrum methodologies (TSMs), a\nnon-perturbative numerical approach able to elucidate the low energy properties\nof quantum field theories. TSMs, in their various flavors, involve a division\nof a computational Hilbert space, $\\mathcal{H}$, into two parts, one part,\n$\\mathcal{H}_1$ that is `kept' for the numerical computations, and one part,\n$\\mathcal{H}_2$, that is discarded or `truncated'. Even though $\\mathcal{H}_2$\nis discarded, TSMs will often try to incorporate the effects of $\\mathcal{H}_2$\nin some effective way. In these terms, we propose to keep the dimension of\n$\\mathcal{H}_1$ small. We pair this choice of $\\mathcal{H}_1$ with a Krylov\nsubspace iterative approach able to take into account the effects of\n$\\mathcal{H}_2$. This iterative approach can be taken to arbitrarily high order\nand so offers the ability to compute quantities to arbitrary precision. In many\ncases it also offers the advantage of not needing an explicit UV cutoff. To\ncompute the matrix elements that arise in the Krylov iterations, we employ a\nFeynman diagrammatic representation that is then evaluated with Monte Carlo\ntechniques. Each order of the Krylov iteration is variational and is guaranteed\nto improve upon the previous iteration. The first Krylov iteration is akin to\nthe NLO approach of Elias-Mir\\'o et al. \\cite{Elias-Miro:2017tup}. To\ndemonstrate this approach, we focus on the $1+1d$ dimensional $\\phi^4$ model\nand compute the bulk energy and mass gaps in both the $\\mathbb{Z}_2$-broken and\nunbroken sectors. We estimate the critical $\\phi^4$ coupling in the broken\nphase to be $g_c=0.2645\\pm0.002$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:32:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["L\u00e1jer","M\u00e1rton K.",""],["Konik","Robert M.",""]]}
{"id":"2308.00278","submitter":"Hyeon Jeon","authors":"Hyeon Jeon, Yun-Hsin Kuo, Micha\\\"el Aupetit, Kwan-Liu Ma, and Jinwook\n  Seo","title":"Classes are not Clusters: Improving Label-based Evaluation of\n  Dimensionality Reduction","comments":"IEEE Transactions on Visualization and Computer Graphics (TVCG)\n  (Proc. IEEE VIS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A common way to evaluate the reliability of dimensionality reduction (DR)\nembeddings is to quantify how well labeled classes form compact, mutually\nseparated clusters in the embeddings. This approach is based on the assumption\nthat the classes stay as clear clusters in the original high-dimensional space.\nHowever, in reality, this assumption can be violated; a single class can be\nfragmented into multiple separated clusters, and multiple classes can be merged\ninto a single cluster. We thus cannot always assure the credibility of the\nevaluation using class labels. In this paper, we introduce two novel quality\nmeasures -- Label-Trustworthiness and Label-Continuity (Label-T&C) -- advancing\nthe process of DR evaluation based on class labels. Instead of assuming that\nclasses are well-clustered in the original space, Label-T&C work by (1)\nestimating the extent to which classes form clusters in the original and\nembedded spaces and (2) evaluating the difference between the two. A\nquantitative evaluation showed that Label-T&C outperform widely used DR\nevaluation measures (e.g., Trustworthiness and Continuity, Kullback-Leibler\ndivergence) in terms of the accuracy in assessing how well DR embeddings\npreserve the cluster structure, and are also scalable. Moreover, we present\ncase studies demonstrating that Label-T&C can be successfully used for\nrevealing the intrinsic characteristics of DR techniques and their\nhyperparameters.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:33:16 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 04:35:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jeon","Hyeon",""],["Kuo","Yun-Hsin",""],["Aupetit","Micha\u00ebl",""],["Ma","Kwan-Liu",""],["Seo","Jinwook",""]]}
{"id":"2308.00279","submitter":"Zhangchi Zhu","authors":"Zhangchi Zhu, Lu Wang, Pu Zhao, Chao Du, Wei Zhang, Hang Dong, Bo\n  Qiao, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang","title":"Robust Positive-Unlabeled Learning via Noise Negative Sample\n  Self-correction","comments":"Accepted at KDD2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning from positive and unlabeled data is known as positive-unlabeled (PU)\nlearning in literature and has attracted much attention in recent years. One\ncommon approach in PU learning is to sample a set of pseudo-negatives from the\nunlabeled data using ad-hoc thresholds so that conventional supervised methods\ncan be applied with both positive and negative samples. Owing to the label\nuncertainty among the unlabeled data, errors of misclassifying unlabeled\npositive samples as negative samples inevitably appear and may even accumulate\nduring the training processes. Those errors often lead to performance\ndegradation and model instability. To mitigate the impact of label uncertainty\nand improve the robustness of learning with positive and unlabeled data, we\npropose a new robust PU learning method with a training strategy motivated by\nthe nature of human learning: easy cases should be learned first. Similar\nintuition has been utilized in curriculum learning to only use easier cases in\nthe early stage of training before introducing more complex cases.\nSpecifically, we utilize a novel ``hardness'' measure to distinguish unlabeled\nsamples with a high chance of being negative from unlabeled samples with large\nlabel noise. An iterative training strategy is then implemented to fine-tune\nthe selection of negative samples during the training process in an iterative\nmanner to include more ``easy'' samples in the early stage of training.\nExtensive experimental validations over a wide range of learning tasks show\nthat this approach can effectively improve the accuracy and stability of\nlearning with positive and unlabeled data. Our code is available at\nhttps://github.com/woriazzc/Robust-PU\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:34:52 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhu","Zhangchi",""],["Wang","Lu",""],["Zhao","Pu",""],["Du","Chao",""],["Zhang","Wei",""],["Dong","Hang",""],["Qiao","Bo",""],["Lin","Qingwei",""],["Rajmohan","Saravan",""],["Zhang","Dongmei",""]]}
{"id":"2308.00280","submitter":"Akihiro Mizoguchi","authors":"Akihiro Mizoguchi, Anna Bogdanova, Akira Imakura, and Tetsuya Sakurai","title":"Data Collaboration Analysis applied to Compound Datasets and the\n  Introduction of Projection data to Non-IID settings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Given the time and expense associated with bringing a drug to market,\nnumerous studies have been conducted to predict the properties of compounds\nbased on their structure using machine learning. Federated learning has been\napplied to compound datasets to increase their prediction accuracy while\nsafeguarding potentially proprietary information. However, federated learning\nis encumbered by low accuracy in not identically and independently distributed\n(non-IID) settings, i.e., data partitioning has a large label bias, and is\nconsidered unsuitable for compound datasets, which tend to have large label\nbias. To address this limitation, we utilized an alternative method of\ndistributed machine learning to chemical compound data from open sources,\ncalled data collaboration analysis (DC). We also proposed data collaboration\nanalysis using projection data (DCPd), which is an improved method that\nutilizes auxiliary PubChem data. This improves the quality of individual\nuser-side data transformations for the projection data for the creation of\nintermediate representations. The classification accuracy, i.e., area under the\ncurve in the receiver operating characteristic curve (ROC-AUC) and AUC in the\nprecision-recall curve (PR-AUC), of federated averaging (FedAvg), DC, and DCPd\nwas compared for five compound datasets. We determined that the machine\nlearning performance for non-IID settings was in the order of DCPd, DC, and\nFedAvg, although they were almost the same in identically and independently\ndistributed (IID) settings. Moreover, the results showed that compared to other\nmethods, DCPd exhibited a negligible decline in classification accuracy in\nexperiments with different degrees of label bias. Thus, DCPd can address the\nlow performance in non-IID settings, which is one of the challenges of\nfederated learning.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:37:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mizoguchi","Akihiro",""],["Bogdanova","Anna",""],["Imakura","Akira",""],["Sakurai","Tetsuya",""]]}
{"id":"2308.00281","submitter":"Xilin Zhang","authors":"Xilin Zhang, Wang Chi Cheung","title":"Online Stochastic Allocation of Reusable Resources","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a multi-objective model on the allocation of reusable resources\nunder model uncertainty. Heterogeneous customers arrive sequentially according\nto a latent stochastic process, request for certain amounts of resources, and\noccupy them for random durations of time. The decision maker's goal is to\nsimultaneously maximize multiple types of rewards generated by the customers,\nwhile satisfying the resource capacity constraints in each time step. We\ndevelop models and algorithms for deciding on the allocation actions. We show\nthat when the usage duration is relatively small compared with the length of\nthe planning horizon, our policy achieves $1-O(\\epsilon)$ fraction of the\noptimal expected rewards, where $\\epsilon$ decays to zero at a near optimal\nrate as the resource capacities grow.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:37:38 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Xilin",""],["Cheung","Wang Chi",""]]}
{"id":"2308.00282","submitter":"Hyeon Jeon","authors":"Hyeon Jeon, Aeri Cho, Jinhwa Jang, Soohyun Lee, Jake Hyun, Hyung-Kwon\n  Ko, Jaemin Jo, Jinwook Seo","title":"ZADU: A Python Library for Evaluating the Reliability of Dimensionality\n  Reduction Embeddings","comments":"2023 IEEE Visualization and Visual Analytics (IEEE VIS 2023) Short\n  paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dimensionality reduction (DR) techniques inherently distort the original\nstructure of input high-dimensional data, producing imperfect low-dimensional\nembeddings. Diverse distortion measures have thus been proposed to evaluate the\nreliability of DR embeddings. However, implementing and executing distortion\nmeasures in practice has so far been time-consuming and tedious. To address\nthis issue, we present ZADU, a Python library that provides distortion\nmeasures. ZADU is not only easy to install and execute but also enables\ncomprehensive evaluation of DR embeddings through three key features. First,\nthe library covers a wide range of distortion measures. Second, it\nautomatically optimizes the execution of distortion measures, substantially\nreducing the running time required to execute multiple measures. Last, the\nlibrary informs how individual points contribute to the overall distortions,\nfacilitating the detailed analysis of DR embeddings. By simulating a real-world\nscenario of optimizing DR embeddings, we verify that our optimization scheme\nsubstantially reduces the time required to execute distortion measures.\nFinally, as an application of ZADU, we present another library called ZADUVis\nthat allows users to easily create distortion visualizations that depict the\nextent to which each region of an embedding suffers from distortions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:38:15 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 04:39:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jeon","Hyeon",""],["Cho","Aeri",""],["Jang","Jinhwa",""],["Lee","Soohyun",""],["Hyun","Jake",""],["Ko","Hyung-Kwon",""],["Jo","Jaemin",""],["Seo","Jinwook",""]]}
{"id":"2308.00283","submitter":"Lei Xing","authors":"Lei Xing, Dongdong Yan, and Jianheng Guo","title":"The Mass Fractionation of Helium in the Escaping Atmosphere of HD\n  209458b","comments":"Accepted by ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The absorption signals of metastable He in HD 209458b and several other\nexoplanets can be explained via escaping atmosphere model with a subsolar He/H\nratio. The low abundance of helium can be a result of planet formation if there\nis a small amount of helium in their primordial atmosphere. However, another\npossibility is that the low He/H ratio is caused by the process of mass\nfractionation of helium in the atmosphere. In order to investigate the effect\nof the fractionation in the hydrogen-helium atmosphere, we developed a\nself-consistent multi-fluid 1D hydrodynamic model based on the well-known\nopen-source MHD code PLUTO. Our simulations show that a lower He/H ratio can be\nproduced spontaneously in the multi-fluid model. We further modeled the\ntransmission spectra of He 10830 lines for HD 209458b in a broad parameter\nspace. The transmission spectrum of the observation can be fitted in the\ncondition of 1.80 times the X-ray and extreme-ultraviolet flux of the quiet\nSun. Meanwhile, the ratio of the escaping flux of helium to hydrogen,\n$F_{He}/F_{H}$, is 0.039. Our results indicate that the mass fractionation of\nhelium to hydrogen can naturally interpret the low He/H ratio required by the\nobservation. Thus, in the escaping atmosphere of HD 209458b, decreasing the\nabundance of helium in the atmosphere is not needed even if its He abundance is\nsimilar to that of the Sun. The simulation presented in this work hints that in\nthe escaping atmosphere, mass fractionation can also occur on other exoplanets,\nwhich needs to be explored further.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:40:44 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 01:50:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Xing","Lei",""],["Yan","Dongdong",""],["Guo","Jianheng",""]]}
{"id":"2308.00284","submitter":"Hyeon Jeon","authors":"Hyeon Jeon, Ghulam Jilani Quadri, Hyunwook Lee, Paul Rosen, Danielle\n  Albers Szafir, and Jinwook Seo","title":"CLAMS: A Cluster Ambiguity Measure for Estimating Perceptual Variability\n  in Visual Clustering","comments":"IEEE Transactions on Visualization and Computer Graphics (TVCG)\n  (Proc. IEEE VIS 2023); equally contributed by Hyeon Jeon and Ghulam Jilani\n  Quadri","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Visual clustering is a common perceptual task in scatterplots that supports\ndiverse analytics tasks (e.g., cluster identification). However, even with the\nsame scatterplot, the ways of perceiving clusters (i.e., conducting visual\nclustering) can differ due to the differences among individuals and ambiguous\ncluster boundaries. Although such perceptual variability casts doubt on the\nreliability of data analysis based on visual clustering, we lack a systematic\nway to efficiently assess this variability. In this research, we study\nperceptual variability in conducting visual clustering, which we call Cluster\nAmbiguity. To this end, we introduce CLAMS, a data-driven visual quality\nmeasure for automatically predicting cluster ambiguity in monochrome\nscatterplots. We first conduct a qualitative study to identify key factors that\naffect the visual separation of clusters (e.g., proximity or size difference\nbetween clusters). Based on study findings, we deploy a regression module that\nestimates the human-judged separability of two clusters. Then, CLAMS predicts\ncluster ambiguity by analyzing the aggregated results of all pairwise\nseparability between clusters that are generated by the module. CLAMS\noutperforms widely-used clustering techniques in predicting ground truth\ncluster ambiguity. Meanwhile, CLAMS exhibits performance on par with human\nannotators. We conclude our work by presenting two applications for optimizing\nand benchmarking data mining techniques using CLAMS. The interactive demo of\nCLAMS is available at clusterambiguity.dev.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:46:35 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 04:43:16 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jeon","Hyeon",""],["Quadri","Ghulam Jilani",""],["Lee","Hyunwook",""],["Rosen","Paul",""],["Szafir","Danielle Albers",""],["Seo","Jinwook",""]]}
{"id":"2308.00285","submitter":"Manisha Senadeera","authors":"Manisha Senadeera, Santu Rana, Sunil Gupta, Svetha Venkatesh","title":"Predictive Modeling through Hyper-Bayesian Optimization","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":"  Model selection is an integral problem of model based optimization techniques\nsuch as Bayesian optimization (BO). Current approaches often treat model\nselection as an estimation problem, to be periodically updated with\nobservations coming from the optimization iterations. In this paper, we propose\nan alternative way to achieve both efficiently. Specifically, we propose a\nnovel way of integrating model selection and BO for the single goal of reaching\nthe function optima faster. The algorithm moves back and forth between BO in\nthe model space and BO in the function space, where the goodness of the\nrecommended model is captured by a score function and fed back, capturing how\nwell the model helped convergence in the function space. The score function is\nderived in such a way that it neutralizes the effect of the moving nature of\nthe BO in the function space, thus keeping the model selection problem\nstationary. This back and forth leads to quick convergence for both model\nselection and BO in the function space. In addition to improved sample\nefficiency, the framework outputs information about the black-box function.\nConvergence is proved, and experimental results show significant improvement\ncompared to standard BO.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:46:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Senadeera","Manisha",""],["Rana","Santu",""],["Gupta","Sunil",""],["Venkatesh","Svetha",""]]}
{"id":"2308.00286","submitter":"Sarjick Bakshi","authors":"Sarjick Bakshi and A J Parameswaran","title":"Morphisms from projective spaces to $G/P$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CO math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study maps between projective spaces and flag varieties. Let $G =\nSL(n,\\mathbb{C})$. We show that there is no map from $\\mathbb{P}^2$ to full\nflag variety $G/B$. We classify the minimal parabolic subgroups $P$ for which\nthere is a map from $\\mathbb{P}^3$ to $G/P$. We finally show that there is no\nmap from $\\mathbb{P}^4$ to $G/P$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:57:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bakshi","Sarjick",""],["Parameswaran","A J",""]]}
{"id":"2308.00287","submitter":"Minghao Chen","authors":"Minghao Chen, Zepeng Gao, Shuai Zhao, Qibo Qiu, Wenxiao Wang, Binbin\n  Lin, Xiaofei He","title":"A Study of Unsupervised Evaluation Metrics for Practical and Automatic\n  Domain Adaptation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unsupervised domain adaptation (UDA) methods facilitate the transfer of\nmodels to target domains without labels. However, these methods necessitate a\nlabeled target validation set for hyper-parameter tuning and model selection.\nIn this paper, we aim to find an evaluation metric capable of assessing the\nquality of a transferred model without access to target validation labels. We\nbegin with the metric based on mutual information of the model prediction.\nThrough empirical analysis, we identify three prevalent issues with this\nmetric: 1) It does not account for the source structure. 2) It can be easily\nattacked. 3) It fails to detect negative transfer caused by the over-alignment\nof source and target features. To address the first two issues, we incorporate\nsource accuracy into the metric and employ a new MLP classifier that is held\nout during training, significantly improving the result. To tackle the final\nissue, we integrate this enhanced metric with data augmentation, resulting in a\nnovel unsupervised UDA metric called the Augmentation Consistency Metric (ACM).\nAdditionally, we empirically demonstrate the shortcomings of previous\nexperiment settings and conduct large-scale experiments to validate the\neffectiveness of our proposed metric. Furthermore, we employ our metric to\nautomatically search for the optimal hyper-parameter set, achieving superior\nperformance compared to manually tuned sets across four common benchmarks.\nCodes will be available soon.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:01:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chen","Minghao",""],["Gao","Zepeng",""],["Zhao","Shuai",""],["Qiu","Qibo",""],["Wang","Wenxiao",""],["Lin","Binbin",""],["He","Xiaofei",""]]}
{"id":"2308.00288","submitter":"Zian Liu","authors":"Zian Liu, Lei Pan, Chao Chen, Ejaz Ahmed, Shigang Liu, Jun Zhang,\n  Dongxi Liu","title":"VulMatch: Binary-level Vulnerability Detection Through Signature","comments":"15 pages IEEE journal template","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Similar vulnerability repeats in real-world software products because of code\nreuse, especially in wildly reused third-party code and libraries. Detecting\nrepeating vulnerabilities like 1-day and N-day vulnerabilities is an important\ncyber security task. Unfortunately, the state-of-the-art methods suffer from\npoor performance because they detect patch existence instead of vulnerability\nexistence and infer the vulnerability signature directly from binary code. In\nthis paper, we propose VulMatch to extract precise vulnerability-related binary\ninstructions to generate the vulnerability-related signature. VulMatch detects\nvulnerability existence based on binary signatures. Unlike previous approaches,\nVulMatch accurately locates vulnerability-related instructions by utilizing\nsource and binary codes. Our experiments were conducted using over 1000\nvulnerable instances across seven open-source projects. VulMatch significantly\noutperformed the baseline tools Asm2vec and Palmtree. Besides the performance\nadvantages over the baseline tools, VulMatch offers a better feature by\nproviding explainable reasons during vulnerability detection. Our empirical\nstudies demonstrate that VulMatch detects fine-grained vulnerability that the\nstate-of-the-art tools struggle with. Our experiment on commercial firmware\ndemonstrates VulMatch is able to find vulnerabilities in real-world scenario.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:04:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Liu","Zian",""],["Pan","Lei",""],["Chen","Chao",""],["Ahmed","Ejaz",""],["Liu","Shigang",""],["Zhang","Jun",""],["Liu","Dongxi",""]]}
{"id":"2308.00289","submitter":"Geng-Rui Zhang","authors":"Zhuchao Ji and Junyi Xie and Geng-Rui Zhang","title":"Space spanned by characteristic exponents","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove several rigidity results on multiplier and length spectrum. For\nexample, we show that for every non-exceptional rational map\n$f:\\mathbb{P}^1(\\mathbb{C})\\to\\mathbb{P}^1(\\mathbb{C})$ of degree $d\\geq2$, the\n$\\mathbb{Q}$-vector space generated by the characteristic exponents (that are\nnot $-\\infty$) of periodic points of $f$ has infinite dimension. This answers a\nstronger version of a question of Levy and Tucker. Our result can also be seen\nas a generalization of recent results of Ji-Xie and of Huguin which proved\nMilnor's conjecture about rational maps having integer multipliers. We also get\na characterization of postcritically finite maps by using its length spectrum.\nFinally as an application of our result, we get a new proof of the Zariski\ndense orbit conjecture for endomorphisms on $(\\mathbb{P}^1)^N, N\\geq 1$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:08:44 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ji","Zhuchao",""],["Xie","Junyi",""],["Zhang","Geng-Rui",""]]}
{"id":"2308.00290","submitter":"Ian Jauslin","authors":"Ian Jauslin","title":"Lecture Notes: Bose-Einstein condensation and the Simplified Approach to\n  interacting Bosons","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":"  These are lecture notes for a week-long summer school course delivered at the\nTXST Summer School in Mathematical Physics, July 24-28, 2023, organized by Jake\nFillman. In them, we discuss properties of systems of many interacting Bosons,\nsuch as gasses of Helium atoms. We pay special attention to the phenomenon of\nBose-Einstein condensation, which is a quantum phase in which a positive\nfraction of particles are all in the same state. We first give an overview of\nBose-Einstein condensation in non-interacting systems. Next, we introduce the\nSimplified Approach, and prove some of its properties.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:12:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jauslin","Ian",""]]}
{"id":"2308.00291","submitter":"Lehan Wang","authors":"Lehan Wang, Weihang Dai, Mei Jin, Chubin Ou, and Xiaomeng Li","title":"Fundus-Enhanced Disease-Aware Distillation Model for Retinal Disease\n  Classification from OCT Images","comments":"Accepted as a conference paper at MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical Coherence Tomography (OCT) is a novel and effective screening tool\nfor ophthalmic examination. Since collecting OCT images is relatively more\nexpensive than fundus photographs, existing methods use multi-modal learning to\ncomplement limited OCT data with additional context from fundus images.\nHowever, the multi-modal framework requires eye-paired datasets of both\nmodalities, which is impractical for clinical use. To address this problem, we\npropose a novel fundus-enhanced disease-aware distillation model (FDDM), for\nretinal disease classification from OCT images. Our framework enhances the OCT\nmodel during training by utilizing unpaired fundus images and does not require\nthe use of fundus images during testing, which greatly improves the\npracticality and efficiency of our method for clinical use. Specifically, we\npropose a novel class prototype matching to distill disease-related information\nfrom the fundus model to the OCT model and a novel class similarity alignment\nto enforce consistency between disease distribution of both modalities.\nExperimental results show that our proposed approach outperforms single-modal,\nmulti-modal, and state-of-the-art distillation methods for retinal disease\nclassification. Code is available at https://github.com/xmed-lab/FDDM.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:13:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wang","Lehan",""],["Dai","Weihang",""],["Jin","Mei",""],["Ou","Chubin",""],["Li","Xiaomeng",""]]}
{"id":"2308.00292","submitter":"Shidong Jiang","authors":"Leslie Greengard, Shidong Jiang","title":"A Dual-space Multilevel Kernel-splitting Framework for Discrete and\n  Continuous Convolution","comments":"53 pages, 15 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 introduce a new class of multilevel, adaptive, dual-space methods for\ncomputing fast convolutional transforms. These methods can be applied to a\nbroad class of kernels, from the Green's functions for classical partial\ndifferential equations (PDEs) to power functions and radial basis functions\nsuch as those used in statistics and machine learning. The DMK (dual-space\nmultilevel kernel-splitting) framework uses a hierarchy of grids, computing a\nsmoothed interaction at the coarsest level, followed by a sequence of\ncorrections at finer and finer scales until the problem is entirely local, at\nwhich point direct summation is applied.\n  The main novelty of DMK is that the interaction at each scale is diagonalized\nby a short Fourier transform, permitting the use of separation of variables,\nbut without requiring the FFT for its asymptotic performance. The DMK framework\nsubstantially simplifies the algorithmic structure of the fast multipole method\n(FMM) and unifies the FMM, Ewald summation, and multilevel summation, achieving\nspeeds comparable to the FFT in work per gridpoint, even in a fully adaptive\ncontext.\n  For continuous source distributions, the evaluation of local interactions is\nfurther accelerated by approximating the kernel at the finest level as a sum of\nGaussians with a highly localized remainder. The Gaussian convolutions are\ncalculated using tensor product transforms, and the remainder term is\ncalculated using asymptotic methods. We illustrate the performance of DMK for\nboth continuous and discrete sources with extensive numerical examples in two\nand three dimensions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:19:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Greengard","Leslie",""],["Jiang","Shidong",""]]}
{"id":"2308.00293","submitter":"Hao Guo","authors":"Hao Guo, Peixue Jiang, Lin Ye, Yinhai Zhu","title":"Development of low-dissipative projection method framework integrating\n  various high-order time integration schemes using OpenFOAM","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":"  A low-dissipative solution framework integrating various types of high-order\ntime scheme is proposed and implemented based on the open-source C++ library\nOpenFOAM. This framework aims to introduce different categories of\nlow-dissipative time integration schemes into a unified solver convenient for\ncomparison of scheme performance in finite volume computational fluid dynamics\ncode, contributing to the development of low dissipation scheme appropriate for\nscale-resolving turbulence simulation. To demonstrate this general framework's\nability of including a wide range of time integration method, in addition to\ntypical Runge--Kutta family schemes of linear single-step method, two more\ncomplex linear multi-step method, Adams--Bashforth family and\nAdams--Bashforth--Moutton family schemes, are implemented with the projection\nalgorithm, which increase the options of time discretization. The unified\nsolver obtained by the solution framework select the specified time scheme from\na variety of alternatives in runtime rather than maintaining multiple solvers\nwith each compiled for a single scheme, while new scheme can be easily added\naccording to the basic idea of this universal framework. Further research on\nthe stability of the explicit scheme indicates that a multi-step method with an\nappropriate order may be an optimal choice when taking both the prediction\naccuracy and computational efficiency into account in unstable problems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:21:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Guo","Hao",""],["Jiang","Peixue",""],["Ye","Lin",""],["Zhu","Yinhai",""]]}
{"id":"2308.00294","submitter":"Yuntong Zhang","authors":"Yuntong Zhang, Andreea Costea, Ridwan Shariffdeen, Davin McCall, Abhik\n  Roychoudhury","title":"Patch Space Exploration using Static Analysis Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automated Program Repair (APR) techniques typically rely on a given\ntest-suite to guide the repair process. Apart from the need to provide test\noracles, this makes the produced patches prone to test data over-fitting. In\nthis work, instead of relying on test cases, we show how to automatically\nrepair memory safety issues, by leveraging static analysis (specifically\nIncorrectness Separation Logic) to guide repair. Our proposed approach learns\nwhat a desirable patch is by inspecting how close a patch is to fixing the bug\nbased on the feedback from incorrectness separation logic based static analysis\n(specifically the Pulse analyser), and turning this information into a\ndistribution of probabilities over context free grammars. Furthermore, instead\nof focusing on heuristics for reducing the search space of patches, we make\nrepair scalable by creating classes of equivalent patches according to the\neffect they have on the symbolic heap, and then invoking the validation oracle\nonly once per class of patch equivalence. This allows us to efficiently\ndiscover repairs even in the presence of a large pool of patch candidates\noffered by our generic patch synthesis mechanism. Experimental evaluation of\nour approach was conducted by repairing real world memory errors in OpenSSL,\nswoole and other subjects. The evaluation results show the scalability and\nefficacy of our approach in automatically producing high quality patches.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:22:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Yuntong",""],["Costea","Andreea",""],["Shariffdeen","Ridwan",""],["McCall","Davin",""],["Roychoudhury","Abhik",""]]}
{"id":"2308.00295","submitter":"Shamanthak Hegde","authors":"Shamanthak Hegde, Soumya Jahagirdar and Shankar Gangisetty","title":"Making the V in Text-VQA Matter","comments":"Accepted for the CVPR 2023 Workshop on Open-Domain Reasoning Under\n  Multi-Modal Settings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-based VQA aims at answering questions by reading the text present in the\nimages. It requires a large amount of scene-text relationship understanding\ncompared to the VQA task. Recent studies have shown that the question-answer\npairs in the dataset are more focused on the text present in the image but less\nimportance is given to visual features and some questions do not require\nunderstanding the image. The models trained on this dataset predict biased\nanswers due to the lack of understanding of visual context. For example, in\nquestions like \"What is written on the signboard?\", the answer predicted by the\nmodel is always \"STOP\" which makes the model to ignore the image. To address\nthese issues, we propose a method to learn visual features (making V matter in\nTextVQA) along with the OCR features and question features using VQA dataset as\nexternal knowledge for Text-based VQA. Specifically, we combine the TextVQA\ndataset and VQA dataset and train the model on this combined dataset. Such a\nsimple, yet effective approach increases the understanding and correlation\nbetween the image features and text present in the image, which helps in the\nbetter answering of questions. We further test the model on different datasets\nand compare their qualitative and quantitative results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:28:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hegde","Shamanthak",""],["Jahagirdar","Soumya",""],["Gangisetty","Shankar",""]]}
{"id":"2308.00296","submitter":"Manuel Schaller","authors":"Lea Bold and Lars Gr\\\"une and Manuel Schaller and Karl Worthmann","title":"Practical asymptotic stability of data-driven model predictive control\n  using extended DMD","comments":"24 pages, 5 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":"  The extended Dynamic Mode Decomposition (eDMD) is a very popular method to\nobtain data-driven surrogate models for nonlinear (control) systems governed by\nordinary and stochastic differential equations. Its theoretical foundation is\nthe Koopman framework, in which one propagates observable functions of the\nstate to obtain a linear representation in an infinite-dimensional space. In\nthis work, we prove practical asymptotic stability of a (controlled)\nequilibrium for eDMD-based model predictive control, in which the optimization\nstep is conducted using the data-based surrogate model. To this end, we derive\nerror bounds that converge to zero if the state approaches the desired\nequilibrium. Further, we show that, if the underlying system is cost\ncontrollable, then this stabilizablility property is preserved. We conduct\nnumerical simulations, which illustrate the proven practical asymptotic\nstability.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:31:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bold","Lea",""],["Gr\u00fcne","Lars",""],["Schaller","Manuel",""],["Worthmann","Karl",""]]}
{"id":"2308.00297","submitter":"Yun Yang","authors":"Jianyu Chen, Huyi Hu and Yun Yang","title":"Every compact manifold carries a hyperbolic diffeomorphism with\n  countably infinitely many ergodic components","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we prove that every compact smooth Riemannian manifold of\ndimension $\\ge 5$ carries a smooth volume preserving nonuniformly hyperbolic\ndiffeomorphism with countably infinitely many ergodic components.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:33:11 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chen","Jianyu",""],["Hu","Huyi",""],["Yang","Yun",""]]}
{"id":"2308.00298","submitter":"Hyunjoong Kim","authors":"Hyunjoong Kim, Yoichiro Mori, Joshua B Plotkin","title":"Finite population effects on optimal communication for social foragers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE math.PR physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Foraging is crucial for animals to survive. Many species forage in groups, as\nindividuals communicate to share information about the location of available\nresources. For example, eusocial foragers, such as honey bees and many ants,\nrecruit members from their central hive or nest to a known foraging site.\nHowever, the optimal level of communication and recruitment depends on the\noverall group size, the distribution of available resources, and the extent of\ninterference between multiple individuals attempting to forage from a site. In\nthis paper, we develop a discrete-time Markov chain model of eusocial foragers,\nwho communicate information with a certain probability. We compare the\nstochastic model and its corresponding infinite-population limit. We find that\nforaging efficiency tapers off when recruitment probability is too high -- a\nphenomenon that does not occur in the infinite-population model, even though it\noccurs for any finite population size. The marginal inefficiency at high\nrecruitment probability increases as the population increases, similar to a\nboundary layer. In particular, we prove there is a significant gap between the\nforaging efficiency of finite and infinite population models in the extreme\ncase of complete communication. We also analyze this phenomenon by\napproximating the stationary distribution of foragers over sites in terms of\nmean escape times from multiple quasi-steady states. We conclude that for any\nfinite group of foragers, an individual who has found a resource should only\nsometimes recruit others to the same resource. We discuss the relationship\nbetween our analysis and multi-agent multi-arm bandit problems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:39:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kim","Hyunjoong",""],["Mori","Yoichiro",""],["Plotkin","Joshua B",""]]}
{"id":"2308.00299","submitter":"Assaf Rinot","authors":"Assaf Rinot and Shira Yadai and Zhixing You","title":"Full Souslin trees at small cardinals","comments":"Updates on this paper may be found at\n  http://www.assafrinot.com/paper/62","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A $\\kappa$-tree is said to be full if each of its limit levels omits no more\nthan one potential branch. Kunen asked whether a full $\\kappa$-Souslin tree may\nconsistently exist. Shelah gave an affirmative answer of height a strong limit\nMahlo cardinal. Here, it is shown that these trees may consistently exist at\nsmall cardinals. Indeed, there can be $\\aleph_3$ many full $\\aleph_2$-trees\nsuch that the product of any countably many of them is an $\\aleph_2$-Souslin\ntree.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:43:51 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Rinot","Assaf",""],["Yadai","Shira",""],["You","Zhixing",""]]}
{"id":"2308.00300","submitter":"Pengju Zhao","authors":"Pengju Zhao, Jingxin Sun, Shengjie Jin, Zhongshu Hu, Dingping Li,\n  Xiong-Jun Liu, Xuzong Chen","title":"Determination of dynamical quantum phase transition for boson systems\n  using the Loschmidt cumulants method","comments":null,"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 dynamical quantum phase transition(DQPT) of the Bose-Hubbard\nmodel utilizing recently developed Loschmidt cumulants method. We determine the\ncomplex Loschmidt zeros of the Loschmidt amplitude analogous to the Lee-Yang\nzeros of the thermal partition function. We obtain the DQPT critical points\nthrough identifying the crossing points with the imaginary axis. The critical\npoints show high accuracy when compared to those obtained using the matrix\nproduct states method. In addition, we show that how the critical points of\nDQPT can be determined by analyzing the energy fluctuation of the initial\nstate, making it a valuable tool for future studies in this area. Finally, DQPT\nin the extended Bose-Hubbaed model is also investigated.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:46:33 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 08:43:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhao","Pengju",""],["Sun","Jingxin",""],["Jin","Shengjie",""],["Hu","Zhongshu",""],["Li","Dingping",""],["Liu","Xiong-Jun",""],["Chen","Xuzong",""]]}
{"id":"2308.00301","submitter":"Hongming Shan","authors":"Yujie Wei, Jiaxin Ye, Zhizhong Huang, Junping Zhang, Hongming Shan","title":"Online Prototype Learning for Online Continual 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":"  Online continual learning (CL) studies the problem of learning continuously\nfrom a single-pass data stream while adapting to new data and mitigating\ncatastrophic forgetting. Recently, by storing a small subset of old data,\nreplay-based methods have shown promising performance. Unlike previous methods\nthat focus on sample storage or knowledge distillation against catastrophic\nforgetting, this paper aims to understand why the online learning models fail\nto generalize well from a new perspective of shortcut learning. We identify\nshortcut learning as the key limiting factor for online CL, where the learned\nfeatures may be biased, not generalizable to new tasks, and may have an adverse\nimpact on knowledge distillation. To tackle this issue, we present the online\nprototype learning (OnPro) framework for online CL. First, we propose online\nprototype equilibrium to learn representative features against shortcut\nlearning and discriminative features to avoid class confusion, ultimately\nachieving an equilibrium status that separates all seen classes well while\nlearning new classes. Second, with the feedback of online prototypes, we devise\na novel adaptive prototypical feedback mechanism to sense the classes that are\neasily misclassified and then enhance their boundaries. Extensive experimental\nresults on widely-used benchmark datasets demonstrate the superior performance\nof OnPro over the state-of-the-art baseline methods. Source code is available\nat https://github.com/weilllllls/OnPro.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:46:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wei","Yujie",""],["Ye","Jiaxin",""],["Huang","Zhizhong",""],["Zhang","Junping",""],["Shan","Hongming",""]]}
{"id":"2308.00302","submitter":"Buddhadeb Ghosh","authors":"Abhijit Let, Arunoday Sarkar, Chitrak Sarkar and Buddhadeb Ghosh","title":"Non-perturbative stabilization of two K\\\"ahler moduli in type-IIB/F\n  theory and the inflaton potential","comments":"7 pages, 4 figures and 3 tables","journal-ref":"2023 EPL 143 39001","doi":"10.1209/0295-5075/acec09","report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a combination of perturbative and non-perturbative corrections in\nK\\\"ahler moduli stabilizations in the configuration of three magnetised\nintersecting D7 branes in the type-IIB/F theory, compactified on the 6d T^6/Z_N\norbifold of Calabi-Yau three-fold (CY_3). Two of the K\\\"ahler moduli are\nstabilized non-perturbatively, out of the three which get perturbative\ncorrections up to one-loop-order multi-graviton scattering amplitudes in the\nlarge volume scenario. In this framework, the dS vacua are achieved through all\nK\\\"ahler moduli stabilizations by considering the D-term. We obtain inflaton\npotentials of slow-roll plateau-type, which are expected by recent cosmological\nobservations. Calculations of cosmological parameters with the potentials yield\nexperimentally favoured values.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:50:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Let","Abhijit",""],["Sarkar","Arunoday",""],["Sarkar","Chitrak",""],["Ghosh","Buddhadeb",""]]}
{"id":"2308.00303","submitter":"Zhennan Chen","authors":"Zhennan Chen, Rongrong Gao, Tian-Zhu Xiang, Fan Lin","title":"Diffusion Model for Camouflaged Object Detection","comments":"Accepted by ECAI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Camouflaged object detection is a challenging task that aims to identify\nobjects that are highly similar to their background. Due to the powerful\nnoise-to-image denoising capability of denoising diffusion models, in this\npaper, we propose a diffusion-based framework for camouflaged object detection,\ntermed diffCOD, a new framework that considers the camouflaged object\nsegmentation task as a denoising diffusion process from noisy masks to object\nmasks. Specifically, the object mask diffuses from the ground-truth masks to a\nrandom distribution, and the designed model learns to reverse this noising\nprocess. To strengthen the denoising learning, the input image prior is encoded\nand integrated into the denoising diffusion model to guide the diffusion\nprocess. Furthermore, we design an injection attention module (IAM) to interact\nconditional semantic features extracted from the image with the diffusion noise\nembedding via the cross-attention mechanism to enhance denoising learning.\nExtensive experiments on four widely used COD benchmark datasets demonstrate\nthat the proposed method achieves favorable performance compared to the\nexisting 11 state-of-the-art methods, especially in the detailed texture\nsegmentation of camouflaged objects. Our code will be made publicly available\nat: https://github.com/ZNan-Chen/diffCOD.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:50:33 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 13:14:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Zhennan",""],["Gao","Rongrong",""],["Xiang","Tian-Zhu",""],["Lin","Fan",""]]}
{"id":"2308.00304","submitter":"Jiaao Chen","authors":"Jiaao Chen, Xiaoman Pan, Dian Yu, Kaiqiang Song, Xiaoyang Wang, Dong\n  Yu, Jianshu Chen","title":"Skills-in-Context Prompting: Unlocking Compositionality in Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of eliciting compositional generalization\ncapabilities in large language models (LLMs) with a novel type of prompting\nstrategy. Compositional generalization empowers the LLMs to solve problems that\nare harder than the ones they have seen (i.e., easy-to-hard generalization),\nwhich is a critical reasoning capability of human-like intelligence. However,\neven the current state-of-the-art LLMs still struggle with this form of\nreasoning. To bridge this gap, we propose skills-in-context (SKiC) prompting,\nwhich instructs LLMs how to compose basic skills to resolve more complex\nproblems. We find that it is crucial to demonstrate both the skills and the\ncompositional examples within the same prompting context. With as few as two\nexamplars, our SKiC prompting initiates strong synergies between skills and\ntheir composition capabilities. Notably, it empowers LLMs to solve unseen\nproblems that require innovative skill compositions, achieving near-perfect\ngeneralization on a broad range of challenging compositionality tasks.\nIntriguingly, SKiC prompting unlocks the latent potential of LLMs, enabling\nthem to leverage pre-existing internal skills acquired during earlier\npre-training stages, even when these skills are not explicitly presented in the\nprompting context. This results in the capability of LLMs to solve unseen\ncomplex problems by activating and composing internal competencies. With such\nprominent features, SKiC prompting is able to achieve state-of-the-art\nperformance on challenging mathematical reasoning benchmarks (e.g., MATH).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:54:12 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 08:11:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Jiaao",""],["Pan","Xiaoman",""],["Yu","Dian",""],["Song","Kaiqiang",""],["Wang","Xiaoyang",""],["Yu","Dong",""],["Chen","Jianshu",""]]}
{"id":"2308.00305","submitter":"Simon Deeley","authors":"Simon Deeley, Michael Drinkwater, Sarah Sweet, Kenji Bekki, Warrick\n  Couch and Duncan Forbes","title":"The formation pathways of compact elliptical galaxies","comments":"18 pages, 15 figures, accepted for publication in MNRAS. Corrected\n  Table 1","journal-ref":null,"doi":"10.1093/mnras/stad2313","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Compact elliptical (cE) galaxies remain an elusively difficult galaxy class\nto study. Recent observations have suggested that isolated and host-associated\ncEs have different formation pathways, while simulation studies have also shown\ndifferent pathways can lead to a cE galaxy. However a solid link has not been\nestablished, and the relative contributions of each pathway in a cosmological\ncontext remains unknown. Here we combine a spatially-resolved observational\nsample of cEs taken from the SAMI galaxy survey with a matched sample of\ngalaxies within the IllustrisTNG cosmological simulation to establish an\noverall picture of how these galaxies form. The observed cEs located near a\nhost galaxy appear redder, smaller and older than isolated cEs, supporting\nprevious evidence for multiple formation pathways. Tracing the simulated cEs\nback through time, we find two main formation pathways; 32 $\\pm$ 5 percent\nformed via the stripping of a spiral galaxy by a larger host galaxy, while 68\n$\\pm$ 4 percent formed through a gradual build-up of stellar mass in isolated\nenvironments. We confirm that cEs in different environments do indeed form via\ndifferent pathways, with all isolated cEs in our sample having formed via\nin-situ formation (i.e. none were ejected from a previous host), and 77 $\\pm$ 6\npercent of host-associated cEs having formed via tidal stripping. Separating\nthem by their formation pathway, we are able to reproduce the observed\ndifferences between isolated and host-associated cEs, showing that these\ndifferences can be fully explained by the different formation pathways\ndominating in each environment.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:55:08 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 03:25:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deeley","Simon",""],["Drinkwater","Michael",""],["Sweet","Sarah",""],["Bekki","Kenji",""],["Couch","Warrick",""],["Forbes","Duncan",""]]}
{"id":"2308.00306","submitter":"Bodo Manthey","authors":"Marvin K\\\"unnemann, Bodo Manthey, Rianne Veenstra","title":"Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian\n  Noise","comments":"Combination of an ISAAC 2013 paper by Bodo Manthey and Rianne\n  Veenstra and an ICALP 2015 paper by Marvin K\\\"unnemann and Bodo Manthey. The\n  results of the ISAAC 2013 paper have been improved","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The 2-opt heuristic is a very simple local search heuristic for the traveling\nsalesperson problem. In practice it usually converges quickly to solutions\nwithin a few percentages of optimality. In contrast to this, its running-time\nis exponential and its approximation performance is poor in the worst case.\n  Englert, R\\\"oglin, and V\\\"ocking (Algorithmica, 2014) provided a smoothed\nanalysis in the so-called one-step model in order to explain the performance of\n2-opt on d-dimensional Euclidean instances, both in terms of running-time and\nin terms of approximation ratio. However, translating their results to the\nclassical model of smoothed analysis, where points are perturbed by Gaussian\ndistributions with standard deviation sigma, yields only weak bounds.\n  We prove bounds that are polynomial in n and 1/sigma for the smoothed\nrunning-time with Gaussian perturbations. In addition, our analysis for\nEuclidean distances is much simpler than the existing smoothed analysis.\n  Furthermore, we prove a smoothed approximation ratio of O(log(1/sigma)). This\nbound is almost tight, as we also provide a lower bound of Omega(log n/ loglog\nn) for sigma = O(1/sqrt n). Our main technical novelty here is that, different\nfrom existing smoothed analyses, we do not separately analyze objective values\nof the global and local optimum on all inputs (which only allows for a bound of\nO(1/sigma)), but simultaneously bound them on the same input.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:57:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["K\u00fcnnemann","Marvin",""],["Manthey","Bodo",""],["Veenstra","Rianne",""]]}
{"id":"2308.00307","submitter":"Hyun Cheol Park","authors":"Hyun-Cheol Park, Sung Ho Kang","title":"Domain Adaptation based on Human Feedback for Enhancing Generative Model\n  Denoising Abilities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  How can we apply human feedback into generative model? As answer of this\nquestion, in this paper, we show the method applied on denoising problem and\ndomain adaptation using human feedback. Deep generative models have\ndemonstrated impressive results in image denoising. However, current image\ndenoising models often produce inappropriate results when applied to domains\ndifferent from the ones they were trained on. If there are `Good' and `Bad'\nresult for unseen data, how to raise up quality of `Bad' result. Most methods\nuse an approach based on generalization of model. However, these methods\nrequire target image for training or adapting unseen domain. In this paper, to\nadapting domain, we deal with non-target image for unseen domain, and improve\nspecific failed image. To address this, we propose a method for fine-tuning\ninappropriate results generated in a different domain by utilizing human\nfeedback. First, we train a generator to denoise images using only the noisy\nMNIST digit '0' images. The denoising generator trained on the source domain\nleads to unintended results when applied to target domain images. To achieve\ndomain adaptation, we construct a noise-image denoising generated image data\nset and train a reward model predict human feedback. Finally, we fine-tune the\ngenerator on the different domain using the reward model with auxiliary loss\nfunction, aiming to transfer denoising capabilities to target domain. Our\napproach demonstrates the potential to efficiently fine-tune a generator\ntrained on one domain using human feedback from another domain, thereby\nenhancing denoising abilities in different domains.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:59:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Park","Hyun-Cheol",""],["Kang","Sung Ho",""]]}
{"id":"2308.00308","submitter":"YuSen An","authors":"Xiao Liang, Ya-Peng Hu, Chen-Hao Wu, Yu-Sen An","title":"Thermodynamics and evaporation of perfect fluid dark matter black hole\n  in phantom background","comments":"14 pages, 2 figures, comments are welcomed. v2: typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel interpretation of the thermodynamics of perfect fluid dark\nmatter (PFDM) black hole based on Misner-Sharp energy, and then investigate its\nevaporation behavior. We find that the ratio between dark sector initial\ndensity and black hole horizon radius significantly influences black hole\nevaporation behaviors. We demonstrate that the presence of the dark sector can\nsignificantly extend the lifetime of a black hole which is similar to the\nReissner-Nordstrom case. Our work reformulates the thermodynamics of PFDM black\nholes and points out the existence of long-lived black holes in the presence of\nthe dark sector.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:59:03 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 03:04:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liang","Xiao",""],["Hu","Ya-Peng",""],["Wu","Chen-Hao",""],["An","Yu-Sen",""]]}
{"id":"2308.00309","submitter":"Joshua Wood","authors":"Peter Cox, Matthew J. Dolan, Joshua Wood","title":"Absorption of Fermionic Dark Matter via the Scalar Portal","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The absorption of fermionic dark matter has recently been studied as a\nsignature for the direct detection of dark matter. We construct the first UV\ncompletion of the scalar effective operator associated with this signature. We\ncalculate the constraints on the model and demonstrate there is viable\nparameter space which can be probed by a next-generation experiment such as\nXLZD. We also consider the cosmological history of our model and show that the\ncorrect relic abundance can be obtained via freeze-out in the dark sector.\nHowever, within this minimal model, we find that the absorption signal is\nhighly suppressed in the parameter space that yields the correct relic\nabundance.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:09:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cox","Peter",""],["Dolan","Matthew J.",""],["Wood","Joshua",""]]}
{"id":"2308.00310","submitter":"Sima Behpour","authors":"Sima Behpour, Thang Doan, Xin Li, Wenbin He, Liang Gou, Liu Ren","title":"GradOrth: A Simple yet Efficient Out-of-Distribution Detection with\n  Orthogonal Projection of Gradients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting out-of-distribution (OOD) data is crucial for ensuring the safe\ndeployment of machine learning models in real-world applications. However,\nexisting OOD detection approaches primarily rely on the feature maps or the\nfull gradient space information to derive OOD scores neglecting the role of\nmost important parameters of the pre-trained network over in-distribution (ID)\ndata. In this study, we propose a novel approach called GradOrth to facilitate\nOOD detection based on one intriguing observation that the important features\nto identify OOD data lie in the lower-rank subspace of in-distribution (ID)\ndata. In particular, we identify OOD data by computing the norm of gradient\nprojection on the subspaces considered important for the in-distribution data.\nA large orthogonal projection value (i.e. a small projection value) indicates\nthe sample as OOD as it captures a weak correlation of the ID data. This simple\nyet effective method exhibits outstanding performance, showcasing a notable\nreduction in the average false positive rate at a 95% true positive rate\n(FPR95) of up to 8% when compared to the current state-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:12:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Behpour","Sima",""],["Doan","Thang",""],["Li","Xin",""],["He","Wenbin",""],["Gou","Liang",""],["Ren","Liu",""]]}
{"id":"2308.00311","submitter":"Daouda Sow","authors":"Daouda Sow, Sen Lin, Zhangyang Wang, Yingbin Liang","title":"Doubly Robust Instance-Reweighted Adversarial Training","comments":"Submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assigning importance weights to adversarial data has achieved great success\nin training adversarially robust networks under limited model capacity.\nHowever, existing instance-reweighted adversarial training (AT) methods heavily\ndepend on heuristics and/or geometric interpretations to determine those\nimportance weights, making these algorithms lack rigorous theoretical\njustification/guarantee. Moreover, recent research has shown that adversarial\ntraining suffers from a severe non-uniform robust performance across the\ntraining distribution, e.g., data points belonging to some classes can be much\nmore vulnerable to adversarial attacks than others. To address both issues, in\nthis paper, we propose a novel doubly-robust instance reweighted AT framework,\nwhich allows to obtain the importance weights via exploring distributionally\nrobust optimization (DRO) techniques, and at the same time boosts the\nrobustness on the most vulnerable examples. In particular, our importance\nweights are obtained by optimizing the KL-divergence regularized loss function,\nwhich allows us to devise new algorithms with a theoretical convergence\nguarantee. Experiments on standard classification datasets demonstrate that our\nproposed approach outperforms related state-of-the-art baseline methods in\nterms of average robust performance, and at the same time improves the\nrobustness against attacks on the weakest data points. Codes will be available\nsoon.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:16:18 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sow","Daouda",""],["Lin","Sen",""],["Wang","Zhangyang",""],["Liang","Yingbin",""]]}
{"id":"2308.00312","submitter":"Mahesh Krishna K","authors":"K. Mahesh Krishna","title":"Functional Continuous Uncertainty Principle","comments":"7 Pages, 0 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $(\\Omega, \\mu)$, $(\\Delta, \\nu)$ be measure spaces. Let\n$(\\{f_\\alpha\\}_{\\alpha\\in \\Omega}, \\{\\tau_\\alpha\\}_{\\alpha\\in \\Omega})$ and\n$(\\{g_\\beta\\}_{\\beta\\in \\Delta}, \\{\\omega_\\beta\\}_{\\beta\\in \\Delta})$ be\ncontinuous p-Schauder frames for a Banach space $\\mathcal{X}$. Then for every\n$x \\in \\mathcal{X}\\setminus\\{0\\}$, we show that \\begin{align} (1) \\quad \\quad\n\\quad \\quad \\mu(\\operatorname{supp}(\\theta_f x))^\\frac{1}{p}\n\\nu(\\operatorname{supp}(\\theta_g x))^\\frac{1}{q} \\geq\n\\frac{1}{\\displaystyle\\sup_{\\alpha \\in \\Omega, \\beta \\in\n\\Delta}|f_\\alpha(\\omega_\\beta)|}, \\quad \\nu(\\operatorname{supp}(\\theta_g\nx))^\\frac{1}{p} \\mu(\\operatorname{supp}(\\theta_f x))^\\frac{1}{q}\\geq\n\\frac{1}{\\displaystyle\\sup_{\\alpha \\in \\Omega , \\beta \\in\n\\Delta}|g_\\beta(\\tau_\\alpha)|}. \\end{align} where \\begin{align*} &\\theta_f:\n\\mathcal{X} \\ni x \\mapsto \\theta_fx \\in \\mathcal{L}^p(\\Omega, \\mu); \\quad\n\\theta_fx: \\Omega \\ni \\alpha \\mapsto (\\theta_fx) (\\alpha):= f_\\alpha (x) \\in\n\\mathbb{K}, &\\theta_g: \\mathcal{X} \\ni x \\mapsto \\theta_gx \\in\n\\mathcal{L}^p(\\Delta, \\nu); \\quad \\theta_gx: \\Delta \\ni \\beta \\mapsto\n(\\theta_gx) (\\beta):= g_\\beta (x) \\in \\mathbb{K} \\end{align*} and $q$ is the\nconjugate index of $p$. We call Inequality (1) as \\textbf{Functional Continuous\nUncertainty Principle}. It improves the Functional\nDonoho-Stark-Elad-Bruckstein-Ricaud-Torr\\'{e}sani Uncertainty Principle\nobtained by K. Mahesh Krishna in [arXiv:2304.03324v1 [math.FA], 5 April 2023].\nIt also answers a question asked by Prof. Philip B. Stark to the author. Based\non Donoho-Elad Sparsity Theorem, we formulate Measure Minimization Conjecture.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:16:39 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Krishna","K. Mahesh",""]]}
{"id":"2308.00313","submitter":"Zhi Chen","authors":"Zhi Chen, Pengfei Zhang, Jingjing Li, Sen Wang, Zi Huang","title":"Zero-Shot Learning by Harnessing Adversarial Samples","comments":"Accepted to ACM International Conference on Multimedia (MM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zero-Shot Learning (ZSL) aims to recognize unseen classes by generalizing the\nknowledge, i.e., visual and semantic relationships, obtained from seen classes,\nwhere image augmentation techniques are commonly applied to improve the\ngeneralization ability of a model. However, this approach can also cause\nadverse effects on ZSL since the conventional augmentation techniques that\nsolely depend on single-label supervision is not able to maintain semantic\ninformation and result in the semantic distortion issue consequently. In other\nwords, image argumentation may falsify the semantic (e.g., attribute)\ninformation of an image. To take the advantage of image augmentations while\nmitigating the semantic distortion issue, we propose a novel ZSL approach by\nHarnessing Adversarial Samples (HAS). HAS advances ZSL through adversarial\ntraining which takes into account three crucial aspects: (1) robust generation\nby enforcing augmentations to be similar to negative classes, while maintaining\ncorrect labels, (2) reliable generation by introducing a latent space\nconstraint to avert significant deviations from the original data manifold, and\n(3) diverse generation by incorporating attribute-based perturbation by\nadjusting images according to each semantic attribute's localization. Through\ncomprehensive experiments on three prominent zero-shot benchmark datasets, we\ndemonstrate the effectiveness of our adversarial samples approach in both ZSL\nand Generalized Zero-Shot Learning (GZSL) scenarios. Our source code is\navailable at https://github.com/uqzhichen/HASZSL.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:19:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chen","Zhi",""],["Zhang","Pengfei",""],["Li","Jingjing",""],["Wang","Sen",""],["Huang","Zi",""]]}
{"id":"2308.00314","submitter":"Pierre Cardaliaguet","authors":"Pierre Cardaliaguet, Sebastian Munoz and Alessio Porretta","title":"Free boundary regularity and support propagation in mean field games and\n  optimal transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the behavior of solutions to the first-order mean field games system\nwith a local coupling, when the initial density is a compactly supported\nfunction on the real line. Our results show that the solution is smooth in\nregions where the density is strictly positive, and that the density itself is\nglobally continuous. Additionally, the speed of propagation is determined by\nthe behavior of the cost function near small values of the density. When the\ncoupling is entropic, we demonstrate that the support of the density propagates\nwith infinite speed. On the other hand, for a power-type coupling, we establish\nfinite speed of propagation, leading to the formation of a free boundary. We\nprove that under a natural non-degeneracy assumption, the free boundary is\nstrictly convex and enjoys $C^{1,1}$ regularity. We also establish sharp\nestimates on the speed of support propagation and the rate of long time decay\nfor the density. Moreover, the density and the gradient of the value function\nare both shown to be H\\\"older continuous up to the free boundary. Our methods\nare based on the analysis of a new elliptic equation satisfied by the flow of\noptimal trajectories. The results also apply to mean field planning problems,\ncharacterizing the structure of minimizers of a class of optimal transport\nproblems with congestion.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:21:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cardaliaguet","Pierre",""],["Munoz","Sebastian",""],["Porretta","Alessio",""]]}
{"id":"2308.00315","submitter":"Sela Fried","authors":"Sela Fried and Toufik Mansour","title":"Random Walk Labelings of Perfect Trees and Other Graphs","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Random walk labeling of a graph $G$ is any labeling of $G$ that could have\nbeen obtained by performing a random walk on $G$. Continuing two recent works,\nwe calculate the number of random walk labelings of perfect trees, combs, and\ndouble combs, the torus $C_2\\times C_n$, and the graph obtained by connecting\nthree path graphs to form two cycles.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:25:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fried","Sela",""],["Mansour","Toufik",""]]}
{"id":"2308.00316","submitter":"Soneya Binta Hossain","authors":"Soneya Binta Hossain, Matthew B. Dwyer, Sebastian Elbaum, Anh\n  Nguyen-Tuong","title":"Artifact: Measuring and Mitigating Gaps in Structural Testing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The artifact used for evaluating the experimental results of Measuring and\nMitigating Gaps in Structural Testing is publicly available on GitHub, Software\nHeritage and figshare, and is reusable. The artifact consists of necessary\ndata, tools, scripts, and detailed documentation for running the experiments\nand reproducing the results shown in the paper. We have also provided a\nVirtualBox VM image allowing users to quickly setup and reproduce the results.\nUsers are expected to be familiar using the VirtualBox software and Linux\nplatform for evaluating or reusing the artifact.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:28:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hossain","Soneya Binta",""],["Dwyer","Matthew B.",""],["Elbaum","Sebastian",""],["Nguyen-Tuong","Anh",""]]}
{"id":"2308.00317","submitter":"Tommaso Lando","authors":"Tommaso Lando and Sirio Legramanti","title":"A new class of nonparametric tests for second-order stochastic dominance\n  based on the Lorenz P-P plot","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given samples from two non-negative random variables, we propose a new class\nof nonparametric tests for the null hypothesis that one random variable\ndominates the other with respect to second-order stochastic dominance. These\ntests are based on the Lorenz P-P plot (LPP), which is the composition between\nthe inverse unscaled Lorenz curve of one distribution and the unscaled Lorenz\ncurve of the other. The LPP exceeds the identity function if and only if the\ndominance condition is violated, providing a rather simple method to construct\ntest statistics, given by functionals defined over the difference between the\nidentity and the LPP. We determine a stochastic upper bound for such test\nstatistics under the null hypothesis, and derive its limit distribution, to be\napproximated via bootstrap procedures. We also establish the asymptotic\nvalidity of the tests under relatively mild conditions, allowing for both\ndependent and independent samples. Finally, finite sample properties are\ninvestigated through simulation studies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:28:51 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 06:10:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lando","Tommaso",""],["Legramanti","Sirio",""]]}
{"id":"2308.00318","submitter":"Ashrya Agrawal","authors":"Ashrya Agrawal, Priyanshi Shah, Sourabh Prakash","title":"Pixel to policy: DQN Encoders for within & cross-game reinforcement\n  learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reinforcement Learning can be applied to various tasks, and environments.\nMany of these environments have a similar shared structure, which can be\nexploited to improve RL performance on other tasks. Transfer learning can be\nused to take advantage of this shared structure, by learning policies that are\ntransferable across different tasks and environments and can lead to more\nefficient learning as well as improved performance on a wide range of tasks.\nThis work explores as well as compares the performance between RL models being\ntrained from the scratch and on different approaches of transfer learning.\nAdditionally, the study explores the performance of a model trained on multiple\ngame environments, with the goal of developing a universal game-playing agent\nas well as transfer learning a pre-trained encoder using DQN, and training it\non the same game or a different game. Our DQN model achieves a mean episode\nreward of 46.16 which even beats the human-level performance with merely 20k\nepisodes which is significantly lower than deepmind's 1M episodes. The achieved\nmean rewards of 533.42 and 402.17 on the Assault and Space Invader environments\nrespectively, represent noteworthy performance on these challenging\nenvironments.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:29:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Agrawal","Ashrya",""],["Shah","Priyanshi",""],["Prakash","Sourabh",""]]}
{"id":"2308.00319","submitter":"Hai Zhu","authors":"Hai Zhu and Zhaoqing Yang and Weiwei Shang and Yuren Wu","title":"LimeAttack: Local Explainable Method for Textual Hard-Label Adversarial\n  Attack","comments":"26 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Natural language processing models are vulnerable to adversarial examples.\nPrevious textual adversarial attacks adopt gradients or confidence scores to\ncalculate word importance ranking and generate adversarial examples. However,\nthis information is unavailable in the real world. Therefore, we focus on a\nmore realistic and challenging setting, named hard-label attack, in which the\nattacker can only query the model and obtain a discrete prediction label.\nExisting hard-label attack algorithms tend to initialize adversarial examples\nby random substitution and then utilize complex heuristic algorithms to\noptimize the adversarial perturbation. These methods require a lot of model\nqueries and the attack success rate is restricted by adversary initialization.\nIn this paper, we propose a novel hard-label attack algorithm named LimeAttack,\nwhich leverages a local explainable method to approximate word importance\nranking, and then adopts beam search to find the optimal solution. Extensive\nexperiments show that LimeAttack achieves the better attacking performance\ncompared with existing hard-label attack under the same query budget. In\naddition, we evaluate the effectiveness of LimeAttack on large language models,\nand results indicate that adversarial examples remain a significant threat to\nlarge language models. The adversarial examples crafted by LimeAttack are\nhighly transferable and effectively improve model robustness in adversarial\ntraining.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:30:37 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhu","Hai",""],["Yang","Zhaoqing",""],["Shang","Weiwei",""],["Wu","Yuren",""]]}
{"id":"2308.00320","submitter":"Daniel Kyungdeock Park","authors":"ChangWon Lee, Daniel K. Park","title":"Scalable quantum measurement error mitigation via conditional\n  independence and transfer learning","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":"  Mitigating measurement errors in quantum systems without relying on quantum\nerror correction is of critical importance for the practical development of\nquantum technology. Deep learning-based quantum measurement error mitigation\nhas exhibited advantages over the linear inversion method due to its capability\nto correct non-linear noise. However, scalability remains a challenge for both\nmethods. In this study, we propose a scalable quantum measurement error\nmitigation method that leverages the conditional independence of distant qubits\nand incorporates transfer learning techniques. By leveraging the conditional\nindependence assumption, we achieve an exponential reduction in the size of\nneural networks used for error mitigation. This enhancement also offers the\nbenefit of reducing the number of training data needed for the machine learning\nmodel to successfully converge. Additionally, incorporating transfer learning\nprovides a constant speedup. We validate the effectiveness of our approach\nthrough experiments conducted on IBM quantum devices with 7 and 13 qubits,\ndemonstrating excellent error mitigation performance and highlighting the\nefficiency of our method.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:39:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lee","ChangWon",""],["Park","Daniel K.",""]]}
{"id":"2308.00321","submitter":"Hoyoun Kim","authors":"Danielle Hilhorst, Seung-Min Kang, Ho-Youn Kim, and Yong-Jung Kim","title":"Fick's las selects the Neumann boundary condition","comments":"22 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the appearance of a boundary condition along an interface between\ntwo regions, one with constant diffusivity $1$ and the other with diffusivity\n$\\eps>0$, when $\\eps\\to0$. In particular, we take Fick's diffusion law in a\ncontext of reaction-diffusion equation with bistable nonlinearity and show that\nthe limit of the reaction-diffusion equation satisfies the homogeneous Neumann\nboundary condition along the interface. This problem is developed as an\napplication of heterogeneous diffusion laws to study the geometry effect of\ndomain.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:52:14 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 08:57:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hilhorst","Danielle",""],["Kang","Seung-Min",""],["Kim","Ho-Youn",""],["Kim","Yong-Jung",""]]}
{"id":"2308.00322","submitter":"Cihangir Ozemir","authors":"Cihangir \\\"Ozemir, Faruk G\\\"ung\\\"or","title":"Comment on \"An optimal system, invariant solutions, conservation laws,\n  and complete classification of Lie group symmetries for a generalized\n  (2+1)-dim. Davey-Stewartson system of equations for the wave propagation in\n  water of finite depth\"","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this comment we report that a recent paper [Eur. Phys. J. Plus 138, 195\n(2023)] contains significant errors, omissions and inaccuracies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:58:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["\u00d6zemir","Cihangir",""],["G\u00fcng\u00f6r","Faruk",""]]}
{"id":"2308.00323","submitter":"Asish Bera","authors":"Asish Bera, Mita Nasipuri, Ondrej Krejcar, and Debotosh Bhattacharjee","title":"Fine-Grained Sports, Yoga, and Dance Postures Recognition: A Benchmark\n  Analysis","comments":"12 pages, 12 figures, 10 tables","journal-ref":"IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2023","doi":"10.1109/TIM.2023.3293564","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human body-pose estimation is a complex problem in computer vision. Recent\nresearch interests have been widened specifically on the Sports, Yoga, and\nDance (SYD) postures for maintaining health conditions. The SYD pose categories\nare regarded as a fine-grained image classification task due to the complex\nmovement of body parts. Deep Convolutional Neural Networks (CNNs) have attained\nsignificantly improved performance in solving various human body-pose\nestimation problems. Though decent progress has been achieved in yoga postures\nrecognition using deep learning techniques, fine-grained sports, and dance\nrecognition necessitates ample research attention. However, no benchmark public\nimage dataset with sufficient inter-class and intra-class variations is\navailable yet to address sports and dance postures classification. To solve\nthis limitation, we have proposed two image datasets, one for 102 sport\ncategories and another for 12 dance styles. Two public datasets, Yoga-82 which\ncontains 82 classes and Yoga-107 represents 107 classes are collected for yoga\npostures. These four SYD datasets are experimented with the proposed deep\nmodel, SYD-Net, which integrates a patch-based attention (PbA) mechanism on top\nof standard backbone CNNs. The PbA module leverages the self-attention\nmechanism that learns contextual information from a set of uniform and\nmulti-scale patches and emphasizes discriminative features to understand the\nsemantic correlation among patches. Moreover, random erasing data augmentation\nis applied to improve performance. The proposed SYD-Net has achieved\nstate-of-the-art accuracy on Yoga-82 using five base CNNs. SYD-Net's accuracy\non other datasets is remarkable, implying its efficiency. Our Sports-102 and\nDance-12 datasets are publicly available at\nhttps://sites.google.com/view/syd-net/home.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:00:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bera","Asish",""],["Nasipuri","Mita",""],["Krejcar","Ondrej",""],["Bhattacharjee","Debotosh",""]]}
{"id":"2308.00324","submitter":"Tatsumi Aoyama","authors":"Tatsumi Aoyama, Kazuyoshi Yoshimi, Kota Ido, Yuichi Motoyama, Taiki\n  Kawamura, Takahiro Misawa, Takeo Kato, Akito Kobayashi","title":"H-wave -- A Python package for the Hartree-Fock approximation and the\n  random phase approximation","comments":"14 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  H-wave is an open-source software package for performing the Hartree--Fock\napproximation (HFA) and random phase approximation (RPA) for a wide range of\nHamiltonians of interacting fermionic systems. In HFA calculations, H-wave\nexamines the stability of several symmetry-broken phases, such as\nanti-ferromagnetic and charge-ordered phases, in the given Hamiltonians at zero\nand finite temperatures. Furthermore, H-wave calculates the dynamical\nsusceptibilities using RPA to examine the instability toward the\nsymmetry-broken phases. By preparing a simple input file for specifying the\nHamiltonians, users can perform HFA and RPA for standard Hamiltonians in\ncondensed matter physics, such as the Hubbard model and its extensions.\nAdditionally, users can use a Wannier90-like format to specify fermionic\nHamiltonians. A Wannier90 format is implemented in RESPACK to derive ab initio\nHamiltonians for solids. HFA and RPA for the ab initio Hamiltonians can be\neasily performed using H-wave. In this paper, we first explain the basis of HFA\nand RPA, and the basic usage of H-wave, including download and installation.\nThereafter, the input file formats implemented in H-wave, including the\nWannier90-like format for specifying the interacting fermionic Hamiltonians,\nare discussed. Finally, we present several examples of H-wave such as\nzero-temperature HFA calculations for the extended Hubbard model on a square\nlattice, finite-temperature HFA calculations for the Hubbard model on a cubic\nlattice, and RPA in an extended Hubbard model on a square lattice.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:00:52 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Aoyama","Tatsumi",""],["Yoshimi","Kazuyoshi",""],["Ido","Kota",""],["Motoyama","Yuichi",""],["Kawamura","Taiki",""],["Misawa","Takahiro",""],["Kato","Takeo",""],["Kobayashi","Akito",""]]}
{"id":"2308.00325","submitter":"Yunze Hu","authors":"Yunze Hu, Jiaao Chen, Kangjie Zhou, Han Gao, Yutong Li and Chang Liu","title":"Informative Path Planning of Autonomous Vehicle for Parking Occupancy\n  Estimation","comments":"Extended version of publication in ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parking occupancy estimation holds significant potential in facilitating\nparking resource management and mitigating traffic congestion. Existing\napproaches employ robotic systems to detect the occupancy status of individual\nparking spaces and primarily focus on enhancing detection accuracy through\nperception pipelines. However, these methods often overlook the crucial aspect\nof robot path planning, which can hinder the accurate estimation of the entire\nparking area. In light of these limitations, we introduce the problem of\ninformative path planning for parking occupancy estimation using autonomous\nvehicles and formulate it as a Partially Observable Markov Decision Process\n(POMDP) task. Then, we develop an occupancy state transition model and\nintroduce a Bayes filter to estimate occupancy based on noisy sensor\nmeasurements. Subsequently, we propose the Monte Carlo Bayes Filter Tree, a\ncomputationally efficient algorithm that leverages progressive widening to\ngenerate informative paths. We demonstrate that the proposed approach\noutperforms the benchmark methods in diverse simulation environments,\neffectively striking a balance between optimality and computational efficiency.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:01:23 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hu","Yunze",""],["Chen","Jiaao",""],["Zhou","Kangjie",""],["Gao","Han",""],["Li","Yutong",""],["Liu","Chang",""]]}
{"id":"2308.00326","submitter":"Binghan He","authors":"Binghan He and Takashi Tanaka","title":"Safety Control of Uncertain Lagrangian Systems Using Dynamic Output\n  Feedback Barrier Pairs","comments":null,"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":"  Safety control of dynamical systems using barrier functions relies on knowing\nthe full state information. This paper introduces a novel approach for safety\ncontrol in uncertain Lagrangian systems with partial state information. The\nproposed method combines the synthesis of a vector norm barrier function and a\ndynamic output feedback safety controller to ensure robust safety enforcement.\nThe safety controller guarantees the invariance of the barrier function under\nuncertain dynamics and disturbances, providing reliable safety control. To\naddress the challenges associated with safety verification using partial state\ninformation, a barrier function estimator is developed. This estimator employs\nan identifier-based state estimator to obtain a state estimate that is affine\nin the uncertain model parameters of the system. By incorporating a priori\nknowledge of the limits of the uncertain model parameters and disturbances, the\nstate estimate provides a robust upper bound for the barrier function.\nComparative analysis with existing control barrier function based methods\ndemonstrates the superiority of the proposed approach in enforcing safety\nconstraints under adverse conditions, including tight input constraints and the\nutilization of estimated state information.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:02:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["He","Binghan",""],["Tanaka","Takashi",""]]}
{"id":"2308.00327","submitter":"Taehyun Yoon","authors":"Taehyun Yoon, Jinwon Choi, Hyokun Yun, Sungbin Lim","title":"Threshold-aware Learning to Generate Feasible Solutions for Mixed\n  Integer Programs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Finding a high-quality feasible solution to a combinatorial optimization (CO)\nproblem in a limited time is challenging due to its discrete nature. Recently,\nthere has been an increasing number of machine learning (ML) methods for\naddressing CO problems. Neural diving (ND) is one of the learning-based\napproaches to generating partial discrete variable assignments in Mixed Integer\nPrograms (MIP), a framework for modeling CO problems. However, a major drawback\nof ND is a large discrepancy between the ML and MIP objectives, i.e., variable\nvalue classification accuracy over primal bound. Our study investigates that a\nspecific range of variable assignment rates (coverage) yields high-quality\nfeasible solutions, where we suggest optimizing the coverage bridges the gap\nbetween the learning and MIP objectives. Consequently, we introduce a post-hoc\nmethod and a learning-based approach for optimizing the coverage. A key idea of\nour approach is to jointly learn to restrict the coverage search space and to\npredict the coverage in the learned search space. Experimental results\ndemonstrate that learning a deep neural network to estimate the coverage for\nfinding high-quality feasible solutions achieves state-of-the-art performance\nin NeurIPS ML4CO datasets. In particular, our method shows outstanding\nperformance in the workload apportionment dataset, achieving the optimality gap\nof 0.45%, a ten-fold improvement over SCIP within the one-minute time limit.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:03:16 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yoon","Taehyun",""],["Choi","Jinwon",""],["Yun","Hyokun",""],["Lim","Sungbin",""]]}
{"id":"2308.00328","submitter":"Chong Ge","authors":"Chong Ge, Ming Sun, Paul E. J. Nulsen, Craig Sarazin, Maxim\n  Markevitch, Gerrit Schellenberger","title":"A detached double X-ray tail in the merging galaxy cluster Z8338 with a\n  large double tail","comments":"11 pages, 8 figures, MNRAS accepted","journal-ref":null,"doi":"10.1093/mnras/stad2397","report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When subhalos infall into galaxy clusters, their gas content is ram pressure\nstripped by the intracluster medium (ICM) and may turn into cometary tails. We\nreport the discovery of two spectacular X-ray double tails in a single galaxy\ncluster, Z8338, revealed by 70 ks Chandra observations. The brighter one, with\nan X-ray bolometric luminosity of $3.9 \\times 10^{42}{\\rm\\ erg\\ s}^{-1}$, is a\ndetached tail stripped from the host halo and extended at least 250 kpc in\nprojection. The head of the detached tail is a cool core with the front tip of\nthe cold front $\\sim$ 30 kpc away from the nucleus of its former host galaxy.\nThe cooling time of the detached cool core is $\\sim 0.3$ Gyr. For the detached\ngas, the gravity of the once-associated dark matter halo further enhances the\nRayleigh-Taylor (RT) instability. From its survival, we find that a magnetic\nfield of a few $\\mu$G is required to suppress the hydrodynamic instability. The\nX-ray temperature in the tail increases from 0.9 keV at the front tip to 1.6\nkeV in the wake region, which suggests the turbulent mixing with the hotter\nICM. The fainter double X-ray tail, with a total X-ray luminosity of $2.7\n\\times 10^{42}{\\rm\\ erg\\ s}^{-1}$, appears to stem from the cool core of a\nsubcluster in Z8338, and likely was formed during the ongoing merger. This\nexample suggests that X-ray cool cores can be displaced and eventually\ndestroyed by mergers, while the displaced cool cores can survive for some\nextended period of time.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:04:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ge","Chong",""],["Sun","Ming",""],["Nulsen","Paul E. J.",""],["Sarazin","Craig",""],["Markevitch","Maxim",""],["Schellenberger","Gerrit",""]]}
{"id":"2308.00329","submitter":"Raghunath Sahoo","authors":"Suraj Prasad, Neelkamal Mallick, and Raghunath Sahoo","title":"Inclusive, prompt and non-prompt $\\rm{J}/\\psi$ identification in\n  proton-proton collisions at the Large Hadron Collider using machine learning","comments":"12 pages and 9 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":"  Studies related to $\\rm{J}/\\psi$ meson, a bound state of charm and anti-charm\nquarks ($c\\bar{c}$), in heavy-ion collisions, provide genuine testing grounds\nfor the theory of strong interaction, quantum chromodynamics (QCD). To better\nunderstand the underlying production mechanism, cold nuclear matter effects,\nand influence from the quark-gluon plasma, baseline measurements are also\nperformed in proton-proton ($pp$) and proton-nucleus ($p$--A) collisions. The\ninclusive $\\rm{J}/\\psi$ measurement has contributions from both prompt and\nnon-prompt productions. The prompt $\\rm{J}/\\psi$ is produced directly from the\nhadronic interactions or via feed-down from directly produced higher charmonium\nstates, whereas non-prompt $\\rm{J}/\\psi$ comes from the decay of beauty\nhadrons. In experiments, $\\rm{J}/\\psi$ is reconstructed through its\nelectromagnetic decays to lepton pairs, in either $e^{+}+e^{-}$ or\n$\\mu^{+}+\\mu^{-}$ decay channels. In this work, for the first time, machine\nlearning techniques are implemented to separate the prompt and non-prompt\ndimuon pairs from the background to obtain a better identification of the\n$\\rm{J}/\\psi$ signal for different production modes. The study has been\nperformed in $pp$ collisions at $\\sqrt{s} = 7$ and 13 TeV simulated using\nPYTHIA8. Machine learning models such as XGBoost and LightGBM are explored. The\nmodels could achieve up to 99\\% prediction accuracy. The transverse momentum\n($p_{\\rm T}$) and rapidity ($y$) differential measurements of inclusive,\nprompt, and non-prompt $\\rm{J}/\\psi$, its multiplicity dependence, and the\n$p_{\\rm T}$ dependence of fraction of non-prompt $\\rm{J}/\\psi$ ($f_{\\rm B}$)\nare shown. These results are compared to experimental findings wherever\npossible.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:08:17 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Prasad","Suraj",""],["Mallick","Neelkamal",""],["Sahoo","Raghunath",""]]}
{"id":"2308.00330","submitter":"Matti Henning","authors":"Matti Henning, Michael Buchholz, and Klaus Dietmayer","title":"Advancing Frame-Dropping in Multi-Object Tracking-by-Detection Systems\n  Through Event-Based Detection Triggering","comments":"Accepted for publication at the 26th IEEE International Conference on\n  Intelligent Transportation Systems 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With rising computational requirements modern automated vehicles (AVs) often\nconsider trade-offs between energy consumption and perception performance,\npotentially jeopardizing their safe operation. Frame-dropping in\ntracking-by-detection perception systems presents a promising approach,\nalthough late traffic participant detection might be induced.\n  In this paper, we extend our previous work on frame-dropping in\ntracking-by-detection perception systems. We introduce an additional\nevent-based triggering mechanism using camera object detections to increase\nboth the system's efficiency, as well as its safety. Evaluating both single and\nmulti-modal tracking methods we show that late object detections are mitigated\nwhile the potential for reduced energy consumption is significantly increased,\nreaching nearly 60 Watt per reduced point in HOTA score.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:09:09 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Henning","Matti",""],["Buchholz","Michael",""],["Dietmayer","Klaus",""]]}
{"id":"2308.00331","submitter":"Jiaping Xiao","authors":"Yun Chen, Jiaping Xiao","title":"Target Search and Navigation in Heterogeneous Robot Systems with Deep\n  Reinforcement Learning","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":"  Collaborative heterogeneous robot systems can greatly improve the efficiency\nof target search and navigation tasks. In this paper, we design a heterogeneous\nrobot system consisting of a UAV and a UGV for search and rescue missions in\nunknown environments. The system is able to search for targets and navigate to\nthem in a maze-like mine environment with the policies learned through deep\nreinforcement learning algorithms. During the training process, if two robots\nare trained simultaneously, the rewards related to their collaboration may not\nbe properly obtained. Hence, we introduce a multi-stage reinforcement learning\nframework and a curiosity module to encourage agents to explore unvisited\nenvironments. Experiments in simulation environments show that our framework\ncan train the heterogeneous robot system to achieve the search and navigation\nwith unknown target locations while existing baselines may not, and accelerate\nthe training speed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:09:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chen","Yun",""],["Xiao","Jiaping",""]]}
{"id":"2308.00332","submitter":"Wang Qisi","authors":"Dai Honghua, Wang Qisi, Yan Zipu and Yue Xiaokui","title":"Reconstruction Harmonic Balance Method and its Application in Solving\n  Complex Nonlinear Dynamical Systems","comments":"14 pages, in Chinese language, and 14 pictures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The harmonic balance method is the most commonly used method for solving\nperiodic solutions of nonlinear dynamic systems, but the high-order\napproximation of nonlinear terms requires sophisticated formula derivation,\nwhich limits its ultra-high accuracy. The authors' team proposed the\nreconstruction harmonic balance (RHB) method through the equivalent\nreconstruction of the frequency domain nonlinear quantity in the time domain,\nwhich settled the problem of ultra-high-order calculation of the classical\nharmonic balance method. However, both methods require the dynamical system to\nbe polynomial nonlinear, and cannot be directly used to solve the\nquasi-periodic solution of the nonlinear system. In view of the above problems,\nthis paper proposes a computational method that combines the RHB method and the\nrecast technique for complex nonlinear systems. First, the general nonlinear\nproblem is non-destructively recast into a polynomial nonlinear system, and\nthen the RHB method is used for high-precision solutions. Aiming at computing\nthe quasi-periodic response, the RHB method based on the idea of \"supplemental\nfrequency\" is derived. By optimizing and selecting base frequencies, the fast\nand accurate capture of quasi-periodic response is achieved. The typical\nsystems such as nonlinear pendulum, relativistic harmonic oscillator, and\nnonlinear coupling asymmetric pendulum are selected for simulation. The\nsimulation results show that the accuracy of the RHB-recast method for solving\nnonpolynomial nonlinear systems is on the order of 10^(-12), reaching the\ncomputer accuracy, far exceeding state-of-the-art methods. The supplemental\nfrequency RHB method achieves the efficient solution of quasi-periodic\nproblems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:09:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Honghua","Dai",""],["Qisi","Wang",""],["Zipu","Yan",""],["Xiaokui","Yue",""]]}
{"id":"2308.00333","submitter":"Bent Weber","authors":"Yande Que, Amit Kumar, Michael S. Lodge, Zhengjue Tong, Marcus Lai Kar\n  Fai, Wei Tao, Zhenhao Cui, Ranjith Shivajirao, Junxiang Jia, Siew Eang Lee,\n  and Bent Weber","title":"Performance benchmarking of an ultra-low vibration laboratory to host a\n  commercial millikelvin scanning tunnelling microscope","comments":null,"journal-ref":null,"doi":"10.1088/1361-6528/acebf7","report-no":null,"categories":"cond-mat.supr-con cond-mat.other cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultra-low temperature scanning tunnelling microscopy and spectroscopy\n(STM/STS) achieved by dilution refrigeration can provide unrivalled insight\ninto the local electronic structure of quantum materials and atomic-scale\nquantum systems. Effective isolation from mechanical vibration and acoustic\nnoise is critical in order to achieve ultimate spatial and energy resolution.\nHere, we report on the design and performance of an ultra-low vibration (ULV)\nlaboratory hosting a customized but otherwise commercially available 40mK STM.\nThe design of the vibration isolation consists of a T-shaped concrete mass\nblock (55t), suspended by actively controlled pneumatic springs, and placed on\na foundation separated from the surrounding building in a \"room-within-a-room\"\ndesign. Vibration levels achieved are meeting the VC-M vibration standard at >3\nHz, reached only in a limited number of laboratories worldwide. Measurement of\nthe STM's junction noise confirms effective vibration isolation on par with\ncustom built STMs in ULV laboratories. In this tailored low-vibration\nenvironment, the STM achieves an energy resolution of 43ueV (144 mK), promising\nfor the investigation and control of quantum matter at atomic length scales.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:11:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Que","Yande",""],["Kumar","Amit",""],["Lodge","Michael S.",""],["Tong","Zhengjue",""],["Fai","Marcus Lai Kar",""],["Tao","Wei",""],["Cui","Zhenhao",""],["Shivajirao","Ranjith",""],["Jia","Junxiang",""],["Lee","Siew Eang",""],["Weber","Bent",""]]}
{"id":"2308.00334","submitter":"Christian Rieck","authors":"Omrit Filtser and Erik Krohn and Bengt J. Nilsson and Christian Rieck\n  and Christiane Schmidt","title":"Minimum $k$-Hop Dominating Sets in Grid Graphs","comments":"18 pages, 13 figures. Paper accompanying a conference submission with\n  a minor fix of the algorithm","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a graph $G$, the $k$-hop dominating set problem asks for a vertex\nsubset $D_k$ such that every vertex of $G$ is in distance at most $k$ to some\nvertex in $D_k$ ($k\\in \\mathbb{N}$). For $k=1$, this corresponds to the\nclassical dominating set problem in graphs.\n  We study the $k$-hop dominating set problem in grid graphs (motivated by\ngeneralized guard sets in polyominoes). We show that the VC dimension of this\nproblem is 3 in grid graphs without holes, and 4 in general grid graphs.\nFurthermore, we provide a reduction from planar monotone 3SAT, thereby showing\nthat the problem is NP-complete even in thin grid graphs (i.e., grid graphs\nthat do not a contain an induced $C_4$). Complementary, we present a\nlinear-time $4$-approximation algorithm for $2$-thin grid graphs (which do not\ncontain a $3\\times 3$-grid subgraph) for all $k\\in \\mathbb{N}$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:13:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Filtser","Omrit",""],["Krohn","Erik",""],["Nilsson","Bengt J.",""],["Rieck","Christian",""],["Schmidt","Christiane",""]]}
{"id":"2308.00335","submitter":"Wei Qingmeng","authors":"Hongwei Mei, Qingmeng Wei, Jiongmin Yong","title":"Linear-Quadratic Optimal Control Problem for Mean-Field Stochastic\n  Differential Equations with a Type of Random Coefficients","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 linear-quadratic optimal control problems (LQ problems, for\nshort) for mean-field stochastic differential equations (SDEs, for short) with\nthe coefficients containing regime switching governed by a Markov chain, we\nconsider an LQ problem for an SDE with the coefficients being adapted to a\nfiltration independent of the Brownian motion driving the control system.\nClassical approach of completing the square is applied to the current problem\nand obvious shortcomings are indicated. Open-loop and closed-loop solvability\nare introduced and characterized.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:17:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mei","Hongwei",""],["Wei","Qingmeng",""],["Yong","Jiongmin",""]]}
{"id":"2308.00336","submitter":"Jiaying Xu","authors":"Jiaying Xu, Yi Feng, Di Li, Pei Wang, Yongkun Zhang, Jintao Xie, Huaxi\n  Chen, Han Wang, Zhixuan Kang, Jingjing Hu, Yun Zheng, Chao-Wei Tsai, Xianglei\n  Chen, and Dengke Zhou","title":"Blinkverse: A Database of Fast Radio Bursts","comments":"13 pages, 9 figures","journal-ref":"Universe 2023, 9(7), 330","doi":"10.3390/universe9070330","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The volume of research on fast radio bursts (FRBs) observation have been\nseeing a dramatic growth. To facilitate the systematic analysis of the FRB\npopulation, we established a database platform, Blinkverse\n(https://blinkverse.alkaidos.cn), as a central inventory of FRBs from various\nobservatories and with published properties, particularly dynamic spectra from\nFAST, CHIME, GBT, Arecibo, etc. Blinkverse thus not only forms a superset of\nFRBCAT, TNS, and CHIME/FRB, but also provides convenient access to thousands of\nFRB dynamic spectra from FAST, some of which were not available before.\nBlinkverse is regularly maintained and will be updated by external users in the\nfuture. Data entries of FRBs can be retrieved through parameter searches\nthrough FRB location, fluence, etc., and their logical combinations.\nInteractive visualization was built into the platform. We analyzed the energy\ndistribution, period analysis, and classification of FRBs based on data\ndownloaded from Blinkverse. The energy distributions of repeaters and\nnon-repeaters are found to be distinct from one another.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:17:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xu","Jiaying",""],["Feng","Yi",""],["Li","Di",""],["Wang","Pei",""],["Zhang","Yongkun",""],["Xie","Jintao",""],["Chen","Huaxi",""],["Wang","Han",""],["Kang","Zhixuan",""],["Hu","Jingjing",""],["Zheng","Yun",""],["Tsai","Chao-Wei",""],["Chen","Xianglei",""],["Zhou","Dengke",""]]}
{"id":"2308.00337","submitter":"Shio Inagaki","authors":"Shoichi Yoneta, Hiroyuki Ebata, and Shio Inagaki","title":"Convection of mono-disperse particles in a highly filled rotating\n  cylinder","comments":"5 pages, 4 figures, and Supplemental materials (6 pages)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We investigate the occurrence of spontaneous convection in a coaxial cylinder\nhighly filled with mono-disperse spheres.\n  To analyze the flow field non-invasively, initial pulses consisting of\ncolored particles are placed at equal intervals.\n  By analyzing the spatio-temporal distribution of these pulses, we obtained\naxial velocity profiles for both the surface and subsurface regions.\n  Our advection-diffusion equations with steady advection terms incorporate\nexperimentally obtained axial velocity profiles in the surface layer, while the\nrest of the components are estimated using azimuthal symmetry and volume\nconservation.\n  The validity of our model is confirmed by comparing experimental data with\nnumerical solutions for both the spatio-temporal distribution and\ncross-sectional profile of the colored particles.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:18:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yoneta","Shoichi",""],["Ebata","Hiroyuki",""],["Inagaki","Shio",""]]}
{"id":"2308.00338","submitter":"Lei Liu","authors":"Xijun Hu, Lei Liu, Yuwei Ou, Pedro A. S. Salom\\~ao and Guowei Yu","title":"A symplectic dynamics approach to the spatial isosceles three-body\n  problem","comments":"66 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the spatial isosceles three-body problem from the perspective of\nSymplectic Dynamics. For certain choices of mass ratio, angular momentum, and\nenergy, the dynamics on the energy surface is equivalent to a Reeb flow on the\ntight three-sphere. We find a Hopf link formed by the Euler orbit and a\nsymmetric brake orbit, which spans an open book decomposition whose pages are\nannulus-like global surfaces of section. In the case of large mass ratios, the\nHopf link is non-resonant, forcing the existence of infinitely many periodic\norbits. The rotation number of the Euler orbit plays a fundamental role in the\nexistence of periodic orbits and their symmetries. We explore such symmetries\nin the Hill region and show that the Euler orbit is negative hyperbolic for an\nopen set of parameters while it can never be positive hyperbolic. Finally, we\naddress convexity and determine for each parameter whether the energy surface\nis strictly convex, convex, or non-convex. Dynamical consequences of this fact\nare then discussed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:20:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hu","Xijun",""],["Liu","Lei",""],["Ou","Yuwei",""],["Salom\u00e3o","Pedro A. S.",""],["Yu","Guowei",""]]}
{"id":"2308.00339","submitter":"Tripta Bhatia","authors":"Harshit Kumar, Sayar Mandal, Suhasi Gupta, Hemraj Meena, Mayur Kadu,\n  Rajni Kudawla, Pratibha Sharma, Indu Pal Kaur, John H Ipsen and Tripta Bhatia","title":"Bottom-Up Approach to Explore Alpha-Amylase Assisted Membrane\n  Remodelling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Soluble alpha-amylases play an important role in the catabolism of\npolysaccharides. In this work, we show that the enzyme can interact with the\nlipid membrane and further alter its mechanical properties. Vesicle fluctuation\nspectroscopy is used for quantitative measurement of the membrane bending\nrigidity of phosphatidylcholines lipid vesicles from the shape fluctuation\nbased on the whole contour of Giant Unilamellar Vesicles (GUVs). The bending\nrigidity of the lipid vesicles of\n1-palmitoyl-2-oleoyl-sn-glycero-3-phosphocholine in water increases\nsignificantly with the presence of 0.14 micromolar alpha-amylase in the\nexterior solution. However, as the concentration increases above 1 micromolar,\nthe bending rigidity decreases but remains higher than estimated without the\nprotein. Contact between the alpha-amylase in the outer solution and the outer\nleaflet leads to spontaneous membrane curvature and the corresponding\nmorphological changes of the GUVs. The presence of outbuds directly\ndemonstrates that AA has a preferable interaction with the membrane, giving a\npositive spontaneous curvature of $C_0 \\leq 0.05 \\ \\mu \\rm{m}^{-1}$ at $18 \\\n\\mu$M $(\\approx$ 1 mg/ml) of AA concentration. Above 1 mg/ml of AA\nconcentration the shape of GUVs collapse completely suggesting a highly\nconvoluted state.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:20:51 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kumar","Harshit",""],["Mandal","Sayar",""],["Gupta","Suhasi",""],["Meena","Hemraj",""],["Kadu","Mayur",""],["Kudawla","Rajni",""],["Sharma","Pratibha",""],["Kaur","Indu Pal",""],["Ipsen","John H",""],["Bhatia","Tripta",""]]}
{"id":"2308.00340","submitter":"Santanu Mandal Mr","authors":"Santanu Mandal","title":"A short note on cospectral and integral chain graphs for Seidel matrix","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this brief communication, we investigate the cospectral as well integral\nchain graphs for Seidel matrix, a key component to study the structural\nproperties of equiangular lines in space. We derive a formula that allows to\ngenerate an infinite number of inequivalent chain graphs with identical\nspectrum. In addition, we obtain a family of Seidel integral chain graphs. This\ncontrapositively answers a problem posed by Greaves [\"Equiangular line systems\nand switching classes containing regular graphs\", Linear Algebra Appl., (2018)]\n(\"Does every Seidel matrix with precisely three distinct rational eigenvalues\ncontain a regular graph in its switching class?\"). Our observation is- \"no\".\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:25:18 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mandal","Santanu",""]]}
{"id":"2308.00341","submitter":"Kaushik Mallik","authors":"Thomas A. Henzinger, Konstantin Kueffner, Kaushik Mallik","title":"Monitoring Algorithmic Fairness under Partial Observations","comments":"The extended version of the paper, with the same title, published in\n  23rd International Conference on Runtime Verification (RV'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As AI and machine-learned software are used increasingly for making decisions\nthat affect humans, it is imperative that they remain fair and unbiased in\ntheir decisions. To complement design-time bias mitigation measures, runtime\nverification techniques have been introduced recently to monitor the\nalgorithmic fairness of deployed systems. Previous monitoring techniques assume\nfull observability of the states of the (unknown) monitored system. Moreover,\nthey can monitor only fairness properties that are specified as arithmetic\nexpressions over the probabilities of different events. In this work, we extend\nfairness monitoring to systems modeled as partially observed Markov chains\n(POMC), and to specifications containing arithmetic expressions over the\nexpected values of numerical functions on event sequences. The only assumptions\nwe make are that the underlying POMC is aperiodic and starts in the stationary\ndistribution, with a bound on its mixing time being known. These assumptions\nenable us to estimate a given property for the entire distribution of possible\nexecutions of the monitored POMC, by observing only a single execution. Our\nmonitors observe a long run of the system and, after each new observation,\noutput updated PAC-estimates of how fair or biased the system is. The monitors\nare computationally lightweight and, using a prototype implementation, we\ndemonstrate their effectiveness on several real-world examples.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:35:54 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Henzinger","Thomas A.",""],["Kueffner","Konstantin",""],["Mallik","Kaushik",""]]}
{"id":"2308.00342","submitter":"Qiming Fu","authors":"Qi-Ming Fu, Meng-Ci He, Tao-Tao Sui, and Xin Zhang","title":"Reconstruction of relativistic modified Newtonian dynamics for various\n  cosmological scenarios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present several explicit reconstructions for a novel\nrelativistic theory of modified Newtonian dynamics (RMOND) derived from the\nbackground of Friedmann-Lema$\\hat{\\text{\\i}}$tre-Robertson-Walker cosmological\nevolution. It is shown that the Einstein-Hilbert Lagrangian with a positive\ncosmological constant is the only Lagrangian capable of accurately replicating\nthe exact expansion history of the $\\Lambda$ cold dark matter ($\\Lambda$CDM)\nuniverse filled solely with dust-like matter and the only way to achieve this\nexpansion history for the RMOND theory is to introduce additional degrees of\nfreedom to the matter sectors. Besides, we find that the $\\Lambda$CDM-era also\ncan be replicated without any real matter field within the framework of the\nRMOND theory and the cosmic evolution exhibited by both the power-law and\nde-Sitter solutions also can be obtained.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:37:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Fu","Qi-Ming",""],["He","Meng-Ci",""],["Sui","Tao-Tao",""],["Zhang","Xin",""]]}
{"id":"2308.00343","submitter":"Nora H\\\"anni","authors":"N. H\\\"anni, K. Altwegg, D. Baklouti, M. Combi, S. A. Fuselier, J. De\n  Keyser, D. R. M\\\"uller, M. Rubin, S. F. Wampfler","title":"Oxygen-bearing organic molecules in comet 67P's dusty coma: first\n  evidence for abundant heterocycles","comments":"Reproduced with permission from Astronomy & Astrophysics, copyright\n  ESO","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The puzzling complexity of terrestrial biomolecules is driving the search for\ncomplex organic molecules in the Interstellar Medium (ISM) and serves as a\nmotivation for many in situ studies of reservoirs of extraterrestrial organics\nfrom meteorites and interplanetary dust particles (IDPs) to comets and\nasteroids. Comet 67P/Churyumov-Gerasimenko (67P) -- the best-studied comet to\ndate -- has been visited and accompanied for two years by the European Space\nAgency's Rosetta spacecraft. Around 67P's perihelion and under dusty\nconditions, the high-resolution mass spectrometer on board provided a\nspectacular glimpse into this comet's chemical complexity. For this work, we\nanalyzed in unprecedented detail the O-bearing organic volatiles. In a\ncomparison of 67P's inventory to molecules detected in the ISM, in other\ncomets, and in Soluble Organic Matter (SOM) extracted from the Murchison\nmeteorite, we also highlight the (pre)biotic relevance of different chemical\ngroups of species. We report first evidence for abundant extraterrestrial\nO-bearing heterocycles (with abundances relative to methanol often on the order\nof 10% with a relative error margin of 30-50%) and various representatives of\nother molecule classes such as carboxylic acids and esters, aldehydes, ketones,\nand alcohols. Like with the pure hydrocarbons, some hydrogenated forms seem to\nbe dominant over their dehydrogenated counterparts. An interesting example is\ntetrahydrofuran (THF) as it might be a more promising candidate for searches in\nthe ISM than the long-sought furan itself. Our findings not only support and\nguide future efforts to investigate the origins of chemical complexity in\nspace, but also they strongly encourage studies of, e.g., the ratios of\nunbranched vs. branched and hydrogenated vs. dehydrogenated species in\nastrophysical ice analogs in the laboratory as well as by modeling.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:37:45 GMT"}],"update_date":"2023-08-02","authors_parsed":[["H\u00e4nni","N.",""],["Altwegg","K.",""],["Baklouti","D.",""],["Combi","M.",""],["Fuselier","S. A.",""],["De Keyser","J.",""],["M\u00fcller","D. R.",""],["Rubin","M.",""],["Wampfler","S. F.",""]]}
{"id":"2308.00344","submitter":"Pia Hanfeld","authors":"Pia Hanfeld, Khaled Wahba, Marina M.-C. H\\\"ohne, Michael Bussmann,\n  Wolfgang H\\\"onig","title":"Kidnapping Deep Learning-based Multirotors using Optimized Flying\n  Adversarial Patches","comments":"7 pages, 5 figures. arXiv admin note: substantial text overlap with\n  arXiv:2305.12859","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous flying robots, such as multirotors, often rely on deep learning\nmodels that makes predictions based on a camera image, e.g. for pose\nestimation. These models can predict surprising results if applied to input\nimages outside the training domain. This fault can be exploited by adversarial\nattacks, for example, by computing small images, so-called adversarial patches,\nthat can be placed in the environment to manipulate the neural network's\nprediction. We introduce flying adversarial patches, where multiple images are\nmounted on at least one other flying robot and therefore can be placed anywhere\nin the field of view of a victim multirotor. By introducing the attacker\nrobots, the system is extended to an adversarial multi-robot system. For an\neffective attack, we compare three methods that simultaneously optimize\nmultiple adversarial patches and their position in the input image. We show\nthat our methods scale well with the number of adversarial patches. Moreover,\nwe demonstrate physical flights with two robots, where we employ a novel attack\npolicy that uses the computed adversarial patches to kidnap a robot that was\nsupposed to follow a human.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:38:31 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hanfeld","Pia",""],["Wahba","Khaled",""],["H\u00f6hne","Marina M. -C.",""],["Bussmann","Michael",""],["H\u00f6nig","Wolfgang",""]]}
{"id":"2308.00345","submitter":"Jun Nishimura","authors":"Jun Nishimura","title":"Quantum tunneling in the real-time path integral by the Lefschetz\n  thimble method","comments":"15 pages, 4 figures, Contribution to the proceedings of the Corfu\n  Summer Institute 2022 \"School and Workshops on Elementary Particle Physics\n  and Gravity\" (CORFU2022), 28 August - 1 October 2022, Corfu, Greece, based on\n  arXiv:2307.11199 [hep-th]","journal-ref":null,"doi":null,"report-no":"KEK-TH-2541","categories":"hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum tunneling is mostly discussed in the Euclidean path integral\nformalism using instantons. On the other hand, it is difficult to understand\nquantum tunneling based on the real-time path integral due to its oscillatory\nnature, which causes the notorious sign problem. We show that recent\ndevelopment of the Lefschetz thimble method enables us to investigate this\nissue numerically. In particular, we find that quantum tunneling occurs due to\ncomplex trajectories, which are actually observable experimentally by using the\nso-called weak measurement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:40:32 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Nishimura","Jun",""]]}
{"id":"2308.00346","submitter":"Ruoxi Qin","authors":"Ruoxi Qin, Linyuan Wang, Xuehui Du, Xingyuan Chen, Bin Yan","title":"Dynamic ensemble selection based on Deep Neural Network Uncertainty\n  Estimation for Adversarial Robustness","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 deep neural network has attained significant efficiency in image\nrecognition. However, it has vulnerable recognition robustness under extensive\ndata uncertainty in practical applications. The uncertainty is attributed to\nthe inevitable ambient noise and, more importantly, the possible adversarial\nattack. Dynamic methods can effectively improve the defense initiative in the\narms race of attack and defense of adversarial examples. Different from the\nprevious dynamic method depend on input or decision, this work explore the\ndynamic attributes in model level through dynamic ensemble selection technology\nto further protect the model from white-box attacks and improve the robustness.\nSpecifically, in training phase the Dirichlet distribution is apply as prior of\nsub-models' predictive distribution, and the diversity constraint in parameter\nspace is introduced under the lightweight sub-models to construct alternative\nensembel model spaces. In test phase, the certain sub-models are dynamically\nselected based on their rank of uncertainty value for the final prediction to\nensure the majority accurate principle in ensemble robustness and accuracy.\nCompared with the previous dynamic method and staic adversarial traning model,\nthe presented approach can achieve significant robustness results without\ndamaging accuracy by combining dynamics and diversity property.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:41:41 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Qin","Ruoxi",""],["Wang","Linyuan",""],["Du","Xuehui",""],["Chen","Xingyuan",""],["Yan","Bin",""]]}
{"id":"2308.00347","submitter":"Daehan Park","authors":"Jae-Hwan Choi, Jaehoon Kang, Daehan Park","title":"A regularity theory for parabolic equations with anisotropic non-local\n  operators in $L_{q}(L_{p})$ spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present an $L_q(L_p)$-regularity theory for parabolic\nequations of the form: $$ \\partial_t\nu(t,x)=\\mathcal{L}^{\\vec{a},\\vec{b}}(t)u(t,x)+f(t,x),\\quad u(0,x)=0. $$ Here,\n$\\mathcal{L}^{\\vec{a},\\vec{b}}(t)$ represents anisotropic non-local operators\nencompassing the singular anisotropic fractional Laplacian with measurable\ncoefficients: $$ -\\sum_{i=1}^{\\ell}a_{i}(t)(-\\Delta_{x_i})^{\\alpha_i/2}. $$ To\naddress the anisotropy of the operator, we employ a probabilistic\nrepresentation of the solution and Calder\\'on-Zygmund theory. As applications\nof our results, we demonstrate the solvability of elliptic equations with\nanisotropic non-local operators and parabolic equations with isotropic\nnon-local operators.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:42:28 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Choi","Jae-Hwan",""],["Kang","Jaehoon",""],["Park","Daehan",""]]}
{"id":"2308.00348","submitter":"Sela Fried","authors":"Sela Fried and Toufik Mansour","title":"On the maximal sum of the entries of a matrix power","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $p_n$ be the maximal sum of the entries of $A^2$, where $A$ is a square\nmatrix of size $n$, consisting of the numbers $1,2,\\ldots,n^2$, each appearing\nexactly once. We prove that $m_n=\\Theta(n^7)$. More precisely, we show that\n$n(240n^{6}+28n^{5}+364n^{4}+210n^{2}-28n+26-105((-1)^{n}+1))/840\\leq p_n\\leq\nn^{3}(n^{2}+1)(7n^{2}+5)/24$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:42:52 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fried","Sela",""],["Mansour","Toufik",""]]}
{"id":"2308.00349","submitter":"Jaker Hossain","authors":"Md. Sabbir Hossain, Md. Alamin Hossain pappu, Bipanko Kumar Mondal,\n  Ahnaf Tahmid Abir and Jaker Hossain","title":"Highly efficient CdTe solar cell with a thin CIT current booster:\n  theoretical insights","comments":"26 pages, 9 figures, 1 Table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CdTe-based thin film solar cell has been modeled and enumerated with a thin\nCuInTe2 (CIT) current booster layer. CdTe-based n-CdS/p-CdTe/p+-CIT/p++-WSe2\nheterojunction device has been evaluated for the highest performance. It is\nrevealed that physical parameters such as thickness, doping, and defects of the\nCIT layer have a significant influence on the performance of the CdTe solar\ncell. The device shows an efficiency of 37.46% with an open circuit voltage,\nVOC of 1.102 V, short circuit current density, JSC of 38.50 mA/cm2, and fill\nfactor, FF of 88.30%. The use of the photon recycling technique with a\nBragg-reflector with 98% back and 95% front reflectance only provides an\nefficiency of ~44.3% with a current of 45.4 mA/cm2. These findings are very\nhopeful for the production of an efficient CdTe solar cells in the near future.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:42:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hossain","Md. Sabbir",""],["pappu","Md. Alamin Hossain",""],["Mondal","Bipanko Kumar",""],["Abir","Ahnaf Tahmid",""],["Hossain","Jaker",""]]}
{"id":"2308.00350","submitter":"Kishan Wimalawarne","authors":"Kishan Wimalawarne, Taiji Suzuki, Sophie Langer","title":"Learning Green's Function Efficiently Using Low-Rank Approximations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning the Green's function using deep learning models enables to solve\ndifferent classes of partial differential equations. A practical limitation of\nusing deep learning for the Green's function is the repeated computationally\nexpensive Monte-Carlo integral approximations. We propose to learn the Green's\nfunction by low-rank decomposition, which results in a novel architecture to\nremove redundant computations by separate learning with domain data for\nevaluation and Monte-Carlo samples for integral approximation. Using\nexperiments we show that the proposed method improves computational time\ncompared to MOD-Net while achieving comparable accuracy compared to both PINNs\nand MOD-Net.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:43:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wimalawarne","Kishan",""],["Suzuki","Taiji",""],["Langer","Sophie",""]]}
{"id":"2308.00351","submitter":"Zixuan Peng","authors":"Zixuan Peng, Crystal L. Martin, Pierre Thibodeaux, Jichen Zhang, Weida\n  Hu, Yuan Li","title":"Using KCWI to Explore the Chemical Inhomogeneities and Evolution of\n  J1044+0353","comments":"23 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  J1044+0353 is considered a local analog of the young galaxies that ionized\nthe intergalactic medium at high-redshift due to its low mass, low metallicity,\nhigh specific star formation rate, and strong high-ionization emission lines.\nWe use integral field spectroscopy to trace the propagation of the starburst\nacross this small galaxy using Balmer emission- and absorption-line equivalent\nwidths and find a post-starburst population (~ 15 - 20 Myr) roughly one kpc\neast of the much younger, compact starburst (~ 3 - 4 Myr). Using the direct\nelectron temperature method to map the O/H abundance ratio, we find similar\nmetallicity (1 to 3 sigma) between the starburst and post-starburst regions but\nwith a significant dispersion of about 0.3 dex within the latter. We also map\nthe Doppler shift and width of the strong emission lines. Over scales several\ntimes the size of the galaxy, we discover a velocity gradient parallel to the\ngalaxy's minor axis. The steepest gradients (~ 30 $\\mathrm{km \\ s^{-1} \\\nkpc^{-1}}$) appear to emanate from the oldest stellar association. We identify\nthe velocity gradient as an outflow viewed edge-on based on the increased line\nwidth and skew in a biconical region. We discuss how this outflow and the gas\ninflow necessary to trigger the starburst affect the chemical evolution of\nJ1044+0353. We conclude that the stellar associations driving the galactic\noutflow are spatially offset from the youngest association, and a chemical\nevolution model with a metal-enriched wind requires a more realistic inflow\nrate than a homogeneous chemical evolution model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:47:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Peng","Zixuan",""],["Martin","Crystal L.",""],["Thibodeaux","Pierre",""],["Zhang","Jichen",""],["Hu","Weida",""],["Li","Yuan",""]]}
{"id":"2308.00352","submitter":"Sirui Hong","authors":"Sirui Hong, Xiawu Zheng, Jonathan Chen, Yuheng Cheng, Jinlin Wang,\n  Ceyao Zhang, Zili Wang, Steven Ka Shing Yau, Zijuan Lin, Liyang Zhou, Chenyu\n  Ran, Lingfeng Xiao, Chenglin Wu","title":"MetaGPT: Meta Programming for Multi-Agent Collaborative Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, remarkable progress has been made in automated task-solving through\nthe use of multi-agent driven by large language models (LLMs). However,\nexisting LLM-based multi-agent works primarily focus on solving simple dialogue\ntasks, and complex tasks are rarely studied, mainly due to the LLM\nhallucination problem. This type of hallucination becomes cascading when\nnaively chaining multiple intelligent agents, resulting in a failure to\neffectively address complex problems. Therefore, we introduce MetaGPT, an\ninnovative framework that incorporates efficient human workflows as a meta\nprogramming approach into LLM-based multi-agent collaboration. Specifically,\nMetaGPT encodes Standardized Operating Procedures (SOPs) into prompts to\nenhance structured coordination. Subsequently, it mandates modular outputs,\nempowering agents with domain expertise comparable to human professionals, to\nvalidate outputs and minimize compounded errors. In this way, MetaGPT leverages\nthe assembly line paradigm to assign diverse roles to various agents, thereby\nestablishing a framework that can effectively and cohesively deconstruct\ncomplex multi-agent collaborative problems. Our experiments on collaborative\nsoftware engineering benchmarks demonstrate that MetaGPT generates more\ncoherent and correct solutions compared to existing chat-based multi-agent\nsystems. This highlights the potential of integrating human domain knowledge\ninto multi-agent systems, thereby creating new opportunities to tackle complex\nreal-world challenges. The GitHub repository of this project is publicly\navailable on:https://github.com/geekan/MetaGPT.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:49:10 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 04:11:02 GMT"},{"version":"v3","created":"Mon, 7 Aug 2023 19:20:19 GMT"},{"version":"v4","created":"Thu, 17 Aug 2023 04:01:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hong","Sirui",""],["Zheng","Xiawu",""],["Chen","Jonathan",""],["Cheng","Yuheng",""],["Wang","Jinlin",""],["Zhang","Ceyao",""],["Wang","Zili",""],["Yau","Steven Ka Shing",""],["Lin","Zijuan",""],["Zhou","Liyang",""],["Ran","Chenyu",""],["Xiao","Lingfeng",""],["Wu","Chenglin",""]]}
{"id":"2308.00353","submitter":"Runyu Ding","authors":"Runyu Ding, Jihan Yang, Chuhui Xue, Wenqing Zhang, Song Bai, Xiaojuan\n  Qi","title":"Lowis3D: Language-Driven Open-World Instance-Level 3D Scene\n  Understanding","comments":"submit to TPAMI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open-world instance-level scene understanding aims to locate and recognize\nunseen object categories that are not present in the annotated dataset. This\ntask is challenging because the model needs to both localize novel 3D objects\nand infer their semantic categories. A key factor for the recent progress in 2D\nopen-world perception is the availability of large-scale image-text pairs from\nthe Internet, which cover a wide range of vocabulary concepts. However, this\nsuccess is hard to replicate in 3D scenarios due to the scarcity of 3D-text\npairs. To address this challenge, we propose to harness pre-trained\nvision-language (VL) foundation models that encode extensive knowledge from\nimage-text pairs to generate captions for multi-view images of 3D scenes. This\nallows us to establish explicit associations between 3D shapes and\nsemantic-rich captions. Moreover, to enhance the fine-grained visual-semantic\nrepresentation learning from captions for object-level categorization, we\ndesign hierarchical point-caption association methods to learn semantic-aware\nembeddings that exploit the 3D geometry between 3D points and multi-view\nimages. In addition, to tackle the localization challenge for novel classes in\nthe open-world setting, we develop debiased instance localization, which\ninvolves training object grouping modules on unlabeled data using\ninstance-level pseudo supervision. This significantly improves the\ngeneralization capabilities of instance grouping and thus the ability to\naccurately locate novel objects. We conduct extensive experiments on 3D\nsemantic, instance, and panoptic segmentation tasks, covering indoor and\noutdoor scenes across three datasets. Our method outperforms baseline methods\nby a significant margin in semantic segmentation (e.g. 34.5%$\\sim$65.3%),\ninstance segmentation (e.g. 21.8%$\\sim$54.0%) and panoptic segmentation (e.g.\n14.7%$\\sim$43.3%). Code will be available.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:50:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ding","Runyu",""],["Yang","Jihan",""],["Xue","Chuhui",""],["Zhang","Wenqing",""],["Bai","Song",""],["Qi","Xiaojuan",""]]}
{"id":"2308.00354","submitter":"Hyungseok Kim PhD","authors":"Hyungseok Kim, Soobin Kim, Megan M. Morris, Jeffrey A. Kimbrel, Xavier\n  Mayali and Cullen R. Buie","title":"Self-supervised Multidimensional Scaling with $F$-ratio: Improving\n  Microbiome Visualization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multidimensional scaling (MDS) is an unsupervised learning technique that\npreserves pairwise distances between observations and is commonly used for\nanalyzing multivariate biological datasets. Recent advances in MDS have\nachieved successful classification results, but the configurations heavily\ndepend on the choice of hyperparameters, limiting its broader application.\nHere, we present a self-supervised MDS approach informed by the dispersions of\nobservations that share a common binary label ($F$-ratio). Our visualization\naccurately configures the $F$-ratio while consistently preserving the global\nstructure with a low data distortion compared to existing dimensionality\nreduction tools. Using an algal microbiome dataset, we show that this new\nmethod better illustrates the community's response to the host, suggesting its\npotential impact on microbiology and ecology data analysis.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:51:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kim","Hyungseok",""],["Kim","Soobin",""],["Morris","Megan M.",""],["Kimbrel","Jeffrey A.",""],["Mayali","Xavier",""],["Buie","Cullen R.",""]]}
{"id":"2308.00355","submitter":"Rustam Latypov","authors":"Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto","title":"Conditionally Optimal Parallel Coloring of Forests","comments":"37th International Symposium on Distributed Computing (DISC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show the first conditionally optimal deterministic algorithm for\n$3$-coloring forests in the low-space massively parallel computation (MPC)\nmodel. Our algorithm runs in $O(\\log \\log n)$ rounds and uses optimal global\nspace. The best previous algorithm requires $4$ colors [Ghaffari, Grunau, Jin,\nDISC'20] and is randomized, while our algorithm are inherently deterministic.\n  Our main technical contribution is an $O(\\log \\log n)$-round algorithm to\ncompute a partition of the forest into $O(\\log n)$ ordered layers such that\nevery node has at most two neighbors in the same or higher layers. Similar\ndecompositions are often used in the area and we believe that this result is of\nindependent interest. Our results also immediately yield conditionally optimal\ndeterministic algorithms for maximal independent set and maximal matching for\nforests, matching the state of the art [Giliberti, Fischer, Grunau, SPAA'23].\nIn contrast to their solution, our algorithms are not based on derandomization,\nand are arguably simpler.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:52:54 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Grunau","Christoph",""],["Latypov","Rustam",""],["Maus","Yannic",""],["Pai","Shreyas",""],["Uitto","Jara",""]]}
{"id":"2308.00356","submitter":"Li Niu","authors":"Li Niu, Linfeng Tan, Xinhao Tao, Junyan Cao, Fengjun Guo, Teng Long,\n  Liqing Zhang","title":"Deep Image Harmonization with Globally Guided Feature Transformation and\n  Relation Distillation","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":"  Given a composite image, image harmonization aims to adjust the foreground\nillumination to be consistent with background. Previous methods have explored\ntransforming foreground features to achieve competitive performance. In this\nwork, we show that using global information to guide foreground feature\ntransformation could achieve significant improvement. Besides, we propose to\ntransfer the foreground-background relation from real images to composite\nimages, which can provide intermediate supervision for the transformed encoder\nfeatures. Additionally, considering the drawbacks of existing harmonization\ndatasets, we also contribute a ccHarmony dataset which simulates the natural\nillumination variation. Extensive experiments on iHarmony4 and our contributed\ndataset demonstrate the superiority of our method. Our ccHarmony dataset is\nreleased at https://github.com/bcmi/Image-Harmonization-Dataset-ccHarmony.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:53:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Niu","Li",""],["Tan","Linfeng",""],["Tao","Xinhao",""],["Cao","Junyan",""],["Guo","Fengjun",""],["Long","Teng",""],["Zhang","Liqing",""]]}
{"id":"2308.00357","submitter":"Gianluca Col\\`o","authors":"Gianluca Colo' and Kouichi Hagino","title":"Orbital-free Density Functional Theory: differences and similarities\n  between electronic and nuclear systems","comments":"Submitted for publication","journal-ref":null,"doi":null,"report-no":"YITP-23-80, KUNS-2974","categories":"nucl-th cond-mat.other","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Orbital-free Density Functional Theory (OF-DFT) has been used when studying\natoms, molecules and solids. In nuclear physics, there has been basically no\napplication of OF-DFT so far, as the Density Functional Theory (DFT) has been\nwidely applied to the study of many nuclear properties mostly within the\nKohn-Sham (KS) scheme. There are many realizations of nuclear KS-DFT, but\ncomputations become very demanding for heavy systems, such as superheavy nuclei\nand the inner crust of neutron stars, and it is hard to describe exotic nuclear\nshapes using a finite basis made with a limited number of orbitals. These\nbottlenecks could, in principle, be overcome by an orbital-free formulation of\nDFT. This work is a first step towards the application of OF-DFT to nuclei. In\nparticular, we have implemented possible choices for an orbital-free kinetic\nenergy and solved the associated Schr\\\"odinger equation either with simple\npotentials or with simplified nuclear density functionals. While the former\nchoice sheds light on the differences between electronic and nuclear systems,\nthe latter choice allows us discussing the practical applications to nuclei and\nthe open questions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:00:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Colo'","Gianluca",""],["Hagino","Kouichi",""]]}
{"id":"2308.00358","submitter":"Gianluca Crippa","authors":"Michele Coti Zelati, Gianluca Crippa, Gautam Iyer, Anna L. Mazzucato","title":"Mixing in incompressible flows: transport, dissipation, and their\n  interplay","comments":"Survey article, submitted to Notices of the AMS","journal-ref":null,"doi":null,"report-no":"23-CNA-010","categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this survey, we address mixing from the point of view of partial\ndifferential equations, motivated by applications that arise in fluid dynamics.\nWe give an account of optimal mixing, loss of regularity for transport\nequations, enhanced dissipation, and anomalous dissipation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:01:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zelati","Michele Coti",""],["Crippa","Gianluca",""],["Iyer","Gautam",""],["Mazzucato","Anna L.",""]]}
{"id":"2308.00359","submitter":"Engui Fan","authors":"Ruihong Ma and Engui Fan","title":"The asymptotic stability of solitons in the focusing Hirota equation on\n  the line","comments":"46 pages. arXiv admin note: text overlap with arXiv:1302.1215 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, the $\\overline\\partial$-steepest descent method and B\\\"acklund\ntransformation are used to study the asymptotic stability of solitons for the\nfollowing Cauchy problem of focusing Hirota equation \\begin{align}\\nonumber &\niq_t+\\alpha(2|q|^2q+q_{xx})+i\\beta(q_{xxx}+6|q|^2q_x)=0, \\\\\\nonumber &\nq(x,0)=q_0(x), \\end{align} where $q_0 \\in\nH^1(\\mathbb{R})\\,\\cap\\,L^{2,s}(\\mathbb{R}),s\\in(\\frac{1}{2},1] .$ We first\nexpress the solution of the Cauchy problem in term of the solution of a\nRiemann-Hilbert (RH) problem. Then the RH problem is further decomposed into\npure radiation solution and solitons solution,which are solved by using\n$\\overline\\partial$-techniques and B\\\"acklund transformation respectively. As a\ndirectly consequence, we obtain the asymptotic stability of solitons for the\nHirota equation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:04:26 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ma","Ruihong",""],["Fan","Engui",""]]}
{"id":"2308.00360","submitter":"Qingna Li","authors":"Yukai Zheng, Weikun Chen and Qingna Li","title":"An Efficient Algorithm for Computational Protein Design Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A protein is a sequence of basic blocks called amino acids, and it plays an\nimportant role in animals and human beings. The computational protein design\n(CPD) problem is to identify a protein that could perform some given functions.\nThe CPD problem can be formulated as a quadratic semi-assigement problem (QSAP)\nand is extremely challenging due to its combinatorial properties over different\namino acid sequences. In this paper, we first show that the QSAP is equivalent\nto its continuous relaxation problem, the RQSAP, in the sense that the QSAP and\nRQSAP share the same optimal solution. Then we design an efficient quadratic\npenalty method to solve large-scale RQSAP. Numerical results on benchmark\ninstances verify the superior performance of our approach over the\nstate-of-the-art branch-and-cut solvers. In particular, our proposed algorithm\noutperforms the state-of-the-art solvers by three order of magnitude in CPU\ntime in most cases while returns a high-quality solution.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:05:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zheng","Yukai",""],["Chen","Weikun",""],["Li","Qingna",""]]}
{"id":"2308.00361","submitter":"Masataka Matsumoto","authors":"Shuta Ishigaki, Shunichiro Kinoshita, Masataka Matsumoto","title":"Stark effect and dissociation of mesons in holographic conductor","comments":"28 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the meson spectrum of the ${\\cal{N}}=4$ supersymmetric Yang-Mills\ntheory with ${\\cal{N}}=2$ fundamental hypermultiplets for a finite electric\nfield by using the D3/D7 model. The spectrum for scalar and vector mesons is\ncomputed by analyzing the (quasi-)normal modes for the fluctuations of the\nD7-brane embedding and gauge fields. In the presence of an electric field, two\ndifferent phases in the background are realized: the meson and dissociation\nphases. In this paper, we analyze the meson spectrum of scalar and vector\nmesons for all ranges of the electric field and explore the effect of the\nelectric field on the meson spectrum, that is, the Stark effect. In the meson\nspectrum, we observe the avoided crossing between different levels due to the\ncoupling of fluctuations via the electric field.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:07:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ishigaki","Shuta",""],["Kinoshita","Shunichiro",""],["Matsumoto","Masataka",""]]}
{"id":"2308.00362","submitter":"Chongjun Ouyang","authors":"Chongjun Ouyang, Yuanwei Liu, Xingqi Zhang, and Lajos Hanzo","title":"Near-Field Communications: A Degree-of-Freedom Perspective","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Multiple-antenna technologies are advancing towards large-scale aperture\nsizes and extremely high frequencies, leading to the emergence of near-field\ncommunications (NFC) in future wireless systems. To this context, we\ninvestigate the degree of freedom (DoF) in near-field multiple-input\nmultiple-output (MIMO) systems. We consider both spatially discrete (SPD)\nantennas and continuous aperture (CAP) antennas. Additionally, we explore three\nimportant DoF-related performance metrics and examine their relationships with\nthe classic DoF. Numerical results demonstrate the benefits of NFC over\nfar-field communications (FFC) in terms of providing increased spatial DoFs. We\nalso identify promising research directions for NFC from a DoF perspective.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:08:47 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 09:13:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ouyang","Chongjun",""],["Liu","Yuanwei",""],["Zhang","Xingqi",""],["Hanzo","Lajos",""]]}
{"id":"2308.00363","submitter":"Zhongyang Gu","authors":"Zhongyang Gu, Xin Hu, Tsuyoshi Yoneda","title":"Anomalous smoothing effect on the incompressible Navier-Stokes-Fourier\n  limit from Boltzmann with periodic velocity","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adding a nontrivial term composed from a microstructure, we prove the\nexistence of a global-in-time weak solution, whose enstrophy is bounded for all\nthe time, to an incompressible 3D Navier-Stokes-Fourier system for arbitrary\ninitial data. It cannot be expected to directly derive the energy inequality\nfor this new system of equations. The main idea is to employ the hydrodynamic\nlimit from the Boltzmann equation with periodic velocity and a specially\ndesigned collision operator.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:11:10 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 14:53:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gu","Zhongyang",""],["Hu","Xin",""],["Yoneda","Tsuyoshi",""]]}
{"id":"2308.00364","submitter":"Saurabh Kumar","authors":"Saurabh Kumar, Daniel Fuchs, Klaus Spindler","title":"Fountain -- an intelligent contextual assistant combining knowledge\n  representation and language models for manufacturing risk identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deviations from the approved design or processes during mass production can\nlead to unforeseen risks. However, these changes are sometimes necessary due to\nchanges in the product design characteristics or an adaptation in the\nmanufacturing process. A major challenge is to identify these risks early in\nthe workflow so that failures leading to warranty claims can be avoided. We\ndeveloped Fountain as a contextual assistant integrated in the deviation\nmanagement workflow that helps in identifying the risks based on the\ndescription of the existing design and process criteria and the proposed\ndeviation. In the manufacturing context, it is important that the assistant\nprovides recommendations that are explainable and consistent. We achieve this\nthrough a combination of the following two components 1) language models\nfinetuned for domain specific semantic similarity and, 2) knowledge\nrepresentation in the form of a property graph derived from the bill of\nmaterials, Failure Modes and Effect Analysis (FMEA) and prior failures reported\nby customers. Here, we present the nuances of selecting and adapting pretrained\nlanguage models for an engineering domain, continuous model updates based on\nuser interaction with the contextual assistant and creating the causal chain\nfor explainable recommendations based on the knowledge representation.\nAdditionally, we demonstrate that the model adaptation is feasible using\nmoderate computational infrastructure already available to most engineering\nteams in manufacturing organizations and inference can be performed on standard\nCPU only instances for integration with existing applications making these\nmethods easily deployable.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:12:43 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kumar","Saurabh",""],["Fuchs","Daniel",""],["Spindler","Klaus",""]]}
{"id":"2308.00365","submitter":"Basile Gallet","authors":"Julie Meunier, Benjamin Miquel, Basile Gallet","title":"Vertical structure of buoyancy transport by ocean baroclinic turbulence","comments":"Geophysical Research Letters, in press","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Ocean mesoscale eddies enhance meridional buoyancy transport, notably in the\nAntarctic Circumpolar Current where they contribute to setting the deep\nstratification of the neighboring ocean basins. The much-needed\nparameterization of this buoyancy transport in global climate models requires a\ntheory for the overall flux, but also for its vertical structure inside the\nfluid column. Based on the quasi-geostrophic dynamics of an idealized patch of\nocean hosting an arbitrary vertically sheared zonal flow, we provide a\nquantitative prediction for the vertical structure of the buoyancy flux without\nadjustable parameters. The prediction agrees quantitatively with meridional\nflux profiles obtained through numerical simulations of an idealized patch of\nocean with realistic parameter values. This work empowers modelers with an\nexplicit and physically based expression for the vertical profile of buoyancy\ntransport by ocean baroclinic turbulence, as opposed to the common practice of\nusing arbitrary prescriptions for the depth-dependence of the transport\ncoefficients.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:13:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Meunier","Julie",""],["Miquel","Benjamin",""],["Gallet","Basile",""]]}
{"id":"2308.00366","submitter":"Maarten Baes","authors":"Maarten Baes and Bert Vander Meulen","title":"Self-consistent dynamical models with a finite extent -- III. Truncated\n  power-law spheres","comments":"12 pages, 4 figures, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2323","report-no":null,"categories":"astro-ph.GA astro-ph.CO astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fully analytical dynamical models usually have an infinite extent, while real\nstar clusters, galaxies, and dark matter haloes have a finite extent. The\nstandard method for generating dynamical models with a finite extent consists\nof taking a model with an infinite extent and applying a truncation in binding\nenergy. This method, however, cannot be used to generate models with a pre-set\nanalytical mass density profile. We investigate the self-consistency and\ndynamical properties of a family of power-law spheres with a general tangential\nCuddeford (TC) orbital structure. By varying the density power-law slope\n$\\gamma$ and the central anisotropy $\\beta_0$, these models cover a wide\nparameter space in density and anisotropy profiles. We explicitly calculate the\nphase-space distribution function for various parameter combinations, and\ninterpret our results in terms of the energy distribution of bound orbits. We\nfind that truncated power-law spheres can be supported by a TC orbital\nstructure if and only if $\\gamma \\geqslant 2\\beta_0$, which means that the\ncentral density slope-anisotropy inequality is both a sufficient and a\nnecessary condition for this family. We provide closed expressions for\nstructural and dynamical properties such as the radial and tangential velocity\ndispersion profiles, which can be compared against more complex numerical\nmodelling results. This work significantly adds to the available suite of\nself-consistent dynamical models with a finite extent and an analytical\ndescription.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:15:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Baes","Maarten",""],["Meulen","Bert Vander",""]]}
{"id":"2308.00367","submitter":"Thomas Berger","authors":"Zongyi Guo, Xiyu Gu, Yonglin Han, Jianguo Guo and Thomas Berger","title":"Maneuvering tracking algorithm for reentry vehicles with guaranteed\n  prescribed performance","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 presents a prescribed performance-based tracking control strategy\nfor the atmospheric reentry flight of space vehicles subject to rapid maneuvers\nduring flight mission. A time-triggered non-monotonic performance funnel is\nproposed with the aim of constraints violation avoidance in the case of sudden\nchanges of the reference trajectory. Compared with traditional prescribed\nperformance control methods, the novel funnel boundary is adaptive with respect\nto the reference path and is capable of achieving stability under disturbances.\nA recursive control structure is introduced which does not require any\nknowledge of specific system parameters. By a stability analysis we show that\nthe tracking error evolves within the prescribed error margin under a condition\nwhich represents a trade-off between the reference signal and the performance\nfunnel. The effectiveness of the proposed control scheme is verified by\nsimulations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:18:39 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Guo","Zongyi",""],["Gu","Xiyu",""],["Han","Yonglin",""],["Guo","Jianguo",""],["Berger","Thomas",""]]}
{"id":"2308.00368","submitter":"Endao Han","authors":"Endao Han, Chenyi Fei, Ricard Alert, Katherine Copenhagen, Matthias D.\n  Koch, Ned S. Wingreen, and Joshua W. Shaevitz","title":"Local polar order controls mechanical stress and triggers layer\n  formation in developing Myxococcus xanthus colonies","comments":"35 page, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Colonies of the social bacterium Myxococcus xanthus go through a\nmorphological transition from a thin colony of cells to three-dimensional\ndroplet-like fruiting bodies as a strategy to survive starvation. The\nbiological pathways that control the decision to form a fruiting body have been\nstudied extensively. However, the mechanical events that trigger the creation\nof multiple cell layers and give rise to droplet formation remain poorly\nunderstood. By measuring cell orientation, velocity, polarity, and force with\ncell-scale resolution, we reveal a stochastic local polar order in addition to\nthe more obvious nematic order. Average cell velocity and active force at\ntopological defects agree with predictions from active nematic theory, but\ntheir fluctuations are anomalously large due to polar active forces generated\nby the self-propelled rod-shaped cells. We find that M. xanthus cells adjust\ntheir reversal frequency to tune the magnitude of this local polar order, which\nin turn controls the mechanical stresses and triggers layer formation in the\ncolonies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:18:44 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Han","Endao",""],["Fei","Chenyi",""],["Alert","Ricard",""],["Copenhagen","Katherine",""],["Koch","Matthias D.",""],["Wingreen","Ned S.",""],["Shaevitz","Joshua W.",""]]}
{"id":"2308.00369","submitter":"Jun Fujisaki","authors":"Jun Fujisaki, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato,\n  Tatsuya Sakashita, Yusaku Takeuchi, Keisuke Fujii","title":"Quantum error correction with an Ising machine under circuit-level noise","comments":"13 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient decoding to estimate error locations from outcomes of syndrome\nmeasurement is the prerequisite for quantum error correction. Decoding in\npresence of circuit-level noise including measurement errors should be\nconsidered in case of actual quantum computing devices. In this work, we\ndevelop a decoder for circuit-level noise that solves the error estimation\nproblems as Ising-type optimization problems. We confirm that the threshold\ntheorem in the surface code under the circuitlevel noise is reproduced with an\nerror threshold of approximately 0.4%. We also demonstrate the advantage of the\ndecoder through which the Y error detection rate can be improved compared with\nother matching-based decoders. Our results reveal that a lower logical error\nrate can be obtained using our algorithm compared with that of the\nminimum-weight perfect matching algorithm.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:21:22 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fujisaki","Jun",""],["Maruyama","Kazunori",""],["Oshima","Hirotaka",""],["Sato","Shintaro",""],["Sakashita","Tatsuya",""],["Takeuchi","Yusaku",""],["Fujii","Keisuke",""]]}
{"id":"2308.00370","submitter":"Zhengyi Zhou","authors":"Agustin Moreno, Zhengyi Zhou","title":"RSFT functors for strong cobordisms and applications","comments":"29 pp. Section 5 is taken from the verison 2 of arXiv:2012.04182.\n  Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the hierarchy functors of [30] for the case of strong symplectic\ncobordisms, via deformations with Maurer--Cartan elements. In particular, we\nprove that the concave boundary of a strong cobordism has finite algebraic\nplanar torsion if the convex boundary does, which yields a functorial proof of\nfinite algebraic planar torsion for contact manifolds admitting strong\ncobordisms to overtwisted contact manifolds. We also show the existence of\ncontact $3$-folds without strong cobordisms to the standard contact $3$-sphere,\nthat are not cofillable. We also include generalizations of the theory, which\nappeared in an earlier version of [30], relating our notion of algebraic planar\ntorsion to Latschev--Wendl's notion of algebraic torsion, discussing variations\nfrom counting holomorphic curves with general constraints and invariants\nextracted from higher genera holomorphic curves from an algebraic perspective.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:24:16 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Moreno","Agustin",""],["Zhou","Zhengyi",""]]}
{"id":"2308.00371","submitter":"Chopin Soo","authors":"Chopin Soo","title":"Cosmic time and the initial state of the universe","comments":"15 pages, 2 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exact solution of the Hamiltonian constraint in canonical gravity and the\nresultant reduction of Einstein's theory reveal the synergy between gravitation\nand the cosmic clock of our expanding universe. In conjunction with a paradigm\nshift from four-covariance to just spatial diffeomorphism invariance, causal\ntime-ordering of the quantum state of the universe and its evolution in cosmic\ntime become meaningful. This advocated framework prompts natural extensions. A\nsalient feature is the addition of a Cotton-York term to the physical\nHamiltonian. This radically changes the solution to the initial data problem\nand the quantum origin of the universe. It lends support to the quantum\nbeginning of the universe as an exact Chern-Simons Hartle-Hawking state that\nfeatures Euclidean-Lorentzian instanton tunneling. A signature of this state is\nthat it manifests, at the lowest order approximation, scale-invariant two-point\ncorrelation function for transverse traceless quantum metric fluctuations. This\ninitial quantum state also yields, at the level of expectation values, a\nlow-entropy hot smooth Robertson-Walker beginning that is in accord with\nPenrose's Weyl Curvature Hypothesis. Consequently, the gravitational arrow of\ntime of increasing spatial volume and the thermodynamic Second Law arrow of\ntime of increasing entropy concur as our universe expands and ages.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:27:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Soo","Chopin",""]]}
{"id":"2308.00372","submitter":"Brigitte Bidegaray-Fesquet","authors":"Brigitte Bid\\'egaray-Fesquet (EDP), Cl\\'ement Jourdana (EDP),\n  L\\'eopold Tr\\'emant (TONUS, IRMA)","title":"Multi-frequency averaging and uniform accuracy towards numerical\n  approximations for a Bloch model","comments":null,"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":"  We are interested in numerically solving a transitional model derived from\nthe Bloch model. The Bloch equation describes the time evolution of the density\nmatrix of a quantum system forced by an electromagnetic wave. In a high\nfrequency and low amplitude regime, it asymptotically reduces to a non-stiff\nrate equation. As a middle ground, the transitional model governs the diagonal\npart of the density matrix. It fits in a general setting of linear problems\nwith a high-frequency quasi-periodic forcing and an exponentially decaying\nforcing. The numerical resolution of such problems is challenging. Adapting\nhigh-order averaging techniques to this setting, we separate the slow (rate)\ndynamics from the fast (oscillatory and decay) dynamics to derive a new\nmicro-macro problem. We derive estimates for the size of the micro part of the\ndecomposition, and of its time derivatives, showing that this new problem is\nnon-stiff. As such, we may solve this micro-macro problem with uniform accuracy\nusing standard numerical schemes. To validate this approach, we present\nnumerical results first on a toy problem and then on the transitional Bloch\nmodel.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:30:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bid\u00e9garay-Fesquet","Brigitte","","EDP"],["Jourdana","Cl\u00e9ment","","EDP"],["Tr\u00e9mant","L\u00e9opold","","TONUS, IRMA"]]}
{"id":"2308.00373","submitter":"Ruiqi Kong","authors":"Ruiqi Kong and He Chen","title":"Physical-Layer Authentication of Commodity Wi-Fi Devices via\n  Micro-Signals on CSI Curves","comments":"5 pages, 3 figures, conference","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a new radiometric fingerprint that is revealed by\nmicro-signals in the channel state information (CSI) curves extracted from\ncommodity Wi-Fi devices. We refer to this new fingerprint as \"micro-CSI\". Our\nexperiments show that micro-CSI is likely to be caused by imperfections in the\nradio-frequency circuitry and is present in Wi-Fi 4/5/6 network interface cards\n(NICs). We conducted further experiments to determine the most effective CSI\ncollection configuration to stabilize micro-CSI. To extract micro-CSI from\nvarying CSI curves, we developed a signal space-based extraction algorithm that\neffectively separates distortions caused by wireless channels and hardware\nimperfections under line-of-sight (LoS) scenarios. Finally, we implemented a\nmicro-CSI-based device authentication algorithm that uses the k-Nearest\nNeighbors (KNN) method to identify 11 COTS Wi-Fi NICs from the same\nmanufacturer in typical indoor environments. Our experimental results\ndemonstrate that the micro-CSI-based authentication algorithm can achieve an\naverage attack detection rate of over 99% with a false alarm rate of 0%.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:33:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kong","Ruiqi",""],["Chen","He",""]]}
{"id":"2308.00374","submitter":"Ivan Kaygorodov","authors":"Kobiljon Abdurasulov, Ivan Kaygorodov, Abror Khudoyberdiyev","title":"The algebraic and geometric classification of nilpotent binary and mono\n  Leibniz algebras","comments":"arXiv admin note: substantial text overlap with arXiv:2205.00444,\n  arXiv:2206.00315, arXiv:2106.00336, arXiv:1912.02691, arXiv:1812.01442,\n  arXiv:2307.00289","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This paper is devoted to the complete algebraic and geometric classification\nof complex $5$-dimensional nilpotent binary Leibniz and $4$-dimensional\nnilpotent mono Leibniz algebras. As a corollary, we have the complete algebraic\nand geometric classification of complex $4$-dimensional nilpotent algebras of\nnil-index $3$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:34:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Abdurasulov","Kobiljon",""],["Kaygorodov","Ivan",""],["Khudoyberdiyev","Abror",""]]}
{"id":"2308.00375","submitter":"Svetlana Abramova","authors":"Svetlana Abramova and Rainer B\\\"ohme","title":"Anatomy of a High-Profile Data Breach: Dissecting the Aftermath of a\n  Crypto-Wallet Case","comments":"Accepted to appear at the 32nd USENIX Security Symposium (USENIX\n  Security '23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Media reports show an alarming increase of data breaches at providers of\ncybersecurity products and services. Since the exposed records may reveal\nsecurity-relevant data, such incidents cause undue burden and create the risk\nof re-victimization to individuals whose personal data gets exposed. In pursuit\nof examining a broad spectrum of the downstream effects on victims, we surveyed\n104 persons who purchased specialized devices for the secure storage of\ncrypto-assets and later fell victim to a breach of customer data. Our case\nstudy reveals common nuisances (i.e., spam, scams, phishing e-mails) as well as\npreviously unseen attack vectors (e.g., involving tampered devices), which are\npossibly tied to the breach. A few victims report losses of digital assets as a\nform of the harm. We find that our participants exhibit heightened safety\nconcerns, appear skeptical about litigation efforts, and demonstrate the\nability to differentiate between the quality of the security product and the\ncircumstances of the breach. We derive implications for the cybersecurity\nindustry at large, and point out methodological challenges in data breach\nresearch.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:37:16 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Abramova","Svetlana",""],["B\u00f6hme","Rainer",""]]}
{"id":"2308.00376","submitter":"Li Niu","authors":"Li Niu, Junyan Cao, Wenyan Cong, Liqing Zhang","title":"Deep Image Harmonization with Learnable Augmentation","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 goal of image harmonization is adjusting the foreground appearance in a\ncomposite image to make the whole image harmonious. To construct paired\ntraining images, existing datasets adopt different ways to adjust the\nillumination statistics of foregrounds of real images to produce synthetic\ncomposite images. However, different datasets have considerable domain gap and\nthe performances on small-scale datasets are limited by insufficient training\ndata. In this work, we explore learnable augmentation to enrich the\nillumination diversity of small-scale datasets for better harmonization\nperformance. In particular, our designed SYthetic COmposite Network (SycoNet)\ntakes in a real image with foreground mask and a random vector to learn\nsuitable color transformation, which is applied to the foreground of this real\nimage to produce a synthetic composite image. Comprehensive experiments\ndemonstrate the effectiveness of our proposed learnable augmentation for image\nharmonization. The code of SycoNet is released at\nhttps://github.com/bcmi/SycoNet-Adaptive-Image-Harmonization.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:40:23 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Niu","Li",""],["Cao","Junyan",""],["Cong","Wenyan",""],["Zhang","Liqing",""]]}
{"id":"2308.00377","submitter":"Matthias Humt","authors":"Matthias Humt, Dominik Winkelbauer, Ulrich Hillenbrand","title":"Shape Completion with Prediction of Uncertain Regions","comments":"7 pages, 5 figures, 2023 IEEE/RSJ International Conference on\n  Intelligent Robots and Systems, IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shape completion, i.e., predicting the complete geometry of an object from a\npartial observation, is highly relevant for several downstream tasks, most\nnotably robotic manipulation. When basing planning or prediction of real grasps\non object shape reconstruction, an indication of severe geometric uncertainty\nis indispensable. In particular, there can be an irreducible uncertainty in\nextended regions about the presence of entire object parts when given ambiguous\nobject views. To treat this important case, we propose two novel methods for\npredicting such uncertain regions as straightforward extensions of any method\nfor predicting local spatial occupancy, one through postprocessing occupancy\nscores, the other through direct prediction of an uncertainty indicator. We\ncompare these methods together with two known approaches to probabilistic shape\ncompletion. Moreover, we generate a dataset, derived from ShapeNet, of\nrealistically rendered depth images of object views with ground-truth\nannotations for the uncertain regions. We train on this dataset and test each\nmethod in shape completion and prediction of uncertain regions for known and\nnovel object instances and on synthetic and real data. While direct uncertainty\nprediction is by far the most accurate in the segmentation of uncertain\nregions, both novel methods outperform the two baselines in shape completion\nand uncertain region prediction, and avoiding the predicted uncertain regions\nincreases the quality of grasps for all tested methods. Web:\nhttps://github.com/DLR-RM/shape-completion\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:40:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Humt","Matthias",""],["Winkelbauer","Dominik",""],["Hillenbrand","Ulrich",""]]}
{"id":"2308.00378","submitter":"Paolo Santonastaso","authors":"Paolo Santonastaso and John Sheekey","title":"On MSRD codes, h-designs and disjoint maximum scattered linear sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.CO math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study geometric aspects of codes in the sum-rank metric. We\nestablish the geometric description of generalised weights, and analyse the\nDelsarte and geometric dual operations. We establish a correspondence between\nmaximum sum-rank distance codes and h-designs, extending the well-known\ncorrespondence between MDS codes and arcs in projective spaces and between MRD\ncodes and h-scatttered subspaces. We use the geometric setting to construct new\nh-designs and new MSRD codes via new families of pairwise disjoint maximum\nscattered linear sets.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:42:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Santonastaso","Paolo",""],["Sheekey","John",""]]}
{"id":"2308.00379","submitter":"Margaret Reid","authors":"C. Hatharasinghe, M. Thenabadu, P. D. Drummond and M. D. Reid","title":"A macroscopic quantum three-box paradox: finding consistency with weak\n  macroscopic realism","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 three-box paradox considers a ball prepared in a superposition of\nbeing in one of three Boxes. Bob makes measurements by opening either Box 1 or\nBox 2. After performing some unitary operations (shuffling), Alice can infer\nwith certainty that the ball was detected by Bob, regardless of which box he\nopened, if she detects the ball after opening Box 3. The paradox is that the\nball would have been found with certainty in either box, if that box had been\nopened. Resolutions of the paradox include that Bob's measurement cannot be\nmade non-invasively, or else that realism cannot be assumed at the quantum\nlevel. Here, we strengthen the case for the former argument, by constructing\nmacroscopic versions of the paradox. Macroscopic realism implies that the ball\nis in one of the boxes, prior to Bob or Alice opening any boxes. We demonstrate\nconsistency of the paradox with macroscopic realism, if carefully defined (as\nweak macroscopic realism, wMR) to apply to the system at the times prior to\nAlice or Bob opening any Boxes, but after the unitary operations associated\nwith preparation or shuffling. By solving for the dynamics of the unitary\noperations, and comparing with mixed states, we demonstrate agreement between\nthe predictions of wMR and quantum mechanics: The paradox only manifests if\nAlice's shuffling combines both local operations (on Box 3) and nonlocal\noperations, on the other Boxes. Following previous work, the macroscopic\nparadox is shown to correspond to a violation of a Leggett-Garg inequality,\nwhich implies non-invasive measurability, if wMR holds.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:47:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hatharasinghe","C.",""],["Thenabadu","M.",""],["Drummond","P. D.",""],["Reid","M. D.",""]]}
{"id":"2308.00380","submitter":"Andre Schulz","authors":"Andr\\'e Schulz","title":"Side-Contact Representations with Convex Polygons in 3D: New Results for\n  Complete Bipartite 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":"  A polyhedral surface~$\\mathcal{C}$ in $\\mathbb{R}^3$ with convex polygons as\nfaces is a side-contact representation of a graph~$G$ if there is a bijection\nbetween the vertices of $G$ and the faces of~$\\mathcal{C}$ such that the\npolygons of adjacent vertices are exactly the polygons sharing an entire common\nside in~$\\mathcal{C}$.\n  We show that $K_{3,8}$ has a side-contact representation but $K_{3,250}$ has\nnot. The latter result implies that the number of edges of a graph with\nside-contact representation and $n$ vertices is bounded by $O(n^{5/3})$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:48:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Schulz","Andr\u00e9",""]]}
{"id":"2308.00381","submitter":"Xinze Li","authors":"Xinze Li, Xin Zhang, Fanfan Lin, Changjiang Sun, Kezhi Mao","title":"Artificial-Intelligence-Based Hybrid Extended Phase Shift Modulation for\n  the Dual Active Bridge Converter with Full ZVS Range and Optimal Efficiency","comments":"13 pages, 32 figures","journal-ref":null,"doi":"10.1109/JESTPE.2022.3185090","report-no":null,"categories":"eess.SY cs.AI cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dual active bridge (DAB) converter is the key enabler in many popular\napplications such as wireless charging, electric vehicle and renewable energy.\nZVS range and efficiency are two significant performance indicators for DAB\nconverter. To obtain the desired ZVS and efficiency performance, modulation\nshould be carefully designed. Hybrid modulation considers several single\nmodulation strategies to achieve good comprehensive performance.\nConventionally, to design a hybrid modulation, harmonic approach or piecewise\napproach is used, but they suffer from time-consuming model building process\nand inaccuracy. Therefore, an artificial-intelligence-based hybrid extended\nphase shift (HEPS) modulation is proposed. Generally, the HEPS modulation is\ndeveloped in an automated fashion, which alleviates cumbersome model building\nprocess while keeping high model accuracy. In HEPS modulation, two EPS\nstrategies are considered to realize optimal efficiency with full ZVS operation\nover entire operating ranges. Specifically, to build data-driven models of ZVS\nand efficiency performance, extreme gradient boosting (XGBoost), which is a\nstate-of-the-art ensemble learning algorithm, is adopted. Afterwards, particle\nswarm optimization with state-based adaptive velocity limit (PSO-SAVL) is\nutilized to select the best EPS strategy and optimize modulation parameters.\nWith 1 kW hardware experiments, the feasibility of HEPS has been verified,\nachieving optimal efficiency with maximum of 97.1% and full-range ZVS\noperation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:48:35 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Xinze",""],["Zhang","Xin",""],["Lin","Fanfan",""],["Sun","Changjiang",""],["Mao","Kezhi",""]]}
{"id":"2308.00382","submitter":"Xinze Li","authors":"Xinze Li, Xin Zhang, Fanfan Lin, Changjiang Sun, Kezhi Mao","title":"Artificial-Intelligence-Based Triple Phase Shift Modulation for Dual\n  Active Bridge Converter with Minimized Current Stress","comments":"12 pages, 29 figures","journal-ref":null,"doi":"10.1109/JESTPE.2021.3105522","report-no":null,"categories":"eess.SY cs.AI cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The dual active bridge (DAB) converter has been popular in many applications\nfor its outstanding power density and bidirectional power transfer capacity. Up\nto now, triple phase shift (TPS) can be considered as one of the most advanced\nmodulation techniques for DAB converter. It can widen zero voltage switching\nrange and improve power efficiency significantly. Currently, current stress of\nthe DAB converter has been an important performance indicator when TPS\nmodulation is applied for smaller size and higher efficiency. However, to\nminimize the current stress when the DAB converter is under TPS modulation, two\ndifficulties exist in analysis process and realization process, respectively.\nFirstly, three degrees of modulation variables in TPS modulation bring\nchallenges to the analysis of current stress in different operating modes. This\nanalysis and deduction process leads to heavy computational burden and also\nsuffers from low accuracy. Secondly, to realize TPS modulation, if a lookup\ntable is adopted after the optimization of modulation variables, modulation\nperformance will be unsatisfactory because of the discrete nature of lookup\ntable. Therefore, an AI-based TPS modulation (AI-TPSM) strategy is proposed in\nthis paper. Neural network (NN) and fuzzy inference system (FIS) are utilized\nto deal with the two difficulties mentioned above. With the proposed AI-TPSM,\nthe optimization of TPS modulation for minimized current stress will enjoy high\ndegree of automation which can relieve engineers' working burden and improve\naccuracy. In the end of this paper, the effectiveness of the proposed AI-TPSM\nhas been experimentally verified with a 1 kW prototype.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:49:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Xinze",""],["Zhang","Xin",""],["Lin","Fanfan",""],["Sun","Changjiang",""],["Mao","Kezhi",""]]}
{"id":"2308.00383","submitter":"Joelle Miffre","authors":"Robert J Bianchi, John Hua Fan, Joelle Miffre, Tingxi Zhang","title":"Exploiting the dynamics of commodity futures curves","comments":null,"journal-ref":"Journal of Banking and Finance, 2023, 154 (106965)","doi":null,"report-no":null,"categories":"q-fin.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Nelson-Siegel framework is employed to model the term structure of\ncommodity futures prices. Exploiting the information embedded in the level,\nslope and curvature parameters, we develop novel investment strategies that\nassume short-term continuation of recent parallel, slope or butterfly movements\nof futures curves. Systematic strategies based on the change in the slope\ngenerate significant profits that are unrelated to previously documented risk\nfactors and can survive reasonable transaction costs. Further analysis\ndemonstrates that the profitability of the slope strategy increases with\ninvestor sentiment and is in part a compensation for the drawdowns incurred\nduring economic slowdowns. The profitability can also be magnified through\ntiming and persists under alternative specifications of the Nelson-Siegel\nmodel.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:51:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bianchi","Robert J",""],["Fan","John Hua",""],["Miffre","Joelle",""],["Zhang","Tingxi",""]]}
{"id":"2308.00384","submitter":"Samuel Morales","authors":"Samuel Morales, Yuval Gefen, Igor Gornyi, Alex Zazunov, Reinhold Egger","title":"Engineering unsteerable quantum states with active feedback","comments":"22 pages, 14 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":"  We propose active steering protocols for quantum state preparation in quantum\ncircuits where each ancilla qubit (detector) is connected to a single system\nqubit, employing a simple coupling selected from a small set of steering\noperators. The decision is made such that the expected cost function gain in\none time step is maximized. We apply these protocols to several many-qubit\nmodels. Our results are underlined by three remarkable insights. First, we show\nthat the standard fidelity does not give a useful cost function; instead,\nsuccessful steering is achieved by including local fidelity terms. Second,\nalthough the steering dynamics acts on each system qubit separately,\nentanglement in the generated target state is introduced, and can be tuned at\nwill, by performing Bell measurements on ancilla qubit pairs after every time\nstep. This implements a weak-measurement variant of entanglement swapping.\nThird, numerical simulations suggest that the active steering protocol can\nreach arbitrarily designated target states, including passively unsteerable\nstates such as the $N$-qubit W state.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:01:51 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Morales","Samuel",""],["Gefen","Yuval",""],["Gornyi","Igor",""],["Zazunov","Alex",""],["Egger","Reinhold",""]]}
{"id":"2308.00385","submitter":"Lukas Liehr","authors":"Philipp Grohs, Lukas Liehr, Martin Rathmair","title":"Phase retrieval in Fock space and perturbation of Liouville sets","comments":"39 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the determination of functions in Fock space from samples of their\nabsolute value, commonly referred to as the phase retrieval problem in Fock\nspace. One of the key findings in this research field asserts that phaseless\nsampling on lattices of arbitrary density renders the problem unsolvable,\nfundamentally contrasting ordinary sampling results. This limitation calls for\na new approach to the phaseless sampling problem. The present study establishes\nsolvability when using irregular sampling sets of the form $A \\cup B \\cup C$,\nwhere $A, B,$ and $C$ constitute perturbations of a Liouville set. The latter\ndescribes sets that possess a Liouville property and occupy an intermediate\nposition between sets of stable sampling and sets of uniqueness. Notably,\nsufficiently dense lattices qualify as Liouville sets, resulting in the first\nconstruction of uniqueness sets for the phase retrieval problem having a finite\ndensity. The perturbations $A,B$, and $C$ adhere to specific geometrical\nconditions of closeness and noncollinearity. We explore the theory from both\ndeterministic and random perspectives, in the sense that the perturbations can\nbe chosen either deterministically or at random. In the context of Gabor phase\nretrieval in subspaces of $L^2(\\mathbb{R})$, we derive successive reductions of\nthe size of uniqueness sets: for the class of real-valued functions, uniqueness\nis achieved from two perturbed lattices; for the class of even real-valued\nfunctions, a single perturbation suffices, resulting in a separated set.\nOverall, this study reveals that in the absence of phase information, irregular\nsampling is actually preferable to the most commonly used sampling on lattices,\nbridging the gap between solvability and sampling techniques in Fock space\nphase retrieval.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:03:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Grohs","Philipp",""],["Liehr","Lukas",""],["Rathmair","Martin",""]]}
{"id":"2308.00386","submitter":"Taras Mokrytskyi","authors":"Taras Mokrytskyi","title":"The monoid of order isomorphisms between principal filters of\n  $\\sigma{\\mathbb{N}^\\kappa}$","comments":"arXiv admin note: text overlap with arXiv:1802.03598","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider the following generalization of the bicyclic monoid. Let $\\kappa$ be\nany infinite cardinal and let\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$ be the semigroup of all\norder isomorphisms between principal filters of the set\n$\\sigma{\\mathbb{N}^\\kappa}$ with the product order. We shall study algebraic\nproperties of the semigroup\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$, show that it is\nbisimple, $E$-unitary, $F$-inverse semigroup, describe Green's relations on\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$, describe the group of\nunits $H\\left(\\mathbb{I}\\right)$ of the semigroup\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$ and describe its\nmaximal subgroups. We prove that the semigroup\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$ is isomorphic to the\nsemidirect product $\\mathcal{S}_\\kappa\\ltimes\\sigma{\\mathbb{B}^\\kappa}$ of the\nsemigroup $\\sigma{\\mathbb{B}^\\kappa}$ by the group $\\mathcal{S}_\\kappa$, show\nthat every non-identity congruence $\\mathfrak{C}$ on the semigroup\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$ is a group congruence\nand describe the least group congruence on\n$\\mathcal{IP\\!F}\\left(\\sigma{\\mathbb{N}^\\kappa}\\right)$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:05:07 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mokrytskyi","Taras",""]]}
{"id":"2308.00387","submitter":"Robin Kaiser","authors":"Hector Letellier, \\'Alvaro Mitchell Galv\\~ao de Melo, Ana\\\"is Dorne,\n  Robin Kaiser","title":"Loading of a large Yb MOT on the $^1$S$_0$-$^1$P$_1$ transition","comments":"12 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an experimental setup to laser cool and trap a large number of\nYtterbium atoms. Our design uses an oven with an array of microtubes for\nefficient collimation of the atomic beam and we implement a magneto-optical\ntrap of $^{174}$Yb on the $^1$S$_0$-$^1$P$_1$ transition at 399nm. Despite the\nabsence of a Zeeman slower, we are able to trap up to $N = 10^9$ atoms. We\nprecisely characterize our atomic beam, the loading rate of the magneto-optical\ntrap and several loss mechanisms relevant for trapping a large number of atoms.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:07:11 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Letellier","Hector",""],["de Melo","\u00c1lvaro Mitchell Galv\u00e3o",""],["Dorne","Ana\u00efs",""],["Kaiser","Robin",""]]}
{"id":"2308.00388","submitter":"Manli Song","authors":"Guoxia Feng, Manli Song and Huoxiong Wu","title":"Decay estimates for a class of semigroups related to self-adjoint\n  operators on metric measure spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assume that $(X,d,\\mu)$ is a metric space endowed with a non-negative Borel\nmeasure $\\mu$ satisfying the doubling condition and the additional condition\nthat $\\mu(B(x,r))\\gtrsim r^n$ for any $x\\in X, \\,r>0$ and some $n\\geq1$. Let\n$L$ be a non-negative self-adjoint operator on $L^2(X,\\mu)$. We assume that\n$e^{-tL}$ satisfies a Gaussian upper bound and the Schr\\\"odinger operator\n$e^{itL}$ satisfies an $L^1\\to L^\\infty$ decay estimate of the form\n\\begin{equation*} \\|e^{itL}\\|_{L^1\\to L^\\infty} \\lesssim |t|^{-\\frac{n}{2}}.\n\\end{equation*}\n  Then for a general class of dispersive semigroup $e^{it\\phi(L)}$, where\n$\\phi: \\mathbb{R}^+ \\to \\mathbb{R}$ is smooth, we establish a similar $L^1\\to\nL^\\infty$ decay estimate by a suitable subordination formula connecting it with\nthe Schr\\\"odinger operator $e^{itL}$. As applications, we derive new Strichartz\nestimates for several dispersive equations related to Hermite operators,\ntwisted Laplacians and Laguerre operators.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:08:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Feng","Guoxia",""],["Song","Manli",""],["Wu","Huoxiong",""]]}
{"id":"2308.00389","submitter":"Siwoo Lee","authors":"Siwoo Lee and Stefan Heinen and Danish Khan and O. Anatole von\n  Lilienfeld","title":"Autonomous data extraction from peer reviewed literature for training\n  machine learning models of oxidation potentials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present an automated data-collection pipeline involving a convolutional\nneural network and a large language model to extract user-specified tabular\ndata from peer-reviewed literature. The pipeline is applied to 74 reports\npublished between 1957 and 2014 with experimentally-measured oxidation\npotentials for 592 organic molecules (-0.75 to 3.58 V). After data curation\n(solvents, reference electrodes, and missed data points), we trained multiple\nsupervised machine learning models reaching prediction errors similar to\nexperimental uncertainty ($\\sim$0.2 V). For experimental measurements of\nidentical molecules reported in multiple studies, we identified the most likely\nvalue based on out-of-sample machine learning predictions. Using the trained\nmachine learning models, we then estimated oxidation potentials of $\\sim$132k\nsmall organic molecules from the QM9 data set, with predicted values spanning\n0.21 to 3.46 V. Analysis of the QM9 predictions in terms of plausible\ndescriptor-property trends suggests that aliphaticity increases the oxidation\npotential of an organic molecule on average from $\\sim$1.5 V to $\\sim$2 V,\nwhile an increase in number of heavy atoms lowers it systematically. The\npipeline introduced offers significant reductions in human labor otherwise\nrequired for conventional manual data collection of experimental results, and\nexemplifies how to accelerate scientific research through automation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:11:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lee","Siwoo",""],["Heinen","Stefan",""],["Khan","Danish",""],["von Lilienfeld","O. Anatole",""]]}
{"id":"2308.00390","submitter":"Zakir Deniz","authors":"Zakir Deniz","title":"Some results on 2-distance coloring of planar graphs with girth five","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A vertex coloring of a graph $G$ is called a 2-distance coloring if any two\nvertices at a distance at most $2$ from each other receive different colors.\nSuppose that $G$ is a planar graph with girth $5$ and maximum degree $\\Delta$.\nWe prove that $G$ admits a $2$-distance $\\Delta+7$ coloring, which improves the\nresult of Dong and Lin (J. Comb. Optim. 32(2), 645-655, 2016). Moreover, we\nprove that $G$ admits a $2$-distance $\\Delta+6$ coloring when $\\Delta\\geq 10$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:11:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Deniz","Zakir",""]]}
{"id":"2308.00391","submitter":"Jianwu Fang","authors":"Ying Yang, Kai Du, Xingyuan Dai, and Jianwu Fang","title":"Counterfactual Graph Transformer for Traffic Flow Prediction","comments":"accepted by ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traffic flow prediction (TFP) is a fundamental problem of the Intelligent\nTransportation System (ITS), as it models the latent spatial-temporal\ndependency of traffic flow for potential congestion prediction. Recent\ngraph-based models with multiple kinds of attention mechanisms have achieved\npromising performance. However, existing methods for traffic flow prediction\ntend to inherit the bias pattern from the dataset and lack interpretability. To\nthis end, we propose a Counterfactual Graph Transformer (CGT) model with an\ninstance-level explainer (e.g., finding the important subgraphs) specifically\ndesigned for TFP. We design a perturbation mask generator over input sensor\nfeatures at the time dimension and the graph structure on the graph transformer\nmodule to obtain spatial and temporal counterfactual explanations. By searching\nthe optimal perturbation masks on the input data feature and graph structures,\nwe can obtain the concise and dominant data or graph edge links for the\nsubsequent TFP task. After re-training the utilized graph transformer model\nafter counterfactual perturbation, we can obtain improved and interpretable\ntraffic flow prediction. Extensive results on three real-world public datasets\nshow that CGT can produce reliable explanations and is promising for traffic\nflow prediction.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:12:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yang","Ying",""],["Du","Kai",""],["Dai","Xingyuan",""],["Fang","Jianwu",""]]}
{"id":"2308.00392","submitter":"M. Fernando Gonzalez-Zalba","authors":"Grayson M. Noah, Thomas Swift, Mathieu de Kruijf, Alberto Gomez-Saiz,\n  John J. L. Morton and M. Fernando Gonzalez-Zalba","title":"CMOS on-chip thermometry at deep cryogenic temperatures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate on-chip temperature sensing is critical for the optimal performance\nof modern CMOS integrated circuits (ICs), to understand and monitor localized\nheating around the chip during operation. The development of quantum computers\nhas stimulated much interest in ICs operating a deep cryogenic temperatures\n(typically 0.01 - 4 K), in which the reduced thermal conductivity of silicon\nand silicon oxide, and the limited cooling power budgets make local on-chip\ntemperature sensing even more important. Here, we report four different methods\nfor on-chip temperature measurements native to complementary\nmetal-oxide-semiconductor (CMOS) industrial fabrication processes. These\ninclude secondary and primary thermometry methods and cover conventional\nthermometry structures used at room temperature as well as methods exploiting\nphenomena which emerge at cryogenic temperatures, such as superconductivity and\nCoulomb blockade. We benchmark the sensitivity of the methods as a function of\ntemperature and use them to measure local excess temperature produced by\non-chip heating elements. Our results demonstrate thermometry methods that may\nbe readily integrated in CMOS chips with operation from the milliKelivin range\nto room temperature.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:13:06 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Noah","Grayson M.",""],["Swift","Thomas",""],["de Kruijf","Mathieu",""],["Gomez-Saiz","Alberto",""],["Morton","John J. L.",""],["Gonzalez-Zalba","M. Fernando",""]]}
{"id":"2308.00393","submitter":"Zhenyu Zhong","authors":"Zhenyu Zhong, Qiliang Fan, Jiacheng Zhang, Minghua Ma, Shenglin Zhang,\n  Yongqian Sun, Qingwei Lin, Yuzhi Zhang, Dan Pei","title":"A Survey of Time Series Anomaly Detection Methods in the AIOps Domain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Internet-based services have seen remarkable success, generating vast amounts\nof monitored key performance indicators (KPIs) as univariate or multivariate\ntime series. Monitoring and analyzing these time series are crucial for\nresearchers, service operators, and on-call engineers to detect outliers or\nanomalies indicating service failures or significant events. Numerous advanced\nanomaly detection methods have emerged to address availability and performance\nissues. This review offers a comprehensive overview of time series anomaly\ndetection in Artificial Intelligence for IT operations (AIOps), which uses AI\ncapabilities to automate and optimize operational workflows. Additionally, it\nexplores future directions for real-world and next-generation time-series\nanomaly detection based on recent advancements.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:13:57 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhong","Zhenyu",""],["Fan","Qiliang",""],["Zhang","Jiacheng",""],["Ma","Minghua",""],["Zhang","Shenglin",""],["Sun","Yongqian",""],["Lin","Qingwei",""],["Zhang","Yuzhi",""],["Pei","Dan",""]]}
{"id":"2308.00394","submitter":"Lo\\\"ic Azzalini","authors":"Lo\\\"ic J. Azzalini and Emmanuel Blazquez and Alexander Hadjiivanov and\n  Gabriele Meoni and Dario Izzo","title":"On the Generation of a Synthetic Event-Based Vision Dataset for\n  Navigation and Landing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An event-based camera outputs an event whenever a change in scene brightness\nof a preset magnitude is detected at a particular pixel location in the sensor\nplane. The resulting sparse and asynchronous output coupled with the high\ndynamic range and temporal resolution of this novel camera motivate the study\nof event-based cameras for navigation and landing applications. However, the\nlack of real-world and synthetic datasets to support this line of research has\nlimited its consideration for onboard use. This paper presents a methodology\nand a software pipeline for generating event-based vision datasets from optimal\nlanding trajectories during the approach of a target body. We construct\nsequences of photorealistic images of the lunar surface with the Planet and\nAsteroid Natural Scene Generation Utility at different viewpoints along a set\nof optimal descent trajectories obtained by varying the boundary conditions.\nThe generated image sequences are then converted into event streams by means of\nan event-based camera emulator. We demonstrate that the pipeline can generate\nrealistic event-based representations of surface features by constructing a\ndataset of 500 trajectories, complete with event streams and motion field\nground truth data. We anticipate that novel event-based vision datasets can be\ngenerated using this pipeline to support various spacecraft pose reconstruction\nproblems given events as input, and we hope that the proposed methodology would\nattract the attention of researchers working at the intersection of\nneuromorphic vision and guidance navigation and control.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:14:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Azzalini","Lo\u00efc J.",""],["Blazquez","Emmanuel",""],["Hadjiivanov","Alexander",""],["Meoni","Gabriele",""],["Izzo","Dario",""]]}
{"id":"2308.00395","submitter":"Mojtaba Hosseini","authors":"Mojtaba Hosseini, Seyed Yaser Ayazi, Ahmad Mohamadnejad","title":"Gravitational waves effects and phenomenology of a two-component dark\n  matter model","comments":"23 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study an extension of the Standard Model (SM) with two candidates for dark\nmatter (DM) which includes a Dirac fermion and a Vector Dark Matter (VDM) under\nnew $U(1)$ gauge group in the hidden sector. The model is classically scale\ninvariant and the electroweak symmetry breaks because of the loop effects. We\ninvestigate the model parameter space allowed by current experimental\nconstraints and phenomenological bounds. It is shown that the model can be\nsatisfied for the large part of parameter space of VDM mass and fermion dark\nmatter mass, i.e., $400< M_V<3000$ GeV and $M_{\\psi}<400$ GeV.The electroweak\nphase transition have been discussed and shown that there is region in the\nparameter space of the model consistent with DM relic density, direct detection\nand collider constraints, while at the same time can lead to first order\nelectroweak phase transition. The gravitational waves produced during the phase\ntransition could be probed by future space-based interferometers such as LISA\nand BBO.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:15:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hosseini","Mojtaba",""],["Ayazi","Seyed Yaser",""],["Mohamadnejad","Ahmad",""]]}
{"id":"2308.00396","submitter":"Anastasiya Yilmaz","authors":"Anastasiya Yilmaz, Jiri Svoboda, Victoria Grinberg, Peter G. Boorman,\n  Michal Bursa, Michal Dovciak","title":"Accretion Disc Evolution in GRO J1655-40 and LMC X-3 with Relativistic\n  and Non-Relativistic Disc Models","comments":"Accepted for publication in MNRAS, 23 pages 17 figures","journal-ref":null,"doi":"10.1093/mnras/stad2339","report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Black hole X-ray binaries are ideal environments to study the accretion\nphenomena in strong gravitational potentials. These systems undergo dramatic\naccretion state transitions and analysis of the X-ray spectra is used to probe\nthe properties of the accretion disc and its evolution. In this work, we\npresent a systematic investigation of $\\sim$1800 spectra obtained by RXTE PCA\nobservations of GRO J1655-40 and LMC X-3 to explore the nature of the accretion\ndisc via non-relativistic and relativistic disc models describing the thermal\nemission in black-hole X-ray binaries. We demonstrate that the non-relativistic\nmodelling throughout an outburst with the phenomenological multi-colour disc\nmodel DISKBB yields significantly lower and often unphysical inner disc radii\nand correspondingly higher ($\\sim$50-60\\%) disc temperatures compared to its\nrelativistic counterparts KYNBB and KERRBB. We obtained the dimensionless spin\nparameters of $a_{*}=0.774 \\pm 0.069 $ and $a_{*}=0.752 \\pm 0.061 $ for GRO\nJ1655-40 with KERRBB and KYNBB, respectively. We report a spin value of\n$a_{*}=0.098 \\pm 0.063$ for LMC X-3 using the updated black hole mass of 6.98\n${M_{\\odot}}$. Both measurements are consistent with the previous studies.\nUsing our results, we highlight the importance of self-consistent modelling of\nthe thermal emission, especially when estimating the spin with the\ncontinuum-fitting method which assumes the disc terminates at the innermost\nstable circular orbit at all times.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:16:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yilmaz","Anastasiya",""],["Svoboda","Jiri",""],["Grinberg","Victoria",""],["Boorman","Peter G.",""],["Bursa","Michal",""],["Dovciak","Michal",""]]}
{"id":"2308.00397","submitter":"Arto Viitanen","authors":"Arto Viitanen, Timm M\\\"orstedt, Wallace S. Teixeira, Maaria Tiiri,\n  Jukka R\\\"abin\\\"a, Matti Silveri, Mikko M\\\"ott\\\"onen","title":"Quantum-circuit refrigeration of a superconducting microwave resonator\n  well below a single quantum","comments":"7 pages, 4 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":"  We experimentally demonstrate a recently proposed single-junction\nquantum-circuit refrigerator (QCR) as an in-situ-tunable low-temperature\nenvironment for a superconducting 4.7-GHz resonator. With the help of a\ntransmon qubit, we measure the populations of the different resonator Fock\nstates, thus providing reliable access to the temperature of the engineered\nelectromagnetic environment and its effect on the resonator. We demonstrate\ncoherent and thermal resonator states and that the on-demand dissipation\nprovided by the QCR can drive these to a small fraction of a photon on average,\neven if starting above 1 K. We observe that the QCR can be operated either with\na dc bias voltage or a gigahertz rf drive, or a combination of these. The\nbandwidth of the rf drive is not limited by the circuit itself and\nconsequently, we show that 2.9-GHz continuous and 10-ns-pulsed drives lead to\nidentical desired refrigeration of the resonator. These observations answer to\nthe shortcomings of previous works where the Fock states were not resolvable\nand the QCR exhibited slow charging dynamics. Thus this work introduces a\nversatile tool to study open quantum systems, quantum thermodynamics, and to\nquickly reset superconducting qubits.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:20:07 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Viitanen","Arto",""],["M\u00f6rstedt","Timm",""],["Teixeira","Wallace S.",""],["Tiiri","Maaria",""],["R\u00e4bin\u00e4","Jukka",""],["Silveri","Matti",""],["M\u00f6tt\u00f6nen","Mikko",""]]}
{"id":"2308.00398","submitter":"Xiaosong Jia","authors":"Xiaosong Jia, Yulu Gao, Li Chen, Junchi Yan, Patrick Langechuan Liu,\n  Hongyang Li","title":"DriveAdapter: Breaking the Coupling Barrier of Perception and Planning\n  in End-to-End Autonomous Driving","comments":"Accepted by ICCV 2023 (Oral). Code url:\n  https://github.com/OpenDriveLab/DriveAdapter","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  End-to-end autonomous driving aims to build a fully differentiable system\nthat takes raw sensor data as inputs and directly outputs the planned\ntrajectory or control signals of the ego vehicle. State-of-the-art methods\nusually follow the `Teacher-Student' paradigm. The Teacher model uses\nprivileged information (ground-truth states of surrounding agents and map\nelements) to learn the driving strategy. The student model only has access to\nraw sensor data and conducts behavior cloning on the data collected by the\nteacher model. By eliminating the noise of the perception part during planning\nlearning, state-of-the-art works could achieve better performance with\nsignificantly less data compared to those coupled ones.\n  However, under the current Teacher-Student paradigm, the student model still\nneeds to learn a planning head from scratch, which could be challenging due to\nthe redundant and noisy nature of raw sensor inputs and the casual confusion\nissue of behavior cloning. In this work, we aim to explore the possibility of\ndirectly adopting the strong teacher model to conduct planning while letting\nthe student model focus more on the perception part. We find that even equipped\nwith a SOTA perception model, directly letting the student model learn the\nrequired inputs of the teacher model leads to poor driving performance, which\ncomes from the large distribution gap between predicted privileged inputs and\nthe ground-truth.\n  To this end, we propose DriveAdapter, which employs adapters with the feature\nalignment objective function between the student (perception) and teacher\n(planning) modules. Additionally, since the pure learning-based teacher model\nitself is imperfect and occasionally breaks safety rules, we propose a method\nof action-guided feature learning with a mask for those imperfect teacher\nfeatures to further inject the priors of hand-crafted rules into the learning\nprocess.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:21:53 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 03:47:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jia","Xiaosong",""],["Gao","Yulu",""],["Chen","Li",""],["Yan","Junchi",""],["Liu","Patrick Langechuan",""],["Li","Hongyang",""]]}
{"id":"2308.00399","submitter":"Saad Obaid Ul Islam","authors":"Saad Obaid ul Islam, Iza \\v{S}krjanec, Ond\\v{r}ej Du\\v{s}ek and Vera\n  Demberg","title":"Tackling Hallucinations in Neural Chart Summarization","comments":"To be presented in INLG 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hallucinations in text generation occur when the system produces text that is\nnot grounded in the input. In this work, we tackle the problem of\nhallucinations in neural chart summarization. Our analysis shows that the\ntarget side of chart summarization training datasets often contains additional\ninformation, leading to hallucinations. We propose a natural language inference\n(NLI) based method to preprocess the training data and show through human\nevaluation that our method significantly reduces hallucinations. We also found\nthat shortening long-distance dependencies in the input sequence and adding\nchart-related information like title and legends improves the overall\nperformance.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:26:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Islam","Saad Obaid ul",""],["\u0160krjanec","Iza",""],["Du\u0161ek","Ond\u0159ej",""],["Demberg","Vera",""]]}
{"id":"2308.00400","submitter":"Bo Zhang","authors":"Bo Zhang, Jian Wang, Hui Ma, Bo Xu, and Hongfei Lin","title":"ZRIGF: An Innovative Multimodal Framework for Zero-Resource\n  Image-Grounded Dialogue Generation","comments":"ACM Multimedia 2023 Accpeted, Repo:\n  https://github.com/zhangbo-nlp/ZRIGF","journal-ref":null,"doi":"10.1145/3581783.3611810","report-no":null,"categories":"cs.CL cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image-grounded dialogue systems benefit greatly from integrating visual\ninformation, resulting in high-quality response generation. However, current\nmodels struggle to effectively utilize such information in zero-resource\nscenarios, mainly due to the disparity between image and text modalities. To\novercome this challenge, we propose an innovative multimodal framework, called\nZRIGF, which assimilates image-grounded information for dialogue generation in\nzero-resource situations. ZRIGF implements a two-stage learning strategy,\ncomprising contrastive pre-training and generative pre-training. Contrastive\npre-training includes a text-image matching module that maps images and texts\ninto a unified encoded vector space, along with a text-assisted masked image\nmodeling module that preserves pre-training visual features and fosters further\nmultimodal feature alignment. Generative pre-training employs a multimodal\nfusion module and an information transfer module to produce insightful\nresponses based on harmonized multimodal representations. Comprehensive\nexperiments conducted on both text-based and image-grounded dialogue datasets\ndemonstrate ZRIGF's efficacy in generating contextually pertinent and\ninformative responses. Furthermore, we adopt a fully zero-resource scenario in\nthe image-grounded dialogue dataset to demonstrate our framework's robust\ngeneralization capabilities in novel domains. The code is available at\nhttps://github.com/zhangbo-nlp/ZRIGF.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:28:36 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 13:53:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Bo",""],["Wang","Jian",""],["Ma","Hui",""],["Xu","Bo",""],["Lin","Hongfei",""]]}
{"id":"2308.00401","submitter":"Jianben He","authors":"Jianben He, Xingbo Wang, Kam Kwai Wong, Xijie Huang, Changjian Chen,\n  Zixin Chen, Fengjie Wang, Min Zhu, and Huamin Qu","title":"VideoPro: A Visual Analytics Approach for Interactive Video Programming","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Constructing supervised machine learning models for real-world video analysis\nrequire substantial labeled data, which is costly to acquire due to scarce\ndomain expertise and laborious manual inspection. While data programming shows\npromise in generating labeled data at scale with user-defined labeling\nfunctions, the high dimensional and complex temporal information in videos\nposes additional challenges for effectively composing and evaluating labeling\nfunctions. In this paper, we propose VideoPro, a visual analytics approach to\nsupport flexible and scalable video data programming for model steering with\nreduced human effort. We first extract human-understandable events from videos\nusing computer vision techniques and treat them as atomic components of\nlabeling functions. We further propose a two-stage template mining algorithm\nthat characterizes the sequential patterns of these events to serve as labeling\nfunction templates for efficient data labeling. The visual interface of\nVideoPro facilitates multifaceted exploration, examination, and application of\nthe labeling templates, allowing for effective programming of video data at\nscale. Moreover, users can monitor the impact of programming on model\nperformance and make informed adjustments during the iterative programming\nprocess. We demonstrate the efficiency and effectiveness of our approach with\ntwo case studies and expert interviews.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:28:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["He","Jianben",""],["Wang","Xingbo",""],["Wong","Kam Kwai",""],["Huang","Xijie",""],["Chen","Changjian",""],["Chen","Zixin",""],["Wang","Fengjie",""],["Zhu","Min",""],["Qu","Huamin",""]]}
{"id":"2308.00402","submitter":"Daniel Scholz","authors":"Daniel Scholz, Benedikt Wiestler, Daniel Rueckert, Martin J. Menten","title":"Metrics to Quantify Global Consistency in Synthetic Medical Images","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":"  Image synthesis is increasingly being adopted in medical image processing,\nfor example for data augmentation or inter-modality image translation. In these\ncritical applications, the generated images must fulfill a high standard of\nbiological correctness. A particular requirement for these images is global\nconsistency, i.e an image being overall coherent and structured so that all\nparts of the image fit together in a realistic and meaningful way. Yet,\nestablished image quality metrics do not explicitly quantify this property of\nsynthetic images. In this work, we introduce two metrics that can measure the\nglobal consistency of synthetic images on a per-image basis. To measure the\nglobal consistency, we presume that a realistic image exhibits consistent\nproperties, e.g., a person's body fat in a whole-body MRI, throughout the\ndepicted object or scene. Hence, we quantify global consistency by predicting\nand comparing explicit attributes of images on patches using supervised trained\nneural networks. Next, we adapt this strategy to an unlabeled setting by\nmeasuring the similarity of implicit image features predicted by a\nself-supervised trained network. Our results demonstrate that predicting\nexplicit attributes of synthetic images on patches can distinguish globally\nconsistent from inconsistent images. Implicit representations of images are\nless sensitive to assess global consistency but are still serviceable when\nlabeled data is unavailable. Compared to established metrics, such as the FID,\nour method can explicitly measure global consistency on a per-image basis,\nenabling a dedicated analysis of the biological plausibility of single\nsynthetic images.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:29:39 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Scholz","Daniel",""],["Wiestler","Benedikt",""],["Rueckert","Daniel",""],["Menten","Martin J.",""]]}
{"id":"2308.00403","submitter":"Sk Minhajur Rahaman","authors":"Sk. Minhajur Rahaman, Jonathan Granot, Paz Beniamini","title":"Prompt Gamma-Ray Burst Emission from Internal Shocks -- New Insights","comments":"This paper will be submitted to a journal soon. Comments and\n  suggestions are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Internal shocks are a leading candidate for the dissipation mechanism that\npowers the prompt $\\gamma$-ray emission in gamma-ray bursts (GRBs). In this\nscenario a compact central source produces an ultra-relativistic outflow with\nvarying speeds, causing faster parts or shells to collide with slower ones.\nEach collision produces a pair of shocks -- a forward shock (FS) propagating\ninto the slower leading shell and a reverse shock (RS) propagating into the\nfaster trailing shell. The RS's lab-frame speed is always smaller, while the RS\nis typically stronger than the FS, leading to different conditions in the two\nshocked regions that both contribute to the observed emission. We show that\noptically-thin synchrotron emission from both (weaker FS + stronger RS) can\nnaturally explain key features of prompt GRB emission such as the pulse shapes,\ntime-evolution of the $\\nu{}F_\\nu$ peak flux and photon-energy, and the\nspectrum. Particularly, it can account for two features commonly observed in\nGRB spectra: (i) a sub-dominant low-energy spectral component (often\ninterpreted as ``photospheric''-like), or (ii) a doubly-broken power-law\nspectrum with the low-energy spectral slope approaching the slow cooling limit.\nBoth features can be obtained while maintaining high overall radiative\nefficiency without any fine-tuning of the physical conditions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:30:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Rahaman","Sk. Minhajur",""],["Granot","Jonathan",""],["Beniamini","Paz",""]]}
{"id":"2308.00404","submitter":"Claudio Pomo","authors":"Vito Walter Anelli, Daniele Malitesta, Claudio Pomo, Alejandro\n  Bellog\\'in, Tommaso Di Noia, Eugenio Di Sciascio","title":"Challenging the Myth of Graph Collaborative Filtering: a Reasoned and\n  Reproducibility-driven Analysis","comments":"Accepted to RecSys '23 - Reproducility Track","journal-ref":null,"doi":"10.1145/3604915.3608759","report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The success of graph neural network-based models (GNNs) has significantly\nadvanced recommender systems by effectively modeling users and items as a\nbipartite, undirected graph. However, many original graph-based works often\nadopt results from baseline papers without verifying their validity for the\nspecific configuration under analysis. Our work addresses this issue by\nfocusing on the replicability of results. We present a code that successfully\nreplicates results from six popular and recent graph recommendation models\n(NGCF, DGCF, LightGCN, SGL, UltraGCN, and GFCF) on three common benchmark\ndatasets (Gowalla, Yelp 2018, and Amazon Book). Additionally, we compare these\ngraph models with traditional collaborative filtering models that historically\nperformed well in offline evaluations. Furthermore, we extend our study to two\nnew datasets (Allrecipes and BookCrossing) that lack established setups in\nexisting literature. As the performance on these datasets differs from the\nprevious benchmarks, we analyze the impact of specific dataset characteristics\non recommendation accuracy. By investigating the information flow from users'\nneighborhoods, we aim to identify which models are influenced by intrinsic\nfeatures in the dataset structure. The code to reproduce our experiments is\navailable at: https://github.com/sisinflab/Graph-RSs-Reproducibility.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:31:44 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Anelli","Vito Walter",""],["Malitesta","Daniele",""],["Pomo","Claudio",""],["Bellog\u00edn","Alejandro",""],["Di Noia","Tommaso",""],["Di Sciascio","Eugenio",""]]}
{"id":"2308.00405","submitter":"Orsolya Vasarhelyi","authors":"Orsolya V\\'as\\'arhelyi and Em\\H{o}ke-\\'Agnes Horv\\'at","title":"Who benefits from altmetrics? The effect of team gender composition on\n  the link between online visibility and citation impact","comments":"20 pages, 2 figures, 5 tables","journal-ref":"Proceedings 19th International Society of Scientometrics and\n  Informetrics Conference, Bloomington, Indiana, 2023","doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Online science dissemination has quickly become crucial in promoting\nscholars' work. Recent literature has demonstrated a lack of visibility for\nwomen's research, where women's articles receive fewer academic citations than\nmen's. The informetric and scientometric community has briefly examined\ngender-based inequalities in online visibility. However, the link between\nonline sharing of scientific work and citation impact for teams with different\ngender compositions remains understudied. Here we explore whether online\nvisibility is helping women overcome the gender-based citation penalty. Our\nanalyses cover the three broad research areas of Computer Science, Engineering,\nand Social Sciences, which have different gender representation, adoption of\nonline science dissemination practices, and citation culture. We create a\nquasi-experimental setting by applying Coarsened Exact Matching, which enables\nus to isolate the effects of team gender composition and online visibility on\nthe number of citations. We find that online visibility positively affects\ncitations across research areas, while team gender composition interacts\ndifferently with visibility in these research areas. Our results provide\nessential insights into gendered citation patterns and online visibility,\ninviting informed discussions about decreasing the citation gap.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:33:31 GMT"}],"update_date":"2023-08-02","authors_parsed":[["V\u00e1s\u00e1rhelyi","Orsolya",""],["Horv\u00e1t","Em\u0151ke-\u00c1gnes",""]]}
{"id":"2308.00406","submitter":"Shanqi Pang","authors":"Shanqi Pang, Chaomeng Zhang, Mengqian Chen, Miaomiao Zhang","title":"Near MDS and near quantum MDS codes via orthogonal arrays","comments":"13 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Near MDS (NMDS) codes are closely related to interesting objects in finite\ngeometry and have nice applications in combinatorics and cryptography. But\nthere are many unsolved problems about construction of NMDS codes. In this\npaper, by using symmetrical orthogonal arrays (OAs), we construct a lot of\nNMDS, $m$-MDS and almost extremal NMDS codes. We establish a relation between\nasymmetrical OAs and quantum error correcting codes (QECCs) over mixed\nalphabets. Since quantum maximum distance separable (QMDS) codes over mixed\nalphabets with the dimension equal to one have not been found in all the\nliterature so far, the definition of a near quantum maximum distance separable\n(NQMDS) code over mixed alphabets is proposed. By using asymmetrical OAs, we\nobtain many such codes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:36:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Pang","Shanqi",""],["Zhang","Chaomeng",""],["Chen","Mengqian",""],["Zhang","Miaomiao",""]]}
{"id":"2308.00407","submitter":"Shen Li","authors":"S. Li, A. Mirani, M. Karlsson, E. Agrell","title":"Coded Modulation Schemes for Voronoi Constellations","comments":"13 pages, 8 fugyres","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multidimensional Voronoi constellations (VCs) are shown to be more\npower-efficient than quadrature amplitude modulation (QAM) formats given the\nsame uncoded bit error rate, and also have higher achievable information rates.\nHowever, a coded modulation scheme to sustain these gains after forward error\ncorrection (FEC) coding is still lacking. This paper designs coded modulation\nschemes with soft-decision FEC codes for VCs, including bit-interleaved coded\nmodulation (BICM) and multilevel coded modulation (MLCM), together with three\nbit-to-integer mapping algorithms and log-likelihood ratio calculation\nalgorithms. Simulation results show that VCs can achieve up to 1.84 dB\nsignal-to-noise ratio (SNR) gains over QAM with BICM, and up to 0.99 dB SNR\ngains over QAM with MLCM for the additive white Gaussian noise channel, with a\nsurprisingly low complexity.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:37:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","S.",""],["Mirani","A.",""],["Karlsson","M.",""],["Agrell","E.",""]]}
{"id":"2308.00408","submitter":"Michele Jamrozik","authors":"Michele Jamrozik, Vincent Gaudilli\\`ere, Mohamed Adel Musallam and\n  Djamila Aouada","title":"Space Debris: Are Deep Learning-based Image Enhancements part of the\n  Solution?","comments":"Presented in ISCS23","journal-ref":null,"doi":null,"report-no":"ISCS23-7","categories":"eess.IV cs.CV physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The volume of space debris currently orbiting the Earth is reaching an\nunsustainable level at an accelerated pace. The detection, tracking,\nidentification, and differentiation between orbit-defined, registered\nspacecraft, and rogue/inactive space ``objects'', is critical to asset\nprotection. The primary objective of this work is to investigate the validity\nof Deep Neural Network (DNN) solutions to overcome the limitations and image\nartefacts most prevalent when captured with monocular cameras in the visible\nlight spectrum. In this work, a hybrid UNet-ResNet34 Deep Learning (DL)\narchitecture pre-trained on the ImageNet dataset, is developed. Image\ndegradations addressed include blurring, exposure issues, poor contrast, and\nnoise. The shortage of space-generated data suitable for supervised DL is also\naddressed. A visual comparison between the URes34P model developed in this work\nand the existing state of the art in deep learning image enhancement methods,\nrelevant to images captured in space, is presented. Based upon visual\ninspection, it is determined that our UNet model is capable of correcting for\nspace-related image degradations and merits further investigation to reduce its\ncomputational complexity.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:38:41 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jamrozik","Michele",""],["Gaudilli\u00e8re","Vincent",""],["Musallam","Mohamed Adel",""],["Aouada","Djamila",""]]}
{"id":"2308.00409","submitter":"Giulio Ciraolo","authors":"Giulio Ciraolo, Matteo Cozzi, Matteo Perugini and Luigi Pollastro","title":"A quantitative version of the Gidas-Ni-Nirenberg Theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A celebrated result by Gidas-Ni-Nirenberg asserts that classical solutions to\nsemilinear equations~$- \\Delta u = f(u)$ in a ball vanishing at the boundary\nmust be radial and radially decreasing. In this paper we consider small\nperturbations of this equation and study its quantitative stability\ncounterpart.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:39:22 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ciraolo","Giulio",""],["Cozzi","Matteo",""],["Perugini","Matteo",""],["Pollastro","Luigi",""]]}
{"id":"2308.00410","submitter":"Shaoshi Yang Prof.","authors":"Die Hu, Shaoshi Yang, Min Gong, Zhiyong Feng, Xuejun Zhu","title":"A Cyber-Physical Routing Protocol Exploiting Trajectory Dynamics for\n  Mission-Oriented Flying Ad Hoc Networks","comments":"12 pages, 24 figures, accepted to appear on Engineering in Dec. 2022\n  (ISSN 2095-8099)","journal-ref":"Engineering, Volume 19, Pages 217-227, Dec. 2022","doi":"10.1016/j.eng.2021.10.022","report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a special type of mobile ad hoc network (MANET), the flying ad hoc network\n(FANET) has the potential to enable a variety of emerging applications in both\ncivilian wireless communications (e.g., 5G and 6G) and the defense industry.\nThe routing protocol plays a pivotal role in FANET. However, when designing the\nrouting protocol for FANET, it is conventionally assumed that the aerial nodes\nmove randomly. This is clearly inappropriate for a mission-oriented FANET\n(MO-FANET), in which the aerial nodes typically move toward a given destination\nfrom given departure point(s), possibly along a roughly deterministic flight\npath while maintaining a well-established formation, in order to carry out\ncertain missions. In this paper, a novel cyber-physical routing protocol\nexploiting the particular mobility pattern of an MO-FANET is proposed based on\ncross-disciplinary integration, which makes full use of the mission-determined\ntrajectory dynamics to construct the time sequence of rejoining and separating,\nas well as the adjacency matrix for each node, as prior information. Compared\nwith the existing representative routing protocols used in FANETs, our protocol\nachieves a higher packet-delivery ratio (PDR) at the cost of even lower\noverhead and lower average end-to-end latency, while maintaining a reasonably\nmoderate and stable network jitter, as demonstrated by extensive ns-3-based\nsimulations assuming realistic configurations in an MO-FANET.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:42:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hu","Die",""],["Yang","Shaoshi",""],["Gong","Min",""],["Feng","Zhiyong",""],["Zhu","Xuejun",""]]}
{"id":"2308.00411","submitter":"Hepeng Yao","authors":"Yanliang Guo, Hepeng Yao, Satwik Ramanjanappa, Sudipta Dhar, Milena\n  Horvath, Lorenzo Pizzino, Thierry Giamarchi, Manuele Landini, Hanns-Christoph\n  N\\\"agerl","title":"Experimental Observation of the 2D-1D Dimensional Crossover in Strongly\n  Interacting Ultracold Bosons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dimensionality plays an essential role in determining the nature and\nproperties of a physical system. For quantum systems the impact of interactions\nand fluctuations is enhanced in lower dimensions, leading to a great diversity\nof genuine quantum effects for reduced dimensionality. In most cases, the\ndimension is fixed to some integer value. Here, we experimentally probe the\ndimensional crossover from two to one dimension using strongly interacting\nultracold bosons in variable lattice potentials and compare the data to\nab-initio theory that takes into account non-homogeneous trapping and non-zero\ntemperature. From a precise measurement of the momentum distribution we analyze\nthe characteristic decay of the one-body correlation function in the two\ndimensionalities and then track how the decay is modified in the crossover. A\nvarying two-slope structure is revealed, reflecting the fact that the particles\nsee their dimensionality as being one or two depending on whether they are\nprobed on short or long distances, respectively. Our observations demonstrate\nhow quantum properties in the strongly-correlated regime evolve in the\ndimensional crossover as a result of the interplay between dimensionality,\ninteractions, and temperature.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:44:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Guo","Yanliang",""],["Yao","Hepeng",""],["Ramanjanappa","Satwik",""],["Dhar","Sudipta",""],["Horvath","Milena",""],["Pizzino","Lorenzo",""],["Giamarchi","Thierry",""],["Landini","Manuele",""],["N\u00e4gerl","Hanns-Christoph",""]]}
{"id":"2308.00412","submitter":"Sebastian Sailler","authors":"S. Sailler and G. Skobjin and H. Schl\\\"orb and B. Boehm and O. Hellwig\n  and A. Thomas and S. T. B. Goennenwein and M. Lammel","title":"Crystallization Dynamics of Amorphous Yttrium Iron Garnet 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":"  Yttrium iron garnet (YIG) is a prototypical material in spintronics due to\nits exceptional magnetic properties. To exploit these properties high quality\nthin films need to be manufactured. Deposition techniques like sputter\ndeposition or pulsed laser deposition at ambient temperature produce amorphous\nfilms, which need a post annealing step to induce crystallization. However, not\nmuch is known about the exact dynamics of the formation of crystalline YIG out\nof the amorphous phase. Here, we conduct extensive time and temperature series\nto study the crystallization behavior of YIG on various substrates and extract\nthe crystallization velocities as well as the activation energies needed to\npromote crystallization. We find that the type of crystallization as well as\nthe crystallization velocity depend on the lattice mismatch to the substrate.\nWe compare the crystallization parameters found in literature with our results\nand find an excellent agreement with our model. Our results allow us to\ndetermine the time needed for the formation of a fully crystalline film of\narbitrary thickness for any temperature.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:45:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sailler","S.",""],["Skobjin","G.",""],["Schl\u00f6rb","H.",""],["Boehm","B.",""],["Hellwig","O.",""],["Thomas","A.",""],["Goennenwein","S. T. B.",""],["Lammel","M.",""]]}
{"id":"2308.00413","submitter":"Tomoya Ono","authors":"Mitsuharu Uemoto, Nahoto Funaki, Kazuma Yokota, Takuji Hosoi, and\n  Tomoya Ono","title":"Density functional theory study on effect of NO annealing for SiC(0001)\n  surface with atomic-scale steps","comments":"12 pages","journal-ref":null,"doi":null,"report-no":"PRESAT-9601","categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Density functional theory calculations for the electronic structures of the\n4H-SiC(0001)/SiO$_2$ interface with atomic-scale steps are carried out to\ninvestigate the effect of NO annealing. The characteristic behavior of the\nconduction band edge states of SiC is strongly affected over a wide area of the\ninterface by the Coulomb interaction of the O atoms in the SiO$_2$ region as\nwell as the step structure of the interface, resulting in the discontinuity of\nthe inversion layers at the step edges under the gate bias. The spatially\ndiscontinued band only allows the very limited conduction paths in the\ninversion layer, leading to the significantly decreased mobile carrier density.\nIt is found that the Coulomb interaction of the O atoms is screened and the\ninversion layers become continuous when the nitrided layers are inserted at the\ninterface by NO annealing. This result is in good agreement with experimental\nfindings that the improvement of the performance of SiC\nmetal-oxide-semiconductor field-effect-transistors by NO annealing is\nattributed to an increase in the mobile electron density rather than an\nincrease in the mobility of electrons in the inversion layer.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:49:29 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Uemoto","Mitsuharu",""],["Funaki","Nahoto",""],["Yokota","Kazuma",""],["Hosoi","Takuji",""],["Ono","Tomoya",""]]}
{"id":"2308.00414","submitter":"Saumen Chaudhuri","authors":"Saumen Chaudhuri, A. K. Das, G. P. Das and B. N. Dev","title":"Ab-initio Study of Electronic and Lattice Dynamical Properties of\n  monolayer ZnO under Strain","comments":"12 pages, 8 figures","journal-ref":null,"doi":"10.1007/s11664-022-09938-4","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  First-principles density functional theory based calculations have been\nperformed to investigate the strain-induced modifications in the electronic and\nvibrational properties of monolayer (ML) ZnO. Wide range of in-plane tensile\nand compressive strains along different directions are applied to analyse the\nmodifications in detail. The electronic band gap reduces under both tensile and\ncompressive strains and a direct to indirect band gap transition occurs for\nhigh values of biaxial tensile strain. The relatively low rate of decrease of\nband gap and large required strain for direct to indirect band gap transition\ncompared to other $2$D materials are analysed. Systematic decrease in the\nfrequency of the in-plane and increase in the out-of-plane optical phonon modes\nwith increasing tensile strain are observed. The in-plane acoustic modes show\nlinear dispersion for unstrained as well as strained cases. However, the\nout-of-plane acoustic mode (ZA), which shows quadratic dispersion in the\nunstrained condition, turns linear with strain. The dispersion of the ZA mode\nis analysed using the shell elasticity theory and the possibility of ripple\nformation with strain is analysed. The strain-induced linearity of the ZA mode\nindicates the absence of rippling under strain. Finally, the stability limit of\nML-ZnO is investigated and found that for $18\\%$ biaxial tensile strain the\nstructure shows instability with the emergence of imaginary phonon modes.\nFurthermore, the potential of ML-ZnO to be a good thermoelectric material is\nanalyzed in an intuitive way based on the calculated electronic and phononic\nproperties. Our results, thus, not only highlight the significance of\nstrain-engineering in tailoring the electronic and vibrational properties but\nalso provide a thorough understanding of the lattice dynamics and mechanical\nstrength of ML-ZnO.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:50:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chaudhuri","Saumen",""],["Das","A. K.",""],["Das","G. P.",""],["Dev","B. N.",""]]}
{"id":"2308.00415","submitter":"Xiao Wang","authors":"Xiao Wang, Sean MacAvaney, Craig Macdonald, Iadh Ounis","title":"Generative Query Reformulation for Effective Adhoc Search","comments":"Accepted to Gen-IR@SIGIR2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Performing automatic reformulations of a user's query is a popular paradigm\nused in information retrieval (IR) for improving effectiveness -- as\nexemplified by the pseudo-relevance feedback approaches, which expand the query\nin order to alleviate the vocabulary mismatch problem. Recent advancements in\ngenerative language models have demonstrated their ability in generating\nresponses that are relevant to a given prompt. In light of this success, we\nseek to study the capacity of such models to perform query reformulation and\nhow they compare with long-standing query reformulation methods that use\npseudo-relevance feedback. In particular, we investigate two representative\nquery reformulation frameworks, GenQR and GenPRF. GenQR directly reformulates\nthe user's input query, while GenPRF provides additional context for the query\nby making use of pseudo-relevance feedback information. For each reformulation\nmethod, we leverage different techniques, including fine-tuning and direct\nprompting, to harness the knowledge of language models. The reformulated\nqueries produced by the generative models are demonstrated to markedly benefit\nthe effectiveness of a state-of-the-art retrieval pipeline on four TREC test\ncollections (varying from TREC 2004 Robust to the TREC 2019 Deep Learning).\nFurthermore, our results indicate that our studied generative models can\noutperform various statistical query expansion approaches while remaining\ncomparable to other existing complex neural query reformulation models, with\nthe added benefit of being simpler to implement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:51:35 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wang","Xiao",""],["MacAvaney","Sean",""],["Macdonald","Craig",""],["Ounis","Iadh",""]]}
{"id":"2308.00416","submitter":"Hoyoun Kim","authors":"Jaywan Chung, Seungmin Kang, Ho-Youn Kim, and Yong-Jung Kim","title":"Diffusion laws select boundary conditions","comments":"17 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The choice of boundary condition makes an essential difference in the\nsolution structure of diffusion equations. The Dirichlet and Neumann boundary\nconditions and their combination have been the most used, but their legitimacy\nhas been disputed. We show that the diffusion laws may select boundary\nconditions by themselves, and through this, we clarify the meaning of boundary\nconditions. To do that we extend the domain with a boundary into the whole\nspace by giving a small diffusivity $\\eps>0$ outside the domain. Then, we show\nthat the boundary condition turns out to be Neumann or Dirichlet as $\\eps\\to0$\ndepending on the choice of a heterogeneous diffusion law. These boundary\nconditions are interpreted in terms of a microscopic-scale random walk model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:52:17 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chung","Jaywan",""],["Kang","Seungmin",""],["Kim","Ho-Youn",""],["Kim","Yong-Jung",""]]}
{"id":"2308.00417","submitter":"Juan Hern\\'andez","authors":"Juan Hernandez-Toro","title":"The use of the invariant's properties in the primality test and prime\n  search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The purpose of this article is to delve into the properties of invariants.\nThe properties, explained in [2], reveal new ways to develop algorithms that\nallow us to test the primality of a number. In this article, some of these are\nshown, indicating the advantages and disadvantages of these new algorithms. The\ninformation provided by these algorithms also gives additional information\nregarding the factorization of a compound number.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:52:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hernandez-Toro","Juan",""]]}
{"id":"2308.00418","submitter":"Alexei Yu. Aladyshkin","authors":"A. Yu. Aladyshkin and K. Schouteden","title":"Field-Emission Resonances in Thin Metallic Films: Nonexponential Decay\n  of the Tunneling Current as a Function of the Sample-to-Tip Distance","comments":"25 pages, 18 figures","journal-ref":"Journal of Physical Chemistry C, vol. 126, 13341-13348 (2022)","doi":"10.1021/acs.jpcc.2c02374","report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Field-emission resonances (FERs) for two-dimensional Pb(111) islands grown on\n\\mbox{Si(111)7$\\times$7} surfaces were studied by low-temperature scanning\ntunneling microscopy and spectroscopy (STM/STS) in a broad range of tunneling\nconditions with both active and disabled feedback loop. These FERs exist at\nquantized sample-to-tip distances $Z^{\\,}_n$ above the sample surface, where\n$n$ is the serial number of the FER state. By recording the trajectory of the\nSTM tip during ramping of the bias voltage $U$ (while keeping the tunneling\ncurrent $I$ fixed), we obtain the set of the $Z^{\\,}_n$ values corresponding to\nlocal maxima in the derived $dZ/dU(U)$ spectra. This way, the continuous\nevolution of $Z^{\\,}_n$ as a function of $U$ for all FERs was investigated by\nSTS experiments with active feedback loop for different $I$. Complementing\nthese measurements by current-distance spectroscopy at a fixed $U$, we could\nconstruct a 4-dimensional $I-U-Z-dZ/dU$ diagram, that allows us to investigate\nthe geometric localization of the FERs above the surface. We demonstrate that\n(i) the difference $\\delta Z^{\\,}_n=Z^{\\,}_{n+1}-Z^{\\,}_n$ between neighboring\nFER lines in the $Z-U$ diagram is independent of $n$ for higher resonances,\n(ii) the $\\delta Z^{\\,}_{n}$ value decreases as $U$ increases; (iii) the\nquantized FER states lead to the \\emph{periodic} variations of $\\ln I$ as a\nfunction of $Z$ with periodicity $\\delta Z$; (iv) the periodic variations in\nthe $\\ln I - Z$ spectra allows to estimate the absolute height of the tip above\nthe sample surface. Our findings contribute to a deeper understanding on how\nthe FER states affect various types of tunneling spectroscopy experiments and\nhow they lead to a non-exponential decay of the tunneling current as a function\nof $Z$ at high bias voltages in the regime of quantized electron emission.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:54:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Aladyshkin","A. Yu.",""],["Schouteden","K.",""]]}
{"id":"2308.00419","submitter":"Shaoshi Yang Prof.","authors":"Yue Cao, Shaoshi Yang, Xiao Ma, Zhiyong Feng","title":"Cooperative Positioning for Sparsely Distributed High-Mobility Wireless\n  Networks with EKF Based Spatio-Temporal Data Fusion","comments":"5 pages, 3 figures, accepted to appear on IEEE Communications\n  Letters, Jun. 2023","journal-ref":null,"doi":"10.1109/LCOMM.2023.3296022","report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a distributed cooperative positioning algorithm using the extended\nKalman filter (EKF) based spatio-temporal data fusion (STDF) for a wireless\nnetwork composed of sparsely distributed high-mobility nodes. Our algorithm\nfirst makes a coarse estimation of the position and mobility state of the nodes\nby using the prediction step of EKF. Then it utilizes the coarse estimate as\nthe prior of STDF that relies on factor graph (FG), thus facilitates inferring\na posteriori distributions of the agents' positions in a distributed manner. We\napproximate the nonlinear terms of the messages passed on the associated FG\nwith high precision by exploiting the second-order Taylor polynomial and obtain\nclosed-form representations of each message in the data fusion step, where\ntemporal measurements by imperfect hardware are considered additionally. In the\nthird stage, refinement of position estimate is performed by invoking the\nupdate step of EKF. Simulation results and analysis show that our EKF-STDF has\na lower computational complexity than the state-of-the-art EKF-based\nalgorithms, while achieving an even superior positioning performance in harsh\nenvironment.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:56:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cao","Yue",""],["Yang","Shaoshi",""],["Ma","Xiao",""],["Feng","Zhiyong",""]]}
{"id":"2308.00420","submitter":"Nadine Friesen","authors":"Nadine Friesen, Tim Sander, Karl Nachtigall, Nils Nie{\\ss}en","title":"The complexity of the Timetable-Based Railway Network Design Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Because of the long planning periods and their long life cycle, railway\ninfrastructure has to be outlined long ahead. At the present, the\ninfrastructure is designed while only little about the intended operation is\nknown. Hence, the timetable and the operation are adjusted to the\ninfrastructure. Since space, time and money for extension measures of railway\ninfrastructure are limited, each modification has to be done carefully and long\nlasting and should be appropriate for the future unknown demand.\n  To take this into account, we present the robust network design problem for\nrailway infrastructure under capacity constraints and uncertain timetables.\nHere, we plan the required expansion measures for an uncertain long-term\ntimetable. We show that this problem is NP-hard even when restricted to\nbipartite graphs and very simple timetables and present easier solvable special\ncases.\n  This problem corresponds to the fixed-charge network design problem where the\nexpansion costs are minimized such that the timetable is conductible. We model\nthis problem by an integer linear program using time expanded networks.\n  To incorporate the uncertainty of the future timetable, we use a\nscenario-based approach. We define scenarios with individual departure and\narrival times and optional trains. The network is then optimized such that a\ngiven percentage of the scenarios can be operated while minimizing the\nexpansion costs and potential penalty costs for not scheduled optional trains.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:59:04 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Friesen","Nadine",""],["Sander","Tim",""],["Nachtigall","Karl",""],["Nie\u00dfen","Nils",""]]}
{"id":"2308.00421","submitter":"David Dahmen","authors":"Moritz Layer, Moritz Helias, David Dahmen","title":"Beyond-mean-field theory for the statistics of neural coordination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the coordination structure of neurons in neuronal networks is\nessential for unraveling the distributed information processing mechanisms in\nbrain networks. Recent advancements in measurement techniques have resulted in\nan increasing amount of data on neural activities recorded in parallel,\nrevealing largely heterogeneous correlation patterns across neurons. Yet, the\nmechanistic origin of this heterogeneity is largely unknown because existing\ntheoretical approaches linking structure and dynamics in neural circuits are\nmostly restricted to average connection patterns. Here we present a systematic\ninclusion of variability in network connectivity via tools from statistical\nphysics of disordered systems. We study networks of spiking leaky\nintegrate-and-fire neurons and employ mean-field and linear-response methods to\nmap the spiking networks to linear rate models with an equivalent\nneuron-resolved correlation structure. The latter models can be formulated in a\nfield-theoretic language that allows using disorder-average and replica\ntechniques to systematically derive quantitatively matching beyond-mean-field\npredictions for the mean and variance of cross-covariances as functions of the\naverage and variability of connection patterns. We show that heterogeneity in\ncovariances is not a result of variability in single-neuron firing statistics\nbut stems from the sparse realization and variable strength of connections, as\nubiquitously observed in brain networks. Average correlations between neurons\nare found to be insensitive to the level of heterogeneity, which in contrast\nmodulates the variability of covariances across many orders of magnitude,\ngiving rise to an efficient tuning of the complexity of coordination patterns\nin neuronal circuits.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:03:21 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 11:38:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Layer","Moritz",""],["Helias","Moritz",""],["Dahmen","David",""]]}
{"id":"2308.00422","submitter":"Loujun Yu","authors":"Lou-Jun Yu, Wen-Huan Wang","title":"A complete solution of the $k$-uniform supertrees with the eight largest\n  $\\alpha$-spectral radii","comments":"21 pages,1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mathcal T (n, k)$ be the set of the $k$-uniform supertrees with $n$\nvertices and $m$ edges, where $k\\geq 3$, $n\\geq 5$ and $m=\\frac{n-1}{k-1}$. %\nLet $m$ be the number of the edges of the supertrees in $\\mathcal T (n, k)$,\nwhere $m=\\frac{n-1}{k-1}$. A conjecture concerning the supertrees with the\nfourth through the eighth largest $\\alpha$-spectral radii in $\\mathcal T (n,\nk)$ was proposed by You et al.\\ (2020), where $0 \\leq \\alpha<1$, $k\\geq 3$ and\n$m \\geq 10$. This conjecture was partially solved for $1-\\frac{1}{m-2}\\leq\n\\alpha <1$ and $m\\geq 10$ by Wang et al.\\ (2022). When $0\\leq \\alpha\n<1-\\frac{1}{m-2}$ and $m \\geq 10$, whether this conjecture is correct or not\nremains a problem to be further solved. By using a new $\\rho_{\\alpha}$-normal\nlabeling method proposed in this article for computing the $\\alpha$-spectral\nradius of the $k$-uniform hypergraphs, we completely prove that this conjecture\nis right for $0\\leq\\alpha<1$ and $m\\geq 13$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:06:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yu","Lou-Jun",""],["Wang","Wen-Huan",""]]}
{"id":"2308.00423","submitter":"Saumen Chaudhuri","authors":"Saumen Chaudhuri, Amrita Bhattacharya, A. K. Das, G. P. Das and B. N.\n  Dev","title":"Hydrostatic Pressure Induced Anomalous Enhancement in the Thermoelectric\n  Performance of Monolayer MoS$_{2}$","comments":"13 pages, 8 figures. arXiv admin note: text overlap with\n  arXiv:2203.12991","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hydrostatic pressure induced changes in the transport properties of\nmonolayer (ML) MoS$_2$ have been investigated using first-principles density\nfunctional theory based calculations. The application of pressure induces shift\nin the conduction band minimum (CBM) from K to $\\Lambda$, while retaining the\nband extrema at K in around the same energy at a pressure of 10 GPa. This\nincrease in valley degeneracy is found to have a significant impact on the\nelectronic transport properties of ML-MoS$_2$ via enhancement of the\nthermopower (S) by up to 140\\% and power factor (S$^{2}$$\\sigma$/$\\tau$) by up\nto 310\\% at 300 K. Besides, the very low deformation potential (E$_\\text{DP}$)\nassociated with the CB-$\\Lambda$ valley results in a remarkably high electronic\nmobility ($\\mu$) and relaxation time ($\\tau$). Additionally, the application of\npressure reduces the room temperature lattice thermal conductivity\n($\\kappa_\\text{L}$) by 20\\% of its unstrained value, owing to the increased\nanharmonicity and resulting increase in the intrinsic phonon scattering rates.\nThe hydrostatic pressure induced increase in power factor (S$^{2}$$\\sigma$) and\nthe decrease in $\\kappa_\\text{L}$ act in unison to result in a substantial\nimprovement in the overall thermoelectric performance (zT) of ML-MoS$_2$. At\n900 K with an external pressure of 25 GPa, zT values of 1.63 and 1.21 are\nobtained for electron and hole doping, respectively, which are significantly\nhigher compared to the zT values at zero pressure. For the implementation in a\nthermoelectric module where both n-type and p-type legs should be preferably\nmade of the same material, the concomitant increase in zT of ML-MoS$_2$ for\nboth types of doping with hydrostatic pressure can be highly beneficial.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:08:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chaudhuri","Saumen",""],["Bhattacharya","Amrita",""],["Das","A. K.",""],["Das","G. P.",""],["Dev","B. N.",""]]}
{"id":"2308.00424","submitter":"Prosenjit Mandal","authors":"Absos Ali Shaikh, Prosenjit Mandal and V. Amarendra Babu","title":"Triviality Results and Conjugate Radius Estimation of Ricci Solitons","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The investigation of Ricci solitons is the focus of this work. We have proved\ntriviality results for compact gradient Ricci soliton under certain\nrestriction. Later, a rigidity result is derived for a compact gradient\nshrinking Ricci soliton. Also, we have estimated the conjugate radius for\nnon-compact gradient shrinking Ricci solitons with superharmonic potential.\nMoreover, an upper bound for the conjugate radius of Ricci soliton with\nconcircular potential vector field is determined. Finally, it is proved that a\nnon-compact gradient Ricci soliton with a pole and non-negative Ricci curvature\nis non-shrinking.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:09:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shaikh","Absos Ali",""],["Mandal","Prosenjit",""],["Babu","V. Amarendra",""]]}
{"id":"2308.00425","submitter":"Christina Niklaus","authors":"Christina Niklaus, Matthias Cetto, Andr\\'e Freitas, Siegfried\n  Handschuh","title":"Discourse-Aware Text Simplification: From Complex Sentences to Linked\n  Propositions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sentences that present a complex syntax act as a major stumbling block for\ndownstream Natural Language Processing applications whose predictive quality\ndeteriorates with sentence length and complexity. The task of Text\nSimplification (TS) may remedy this situation. It aims to modify sentences in\norder to make them easier to process, using a set of rewriting operations, such\nas reordering, deletion, or splitting. State-of-the-art syntactic TS approaches\nsuffer from two major drawbacks: first, they follow a very conservative\napproach in that they tend to retain the input rather than transforming it, and\nsecond, they ignore the cohesive nature of texts, where context spread across\nclauses or sentences is needed to infer the true meaning of a statement. To\naddress these problems, we present a discourse-aware TS approach that splits\nand rephrases complex English sentences within the semantic context in which\nthey occur. Based on a linguistically grounded transformation stage that uses\nclausal and phrasal disembedding mechanisms, complex sentences are transformed\ninto shorter utterances with a simple canonical structure that can be easily\nanalyzed by downstream applications. With sentence splitting, we thus address a\nTS task that has hardly been explored so far. Moreover, we introduce the notion\nof minimality in this context, as we aim to decompose source sentences into a\nset of self-contained minimal semantic units. To avoid breaking down the input\ninto a disjointed sequence of statements that is difficult to interpret because\nimportant contextual information is missing, we incorporate the semantic\ncontext between the split propositions in the form of hierarchical structures\nand semantic relationships. In that way, we generate a semantic hierarchy of\nminimal propositions that leads to a novel representation of complex assertions\nthat puts a semantic layer on top of the simplified sentences.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:10:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Niklaus","Christina",""],["Cetto","Matthias",""],["Freitas","Andr\u00e9",""],["Handschuh","Siegfried",""]]}
{"id":"2308.00426","submitter":"Xenofon Karakonstantis","authors":"Xenofon Karakonstantis and Efren Fernandez-Grande","title":"Generative adversarial networks with physical sound field priors","comments":"13 pages, 11 figures, submitted to the Journal of the Acoustical\n  Society of America","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a deep learning-based approach for the spatio-temporal\nreconstruction of sound fields using Generative Adversarial Networks (GANs).\nThe method utilises a plane wave basis and learns the underlying statistical\ndistributions of pressure in rooms to accurately reconstruct sound fields from\na limited number of measurements. The performance of the method is evaluated\nusing two established datasets and compared to state-of-the-art methods. The\nresults show that the model is able to achieve an improved reconstruction\nperformance in terms of accuracy and energy retention, particularly in the\nhigh-frequency range and when extrapolating beyond the measurement region.\nFurthermore, the proposed method can handle a varying number of measurement\npositions and configurations without sacrificing performance. The results\nsuggest that this approach provides a promising approach to sound field\nreconstruction using generative models that allow for a physically informed\nprior to acoustics problems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:11:23 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Karakonstantis","Xenofon",""],["Fernandez-Grande","Efren",""]]}
{"id":"2308.00427","submitter":"Wen-Tian Lu","authors":"Wen-Tian Lu, Zhe Yuan, Xiaohong Xu","title":"Ultrafast magnetization enhancement and spin current injection in\n  magnetic multilayers by exciting the nonmagnetic metal","comments":"11 pages, 6 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":"  A systematic investigation of spin injection behavior in Au/FM (FM = Fe and\nNi) multilayers is performed using the superdiffusive spin transport theory. By\nexciting the nonmagnetic layer, the laser-induced hot electrons may transfer\nspin angular momentum into the adjacent ferromagnetic (FM) metals resulting in\nultrafast demagnetization or enhancement. We find that these experimental\nphenomena sensitively depend on the particular interface reflectivity of hot\nelectrons and may reconcile the different observations in experiment.\nStimulated by the ultrafast spin currents carried by the hot electrons, we\npropose the multilayer structures to generate highly spin polarized currents\nfor development of future ultrafast spintronics devices. The spin polarization\nof the electric currents carried by the hot electrons can be significantly\nenhanced by the joint effects of bulk and interfacial spin filtering. Meanwhile\nthe intensity of the generated spin current can be optimized by varying the\nnumber of repeated stacking units and the thickness of each metallic layer.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:11:38 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lu","Wen-Tian",""],["Yuan","Zhe",""],["Xu","Xiaohong",""]]}
{"id":"2308.00428","submitter":"Fu-Hsien Huang","authors":"Fu-Hsien Huang and Hsin-Min Lu","title":"Multiscale Global and Regional Feature Learning Using Co-Tuplet Loss for\n  Offline Handwritten Signature Verification","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.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Handwritten signature verification is a significant biometric verification\nmethod widely acknowledged by legal and financial institutions. However, the\ndevelopment of automatic signature verification systems poses challenges due to\ninter-writer similarity, intra-writer variations, and the limited number of\nsignature samples. To address these challenges, we propose a multiscale global\nand regional feature learning network (MGRNet) with the co-tuplet loss, a new\nmetric learning loss, for offline handwritten signature verification. MGRNet\njointly learns global and regional information from various spatial scales and\nintegrates it to generate discriminative features. Consequently, it can capture\noverall signature stroke information while detecting detailed local differences\nbetween genuine and skilled-forged signatures. To enhance the discriminative\ncapability of our network further, we propose the co-tuplet loss, which\nsimultaneously considers multiple positive and negative examples to learn\ndistance metrics. By dealing with inter-writer similarity and intra-writer\nvariations and focusing on informative examples, the co-tuplet loss addresses\nthe limitations of typical metric learning losses. Additionally, we develop\nHanSig, a large-scale Chinese signature dataset, to facilitate the development\nof robust systems for this script. The dataset is available at\nhttps://github.com/ashleyfhh/HanSig. Experimental results on four benchmark\ndatasets in different languages demonstrate the promising performance of our\nmethod in comparison to state-of-the-art approaches.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:14:43 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Huang","Fu-Hsien",""],["Lu","Hsin-Min",""]]}
{"id":"2308.00429","submitter":"Yajie Cui","authors":"Yajie Cui, Zhaoxiang Liu, Shiguo Lian","title":"Patch-wise Auto-Encoder for Visual Anomaly Detection","comments":"ICIP2023 accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomaly detection without priors of the anomalies is challenging. In the\nfield of unsupervised anomaly detection, traditional auto-encoder (AE) tends to\nfail based on the assumption that by training only on normal images, the model\nwill not be able to reconstruct abnormal images correctly. On the contrary, we\npropose a novel patch-wise auto-encoder (Patch AE) framework, which aims at\nenhancing the reconstruction ability of AE to anomalies instead of weakening\nit. Each patch of image is reconstructed by corresponding spatially distributed\nfeature vector of the learned feature representation, i.e., patch-wise\nreconstruction, which ensures anomaly-sensitivity of AE. Our method is simple\nand efficient. It advances the state-of-the-art performances on Mvtec AD\nbenchmark, which proves the effectiveness of our model. It shows great\npotential in practical industrial application scenarios.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:15:15 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cui","Yajie",""],["Liu","Zhaoxiang",""],["Lian","Shiguo",""]]}
{"id":"2308.00430","submitter":"Ming Fang","authors":"Ming Fang, Angela Di Fulvio","title":"Feasibility of Neutron Coincidence Counting for Spent Fuel","comments":"25 pages, 19 figures","journal-ref":"Annals of Nuclear Energy 193 (2023): 110062","doi":"10.1016/j.anucene.2023.110062","report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  High-temperature gas reactors rely on TRIstructural-ISOtropic (TRISO) fuel\nfor enhanced fission product retention. Accurate fuel characterization would\nimprove monitoring of efficient fuel usage and accountability. We developed a\nnew neutron multiplicity counter (NMC) based on boron coated straw (BCS)\ndetectors and used it in coincidence mode for 235U assay in TRISO fuel. In this\nwork, we demonstrate that a high-efficiency version of the NMC encompassing 396\nstraws is able to estimate the 235U in used TRISO-fueled pebbles or compacts\nwith a relative uncertainty below 2.5% in 100 s. We performed neutronics and\nfuel depletion calculation of the HTR-10 pebble bed reactor to estimate the\nneutron and gamma-ray source strengths of used TRISO-fueled pebbles with burnup\nbetween 9 and 90 GWd/t. Then, we measured a gamma-ray intrinsic efficiency of\n10^-12 at an exposure rate of 340.87 R/h. The low gamma-ray sensitivity and\nhigh neutron detection efficiency enable the inspection of used fuel.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:19:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fang","Ming",""],["Di Fulvio","Angela",""]]}
{"id":"2308.00431","submitter":"Samuel Coward","authors":"Samuel Coward, Emiliano Morini, Bryan Tan, Theo Drane, George\n  Constantinides","title":"Datapath Verification via Word-Level E-Graph Rewriting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Formal verification of datapath circuits is challenging as they are subject\nto intense optimization effort in the design phase. Industrial vendors and\ndesign companies deploy equivalence checking against a golden or existing\nreference design to satisfy correctness concerns. State-of-the-art datapath\nequivalence checking tools deploy a suite of techniques, including rewriting.\nWe propose a rewriting framework deploying bitwidth dependent rewrites based on\nthe e-graph data structure, providing a powerful assistant to existing tools.\nThe e-graph can generate a path of rewrites between the reference and\nimplementation designs that can be checked by a trusted industry tool. We will\ndemonstrate how the intermediate proofs generated by the assistant enable\nconvergence in a state of the art tool, without which the industrial tool runs\nfor 24 hours without making progress. The intermediate proofs automatically\nintroduced by the assistant also reduce the total proof runtime by up to 6x.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:20:07 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Coward","Samuel",""],["Morini","Emiliano",""],["Tan","Bryan",""],["Drane","Theo",""],["Constantinides","George",""]]}
{"id":"2308.00432","submitter":"Angel del Rio","authors":"\\'Angel del R\\'io, \\`Angel Garc\\'ia-Bl\\'azquez","title":"The isomorphism problem for rational group algebras of finite metacyclic\n  groups","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that if two finite metacyclic groups have isomorphic rational group\nalgebras, then they are isomorphic. This contributes to understand where is the\nline separating positive and negative solutions to the Isomorphism Problem for\ngroup algebras.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:26:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["del R\u00edo","\u00c1ngel",""],["Garc\u00eda-Bl\u00e1zquez","\u00c0ngel",""]]}
{"id":"2308.00433","submitter":"Jose Antonio Aramburu","authors":"In\\'es S\\'anchez-Movell\\'an, Guillermo Santamar\\'ia-Fern\\'andez, Pablo\n  Garc\\'ia-Fern\\'andez, Jos\\'e Antonio Aramburu, Miguel Moreno","title":"Understanding the local structure, magnetism and optical properties in\n  layered compounds with d9 ions: Insight into silver fluorides and K2CuF4","comments":"33 pages, special issue in Journal of Physical Chemistry C","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":"  Using first-principles DFT calculations, we analyze the origin of the\ndifferent crystal structures, optical and magnetic properties of two basic\nfamilies of layered fluoride materials with formula A2MF4 (M = Ag, Cu, Ni, Mn;\nA = K, Cs, Rb). On one hand, Cs2AgF4 and K2CuF4 compounds (both with d9 metal\ncations) crystallize in an orthorhombic structure with Cmca space group and MA\n- F - MB bridge angle of 180, and they exhibit a weak ferromagnetism (FM) in\nthe layer plane. On the other hand, K2NiF4 or K2MnF4 compounds (with d8 and d5\nmetal cations, respectively) have a tetragonal I4/mmm space group with 180\nbridge angle and exhibit antiferromagnetism (AFM) in the layer plane. Firstly,\nwe show that, contrary to what is claimed in the literature, the Cmca structure\nof Cs2AgF4 and K2CuF4 is not related to a cooperative Jahn-Teller effect among\nelongated MF64- units. Instead, first-principles calculations carried out in\nthe I4/mmm parent phase of these two compounds show that MF64- units are\naxially compressed because the electrostatic potential from the rest of lattice\nions force the hole to lie in the 3z2 - r2 molecular orbital (z being\nperpendicular to the layer plane). This fact increases the metal-ligand\ndistance in the layer plane and makes that covalency in the bridging ligand has\na residual character (clearly smaller than in K2NiF4 or KNiF3) stabilizing for\nonly a few meV (7.9 meV for Cs2AgF4) an AFM order. However, this I4/mmm parent\nphase of Cs2AgF4 is unstable thus evolving towards the experimental Cmca\nstructure with an energy gain of 140 meV, FM ordering and orthorhombic MF64-\nunits.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:26:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["S\u00e1nchez-Movell\u00e1n","In\u00e9s",""],["Santamar\u00eda-Fern\u00e1ndez","Guillermo",""],["Garc\u00eda-Fern\u00e1ndez","Pablo",""],["Aramburu","Jos\u00e9 Antonio",""],["Moreno","Miguel",""]]}
{"id":"2308.00434","submitter":"Valerio Dose","authors":"Roberto Cominetti, Valerio Dose, Marco Scarsini","title":"Monotonicity of Equilibria in Nonatomic Congestion Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies the monotonicity of equilibrium costs and equilibrium\nloads in nonatomic congestion games, in response to variations of the demands.\nThe main goal is to identify conditions under which a paradoxical non-monotone\nbehavior can be excluded. In contrast with routing games with a single\ncommodity, where the network topology is the sole determinant factor for\nmonotonicity, for general congestion games with multiple commodities the\nstructure of the strategy sets plays a crucial role. We frame our study in the\ngeneral setting of congestion games, with a special attention on\nmulti-commodity singleton congestion games, for which we establish the\nmonotonicity of equilibrium loads with respect to every demand. We then provide\nconditions for comonotonicity of the equilibrium loads, i.e. we investigate\nwhen they jointly increase or decrease after variations of the demands. We\nfinally extend our study from singleton congestion games to the larger class of\nproduct-union congestion games, whose structure is reminiscent of the concept\nof a series-parallel network.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:26:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cominetti","Roberto",""],["Dose","Valerio",""],["Scarsini","Marco",""]]}
{"id":"2308.00435","submitter":"Ruchira Bhat V","authors":"Ruchira V Bhat and Soumya Bera","title":"Distinguishing dynamical quantum criticality through local fidelity\n  distances","comments":"7+4 pages, 6+4 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":"  Using local quantum fidelity distances, we study the dynamical quantum phase\ntransition in integrable and non-integrable one-dimensional Ising chains.\nUnlike the Loschmidt echo, the standard measure for distinguishing between two\nquantum states to describe the dynamical quantum phase transition, the local\nfidelity requires only a part of the system to characterize it. The\nnon-analyticities in the quantum distance between two subsystem density\nmatrices identify the critical time and the corresponding critical exponent\nreasonably well in a finite-size system. Moreover, we propose a distance\nmeasure from the upper bound of the local quantum fidelity for certain quench\nprotocols where the entanglement entropy features oscillatory growth in time.\nThis local distance encodes the difference between the eigenvalue distribution\nof the initial and quenched subsystem density matrices and quantifies the\ncritical properties. The alternative distance measure could be employed to\nexamine the dynamical quantum phase transitions in a broader range of models,\nwith implications for gaining insights into the transition from the\nentanglement perspective.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:27:35 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bhat","Ruchira V",""],["Bera","Soumya",""]]}
{"id":"2308.00436","submitter":"Ning Miao","authors":"Ning Miao, Yee Whye Teh, Tom Rainforth","title":"SelfCheck: Using LLMs to Zero-Shot Check Their Own Step-by-Step\n  Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent progress in large language models (LLMs), especially the invention\nof chain-of-thoughts (CoT) prompting, makes it possible to solve reasoning\nproblems. However, even the strongest LLMs are still struggling with more\ncomplicated problems that require non-linear thinking and multi-step reasoning.\nIn this work, we explore whether LLMs have the ability to recognize their own\nerrors, without resorting to external resources. In particular, we investigate\nwhether they can be used to identify individual errors within a step-by-step\nreasoning. To this end, we propose a zero-shot verification scheme to recognize\nsuch errors. We then use this verification scheme to improve question-answering\nperformance, by using it to perform weighted voting on different generated\nanswers. We test the method on three math datasets-GSM8K, MathQA, and MATH-and\nfind that it successfully recognizes errors and, in turn, increases final\npredictive performance.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:31:36 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 08:45:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Miao","Ning",""],["Teh","Yee Whye",""],["Rainforth","Tom",""]]}
{"id":"2308.00437","submitter":"Carlton Shepherd","authors":"Amir Rafi, Carlton Shepherd, Konstantinos Markantonakis","title":"A First Look at Digital Rights Management Systems for Secure Mobile\n  Content Delivery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Digital rights management (DRM) solutions aim to prevent the copying or\ndistribution of copyrighted material. On mobile devices, a variety of DRM\ntechnologies have become widely deployed. However, a detailed security study\ncomparing their internal workings, and their strengths and weaknesses, remains\nmissing in the existing literature. In this paper, we present the first\ndetailed security analysis of mobile DRM systems, addressing the modern\nparadigm of cloud-based content delivery followed by major platforms, such as\nNetflix, Disney+, and Amazon Prime. We extensively analyse the security of\nthree widely used DRM solutions -- Google Widevine, Apple FairPlay, and\nMicrosoft PlayReady -- deployed on billions of devices worldwide. We then\nconsolidate their features and capabilities, deriving common features and\nsecurity properties for their evaluation. Furthermore, we identify some\ndesign-level shortcomings that render them vulnerable to emerging attacks\nwithin the state of the art, including micro-architectural side-channel\nvulnerabilities and an absence of post-quantum security. Lastly, we propose\nmitigations and suggest future directions of research.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:32:13 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 10:58:24 GMT"},{"version":"v3","created":"Thu, 3 Aug 2023 12:18:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Rafi","Amir",""],["Shepherd","Carlton",""],["Markantonakis","Konstantinos",""]]}
{"id":"2308.00438","submitter":"Sara Maleubre","authors":"Sara Maleubre, Daniel J. Eisenstein, Lehman H. Garrison, Michael Joyce","title":"Convergence of halo statistics: code comparison between Rockstar and\n  CompaSO using scale-free simulations","comments":"13 pages, submitted to MNRAS. arXiv admin note: substantial text\n  overlap with arXiv:2211.07607","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we perform a halo-finder code comparison between Rockstar and\nCompaSO. Based on our previous analysis aiming at quantifying resolution of\n$N$-body simulations by exploiting large (up to $N=4096^3$) simulations of\nscale-free cosmologies run using Abacus, we focus on convergence of the HMF,\n2PCF and mean radial pairwise velocities of halo centres selected with the\naforementioned two algorithms. We establish convergence, for both Rockstar and\nCompaSO, of mass functions at the $1\\%$ precision level and of the mean\npairwise velocities (and also 2PCF) at the $2\\%$ level. At small scales and\nsmall masses, we find that Rockstar exhibits greater self-similarity, and we\nalso highlight the role played by the merger-tree post-processing of CompaSO\nhalos on their convergence. Finally, we give resolution limits expressed as a\nminimum particle number per halo in a form that can be directly extrapolated to\nLCDM.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:32:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Maleubre","Sara",""],["Eisenstein","Daniel J.",""],["Garrison","Lehman H.",""],["Joyce","Michael",""]]}
{"id":"2308.00439","submitter":"Mehmet G\\\"unay","authors":"Shakir Ullah, Mehmet Emre Tasgin, Rasim Volga Ovali, Mehmet G\\\"unay","title":"Electrically-programmable frequency comb for compact quantum photonic\n  circuits","comments":"5 pages, 4 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":"  Recent efforts have demonstrated the first prototypes of compact and\nprogrammable photonic quantum computers~(PQCs). Utilization of time-bin\nencoding in loop-like architectures enabled a programmable generation of\nquantum states and execution of different~(programmable) logic gates on a\nsingle circuit. Actually, there is still space for better compactness and\ncomplexity of available quantum states: photonic circuits~(PCs) can function at\ndifferent frequencies. This necessitates an optical component, which can make\ndifferent frequencies talk with each other. This component should be integrable\ninto PCs and be controlled -- preferably -- by voltage for programmable\ngeneration of multifrequency quantum states and PQCs. Here, we propose a device\nthat controls a four-wave mixing process, essential for frequency combs. We\nutilize nonlinear Fano resonances. Entanglement generated by the device can be\ntuned continuously by the applied voltage which can be delivered to the device\nvia nm-thick wires. The device is integrable, CMOS-compatible, and operates\nwithin a timescale of hundreds of femtoseconds.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:33:43 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ullah","Shakir",""],["Tasgin","Mehmet Emre",""],["Ovali","Rasim Volga",""],["G\u00fcnay","Mehmet",""]]}
{"id":"2308.00440","submitter":"Wei-Jia Huang","authors":"Xin Hong, Wei-Jia Huang, Wei-Chen Chien, Yuan Feng, Min-Hsiu Hsieh,\n  Sanjiang Li, Chia-Shun Yeh and Mingsheng Ying","title":"Decision Diagrams for Symbolic Verification of 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":"  With the rapid development of quantum computing, automatic verification of\nquantum circuits becomes more and more important. While several decision\ndiagrams (DDs) have been introduced in quantum circuit simulation and\nverification, none of them supports symbolic computation. Algorithmic\nmanipulations of symbolic objects, however, have been identified as crucial, if\nnot indispensable, for several verification tasks. This paper proposes the\nfirst decision-diagram approach for operating symbolic objects and verifying\nquantum circuits with symbolic terms. As a notable example, our symbolic tensor\ndecision diagrams (symbolic TDD) could verify the functionality of the\n160-qubit quantum Fourier transform circuit within three minutes. Moreover, as\ndemonstrated on Bernstein-Vazirani algorithm, Grover's algorithm, and the\nbit-flip error correction code, the symbolic TDD enables efficient verification\nof quantum circuits with user-supplied oracles and/or classical controls.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:35:04 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hong","Xin",""],["Huang","Wei-Jia",""],["Chien","Wei-Chen",""],["Feng","Yuan",""],["Hsieh","Min-Hsiu",""],["Li","Sanjiang",""],["Yeh","Chia-Shun",""],["Ying","Mingsheng",""]]}
{"id":"2308.00441","submitter":"Xiao Han","authors":"Hao Ge, Xiao Han and Yuan Zhang","title":"Cover-time Gumbel Fluctuations in Finite-Range, Symmetric, Irreducible\n  Random Walks on Torus","comments":"arXiv admin note: text overlap with arXiv:1202.0190 by other authors","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 rigorously establish the Gumbel-distributed fluctuations of\nthe cover time, normalized by the mean first passage time, for finite-range,\nsymmetric, irreducible random walks on a torus of dimension three or higher.\nThis has been numerically demonstrated in (Chupeau et al. Nature Physics,\n2015), supporting the broader applicability of the Gumbel approximation across\na wide range of stochastic processes. Expanding upon the pioneering work of\nBelius (Probability Theory and Related Fields, 2013) on the cover time for\nsimple random walks, we extend the proof strategy to encompass more general\nscenarios. Our approach relies on a strong coupling between the random walk and\nthe corresponding random interlacements. The presented results contribute to a\nbetter understanding of the cover-time behavior in random search processes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:37:00 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ge","Hao",""],["Han","Xiao",""],["Zhang","Yuan",""]]}
{"id":"2308.00442","submitter":"Dongchen Han","authors":"Dongchen Han, Xuran Pan, Yizeng Han, Shiji Song, Gao Huang","title":"FLatten Transformer: Vision Transformer using Focused Linear Attention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quadratic computation complexity of self-attention has been a persistent\nchallenge when applying Transformer models to vision tasks. Linear attention,\non the other hand, offers a much more efficient alternative with its linear\ncomplexity by approximating the Softmax operation through carefully designed\nmapping functions. However, current linear attention approaches either suffer\nfrom significant performance degradation or introduce additional computation\noverhead from the mapping functions. In this paper, we propose a novel Focused\nLinear Attention module to achieve both high efficiency and expressiveness.\nSpecifically, we first analyze the factors contributing to the performance\ndegradation of linear attention from two perspectives: the focus ability and\nfeature diversity. To overcome these limitations, we introduce a simple yet\neffective mapping function and an efficient rank restoration module to enhance\nthe expressiveness of self-attention while maintaining low computation\ncomplexity. Extensive experiments show that our linear attention module is\napplicable to a variety of advanced vision Transformers, and achieves\nconsistently improved performances on multiple benchmarks. Code is available at\nhttps://github.com/LeapLabTHU/FLatten-Transformer.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:37:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Han","Dongchen",""],["Pan","Xuran",""],["Han","Yizeng",""],["Song","Shiji",""],["Huang","Gao",""]]}
{"id":"2308.00443","submitter":"Aniket Patra","authors":"Carlo Danieli, Emil A. Yuzbashyan, Boris L. Altshuler, Aniket Patra,\n  and Sergej Flach","title":"Dynamical chaos in the integrable Toda chain induced by time\n  discretization","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD cond-mat.stat-mech nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the Toda chain model to demonstrate that numerical simulation of\nintegrable Hamiltonian dynamics using time discretization destroys\nintegrability and induces dynamical chaos. Specifically, we integrate this\nmodel with various symplectic integrators parametrized by the time step $\\tau$\nand measure the Lyapunov time $T_{\\Lambda}$ (inverse of the largest Lyapunov\nexponent $\\Lambda$). A key observation is that $T_{\\Lambda}$ is finite whenever\n$\\tau$ is finite but diverges when $\\tau \\rightarrow 0$. We compare the Toda\nchain results with the nonitegrable Fermi-Pasta-Ulam-Tsingou chain dynamics. In\naddition, we observe a breakdown of the simulations at times $T_B \\gg\nT_{\\Lambda}$ due to certain positions and momenta becoming extremely large\n(``Not a Number''). This phenomenon originates from the periodic driving\nintroduced by symplectic integrators and we also identify the concrete\nmechanism of the breakdown in the case of the Toda chain.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:39:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Danieli","Carlo",""],["Yuzbashyan","Emil A.",""],["Altshuler","Boris L.",""],["Patra","Aniket",""],["Flach","Sergej",""]]}
{"id":"2308.00444","submitter":"Francesco Angelini","authors":"Francesco Angelini and Massimiliano Castellani and Simone Giannerini\n  and Greta Goracci","title":"Testing for Threshold Effects in Presence of Heteroskedasticity and\n  Measurement Error with an application to Italian Strikes","comments":"61 pages, 19 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many macroeconomic time series are characterised by nonlinearity both in the\nconditional mean and in the conditional variance and, in practice, it is\nimportant to investigate separately these two aspects. Here we address the\nissue of testing for threshold nonlinearity in the conditional mean, in the\npresence of conditional heteroskedasticity. We propose a supremum Lagrange\nMultiplier approach to test a linear ARMA-GARCH model against the alternative\nof a TARMA-GARCH model. We derive the asymptotic null distribution of the test\nstatistic and this requires novel results since the difficulties of working\nwith nuisance parameters, absent under the null hypothesis, are amplified by\nthe non-linear moving average, combined with GARCH-type innovations. We show\nthat tests that do not account for heteroskedasticity fail to achieve the\ncorrect size even for large sample sizes. Moreover, we show that the TARMA\nspecification naturally accounts for the ubiquitous presence of measurement\nerror that affects macroeconomic data. We apply the results to analyse the time\nseries of Italian strikes and we show that the TARMA-GARCH specification is\nconsistent with the relevant macroeconomic theory while capturing the main\nfeatures of the Italian strikes dynamics, such as asymmetric cycles and\nregime-switching.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:43:28 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Angelini","Francesco",""],["Castellani","Massimiliano",""],["Giannerini","Simone",""],["Goracci","Greta",""]]}
{"id":"2308.00445","submitter":"Olivier Boulle","authors":"by J. Urrestarazu Larra\\~naga, Naveen Sisodia, Van Tuong Pham, Ilaria\n  Di Manici, Aur\\'elien Masseboeuf, Kevin Garello, Florian Disdier, Bruno\n  Fernandez, Sebastian Wintz, Markus Weigand, Mohamed Belmeguenai, Stefania\n  Pizzini, Ricardo Sousa, Liliana Buda-Prejbeanu, Gilles Gaudin, Olivier Boulle","title":"Electrical detection and nucleation of a magnetic skyrmion in a magnetic\n  tunnel junction observed via operando magnetic microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic skyrmions are topological spin textures which are envisioned as\nnanometre scale information carriers in magnetic memory and logic devices. The\nrecent demonstration of room temperature stabilization of skyrmions and their\ncurrent induced manipulation in industry compatible ultrathin films were first\nsteps towards the realisation of such devices. However, important challenges\nremain regarding the electrical detection and the low-power nucleation of\nskyrmions, which are required for the read and write operations. Here, we\ndemonstrate, using operando magnetic microscopy experiments, the electrical\ndetection of a single magnetic skyrmion in a magnetic tunnel junction (MTJ) and\nits nucleation and annihilation by gate voltage via voltage control of magnetic\nanisotropy. The nucleated skyrmion can be further manipulated by both gate\nvoltage and external magnetic field, leading to tunable intermediate resistance\nstates. Our results unambiguously demonstrate the readout and voltage\ncontrolled write operations in a single MTJ device, which is a major milestone\nfor low power skyrmion based technologies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:45:09 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Larra\u00f1aga","by J. Urrestarazu",""],["Sisodia","Naveen",""],["Pham","Van Tuong",""],["Di Manici","Ilaria",""],["Masseboeuf","Aur\u00e9lien",""],["Garello","Kevin",""],["Disdier","Florian",""],["Fernandez","Bruno",""],["Wintz","Sebastian",""],["Weigand","Markus",""],["Belmeguenai","Mohamed",""],["Pizzini","Stefania",""],["Sousa","Ricardo",""],["Buda-Prejbeanu","Liliana",""],["Gaudin","Gilles",""],["Boulle","Olivier",""]]}
{"id":"2308.00446","submitter":"Jose Moreno","authors":"Jose Moreno","title":"Complexity evaluation of network configurations and abstractions","comments":"19 pages","journal-ref":"CSCP 2023 - pp. 317-335, 2023. CS & IT","doi":"10.5121/csit.2023.131325","report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computer networks have been traditionally configured by humans using\ncommand-line interfaces. Some network abstractions have emerged in the last 10\nyears, but there is no easy way of comparing them to each other objectively.\nTherefore, there is no consensus in the industry of what direction modern\nnetwork abstractions should take, and the adoption of these abstractions lags\nas a consequence. In this paper I propose a comparison framework using metrics\nderived from graph structures to evaluate the simplicity, efficiency, and\neffectiveness of different network abstraction models. The result of this\ncomparison is that while some of the existing network abstractions are quite\nefficient to store network policy (such as the Kubernetes or the Cisco\nApplication Centric Infrastructure models), others (notably public cloud) are\nstill very infrastructure-centric and suffer from excessive complexity.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:46:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Moreno","Jose",""]]}
{"id":"2308.00447","submitter":"Eren Unlu","authors":"Eren Unlu","title":"Structural Embeddings of Tools for Large Language Models","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is evident that the current state of Large Language Models (LLMs)\nnecessitates the incorporation of external tools. The lack of straightforward\nalgebraic and logical reasoning is well documented and prompted researchers to\ndevelop frameworks which allow LLMs to operate via external tools. The\nontological nature of tool utilization for a specific task can be well\nformulated with a Directed Acyclic Graph (DAG). The central aim of the paper is\nto highlight the importance of graph based approaches to LLM-tool interaction\nin near future. We propose an exemplary framework to guide the orchestration of\nexponentially increasing numbers of external tools with LLMs,where objectives\nand functionalities of tools are graph encoded hierarchically. Assuming that\ntextual segments of a Chain-of-Thought (CoT) can be imagined as a tool as\ndefined here, the graph based framework can pave new avenues in that particular\ndirection as well.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:46:09 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Unlu","Eren",""]]}
{"id":"2308.00448","submitter":"Ludwig B\\\"oss","authors":"Ludwig M. B\\\"oss, Ulrich P. Steinwandel, Klaus Dolag","title":"Galaxy Cluster simulations with a spectral Cosmic Ray model -- \"Wrong\n  Way\" Radio Relics","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Non-thermal emission from relativistic electrons gives insight into the\nstrength and morphology of intra-cluster magnetic fields, as well as providing\npowerful tracers of structure formation shocks. Emission caused by Cosmic Ray\n(CR) protons on the other hand still challenges current observations and is\ntherefore testing models of proton acceleration at intra-cluster shocks.\nLarge-scale simulations including the effects of CRs have been difficult to\nachieve and have been mainly reduced to simulating an overall energy budget, or\ntracing CR populations in post-processing of simulation output and has often\nbeen done for either protons or electrons. We use an efficient on-the-fly\nFokker-Planck solver to evolve distributions of CR protons and electrons within\nevery resolution element of our simulation. The solver accounts for CR\nacceleration at intra-cluster shocks, based on results of recent PIC\nsimulations, re-acceleration due to shocks and MHD turbulence, adiabatic\nchanges and radiative losses of electrons. We apply this model to zoom\nsimulations of galaxy clusters, recently used to show the evolution of the\nsmall-scale turbulent dynamo on cluster scales. For these simulations we use a\nspectral resolution of 48 bins over 6 orders of magnitude in momentum for\nelectrons and 12 bins over 6 orders of magnitude in momentum for protons. We\npresent preliminary results about a possible formation mechanism for Wrong Way\nRadio Relics in our simulation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:51:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["B\u00f6ss","Ludwig M.",""],["Steinwandel","Ulrich P.",""],["Dolag","Klaus",""]]}
{"id":"2308.00449","submitter":"Marc Martinez-Gost","authors":"Marc Martinez-Gost, Ana Perez-Neira, Miguel Angel Lagunas","title":"LoRa Modulation for Split Learning","comments":"Submitted to 2023 IEEE International Workshop on Computational\n  Advances in Multi-Sensor Adaptive Processing (CAMSAP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We design a task-oriented communication design for Split learning (SL).\nSpecifically, we propose to use a variant of the Long Range (LoRa) modulation\nand an orthogonal chirp division multiplexing (OCDM) access scheme. As we\nimplement an Expressive Neural Network (ENN), this is, an architecture with\nadaptive activation functions (AAF), the modulation is also suited for the\ncomputing side of the problem. The cosine nature of the modulation matches the\nDiscrete Cosine Transform (DCT) model used to implement the AAFs. We also\npropose a variant of the waveform to control the transmission bandwidth. Our\nresults show that scheme achieves high accuracy up to -15 dB in the presence of\nadditive white Gaussian noise (AWGN), and up to -12.5 dB in the case of\nRayleigh fading.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:59:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Martinez-Gost","Marc",""],["Perez-Neira","Ana",""],["Lagunas","Miguel Angel",""]]}
{"id":"2308.00450","submitter":"Andrzej Dragan","authors":"Jerzy Paczos, Kacper D\\k{e}bski, Szymon Cedrowski, Szymon\n  Charzy\\'nski, Krzysztof Turzy\\'nski, Artur Ekert, Andrzej Dragan","title":"Covariant quantum field theory of tachyons","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Three major misconceptions concerning quantized tachyon fields: the energy\nspectrum unbounded from below, the frame-dependent and unstable vacuum state,\nand the non-covariant commutation rules, are shown to be a result of\nmisrepresenting the Lorentz group in a too small Hilbert space. By doubling\nthis space we establish an explicitly covariant framework that allows for the\nproper quantization of the tachyon fields eliminating all of these issues. Our\nscheme that is derived to maintain the relativistic covariance also singles out\nthe two-state formalism developed by Aharonov et al. [1] as a preferred\ninterpretation of the quantum theory.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:00:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Paczos","Jerzy",""],["D\u0119bski","Kacper",""],["Cedrowski","Szymon",""],["Charzy\u0144ski","Szymon",""],["Turzy\u0144ski","Krzysztof",""],["Ekert","Artur",""],["Dragan","Andrzej",""]]}
{"id":"2308.00451","submitter":"Ziyuan Yang","authors":"Ziyuan Yang and Andrew Beng Jin Teoh and Bob Zhang and Lu Leng and Yi\n  Zhang","title":"Physics-Driven Spectrum-Consistent Federated Learning for Palmprint\n  Verification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Palmprint as biometrics has gained increasing attention recently due to its\ndiscriminative ability and robustness. However, existing methods mainly improve\npalmprint verification within one spectrum, which is challenging to verify\nacross different spectrums. Additionally, in distributed server-client-based\ndeployment, palmprint verification systems predominantly necessitate clients to\ntransmit private data for model training on the centralized server, thereby\nengendering privacy apprehensions. To alleviate the above issues, in this\npaper, we propose a physics-driven spectrum-consistent federated learning\nmethod for palmprint verification, dubbed as PSFed-Palm. PSFed-Palm draws upon\nthe inherent physical properties of distinct wavelength spectrums, wherein\nimages acquired under similar wavelengths display heightened resemblances. Our\napproach first partitions clients into short- and long-spectrum groups\naccording to the wavelength range of their local spectrum images. Subsequently,\nwe introduce anchor models for short- and long-spectrum, which constrain the\noptimization directions of local models associated with long- and\nshort-spectrum images. Specifically, a spectrum-consistent loss that enforces\nthe model parameters and feature representation to align with their\ncorresponding anchor models is designed. Finally, we impose constraints on the\nlocal models to ensure their consistency with the global model, effectively\npreventing model drift. This measure guarantees spectrum consistency while\nprotecting data privacy, as there is no need to share local data. Extensive\nexperiments are conducted to validate the efficacy of our proposed PSFed-Palm\napproach. The proposed PSFed-Palm demonstrates compelling performance despite\nonly a limited number of training data. The codes will be released at\nhttps://github.com/Zi-YuanYang/PSFed-Palm.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:01:17 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yang","Ziyuan",""],["Teoh","Andrew Beng Jin",""],["Zhang","Bob",""],["Leng","Lu",""],["Zhang","Yi",""]]}
{"id":"2308.00452","submitter":"Qilin Zhou","authors":"Qilin Zhou, Zhengyuan Wei, Haipeng Wang, and W.K. Chan","title":"A Majority Invariant Approach to Patch Robustness Certification for Deep\n  Learning Models","comments":"5 pages, 2 figures, accepted for inclusion in the ASE 2023 NIER track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Patch robustness certification ensures no patch within a given bound on a\nsample can manipulate a deep learning model to predict a different label.\nHowever, existing techniques cannot certify samples that cannot meet their\nstrict bars at the classifier or patch region levels. This paper proposes\nMajorCert. MajorCert firstly finds all possible label sets manipulatable by the\nsame patch region on the same sample across the underlying classifiers, then\nenumerates their combinations element-wise, and finally checks whether the\nmajority invariant of all these combinations is intact to certify samples.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:05:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhou","Qilin",""],["Wei","Zhengyuan",""],["Wang","Haipeng",""],["Chan","W. K.",""]]}
{"id":"2308.00453","submitter":"Michael Papadimitrakis","authors":"Nacho Monreal Galan, Michael Papadimitrakis","title":"Sampling and interpolation for analytic selfmappings of the disc","comments":"20 pages. This is a major revision of the older paper arXiv:1407.7776\n  especially for the part related to the sampling sequences. There is also a\n  reordering between the two parts","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Two different problems are considered here. First, a characterization of\nsampling sequences for the class of analytic functions from the disc into\nitself is given. Second, a version of Schwarz-Pick Lemma for $n$ points leads\nto an interpolation problem for the same functions, which may be considered as\na particular case of the classical Nevanlinna-Pick interpolation problem.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:09:46 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 09:43:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Galan","Nacho Monreal",""],["Papadimitrakis","Michael",""]]}
{"id":"2308.00454","submitter":"Eric Modesitt","authors":"Ruiqi Yang, Eric Modesitt","title":"ViT2EEG: Leveraging Hybrid Pretrained Vision Transformers for EEG Data","comments":"8 pages, 6 for article, 1 for citation, 1 for appendix. Accepted to\n  KDD-UC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we demonstrate the application of a hybrid Vision Transformer\n(ViT) model, pretrained on ImageNet, on an electroencephalogram (EEG)\nregression task. Despite being originally trained for image classification\ntasks, when fine-tuned on EEG data, this model shows a notable increase in\nperformance compared to other models, including an identical architecture ViT\ntrained without the ImageNet weights. This discovery challenges the traditional\nunderstanding of model generalization, suggesting that Transformer models\npretrained on seemingly unrelated image data can provide valuable priors for\nEEG regression tasks with an appropriate fine-tuning pipeline.\n  The success of this approach suggests that the features extracted by ViT\nmodels in the context of visual tasks can be readily transformed for the\npurpose of EEG predictive modeling. We recommend utilizing this methodology not\nonly in neuroscience and related fields, but generally for any task where data\ncollection is limited by practical, financial, or ethical constraints. Our\nresults illuminate the potential of pretrained models on tasks that are clearly\ndistinct from their original purpose.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:10:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yang","Ruiqi",""],["Modesitt","Eric",""]]}
{"id":"2308.00455","submitter":"Hartosh Singh Bal","authors":"Hartosh Singh Bal","title":"Combinatorics of a Class of Completely Additive Arithmetic Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The height $H(n)$ of $n$, is the smallest positive integer $i$ such that the\n$i$ th iterate of the totient function evaluated at $n$ is $1$. H. N. Shapiro\ndetermined that $H$ was almost completely additive. Building on the fact that\nthe set of all numbers at a particular height reflect a partition structure the\npaper shows that all multi-partition structures correspond to a completely\nadditive function. This includes the Matula number for rooted trees, as well as\nthe sum of the primes function studied by Alladi and Erdos. We show the\nreordering of the natural numbers in each such partition structure is of\nimportance and conjecture that the log of the asymptotic growth of the\nmulti-partition is inversely related to the order of the growth of the\nassociated additive function. We further provide computational evidence that\nthe partition structure for large n tends to a lognormal distribution leading\nto insights into the distribution of primes at each height, which can thus be\nseen as a finite setting for probabilistic questions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:19:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bal","Hartosh Singh",""]]}
{"id":"2308.00456","submitter":"Vien Ngo","authors":"Philipp Bl\\\"attner, Johannes Brand, Gerhard Neumann, Ngo Anh Vien","title":"DMFC-GraspNet: Differentiable Multi-Fingered Robotic Grasp Generation in\n  Cluttered Scenes","comments":"Submitted IROS 2023 workshop \"Policy Learning in Geometric Spaces\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Robotic grasping is a fundamental skill required for object manipulation in\nrobotics. Multi-fingered robotic hands, which mimic the structure of the human\nhand, can potentially perform complex object manipulation. Nevertheless,\ncurrent techniques for multi-fingered robotic grasping frequently predict only\na single grasp for each inference time, limiting computational efficiency and\ntheir versatility, i.e. unimodal grasp distribution. This paper proposes a\ndifferentiable multi-fingered grasp generation network (DMFC-GraspNet) with\nthree main contributions to address this challenge. Firstly, a novel neural\ngrasp planner is proposed, which predicts a new grasp representation to enable\nversatile and dense grasp predictions. Secondly, a scene creation and label\nmapping method is developed for dense labeling of multi-fingered robotic hands,\nwhich allows a dense association of ground truth grasps. Thirdly, we propose to\ntrain DMFC-GraspNet end-to-end using using a forward-backward automatic\ndifferentiation approach with both a supervised loss and a differentiable\ncollision loss and a generalized Q 1 grasp metric loss. The proposed approach\nis evaluated using the Shadow Dexterous Hand on Mujoco simulation and ablated\nby different choices of loss functions. The results demonstrate the\neffectiveness of the proposed approach in predicting versatile and dense\ngrasps, and in advancing the field of multi-fingered robotic grasping.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:21:07 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 20:53:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bl\u00e4ttner","Philipp",""],["Brand","Johannes",""],["Neumann","Gerhard",""],["Vien","Ngo Anh",""]]}
{"id":"2308.00457","submitter":"Barbara Linek","authors":"Barbara Linek, Agnieszka {\\L}uszczak, Marta {\\L}uszczak, Roman\n  Pasechnik, Wolfgang Sch\\\"afer, Antoni Szczurek","title":"Probing proton structure with $c \\bar c$ correlations in ultraperipheral\n  $pA$ collisions","comments":"19 pages, 11 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the exclusive diffractive $c \\bar c$ photoproduction in\nultraperipheral $pA$ collisions. The formalism makes use of off-diagonal\ngeneralizations of the unintegrated gluon distribution, the so-called\ngeneralized transverse momentum dependent distributions (GTMDs). We present two\ndifferent formulations. The first one is based directly on gluon GTMD\nparametrizations in momentum space. Another option is the calculation of the\nGTMD as a Fourier transform of the dipole-nucleon scattering amplitude\n$N(Y,\\vec{r}_{\\perp},\\vec{b}_{\\perp})$. The latter approach requires some extra\nregularization discussed in the paper. Different dipole amplitudes from the\nliterature are used. Compared to previous calculations in the literature, we\nintegrate over the full phase space and therefore cross sections for realistic\nconditions are obtained. We present distributions in rapidity of $c$ or $\\bar\nc$, transverse momentum of the $c \\bar c$ pair, four-momentum transfer squared\nas well as the azimuthal correlation between a sum and a difference of the $c$\nand $\\bar c$ transverse momenta. The azimuthal correlations are partially due\nto the so-called elliptic gluon Wigner distribution. Different models lead to\ndifferent modulations in the azimuthal angle. The modulations are generally\nsmaller than 5%. They depend on the range of transverse momentum selected for\nthe calculation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:22:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Linek","Barbara",""],["\u0141uszczak","Agnieszka",""],["\u0141uszczak","Marta",""],["Pasechnik","Roman",""],["Sch\u00e4fer","Wolfgang",""],["Szczurek","Antoni",""]]}
{"id":"2308.00458","submitter":"Bolun Cai","authors":"Bolun Cai, Pengfei Xiong, Shangxuan Tian","title":"Center Contrastive Loss for Metric Learning","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":"  Contrastive learning is a major studied topic in metric learning. However,\nsampling effective contrastive pairs remains a challenge due to factors such as\nlimited batch size, imbalanced data distribution, and the risk of overfitting.\nIn this paper, we propose a novel metric learning function called Center\nContrastive Loss, which maintains a class-wise center bank and compares the\ncategory centers with the query data points using a contrastive loss. The\ncenter bank is updated in real-time to boost model convergence without the need\nfor well-designed sample mining. The category centers are well-optimized\nclassification proxies to re-balance the supervisory signal of each class.\nFurthermore, the proposed loss combines the advantages of both contrastive and\nclassification methods by reducing intra-class variations and enhancing\ninter-class differences to improve the discriminative power of embeddings. Our\nexperimental results, as shown in Figure 1, demonstrate that a standard network\n(ResNet50) trained with our loss achieves state-of-the-art performance and\nfaster convergence.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:22:51 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Cai","Bolun",""],["Xiong","Pengfei",""],["Tian","Shangxuan",""]]}
{"id":"2308.00459","submitter":"Peter Massopust","authors":"Marvin Jahn and Peter Massopust","title":"An Integral RB Operator","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 novel concept of integral Read-Bajraktarevi\\'c (iRB)\noperator and discuss some of its properties. We show that this iRB operator\ngeneralizes the known Read-Bajraktarevi\\'c (RB) operator and we derive\nconditions for the fixed point of the iRB operator to belong to certain\nfunction spaces.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:29:38 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jahn","Marvin",""],["Massopust","Peter",""]]}
{"id":"2308.00460","submitter":"\\v{Z}ikica Luki\\'c","authors":"\\v{Z}ikica Luki\\'c, Bojana Milo\\v{s}evi\\'c","title":"Characterization-based approach for construction of goodness-of-fit test\n  for L\\'evy distribution","comments":"28 pages, 4 figures","journal-ref":"Statistics (2023) 1-30","doi":"10.1080/02331888.2023.2238236","report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The L\\'evy distribution, alongside the Normal and Cauchy distributions, is\none of the only three stable distributions whose density can be obtained in a\nclosed form. However, there are only a few specific goodness-of-fit tests for\nthe L\\'evy distribution. In this paper, two novel classes of goodness-of-fit\ntests for the L\\'evy distribution are proposed. Both tests are based on\nV-empirical Laplace transforms. New tests are scale free under the null\nhypothesis, which makes them suitable for testing the composite hypothesis. The\nfinite sample and limiting properties of test statistics are obtained. In\naddition, a generalization of the recent Bhati-Kattumannil goodness-of-fit test\nto the L\\'evy distribution is considered. For assessing the quality of novel\nand competitor tests, the local Bahadur efficiencies are computed, and a wide\npower study is conducted. Both criteria clearly demonstrate the quality of the\nnew tests. The applicability of the novel tests is demonstrated with two\nreal-data examples.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:30:28 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Luki\u0107","\u017dikica",""],["Milo\u0161evi\u0107","Bojana",""]]}
{"id":"2308.00461","submitter":"Sebastian Skatulla","authors":"Sebastian Skatulla, Carlo Sansour, Mary Familusi, Jagir Hussan and\n  Ntobeko Ntusi","title":"Non-invasive in silico determination of ventricular wall pre-straining\n  and characteristic cavity pressures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The clinical application of patient-specific modelling of the heart can\nprovide valuable insights in supplementing and advancing methods of diagnosis\nas well as helping to devise the best possible therapeutic approach for each\nindividual pathological heart condition. The potential of computational cardiac\nmechanics, however, has not yet been fully leveraged due to the heart's complex\nphysiology and limitations in the non-invasive in vivo characterisation of\nheart properties necessary required for accurate patient-specific modelling\nsuch as the heart anatomy in an unloaded state, ventricular pressure, the\nelastic constitutive parameters and the myocardial muscle fibre orientation\ndistribution. From a solid mechanics point of view without prior knowledge of\nthe unloaded heart configuration and the cavity pressure-volume evolution, in\nparticular, the constitutive parameters cannot be accurately estimated to\ndescribe the highly nonlinear elastic material behaviour of myocardial tissue.\nHere, knowledge of the volume-normalized end-diastolic pressure relation for\nlarger mammals is exploited in combination with a novel iterative inverse\nparameter optimisation framework to determine end-systolic and end diastolic\npressures, ventricular wall pre-straining and pre-stressing due the residual\nend-systolic cavity pressure as well as myocardial tissue stiffness parameters\nfor biventricular heart models.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:33:45 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 08:26:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Skatulla","Sebastian",""],["Sansour","Carlo",""],["Familusi","Mary",""],["Hussan","Jagir",""],["Ntusi","Ntobeko",""]]}
{"id":"2308.00462","submitter":"Songlin Yang","authors":"Songlin Yang, Wei Wang, Jun Ling, Bo Peng, Xu Tan, Jing Dong","title":"Context-Aware Talking-Head Video Editing","comments":"Accepted In Proceedings of the 31st ACM International Conference on\n  Multimedia (MM' 23),","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Talking-head video editing aims to efficiently insert, delete, and substitute\nthe word of a pre-recorded video through a text transcript editor. The key\nchallenge for this task is obtaining an editing model that generates new\ntalking-head video clips which simultaneously have accurate lip synchronization\nand motion smoothness. Previous approaches, including 3DMM-based (3D Morphable\nModel) methods and NeRF-based (Neural Radiance Field) methods, are sub-optimal\nin that they either require minutes of source videos and days of training time\nor lack the disentangled control of verbal (e.g., lip motion) and non-verbal\n(e.g., head pose and expression) representations for video clip insertion. In\nthis work, we fully utilize the video context to design a novel framework for\ntalking-head video editing, which achieves efficiency, disentangled motion\ncontrol, and sequential smoothness. Specifically, we decompose this framework\nto motion prediction and motion-conditioned rendering: (1) We first design an\nanimation prediction module that efficiently obtains smooth and lip-sync motion\nsequences conditioned on the driven speech. This module adopts a\nnon-autoregressive network to obtain context prior and improve the prediction\nefficiency, and it learns a speech-animation mapping prior with better\ngeneralization to novel speech from a multi-identity video dataset. (2) We then\nintroduce a neural rendering module to synthesize the photo-realistic and\nfull-head video frames given the predicted motion sequence. This module adopts\na pre-trained head topology and uses only few frames for efficient fine-tuning\nto obtain a person-specific rendering model. Extensive experiments demonstrate\nthat our method efficiently achieves smoother editing results with higher image\nquality and lip accuracy using less data than previous methods.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:38:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yang","Songlin",""],["Wang","Wei",""],["Ling","Jun",""],["Peng","Bo",""],["Tan","Xu",""],["Dong","Jing",""]]}
{"id":"2308.00463","submitter":"Shihao Shen","authors":"Shihao Shen, Yiwen Han, Xiaofei Wang, Yan Wang","title":"Computation Offloading with Multiple Agents in Edge-Computing-Supported\n  IoT","comments":"28 pages","journal-ref":null,"doi":"10.1145/3372025","report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the development of the Internet of Things (IoT) and the birth of various\nnew IoT devices, the capacity of massive IoT devices is facing challenges.\nFortunately, edge computing can optimize problems such as delay and\nconnectivity by offloading part of the computational tasks to edge nodes close\nto the data source. Using this feature, IoT devices can save more resources\nwhile still maintaining the quality of service. However, since computation\noffloading decisions concern joint and complex resource management, we use\nmultiple Deep Reinforcement Learning (DRL) agents deployed on IoT devices to\nguide their own decisions. Besides, Federated Learning (FL) is utilized to\ntrain DRL agents in a distributed fashion, aiming to make the DRL-based\ndecision making practical and further decrease the transmission cost between\nIoT devices and Edge Nodes. In this article, we first study the problem of\ncomputation offloading optimization and prove the problem is an NP-hard\nproblem. Then, based on DRL and FL, we propose an offloading algorithm that is\ndifferent from the traditional method. Finally, we studied the effects of\nvarious parameters on the performance of the algorithm and verified the\neffectiveness of both the DRL and FL in the IoT system.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:39:22 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shen","Shihao",""],["Han","Yiwen",""],["Wang","Xiaofei",""],["Wang","Yan",""]]}
{"id":"2308.00464","submitter":"Jussi Behrndt","authors":"Jussi Behrndt, Philipp Schmitz, Gerald Teschl, and Carsten Trunk","title":"Perturbation and spectral theory for singular indefinite Sturm-Liouville\n  operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.CA math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study singular Sturm-Liouville operators of the form \\[\n\\frac{1}{r_j}\\left(-\\frac{\\mathrm d}{\\mathrm dx}p_j\\frac{\\mathrm d}{\\mathrm\ndx}+q_j\\right),\\qquad j=0,1, \\] in $L^2((a,b);r_j)$, where, in contrast to the\nusual assumptions, the weight functions $r_j$ have different signs near the\nsingular endpoints $a$ and $b$. In this situation the associated maximal\noperators become self-adjoint with respect to indefinite inner products and\ntheir spectral properties differ essentially from the Hilbert space situation.\nWe investigate the essential spectra and accumulation properties of nonreal and\nreal discrete eigenvalues; we emphasize that here also perturbations of the\nindefinite weights $r_j$ are allowed. Special attention is paid to Kneser type\nresults in the indefinite setting and to $L^1$ perturbations of periodic\noperators.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:40:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Behrndt","Jussi",""],["Schmitz","Philipp",""],["Teschl","Gerald",""],["Trunk","Carsten",""]]}
{"id":"2308.00465","submitter":"Yanxin Xi","authors":"Yanxin Xi, Yu Liu, Tong Li, Jintao Ding, Yunke Zhang, Sasu Tarkoma,\n  Yong Li, and Pan Hui","title":"A Satellite Imagery Dataset for Long-Term Sustainable Development in\n  United States Cities","comments":"20 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":"  Cities play an important role in achieving sustainable development goals\n(SDGs) to promote economic growth and meet social needs. Especially satellite\nimagery is a potential data source for studying sustainable urban development.\nHowever, a comprehensive dataset in the United States (U.S.) covering multiple\ncities, multiple years, multiple scales, and multiple indicators for SDG\nmonitoring is lacking. To support the research on SDGs in U.S. cities, we\ndevelop a satellite imagery dataset using deep learning models for five SDGs\ncontaining 25 sustainable development indicators. The proposed dataset covers\nthe 100 most populated U.S. cities and corresponding Census Block Groups from\n2014 to 2023. Specifically, we collect satellite imagery and identify objects\nwith state-of-the-art object detection and semantic segmentation models to\nobserve cities' bird's-eye view. We further gather population, nighttime light,\nsurvey, and built environment data to depict SDGs regarding poverty, health,\neducation, inequality, and living environment. We anticipate the dataset to\nhelp urban policymakers and researchers to advance SDGs-related studies,\nespecially applying satellite imagery to monitor long-term and multi-scale SDGs\nin cities.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:40:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xi","Yanxin",""],["Liu","Yu",""],["Li","Tong",""],["Ding","Jintao",""],["Zhang","Yunke",""],["Tarkoma","Sasu",""],["Li","Yong",""],["Hui","Pan",""]]}
{"id":"2308.00466","submitter":"Panagiotis Mavrogiannis","authors":"Panagiotis Mavrogiannis","title":"Gravito-electromagnetic equivalence on large scales","comments":"9 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the relativistic coupling between gravity and electromagnetism,\nputting particularly into question the status of the latter on large scales;\nwhether it behaves as a source or as a form of gravity. Considering a\nmetric-affine framework and a simple action principle, we find out that a\ncomponent of gravity, the so-called homothetic curvature field (associated with\nlength changes), satisfies both sets of Maxwell equations. Therefore, we arrive\nat a gravito-electromagnetic equivalence analogous to the mass-energy\nequivalence. We raise and discuss some crucial questions implied by the\naforementioned finding concerning the status of electromagnetism on large\nscales.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:43:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mavrogiannis","Panagiotis",""]]}
{"id":"2308.00467","submitter":"Jiaxin Xie","authors":"Yansheng Su and Deren Han and Yun Zeng and Jiaxin Xie","title":"On greedy multi-step inertial randomized Kaczmarz method for solving\n  linear systems","comments":"arXiv admin note: text overlap with arXiv:2307.01988","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the multi-step inertial randomized Kaczmarz (MIRK) method for\nsolving large-scale linear systems was proposed in [17]. In this paper, we\nincorporate the greedy probability criterion into the MIRK method, along with\nthe introduction of a tighter threshold parameter for this criterion. We prove\nthat the proposed greedy MIRK (GMIRK) method enjoys an improved deterministic\nlinear convergence compared to both the MIRK method and the greedy randomized\nKaczmarz method. Furthermore, we exhibit that the multi-step inertial\nextrapolation approach can be seen geometrically as an orthogonal projection\nmethod, and establish its relationship with the sketch-and-project method [15]\nand the oblique projection technique [22]. Numerical experiments are provided\nto confirm our results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:44:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Su","Yansheng",""],["Han","Deren",""],["Zeng","Yun",""],["Xie","Jiaxin",""]]}
{"id":"2308.00468","submitter":"Fedor Stonyakin","authors":"S. S. Ablaev, F. S. Stonyakin, M. S. Alkousa, D. A. Pasechnyuk","title":"Adaptive Methods or Variational Inequalities with Relatively Smooth and\n  Reletively Strongly Monotone Operators","comments":"in Russian language","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The article is devoted to some adaptive methods for variational inequalities\nwith relatively smooth and relatively strongly monotone operators. Starting\nfrom the recently proposed proximal variant of the extragradient method for\nthis class of problems, we investigate in detail the method with adaptively\nselected parameter values. An estimate of the convergence rate of this method\nis proved. The result is generalized to a class of variational inequalities\nwith relatively strongly monotone generalized smooth variational inequality\noperators. Numerical experiments have been performed for the problem of ridge\nregression and variational inequality associated with box-simplex games.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:45:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ablaev","S. S.",""],["Stonyakin","F. S.",""],["Alkousa","M. S.",""],["Pasechnyuk","D. A.",""]]}
{"id":"2308.00469","submitter":"Haishan Ye","authors":"Haishan Ye","title":"Mirror Natural Evolution Strategies","comments":"arXiv admin note: substantial text overlap with arXiv:1910.11490","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The zeroth-order optimization has been widely used in machine learning\napplications. However, the theoretical study of the zeroth-order optimization\nfocus on the algorithms which approximate (first-order) gradients using\n(zeroth-order) function value difference at a random direction. The theory of\nalgorithms which approximate the gradient and Hessian information by\nzeroth-order queries is much less studied. In this paper, we focus on the\ntheory of zeroth-order optimization which utilizes both the first-order and\nsecond-order information approximated by the zeroth-order queries. We first\npropose a novel reparameterized objective function with parameters $(\\mu,\n\\Sigma)$. This reparameterized objective function achieves its optimum at the\nminimizer and the Hessian inverse of the original objective function\nrespectively, but with small perturbations. Accordingly, we propose a new\nalgorithm to minimize our proposed reparameterized objective, which we call\n\\texttt{MiNES} (mirror descent natural evolution strategy). We show that the\nestimated covariance matrix of \\texttt{MiNES} converges to the inverse of\nHessian matrix of the objective function with a convergence rate\n$\\widetilde{\\mathcal{O}}(1/k)$, where $k$ is the iteration number and\n$\\widetilde{\\mathcal{O}}(\\cdot)$ hides the constant and $\\log$ terms. We also\nprovide the explicit convergence rate of \\texttt{MiNES} and how the covariance\nmatrix promotes the convergence rate.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:45:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ye","Haishan",""]]}
{"id":"2308.00470","submitter":"Naoum Karchev Prof.","authors":"Naoum Karchev","title":"Overview of superconductivity in field-cooled magnetic materials","comments":"16 pages, 6 figures. arXiv admin note: substantial text overlap with\n  arXiv:2111.02765, arXiv:1712.02983, arXiv:1902.02290","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Considerable experimental skills have been accumulated in the preparation of\nfield-cooled (FC) magnetic materials. This stimulates the search for FC\nmagnetic materials that are superconductors.\n  The article overviews the recent proposed mechanism of superconductivity in\nfield-cooled magnetic materials.\n  It is based on previously published results for magnon-induced\nsuperconductivity in field-cooled spin-1/2 antiferromagnets $[PRB96,214409]$\n(arXiv:1712.02983), Sequence of superconducting states in field cooled\n$FeCr_2S_4$ $[JPCM33,495604]$\n  (arXiv:2111.02765) and Partial order induced superconductivity in $Fe^{2+}$\niron. $[EPL126,47001]$ (arXiv:1902.02290).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:49:00 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Karchev","Naoum",""]]}
{"id":"2308.00471","submitter":"Aurora Rofena","authors":"Aurora Rofena, Valerio Guarrasi, Marina Sarli, Claudia Lucia Piccolo,\n  Matteo Sammarra, Bruno Beomonte Zobel, Paolo Soda","title":"A Deep Learning Approach for Virtual Contrast Enhancement in Contrast\n  Enhanced Spectral Mammography","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":"  Contrast Enhanced Spectral Mammography (CESM) is a dual-energy mammographic\nimaging technique that first needs intravenously administration of an iodinated\ncontrast medium; then, it collects both a low-energy image, comparable to\nstandard mammography, and a high-energy image. The two scans are then combined\nto get a recombined image showing contrast enhancement. Despite CESM diagnostic\nadvantages for breast cancer diagnosis, the use of contrast medium can cause\nside effects, and CESM also beams patients with a higher radiation dose\ncompared to standard mammography. To address these limitations this work\nproposes to use deep generative models for virtual contrast enhancement on\nCESM, aiming to make the CESM contrast-free as well as to reduce the radiation\ndose. Our deep networks, consisting of an autoencoder and two Generative\nAdversarial Networks, the Pix2Pix, and the CycleGAN, generate synthetic\nrecombined images solely from low-energy images. We perform an extensive\nquantitative and qualitative analysis of the model's performance, also\nexploiting radiologists' assessments, on a novel CESM dataset that includes\n1138 images that, as a further contribution of this work, we make publicly\navailable. The results show that CycleGAN is the most promising deep network to\ngenerate synthetic recombined images, highlighting the potential of artificial\nintelligence techniques for virtual contrast enhancement in this field.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:49:05 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 14:48:15 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Rofena","Aurora",""],["Guarrasi","Valerio",""],["Sarli","Marina",""],["Piccolo","Claudia Lucia",""],["Sammarra","Matteo",""],["Zobel","Bruno Beomonte",""],["Soda","Paolo",""]]}
{"id":"2308.00472","submitter":"Charlie C.L. Wang Prof. Dr.","authors":"Neelotpal Dutta, Tianyu Zhang, Guoxin Fang, Ismail E. Yigit, Charlie\n  C.L. Wang","title":"Vector Field Based Volume Peeling for Multi-Axis Machining","comments":"ASME IDETC/CIE 2023 Conference, 43rd Computers and Information in\n  Engineering Conference, Boston, USA, August 20-23, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an easy-to-control volume peeling method for multi-axis\nmachining based on the computation taken on vector fields. The current scalar\nfield based methods are not flexible and the vector-field based methods do not\nguarantee the satisfaction of the constraints in the final results. We first\nconduct an optimization formulation to compute an initial vector field that is\nwell aligned with those anchor vectors specified by users according to\ndifferent manufacturing requirements. The vector field is further optimized to\nbe an irrotational field so that it can be completely realized by a scalar\nfield's gradients. Iso-surfaces of the scalar field will be employed as the\nlayers of working surfaces for multi-axis volume peeling in the rough\nmachining. Algorithms are also developed to remove and process singularities of\nthe fields. Our method has been tested on a variety of models and verified by\nphysical experimental machining.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:53:47 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dutta","Neelotpal",""],["Zhang","Tianyu",""],["Fang","Guoxin",""],["Yigit","Ismail E.",""],["Wang","Charlie C. L.",""]]}
{"id":"2308.00473","submitter":"Phuong Quynh Le","authors":"Phuong Quynh Le, J\\\"org Schl\\\"otterer and Christin Seifert","title":"Is Last Layer Re-Training Truly Sufficient for Robustness to Spurious\n  Correlations?","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":"  Models trained with empirical risk minimization (ERM) are known to learn to\nrely on spurious features, i.e., their prediction is based on undesired\nauxiliary features which are strongly correlated with class labels but lack\ncausal reasoning. This behavior particularly degrades accuracy in groups of\nsamples of the correlated class that are missing the spurious feature or\nsamples of the opposite class but with the spurious feature present. The\nrecently proposed Deep Feature Reweighting (DFR) method improves accuracy of\nthese worst groups. Based on the main argument that ERM mods can learn core\nfeatures sufficiently well, DFR only needs to retrain the last layer of the\nclassification model with a small group-balanced data set. In this work, we\nexamine the applicability of DFR to realistic data in the medical domain.\nFurthermore, we investigate the reasoning behind the effectiveness of\nlast-layer retraining and show that even though DFR has the potential to\nimprove the accuracy of the worst group, it remains susceptible to spurious\ncorrelations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:54:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Le","Phuong Quynh",""],["Schl\u00f6tterer","J\u00f6rg",""],["Seifert","Christin",""]]}
{"id":"2308.00474","submitter":"Andrew Chalmers","authors":"Joshua O'Hagan, Andrew Chalmers, Taehyun Rhee","title":"Simulating the Geometric Growth of the Marine Sponge Crella Incrustans","comments":"5 pages, 5 figures, IEEE VIS 2023, short paper, 9 supplementary\n  figures, 1 supplementary table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Simulating marine sponge growth helps marine biologists analyze, measure, and\npredict the effects that the marine environment has on marine sponges, and vice\nversa. This paper describes a way to simulate and grow geometric models of the\nmarine sponge Crella incrustans while considering environmental factors\nincluding fluid flow and nutrients. The simulation improves upon prior work by\nchanging the skeletal architecture of the sponge in the growth model to better\nsuit the structure of Crella incrustans. The change in skeletal architecture\nand other simulation parameters are then evaluated qualitatively against photos\nof a real-life Crella incrustans sponge. The results support the hypothesis\nthat changing the skeletal architecture from radiate accretive to Halichondrid\nproduces a sponge model which is closer in resemblance to Crella incrustans\nthan the prior work.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:55:52 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 10:45:53 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 12:05:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["O'Hagan","Joshua",""],["Chalmers","Andrew",""],["Rhee","Taehyun",""]]}
{"id":"2308.00475","submitter":"Mohammadreza Shakouri","authors":"Mohammadreza Shakouri, Fatemeh Iranmanesh, Mahdi Eftekhari","title":"DINO-CXR: A self supervised method based on vision transformer for chest\n  X-ray classification","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":"  The limited availability of labeled chest X-ray datasets is a significant\nbottleneck in the development of medical imaging methods. Self-supervised\nlearning (SSL) can mitigate this problem by training models on unlabeled data.\nFurthermore, self-supervised pretraining has yielded promising results in\nvisual recognition of natural images but has not been given much consideration\nin medical image analysis. In this work, we propose a self-supervised method,\nDINO-CXR, which is a novel adaptation of a self-supervised method, DINO, based\non a vision transformer for chest X-ray classification. A comparative analysis\nis performed to show the effectiveness of the proposed method for both\npneumonia and COVID-19 detection. Through a quantitative analysis, it is also\nshown that the proposed method outperforms state-of-the-art methods in terms of\naccuracy and achieves comparable results in terms of AUC and F-1 score while\nrequiring significantly less labeled data.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:58:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shakouri","Mohammadreza",""],["Iranmanesh","Fatemeh",""],["Eftekhari","Mahdi",""]]}
{"id":"2308.00476","submitter":"Carlo Heissenberg","authors":"Andrea Campoleoni, Arnaud Delfante, Dario Francia, Carlo Heissenberg","title":"Renormalization of spin-one asymptotic charges in AdS$_D$","comments":"46 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"UUITP-20/23","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the renormalized action and the renormalized presymplectic potential\nfor Maxwell fields on Anti de Sitter backgrounds of any dimensions. We then use\nthese results to explicitly derive finite boundary charges for angle-dependent\nasymptotic symmetries. We consider both Poincar\\'e and Bondi coordinates, the\nformer allowing us to control the systematics for arbitrary $D$, the latter\nbeing better suited for a smooth flat limit.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:00:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Campoleoni","Andrea",""],["Delfante","Arnaud",""],["Francia","Dario",""],["Heissenberg","Carlo",""]]}
{"id":"2308.00477","submitter":"Eric Goubault","authors":"Eric Goubault and Roman Kniazev and J\\'er\\'emy Ledent","title":"A many-sorted epistemic logic for chromatic hypergraphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.MA math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a many-sorted modal logic for reasoning about knowledge in\nmulti-agent systems. Our logic introduces a clear distinction between\nparticipating agents and the environment. This allows to express local\nproperties of agents and global properties of worlds in a uniform way, as well\nas to talk about the presence or absence of agents in a world. The logic\nsubsumes the standard epistemic logic and is a conservative extension of it.\nThe semantics is given in chromatic hypergraphs, a generalization of chromatic\nsimplicial complexes, which were recently used to model knowledge in\ndistributed systems. We show that the logic is sound and complete with respect\nto the intended semantics. We also show a further connection of chromatic\nhypergraphs with neighborhood frames.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:02:17 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Goubault","Eric",""],["Kniazev","Roman",""],["Ledent","J\u00e9r\u00e9my",""]]}
{"id":"2308.00478","submitter":"Hengyu Zhang","authors":"Hengyu Zhang, Zhilin Lu, Xudong Zhang, Jintao Wang","title":"Data Augmentation of Bridging the Delay Gap for DL-based Massive MIMO\n  CSI Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In massive multiple-input multiple-output (MIMO) systems under the frequency\ndivision duplexing (FDD) mode, the user equipment (UE) needs to feed channel\nstate information (CSI) back to the base station (BS). Though deep learning\napproaches have made a hit in the CSI feedback problem, whether they can remain\nexcellent in actual environments needs to be further investigated. In this\nletter, we point out that the real-time dataset in application often has the\ndomain gap from the training dataset caused by the time delay. To bridge the\ngap, we propose bubble-shift (B-S) data augmentation, which attempts to offset\nperformance degradation by changing the delay and remaining the channel\ninformation as much as possible. Moreover, random-generation (R-G) data\naugmentation is especially proposed for outdoor scenarios due to the complex\ndistribution of its channels. It generalizes the characteristics of the channel\nmatrix and alleviates the over-fitting problem. Simulation results show that\nthe proposed data augmentation boosts the robustness of networks in both indoor\nand outdoor environments. The open source codes are available at\nhttps://github.com/zhanghy23/CRNet-Aug.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:04:36 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Hengyu",""],["Lu","Zhilin",""],["Zhang","Xudong",""],["Wang","Jintao",""]]}
{"id":"2308.00479","submitter":"Supun Manathunga","authors":"S. S. Manathunga and Y. A. Illangasekara","title":"Retrieval Augmented Generation and Representative Vector Summarization\n  for large unstructured textual data in Medical Education","comments":"6 pages, 5 figures","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 are increasingly being used for various tasks including\ncontent generation and as chatbots. Despite their impressive performances in\ngeneral tasks, LLMs need to be aligned when applying for domain specific tasks\nto mitigate the problems of hallucination and producing harmful answers.\nRetrieval Augmented Generation (RAG) allows to easily attach and manipulate a\nnon-parametric knowledgebases to LLMs. Applications of RAG in the field of\nmedical education are discussed in this paper. A combined extractive and\nabstractive summarization method for large unstructured textual data using\nrepresentative vectors is proposed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:04:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Manathunga","S. S.",""],["Illangasekara","Y. A.",""]]}
{"id":"2308.00480","submitter":"Andreas Chari","authors":"Andreas Chari, Sean MacAvaney, Iadh Ounis","title":"On the Effects of Regional Spelling Conventions in Retrieval Models","comments":"10 pages, 3 tables, short paper published in SIGIR '23","journal-ref":"SIGIR '23: Proceedings of the 46th International ACM SIGIR\n  Conference on Research and Development in Information Retrieval, July 2023,\n  Pages 2220-2224","doi":"10.1145/3539618.3592030","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One advantage of neural ranking models is that they are meant to generalise\nwell in situations of synonymity i.e. where two words have similar or identical\nmeanings. In this paper, we investigate and quantify how well various ranking\nmodels perform in a clear-cut case of synonymity: when words are simply\nexpressed in different surface forms due to regional differences in spelling\nconventions (e.g., color vs colour). We first explore the prevalence of\nAmerican and British English spelling conventions in datasets used for the\npre-training, training and evaluation of neural retrieval methods, and find\nthat American spelling conventions are far more prevalent. Despite these biases\nin the training data, we find that retrieval models often generalise well in\nthis case of synonymity. We explore the effect of document spelling\nnormalisation in retrieval and observe that all models are affected by\nnormalising the document's spelling. While they all experience a drop in\nperformance when normalised to a different spelling convention than that of the\nquery, we observe varied behaviour when the document is normalised to share the\nquery spelling convention: lexical models show improvements, dense retrievers\nremain unaffected, and re-rankers exhibit contradictory behaviour.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:07:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chari","Andreas",""],["MacAvaney","Sean",""],["Ounis","Iadh",""]]}
{"id":"2308.00481","submitter":"Shihao Shen","authors":"Shihao Shen, Yuanming Ren, Yanli Ju, Xiaofei Wang, Wenyu Wang, Victor\n  C. M. Leung","title":"EdgeMatrix: A Resource-Redefined Scheduling Framework for SLA-Guaranteed\n  Multi-Tier Edge-Cloud Computing Systems","comments":"JSAC. arXiv admin note: substantial text overlap with\n  arXiv:2203.10470","journal-ref":null,"doi":"10.1109/JSAC.2022.3229444","report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the development of networking technology, the computing system has\nevolved towards the multi-tier paradigm gradually. However, challenges, such as\nmulti-resource heterogeneity of devices, resource competition of services, and\nnetworked system dynamics, make it difficult to guarantee service-level\nagreement (SLA) for the applications. In this paper, we propose a multi-tier\nedge-cloud computing framework, EdgeMatrix, to maximize the throughput of the\nsystem while guaranteeing different SLA priorities. First, in order to reduce\nthe impact of physical resource heterogeneity, EdgeMatrix introduces the\nNetworked Multi-agent Actor-Critic (NMAC) algorithm to re-define physical\nresources with the same quality of service as logically isolated resource units\nand combinations, i.e., cells and channels. In addition, a multi-task mechanism\nis designed in EdgeMatrix to solve the problem of Joint Service Orchestration\nand Request Dispatch (JSORD) for matching the requests and services, which can\nsignificantly reduce the optimization runtime. For integrating above two\nalgorithms, EdgeMatrix is designed with two time-scales, i.e., coordinating\nservices and resources at the larger time-scale, and dispatching requests at\nthe smaller time-scale. Realistic trace-based experiments proves that the\noverall throughput of EdgeMatrix is 36.7% better than that of the closest\nbaseline, while the SLA priorities are guaranteed still.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:07:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shen","Shihao",""],["Ren","Yuanming",""],["Ju","Yanli",""],["Wang","Xiaofei",""],["Wang","Wenyu",""],["Leung","Victor C. M.",""]]}
{"id":"2308.00482","submitter":"Natsuya Takahashi","authors":"Natsuya Takahashi","title":"Exotic 4-manifolds with small trisection genus","comments":"15 pages, 21 figures, new result added, references added, exposition\n  improved","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that there exists an exotic pair of $4$-manifolds with boundary whose\ntrisection genera are $4$. We also construct genus-$3$ relative trisections for\nan infinite family of contractible $4$-manifolds introduced by Akbulut and\nKirby.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:07:54 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 12:37:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Takahashi","Natsuya",""]]}
{"id":"2308.00483","submitter":"Tim Sander","authors":"Tim Sander, Nadine Friesen, Karl Nachtigall, Nils Nie{\\ss}en","title":"Robust Railway Network Design based on Strategic Timetables","comments":"23 pages, 5 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using strategic timetables as input for railway network design has become\nincreasingly popular among western European railway infrastructure operators.\nAlthough both railway timetabling and railway network design on their own are\nwell covered by academic research, there is still a gap in the literature\nconcerning timetable-based network design. Therefore, we propose a\nmixed-integer linear program to design railway infrastructure so that the\ndemand derived from a strategic timetable can be satisfied with minimal\ninfrastructure costs. The demand is given by a list of trains, each featuring\nstart and destination nodes as well as time bounds and a set of frequency and\ntransfer constraints that capture the strategic timetable's main\ncharacteristics. During the optimization, the solver decides which railway\nlines need to be built or expanded and whether travel or headway times must be\nshortened to meet the demand. Since strategic timetables are subject to\nuncertainty, we expand the optimization model to a robust version. Uncertain\ntimetables are modelled as discrete scenarios, while uncertain freight train\ndemand is modelled using optional trains, which can be inserted into the\nresulting timetable if they do not require additional infrastructure. We\npresent computational results for both the deterministic and the robust case\nand give an outlook on further research.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:09:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sander","Tim",""],["Friesen","Nadine",""],["Nachtigall","Karl",""],["Nie\u00dfen","Nils",""]]}
{"id":"2308.00484","submitter":"Arthur Blanc-Renaudie","authors":"\\'Etienne Bellin, Arthur Blanc-Renaudie, Emmanuel Kammerer, Igor\n  Kortchemski","title":"Uniform attachment with freezing: Scaling limits","comments":"31 pages, 7 figures. This is the second part of a project made by the\n  same authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate scaling limits of trees built by uniform attachment with\nfreezing, which is a variant of the classical model of random recursive trees\nintroduced in a companion paper. Here vertices are allowed to freeze, and\narriving vertices cannot be attached to already frozen ones. We identify a\nphase transition when the number of non-frozen vertices roughly evolves as the\ntotal number of vertices to a given power. In particular, we observe a critical\nregime where the scaling limit is a random compact real tree, closely related\nto a time non-homogenous Kingman coalescent process identified by Aldous.\nInterestingly, in this critical regime, a condensation phenomenon can occur.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:13:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bellin","\u00c9tienne",""],["Blanc-Renaudie","Arthur",""],["Kammerer","Emmanuel",""],["Kortchemski","Igor",""]]}
{"id":"2308.00485","submitter":"Kai Neerg{\\aa}rd","authors":"K. Neerg{\\aa}rd","title":"\"Onishi\" formulas","comments":"Presented at the 40th Anniversary International Workshop on Nuclear\n  Theory, 2-8 July 2023, Rila Mountains, Bulgaria","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The term \"Onishi\" formula refers to a family of related formulas for the\noverlap amplitude of two Bogolyubov quasi-fermion vacua. As a common feature,\nthese formulas display a square root, which gives rise to an apparent sign\nambiguity. For some members of the family, this sign ambiguity is real and\nunavoidable while in some other cases it is not. The relation between the\ndifferent Onishi formulas is discussed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:15:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Neerg\u00e5rd","K.",""]]}
{"id":"2308.00486","submitter":"Ovidiu Patu","authors":"Ovidiu I. Patu","title":"Nonequilibrium dynamics in one-dimensional strongly interacting\n  two-component gases","comments":"30 pages, 5 figures, RevTeX 4.2","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":"  The derivation of determinant representations for the space-, time-, and\ntemperature-dependent correlation functions of the impenetrable Gaudin-Yang\nmodel in the presence of a trapping potential is presented. These\nrepresentations are valid in both equilibrium and nonequilibrium scenarios like\nthe ones initiated by a sudden change of the confinement potential. In the\nequal-time case our results are shown to be equivalent to a multicomponent\ngeneralization of Lenard's formula from which Painlev\\'e transcendent\nrepresentations for the correlators can be obtained in the case of harmonic\ntrapping and Dirichlet and Neumann boundary conditions. For a system in the\nquantum Newton's cradle setup the determinant representations allow for an\nexact numerical investigation of the dynamics and even hydrodynamization which\nis outside the reach of Generalized Hydrodynamics or other approximate methods.\nIn the case of a sudden change in the trap's frequency we predict a many-body\nbounce effect, not present in the evolution of the density profile, which\ncauses a nontrivial periodic narrowing of the momentum distribution with\namplitude depending on the statistics of the particles.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:17:37 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Patu","Ovidiu I.",""]]}
{"id":"2308.00487","submitter":"Marta Vanin","authors":"Frederik Geth, Marta Vanin, Dirk Van Hertem","title":"Data quality challenges in existing distribution network datasets","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":"  Existing digital distribution network models, like those in the databases of\nnetwork utilities, are known to contain erroneous or untrustworthy information.\nThis can compromise the effectiveness of physics-based engineering simulations\nand technologies, in particular those that are needed to deliver the energy\ntransition. The large-scale rollout of smart meters presents new opportunities\nfor data-driven system identification in distribution networks, enabling the\nimprovement of existing data sets. Despite the increasing academic attention to\nsystem identification for distribution networks, researchers often make\ntroublesome assumptions on what data is available and/or trustworthy. In this\npaper, we highlight some differences between academic efforts and first-hand\nindustrial experiences, in order to steer the former towards more applicable\nresearch solutions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:19:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Geth","Frederik",""],["Vanin","Marta",""],["Van Hertem","Dirk",""]]}
{"id":"2308.00488","submitter":"Jun Li","authors":"Jun Li, Xi Chen","title":"The Infrared Extinction Law in the Ophiuchus Molecular Cloud based on\n  UKIDSS and Spitzer","comments":"Accepted by Universe","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Investigating the extinction properties in dense molecular clouds is of\nsignificant importance for understanding the behavior of interstellar dust and\nits impact on observations. In this study, we comprehensively examined the\nextinction law in the Ophiuchus cloud across a wavelength range from\n0.8$\\,\\mu\\rm m$ to 8$\\,\\mu\\rm m$. To achieve this, we analyzed NIR and MIR data\nobtained from the UKIDSS GCS and the Spitzer c2d survey, respectively. By\nfitting a series of color-color diagrams, we determined color-excess ratios\n$E_{J-\\lambda}/E_{J-K}$ for seven passbands. These ratios were then directly\nconverted to derive the relative extinction law $A_\\lambda/A_K$. Our findings\ndemonstrate that the Ophiuchus cloud exhibits a characteristic of flat MIR\nextinction, consistent with previous studies. Additionally, our results reveal\nvariations in the extinction law with extinction depth, indicating a flatter\ntrend from the NIR to MIR bands as extinction increases. Notably, our analysis\nreveals no significant difference in the MIR extinction law among the four dark\nclouds: L1712, L1689, L1709, and L1688. However, distinct variations were\nobserved in the extinction law for regions outside the dark clouds,\nspecifically L1688N and L1688W. These regions displayed lower color-excess\nratios $E_{J-\\lambda}/E_{J-K}$ in the Spitzer/IRAC bands. This observation\nlends support to the dust growth occurring in the dense regions of the\nOphiuchus cloud.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:19:18 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Jun",""],["Chen","Xi",""]]}
{"id":"2308.00489","submitter":"Md Sabir Ali","authors":"Md Sabir Ali, Sushant G. Ghosh, and Anzhong Wang","title":"Thermodynamics of Kerr-Sen-AdS black holes in the restricted phase space","comments":"15 pages, 6 figures, Accepted for publication in Physical Review D","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyse the restricted phase space thermodynamics (RPST) of Kerr-Sen-AdS\nblack holes with the central charge $C$ and its conjugate chemical potential\n$\\mu$ but exclude the familiar $PdV$ term in the first law of black hole\nthermodynamics. That gives rise to a new perspective on the thermodynamics of\nblack holes. Using the scaling properties, we investigate the first law and the\ncorresponding Euler formula. Such formalism has its beauty, to say, for\nexample, the mass is considered to be a homogeneous function of the extensive\nvariables in the first order. In contrast, the intensive variables are of\nzeroth order. Because of the complicated expressions of the metric, we\nnumerically calculate the critical values of the thermodynamic quantities. We\nfind the phase transition behaviour of the free energy and other thermodynamic\nconjugate variables that appear in the first law. The RPST of the Kerr-Sen-AdS\nblack holes is like that of the Reissner-Nordstr$\\ddot{o}$m-AdS and the\nKerr-AdS black holes. Such notions of the phase transition behaviour show that\nthere should be some underlying universality in the RPST formalism.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:20:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ali","Md Sabir",""],["Ghosh","Sushant G.",""],["Wang","Anzhong",""]]}
{"id":"2308.00490","submitter":"Linkang Zhan","authors":"Linkang Zhan, Danfeng Ye, Xinjian Qiu, and Yan Cen","title":"Discovery of Stable Hybrid Organic-inorganic Double Perovskites for\n  High-performance Solar Cells via Machine-learning Algorithms and Crystal\n  Graph Convolution Neural Network Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cs.CE physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hybrid peroskite solar cells are newly emergent high-performance photovoltaic\ndevices, which suffer from disadvantages such as toxic elements, short-term\nstabilities, and so on. Searching for alternative perovskites with high\nphotovoltaic performances and thermally stabilities is urgent in this field. In\nthis work, stimulated by the recently proposed materials-genome initiative\nproject, firstly we build classical machine-learning algorithms for the models\nof formation energies, bangdaps and Deybe temperatures for hybrid\norganic-inorganic double perovskites, then we choose the high-precision models\nto screen a large scale of double-perovskite chemical space, to filter out good\npervoskite candidates for solar cells. We also analyze features of importances\nfor the the three target properties to reveal the underlying mechanisms and\ndiscover the typical characteristics of high-performances double perovskites.\nSecondly we adopt the Crystal graph convolution neural network (CGCNN), to\nbuild precise model for bandgaps of perovskites for further filtering. Finally\nwe use the ab-initio method to verify the results predicted by the CGCNN\nmethod, and find that, six out of twenty randomly chosen (CH3)2NH2-based HOIDP\ncandidates possess finite bandgaps, and especially, (CH3)2NH2AuSbCl6 and\n(CH3)2NH2CsPdF6 possess the bandgaps of 0.633 eV and 0.504 eV, which are\nappropriate for photovoltaic applications. Our work not only provides a large\nscale of potential high-performance double-perovskite candidates for futural\nexperimental or theoretical verification, but also showcases the effective and\npowerful prediction of the combined ML and CGCNN method proposed for the first\ntime here.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:22:44 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhan","Linkang",""],["Ye","Danfeng",""],["Qiu","Xinjian",""],["Cen","Yan",""]]}
{"id":"2308.00491","submitter":"Julia Dietlmeier","authors":"Grace Billingsley, Julia Dietlmeier, Vivek Narayanaswamy, Andreas\n  Spanias and Noel E. OConnor","title":"An L2-Normalized Spatial Attention Network For Accurate And Fast\n  Classification Of Brain Tumors In 2D T1-Weighted CE-MRI Images","comments":"Accepted to be published in: IEEE International Conference on Image\n  Processing (ICIP), Kuala Lumpur October 8-11, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose an accurate and fast classification network for classification of\nbrain tumors in MRI images that outperforms all lightweight methods\ninvestigated in terms of accuracy. We test our model on a challenging 2D\nT1-weighted CE-MRI dataset containing three types of brain tumors: Meningioma,\nGlioma and Pituitary. We introduce an l2-normalized spatial attention mechanism\nthat acts as a regularizer against overfitting during training. We compare our\nresults against the state-of-the-art on this dataset and show that by\nintegrating l2-normalized spatial attention into a baseline network we achieve\na performance gain of 1.79 percentage points. Even better accuracy can be\nattained by combining our model in an ensemble with the pretrained VGG16 at the\nexpense of execution speed. Our code is publicly available at\nhttps://github.com/juliadietlmeier/MRI_image_classification\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:22:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Billingsley","Grace",""],["Dietlmeier","Julia",""],["Narayanaswamy","Vivek",""],["Spanias","Andreas",""],["OConnor","Noel E.",""]]}
{"id":"2308.00492","submitter":"Sibel Sahin","authors":"Sibel \\c{S}ahin","title":"The Smirnov Class for Sub-Bergman Hilbert Spaces","comments":"6 pages, first version","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.FA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work we consider the Smirnov classes for sub-Bergman spaces. First we\npoint out some observations about the Smirnov property of sub-Bergman space\n$H^\\alpha(\\varphi)$ and its relation to the defining $H^{\\infty}_{1}$ function\n$\\varphi$. The first main result of the work deals with the range of the defect\noperator over Smirnov-sub-Bergman class whereas in the last part we show that\ncontrary to classical Bergman spaces, Smirnov-sub-Bergman classes have\nnon-tangential boundary values almost everywhere on the unit circle.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:23:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["\u015eahin","Sibel",""]]}
{"id":"2308.00493","submitter":"Igor Kortchemski","authors":"\\'Etienne Bellin, Arthur Blanc-Renaudie, Emmanuel Kammerer, Igor\n  Kortchemski","title":"Uniform attachment with freezing","comments":"38 pages, 10 figures, 2 animations, part one of a two-paper series","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the classical model of random recursive trees, trees are recursively built\nby attaching new vertices to old ones. What happens if vertices are allowed to\nfreeze, in the sense that new vertices cannot be attached to already frozen\nones? We are interested in the impact of freezing on the height of such trees.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:24:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bellin","\u00c9tienne",""],["Blanc-Renaudie","Arthur",""],["Kammerer","Emmanuel",""],["Kortchemski","Igor",""]]}
{"id":"2308.00494","submitter":"Dingqun Deng","authors":"Dingqun Deng","title":"The Non-cutoff Boltzmann Equation in General Domains","comments":"This preprint is a correction and extension of the previous version.\n  We extend the analysis from convex domains to general domains including\n  non-convex domains. We also correct the non-rigorous calculations from the\n  weak solution formulation, the regularizing term, and the a priori $L^\\infty$\n  estimate. 184 pages, 2 figures, all comments welcome","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":"  The initial-boundary value problem for the inhomogeneous non-cutoff Boltzmann\nequation is a long-standing open problem. In this paper, we study the stability\nand long-time dynamics of the Boltzmann equation near a global Maxwellian\nwithout angular cutoff assumption in a general $C^3$ domain $\\Omega$ (including\nconvex and non-convex cases) with physical boundary conditions: inflow and\nMaxwell-reflection (including diffuse-reflection) boundary conditions. When the\ndomain $\\Omega$ is bounded, we obtain the global stability in time, which has\nan exponential decay rate for the inflow boundary for both hard and soft\npotentials, and for the Maxwell-reflection boundary for hard potentials. The\ncrucial method is to extend the boundary problem in a general domain to the\nwhole space with velocity regularity, followed by the De Giorgi iteration and\nthe $L^2$--$L^\\infty$ method. We believe that the current work will have a\nsignificant impact on the generation of robust applications for the kinetic\nequations in bounded domains.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:26:40 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 03:06:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Deng","Dingqun",""]]}
{"id":"2308.00495","submitter":"Charles Karney","authors":"Charles F. F. Karney (SRI International)","title":"Geodesic intersections","comments":"RevTex, 9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A complete treatment of the intersections of two geodesics on the surface of\nan ellipsoid of revolution is given. With a suitable metric for the distances\nbetween intersections, bounds are placed on their spacing. This leads to fast\nand reliable algorithms for finding the closest intersection, determining\nwhether and where two geodesic segments intersect, finding the next closest\nintersection to a given intersection, and listing all nearby intersections. The\ncases where the two geodesics overlap are also treated.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:27:45 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Karney","Charles F. F.","","SRI International"]]}
{"id":"2308.00496","submitter":"Sergey Buterin","authors":"Sergey Buterin","title":"On damping a control system with global aftereffect on quantum graphs","comments":"13 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper naturally connects the theory of quantum graphs, the control\ntheory and the theory of functional-differential equations. Specifically, we\nstudy the problem of damping a control system described by first-order\nequations on an arbitrary tree graph with global delay. The latter means that\nthe constant delay imposed starting from the initial moment of time propagates\nthrough all internal vertices of the graph. By minimizing the energy\nfunctional, we arrive at the corresponding variational problem and then prove\nits equivalence to a self-adjoint boundary value problem on the tree for\nsecond-order equations involving both the global delay and the global advance.\nIt is remarkable that the resulting problem acquires Kirchhoff's conditions at\nthe internal vertices of the graph, which often appear in the theory of quantum\ngraphs as well as various applications. The unique solvability of this boundary\nvalue problem is proved.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:32:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Buterin","Sergey",""]]}
{"id":"2308.00497","submitter":"Yifei He","authors":"Yifei He and Artur Podobas and Stefano Markidis","title":"Leveraging MLIR for Loop Vectorization and GPU Porting of FFT Libraries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  FFTc is a Domain-Specific Language (DSL) for designing and generating Fast\nFourier Transforms (FFT) libraries. The FFTc uniqueness is that it leverages\nand extend Multi-Level Intermediate Representation (MLIR) dialects to optimize\nFFT code generation. In this work, we present FFTc extensions and improvements\nsuch as the possibility of using different data layout for complex-value\narrays, and sparsification to enable efficient vectorization, and a seamless\nporting of FFT libraries to GPU systems. We show that, on CPUs, thanks to\nvectorization, the performance of the FFTc-generated FFT is comparable to\nperformance of FFTW, a state-of-the-art FFT libraries. We also present the\ninitial performance results for FFTc on Nvidia GPUs.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:32:26 GMT"}],"update_date":"2023-08-02","authors_parsed":[["He","Yifei",""],["Podobas","Artur",""],["Markidis","Stefano",""]]}
{"id":"2308.00498","submitter":"Patrick Morris","authors":"David Fabian, Patrick Morris and Tibor Szab\\'o","title":"Slow graph bootstrap percolation I: Cycles","comments":"25 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap\npercolation process on $G$ is defined to be the sequence of graphs $G_i$,\n$i\\geq 0$ which starts with $G_0:=G$ and in which $G_{i+1}$ is obtained from\n$G_i$ by adding every edge that completes a copy of $H$. We are interested in\nthe maximum number of steps, over all $n$-vertex graphs $G$, that this process\ntakes to stabilise. In the first of a series of papers exploring the behaviour\nof this function, denoted $M_H(n)$, and its dependence on certain properties of\n$H$, we investigate the case when $H$ is a cycle. We determine the running time\nprecisely, giving the first infinite family of graphs $H$ for which an exact\nsolution is known. The maximum running time of the $C_k$-bootstrap process is\nof the order $\\log_{k-1}(n)$ for all $3\\leq k\\in \\mathbb{N}$. Interestingly\nthough, the function exhibits different behaviour depending on the parity of\n$k$ and the exact location of the values of $n$ for which $M_H(n)$ increases is\ndetermined by the Frobenius number of a certain numerical semigroup depending\non $k$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:34:26 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fabian","David",""],["Morris","Patrick",""],["Szab\u00f3","Tibor",""]]}
{"id":"2308.00499","submitter":"Yanshi Sun","authors":"Yanshi Sun, Zhiguo Ding, Xuchu Dai, Momiao Zhou, Zhizhong Ding","title":"Stochastic Geometry Based Modeling and Analysis on Network NOMA in\n  Downlink CoMP Systems","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":"  This paper investigates the performance of network non-orthogonal multiple\naccess (N-NOMA) in a downlink coordinated multi-point (CoMP) system. In the\nconsidered N-NOMA scheme, multiple base stations (BSs) cooperatively serve a\nCoMP user, meanwhile, each BS serves additional NOMA users by occupying the\nsame resource block allocated to the CoMP user. The locations of the BSs and\nusers are modeled by stochastic geometric models and the interference from the\nwhole network is considered. Through rigorous derivations, the outage\nprobabilities achieved by the CoMP and NOMA users are obtained, respectively.\nNumerical results are provided to verify the accuracy of the analytical results\nand also demonstrate the superior performance of N-NOMA compared to orthogonal\nmultiple access (OMA) based CoMP scheme.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:35:06 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sun","Yanshi",""],["Ding","Zhiguo",""],["Dai","Xuchu",""],["Zhou","Momiao",""],["Ding","Zhizhong",""]]}
{"id":"2308.00500","submitter":"Ryosuke Isono","authors":"Ryosuke Isono, Kazuki Naganuma, and Shunsuke Ono","title":"Robust Spatiotemporal Fusion of Satellite Images: A Constrained Convex\n  Optimization Approach","comments":"Submitted to the IEEE Transactions on Geoscience and Remote Sensing","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a novel spatiotemporal (ST) fusion framework for\nsatellite images, named Robust Optimization-based Spatiotemporal Fusion\n(ROSTF). ST fusion is a promising approach to resolve a trade-off between the\ntemporal and spatial resolution of satellite images. Although many ST fusion\nmethods have been proposed, most of them are not designed to explicitly account\nfor noise in observed images, despite the inevitable influence of noise caused\nby the measurement equipment and environment. Our ROSTF addresses this\nchallenge by treating the noise removal of the observed images and the\nestimation of the target high-resolution image as a single optimization\nproblem. Specifically, first, we define observation models for satellite images\npossibly contaminated with random noise, outliers, and/or missing values, and\nthen introduce certain assumptions that would naturally hold between the\nobserved images and the target high-resolution image. Then, based on these\nmodels and assumptions, we formulate the fusion problem as a constrained\noptimization problem and develop an efficient algorithm based on a\npreconditioned primal-dual splitting method for solving the problem. The\nperformance of ROSTF was verified using simulated and real data. The results\nshow that ROSTF performs comparably to several state-of-the-art ST fusion\nmethods in noiseless cases and outperforms them in noisy cases.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:35:15 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Isono","Ryosuke",""],["Naganuma","Kazuki",""],["Ono","Shunsuke",""]]}
{"id":"2308.00501","submitter":"Leon Kellerhals","authors":"Lito Goldmann, Leon Kellerhals, and Tomohiro Koana","title":"Structural Parameterizations of the Biclique-Free Vertex Deletion\n  Problem","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 work, we study the Biclique-Free Vertex Deletion problem: Given a\ngraph $G$ and integers $k$ and $i \\le j$, find a set of at most $k$ vertices\nthat intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.\nThis is a natural generalization of the Bounded-Degree Deletion problem,\nwherein one asks whether there is a set of at most $k$ vertices whose deletion\nresults in a graph of a given maximum degree $r$. The two problems coincide\nwhen $i = 1$ and $j = r + 1$. We show that Biclique-Free Vertex Deletion is\nfixed-parameter tractable with respect to $k + d$ for the degeneracy $d$ by\ndeveloping a $2^{O(d k^2)} \\cdot n^{O(1)}$-time algorithm. We also show that it\ncan be solved in $2^{O(f k)} \\cdot n^{O(1)}$ time for the feedback vertex\nnumber $f$ when $i \\ge 2$. In contrast, we find that it is W[1]-hard for the\ntreedepth for any integer $i \\ge 1$. Finally, we show that Biclique-Free Vertex\nDeletion has a polynomial kernel for every $i \\ge 1$ when parameterized by the\nfeedback edge number. Previously, for this parameter, its fixed-parameter\ntractability for $i = 1$ was known [Betzler et al., DAM '12] but the existence\nof polynomial kernel was open.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:35:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Goldmann","Lito",""],["Kellerhals","Leon",""],["Koana","Tomohiro",""]]}
{"id":"2308.00502","submitter":"Brandy Guntel Doleshal","authors":"Brandon Bavier, Brandy Doleshal","title":"The Jones polynomial for a torus knot with twists","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the Jones polynomial for a three-parameter family of links, the\ntwisted torus links of the form $T((p,q),(2,s))$ where $p$ and $q$ are coprime\nand $s$ is nonzero. When $s = 2n$, these links are the twisted torus knots\n$T(p,q,2,n)$. We show that for $T(p,q,2,n)$, the Jones polynomial is trivial if\nand only if the knot is trivial.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:35:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bavier","Brandon",""],["Doleshal","Brandy",""]]}
{"id":"2308.00503","submitter":"Rajesh Jayaram","authors":"Rajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong","title":"Massively Parallel Algorithms for High-Dimensional Euclidean Minimum\n  Spanning Tree","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the classic Euclidean Minimum Spanning Tree (MST) problem in the\nMassively Parallel Computation (MPC) model. Given a set $X \\subset\n\\mathbb{R}^d$ of $n$ points, the goal is to produce a spanning tree for $X$\nwith weight within a small factor of optimal. Euclidean MST is one of the most\nfundamental hierarchical geometric clustering algorithms, and with the\nproliferation of enormous high-dimensional data sets, such as massive\ntransformer-based embeddings, there is now a critical demand for efficient\ndistributed algorithms to cluster such data sets.\n  In low-dimensional space, where $d = O(1)$, Andoni, Nikolov, Onak, and\nYaroslavtsev [STOC '14] gave a constant round MPC algorithm that obtains a high\naccuracy $(1+\\epsilon)$-approximate solution. However, the situation is much\nmore challenging for high-dimensional spaces: the best-known algorithm to\nobtain a constant approximation requires $O(\\log n)$ rounds. Recently Chen,\nJayaram, Levi, and Waingarten [STOC '22] gave a $\\tilde{O}(\\log n)$\napproximation algorithm in a constant number of rounds based on embeddings into\ntree metrics. However, to date, no known algorithm achieves both a constant\nnumber of rounds and approximation.\n  In this paper, we make strong progress on this front by giving a constant\nfactor approximation in $\\tilde{O}(\\log \\log n)$ rounds of the MPC model. In\ncontrast to tree-embedding-based approaches, which necessarily must pay\n$\\Omega(\\log n)$-distortion, our algorithm is based on a new combination of\ngraph-based distributed MST algorithms and geometric space partitions.\nAdditionally, although the approximate MST we return can have a large depth, we\nshow that it can be modified to obtain a $\\tilde{O}(\\log \\log n)$-round\nconstant factor approximation to the Euclidean Traveling Salesman Problem (TSP)\nin the MPC model. Previously, only a $O(\\log n)$ round was known for the\nproblem.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:36:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jayaram","Rajesh",""],["Mirrokni","Vahab",""],["Narayanan","Shyam",""],["Zhong","Peilin",""]]}
{"id":"2308.00504","submitter":"Mieczys{\\l}aw K{\\l}opotek","authors":"Bart{\\l}omiej Starosta, Mieczys{\\l}aw A. K{\\l}opotek, S{\\l}awomir T.\n  Wierzcho\\'n","title":"Explainable Graph Spectral Clustering of Text Documents","comments":"4 figures, 15 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectral clustering methods are known for their ability to represent clusters\nof diverse shapes, densities etc. However, results of such algorithms, when\napplied e.g. to text documents, are hard to explain to the user, especially due\nto embedding in the spectral space which has no obvious relation to document\ncontents. Therefore there is an urgent need to elaborate methods for explaining\nthe outcome of the clustering. This paper presents a contribution towards this\ngoal. We present a proposal of explanation of results of combinatorial\nLaplacian based graph spectral clustering. It is based on showing (approximate)\nequivalence of combinatorial Laplacian embedding, $K$-embedding (proposed in\nthis paper) and term vector space embedding. Hence a bridge is constructed\nbetween the textual contents and the clustering results. We provide theoretical\nbackground for this approach. We performed experimental study showing that\n$K$-embedding approximates well Laplacian embedding under favourable block\nmatrix conditions and show that approximation is good enough under other\nconditions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:39:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Starosta","Bart\u0142omiej",""],["K\u0142opotek","Mieczys\u0142aw A.",""],["Wierzcho\u0144","S\u0142awomir T.",""]]}
{"id":"2308.00506","submitter":"Neri Merhav","authors":"Neri Merhav","title":"Trade-offs Between Weak-Noise Performance and Probability of Anomaly in\n  Parameter Estimation from Noisy Chaotic Signals","comments":"29 pages; submitted for publication","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 problem of parameter estimation, based on noisy chaotic\nsignals, from the viewpoint of twisted modulation for waveform communication.\nIn particular, we study communication systems where the parameter to be\nestimated is conveyed as the initial condition of a chaotic dynamical system of\na certain class and we examine its estimation performance in terms of the\nexpectation of a given convex function of the estimation error at high SNR,\nunder the demand that the probability of anomaly is kept small. We derive a\nlower bound on the weak-noise estimation error for this class of chaotic\nmodulators, and argue that it can be outperformed by using the itinerary signal\nassociated with the chaotic system instead of the main chaotic output signal.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:45:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Merhav","Neri",""]]}
{"id":"2308.00507","submitter":"Hexin Dong","authors":"Hexin Dong, Jiawen Yao, Yuxing Tang, Mingze Yuan, Yingda Xia, Jian\n  Zhou, Hong Lu, Jingren Zhou, Bin Dong, Le Lu, Li Zhang, Zaiyi Liu, Yu Shi,\n  Ling Zhang","title":"Improved Prognostic Prediction of Pancreatic Cancer Using Multi-Phase CT\n  by Integrating Neural Distance and Texture-Aware Transformer","comments":"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":"  Pancreatic ductal adenocarcinoma (PDAC) is a highly lethal cancer in which\nthe tumor-vascular involvement greatly affects the resectability and, thus,\noverall survival of patients. However, current prognostic prediction methods\nfail to explicitly and accurately investigate relationships between the tumor\nand nearby important vessels. This paper proposes a novel learnable neural\ndistance that describes the precise relationship between the tumor and vessels\nin CT images of different patients, adopting it as a major feature for\nprognosis prediction. Besides, different from existing models that used CNNs or\nLSTMs to exploit tumor enhancement patterns on dynamic contrast-enhanced CT\nimaging, we improved the extraction of dynamic tumor-related texture features\nin multi-phase contrast-enhanced CT by fusing local and global features using\nCNN and transformer modules, further enhancing the features extracted across\nmulti-phase CT images. We extensively evaluated and compared the proposed\nmethod with existing methods in the multi-center (n=4) dataset with 1,070\npatients with PDAC, and statistical analysis confirmed its clinical\neffectiveness in the external test set consisting of three centers. The\ndeveloped risk marker was the strongest predictor of overall survival among\npreoperative factors and it has the potential to be combined with established\nclinical factors to select patients at higher risk who might benefit from\nneoadjuvant therapy.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:46:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dong","Hexin",""],["Yao","Jiawen",""],["Tang","Yuxing",""],["Yuan","Mingze",""],["Xia","Yingda",""],["Zhou","Jian",""],["Lu","Hong",""],["Zhou","Jingren",""],["Dong","Bin",""],["Lu","Le",""],["Zhang","Li",""],["Liu","Zaiyi",""],["Shi","Yu",""],["Zhang","Ling",""]]}
{"id":"2308.00508","submitter":"Tiancheng Lin","authors":"Jinglei Zhang, Tiancheng Lin, Yi Xu, Kai Chen, Rui Zhang","title":"Relational Contrastive Learning for Scene Text Recognition","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context-aware methods achieved great success in supervised scene text\nrecognition via incorporating semantic priors from words. We argue that such\nprior contextual information can be interpreted as the relations of textual\nprimitives due to the heterogeneous text and background, which can provide\neffective self-supervised labels for representation learning. However, textual\nrelations are restricted to the finite size of dataset due to lexical\ndependencies, which causes the problem of over-fitting and compromises\nrepresentation robustness. To this end, we propose to enrich the textual\nrelations via rearrangement, hierarchy and interaction, and design a unified\nframework called RCLSTR: Relational Contrastive Learning for Scene Text\nRecognition. Based on causality, we theoretically explain that three modules\nsuppress the bias caused by the contextual prior and thus guarantee\nrepresentation robustness. Experiments on representation quality show that our\nmethod outperforms state-of-the-art self-supervised STR methods. Code is\navailable at https://github.com/ThunderVVV/RCLSTR.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:46:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Jinglei",""],["Lin","Tiancheng",""],["Xu","Yi",""],["Chen","Kai",""],["Zhang","Rui",""]]}
{"id":"2308.00509","submitter":"Xiao Han","authors":"Xiao Han","title":"On the Analysis of Boolean Functions and Fourier-Entropy-Influence\n  Conjecture","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This manuscript includes some classical results we select apart from the new\nresults we've found on the Analysis of Boolean Functions and\nFourier-Entropy-Influence conjecture. We try to ensure the self-completeness of\nthis work so that readers could probably read it independently. Among the new\nresults, what is the most remarkable is that we prove that the entropy of a\nboolean function $f$ could be upper bounded by $O(I(f))+O(\\sum_{k}I_k(f)\\log\n(1/I_k(f)))$. This is possibly the only untrivial bound for the entropy up to\nnow.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:47:35 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 05:47:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Han","Xiao",""]]}
{"id":"2308.00510","submitter":"Daniel Sheward MSc FRAS","authors":"Daniel Sheward, Marco Delbo, Chrysa Avdellidou, Anthony Cook, Philippe\n  Lognonn\\'e, Edhah Munaibari, Luigi Zanatta, Antonio Mercatali, Silvano Delbo,\n  Paolo Tanga","title":"Extending Lunar Impact Flash Observations into the Daytime with\n  Short-Wave Infrared","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lunar impact flash (LIF) observations typically occur in R, I, or unfiltered\nlight, and are only possible during night, targeting the night side of a 10-60%\nillumination Moon, while >10{\\deg} above the observers horizon. This severely\nlimits the potential to observe, and therefore the number of lower occurrence,\nhigh energy impacts observed is reduced. By shifting from the typically used\nwavelengths to the J-Band Short-Wave Infrared, the greater spectral radiance\nfor the most common temperature (2750 K) of LIFs and darker skies at these\nwavelengths enables LIF monitoring to occur during the daytime, and at greater\nlunar illumination phases than currently possible. Using a 40.0 cm f/4.5\nNewtonian reflector with Ninox 640SU camera and J-band filter, we observed\nseveral stars and lunar nightside at various times to assess the theoretical\nlimits of the system. We then performed LIF observations during both day and\nnight to maximise the chances of observing a confirmed LIF to verify the\nmethods. We detected 61 >5{\\sigma} events, from which 33 candidate LIF events\ncould not be discounted as false positives. One event was confirmed by\nmulti-frame detection, and by independent observers observing in visible light.\nWhile this LIF was observed during the night, the observed signal can be used\nto calculate the equivalent Signal-to-Noise ratio for a similar daytime event.\nThe threshold for daylight LIF detection was found to be between\nJmag=+3.4+-0.18 and Jmag=+5.6+-0.18 (Vmag=+4.5 and Vmag=+6.7 respectively at\n2750 K). This represents an increase in opportunity to observe LIFs by almost\n500%.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:47:36 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 12:02:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sheward","Daniel",""],["Delbo","Marco",""],["Avdellidou","Chrysa",""],["Cook","Anthony",""],["Lognonn\u00e9","Philippe",""],["Munaibari","Edhah",""],["Zanatta","Luigi",""],["Mercatali","Antonio",""],["Delbo","Silvano",""],["Tanga","Paolo",""]]}
{"id":"2308.00511","submitter":"Manjit Kaur Dr.","authors":"Rashi Sharma, R. Aggarwal and M. Kaur","title":"Updated Trends in Neutrino-induced hadron production","comments":"11 pages, 11 figures, 6 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With four different type of neutrino-induced interactions, we considered to\ninvestigate and reanalyse the KNO scaling in modified multiplicity\ndistributions from a different perspective. In an attempt of first of its kind,\nwe propose alternate fitting function to parameterise the distribution than the\nmost widely adopted Slattery's function and compare it with yet another form.\nWe propose the shifted Gompertz and Weibull functions as the fitting functions\nand compare their potency for the most conventional form of Slattery's\nfunction. In addition the analysis of the data by evaluating the central\nmoments and factorial moments, we show the dependence of moments on the target\nsize.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:49:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sharma","Rashi",""],["Aggarwal","R.",""],["Kaur","M.",""]]}
{"id":"2308.00512","submitter":"Andronick Arutyunov","authors":"Andronick Arutyunov and Igor Zhiltsov","title":"Grading Structure for Derivations of Group Algebras","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper we give a way of equipping the derivation algebra of a group\nalgebra with the structure of a graded algebra. The derived group is used as\nthe grading group. For the proof, the identification of the derivation with the\ncharacters of the adjoint action groupoid is used. These results also allow us\nto obtain the analogous structure of a graded algebra for outer derivations. A\nnon-trivial graduation is obtained for all groups that are not perfect.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:53:37 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Arutyunov","Andronick",""],["Zhiltsov","Igor",""]]}
{"id":"2308.00513","submitter":"Giulio Delama","authors":"Giulio Delama, Farhad Shamsfakhr, Stephan Weiss, Daniele Fontanelli\n  and Alessandro Fornasier","title":"UVIO: An UWB-Aided Visual-Inertial Odometry Framework with\n  Bias-Compensated Anchors Initialization","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 UVIO, a multi-sensor framework that leverages Ultra\nWide Band (UWB) technology and Visual-Inertial Odometry (VIO) to provide robust\nand low-drift localization. In order to include range measurements in state\nestimation, the position of the UWB anchors must be known. This study proposes\na multi-step initialization procedure to map multiple unknown anchors by an\nUnmanned Aerial Vehicle (UAV), in a fully autonomous fashion. To address the\nlimitations of initializing UWB anchors via a random trajectory, this paper\nuses the Geometric Dilution of Precision (GDOP) as a measure of optimality in\nanchor position estimation, to compute a set of optimal waypoints and\nsynthesize a trajectory that minimizes the mapping uncertainty. After the\ninitialization is complete, the range measurements from multiple anchors,\nincluding measurement biases, are tightly integrated into the VIO system. While\nin range of the initialized anchors, the VIO drift in position and heading is\neliminated. The effectiveness of UVIO and our initialization procedure has been\nvalidated through a series of simulations and real-world experiments.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:53:43 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Delama","Giulio",""],["Shamsfakhr","Farhad",""],["Weiss","Stephan",""],["Fontanelli","Daniele",""],["Fornasier","Alessandro",""]]}
{"id":"2308.00514","submitter":"Daniella Tola","authors":"Daniella Tola and Peter Corke","title":"Understanding URDF: A Dataset and Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the complexity of robot systems increases, it becomes more effective to\nsimulate them before deployment. To do this, a model of the robot's kinematics\nor dynamics is required, and the most commonly used format is the Unified Robot\nDescription Format (URDF). This article presents, to our knowledge, the first\ndataset of URDF files from various industrial and research organizations, with\nmetadata describing each robot, its type, manufacturer, and the source of the\nmodel. The dataset contains 322 URDF files of which 195 are unique robot\nmodels, meaning the excess URDFs are either of a robot that is multiply defined\nacross sources or URDF variants of the same robot. We analyze the files in the\ndataset, where we, among other things, provide information on how they were\ngenerated, which mesh file types are most commonly used, and compare models of\nmultiply defined robots. The intention of this article is to build a foundation\nof knowledge on URDF and how it is used based on publicly available URDF files.\nPublishing the dataset, analysis, and the scripts and tools used enables others\nusing, researching or developing URDFs to easily access this data and use it in\ntheir own work.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:54:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Tola","Daniella",""],["Corke","Peter",""]]}
{"id":"2308.00515","submitter":"Ruth Jacobs","authors":"H. Abramowicz, M. Almanza Soto, M. Altarelli, R. A{\\ss}mann, A.\n  Athanassiadis, G. Avoni, T. Behnke, M. Benettoni, Y. Benhammou, J. Bhatt, T.\n  Blackburn, C. Blanch, S. Bonaldo, S. Boogert, O. Borysov, M. Borysova, V.\n  Boudry, D. Breton, R. Brinkmann, M. Bruschi, F. Burkart, K. B\\\"u{\\ss}er, N.\n  Cavanagh, F. Dal Corso, W. Decking, M. Deniaud, O. Diner, U. Dosselli, M.\n  Elad, L. Epshteyn, D. Esperante, T. Ferber, M. Firlej, T. Fiutowski, K.\n  Fleck, N. Fuster-Martinez, K. Gadow, F. Gaede, A. Gallas, H. Garcia Cabrera,\n  E. Gerstmayr, V. Ghenescu, M. Giorato, N. Golubeva, C. Grojean, P. Grutta, G.\n  Grzelak, J. Hallford, L. Hartman, B. Heinemann, T. Heinzl, L. Helary, L.\n  Hendriks, M. Hoffmann, D. Horn, S. Huang, X. Huang, M. Idzik, A. Irles, R.\n  Jacobs, B. King, M. Klute, A. Kropf, E. Kroupp, H. Lahno, F. Lasagni Manghi,\n  J. Lawhorn, A. Levanon, A. Levi, L. Levinson, A. Levy, I. Levy, A. Liberman,\n  B. Liss, B. List, J. List, W. Lohmann, J. Maalmi, T. Madlener, V. Malka, T.\n  Marsault, S. Mattiazzo, F. Meloni, D. Miron, M. Morandin, J. Moro\\'n, J.\n  Nanni, A.T. Neagu, E. Negodin, A. Paccagnella, D. Pantano, D. Pietruch, I.\n  Pomerantz, R. P\\\"oschl, P.M. Potlog, R. Prasad, R. Quishpe, E. Ranken, A.\n  Ringwald, A. Roich, F. Salgado, A. Santra, G. Sarri, A. S\\\"avert, A. Sbrizzi,\n  S. Schmitt, I. Schulthess, S. Schuwalow, D. Seipt, G. Simi, Y. Soreq, D.\n  Spataro, M. Streeter, K. Swientek, N. Tal Hod, T. Teter, A. Thiebault, D.\n  Thoden, N. Trevisani, R. Urmanov, S. Vasiukov, S. Walker, M. Warren, M. Wing,\n  Y.C. Yap, N. Zadok, M. Zanetti, A.F.\\.Zarnecki, P. Zbi\\'nkowski, K.\n  Zembaczy\\'nski, M. Zepf, D. Zerwas, W. Ziegler, M. Zuffa","title":"Technical Design Report for the LUXE Experiment","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":"  This Technical Design Report presents a detailed description of all aspects\nof the LUXE (Laser Und XFEL Experiment), an experiment that will combine the\nhigh-quality and high-energy electron beam of the European XFEL with a\nhigh-intensity laser, to explore the uncharted terrain of strong-field quantum\nelectrodynamics characterised by both high energy and high intensity, reaching\nthe Schwinger field and beyond. The further implications for the search of\nphysics beyond the Standard Model are also discussed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:54:30 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 08:36:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Abramowicz","H.",""],["Soto","M. Almanza",""],["Altarelli","M.",""],["A\u00dfmann","R.",""],["Athanassiadis","A.",""],["Avoni","G.",""],["Behnke","T.",""],["Benettoni","M.",""],["Benhammou","Y.",""],["Bhatt","J.",""],["Blackburn","T.",""],["Blanch","C.",""],["Bonaldo","S.",""],["Boogert","S.",""],["Borysov","O.",""],["Borysova","M.",""],["Boudry","V.",""],["Breton","D.",""],["Brinkmann","R.",""],["Bruschi","M.",""],["Burkart","F.",""],["B\u00fc\u00dfer","K.",""],["Cavanagh","N.",""],["Corso","F. Dal",""],["Decking","W.",""],["Deniaud","M.",""],["Diner","O.",""],["Dosselli","U.",""],["Elad","M.",""],["Epshteyn","L.",""],["Esperante","D.",""],["Ferber","T.",""],["Firlej","M.",""],["Fiutowski","T.",""],["Fleck","K.",""],["Fuster-Martinez","N.",""],["Gadow","K.",""],["Gaede","F.",""],["Gallas","A.",""],["Cabrera","H. Garcia",""],["Gerstmayr","E.",""],["Ghenescu","V.",""],["Giorato","M.",""],["Golubeva","N.",""],["Grojean","C.",""],["Grutta","P.",""],["Grzelak","G.",""],["Hallford","J.",""],["Hartman","L.",""],["Heinemann","B.",""],["Heinzl","T.",""],["Helary","L.",""],["Hendriks","L.",""],["Hoffmann","M.",""],["Horn","D.",""],["Huang","S.",""],["Huang","X.",""],["Idzik","M.",""],["Irles","A.",""],["Jacobs","R.",""],["King","B.",""],["Klute","M.",""],["Kropf","A.",""],["Kroupp","E.",""],["Lahno","H.",""],["Manghi","F. Lasagni",""],["Lawhorn","J.",""],["Levanon","A.",""],["Levi","A.",""],["Levinson","L.",""],["Levy","A.",""],["Levy","I.",""],["Liberman","A.",""],["Liss","B.",""],["List","B.",""],["List","J.",""],["Lohmann","W.",""],["Maalmi","J.",""],["Madlener","T.",""],["Malka","V.",""],["Marsault","T.",""],["Mattiazzo","S.",""],["Meloni","F.",""],["Miron","D.",""],["Morandin","M.",""],["Moro\u0144","J.",""],["Nanni","J.",""],["Neagu","A. T.",""],["Negodin","E.",""],["Paccagnella","A.",""],["Pantano","D.",""],["Pietruch","D.",""],["Pomerantz","I.",""],["P\u00f6schl","R.",""],["Potlog","P. M.",""],["Prasad","R.",""],["Quishpe","R.",""],["Ranken","E.",""],["Ringwald","A.",""],["Roich","A.",""],["Salgado","F.",""],["Santra","A.",""],["Sarri","G.",""],["S\u00e4vert","A.",""],["Sbrizzi","A.",""],["Schmitt","S.",""],["Schulthess","I.",""],["Schuwalow","S.",""],["Seipt","D.",""],["Simi","G.",""],["Soreq","Y.",""],["Spataro","D.",""],["Streeter","M.",""],["Swientek","K.",""],["Hod","N. Tal",""],["Teter","T.",""],["Thiebault","A.",""],["Thoden","D.",""],["Trevisani","N.",""],["Urmanov","R.",""],["Vasiukov","S.",""],["Walker","S.",""],["Warren","M.",""],["Wing","M.",""],["Yap","Y. C.",""],["Zadok","N.",""],["Zanetti","M.",""],["\u017barnecki","A. F.",""],["Zbi\u0144kowski","P.",""],["Zembaczy\u0144ski","K.",""],["Zepf","M.",""],["Zerwas","D.",""],["Ziegler","W.",""],["Zuffa","M.",""]]}
{"id":"2308.00516","submitter":"Francesco Pedrotti","authors":"Francesco Pedrotti","title":"Contractive coupling rates and curvature lower bounds for Markov chains","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contractive coupling rates have been recently introduced by Conforti as a\ntool to establish convex Sobolev inequalities (including modified log-Sobolev\nand Poincar\\'{e} inequality) for some classes of Markov chains. In this work,\nwe show how contractive coupling rates can also be used to prove stronger\ninequalities, in the form of curvature lower bounds for Markov chains and\ngeodesic convexity of entropic functionals. We illustrate this in several\nexamples discussed by Conforti, where in particular, after appropriately\nchoosing a parameter function, we establish positive curvature in the entropic\nand (discrete) Bakry--\\'{E}mery sense. In addition, we recall and give\nstraightforward generalizations of some notions of coarse Ricci curvature, and\nwe discuss some of their properties and relations with the concepts of\ncouplings and coupling rates: as an application, we show exponential\ncontraction of the $p$-Wasserstein distance for the heat flow in the\naforementioned examples.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:56:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Pedrotti","Francesco",""]]}
{"id":"2308.00517","submitter":"Andre Vieira","authors":"William G. C. Oropesa, Eduardo S. Nascimento and Andr\\'e P. Vieira","title":"Mean-field model for a mixture of biaxial nematogens and dipolar\n  nanoparticles","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":"  We analyze a mean-field model for mixtures involving biaxial nematogens and\ndipolar nanoparticles, taking into account orientational and isotropic pair\ninteractions between nematogens, but also orientational nematogen-nanoparticle\ninteractions. We determine bulk equilibrium phase diagrams for a wide range of\ninteraction strengths, identifying in each case the effect of the nanoparticles\non the stability of nematic phases and on the appearance of multicritical\npoints. Special attention is given to the limit of low concentration of\nnanoparticles, in which their effect on the temperatures of both the\nfirst-order uniaxial-isotropic and the continuous biaxial-uniaxial transitions\nis investigated in detail.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:56:38 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 19:12:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Oropesa","William G. C.",""],["Nascimento","Eduardo S.",""],["Vieira","Andr\u00e9 P.",""]]}
{"id":"2308.00518","submitter":"Andrew Bragg","authors":"Andrew D. Bragg, Stephen M. de Bruyn Kops","title":"Understanding the effect of Prandtl number on momentum and scalar mixing\n  rates in neutral and stably stratified flows using gradient field dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, direct numerical simulations (DNS) of stably stratified turbulence\nhave shown that as the Prandtl number ($Pr$) is increased from 1 to 7, the mean\nturbulent potential energy dissipation rate (TPE-DR) drops dramatically, while\nthe mean turbulent kinetic energy dissipation rate (TKE-DR) increases\nsignificantly. Through an analysis of the equations governing the fluctuating\nvelocity and density gradients we provide a mechanistic explanation for this\nsurprising behavior and test the predictions using DNS. We show that the mean\ndensity gradient gives rise to a mechanism that opposes the production of\nfluctuating density gradients, and this is connected to the emergence of\nramp-cliffs. The same term appears in the velocity gradient equation but with\nthe opposite sign, and is the contribution from buoyancy. This term is\nultimately the reason why the TPE-DR reduces while the TKE-DR increases with\nincreasing $Pr$. Our analysis also predicts that the effects of buoyancy on the\nsmallest scales of the flow become stronger as $Pr$ is increased, and this is\nconfirmed by our DNS data. A consequence of this is that the standard buoyancy\nReynolds number does not correctly estimate the impact of buoyancy at the\nsmallest scales when $Pr$ deviates from 1, and we derive a suitable alternative\nparameter. Finally, an analysis of the filtered gradient equations reveals that\nthe mean density gradient term changes sign at sufficiently large scales, such\nthat buoyancy acts as a source for velocity gradients at small scales, but as a\nsink at large scales.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:58:43 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bragg","Andrew D.",""],["Kops","Stephen M. de Bruyn",""]]}
{"id":"2308.00519","submitter":"Andrea Avogaro","authors":"Andrea Avogaro, Federico Cunico, Bodo Rosenhahn and Francesco Setti","title":"Markerless human pose estimation for biomedical applications: a survey","comments":null,"journal-ref":"Frontiers in Computer Science 5, (2023): 1153160","doi":"10.3389/fcomp.2023.1153160","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Markerless Human Pose Estimation (HPE) proved its potential to support\ndecision making and assessment in many fields of application. HPE is often\npreferred to traditional marker-based Motion Capture systems due to the ease of\nsetup, portability, and affordable cost of the technology. However, the\nexploitation of HPE in biomedical applications is still under investigation.\nThis review aims to provide an overview of current biomedical applications of\nHPE. In this paper, we examine the main features of HPE approaches and discuss\nwhether or not those features are of interest to biomedical applications. We\nalso identify those areas where HPE is already in use and present peculiarities\nand trends followed by researchers and practitioners. We include here 25\napproaches to HPE and more than 40 studies of HPE applied to motor development\nassessment, neuromuscolar rehabilitation, and gait & posture analysis. We\nconclude that markerless HPE offers great potential for extending diagnosis and\nrehabilitation outside hospitals and clinics, toward the paradigm of remote\nmedical care.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:59:07 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Avogaro","Andrea",""],["Cunico","Federico",""],["Rosenhahn","Bodo",""],["Setti","Francesco",""]]}
{"id":"2308.00520","submitter":"Zhihao Chi","authors":"Zhihao Chi, Tu Zheng, Hengjia Li, Zheng Yang, Boxi Wu, Binbin Lin,\n  Deng Cai","title":"NormKD: Normalized Logits for Knowledge Distillation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Logit based knowledge distillation gets less attention in recent years since\nfeature based methods perform better in most cases. Nevertheless, we find it\nstill has untapped potential when we re-investigate the temperature, which is a\ncrucial hyper-parameter to soften the logit outputs. For most of the previous\nworks, it was set as a fixed value for the entire distillation procedure.\nHowever, as the logits from different samples are distributed quite variously,\nit is not feasible to soften all of them to an equal degree by just a single\ntemperature, which may make the previous work transfer the knowledge of each\nsample inadequately. In this paper, we restudy the hyper-parameter temperature\nand figure out its incapability to distill the knowledge from each sample\nsufficiently when it is a single value. To address this issue, we propose\nNormalized Knowledge Distillation (NormKD), with the purpose of customizing the\ntemperature for each sample according to the characteristic of the sample's\nlogit distribution. Compared to the vanilla KD, NormKD barely has extra\ncomputation or storage cost but performs significantly better on CIRAR-100 and\nImageNet for image classification. Furthermore, NormKD can be easily applied to\nthe other logit based methods and achieve better performance which can be\ncloser to or even better than the feature based method.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:59:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chi","Zhihao",""],["Zheng","Tu",""],["Li","Hengjia",""],["Yang","Zheng",""],["Wu","Boxi",""],["Lin","Binbin",""],["Cai","Deng",""]]}
{"id":"2308.00521","submitter":"Steven Bickley","authors":"Steve J. Bickley, Ho Fai Chan, Bang Dao, Benno Torgler, Son Tran","title":"SurveyLM: A platform to explore emerging value perspectives in augmented\n  language models' behaviors","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"Panalogy Lab Technical Report 2023-001","categories":"cs.AI cs.SI econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This white paper presents our work on SurveyLM, a platform for analyzing\naugmented language models' (ALMs) emergent alignment behaviors through their\ndynamically evolving attitude and value perspectives in complex social\ncontexts. Social Artificial Intelligence (AI) systems, like ALMs, often\nfunction within nuanced social scenarios where there is no singular correct\nresponse, or where an answer is heavily dependent on contextual factors, thus\nnecessitating an in-depth understanding of their alignment dynamics. To address\nthis, we apply survey and experimental methodologies, traditionally used in\nstudying social behaviors, to evaluate ALMs systematically, thus providing\nunprecedented insights into their alignment and emergent behaviors. Moreover,\nthe SurveyLM platform leverages the ALMs' own feedback to enhance survey and\nexperiment designs, exploiting an underutilized aspect of ALMs, which\naccelerates the development and testing of high-quality survey frameworks while\nconserving resources. Through SurveyLM, we aim to shed light on factors\ninfluencing ALMs' emergent behaviors, facilitate their alignment with human\nintentions and expectations, and thereby contributed to the responsible\ndevelopment and deployment of advanced social AI systems. This white paper\nunderscores the platform's potential to deliver robust results, highlighting\nits significance to alignment research and its implications for future social\nAI systems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 12:59:36 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bickley","Steve J.",""],["Chan","Ho Fai",""],["Dao","Bang",""],["Torgler","Benno",""],["Tran","Son",""]]}
{"id":"2308.00523","submitter":"Sergey Ivanov K","authors":"S.K. Ivanov, S.A. Zhuravitskii, N.N. Skryabin, I.V. Dyakonov, A.A.\n  Kalinkin, S.P. Kulik, Y.V. Kartashov, V.V. Konotop, and V.N. Zadkov","title":"Macroscopic Zeno effect in Su-Schrieffer-Heeger photonic topological\n  insulator","comments":null,"journal-ref":"Laser & Photonics Reviews, 2023","doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The quantum Zeno effect refers to slowing down of the decay of a quantum\nsystem that is affected by frequent measurements. Nowadays, the significance of\nthis paradigm is extended far beyond quantum systems, where it was introduced,\nfinding physical and mathematical analogies in such phenomena as the\nsuppression of output beam decay by sufficiently strong absorption introduced\nin guiding optical systems. In the latter case, the effect is often termed as\nmacroscopic Zeno effect. Recent studies in optics, where enhanced transparency\nof the entire system was observed upon the increase of the absorption, were\nlargely focused on the systems obeying parity-time symmetry, hence, the\nobserved effect was attributed to the symmetry breaking. While manifesting\ncertain similarities in the behavior of the transparency of the system with the\nmentioned studies, the macroscopic Zeno phenomenon reported here in topological\nphotonic system is far more general in nature. In particular, we show that it\ndoes not require the existence of exceptional points, and that it is based on\nthe suppression of decay for only a subspace of modes that can propagate in the\nsystem, alike the quantum Zeno dynamics. By introducing controlled losses in\none of the arms of a topological insulator comprising two closely positioned\nSu-Schrieffer-Heeger arrays, we demonstrate the macroscopic Zeno effect, which\nmanifests itself in an increase of the transparency of the system with respect\nto the topological modes created at the interface between two arrays. The\nphenomenon remains robust against disorder in the non-Hermitian topological\nregime. In contrast, coupling a topological array with a non-topological one\nresults in a monotonic decrease in output power with increasing absorption.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:02:28 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ivanov","S. K.",""],["Zhuravitskii","S. A.",""],["Skryabin","N. N.",""],["Dyakonov","I. V.",""],["Kalinkin","A. A.",""],["Kulik","S. P.",""],["Kartashov","Y. V.",""],["Konotop","V. V.",""],["Zadkov","V. N.",""]]}
{"id":"2308.00524","submitter":"Dillon Hanlon","authors":"Dillon F. Hanlon, Maynard J. Clouter, and G. Todd Andrews","title":"Influence of Hydration and Dehydration on the Viscoelastic Properties of\n  Snail Mucus by Brillouin Spectroscopy","comments":"15 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":"  Brillouin spectroscopy was used to probe the viscoelastic properties of\ndiluted snail mucus at GHz frequencies over the range -11 $^\\circ$C $\\leq T\n\\leq$ 52 $^\\circ$C and of dehydrated mucus as a function of time. Two peaks\nwere observed in the spectra for diluted mucus: the longitudinal acoustic mode\nof the liquid mucus peak varies with dilution but fluctuates around the typical\nvalue of 8.0 GHz. A second peak due to ice remained unchanged with varying\ndilution and was seen at 18.0 GHz and appeared below the dilutions \"freezing\"\npoint depression. Only a single peak was found in all the dehydrated mucus\nspectra and was also attributed to the longitudinal acoustic mode of liquid\nmucus. Anomalous changes in the protein concentration dependence of the\nfrequency shift, linewidth, and ``freezing\" point depression and consequently,\nhypersound velocity, compressibility, and apparent viscosity suggest that the\nviscoelastic properties of this system is influenced by the presence of water.\nFurthermore, this research uncovered three unique transitions within the\nmolecular structure. These transitions included the first stage of glycoprotein\ncross-linking, followed by the steady depletion of free water in the system,\nand eventually resulted in the creation of a gel-like state when all remaining\nfree water was evaporated.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:04:55 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hanlon","Dillon F.",""],["Clouter","Maynard J.",""],["Andrews","G. Todd",""]]}
{"id":"2308.00525","submitter":"Abhiroop Chatterjee","authors":"Susmita Ghosh and Abhiroop Chatterjee","title":"Transfer-Ensemble Learning based Deep Convolutional Neural Networks for\n  Diabetic Retinopathy Classification","comments":"6 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article aims to classify diabetic retinopathy (DR) disease into five\ndifferent classes using an ensemble approach based on two popular pre-trained\nconvolutional neural networks: VGG16 and Inception V3. The proposed model aims\nto leverage the strengths of the two individual nets to enhance the\nclassification performance for diabetic retinopathy. The ensemble model\narchitecture involves freezing a portion of the layers in each pre-trained\nmodel to utilize their learned representations effectively. Global average\npooling layers are added to transform the output feature maps into fixed-length\nvectors. These vectors are then concatenated to form a consolidated\nrepresentation of the input image. The ensemble model is trained using a\ndataset of diabetic retinopathy images (APTOS), divided into training and\nvalidation sets. During the training process, the model learns to classify the\nretinal images into the corresponding diabetic retinopathy classes.\nExperimental results on the test set demonstrate the efficacy of the proposed\nensemble model for DR classification achieving an accuracy of 96.4%.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:07:39 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ghosh","Susmita",""],["Chatterjee","Abhiroop",""]]}
{"id":"2308.00526","submitter":"Nikos Melanitis","authors":"Nikos Melanitis and Konstantina Nikita","title":"Visual attention information can be traced on cortical response but not\n  on the retina: evidence from electrophysiological mouse data using natural\n  images as stimuli","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual attention forms the basis of understanding the visual world. In this\nwork we follow a computational approach to investigate the biological basis of\nvisual attention. We analyze retinal and cortical electrophysiological data\nfrom mouse. Visual Stimuli are Natural Images depicting real world scenes. Our\nresults show that in primary visual cortex (V1), a subset of around $10\\%$ of\nthe neurons responds differently to salient versus non-salient visual regions.\nVisual attention information was not traced in retinal response. It appears\nthat the retina remains naive concerning visual attention; cortical response\ngets modulated to interpret visual attention information. Experimental animal\nstudies may be designed to further explore the biological basis of visual\nattention we traced in this study. In applied and translational science, our\nstudy contributes to the design of improved visual prostheses systems --\nsystems that create artificial visual percepts to visually impaired individuals\nby electronic implants placed on either the retina or the cortex.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:09:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Melanitis","Nikos",""],["Nikita","Konstantina",""]]}
{"id":"2308.00527","submitter":"Alberto Facchini","authors":"Mar\\'ia Jos\\'e Arroyo Paniagua and Alberto Facchini","title":"Heaps and trusses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study commutators of congruences, idempotent endomorphisms and\nsemidirect-product decompositions of heaps and trusses.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:12:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Paniagua","Mar\u00eda Jos\u00e9 Arroyo",""],["Facchini","Alberto",""]]}
{"id":"2308.00528","submitter":"Muzhaffar Hazman","authors":"Muzhaffar Hazman, Susan McKeever, Josephine Griffith","title":"Unimodal Intermediate Training for Multimodal Meme Sentiment\n  Classification","comments":"Accepted for Publication at RANLP2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Internet Memes remain a challenging form of user-generated content for\nautomated sentiment classification. The availability of labelled memes is a\nbarrier to developing sentiment classifiers of multimodal memes. To address the\nshortage of labelled memes, we propose to supplement the training of a\nmultimodal meme classifier with unimodal (image-only and text-only) data. In\nthis work, we present a novel variant of supervised intermediate training that\nuses relatively abundant sentiment-labelled unimodal data. Our results show a\nstatistically significant performance improvement from the incorporation of\nunimodal text data. Furthermore, we show that the training set of labelled\nmemes can be reduced by 40% without reducing the performance of the downstream\nmodel.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:14:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hazman","Muzhaffar",""],["McKeever","Susan",""],["Griffith","Josephine",""]]}
{"id":"2308.00529","submitter":"Biao Liu","authors":"Biao Liu, Congyu Qiao, Ning Xu, Xin Geng, Ziran Zhu, Jun Yang","title":"Variational Label-Correlation Enhancement for Congestion Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The physical design process of large-scale designs is a time-consuming task,\noften requiring hours to days to complete, with routing being the most critical\nand complex step. As the the complexity of Integrated Circuits (ICs) increases,\nthere is an increased demand for accurate routing quality prediction. Accurate\ncongestion prediction aids in identifying design flaws early on, thereby\naccelerating circuit design and conserving resources. Despite the advancements\nin current congestion prediction methodologies, an essential aspect that has\nbeen largely overlooked is the spatial label-correlation between different\ngrids in congestion prediction. The spatial label-correlation is a fundamental\ncharacteristic of circuit design, where the congestion status of a grid is not\nisolated but inherently influenced by the conditions of its neighboring grids.\nIn order to fully exploit the inherent spatial label-correlation between\nneighboring grids, we propose a novel approach, {\\ours}, i.e., VAriational\nLabel-Correlation Enhancement for Congestion Prediction, which considers the\nlocal label-correlation in the congestion map, associating the estimated\ncongestion value of each grid with a local label-correlation weight influenced\nby its surrounding grids. {\\ours} leverages variational inference techniques to\nestimate this weight, thereby enhancing the regression model's performance by\nincorporating spatial dependencies. Experiment results validate the superior\neffectiveness of {\\ours} on the public available \\texttt{ISPD2011} and\n\\texttt{DAC2012} benchmarks using the superblue circuit line.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:15:58 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Liu","Biao",""],["Qiao","Congyu",""],["Xu","Ning",""],["Geng","Xin",""],["Zhu","Ziran",""],["Yang","Jun",""]]}
{"id":"2308.00531","submitter":"Wentao Gong","authors":"Wentao Gong, Haonan Tong, Sihua Wang, Zhaohui Yang, Xinxin He,\n  Changchuan Yin","title":"Adaptive Bitrate Video Semantic Communication over Wireless Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates the adaptive bitrate (ABR) video semantic\ncommunication over wireless networks. In the considered model, video sensing\ndevices must transmit video semantic information to an edge server, to\nfacilitate ubiquitous video sensing services such as road environment\nmonitoring at the edge server in autonomous driving scenario. However, due to\nthe varying wireless network conditions, it is challenging to guarantee both\nlow transmission delay and high semantic accuracy at the same time if devices\ncontinuously transmit a fixed bitrate video semantic information. To address\nthis challenge, we develop an adaptive bitrate video semantic communication\n(ABRVSC) system, in which devices adaptively adjust the bitrate of video\nsemantic information according to network conditions. Specifically, we first\ndefine the quality of experience (QoE) for video semantic communication.\nSubsequently, a swin transformer-based semantic codec is proposed to extract\nsemantic information with considering the influence of QoE. Then, we propose an\nActor-Critic based ABR algorithm for the semantic codec to enhance the\nrobustness of the proposed ABRVSC scheme against network variations. Simulation\nresults demonstrate that at low bitrates, the mean intersection over union\n(MIoU) of the proposed ABRVSC scheme is nearly twice that of the traditional\nscheme. Moreover, the proposed ABRVSC scheme, which increases the QoE in video\nsemantic communication by 36.57%, exhibits more robustness against network\nvariations compared to both the fixed bitrate schemes and traditional ABR\nschemes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:25:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gong","Wentao",""],["Tong","Haonan",""],["Wang","Sihua",""],["Yang","Zhaohui",""],["He","Xinxin",""],["Yin","Changchuan",""]]}
{"id":"2308.00532","submitter":"Claudio Basilio Caporusso","authors":"C. B. Caporusso, G. Negro, A. Suma, P. Digregorio, L. N. Carenza, G.\n  Gonnella, L. F. Cugliandolo","title":"Phase Behaviour and Dynamics of Three-Dimensional Active Dumbbell\n  Systems","comments":"15 pages, 11 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 present a comprehensive numerical study of the phase behavior and dynamics\nof a three-dimensional active dumbbell system with attractive interactions. We\ndemonstrate that attraction is essential for the system to exhibit nontrivial\nphases.We construct a detailed phase diagram by exploring the effects of the\nsystem's activity, density, and attraction strength. We identify several\ndistinct phases, including a disordered, a gel, and a completely\nphase-separated phase. Additionally, we discover a novel dynamical phase, that\nwe name percolating network, which is characterized by the presence of a\nspanning network of connected dumbbells. In the phase-separated phase we\ncharacterize numerically and describe analytically the helical motion of the\ndense cluster.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:25:23 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Caporusso","C. B.",""],["Negro","G.",""],["Suma","A.",""],["Digregorio","P.",""],["Carenza","L. N.",""],["Gonnella","G.",""],["Cugliandolo","L. F.",""]]}
{"id":"2308.00533","submitter":"Renteng Yuan","authors":"Renteng Yuan, Mohamed Abdel-Aty, Qiaojun Xiang, Zijin Wang, Ou Zheng","title":"A Novel Temporal Multi-Gate Mixture-of-Experts Approach for Vehicle\n  Trajectory and Driving Intention Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate Vehicle Trajectory Prediction is critical for automated vehicles and\nadvanced driver assistance systems. Vehicle trajectory prediction consists of\ntwo essential tasks, i.e., longitudinal position prediction and lateral\nposition prediction. There is a significant correlation between driving\nintentions and vehicle motion. In existing work, the three tasks are often\nconducted separately without considering the relationships between the\nlongitudinal position, lateral position, and driving intention. In this paper,\nwe propose a novel Temporal Multi-Gate Mixture-of-Experts (TMMOE) model for\nsimultaneously predicting the vehicle trajectory and driving intention. The\nproposed model consists of three layers: a shared layer, an expert layer, and a\nfully connected layer. In the model, the shared layer utilizes Temporal\nConvolutional Networks (TCN) to extract temporal features. Then the expert\nlayer is built to identify different information according to the three tasks.\nMoreover, the fully connected layer is used to integrate and export prediction\nresults. To achieve better performance, uncertainty algorithm is used to\nconstruct the multi-task loss function. Finally, the publicly available CitySim\ndataset validates the TMMOE model, demonstrating superior performance compared\nto the LSTM model, achieving the highest classification and regression results.\nKeywords: Vehicle trajectory prediction, driving intentions Classification,\nMulti-task\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:26:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Yuan","Renteng",""],["Abdel-Aty","Mohamed",""],["Xiang","Qiaojun",""],["Wang","Zijin",""],["Zheng","Ou",""]]}
{"id":"2308.00534","submitter":"Cristina Gavazzoni","authors":"Iara Patr\\'icia da Silva Ramos, Cristina Gavazzoni, Davi Lazzari and\n  Carolina Brito","title":"Hierarchical structured surfaces enhance the contact angle of the\n  hydrophobic (meta-stable) state","comments":"10 pages, 7 figures","journal-ref":null,"doi":"10.1063/5.0146948","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The relation between wetting properties and geometric parameters of fractal\nsurfaces are widely discussed on the literature and, however, there are still\ndivergences on this topic. Here we propose a simple theoretical model to\ndescribe the wetting properties of a droplet of water placed on a hierarchical\nstructured surface and test the predictions of the model and the dependence of\nthe droplet wetting state on the initial conditions using simulation of the\n3-spin Potts model. We show that increasing the auto-similarity level of the\nhierarchy -- called $n$ -- does not affect considerably the stable wetting\nstate of the droplet but increases its contact angle. Simulations also explicit\nthe existence of metastable states on this type of surfaces and shows that,\nwhen $n$ increases, the metastability becomes more pronounced. Finally we show\nthat the fractal dimension of the surface is not a good predictor of the\ncontact angle of the droplet.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:27:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ramos","Iara Patr\u00edcia da Silva",""],["Gavazzoni","Cristina",""],["Lazzari","Davi",""],["Brito","Carolina",""]]}
{"id":"2308.00535","submitter":"Cheng Wu","authors":"Cheng Wu, Chaokun Wang, Jingcao Xu, Ziyang Liu, Kai Zheng, Xiaowei\n  Wang, Yang Song, Kun Gai","title":"Graph Contrastive Learning with Generative Adversarial Network","comments":"KDD 2023","journal-ref":null,"doi":"10.1145/3580305.3599370","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Graph Neural Networks (GNNs) have demonstrated promising results on\nexploiting node representations for many downstream tasks through supervised\nend-to-end training. To deal with the widespread label scarcity issue in\nreal-world applications, Graph Contrastive Learning (GCL) is leveraged to train\nGNNs with limited or even no labels by maximizing the mutual information\nbetween nodes in its augmented views generated from the original graph.\nHowever, the distribution of graphs remains unconsidered in view generation,\nresulting in the ignorance of unseen edges in most existing literature, which\nis empirically shown to be able to improve GCL's performance in our\nexperiments. To this end, we propose to incorporate graph generative\nadversarial networks (GANs) to learn the distribution of views for GCL, in\norder to i) automatically capture the characteristic of graphs for\naugmentations, and ii) jointly train the graph GAN model and the GCL model.\nSpecifically, we present GACN, a novel Generative Adversarial Contrastive\nlearning Network for graph representation learning. GACN develops a view\ngenerator and a view discriminator to generate augmented views automatically in\nan adversarial style. Then, GACN leverages these views to train a GNN encoder\nwith two carefully designed self-supervised learning losses, including the\ngraph contrastive loss and the Bayesian personalized ranking Loss. Furthermore,\nwe design an optimization framework to train all GACN modules jointly.\nExtensive experiments on seven real-world datasets show that GACN is able to\ngenerate high-quality augmented views for GCL and is superior to twelve\nstate-of-the-art baseline methods. Noticeably, our proposed GACN surprisingly\ndiscovers that the generated views in data augmentation finally conform to the\nwell-known preferential attachment rule in online networks.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:28:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wu","Cheng",""],["Wang","Chaokun",""],["Xu","Jingcao",""],["Liu","Ziyang",""],["Zheng","Kai",""],["Wang","Xiaowei",""],["Song","Yang",""],["Gai","Kun",""]]}
{"id":"2308.00536","submitter":"Alden Waters","authors":"Alden Waters and Yan-Long Fang","title":"Dispersive Estimates for Maxwell's Equations in the Exterior of a Sphere","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The goal of this article is to establish general principles for high\nfrequency dispersive estimates for the $p$-form Laplacian with relative\nboundary conditions on co-closed forms. In dimension $3$ for the case $p=1$, we\nshow that the propagator corresponding to Maxwell's equations on compactly\nsupported co-closed forms satisfies the same dispersive estimates as in\n$\\mathbb{R}^3$ for the corresponding wave equation in the exterior of a ball --\nbut only for certain polarizations. In particular we show that some, but not\nall, polarizations of electromagnetic waves scatter at the same rate as the\nusual wave equation and this rate is not expected to hold in general. The\nDirichlet Laplacian wave equation $L^1-L^{\\infty}$ scattering rate does not\nhold true for the $1-$form Laplacian with relative boundary conditions by\nitself in the exterior of a sphere, or any smooth obstacle for that matter. We\nalso do not expect it to hold in general for Maxwell's equations because of the\npresence of $L^2$ harmonic $1$ forms.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:29:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Waters","Alden",""],["Fang","Yan-Long",""]]}
{"id":"2308.00537","submitter":"Xin Chen","authors":"Zijian Lv, Xin Chen, Zijian Feng","title":"Graph Embedding Dynamic Feature-based Supervised Contrastive Learning of\n  Transient Stability for Changing Power Grid Topologies","comments":"This work has been submitted to the IEEE Transactions on Power\n  Systems for possible publication. Copyright may be transferred without\n  notice, after which this version may no longer be accessible","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":"  Accurate online transient stability prediction is critical for ensuring power\nsystem stability when facing disturbances. While traditional transient stablity\nanalysis replies on the time domain simulations can not be quickly adapted to\nthe power grid toplogy change. In order to vectorize high-dimensional power\ngrid topological structure information into low-dimensional node-based graph\nembedding streaming data, graph embedding dynamic feature (GEDF) has been\nproposed. The transient stability GEDF-based supervised contrastive learning\n(GEDF-SCL) model uses supervised contrastive learning to predict transient\nstability with GEDFs, considering power grid topology information. To evaluate\nthe performance of the proposed GEDF-SCL model, power grids of varying\ntopologies were generated based on the IEEE 39-bus system model. Transient\noperational data was obtained by simulating N-1 and N-$\\bm{m}$-1 contingencies\non these generated power system topologies. Test result demonstrated that the\nGEDF-SCL model can achieve high accuracy in transient stability prediction and\nadapt well to changing power grid topologies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:30:36 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lv","Zijian",""],["Chen","Xin",""],["Feng","Zijian",""]]}
{"id":"2308.00538","submitter":"Lala Shakti Swarup Ray","authors":"Lala Shakti Swarup Ray, Vitor Fortes Rey, Bo Zhou, Sungho Suh, Paul\n  Lukowicz","title":"PressureTransferNet: Human Attribute Guided Dynamic Ground Pressure\n  Profile Transfer using 3D simulated Pressure Maps","comments":"Activity and Behavior Computing 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose PressureTransferNet, a novel method for Human Activity Recognition\n(HAR) using ground pressure information. Our approach generates body-specific\ndynamic ground pressure profiles for specific activities by leveraging existing\npressure data from different individuals. PressureTransferNet is an\nencoder-decoder model taking a source pressure map and a target human attribute\nvector as inputs, producing a new pressure map reflecting the target attribute.\nTo train the model, we use a sensor simulation to create a diverse dataset with\nvarious human attributes and pressure profiles. Evaluation on a real-world\ndataset shows its effectiveness in accurately transferring human attributes to\nground pressure profiles across different scenarios. We visually confirm the\nfidelity of the synthesized pressure shapes using a physics-based deep learning\nmodel and achieve a binary R-square value of 0.79 on areas with ground contact.\nValidation through classification with F1 score (0.911$\\pm$0.015) on physical\npressure mat data demonstrates the correctness of the synthesized pressure\nmaps, making our method valuable for data augmentation, denoising, sensor\nsimulation, and anomaly detection. Applications span sports science,\nrehabilitation, and bio-mechanics, contributing to the development of HAR\nsystems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:31:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ray","Lala Shakti Swarup",""],["Rey","Vitor Fortes",""],["Zhou","Bo",""],["Suh","Sungho",""],["Lukowicz","Paul",""]]}
{"id":"2308.00539","submitter":"Vasileios Perifanis","authors":"Vasileios Perifanis, Ioanna Michailidi, Giorgos Stamatelatos, George\n  Drosatos, Pavlos S. Efraimidis","title":"Predicting Early Dropouts of an Active and Healthy Ageing App","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 this work, we present a machine learning approach for predicting early\ndropouts of an active and healthy ageing app. The presented algorithms have\nbeen submitted to the IFMBE Scientific Challenge 2022, part of IUPESM WC 2022.\nWe have processed the given database and generated seven datasets. We used\npre-processing techniques to construct classification models that predict the\nadherence of users using dynamic and static features. We submitted 11 official\nruns and our results show that machine learning algorithms can provide\nhigh-quality adherence predictions. Based on the results, the dynamic features\npositively influence a model's classification performance. Due to the\nimbalanced nature of the dataset, we employed oversampling methods such as\nSMOTE and ADASYN to improve the classification performance. The oversampling\napproaches led to a remarkable improvement of 10\\%. Our methods won first place\nin the IFMBE Scientific Challenge 2022.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:32:07 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Perifanis","Vasileios",""],["Michailidi","Ioanna",""],["Stamatelatos","Giorgos",""],["Drosatos","George",""],["Efraimidis","Pavlos S.",""]]}
{"id":"2308.00540","submitter":"Natalie Lang","authors":"Natalie Lang, Nir Shlezinger, Rafael G. L. D'Oliveira and Salim El\n  Rouayheb","title":"Compressed Private Aggregation for Scalable and Robust Federated\n  Learning over Massive Networks","comments":"arXiv admin note: text overlap with arXiv:2208.10888","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) is an emerging paradigm that allows a central server\nto train machine learning models using remote users' data. Despite its growing\npopularity, FL faces challenges in preserving the privacy of local datasets,\nits sensitivity to poisoning attacks by malicious users, and its communication\noverhead. The latter is additionally considerably dominant in large-scale\nnetworks. These limitations are often individually mitigated by local\ndifferential privacy (LDP) mechanisms, robust aggregation, compression, and\nuser selection techniques, which typically come at the cost of accuracy. In\nthis work, we present compressed private aggregation (CPA), that allows massive\ndeployments to simultaneously communicate at extremely low bit rates while\nachieving privacy, anonymity, and resilience to malicious users. CPA randomizes\na codebook for compressing the data into a few bits using nested lattice\nquantizers, while ensuring anonymity and robustness, with a subsequent\nperturbation to hold LDP. The proposed CPA is proven to result in FL\nconvergence in the same asymptotic rate as FL without privacy, compression, and\nrobustness considerations, while satisfying both anonymity and LDP\nrequirements. These analytical properties are empirically confirmed in a\nnumerical study, where we demonstrate the performance gains of CPA compared\nwith separate mechanisms for compression and privacy for training different\nimage classification models, as well as its robustness in mitigating the\nharmful effects of malicious users.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:36:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lang","Natalie",""],["Shlezinger","Nir",""],["D'Oliveira","Rafael G. L.",""],["Rouayheb","Salim El",""]]}
{"id":"2308.00541","submitter":"Mikolaj Czerkawski","authors":"Mikolaj Czerkawski, Robert Atkinson, Christos Tachtatzis","title":"Detecting Cloud Presence in Satellite Images Using the RGB-based CLIP\n  Vision-Language Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work explores capabilities of the pre-trained CLIP vision-language model\nto identify satellite images affected by clouds. Several approaches to using\nthe model to perform cloud presence detection are proposed and evaluated,\nincluding a purely zero-shot operation with text prompts and several\nfine-tuning approaches. Furthermore, the transferability of the methods across\ndifferent datasets and sensor types (Sentinel-2 and Landsat-8) is tested. The\nresults that CLIP can achieve non-trivial performance on the cloud presence\ndetection task with apparent capability to generalise across sensing modalities\nand sensing bands. It is also found that a low-cost fine-tuning stage leads to\na strong increase in true negative rate. The results demonstrate that the\nrepresentations learned by the CLIP model can be useful for satellite image\nprocessing tasks involving clouds.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:36:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Czerkawski","Mikolaj",""],["Atkinson","Robert",""],["Tachtatzis","Christos",""]]}
{"id":"2308.00542","submitter":"Xinran Zheng","authors":"Xinran Zheng, Shuo Yang, Xingjun Wang","title":"SF-IDS: An Imbalanced Semi-Supervised Learning Framework for\n  Fine-grained Intrusion Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning-based fine-grained network intrusion detection systems (NIDS)\nenable different attacks to be responded to in a fast and targeted manner with\nthe help of large-scale labels. However, the cost of labeling causes\ninsufficient labeled samples. Also, the real fine-grained traffic shows a\nlong-tailed distribution with great class imbalance. These two problems often\nappear simultaneously, posing serious challenges to fine-grained NIDS. In this\nwork, we propose a novel semi-supervised fine-grained intrusion detection\nframework, SF-IDS, to achieve attack classification in the label-limited and\nhighly class imbalanced case. We design a self-training backbone model called\nRI-1DCNN to boost the feature extraction by reconstructing the input samples\ninto a multichannel image format. The uncertainty of the generated\npseudo-labels is evaluated and used as a reference for pseudo-label filtering\nin combination with the prediction probability. To mitigate the effects of\nfine-grained class imbalance, we propose a hybrid loss function combining\nsupervised contrastive loss and multi-weighted classification loss to obtain\nmore compact intra-class features and clearer inter-class intervals.\nExperiments show that the proposed SF-IDS achieves 3.01% and 2.71% Marco-F1\nimprovement on two classical datasets with 1% labeled, respectively.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:36:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zheng","Xinran",""],["Yang","Shuo",""],["Wang","Xingjun",""]]}
{"id":"2308.00543","submitter":"Xiao Shen","authors":"Xiao Shen, Na Zhao, and Yuan Shen","title":"On the Performance Tradeoff of an ISAC System with Finite Blocklength","comments":"Accepted by ICC 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":"  Integrated sensing and communication (ISAC) has been proposed as a promising\nparadigm in the future wireless networks, where the spectral and hardware\nresources are shared to provide a considerable performance gain. It is\nessential to understand how sensing and communication (S\\&C) influences each\nother to guide the practical algorithm and system design in ISAC. In this\npaper, we investigate the performance tradeoff between S\\&C in a single-input\nsingle-output (SISO) ISAC system with finite blocklength. In particular, we\npresent the system model and the ISAC scheme, after which the rate-error\ntradeoff is introduced as the performance metric. Then we derive the\nachievability and converse bounds for the rate-error tradeoff, determining the\nboundary of the joint S\\&C performance. Furthermore, we develop the asymptotic\nanalysis at large blocklength regime, where the performance tradeoff between\nS\\&C is proved to vanish as the blocklength tends to infinity. Finally, our\ntheoretical analysis is consolidated by simulation results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:39:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shen","Xiao",""],["Zhao","Na",""],["Shen","Yuan",""]]}
{"id":"2308.00544","submitter":"Flavio Ronetti","authors":"Bruno Bertin-Johannet, Alexandre Popoff, Flavio Ronetti, J\\'er\\^ome\n  Rech, Thibaut Jonckheere, Laurent Raymond, Beno\\^it Gr\\'emaud, and Thierry\n  Martin","title":"Correlated two-Leviton states in the fractional quantum Hall regime","comments":"12 pages, 7 figures, all comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a two-dimensional electron system in the Laughlin sequence of the\nfractional quantum Hall regime to investigate the effect of strong correlations\non the mutual interaction between two Levitons, single-electron excitations\ngenerated by trains of quantized Lorentzian pulses. We focus on two-Leviton\nstates injected in a single period with a time separation $\\Delta t$. In the\npresence of a quantum point contact operating in the weak-backscattering\nregime, we compute the backscattered charge by means of the Keldysh technique.\nIn the limit of an infinite period and zero temperature, we show that the\nbackscattered charge for a two-Leviton state is not equal to twice the\nbackscattered charge for a single Leviton. We present an interpretation for\nthis result in terms of the wave-packet formalism for Levitons, thus proposing\nthat an effective interaction between the two Levitons is induced by the\nstrongly-correlated background. Finally, we perform numerical calculations in\nthe periodic case by using the Floquet formalism for photo-assisted transport.\nBy varying the system parameters such as pulse width, filling factor and\ntemperature we show that the value of the backscattered charge for two-Leviton\nstates is strongly dependent on the pulse separation, thus opening scenarios\nwhere the effective interaction between Levitons can be controllably tuned.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:40:44 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bertin-Johannet","Bruno",""],["Popoff","Alexandre",""],["Ronetti","Flavio",""],["Rech","J\u00e9r\u00f4me",""],["Jonckheere","Thibaut",""],["Raymond","Laurent",""],["Gr\u00e9maud","Beno\u00eet",""],["Martin","Thierry",""]]}
{"id":"2308.00545","submitter":"Dalimil Pe\\v{s}a","authors":"Agnieszka Ka{\\l}amajska, Dalimil Pe\\v{s}a, Tom\\'a\\v{s} Roskovec","title":"Nonlinear Gagliardo-Nirenberg inequality and a priori estimates for\n  nonlinear elliptic eigenvalue problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain the inequalities of the form $$\\int_{\\Omega}|\\nabla\nu(x)|^2h(u(x))\\,{\\rm d} x\\leq C\\int_{\\Omega} \\left( \\sqrt{ |P\nu(x)||\\mathcal{T}_{H}(u(x))|}\\right)^{2}h(u(x))\\, {\\rm d} x +\\Theta,$$ where\n$\\Omega\\subset \\mathbf{R}^n$ is a bounded Lipschitz domain, $u\\in W^{2,1}_{\\rm\nloc}(\\Omega)$ is nonnegative, $P$ is a uniformly elliptic operator in\nnondivergent form, ${\\cal T}_{H}(\\cdot )$ is certain transformation of the\nnonnegative continuous function $h(\\cdot)$, and $\\Theta$ is the boundary term\nwhich depends on boundary values of $u$ and $\\nabla u$, which holds under some\nadditional assumptions. We apply such inequalities to obtain a priori estimates\nfor solutions of nonlinear eigenvalue problems like $Pu=f(x)\\tau (u)$, where\n$f\\in L^1(\\Omega)$, and provide several examples dealing with $\\tau(\\cdot)$\nbeing power, power-logarithmic or exponential function. Our results are also\nlinked with several issues from the probability and potential theory like\nDouglas formulae and representation of harmonic functions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:42:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ka\u0142amajska","Agnieszka",""],["Pe\u0161a","Dalimil",""],["Roskovec","Tom\u00e1\u0161",""]]}
{"id":"2308.00546","submitter":"Lei Shi","authors":"Yingnan Zhang, Jiangmin Pan, Lei Shi","title":"Construction of 2fi-optimal row-column designs","comments":"21 page,1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Row-column factorial designs that provide unconfounded estimation of all main\neffects and the maximum number of two-factor interactions (2fi's) are called\n2fi-optimal. This issue has been paid great attention recently for its wide\napplication in industrial or physical experiments. The constructions of\n2fi-optimal two-level and three-level full factorial and fractional factorial\nrow-column designs have been proposed. However, the results for high prime\nlevel have not been achieved yet. In this paper, we develop these constructions\nby giving a theoretical construction of $s^n$ full factorial 2fi-optimal\nrow-column designs for any odd prime level $s$ and any parameter combination,\nand theoretical constructions of $s^{n-1}$ fractional factorial 2fi-optimal\nrow-column designs for any prime level $s$ and any parameter combination.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:42:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Yingnan",""],["Pan","Jiangmin",""],["Shi","Lei",""]]}
{"id":"2308.00547","submitter":"Mattia Corti","authors":"Mattia Corti, Francesca Bonizzoni, Paola F. Antonietti","title":"Structure Preserving Polytopal Discontinuous Galerkin Methods for the\n  Numerical Modeling of Neurodegenerative Diseases","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":"  Many neurodegenerative diseases are connected to the spreading of misfolded\nprionic proteins. In this paper, we analyse the process of misfolding and\nspreading of both $\\alpha$-synuclein and Amyloid-$\\beta$, related to\nParkinson's and Alzheimer's diseases, respectively. We introduce and analyze a\npositivity-preserving numerical method for the discretization of the\nFisher-Kolmogorov equation, modelling accumulation and spreading of prionic\nproteins. The proposed approximation method is based on the discontinuous\nGalerkin method on polygonal and polyhedral grids for space discretization and\non $\\vartheta-$method time integration scheme. We prove the existence of the\ndiscrete solution and a convergence result where the Implicit Euler scheme is\nemployed for time integration. We show that the proposed approach is\nstructure-preserving, in the sense that it guaranteed that the discrete\nsolution is non-negative, a feature that is of paramount importance in\npractical application. The numerical verification of our numerical model is\nperformed both using a manufactured solution and considering wavefront\npropagation in two-dimensional polygonal grids. Next, we present a simulation\nof $\\alpha$-synuclein spreading in a two-dimensional brain slice in the\nsagittal plane. The polygonal mesh for this simulation is agglomerated\nmaintaining the distinction of white and grey matter, taking advantage of the\nflexibility of PolyDG methods in the mesh construction. Finally, we simulate\nthe spreading of Amyloid-$\\beta$ in a patient-specific setting by using a\nthree-dimensional geometry reconstructed from magnetic resonance images and an\ninitial condition reconstructed from positron emission tomography. Our\nnumerical simulations confirm that the proposed method is able to capture the\nevolution of Parkinson's and Alzheimer's diseases.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:42:36 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 08:15:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Corti","Mattia",""],["Bonizzoni","Francesca",""],["Antonietti","Paola F.",""]]}
{"id":"2308.00548","submitter":"Raghunath Ghara","authors":"Raghunath Ghara, Satadru Bag, Saleem Zaroubi, Suman Majumdar","title":"The morphology of the redshifted 21-cm signal from the Cosmic Dawn","comments":"11 pages, 10 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spatial fluctuations in the tomographic maps of the redshifted 21-cm\nsignal from the Cosmic Dawn (CD) crucially depend on the size and distribution\nof the regions with gas temperatures larger than the radio background\ntemperature. In this article, we study the morphological characteristics of\nsuch emission regions and their absorption counterparts using the shape\ndiagnostic tool {\\sc surfgen2}. Using simulated CD brightness temperature cubes\nof the 21-cm signal, we find that the emission regions percolate at stages with\nthe filling factor of the emission regions $FF_{\\rm emi}\\gtrsim 0.15$.\nPercolation of the absorption regions occurs for $FF_{\\rm abs}\\gtrsim 0.05$.\nThe largest emission and absorption regions are topologically complex and\nhighly filamentary for most parts of the CD. The number density of these\nregions as a function of the volume shows the power-law nature with the\npower-law indexes $\\approx -2$ and $-1.6$ for the emission and absorption\nregions, respectively. Overall, the planarity, filamentarity and genus increase\nwith the increase of the volume of both emission and absorption regions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:42:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ghara","Raghunath",""],["Bag","Satadru",""],["Zaroubi","Saleem",""],["Majumdar","Suman",""]]}
{"id":"2308.00549","submitter":"Hanyu Peng","authors":"Hanyu Peng, Guanhua Fang, Ping Li","title":"Copula for Instance-wise Feature Selection and Ranking","comments":"15 pages, UAI poster","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":"  Instance-wise feature selection and ranking methods can achieve a good\nselection of task-friendly features for each sample in the context of neural\nnetworks. However, existing approaches that assume feature subsets to be\nindependent are imperfect when considering the dependency between features. To\naddress this limitation, we propose to incorporate the Gaussian copula, a\npowerful mathematical technique for capturing correlations between variables,\ninto the current feature selection framework with no additional changes needed.\nExperimental results on both synthetic and real datasets, in terms of\nperformance comparison and interpretability, demonstrate that our method is\ncapable of capturing meaningful correlations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:45:04 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Peng","Hanyu",""],["Fang","Guanhua",""],["Li","Ping",""]]}
{"id":"2308.00550","submitter":"Tianqing Zhu","authors":"Tianqing Zhu","title":"Quantum difference equation for the affine type $A$ quiver varieties I:\n  General Construction","comments":"59 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT hep-th math-ph math.MP math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article we use the philosophy in [OS22] to construct the quantum\ndifference equation of affine type $A$ quiver varieties in terms of the quantum\ntoroidal algebra $U_{q,t}(\\hat{\\hat{\\mathfrak{sl}}}_{r})$. In the construction,\nand we define the set of wall for each quiver varieties by the action of the\nuniversal $R$-matrix, which is shown to be almost equivalent to that of the\n$K$-theoretic stable envelope on each interval in $H^2(X,\\mathbb{Q})$. We also\ngive the examples of the instanton moduli space $M(n,r)$ and the Hilbert scheme\n$\\text{Hilb}_{n}(\\widehat{\\mathbb{C}^2/\\mathbb{Z}_{r}})$ to show the explicit\nform of the quantum difference operator.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:47:02 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 05:39:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhu","Tianqing",""]]}
{"id":"2308.00551","submitter":"Stefano Boccelli","authors":"Stefano Boccelli, Pietro Parodi, Thierry E. Magin, James G. McDonald","title":"Modelling high-Mach-number rarefied crossflows past a flat plate using\n  the maximum-entropy moment method","comments":null,"journal-ref":null,"doi":"10.1063/5.0159432","report-no":null,"categories":"physics.flu-dyn math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The 10 and 14-moment maximum-entropy methods are applied to the study of\nhigh-Mach-number non-reacting crossflows past a flat plate at large degrees of\nrarefaction. The moment solutions are compared to particle-based kinetic\nsolutions, showing a varying degree of accuracy. At a Knudsen number of 0.1,\nthe 10-moment method is able to reproduce the shock layer, while it fails to\npredict the low-density wake region, due to the lack of a heat flux.\nConversely, the 14-moment method results in accurate predictions of both\nregions. At a Knudsen number of 1, the 10-moment method produces unphysical\nresults in both the shock layer and in the wake. The 14-moment method also\nshows a reduced accuracy, but manages to predict a reasonable shock region,\nfree of unphysical sub-shocks, and in qualitative agreement with the kinetic\nsolution. Accuracy is partially lost in the wake, where the 14-moment method\npredicts a thin unphysical high-density layer, concentrated on the centreline.\nAn analysis of the velocity distribution functions (VDF) indicates strongly\nnon-Maxwellian shapes, and the presence of distinct particle populations, in\nthe wake, crossing each other at the centreline. The particle-based and the\n14-moment method VDFs are in qualitative agreement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:47:22 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Boccelli","Stefano",""],["Parodi","Pietro",""],["Magin","Thierry E.",""],["McDonald","James G.",""]]}
{"id":"2308.00552","submitter":"Vladimir Dorovskyy Dr.","authors":"V.V. Dorovskyy, V.N. Melnik, A.A. Konovalenko, A.I. Brazhenko, H.O.\n  Rucker","title":"Spatial properties of the complex decameter type II burst observed on 31\n  May 2013","comments":"8 pages, 8 figures,","journal-ref":"Sun and Geosphere, vol.13, no.1, p.25-30, (2018)","doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present the results of observations of complex powerful type II burst\nassociated with narrow Earth-directed CME, which was ejected at around 11 UT on\n31 May 2013. The observations were performed by radio telescope UTR-2, which\noperated as local interferometer, providing the possibility of detection of the\nspatial parameters of the radio emission source. There are also polarization\ndata from URAN-2 radio telescope. The CME was detected by two space-born\ncoronagraphs SOHO/LASCO/C2 and STEREO/COR1-BEHIND, and was absolutely invisible\nfor STEREO-AHEAD spacecraft. The associated type II burst consisted of two\nsuccessive parts of quite different appearance on the dynamic spectrum. The\nfirst burst was narrow in frequency, had cloudy structure and was completely\nunpolarized while the second one represented rich herring-bone structure and\nexposed high degree of circular polarization. Both parts of the whole event\nreveal band splitting and well distinguished harmonic structure. The positions\nand sizes of the sources of the type II burst were found using\ncross-correlation functions of interferometer bases. The sources of the type II\nbursts elements were found to be of about 15 arcmin in size in average, with\nthe smallest ones reaching as low as 10 arcmin. Corresponding brightness\ntemperatures were estimated. In most cases these temperatures were between\n$10^{11}$ and $10^{12}$ K with maximum value as high as $10^{14}$ K. The\nspatial displacement of the source was measured and model independent\nvelocities of the type II burst sources were determined.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:47:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dorovskyy","V. V.",""],["Melnik","V. N.",""],["Konovalenko","A. A.",""],["Brazhenko","A. I.",""],["Rucker","H. O.",""]]}
{"id":"2308.00553","submitter":"Huimin Li","authors":"Huimin Li, Phillip Rieger, Shaza Zeitouni, Stjepan Picek, Ahmad-Reza\n  Sadeghi","title":"FLAIRS: FPGA-Accelerated Inference-Resistant & Secure Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) has become very popular since it enables clients to\ntrain a joint model collaboratively without sharing their private data.\nHowever, FL has been shown to be susceptible to backdoor and inference attacks.\nWhile in the former, the adversary injects manipulated updates into the\naggregation process; the latter leverages clients' local models to deduce their\nprivate data. Contemporary solutions to address the security concerns of FL are\neither impractical for real-world deployment due to high-performance overheads\nor are tailored towards addressing specific threats, for instance,\nprivacy-preserving aggregation or backdoor defenses. Given these limitations,\nour research delves into the advantages of harnessing the FPGA-based computing\nparadigm to overcome performance bottlenecks of software-only solutions while\nmitigating backdoor and inference attacks. We utilize FPGA-based enclaves to\naddress inference attacks during the aggregation process of FL. We adopt an\nadvanced backdoor-aware aggregation algorithm on the FPGA to counter backdoor\nattacks. We implemented and evaluated our method on Xilinx VMK-180, yielding a\nsignificant speed-up of around 300 times on the IoT-Traffic dataset and more\nthan 506 times on the CIFAR-10 dataset.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:47:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Huimin",""],["Rieger","Phillip",""],["Zeitouni","Shaza",""],["Picek","Stjepan",""],["Sadeghi","Ahmad-Reza",""]]}
{"id":"2308.00554","submitter":"Yurim Jung","authors":"Yurim Jung","title":"Hyperdiffusion of Poissonian run-and-tumble particles in two dimensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study non-interacting Poissonian run-and-tumble particles (RTPs) in two\ndimensions whose velocity orientations are controlled by an arbitrary circular\ndistribution $Q(\\phi)$. RTP-type active transport has been reported to undergo\nlocalization inside crowded and disordered environments, yet its\nnon-equilibrium dynamics, especially at intermediate times, has not been\nelucidated analytically. Here, starting from the standard (one-state) RTPs, we\nformulate the localized (two-state) RTPs by concatenating an overdamped\nBrownian motion in a Markovian manner. Using the space-time coupling technique\nin continuous-time random walk theory, we generalize the Montroll-Weiss formula\nin a decomposable form over the Fourier coefficient $Q_{\\nu}$ and reveal that\nthe displacement moment $\\left \\langle \\mathbf{r}^{2\\mu}(t) \\right \\rangle$\ndepends on finite angular moments $Q_{\\nu}$ for $|\\nu|\\leq \\mu$. Based on this\nfinding, we provide (i) the angular distribution of velocity reorientation for\none-state RTPs and (ii) $\\left \\langle \\mathbf{r}^{2}(t) \\right \\rangle$ over\nall timescales for two-state RTPs. In particular, we find the intricate time\nevolution of $\\left \\langle \\mathbf{r}^{2}(t) \\right \\rangle$ that depends on\ninitial dynamic states and, remarkably, detect hyperdiffusive scaling $\\left\n\\langle \\mathbf{r}^{2}(t) \\right \\rangle \\propto t^{\\beta(t)}$ with an\nanomalous exponent $2<\\beta(t)\\leq 3$ in the short- and intermediate-time\nregimes. Our work suggests that the localization emerging within complex\nsystems can increase the dispersion rate of active transport even beyond the\nballistic limit.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:53:03 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jung","Yurim",""]]}
{"id":"2308.00556","submitter":"Elvis Dohmatob","authors":"Elvis Dohmatob, Meyer Scetbon","title":"Robust Linear Regression: Phase-Transitions and Precise Tradeoffs for\n  General Norms","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":"  In this paper, we investigate the impact of test-time adversarial attacks on\nlinear regression models and determine the optimal level of robustness that any\nmodel can reach while maintaining a given level of standard predictive\nperformance (accuracy). Through quantitative estimates, we uncover fundamental\ntradeoffs between adversarial robustness and accuracy in different regimes. We\nobtain a precise characterization which distinguishes between regimes where\nrobustness is achievable without hurting standard accuracy and regimes where a\ntradeoff might be unavoidable. Our findings are empirically confirmed with\nsimple experiments that represent a variety of settings. This work applies to\nfeature covariance matrices and attack norms of any nature, and extends beyond\nprevious works in this area.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:55:45 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dohmatob","Elvis",""],["Scetbon","Meyer",""]]}
{"id":"2308.00557","submitter":"Yi-Chen Zhang","authors":"Lu Fan, Yiming Bian, Mingze Wu, Yichen Zhang, and Song Yu","title":"Quantum hacking against discrete-modulated continuous-variable quantum\n  key distribution using modified local oscillator intensity attack with random\n  fluctuations","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":"  The local oscillator in practical continuous-variable quantum key\ndistribution system fluctuates at any time during the key distribution process,\nwhich may open security loopholes for the eavesdropper to hide her\neavesdropping behaviors. Based on this, we investigate a more stealthy quantum\nattack where the eavesdroppers simulates random fluctuations of local\noscillator intensity in a practical discrete-modulated continuous-variable\nquantum key distribution system. Theoretical simulations show that both\ncommunicating parties will misestimate channel parameters and overestimate the\nsecret key rate due to the modified attack model, even though they have\nmonitored the mean local oscillator intensity and shot-noise as commonly used.\nSpecifically, the eavesdropper's manipulation of random fluctuations in LO\nintensity disturbs the parameter estimation in realistic discrete-modulated\ncontinuous-variable quantum key distribution system, where the experimental\nparameters are always used for constraints of the semidefinite program\nmodeling. The modified attack introduced by random fluctuations of local\noscillator can only be eliminated by monitoring the local oscillator intensity\nin real time which places a higher demand on the accuracy of monitoring\ntechnology. Moreover, similar quantum hacking will also occur in practical\nlocal local oscillator system by manipulating the random fluctuations in pilot\nintensity, which shows the strong adaptability and the important role of the\nproposed attack.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:57:28 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fan","Lu",""],["Bian","Yiming",""],["Wu","Mingze",""],["Zhang","Yichen",""],["Yu","Song",""]]}
{"id":"2308.00558","submitter":"Seongsik Park","authors":"Seongsik Park, Jeonghee Jo, Jongkil Park, Yeonjoo Jeong, Jaewook Kim,\n  Suyoun Lee, Joon Young Kwak, Inho Kim, Jong-Keuk Park, Kyeong Seok Lee, Gye\n  Weon Hwang, Hyun Jae Jang","title":"Gradient Scaling on Deep Spiking Neural Networks with Spike-Dependent\n  Local Information","comments":"ICML-23 Localized Learning Workshop: Decentralized Model Updates via\n  Non-Global Objectives","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Deep spiking neural networks (SNNs) are promising neural networks for their\nmodel capacity from deep neural network architecture and energy efficiency from\nSNNs' operations. To train deep SNNs, recently, spatio-temporal backpropagation\n(STBP) with surrogate gradient was proposed. Although deep SNNs have been\nsuccessfully trained with STBP, they cannot fully utilize spike information. In\nthis work, we proposed gradient scaling with local spike information, which is\nthe relation between pre- and post-synaptic spikes. Considering the causality\nbetween spikes, we could enhance the training performance of deep SNNs.\nAccording to our experiments, we could achieve higher accuracy with lower\nspikes by adopting the gradient scaling on image classification tasks, such as\nCIFAR10 and CIFAR100.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:58:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Park","Seongsik",""],["Jo","Jeonghee",""],["Park","Jongkil",""],["Jeong","Yeonjoo",""],["Kim","Jaewook",""],["Lee","Suyoun",""],["Kwak","Joon Young",""],["Kim","Inho",""],["Park","Jong-Keuk",""],["Lee","Kyeong Seok",""],["Hwang","Gye Weon",""],["Jang","Hyun Jae",""]]}
{"id":"2308.00559","submitter":"Manas Rachh","authors":"Travis Askham and Carlos Borges and Jeremy Hoskins and Manas Rachh","title":"Random walks in frequency and the reconstruction of obstacles with\n  cavities from multi-frequency data","comments":"28 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inverse obstacle scattering is the recovery of an obstacle boundary from the\nscattering data produced by incident waves. This shape recovery can be done by\niteratively solving a PDE-constrained optimization problem for the obstacle\nboundary. While it is well known that this problem is typically non-convex and\nill-posed, previous investigations have shown that in many settings these\nissues can be alleviated by using a continuation-in-frequency method and\nintroducing a regularization that limits the frequency content of the obstacle\nboundary. It has been recently observed that these techniques can fail for\nobstacles with pronounced cavities, even in the case of penetrable obstacles\nwhere similar optimization and regularization methods work for the equivalent\nproblem of recovering a piecewise constant wave speed.\n  The present work investigates the recovery of obstacle boundaries for\nimpenetrable, sound-soft media with pronounced cavities, given multi-frequency\nscattering data. Numerical examples demonstrate that the problem is sensitive\nto the choice of iterative solver used at each frequency and the initial guess\nat the lowest frequency. We propose a modified continuation-in-frequency method\nwhich follows a random walk in frequency, as opposed to the standard\nmonotonically increasing path. This method shows some increased robustness in\nrecovering cavities, but can also fail for more extreme examples. An\ninteresting phenomenon is observed that while the obstacle reconstructions\nobtained over several random trials can vary significantly near the cavity, the\nresults are consistent for non-cavity parts of the boundary.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:59:11 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Askham","Travis",""],["Borges","Carlos",""],["Hoskins","Jeremy",""],["Rachh","Manas",""]]}
{"id":"2308.00560","submitter":"Yubin Xiao","authors":"Yubin Xiao, Di Wang, Huanhuan Chen, Boyang Li, Wei Pang, Xuan Wu, Hao\n  Li, Dong Xu, Yanchun Liang, and You Zhou","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling\n  Salesman Problems","comments":"14 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Traveling Salesman Problem (TSP) is a well-known problem in combinatorial\noptimization with applications in various domains. However, existing TSP\nsolvers face challenges in producing high-quality solutions with low latency.\nTo address this issue, we propose NAR4TSP, which produces TSP solutions in a\nNon-Autoregressive (NAR) manner using a specially designed Graph Neural Network\n(GNN), achieving faster inference speed. Moreover, NAR4TSP is trained using an\nenhanced Reinforcement Learning (RL) strategy, eliminating the dependency on\ncostly labels used to train conventional supervised learning-based NAR models.\nTo the best of our knowledge, NAR4TSP is the first TSP solver that successfully\ncombines RL and NAR decoding. The experimental results on both synthetic and\nreal-world TSP instances demonstrate that NAR4TSP outperforms four\nstate-of-the-art models in terms of solution quality, inference latency, and\ngeneralization ability. Lastly, we present visualizations of NAR4TSP's decoding\nprocess and its overall path planning to showcase the feasibility of\nimplementing NAR4TSP in an end-to-end manner and its effectiveness,\nrespectively.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:00:31 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Xiao","Yubin",""],["Wang","Di",""],["Chen","Huanhuan",""],["Li","Boyang",""],["Pang","Wei",""],["Wu","Xuan",""],["Li","Hao",""],["Xu","Dong",""],["Liang","Yanchun",""],["Zhou","You",""]]}
{"id":"2308.00561","submitter":"Emanuel Malvetti","authors":"Emanuel Malvetti, Frederik vom Ende, Gunther Dirr, Thomas\n  Schulte-Herbr\\\"uggen","title":"Reachability, Coolability, and Stabilizability of Open Markovian Quantum\n  Systems with Fast Unitary Control","comments":"38 pages, one figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open Markovian quantum systems with fast and full Hamiltonian control can be\nreduced to an equivalent control system on the standard simplex modelling the\ndynamics of the eigenvalues of the density matrix describing the quantum state.\nWe explore this reduced control system for answering questions on reachability\nand stabilizability with immediate applications to the cooling of Markovian\nquantum systems. We show that for certain tasks of interest, the control\nHamiltonian can be chosen time-independent. -- The reduction picture is an\nexample of dissipative interconversion between equivalence classes of states,\nwhere the classes are induced by fast controls.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:03:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Malvetti","Emanuel",""],["Ende","Frederik vom",""],["Dirr","Gunther",""],["Schulte-Herbr\u00fcggen","Thomas",""]]}
{"id":"2308.00562","submitter":"Zhaoming Hu","authors":"Zhaoming Hu, Ruikang Zhong, Chao Fang, Yuanwei Liu","title":"Caching-at-STARS: the Next Generation Edge Caching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.IT cs.SY math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A simultaneously transmitting and reflecting surface (STARS) enabled edge\ncaching system is proposed for reducing backhaul traffic and ensuring the\nquality of service. A novel Caching-at-STARS structure, where a dedicated smart\ncontroller and cache memory are installed at the STARS, is proposed to satisfy\nuser demands with fewer hops and desired channel conditions. Then, a joint\ncaching replacement and information-centric hybrid beamforming optimization\nproblem is formulated for minimizing the network power consumption. As\nlong-term decision processes, the optimization problems based on independent\nand coupled phase-shift models of Caching-at-STARS contain both continuous and\ndiscrete decision variables, and are suitable for solving with deep\nreinforcement learning (DRL) algorithm. For the independent phase-shift\nCaching-at-STARS model, we develop a frequency-aware based twin delayed deep\ndeterministic policy gradient (FA-TD3) algorithm that leverages user historical\nrequest information to serialize high-dimensional caching replacement decision\nvariables. For the coupled phase-shift Caching-at-STARS model, we conceive a\ncooperative TD3 \\& deep-Q network (TD3-DQN) algorithm comprised of FA-TD3 and\nDQN agents to decide on continuous and discrete variables respectively by\nobserving the network external and internal environment. The numerical results\ndemonstrate that: 1) The Caching-at-STARS-enabled edge caching system has\nadvantages over traditional edge caching, especially in scenarios where Zipf\nskewness factors or cache capacity is large; 2) Caching-at-STARS outperforms\nthe RIS-assisted edge caching systems; 3) The proposed FA-TD3 and cooperative\nTD3-DQN algorithms are superior in reducing network power consumption than\nconventional TD3.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:04:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hu","Zhaoming",""],["Zhong","Ruikang",""],["Fang","Chao",""],["Liu","Yuanwei",""]]}
{"id":"2308.00563","submitter":"Adam Midlik","authors":"Adam Midlik, Sreenath Nair, Stephen Anyango, Mandar Deshpande, David\n  Sehnal, Mihaly Varadi, Sameer Velankar","title":"PDBImages: A Command Line Tool for Automated Macromolecular Structure\n  Visualization","comments":"7 pages, 1 figure, to be submitted to Bioinformatics","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Summary: PDBImages is an innovative, open-source Node.js package that\nharnesses the power of the popular macromolecule structure visualization\nsoftware Mol*. Designed for use by the scientific community, PDBImages provides\na means to generate high-quality images for PDB and AlphaFold DB models. Its\nunique ability to render and save images directly to files in a browserless\nmode sets it apart, offering users a streamlined, automated process for\nmacromolecular structure visualization. Here, we detail the implementation of\nPDBImages, enumerating its diverse image types and elaborating on its\nuser-friendly setup. This powerful tool opens a new gateway for researchers to\nvisualize, analyse, and share their work, fostering a deeper understanding of\nbioinformatics. Availability and Implementation: PDBImages is available as an\nnpm package from https://www.npmjs.com/package/pdb-images. The source code is\navailable from https://github.com/PDBeurope/pdb-images. Contact:\nmvaradi@ebi.ac.uk, sameer@ebi.ac.uk\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:04:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Midlik","Adam",""],["Nair","Sreenath",""],["Anyango","Stephen",""],["Deshpande","Mandar",""],["Sehnal","David",""],["Varadi","Mihaly",""],["Velankar","Sameer",""]]}
{"id":"2308.00564","submitter":"Joao G. Rosa","authors":"Paulo B. Ferraz and Jo\\~ao G. Rosa","title":"Shrinking the Warm Little Inflaton","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that warm inflation can be successfully realized in the high\ntemperature regime through dissipative interactions between the inflaton and a\nsingle fermionic degree of freedom, provided that the latter's mass is an\noscillatory function of the inflaton field value. We demonstrate, in\nparticular, that despite the consequent large amplitude oscillations of the eta\nslow-roll parameter, their effect is, on average, sufficiently suppressed to\nallow for a slow-roll trajectory. In addition, we demonstrate that, even though\nthis also induces a parametric resonance that amplifies inflaton perturbations,\nthis has a negligible effect on CMB scales in the relevant parametric range.\nHence, the \"Warm Little Inflaton\" scenario can be realized with one less\nfermionic degree of freedom and no need of imposing an additional discrete\ninterchange symmetry.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:04:36 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ferraz","Paulo B.",""],["Rosa","Jo\u00e3o G.",""]]}
{"id":"2308.00565","submitter":"Sunyou Hwang","authors":"Sunyou Hwang, Bart D. W. Remes, Guido C. H. E. de Croon","title":"AOSoar: Autonomous Orographic Soaring of a Micro Air Vehicle","comments":"8 pages, 11 figures, accepted to IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Utilizing wind hovering techniques of soaring birds can save energy\nexpenditure and improve the flight endurance of micro air vehicles (MAVs).\nHere, we present a novel method for fully autonomous orographic soaring without\na priori knowledge of the wind field. Specifically, we devise an Incremental\nNonlinear Dynamic Inversion (INDI) controller with control allocation, adapting\nit for autonomous soaring. This allows for both soaring and the use of the\nthrottle if necessary, without changing any gain or parameter during the\nflight. Furthermore, we propose a simulated-annealing-based optimization method\nto search for soaring positions. This enables for the first time an MAV to\nautonomously find a feasible soaring position while minimizing throttle usage\nand other control efforts. Autonomous orographic soaring was performed in the\nwind tunnel. The wind speed and incline of a ramp were changed during the\nsoaring flight. The MAV was able to perform autonomous orographic soaring for\nflight times of up to 30 minutes. The mean throttle usage was only 0.25% for\nthe entire soaring flight, whereas normal powered flight requires 38%. Also, it\nwas shown that the MAV can find a new soaring spot when the wind field changes\nduring the flight.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:09:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hwang","Sunyou",""],["Remes","Bart D. W.",""],["de Croon","Guido C. H. E.",""]]}
{"id":"2308.00567","submitter":"Wei-Ning Zhang","authors":"Shi-Yao Wang, Jun-Ting Ye, Wei-Ning Zhang","title":"Two-pion interferometry for partially coherent sources in relativistic\n  heavy-ion collisions in a multi-phase transport model","comments":"18 pages,8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform two-pion Hanbury Brown-Twiss (HBT) interferometry for the\npartially coherent pion-emitting sources in relativistic heavy-ion collisions,\nusing a multi-phase transport (AMPT) model. A longitudinal coherent emission\nlength, as well as a transverse coherent emission length, are introduced to the\npion generation coordinates in calculating the HBT correlation functions of the\npartially coherent sources. We compare the model results with and without\ncoherent emission conditions with experimental data in Au-Au collisions at\ncenter-of-mass energy $\\sqrt{s_{NN}}=$200 GeV, and in Pb-Pb collisions at\ncenter-of-mass energy $\\sqrt{s_{NN}}=$2.76 TeV, and find that the HBT results\nof the partially coherent sources are closer to the experimental data than\nthose of chaotic sources.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:14:15 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 11:51:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Shi-Yao",""],["Ye","Jun-Ting",""],["Zhang","Wei-Ning",""]]}
{"id":"2308.00568","submitter":"Apostolos Gkatzionis","authors":"Apostolos Gkatzionis, Shaun R. Seaman, Rachael A. Hughes and Kate\n  Tilling","title":"Relationship between Collider Bias and Interactions on the Log-Additive\n  Scale","comments":"Main Part: 19 pages, 5 figures, 3 tables. Supplement: 16 pages, 3\n  figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Collider bias occurs when conditioning on a common effect (collider) of two\nvariables $X, Y$. In this manuscript, we quantify the collider bias in the\nestimated association between exposure $X$ and outcome $Y$ induced by selecting\non one value of a binary collider $S$ of the exposure and the outcome. In the\ncase of logistic regression, it is known that the magnitude of the collider\nbias in the exposure-outcome regression coefficient is proportional to the\nstrength of interaction $\\delta_3$ between $X$ and $Y$ in a log-additive model\nfor the collider: $\\mathbb{P} (S = 1 | X, Y) = \\exp \\left\\{ \\delta_0 + \\delta_1\nX + \\delta_2 Y + \\delta_3 X Y \\right\\}$. We show that this result also holds\nunder a linear or Poisson regression model for the exposure-outcome\nassociation. We then illustrate by simulation that even if a log-additive model\nwith interactions is not the true model for the collider, the interaction term\nin such a model is still informative about the magnitude of collider bias.\nFinally, we discuss the implications of these findings for methods that attempt\nto adjust for collider bias, such as inverse probability weighting which is\noften implemented without including interactions between variables in the\nweighting model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:16:05 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 15:22:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gkatzionis","Apostolos",""],["Seaman","Shaun R.",""],["Hughes","Rachael A.",""],["Tilling","Kate",""]]}
{"id":"2308.00569","submitter":"Azim Dadabaev","authors":"A. M. Dadabaev, Yu. Kh.-M. Shidakov, V. M. Lelevkin, A. A. Sorokin, K.\n  A. Moldosanov","title":"A New View on the Application of Gold Nanoparticles in Cancer Therapy","comments":"29 pages, in Russian, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In biomedical research and the practice of cancer therapy, gold nanoparticles\nhave been used to visualize malignant tumors, as the heated bodies for\nhyperthermia of cancer cells, as drug carriers to deliver drugs to a cancer\ncell, but, to the best of our knowledge, they have not yet been used\nconsciously as the sources of terahertz (THz) radiation delivered to a cancer\ncell that contributes to the inhibition of cell activity. It is predicted here\nthat gold nanoparticles less than 8 nm in size are sources of spontaneous THz\nradiation, and the possibility of their application in oncology is due to the\nknown effects of THz radiation on the cells of living organisms. There are\nindications that nanoparticles with a size comparable to the width of the major\ngroove of the DNA molecule will be the most effective. Another effect that has\nnot yet been taken into account in biomedical studies using gold nanoparticles\nis that of local electric fields due to the contact potential difference above\nedges and vertices of gold nanoclusters. The prerequisites and possibilities\nfor searching for the manifestations of these two effects when gold\nnanoparticles are introduced into living cells of organisms are considered.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:17:21 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 04:26:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dadabaev","A. M.",""],["Shidakov","Yu. Kh. -M.",""],["Lelevkin","V. M.",""],["Sorokin","A. A.",""],["Moldosanov","K. A.",""]]}
{"id":"2308.00570","submitter":"Kong Yao Chee","authors":"Kong Yao Chee, Thales C. Silva, M. Ani Hsieh, George J. Pappas","title":"Enhancing Sample Efficiency and Uncertainty Compensation in\n  Learning-based Model Predictive Control for Aerial Robots","comments":"7 pages, 7 figures. Accepted for publication in the proceedings of\n  the 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems\n  (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The recent increase in data availability and reliability has led to a surge\nin the development of learning-based model predictive control (MPC) frameworks\nfor robot systems. Despite attaining substantial performance improvements over\ntheir non-learning counterparts, many of these frameworks rely on an offline\nlearning procedure to synthesize a dynamics model. This implies that\nuncertainties encountered by the robot during deployment are not accounted for\nin the learning process. On the other hand, learning-based MPC methods that\nlearn dynamics models online are computationally expensive and often require a\nsignificant amount of data. To alleviate these shortcomings, we propose a novel\nlearning-enhanced MPC framework that incorporates components from\n$\\mathcal{L}_1$ adaptive control into learning-based MPC. This integration\nenables the accurate compensation of both matched and unmatched uncertainties\nin a sample-efficient way, enhancing the control performance during deployment.\nIn our proposed framework, we present two variants and apply them to the\ncontrol of a quadrotor system. Through simulations and physical experiments, we\ndemonstrate that the proposed framework not only allows the synthesis of an\naccurate dynamics model on-the-fly, but also significantly improves the\nclosed-loop control performance under a wide range of spatio-temporal\nuncertainties.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:20:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chee","Kong Yao",""],["Silva","Thales C.",""],["Hsieh","M. Ani",""],["Pappas","George J.",""]]}
{"id":"2308.00571","submitter":"Jaehyun Lee","authors":"Jaehyun Lee, Changbom Park, Juhan Kim, Christophe Pichon, Brad K.\n  Gibson, Jihye Shin, Yonghwi Kim, Owain N. Snaith, Yohan Dubois, C. Gareth Few","title":"Identification of Galaxy Protoclusters Based on the Spherical Top-hat\n  Collapse Model","comments":"21 pages, 19 figures. submitted to ApJ. Any comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We propose a new method for finding galaxy protoclusters that is motivated by\nstructure formation theory, and is also directly applicable to observations.\nProtoclusters are defined as the galaxy groups whose virial mass $M_{\\rm vir} <\n10^{14}\\,M_{\\odot}$ at their epochs but would exceed that limit by $z=0$. They\nare distinguished from clusters, groups of galaxies whose virial mass currently\nexceeds $10^{14}\\,M_{\\odot}$. According to these definitions there can be a\nmixture of clusters and protoclusters at a given epoch. The future mass that a\nprotocluster would acquire at $z=0$ is estimated using the spherical collapse\nmodel. The centers of protoclusters are identified using the critical\noverdensity for collapse by $z=0$ that is predicted by the spherical collapse\nmodel, and the physical size of protoclusters is defined by the overdensity\ncorresponding to the turnaround radius. We use the cosmological hydrodynamical\nsimulation Horizon Run 5 (HR5) to calibrate this prescription and demonstrate\nits performance. We find that the protocluster identification method suggested\nin this study is quite successful. Its application to the high redshift HR5\ngalaxies shows a tight correlation between the mass within the protocluster\nregions identified according to the spherical collapse model and the final mass\nto be found within the cluster at $z=0$, meaning that the regions can be\nregarded as the bona-fide protoclusters with high reliability.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:21:00 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lee","Jaehyun",""],["Park","Changbom",""],["Kim","Juhan",""],["Pichon","Christophe",""],["Gibson","Brad K.",""],["Shin","Jihye",""],["Kim","Yonghwi",""],["Snaith","Owain N.",""],["Dubois","Yohan",""],["Few","C. Gareth",""]]}
{"id":"2308.00572","submitter":"Khaled Telli","authors":"Telli Khaled, M. Boumehraz","title":"Adaptive Sliding Mode Controller and Observer for Altitude and Attitude\n  Control of a Quadrotor","comments":"Second International Conference on Electrical Engineering Biskra\n  ICEEB'2018","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper an adaptive sliding mode control approach for a quadrotor\nstabilization and trajectory tracking is presented. The closed loop control\nconsists of three parts; the first part is quadrotor altitude and attitude\nstabilization, and trajectory tracking. Second part is used for parameters\nestimation where we focus in mass estimation, while the third part is the full\nstates observation. Disturbances, sensors noise and parameter uncertainties,\nare taken into consideration. Sliding mode control law and observer adaptation\nare developed based on Lyapunov stability principle. Numerical simulations show\nthe effectiveness of the proposed control technique\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:32:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Khaled","Telli",""],["Boumehraz","M.",""]]}
{"id":"2308.00573","submitter":"Fredy Maglorio Sobrado Su\\'arez","authors":"Fredy Maglorio Sobrado Su\\'arez","title":"Regularity for the Timoshenko system with fractional damping","comments":"17 pages. arXiv admin note: text overlap with arXiv:2211.10816","journal-ref":"Journal of Engineering Research, 2023","doi":"10.22533/at.ed.3173292324083","report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study, the Regularity of the Timoshenko system with two fractional\ndampings $(-\\Delta)^\\tau u_t$ and $(-\\Delta)^\\sigma \\psi_t$; both of the\nparameters $(\\tau, \\sigma)$ vary in the interval $[0,1]$. We note that\n($\\tau=0$ or $\\sigma=0$) and ($\\tau=1$ or $\\sigma=1$) the dampings are called\nfrictional and viscous, respectively. Our main contribution is to show that the\ncorresponding semigroup $S(t)=e^{\\mathcal{B}t}$, is analytic for\n$(\\tau,\\sigma)\\in R_A:=[1/2,1]\\times[ 1/2,1]$ and determine the Gevrey's class\n$\\nu>\\dfrac{1}{\\phi}$, where $\\phi=\\left\\{\\begin{array}{ccc}\n\\dfrac{2\\sigma}{\\sigma+1} &{\\rm for} & \\sigma\\leq \\tau,\\\\\\\\\n\\dfrac{2\\tau}{\\tau+1} &{\\rm for} & \\tau\\leq \\sigma. \\end{array}\\right.$ \\quad\nand \\quad $(\\tau,\\sigma)\\in R_{CG}:= (0,1)^2$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:35:26 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 01:39:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Su\u00e1rez","Fredy Maglorio Sobrado",""]]}
{"id":"2308.00574","submitter":"Jiafu Wu","authors":"Jiafu Wu, Jian Li, Jiangning Zhang, Boshen Zhang, Mingmin Chi, Yabiao\n  Wang, Chengjie Wang","title":"PVG: Progressive Vision Graph for Vision Recognition","comments":"Accepted by ACM MM 2023","journal-ref":"ACM International Conference on Multimedia 2023","doi":"10.1145/3581783.3612122","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Convolution-based and Transformer-based vision backbone networks process\nimages into the grid or sequence structures, respectively, which are inflexible\nfor capturing irregular objects. Though Vision GNN (ViG) adopts graph-level\nfeatures for complex images, it has some issues, such as inaccurate neighbor\nnode selection, expensive node information aggregation calculation, and\nover-smoothing in the deep layers. To address the above problems, we propose a\nProgressive Vision Graph (PVG) architecture for vision recognition task.\nCompared with previous works, PVG contains three main components: 1)\nProgressively Separated Graph Construction (PSGC) to introduce second-order\nsimilarity by gradually increasing the channel of the global graph branch and\ndecreasing the channel of local branch as the layer deepens; 2) Neighbor nodes\ninformation aggregation and update module by using Max pooling and mathematical\nExpectation (MaxE) to aggregate rich neighbor information; 3) Graph error\nLinear Unit (GraphLU) to enhance low-value information in a relaxed form to\nreduce the compression of image detail information for alleviating the\nover-smoothing. Extensive experiments on mainstream benchmarks demonstrate the\nsuperiority of PVG over state-of-the-art methods, e.g., our PVG-S obtains 83.0%\nTop-1 accuracy on ImageNet-1K that surpasses GNN-based ViG-S by +0.9 with the\nparameters reduced by 18.5%, while the largest PVG-B obtains 84.2% that has\n+0.5 improvement than ViG-B. Furthermore, our PVG-S obtains +1.3 box AP and\n+0.4 mask AP gains than ViG-S on COCO dataset.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:35:29 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Wu","Jiafu",""],["Li","Jian",""],["Zhang","Jiangning",""],["Zhang","Boshen",""],["Chi","Mingmin",""],["Wang","Yabiao",""],["Wang","Chengjie",""]]}
{"id":"2308.00575","submitter":"Jonathan D'Emidio","authors":"Jonathan D'Emidio","title":"Lee-Yang zeros at $O(3)$ and deconfined quantum critical points","comments":"4 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lee-Yang theory, based on the study of zeros of the partition function, is\nwidely regarded as a powerful and complimentary approach to the study of\ncritical phenomena and forms a foundational part of the theory of phase\ntransitions. Its widespread use, however, is complicated by the fact that it\nrequires introducing complex-valued fields that create an obstacle for many\nnumerical methods, especially in the quantum case where very limited studies\nexist beyond one dimension. Here we present a simple and statistically exact\nmethod to compute partition function zeros with general complex-valued external\nfields in the context of large-scale quantum Monte Carlo simulations. We\ndemonstrate the power of this approach by extracting critical exponents from\nthe leading Lee-Yang zeros of 2D quantum antiferromagnets with a complex\nstaggered field, focusing on the Heisenberg bilayer and square-lattice $J$-$Q$\nmodels. The method also allows us to introduce a complex field that couples to\nvalence bond solid order, where we observe extended rings of zeros in the\n$J$-$Q$ model with purely imaginary staggered and valence bond solid fields.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:40:45 GMT"}],"update_date":"2023-08-02","authors_parsed":[["D'Emidio","Jonathan",""]]}
{"id":"2308.00576","submitter":"Yiting Chen","authors":"Yiting Chen, Ahmet Ercan Tekden, Marc Peter Deisenroth, Yasemin\n  Bekiroglu","title":"Sliding Touch-based Exploration for Modeling Unknown Object Shape with\n  Multi-fingered Hands","comments":"8 pages, 11 figures. Accepted by IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient and accurate 3D object shape reconstruction contributes\nsignificantly to the success of a robot's physical interaction with its\nenvironment. Acquiring accurate shape information about unknown objects is\nchallenging, especially in unstructured environments, e.g. the vision sensors\nmay only be able to provide a partial view. To address this issue, tactile\nsensors could be employed to extract local surface information for more robust\nunknown object shape estimation. In this paper, we propose a novel approach for\nefficient unknown 3D object shape exploration and reconstruction using a\nmulti-fingered hand equipped with tactile sensors and a depth camera only\nproviding a partial view. We present a multi-finger sliding touch strategy for\nefficient shape exploration using a Bayesian Optimization approach and a\nsingle-leader-multi-follower strategy for multi-finger smooth local surface\nperception. We evaluate our proposed method by estimating the 3D shape of\nobjects from the YCB and OCRTOC datasets based on simulation and real robot\nexperiments. The proposed approach yields successful reconstruction results\nrelying on only a few continuous sliding touches. Experimental results\ndemonstrate that our method is able to model unknown objects in an efficient\nand accurate way.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:41:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chen","Yiting",""],["Tekden","Ahmet Ercan",""],["Deisenroth","Marc Peter",""],["Bekiroglu","Yasemin",""]]}
{"id":"2308.00577","submitter":"Sergiy Maksymenko","authors":"Iryna Kuznietsova, Sergiy Maksymenko","title":"Deformational symmetries of smooth functions on non-orientable surfaces","comments":"31 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.AG math.AT math.DG math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a compact surface $M$, consider the natural right action of the group\nof diffeomorphisms $\\mathcal{D}(M)$ of $M$ on\n$\\mathcal{C}^{\\infty}(M,\\mathbb{R})$ given by $(f,h)\\mapsto f\\circ h$ for $f\\in\n\\mathcal{C}^{\\infty}(M,\\mathbb{R})$ and $h\\in\\mathcal{D}(M)$. Denote by\n$\\mathcal{F}(M)$ the subset of $\\mathcal{C}^{\\infty}(M,\\mathbb{R})$ consisting\nof function $f:M\\to\\mathbb{R}$ taking constant values on connected components\nof $\\partial{M}$, having no critical points on $\\partial{M}$, and such that at\neach of its critical points $z$ the function $f$ is $\\mathcal{C}^{\\infty}$\nequivalent to some homogenenous polynomial without multiple factors. In\nparticular, $\\mathcal{F}(M)$ contains all Morse maps. Let also $\\mathcal{O}(f)\n= \\{ f\\circ h \\mid h\\in\\mathcal{D}(M) \\}$ be the orbit of $f$. Previously it\nwas computed the algebraic structure of $\\pi_1\\mathcal{O}(f)$ for all\n$f\\in\\mathcal{F}(M)$, where $M$ is any orientable compact surface distinct from\n$2$-sphere.\n  In the present paper we compute the group\n$\\pi_0\\mathcal{S}(f,\\partial\\mathbb{M})$, where $\\mathbb{M}$ is a M\\\"obius\nband. As a consequence we obtain an explicit algebraic description of\n$\\pi_1\\mathcal{O}(f)$ for all non-orientable surfaces distinct from Klein\nbottle and projective plane.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:44:34 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kuznietsova","Iryna",""],["Maksymenko","Sergiy",""]]}
{"id":"2308.00578","submitter":"Ida M. Rasulian","authors":"Ida M. Rasulian, Mahdi Torabian","title":"On Torsion Contribution to Chiral Anomaly via Nieh-Yan Term","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"RCHEP/23-002","categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note we present a solution to the question of whether or not, in the\npresence of torsion, the topological Nieh-Yan term contributes to chiral\nanomaly. The integral of Nieh-Yan term is non-zero if topology is non-trivial;\nthe manifold has a boundary or vierbeins have singularities. Noting that\nsingular Nieh-Yan term could be written as a sum of delta functions, we argue\nthat the heat kernel expansion cannot end at finite steps. This leads to a\nsinusoidal dependence on the Nieh-Yan term and the UV cut-off of the theory (or\nalternatively the minimum length of spacetime). We show this ill-behaved\ndependence can be removed if a quantization condition on length scales is\napplied. It is expected as the Nieh-Yan term can be derived as the difference\nof two Chern class integrals (i.e. Pontryagin terms). On the other hand, in the\npresence of a cosmological constant, we find that indeed the Nieh-Yan term\ncontributes to the index with a dimensionful anomaly coefficient that depends\non the de Sitter length or equivalently inverse Hubble rate. We find similar\nresult in thermal field theory where the anomaly coefficient depends on\ntemperature. In both examples, the anomaly coefficient depends on IR cut-off of\nthe theory. Without singularities, the Nieh-Yan term can be smoothly rotated\naway, does not contribute to topological structure and consequently does not\ncontribute to chiral anomaly.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:47:26 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Rasulian","Ida M.",""],["Torabian","Mahdi",""]]}
{"id":"2308.00579","submitter":"Lauren Bramblett","authors":"Lauren Bramblett and Nicola Bezzo","title":"Epistemic Planning for Heterogeneous Robotic Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In applications such as search and rescue or disaster relief, heterogeneous\nmulti-robot systems (MRS) can provide significant advantages for complex\nobjectives that require a suite of capabilities. However, within these\napplication spaces, communication is often unreliable, causing inefficiencies\nor outright failures to arise in most MRS algorithms. Many researchers tackle\nthis problem by requiring all robots to either maintain communication using\nproximity constraints or assuming that all robots will execute a predetermined\nplan over long periods of disconnection. The latter method allows for higher\nlevels of efficiency in a MRS, but failures and environmental uncertainties can\nhave cascading effects across the system, especially when a mission objective\nis complex or time-sensitive. To solve this, we propose an epistemic planning\nframework that allows robots to reason about the system state, leverage\nheterogeneous system makeups, and optimize information dissemination to\ndisconnected neighbors. Dynamic epistemic logic formalizes the propagation of\nbelief states, and epistemic task allocation and gossip is accomplished via a\nmixed integer program using the belief states for utility predictions and\nplanning. The proposed framework is validated using simulations and experiments\nwith heterogeneous vehicles.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:52:09 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 02:42:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bramblett","Lauren",""],["Bezzo","Nicola",""]]}
{"id":"2308.00580","submitter":"Olga Rozanova","authors":"Olga S. Rozanova","title":"On plane oscillations of the cold plasma in a constant magnetic field","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a class of two-dimensional solutions of the cold plasma equations\ncompatible with a constant magnetic field and a constant electric field. For\nthis class, under various assumptions about the electric field, we study the\nconditions on the initial data that guarantee the global existence of the\nclassical solution of the Cauchy problem for a given period of time or a finite\nblowup. Particular attention is paid to the class of solutions with axial\nsymmetry.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:52:36 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Rozanova","Olga S.",""]]}
{"id":"2308.00581","submitter":"Gang Zhang","authors":"Yirui Huang, Gang Zhang, Xian'an Jin","title":"New results on the 1-isolation number of graphs without short cycles","comments":"21 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be a graph. A subset $D \\subseteq V(G)$ is called a 1-isolating set\nof $G$ if $\\Delta(G-N[D]) \\leq 1$, that is, $G-N[D]$ consists of isolated edges\nand isolated vertices only. The $1$-isolation number of $G$, denoted by\n$\\iota_1(G)$, is the cardinality of a smallest $1$-isolating set of $G$. In\nthis paper, we prove that if $G \\notin \\{P_3,C_3,C_7,C_{11}\\}$ is a connected\ngraph of order $n$ without $6$-cycles, or without induced 5- and 6-cycles, then\n$\\iota_1(G) \\leq \\frac{n}{4}$. Both bounds are sharp.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:53:17 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Huang","Yirui",""],["Zhang","Gang",""],["Jin","Xian'an",""]]}
{"id":"2308.00582","submitter":"HongWei Ke","authors":"Hong-Wei Ke, Fang Lu, Hai Pang, Xiao-Hai Liu and Xue-Qian Li","title":"Study on the possible molecular states composed of $\\Lambda_c\\bar D^*$,\n  $\\Sigma_c\\bar D^*$, $\\Xi_c\\bar D^*$ and $\\Xi_c'\\bar D^*$ in the\n  Bethe-Salpeter frame based on the pentaquark states $P_c(4440)$, $P_c(4457)$\n  and $P_{cs}(4459)$","comments":"24 pages, 2 figures and 12 tables. arXiv admin note: text overlap\n  with arXiv:1909.12509","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The measurements on a few pentaquarks states $P_c(4440)$, $P_c(4457)$ and\n$P_{cs}(4459)$ excite our new interests about their structures. Since the\nmasses of $P_c(4440)$ and $P_c(4457)$ are close to the threshold of\n$\\Sigma_c\\bar D^*$, in the earlier works, they were regarded as molecular\nstates of $\\Sigma_c\\bar D^*$ with quantum numbers\n$I(J^P)=\\frac{1}{2}(\\frac{1}{2}^-)$ and $\\frac{1}{2}(\\frac{3}{2}^-)$,\nrespectively. In a similar way $P_{cs}(4459)$ is naturally considered as a\n$\\Xi_c\\bar D^*$ bound state with $I=0$. Within the Bethe-Salpeter (B-S)\nframework we systematically study the possible bound states of $\\Lambda_c\\bar\nD^*$, $\\Sigma_c\\bar D^*$, $\\Xi_c\\bar D^*$ and $\\Xi_c'\\bar D^*$. Our results\nindicate that $\\Sigma_c\\bar D^*$ can form a bound state with\n$I(J^P)=\\frac{1}{2}(\\frac{1}{2}^-)$, which corresponds to $P_c(4440)$. However\nfor the $I(J^P)=\\frac{1}{2}(\\frac{3}{2}^-)$ system the attraction between\n$\\Sigma_c$ and $\\bar D^*$ is too weak to constitute a molecule, so\n$P_{c}(4457)$ may not be a bound state of $\\Sigma_c\\bar D^*$ with\n$I(J^P)=\\frac{1}{2}(\\frac{3}{2}^-)$. As $\\Xi_c\\bar D^*$ and $\\Xi_c'\\bar D^*$\nsystems we take into account of the mixing between $\\Xi_c$ and $\\Xi'_c$ and the\neigenstets should include two normal bound states $\\Xi_c\\bar D^*$ and\n$\\Xi_c'\\bar D^*$ with $I(J^P)=\\frac{1}{2}(\\frac{1}{2}^-)$ and a loosely bound\nstate $\\Xi_c\\bar D^*$ with $I(J^P)=\\frac{1}{2}(\\frac{3}{2}^-)$. The conclusion\nthat two $\\Xi_c\\bar D^*$ bound states exist, supports the suggestion that the\nobserved peak of $P_{cs}(4459)$ may hide two states $P_{cs}(4455)$ and\n$P_{cs}(4468)$. Based on the computations we predict a bound state $\\Xi_c'\\bar\nD^*$ with $I(J^P)=\\frac{1}{2}(\\frac{1}{2}^-)$ but not that with\n$I(J^P)=\\frac{1}{2}(\\frac{3}{2}^-)$. Further more accurate experiments will\ntest our approach and results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:59:37 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 08:37:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ke","Hong-Wei",""],["Lu","Fang",""],["Pang","Hai",""],["Liu","Xiao-Hai",""],["Li","Xue-Qian",""]]}
{"id":"2308.00583","submitter":"Kilian Tscharke","authors":"Kilian Tscharke, Sebastian Issel, Pascal Debus","title":"Semisupervised Anomaly Detection using Support Vector Regression with\n  Quantum Kernel","comments":"Accepted to IEEE International Conference on Quantum Computing and\n  Engineering (QCE) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomaly detection (AD) involves identifying observations or events that\ndeviate in some way from the rest of the data. Machine learning techniques have\nshown success in automating this process by detecting hidden patterns and\ndeviations in large-scale data. The potential of quantum computing for machine\nlearning has been widely recognized, leading to extensive research efforts to\ndevelop suitable quantum machine learning (QML) algorithms. In particular, the\nsearch for QML algorithms for near-term NISQ devices is in full swing. However,\nNISQ devices pose additional challenges due to their limited qubit coherence\ntimes, low number of qubits, and high error rates. Kernel methods based on\nquantum kernel estimation have emerged as a promising approach to QML on NISQ\ndevices, offering theoretical guarantees, versatility, and compatibility with\nNISQ constraints. Especially support vector machines (SVM) utilizing quantum\nkernel estimation have shown success in various supervised learning tasks.\nHowever, in the context of AD, semisupervised learning is of great relevance,\nand yet there is limited research published in this area. This paper introduces\nan approach to semisupervised AD based on the reconstruction loss of a support\nvector regression (SVR) with quantum kernel. This novel model is an alternative\nto the variational quantum and quantum kernel one-class classifiers, and is\ncompared to a quantum autoencoder as quantum baseline and a SVR with\nradial-basis-function (RBF) kernel as well as a classical autoencoder as\nclassical baselines. The models are benchmarked extensively on 10 real-world AD\ndata sets and one toy data set, and it is shown that our SVR model with quantum\nkernel performs better than the SVR with RBF kernel as well as all other\nmodels, achieving highest mean AUC over all data sets. In addition, our QSVR\noutperforms the quantum autoencoder on 9 out of 11 data sets.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:00:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Tscharke","Kilian",""],["Issel","Sebastian",""],["Debus","Pascal",""]]}
{"id":"2308.00584","submitter":"Ayanabha De","authors":"Ayanabha De","title":"Probability density function of the unbalanced impulse in Langevin\n  theory of Brownian motion","comments":"9 pages, 5 figures, 4 references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.class-ph physics.data-an","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper attempts to find a probability distribution for the white noise\n(rapidly fluctuating unbalanced force) in the Langevin Equation. Unbalanced\nforce is the resultant impulse provided to the brownian particle by the\ncolliding fluid molecules. Therefore, a probability distribution of the speed\nof the particles after each impact will have the same probability distribution\nof the white noise. Such a distribution is discovered in this work by\nconstructing a simple model based on thermal molecules colliding with the\nparticle from all directions. The molecules obey Maxwell-Boltzmann speed\ndistribution law. At low temperatures, for bigger brownian particles, existence\nof some non-random distribution for the unbalanced impulse, in itself is an\ninteresting result. The distribution takes a near half gaussian form at these\nlimits. At high temperatures, for small brownian particles(e.g: pollen grains),\nthe distribution is shown to approach uniform distribution, and hence\nconsistent with bulk of well established theoretical assumptions and\nexperimental results in the literature that claims the unbalanced force to be a\nrandom white noise.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:01:57 GMT"}],"update_date":"2023-08-02","authors_parsed":[["De","Ayanabha",""]]}
{"id":"2308.00585","submitter":"Keavin Moore","authors":"Keavin Moore, Nicolas B. Cowan, Charles-\\'Edouard Boukar\\'e","title":"The Role of Magma Oceans in Maintaining Surface Water on Rocky Planets\n  Orbiting M-Dwarfs","comments":"14 pages, 5 figures, re-submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Earth-like planets orbiting M-dwarf stars, M-Earths, are currently the best\ntargets to search for signatures of life. Life as we know it requires water.\nThe habitability of M-Earths is jeopardized by water loss to space: high flux\nfrom young M-dwarf stars can drive the loss of 3--20 Earth oceans from\notherwise habitable planets. We develop a 0-D box model for Earth-mass\nterrestrial exoplanets, orbiting within the habitable zone, which tracks water\nloss to space and exchange between reservoirs during an early surface magma\nocean phase and the longer deep-water cycling phase. A key feature is the\nduration of the surface magma ocean, assumed concurrent with the runaway\ngreenhouse. This timescale can discriminate between desiccated planets, planets\nwith desiccated mantles but substantial surface water, and planets with\nsignificant water sequestered in the mantle. A longer-lived surface magma ocean\nhelps M-Earths retain water: dissolution of water in the magma provides a\nbarrier against significant loss to space during the earliest, most active\nstage of the host M-dwarf, depending on the water saturation limit of the\nmagma. Although a short-lived basal magma ocean can be beneficial to surface\nhabitability, a long-lived basal magma ocean may sequester significant water in\nthe mantle at the detriment of surface habitability. We find that magma oceans\nand deep-water cycling can maintain or recover habitable surface conditions on\nEarth-like planets at the inner edge of the habitable zone around late M-dwarf\nstars -- these planets would otherwise be desiccated if they form with less\nthan ${\\sim}$10 terrestrial oceans of water.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:02:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Moore","Keavin",""],["Cowan","Nicolas B.",""],["Boukar\u00e9","Charles-\u00c9douard",""]]}
{"id":"2308.00586","submitter":"Amnon Aharony","authors":"Amnon Aharony","title":"My encounters with Alex Muller and the perovskites","comments":"Submitted to Physica C, special issue dedicated to K. A. Muller.\n  arXiv admin note: text overlap with arXiv:2201.08252","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is dedicated to the memory of Professor K. Alex Muller. After\ndescribing our personal and scientific encounters since 1974, I concentrate on\nthe many puzzles whinch appeared in our discussions and collaborations,\ninvolving the interplay between theory and experiments on the critical behavior\nof cubic perovskites which undergo (second or first) order transitions to a\nlower symmetry phases (trigonal or tetragonal). The conclusion, reached only\nvery recently, is that (although beginning with the same cubic symmetry) the\ntwo types of transitions belong to two distinct universality classes: under\n[100] stress, the cubic to trigonal transition exhibits a tetracritical phase\ndiagram, with cubic exponents, while the cubic to tetragonal transition exhibit\nan intermediate bicritical phase diagram, but asymptotically the bicritical\npoint turns into a triple point, with three first order lines. To test these\nconclusions, it is suggested to measure the effective critical exponents as the\ntemperature approaches criticality.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:02:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Aharony","Amnon",""]]}
{"id":"2308.00587","submitter":"Shunan Zhang","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, D. Bacher, I. Bachiller Perea, S. Bachmann, M.\n  Bachmayer, J.J. Back, A. Bailly-reyre, P. Baladron Rodriguez, V. Balagura, W.\n  Baldini, J. Baptista de Souza Leite, M. Barbetti, I. R. Barbosa, R.J. Barlow,\n  S. Barsuk, W. Barter, M. Bartolini, F. Baryshnikov, J.M. Basels, G. Bassi, B.\n  Batsukh, A. Battig, A. Bay, A. Beck, M. Becker, F. Bedeschi, I.B. Bediaga, A.\n  Beiter, 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, G. Ciullo, P.E.L. Clarke, M. Clemencic,\n  H.V. Cliff, J. Closier, J.L. Cobbledick, C. Cocha Toapaxi, V. Coco, J. Cogan,\n  E. 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, L. Grazette, G. Graziani, A. T. Grecu, L.M. Greeven,\n  N.A. Grieser, L. Grillo, S. Gromov, C. Gu, M. Guarise, M. Guittiere, V.\n  Guliaeva, P. A. G\\\"unther, A.K. Guseinov, E. Gushchin, Y. Guz, T. Gys, T.\n  Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, J. Haimberger, S.C.\n  Haines, M. Hajheidari, T. Halewood-leagas, M.M. Halvorsen, P.M. Hamilton, J.\n  Hammerich, Q. Han, X. Han, S. Hansmann-Menzemer, L. Hao, N. Harnew, T.\n  Harrison, M. Hartmann, C. Hasse, M. Hatch, J. He, K. Heijhoff, F. Hemmer, C.\n  Henderson, R.D.L. Henderson, A.M. Hennequin, K. Hennessy, L. Henry, J. Herd,\n  J. Heuel, A. Hicheur, D. Hill, M. Hilton, S.E. Hollitt, J. Horswill, R. Hou,\n  Y. Hou, N. Howarth, J. Hu, J. Hu, W. Hu, X. Hu, W. Huang, X. Huang, W.\n  Hulsbergen, R.J. Hunter, M. Hushchyn, D. Hutchcroft, P. Ibis, M. Idzik, D.\n  Ilin, P. Ilten, A. Inglessi, A. Iniukhin, A. Ishteev, K. Ivshin, R.\n  Jacobsson, H. Jage, S.J. Jaimes Elles, S. Jakobsen, E. Jans, B.K. Jashal, A.\n  Jawahery, V. Jevtic, E. Jiang, X. Jiang, Y. Jiang, Y. J. Jiang, M. John, D.\n  Johnson, C.R. Jones, T.P. Jones, S. Joshi, B. Jost, N. Jurik, I. Juszczak, D.\n  Kaminaris, S. Kandybei, Y. Kang, M. Karacson, D. Karpenkov, M. Karpov, A. M.\n  Kauniskangas, J.W. Kautz, F. Keizer, D.M. Keller, M. Kenzie, T. Ketel, B.\n  Khanji, A. Kharisova, S. Kholodenko, G. Khreich, T. Kirn, V.S. Kirsebom, O.\n  Kitouni, S. Klaver, N. Kleijne, K. Klimaszewski, M.R. Kmiec, S. Koliiev, L.\n  Kolk, A. Kondybayeva, A. Konoplyannikov, P. Kopciewicz, R. Kopecna, P.\n  Koppenburg, M. Korolev, I. Kostiuk, O. Kot, S. Kotriakhova, A. Kozachuk, P.\n  Kravchenko, L. Kravchuk, M. Kreps, S. Kretzschmar, P. Krokovny, W. Krupa, W.\n  Krzemien, J. Kubat, S. Kubis, W. Kucewicz, M. Kucharczyk, V. Kudryavtsev, E.\n  Kulikova, A. Kupsc, B. K. Kutsenko, D. Lacarrere, G. Lafferty, A. Lai, A.\n  Lampis, D. Lancierini, C. Landesa Gomez, J.J. Lane, R. Lane, C. Langenbruch,\n  J. Langer, O. Lantwin, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, S.H.\n  Lee, R. Lef\\`evre, A. Leflat, S. Legotin, P. Lenisa, O. Leroy, T. Lesiak, B.\n  Leverington, A. Li, H. Li, K. Li, L. Li, P. Li, P.-R. Li, S. Li, T. Li, T.\n  Li, Y. Li, Z. Li, Z. Lian, X. Liang, C. Lin, T. Lin, R. Lindner, V.\n  Lisovskyi, R. Litvinov, G. Liu, H. Liu, K. Liu, Q. Liu, S. Liu, Y. Liu, Y.\n  Liu, A. Lobo Salvia, A. Loi, J. Lomba Castro, T. Long, I. Longstaff, J.H.\n  Lopes, A. Lopez Huertas, S. L\\'opez Soli\\~no, G.H. Lovell, Y. Lu, C.\n  Lucarelli, D. Lucchesi, S. Luchuk, M. Lucio Martinez, V. Lukashenko, Y. Luo,\n  A. Lupato, E. Luppi, K. Lynch, X.-R. Lyu, R. Ma, S. Maccolini, F. Machefert,\n  F. Maciuc, I. Mackay, L.R. Madhan Mohan, M. M. Madurai, A. Maevskiy, D.\n  Magdalinski, D. Maisuzenko, M.W. Majewski, J.J. Malczewski, S. Malde, B.\n  Malecki, L. Malentacca, 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.-N. Minard, A.\n  Minotti, E. Minucci, T. Miralles, S.E. Mitchell, B. Mitreska, D.S. Mitzel, A.\n  Modak, A. M\\\"odden, R.A. Mohammed, R.D. Moise, S. Mokhnenko, T. Momb\\\"acher,\n  M. Monk, I.A. Monroy, S. Monteil, A. Morcillo Gomez, 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, F.\n  M\\~unoz-Rojas, R. Murta, P. Naik, T. Nakada, R. Nandakumar, T. Nanut, I.\n  Nasteva, M. Needham, N. Neri, S. Neubert, N. Neufeld, P. Neustroev, R.\n  Newcombe, J. Nicolini, D. Nicotra, E.M. Niel, 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, D. Passaro, A. Pastore, M. Patel, J. Patoc, C.\n  Patrignani, C.J. Pawley, A. Pellegrino, M. Pepe Altarelli, S. Perazzini, D.\n  Pereima, A. Pereiro Castro, P. Perret, A. Perro, K. Petridis, A. Petrolini,\n  S. Petrucci, H. Pham, A. Philippov, L. Pica, M. Piccini, B. Pietrzyk, G.\n  Pietrzyk, D. Pinci, F. Pisani, M. Pizzichemi, V. Placinta, M. Plo Casasus, F.\n  Polci, M. Poli Lener, A. Poluektov, N. Polukhina, I. Polyakov, E. Polycarpo,\n  S. Ponce, D. Popov, S. Poslavskii, K. Prasanth, L. Promberger, C. Prouve, V.\n  Pugatch, V. Puill, G. Punzi, H.R. Qi, W. Qian, N. Qin, S. Qu, R. Quagliani,\n  B. Rachwal, J.H. Rademacker, R. Rajagopalan, M. Rama, M. Ram\\'irez Garc\\'ia,\n  M. 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, D.\n  Riccardi, S. Ricciardi, K. Richardson, M. Richardson-Slipper, K. Rinnert, P.\n  Robbe, G. Robertson, E. Rodrigues, E. Rodriguez Fernandez, J.A. Rodriguez\n  Lopez, E. Rodriguez Rodriguez, A. Rogovskiy, D.L. Rolf, A. Rollings, P.\n  Roloff, V. Romanovskiy, M. Romero Lamas, A. Romero Vidal, G. Romolini, F.\n  Ronchetti, M. Rotondo, M.S. Rudolph, T. Ruf, R.A. Ruiz Fernandez, J. Ruiz\n  Vidal, A. Ryzhikov, J. Ryzka, J.J. Saborido Silva, N. Sagidova, N. Sahoo, B.\n  Saitta, M. Salomoni, C. Sanchez Gras, I. Sanderswood, R. Santacesaria, C.\n  Santamarina Rios, M. Santimaria, L. Santoro, E. Santovetti, D. Saranin, G.\n  Sarpis, M. Sarpis, A. Sarti, C. Satriano, A. Satta, M. Saur, D. Savrina, H.\n  Sazak, L.G. Scantlebury Smead, A. Scarabotto, S. Schael, S. Scherl, A. M.\n  Schertz, M. Schiller, H. Schindler, M. Schmelling, B. Schmidt, S. Schmitt, O.\n  Schneider, A. Schopper, M. Schubiger, N. Schulte, S. Schulte, M.H. Schune, R.\n  Schwemmer, G. Schwering, B. Sciascia, A. Sciuccati, S. Sellam, A. Semennikov,\n  M. Senghi Soares, A. Sergi, N. Serra, L. Sestini, A. Seuthe, Y. Shang, D.M.\n  Shangase, M. Shapkin, I. Shchemerov, L. Shchutska, T. Shears, L. Shekhtman,\n  Z. Shen, S. Sheng, V. Shevchenko, B. Shi, E.B. Shields, Y. Shimizu, E.\n  Shmanin, R. Shorkin, J.D. Shupperd, B.G. Siddi, R. Silva Coutinho, G. Simi,\n  S. Simone, M. Singla, N. Skidmore, R. Skuza, T. Skwarnicki, M.W. Slater, J.C.\n  Smallwood, J.G. Smeaton, E. Smith, K. Smith, M. Smith, A. Snoch, L. Soares\n  Lavra, M.D. Sokoloff, F.J.P. Soler, A. Solomin, A. Solovev, I. Solovyev, R.\n  Song, Y. Song, Y. Song, Y. S. Song, F.L. Souza De Almeida, B. Souza De Paula,\n  E. Spadaro Norella, E. Spedicato, J.G. Speer, E. Spiridenkov, P. Spradlin, V.\n  Sriskaran, F. Stagni, M. Stahl, S. Stahl, S. Stanislaus, E.N. Stein, O.\n  Steinkamp, O. Stenyakin, H. Stevens, D. Strekalina, Y. Su, F. Suljik, J. Sun,\n  L. Sun, Y. Sun, P.N. Swallow, K. Swientek, F. Swystun, A. Szabelski, T.\n  Szumlak, M. Szymanski, Y. Tan, S. Taneja, M.D. Tat, A. Terentev, F. Teubert,\n  E. Thomas, D.J.D. Thompson, H. Tilquin, V. Tisserand, S. T'Jampens, M. Tobin,\n  L. Tomassetti, G. Tonani, X. Tong, D. Torres Machado, L. Toscano, D.Y. Tou,\n  C. Trippl, G. Tuci, N. Tuning, A. Ukleja, D.J. Unverzagt, E. Ursov, A.\n  Usachov, A. Ustyuzhanin, U. Uwer, V. Vagnoni, A. Valassi, G. Valenti, N.\n  Valls Canudas, M. Van Dijk, H. Van Hecke, E. van Herwijnen, C.B. Van Hulse,\n  R. Van Laak, M. van Veghel, R. Vazquez Gomez, P. Vazquez Regueiro, C.\n  V\\'azquez Sierra, S. Vecchi, J.J. Velthuis, M. Veltri, A. Venkateswaran, M.\n  Vesterinen, D. Vieira, M. Vieites Diaz, X. Vilasis-Cardona, E. Vilella\n  Figueras, A. Villa, P. Vincent, F.C. Volle, D. vom Bruch, V. Vorobyev, N.\n  Voropaev, K. Vos, C. Vrahas, J. Walsh, E.J. Walton, G. Wan, C. Wang, G. Wang,\n  J. Wang, J. Wang, J. Wang, J. Wang, M. Wang, N. W. Wang, R. Wang, X. Wang, Y.\n  Wang, Z. Wang, Z. Wang, Z. Wang, J.A. Ward, N.K. Watson, D. Websdale, Y. Wei,\n  B.D.C. Westhenry, D.J. White, M. Whitehead, A.R. Wiederhold, D. Wiedner, G.\n  Wilkinson, M.K. Wilkinson, I. Williams, M. Williams, M.R.J. Williams, R.\n  Williams, F.F. Wilson, W. Wislicki, M. Witek, L. Witola, C.P. Wong, G.\n  Wormser, S.A. Wotton, H. Wu, J. Wu, Y. Wu, K. Wyllie, S. Xian, Z. Xiang, Y.\n  Xie, A. Xu, J. Xu, L. Xu, L. Xu, M. Xu, Z. Xu, Z. Xu, Z. Xu, D. Yang, S.\n  Yang, X. Yang, Y. Yang, Z. Yang, Z. Yang, V. Yeroshenko, H. Yeung, H. Yin, C.\n  Y. Yu, J. Yu, X. Yuan, E. Zaffaroni, M. Zavertyaev, M. Zdybal, M. Zeng, C.\n  Zhang, D. Zhang, J. Zhang, L. Zhang, S. Zhang, S. Zhang, Y. Zhang, Y. Zhang,\n  Y. Zhao, A. Zharkova, A. Zhelezov, Y. Zheng, T. Zhou, X. Zhou, Y. Zhou, V.\n  Zhovkovska, L. Z. Zhu, X. Zhu, X. Zhu, Z. Zhu, V. Zhukov, J. Zhuo, Q. Zou, S.\n  Zucchelli, D. Zuliani, G. Zunica","title":"Observation of the decays $B_{(s)}^{0}\\to D_{s1}(2536)^{\\mp}K^{\\pm}$","comments":"All figures and tables, along with machine-readable versions and any\n  supplementary material and additional information, are available at\n  https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2023-014.html (LHCb\n  public pages)","journal-ref":null,"doi":null,"report-no":"LHCb-PAPER-2023-014, CERN-EP-2023-140","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper reports the observation of the decays $B_{(s)}^{0}\\to\nD_{s1}(2536)^{\\mp}K^{\\pm}$ using proton-proton collision data collected by the\nLHCb experiment, corresponding to an integrated luminosity of\n$9\\,\\mathrm{fb}^{-1}$. The branching fractions of these decays are measured\nrelative to the normalisation channel $B^{0}\\to \\overline{D}^{0}K^{+}K^{-}$.\nThe $D_{s1}(2536)^{-}$ meson is reconstructed in the\n$\\overline{D}^{*}(2007)^{0}K^{-}$ decay channel and the products of branching\nfractions are measured to be $$\\mathcal{B}(B_{s}^{0}\\to\nD_{s1}(2536)^{\\mp}K^{\\pm})\\times\\mathcal{B}(D_{s1}(2536)^{-}\\to\\overline{D}^{*}(2007)^{0}K^{-})=(2.49\\pm0.11\\pm0.12\\pm0.25\\pm0.06)\\times\n10^{-5}, $$ $$\\mathcal{B}(B^{0}\\to\nD_{s1}(2536)^{\\mp}K^{\\pm})\\times\\mathcal{B}(D_{s1}(2536)^{-}\\to\\overline{D}^{*}(2007)^{0}K^{-})\n= (0.510\\pm0.021\\pm0.036\\pm0.050)\\times 10^{-5}.$$ The first uncertainty is\nstatistical, the second systematic, and the third arises from the uncertainty\nof the branching fraction of the $B^{0}\\to \\overline{D}^{0}K^{+}K^{-}$\nnormalisation channel. The last uncertainty in the $B_{s}^{0}$ result is due to\nthe limited knowledge of the fragmentation fraction ratio, $f_{s}/f_{d}$. The\nsignificance for the $B_{s}^{0}$ and $B^{0}$ signals is larger than\n$10\\,\\sigma$. The ratio of the helicity amplitudes which governs the angular\ndistribution of the $D_{s1}(2536)^{-}\\to\\overline{D}^{*}(2007)^{0}K^{-}$ decay\nis determined from the data. The ratio of the $S$- and $D$-wave amplitudes is\nfound to be $1.11\\pm0.15\\pm 0.06$ and its phase $0.70\\pm0.09\\pm 0.04$ rad,\nwhere the first uncertainty is statistical and the second systematic.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:03:25 GMT"}],"update_date":"2023-08-02","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.",""],["Bacher","D.",""],["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.",""],["Ciullo","G.",""],["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.",""],["Grazette","L.",""],["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.",""],["Lenisa","P.",""],["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.",""],["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.",""],["Mohan","L. R. Madhan",""],["Madurai","M. M.",""],["Maevskiy","A.",""],["Magdalinski","D.",""],["Maisuzenko","D.",""],["Majewski","M. W.",""],["Malczewski","J. J.",""],["Malde","S.",""],["Malecki","B.",""],["Malentacca","L.",""],["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.",""],["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.",""],["Gomez","A. Morcillo",""],["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.",""],["M\u0169noz-Rojas","F.",""],["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.",""],["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.",""],["Passaro","D.",""],["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.",""],["Riccardi","D.",""],["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",""],["Rogovskiy","A.",""],["Rolf","D. L.",""],["Rollings","A.",""],["Roloff","P.",""],["Romanovskiy","V.",""],["Lamas","M. Romero",""],["Vidal","A. Romero",""],["Romolini","G.",""],["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","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.00588","submitter":"Ziyue Li Dr","authors":"Kaijian Liu, Shixiang Tang, Ziyue Li, Zhishuai Li, Lei Bai, Feng Zhu,\n  Rui Zhao","title":"Relation-Aware Distribution Representation Network for Person Clustering\n  with Multiple Modalities","comments":"Accepted in IEEE Transactions on Multimedia","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Person clustering with multi-modal clues, including faces, bodies, and\nvoices, is critical for various tasks, such as movie parsing and identity-based\nmovie editing. Related methods such as multi-view clustering mainly project\nmulti-modal features into a joint feature space. However, multi-modal clue\nfeatures are usually rather weakly correlated due to the semantic gap from the\nmodality-specific uniqueness. As a result, these methods are not suitable for\nperson clustering. In this paper, we propose a Relation-Aware Distribution\nrepresentation Network (RAD-Net) to generate a distribution representation for\nmulti-modal clues. The distribution representation of a clue is a vector\nconsisting of the relation between this clue and all other clues from all\nmodalities, thus being modality agnostic and good for person clustering.\nAccordingly, we introduce a graph-based method to construct distribution\nrepresentation and employ a cyclic update policy to refine distribution\nrepresentation progressively. Our method achieves substantial improvements of\n+6% and +8.2% in F-score on the Video Person-Clustering Dataset (VPCD) and\nVoxCeleb2 multi-view clustering dataset, respectively. Codes will be released\npublicly upon acceptance.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:04:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Liu","Kaijian",""],["Tang","Shixiang",""],["Li","Ziyue",""],["Li","Zhishuai",""],["Bai","Lei",""],["Zhu","Feng",""],["Zhao","Rui",""]]}
{"id":"2308.00589","submitter":"Deheng Song","authors":"Deheng Song, Kohta Murase, Ali Kheirandish","title":"Constraining decaying very heavy dark matter from galaxy clusters with\n  14 year Fermi-LAT data","comments":"12 pages, 13 figures, 2 tables. comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Galaxy clusters are promising targets for indirect detection of dark matter\nthanks to the large dark matter content. Using 14 years of Fermi-LAT data from\nseven nearby galaxy clusters, we obtain constraints on the lifetime of decaying\nvery heavy dark matter particles with masses ranging from $10^3$ GeV to\n$10^{16}$ GeV. We consider a variety of decaying channels and calculate prompt\ngamma rays and electrons/positrons from the dark matter. Furthermore, we take\ninto account electromagnetic cascades induced by the primary gamma rays and\nelectrons/positrons, and search for the resulting gamma-ray signals from the\ndirections of the galaxy clusters. We adopt a Navarro-Frenk-White profile of\nthe dark matter halos, and use the profile likelihood method to set lower\nlimits on the dark matter lifetime at a 95% confidence level. Our results are\ncompetitive with those obtained through other gamma-ray observations of galaxy\nclusters and provide complementary constraints to existing indirect searches\nfor decaying very heavy dark matter.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:05:47 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Song","Deheng",""],["Murase","Kohta",""],["Kheirandish","Ali",""]]}
{"id":"2308.00590","submitter":"Alpesh Bhudia","authors":"Alpesh Bhudia, Anna Cartwright, Edward Cartwright, Darren\n  Hurley-Smith, and Julio Hernandez-Castro","title":"Game Theoretic Modelling of a Ransom and Extortion Attack on Ethereum\n  Validators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consensus algorithms facilitate agreement on and resolution of blockchain\nfunctions, such as smart contracts and transactions. Ethereum uses a\nProof-of-Stake (PoS) consensus mechanism, which depends on financial incentives\nto ensure that validators perform certain duties and do not act maliciously.\nShould a validator attempt to defraud the system, legitimate validators will\nidentify this and then staked cryptocurrency is `burned' through a process of\nslashing.\n  In this paper, we show that an attacker who has compromised a set of\nvalidators could threaten to perform malicious actions that would result in\nslashing and thus, hold those validators to ransom. We use game theory to study\nhow an attacker can coerce payment from a victim, for example by deploying a\nsmart contract to provide a root of trust shared between attacker and victim\nduring the extortion process. Our game theoretic model finds that it is in the\ninterests of the validators to fully pay the ransom due to a lack of systemic\nprotections for validators. Financial risk is solely placed on the victim\nduring such an attack, with no mitigations available to them aside from\ncapitulation (payment of ransom) in many scenarios. Such attacks could be\ndisruptive to Ethereum and, likely, to many other PoS networks, if public trust\nin the validator system is eroded. We also discuss and evaluate potential\nmitigation measures arising from our analysis of the game theoretic model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:05:57 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bhudia","Alpesh",""],["Cartwright","Anna",""],["Cartwright","Edward",""],["Hurley-Smith","Darren",""],["Hernandez-Castro","Julio",""]]}
{"id":"2308.00591","submitter":"Chaoqun Zhuang","authors":"Chaoqun Zhuang, Yunfei Liu, Sijia Wen, Feng Lu","title":"Visibility Enhancement for Low-light Hazy Scenarios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low-light hazy scenes commonly appear at dusk and early morning. The visual\nenhancement for low-light hazy images is an ill-posed problem. Even though\nnumerous methods have been proposed for image dehazing and low-light\nenhancement respectively, simply integrating them cannot deliver pleasing\nresults for this particular task. In this paper, we present a novel method to\nenhance visibility for low-light hazy scenarios. To handle this challenging\ntask, we propose two key techniques, namely cross-consistency\ndehazing-enhancement framework and physically based simulation for low-light\nhazy dataset. Specifically, the framework is designed for enhancing visibility\nof the input image via fully utilizing the clues from different sub-tasks. The\nsimulation is designed for generating the dataset with ground-truths by the\nproposed low-light hazy imaging model. The extensive experimental results show\nthat the proposed method outperforms the SOTA solutions on different metrics\nincluding SSIM (9.19%) and PSNR(5.03%). In addition, we conduct a user study on\nreal images to demonstrate the effectiveness and necessity of the proposed\nmethod by human visual perception.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:07:38 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhuang","Chaoqun",""],["Liu","Yunfei",""],["Wen","Sijia",""],["Lu","Feng",""]]}
{"id":"2308.00592","submitter":"Tobias Gabriel Meier","authors":"Tobias G. Meier, Dan J. Bower, Tim Lichtenberg, Mark Hammond, Paul J.\n  Tackley","title":"Interior dynamics of super-Earth 55 Cancri e","comments":"20 pages, 11 figures, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ultra-short-period super-Earth 55 Cancri e has a measured radius of 1.8\nEarth radii. Previous thermal phase curve observations suggest a strong\ntemperature contrast between the dayside and nightside of around 1000 K with\nthe hottest point shifted $41\\pm12$ degrees east from the substellar point,\nindicating some degree of heat circulation. The dayside (and potentially even\nthe nightside) is hot enough to harbour a magma ocean. We use results from\ngeneral circulation models (GCMs) of atmospheres to constrain the surface\ntemperature contrasts. There is still a large uncertainty on the vigour and\nstyle of mantle convection in super-Earths, especially those that experience\nstellar irradiation large enough to harbour a magma ocean. In this work, we aim\nto constrain the mantle dynamics of the tidally locked lava world 55 Cancri e.\nUsing the surface temperature contrasts as boundary condition, we model the\nmantle flow of 55 Cancri e using 2D mantle convection simulations and\ninvestigate how the convection regimes are affected by the different climate\nmodels. We find that large super-plumes form on the dayside if that hemisphere\nis covered by a magma ocean and the nightside remains solid or only partially\nmolten. Cold material descends into the deep interior on the nightside, but no\nstrong downwellings form. In some cases, the super-plume also moves several\ntens of degrees towards the terminator. A convective regime where the upwelling\nis preferentially on the dayside might lead to preferential outgassing on that\nhemisphere which could lead to the build-up of atmospheric species that could\nbe chemically distinct from the nightside.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:07:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Meier","Tobias G.",""],["Bower","Dan J.",""],["Lichtenberg","Tim",""],["Hammond","Mark",""],["Tackley","Paul J.",""]]}
{"id":"2308.00593","submitter":"Lior Gishboliner","authors":"Lior Gishboliner, Asaf Shapira","title":"On R\\\"odl's Theorem for Cographs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A theorem of R\\\"odl states that for every fixed $F$ and $\\varepsilon>0$ there\nis $\\delta=\\delta_F(\\varepsilon)$ so that every induced $F$-free graph contains\na vertex set of size $\\delta n$ whose edge density is either at most\n$\\varepsilon$ or at least $1-\\varepsilon$. R\\\"odl's proof relied on the\nregularity lemma, hence it supplied only a tower-type bound for $\\delta$. Fox\nand Sudakov conjectured that $\\delta$ can be made polynomial in $\\varepsilon$,\nand a recent result of Fox, Nguyen, Scott and Seymour shows that this\nconjecture holds when $F=P_4$. In fact, they show that the same conclusion\nholds even if $G$ contains few copies of $P_4$. In this note we give a short\nproof of a more general statement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:08:22 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gishboliner","Lior",""],["Shapira","Asaf",""]]}
{"id":"2308.00594","submitter":"Yi Sheng Lim","authors":"Yi-Sheng Lim and Josip \\v{Z}ubrini\\'c","title":"An operator-asymptotic approach to periodic homogenization applied to\n  equations of linearized elasticity","comments":"48 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explain an operator-asymptotic approach to homogenization for periodic\ncomposite media. This approach was developed by Cherednichenko and Vel\\v{c}i\\'c\nin [Cherednichenko and Vel\\v{c}i\\'c (2022) Sharp operator-norm asymptotics for\nthin elastic plates with rapidly oscillating periodic properties. J. London\nMath. Soc.] in the context of thin elastic plates, and here we demonstrate the\napproach under the simpler setting of equations of linearized elasticity. As a\nconsequence, we obtain $L^2\\to L^2$, $L^2\\to H^1$, and higher order $L^2\\to\nL^2$ norm-resolvent estimates. The correctors for the $L^2\\to H^1$, and higher\norder $L^2\\to L^2$ results are constructed from boundary value problems that\narise during the asymptotic procedure, and the first-order corrector is shown\nto coincide with classical formulae.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:11:06 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 08:32:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lim","Yi-Sheng",""],["\u017dubrini\u0107","Josip",""]]}
{"id":"2308.00595","submitter":"Svaj\\=unas Sajavi\\v{c}ius","authors":"Svaj\\=unas Sajavi\\v{c}ius and Thomas Takacs","title":"Imposing nonlocal boundary conditions in Galerkin-type methods based on\n  non-interpolatory functions","comments":null,"journal-ref":"Comput. Math. Appl. 80 (2020) 2877-2895","doi":"10.1016/j.camwa.2020.09.016","report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The imposition of inhomogeneous Dirichlet (essential) boundary conditions is\na fundamental challenge in the application of Galerkin-type methods based on\nnon-interpolatory functions, i.e., functions which do not possess the Kronecker\ndelta property. Such functions typically are used in various meshfree methods,\nas well as methods based on the isogeometric paradigm. The present paper\nanalyses a model problem consisting of the Poisson equation subject to\nnon-standard boundary conditions. Namely, instead of classical boundary\nconditions, the model problem involves Dirichlet- and Neumann-type nonlocal\nboundary conditions. Variational formulations with strongly and weakly imposed\ninhomogeneous Dirichlet-type nonlocal conditions are derived and compared\nwithin an extensive numerical study in the isogeometric framework based on\nnon-uniform rational B-splines (NURBS). The attention in the numerical study is\npaid mainly to the influence of the nonlocal boundary conditions on the\nproperties of the considered discretisation methods.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:14:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Sajavi\u010dius","Svaj\u016bnas",""],["Takacs","Thomas",""]]}
{"id":"2308.00596","submitter":"Marcelo Eduardo Pederiva","authors":"Marcelo Eduardo Pederiva, Jos\\'e Mario De Martino and Alessandro\n  Zimmer","title":"MonoNext: A 3D Monocular Object Detection with ConvNext","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Autonomous driving perception tasks rely heavily on cameras as the primary\nsensor for Object Detection, Semantic Segmentation, Instance Segmentation, and\nObject Tracking. However, RGB images captured by cameras lack depth\ninformation, which poses a significant challenge in 3D detection tasks. To\nsupplement this missing data, mapping sensors such as LIDAR and RADAR are used\nfor accurate 3D Object Detection. Despite their significant accuracy, the\nmulti-sensor models are expensive and require a high computational demand. In\ncontrast, Monocular 3D Object Detection models are becoming increasingly\npopular, offering a faster, cheaper, and easier-to-implement solution for 3D\ndetections. This paper introduces a different Multi-Tasking Learning approach\ncalled MonoNext that utilizes a spatial grid to map objects in the scene.\nMonoNext employs a straightforward approach based on the ConvNext network and\nrequires only 3D bounding box annotated data. In our experiments with the KITTI\ndataset, MonoNext achieved high precision and competitive performance\ncomparable with state-of-the-art approaches. Furthermore, by adding more\ntraining data, MonoNext surpassed itself and achieved higher accuracies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:15:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Pederiva","Marcelo Eduardo",""],["De Martino","Jos\u00e9 Mario",""],["Zimmer","Alessandro",""]]}
{"id":"2308.00597","submitter":"Thomas K\\\"uhne","authors":"M. Logemann, J. Gujt, T. Harhues, T. D. K\\\"uhne, M. Wessling","title":"On the transport of CO$_2$ through humidified facilitated transport\n  membranes","comments":"34 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Membrane-based CO$_2$ removal from exhaust streams has recently gained much\nattention as a means of reducing emissions and limiting climate change. Novel\nmembranes for CO$_2$ removal include so called facilitated transport membranes\n(FTMs), which offer very high selectivities for CO$_2$ while maintaining decent\npermeabilities. Recently, these FTMs have been scaled up from laboratory level\nto plant-sized pilot modules with promising results. However, the molecular\ndetails of CO$_2$ transport in these has not yet been fully unraveled. In this\nwork, experimental studies were combined with quantum-mechanical ab initio\nmolecular dynamics simulations to gain insight into the underlying molecular\nmechanism of CO$_2$ permeation through FTMs. Various compositions of polyvinyl\nalcohol (PVA) as the membrane matrix with polyvinyl amine (PVAm),\nmonoethanolamine (MEA), or 4-amino-1-butanol (BA) as carrier molecules were\nexperimentally tested. Our experiments revealed that water was essential for\nthe CO$_2$ transport and a transport superposition was achieved with a mixed\ncomposition of PVAm and MEA in PVA. Furthermore, sorption measurements with PVA\nwere conducted with humidified N$_2$ and CO$_2$ to quantify water\nsorption-induced swelling and its contribution to the gas uptake. As the\ncarbonic acid--amine interaction is assumed to cause transport facilitation,\nelectronic structure-based ab initio molecular dynamics simulations were\nconducted to study the transport of CO$_2$ in the form of carbonic acid along\nPVAm polymer chains. In particular, the necessity of local water for transport\nfacilitation was studied at different water contents. The simulations show that\ntransport is fastest in the system with low water content and does not happen\nin the absence of water.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:15:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Logemann","M.",""],["Gujt","J.",""],["Harhues","T.",""],["K\u00fchne","T. D.",""],["Wessling","M.",""]]}
{"id":"2308.00598","submitter":"Zexian Liu","authors":"Zexian Liu, Qiao Li","title":"On the properties of the linear conjugate gradient method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The linear conjugate gradient method is an efficient iterative method for the\nconvex quadratic minimization problems $ \\mathop {\\min }\\limits_{x \\in {\n\\mathbb R^n}} f(x) =\\dfrac{1}{2}x^TAx+b^Tx $, where $ A \\in R^{n \\times n} $ is\nsymmetric and positive definite and $ b \\in R^n $. It is generally agreed that\nthe gradients $ g_k $ are not conjugate with respective to $ A $ in the linear\nconjugate gradient method (see page 111 in Numerical optimization (2nd,\nSpringer, 2006) by Nocedal and Wright). In the paper\n  we prove the conjugacy of the gradients $ g_k $ generated by the linear\nconjugate gradient method, namely, $$g_k^TAg_i=0, \\; i=0,1,\\cdots, k-2.$$ In\naddition,a new way is exploited to derive the linear conjugate gradient method\nbased on the conjugacy of the search directions and the orthogonality of the\ngradients, rather than the conjugacy of the search directions and the exact\nstepsize.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:20:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Liu","Zexian",""],["Li","Qiao",""]]}
{"id":"2308.00599","submitter":"Jimmy Fernandez Landivar","authors":"Jimmy Fernandez Landivar, Pieter Crombez, Sofie Pollin and Hazem\n  Sallouha","title":"QualityBLE: A QoS Aware Implementation for BLE Mesh Networks","comments":"6 pages, 6 figures, accepted for publication in the International\n  Conference on Embedded Wireless Systems and Networks (EWSN 2023), Rende,\n  Italy","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bluetooth Low Energy (BLE) Mesh is widely recognized as a driver technology\nfor IoT applications. However, the lack of quality of service (QoS) in BLE\nMesh, represented by packet prioritization, significantly limits its potential.\nThis work implements a quality-of-service (QoS) method for BLE Mesh to\nprioritize the data packets and provide them with different network\ntransmission settings according to their assigned priority. Unlike existing\nworks on QoS for BLE Mesh, our proposed approach does not require any\nmodifications to the BLE Mesh protocol and can be smoothly adopted in existing\nBLE Mesh networks. We conducted an extensive measurement campaign to evaluate\nour solution over a 15-node BLE Mesh network deployed to emulate a smart\nhealthcare scenario where 45 sensors with an assigned priority transmit\ninformation over the network. The experiments provide performance results for\nsingle and multi channel network scenarios. The obtained results validate our\nsolution, showing the difference between the established priorities and\nproviding insights and guidelines to conduct further research on QoS over BLE\nMesh and broadcast-based networks.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:23:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Landivar","Jimmy Fernandez",""],["Crombez","Pieter",""],["Pollin","Sofie",""],["Sallouha","Hazem",""]]}
{"id":"2308.00600","submitter":"Kathleen Salazar-Serna","authors":"Kathleen Salazar-Serna, Lynnette Hui Xian Ng, Lorena Cadavid, Carlos\n  J. Franco and Kathleen Carley","title":"Simulating the social influence in transport mode choices","comments":"12 pages, 4 figures. To be published in proceedings of the Winter\n  Simulation Conference 2023. Repositoty\n  link:https://github.com/Kathleenss/WSC2023-SupplementaryMaterial","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.MA cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Agent-based simulations have been used in modeling transportation systems for\ntraffic management and passenger flows. In this work, we hope to shed light on\nthe complex factors that influence transportation mode decisions within\ndeveloping countries, using Colombia as a case study. We model an ecosystem of\nhuman agents that decide at each time step on the mode of transportation they\nwould take to work. Their decision is based on a combination of their personal\nsatisfaction with the journey they had just taken, which is evaluated across a\npersonal vector of needs, the information they crowdsource from their\nprevailing social network, and their personal uncertainty about the experience\nof trying a new transport solution. We simulate different network structures to\nanalyze the social influence for different decision-makers. We find that in\nlow/medium connected groups inquisitive people actively change modes cyclically\nover the years while imitators cluster rapidly and change less frequently.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:28:18 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Salazar-Serna","Kathleen",""],["Ng","Lynnette Hui Xian",""],["Cadavid","Lorena",""],["Franco","Carlos J.",""],["Carley","Kathleen",""]]}
{"id":"2308.00606","submitter":"Fernando Gago-Encinas","authors":"Fernando Gago-Encinas, Tobias Hartung, Daniel M. Reich, Karl Jansen,\n  and Christiane P. Koch","title":"Determining the ability for universal quantum computing: Testing\n  controllability via dimensional expressivity","comments":"13 pages, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Operator controllability refers to the ability to implement an arbitrary\nunitary in SU(N) and is a prerequisite for universal quantum computing.\nControllability tests can be used in the design of quantum devices to reduce\nthe number of external controls. Their practical use is hampered, however, by\nthe exponential scaling of their numerical effort with the number of qubits.\nHere, we devise a hybrid quantum-classical algorithm based on a parametrized\nquantum circuit. We show that controllability is linked to the number of\nindependent parameters, which can be obtained by dimensional expressivity\nanalysis. We exemplify the application of the algorithm to qubit arrays with\nnearest-neighbour couplings and local controls. Our work provides a systematic\napproach to the resource-efficient design of quantum chips.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:33:41 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gago-Encinas","Fernando",""],["Hartung","Tobias",""],["Reich","Daniel M.",""],["Jansen","Karl",""],["Koch","Christiane P.",""]]}
{"id":"2308.00607","submitter":"Alan Perotti","authors":"Alan Perotti, Simone Bertolotto, Eliana Pastor, Andr\\'e Panisson","title":"Beyond One-Hot-Encoding: Injecting Semantics to Drive Image Classifiers","comments":"This work has been accepted to be presented to The 1st World\n  Conference on eXplainable Artificial Intelligence (xAI 2023), July 26-28,\n  2023 - Lisboa, Portugal","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":"  Images are loaded with semantic information that pertains to real-world\nontologies: dog breeds share mammalian similarities, food pictures are often\ndepicted in domestic environments, and so on. However, when training machine\nlearning models for image classification, the relative similarities amongst\nobject classes are commonly paired with one-hot-encoded labels. According to\nthis logic, if an image is labelled as 'spoon', then 'tea-spoon' and 'shark'\nare equally wrong in terms of training loss. To overcome this limitation, we\nexplore the integration of additional goals that reflect ontological and\nsemantic knowledge, improving model interpretability and trustworthiness. We\nsuggest a generic approach that allows to derive an additional loss term\nstarting from any kind of semantic information about the classification label.\nFirst, we show how to apply our approach to ontologies and word embeddings, and\ndiscuss how the resulting information can drive a supervised learning process.\nSecond, we use our semantically enriched loss to train image classifiers, and\nanalyse the trade-offs between accuracy, mistake severity, and learned internal\nrepresentations. Finally, we discuss how this approach can be further exploited\nin terms of explainability and adversarial robustness. Code repository:\nhttps://github.com/S1M0N38/semantic-encodings\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:34:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Perotti","Alan",""],["Bertolotto","Simone",""],["Pastor","Eliana",""],["Panisson","Andr\u00e9",""]]}
{"id":"2308.00608","submitter":"Md. Tanvir Rouf Shawon","authors":"Md Tanvir Rouf Shawon, G. M. Shahariar Shibli, Farzad Ahmed and Sajib\n  Kumar Saha Joy","title":"Explainable Cost-Sensitive Deep Neural Networks for Brain Tumor\n  Detection from Brain MRI Images considering Data Imbalance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents a research study on the use of Convolutional Neural\nNetwork (CNN), ResNet50, InceptionV3, EfficientNetB0 and NASNetMobile models to\nefficiently detect brain tumors in order to reduce the time required for manual\nreview of the report and create an automated system for classifying brain\ntumors. An automated pipeline is proposed, which encompasses five models: CNN,\nResNet50, InceptionV3, EfficientNetB0 and NASNetMobile. The performance of the\nproposed architecture is evaluated on a balanced dataset and found to yield an\naccuracy of 99.33% for fine-tuned InceptionV3 model. Furthermore, Explainable\nAI approaches are incorporated to visualize the model's latent behavior in\norder to understand its black box behavior. To further optimize the training\nprocess, a cost-sensitive neural network approach has been proposed in order to\nwork with imbalanced datasets which has achieved almost 4% more accuracy than\nthe conventional models used in our experiments. The cost-sensitive InceptionV3\n(CS-InceptionV3) and CNN (CS-CNN) show a promising accuracy of 92.31% and a\nrecall value of 1.00 respectively on an imbalanced dataset. The proposed models\nhave shown great potential in improving tumor detection accuracy and must be\nfurther developed for application in practical solutions. We have provided the\ndatasets and made our implementations publicly available at -\nhttps://github.com/shahariar-shibli/Explainable-Cost-Sensitive-Deep-Neural-Networks-for-Brain-Tumor-Detection-from-Brain-MRI-Images\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:35:06 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Shawon","Md Tanvir Rouf",""],["Shibli","G. M. Shahariar",""],["Ahmed","Farzad",""],["Joy","Sajib Kumar Saha",""]]}
{"id":"2308.00610","submitter":"Michael Onyszczak","authors":"Michael Onyszczak, Ayelet J. Uzan, Yue Tang, Pengjie Wang, Yanyu Jia,\n  Guo Yu, Tiancheng Song, Ratnadwip Singha, Jason F. Khoury, Leslie M. Schoop,\n  Sanfeng Wu","title":"A Platform for Far-Infrared Spectroscopy of Quantum Materials at\n  Millikelvin Temperatures","comments":"14 pages, 6 figures, typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical spectroscopy of quantum materials at ultralow temperatures is rarely\nexplored, yet it may provide critical characterizations of quantum phases not\npossible using other approaches. We describe the development of a novel\nexperimental platform that enables optical spectroscopic studies, together with\nstandard electronic transport, of materials at millikelvin temperatures inside\na dilution refrigerator. The instrument is capable of measuring both bulk\ncrystals and micron-sized two-dimensional van der Waals materials and devices.\nWe demonstrate the performance by implementing photocurrent-based Fourier\ntransform infrared spectroscopy on a monolayer WTe$_2$ device and a multilayer\n1T-TaS$_2$ crystal, with a spectral range available from the near-infrared to\nthe terahertz regime and in magnetic fields up to 5 T. In the far-infrared\nregime, we achieve spectroscopic measurements at a base temperature as low as ~\n43 mK and a sample electron temperature of ~ 450 mK. Possible experiments and\npotential future upgrades of this versatile instrumental platform are\nenvisioned.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:37:10 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 13:29:29 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 17:39:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Onyszczak","Michael",""],["Uzan","Ayelet J.",""],["Tang","Yue",""],["Wang","Pengjie",""],["Jia","Yanyu",""],["Yu","Guo",""],["Song","Tiancheng",""],["Singha","Ratnadwip",""],["Khoury","Jason F.",""],["Schoop","Leslie M.",""],["Wu","Sanfeng",""]]}
{"id":"2308.00613","submitter":"Felipe Diaz","authors":"Gabriel Arenas-Henriquez, Adolfo Cisterna, Felipe Diaz, Ruth Gregory","title":"Accelerating Black Holes in $2+1$ dimensions: Holography revisited","comments":"15 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies the holographic description of $2+1-$dimensional\naccelerating black holes. We start by using an ADM decomposition of the\ncoordinates suitable to identify boundary data. As a consequence, the\nholographic CFT lies in a fixed curved background which is described by the\nholographic stress tensor of a perfect fluid. We compute the Euclidean action\nensuring that the variational principle is satisfied in the presence of the\ndomain wall. This requires including the Gibbons--Hawking--York term associated\nwith internal boundaries on top of the standard renormalised AdS$_{3}$ action.\nFinally, we compute the entanglement entropy by firstly mapping the solution to\nthe Rindler--AdS spacetime in which the Ryu--Takayanagi surface is easily\nidentifiable. We found that as the acceleration increases the accessible region\nof the conformal boundary decreases and also the entanglement entropy,\nindicating a loss of information in the dual theory due to acceleration.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:42:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Arenas-Henriquez","Gabriel",""],["Cisterna","Adolfo",""],["Diaz","Felipe",""],["Gregory","Ruth",""]]}
{"id":"2308.00614","submitter":"Erik Tonni","authors":"Benoit Estienne, Yacine Ikhlef, Andrei Rotaru, Erik Tonni","title":"Entanglement entropies of an interval for the massless scalar field in\n  the presence of a boundary","comments":"60 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech math-ph math.MP quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the entanglement entropies of an interval for the massless compact\nboson either on the half line or on a finite segment, when either Dirichlet or\nNeumann boundary conditions are imposed. In these boundary conformal field\ntheory models, the method of the branch point twist fields is employed to\nobtain analytic expressions for the two-point functions of twist operators. In\nthe decompactification regime, these analytic predictions in the continuum are\ncompared with the lattice numerical results in massless harmonic chains for the\ncorresponding entanglement entropies, finding good agreement. The application\nof these analytic results in the context of quantum quenches is also discussed.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:43:09 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Estienne","Benoit",""],["Ikhlef","Yacine",""],["Rotaru","Andrei",""],["Tonni","Erik",""]]}
{"id":"2308.00617","submitter":"Weilin Li","authors":"Weilin Li","title":"Multiscale estimates for the condition number of non-harmonic Fourier\n  matrices","comments":"29 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This paper studies the extreme singular values of non-harmonic Fourier\nmatrices. Such a matrix can be written as $\\Phi=[ e^{-2\\pi i j\nx_k}]_{j=0,1,\\dots,m-1, k=1,2,\\dots,s}$ for some set\n$\\mathcal{X}=\\{x_k\\}_{k=1}^s$ and $m\\geq s$. A main result provides an explicit\nlower bound for the smallest singular value of $\\Phi$ under the assumption\n$m\\geq 6s$ and without any restrictions on $\\mathcal{X}$. It shows that for an\nappropriate scale $\\tau$ determined by a density criteria, interactions between\nelements in $\\mathcal{X}$ at scales smaller than $\\tau$ are most significant\nand depends on the multiscale structure of $\\mathcal{X}$ at fine scales, while\ndistances larger than $\\tau$ are less important and only depend on the local\nsparsity of the far away points. Theoretical and numerical comparisons show\nthat the main result significantly improves upon classical bounds and achieves\nthe same rate that was previously discovered for more restrictive settings.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:46:23 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Li","Weilin",""]]}
{"id":"2308.00619","submitter":"Davide Nicotra","authors":"Davide Nicotra, Miriam Lucio Martinez, Jacco Andreas de Vries, Marcel\n  Merk, Kurt Driessens, Ronald Leonard Westra, Domenica Dibenedetto and Daniel\n  Hugo C\\'ampora P\\'erez","title":"A quantum algorithm for track reconstruction in the LHCb vertex detector","comments":"20 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.ET hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-energy physics is facing increasingly computational challenges in\nreal-time event reconstruction for the near-future high-luminosity era. Using\nthe LHCb vertex detector as a use-case, we explore a new algorithm for particle\ntrack reconstruction based on the minimisation of an Ising-like Hamiltonian\nwith a linear algebra approach. The use of a classical matrix inversion\ntechnique results in tracking performance similar to the current\nstate-of-the-art but with worse scaling complexity in time. To solve this\nproblem, we also present an implementation as quantum algorithm, using the\nHarrow-Hassadim-Lloyd (HHL) algorithm: this approach can potentially provide an\nexponential speedup as a function of the number of input hits over its\nclassical counterpart, in spite of limitations due to the well-known HHL\nHamiltonian simulation and readout problems. The findings presented in this\npaper shed light on the potential of leveraging quantum computing for real-time\nparticle track reconstruction in high-energy physics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:47:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Nicotra","Davide",""],["Martinez","Miriam Lucio",""],["de Vries","Jacco Andreas",""],["Merk","Marcel",""],["Driessens","Kurt",""],["Westra","Ronald Leonard",""],["Dibenedetto","Domenica",""],["P\u00e9rez","Daniel Hugo C\u00e1mpora",""]]}
{"id":"2308.00621","submitter":"Lu-Jing Huang","authors":"Jian Ding, Zherui Fan, Lu-Jing Huang","title":"Uniqueness of the critical long-range percolation metrics","comments":"100 pages,17 figures","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 study the random metric for the critical long-range\npercolation on $\\mathbb{Z}^d$. A recent work by B\\\"aumler [3] implies the\nsubsequential scaling limit, and our main contribution is to prove that the\nsubsequential limit is uniquely characterized by a natural list of axioms. Our\nproof method is hugely inspired by recent works of Gwynne and Miller [42], and\nDing and Gwynne [25] on the uniqueness of Liouville quantum gravity metrics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:47:20 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 09:26:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ding","Jian",""],["Fan","Zherui",""],["Huang","Lu-Jing",""]]}
{"id":"2308.00622","submitter":"Weiyun Jiang","authors":"Weiyun Jiang, Vivek Boominathan, Ashok Veeraraghavan","title":"NeRT: Implicit Neural Representations for General Unsupervised\n  Turbulence Mitigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The atmospheric and water turbulence mitigation problems have emerged as\nchallenging inverse problems in computer vision and optics communities over the\nyears. However, current methods either rely heavily on the quality of the\ntraining dataset or fail to generalize over various scenarios, such as static\nscenes, dynamic scenes, and text reconstructions. We propose a general implicit\nneural representation for unsupervised atmospheric and water turbulence\nmitigation (NeRT). NeRT leverages the implicit neural representations and the\nphysically correct tilt-then-blur turbulence model to reconstruct the clean,\nundistorted image, given only dozens of distorted input images. Moreover, we\nshow that NeRT outperforms the state-of-the-art through various qualitative and\nquantitative evaluations of atmospheric and water turbulence datasets.\nFurthermore, we demonstrate the ability of NeRT to eliminate uncontrolled\nturbulence from real-world environments. Lastly, we incorporate NeRT into\ncontinuously captured video sequences and demonstrate $48 \\times$ speedup.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:49:40 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jiang","Weiyun",""],["Boominathan","Vivek",""],["Veeraraghavan","Ashok",""]]}
{"id":"2308.00623","submitter":"Patrick McDaniel","authors":"Patrick McDaniel and Farinaz Koushanfar","title":"Secure and Trustworthy Computing 2.0 Vision Statement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Secure and Trustworthy Computing (SaTC) program within the National\nScience Foundation (NSF) program serves as the primary instrument for creating\nnovel fundamental science in security and privacy in the United States with\nbroad impacts that influence the world. The program funds research in a vast\narray of research topics that span technology, theory, policy, law, and\nsociety. In the Spring of 2023, the program managers of SaTC requested that the\ncommunity prepare a vision for the next ten years of research. This document\nrepresents the results of that effort which involved collecting input from\nnumerous members of the security and privacy community, industry, academics,\nand government. Assembled from that input, this document offers a comprehensive\nview of general themes and specific areas of focus for future research as\nenvisioned by the community.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:50:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["McDaniel","Patrick",""],["Koushanfar","Farinaz",""]]}
{"id":"2308.00624","submitter":"Wenchao Gu","authors":"Qinhua Duan, Wenchao Gu, Yujia Chen, Wenxin Mao, Zewen Tian, Hui Cao","title":"JIANG: Chinese Open Foundation Language Model","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":"  With the advancements in large language model technology, it has showcased\ncapabilities that come close to those of human beings across various tasks.\nThis achievement has garnered significant interest from companies and\nscientific research institutions, leading to substantial investments in the\nresearch and development of these models. While numerous large models have\nemerged during this period, the majority of them have been trained primarily on\nEnglish data. Although they exhibit decent performance in other languages, such\nas Chinese, their potential remains limited due to factors like vocabulary\ndesign and training corpus. Consequently, their ability to fully express their\ncapabilities in Chinese falls short. To address this issue, we introduce the\nmodel named JIANG (Chinese pinyin of ginger) specifically designed for the\nChinese language. We have gathered a substantial amount of Chinese corpus to\ntrain the model and have also optimized its structure. The extensive\nexperimental results demonstrate the excellent performance of our model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:51:41 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Duan","Qinhua",""],["Gu","Wenchao",""],["Chen","Yujia",""],["Mao","Wenxin",""],["Tian","Zewen",""],["Cao","Hui",""]]}
{"id":"2308.00625","submitter":"Vinodkumar Ghale","authors":"Vinodkumar Ghale, Md Imdadul Islam, and Debopam Chakraborty","title":"Elliptic curves associated with Heron triangles with high $2$-Selmer\n  rank","comments":"15 pages, 2 tables, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rank computation of elliptic curves has deep relations with various unsolved\nquestions in number theory, most notably in the congruent number problem for\nright-angled triangles. Similar relations between elliptic curves and Heron\ntriangles were established later. In this work, we explicitly compute the\n2-Selmer rank of the elliptic curves associated with Heron triangles of even\narea, which eventually sheds light on the Mordell-Weil rank of those curves.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:52:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ghale","Vinodkumar",""],["Islam","Md Imdadul",""],["Chakraborty","Debopam",""]]}
{"id":"2308.00626","submitter":"Shota Fukushima","authors":"Shota Fukushima, Hyeonbae Kang","title":"Spectral structure of the Neumann-Poincar\\'e operator on axially\n  symmetric functions","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the Neumann-Poincar\\'e operator on a three-dimensional axially\nsymmetric domain which is generated by rotating a planar domain around an axis\nwhich does not intersect the planar domain. We investigate its spectral\nstructure when it is restricted to axially symmetric functions. If the boundary\nof the domain is smooth, we show that there are infinitely many axially\nsymmetric eigenfunctions and derive Weyl-type asymptotics of the corresponding\neigenvalues. We also derive the leading order terms of the asymptotic limits of\npositive and negative eigenvalues. The coefficients of the leading order terms\nare related to the convexity and concavity of the domain. If the boundary of\nthe domain is less regular, we derive decay estimates of the eigenvalues. The\ndecay rate depends on the regularity of the boundary. We also consider the\ndomains with corners and prove that the essential spectrum of the\nNeumann-Poincar\\'e operator on the axially symmetric three-dimensional domain\nis non-trivial and contains that of the planar domain.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:55:19 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fukushima","Shota",""],["Kang","Hyeonbae",""]]}
{"id":"2308.00627","submitter":"Hemily Gomes Marciano Fortes","authors":"Jos\\'e C. N. de Araujo, Hemily G. M. Fortes","title":"Compact stars in $f(T) = T +\\xi T^\\beta$ gravity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Teleparallel Theory is equivalent to General Relativity, but whereas in\nthe latter gravity has do with curvature, in the former gravity is described by\ntorsion. As is well known, there is in the literature a host of alternative\ntheories of gravity, among them the so called extended theories, in which\nadditional terms are added to the action, such as for example in the $f(R)$ and\n$f(T)$ gravities, where $R$ is the Ricci scalar and $T$ is the scalar torsion,\nrespectively. One of the ways to probe alternative gravity is via compact\nobjects. In fact, there is in the literature a series of papers on compact\nobjects in $f(R)$ and $f(T)$ gravity. In particular, there are several papers\nthat consider $f(T) = T + \\xi T^2$, where $\\xi$ is a real constant. In this\npaper, we generalise such extension considering compact stars in $f (T ) = T +\n\\xi T^\\beta$ gravity, where $\\xi$ and $\\beta$ are real constants} {and looking\nout for the implications in their maximum masses and compactness in comparison\nto the General Relativity.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:55:39 GMT"}],"update_date":"2023-08-02","authors_parsed":[["de Araujo","Jos\u00e9 C. N.",""],["Fortes","Hemily G. M.",""]]}
{"id":"2308.00628","submitter":"Wenzhao Zheng","authors":"Bohao Fan, Siqi Wang, Wenxuan Guo, Wenzhao Zheng, Jianjiang Feng, Jie\n  Zhou","title":"Human-M3: A Multi-view Multi-modal Dataset for 3D Human Pose Estimation\n  in Outdoor Scenes","comments":"Code and data will be released on\n  https://github.com/soullessrobot/Human-M3-Dataset","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":"  3D human pose estimation in outdoor environments has garnered increasing\nattention recently. However, prevalent 3D human pose datasets pertaining to\noutdoor scenes lack diversity, as they predominantly utilize only one type of\nmodality (RGB image or pointcloud), and often feature only one individual\nwithin each scene. This limited scope of dataset infrastructure considerably\nhinders the variability of available data. In this article, we propose\nHuman-M3, an outdoor multi-modal multi-view multi-person human pose database\nwhich includes not only multi-view RGB videos of outdoor scenes but also\ncorresponding pointclouds. In order to obtain accurate human poses, we propose\nan algorithm based on multi-modal data input to generate ground truth\nannotation. This benefits from robust pointcloud detection and tracking, which\nsolves the problem of inaccurate human localization and matching ambiguity that\nmay exist in previous multi-view RGB videos in outdoor multi-person scenes, and\ngenerates reliable ground truth annotations. Evaluation of multiple different\nmodalities algorithms has shown that this database is challenging and suitable\nfor future research. Furthermore, we propose a 3D human pose estimation\nalgorithm based on multi-modal data input, which demonstrates the advantages of\nmulti-modal data input for 3D human pose estimation. Code and data will be\nreleased on https://github.com/soullessrobot/Human-M3-Dataset.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:55:41 GMT"},{"version":"v2","created":"Sun, 6 Aug 2023 14:47:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fan","Bohao",""],["Wang","Siqi",""],["Guo","Wenxuan",""],["Zheng","Wenzhao",""],["Feng","Jianjiang",""],["Zhou","Jie",""]]}
{"id":"2308.00629","submitter":"Mohit Rajpal","authors":"Mohit Rajpal, Lac Gia Tran, Yehong Zhang, Bryan Kian Hsiang Low","title":"Hessian-Aware Bayesian Optimization for Decision Making Systems","comments":"Included important citation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many approaches for optimizing decision making systems rely on gradient based\nmethods requiring informative feedback from the environment. However, in the\ncase where such feedback is sparse or uninformative, such approaches may result\nin poor performance. Derivative-free approaches such as Bayesian Optimization\nmitigate the dependency on the quality of gradient feedback, but are known to\nscale poorly in the high-dimension setting of complex decision making systems.\nThis problem is exacerbated if the system requires interactions between several\nactors cooperating to accomplish a shared goal. To address the dimensionality\nchallenge, we propose a compact multi-layered architecture modeling the\ndynamics of actor interactions through the concept of role. Additionally, we\nintroduce Hessian-aware Bayesian Optimization to efficiently optimize the\nmulti-layered architecture parameterized by a large number of parameters.\nExperimental results demonstrate that our method (HA-GP-UCB) works effectively\non several benchmarks under resource constraints and malformed feedback\nsettings.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:56:24 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 15:39:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rajpal","Mohit",""],["Tran","Lac Gia",""],["Zhang","Yehong",""],["Low","Bryan Kian Hsiang",""]]}
{"id":"2308.00630","submitter":"M{\\aa}ns I. Andersson","authors":"M{\\aa}ns I. Andersson, Felix Liu, Stefano Markidis","title":"Anderson Accelerated PMHSS for Complex-Symmetric Linear Systems","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 presents the design and development of an Anderson Accelerated\nPreconditioned Modified Hermitian and Skew-Hermitian Splitting (AA-PMHSS)\nmethod for solving complex-symmetric linear systems with application to\nelectromagnetics problems, such as wave scattering and eddy currents. While it\nhas been shown that the Anderson Acceleration of real linear systems is\nessentially equivalent to GMRES, we show here that the formulation using\nAnderson acceleration leads to a more performant method. We show relatively\ngood robustness compared to existing preconditioned GMRES methods and\nsignificantly better performance due to the faster evaluation of the\npreconditioner. In particular, AA-PMHSS can be applied to solve problems and\nequations arising from electromagnetics, such as time-harmonic eddy current\nsimulations discretized with the Finite Element Method. We also evaluate three\ntest systems present in previous literature. We show that the method is\ncompetitive with two types of preconditioned GMRES. One of the significant\nadvantages of these methods is that the convergence rate is independent of the\ndiscretization size.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:57:15 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Andersson","M\u00e5ns I.",""],["Liu","Felix",""],["Markidis","Stefano",""]]}
{"id":"2308.00631","submitter":"Zhe Wang","authors":"Patrick Pilch, Laur Peedu, Anup Kumar Bera, S. M. Yusuf, Urmas Nagel,\n  Toomas R\\~o\\~om, and Zhe Wang","title":"Field and Polarization Dependent Quantum Spin Dynamics in Honeycomb\n  Magnet Na$_2$Co$_2$TeO$_6$: Magnetic Excitations and Continuum","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":"  We report terahertz spectroscopic measurements of quantum spin dynamics in\nthe spin-1/2 honeycomb magnet Na$_2$Co$_2$TeO$_6$ as a function of applied\nmagnetic field with different terahertz polarizations. Distinct field\ndependencies of the resolved spin dynamics are identified in three regimes,\nwhich are separated by two critical fields at $B_{c1}\\approx 7$ and\n$B_{c2}\\approx 10$ T. A polarization selective continuum is observed in the\nintermediate phase, featuring spin fluctuations of a proximate quantum spin\nliquid.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:01:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Pilch","Patrick",""],["Peedu","Laur",""],["Bera","Anup Kumar",""],["Yusuf","S. M.",""],["Nagel","Urmas",""],["R\u00f5\u00f5m","Toomas",""],["Wang","Zhe",""]]}
{"id":"2308.00632","submitter":"Nicholas Gollins","authors":"Nick Gollins, Koki Ho","title":"Hierarchical Space Exploration Campaign Schedule Optimization With\n  Ambiguous Programmatic Requirements","comments":"40 pages, 9 figures, submitted to Journal of Spacecraft and Rockets","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Space exploration plans are becoming increasingly complex as public agencies\nand private companies target deep-space locations, such as cislunar space and\nbeyond, which require long-duration missions and many supporting systems and\npayloads. Optimizing multi-mission exploration campaigns is challenging due to\nthe large number of required launches as well as their sequencing and\ncompatibility requirements, making the conventional space logistics\nformulations not scalable. To tackle this challenge, this paper proposes an\nalternative approach that leverages a two-level hierarchical optimization\nalgorithm: an evolutionary algorithm is used to explore the campaign scheduling\nsolution space, and each of the solutions is then evaluated using a\ntime-expanded multi-commodity flow mixed-integer linear program. A number of\ncase studies, focusing on the Artemis lunar exploration program, demonstrate\nhow the method can be used to analyze potential campaign architectures. The\nmethod enables a potential mission planner to study the sensitivity of a\ncampaign to program-level parameters such as logistics vehicle availability and\nperformance, payload launch windows, and in-situ resource utilization\ninfrastructure efficiency.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:01:08 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gollins","Nick",""],["Ho","Koki",""]]}
{"id":"2308.00633","submitter":"James Gillanders","authors":"James H. Gillanders, Eleonora Troja, Chris L. Fryer, Marko Ristic,\n  Brendan O'Connor, Christopher J. Fontes, Yu-Han Yang, Nanae Domoto, Salma\n  Rahmouni, Masaomi Tanaka, Ori D. Fox, Simone Dichiara","title":"Heavy element nucleosynthesis associated with a gamma-ray burst","comments":"41 pages, 11 figures, 4 tables. Submitted - comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Kilonovae are a novel class of astrophysical transients, and the only\nobservationally-confirmed site of rapid neutron capture nucleosynthesis (the\nr-process) in the Universe. To date, only a handful of kilonovae have been\ndetected, with just a single spectroscopically-observed event (AT 2017gfo).\nSpectra of AT 2017gfo provided evidence for the formation of elements heavier\nthan iron; however, these spectra were collected during the first ~ 10 days,\nwhen emission from light r-process elements dominates the observations. Heavier\nelements, if synthesised, are expected to shape the late-time evolution of the\nkilonova, beyond the phases for which we have spectral observations. Here we\npresent spectroscopic observations of a rapidly-reddening thermal transient,\nfollowing the gamma-ray burst, GRB 230307A. Early (2.4 day) optical\nspectroscopy identifies the presence of a hot (T ~ 6700 K) thermal continuum.\nBy 29 days, this component has expanded and cooled significantly (T ~ 640 K),\nyet it remains optically thick, indicating the presence of high-opacity ejecta.\nWe show that these properties can only be explained by the merger of compact\nobjects, and further, leads us to infer the production of the heavy lanthanide\nelements. We identify several spectral features (in both absorption and\nemission), whose cause can be explained by newly-synthesised heavy elements.\nThis event marks only the second recorded spectroscopic evidence for the\nsynthesis of r-process elements, and the first to be observed at such late\ntimes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:02:00 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gillanders","James H.",""],["Troja","Eleonora",""],["Fryer","Chris L.",""],["Ristic","Marko",""],["O'Connor","Brendan",""],["Fontes","Christopher J.",""],["Yang","Yu-Han",""],["Domoto","Nanae",""],["Rahmouni","Salma",""],["Tanaka","Masaomi",""],["Fox","Ori D.",""],["Dichiara","Simone",""]]}
{"id":"2308.00634","submitter":"Hasan G\\\"okhan Uysal","authors":"Hasan Gokhan Uysal, Ferkan Yilmaz, Hakan Ali Cirpan, Oguz Kucur and\n  Huseyin Arslan","title":"Quasisynchronous LoRa for LEO Nanosatellite Communications","comments":"5 pages, 4 figures, IEEE International Black Sea Conference on\n  Communications and Networking 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Perfect synchronization in LoRa communications between Low Earth Orbit (LEO)\nsatellites and ground base stations is still challenging, despite the potential\nuse of atomic clocks in LEO satellites, which offer high precision. Even by\nincorporating atomic clocks in LEO satellites, their inherent precision can be\nleveraged to enhance the overall synchronization process, perfect\nsynchronization is infeasible due to a combination of factors such as signal\npropagation delay, Doppler effects, clock drift and atmospheric effects. These\nchallenges require the development of advanced synchronization techniques and\nalgorithms to mitigate their effects and ensure reliable communication from /\nto LEO satellites. However, maintaining acceptable levels of synchronization\nrather than striving for perfection, quasisynchronous (QS) communication can be\nadopted which maintains communication reliability, improves resource\nutilization, reduces power consumption, and ensures scalability as more devices\njoin the communication. Overall, QS communication offers a practical, adaptive,\nand robust solution that enables LEO satellite communications to support the\ngrowing demands of IoT applications and global connectivity. In our\ninvestigation, we explore different chip waveforms such as rectangular and\nraised cosine. Furthermore, for the first time, we study the Symbol Error Rate\n(SER) performance of QS LoRa communication, for different spreading factors\n(SF), over Additive White Gaussian Noise (AWGN) channels.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:03:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Uysal","Hasan Gokhan",""],["Yilmaz","Ferkan",""],["Cirpan","Hakan Ali",""],["Kucur","Oguz",""],["Arslan","Huseyin",""]]}
{"id":"2308.00635","submitter":"Antonio G. Bello-Morales","authors":"Antonio G. Bello-Morales and Antonio L. Maroto","title":"Cosmology in gravity models with broken diffeomorphisms","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"IPARCOS-UCM-23-066","categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the cosmological implications of gravity models which break\ndiffeomorphisms (Diff) invariance down to transverse diffeomorphisms (TDiff).\nWe start from the most general gravitational action involving up to quadratic\nterms in derivatives of the metric tensor and identify TDiff models as the only\nstable theories consistent with local gravity tests. These models propagate an\nadditional scalar graviton and although they are indistinguishable from GR at\nthe post-Newtonian level, their cosmological dynamics exhibits a rich\nphenomenology. Thus we show that the model includes standard $\\Lambda$CDM as a\nsolution when the extra scalar mode is not excited, but different cosmological\nevolutions driven by the new term are possible. In particular, we show that for\na soft Diff breaking, the new contribution always behaves as a cosmological\nconstant at late times. When the extra contribution is not negligible,\ngenerically its evolution either behaves as dark energy or tracks the dominant\nbackground component. Depending on the initial conditions, solutions in which\nthe universe evolves from an expanding to a contracting phase, eventually\nrecollapsing are also possible.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:05:39 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bello-Morales","Antonio G.",""],["Maroto","Antonio L.",""]]}
{"id":"2308.00636","submitter":"Kuntal Pal","authors":"Mamta Gautam, Kunal Pal, Kuntal Pal, Ankit Gill, Nitesh Jaiswal, and\n  Tapobrata Sarkar","title":"Spread complexity evolution in quenched interacting quantum systems","comments":null,"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 analyse time evolution of spread complexity (SC) in an isolated\ninteracting quantum many-body system when it is subjected to a sudden quench.\nThe differences in characteristics of the time evolution of the SC for\ndifferent time scales is analysed, both in integrable and chaotic models. For a\nshort time after the quench, the SC shows universal quadratic growth,\nirrespective of the initial state or the nature of the Hamiltonian, with the\ntime scale of this growth being determined by the local density of states. The\ncharacteristics of the SC in the next phase depend upon the nature of the\nsystem, and we show that depending upon whether the survival probability of an\ninitial state is Gaussian or exponential, the SC can continue to grow\nquadratically, or it can show linear growth. To understand the behaviour of the\nSC at late times, we consider sudden quenches in two models, a full random\nmatrix in the Gaussian orthogonal ensemble, and a spin-1/2 system with\ndisorder. We observe that for the full random matrix model and the chaotic\nphase of the spin-1/2 system, the complexity shows linear growth at early times\nand saturation at late times. The full random matrix case shows a peak in the\nintermediate time region, whereas this feature is less prominent in the\nspin-1/2 system, as we explain.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:10:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gautam","Mamta",""],["Pal","Kunal",""],["Pal","Kuntal",""],["Gill","Ankit",""],["Jaiswal","Nitesh",""],["Sarkar","Tapobrata",""]]}
{"id":"2308.00637","submitter":"Felix Liu","authors":"Felix Liu, Albin Fredriksson, Stefano Markidis","title":"Krylov Solvers for Interior Point Methods with Applications in Radiation\n  Therapy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interior point methods are widely used for different types of mathematical\noptimization problems. Many implementations of interior point methods in use\ntoday rely on direct linear solvers to solve systems of equations in each\niteration. The need to solve ever larger optimization problems more efficiently\nand the rise of hardware accelerators for general purpose computing has led to\na large interest in using iterative linear solvers instead, with the major\nissue being inevitable ill-conditioning of the linear systems arising as the\noptimization progresses. We investigate the use of Krylov solvers for interior\npoint methods in solving optimization problems from radiation therapy. We\nimplement a prototype interior point method using a so called doubly augmented\nformulation of the Karush-Kuhn-Tucker (KKT) linear system of equations,\noriginally proposed by Forsgren and Gill, and evaluate its performance on real\noptimization problems from radiation therapy. Crucially, our implementation\nuses a preconditioned conjugate gradient method with Jacobi preconditioning\ninternally. Our measurements of the conditioning of the linear systems indicate\nthat the Jacobi preconditioner improves the conditioning of the systems to a\ndegree that they can be solved iteratively, but there is room for further\nimprovement in that regard. Furthermore, profiling of our prototype code shows\nthat it is suitable for GPU acceleration, which may further improve its\nperformance in practice. Overall, our results indicate that our method can find\nsolutions of acceptable accuracy in reasonable time, even with a simple Jacobi\npreconditioner.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:10:49 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Liu","Felix",""],["Fredriksson","Albin",""],["Markidis","Stefano",""]]}
{"id":"2308.00638","submitter":"Yuhan Yang","authors":"Yu-Han Yang, Eleonora Troja, Brendan O'Connor, Chris L. Fryer,\n  Myungshin Im, Joe Durbak, Gregory S. H. Paek, Roberto Ricci, Cl\\'ecio R. De\n  Bom, James H. Gillanders, Alberto J. Castro-Tirado, Zong-Kai Peng, Simone\n  Dichiara, Geoffrey Ryan, Hendrik van Eerten, Zi-Gao Dai, Seo-Won Chang,\n  Hyeonho Choi, Kishalay De, Youdong Hu, Charles D. Kilpatrick, Alexander\n  Kutyrev, Mankeun Jeong, Chung-Uk Lee, Martin Makler, Felipe Navarete, Ignacio\n  P\\'erez-Garc\\'ia","title":"A lanthanide-rich kilonova in the aftermath of a long gamma-ray burst","comments":"47 pages, 14 figures, 9 tables; submitted; a minor typo fixed","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Kilonovae are a rare class of astrophysical transients powered by the\nradioactive decay of nuclei heavier than iron, synthesized in the merger of two\ncompact objects. Over the first few days, the kilonova evolution is dominated\nby a large number of radioactive isotopes contributing to the heating rate. On\ntimescales of weeks to months, its behavior is predicted to differ depending on\nthe ejecta composition and merger remnant. However, late-time observations of\nknown kilonovae are either missing or limited. Here we report observations of a\nluminous red transient with a quasi-thermal spectrum, following an unusual\ngamma-ray burst of long duration. We classify this thermal emission as a\nkilonova and track its evolution up to two months after the burst. At these\nlate times, the recession of the photospheric radius and the rapidly-decaying\nbolometric luminosity ($L_{\\rm bol}\\propto t^{-2.7\\pm 0.4}$) support the\nrecombination of lanthanide-rich ejecta as they cool.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:12:20 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 15:54:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Yu-Han",""],["Troja","Eleonora",""],["O'Connor","Brendan",""],["Fryer","Chris L.",""],["Im","Myungshin",""],["Durbak","Joe",""],["Paek","Gregory S. H.",""],["Ricci","Roberto",""],["De Bom","Cl\u00e9cio R.",""],["Gillanders","James H.",""],["Castro-Tirado","Alberto J.",""],["Peng","Zong-Kai",""],["Dichiara","Simone",""],["Ryan","Geoffrey",""],["van Eerten","Hendrik",""],["Dai","Zi-Gao",""],["Chang","Seo-Won",""],["Choi","Hyeonho",""],["De","Kishalay",""],["Hu","Youdong",""],["Kilpatrick","Charles D.",""],["Kutyrev","Alexander",""],["Jeong","Mankeun",""],["Lee","Chung-Uk",""],["Makler","Martin",""],["Navarete","Felipe",""],["P\u00e9rez-Garc\u00eda","Ignacio",""]]}
{"id":"2308.00639","submitter":"Somayeh Moradi","authors":"Antonino Ficarra, J\\\"urgen Herzog, Somayeh Moradi","title":"The limit behaviour of $\\mathfrak{m}^kM$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $S$ be the polynomial ring over a field $K$ in a finite set of variables,\nand let $\\mathfrak{m}$ be the graded maximal ideal of $S$. For a finitely\ngenerated graded $S$-module $M$ and all integers $k\\gg 0$, we show that\n$\\mathfrak{m}^kM$ is componentwise linear, we describe the pattern of the\nBetti-diagram of $\\mathfrak{m}^kM$ when $M$ is an ideal and\n$\\mathrm{char}(K)=0$, and show that $\\mathfrak{m}^kM$ has linear quotients if\n$M$ is a monomial ideal.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:13:09 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 06:23:00 GMT"},{"version":"v3","created":"Thu, 3 Aug 2023 18:25:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ficarra","Antonino",""],["Herzog","J\u00fcrgen",""],["Moradi","Somayeh",""]]}
{"id":"2308.00640","submitter":"Yuhao Lu","authors":"Yuhao Lu, Yixuan Fan, Beixing Deng, Fangfu Liu, Yali Li, Shengjin Wang","title":"VL-Grasp: a 6-Dof Interactive Grasp Policy for Language-Oriented Objects\n  in Cluttered Indoor Scenes","comments":"8 pages, 4 figures, IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robotic grasping faces new challenges in human-robot-interaction scenarios.\nWe consider the task that the robot grasps a target object designated by\nhuman's language directives. The robot not only needs to locate a target based\non vision-and-language information, but also needs to predict the reasonable\ngrasp pose candidate at various views and postures. In this work, we propose a\nnovel interactive grasp policy, named Visual-Lingual-Grasp (VL-Grasp), to grasp\nthe target specified by human language. First, we build a new challenging\nvisual grounding dataset to provide functional training data for robotic\ninteractive perception in indoor environments. Second, we propose a 6-Dof\ninteractive grasp policy combined with visual grounding and 6-Dof grasp pose\ndetection to extend the universality of interactive grasping. Third, we design\na grasp pose filter module to enhance the performance of the policy.\nExperiments demonstrate the effectiveness and extendibility of the VL-Grasp in\nreal world. The VL-Grasp achieves a success rate of 72.5\\% in different indoor\nscenes. The code and dataset is available at\nhttps://github.com/luyh20/VL-Grasp.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:13:35 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lu","Yuhao",""],["Fan","Yixuan",""],["Deng","Beixing",""],["Liu","Fangfu",""],["Li","Yali",""],["Wang","Shengjin",""]]}
{"id":"2308.00641","submitter":"Peter Danchev","authors":"Peter V. Danchev and Patrick W. Keef","title":"Generalized Bassian and other Mixed Abelian Groups with Bounded\n  p-Torsion","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is known that a mixed abelian group G with torsion T is Bassian if, and\nonly if, it has finite torsion-free rank and has finite p-torsion (i.e., each\nTp is finite). It is also known that if G is generalized Bassian, then each pTp\nis finite, so that G has bounded p-torsion. To further describe the generalized\nBassian groups, we start by characterizing the groups in some important classes\nof mixed groups with bounded p-torsion (e.g., the balanced-projective groups\nand the Warfield groups). We then prove that all generalized Bassian groups\nmust have finite torsion-free rank, thus answering a question recently posed in\nActa Math. Hung. (2022) by Chekhlov-Danchev-Goldsmith. This implies that every\ngeneralized Bassian group must be a B+E-group; i.e., the direct sum of a\nBassian group and an elementary group. The converse is shown to hold for a\nlarge class of mixed groups, including the Warfield groups. It is also proved\nthat G is a B+E-group if, and only if, it is a subgroup of a generalized\nBassian group.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:13:57 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Danchev","Peter V.",""],["Keef","Patrick W.",""]]}
{"id":"2308.00642","submitter":"Monika Dalal","authors":"Monika Dalal, Sucheta Dutt, Ranjeet Sehmi","title":"Reversible complement cyclic codes over finite chain rings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Let k be an arbitrary element of a finite commutative chain ring R and u be a\nunit in R. In this work, we present necessary conditions which are sufficient\nas well for a cyclic code to be a (u,k) reversible complement code over R.\nUsing these conditions, all principally generated cyclic codes over the ring\nZ_{2}+vZ_{2}+v^{2}Z_{2}, v^{3}=0 of length 4 have been checked to find whether\nthey are (1,1) reversible complement or not.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:15:45 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dalal","Monika",""],["Dutt","Sucheta",""],["Sehmi","Ranjeet",""]]}
{"id":"2308.00643","submitter":"Jonathan Gl\\\"ockle","authors":"Jonathan Gl\\\"ockle","title":"Initial data sets with dominant energy condition admitting no smooth dec\n  spacetime extension","comments":"10 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There are two versions of the dominant energy condition (=dec): The original\none for Lorentzian manifolds and an associated one for initial data sets. If a\nLorentzian manifold satisfies dec, then so does the induced initial set on any\nembedded spacelike hypersurface. In this article, we discuss the question of a\npotential converse of this: Is every dec initial data set the induced one on a\nspacelike hypersurface within a suitably chosen dec Lorentzian manifold? We\nprovide an example showing that in general the answer is no if we require all\nstructures to be smooth.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:17:46 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Gl\u00f6ckle","Jonathan",""]]}
{"id":"2308.00644","submitter":"Melvyn B. Nathanson","authors":"Melvyn B. Nathanson","title":"Permutation Patterns of the Iterated Syracuse Function","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\Omega$ be the set of odd positive integers and let $S:\\Omega\n\\rightarrow \\Omega$ be the Syracuse function. It is proved that, for every\npermutation $\\sigma$ of $(1,2,3)$, the set of triples of the form\n$(m,S(m),S^2(m))$ with permutation pattern $\\sigma$ has positive density, and\nthese densities are computed. However, there exist permutations $\\tau$ of\n$(1,2,3,4)$ such that no quadruple $(m,S(m), S^2(m), S^3(m))$ has permutation\npattern $\\tau$. This implies the nonexistence of certain permutation patterns\nof $n$-tuples $(m,S(m),\\ldots, S^{n-1}(m))$ for all $n \\geq 4$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:18:56 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Nathanson","Melvyn B.",""]]}
{"id":"2308.00645","submitter":"Noah Goodall","authors":"Noah Goodall","title":"Comparability of Automated Vehicle Crash Databases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advanced driving assistance systems are available on many late-model\nvehicles, and automated driving systems are testing on public roads. Regulators\nand developers continue to assess the safety of these vehicles by comparing\nautomated vehicle crash rates to baseline, human-driven crash rates. While\nthere are several widely-cited automated vehicle and conventional vehicle crash\ndatabases, these databases have different underlying assumptions and inclusion\ncriteria. Crash rates among databases may be directly comparable only with\nsignificant filtering and normalization, if at all. This paper reviews current\nautomated vehicle and baseline human-driven crash databases and evaluates their\ncomparability. Recommendations are presented to improve their comparability,\nboth in terms of normalization and contextualization, as well as additional\ndata fields that can be incorporated into existing databases. These findings\nmay assist researchers, regulators, and automated vehicle developers attempting\nto evaluate the safety of driving automation systems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:23:06 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Goodall","Noah",""]]}
{"id":"2308.00646","submitter":"Nana Liu","authors":"Shi Jin and Nana Liu","title":"Analog quantum simulation of partial differential equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum simulators were originally proposed for simulating one partial\ndifferential equation (PDE) in particular - Schrodinger's equation. Can quantum\nsimulators also efficiently simulate other PDEs? While most computational\nmethods for PDEs - both classical and quantum - are digital (PDEs must be\ndiscretised first), PDEs have continuous degrees of freedom. This suggests that\nan analog representation can be more natural. While digital quantum degrees of\nfreedom are usually described by qubits, the analog or continuous quantum\ndegrees of freedom can be captured by qumodes. Based on a method called\nSchrodingerisation, we show how to directly map D-dimensional linear PDEs onto\na (D+1)-qumode quantum system where analog or continuous-variable Hamiltonian\nsimulation on D+1 qumodes can be used. This very simple methodology does not\nrequire one to discretise PDEs first, and it is not only applicable to linear\nPDEs but also to some nonlinear PDEs and systems of nonlinear ODEs. We show\nsome examples using this method, including the Liouville equation, heat\nequation, Fokker-Planck equation, Black-Scholes equations, wave equation and\nMaxwell's equations. We also devise new protocols for linear PDEs with random\ncoefficients, important in uncertainty quantification, where it is clear how\nthe analog or continuous-variable framework is most natural. This also raises\nthe possibility that some PDEs may be simulated directly on analog quantum\nsystems by using Hamiltonians natural for those quantum systems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:23:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Jin","Shi",""],["Liu","Nana",""]]}
{"id":"2308.00647","submitter":"Kun Hu","authors":"Kun Hu, Tanmoy Paul, Taotao Qiu","title":"Tensor Perturbations from Bounce Inflation Scenario in f(Q) Gravity","comments":"17 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":"  In this paper, we construct a bounce inflation cosmological scenario in the\nframework of the modified symmetric teleparallel gravity, namely f(Q) theory,\nand investigate the tensor perturbations therein. As is well-known, the tensor\nperturbations generated in the very early Universe (inflation and pre-inflation\nregions) can account for the primordial gravitational waves (PGWs) that are to\nbe detected by the next generation of GW experiments. We discuss the stability\ncondition of the tensor perturbations in the bounce inflation process and\ninvestigate in detail the evolution of the perturbation variable. The general\nform of the tensor power spectrum is obtained both for large as well as small\nscale modes. As a result, we show for both kinds of modes (short or long\nwavelength modes), the tensor spectrum may get a positive tilt in the\nparametric range where the tensor perturbation proves to be stable -- this\ninterestingly hints an enhancement of gravitational waves' amplitude in the\nbackground of the f(Q) bounce-inflation scenario. Moreover, we study the\nLQC-like scenario as a specific case of our model, in which, the primordial\ntensor power spectrum turns out to be nearly scale-invariant on both small and\nlarge scales.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:23:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hu","Kun",""],["Paul","Tanmoy",""],["Qiu","Taotao",""]]}
{"id":"2308.00648","submitter":"Natasha Latouf","authors":"Natasha Latouf, Avi Mandell, Geronimo Villanueva, Michael Moore,\n  Nicholas Susemiehl, Vincent Kofman, Michael Himes","title":"Bayesian Analysis for Remote Biosignature Identification on exoEarths\n  (BARBIE) I: Using Grid-Based Nested Sampling in Coronagraphy Observation\n  Simulations for H2O","comments":"15 pages, 9 figures, 2 tables, accepted to AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Detecting H2O in exoplanet atmospheres is the first step on the path to\ndetermining planet habitability. Coronagraphic design currently limits the\nobserving strategy used to detect H2O, requiring the choice of specific\nbandpasses to optimize abundance constraints. In order to examing the optimal\nobserving strategy for initial characterization of habitable planets using\ncoronagraph-based direct imaging, we quantify the detectability of H2O as a\nfunction of signal-to-noise ratio (SNR) and molecular abundance across 25\nbandpasses in the visible wavelength range (0.5-1 micron). We use a\npre-constructed grid consisting of 1.4 million geometric albedo spectra across\na range of abundance and pressure, and interpolate the produce forward models\nfor an efficient nested sampling routine, PSGnest. We first test the\ndetectability of H2O in atmospheres that mimix a modern-Earth twin, and then\nexpand to examine a wider range of H2O abundances; for each abundance value, we\nconstrain the optimal 20% bandpasses based on the effective signal-to-noise\nratio (SNR) of the data. We present our findings of H2O detectability as\nfunctions of SNR, wavelength, and abundance, and discuss how to use these\nresults for optimizing future coronographic instrument design. We find that\nthere are specific points in wavelength where H2o can be detected down to 0.74\nmicron with moderate-SNR data for abundances at the upper end of Earth's\npresumed historical values, while at 0.9 micron, detectability is possible with\nlow-SNR data at modern Earth abundances of H2O.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:23:59 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Latouf","Natasha",""],["Mandell","Avi",""],["Villanueva","Geronimo",""],["Moore","Michael",""],["Susemiehl","Nicholas",""],["Kofman","Vincent",""],["Himes","Michael",""]]}
{"id":"2308.00649","submitter":"Patrick Lopatto","authors":"Patrick Lopatto, Kavita Ramanan, Xiaoyu Xie","title":"Quenched large deviation principles for random projections of $\\ell_p^n$\n  balls","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $(k_n)_{n \\in \\mathbb{N}}$ be a sequence of positive integers growing to\ninfinity at a sublinear rate, $k_n \\rightarrow \\infty$ and $k_n/n \\rightarrow\n0$ as $n \\rightarrow \\infty$. Given a sequence of $n$-dimensional random\nvectors $\\{Y^{(n)}\\}_{n \\in \\mathbb{N}}$ belonging to a certain class, which\nincludes uniform distributions on suitably scaled $\\ell_p^n$-balls or\n$\\ell_p^n$-spheres, $p \\geq 2$, and product distributions with sub-Gaussian\nmarginals, we study the large deviations behavior of the corresponding sequence\nof $k_n$-dimensional orthogonal projections $n^{-1/2} \\boldsymbol{a}_{n,k_n}\nY^{(n)}$, where $\\boldsymbol{a}_{n,k_n}$ is an $(n \\times k_n)$-dimensional\nprojection matrix lying in the Stiefel manifold of orthonormal $k_n$-frames in\n$\\mathbb{R}^n$. For almost every sequence of projection matrices, we establish\na large deviation principle (LDP) for the corresponding sequence of\nprojections, with a fairly explicit rate function that does not depend on the\nsequence of projection matrices. As corollaries, we also obtain quenched LDPs\nfor sequences of $\\ell_2$-norms and $\\ell_\\infty$-norms of the coordinates of\nthe projections. Past work on LDPs for projections with growing dimension has\nmainly focused on the annealed setting, where one also averages over the random\nprojection matrix, chosen from the Haar measure, in which case the coordinates\nof the projection are exchangeable. The quenched setting lacks such symmetry\nproperties, and gives rise to significant new challenges in the setting of\ngrowing projection dimension. Along the way, we establish new Gaussian\napproximation results on the Stiefel manifold that may be of independent\ninterest. Such LDPs are of relevance in asymptotic convex geometry, statistical\nphysics and high-dimensional statistics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:28:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lopatto","Patrick",""],["Ramanan","Kavita",""],["Xie","Xiaoyu",""]]}
{"id":"2308.00650","submitter":"Prashant Thakur","authors":"Prashant Thakur, Tuhin Malik, Arpan Das, T. K. Jha, Constan\\c{c}a\n  Provid\\^encia","title":"Exploring robust correlations between fermionic dark matter model\n  parameters and neutron star properties: A two-fluid perspective","comments":"15 Pages, 12 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The current observational properties of neutron stars have not definitively\nruled out the possibility of dark matter. In this study, we primarily focus on\nexploring correlations between the dark matter model parameters and different\nneutron star properties using a rich set of EOSs. We adopt a two-fluid approach\nto calculate the properties of neutron stars. For the nuclear matter EOS, we\nemploy several realistic EOS derived from the relativistic mean field model\n(RMF), each exhibiting varying stiffness and composition. In parallel, we look\ninto the dark matter EOS, considering fermionic matter with repulsive\ninteraction described by a relativistic mean field Lagrangian. A reasonable\nrange of parameters is sampled meticulously. Interestingly, our results reveal\na promising correlation between the dark matter model parameters and stellar\nproperties, particularly when we ignore the uncertainties in the nuclear matter\nEOS. However, when introducing uncertainties in the nuclear sector, the\ncorrelation weakens, suggesting that the task of conclusively constraining any\nparticular dark matter model might be challenging using global properties\nalone, such as mass, radius, and tidal deformability. Notably, we find that\ndark-matter admixed stars tend to have higher central baryonic density,\npotentially allowing for non-nucleonic degrees of freedom or direct Urca\nprocesses in stars with lower masses. There is also a tantalizing hint\nregarding the detection of stars with the same mass but different surface\ntemperatures, which may indicate the presence of dark matter. With our robust\nand extensive dataset, we delve deeper and demonstrate that even in the\npresence of dark matter, the semi-universal C-Love relation remains intact.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:32:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Thakur","Prashant",""],["Malik","Tuhin",""],["Das","Arpan",""],["Jha","T. K.",""],["Provid\u00eancia","Constan\u00e7a",""]]}
{"id":"2308.00651","submitter":"Tom\\'a\\v{s} Gonda","authors":"Tobias Fritz, Tom\\'a\\v{s} Gonda, Antonio Lorenzin, Paolo Perrone, and\n  Dario Stein","title":"Absolute continuity, supports and idempotent splitting in categorical\n  probability","comments":"83 pages (including 17 page appendix and many string diagrams)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.LO math.CT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Markov categories have recently turned out to be a powerful high-level\nframework for probability and statistics. They accomodate purely categorical\ndefinitions of notions like conditional probability and almost sure equality,\nas well as proofs of fundamental resutlts such as the Hewitt-Savage 0/1 Law,\nthe De Finetti Theorem and the Ergodic Decomposition Theorem. In this work, we\ndevelop additional relevant notions from probability theory in the setting of\nMarkov categories. This comprises improved versions of previously introduced\ndefinitions of absolute continuity and supports, as well as a detailed study of\nidempotents and idempotent splitting in Markov categories. Our main result on\nidempotent splitting is that every idempotent measurable Markov kernel between\nstandard Borel spaces splits through another standard Borel space, and we\nderive this as an instance of a general categorical criterion for idempotent\nsplitting in Markov categories.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:36:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fritz","Tobias",""],["Gonda","Tom\u00e1\u0161",""],["Lorenzin","Antonio",""],["Perrone","Paolo",""],["Stein","Dario",""]]}
{"id":"2308.00652","submitter":"Avik De Dr.","authors":"Avik De, Tee-How Loo, Emmanuel N. Saridakis","title":"Non-metricity with bounday terms: $f(Q,C)$ gravity and cosmology","comments":"minor changes, references added","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We formulate $f(Q,C)$ gravity and cosmology. Such a construction is based on\nthe symmetric teleparallel geometry, but apart form the non-metricity scalar\n$Q$ we incorporate in the Lagrangian the boundary term $C$ of its difference\nfrom the standard Levi-Civita Ricci scalar $\\mathring R$. We extract the\ngeneral metric and affine connection field equations, we apply them in a\ncosmological framework, and making two gauge choices we obtain the modified\nFriedmann equations. As we show, we acquire an effective dark-energy sector of\ngeometrical origin, which can lead to interesting cosmological phenomenology.\nAdditionally, we may obtain an effective interaction between matter and dark\nenergy. Finally, examining a specific model, we show that we can obtain the\nusual thermal history of the universe, with the sequence of matter and\ndark-energy epochs, while the effective dark-energy equation-of-state parameter\ncan be quintessence-like, phantom-like, or cross the phantom-divide during\nevolution.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:36:07 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:44:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["De","Avik",""],["Loo","Tee-How",""],["Saridakis","Emmanuel N.",""]]}
{"id":"2308.00653","submitter":"Sergey Khrapak","authors":"Sergay Khrapak and Alexey Khrapak","title":"Note: Stokes-Einstein relation without hydrodynamic diameter in the\n  TIP4P/Ice water model","comments":"Short note includes 3 pages and 1 figure","journal-ref":"J. Chem. Phys. 158, 206101 (2023)","doi":"10.1063/5.0150871","report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft physics.chem-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is demonstrated that self-diffusion and shear viscosity data for the\nTIP4P/Ice water model reported recently [L. Baran, W. Rzysko and L. MacDowell,\nJ. Chem. Phys. {\\bf 158}, 064503 (2023)] obey the microscopic version of the\nStokes-Einstein relation without the hydrodynamic diameter.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:37:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Khrapak","Sergay",""],["Khrapak","Alexey",""]]}
{"id":"2308.00654","submitter":"Manav Batavia","authors":"H. Ananthnarayan, Manav Batavia, Omkar Javadekar","title":"When do associated graded modules have pure resolutions?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a finitely generated module $M$ over a Noetherian local ring $R$, one\nwould like to know when the corresponding associated graded module has a pure\nresolution over $G_{\\mathfrak{m}}(R)$. In this article, we identify a complex\nof free $G_{\\mathfrak{m}}(R)$-modules, arising from given free resolution of\n$M$ over $R$, which is a resolution of $G_{\\mathfrak{m}}(M)$ if and only if\n$G_{\\mathfrak{m}}(M)$ is a pure $G_{\\mathfrak{m}}(R)$-module. We also give\nseveral applications of the purity of $G_{\\mathfrak{m}}(M)$ in this paper.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:40:18 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Ananthnarayan","H.",""],["Batavia","Manav",""],["Javadekar","Omkar",""]]}
{"id":"2308.00655","submitter":"Xiaolei Diao","authors":"Xiaolei Diao, Daqian Shi, Jian Li, Lida Shi, Mingzhe Yue, Ruihua Qi,\n  Chuntao Li, Hao Xu","title":"Toward Zero-shot Character Recognition: A Gold Standard Dataset with\n  Radical-level Annotations","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612201","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical character recognition (OCR) methods have been applied to diverse\ntasks, e.g., street view text recognition and document analysis. Recently,\nzero-shot OCR has piqued the interest of the research community because it\nconsiders a practical OCR scenario with unbalanced data distribution. However,\nthere is a lack of benchmarks for evaluating such zero-shot methods that apply\na divide-and-conquer recognition strategy by decomposing characters into\nradicals. Meanwhile, radical recognition, as another important OCR task, also\nlacks radical-level annotation for model training. In this paper, we construct\nan ancient Chinese character image dataset that contains both radical-level and\ncharacter-level annotations to satisfy the requirements of the above-mentioned\nmethods, namely, ACCID, where radical-level annotations include radical\ncategories, radical locations, and structural relations. To increase the\nadaptability of ACCID, we propose a splicing-based synthetic character\nalgorithm to augment the training samples and apply an image denoising method\nto improve the image quality. By introducing character decomposition and\nrecombination, we propose a baseline method for zero-shot OCR. The experimental\nresults demonstrate the validity of ACCID and the baseline model quantitatively\nand qualitatively.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:41:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Diao","Xiaolei",""],["Shi","Daqian",""],["Li","Jian",""],["Shi","Lida",""],["Yue","Mingzhe",""],["Qi","Ruihua",""],["Li","Chuntao",""],["Xu","Hao",""]]}
{"id":"2308.00656","submitter":"Anthony Elmendorf","authors":"A. D. Elmendorf","title":"Multicategories from Symmetric Monoidal Categories","comments":"56 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper considers the possible underlying multicategories for a symmetric\nmonoidal category, and shows that, up to canonical and coherent isomorphism,\nthere really is only one. As a result, there is a well-defined forgetful\nfunctor from symmetric monoidal categories to multicategories, as long as all\nmorphisms of symmetric monoidal categories are at least lax symmetric monoidal.\nThe paper also shows that this forgetful functor has a left adjoint, and that\nthe monad of the adjunction gives a strictification construction.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:44:11 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Elmendorf","A. D.",""]]}
{"id":"2308.00657","submitter":"Wanda Diaz Merced","authors":"Ruoning Lan (1) Wanda Diaz Merced (2) ((1) University of Brown\n  Providence, RI (2) Astroparticle and Cosmology Laboratory Paris, France)","title":"Touching the Sky: The Use of Arduino in Transferring Telescopic Light to\n  Haptic Vibrations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The chaotic nature of outer space and the limitation of visual displays\ncommand for much more than visual display of information and for the\nintegration of other sensorial modalities during data exploration. Haptic real\ntime devices may enrich the detection of astronomical events that otherwise\nwould escape the eyes. Departing from the Harvard Astronomy Lab Orchestar\n(color Arduino) we present the work in progress of the Proof of Concept (PoC)\nof a sensitive yet simple device to Bluetooth transfer real time color into\nhaptic motion built by Adafruit components. We assemble 2 Adafruit nRF52840\nfeather express with the RGB color sensor and haptic driver respectively to\ntrigger vibrations according to the color variation from external light\nsources. In addition, a transparent hexagon cover will be mounted on the color\nsensor to maximise absorbed light from the telescope. The device aims to be a\ntranslator for people to see hear and feel the hidden information from the\noriginal data set. We also present its application in the calculation of\ncomplex astrophysics quantities such as the masses of solar coronal mass\nejections.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:45:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lan","Ruoning",""],["Merced","Wanda Diaz",""]]}
{"id":"2308.00658","submitter":"Amina Fellan","authors":"Amina Fellan, Ainur Daurembekova, Hans D. Schotten","title":"Considerations on the EMF Exposure Relating to the Next Generation\n  Non-Terrestrial Networks","comments":"to be listed in the proceedings of IEEE International Conference on\n  Mobile Ad-Hoc and Smart Systems (MASS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The emerging fifth generation (5G) and the upcoming sixth generation (6G)\ncommunication technologies introduce the use of space- and airborne networks in\ntheir architectures under the scope of non-terrestrial networks (NTNs). With\nthis integration of satellite and aerial platform networks, better coverage,\nnetwork flexibility and easier deployment can be achieved. Correspondingly,\nsatellite broadband internet providers have launched an increasing number of\nsmall satellites operating in low earth orbit (LEO). These recent developments\nimply an increased electromagnetic field (EMF) exposure to humans and the\nenvironment. In this work, we provide a short overview of the state of\nconsumer-grade satellite networks including broadband satellites and future NTN\nservices. We also consider the regulatory state governing their operation\nwithin the context of EMF exposure. Finally, we highlight the aspects that are\nrelevant to the assessment of EMF exposure in relation to NTNs.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:48:50 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Fellan","Amina",""],["Daurembekova","Ainur",""],["Schotten","Hans D.",""]]}
{"id":"2308.00659","submitter":"Partha Kumbhakar","authors":"Partha Kumbhakar, Varadharaj R. Srinivasan","title":"Liouville's Theorem on integration in finite terms for $\\mathrm\n  D_\\infty,$ $ \\mathrm{SL}_2$ and Weierstrass field extensions","comments":"10 pages, accepted for a publication at archiv der mathematik","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $k$ be a differential field of characteristic zero and the field of\nconstants $C$ of $k$ be an algebraically closed field. Let $E$ be a\ndifferential field extension of $k$ having $C$ as its field of constants and\nthat $E=E_m\\supseteq E_{m-1}\\supseteq\\cdots\\supseteq E_1\\supseteq E_0=k,$ where\n$E_i$ is either an elementary extension of $E_{i-1}$ or $E_i=E_{i-1}(t_i,\nt'_i)$ and $t_i$ is weierstrassian (in the sense of Kolchin ([Page 803,\nKolchin1953]) over $E_{i-1}$ or $E_i$ is a Picard-Vessiot extension of\n$E_{i-1}$ having a differential Galois group isomorphic to either the special\nlinear group $\\mathrm{SL}_2(C)$ or the infinite dihedral subgroup\n$\\mathrm{D}_\\infty$ of $\\mathrm{SL}_2(C).$ In this article, we prove that\nLiouville's theorem on integration in finite terms ([Theorem, Rosenlicht1968])\nholds for $E$. That is, if $\\eta\\in E$ and $\\eta'\\in k$ then there is a\npositive integer $n$ and for $i=1,2,\\dots,n,$ there are elements $c_i\\in C,$\n$u_i\\in k\\setminus \\{0\\}$ and $v\\in k$ such that\n$$\\eta'=\\sum^n_{i=1}c_i\\frac{u'_i}{u_i}+v'.$$\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:50:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Kumbhakar","Partha",""],["Srinivasan","Varadharaj R.",""]]}
{"id":"2308.00662","submitter":"Axel Brandenburg","authors":"Axel Brandenburg, Nousaba Nasrin Protiti","title":"Electromagnetic conversion into kinetic and thermal energies","comments":"22 pages, 16 figures, 3 tables, published in Entropy, special issue\n  on Energy Transfer and Dissipation in Plasma Turbulence","journal-ref":"Entropy 25, 1270 (2023)","doi":"10.3390/e25091270","report-no":"NORDITA-2023-043","categories":"physics.plasm-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conversion of electromagnetic energy into magnetohydrodynamic energy occurs\nwhen the electric conductivity changes from negligible to finite values. This\nprocess is relevant during the epoch of reheating of the early Universe at the\nend of inflation and before the emergence of the radiation-dominated era. We\nfind that conversion into kinetic and thermal energies is primarily the result\nof electric energy dissipation and that the magnetic energy plays only a\nsecondary role in this process. This means that, since electric energy\ndominates over magnetic energy during inflation and reheating, significant\namounts of electric energy can be converted into magnetohydrodynamic energy\nwhen conductivity emerges early enough, before the relevant length scales\nbecome stable.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:57:11 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:29:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Brandenburg","Axel",""],["Protiti","Nousaba Nasrin",""]]}
{"id":"2308.00663","submitter":"Marcin Wro\\'nski","authors":"P. Kot, M. Wro\\'nski, A. Baczma\\'nski, A. Ludwik, S. Wro\\'nski, K.\n  Wierzbanowski, Ch. Scheffz\\\"uk, J. Pilch and G. Farkas","title":"A novel method of experimental determination of grain stresses and\n  critical resolved shear stresses for slip and twin systems in a magnesium\n  alloy","comments":"61 pages, 31 figures, 6 pages in Appendix, Published in Measurement","journal-ref":null,"doi":"10.1016/j.measurement.2023.113469","report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A novel original method of determination of stresses and critical resolved\nshear stresses (CRSSs) using neutron diffraction was proposed. In this method,\nbased on the crystallite group method, the lattice strains were measured in\ndifferent directions and using different reflections hkl during uniaxial\ndeformation of magnesium alloy AZ31. The advantage of this method is that the\nstresses for groups of grains having similar orientations can be determined\ndirectly from measurement without any models used for data interpretation. The\nobtained results are unambiguous and do not depend on the models assumptions as\nin previous works. Moreover, it was possible for the first time to determine\nthe uncertainty of the measured CRSS values and local stresses at groups of\ngrains. The used methodology allowed for the determination of stress\npartitioning between grains having different orientations and for an\nexplanation of the anisotropic mechanical behaviour of the strongly textured\nalloy. Finally, the CRSS values allowed for the validation of the type of\nintergranular interaction assumed in the elastic-plastic self-consistent model\nand for a significant reduction of the number of unknown parameters when the\nmodel is adjusted to the experimental data.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:59:35 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 16:57:03 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 20:55:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kot","P.",""],["Wro\u0144ski","M.",""],["Baczma\u0144ski","A.",""],["Ludwik","A.",""],["Wro\u0144ski","S.",""],["Wierzbanowski","K.",""],["Scheffz\u00fck","Ch.",""],["Pilch","J.",""],["Farkas","G.",""]]}
{"id":"2308.00664","submitter":"Abhiroop Bhattacharjee","authors":"Abhiroop Bhattacharjee, Abhishek Moitra, and Priyadarshini Panda","title":"HyDe: A Hybrid PCM/FeFET/SRAM Device-search for Optimizing Area and\n  Energy-efficiencies in Analog IMC Platforms","comments":"9 pages, 10 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Today, there are a plethora of In-Memory Computing (IMC) devices- SRAMs, PCMs\n& FeFETs, that emulate convolutions on crossbar-arrays with high throughput.\nEach IMC device offers its own pros & cons during inference of Deep Neural\nNetworks (DNNs) on crossbars in terms of area overhead, programming energy and\nnon-idealities. A design-space exploration is, therefore, imperative to derive\na hybrid-device architecture optimized for accurate DNN inference under the\nimpact of non-idealities from multiple devices, while maintaining competitive\narea & energy-efficiencies. We propose a two-phase search framework (HyDe) that\nexploits the best of all worlds offered by multiple devices to determine an\noptimal hybrid-device architecture for a given DNN topology. Our hybrid models\nachieve upto 2.30-2.74x higher TOPS/mm^2 at 22-26% higher energy-efficiencies\nthan baseline homogeneous models for a VGG16 DNN topology. We further propose a\nfeasible implementation of the HyDe-derived hybrid-device architectures in the\n2.5D design space using chiplets to reduce design effort and cost in the\nhardware fabrication involving multiple technology processes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:00:33 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bhattacharjee","Abhiroop",""],["Moitra","Abhishek",""],["Panda","Priyadarshini",""]]}
{"id":"2308.00665","submitter":"Stefan Riemelmoser MSc","authors":"Stefan Riemelmoser, Carla Verdi, Merzuk Kaltak, Georg Kresse","title":"Machine learning density functionals from the random-phase approximation","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":"  Kohn-Sham density functional theory (DFT) is the standard method for\nfirst-principles calculations in computational chemistry and materials science.\nMore accurate theories such as the random-phase approximation (RPA) are limited\nin application due to their large computational cost. Here, we construct a DFT\nsubstitute functional for the RPA using supervised and unsupervised machine\nlearning (ML) techniques. Our ML-RPA model can be interpreted as a non-local\nextension to the standard gradient approximation. We train an ML-RPA functional\nfor diamond surfaces and liquid water and show that ML-RPA can outperform the\nstandard gradient functionals in terms of accuracy. Our work demonstrates how\nML-RPA can extend the applicability of the RPA to larger system sizes, time\nscales and chemical spaces.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:02:37 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Riemelmoser","Stefan",""],["Verdi","Carla",""],["Kaltak","Merzuk",""],["Kresse","Georg",""]]}
{"id":"2308.00666","submitter":"Yuntong Zhang","authors":"Yuntong Zhang, Ridwan Shariffdeen, Gregory J. Duck, Jiaqi Tan, Abhik\n  Roychoudhury","title":"Program Repair by Fuzzing over Patch and Input Space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fuzz testing (fuzzing) is a well-known method for exposing\nbugs/vulnerabilities in software systems. Popular fuzzers, such as AFL, use a\nbiased random search over the domain of program inputs, where 100s or 1000s of\ninputs (test cases) are executed per second in order to expose bugs. If a bug\nis discovered, it can either be fixed manually by the developer or fixed\nautomatically using an Automated Program Repair (APR) tool. Like fuzzing, many\nexisting APR tools are search-based, but over the domain of patches rather than\ninputs.\n  In this paper, we propose search-based program repair as patch-level fuzzing.\nThe basic idea is to adapt a fuzzer (AFL) to fuzz over the patch space rather\nthan the input space. Thus we use a patch-space fuzzer to explore a patch\nspace, while using a traditional input level fuzzer to rule out patch\ncandidates and help in patch selection. To improve the throughput, we propose a\ncompilation-free patch validation methodology, where we execute the original\n(unpatched) program natively, then selectively interpret only the specific\npatched statements and expressions. Since this avoids (re)compilation, we show\nthat compilation-free patch validation can achieve a similar throughput as\ninput-level fuzzing (100s or 1000s of execs/sec). We show that patch-level\nfuzzing and input-level fuzzing can be combined, for a co-exploration of both\nspaces in order to find better quality patches. Such a collaboration between\ninput-level fuzzing and patch-level fuzzing is then employed to search over\ncandidate fix locations, as well as patch candidates in each fix location.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:02:45 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Zhang","Yuntong",""],["Shariffdeen","Ridwan",""],["Duck","Gregory J.",""],["Tan","Jiaqi",""],["Roychoudhury","Abhik",""]]}
{"id":"2308.00667","submitter":"Joshua Goings","authors":"Joshua Goings and Luning Zhao and Jacek Jakowski and Titus Morris and\n  Raphael Pooser","title":"Molecular Symmetry in VQE: A Dual Approach for Trapped-Ion Simulations\n  of Benzene","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding complex chemical systems -- such as biomolecules, catalysts,\nand novel materials -- is a central goal of quantum simulations. Near-term\nstrategies hinge on the use of variational quantum eigensolver (VQE) algorithms\ncombined with a suitable ansatz. However, straightforward application of many\nchemically-inspired ansatze yields prohibitively deep circuits. In this work,\nwe employ several circuit optimization methods tailored for trapped-ion quantum\ndevices to enhance the feasibility of intricate chemical simulations. The\ntechniques aim to lessen the depth of the unitary coupled cluster with singles\nand doubles (uCCSD) ansatz's circuit compilation, a considerable challenge on\ncurrent noisy quantum devices. Furthermore, we use symmetry-inspired classical\npost-selection methods to further refine the outcomes and minimize errors in\nenergy measurements, without adding quantum overhead. Our strategies encompass\noptimal mapping from orbital to qubit, term reordering to minimize entangling\ngates, and the exploitation of molecular spin and point group symmetry to\neliminate redundant parameters. The inclusion of error mitigation via\npost-selection based on known molecular symmetries improves the results to near\nmilli-Hartree accuracy. These methods, when applied to a benzene molecule\nsimulation, enabled the construction of an 8-qubit circuit with 69 two-qubit\nentangling operations, pushing the limits for variational quantum eigensolver\n(VQE) circuits executed on quantum hardware to date.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:03:10 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Goings","Joshua",""],["Zhao","Luning",""],["Jakowski","Jacek",""],["Morris","Titus",""],["Pooser","Raphael",""]]}
{"id":"2308.00668","submitter":"Alvaro Lozano-Robledo","authors":"Asimina S. Hamakiotes and Alvaro Lozano-Robledo","title":"Elliptic curves with complex multiplication and abelian division fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $K$ be an imaginary quadratic field, and let $\\mathcal{O}_{K,f}$ be an\norder in $K$ of conductor $f\\geq 1$. Let $E$ be an elliptic curve with CM by\n$\\mathcal{O}_{K,f}$, such that $E$ is defined by a model over\n$\\mathbb{Q}(j_{K,f})$, where $j_{K,f}=j(E)$. In this article, we classify the\nvalues of $N\\geq 2$ and the elliptic curves $E$ such that (i) the division\nfield $\\mathbb{Q}(j_{K,f},E[N])$ is an abelian extension of\n$\\mathbb{Q}(j_{K,f})$, and (ii) the $N$-division field coincides with the\n$N$-th cyclotomic extension of the base field.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:04:12 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hamakiotes","Asimina S.",""],["Lozano-Robledo","Alvaro",""]]}
{"id":"2308.00669","submitter":"Shin Funada","authors":"Shin Funada, Jun Suzuki","title":"Error tradeoff relation for estimating the unitary-shift parameter of a\n  relativistic spin-1/2 particle","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this paper is to discuss the existence of a nontrivial\ntradeoff relation for estimating two unitary-shift parameters in a relativistic\nspin-1/2 system. It is shown that any moving observer cannot estimate two\nparameters simultaneously, even though a parametric model is classical in the\nrest frame. This transition from the classical model to a genuine quantum model\nis investigated analytically using a one-parameter family of quantum Fisher\ninformation matrices. This paper proposes to use an indicator that can not only\ndetect the existence of a tradeoff relation but can also evaluate its strength.\nBased on the proposed indicator, this paper investigates the nature of the\ntradeoff relation in detail.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:07:29 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Funada","Shin",""],["Suzuki","Jun",""]]}
{"id":"2308.00670","submitter":"Gerhard Gompper","authors":"Rajendra Singh Negi, Roland G. Winkler, and Gerhard Gompper","title":"Collective behavior of self-steering active particles with velocity\n  alignment and visual perception","comments":"13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The formation and dynamics of swarms is wide spread in living systems, from\nbacterial bio-films to schools of fish and flocks of birds. We study this\nemergent collective behavior in a model of active Brownian particles with\nvisual-perception-induced steering and alignment interactions through\nagent-based simulations. The dynamics, shape, and internal structure of the\nemergent aggregates, clusters, and swarms of these intelligent active Brownian\nparticles (iABPs) is determined by the maneuverabilities $\\Omega_v$ and\n$\\Omega_a$, quantifying the steering based on the visual signal and polar\nalignment, respectively, the propulsion velocity, characterized by the\nP{\\'e}clet number $Pe$, the vision angle $\\theta$, and the orientational noise.\nVarious non-equilibrium dynamical aggregates -- like motile worm-like swarms\nand millings, and close-packed or dispersed clusters -- are obtained. Small\nvision angles imply the formation of small clusters, while large vision angles\nlead to more complex clusters. In particular, a strong polar-alignment\nmaneuverability $\\Omega_a$ favors elongated worm-like swarms, which display\nsuper-diffusive motion over a much longer time range than individual ABPs,\nwhereas a strong vision-based maneuverability $\\Omega_v$ favors compact, nearly\nimmobile aggregates. Swarm trajectories show long persistent directed motion,\ninterrupted by sharp turns. Milling rings, where a worm-like swarm bites its\nown tail, emerge for an intermediate regime of $Pe$ and vision angles. Our\nresults offer new insights into the behavior of animal swarms, and provide\ndesign criteria for swarming microbots.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:13:05 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Negi","Rajendra Singh",""],["Winkler","Roland G.",""],["Gompper","Gerhard",""]]}
{"id":"2308.00671","submitter":"Sidiney G Alves S. G. Alves","authors":"Sofia M. Silveira and Sidiney G. Alves","title":"Radial Evolution in a Reaction-Diffusion Model","comments":"11 pages, 9 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 work, we investigate an off-lattice version of the diffusion-reaction\nmodel, $A + A \\leftrightarrow A$. We consider extensive numerical simulation of\nthe radial system obtained from a single seed. The fluctuations observed in\nsuch an evolving system are characterized by a radial region occupied by\nparticle growing over an empty one. We show that the fluctuating front\nseparating the two regions belongs to curved Kardar-Parisi-Zhang universality\nclass.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:17:20 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Silveira","Sofia M.",""],["Alves","Sidiney G.",""]]}
{"id":"2308.00673","submitter":"Ivan Christov","authors":"N C Papanicolaou and I C Christov","title":"Orthonormal eigenfunction expansions for sixth-order boundary value\n  problems","comments":"18 pages, 5 figures, IoP jpconf style; submitted to the proceedings\n  of the Fifteenth Conference of the Euro-American Consortium for Promoting the\n  Application of Mathematics in Technical and Natural Sciences (AMiTaNS'23)","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":"  Sixth-order boundary value problems (BVPs) arise in thin-film flows with a\nsurface that has elastic bending resistance. To solve such problems, we first\nderive a complete set of odd and even orthonormal eigenfunctions -- resembling\ntrigonometric sines and cosines, as well as the so-called ``beam'' functions.\nThese functions intrinsically satisfy boundary conditions (BCs) of relevance to\nthin-film flows, since they are the solutions of a self-adjoint sixth-order\nSturm--Liouville BVP with the same BCs. Next, we propose a Galerkin spectral\napproach for sixth-order problems; namely the sought function as well as all\nits derivatives and terms appearing in the differential equation are expanded\ninto an infinite series with respect to the derived complete orthonormal (CON)\nset of eigenfunctions. The unknown coefficients in the series expansion are\ndetermined by solving the algebraic system derived by taking successive inner\nproducts with each member of the CON set of eigenfunctions. The proposed method\nand its convergence are demonstrated by solving two model sixth-order BVPs.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:20:21 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Papanicolaou","N C",""],["Christov","I C",""]]}
{"id":"2308.00674","submitter":"Zi-Xia Song","authors":"Gang Chen, Chenchen Ren and Zi-Xia Song","title":"Minimizing the number of edges in $(C_4, K_{1,k})$-co-critical graphs","comments":"Version 2 fixes the title and the third author's name arXiv admin\n  note: substantial text overlap with arXiv:2104.13898","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given graphs $H_1, H_2$, a {red, blue}-coloring of the edges of a graph $G$\nis a critical coloring if $G$ has neither a red $H_1$ nor a blue $ H_2$. A\nnon-complete graph $G$ is $(H_1, H_2)$-co-critical if $G$ admits a critical\ncoloring, but $G+e$ has no critical coloring for every edge $e$ in the\ncomplement of $G$. Motivated by a conjecture of Hanson and Toft from 1987, we\nstudy the minimum number of edges over all $(C_4, K_{1,k})$-co-critical graphs\non $n$ vertices. We show that for all $k \\ge 2 $ and $ n \\ge k +\\lfloor \\sqrt\n{k-1} \\rfloor +2$, if $G$ is a $(C_4,K_{1,k})$-co-critical graph on $n$\nvertices, then \\[e(G) \\ge \\frac{(k+2)n}2-3- \\frac{(k-1)(k+ \\lfloor \\sqrt\n{k-2}\\rfloor)}2.\\] Moreover, this linear bound is asymptotically best possible\nfor all $k\\ge3$ and $n\\ge3k+4$. It is worth noting that our constructions for\nthe case when $ k$ is even have at least three different critical colorings.\nFor $k=2$, we obtain the sharp bound for the minimum number of edges of $(C_4,\nK_{1,2})$-co-critical graphs on $n\\ge5 $ vertices by showing that all such\ngraphs have at least $2n-3$ edges. Our proofs rely on the structural properties\nof $(C_4,K_{1,k})$-co-critical graphs and a result of Ollmann on the minimum\nnumber of edges of $C_4$-saturated graphs.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:21:31 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 15:16:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Gang",""],["Ren","Chenchen",""],["Song","Zi-Xia",""]]}
{"id":"2308.00675","submitter":"Cheng-Yu Hsieh","authors":"Cheng-Yu Hsieh, Si-An Chen, Chun-Liang Li, Yasuhisa Fujii, Alexander\n  Ratner, Chen-Yu Lee, Ranjay Krishna, Tomas Pfister","title":"Tool Documentation Enables Zero-Shot Tool-Usage with Large Language\n  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":"  Today, large language models (LLMs) are taught to use new tools by providing\na few demonstrations of the tool's usage. Unfortunately, demonstrations are\nhard to acquire, and can result in undesirable biased usage if the wrong\ndemonstration is chosen. Even in the rare scenario that demonstrations are\nreadily available, there is no principled selection protocol to determine how\nmany and which ones to provide. As tasks grow more complex, the selection\nsearch grows combinatorially and invariably becomes intractable. Our work\nprovides an alternative to demonstrations: tool documentation. We advocate the\nuse of tool documentation, descriptions for the individual tool usage, over\ndemonstrations. We substantiate our claim through three main empirical findings\non 6 tasks across both vision and language modalities. First, on existing\nbenchmarks, zero-shot prompts with only tool documentation are sufficient for\neliciting proper tool usage, achieving performance on par with few-shot\nprompts. Second, on a newly collected realistic tool-use dataset with hundreds\nof available tool APIs, we show that tool documentation is significantly more\nvaluable than demonstrations, with zero-shot documentation significantly\noutperforming few-shot without documentation. Third, we highlight the benefits\nof tool documentations by tackling image generation and video tracking using\njust-released unseen state-of-the-art models as tools. Finally, we highlight\nthe possibility of using tool documentation to automatically enable new\napplications: by using nothing more than the documentation of GroundingDino,\nStable Diffusion, XMem, and SAM, LLMs can re-invent the functionalities of the\njust-released Grounded-SAM and Track Anything models.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:21:38 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hsieh","Cheng-Yu",""],["Chen","Si-An",""],["Li","Chun-Liang",""],["Fujii","Yasuhisa",""],["Ratner","Alexander",""],["Lee","Chen-Yu",""],["Krishna","Ranjay",""],["Pfister","Tomas",""]]}
{"id":"2308.00676","submitter":"Liang Si","authors":"Liang Si, Karsten Held","title":"Electronic structure of the putative room-temperature superconductor\n  Pb$_9$Cu(PO$_4$)$_6$O","comments":"10 pages, 7 figures and 4 tables including supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A recent paper [Lee {\\em et al.}, J. Korean Cryt. Growth Cryst. Techn. {\\bf\n33}, 61 (2023)] provides some experimental indications that\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O with $x\\approx 1$, coined LK-99, might be a\nroom-temperature superconductor at ambient pressure. Our density-functional\ntheory calculations show lattice parameters and a volume contraction with $x$\n-- very similar to experiment. The DFT electronic structure shows Cu$^{2+}$ in\na $3d^9$ configuration with two extremely flat Cu bands crossing the Fermi\nenergy. This puts Pb$_{9}$Cu(PO$_4$)$_6$O in an ultra-correlated regime and\nsuggests that, without doping, it is a Mott or charge transfer insulator. If\ndoped such an electronic structure might support flat-band superconductivity or\nan correlation-enhanced electron-phonon mechanism, whereas a diamagnet without\nsuperconductivity appears to be rather at odds with our results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:21:48 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 14:09:59 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Si","Liang",""],["Held","Karsten",""]]}
{"id":"2308.00678","submitter":"Takuya Matsuyama","authors":"Takuya Matsuyama, Kota S Sasaki, Shinji Nishimoto","title":"Applicability of scaling laws to vision encoding models","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigated how to build a high-performance vision\nencoding model to predict brain activity as part of our participation in the\nAlgonauts Project 2023 Challenge. The challenge provided brain activity\nrecorded by functional MRI (fMRI) while participants viewed images. Several\nvision models with parameter sizes ranging from 86M to 4.3B were used to build\npredictive models. To build highly accurate models, we focused our analysis on\ntwo main aspects: (1) How does the sample size of the fMRI training set change\nthe prediction accuracy? (2) How does the prediction accuracy across the visual\ncortex vary with the parameter size of the vision models? The results show that\nas the sample size used during training increases, the prediction accuracy\nimproves according to the scaling law. Similarly, we found that as the\nparameter size of the vision models increases, the prediction accuracy improves\naccording to the scaling law. These results suggest that increasing the sample\nsize of the fMRI training set and the parameter size of visual models may\ncontribute to more accurate visual models of the brain and lead to a better\nunderstanding of visual neuroscience.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:31:14 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Matsuyama","Takuya",""],["Sasaki","Kota S",""],["Nishimoto","Shinji",""]]}
{"id":"2308.00679","submitter":"Matthew Streeter","authors":"Matthew Streeter and Joshua V. Dillon","title":"Sharp Taylor Polynomial Enclosures in One Dimension","comments":"28 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is often useful to have polynomial upper or lower bounds on a\none-dimensional function that are valid over a finite interval, called a trust\nregion. A classical way to produce polynomial bounds of degree $k$ involves\nbounding the range of the $k$th derivative over the trust region, but this\nproduces suboptimal bounds. We improve on this by deriving sharp polynomial\nupper and lower bounds for a wide variety of one-dimensional functions. We\nfurther show that sharp bounds of degree $k$ are at least $k+1$ times tighter\nthan those produced by the classical method, asymptotically as the width of the\ntrust region approaches zero. We discuss how these sharp bounds can be used in\nmajorization-minimization optimization, among other applications.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:32:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Streeter","Matthew",""],["Dillon","Joshua V.",""]]}
{"id":"2308.00680","submitter":"Santiago Agui-Salcedo","authors":"Santiago Agui-Salcedo, Scott Melville","title":"The Cosmological Tree Theorem","comments":"38+21 pages, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A number of diagrammatic \"cutting rules\" have recently been developed for the\nwavefunction of the Universe which determines cosmological correlation\nfunctions. These leverage perturbative unitarity to relate particular\n\"discontinuities\" in Feynman-Witten diagrams (with cosmological boundary\nconditions) to simpler diagrams, in much the same way that the Cutkosky rules\nrelate different scattering amplitudes. In this work, we make use of a further\ncausality condition to derive new cutting rules for Feynman-Witten diagrams.\nThese lead to the cosmological analogue of Feynman's tree theorem for\namplitudes, which can be used to systematically expand any loop diagram in\nterms of (momentum integrals of) tree-level diagrams. As an application of\nthese new rules, we show that certain singularities in the wavefunction cannot\nappear in equal-time correlators due to a cancellation between \"real\" and\n\"virtual\" contributions that closely parallels the KLN theorem. Finally, when\ncombined with the Bunch-Davies condition that certain unphysical singularities\nare absent, these cutting rules completely determine any tree-level exchange\ndiagram in terms of simpler contact diagrams. Altogether, these results remove\nthe need to ever perform nested time integrals when computing cosmological\ncorrelators.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:36:23 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Agui-Salcedo","Santiago",""],["Melville","Scott",""]]}
{"id":"2308.00681","submitter":"Mehdi Behroozi","authors":"Mostafa Pazoki, Hamed Samarghandi, Mehdi Behroozi","title":"Increasing Supply Chain Resiliency Through Equilibrium Pricing and\n  Stipulating Transportation Quota Regulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Supply chain disruption can occur for a variety of reasons, including natural\ndisasters or market dynamics. If the disruption is profound and with dire\nconsequences for the economy, the regulators may decide to intervene to\nminimize the impact for the betterment of the society. This paper investigates\nthe minimum quota regulation on transportation amounts, stipulated by the\ngovernment in a market where transportation capacity is below total production\nand profitability levels differ significantly among different products. In\nNorth America, an interesting example can happen in rail transportation market,\nwhere the rail capacity is used for a variety of products and commodities such\nas oil and grains. This research assumes that there is a shipping company with\nlimited capacity which will ship a group of products with heterogeneous\ntransportation and production costs and prices. Mathematical problems for the\nmarket players as well as the government are presented, solutions are proposed,\nand implemented in a framed Canadian case study. Subsequently, the conditions\nthat justify government intervention are identified, and an algorithm to obtain\nthe optimum minimum quota is presented.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:36:36 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Pazoki","Mostafa",""],["Samarghandi","Hamed",""],["Behroozi","Mehdi",""]]}
{"id":"2308.00682","submitter":"Tinghao Feng","authors":"Tinghao Feng, Yueqi Hu, Jing Yang, Tom Polk, Ye Zhao, Shixia Liu,\n  Zhaocong Yang","title":"TimePool: Visually Answer \"Which and When\" Questions On Univariate Time\n  Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When exploring time series datasets, analysts often pose \"which and when\"\nquestions. For example, with world life expectancy data over one hundred years,\nthey may inquire about the top 10 countries in life expectancy and the time\nperiod when they achieved this status, or which countries have had longer life\nexpectancy than Ireland and when. This paper proposes TimePool, a new\nvisualization prototype, to address this need for univariate time series\nanalysis. It allows users to construct interactive \"which and when\" queries and\nvisually explore the results for insights.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:37:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Feng","Tinghao",""],["Hu","Yueqi",""],["Yang","Jing",""],["Polk","Tom",""],["Zhao","Ye",""],["Liu","Shixia",""],["Yang","Zhaocong",""]]}
{"id":"2308.00683","submitter":"Nadezhda Chirkova","authors":"Nadezhda Chirkova, Sergey Troshin","title":"CodeBPE: Investigating Subtokenization Options for Large Language Model\n  Pretraining on Source Code","comments":"Published at ICLR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent works have widely adopted large language model pretraining for source\ncode, suggested source code-specific pretraining objectives and investigated\nthe applicability of various Transformer-based language model architectures for\nsource code. This work investigates another important aspect of such models,\nnamely the effect of different subtokenization options, and aims at identifying\nmost effective and length-efficient subtokenizations, taking into account code\nspecifics. We propose subtokenziation that reduces average length by 17%\nwithout downstream performance drop, and show that a carefully chosen\nsubtokenization may improve quality by 0.5-2%, possibly with some length\nincrease.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:40:48 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Chirkova","Nadezhda",""],["Troshin","Sergey",""]]}
{"id":"2308.00684","submitter":"Hugo Bonette de Carvalho","authors":"Viviane M. A. Lage, Carlos Rodr\\'iguez-Fern\\'andez, Felipe S. Vieira,\n  Rafael T. da Silva, Maria In\\^es B. Bernardi, Maur\\'icio M de Lima Jr.,\n  Andr\\'es Cantarero and Hugo B. de Carvalho","title":"On the vibrational properties of transition metal doped ZnO: surface,\n  defect, and bandgap engineering","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":"  We present a comprehensive study on the structure and optical properties of\nMn-and Co-doped ZnO samples prepared via solid-state reaction method with\ndifferent dopant concentrations and atmospheres. The samples were structural\nand chemically characterized via X-ray diffraction, scanning electron\nmicroscopy, energy-dispersive X-ray spectroscopy, and X-ray excited\nphotoelectron spectroscopy. The optical characterization was performed via\nRaman, photoluminescence, and diffuse photoreflectance spectroscopies. Emphasis\nwas done on the studies of their vibrational properties. The structural data\nconfirm the incorporation of Mn and Co ions into the wurtzite ZnO lattice. It\nis demonstrated that the usual observed additional bands in the Raman spectrum\nof transitional metal (TM) doped ZnO are related to structural damage, deriving\nfrom the doping process, and surface effects. The promoted surface optical\nphonons (SOP) are of Fr\\\"ohlich character and, together with the longitudinal\noptical (LO) polar phonons, are directly dependent on the ZnO electronic\nstructure. The enhancement of SOP and LO modes with TM-doping is explained in\nterms of nonhomogeneous doping, with the dopants concentrating mainly on the\nsurface of grains, and a resonance effect due to the decrease of the ZnO\nbandgap promoted by the introduction of the 3d TM levels within the ZnO\nbandgap. We also discuss the origin of the controversial vibrational mode\ncommonly observed in the Mn-doped ZnO system. It is stated that the observation\nof the analyzed vibrational properties is a signature of substitutional doping\nof the ZnO structure with tuning of ZnO optical absorption into the visible\nrange of the electromagnetic spectrum.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:42:01 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lage","Viviane M. A.",""],["Rodr\u00edguez-Fern\u00e1ndez","Carlos",""],["Vieira","Felipe S.",""],["da Silva","Rafael T.",""],["Bernardi","Maria In\u00eas B.",""],["Lima","Maur\u00edcio M de","Jr."],["Cantarero","Andr\u00e9s",""],["de Carvalho","Hugo B.",""]]}
{"id":"2308.00685","submitter":"Sercan Aygun","authors":"Sercan Aygun, Mehran Shoushtari Moghadam, M. Hassan Najafi, Mohsen\n  Imani","title":"Learning from Hypervectors: A Survey on Hypervector Encoding","comments":"14 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyperdimensional computing (HDC) is an emerging computing paradigm that\nimitates the brain's structure to offer a powerful and efficient processing and\nlearning model. In HDC, the data are encoded with long vectors, called\nhypervectors, typically with a length of 1K to 10K. The literature provides\nseveral encoding techniques to generate orthogonal or correlated hypervectors,\ndepending on the intended application. The existing surveys in the literature\noften focus on the overall aspects of HDC systems, including system inputs,\nprimary computations, and final outputs. However, this study takes a more\nspecific approach. It zeroes in on the HDC system input and the generation of\nhypervectors, directly influencing the hypervector encoding process. This\nsurvey brings together various methods for hypervector generation from\ndifferent studies and explores the limitations, challenges, and potential\nbenefits they entail. Through a comprehensive exploration of this survey,\nreaders will acquire a profound understanding of various encoding types in HDC\nand gain insights into the intricate process of hypervector generation for\ndiverse applications.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:42:35 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Aygun","Sercan",""],["Moghadam","Mehran Shoushtari",""],["Najafi","M. Hassan",""],["Imani","Mohsen",""]]}
{"id":"2308.00687","submitter":"Guilherme Tegoni Goedert Mr","authors":"Guilherme Tegoni Goedert and Luca Biferale","title":"Instanton-based Importance Sampling for Extreme Fluctuations in a Shell\n  Model for Turbulent Energy Cascade","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Many out-of-equilibrium flows present non-Gaussian fluctuations in physically\nrelevant observables, such as energy dissipation rate. This implies extreme\nfluctuations that, although rarely observed, have a significant phenomenology.\nRecently, path integral methods for importance sampling have emerged from\nformalism initially devised for quantum field theory and are being successfully\napplied to the Burgers equation and other fluid models. We proposed exploring\nthe domain of application of these methods using a Shell Model, a dynamical\nsystem for turbulent energy cascade which can be numerically sampled for\nextreme events in an efficient manner and presents many interesting properties.\nWe start from a validation of the instanton-based importance sampling\nmethodology in the heat equation limit. We explored the limits of the method as\nnon-linearity grows stronger, finding good qualitative results for small values\nof the leading non-linear coefficient. A worst agreement between numerical\nsimulations of the whole systems and instanton results for estimation of the\ndistribution's flatness is observed when increasing the nonlinear intensities.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:44:24 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Goedert","Guilherme Tegoni",""],["Biferale","Luca",""]]}
{"id":"2308.00688","submitter":"Nikhil Keetha","authors":"Nikhil Keetha, Avneesh Mishra, Jay Karhade, Krishna Murthy\n  Jatavallabhula, Sebastian Scherer, Madhava Krishna, Sourav Garg","title":"AnyLoc: Towards Universal Visual Place Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.RO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Visual Place Recognition (VPR) is vital for robot localization. To date, the\nmost performant VPR approaches are environment- and task-specific: while they\nexhibit strong performance in structured environments (predominantly urban\ndriving), their performance degrades severely in unstructured environments,\nrendering most approaches brittle to robust real-world deployment. In this\nwork, we develop a universal solution to VPR -- a technique that works across a\nbroad range of structured and unstructured environments (urban, outdoors,\nindoors, aerial, underwater, and subterranean environments) without any\nre-training or fine-tuning. We demonstrate that general-purpose feature\nrepresentations derived from off-the-shelf self-supervised models with no\nVPR-specific training are the right substrate upon which to build such a\nuniversal VPR solution. Combining these derived features with unsupervised\nfeature aggregation enables our suite of methods, AnyLoc, to achieve up to 4X\nsignificantly higher performance than existing approaches. We further obtain a\n6% improvement in performance by characterizing the semantic properties of\nthese features, uncovering unique domains which encapsulate datasets from\nsimilar environments. Our detailed experiments and analysis lay a foundation\nfor building VPR solutions that may be deployed anywhere, anytime, and across\nanyview. We encourage the readers to explore our project page and interactive\ndemos: https://anyloc.github.io/.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:45:13 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Keetha","Nikhil",""],["Mishra","Avneesh",""],["Karhade","Jay",""],["Jatavallabhula","Krishna Murthy",""],["Scherer","Sebastian",""],["Krishna","Madhava",""],["Garg","Sourav",""]]}
{"id":"2308.00690","submitter":"Sergei Sergeev","authors":"Muhammad Syifa'ul Mufid, Ebrahim Patel, Sergei Sergeev","title":"Solving Linear Equations Over Maxmin-$\\omega$ Systems","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Maxmin-$\\omega$ dynamical systems were previously introduced as an\n``all-in-one package'' that can yield a solely min-plus, a solely max-plus, or\na max-min-plus dynamical system by varying a parameter $\\omega\\in(0,1]$. With\nsuch systems in mind, it is natural to introduce and consider maxmin-$\\omega$\nlinear systems of equations of the type $A\\otimes_{\\omega} x=b$. However, to\nour knowledge, such maxmin-$\\omega$ linear systems have not been studied before\nand in this paper we present an approach to solve them. We show that the\nproblem can be simplified by performing normalization and then generating a\n``canonical'' matrix which we call the principal order matrix. Instead of\ndirectly trying to find the solutions, we search the possible solution indices\nwhich can be identified using the principal order matrix and the parameter\n$\\omega$. The fully active solutions are then immediately obtained from these\nsolution indices. With the fully active solutions at hand, we then present the\nmethod to find other solutions by applying a relaxation, i.e., increasing or\ndecreasing some components of fully active solutions. This approach can be seen\nas a generalization of an approach that could be applied to solve max-plus or\nmin-plus linear systems. Our results also shed more light on an unusual feature\nof maxmin-$\\omega$ linear systems, which, unlike in the usual linear algebra,\ncan have a finite number of solutions in the case where their solution is\nnon-unique.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:50:04 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Mufid","Muhammad Syifa'ul",""],["Patel","Ebrahim",""],["Sergeev","Sergei",""]]}
{"id":"2308.00691","submitter":"Maxime Parra","authors":"M. Parra, P.-O. Petrucci, S. Bianchi, V. E. Gianolli, F. Ursini, G.\n  Ponti","title":"The current state of disk wind observations in BHLMXBs through X-ray\n  absorption lines in the iron band","comments":"26 pages, 11 figures | Accepted for publication in Astronomy &\n  Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The presence of blueshifted absorption lines in the X-ray spectra of Black\nHole Low Mass X-ray Binaries is the telltale of massive outflows called winds.\nThese signatures are found almost exclusively in soft states of high-inclined\nsystems, hinting at equatorial ejections originating from the accretion disk\nand deeply intertwined with the evolution of the outburst patterns displayed by\nthese systems. In the wake of the launch of the new generation of X-ray\nspectrometers, studies of wind signatures remain mostly restricted to single\nsources and outbursts, with some of the recent detections departing from the\ncommonly expected behaviors. We thus give an update to the current state of\niron band absorption lines detections, through the analysis of all publicly\navailable XMM-$Newton$-PN and $Chandra$-HETG exposures of known Black Hole\nLow-Mass X-ray Binary candidates. Our results agree with previous studies, with\nwind detections exclusively found in dipping, high-inclined sources, and almost\nexclusively in bright ($L_{X}>0.01L_{Edd}$) soft ($HR<0.8$) states, with\nblueshift values generally restricted to few 100 km s$^{-1}$. The line\nparameters indicate similar properties between objects and outbursts of single\nsources, and despite more than 20 years of data, very few sources have the HID\nsampling necessary to properly study the evolution of the wind during single\noutbursts. We provide an online tool with details of the wind signatures and\noutburst evolution data for all sources in the sample.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:50:16 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Parra","M.",""],["Petrucci","P. -O.",""],["Bianchi","S.",""],["Gianolli","V. E.",""],["Ursini","F.",""],["Ponti","G.",""]]}
{"id":"2308.00692","submitter":"Xin Lai","authors":"Xin Lai, Zhuotao Tian, Yukang Chen, Yanwei Li, Yuhui Yuan, Shu Liu,\n  Jiaya Jia","title":"LISA: Reasoning Segmentation via Large Language Model","comments":"Code, models, and demo are available at\n  https://github.com/dvlab-research/LISA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Although perception systems have made remarkable advancements in recent\nyears, they still rely on explicit human instruction to identify the target\nobjects or categories before executing visual recognition tasks. Such systems\nlack the ability to actively reason and comprehend implicit user intentions. In\nthis work, we propose a new segmentation task -- reasoning segmentation. The\ntask is designed to output a segmentation mask given a complex and implicit\nquery text. Furthermore, we establish a benchmark comprising over one thousand\nimage-instruction pairs, incorporating intricate reasoning and world knowledge\nfor evaluation purposes. Finally, we present LISA: large Language Instructed\nSegmentation Assistant, which inherits the language generation capabilities of\nthe multi-modal Large Language Model (LLM) while also possessing the ability to\nproduce segmentation masks. We expand the original vocabulary with a <SEG>\ntoken and propose the embedding-as-mask paradigm to unlock the segmentation\ncapability. Remarkably, LISA can handle cases involving: 1) complex reasoning;\n2) world knowledge; 3) explanatory answers; 4) multi-turn conversation. Also,\nit demonstrates robust zero-shot capability when trained exclusively on\nreasoning-free datasets. In addition, fine-tuning the model with merely 239\nreasoning segmentation image-instruction pairs results in further performance\nenhancement. Experiments show our method not only unlocks new reasoning\nsegmentation capabilities but also proves effective in both complex reasoning\nsegmentation and standard referring segmentation tasks. Code, models, and demo\nare at https://github.com/dvlab-research/LISA.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:50:17 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 17:38:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lai","Xin",""],["Tian","Zhuotao",""],["Chen","Yukang",""],["Li","Yanwei",""],["Yuan","Yuhui",""],["Liu","Shu",""],["Jia","Jiaya",""]]}
{"id":"2308.00693","submitter":"Sangwon Yoon","authors":"Uhi Rinn Suh, Sangwon Yoon","title":"Supersymmetric extension of universal enveloping vertex algebras","comments":"25 pages; added references and some comments in section 4","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the construction of the supersymmetric extensions of\nvertex algebras. In particular, for $N = n \\in \\mathbb{Z}_{+}$, we show the\nuniversal enveloping $N = n$ supersymmetric (SUSY) vertex algebra of an $N = n$\nSUSY Lie conformal algebra can be extended to an $N = n' > n$ SUSY vertex\nalgebra. We also show the $N = 2$ SUSY affine vertex algebra of level $0$\nassociated with a Lie superalgebra, which is an $N = 2$ SUSY extension of the\naffine vertex algebra of level $0$, can be embedded as an $N = 2$ SUSY vertex\nsubalgebra into an $N = 2$ superconformal vertex algebra.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:51:59 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 13:31:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Suh","Uhi Rinn",""],["Yoon","Sangwon",""]]}
{"id":"2308.00694","submitter":"Stefan Steinerberger","authors":"Dmitriy Bilyk, Michelle Mastrianni, Stefan Steinerberger","title":"Single radius spherical cap discrepancy via gegenbadly approximable\n  numbers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A celebrated result of Beck shows that for any set of $N$ points on\n$\\mathbb{S}^d$ there always exists a spherical cap $B \\subset \\mathbb{S}^d$\nsuch that number of points in the cap deviates from the expected value\n$\\sigma(B) \\cdot N$ by at least $N^{1/2 - 1/2d}$, where $\\sigma$ is the\nnormalized surface measure. We refine the result and show that, when $d\n\\not\\equiv 1 ~(\\mbox{mod}~4)$, there exists a (small and very specific) set of\nreal numbers such that for every $r>0$ from the set one is always guaranteed to\nfind a spherical cap $C_r$ with the given radius $r$ for which the result\nholds. The main new ingredient is a generalization of the notion of badly\napproximable numbers to the setting of Gegenbauer polynomials: these are fixed\nnumbers $ x \\in (-1,1)$ such that the sequence of Gegenbauer polynomials\n$(C_n^{\\lambda}(x))_{n=1}^{\\infty}$ avoids being close to 0 in a precise\nquantitative sense.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:54:25 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Bilyk","Dmitriy",""],["Mastrianni","Michelle",""],["Steinerberger","Stefan",""]]}
{"id":"2308.00695","submitter":"Arian Eamaz","authors":"Arian Eamaz, Farhang Yeganegi, Deanna Needell, Mojtaba Soltanalian","title":"Harnessing the Power of Sample Abundance: Theoretical Guarantees and\n  Algorithms for Accelerated One-Bit Sensing","comments":"arXiv admin note: text overlap with arXiv:2301.03467","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One-bit quantization with time-varying sampling thresholds (also known as\nrandom dithering) has recently found significant utilization potential in\nstatistical signal processing applications due to its relatively low power\nconsumption and low implementation cost. In addition to such advantages, an\nattractive feature of one-bit analog-to-digital converters (ADCs) is their\nsuperior sampling rates as compared to their conventional multi-bit\ncounterparts. This characteristic endows one-bit signal processing frameworks\nwith what one may refer to as sample abundance. We show that sample abundance\nplays a pivotal role in many signal recovery and optimization problems that are\nformulated as (possibly non-convex) quadratic programs with linear feasibility\nconstraints. Of particular interest to our work are low-rank matrix recovery\nand compressed sensing applications that take advantage of one-bit\nquantization. We demonstrate that the sample abundance paradigm allows for the\ntransformation of such problems to merely linear feasibility problems by\nforming large-scale overdetermined linear systems -- thus removing the need for\nhandling costly optimization constraints and objectives. To make the proposed\ncomputational cost savings achievable, we offer enhanced randomized Kaczmarz\nalgorithms to solve these highly overdetermined feasibility problems and\nprovide theoretical guarantees in terms of their convergence, sample size\nrequirements, and overall performance. Several numerical results are presented\nto illustrate the effectiveness of the proposed methodologies.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:54:26 GMT"},{"version":"v2","created":"Wed, 2 Aug 2023 20:27:20 GMT"},{"version":"v3","created":"Mon, 7 Aug 2023 21:14:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Eamaz","Arian",""],["Yeganegi","Farhang",""],["Needell","Deanna",""],["Soltanalian","Mojtaba",""]]}
{"id":"2308.00696","submitter":"Maxim Shirokov Evgenyevich","authors":"Ludovico Lami, Maksim E. Shirokov","title":"Continuity of the relative entropy of resource","comments":"15 pages, any comments are 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":"  A criterion of local continuity of the relative entropy of resource -- the\nrelative entropy distance to the set of free states -- is obtained. Several\nbasic corollaries of this criterion are presented. Applications to the relative\nentropy of entanglement in multipartite quantum systems are considered. It is\nshown, in particular, that local continuity of any relative entropy of\nmultipartite entanglement follows from local continuity of the quantum mutual\ninformation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:55:44 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Lami","Ludovico",""],["Shirokov","Maksim E.",""]]}
{"id":"2308.00697","submitter":"Galina Weinstein Dr","authors":"Galina Weinstein","title":"Debating the Reliability and Robustness of the Learned Hamiltonian in\n  the Traversable Wormhole Experiment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper discusses Daniel Jafferis et al.'s \"Nature\" publication on\n\"Traversable wormhole dynamics on a quantum processor.\" The experiment utilized\nGoogle's Sycamore quantum processor to simulate a sparse SYK model with a\nlearned Hamiltonian. A debate ensued when Bryce Kobrin, Thomas Schuster, and\nNorman Yao raised concerns about the learned Hamiltonian's reliability, which\nJafferis and the team addressed. Recently, there has been an update in the\nwormhole experiment saga. In an attempt to rescue the commuting Hamiltonian\nfrom its inevitable fate of being invalidated, a recent paper by Ping Gao\nproposed a creative solution to reinvigorate the concept within the context of\nteleportation through wormholes. This paper delves into the ongoing debate and\nthe recent endeavor to address the comments made by Kobrin et al. I remain\nskeptical about the efforts to address Kobrin et al.'s challenges. By its\nnature, a commuting Hamiltonian does not exhibit chaotic behavior like\nnon-commuting Hamiltonians. Moreover, it's always essential to assess the\nsensitivity of the Hamiltonian to noise to understand its practical feasibility\nfor the real-world Sycamore processor.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:56:27 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Weinstein","Galina",""]]}
{"id":"2308.00698","submitter":"Swagata Acharya","authors":"Rafal Kurleto, Stephan Lany, Dimitar Pashov, Swagata Acharya, Mark van\n  Schilfgaarde, Daniel S. Dessau","title":"Pb-apatite framework as a generator of novel flat-band CuO based physics","comments":"11 pages, 6 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":"  Based on DFT calculations, we present the basic electronic structure of\nCuPb9(PO4)6O (Cu-doped lead apatite, LK-99), in two scenarios: (1) where the\nstructure is constrained to the P3 symmetry and (2) where no symmetry is\nimposed. At the DFT level, the former is predicted to be metallic while the\nlatter is found to be a charge-transfer insulator. In both cases the filling of\nthese states is nominally d9, consistent with the Cu2+ valence state, and Cu\nwith a local magnetic moment ~0.7mB. In the metallic case we find these states\nto be unusually flat (0.2 eV dispersion), giving high DOS at EF that we argue\ncan be a host for novel electronic physics, including potentially high\ntemperature superconductivity. The flatness of the bands is the likely origin\nof symmetry-lowering gapping possibilities that would remove the spectral\nweight from EF. Since some experimental observations show\nmetallic/semiconducting behavior, we propose that disorder is responsible for\nclosing the gap. We consider a variety of possibilities that could possibly\nclose the gap, but limit consideration to kinds of disorder that preserve\nelectron count. For all possibilities we considered (spin disorder, O on\nvacancy sites, Cu on different Pb sites), the local Cu moment, and consequently\nthe gap remains robust. We conclude that disorder responsible for metallic\nbehavior entails some kind of doping where the electron count changes. We claim\nthat the emergence of the flat bands should be due to weak wave function\noverlap between the Cu and O orbitals, owing to the directional character of\nthe constituent orbitals. So, finding an appropriate host structure for\nminimizing hybridization between Cu and O while allowing them to still weakly\ninteract should be a promising route for generating flat bands at EF which can\nlead to interesting electronic phenomena, regardless of whether LK-99 is a\nroom-temperature superconductor.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:56:45 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 01:30:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kurleto","Rafal",""],["Lany","Stephan",""],["Pashov","Dimitar",""],["Acharya","Swagata",""],["van Schilfgaarde","Mark",""],["Dessau","Daniel S.",""]]}
{"id":"2308.00699","submitter":"Katherine Klymko","authors":"Jan Balewski, Daan Camps, Katherine Klymko, Andrew Tritt","title":"Efficient Quantum Counting and Quantum Content-Addressable Memory for\n  DNA similarity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph q-bio.GN q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present QCAM, a quantum analogue of Content-Addressable Memory (CAM),\nuseful for finding matches in two sequences of bit-strings. Our QCAM\nimplementation takes advantage of Grover's search algorithm and proposes a\nhighly-optimized quantum circuit implementation of the QCAM oracle. Our circuit\nconstruction uses the parallel uniformly controlled rotation gates, which were\nused in previous work to generate QBArt encodings. These circuits have a high\ndegree of quantum parallelism which reduces their critical depth. The optimal\nnumber of repetitions of the Grover iterator used in QCAM depends on the number\nof true matches and hence is input dependent. We additionally propose a\nhardware-efficient implementation of the quantum counting algorithm (HEQC) that\ncan infer the optimal number of Grover iterations from the measurement of a\nsingle observable. We demonstrate the QCAM application for computing the\nJaccard similarity between two sets of k-mers obtained from two DNA sequences.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:59:02 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Balewski","Jan",""],["Camps","Daan",""],["Klymko","Katherine",""],["Tritt","Andrew",""]]}
{"id":"2308.00700","submitter":"Tarik Dzanic","authors":"Tarik Dzanic and Freddie D. Witherden and Luigi Martinelli","title":"Validation of wall boundary conditions for simulating complex fluid\n  flows via the Boltzmann--BGK equation: Momentum transport and skin friction","comments":"34 pages, 36 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The influence and validity of wall boundary conditions for non-equilibrium\nfluid flows described by the Boltzmann equation remains an open problem. The\nsubstantial computational cost of directly solving the Boltzmann equation has\nlimited the extent of numerical validation studies to simple, often\ntwo-dimensional, flow problems. Recent algorithmic advancements for the\nBoltzmann--BGK equation introduced by the authors, consisting of a high-order\nspatial discretization augmented with a discretely-conservative velocity model,\nhave made it feasible to accurately simulate unsteady three-dimensional flow\nproblems across both the rarefied and continuum regimes. This work presents a\ncomprehensive evaluation and validation of wall boundary conditions across a\nvariety of flow regimes, primarily for the purpose of exploring their effects\non momentum transfer in the low Mach limit. Results are presented for a range\nof steady and unsteady wall-bounded flow problems across both the rarefied and\ncontinuum regimes, from canonical two-dimensional laminar flows to unsteady\nthree-dimensional transitional and turbulent flows, the latter of which are the\nfirst instances of wall-bounded turbulent flows computed by directly solving\nthe Boltzmann equation. We show that approximations of the molecular gas\ndynamics equations can accurately predict both non-equilibrium phenomena and\ncomplex hydrodynamic flow instabilities and show how spatial and velocity\ndomain resolution affect the accuracy. The results indicate that an accurate\napproximation of particle transport (i.e. high spatial resolution) is\nsignificantly more important than particle collision (i.e. high velocity domain\nresolution) for predicting flow instabilities and momentum transfer consistent\nwith that predicted by the hydrodynamic equations and that these effects can be\ncomputed accurately even with very few degrees of freedom in the velocity\ndomain.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:59:30 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Dzanic","Tarik",""],["Witherden","Freddie D.",""],["Martinelli","Luigi",""]]}
{"id":"2308.00701","submitter":"Nathan Hara","authors":"Nathan C. Hara and Eric B. Ford","title":"Statistical methods for exoplanet detection with radial velocities","comments":"Published in Annual Reviews of Statistics and Its Application,\n  contains the main text and supplemental appendix","journal-ref":null,"doi":"10.1146/annurev-statistics-033021-012225","report-no":null,"categories":"astro-ph.IM astro-ph.EP stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exoplanets can be detected with various observational techniques. Among them,\nradial velocity (RV) has the key advantages of revealing the architecture of\nplanetary systems and measuring planetary mass and orbital eccentricities. RV\nobservations are poised to play a key role in the detection and\ncharacterization of Earth twins. However, the detection of such small planets\nis not yet possible due to very complex, temporally correlated instrumental and\nastrophysical stochastic signals. Furthermore, exploring the large parameter\nspace of RV models exhaustively and efficiently presents difficulties. In this\nreview, we frame RV data analysis as a problem of detection and parameter\nestimation in unevenly sampled, multivariate time series. The objective of this\nreview is two-fold: to introduce the motivation, methodological challenges, and\nnumerical challenges of RV data analysis to nonspecialists, and to unify the\nexisting advanced approaches in order to identify areas for improvement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:59:42 GMT"}],"update_date":"2023-08-02","authors_parsed":[["Hara","Nathan C.",""],["Ford","Eric B.",""]]}
{"id":"2308.00717","submitter":"Amardeep Singh","authors":"Amardeep Singh","title":"The Study and Optimization Of Production/Fermentation Processes In\n  Biofuel Production","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.OT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The production process involved in the creation of biofuels consists of a\nnumber of operations and steps that require a meticulous understanding of the\nparameters and metrics. The production techniques again differ depending on the\npre-treatment systems, source material, the methods used for extraction, types\nof nutrients used, cell cultures employed, time undertaken and temperature. Due\nto the strategic and crucial role that bioethanol holds in supporting the\nenergy demands of the future, it becomes important to run such processes to a\nhighly optimized extent. One of the frontiers of leading such optimized designs\nis by studying the data from the production processes, formulating design\nexperiments from said data and correlating the results with the parameters\nusing analytical tools. While the case examples analyzed relate to bioethanol\nmostly, an additional analysis has been performed for data on biodiesel.\nCoupled with confirmatory methods such as Principal Component Analysis,\nresearchers can help narrow down the extent or degree to which the parameters\naffect the final outcome and even configure inputs that may not play a\ndefinitive role in greater outputs. The project first tackles through some\nconventional case studies involving biofuel production using an FIS(Fuzzy\nInterface System) and provides certain insights into the ways in which fuel\nyields can be enhanced depending on the particular cases. For the purpose of\nanalysis, tools such as MATLAB, Python and WEKA have been employed. Python and\nWEKA have been used extensively in building principal component analysis\nreviews for the purpose of this project while MATLAB has been used for building\nthe FIS models.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:13:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Singh","Amardeep",""]]}
{"id":"2308.00718","submitter":"Qing Yin","authors":"Haoyuan Li and Qing Yin","title":"Beam Detection Based on Machine Learning Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The positions of free electron laser beams on screens are precisely\ndetermined by a sequence of machine learning models. Transfer training is\nconducted in a self-constructed convolutional neural network based on VGG16\nmodel. Output of intermediate layers are passed as features to a support vector\nregression model. With this sequence, 85.8% correct prediction is achieved on\ntest data.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:25:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Haoyuan",""],["Yin","Qing",""]]}
{"id":"2308.00719","submitter":"Samir Katte","authors":"Samir R Katte","title":"Communication systems using LabVIEW","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.SY eess.SP eess.SY","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  LabVIEW enables engineers to simulate various communication and control\nsystems. LabVIEW helps to create Virtual Instruments (VIs) which are the files\nwith which the user interacts to accomplish the required task. In this paper,\nthe AM system implementation in LabVIEW is explained in detail along with the\nobserved waveforms. The AM system is implemented using two separate VIs i.e.\nTransmitter_AM.vi and Receiver_AM.vi. Each VI has two parts: Front Panel and\nthe Block Diagram. The Front Panel is usually the interface the user interacts\nwith and observes results. The block diagram contains the blocks used to\nimplement the functionality required for the operation of the VI. The\nindividual blocks in the block diagram are called the sub VIs. The user may or\nmay not need to make changes in the block diagram of the VI during the\nexecution of the LabVIEW program.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 04:38:12 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Katte","Samir R",""]]}
{"id":"2308.00720","submitter":"Philippe Toint","authors":"Ph. L. Toint","title":"Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple\n  example","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A very simple unidimensional function with Lipschitz continuous gradient is\nconstructed such that the ADAM algorithm with constant stepsize, started from\nthe origin, diverges when applied to minimize this function in the absence of\nnoise on the gradient. Divergence occurs irrespective of the choice of the\nmethod parameters.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:13:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Toint","Ph. L.",""]]}
{"id":"2308.00722","submitter":"Lorena Ballesteros Ferraz","authors":"Lorena Ballesteros Ferraz, John Martin and Yves Caudano","title":"On the relevance of weak measurements in dissipative quantum systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We investigate the impact of dissipation on weak measurements. While weak\nmeasurements have been successful in signal amplification, dissipation can\ncompromise their usefulness. More precisely, we show that in systems with\nnon-degenerate eigenstates, weak values always converge to the expectation\nvalue of the measured observable as dissipation time tends to infinity, in\ncontrast to systems with degenerate eigenstates, where the weak values can\nremain anomalous, i.e., outside the range of eigenvalues of the observable,\neven in the limit of an infinite dissipation time. In addition, we propose a\nmethod for extracting information about the dissipative dynamics of a system\nusing weak values at short dissipation times. Specifically, we explore the\namplification of the dissipation rate in a two-level system and the use of weak\nvalues to differentiate between Markovian and non-Markovian dissipative\ndynamics. We also find that weak measurements operating around a weak\natom-cavity coupling can probe the atom dissipation through the weak value of\nnon-Hermitian operators within the rotating-wave approximation of the weak\ninteraction.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:24:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ferraz","Lorena Ballesteros",""],["Martin","John",""],["Caudano","Yves",""]]}
{"id":"2308.00723","submitter":"Khaled Telli","authors":"Khaled Telli, Boumehraz Mohamed","title":"Black-Box System Identification for Low-Cost Quadrotor Attitude at\n  Hovering","comments":null,"journal-ref":"Electrotehnica, Electronica, Automatica (EEA), 70 (2022), nr. 4,\n  pp. 88-97","doi":"10.46904/eea.22.70.4.1108009","report-no":null,"categories":"eess.SY cs.RO cs.SY eess.SP math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The accuracy of dynamic modelling of unmanned aerial vehicles, specifically\nquadrotors, is gaining importance since strict conditionalities are imposed on\nrotorcraft control. The system identification plays a crucial role as an\neffective approach for the problem of the fine-tuning dynamic models for\napplications such control system design and as handling quality evaluation.\nThis paper focuses on black-box identification, describing the quadrotor\ndynamics based on experimental setup through sensor preparation for data\ncollection, modelling, control design, and verification stages.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:31:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Telli","Khaled",""],["Mohamed","Boumehraz",""]]}
{"id":"2308.00724","submitter":"Xavier Bekaert","authors":"Xavier Bekaert","title":"Geometric tool kit for higher spin gravity (part II): An introduction to\n  Lie algebroids and their enveloping algebras","comments":"54 pages, no figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  These notes provide a self-contained introduction to Lie algebroids,\nLie-Rinehart algebras and their universal envelopes. This review is motivated\nby the speculation that higher-spin gauge symmetries should admit a natural\nformulation as enveloping algebras of Lie algebroids since rigid higher-spin\nalgebras are enveloping algebras of Lie algebras. Nevertheless, the material\ncovered here may be of general interest to anyone interested in the description\nof gauge symmetries, connections and covariant derivatives, in terms of Lie\nalgebroids. In order to be self-contained, a concise introduction to the\nalgebraic characterisation of vector bundles as projective modules over the\nalgebra of functions on the base manifold is provided.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:49:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bekaert","Xavier",""]]}
{"id":"2308.00725","submitter":"Muhammet Balcilar Dr.","authors":"Muhammet Balcilar, Bharath Bhushan Damodaran, Karam Naser, Franck\n  Galpin and Pierre Hellier","title":"Latent-Shift: Gradient of Entropy Helps Neural Codecs","comments":"Published to ICIP2023, 6 pages, 1 figure","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":"  End-to-end image/video codecs are getting competitive compared to traditional\ncompression techniques that have been developed through decades of manual\nengineering efforts. These trainable codecs have many advantages over\ntraditional techniques such as easy adaptation on perceptual distortion metrics\nand high performance on specific domains thanks to their learning ability.\nHowever, state of the art neural codecs does not take advantage of the\nexistence of gradient of entropy in decoding device. In this paper, we\ntheoretically show that gradient of entropy (available at decoder side) is\ncorrelated with the gradient of the reconstruction error (which is not\navailable at decoder side). We then demonstrate experimentally that this\ngradient can be used on various compression methods, leading to a $1-2\\%$ rate\nsavings for the same quality. Our method is orthogonal to other improvements\nand brings independent rate savings.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:12:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Balcilar","Muhammet",""],["Damodaran","Bharath Bhushan",""],["Naser","Karam",""],["Galpin","Franck",""],["Hellier","Pierre",""]]}
{"id":"2308.00726","submitter":"Judith Su","authors":"Sartanee Suebka, Euan McLeod, Judith Su","title":"Ultra-high-Q free space coupling to microtoroid resonators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Whispering gallery mode (WGM) microtoroid resonators are one of the most\nsensitive biochemical sensors in existence, capable of detecting single\nmolecules. The main barrier for translating these devices out of the laboratory\nis that light is evanescently coupled into these devices though a tapered\noptical fiber. This hinders translation of these devices as the taper is\nfragile, suffers from mechanical vibration, and requires precise positioning.\nHere, we eliminate the need for an optical fiber by coupling light into and out\nfrom a toroid via free-space coupling and monitoring the scattered resonant\nlight. A single long working distance objective lens combined with a digital\nmicromirror device (DMD) was used for light injection, scattered light\ncollection, and imaging. We obtain Q-factors as high as $1.6 \\times 10^8$ with\nthis approach. Electromagnetically induced transparency (EIT)-like and Fano\nresonances were observed in a single cavity due to indirect coupling in free\nspace. This enables improved sensing sensitivity. The large effective coupling\narea (~10 ${\\mu}$m in diameter for numerical aperture = 0.14) removes the need\nfor precise positioning. Sensing performance was verified by combining the\nsystem with the frequency locked whispering evanescent resonator (FLOWER)\napproach to perform temperature sensing experiments. We believe that this work\nwill be a foundation for expanding the implementation of WGM microtoroid\nresonators to real-world applications.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:25:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Suebka","Sartanee",""],["McLeod","Euan",""],["Su","Judith",""]]}
{"id":"2308.00727","submitter":"Hengchu Lu","authors":"Hengchu Lu, Yuanjie Shao, Xiang Wang, Changxin Gao","title":"Adaptive Semantic Consistency for Cross-domain Few-shot Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-domain few-shot classification (CD-FSC) aims to identify novel target\nclasses with a few samples, assuming that there exists a domain shift between\nsource and target domains. Existing state-of-the-art practices typically\npre-train on source domain and then finetune on the few-shot target data to\nyield task-adaptive representations. Despite promising progress, these methods\nare prone to overfitting the limited target distribution since data-scarcity\nand ignore the transferable knowledge learned in the source domain. To\nalleviate this problem, we propose a simple plug-and-play Adaptive Semantic\nConsistency (ASC) framework, which improves cross-domain robustness by\npreserving source transfer capability during the finetuning stage. Concretely,\nwe reuse the source images in the pretraining phase and design an adaptive\nweight assignment strategy to highlight the samples similar to target domain,\naiming to aggregate informative target-related knowledge from source domain.\nSubsequently, a semantic consistency regularization is applied to constrain the\nconsistency between the semantic features of the source images output by the\nsource model and target model. In this way, the proposed ASC enables explicit\ntransfer of source domain knowledge to prevent the model from overfitting the\ntarget domain. Extensive experiments on multiple benchmarks demonstrate the\neffectiveness of the proposed ASC, and ASC provides consistent improvements\nover the baselines. The source code will be released.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:37:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lu","Hengchu",""],["Shao","Yuanjie",""],["Wang","Xiang",""],["Gao","Changxin",""]]}
{"id":"2308.00728","submitter":"Weide Liu","authors":"Jieming Lou, Weide Liu, Zhuo Chen, Fayao Liu, and Jun Cheng","title":"ELFNet: Evidential Local-global Fusion for Stereo Matching","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although existing stereo matching models have achieved continuous\nimprovement, they often face issues related to trustworthiness due to the\nabsence of uncertainty estimation. Additionally, effectively leveraging\nmulti-scale and multi-view knowledge of stereo pairs remains unexplored. In\nthis paper, we introduce the \\textbf{E}vidential \\textbf{L}ocal-global\n\\textbf{F}usion (ELF) framework for stereo matching, which endows both\nuncertainty estimation and confidence-aware fusion with trustworthy heads.\nInstead of predicting the disparity map alone, our model estimates an\nevidential-based disparity considering both aleatoric and epistemic\nuncertainties. With the normal inverse-Gamma distribution as a bridge, the\nproposed framework realizes intra evidential fusion of multi-level predictions\nand inter evidential fusion between cost-volume-based and transformer-based\nstereo matching. Extensive experimental results show that the proposed\nframework exploits multi-view information effectively and achieves\nstate-of-the-art overall performance both on accuracy and cross-domain\ngeneralization.\n  The codes are available at https://github.com/jimmy19991222/ELFNet.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:51:04 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lou","Jieming",""],["Liu","Weide",""],["Chen","Zhuo",""],["Liu","Fayao",""],["Cheng","Jun",""]]}
{"id":"2308.00729","submitter":"Kun Yuan","authors":"Hongbo Liu, Mingda Wu, Kun Yuan, Ming Sun, Yansong Tang, Chuanchuan\n  Zheng, Xing Wen, Xiu Li","title":"Ada-DQA: Adaptive Diverse Quality-aware Feature Acquisition for Video\n  Quality Assessment","comments":"10 pages, 5 figures, to appear in ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video quality assessment (VQA) has attracted growing attention in recent\nyears. While the great expense of annotating large-scale VQA datasets has\nbecome the main obstacle for current deep-learning methods. To surmount the\nconstraint of insufficient training data, in this paper, we first consider the\ncomplete range of video distribution diversity (\\ie content, distortion,\nmotion) and employ diverse pretrained models (\\eg architecture, pretext task,\npre-training dataset) to benefit quality representation. An Adaptive Diverse\nQuality-aware feature Acquisition (Ada-DQA) framework is proposed to capture\ndesired quality-related features generated by these frozen pretrained models.\nBy leveraging the Quality-aware Acquisition Module (QAM), the framework is able\nto extract more essential and relevant features to represent quality. Finally,\nthe learned quality representation is utilized as supplementary supervisory\ninformation, along with the supervision of the labeled quality score, to guide\nthe training of a relatively lightweight VQA model in a knowledge distillation\nmanner, which largely reduces the computational cost during inference.\nExperimental results on three mainstream no-reference VQA benchmarks clearly\nshow the superior performance of Ada-DQA in comparison with current\nstate-of-the-art approaches without using extra training data of VQA.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:04:42 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Liu","Hongbo",""],["Wu","Mingda",""],["Yuan","Kun",""],["Sun","Ming",""],["Tang","Yansong",""],["Zheng","Chuanchuan",""],["Wen","Xing",""],["Li","Xiu",""]]}
{"id":"2308.00730","submitter":"Somar Shekh Alshabab","authors":"Somar Shekh Alshabab, Bernd Markert, and Franz Bamer","title":"Universality in the fracture of silica glass","comments":"11 Pages with 8 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.mtrl-sci cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The presence of universality of avalanches characterizing the inelastic\nresponse of disordered materials has the potential to bridge the gap from\nmicro- to macroscale. In this study, we explore the statistics and the scaling\nbehavior of avalanches in the fracture of silica glass on the microscale using\nmolecular mechanics. We introduce a robust method for capturing and quantifying\nthe avalanches, allowing us to perform rigorous statistical analysis, revealing\nuniversal power laws associated with critical phenomena. The computed exponents\nsuggest that nanoscale fracture of silica belongs to the same universality\nclass as depinning models. Additionally, the influence of an initial crack is\nexplored, observing deviations from mean-field predictions while maintaining\ncriticality. Furthermore, we investigate the strain-dependent probability\ndensity function (PDF), its cutoff function, and the interrelation between the\ncritical exponents. Finally, we unveil distinct scaling behavior for small and\nlarge avalanches of the crack growth, shedding light on the underlying fracture\nmechanisms in silica glass.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:20:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Alshabab","Somar Shekh",""],["Markert","Bernd",""],["Bamer","Franz",""]]}
{"id":"2308.00731","submitter":"Nicolas Lanchier","authors":"Nicolas Lanchier and Max Mercer","title":"The contact process with an asymptomatic state","comments":"23 pages, 4 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In order to understand the role of a potentially high infectiousness of\nsymptomatic individuals or, on the contrary, social distancing, quarantine,\netc. in the course of an infectious disease, this paper introduces a natural\nvariant of the popular contact process that distinguishes between asymptomatic\nand symptomatic individuals. Infected individuals all recover at rate one but\ninfect nearby individuals at a rate that depends on whether they show the\nsymptoms of the disease or not. Newly infected individuals are always\nasymptomatic and may or may not show the symptoms before they recover. The\nanalysis of the corresponding mean-field model reveals that, in the absence of\nlocal interactions, regardless of the rate at which asymptomatic individuals\nbecome symptomatic, there is an epidemic whenever at least one of the infection\nrates is sufficiently large. In contrast, our analysis of the interacting\nparticle system shows that, when the rate at which asymptomatic individuals\nbecome symptomatic and the rate at which asymptomatic individuals infect nearby\nindividuals are small, there cannot be any epidemic even when symptomatic\nindividuals are highly infectious.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:27:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lanchier","Nicolas",""],["Mercer","Max",""]]}
{"id":"2308.00732","submitter":"Deepisha Solanki","authors":"Deepisha Solanki","title":"Studying Links via Plats: The Unlink","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our main result is a version of Birman's theorem about equivalence of plats,\nwhich does not involve stabilization, for the unlink. We introduce the pocket\nand flip moves, which modify a plat without changing its link type or bridge\nindex. Theorem 1 shows that using the pocket and flip moves, one can simplify\nany closed $n$-plat presentation of the unknot to the standard 0-crossing\ndiagram of the unknot, through a sequence of plats of non-increasing bridge\nindex. The theorem readily generalises to the case of the unlink.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:38:30 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 19:21:50 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Solanki","Deepisha",""]]}
{"id":"2308.00733","submitter":"Ozioma Collins Oguine","authors":"Mohammed Almutairi and Ozioma Collins Oguine","title":"Mapping Computer Science Research: Trends, Influences, and Predictions","comments":"7 pages, 8 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper explores the current trending research areas in the field of\nComputer Science (CS) and investigates the factors contributing to their\nemergence. Leveraging a comprehensive dataset comprising papers, citations, and\nfunding information, we employ advanced machine learning techniques, including\nDecision Tree and Logistic Regression models, to predict trending research\nareas. Our analysis reveals that the number of references cited in research\npapers (Reference Count) plays a pivotal role in determining trending research\nareas making reference counts the most relevant factor that drives trend in the\nCS field. Additionally, the influence of NSF grants and patents on trending\ntopics has increased over time. The Logistic Regression model outperforms the\nDecision Tree model in predicting trends, exhibiting higher accuracy,\nprecision, recall, and F1 score. By surpassing a random guess baseline, our\ndata-driven approach demonstrates higher accuracy and efficacy in identifying\ntrending research areas. The results offer valuable insights into the trending\nresearch areas, providing researchers and institutions with a data-driven\nfoundation for decision-making and future research direction.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:59:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Almutairi","Mohammed",""],["Oguine","Ozioma Collins",""]]}
{"id":"2308.00734","submitter":"Patrick La Riviere","authors":"Nikolaj Reiser, Min Guo, Hari Shroff, Patrick J. La Riviere","title":"Phase Diverse Phase Retrieval for Microscopy: Comparison of Gaussian and\n  Poisson Approaches","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phase diversity is a widefield aberration correction method that uses\nmultiple images to estimate the phase aberration at the pupil plane of an\nimaging system by solving an optimization problem. This estimated aberration\ncan then be used to deconvolve the aberrated image or to reacquire it with\naberration corrections applied to a deformable mirror. The optimization problem\nfor aberration estimation has been formulated for both Gaussian and Poisson\nnoise models but the Poisson model has never been studied in microscopy nor\ncompared with the Gaussian model. Here, the Gaussian- and Poisson-based\nestimation algorithms are implemented and compared for widefield microscopy in\nsimulation. The Poisson algorithm is found to match or outperform the Gaussian\nalgorithm in a variety of situations, and converges in a similar or decreased\namount of time. The Gaussian algorithm does perform better in low-light regimes\nwhen image noise is dominated by additive Gaussian noise. The Poisson algorithm\nis also found to be more robust to the effects of spatially variant aberration\nand phase noise. Finally, the relative advantages of re-acquisition with\naberration correction and deconvolution with aberrated point spread functions\nare compared.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:06:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Reiser","Nikolaj",""],["Guo","Min",""],["Shroff","Hari",""],["La Riviere","Patrick J.",""]]}
{"id":"2308.00735","submitter":"Rafael De Mello Brand\\~ao","authors":"Marcio Ferreira Moreno and Rafael Rossi de Mello Brand\\~ao","title":"A Knowledge-Oriented Approach to Enhance Integration and Communicability\n  in the Polkadot Ecosystem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DC cs.IR cs.NI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Polkadot ecosystem is a disruptive and highly complex multi-chain\narchitecture that poses challenges in terms of data analysis and\ncommunicability. Currently, there is a lack of standardized and holistic\napproaches to retrieve and analyze data across parachains and applications,\nmaking it difficult for general users and developers to access ecosystem data\nconsistently. This paper proposes a conceptual framework that includes a domain\nontology called POnto (a Polkadot Ontology) to address these challenges. POnto\nprovides a structured representation of the ecosystem's concepts and\nrelationships, enabling a formal understanding of the platform. The proposed\nknowledge-oriented approach enhances integration and communicability, enabling\na wider range of users to participate in the ecosystem and facilitating the\ndevelopment of AI-based applications. The paper presents a case study\nmethodology to validate the proposed framework, which includes expert feedback\nand insights from the Polkadot community. The POnto ontology and the roadmap\nfor a query engine based on a Controlled Natural Language using the ontology,\nprovide valuable contributions to the growth and adoption of the Polkadot\necosystem in heterogeneous socio-technical environments.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:34:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Moreno","Marcio Ferreira",""],["Brand\u00e3o","Rafael Rossi de Mello",""]]}
{"id":"2308.00736","submitter":"Noemi Rocco","authors":"Alexis Nikolakopoulos, Noah Steinberg, Alessandro Lovato, Noemi Rocco","title":"Lepton-Nucleus Interactions within Microscopic Approaches","comments":"30 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-388-T","categories":"nucl-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This review paper emphasizes the significance of microscopic calculations\nwith quantified theoretical error estimates in studying lepton-nucleus\ninteractions and their implications for electron-scattering and accelerator\nneutrino-oscillation measurements. We investigate two approaches: Green's\nFunction Monte Carlo and the extended factorization scheme, utilizing realistic\nnuclear target spectral functions. In our study, we include relativistic\neffects in Green's Function Monte Carlo and validate the inclusive\nelectron-scattering cross section on carbon using available data. We compare\nthe flux folded cross sections for neutrino-Carbon scattering with T2K and\nMINER$\\nu$A experiments, noting the substantial impact of relativistic effects\nin reducing the theoretical curve strength when compared to MINER$\\nu$A data.\nAdditionally, we demonstrate that quantum Monte Carlo-based spectral functions\naccurately reproduce the quasi-elastic region in electron-scattering data and\nT2K flux folded cross sections. By comparing results from Green's Function\nMonte Carlo and the spectral function approach, which share a similar initial\ntarget state description, we quantify errors associated with approximations in\nthe factorization scheme and the relativistic treatment of kinematics in\nGreen's Function Monte Carlo.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:46:28 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nikolakopoulos","Alexis",""],["Steinberg","Noah",""],["Lovato","Alessandro",""],["Rocco","Noemi",""]]}
{"id":"2308.00737","submitter":"Hao Geng","authors":"Cameron V. Cogburn, A. Liam Fitzpatrick, Hao Geng","title":"CFT and Lattice Correlators Near an RG Domain Wall between Minimal\n  Models","comments":"24+19 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conformal interfaces separating two conformal field theories (CFTs) provide\nmaps between different CFTs, and naturally exist in nature as domain walls\nbetween different phases. One particularly interesting construction of a\nconformal interface is the renormalization group (RG) domain wall between CFTs.\nFor a given Virasoro minimal model $\\mathcal{M}_{k+3,k+2}$, an RG domain wall\ncan be generated by a specific deformation which triggers an RG flow towards\nits adjacent Virasoro minimal model $\\mathcal{M}_{k+2,k+1}$ with the\ndeformation turned on over part of the space. An algebraic construction of this\ndomain wall was proposed by Gaiotto in \\cite{Gaiotto:2012np}. In this paper, we\nwill provide a study of this RG domain wall for the minimal case $k=2$, which\ncan be thought of as a nonperturbative check of the construction. In this case\nthe wall is separating the Tricritical Ising Model (TIM) CFT and the Ising\nModel (IM) CFT. We will check the analytical results of correlation functions\nfrom the RG brane construction with the numerical density matrix\nrenormalization group (DMRG) calculation using a lattice model proposed in\n\\cite{Grover:2012bm,Grover:2013rc}, and find a perfect agreement. We comment on\npossible experimental realizations of this RG domain wall.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cogburn","Cameron V.",""],["Fitzpatrick","A. Liam",""],["Geng","Hao",""]]}
{"id":"2308.00738","submitter":"Oliver Hart","authors":"Oliver Hart","title":"Exact Mazur bounds in the pair-flip model and beyond","comments":"25 pages (single-column format), 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn cond-mat.str-el math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By mapping the calculation of Mazur bounds to the enumeration of walks on\nfractal structures, we present exact bounds on the late-time behavior of spin\nautocorrelation functions in models exhibiting pair-flip dynamics and more\ngeneral $p$-flip dynamics. While the pair-flip model is known to exhibit strong\nHilbert space fragmentation, the effect of its nonlocal conservation laws on\nautocorrelation functions has, thus far, only been calculated numerically,\nwhich has led to incorrect conclusions about their thermodynamic behavior.\nHere, using exact results, we prove that infinite-temperature autocorrelation\nfunctions exhibit infinite coherence times at the boundary, and that bulk Mazur\nbounds decay asymptotically as $1/\\sqrt{L}$, rather than $1/L$, as had\npreviously been thought. This result implies that the nonlocal conserved\noperators implied by $p$-flip dynamics have an important qualitative impact on\nbulk thermalization properties beyond the constraints imposed by local\nsymmetries alone.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hart","Oliver",""]]}
{"id":"2308.00739","submitter":"Takato Mori Dr.","authors":"Takato Mori, Beni Yoshida","title":"Exploring causality in braneworld/cutoff holography via holographic\n  scattering","comments":"41 pages, 16 figures","journal-ref":null,"doi":null,"report-no":"YITP-23-94","categories":"hep-th gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Holography with branes and/or cutoff surfaces presents a promising approach\nto studying quantum gravity beyond asymptotically anti-de Sitter spacetimes.\nHowever, this generalized holography is known to face several inconsistencies,\nincluding potential violations of causality and fundamental entropic\ninequalities. In this work, we address these challenges by investigating the\nbulk scattering process and its holographic realization. Specifically, we\npropose that the information on a brane/cutoff surface $Q$ propagates according\nto the induced light cones originating from a fictitious asymptotic boundary\nbehind $Q$, rather than the conventional ones originating from a point on $Q$.\nAdditionally, we establish the validity of the connected wedge theorem for\ngeneralized holography with induced light cones. We also demonstrate that\nentropic inequalities remain valid within the induced causal diamonds. While\nthe induced light cone seemingly permits superluminal signaling, we argue that\nthis causality violation can be an artifact of state preparation for radially\npropagating excitations, rather than local operator excitations on $Q$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Mori","Takato",""],["Yoshida","Beni",""]]}
{"id":"2308.00740","submitter":"Vladimir Rosenhaus","authors":"Vladimir Rosenhaus, Daniel Schubring, Md Shaikot Jahan Shuvo, and\n  Michael Smolkin","title":"Loop diagrams in the kinetic theory of waves","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech nlin.CD physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent work has given a systematic way for studying the kinetics of classical\nweakly interacting waves beyond leading order, having analogies with\nrenormalization in quantum field theory. An important context is weak wave\nturbulence, occurring for waves which are small in magnitude and weakly\ninteracting, such as those on the surface of the ocean. Here we continue the\nwork of perturbatively computing correlation functions and the kinetic equation\nin this far-from-equilibrium state. In particular, we obtain the two-loop\nkinetic equation for waves with a cubic interaction. Our main result is a\nsimple graphical prescription for the terms in the kinetic equation, at any\norder in the nonlinearity.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rosenhaus","Vladimir",""],["Schubring","Daniel",""],["Shuvo","Md Shaikot Jahan",""],["Smolkin","Michael",""]]}
{"id":"2308.00741","submitter":"Yifan Chen","authors":"Yifan Chen, Xiao Xue, Vitor Cardoso","title":"Black Holes as Neutrino Factories","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"DESY-23-109","categories":"hep-ph astro-ph.CO astro-ph.HE gr-qc hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultralight bosons can grow substantially in the vicinity of a black hole,\nthrough superradiant energy extraction. Consequently, such bosons can\npotentially reach field values close to the Planck scale, making black holes\npowerful transducers of such fields. If a scalar field couples to neutrino, it\ncan trigger parametric production of neutrinos, and potentially quench their\nsuperradiant growth. During this saturation phase, scalar clouds can accelerate\nneutrinos to the TeV energy scale, generating fluxes that surpass those\nproduced by atmospheric neutrinos.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chen","Yifan",""],["Xue","Xiao",""],["Cardoso","Vitor",""]]}
{"id":"2308.00742","submitter":"Yasaman Homayouni","authors":"Y. Homayouni, Gerard A. Kriss, Gisella De Rosa, Rachel Plesha, Edward\n  M. Cackett, Michael R. Goad, Kirk T. Korista, Keith Horne, Travis Fischer,\n  Tim Waters, Aaron J. Barth, Erin A. Kara, Hermine Landt, Nahum Arav, Benjamin\n  D. Boizelle, Misty C. Bentz, Michael S. Brotherton, Doron Chelouche, Elena\n  Dalla Bonta, Maryam Dehghanian, Pu Du, Gary J. Ferland, Carina Fian, Jonathan\n  Gelbord, Catherine J. Grier, Patrick B. Hall, Chen Hu, Dragana Ilic, Michael\n  D. Joner, Jelle Kaastra, Shai Kaspi, Andjelka B. Kovacevic, Daniel Kynoch,\n  Yan-Rong Li, Missagh Mehdipour, Jake A. Miller, Jake Mitchell, John Montano,\n  Hagai Netzer, J. M. M. Neustadt, Ethan Partington, Luka C. Popovic, Daniel\n  Proga, Thaisa Storchi-Bergmann, David Sanmartim, Matthew R. Siebert, Tommaso\n  Treu, Marianne Vestergaard, Jian-Min Wang, Martin J. Ward, Fatima Zaidouni,\n  and Ying Zu","title":"AGN STORM 2: V. Anomalous Behavior of the CIV Light Curve in Mrk 817","comments":"20 pages, 8 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An intensive reverberation mapping campaign on the Seyfert 1 galaxy Mrk817\nusing the Cosmic Origins Spectrograph (COS) on the Hubble Space Telescope (HST)\nrevealed significant variations in the response of the broad UV emission lines\nto fluctuations in the continuum emission. The response of the prominent UV\nemission lines changes over a $\\sim$60-day duration, resulting in distinctly\ndifferent time lags in the various segments of the light curve over the 14\nmonths observing campaign. One-dimensional echo-mapping models fit these\nvariations if a slowly varying background is included for each emission line.\nThese variations are more evident in the CIV light curve, which is the line\nleast affected by intrinsic absorption in Mrk817 and least blended with\nneighboring emission lines. We identify five temporal windows with distinct\nemission line response, and measure their corresponding time delays, which\nrange from 2 to 13 days. These temporal windows are plausibly linked to changes\nin the UV and X-ray obscuration occurring during these same intervals. The\nshortest time lags occur during periods with diminishing obscuration, whereas\nthe longest lags occur during periods with rising obscuration. We propose that\nthe obscuring outflow shields the ultraviolet broad lines from the ionizing\ncontinuum. The resulting change in the spectral energy distribution of the\nionizing continuum, as seen by clouds at a range of distances from the nucleus,\nis responsible for the changes in the line response.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 17:37:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Homayouni","Y.",""],["Kriss","Gerard A.",""],["De Rosa","Gisella",""],["Plesha","Rachel",""],["Cackett","Edward M.",""],["Goad","Michael R.",""],["Korista","Kirk T.",""],["Horne","Keith",""],["Fischer","Travis",""],["Waters","Tim",""],["Barth","Aaron J.",""],["Kara","Erin A.",""],["Landt","Hermine",""],["Arav","Nahum",""],["Boizelle","Benjamin D.",""],["Bentz","Misty C.",""],["Brotherton","Michael S.",""],["Chelouche","Doron",""],["Bonta","Elena Dalla",""],["Dehghanian","Maryam",""],["Du","Pu",""],["Ferland","Gary J.",""],["Fian","Carina",""],["Gelbord","Jonathan",""],["Grier","Catherine J.",""],["Hall","Patrick B.",""],["Hu","Chen",""],["Ilic","Dragana",""],["Joner","Michael D.",""],["Kaastra","Jelle",""],["Kaspi","Shai",""],["Kovacevic","Andjelka B.",""],["Kynoch","Daniel",""],["Li","Yan-Rong",""],["Mehdipour","Missagh",""],["Miller","Jake A.",""],["Mitchell","Jake",""],["Montano","John",""],["Netzer","Hagai",""],["Neustadt","J. M. M.",""],["Partington","Ethan",""],["Popovic","Luka C.",""],["Proga","Daniel",""],["Storchi-Bergmann","Thaisa",""],["Sanmartim","David",""],["Siebert","Matthew R.",""],["Treu","Tommaso",""],["Vestergaard","Marianne",""],["Wang","Jian-Min",""],["Ward","Martin J.",""],["Zaidouni","Fatima",""],["Zu","Ying",""]]}
{"id":"2308.00743","submitter":"\\\"Omer Mert Aksoy","authors":"\\\"Omer M. Aksoy, Christopher Mudry, Akira Furusaki, Apoorv Tiwari","title":"Lieb-Schultz-Mattis anomalies and web of dualities induced by gauging in\n  quantum spin chains","comments":"84 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lieb-Schultz-Mattis (LSM) theorems impose non-perturbative constraints on the\nzero-temperature phase diagrams of quantum lattice Hamiltonians (always assumed\nto be local in this paper). LSM theorems have recently been interpreted as the\nlattice counterparts to mixed 't Hooft anomalies in quantum field theories that\narise from a combination of crystalline and global internal symmetry groups.\nAccordingly, LSM theorems have been reinterpreted as LSM anomalies. In this\nwork, we provide a systematic diagnostic for LSM anomalies in one spatial\ndimension. We show that gauging subgroups of the global internal symmetry group\nof a quantum lattice model obeying an LSM anomaly delivers a dual quantum\nlattice Hamiltonian such that its internal and crystalline symmetries mix\nnon-trivially through a group extension. This mixing of crystalline and\ninternal symmetries after gauging is a direct consequence of the LSM anomaly,\ni.e., it can be used as a diagnostic of an LSM anomaly. We exemplify this\nprocedure for a quantum spin-1/2 chain obeying an LSM anomaly resulting from\ncombining a global internal $\\mathbb{Z}^{\\,}_{2}\\times\\mathbb{Z}^{\\,}_{2}$\nsymmetry with translation or reflection symmetry. We establish a triality of\nmodels by gauging a\n$\\mathbb{Z}^{\\,}_{2}\\subset\\mathbb{Z}^{\\,}_{2}\\times\\mathbb{Z}^{\\,}_{2}$\nsymmetry in two ways, one of which amounts to performing a Kramers-Wannier\nduality, while the other implements a Jordan-Wigner duality. We discuss the\nmapping of the phase diagram of the quantum spin-1/2 $XYZ$ chains under such a\ntriality. We show that the deconfined quantum critical transitions between Neel\nand dimer orders are mapped to either topological or conventional\nLandau-Ginzburg transitions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Aksoy","\u00d6mer M.",""],["Mudry","Christopher",""],["Furusaki","Akira",""],["Tiwari","Apoorv",""]]}
{"id":"2308.00744","submitter":"Elena Asencio","authors":"E. Asencio, I. Banik, P. Kroupa","title":"The El Gordo galaxy cluster challenges {\\Lambda}CDM for any plausible\n  collision velocity","comments":"8 pages, 1 figure. Accepted for publication in The Astrophysical\n  Journal in this form","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  El Gordo (ACT-CL J0102-4915) is an extraordinarily large and bright galaxy\ncluster collision. In a previous study, we found that El Gordo is in\n$6.2\\sigma$ tension with the $\\Lambda$CDM standard model when assuming the\nnominal mass and infall velocity values from the hydrodynamical simulations of\nZhang et al. ($M_{200} = 3.2 \\times 10^{15} M_{\\odot}$ and $V_{\\textrm{infall}}\n= 2500~\\textrm{km~s}^{-1}$, respectively). The recent weak lensing study of Kim\net al. showed that the mass of El Gordo is actually $2.13^{+0.25}_{-0.23}\n\\times 10^{15} M_{\\odot}$. Here we explore the level of tension between El\nGordo and $\\Lambda$CDM for the new mass estimate, assuming several\n$V_{\\textrm{infall}}$ values. We find that in order to reduce the tension below\nthe $5\\sigma$ level, the El Gordo subclusters should have $V_{\\textrm{infall}}\n< 2300~\\textrm{km~s}^{-1}$ ($V_{\\textrm{infall}} < 1800~\\textrm{km~s}^{-1}$\nwhen considering the combined tension with the Bullet Cluster). To the best of\nour knowledge, the El Gordo hydrodynamical simulations conducted so far require\n$V_{\\textrm{infall}} \\geq 2500~\\textrm{km~s}^{-1}$ to simultaneously reproduce\nits morphology and its high X-ray luminosity and temperature. We therefore\nconclude that El Gordo still poses a significant challenge to $\\Lambda$CDM\ncosmology. Whether the properties of El Gordo can be reconciled with a lower\n$V_{\\textrm{infall}}$ should be tested with new hydrodynamical simulations that\nexplore different configurations of the interaction.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Asencio","E.",""],["Banik","I.",""],["Kroupa","P.",""]]}
{"id":"2308.00745","submitter":"Roxana Popescu","authors":"Roxana Popescu, Alexandra Pope, Kyoung-Soo Lee, Stacey Alberts,\n  Yi-Kuan Chiang, Sowon Lee, Mark Brodwin, Jed McKinney, Vandana Ramakrishnan","title":"Tracing the Total Stellar Mass and Star Formation of High-Redshift\n  Protoclusters","comments":"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":"  As the progenitors of present-day galaxy clusters, protoclusters are\nexcellent laboratories to study galaxy evolution. Since existing observations\nof protoclusters are limited to the detected constituent galaxies at UV and/or\ninfrared wavelengths, the details of how typical galaxies grow in these young,\npre-virialized structures remain uncertain. We measure the total stellar mass\nand star formation within protoclusters, including the contribution from faint\nundetected members by performing a stacking analysis of 211 $z=2-4$\nprotoclusters selected as Planck cold sources. We stack WISE and Herschel/SPIRE\nimages to measure the angular size and the spectral energy distribution of the\nintegrated light from the protoclusters. The fluxes of protoclusters selected\nas Planck cold sources can be contaminated by line of sight interlopers. Using\nthe WebSky simulation, we estimate that a single protocluster contributes\n$33\\pm15$% of the flux of a Planck cold source on average. After this\ncorrection, we obtain a total star formation rate of $7.3\\pm3.2 \\times 10^3\\\nM_{\\odot} {\\rm yr}^{-1}$ and a total stellar mass of $4.9\\pm 2.2\\times 10^{12}\\\nM_{\\odot}$. Our results indicate that protoclusters have, on average, 2x more\nstar formation and 4x more stellar mass than the total contribution from\nindividually-detected galaxies in spectroscopically-confirmed protoclusters.\nThis suggests that much of the total flux within $z=2-4$ protoclusters comes\nfrom galaxies with luminosities lower than the detection limit of SPIRE\n($L_{IR} < 3 \\times 10^{12} L_{\\odot}$). Lastly, we find that protoclusters\nsubtend a half-light radius of 2.8' (4.2-5.8 cMpc) which is consistent with\nsimulations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Popescu","Roxana",""],["Pope","Alexandra",""],["Lee","Kyoung-Soo",""],["Alberts","Stacey",""],["Chiang","Yi-Kuan",""],["Lee","Sowon",""],["Brodwin","Mark",""],["McKinney","Jed",""],["Ramakrishnan","Vandana",""]]}
{"id":"2308.00746","submitter":"Kyle Lee","authors":"Kyle Lee, Ian Moult","title":"Energy Correlators Taking Charge","comments":"6 pages, 5 incredible figures","journal-ref":null,"doi":null,"report-no":"MIT-CTP-5590","categories":"hep-ph hep-ex nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The confining transition from asymptotically free partons to hadrons remains\none of the most mysterious aspects of Quantum Chromodynamics. With the wealth\nof high quality jet substructure data we can hope to gain new experimental\ninsights into the details of its dynamics. Jet substructure has traditionally\nfocused on correlations, $\\langle \\mathcal{E}(n_1) \\mathcal{E}(n_2) \\cdots\n\\mathcal{E}(n_k) \\rangle$, in the energy flux of hadrons. However,\nsignificantly more information about the confinement transition is encoded in\nhow energy is correlated between hadrons with different quantum numbers, for\nexample electric charge. In this Letter we develop the field theoretic\nformalism to compute general correlations, $\\langle \\mathcal{E}_{R_1}(n_1)\n\\mathcal{E}_{R_2}(n_2) \\cdots\\mathcal{E}_{R_k}(n_k) \\rangle$, between the\nenergy flux carried by hadrons with quantum numbers $R_i$, by introducing new\nuniversal non-perturbative functions, which we term joint track functions.\nUsing this formalism we show that the strong interactions introduce enhanced\nsmall angle correlations between opposite-sign hadrons, relative to like-sign\nhadrons, identifiable as an enhanced scaling of $\\langle \\mathcal{E}_+(n_1)\n\\mathcal{E}_-(n_2) \\rangle$ relative to $\\langle \\mathcal{E}_+(n_1)\n\\mathcal{E}_+(n_2) \\rangle$. We are also able to compute the scaling of a\n$C$-odd three-point function, $\\langle \\mathcal{E}_\\mathcal{Q}(n_1)\n\\mathcal{E}_\\mathcal{Q}(n_2) \\mathcal{E}_\\mathcal{Q}(n_3) \\rangle$. Our results\ngreatly extend the class of systematically computable jet substructure\nobservables, pushing perturbation theory deeper into the parton to hadron\ntransition, and providing new observables to understand the dynamics of\nconfinement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lee","Kyle",""],["Moult","Ian",""]]}
{"id":"2308.00747","submitter":"Shu-Heng Shao","authors":"Shu-Heng Shao","title":"What's Done Cannot Be Undone: TASI Lectures on Non-Invertible Symmetry","comments":"93 pages. Many figures, tables, Lagrangians, and Hamiltonians, with a\n  hint of category theory","journal-ref":null,"doi":null,"report-no":"YITP-SB-2023-19","categories":"hep-th cond-mat.str-el hep-ph math.CT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We survey recent developments in a novel kind of generalized global symmetry,\nthe non-invertible symmetry, in diverse spacetime dimensions. We start with\nseveral different but related constructions of the non-invertible\nKramers-Wannier duality symmetry in the Ising model, and conclude with a new\ninterpretation for the neutral pion decay and other applications. These notes\nare based on lectures given at the TASI 2023 summer school ``Aspects of\nSymmetry.\"\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shao","Shu-Heng",""]]}
{"id":"2308.00748","submitter":"Julian Ingham","authors":"Julian Ingham, Tommy Li, Mathias S. Scheurer, Harley D. Scammell","title":"Quadratic Dirac fermions and the competition of ordered states in\n  twisted bilayer graphene","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magic-angle twisted bilayer graphene (TBG) exhibits a captivating phase\ndiagram as a function of doping, featuring superconductivity and a variety of\ninsulating and magnetic states. The bands host Dirac fermions with a reduced\nFermi velocity; experiments have shown that the Dirac dispersion reappears near\ninteger fillings of the moir\\'e unit cell -- referred to as the $\\textit{Dirac\nrevival}$ phenomenon. The reduced velocity of these Dirac states leads us to\npropose a scenario in which the Dirac fermions possess an approximately\nquadratic dispersion. The quadratic momentum dependence and particle-hole\ndegeneracy at the Dirac point results in a logarithmic enhancement of\ninteraction effects, which does not appear for a linear dispersion. The\nresulting non-trivial renormalisation group (RG) flow naturally produces the\nqualitative phase diagram as a function of doping -- with nematic and\ninsulating states near integer fillings, which give way to superconducting\nstates past a critical relative doping. The RG method further produces\ndifferent results to strong-coupling Hartree-Fock treatments: producing T-IVC\ninsulating states for repulsive interactions, explaining the results of very\nrecent STM experiments, alongside nodal $A_2$ superconductivity near\nhalf-filling, whose properties explain puzzles in tunnelling studies of the\nsuperconducting state. The model explains a diverse range of additional\nexperimental observations, unifying many aspects of the phase diagram of TBG.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ingham","Julian",""],["Li","Tommy",""],["Scheurer","Mathias S.",""],["Scammell","Harley D.",""]]}
{"id":"2308.00749","submitter":"Lisa McBride","authors":"Lisa McBride and Adrian Liu","title":"A statistical framework for recovering intensity mapping\n  autocorrelations from crosscorrelations","comments":"18 pages, 13 figures, to be submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intensity mapping experiments will soon have surveyed large swathes of the\nsky, providing information about the underlying matter distribution of the\nearly universe. The resulting maps can be used to recover statistical\ninformation, such as the power spectrum, about the measured spectral lines (for\nexample, HI, [CII], and [OIII]). However precise power spectrum measurements,\nsuch as the 21 cm autocorrelation, continue to be challenged by the presence of\nbright foregrounds and non-trivial systematics. By crosscorrelating different\ndata sets, it may be possible to mitigate the effects of both foreground\nuncertainty and uncorrelated instrumental systematics. Beyond their own merit,\ncrosscorrelations could also be used to recover autocorrelation information.\nSuch a technique was proposed in Beane et al. (2019) for recovering the 21 cm\npower spectrum. Generalizing their result, we develop a statistical framework\nfor combining multiple crosscorrelation signals in order to infer information\nabout the corresponding autocorrelations. We do this first within the Least\nSquares Estimator (LSE) framework, and show how one can derive their estimator,\nalong with several alternative estimators. We also investigate the posterior\ndistribution of recovered autocorrelation and associated model parameters. We\nfind that for certain noise regimes and cosmological signal modeling\nassumptions this procedure is effective at recovering autospectra from a set of\ncrosscorrelations. Finally, we showcase our framework in the context of several\nnear-future line intensity mapping experiments.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["McBride","Lisa",""],["Liu","Adrian",""]]}
{"id":"2308.00750","submitter":"Christina Giarmatzi","authors":"Christina Giarmatzi, Tyler Jones, Alexei Gilchrist, Prasanna Pakkiam,\n  Arkady Fedorov and Fabio Costa","title":"Multi-time quantum process tomography of a superconducting qubit","comments":"9 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-Markovian noise poses a formidable challenge to the scalability of\nquantum devices, being both ubiquitous in current quantum hardware and\nnotoriously difficult to characterise. This challenge arises from the need for\na full reconstruction of a multi-time process, a task that has proven elusive\nin previous efforts. In this work, we achieve the milestone of complete\ntomographic characterisation of a multi-time quantum process on a\nsuperconducting qubit by employing sequential measure-and-prepare operations\nwith an experimentally motivated post-processing technique, utilising both\nin-house and cloud-based superconducting quantum processors. Employing the\nprocess matrix formalism, we reveal intricate landscapes of non-Markovian noise\nand provide evidence that components of the noise originate from quantum\nsources. Our findings and techniques have significant implications for\nadvancing error-mitigation strategies and enhancing the scalability of quantum\ndevices.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Giarmatzi","Christina",""],["Jones","Tyler",""],["Gilchrist","Alexei",""],["Pakkiam","Prasanna",""],["Fedorov","Arkady",""],["Costa","Fabio",""]]}
{"id":"2308.00751","submitter":"Maximilien Franco","authors":"Maximilien Franco, Hollis B. Akins, Caitlin M. Casey, Steven L.\n  Finkelstein, Marko Shuntov, Katherine Chworowsky, Andreas L. Faisst, Seiji\n  Fujimoto, Olivier Ilbert, Anton M. Koekemoer, Daizhong Liu, Christopher C.\n  Lovell, Claudia Maraston, Henry Joy McCracken, Jed McKinney, Brant E.\n  Robertson, Micaela B. Bagley, Jaclyn B. Champagne, Olivia R. Cooper, Xuheng\n  Ding, Nicole E. Drakos, Andrea Enia, Steven Gillman, Christopher C. Hayward,\n  Michaela Hirschmann, Vasily Kokorev, Clotilde Laigle, Arianna S. Long,\n  Ghassem Gozaliasl, Santosh Harish, Shuowen Jin, Jeyhan S. Kartaltepe,\n  Georgios Magdis, Guillaume Mahler, Crystal L. Martin, R. Michael Rich, Benny\n  Trakhtenbrot, Bahram Mobasher, Louise Paquereau, Alvio Renzini, Jason Rhodes,\n  Kartik Sheth, John D. Silverman, Martin Sparre, Margherita Talia, Francesco\n  Valentino, Aswin P. Vijayan, Stephen M. Wilkins, Lilan Yang, Jorge A. Zavala","title":"Unveiling the distant Universe: Characterizing $z\\ge9$ Galaxies in the\n  first epoch of COSMOS-Web","comments":"Submitted to ApJ","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 identification of 15 galaxy candidates at $z\\ge9$ using the\ninitial COSMOS-Web JWST observations over 77 arcmin$^2$ through four NIRCam\nfilters (F115W, F150W, F277W, F444W) with an overlap with MIRI (F770W) of 8.7\narcmin$^2$. We fit the sample using several publicly-available SED fitting and\nphotometric redshift codes and determine their redshifts between $z=9.3$ and\n$z=10.9$ ($\\langle z\\rangle=10.0$), UV-magnitudes between M$_{\\rm UV}$ =\n$-$21.2 and $-$19.5 (with $\\langle $M$_{\\rm UV}\\rangle=-20.2$) and rest-frame\nUV slopes ($\\langle \\beta\\rangle=-2.4$). These galaxies are, on average, more\nluminous than most $z\\ge9$ candidates discovered by JWST so far in the\nliterature, while exhibiting similar blue colors in their rest-frame UV. The\nrest-frame UV slopes derived from SED-fitting are blue ($\\beta\\sim$[$-$2.0,\n$-$2.7]) without reaching extremely blue values as reported in other recent\nstudies at these redshifts. The blue color is consistent with models that\nsuggest the underlying stellar population is not yet fully enriched in metals\nlike similarly luminous galaxies in the lower redshift Universe. The derived\nstellar masses with $\\langle \\log_{\\rm 10}\n($M$_\\star/$M$_\\odot)\\rangle\\approx8-9$ are not in tension with the standard\n$\\Lambda$CDM model and our measurement of the volume density of such UV\nluminous galaxies aligns well with previously measured values presented in the\nliterature at $z\\sim9-10$. Our sample of galaxies, although compact, are\nsignificantly resolved.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Franco","Maximilien",""],["Akins","Hollis B.",""],["Casey","Caitlin M.",""],["Finkelstein","Steven L.",""],["Shuntov","Marko",""],["Chworowsky","Katherine",""],["Faisst","Andreas L.",""],["Fujimoto","Seiji",""],["Ilbert","Olivier",""],["Koekemoer","Anton M.",""],["Liu","Daizhong",""],["Lovell","Christopher C.",""],["Maraston","Claudia",""],["McCracken","Henry Joy",""],["McKinney","Jed",""],["Robertson","Brant E.",""],["Bagley","Micaela B.",""],["Champagne","Jaclyn B.",""],["Cooper","Olivia R.",""],["Ding","Xuheng",""],["Drakos","Nicole E.",""],["Enia","Andrea",""],["Gillman","Steven",""],["Hayward","Christopher C.",""],["Hirschmann","Michaela",""],["Kokorev","Vasily",""],["Laigle","Clotilde",""],["Long","Arianna S.",""],["Gozaliasl","Ghassem",""],["Harish","Santosh",""],["Jin","Shuowen",""],["Kartaltepe","Jeyhan S.",""],["Magdis","Georgios",""],["Mahler","Guillaume",""],["Martin","Crystal L.",""],["Rich","R. Michael",""],["Trakhtenbrot","Benny",""],["Mobasher","Bahram",""],["Paquereau","Louise",""],["Renzini","Alvio",""],["Rhodes","Jason",""],["Sheth","Kartik",""],["Silverman","John D.",""],["Sparre","Martin",""],["Talia","Margherita",""],["Valentino","Francesco",""],["Vijayan","Aswin P.",""],["Wilkins","Stephen M.",""],["Yang","Lilan",""],["Zavala","Jorge A.",""]]}
{"id":"2308.00752","submitter":"St\\'ephanie Juneau","authors":"Vanessa B\\\"ohm (1 and 2), Alex G. Kim (2) and St\\'ephanie Juneau (3)\n  ((1) Berkeley Center for Cosmological Physics, UC Berkeley, (2) Lawrence\n  Berkeley National Lab, (3) NSF's NOIRLab)","title":"Fast and efficient identification of anomalous galaxy spectra with\n  neural density estimation","comments":"16 pages, 14 figures, MNRAS revised manuscript after addressing the\n  report from the referee. Our first paper is available at arXiv:2211.11783 .\n  Our code is publicly available at https://github.com/VMBoehm/Spectra_PAE","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Current large-scale astrophysical experiments produce unprecedented amounts\nof rich and diverse data. This creates a growing need for fast and flexible\nautomated data inspection methods. Deep learning algorithms can capture and\npick up subtle variations in rich data sets and are fast to apply once trained.\nHere, we study the applicability of an unsupervised and probabilistic deep\nlearning framework, the Probabilistic Autoencoder (PAE), to the detection of\npeculiar objects in galaxy spectra from the SDSS survey. Different to\nsupervised algorithms, this algorithm is not trained to detect a specific\nfeature or type of anomaly, instead it learns the complex and diverse\ndistribution of galaxy spectra from training data and identifies outliers with\nrespect to the learned distribution. We find that the algorithm assigns\nconsistently lower probabilities (higher anomaly score) to spectra that exhibit\nunusual features. For example, the majority of outliers among quiescent\ngalaxies are E+A galaxies, whose spectra combine features from old and young\nstellar population. Other identified outliers include LINERs, supernovae and\noverlapping objects. Conditional modeling further allows us to incorporate\nadditional information. Namely, we evaluate the probability of an object being\nanomalous given a certain spectral class, but other information such as metrics\nof data quality or estimated redshift could be incorporated as well. We make\nour code publicly available at https://github.com/VMBoehm/Spectra_PAE\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["B\u00f6hm","Vanessa","","1 and 2"],["Kim","Alex G.",""],["Juneau","St\u00e9phanie",""]]}
{"id":"2308.00753","submitter":"Ren\\'e Schwonnek","authors":"Zhen-Peng Xu, Ren\\'e Schwonnek, and Andreas Winter","title":"Bounding the joint numerical range of Pauli strings by graph parameters","comments":"14+3 pages, 5 figures","journal-ref":null,"doi":null,"report-no":"1337","categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The interplay between the quantum state space and a specific set of\nmeasurements can be effectively captured by examining the set of jointly\nattainable expectation values. This set is commonly referred to as the (convex)\njoint numerical range. In this work, we explore geometric properties of this\nconstruct for measurements represented by tensor products of Pauli observables,\nalso known as Pauli strings. The structure of pairwise commutation and\nanticommutation relations among a set of Pauli strings determines a graph $G$,\nsometimes also called the frustration graph. We investigate the connection\nbetween the parameters of this graph and the structure of minimal ellipsoids\nencompassing the joint numerical range. Such an outer approximation can be very\npractical since ellipsoids can be handled analytically even in high dimensions.\n  We find counterexamples to a conjecture from [C. de Gois, K. Hansenne and O.\nG\\\"uhne, arXiv:2207.02197], and answer an open question in [M. B. Hastings and\nR. O'Donnell, Proc. STOC 2022, pp. 776-789], which implies a new graph\nparameter that we call $\\beta(G)$. Besides, we develop this approach in\ndifferent directions, such as comparison with graph-theoretic approaches in\nother fields, applications in quantum information theory, numerical methods,\nproperties of the new graph parameter, etc. Our approach suggests many open\nquestions that we discuss briefly at the end.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Xu","Zhen-Peng",""],["Schwonnek","Ren\u00e9",""],["Winter","Andreas",""]]}
{"id":"2308.00754","submitter":"Nelson Caldwell","authors":"Nelson Caldwell, John Raymond","title":"A Nitrogen-rich SNR in M31: SNR Interaction with the CSM at Late Times","comments":"to appear 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":"  We present the discovery of a supernova remnant (SNR) in M31 which is unlike\nany other remnant known in that galaxy. An optical MMT spectrum of WB92-26\nsampling most of this marginally resolved object reveals strong lines of [O\nII], [Ne III], H I, [O III], [O I], [N II] and [S II], though the H I lines are\nvery weak and the [N II] lines are very strong. Multiple velocity components\nare visible in those lines, with broad wings extending to $-2000$ and $+1500$\nor $2000$ km/s (the heliocentric velocity of M31 is $-300$ km/s). The lines\nshow strong peaks or shoulders near $-750$ km/s, $-50$ km/s, and $+800$ km/s in\nthe M31 frame.\n  The density implied by the [S II] ratio combined with the X-ray luminosity,\nFUV flux and optical size lead us to conclude that the optical emission lines\nare generated by shock waves, not photoionization. Consideration of the\nvelocity structure indicates that the emission is from a shock in the\ncircumstellar medium (CSM). This CSM must be depleted in H and enriched in He\nand N through CNO processing, and it must have had a high velocity before the\nexplosion of the parent star, to explain the broad wings in the emission lines.\nWe estimate the CSM shell to have a mass of 2 Msun, implying a Core Collapse\nSN. It is likely that Eta Car will produce a remnant resembling WB92-26 a few\nthousand years after it explodes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Caldwell","Nelson",""],["Raymond","John",""]]}
{"id":"2308.00755","submitter":"Preethi Seshadri","authors":"Preethi Seshadri, Sameer Singh, Yanai Elazar","title":"The Bias Amplification Paradox in Text-to-Image Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.CV cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bias amplification is a phenomenon in which models increase imbalances\npresent in the training data. In this paper, we study bias amplification in the\ntext-to-image domain using Stable Diffusion by comparing gender ratios in\ntraining vs. generated images. We find that the model appears to amplify\ngender-occupation biases found in the training data (LAION). However, we\ndiscover that amplification can largely be attributed to discrepancies between\ntraining captions and model prompts. For example, an inherent difference is\nthat captions from the training data often contain explicit gender information\nwhile the prompts we use do not, which leads to a distribution shift and\nconsequently impacts bias measures. Once we account for various distributional\ndifferences between texts used for training and generation, we observe that\namplification decreases considerably. Our findings illustrate the challenges of\ncomparing biases in models and the data they are trained on, and highlight\nconfounding factors that contribute to bias amplification.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Seshadri","Preethi",""],["Singh","Sameer",""],["Elazar","Yanai",""]]}
{"id":"2308.00756","submitter":"Aurora Ireland","authors":"Dan Hooper, Aurora Ireland, Gordan Krnjaic, Albert Stebbins","title":"Supermassive Primordial Black Holes From Inflation","comments":"31 pages, 7 figures; added references","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-390-T","categories":"astro-ph.CO astro-ph.GA gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is controversy surrounding the origin and evolution of our universe's\nlargest supermassive black holes (SMBHs). In this study, we consider the\npossibility that some of these black holes formed from the direct collapse of\nprimordial density perturbations. Since the mass of a primordial black hole is\nlimited by the size of the cosmological horizon at the time of collapse, these\nSMBHs must form rather late, and are naively in conflict with CMB spectral\ndistortion constraints. Such limits, however, can be avoided if the\ndistribution of primordial curvature perturbations is highly non-Gaussian. In\nthis study, we present a model of multi-field inflation -- the curvaton model\nsupplemented with self-interactions -- which can viably yield such dramatic\nnon-Gaussinities. Furthermore, we calculate the maximal abundance of black\nholes that can be generated in this scenario and find this to be consistent\nwith the observed population of high-redshift SMBHs. This result is\nparticularly timely in light of recent evidence from the NANOGrav experiment\nfor a stochastic gravitational wave background consistent with SMBH mergers.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:09 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 17:36:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hooper","Dan",""],["Ireland","Aurora",""],["Krnjaic","Gordan",""],["Stebbins","Albert",""]]}
{"id":"2308.00757","submitter":"Stephanie Tonnesen","authors":"Stephanie Tonnesen, Daniel DeFelippis, and Sarah Tuttle","title":"You Are What You Eat: The Circumgalactic Medium Around BreakBRD Galaxies\n  has Low Mass and Angular Momentum","comments":"Published in The Astrophysical Journal, July 2023","journal-ref":"The Astrophysical Journal, Volume 951, Issue 1, id.16, 13 pp, 2023","doi":"10.3847/1538-4357/acd3ee","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Observed breakBRD (\"break bulges in red disks\") galaxies are a nearby sample\nof face-on disk galaxies with particularly centrally-concentrated star\nformation: they have red disks but recent star formation in their centers as\nmeasured by the D$_n$4000 spectral index. In Kopenhafer et al. (2020), a\ncomparable population of breakBRD analogues was identified in the TNG\nsimulation, in which the central concentration of star formation was found to\nreflect a central concentration of dense, starforming gas caused by a lack of\ndense gas in the galaxy outskirts. In this paper we examine the circumgalactic\nmedium of the central breakBRD analogues to determine if the extended halo gas\nalso shows differences from that around comparison galaxies with comparable\nstellar mass. We examine the circumgalactic medium gas mass, specific angular\nmomentum, and metallicity in these galaxy populations. We find less gas in the\ncircumgalactic medium of breakBRD galaxies, and that the breakBRD\ncircumgalactic medium is slightly more concentrated than that of comparable\nstellar mass galaxies. In addition, we find that the angular momentum in the\ncircumgalactic medium of breakBRD galaxies tends to be low for their stellar\nmass, and show more misalignment to the angular momentum vector of the stellar\ndisk. Finally, we find that the circumgalactic medium metallicity of breakBRD\ngalaxies tends to be high for their stellar mass. Together with their low SFR,\nwe argue that these CGM properties indicate a small amount of disk feeding\nconcentrated in the central regions, and a lack of low-metallicity gas\naccretion from the intergalactic medium.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tonnesen","Stephanie",""],["DeFelippis","Daniel",""],["Tuttle","Sarah",""]]}
{"id":"2308.00758","submitter":"Pragati Pradhan","authors":"Pragati Pradhan, David P. Huenemoerder, Richard Ignace, Joy S.\n  Nichols, and A.M.T. Pollock","title":"Survey of X-rays from Massive Stars Observed at High Spectral Resolution\n  with Chandra","comments":"78 pages, 46 figures, 41 tables, Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Identifying trends between observational data and the range of physical\nparameters of massive stars is a critical step to the still-elusive full\nunderstanding of the source, structure, and evolution of X-ray emission from\nthe stellar winds, requiring a substantial sample size and systematic analysis\nmethods. The \\emph{Chandra} data archive as of 2022 contains 37 high resolution\nspectra of O, B, and WR stars, observed with the \\emph{Chandra}/HETGS and of\nsufficient quality to fit the continua and emission line profiles. Using a\nsystematic approach to the data analysis, we explore morphological trends in\nthe line profiles (i.e., O, Ne, Mg, Si) and find that the centroid offsets of\nresolved lines versus wavelength can be separated in three empirically-defined\ngroups based on the amount of line broadening and centroid offset. Using\n\\ion{Fe}{17} (15.01 \\AA, 17.05 \\AA) and \\ion{Ne}{10} $\\alpha$ (12.13 \\AA) lines\nwhich are prevalent among the sample stars, we find a well-correlated linear\ntrend of increasing Full Width Half Maximum (FWHM) with faster wind terminal\nvelocity. The H-like/He-like total line flux ratio for strong lines displays\ndifferent trends with spectral class depending on ion species. Some of the\nsources in our sample have peculiar properties (e.g., magnetic and $\\gamma$\nCas-analogue stars) and we find that these sources stand out as outliers from\nmore regular trends. Finally, our spectral analysis is presented summarily in\nterms of X-ray spectral energy distributions in specific luminosity for each\nsource, plus tables of line identifications and fluxes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Pradhan","Pragati",""],["Huenemoerder","David P.",""],["Ignace","Richard",""],["Nichols","Joy S.",""],["Pollock","A. M. T.",""]]}
{"id":"2308.00759","submitter":"Jinghao Zhang","authors":"Jinghao Zhang, Jie Huang, Man Zhou, Chongyi Li, Feng Zhao","title":"Decomposition Ascribed Synergistic Learning for Unified Image\n  Restoration","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning to restore multiple image degradations within a single model is\nquite beneficial for real-world applications. Nevertheless, existing works\ntypically concentrate on regarding each degradation independently, while their\nrelationship has been less exploited to ensure the synergistic learning. To\nthis end, we revisit the diverse degradations through the lens of singular\nvalue decomposition, with the observation that the decomposed singular vectors\nand singular values naturally undertake the different types of degradation\ninformation, dividing various restoration tasks into two groups,\\ie, singular\nvector dominated and singular value dominated. The above analysis renders a\nmore unified perspective to ascribe the diverse degradations, compared to\nprevious task-level independent learning. The dedicated optimization of\ndegraded singular vectors and singular values inherently utilizes the potential\nrelationship among diverse restoration tasks, attributing to the Decomposition\nAscribed Synergistic Learning (DASL). Specifically, DASL comprises two\neffective operators, namely, Singular VEctor Operator (SVEO) and Singular VAlue\nOperator (SVAO), to favor the decomposed optimization, which can be lightly\nintegrated into existing convolutional image restoration backbone. Moreover,\nthe congruous decomposition loss has been devised for auxiliary. Extensive\nexperiments on blended five image restoration tasks demonstrate the\neffectiveness of our method, including image deraining, image dehazing, image\ndenoising, image deblurring, and low-light image enhancement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:00:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Jinghao",""],["Huang","Jie",""],["Zhou","Man",""],["Li","Chongyi",""],["Zhao","Feng",""]]}
{"id":"2308.00760","submitter":"Pureum Noh","authors":"Pureum Noh, Kyusung Hwang, Eun-Gook Moon","title":"Manipulating Topological Quantum Phase Transitions of Kitaev's Quantum\n  Spin Liquids with Electric Fields","comments":"Main text: 6 pages, 3 figures, 1 table, Supplemental material: 4\n  pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Highly entangled excitations such as Majorana fermions of Kitaev quantum spin\nliquids have been proposed to be utilized for future quantum science and\ntechnology, and a deeper understanding of such excitations has been strongly\ndesired. Here we demonstrate that Majorana fermion's mass and associated\ntopological quantum phase transitions in the Kitaev quantum spin liquids may be\nmanipulated by using electric fields in sharp contrast to the common belief\nthat an insulator is inert under weak electric fields due to charge energy\ngaps. Using general symmetry analysis with perturbation and exact\ndiagonalization, we uncover the universal phase diagrams with electric and\nmagnetic fields. We also provide distinctive experimental signatures to\nidentify Kitaev quantum spin liquids with electric fields, especially in\nconnection with the candidate materials such as $\\alpha$-RuCl3.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:01:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Noh","Pureum",""],["Hwang","Kyusung",""],["Moon","Eun-Gook",""]]}
{"id":"2308.00761","submitter":"Tomasz Szemberg","authors":"Luca Chiantini and {\\L}ucja Farnik and Giuseppe Favacchio and Brian\n  Harbourne and Juan Migliore and Tomasz Szemberg and Justyna Szpond","title":"Geproci sets and the combinatorics of skew lines in $\\mathbb P^3$","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Geproci sets of points in $\\mathbb P^3$ are sets whose general projections to\n$\\mathbb P^2$ are complete intersections. The first nontrivial geproci sets\ncame from representation theory, as projectivizations of the root systems $D_4$\nand $F_4$. In most currently known cases geproci sets lie on very special\nunions of skew lines and are known as half grids. For this important class of\ngeproci sets we establish fundamental connections with combinatorics, which we\nstudy using methods of algebraic geometry and commutative algebra. As a\nmotivation for studying them, we first prove Theorem A: for a nondegenerate\n$(a,b)$-geproci set $Z$ with $d$ being the least degree of a space curve $C$\ncontaining $Z$, that if $d\\leq b$, then $C$ is a union of skew lines and $Z$ is\neither a grid or a half grid. We next formulate a combinatorial version of the\ngeproci property for half grids and prove Theorem B: combinatorial half grids\nare geproci in the case of sets of $a$ points on each of $b$ skew lines when\n$a\\geq b-1\\geq 3$. We then introduce a notion of combinatorics for skew lines\nand apply it to the classification of single orbit combinatorial half grids of\n$m$ points on each of 4 lines. We apply these results to prove Theorem C,\nshowing, when $n\\gg m$, that half grids of $m$ points on $n$ lines with two\ntransversals must be very special geometrically (if they even exist). Moreover,\nin the case of skew lines having two transversals, our results provide an\nalgorithm for enumerating their projective equivalence classes. We conjecture\nthere are $(m^2-1)/12$ equivalence classes of combinatorial $[m,4]$-half grids\nin the two transversal case when $m>2$ is prime.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:01:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chiantini","Luca",""],["Farnik","\u0141ucja",""],["Favacchio","Giuseppe",""],["Harbourne","Brian",""],["Migliore","Juan",""],["Szemberg","Tomasz",""],["Szpond","Justyna",""]]}
{"id":"2308.00762","submitter":"Mohammad Mahdi Abdollah Pour Mr","authors":"Mohammad Mahdi Abdollah Pour, Parsa Farinneya, Armin Toroghi, Anton\n  Korikov, Ali Pesaranghader, Touqir Sajed, Manasa Bharadwaj, Borislav Mavrin,\n  and Scott Sanner","title":"Self-Supervised Contrastive BERT Fine-tuning for Fusion-based\n  Reviewed-Item Retrieval","comments":null,"journal-ref":"European Conference on Information Retrieval, pages 3--17, year\n  2023, Springer","doi":"10.1007/978-3-031-28244-7_1","report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As natural language interfaces enable users to express increasingly complex\nnatural language queries, there is a parallel explosion of user review content\nthat can allow users to better find items such as restaurants, books, or movies\nthat match these expressive queries. While Neural Information Retrieval (IR)\nmethods have provided state-of-the-art results for matching queries to\ndocuments, they have not been extended to the task of Reviewed-Item Retrieval\n(RIR), where query-review scores must be aggregated (or fused) into item-level\nscores for ranking. In the absence of labeled RIR datasets, we extend Neural IR\nmethodology to RIR by leveraging self-supervised methods for contrastive\nlearning of BERT embeddings for both queries and reviews. Specifically,\ncontrastive learning requires a choice of positive and negative samples, where\nthe unique two-level structure of our item-review data combined with meta-data\naffords us a rich structure for the selection of these samples. For contrastive\nlearning in a Late Fusion scenario, we investigate the use of positive review\nsamples from the same item and/or with the same rating, selection of hard\npositive samples by choosing the least similar reviews from the same anchor\nitem, and selection of hard negative samples by choosing the most similar\nreviews from different items. We also explore anchor sub-sampling and\naugmenting with meta-data. For a more end-to-end Early Fusion approach, we\nintroduce contrastive item embedding learning to fuse reviews into single item\nembeddings. Experimental results show that Late Fusion contrastive learning for\nNeural RIR outperforms all other contrastive IR configurations, Neural IR, and\nsparse retrieval baselines, thus demonstrating the power of exploiting the\ntwo-level structure in Neural RIR approaches as well as the importance of\npreserving the nuance of individual review content via Late Fusion methods.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:01:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Pour","Mohammad Mahdi Abdollah",""],["Farinneya","Parsa",""],["Toroghi","Armin",""],["Korikov","Anton",""],["Pesaranghader","Ali",""],["Sajed","Touqir",""],["Bharadwaj","Manasa",""],["Mavrin","Borislav",""],["Sanner","Scott",""]]}
{"id":"2308.00763","submitter":"Daniel Ara\\'ujo De Medeiros","authors":"Gabin Schieffer, Nattawat Pornthisan, Daniel Ara\\'ujo de Medeiros,\n  Stefano Markidis, Jacob Wahlgren, Ivy Peng","title":"Boosting the Performance of Object Tracking with a Half-Precision\n  Particle Filter on GPU","comments":"12 pages, 8 figures, conference. To be published in The 21st\n  International Workshop on Algorithms, Models and Tools for Parallel Computing\n  on Heterogeneous Platforms (HeteroPar2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-performance GPU-accelerated particle filter methods are critical for\nobject detection applications, ranging from autonomous driving, robot\nlocalization, to time-series prediction. In this work, we investigate the\ndesign, development and optimization of particle-filter using half-precision on\nCUDA cores and compare their performance and accuracy with single- and\ndouble-precision baselines on Nvidia V100, A100, A40 and T4 GPUs. To mitigate\nnumerical instability and precision losses, we introduce algorithmic changes in\nthe particle filters. Using half-precision leads to a performance improvement\nof 1.5-2x and 2.5-4.6x with respect to single- and double-precision baselines\nrespectively, at the cost of a relatively small loss of accuracy.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:02:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Schieffer","Gabin",""],["Pornthisan","Nattawat",""],["de Medeiros","Daniel Ara\u00fajo",""],["Markidis","Stefano",""],["Wahlgren","Jacob",""],["Peng","Ivy",""]]}
{"id":"2308.00764","submitter":"Conny Aerts","authors":"Conny Aerts and St\\'ephane Mathis","title":"Mode coupling coefficients between the convective core and radiative\n  envelope of $\\gamma\\,$Doradus and slowly pulsating B stars","comments":"Manuscript in press at A&A, 9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Signatures of coupling between an inertial mode in the convective core and a\ngravito-inertial mode in the envelope have been found in four-year Kepler light\ncurves of 16 rapidly rotating $\\gamma\\,$Doradus ($\\gamma\\,$Dor) stars. This\nmakes it possible to obtain a measurement of the rotation frequency in their\nconvective core. Despite their similar internal structure and available data,\ninertial modes have not yet been reported for slowly pulsating B (SPB) stars.\nWe aim to provide a numerical counterpart of the recently published theoretical\nexpressions for the mode-coupling coefficients, $\\varepsilon$ and\n$\\tilde{\\varepsilon}$. These coefficients represent the two cases of a\ncontinuous and a discontinuous Brunt-V\\\"ais\\\"al\\\"a frequency profile at the\ncore-envelope interface, respectively. We used asteroseismic forward models of\ntwo samples consisting of 26 SPB stars and 37 $\\gamma\\,$Dor stars to infer\ntheir numerical values of $\\varepsilon$. The asteroseismically inferred values\nof $\\varepsilon$ for the two samples are between 0.0 and 0.34. While\n$\\varepsilon$ is most strongly correlated with the near-core rotation frequency\nfor $\\gamma\\,$Dor stars, the fractional radius of the convective core instead\nprovides the tightest correlation for SPB stars. We find $\\varepsilon$ to\ndecrease mildly as the stars evolve. Our asteroseismic results for the mode\ncoupling support the theoretical interpretation and reveal that young,\nfast-rotating $\\gamma\\,$Dor stars are most suitable for undergoing couplings\nbetween inertial modes in the rotating convective core and gravito-inertial\nmodes in the radiative envelope. The phenomenon has been found in 2.4\\% of such\npulsators with detected period spacing patterns, whereas it has not been seen\nin any of the SPB stars so far. (shortened abstract to meet the arXiv limits)\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:03:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Aerts","Conny",""],["Mathis","St\u00e9phane",""]]}
{"id":"2308.00765","submitter":"Silvia Pla Garc\\'ia","authors":"Jean Alexandre, Katy Clough and Silvia Pla","title":"Tunnelling-induced cosmic bounce in the presence of anisotropy","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-42","categories":"gr-qc hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  If we imagine rewinding the universe to early times, the scale factor shrinks\nand the existence of a finite spatial volume may play a role in quantum\ntunnelling effects in a closed universe. It has recently been shown that such\nfinite volume effects dynamically generate an effective equation of state that\ncould support a cosmological bounce. In this work we extend the analysis to the\ncase in which a (homogeneous) anisotropy is present, and identify a criteria\nfor a successful bounce in terms of the size of the closed universe and the\nproperties of the quantum field.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:04:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Alexandre","Jean",""],["Clough","Katy",""],["Pla","Silvia",""]]}
{"id":"2308.00766","submitter":"Macarena Zanardi","authors":"Zanardi Macarena, de El\\'ia Gonzalo Carlos, Dugaro Agust\\'in, Coronel\n  Carla Florencia","title":"Constraints to the semimajor axis of outer particles with nodal\n  librations by general relativity effects","comments":"11 pages, 10 figures. Accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2345","report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study nodal librations of outer particles in the framework of the\nelliptical restricted three-body problem including general relativity (GR)\neffects. From an analytical treatment based on secular interactions up to\nquadrupole level, we derive equations that define the nodal libration region of\nan outer test particle, which depends on the physical and orbital parameters of\nthe bodies of the system. From this, we analyze how the GR constrains the\nsemimajor axis of outer test particles that experience nodal librations under\nthe effects of an inner planet around a single stellar component. Such an upper\nlimit of the semimajor axis, which is called a2,lim , depends on the mass of\nthe star ms, the mass m1, the semimajor axis a1, and the eccentricity e1 of the\ninner planet, and the eccentricity e2 of the outer test particle. On the one\nhand, our results show that the greater m1, a1, and e2 and the smaller ms, the\ngreater the value of a2,lim. On the other hand, for fixed ms, m1, a1, and e2,\na2,lim does not strongly depend on e1, except for large values of such an\norbital parameter. We remark that N-body experiments of particular scenarios\nthat include GR show results consistent with the analytical criteria derived in\nthe present research. Moreover, the study of hypothetical small body\npopulations of real systems composed of a single star and an inner\nplanetary-mass companion show that the GR effects can play a very important\nrole in their global dynamics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:04:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Macarena","Zanardi",""],["Carlos","de El\u00eda Gonzalo",""],["Agust\u00edn","Dugaro",""],["Florencia","Coronel Carla",""]]}
{"id":"2308.00767","submitter":"Eric Planz","authors":"Eric Planz, Xiang Xi, Thibault Capelle, Eric C. Langman, and Albert\n  Schliesser","title":"Membrane-in-the-middle optomechanics with a soft-clamped membrane at\n  milliKelvin temperatures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Soft-clamped silicon nitride membrane resonators reach coherence times tau in\nexcess of 100 ms at milliKelvin bath temperatures. However, harnessing strong\noptomechanical coupling in dry dilution refrigerators remains challenging due\nto vibration issues and heating by optical absorption. Here, we propose to\naddress these issues with an actuator-free optical cavity and mechanical\nresonator design, in which the cavity is mounted on a simple\nvibration-isolation platform. We observe dynamical backaction when the cavity\nis driven with a free-space optical beam stabilized close to the red sideband\nusing a two-beam locking scheme. Finally, we characterize the effect of\nabsorption heating on the coherence time, and find a scaling with the\nintracavity power P as tau proportional to P to the power of -(0.34+/-0.04).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:10:14 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Planz","Eric",""],["Xi","Xiang",""],["Capelle","Thibault",""],["Langman","Eric C.",""],["Schliesser","Albert",""]]}
{"id":"2308.00768","submitter":"Garritt Page","authors":"Garritt L. Page, Massimo Ventrucci, Maria Franco-Villoria","title":"Informed Bayesian Finite Mixture Models via Asymmetric Dirichlet Priors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finite mixture models are flexible methods that are commonly used for\nmodel-based clustering. A recent focus in the model-based clustering literature\nis to highlight the difference between the number of components in a mixture\nmodel and the number of clusters. The number of clusters is more relevant from\na practical stand point, but to date, the focus of prior distribution\nformulation has been on the number of components. In light of this, we develop\na finite mixture methodology that permits eliciting prior information directly\non the number of clusters in an intuitive way. This is done by employing an\nasymmetric Dirichlet distribution as a prior on the weights of a finite\nmixture. Further, a penalized complexity motivated prior is employed for the\nDirichlet shape parameter. We illustrate the ease to which prior information\ncan be elicited via our construction and the flexibility of the resulting\ninduced prior on the number of clusters. We also demonstrate the utility of our\napproach using numerical experiments and two real world data sets.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:13:28 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Page","Garritt L.",""],["Ventrucci","Massimo",""],["Franco-Villoria","Maria",""]]}
{"id":"2308.00769","submitter":"Luca Merlo","authors":"Luca Merlo, Lea Petrella, Nicola Salvati and Nikos Tzavidis","title":"Unified unconditional regression for multivariate quantiles, M-quantiles\n  and expectiles","comments":null,"journal-ref":"Journal of the American Statistical Association (2023)","doi":"10.1080/01621459.2023.2250512","report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we develop a unified regression approach to model\nunconditional quantiles, M-quantiles and expectiles of multivariate dependent\nvariables exploiting the multidimensional Huber's function. To assess the\nimpact of changes in the covariates across the entire unconditional\ndistribution of the responses, we extend the work of Firpo et al. (2009) by\nrunning a mean regression of the recentered influence function on the\nexplanatory variables. We discuss the estimation procedure and establish the\nasymptotic properties of the derived estimators. A data-driven procedure is\nalso presented to select the tuning constant of the Huber's function. The\nvalidity of the proposed methodology is explored with simulation studies and\nthrough an application using the Survey of Household Income and Wealth 2016\nconducted by the Bank of Italy.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:14:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Merlo","Luca",""],["Petrella","Lea",""],["Salvati","Nicola",""],["Tzavidis","Nikos",""]]}
{"id":"2308.00770","submitter":"Giselle Zeno","authors":"Giselle Zeno, Timothy La Fond, Jennifer Neville","title":"DYMOND: DYnamic MOtif-NoDes Network Generative Model","comments":"In Proceedings of the Web Conference 2021 (WWW '21)","journal-ref":"Proceedings of the Web Conference 2021, Pages 718-729","doi":"10.1145/3442381.3450102","report-no":null,"categories":"cs.SI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motifs, which have been established as building blocks for network structure,\nmove beyond pair-wise connections to capture longer-range correlations in\nconnections and activity. In spite of this, there are few generative graph\nmodels that consider higher-order network structures and even fewer that focus\non using motifs in models of dynamic graphs. Most existing generative models\nfor temporal graphs strictly grow the networks via edge addition, and the\nmodels are evaluated using static graph structure metrics -- which do not\nadequately capture the temporal behavior of the network. To address these\nissues, in this work we propose DYnamic MOtif-NoDes (DYMOND) -- a generative\nmodel that considers (i) the dynamic changes in overall graph structure using\ntemporal motif activity and (ii) the roles nodes play in motifs (e.g., one node\nplays the hub role in a wedge, while the remaining two act as spokes). We\ncompare DYMOND to three dynamic graph generative model baselines on real-world\nnetworks and show that DYMOND performs better at generating graph structure and\nnode behavior similar to the observed network. We also propose a new\nmethodology to adapt graph structure metrics to better evaluate the temporal\naspect of the network. These metrics take into account the changes in overall\ngraph structure and the individual nodes' behavior over time.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:20:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zeno","Giselle",""],["La Fond","Timothy",""],["Neville","Jennifer",""]]}
{"id":"2308.00771","submitter":"Kay Yunqi Song","authors":"Kay Song, Dina Sheyfer, Kenichiro Mizohata, Minyi Zhang, Wenjun Liu,\n  Do\\u{g}a G\\\"ursoy, David Yang, Ivan Tolkachev, Hongbing Yu, David E J\n  Armstrong, Felix Hofmann","title":"Dose and compositional dependence of irradiation-induced property change\n  in FeCr","comments":"49 pages, 9 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ferritic/martensitic steels will be used as structural components in next\ngeneration nuclear reactors. Their successful operation relies on an\nunderstanding of irradiation-induced defect behaviour in the material. In this\nstudy, Fe and FeCr alloys (3-12%Cr) were irradiated with 20 MeV Fe-ions at 313\nK to doses ranging between 0.00008 dpa to 6.0 dpa. This dose range covers six\norders of magnitude, spanning low, transition and high dose regimes. Lattice\nstrain and hardness in the irradiated material were characterised with\nmicro-beam Laue X-ray diffraction and nanoindentation, respectively.\n  Irradiation hardening was observed even at very low doses (0.00008 dpa) and\nshowed a monotonic increase with dose up to 6.0 dpa. Lattice strain\nmeasurements of samples at 0.0008 dpa allow the calculation of equivalent\nFrenkel pair densities and corrections to the Norgett-Robinson-Torrens (NRT)\nmodel for Fe and FeCr alloys at low dose. NRT efficiency for FeCr is 0.2, which\nagrees with literature values for high irradiation energy. Lattice strain\nincreases up to 0.8 dpa and then decreases when the damage dose is further\nincreased. The strains measured in this study are lower and peak at a larger\ndose than predicted by atomistic simulations. This difference can be explained\nby taking temperature and impurities into account.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:21:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Song","Kay",""],["Sheyfer","Dina",""],["Mizohata","Kenichiro",""],["Zhang","Minyi",""],["Liu","Wenjun",""],["G\u00fcrsoy","Do\u011fa",""],["Yang","David",""],["Tolkachev","Ivan",""],["Yu","Hongbing",""],["Armstrong","David E J",""],["Hofmann","Felix",""]]}
{"id":"2308.00772","submitter":"Zhen-Yu Yan","authors":"Zhen-Yu Yan, Jun Yang, Xiao-Hong Zhao, Yan-Zhi Meng, Bin-Bin Zhang","title":"One Fits All: A Unified Synchrotron Model Explains GRBs with FRED-Shaped\n  Pulses","comments":"25 pages, 18 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The analysis of gamma-ray burst (GRB) spectra often relies on empirical\nmodels like the Band function, which lacks a distinct physical explanation.\nPrevious attempts to couple physical models with observed data have been\nconfined to individual burst studies, where the model is fitted to segmented\nspectra with independent physical parameters. These approaches frequently fail\nto explain the spectral evolution, which should be governed by a consistent set\nof physical conditions. In this study, we propose a novel approach by\nincorporating the synchrotron radiation model to provide a self-consistent\nexplanation for a selection of single-pulse GRBs. Our sample is carefully\nchosen to minimize contamination from overlapping pulses, allowing for a\ncomprehensive test of the synchrotron model under a unified physical condition,\nsuch as a single injection event of electrons. By tracing the evolution of\ncooling electrons in a decaying magnetic field, our model predicts a series of\ntime-dependent observed spectra that align well with the observed data.\nRemarkably, using a single set of physical parameters, our model successfully\nfits all time-resolved spectra within each burst. Additionally, our model\naccurately predicts the evolution of some key features of GRBs such as the\nspectral peak $E_{\\rm p}$ and light curve shapes, all of which are consistent\nwith observations. Our findings strongly support the notion that the spectral\nand temporal evolution in GRB pulses originates from the expansion of the GRB\nemission region with an initial radius of approximately $10^{15}$ cm, with\nsynchrotron radiation being the underlying emission mechanism.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:26:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yan","Zhen-Yu",""],["Yang","Jun",""],["Zhao","Xiao-Hong",""],["Meng","Yan-Zhi",""],["Zhang","Bin-Bin",""]]}
{"id":"2308.00773","submitter":"Hengfei Wang","authors":"Hengfei Wang, Zhongqun Zhang, Yihua Cheng, Hyung Jin Chang","title":"High-Fidelity Eye Animatable Neural Radiance Fields for Human Face","comments":"BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Face rendering using neural radiance fields (NeRF) is a rapidly developing\nresearch area in computer vision. While recent methods primarily focus on\ncontrolling facial attributes such as identity and expression, they often\noverlook the crucial aspect of modeling eyeball rotation, which holds\nimportance for various downstream tasks. In this paper, we aim to learn a face\nNeRF model that is sensitive to eye movements from multi-view images. We\naddress two key challenges in eye-aware face NeRF learning: how to effectively\ncapture eyeball rotation for training and how to construct a manifold for\nrepresenting eyeball rotation. To accomplish this, we first fit FLAME, a\nwell-established parametric face model, to the multi-view images considering\nmulti-view consistency. Subsequently, we introduce a new Dynamic Eye-aware NeRF\n(DeNeRF). DeNeRF transforms 3D points from different views into a canonical\nspace to learn a unified face NeRF model. We design an eye deformation field\nfor the transformation, including rigid transformation, e.g., eyeball rotation,\nand non-rigid transformation. Through experiments conducted on the ETH-XGaze\ndataset, we demonstrate that our model is capable of generating high-fidelity\nimages with accurate eyeball rotation and non-rigid periocular deformation,\neven under novel viewing angles. Furthermore, we show that utilizing the\nrendered images can effectively enhance gaze estimation performance.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:26:55 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:09:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Hengfei",""],["Zhang","Zhongqun",""],["Cheng","Yihua",""],["Chang","Hyung Jin",""]]}
{"id":"2308.00774","submitter":"Caleb Miller","authors":"The BABAR Collaboration","title":"Precision $e^-$ Beam Polarimetry at an $e^+e^-$ B Factory using Tau-Pair\n  Events","comments":null,"journal-ref":null,"doi":null,"report-no":"BABAR-PUB-23/004 SLAC-PUB-17732","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new technique, `Tau Polarimetry', for measuring the longitudinal\nbeam polarization present in an $e^+e^-$ collider through the analysis of\n$e^+e^-\\rightarrow\\tau^+\\tau^-$ events. By exploiting the sensitivity of $\\tau$\ndecay kinematics to the longitudinal polarization of the beams, we demonstrate\nthat the longitudinal polarization can be measured with a 3 per mil systematic\nuncertainty at the interaction point using a technique that is independent of\nspin and beam transport modeling. Using 424.2$\\pm$1.8 fb$^{-1}$ of BABAR data\nat $\\sqrt{s}=10.58$ GeV, the average longitudinal polarization of the PEP-II\n$e^+e^-$ collider has been measured to be $\\langle P\\rangle=0.0035 \\pm\n0.0024_{\\textrm{stat}}\\pm 0.0029_{\\textrm{sys}}$. The systematic uncertainty\nstudies are described in detail, which can serve as a guide for future\napplications of Tau Polarimetry. A proposed $e^-$ beam longitudinal\npolarization upgrade to the SuperKEKB $e^+e^-$ collider would benefit from this\ntechnique.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:28:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["The BABAR Collaboration","",""]]}
{"id":"2308.00775","submitter":"Jure Demsar","authors":"Sergei Sobolev, Amon Lanz, Tao Dong, Amrit Pokharel, Viktor Kabanov,\n  Tie-Quan Xu, Yue Wang, Zi-Zhao Gan, L.Y. Shi, Nan-Lin Wang, Alexej Pashkin,\n  Ece Uykur, Stephan Winnerl, Manfred Helm, and Jure Demsar","title":"Possible Eliashberg-type superconductivity enhancement effects in a\n  two-band superconductor MgB2 driven by narrow-band THz pulses","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://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study THz-driven condensate dynamics in epitaxial thin films of MgB$_{2}$,\na prototype two-band superconductor (SC) with weak interband coupling. The\ntemperature and excitation density dependent dynamics follow the behavior\npredicted by the phenomenological bottleneck model for the single-gap SC,\nimplying adiabatic coupling between the two condensates on the ps timescale.\nThe amplitude of the THz-driven suppression of condensate density reveals an\nunexpected decrease in pair-breaking efficiency with increasing temperature -\nunlike in the case of optical excitation. The reduced pair-breaking efficiency\nof narrow-band THz pulses, displaying minimum near $\\approx0.7$ T$_{c}$, is\nattributed to THz-driven, long-lived, non-thermal quasiparticle distribution,\nresulting in Eliashberg-type enhancement of superconductivity, competing with\npair-breaking.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:28:50 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sobolev","Sergei",""],["Lanz","Amon",""],["Dong","Tao",""],["Pokharel","Amrit",""],["Kabanov","Viktor",""],["Xu","Tie-Quan",""],["Wang","Yue",""],["Gan","Zi-Zhao",""],["Shi","L. Y.",""],["Wang","Nan-Lin",""],["Pashkin","Alexej",""],["Uykur","Ece",""],["Winnerl","Stephan",""],["Helm","Manfred",""],["Demsar","Jure",""]]}
{"id":"2308.00776","submitter":"Helene Spring","authors":"Helene Spring, Viktor K\\\"onye, Anton R. Akhmerov, Ion Cosma Fulga","title":"Lack of near-sightedness principle in non-Hermitian systems","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":"  The non-Hermitian skin effect is a phenomenon in which an extensive number of\nstates accumulates at the boundaries of a system. It has been associated to\nnontrivial topology, with nonzero bulk invariants predicting its appearance and\nits position in real space. Here we demonstrate that the non-Hermitian skin\neffect is not a topological phenomenon in general: when translation symmetry is\nbroken by a single non-Hermitian impurity, skin modes are depleted at the\nboundary and accumulate at the impurity site, without changing any bulk\ninvariant. This may occur even for a fully Hermitian bulk.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:29:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Spring","Helene",""],["K\u00f6nye","Viktor",""],["Akhmerov","Anton R.",""],["Fulga","Ion Cosma",""]]}
{"id":"2308.00777","submitter":"Konstantinos Dimopoulos","authors":"Konstantinos Dimopoulos","title":"Observable Primordial Gravitational Waves from Cosmic Inflation","comments":"10 pages, 1 figure, contribution to proceedings of HEP2023, Ioannina,\n  April 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I will review briefly how inflation is expected to generate a stochastic\nbackground of primordial gravitational waves (GWs). Then, I will discuss how\nsuch GWs can be enhanced by a stiff period following inflation, enough to be\nobservable. I will present examples of this in the context of hybrid inflation\nwith $\\alpha$-attractors, or a period of hyperkination in Palatini gravity.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:33:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dimopoulos","Konstantinos",""]]}
{"id":"2308.00778","submitter":"Valentina Cesare","authors":"Valentina Cesare, Ugo Becciani, Alberto Vecchiato, Mario Gilberto\n  Lattanzi, Fabio Pitari, Marco Aldinucci, Beatrice Bucciarelli","title":"The MPI + CUDA Gaia AVU-GSR Parallel Solver Toward Next-generation\n  Exascale Infrastructures","comments":"17 pages, 4 figures, 1 table, published on 1st August 2023 in\n  Publications of the Astronomical Society of the Pacific, 135, 074504","journal-ref":"PASP, 135, 074504 (2023)","doi":"10.1088/1538-3873/acdf1e","report-no":null,"categories":"astro-ph.IM cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We ported to the GPU with CUDA the Astrometric Verification Unit-Global\nSphere Reconstruction (AVU-GSR) Parallel Solver developed for the ESA Gaia\nmission, by optimizing a previous OpenACC porting of this application. The code\naims to find, with a [10,100]$\\mu$as precision, the astrometric parameters of\n$\\sim$$10^8$ stars, the attitude and instrumental settings of the Gaia\nsatellite, and the global parameter $\\gamma$ of the parametrized Post-Newtonian\nformalism, by solving a system of linear equations, $A\\times x=b$, with the\nLSQR iterative algorithm. The coefficient matrix $A$ of the final Gaia dataset\nis large, with $\\sim$$10^{11} \\times 10^8$ elements, and sparse, reaching a\nsize of $\\sim$10-100 TB, typical for the Big Data analysis, which requires an\nefficient parallelization to obtain scientific results in reasonable\ntimescales. The speedup of the CUDA code over the original AVU-GSR solver,\nparallelized on the CPU with MPI+OpenMP, increases with the system size and the\nnumber of resources, reaching a maximum of $\\sim$14x, >9x over the OpenACC\napplication. This result is obtained by comparing the two codes on the CINECA\ncluster Marconi100, with 4 V100 GPUs per node. After verifying the agreement\nbetween the solutions of a set of systems with different sizes computed with\nthe CUDA and the OpenMP codes and that the solutions showed the required\nprecision, the CUDA code was put in production on Marconi100, essential for an\noptimal AVU-GSR pipeline and the successive Gaia Data Releases. This analysis\nrepresents a first step to understand the (pre-)Exascale behavior of a class of\napplications that follow the same structure of this code. In the next months,\nwe plan to run this code on the pre-Exascale platform Leonardo of CINECA, with\n4 next-generation A200 GPUs per node, toward a porting on this infrastructure,\nwhere we expect to obtain even higher performances.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:43:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cesare","Valentina",""],["Becciani","Ugo",""],["Vecchiato","Alberto",""],["Lattanzi","Mario Gilberto",""],["Pitari","Fabio",""],["Aldinucci","Marco",""],["Bucciarelli","Beatrice",""]]}
{"id":"2308.00779","submitter":"Andreas Mantziris Dr","authors":"Andreas Mantziris","title":"Higgs vacuum metastability in $R+R^2$ gravity","comments":"10 pages, 3 figures, based on the parallel talk at HEP2023: 40th\n  Conference on Recent Developments in High Energy Physics and Cosmology (5-7\n  April 2023) hosted by the University of Ioannina","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Experimental data suggest that the Higgs potential has a lower ground state\nat high field values. Consequently, decaying from the electroweak to the true\nvacuum nucleates bubbles that expand rapidly and can have dire consequences for\nour Universe. This overview of our last study [1] regarding the cosmological\nimplications of vacuum metastability during Starobinsky inflation was presented\nat the HEP2023 conference. Following the framework established in [2], we\nshowcased our state-of-the-art lower bounds on the non-minimal coupling $\\xi$,\nwhich resulted from a dedicated treatment of the effective Higgs potential in\n$R+R^2$ gravity. The effects of this consideration involved the generation of\ndestabilising terms in the potential and the sensitive dependence of bubble\nnucleation on the last moments of inflation. In this regime, spacetime deviates\nincreasingly from de Sitter and thus the validity of our approach reaches its\nlimit, but at earlier times, we recover our result hinting against eternal\ninflation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:45:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Mantziris","Andreas",""]]}
{"id":"2308.00780","submitter":"Deniz Genlik","authors":"Deniz Genlik, Hsian-Hua Tseng","title":"Higher Genus Gromov-Witten Theory of C^n/Z_n II: Crepant Resolution\n  Correspondence","comments":"Comments are very welcome! 47 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":"  We study the structure of the higher genus Gromov-Witten theory of the total\nspace $K\\mathbb{P}^{n-1}$ of the canonical bundle of the projective space\n$\\mathbb{P}^{n-1}$. We prove the finite generation property for the\nGromov-Witten potential of $K\\mathbb{P}^{n-1}$ by working out the details of\nits cohomological field theory (CohFT). More precisely, we prove that the\nGromov-Witten potential of $K\\mathbb{P}^{n-1}$ lies in an explicit polynomial\nring using the Givental-Teleman classification of the semisimple CohFTs.\n  In arXiv:2301.08389, we carried out a parallel study for\n$[\\mathbb{C}^n/\\mathbb{Z}_n]$ and proved that the Gromov-Witten potential of\n$[\\mathbb{C}^n/\\mathbb{Z}_n]$ lies in a similar polynomial ring. The main\nresult of this paper is a crepant resolution correspondence for higher genus\nGromov-Witten theories of $K\\mathbb{P}^{n-1}$ and\n$[\\mathbb{C}^n/\\mathbb{Z}_n]$, which is proved by establishing an isomorphism\nbetween the polynomial rings associated to $K\\mathbb{P}^{n-1}$ and\n$[\\mathbb{C}^n/\\mathbb{Z}_n]$. This paper generalizes the works of\nLho-Pandharipande arXiv:1804.03168 for the case of\n$[\\mathbb{C}^3/\\mathbb{Z}_3]$ and Lho arXiv:2211.15878 for the case\n$[\\mathbb{C}^5/\\mathbb{Z}_5]$ to arbitrary $n\\geq 3$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:49:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Genlik","Deniz",""],["Tseng","Hsian-Hua",""]]}
{"id":"2308.00781","submitter":"Richard F. Lebed","authors":"Richard F. Lebed","title":"Theory of the (Heavy-Quark) Exotic Hadrons: A Primer for the Flavor\n  Community","comments":"13 pages, 1 figure. Accepted to appear in Proceedings of Science.\n  Based on invited talk at the 21st Conference on Flavor Physics and CP\n  Violation (FPCP 2023), Lyon, France (29 May-2 June 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scores of exotic hadrons, particularly tetraquarks and pentaquarks in the\nheavy-quark sector, have been observed in the past 20 years, and more continue\nto be discovered to this day. Unlike mesons and baryons, such exotics are not\nmandated to exist under our current understanding of QCD, meaning that each new\ndiscovery presents fresh insights into the expansive possibilities of\nstrong-interaction physics. Even the basic architecture of these multiquark\nstates remains an open question. Here we discuss the merits and deficiencies of\ntheir best-known dynamical descriptions, recognizing that the eventual\nuniversal model for exotics will almost certainly require the synthesis of more\nthan one fundamental paradigm.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:49:53 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lebed","Richard F.",""]]}
{"id":"2308.00782","submitter":"Tyler Paine","authors":"Tyler M. Paine and Michael R. Benjamin","title":"An ensemble of online estimation methods for one degree-of-freedom\n  models of unmanned surface vehicles: applied theory and preliminary field\n  results with eight vehicles","comments":"v1) 8 Pages, 5 Figures, To appear at 2023 RSJ/IEEE Conference on\n  Intelligent Robotics and Systems (IROS) in Detroit, Michigan, USA, v2)\n  corrected error in references","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 report an experimental evaluation of three popular methods\nfor online system identification of unmanned surface vehicles (USVs) which were\nimplemented as an ensemble: certifiably stable shallow recurrent neural network\n(RNN), adaptive identification (AID), and recursive least squares (RLS). The\nalgorithms were deployed on eight USVs for a total of 30 hours of online\nestimation. During online training the loss function for the RNN was augmented\nto include a cost for violating a sufficient condition for the RNN to be stable\nin the sense of contraction stability. Additionally we described an efficient\nmethod to calculate the equilibrium points of the RNN and classify the\nassociated stability properties about these points. We found the AID method had\nlowest mean absolute error in the online prediction setting, but a weighted\nensemble had lower error in offline processing.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:52:37 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 14:29:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Paine","Tyler M.",""],["Benjamin","Michael R.",""]]}
{"id":"2308.00783","submitter":"Mingzhan Yang","authors":"Mingzhan Yang, Guangxin Han, Bin Yan, Wenhua Zhang, Jinqing Qi,\n  Huchuan Lu, Dong Wang","title":"Hybrid-SORT: Weak Cues Matter for Online Multi-Object Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-Object Tracking (MOT) aims to detect and associate all desired objects\nacross frames. Most methods accomplish the task by explicitly or implicitly\nleveraging strong cues (i.e., spatial and appearance information), which\nexhibit powerful instance-level discrimination. However, when object occlusion\nand clustering occur, both spatial and appearance information will become\nambiguous simultaneously due to the high overlap between objects. In this\npaper, we demonstrate that this long-standing challenge in MOT can be\nefficiently and effectively resolved by incorporating weak cues to compensate\nfor strong cues. Along with velocity direction, we introduce the confidence\nstate and height state as potential weak cues. With superior performance, our\nmethod still maintains Simple, Online and Real-Time (SORT) characteristics.\nFurthermore, our method shows strong generalization for diverse trackers and\nscenarios in a plug-and-play and training-free manner. Significant and\nconsistent improvements are observed when applying our method to 5 different\nrepresentative trackers. Further, by leveraging both strong and weak cues, our\nmethod Hybrid-SORT achieves superior performance on diverse benchmarks,\nincluding MOT17, MOT20, and especially DanceTrack where interaction and\nocclusion are frequent and severe. The code and models are available at\nhttps://github.com/ymzis69/HybirdSORT.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:53:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Mingzhan",""],["Han","Guangxin",""],["Yan","Bin",""],["Zhang","Wenhua",""],["Qi","Jinqing",""],["Lu","Huchuan",""],["Wang","Dong",""]]}
{"id":"2308.00784","submitter":"Enzo Agustin Saavedra","authors":"Enzo A. Saavedra, Gustavo E. Romero, Valenti Bosch-Ramon, Elina Kefala","title":"Achromatic rapid flares in hard X-rays in the $\\gamma$-ray binary LS I\n  +61-303","comments":"8 pages, 7 figures. Accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2377","report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the presence of very rapid hard X-ray variability in the\n$\\gamma$-ray binary LS I +61 303. The results were obtained by analysing NuSTAR\ndata, which show two achromatic strong flares on ks time-scales before\napastron. The Swift-BAT orbital X-ray light curve is also presented, and the\nNuSTAR data are put in the context of the system orbit. The spectrum and\nestimated physical conditions of the emitting region indicate that the\nradiation is synchrotron emission from relativistic electrons, likely produced\nin a shocked pulsar wind. The achromaticity suggests that losses are dominated\nby escape or adiabatic cooling in a relativistic flow, and the overall\nbehaviour in hard X-rays can be explained by abrupt changes in the size of the\nemitting region and/or its motion relative to the line of sight, with Doppler\nboosting potentially being a prominent effect. The rapid changes of the emitter\ncould be the result of different situations such as quick changes in the\nintra-binary shock, variations in the re-accelerated shocked pulsar wind\noutside the binary, or strong fluctuations in the location and size of the\nCoriolis shock region. Although future multi-wavelength observations are needed\nto further constrain the physical properties of the high-energy emitter, this\nwork already provides important insight into the complex dynamics and radiation\nprocesses in LS I +61-303.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:54:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Saavedra","Enzo A.",""],["Romero","Gustavo E.",""],["Bosch-Ramon","Valenti",""],["Kefala","Elina",""]]}
{"id":"2308.00785","submitter":"Richard Townsend","authors":"R. H. D. Townsend S. D. Kawaler","title":"Corrected Weight Functions for Stellar Oscillation Eigenfrequencies","comments":"3 pages, 1 figure, submitted to RNAAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kawaler et al. (1985) present a variational expression for the\neigenfrequencies associated with stellar oscillations. We highlight and correct\na typographical error in the weight functions appearing in these expressions,\nand validate the correction numerically.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:54:48 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kawaler","R. H. D. Townsend S. D.",""]]}
{"id":"2308.00787","submitter":"Sizhen Bian","authors":"Sizhen Bian and Michele Magno","title":"Evaluating Spiking Neural Network On Neuromorphic Platform For Human\n  Activity Recognition","comments":null,"journal-ref":null,"doi":"10.1145/3594738.3611369","report-no":null,"categories":"cs.NE cs.HC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Energy efficiency and low latency are crucial requirements for designing\nwearable AI-empowered human activity recognition systems, due to the hard\nconstraints of battery operations and closed-loop feedback. While neural\nnetwork models have been extensively compressed to match the stringent edge\nrequirements, spiking neural networks and event-based sensing are recently\nemerging as promising solutions to further improve performance due to their\ninherent energy efficiency and capacity to process spatiotemporal data in very\nlow latency. This work aims to evaluate the effectiveness of spiking neural\nnetworks on neuromorphic processors in human activity recognition for wearable\napplications. The case of workout recognition with wrist-worn wearable motion\nsensors is used as a study. A multi-threshold delta modulation approach is\nutilized for encoding the input sensor data into spike trains to move the\npipeline into the event-based approach. The spikes trains are then fed to a\nspiking neural network with direct-event training, and the trained model is\ndeployed on the research neuromorphic platform from Intel, Loihi, to evaluate\nenergy and latency efficiency. Test results show that the spike-based workouts\nrecognition system can achieve a comparable accuracy (87.5\\%) comparable to the\npopular milliwatt RISC-V bases multi-core processor GAP8 with a traditional\nneural network ( 88.1\\%) while achieving two times better energy-delay product\n(0.66 \\si{\\micro\\joule\\second} vs. 1.32 \\si{\\micro\\joule\\second}).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:59:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bian","Sizhen",""],["Magno","Michele",""]]}
{"id":"2308.00788","submitter":"Yihua Zhang","authors":"Yihua Zhang, Prashant Khanduri, Ioannis Tsaknakis, Yuguang Yao, Mingyi\n  Hong, Sijia Liu","title":"An Introduction to Bi-level Optimization: Foundations and Applications\n  in Signal Processing and Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, bi-level optimization (BLO) has taken center stage in some very\nexciting developments in the area of signal processing (SP) and machine\nlearning (ML). Roughly speaking, BLO is a classical optimization problem that\ninvolves two levels of hierarchy (i.e., upper and lower levels), wherein\nobtaining the solution to the upper-level problem requires solving the\nlower-level one. BLO has become popular largely because it is powerful in\nmodeling problems in SP and ML, among others, that involve optimizing nested\nobjective functions. Prominent applications of BLO range from resource\nallocation for wireless systems to adversarial machine learning. In this work,\nwe focus on a class of tractable BLO problems that often appear in SP and ML\napplications. We provide an overview of some basic concepts of this class of\nBLO problems, such as their optimality conditions, standard algorithms\n(including their optimization principles and practical implementations), as\nwell as how they can be leveraged to obtain state-of-the-art results for a\nnumber of key SP and ML applications. Further, we discuss some recent advances\nin BLO theory, its implications for applications, and point out some\nlimitations of the state-of-the-art that require significant future research\nefforts. Overall, we hope that this article can serve to accelerate the\nadoption of BLO as a generic tool to model, analyze, and innovate on a wide\narray of emerging SP and ML applications.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:59:07 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 05:30:29 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Yihua",""],["Khanduri","Prashant",""],["Tsaknakis","Ioannis",""],["Yao","Yuguang",""],["Hong","Mingyi",""],["Liu","Sijia",""]]}
{"id":"2308.00789","submitter":"Garrett Mathesen","authors":"Garrett Mathesen, Charlotte Wehner, Julian Merrick, Bradley Shirley,\n  Ronald Agustsson, Robert Berry, Amirari Diego, and Emilio A. Nanni","title":"Utilization of Additive Manufacturing for the Rapid Prototyping of\n  C-Band RF Loads","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Additive manufacturing is a versatile technique that shows promise in\nproviding quick and dynamic manufacturing for complex engineering problems.\nResearch has been ongoing into the use of additive manufacturing for potential\napplications in radiofrequency (RF) component technologies. Here we present a\nmethod for developing an effective prototype load produced out of 316L\nstainless steel on a direct metal laser sintering machine. The model was tested\nwithin simulation software to verify the validity of the design. The load\nstructure was manufactured utilizing an online digital manufacturing company,\nshowing the viability of using easily accessible tools to manufacture RF\nstructures. The produced load was able to produce an S$_{11}$ value of -22.8 dB\nat the C-band frequency of 5.712 GHz while under vacuum. In a high power test,\nthe load was able to terminate a peak power of 8.1 MW. Discussion includes\nfuture applications of the present research and how it will help to improve the\nimplementation of future accelerator concepts.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:00:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Mathesen","Garrett",""],["Wehner","Charlotte",""],["Merrick","Julian",""],["Shirley","Bradley",""],["Agustsson","Ronald",""],["Berry","Robert",""],["Diego","Amirari",""],["Nanni","Emilio A.",""]]}
{"id":"2308.00790","submitter":"Gabriele Nebe","authors":"Gabriele Nebe and Leonie Scheeren","title":"Conjugate weight enumerators and invariant theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Galois group of a finite field extension $K/F$ defines a grading on the\nsymmetric algebra of the $F$-space $K^v$ which we use to introduce the notion\nof homogeneous conjugate invariants for subgroups $G\\leq \\GL_v(K)$. If the\nWeight Enumerator Conjecture holds for a finite representation $\\rho $ then the\ngenus-$m$ conjugate complete weight enumerators of self-dual codes generate the\ncorresponding space of conjugate invariants of the associated genus-$m$\nClifford-Weil group ${\\mathcal C}_m(\\rho ) \\leq \\GL_{v^m}(K)$. This\ngeneralisation of a paper by Bannai, Oura and Da Zhao provides new examples of\nClifford-Weil orbits that form projective designs.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:00:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nebe","Gabriele",""],["Scheeren","Leonie",""]]}
{"id":"2308.00791","submitter":"Junhan Fang","authors":"Junhan Fang (1) and Donna Spiegelman (1 and 2) and Ashley Buchanan (3)\n  and Laura Forastiere (1 and 2) ((1) Center for Methods in Implementation and\n  Prevention Science, Yale School of Public Health, Yale University, New Haven,\n  CT, (2) Department of Biostatistics, Yale School of Public Health, Yale\n  University, New Haven, CT (3) Department of Pharmacy Practice, College of\n  Pharmacy, University of Rhode Island, Kingston, RI)","title":"Design of egocentric network-based studies to estimate causal effects\n  under interference","comments":"30 pages for main text including figures and tables, 5 figures and 3\n  tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many public health interventions are conducted in settings where individuals\nare connected to one another and the intervention assigned to randomly selected\nindividuals may spill over to other individuals they are connected to. In these\nspillover settings, the effects of such interventions can be quantified in\nseveral ways. The average individual effect measures the intervention effect\namong those directly treated, while the spillover effect measures the effect\namong those connected to those directly treated. In addition, the overall\neffect measures the average intervention effect across the study population,\nover those directly treated along with those to whom the intervention spills\nover but who are not directly treated. Here, we develop methods for study\ndesign with the aim of estimating individual, spillover, and overall effects.\nIn particular, we consider an egocentric network-based randomized design in\nwhich a set of index participants is recruited from the population and randomly\nassigned to treatment, while data are also collected from their untreated\nnetwork members. We use the potential outcomes framework to define two\nclustered regression modeling approaches and clarify the underlying assumptions\nrequired to identify and estimate causal effects. We then develop sample size\nformulas for detecting individual, spillover, and overall effects. We\ninvestigate the roles of the intra-class correlation coefficient and the\nprobability of treatment allocation on the required number of egocentric\nnetworks with a fixed number of network members for each egocentric network and\nvice-versa.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:02:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Fang","Junhan","","1 and 2"],["Spiegelman","Donna","","1 and 2"],["Buchanan","Ashley","","1 and 2"],["Forastiere","Laura","","1 and 2"]]}
{"id":"2308.00792","submitter":"Christof Geiss","authors":"Christof Gei{\\ss}, Daniel Labardini-Fragoso, Jon Wilson","title":"Laminations of punctured surfaces as $\\tau$-reduced irreducible\n  components","comments":"33 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\boldsymbol{\\Sigma}:=(\\Sigma,\\mathbb{M},\\mathbb{P})$ be a marked surface\nwith marked points on the boundary\n$\\mathbb{M}\\subset\\partial\\Sigma\\neq\\varnothing$, and punctures\n$\\mathbb{P}\\subset\\Sigma\\setminus\\partial\\Sigma$, and let $T$ be signature zero\ntagged triangulation of $\\boldsymbol{\\Sigma}$ in the sense of\nFomin-Shapiro-Thurston. In this situation the corresponding non-degenerate\nJacobian algebra $A(T):=\\mathcal{P}_{\\mathbb{C}}(Q(T), W(T))$ is skewed-gentle.\nBuilding on ideas by Qiu-Zhou, and on recent progress concerning the\ndescription of homomorphisms between representations of skewed-gentle algebras\nby the first author, we show that there is an isomorphism\n$\\pi_T:\\operatorname{Lam}(\\boldsymbol{\\Sigma})\\rightarrow\\operatorname{DecIrr}^\\tau(A(T))$\nof tame partial KRS-monoids, which intertwines generic $g$-vectors and shear\ncoordinates with respect to $T$. Here,\n$\\operatorname{Lam}(\\boldsymbol{\\Sigma})$ is the set of laminations of\n$\\boldsymbol{\\Sigma}$ considered by Musiker-Schiffler-Williams, with the\ndisjoint union of non-intersecting laminations as partial monoid operation. On\nthe other hand, $\\operatorname{DecIrr}^\\tau(A(T))$ denotes the set of\ngenerically $\\tau$-reduced irreducible components of the decorated\nrepresentation varieties of $A(T)$, with the direct sum of generically\n$E$-orthogonal irreducible components as partial monoid operation, where $E$ is\nthe symmetrized $E$-invariant of Derksen-Weyman-Zelevinsky.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:02:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gei\u00df","Christof",""],["Labardini-Fragoso","Daniel",""],["Wilson","Jon",""]]}
{"id":"2308.00793","submitter":"Tianyi Zhang","authors":"Anton Bukov, Shay Solomon, Tianyi Zhang","title":"Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time\n  Barrier","comments":"Abstract shortened to meet arXiv requirements","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The dynamic set cover problem has been subject to extensive research since\nthe pioneering works of [Bhattacharya et al, 2015] and [Gupta et al, 2017]. The\ninput is a set system $(U, S)$ on a fixed collection $S$ of sets and a dynamic\nuniverse of elements, where each element appears in a most $f$ sets and the\ncost of each set lies in the range $[1/C, 1]$, and the goal is to efficiently\nmaintain an approximately-minimum set cover under insertions and deletions of\nelements.\n  Most previous work considers the low-frequency regime, namely $f = O(\\log\nn)$, and this line of work has culminated with a deterministic\n$(1+\\epsilon)f$-approximation algorithm with amortized update time\n$O(\\frac{f^2}{\\epsilon^3} + \\frac{f}{\\epsilon^2}\\log C)$ [Bhattacharya et al,\n2021]. In the high-frequency regime of $f = \\Omega(\\log n)$, an $O(\\log\nn)$-approximation algorithm with amortized update time $O(f\\log n)$ was given\nby [Gupta et al, 2017].\n  Interestingly, at the intersection of the two regimes, i.e., $f = \\Theta(\\log\nn)$, the state-of-the-art results coincide: approximation $\\Theta(f) =\n\\Theta(\\log n)$ with amortized update time $O(f^2) = O(f \\log n) = O(\\log^2\nn)$. Up to this date, no previous work achieved update time of $o(f^2)$.\n  In this paper we break the $\\Omega(f^2)$ update time barrier via the\nfollowing results: (1) $(1+\\epsilon)f$-approximation can be maintained in\n$O\\left(\\frac{f}{\\epsilon^3}\\log^*f + \\frac{f}{\\epsilon^3}\\log C\\right) =\nO_{\\epsilon,C}(f \\log^* f)$ expected amortized update time; our algorithm works\nagainst an adaptive adversary. (2) $(1+\\epsilon)f$-approximation can be\nmaintained deterministically in $O\\left(\\frac{1}{\\epsilon}f\\log f +\n\\frac{f}{\\epsilon^3} + \\frac{f\\log C}{\\epsilon^2}\\right) = O_{\\epsilon,C}(f\n\\log f)$ amortized update time.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:11:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bukov","Anton",""],["Solomon","Shay",""],["Zhang","Tianyi",""]]}
{"id":"2308.00796","submitter":"Krishnan Paramasivam","authors":"Muhammed Sabeel K, Krishnan Paramasivam","title":"On determining number and metric dimension of zero-divisor graphs","comments":"21 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this article, explicit formulas for finding the determining number and the\nmetric dimension of the zero-divisor graph of Z_n and non-Boolean semisimple\nrings are given. In the case of Boolean rings, an upper bound of the\ndetermining number and the metric dimension of zero-divisor graph is\ndetermined. Further, the determining number and the metric dimension of some\nimportant graphs other than zero-divisor graphs, are proved and the open\nproblem by Boutin, regarding the determining number of graphs is settled.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:13:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["K","Muhammed Sabeel",""],["Paramasivam","Krishnan",""]]}
{"id":"2308.00797","submitter":"Albert Gran Alcoz","authors":"Albert Gran Alcoz, Bal\\'azs Vass, G\\'abor R\\'etv\\'ari, Laurent\n  Vanbever","title":"Everything Matters in Programmable Packet Scheduling","comments":"12 pages, 12 figures (without references and appendices)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Programmable packet scheduling allows the deployment of scheduling algorithms\ninto existing switches without need for hardware redesign. Scheduling\nalgorithms are programmed by tagging packets with ranks, indicating their\ndesired priority. Programmable schedulers then execute these algorithms by\nserving packets in the order described in their ranks.\n  The ideal programmable scheduler is a Push-In First-Out (PIFO) queue, which\nachieves perfect packet sorting by pushing packets into arbitrary positions in\nthe queue, while only draining packets from the head. Unfortunately,\nimplementing PIFO queues in hardware is challenging due to the need to\narbitrarily sort packets at line rate based on their ranks.\n  In the last years, various techniques have been proposed, approximating PIFO\nbehaviors using the available resources of existing data planes. While\npromising, approaches to date only approximate one of the characteristic\nbehaviors of PIFO queues (i.e., its scheduling behavior, or its admission\ncontrol).\n  We propose PACKS, the first programmable scheduler that fully approximates\nPIFO queues on all their behaviors. PACKS does so by smartly using a set of\nstrict-priority queues. It uses packet-rank information and queue-occupancy\nlevels at enqueue to decide: whether to admit packets to the scheduler, and how\nto map admitted packets to the different queues.\n  We fully implement PACKS in P4 and evaluate it on real workloads. We show\nthat PACKS: better-approximates PIFO than state-of-the-art approaches and\nscales. We also show that PACKS runs at line rate on existing hardware (Intel\nTofino).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:15:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Alcoz","Albert Gran",""],["Vass","Bal\u00e1zs",""],["R\u00e9tv\u00e1ri","G\u00e1bor",""],["Vanbever","Laurent",""]]}
{"id":"2308.00798","submitter":"Alan Zander","authors":"Alan Zander, Manuel Ettengruber, Philipp Eller","title":"How Many Dark Neutrino Sectors Does Cosmology Allow?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the very first constraints on the number of Standard Model (SM)\ncopies with an additional Dirac right-handed neutrino. We show that solving the\nhierarchy problem within this framework induces in turn a severe hierarchy\nbetween the neutrino Yukawa couplings. By demanding the absence of such\nunnatural hierarchies, we are even able to rule out the theory.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:21:15 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zander","Alan",""],["Ettengruber","Manuel",""],["Eller","Philipp",""]]}
{"id":"2308.00799","submitter":"Yufei Zhang","authors":"Yufei Zhang, Hanjing Wang, Jeffrey O. Kephart, Qiang Ji","title":"Body Knowledge and Uncertainty Modeling for Monocular 3D Human Body\n  Reconstruction","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While 3D body reconstruction methods have made remarkable progress recently,\nit remains difficult to acquire the sufficiently accurate and numerous 3D\nsupervisions required for training. In this paper, we propose \\textbf{KNOWN}, a\nframework that effectively utilizes body \\textbf{KNOW}ledge and\nu\\textbf{N}certainty modeling to compensate for insufficient 3D supervisions.\nKNOWN exploits a comprehensive set of generic body constraints derived from\nwell-established body knowledge. These generic constraints precisely and\nexplicitly characterize the reconstruction plausibility and enable 3D\nreconstruction models to be trained without any 3D data. Moreover, existing\nmethods typically use images from multiple datasets during training, which can\nresult in data noise (\\textit{e.g.}, inconsistent joint annotation) and data\nimbalance (\\textit{e.g.}, minority images representing unusual poses or\ncaptured from challenging camera views). KNOWN solves these problems through a\nnovel probabilistic framework that models both aleatoric and epistemic\nuncertainty. Aleatoric uncertainty is encoded in a robust Negative\nLog-Likelihood (NLL) training loss, while epistemic uncertainty is used to\nguide model refinement. Experiments demonstrate that KNOWN's body\nreconstruction outperforms prior weakly-supervised approaches, particularly on\nthe challenging minority images.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:29:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Yufei",""],["Wang","Hanjing",""],["Kephart","Jeffrey O.",""],["Ji","Qiang",""]]}
{"id":"2308.00800","submitter":"Martha Kalina","authors":"Martha Kalina, Vanessa Sch\\\"one, Boris Spak, Florian Paysan, Eric\n  Breitbarth, Markus K\\\"astner","title":"Fatigue crack growth in anisotropic aluminium sheets -- phase-field\n  modelling and experimental validation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fatigue crack growth is decisive for the design of thin-walled structures\nsuch as fuselage shells of air planes. The cold rolling process, used to\nproduce the aluminium sheets this structure is made of, leads to anisotropic\nmechanical properties. In this contribution, we simulate the fatigue crack\ngrowth with a phase-field model due to its superior ability to model arbitrary\ncrack paths. A fatigue variable based on the Local Strain Approach describes\nthe progressive weakening of the crack resistance. Anisotropy regarding the\nfracture toughness is included through a structural tensor in the crack surface\ndensity. The model is parameterised for an aluminium AA2024-T351 sheet\nmaterial. Validation with a set of experiments shows that the fitted model can\nreproduce key characteristics of a growing fatigue crack, including crack path\ndirection and growth rate, considering the rolling direction.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:33:14 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kalina","Martha",""],["Sch\u00f6ne","Vanessa",""],["Spak","Boris",""],["Paysan","Florian",""],["Breitbarth","Eric",""],["K\u00e4stner","Markus",""]]}
{"id":"2308.00802","submitter":"Stergios Chatzikyriakidis","authors":"Stergios Chatzikyriakidis and Chatrine Qwaider and Ilias Kolokousis\n  and Christina Koula and Dimitris Papadakis and Efthymia Sakellariou","title":"GRDD: A Dataset for Greek Dialectal NLP","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, we present a dataset for the computational study of a number\nof Modern Greek dialects. It consists of raw text data from four dialects of\nModern Greek, Cretan, Pontic, Northern Greek and Cypriot Greek. The dataset is\nof considerable size, albeit imbalanced, and presents the first attempt to\ncreate large scale dialectal resources of this type for Modern Greek dialects.\nWe then use the dataset to perform dialect idefntification. We experiment with\ntraditional ML algorithms, as well as simple DL architectures. The results show\nvery good performance on the task, potentially revealing that the dialects in\nquestion have distinct enough characteristics allowing even simple ML models to\nperform well on the task. Error analysis is performed for the top performing\nalgorithms showing that in a number of cases the errors are due to insufficient\ndataset cleaning.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:34:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chatzikyriakidis","Stergios",""],["Qwaider","Chatrine",""],["Kolokousis","Ilias",""],["Koula","Christina",""],["Papadakis","Dimitris",""],["Sakellariou","Efthymia",""]]}
{"id":"2308.00803","submitter":"Surjyasish Mitra","authors":"A-Reum Kim, Surjyasish Mitra, Sudip Shyam, Boxin Zhao, and Sushanta K.\n  Mitra","title":"Flexible hydrogels connecting adhesion and wetting","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":"  Raindrops falling on window panes spread upon contact, whereas hail can cause\ndents or scratches on the same glass window upon contact. While the former\nphenomenon resembles classical wetting, the latter is dictated by contact and\nadhesion theories. The classical Young-Dupre law applies to the wetting of pure\nliquids on rigid solids, whereas conventional contact mechanics theories\naccount for rigid-on-soft or soft-on-rigid contacts with small deformations in\nthe elastic limit. However, the crossover between adhesion and wetting is yet\nto be fully resolved. The key lies in the study of soft-on-soft interactions\nwith material properties intermediate between liquids and solids. In this work,\nwe translate from adhesion to wetting by experimentally probing the static\nsignature of hydrogels in contact with soft PDMS of varying elasticity of both\nthe components. Consequently, we probe this transition across six orders of\nmagnitude in terms of the characteristic elasto-adhesive parameter of the\nsystem. In doing so, we reveal previously unknown phenomenology and a\ntheoretical model which smoothly bridges adhesion of glass spheres with total\nwetting of pure liquids on any given substrate. Lastly, we highlight how solid\nlike hydrogels can be treated as potential candidates for cleaning impurities\nfrom conventionally sticky PDMS substrates.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:35:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kim","A-Reum",""],["Mitra","Surjyasish",""],["Shyam","Sudip",""],["Zhao","Boxin",""],["Mitra","Sushanta K.",""]]}
{"id":"2308.00804","submitter":"Sujay Kr. Biswas","authors":"Trishit Banerjee, Goutam Mandal, Atreyee Biswas, and Sujay Kr. Biswas","title":"Gravitationally induced matter creation and cosmological consequences","comments":"26 pages, 14 captioned figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, a two-fluid interacting model in a flat FLRW universe has been\nstudied considering particle creation mechanism with a particular form of\nparticle creation rate $\\Gamma=\\Gamma_0 H+\\frac{\\Gamma_1}{H}$ from different\naspects. Statistical analysis with a combined data set of SNe Ia (Supernovae\nType Ia) and Hubble data is performed to achieve the best-fit values of the\nmodel parameters, and the model is compatible with current observational data.\nWe also perform a dynamical analysis of this model to get an overall\nqualitative description of the cosmological evolution by converting the\ngoverning equations into a system of ordinary differential equations\nconsidering a proper transformation of variables. We find some non-isolated\nsets of critical points, among which some usually are normally hyperbolic sets\nof points that describe the present acceleration of the Universe dominated by\ndark energy mimicking cosmological constant or phantom fluid. Scaling solutions\nare also obtained from this analysis, and they can alleviate the coincidence\nproblem successfully. Finally, the thermodynamic analysis shows that the\nGeneralized second law of thermodynamics is valid in an irreversible\nthermodynamic context.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:09:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Banerjee","Trishit",""],["Mandal","Goutam",""],["Biswas","Atreyee",""],["Biswas","Sujay Kr.",""]]}
{"id":"2308.00805","submitter":"D\\\"orte Kreher","authors":"Ulrich Horst, D\\\"orte Kreher, Konstantins Starovoitovs","title":"Second-Order Approximation of Limit Order Books in a Single-Scale Regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We establish a first and second-order approximation for an infinite\ndimensional limit order book model (LOB) in a single (''critical'') scaling\nregime where market and limit orders arrive at a common time scale. With our\nchoice of scaling we obtain non-degenerate first-order and second-order\napproximations for the price and volume dynamics. While the first-order\napproximation is given by a standard coupled ODE-PDE system, the second-order\napproximation is non-standard and described in terms of an infinite-dimensional\nstochastic evolution equation driven by a cylindrical Brownian motion. The\ndriving noise processes exhibit a non-trivial correlation in terms of the model\nparameters. We prove that the evolution equation has a unique solution and that\nthe sequence of standardized LOB models converges weakly to the solution of the\nevolution equation. The proof uses a non-standard martingale problem. We\ncalibrate a simplified version of our model to market data and show that the\nmodel accurately captures correlations between price and volume fluctuations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:38:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Horst","Ulrich",""],["Kreher","D\u00f6rte",""],["Starovoitovs","Konstantins",""]]}
{"id":"2308.00806","submitter":"Md Sakib Hossain Shovon","authors":"Md Sakib Hossain Shovon, M. F. Mridha, Khan Md Hasib, Sultan\n  Alfarhood, Mejdl Safran, and Dunren Che","title":"Addressing Uncertainty in Imbalanced Histopathology Image Classification\n  of HER2 Breast Cancer: An interpretable Ensemble Approach with Threshold\n  Filtered Single Instance Evaluation (SIE)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Breast Cancer (BC) is among women's most lethal health concerns. Early\ndiagnosis can alleviate the mortality rate by helping patients make efficient\ntreatment decisions. Human Epidermal Growth Factor Receptor (HER2) has become\none the most lethal subtype of BC. According to the College of American\nPathologists/American Society of Clinical Oncology (CAP/ASCO), the severity\nlevel of HER2 expression can be classified between 0 and 3+ range. HER2 can be\ndetected effectively from immunohistochemical (IHC) and, hematoxylin \\& eosin\n(HE) images of different classes such as 0, 1+, 2+, and 3+. An ensemble\napproach integrated with threshold filtered single instance evaluation (SIE)\ntechnique has been proposed in this study to diagnose BC from the\nmulti-categorical expression of HER2 subtypes. Initially, DenseNet201 and\nXception have been ensembled into a single classifier as feature extractors\nwith an effective combination of global average pooling, dropout layer, dense\nlayer with a swish activation function, and l2 regularizer, batch\nnormalization, etc. After that, extracted features has been processed through\nsingle instance evaluation (SIE) to determine different confidence levels and\nadjust decision boundary among the imbalanced classes. This study has been\nconducted on the BC immunohistochemical (BCI) dataset, which is classified by\npathologists into four stages of HER2 BC. This proposed approach known as\nDenseNet201-Xception-SIE with a threshold value of 0.7 surpassed all other\nexisting state-of-art models with an accuracy of 97.12\\%, precision of 97.15\\%,\nand recall of 97.68\\% on H\\&E data and, accuracy of 97.56\\%, precision of\n97.57\\%, and recall of 98.00\\% on IHC data respectively, maintaining momentous\nimprovement. Finally, Grad-CAM and Guided Grad-CAM have been employed in this\nstudy to interpret, how TL-based model works on the histopathology dataset and\nmake decisions from the data.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:44:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shovon","Md Sakib Hossain",""],["Mridha","M. F.",""],["Hasib","Khan Md",""],["Alfarhood","Sultan",""],["Safran","Mejdl",""],["Che","Dunren",""]]}
{"id":"2308.00807","submitter":"Joseph Kitzman","authors":"J.M. Kitzman, J.R. Lane, C. Undershute, M. Drimmer, A. S. Schleusner,\n  N.R. Beysengulov, C.A. Mikolas, J. Pollanen","title":"Free-space coupling and characterization of transverse bulk phonon modes\n  in a quantum acoustic device","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":"  Transverse bulk phonons in a multimode integrated quantum acoustic device are\nexcited and characterized via their free-space coupling to a three-dimensional\n(3D) microwave cavity. These bulk acoustic modes are defined by the geometry of\nthe Y-cut lithium niobate substrate in which they reside and couple to the\ncavity electric field via a large dipole antenna, with an interaction strength\non the order of the cavity line-width. Using finite element modeling (FEM) we\ndetermine that the bulk phonons excited by the cavity field have a transverse\npolarization with a shear velocity matching previously reported values. We\ndemonstrate how the coupling between these transverse acoustic modes and the\nelectric field of the 3D cavity depends on the relative orientation of the\ndevice dipole, with a coupling persisting to room temperature. Our study\ndemonstrates the versatility of 3D microwave cavities for mediating\ncontact-less coupling to quantum, and classical, piezoacoustic devices.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:44:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kitzman","J. M.",""],["Lane","J. R.",""],["Undershute","C.",""],["Drimmer","M.",""],["Schleusner","A. S.",""],["Beysengulov","N. R.",""],["Mikolas","C. A.",""],["Pollanen","J.",""]]}
{"id":"2308.00808","submitter":"Vasileios Alevizos","authors":"Vasileios Alevizos and Ilias Georgousis and Anna-Maria Kapodistria","title":"Towards Climate Neutrality: A Comprehensive Overview of Sustainable\n  Operations Management, Optimization, and Wastewater Treatment Strategies","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":"  Various studies have been conducted in the fields of sustainable operations\nmanagement, optimization, and wastewater treatment, yielding unsubstantiated\nrecovery. In the context of Europes climate neutrality vision, this paper\nreviews effective decarbonization strategies and proposes sustainable\napproaches to mitigate carbonization in various sectors such as building,\nenergy, industry, and transportation. The study also explores the role of\ndigitalization in decarbonization and reviews decarbonization policies that can\ndirect governments action towards a climate-neutral society. The paper also\npresents a review of optimization approaches applied in the fields of science\nand technology, incorporating modern optimization techniques based on various\npeer-reviewed published research papers. It emphasizes non-conventional energy\nand distributed power generating systems along with the deregulated and\nregulated environment. Additionally, this paper critically reviews the\nperformance and capability of micellar enhanced ultrafiltration (MEUF) process\nin the treatment of dye wastewater. The review presents evidence of\nsimultaneous removal of co-existing pollutants and explores the feasibility and\nefficiency of biosurfactant in-stead of chemical surfactant. Lastly, the paper\nproposes a novel firm-regulator-consumer interaction framework to study\noperations decisions and interactive cooperation considering the interactions\namong three agents through a comprehensive literature review on sustainable\noperations management. The framework provides support for exploring future\nresearch opportunities.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:46:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Alevizos","Vasileios",""],["Georgousis","Ilias",""],["Kapodistria","Anna-Maria",""]]}
{"id":"2308.00809","submitter":"Francesco Giovanni Celiberto","authors":"Francesco Giovanni Celiberto, Alessandro Papa","title":"A high-energy QCD portal to exotic matter: Heavy-light tetraquarks at\n  the HL-LHC","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By taking advantage of the natural stability of the high-energy resummation,\nrecently discovered in the context of heavy-flavor studies, we investigate the\ninclusive hadroproduction of a neutral heavy-light, hidden-flavored tetraquark\n($X_{cu\\bar{c}\\bar{u}}$ or $X_{bs\\bar{b}\\bar{s}}$ state), in association with a\nheavy (single $c$- or $b$-flavored) hadron or a light jet at the (HL-)LHC. We\nmake use of the JETHAD multi-modular working package to provide predictions for\nrapidity, azimuthal-angle and transverse-momentum distributions calculated via\nthe hybrid high-energy and collinear factorization, where the\nBalitsky--Fadin--Kuraev--Lipatov resummation of energy logarithms is\nsupplemented by collinear parton densities and fragmentation functions. We rely\nupon the single-parton fragmentation mechanism, valid in the large\ntransverse-momentum regime, to describe the tetraquark production. Our study\nrepresents a first attempt at bridging the gap between all-order calculations\nof high-energy QCD and the exotics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:46:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Celiberto","Francesco Giovanni",""],["Papa","Alessandro",""]]}
{"id":"2308.00810","submitter":"Bruno Borges Leal","authors":"B. B. Leal, I. L. Caldas, M. C. de Sousa, R. L. Viana, and A. M.\n  Ozorio de Almeida","title":"Isochronous island bifurcations driven by resonant magnetic\n  perturbations in Tokamaks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph nlin.CD physics.app-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Recent evidences show that heteroclinic bifurcations in magnetic islands may\nbe caused by the amplitude variation of resonant magnetic perturbations in\ntokamaks. To investigate the onset of these bifurcations, we consider a large\naspect ratio tokamak with an ergodic limiter composed of two pairs of rings\nthat create external primary perturbations with two sets of wave numbers. An\nindividual pair produces hyperbolic and elliptic periodic points, and its\nassociated islands, that are consistent with the Poincar\\'e-Birkhoff fixed\npoint theorem. However, for two pairs producing external perturbations resonant\non the same rational surface, we show that different configurations of\nisochronous island chains may appear on phase space according to the amplitude\nof the electric currents in each pair of the ergodic limiter. When one of the\nelectric currents increases, isochronous bifurcations take place and new\nislands are created with the same winding number as the preceding islands. We\npresent examples of bifurcation sequences displaying (a) direct transitions\nfrom the island chain configuration generated by one of the pairs to the\nconfiguration produced by the other pair, and (b) transitions with intermediate\nconfigurations produced by the limiter pairs coupling. Furthermore, we identify\nshearless bifurcations inside some isochronous islands, originating\nnonmonotonic local winding number profiles with associated shearless invariant\ncurves.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:46:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Leal","B. B.",""],["Caldas","I. L.",""],["de Sousa","M. C.",""],["Viana","R. L.",""],["de Almeida","A. M. Ozorio",""]]}
{"id":"2308.00811","submitter":"Karol Bo{\\l}botowski","authors":"Karol Bo{\\l}botowski","title":"Optimal design of plane elastic membranes using the convexified\n  F\\\"{o}ppl's model","comments":"55 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work puts forth a new optimal design formulation for planar elastic\nmembranes. The goal is to minimize the membrane's compliance through choosing\nthe material distribution described by a positive Radon measure. The\ndeformation of the membrane itself is governed by the convexified F\\\"{o}ppl's\nmodel. The uniqueness of this model lies in the convexity of its variational\nformulation despite the inherent nonlinearity of the strain-displacement\nrelation. It makes it possible to rewrite the optimization problem as a pair of\nmutually dual convex variational problems. In the primal problem a linear\nfunctional is maximized with respect to displacement functions while enforcing\nthat point-wisely the strain lies in an unbounded closed convex set. The dual\nproblem consists in finding equilibrated stresses that are to minimize a convex\nintegral functional of linear growth defined on the space of Radon measures.\nThe pair of problems is analysed: existence and regularity results are\nprovided, together with the system of optimality criteria. To demonstrate the\ncomputational potential of the pair, a finite element scheme is developed\naround it. Upon reformulation to a conic-quadratic & semi-definite programming\nproblem, the method is employed to produce numerical simulations for several\nload case scenarios.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:49:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bo\u0142botowski","Karol",""]]}
{"id":"2308.00812","submitter":"Jenny Lee","authors":"Jenny J. Lee, Xiao Wu, Francesca Dominici, and Rachel C. Nethery","title":"Causal exposure-response curve estimation with surrogate confounders: a\n  study of air pollution and children's health in Medicaid claims data","comments":"38 pages,5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we undertake a case study in which interest lies in estimating\na causal exposure-response function (ERF) for long-term exposure to fine\nparticulate matter (PM$_{2.5}$) and respiratory hospitalizations in\nsocioeconomically disadvantaged children using nationwide Medicaid claims data.\nNew methods are needed to address the specific challenges the Medicaid data\npresent. First, Medicaid eligibility criteria, which are largely based on\nfamily income for children, differ by state, creating socioeconomically\ndistinct populations and leading to clustered data, where zip codes (our units\nof analysis) are nested within states. Second, Medicaid enrollees'\nindividual-level socioeconomic status, which is known to be a confounder and an\neffect modifier of the exposure-response relationships under study, is not\navailable. However, two useful surrogates are available: median household\nincome of each enrollee's zip code of residence and state-level Medicaid family\nincome eligibility thresholds for children. In this paper, we introduce a\ncustomized approach, called \\textit{MedMatch}, that builds on generalized\npropensity score matching methods for estimating causal ERFs, adapting these\napproaches to leverage our two surrogate variables to account for potential\nconfounding and/or effect modification by socioeconomic status. We conduct\nextensive simulation studies, consistently demonstrating the strong performance\nof \\textit{MedMatch} relative to conventional approaches to handling the\nsurrogate variables. We apply \\textit{MedMatch} to estimate the causal ERF\nbetween long-term PM$_{2.5}$ exposure and first respiratory hospitalization\namong children in Medicaid from 2000 to 2012. We find a positive association,\nwith a steeper curve at PM$_{2.5} \\le 8$ $\\mu$g/m$^3$ that levels off at higher\nconcentrations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:50:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lee","Jenny J.",""],["Wu","Xiao",""],["Dominici","Francesca",""],["Nethery","Rachel C.",""]]}
{"id":"2308.00813","submitter":"Jeonghyun Lee","authors":"Jeonghyun Lee, Vrinda Nandan, Harshvardhan Sikka, Spencer Rugaber,\n  Ashok Goal","title":"Designing a Communication Bridge between Communities: Participatory\n  Design for a Question-Answering AI Agent","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":"  How do we design an AI system that is intended to act as a communication\nbridge between two user communities with different mental models and\nvocabularies? Skillsync is an interactive environment that engages employers\n(companies) and training providers (colleges) in a sustained dialogue to help\nthem achieve the goal of building a training proposal that successfully meets\nthe needs of the employers and employees. We used a variation of participatory\ndesign to elicit requirements for developing AskJill, a question-answering\nagent that explains how Skillsync works and thus acts as a communication bridge\nbetween company and college users. Our study finds that participatory design\nwas useful in guiding the requirements gathering and eliciting user questions\nfor the development of AskJill. Our results also suggest that the two Skillsync\nuser communities perceived glossary assistance as a key feature that AskJill\nneeds to offer, and they would benefit from such a shared vocabulary.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:51:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lee","Jeonghyun",""],["Nandan","Vrinda",""],["Sikka","Harshvardhan",""],["Rugaber","Spencer",""],["Goal","Ashok",""]]}
{"id":"2308.00815","submitter":"Madeline Ward","authors":"Madeline A. Ward, Rob Deardon, Lorna E. Deeth","title":"A Framework for Incorporating Behavioural Change into Individual-Level\n  Spatial Epidemic Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During epidemics, people will often modify their behaviour patterns over time\nin response to changes in their perceived risk of spreading or contracting the\ndisease. This can substantially impact the trajectory of the epidemic. However,\nmost infectious disease models assume stable population behaviour due to the\nchallenges of modelling these changes. We present a flexible new class of\nmodels, called behavioural change individual-level models (BC-ILMs), that\nincorporate both individual-level covariate information and a data-driven\nbehavioural change effect. Focusing on spatial BC-ILMs, we consider four\n\"alarm\" functions to model the effect of behavioural change as a function of\ninfection prevalence over time. We show how these models can be estimated in a\nsimulation setting. We investigate the impact of misspecifying the alarm\nfunction when fitting a BC-ILM, and find that if behavioural change is present\nin a population, using an incorrect alarm function will still result in an\nimprovement in posterior predictive performance over a model that assumes\nstable population behaviour. We also find that using spike and slab priors on\nalarm function parameters is a simple and effective method to determine whether\na behavioural change effect is present in a population. Finally, we show\nresults from fitting spatial BC-ILMs to data from the 2001 U.K. foot and mouth\ndisease epidemic.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 19:56:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ward","Madeline A.",""],["Deardon","Rob",""],["Deeth","Lorna E.",""]]}
{"id":"2308.00816","submitter":"Thomas Weitz","authors":"Lisa S. Walter, Michael K\\\"uhn, Theresa Kammerbauer, James W.\n  Borchert, R. Thomas Weitz","title":"What can the activation energy tell about the energetics at grain\n  boundaries in polycrystalline organic films?","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":"  Charge-carrier transport at the semiconductor-gate dielectric interface in\norganic field-effect transistors is critically dependent on the degree of\ndisorder in the typically semi-crystalline semiconductor layer. Charge trapping\ncan occur at the interface as well as in the current-carrying semiconductor\nlayer itself. A detailed and systematic understanding of the role of grain\nboundaries between crystallites and how to avoid their potentially detrimental\neffects is still an important focus of research in the organic electronics\ncommunity. A typical macroscopic measurement technique to extract information\nabout the energetics of the grain boundaries is an activation energy\nmeasurement. Here, we compare detailed experiments on the energetic properties\nof monolayer thin films implemented in organic field-effect transistors, having\ncontrolled numbers of grain boundaries within the channel region to kinetic\nMonte-Carlo simulations of charge-carrier transport to elucidate the influence\nof grain boundaries on the extracted activation energies. Two important\nfindings are: 1) whereas the energy at the grain boundary does not change with\nthe number of grain boundaries in a thin film, both the measured and simulated\nactivation energy increases with the number of grain boundaries. 2) In\nsimulations where both energy barriers and valleys are present at the grain\nboundaries there is no systematic relation between the number of grain\nboundaries and extracted activation energies. We conclude, that a macroscopic\nmeasurement of the activation energy can serve as general quality indicator of\nthe thin film, but does not allow microscopic conclusions about the energy\nlandscape of the thin film.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:00:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Walter","Lisa S.",""],["K\u00fchn","Michael",""],["Kammerbauer","Theresa",""],["Borchert","James W.",""],["Weitz","R. Thomas",""]]}
{"id":"2308.00817","submitter":"Mark Loveland","authors":"Mark Loveland, Eirik Valseth, Jessica Meixner, Clint Dawson","title":"WAVEx: Stabilized Finite Elements for Spectral Wind Wave Models Using\n  FEniCSx","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several potential FEM discretizations of the Wave Action Balance Equation are\ndiscussed. The methods, which include streamline upwind Petrov-Galerkin (SUPG),\nleast squares, and discontinuous Galerkin, are implemented using the open\nsource finite element library FEniCSx for simplified 2-D cases. Open source\nfinite element libraries, such as FEniCSx, typically only support geometries up\nto dimension of 3. The Wave Action Balance Equation is 4 dimensions in space so\nthis presents difficulties. A method to use a FEM library, such as FEniCSx, to\nsolve problems in domains with dimension larger than 4 using the product basis\nis discussed. A new spectral wind wave model, WAVEx, is formulated and\nimplemented using the new finite element library FEniCSx. WAVEx is designed to\nallow for construction of multiple FEM discretizations with relatively small\nmodifications in the Python code base. An example implementation is then\ndemonstrated with WAVEx using continuous finite elements and SUPG stabilization\nin geographic/spectral space. For propagation in time, a generalized one step\nimplicit finite difference method is used. When source terms are active, the\nsecond order operator splitting scheme known as Strang splitting is used. In\nthe splitting scheme, propagation is solved using the aforementioned implicit\nmethod and the nonlinear source terms are treated explicitly using second order\nRunge-Kutta. Several test cases which are part of the Office for Naval Research\nTest Bed (ONR Test Bed) are demonstrated both with and without 3rd generation\nsource terms and results are compared to analytic solutions, observations, and\nSWAN output.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:05:27 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Loveland","Mark",""],["Valseth","Eirik",""],["Meixner","Jessica",""],["Dawson","Clint",""]]}
{"id":"2308.00818","submitter":"Gaurav Anand","authors":"Gaurav Anand, Samira Safaripour, Jaynie Tercovich, Jenna Capozzi, Mark\n  Griffin, Nathan Schin, Nicholas Mirra, and Craig Snoeyink","title":"A Simple Electrode Insulation and Channel Fabrication Technique for\n  High-Electric Field Microfluidics","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A simple and robust electrode insulation technique that can withstand a\nvoltage as high as $\\mathrm{1000~V}$, which is equivalent to an electric field\nstrength of $\\sim 1MV/m$ across a $\\mathrm{10~\\mu m}$ channel filled with an\nelectrolyte of conductivity $\\sim 0.1~S/m$, i.e., higher than sea water's\nconductivity, is introduced. A multi-dielectric layers approach is adopted to\nfabricate the blocked electrodes, which helps reduce the number of material\ndefects. Dielectric insulation with an exceptional breakdown electric field\nstrength for an electrolyte confined between electrodes can have a wide range\nof applications in microfluidics, like high electric field strength-based\ndielectrophoresis. The voltage-current characteristics are studied for various\nconcentrations of sodium chloride solution to estimate the insulation strength\nof the proposed materials, and the breakdown strength is calculated at the\npoint where the electrical insulation failed. A detailed adhesion technique is\nalso demonstrated, which will reduce the ambiguity around the fabrication of a\nsealed channel using SU-8.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:07:09 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Anand","Gaurav",""],["Safaripour","Samira",""],["Tercovich","Jaynie",""],["Capozzi","Jenna",""],["Griffin","Mark",""],["Schin","Nathan",""],["Mirra","Nicholas",""],["Snoeyink","Craig",""]]}
{"id":"2308.00819","submitter":"Rui Santos","authors":"Duarte Azevedo, Rodrigo Capucha, Pedro Chaves, Jo\\~ao Bravo Martins,\n  Ant\\'onio Onofre, Rui Santos","title":"Search for an invisible scalar in $t \\bar{t}$ final states at the LHC","comments":"15 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the current $t\\bar t$ experimental analysis to look for Dark Matter\n(DM) particles hidden in the final state. We present a phenomenological study\nwhere we successfully perform the reconstruction of a $t\\bar{t}$ system in the\npresence of a scalar mediator $Y_0$, that couples to both Standard Model (SM)\nand to DM particles. We use a \\texttt{MadGraph5\\_aMC@NLO} simplified DM model,\nwhere signal samples of $pp \\rightarrow t\\bar{t}Y_0$ are generated at the Large\nHadron Collider (LHC) with both Charge-Parity (CP) -even and CP-odd couplings\nof $Y_0$ to the top quarks. Different mass scales for the $Y_0$ mediator are\nconsidered, from the low mass region ($\\sim$ 0~GeV) to masses close to the\nHiggs boson mass (125~GeV). The dileptonic final states of the $t\\bar{t}$\nsystem were used in our analysis. The reconstruction of the $t\\bar{t}$ system\nis done with a kinematic fit, without reconstructing the mediator. All relevant\nSM backgrounds for the dileptonic $t\\bar{t}$ search at the LHC are considered.\nFurthermore, CP angular observables were used to probe the CP-nature of the\ncoupling between the mediator and top-quarks, which allowed to set confidence\nlevel (CL) limits for those Yukawa couplings as a function of the mediator\nmass.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:14:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Azevedo","Duarte",""],["Capucha","Rodrigo",""],["Chaves","Pedro",""],["Martins","Jo\u00e3o Bravo",""],["Onofre","Ant\u00f3nio",""],["Santos","Rui",""]]}
{"id":"2308.00820","submitter":"Cristina Sard\\'on","authors":"L. Blanco, F. Jim\\'enez Alburquerque, J. de Lucas, C. Sard\\'on","title":"Geometry preserving numerical methods for physical systems with\n  finite-dimensional Lie algebras","comments":"arXiv admin note: substantial text overlap with arXiv:2204.00046","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we propose a geometric integrator to numerically approximate\nthe flow of Lie systems. The highlight of this paper is to present a novel\nprocedure that integrates the system on a Lie group intrinsically associated to\nthe Lie system, and then generating the discrete solution of this Lie system\nthrough a given action of the Lie group on the manifold where the system\nevolves.\n  One major result from the integration on the Lie group is that one is able to\nsolve all automorphic Lie systems at the same time, and that they can be\nwritten as first-order systems of linear homogeneous ODEs in normal form. This\nbrings a lot of advantages, since solving a linear ODE involves less numerical\ncost. Specifically, we use two families of numerical schemes on the Lie group,\nwhich are designed to preserve its geometrical structure: the first one based\non the Magnus expansion, whereas the second is based on RKMK methods. Moreover,\nsince the aforementioned action relates the Lie group and the manifold where\nthe Lie system evolves, the resulting integrator preserves any geometric\nstructure of the latter. We compare both methods for Lie systems with geometric\ninvariants, particularly a class on Lie systems on curved spaces.\n  As already mentioned, the milestone of this paper is to show that the method\nwe propose preserves all the geometric invariants very faithfully, in\ncomparison with nongeometric numerical methods.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:17:48 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Blanco","L.",""],["Alburquerque","F. Jim\u00e9nez",""],["de Lucas","J.",""],["Sard\u00f3n","C.",""]]}
{"id":"2308.00821","submitter":"Michele Mugnaine","authors":"Ricardo L. Viana, Michele Mugnaine, Iber\\^e L. Caldas","title":"Hamiltonian description for magnetic field lines: a tutorial","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":"  Under certain circumstances, the equations for the magnetic field lines can\nbe recast in a canonical form, after defining a suitable field line\nHamiltonian. This analogy is extremely useful for dealing with a variety of\nproblems involving magnetically confined plasmas, like in tokamaks and other\ntoroidal devices, where there is usually one symmetric coordinate which plays\nthe role of time in the canonical equations. In this tutorial paper we review\nthe basics of the Hamiltonian description for magnetic field lines, emphasizing\nthe role of a variational principle and gauge invariance. We present\nrepresentative applications of the formalism, using cylindrical and magnetic\nflux coordinates in tokamak plasmas.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:19:20 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Viana","Ricardo L.",""],["Mugnaine","Michele",""],["Caldas","Iber\u00ea L.",""]]}
{"id":"2308.00822","submitter":"Christophe Gomez","authors":"Adel Messaoudi, R\\'egis Cottereau, Christophe Gomez","title":"Weak localization in radiative transfer of acoustic waves in a\n  randomly-fluctuating slab","comments":"7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper concerns the derivation of radiative transfer equations for\nacoustic waves propagating in a randomly fluctuating slab (between two parallel\nplanes) in the weak-scattering regime, and the study of boundary effects\nthrough an asymptotic analysis of the Wigner transform of the wave solution.\nThese radiative transfer equations allow to model the transport of wave energy\ndensity, taking into account the scattering by random heterogeneities. The\napproach builds on the method of images, where the slab is extended to a\nfull-space, with a periodic map of mechanical properties and a series of\nsources located along a periodic pattern. Two types of boundary effects, both\non the (small) scale of the wavelength, are observed: one at the boundaries of\nthe slab, and one inside the domain. The former impact the entire energy\ndensity (coherent as well as incoherent) and is also observed in half-spaces.\nThe latter, more specific to slabs, corresponds to the constructive\ninterference of waves that have reflected at least twice on the boundaries of\nthe slab and only impacts the coherent part of the energy density.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:20:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Messaoudi","Adel",""],["Cottereau","R\u00e9gis",""],["Gomez","Christophe",""]]}
{"id":"2308.00823","submitter":"Nelson Moll","authors":"Nelson Moll","title":"Speed of Weak Mixing for the Chacon Map","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We first consider a non-primitive substitution subshift that is conjugate to\nthe Chacon map. We then derive spectral estimates for a particular subshift and\nthe speed of weak mixing for a class of observables with certain regularity\nconditions. After, we use these results to find the speed of weak mixing for\nthe Chacon map on the interval and show that this bound is essentially sharp.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:20:53 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Moll","Nelson",""]]}
{"id":"2308.00824","submitter":"Michael Geyer","authors":"Brian Bell, Michael Geyer, David Glickenstein, Amanda Fernandez,\n  Juston Moore","title":"An Exact Kernel Equivalence for Finite Classification Models","comments":"TAG-ML at ICML 2023 in Proceedings. 8 pages, 6 figures, proofs in\n  Appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the equivalence between neural networks and kernel methods by\nderiving the first exact representation of any finite-size parametric\nclassification model trained with gradient descent as a kernel machine. We\ncompare our exact representation to the well-known Neural Tangent Kernel (NTK)\nand discuss approximation error relative to the NTK and other non-exact path\nkernel formulations. We experimentally demonstrate that the kernel can be\ncomputed for realistic networks up to machine precision. We use this exact\nkernel to show that our theoretical contribution can provide useful insights\ninto the predictions made by neural networks, particularly the way in which\nthey generalize.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:22:53 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 22:47:33 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 16:25:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bell","Brian",""],["Geyer","Michael",""],["Glickenstein","David",""],["Fernandez","Amanda",""],["Moore","Juston",""]]}
{"id":"2308.00825","submitter":"David Dai","authors":"David D. Dai and Liang Fu","title":"Strong-coupling phases of trions and excitons in electron-hole bilayers\n  at commensurate densities","comments":"Corrected typos, added references, reformatted supplementary\n  materials","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 introduce density imbalanced electron-hole bilayers at a commensurate 2 :\n1 density ratio as a platform for realizing novel phases involving electrons,\nexcitons and trions. Three length scales are identified which characterize the\ninterplay between kinetic energy, intralayer repulsion, and interlayer\nattraction. By a combination of theoretical analysis and numerical calculation,\nwe find a variety of strong-coupling phases in different parameter regions,\nincluding quantum crystals of electrons, excitons, and trions. We also propose\nan \"excitonic supersolid\" phase that features electron crystallization and\nexciton superfluidity simultaneously. The material realization and experimental\nsignature of these phases are discussed in the context of semiconductor\ntransition metal dichalcogenide bilayers.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:24:00 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 23:04:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dai","David D.",""],["Fu","Liang",""]]}
{"id":"2308.00826","submitter":"John Salzer","authors":"John J. Salzer, David J. Carr, Jennifer Sieben, Samantha W. Brunker\n  and Alec S. Hirschauer","title":"The Star Formation Across Cosmic Time (SFACT) Survey. I. Survey\n  Description and Early Results from a New Narrow-Band Emission-Line Galaxy\n  Survey","comments":"27 pages, 13 figures. Accepted for publication in the Astronomical\n  Journal","journal-ref":null,"doi":"10.3847/1538-3881/ace443","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce the Star Formation Across Cosmic Time (SFACT) survey. SFACT is a\nnew narrow-band survey for emission-line galaxies (ELGs) and QSOs being carried\nout using the wide-field imager on the WIYN 3.5 m telescope. Because of the\nsuperior depth and excellent image quality afforded by WIYN, we routinely\ndetect ELGs to r = 25.0. Our survey observations are made using three custom\nnarrow-band filters centered on 6590 A, 6950 A, and 7460 A. Due to the\nsensitivity of the survey, we are able to simultaneously detect sources via a\nnumber of different emission lines over a wide range of redshifts. The\nprincipal lines detected in SFACT are H-alpha (redshifts up to 0.144), [O\nIII]5007 (redshifts up to 0.500) and [O II]3727 (redshifts up to 1.015). In\nthis paper we detail the properties of the survey as well as present initial\nresults obtained by analyzing our three pilot-study fields. These fields have\nyielded a total of 533 ELG candidates in an area of 1.50 square degrees\n(surface density of 355 ELGs per square degree). Follow-up spectra for a subset\nof the ELG candidates are also presented. One of the key attributes of the\nSFACT survey is that the ELGs are detected in discrete redshift windows that\nwill allow us to robustly quantify the properties of the star-forming and AGN\npopulations as a function of redshift to z = 1 and beyond. The planned\nacquisition of additional narrow-band filters will allow us to expand our\nsurvey to substantially higher redshifts.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:25:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Salzer","John J.",""],["Carr","David J.",""],["Sieben","Jennifer",""],["Brunker","Samantha W.",""],["Hirschauer","Alec S.",""]]}
{"id":"2308.00827","submitter":"Thomas Weitz","authors":"Anna M. Seiler, Martin Statz, Isabell Weimer, Nils Jacobsen, Kenji\n  Watanabe, Takashi Taniguchi, Zhiyu Dong, Leonid S. Levitov, R. Thomas Weitz","title":"Interaction-driven (quasi-) insulating ground states of gapped\n  electron-doped bilayer graphene","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":"  Bernal bilayer graphene has recently been discovered to exhibit a wide range\nof unique ordered phases resulting from interaction-driven effects and\nencompassing spin and valley magnetism, correlated insulators, correlated\nmetals, and superconductivity. This letter reports on a novel family of\ncorrelated phases characterized by spin and valley ordering, observed in\nelectron-doped bilayer graphene. The novel correlated phases demonstrate an\nintriguing non-linear current-bias behavior at ultralow currents that is\nsensitive to the onset of the phases and is accompanied by an insulating\ntemperature dependence, providing strong evidence for the presence of\nunconventional charge carrying degrees of freedom originating from ordering.\nThese characteristics cannot be solely attributed to any of the previously\nreported phases, and are qualitatively different from the behavior seen\npreviously on the hole-doped side. Instead, our observations align with the\npresence of charge- or spin-density-waves state that open a gap on a portion of\nthe Fermi surface or fully gapped Wigner crystals. The resulting new phases,\nquasi-insulators in which part of the Fermi surface remains intact or\nvalley-polarized and valley-unpolarized Wigner crystals, coexist with\npreviously known Stoner phases, resulting in an exceptionally intricate phase\ndiagram.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:26:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Seiler","Anna M.",""],["Statz","Martin",""],["Weimer","Isabell",""],["Jacobsen","Nils",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Dong","Zhiyu",""],["Levitov","Leonid S.",""],["Weitz","R. Thomas",""]]}
{"id":"2308.00828","submitter":"Sizhe Guan","authors":"Sizhe Guan, Haolan Liu, Hamid R. Pourreza, and Hamidreza Mahyar","title":"Deep Learning Approaches in Pavement Distress Identification: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a comprehensive review of recent advancements in image\nprocessing and deep learning techniques for pavement distress detection and\nclassification, a critical aspect in modern pavement management systems. The\nconventional manual inspection process conducted by human experts is gradually\nbeing superseded by automated solutions, leveraging machine learning and deep\nlearning algorithms to enhance efficiency and accuracy. The ability of these\nalgorithms to discern patterns and make predictions based on extensive datasets\nhas revolutionized the domain of pavement distress identification. The paper\ninvestigates the integration of unmanned aerial vehicles (UAVs) for data\ncollection, offering unique advantages such as aerial perspectives and\nefficient coverage of large areas. By capturing high-resolution images, UAVs\nprovide valuable data that can be processed using deep learning algorithms to\ndetect and classify various pavement distresses effectively. While the primary\nfocus is on 2D image processing, the paper also acknowledges the challenges\nassociated with 3D images, such as sensor limitations and computational\nrequirements. Understanding these challenges is crucial for further\nadvancements in the field. The findings of this review significantly contribute\nto the evolution of pavement distress detection, fostering the development of\nefficient pavement management systems. As automated approaches continue to\nmature, the implementation of deep learning techniques holds great promise in\nensuring safer and more durable road infrastructure for the benefit of society.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:30:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Guan","Sizhe",""],["Liu","Haolan",""],["Pourreza","Hamid R.",""],["Mahyar","Hamidreza",""]]}
{"id":"2308.00829","submitter":"Teodor Bucht","authors":"Teodor Bucht and Jacob S. Christiansen","title":"A geometric approach to approximating the limit set of eigenvalues for\n  banded Toeplitz matrices","comments":"20 pages, 8 figures. Submitted to SIAM Journal on Matrix Analysis and\n  Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article is about finding the limit set for banded Toeplitz matrices. Our\nmain result is a new approach to approximate the limit set $\\Lambda(b)$ where\n$b$ is the symbol of the banded Toeplitz matrix. The new approach is\ngeometrical and based on the formula $\\Lambda(b) = \\cap_{\\rho \\in (0, \\infty)}\n\\text{sp } T(b_\\rho)$. We show that the full intersection can be approximated\nby the intersection for a finite number of $\\rho$'s, and that the intersection\nof polygon approximations for $\\text{sp } T(b_\\rho)$ yields an approximating\npolygon for $\\Lambda(b)$ that converges to $\\Lambda(b)$ in the Hausdorff\nmetric. Further, we show that one can slightly expand the polygon\napproximations for $\\text{sp } T(b_\\rho)$ to ensure that they contain $\\text{sp\n} T(b_\\rho)$. Then, taking the intersection yields an approximating superset of\n$\\Lambda(b)$ which converges to $\\Lambda(b)$ in the Hausdorff metric, and is\nguaranteed to contain $\\Lambda(b)$. We implement the algorithm in Python and\ntest it. It performs on par to and better in some cases than existing\nalgorithms. We argue, but do not prove, that the average time complexity of the\nalgorithm is $O(n^2 + mn\\log m)$, where $n$ is the number of $\\rho$'s and $m$\nis the number of vertices for the polygons approximating $\\text{sp }\nT(b_\\rho)$. Further, we argue that the distance from $\\Lambda(b)$ to both the\napproximating polygon and the approximating superset decreases as\n$O(1/\\sqrt{k})$ for most of $\\Lambda(b)$, where $k$ is the number of elementary\noperations required by the algorithm.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:39:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bucht","Teodor",""],["Christiansen","Jacob S.",""]]}
{"id":"2308.00830","submitter":"Nicole Drakos","authors":"Nicole E. Drakos, James E. Taylor, Andrew J. Benson","title":"Do assumptions about the central density of subhaloes affect dark matter\n  annihilation and lensing calculations?","comments":"15 pages, 13 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":"  A growing body of evidence suggests that the central density of cuspy dark\nmatter subhaloes is conserved in minor mergers. However, empirical models of\nsubhalo evolution, calibrated from simulations, often assume a drop in the\ncentral density. Since empirical models of subhaloes are used in galaxy-galaxy\nlensing studies and dark matter annihilation calculations, we explore the\nconsequences of assuming different subhalo models. We find that dark matter\nannihilation calculations are very sensitive to the assumed subhalo mass\nprofile, and different models can give more than a magnitude difference in the\nJ-factor and boost factor in individual haloes. On the other hand, the shear\nand convergence profiles used in galaxy-galaxy lensing are sensitive to the\ninitial profile assumed (e.g., NFW versus Einato) but are otherwise\nwell-approximated by a simple model in which the original profile is sharply\ntruncated. We conclude that since the innermost parts of haloes are difficult\nto resolve in simulations, it is important to have a theoretical understanding\nof how subhaloes evolve to make accurate predictions of the dark matter\nannihilation signal.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:40:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Drakos","Nicole E.",""],["Taylor","James E.",""],["Benson","Andrew J.",""]]}
{"id":"2308.00831","submitter":"Mauro Paternostro","authors":"Jessica Barr, Giorgio Zicari, Alessandro Ferraro, Mauro Paternostro","title":"Spectral Density Classification For Environment Spectroscopy","comments":"11+epsilon pages, 7 figures, RevTeX4-2","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectral densities encode the relevant information characterising the\nsystem-environment interaction in an open-quantum system problem. Such\ninformation is key to determining the system's dynamics. In this work, we\nleverage the potential of machine learning techniques to reconstruct the\nfeatures of the environment. Specifically, we show that the time evolution of a\nsystem observable can be used by an artificial neural network to infer the main\nfeatures of the spectral density. In particular, for relevant example of\nspin-boson models, we can classify with high accuracy the Ohmicity parameter of\nthe environment as either Ohmic, sub-Ohmic or super-Ohmic, thereby\ndistinguishing between different forms of dissipation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:42:59 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Barr","Jessica",""],["Zicari","Giorgio",""],["Ferraro","Alessandro",""],["Paternostro","Mauro",""]]}
{"id":"2308.00832","submitter":"Agniva Roychowdhury","authors":"Agniva Roychowdhury, Eileen T. Meyer","title":"CAgNVAS I. A new generation DIFMAP for Modelfitting Interferometric Data\n  and Estimating Variances, Biases and Correlations","comments":"26 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the program `Catalogue of proper motions in extragalactic jets\nfrom Active galactic Nuclei with Very large Array Studies' or CAgNVAS, with the\nobjective of using archival and new VLA observations to measure proper motions\nof jet components beyond hundred parsecs. This objective requires extremely\nhigh accuracy in component localization. Interferometric datasets are noisy and\noften lack optimal coverage of the visibility plane, making interpretation of\nsubtleties in deconvolved imaging inaccurate. Fitting models to complex\nvisibilities, rather than working in the imaging plane, is generally preferred\nas a solution when one needs the most accurate description of the true source\nstructure. In this paper, we present a new generation version of\n$\\texttt{DIFMAP}$ (\\texttt{ngDIFMAP}) to model and fit interferometric closure\nquantities developed for the CAgNVAS program. \\texttt{ngDIFMAP} uses a global\noptimization algorithm based on simulated annealing, which results in more\naccurate parameter estimation especially when the number of parameters is high.\nUsing this package we demonstrate the ramifications of amplitude and phase\nerrors, as well as loss of $u-v$ coverage, on parameters estimated from\nvisibility data. The package can be used to accurately predict variance, bias,\nand correlations between parameters. Our results demonstrate the limits on\ninformation recovery from noisy interferometric data, with a particular focus\non the accurate reporting of errors on measured quantities.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:43:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Roychowdhury","Agniva",""],["Meyer","Eileen T.",""]]}
{"id":"2308.00834","submitter":"Thomas Hazard","authors":"Thomas M. Hazard, Wayne Woods, Danna Rosenberg, Rabi Das, Cyrus F.\n  Hirjibehedin, David K. Kim, Jeffery Knecht, Justin Mallek, Alexander\n  Melville, Bethany M. Niedzielski, Kyle Serniak, Katrina M. Sliwa, Donna\n  Ruth-Yost, Jonilyn L. Yoder, William D. Oliver, Mollie E. Schwartz","title":"Characterization of superconducting through-silicon vias as capacitive\n  elements in 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 large physical size of superconducting qubits and their associated\non-chip control structures presents a practical challenge towards building a\nlarge-scale quantum computer. In particular, transmons require a\nhigh-quality-factor shunting capacitance that is typically achieved by using a\nlarge coplanar capacitor. Other components, such as superconducting microwave\nresonators used for qubit state readout, are typically constructed from\ncoplanar waveguides which are millimeters in length. Here we use compact\nsuperconducting through-silicon vias to realize lumped element capacitors in\nboth qubits and readout resonators to significantly reduce the on-chip\nfootprint of both of these circuit elements. We measure two types of devices to\nshow that TSVs are of sufficient quality to be used as capacitive circuit\nelements and provide a significant reductions in size over existing approaches.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:49:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hazard","Thomas M.",""],["Woods","Wayne",""],["Rosenberg","Danna",""],["Das","Rabi",""],["Hirjibehedin","Cyrus F.",""],["Kim","David K.",""],["Knecht","Jeffery",""],["Mallek","Justin",""],["Melville","Alexander",""],["Niedzielski","Bethany M.",""],["Serniak","Kyle",""],["Sliwa","Katrina M.",""],["Ruth-Yost","Donna",""],["Yoder","Jonilyn L.",""],["Oliver","William D.",""],["Schwartz","Mollie E.",""]]}
{"id":"2308.00835","submitter":"Henrik Winther","authors":"Keegan J. Flood, Mauro Mantegazza, Henrik Winther","title":"Symbols in Noncommutative Geometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we prove that the classical Lie bracket of vector fields can be\ngeneralized to the noncommutative setting by antisymmetrizing (in a suitable\nnoncommutative sense) their compositions. To accomplish this, we study linear\ndifferential operators on modules over a unital associative algebra equipped\nwith an exterior algebra. We provide necessary and sufficient conditions for\njet modules to be representing objects for differential operators, which is, a\npriori, a key desideratum for any theory of noncommutative differential\ngeometry. Further, we construct natural symbol maps, which play a crucial\nr\\^ole in the construction of the aforementioned Lie bracket.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 20:52:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Flood","Keegan J.",""],["Mantegazza","Mauro",""],["Winther","Henrik",""]]}
{"id":"2308.00836","submitter":"Shurong Lin","authors":"Shurong Lin, Elliot Paquette, Eric D. Kolaczyk","title":"Differentially Private Linear Regression with Linked Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There has been increasing demand for establishing privacy-preserving\nmethodologies for modern statistics and machine learning. Differential privacy,\na mathematical notion from computer science, is a rising tool offering robust\nprivacy guarantees. Recent work focuses primarily on developing differentially\nprivate versions of individual statistical and machine learning tasks, with\nnontrivial upstream pre-processing typically not incorporated. An important\nexample is when record linkage is done prior to downstream modeling. Record\nlinkage refers to the statistical task of linking two or more data sets of the\nsame group of entities without a unique identifier. This probabilistic\nprocedure brings additional uncertainty to the subsequent task. In this paper,\nwe present two differentially private algorithms for linear regression with\nlinked data. In particular, we propose a noisy gradient method and a sufficient\nstatistics perturbation approach for the estimation of regression coefficients.\nWe investigate the privacy-accuracy tradeoff by providing finite-sample error\nbounds for the estimators, which allows us to understand the relative\ncontributions of linkage error, estimation error, and the cost of privacy. The\nvariances of the estimators are also discussed. We demonstrate the performance\nof the proposed algorithms through simulations and an application to synthetic\ndata.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:00:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lin","Shurong",""],["Paquette","Elliot",""],["Kolaczyk","Eric D.",""]]}
{"id":"2308.00837","submitter":"Philippe Spalart","authors":"Philippe Spalart","title":"An Old-Fashioned Framework for Machine Learning in Turbulence Modeling","comments":"27 pages, 3 figures","journal-ref":"ERCOFTAC Bulletin 134, March 2023","doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The objective is to provide clear and well-motivated guidance to Machine\nLearning (ML) teams, founded on our experience in empirical turbulence\nmodeling. Guidance is also needed for modeling outside ML. ML is not yet\nsuccessful in turbulence modeling, and many papers have produced unusable\nproposals either due to errors in math or physics, or to severe overfitting. We\nbelieve that \"Turbulence Culture\" (TC) takes years to learn and is difficult to\nconvey especially considering the modern lack of time for careful study;\nimportant facts which are self-evident after a career in turbulence research\nand modeling and extensive reading are easy to miss. In addition, many of them\nare not absolute facts, a consequence of the gaps in our understanding of\nturbulence and the weak connection of models to first principles. Some of the\nmathematical facts are rigorous, but the physical aspects often are not.\nTurbulence models are surprisingly arbitrary. Disagreement between experts\nconfuses the new entrants. In addition, several key properties of the models\nare ascertained through non-trivial analytical properties of the differential\nequations, which puts them out of reach of purely data-driven ML-type\napproaches. The best example is the crucial behavior of the model at the edge\nof the turbulent region (ETR). The knowledge we wish to put out here may be\ndivided into \"Mission\" and \"Requirements,\" each combining physics and\nmathematics. Clear lists of \"Hard\" and \"Soft\" constraints are presented. A\nconcrete example of how DNS data could be used, possibly allied with ML, is\nfirst carried through and illustrates the large number of decisions needed. Our\nfocus is on creating effective products which will empower CFD, rather than on\npublications.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:02:26 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Spalart","Philippe",""]]}
{"id":"2308.00838","submitter":"Ilya Eremin","authors":"Pascal Derendorf, Anatoly F. Volkov, and Ilya M. Eremin","title":"Nonlinear Response of Diffusive Superconductors to $ac$-electromagnetic\n  Fields","comments":"16 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":"  Motivated by the recent experimental progress in studying conventional and\nunconventional superconductors in a pump-probe setup, we perform a\ncomprehensive theoretical analysis of the nonlinear response of a diffusive BCS\nconventional superconductor to the action of an alternating electromagnetic\nfield using a generalized Usadel equation. We analyze the response up to the\nsecond order of the perturbation in the amplitude of the vector potential\n$\\vec{A}$, the superconducting order parameter $\\Delta$ and in the third order\nfor the current $\\vec{j}$. On the basis of this approach, we derive general\nexpressions for the retarded (advanced) Green's functions, as well as the\nKeldysh function for an arbitrary number of harmonics of the incident field.\nMost importantly, we analyze the set of physical observables in a\nnon-equilibrium superconductor, such as frequency and the temperature\ndependencies of the zero harmonic $\\delta( \\Delta)_0$ (Eliashberg effect), the\nsecond harmonic $\\delta( \\Delta)_{2\\Omega}$, as well as the third harmonic for\nthe electric current $j(3\\Omega)$ under the action of a monochromatic\nirradiation. For the same set of parameters, we also analyze the behavior of\nthe reflectivity and the down-conversion intensity of a thin superconducting\nfilm, discussed recently in the context of parametric amplification of\nsuperconductivity. We derive these quantities microscopically and show the\nconnection of the down-conversion intensity to the third harmonic generation\ncurrents induced by the amplitude mode and the direct action of the electric\nfield on the charge carriers.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:04:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Derendorf","Pascal",""],["Volkov","Anatoly F.",""],["Eremin","Ilya M.",""]]}
{"id":"2308.00839","submitter":"Valentina Brosco","authors":"Valentina Brosco, Giuseppe Serpico, Valerii Vinokur, Nicola Poccia,\n  Uri Vool","title":"Superconducting qubit based on twisted cuprate van der Waals\n  heterostructures","comments":"6+5 pages, 4+4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Van-der-Waals (vdW) assembly enables the fabrication of novel Josephson\njunctions utilizing an atomically sharp interface between two exfoliated and\nrelatively twisted $\\rm{Bi_2Sr_2CaCu_2O_{8+x}}$ (Bi2212) flakes. In a range of\ntwist angles around $45^\\circ$, the junction provides a regime where the\ninterlayer two-Cooper pair tunneling dominates the current-phase relation. Here\nwe propose to employ this novel junction to realize a capacitively shunted\nqubit that we call flowermon. The $d$-wave nature of the order parameter endows\nthe flowermon with inherent protection against charge-noise-induced relaxation\nand quasiparticle-induced dissipation. This inherently protected qubit paves\nthe way to a new class of high-coherence hybrid superconducting quantum devices\nbased on unconventional superconductors.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:07:11 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 06:16:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Brosco","Valentina",""],["Serpico","Giuseppe",""],["Vinokur","Valerii",""],["Poccia","Nicola",""],["Vool","Uri",""]]}
{"id":"2308.00840","submitter":"Sariel Har-Peled","authors":"Sariel Har-Peled","title":"Approximately: Independence Implies Vertex Cover","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DS","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  $\\newcommand{\\eps}{\\varepsilon}$\n  We observe that a $(1-\\eps)$-approximation algorithm to Independent Set, that\nworks for any induced subgraph of the input graph, can be used, via a\npolynomial time reduction, to provide a $(1+\\eps)$-approximation to Vertex\nCover. This basic observation was made before, see [BHR11].\n  As a consequence, we get a PTAS for VC for unweighted pseudo-disks, QQPTAS\nfor VC for unweighted axis-aligned rectangles in the plane, and QPTAS for MWVC\nfor weighted polygons in the plane. To the best of our knowledge all these\nresults are new.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:07:51 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 16:04:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Har-Peled","Sariel",""]]}
{"id":"2308.00841","submitter":"Eric R. Bittner","authors":"Eric R Bittner and Hao Li and Syad A. Shah and Carlos Silva and Andrei\n  Piryatinski","title":"Correlated noise enhances coherence and fidelity in coupled qubits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is generally assumed that environmental noise arising from thermal\nfluctuations is detrimental to preserving coherence and entanglement in a\nquantum system. In the simplest sense, dephasing and decoherence are tied to\nenergy fluctuations driven by coupling between the system and the normal modes\nof the bath. Here, we explore the role of noise correlation in an open-loop\nmodel quantum communication system whereby the ``sender'' and the ``receiver''\nare subject to local environments with various degrees of correlation or\nanticorrelation. We introduce correlation within the spectral density by\nsolving a multidimensional stochastic differential equations and introduce\nthese into the Redfield equations of motion for the system density matrix. We\nfind that correlation can enhance both the fidelity and purity of a maximally\nentangled (Bell) state. Moreover, by comparing the evolution of different\ninitial Bell states, we show that one can effectively probe the correlation\nbetween two local environments. These observations may be useful in the design\nof high-fidelity quantum gates and communication protocols.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:13:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bittner","Eric R",""],["Li","Hao",""],["Shah","Syad A.",""],["Silva","Carlos",""],["Piryatinski","Andrei",""]]}
{"id":"2308.00842","submitter":"Agniva Roychowdhury","authors":"Agniva Roychowdhury, Eileen T. Meyer, Markos Georganopoulos, Kassidy\n  Kollmann","title":"CAgNVAS II. Proper Motions in the sub-kiloparsec Jet of 3C 78: Novel\n  Constraints on the Physical Nature of Relativistic Jets","comments":"18 pages, 14 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":"  Jets from active galactic nuclei are thought to play a role in the evolution\nof their host and local environments, but a detailed prescription is limited by\nthe understanding of the jets themselves. Proper motion studies of compact\nbright components in radio jets can be used to produce model-independent\nconstraints on their Lorentz factor, necessary to understand the quantity of\nenergy deposited in the inter-galactic medium. We present our initial work on\nthe jet of radio-galaxy 3C~78, as part of CAgNVAS (Catalogue of proper motions\nin Active galactic Nuclei using Very Large Array Studies), with a goal of\nconstraining nature of jet plasma on larger ($>100$ parsec) scales. In 3C~78 we\nfind three prominent knots (A, B and C), where knot B undergoes subluminal\nlongitudinal motion ($\\sim0.6c$ at $\\sim$ 200 pc), while knot C undergoes\nextreme (apparent) backward motion and eventual forward motion ($\\sim-2.6c$,\n$0.5c$, at $\\sim$ 300 pc). Assuming knots are shocks, we infer the bulk speeds\nfrom the pattern motion of Knots B and C. We model the spectral energy\ndistribution (SED) of the large-scale jet and observe that a physically\nmotivated two-zone model can explain most of the observed emission. We also\nfind that the jet profile remains approximately conical from parsec to\nkiloparsec scales. Using the parsec-scale speed from VLBI studies ($\\sim0.1c$)\nand the derived bulk speeds, we find that the jet undergoes bulk acceleration\nbetween the parsec and the kiloparsec scales providing the first direct\nevidence of jet acceleration in a conical and matter-dominated jet.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:13:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Roychowdhury","Agniva",""],["Meyer","Eileen T.",""],["Georganopoulos","Markos",""],["Kollmann","Kassidy",""]]}
{"id":"2308.00843","submitter":"Renato Cordeiro de Amorim","authors":"Renato Cordeiro de Amorim","title":"A complete taxonomy of finite sum-free sets of maximum cardinality\n  containing positive integers","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 paper, we are interested in finite sum-free sets of maximum\ncardinality containing positive integers. That is, sum-free subsets of $[1,n]$\nwith cardinality $\\lfloor \\frac{n+1}{2}\\rfloor$. Here, we augment a previously\nknown taxonomy describing these sets by identifying all of its possible\nexceptions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:15:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["de Amorim","Renato Cordeiro",""]]}
{"id":"2308.00844","submitter":"Chad Briddon","authors":"Chad Briddon, Clare Burrage, Adam Moss, and Andrius Tamosiunas","title":"Using machine learning to optimise chameleon fifth force experiments","comments":"28 pages, 17 figures, The SELCIE code is available at:\n  https://github.com/C-Briddon/SELCIE","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The chameleon is a theorised scalar field that couples to matter and possess\na screening mechanism, which weakens observational constraints from experiments\nperformed in regions of higher matter density. One consequence of this\nscreening mechanism is that the force induced by the field is dependent on the\nshape of the source mass (a property that distinguishes it from gravity).\nTherefore an optimal shape must exist for which the chameleon force is\nmaximised. Such a shape would allow experiments to improve their sensitivity by\nsimply changing the shape of the source mass. In this work we use a combination\nof genetic algorithms and the chameleon solving software SELCIE to find shapes\nthat optimise the force at a single point in an idealised experimental\nenvironment. We note that the method we used is easily customised, and so could\nbe used to optimise a more realistic experiment involving particle trajectories\nor the force acting on an extended body. We find the shapes outputted by the\ngenetic algorithm possess common characteristics, such as a preference for\nsmaller source masses, and that the largest fifth forces are produced by small\n`umbrella'-like shapes with a thickness such that the source is unscreened but\nthe field reaches its minimum inside the source. This remains the optimal shape\neven as we change the chameleon potential, and the distance from the source,\nand across a wide range of chameleon parameters. We find that by optimising the\nshape in this way the fifth force can be increased by $2.45$ times when\ncompared to a sphere, centred at the origin, of the same volume and mass.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:18:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Briddon","Chad",""],["Burrage","Clare",""],["Moss","Adam",""],["Tamosiunas","Andrius",""]]}
{"id":"2308.00845","submitter":"Michael Yatauro","authors":"Michael Yatauro","title":"Component order edge connectivity, vertex degrees, and integer\n  partitions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a finite, simple graph $G$, the $k$-component order edge connectivity\nof $G$ is the minimum number of edges whose removal results in a subgraph for\nwhich every component has order at most $k-1$. In general, determining the\n$k$-component order edge connectivity of a graph is NP-hard. We determine\nconditions on the vertex degrees of $G$ that can be used to imply a lower bound\non the $k$-component order edge connectivity of $G$. We will discuss the\nprocess for generating such conditions for a lower bound of 1 or 2, and we\nexplore how the complexity increases when the desired lower bound is 3 or more.\nIn the process, we prove some related results about integer partitions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:19:01 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 15:01:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yatauro","Michael",""]]}
{"id":"2308.00846","submitter":"Minsoo Rhu","authors":"Bongjoon Hyun, Taehun Kim, Dongjae Lee, Minsoo Rhu","title":"Pathfinding Future PIM Architectures by Demystifying a Commercial PIM\n  Technology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Processing-in-memory (PIM) has been explored for decades by computer\narchitects, yet it has never seen the light of day in real-world products due\nto their high design overheads and lack of a killer application. With the\nadvent of critical memory-intensive workloads, several commercial PIM\ntechnologies have been introduced to the market ranging from domain-specific\nPIM architectures to more general-purpose PIM architectures. In this work, we\ndeepdive into UPMEM's commercial PIM technology, a general-purpose PIM-enabled\nparallel architecture that is highly programmable. Our first key contribution\nis the development of a flexible simulation framework for PIM. The simulator we\ndeveloped (aka PIMulator) enables the compilation of UPMEM-PIM source codes\ninto its compiled machine-level instructions, which are subsequently consumed\nby our cycle-level performance simulator. Using PIMulator, we demystify UPMEM's\nPIM design through a detailed characterization study. Building on top of our\ncharacterization, we conduct a series of case studies to pathfind important\narchitectural features that we deem will be critical for future PIM\narchitectures to support\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:23:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hyun","Bongjoon",""],["Kim","Taehun",""],["Lee","Dongjae",""],["Rhu","Minsoo",""]]}
{"id":"2308.00847","submitter":"Juraj Szavits Nossan","authors":"Luca Ciandrini, Richmond L. Crisostomo and Juraj Szavits-Nossan","title":"TASEPy: a Python-based package to iteratively solve the inhomogeneous\n  exclusion process","comments":"20 pages, 6 figures, submission to SciPost, minor changes to Section\n  3 in v2","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The totally asymmetric simple exclusion process (TASEP) is a paradigmatic\nlattice model for one-dimensional particle transport subject to excluded-volume\ninteractions. Solving the inhomogeneous TASEP in which particles' hopping rates\nvary across the lattice is a long-standing problem. In recent years, a power\nseries approximation (PSA) has been developed to tackle this problem, however\nno computer algorithm currently exists that implements this approximation. This\npaper addresses this issue by providing a Python-based package TASEPy that\nfinds the steady state solution of the inhomogeneous TASEP for any set of\nhopping rates using the PSA truncated at a user-defined order.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:24:49 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 10:20:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ciandrini","Luca",""],["Crisostomo","Richmond L.",""],["Szavits-Nossan","Juraj",""]]}
{"id":"2308.00848","submitter":"Carlos Barbero Rodriguez","authors":"Carlos Barbero Rodriguez","title":"Room-temperature solid-state masers as low-noise amplifiers to\n  facilitate deep-space missions using small spacecraft","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An increasing number of small ventures are launching missions to space with\nsmall volume satellite platforms. These small spacecraft are now being\nseriously considered for deep-space missions, creating a need for ground\nstations capable of detecting the faint signals they will transmit to Earth.\nHere, recent developments in room-temperature solid-state masers are reviewed\nto determine their readiness for use as a cheap low-noise amplifier for\ndeep-space communications. Masers based on Pentacene-doped Para-terphenyl\n(Pc:PTP), Pentacene-doped Picene, Diazapentacene-doped Para-Terphenyl\n(DAP:PTP), Phenazine/1,2,4,5-Tetracyanobenzene (PNZ/TCNB) co-crystal, NV\nDiamond, Cuprous Oxide, and Silicon Carbide are considered for comparison.\nPc:PTP offers good spin polarisation density and output power but suffers from\nthermal dissipation problems, DAP:PTP may help to obtain a lower threshold\npower than that achieved with Pentacene, PNZ/TCNB stands out in spin\npolarization density but has not achieved room-temperature masing, and NV\nDiamond is the only medium to have sustained continuous operation but has very\nlimited power output. The other gain media proposed offer theoretical\nadvantages but have not been tested in a working maser device.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:28:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rodriguez","Carlos Barbero",""]]}
{"id":"2308.00850","submitter":"Lubomira Dvorakova","authors":"Lubom\\'ira Dvo\\v{r}\\'akov\\'a, Veronika Hendrychov\\'a","title":"String attractors of Rote sequences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we describe minimal string attractors (of size two) of\npseudopalindromic prefixes of standard complementary-symmetric Rote sequences.\nSuch a class of Rote sequences forms a subclass of binary generalized\npseudostandard sequences, i.e., of sequences obtained when iterating\npalindromic and antipalindromic closures. When iterating only palindromic\nclosure, palindromic prefixes of standard Sturmian sequences are obtained and\ntheir string attractors are of size two. However, already when iterating only\nantipalindromic closure, antipalindromic prefixes of binary pseudostandard\nsequences are obtained and we prove that the minimal string attractors are of\nsize three in this case. We conjecture that the pseudopalindromic prefixes of\nany binary generalized pseudostandard sequence have a minimal string attractor\nof size at most four.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:31:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dvo\u0159\u00e1kov\u00e1","Lubom\u00edra",""],["Hendrychov\u00e1","Veronika",""]]}
{"id":"2308.00851","submitter":"Philip Holloway","authors":"Philip Holloway, Aprajita Verma, Philip J. Marshall, Anupreeta More,\n  Matthias Tecza","title":"On the detectability of strong lensing in near-infrared surveys","comments":"14 pages, 9 figures, accepted for publication by MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2371","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present new lensing frequency estimates for existing and forthcoming deep\nnear-infrared surveys, including those from JWST and VISTA. The estimates are\nbased on the JAdes extraGalactic Ultradeep Artificial Realisations (JAGUAR)\ngalaxy catalogue accounting for the full photometry and morphologies for each\ngalaxy. Due to the limited area of the JAGUAR simulations, they are less suited\nto wide-area surveys, however we also present extrapolations to the surveys\ncarried out by Euclid and the Nancy Grace Roman Space Telescope. The\nmethodology does not make assumptions on the nature of the lens itself and\nprobes a wide range of lens masses. The lenses and sources are selected from\nthe same catalogue and extend the analysis from the visible bands into the\nnear-infrared. After generating realistic simulated lensed sources and\nselecting those that are detectable with SNR>20, we verify the lensing\nfrequency expectations against published lens samples selected in the visible,\nfinding them to be broadly consistent. We find that JWST could yield ~ 65\nlensed systems in COSMOS-Web, of which ~ 25 per cent have source redshifts >4.\nDeeper, narrower programs (e.g. JADES-Medium) will probe more typical source\ngalaxies (in flux and mass) but will find fewer systems (~ 25). Of the surveys\nwe investigate, we find 55-80 per cent have detectable multiple imaging.\nForthcoming NIR surveys will likely reveal new and diverse strong lens systems\nincluding lensed sources that are at higher redshift (JWST) and dustier, more\nmassive and older (Euclid NISP) than those typically detected in the\ncorresponding visible surveys.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:32:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Holloway","Philip",""],["Verma","Aprajita",""],["Marshall","Philip J.",""],["More","Anupreeta",""],["Tecza","Matthias",""]]}
{"id":"2308.00852","submitter":"Sudarsanan Rajasekaran","authors":"Sudarsanan Rajasekaran (1), Manya Ghobadi (1), Aditya Akella (2) ((1)\n  Massachusetts Institute of Technology, (2) UT Austin)","title":"CASSINI: Network-Aware Job Scheduling in Machine Learning Clusters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.DC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present CASSINI, a network-aware job scheduler for machine learning (ML)\nclusters. CASSINI introduces a novel geometric abstraction to consider the\ncommunication pattern of different jobs while placing them on network links. To\ndo so, CASSINI uses an affinity graph that finds a series of time-shift values\nto adjust the communication phases of a subset of jobs, such that the\ncommunication patterns of jobs sharing the same network link are interleaved\nwith each other. Experiments with 13 common ML models on a 24-server testbed\ndemonstrate that compared to the state-of-the-art ML schedulers, CASSINI\nimproves the average and tail completion time of jobs by up to 1.6x and 2.5x,\nrespectively. Moreover, we show that CASSINI reduces the number of ECN marked\npackets in the cluster by up to 33x.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:34:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rajasekaran","Sudarsanan",""],["Ghobadi","Manya",""],["Akella","Aditya",""]]}
{"id":"2308.00853","submitter":"Gniewoj Michalewski","authors":"Gniewoj Michalewski","title":"Body on the hemispherical hill with friction and drag force. A classical\n  problem becoming more realistic with exact and perturbative approaches","comments":"12 pages (main body plus three appendices) including 7 figures. To be\n  published in the American Journal of Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  I discuss the influence of adding the air resistance and the kinetic friction\nto the classical mechanics homework-problem: finding the motion of a body\nsliding down a hemispherical hill. For a physically realistic ($\\propto v^2$)\nform of drag force thus modified problem interestingly turns out to still admit\nanalytical solutions of motion equations. I counter-intuitively find that even\nif friction coefficients are much larger than those of drag (as compared in the\nappropriate units), the drag effects remain significant. I also discuss how the\ntransition between two possible outcomes of the motion (flying off and halting)\nis modified in the presence of the drag force coefficient with respect to the\nfriction-only problem. I examine the behavior of the system using both the\nperturbation theory and exact analytical solutions of differential equations,\nshowing that one can gain interesting insights from two different but\ncomplementary standpoints.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:39:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Michalewski","Gniewoj",""]]}
{"id":"2308.00854","submitter":"Muhammad Shah","authors":"Muhammad A. Shah and Bhiksha Raj","title":"Training on Foveated Images Improves Robustness to Adversarial Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks (DNNs) have been shown to be vulnerable to adversarial\nattacks -- subtle, perceptually indistinguishable perturbations of inputs that\nchange the response of the model. In the context of vision, we hypothesize that\nan important contributor to the robustness of human visual perception is\nconstant exposure to low-fidelity visual stimuli in our peripheral vision. To\ninvestigate this hypothesis, we develop \\RBlur, an image transform that\nsimulates the loss in fidelity of peripheral vision by blurring the image and\nreducing its color saturation based on the distance from a given fixation\npoint. We show that compared to DNNs trained on the original images, DNNs\ntrained on images transformed by \\RBlur are substantially more robust to\nadversarial attacks, as well as other, non-adversarial, corruptions, achieving\nup to 25\\% higher accuracy on perturbed data.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:40:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shah","Muhammad A.",""],["Raj","Bhiksha",""]]}
{"id":"2308.00855","submitter":"Absalom Ezugwu","authors":"Absalom E. Ezugwu, Japie Greeff, Yuh-Shan Ho","title":"A Comprehensive Study of Groundbreaking Machine Learning Research:\n  Analyzing Highly Cited and Impactful Publications across Six Decades","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) has emerged as a prominent field of research in\ncomputer science and other related fields, thereby driving advancements in\nother domains of interest. As the field continues to evolve, it is crucial to\nunderstand the landscape of highly cited publications to identify key trends,\ninfluential authors, and significant contributions made thus far. In this\npaper, we present a comprehensive bibliometric analysis of highly cited ML\npublications. We collected a dataset consisting of the top-cited papers from\nreputable ML conferences and journals, covering a period of several years from\n1959 to 2022. We employed various bibliometric techniques to analyze the data,\nincluding citation analysis, co-authorship analysis, keyword analysis, and\npublication trends. Our findings reveal the most influential papers, highly\ncited authors, and collaborative networks within the machine learning\ncommunity. We identify popular research themes and uncover emerging topics that\nhave recently gained significant attention. Furthermore, we examine the\ngeographical distribution of highly cited publications, highlighting the\ndominance of certain countries in ML research. By shedding light on the\nlandscape of highly cited ML publications, our study provides valuable insights\nfor researchers, policymakers, and practitioners seeking to understand the key\ndevelopments and trends in this rapidly evolving field.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:43:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ezugwu","Absalom E.",""],["Greeff","Japie",""],["Ho","Yuh-Shan",""]]}
{"id":"2308.00856","submitter":"Muhammad Irfan Khan","authors":"Muhammad Irfan Khan, Esa Alhoniemi, Elina Kontio, Suleiman A. Khan,\n  and Mojtaba Jafaritadi","title":"Differential Privacy for Adaptive Weight Aggregation in Federated Tumor\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) is a distributed machine learning approach that\nsafeguards privacy by creating an impartial global model while respecting the\nprivacy of individual client data. However, the conventional FL method can\nintroduce security risks when dealing with diverse client data, potentially\ncompromising privacy and data integrity. To address these challenges, we\npresent a differential privacy (DP) federated deep learning framework in\nmedical image segmentation. In this paper, we extend our similarity weight\naggregation (SimAgg) method to DP-SimAgg algorithm, a differentially private\nsimilarity-weighted aggregation algorithm for brain tumor segmentation in\nmulti-modal magnetic resonance imaging (MRI). Our DP-SimAgg method not only\nenhances model segmentation capabilities but also provides an additional layer\nof privacy preservation. Extensive benchmarking and evaluation of our\nframework, with computational performance as a key consideration, demonstrate\nthat DP-SimAgg enables accurate and robust brain tumor segmentation while\nminimizing communication costs during model training. This advancement is\ncrucial for preserving the privacy of medical image data and safeguarding\nsensitive information. In conclusion, adding a differential privacy layer in\nthe global weight aggregation phase of the federated brain tumor segmentation\nprovides a promising solution to privacy concerns without compromising\nsegmentation model efficacy. By leveraging DP, we ensure the protection of\nclient data against adversarial attacks and malicious participants.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:59:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Khan","Muhammad Irfan",""],["Alhoniemi","Esa",""],["Kontio","Elina",""],["Khan","Suleiman A.",""],["Jafaritadi","Mojtaba",""]]}
{"id":"2308.00857","submitter":"Fu-Hsuan Ho","authors":"Fu-Hsuan Ho","title":"Sampling from the Gibbs measure of the continuous random energy model\n  and the hardness threshold","comments":"30 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The continuous random energy model (CREM) is a toy model of disordered\nsystems introduced by Bovier and Kurkova in 2004 based on previous work by\nDerrida and Spohn in the 80s. In a recent paper by Addario-Berry and Maillard,\nthey raised the following question: what is the threshold $\\beta_G$, at which\nsampling approximately the Gibbs measure at any inverse temperature\n$\\beta>\\beta_G$ becomes algorithmically hard? Here, sampling approximately\nmeans that the Kullback--Leibler divergence from the output law of the\nalgorithm to the Gibbs measure is of order $o(N)$ with probability approaching\n$1$, as $N\\rightarrow\\infty$, and algorithmically hard means that the running\ntime, the numbers of vertices queries by the algorithms, is beyond of\npolynomial order.\n  The present work shows that when the covariance function $A$ of the CREM is\nconcave, for all $\\beta>0$, a recursive sampling algorithm on a renormalized\ntree approximates the Gibbs measure with running time of order\n$O(N^{1+\\varepsilon})$. For $A$ non-concave, the present work exhibits a\nthreshold $\\beta_G<\\infty$ such that the following hardness transition occurs:\na) For every $\\beta\\leq \\beta_G$, the recursive sampling algorithm approximates\nthe Gibbs measure with running time of order $O(N^{1+\\varepsilon})$. b) For\nevery $\\beta>\\beta_G$, a hardness result is established for a large class of\nalgorithms. Namely, for any algorithm from this class that samples the Gibbs\nmeasure approximately, there exists $z>0$ such that the running time of this\nalgorithm is at least $e^{zN}$ with probability approaching $1$. In other\nwords, it is impossible to sample approximately in polynomial-time the Gibbs\nmeasure in this regime.\n  Additionally, we provide a lower bound of the free energy of the CREM that\ncould hold its own value.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:09:27 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ho","Fu-Hsuan",""]]}
{"id":"2308.00858","submitter":"Ioannis Iossifidis","authors":"Stephan Johann Lehmler and Muhammad Saif-ur-Rehman and Tobias\n  Glasmachers and Ioannis Iossifidis","title":"Understanding Activation Patterns in Artificial Neural Networks by\n  Exploring Stochastic Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  To gain a deeper understanding of the behavior and learning dynamics of\n(deep) artificial neural networks, it is valuable to employ mathematical\nabstractions and models. These tools provide a simplified perspective on\nnetwork performance and facilitate systematic investigations through\nsimulations. In this paper, we propose utilizing the framework of stochastic\nprocesses, which has been underutilized thus far.\n  Our approach models activation patterns of thresholded nodes in (deep)\nartificial neural networks as stochastic processes. We focus solely on\nactivation frequency, leveraging neuroscience techniques used for real neuron\nspike trains. During a classification task, we extract spiking activity and use\nan arrival process following the Poisson distribution.\n  We examine observed data from various artificial neural networks in image\nrecognition tasks, fitting the proposed model's assumptions. Through this, we\nderive parameters describing activation patterns in each network. Our analysis\ncovers randomly initialized, generalizing, and memorizing networks, revealing\nconsistent differences across architectures and training sets.\n  Calculating Mean Firing Rate, Mean Fano Factor, and Variances, we find stable\nindicators of memorization during learning, providing valuable insights into\nnetwork behavior. The proposed model shows promise in describing activation\npatterns and could serve as a general framework for future investigations. It\nhas potential applications in theoretical simulations, pruning, and transfer\nlearning.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:12:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lehmler","Stephan Johann",""],["Saif-ur-Rehman","Muhammad",""],["Glasmachers","Tobias",""],["Iossifidis","Ioannis",""]]}
{"id":"2308.00859","submitter":"Semen Podkorytov","authors":"S. S. Podkorytov","title":"Homotopy similarity of maps","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given based cellular spaces X and Y, X compact, we define a sequence of\nincreasingly fine equivalences on the based-homotopy set [X,Y].\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:15:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Podkorytov","S. S.",""]]}
{"id":"2308.00860","submitter":"Miguel Aguilar Janita","authors":"Miguel Aguilar-Janita, Nagi Khalil, Inmaculada Leyva, Irene\n  Sendi\\~na-Nadal","title":"Cooperation transitions in social games induced by aspiration-driven\n  players","comments":"11 pages, 9 figures; Correction of typos in the metadata","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cooperation and defection are social traits whose evolutionary origin is\nstill unresolved. Recent behavioral experiments with humans suggested that\nstrategy changes are driven mainly by the individuals' expectations and not by\nimitation. This work theoretically analyzes and numerically explores an\naspiration-driven strategy updating in a well-mixed population playing games.\nThe payoffs of the game matrix and the aspiration are condensed into just two\nparameters that allow a comprehensive description of the dynamics. We find\ncontinuous and abrupt transitions in the cooperation density with excellent\nagreement between theory and the Gillespie simulations. Under strong selection,\nthe system can display several levels of steady cooperation or get trapped into\nabsorbing states. These states are still relevant for experiments even when\nirrational choices are made due to their prolonged relaxation times. Finally,\nwe show that for the particular case of the Prisoner Dilemma, where defection\nis the dominant strategy under imitation mechanisms, the self-evaluation update\ninstead favors cooperation nonlinearly with the level of aspiration. Thus, our\nwork provides insights into the distinct role between imitation and\nself-evaluation with no learning dynamics.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:16:46 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 10:55:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Aguilar-Janita","Miguel",""],["Khalil","Nagi",""],["Leyva","Inmaculada",""],["Sendi\u00f1a-Nadal","Irene",""]]}
{"id":"2308.00861","submitter":"Sean Tull","authors":"Sean Tull, Johannes Kleiner, Toby St Clere Smithe","title":"Active Inference in String Diagrams: A Categorical Account of Predictive\n  Processing and Free Energy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT cs.AI cs.LO nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a categorical formulation of the cognitive frameworks of\nPredictive Processing and Active Inference, expressed in terms of string\ndiagrams interpreted in a monoidal category with copying and discarding. This\nincludes diagrammatic accounts of generative models, Bayesian updating,\nperception, planning, active inference, and free energy. In particular we\npresent a diagrammatic derivation of the formula for active inference via free\nenergy minimisation, and establish a compositionality property for free energy,\nallowing free energy to be applied at all levels of an agent's generative\nmodel. Aside from aiming to provide a helpful graphical language for those\nfamiliar with active inference, we conversely hope that this article may\nprovide a concise formulation and introduction to the framework.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:17:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tull","Sean",""],["Kleiner","Johannes",""],["Smithe","Toby St Clere",""]]}
{"id":"2308.00862","submitter":"Sarah Shoker","authors":"Sarah Shoker, Andrew Reddie, Sarah Barrington, Ruby Booth, Miles\n  Brundage, Husanjot Chahal, Michael Depp, Bill Drexel, Ritwik Gupta, Marina\n  Favaro, Jake Hecla, Alan Hickey, Margarita Konaev, Kirthi Kumar, Nathan\n  Lambert, Andrew Lohn, Cullen O'Keefe, Nazneen Rajani, Michael Sellitto,\n  Robert Trager, Leah Walker, Alexa Wehsener, Jessica Young","title":"Confidence-Building Measures for Artificial Intelligence: Workshop\n  Proceedings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Foundation models could eventually introduce several pathways for undermining\nstate security: accidents, inadvertent escalation, unintentional conflict, the\nproliferation of weapons, and the interference with human diplomacy are just a\nfew on a long list. The Confidence-Building Measures for Artificial\nIntelligence workshop hosted by the Geopolitics Team at OpenAI and the Berkeley\nRisk and Security Lab at the University of California brought together a\nmultistakeholder group to think through the tools and strategies to mitigate\nthe potential risks introduced by foundation models to international security.\nOriginating in the Cold War, confidence-building measures (CBMs) are actions\nthat reduce hostility, prevent conflict escalation, and improve trust between\nparties. The flexibility of CBMs make them a key instrument for navigating the\nrapid changes in the foundation model landscape. Participants identified the\nfollowing CBMs that directly apply to foundation models and which are further\nexplained in this conference proceedings: 1. crisis hotlines 2. incident\nsharing 3. model, transparency, and system cards 4. content provenance and\nwatermarks 5. collaborative red teaming and table-top exercises and 6. dataset\nand evaluation sharing. Because most foundation model developers are\nnon-government entities, many CBMs will need to involve a wider stakeholder\ncommunity. These measures can be implemented either by AI labs or by relevant\ngovernment actors.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:20:11 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 20:06:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shoker","Sarah",""],["Reddie","Andrew",""],["Barrington","Sarah",""],["Booth","Ruby",""],["Brundage","Miles",""],["Chahal","Husanjot",""],["Depp","Michael",""],["Drexel","Bill",""],["Gupta","Ritwik",""],["Favaro","Marina",""],["Hecla","Jake",""],["Hickey","Alan",""],["Konaev","Margarita",""],["Kumar","Kirthi",""],["Lambert","Nathan",""],["Lohn","Andrew",""],["O'Keefe","Cullen",""],["Rajani","Nazneen",""],["Sellitto","Michael",""],["Trager","Robert",""],["Walker","Leah",""],["Wehsener","Alexa",""],["Young","Jessica",""]]}
{"id":"2308.00863","submitter":"Joe Thomas","authors":"Michael Magee, Joe Thomas","title":"Strongly convergent unitary representations of right-angled Artin groups","comments":"35 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.OA math.PR math.RT math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove using a novel random matrix model that all right-angled Artin groups\nhave a sequence of finite dimensional unitary representations that strongly\nconverge to the regular representation. We deduce that this result applies also\nto: the fundamental group of a closed hyperbolic manifold that is either three\ndimensional or standard arithmetic type, any Coxeter group, and any\nword-hyperbolic cubulated group. There are applications of this to the spectral\ngeometry of e.g. hyperbolic 3-manifolds.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:24:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Magee","Michael",""],["Thomas","Joe",""]]}
{"id":"2308.00864","submitter":"Aamir Hasan","authors":"Aamir Hasan, Neeloy Chakraborty, Haonan Chen, Jung-Hoon Cho, Cathy Wu,\n  Katherine Driggs-Campbell","title":"PeRP: Personalized Residual Policies For Congestion Mitigation Through\n  Co-operative Advisory Systems","comments":"Accepted to ITSC 2023. Additional material and code is available at\n  the project webpage: https://sites.google.com/illinois.edu/perp","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intelligent driving systems can be used to mitigate congestion through simple\nactions, thus improving many socioeconomic factors such as commute time and gas\ncosts. However, these systems assume precise control over autonomous vehicle\nfleets, and are hence limited in practice as they fail to account for\nuncertainty in human behavior. Piecewise Constant (PC) Policies address these\nissues by structurally modeling the likeness of human driving to reduce traffic\ncongestion in dense scenarios to provide action advice to be followed by human\ndrivers. However, PC policies assume that all drivers behave similarly. To this\nend, we develop a co-operative advisory system based on PC policies with a\nnovel driver trait conditioned Personalized Residual Policy, PeRP. PeRP advises\ndrivers to behave in ways that mitigate traffic congestion. We first infer the\ndriver's intrinsic traits on how they follow instructions in an unsupervised\nmanner with a variational autoencoder. Then, a policy conditioned on the\ninferred trait adapts the action of the PC policy to provide the driver with a\npersonalized recommendation. Our system is trained in simulation with novel\ndriver modeling of instruction adherence. We show that our approach\nsuccessfully mitigates congestion while adapting to different driver behaviors,\nwith 4 to 22% improvement in average speed over baselines.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:25:40 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 22:31:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hasan","Aamir",""],["Chakraborty","Neeloy",""],["Chen","Haonan",""],["Cho","Jung-Hoon",""],["Wu","Cathy",""],["Driggs-Campbell","Katherine",""]]}
{"id":"2308.00865","submitter":"Tahereh Azizi","authors":"Tahereh Azizi, Najibe Borhani, and Mojtaba Haghshenas","title":"Evolution of Gravitational Waves in Non-minimal Coupling Between\n  Geometry and Matter Theories of Gravity","comments":"26 pages, 22 figures; to appear in Physics of the Dark Universe","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider some specific models of non-minimal matter-geometry coupling\ntheories and investigate the propagation of the gravitational waves in them.\nExtracting the temporal evolution of the gravitational wave equation within the\nframework of a flat FRW universe with a perfect fluid distribution, we analyze\nthe waveforms traveling during the time. We find that while both the amplitude\nand frequency of the GWs decay with time in all considered models, the rate of\nreduction is highly sensitive to the values of the equation of state parameter\nand input parameters of the considered models.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:28:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Azizi","Tahereh",""],["Borhani","Najibe",""],["Haghshenas","Mojtaba",""]]}
{"id":"2308.00866","submitter":"Andreino Simonelli","authors":"P. Migliozzi, C.M. Mollo, A. Simonelli","title":"A flexible quantum efficiency measurement device for photosensors\n  testing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph astro-ph.IM hep-ex","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper presents a new quantum efficiency setup based on a 2D motorized\nstage, a wide spectrum xenon lamp, a beam splitter system, and two calibrated\nphotodiodes for measuring the quantum efficiency (QE) of photosensors from PMTs\n(1 to 10 inches) to SIPM and photodiodes. The large area covered by the 2D\nstages permit to study the quantum efficiency of a matrix of multichannel\nphotosensors in an automated way and PMTs with diameter up to ten inches. The\nsetup offers high precision and accuracy in characterizing the quantum\nefficiency versus wavelength over the range of 250 nm to 1100 nm and in two\ndimensions with a positioning precision of ten microns. The setup monitors the\nlight intensity synchronously with the output current yield from photosensors\nunder test. This ensures the accuracy and repeatability of the measurements.\nThe motorized stage allows precise positioning of the light source with respect\nto the active area. Moreover, the emission spectrum of the xenon lamp provides\na broad range of illumination in terms of dynamics and wavelength span.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:36:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Migliozzi","P.",""],["Mollo","C. M.",""],["Simonelli","A.",""]]}
{"id":"2308.00867","submitter":"Jumpei Takata","authors":"J.Takata (Hust), A.K.H. Kong (Nthu), X.F. Wang (Hust), F.F. Song, J.\n  Mao, X. Hou (Ynao), C.-P. Hu (Ncue), L. C.-C. Lin, K.L. Li (Ncku), C.Y. Hui\n  (Cnu)","title":"Evidence of stellar oscillations in the post-common envelop binary\n  candidate ASASSN-V J205543.90+240033.5","comments":"9 pages, 5 figures, 2 tables. Accepted for publication in ApJ Letter","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  ASASSN-V J205543.90+240033.5 (ASJ2055) is a possible post-common envelope\nbinary system. Its optical photometric data shows an orbital variation about\n$0.52$~days and a fast period modulation of $P_0\\sim 9.77$~minute, whose origin\nis unknown. In this {\\it Letter}, we report an evidence of the stellar\noscillation of the companion star as the origin of the fast period modulation.\nWe analyze the photometric data taken by TESS, Liverpool telescope, and Lulin\nOne-meter Telescope. It is found that the period of the 9.77-minute signal\nmeasured in 2022 August is significantly shorter than that in 2021 July/August,\nand the magnitude of the change is of the order of $|\\triangle P_0|/P_0\\sim\n0.0008(4)$. Such a large variation will be incompatible with the scenario of\nthe white dwarf spin as the origin of the 9.77-minute periodic modulation. We\nsuggest that the fast periodic signal is related to the emission from the\nirradiated companion star rather than that of the white dwarf. Using existing\nphotometric data covering a wide wavelength range, we estimate that the hot\nwhite dwarf in ASJ2055 has a temperature of $T_{eff}\\sim 80000$~K and is\nheating the oscillating M-type main-sequence star with $T_{eff}\\sim 3500$~K on\nits un-irradiated surface. The stellar oscillation of M-type main-sequence star\nhas been predicted in theoretical studies, but no observational confirmation\nhas been done. ASJ2055, therefore, has a potential to be a unique laboratory to\ninvestigate the stellar oscillation of a M-type main-sequence star and the\nheating effect on the stellar oscillation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:36:44 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 05:50:41 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Takata","J.","","Hust"],["Kong","A. K. H.","","Nthu"],["Wang","X. F.","","Hust"],["Song","F. F.","","Ynao"],["Mao","J.","","Ynao"],["Hou","X.","","Ynao"],["Hu","C. -P.","","Ncue"],["Lin","L. C. -C.","","Ncku"],["Li","K. L.","","Ncku"],["Hui","C. Y.","","Cnu"]]}
{"id":"2308.00868","submitter":"Hoda Heidari","authors":"Alex John London and Hoda heidari","title":"Beneficent Intelligence: A Capability Approach to Modeling Benefit,\n  Assistance, and Associated Moral Failures through AI Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prevailing discourse around AI ethics lacks the language and formalism\nnecessary to capture the diverse ethical concerns that emerge when AI systems\ninteract with individuals. Drawing on Sen and Nussbaum's capability approach,\nwe present a framework formalizing a network of ethical concepts and\nentitlements necessary for AI systems to confer meaningful benefit or\nassistance to stakeholders. Such systems enhance stakeholders' ability to\nadvance their life plans and well-being while upholding their fundamental\nrights. We characterize two necessary conditions for morally permissible\ninteractions between AI systems and those impacted by their functioning, and\ntwo sufficient conditions for realizing the ideal of meaningful benefit. We\nthen contrast this ideal with several salient failure modes, namely, forms of\nsocial interactions that constitute unjustified paternalism, coercion,\ndeception, exploitation and domination. The proliferation of incidents\ninvolving AI in high-stakes domains underscores the gravity of these issues and\nthe imperative to take an ethics-led approach to AI systems from their\ninception.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:38:14 GMT"}],"update_date":"2023-08-03","authors_parsed":[["London","Alex John",""],["heidari","Hoda",""]]}
{"id":"2308.00869","submitter":"Xitong Liang","authors":"Xitong Liang, Samuel Livingstone and Jim Griffin","title":"Adaptive MCMC for Bayesian variable selection in generalised linear\n  models and survival models","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":"  Developing an efficient computational scheme for high-dimensional Bayesian\nvariable selection in generalised linear models and survival models has always\nbeen a challenging problem due to the absence of closed-form solutions for the\nmarginal likelihood. The RJMCMC approach can be employed to samples model and\ncoefficients jointly, but effective design of the transdimensional jumps of\nRJMCMC can be challenge, making it hard to implement. Alternatively, the\nmarginal likelihood can be derived using data-augmentation scheme e.g.\nPolya-gamma data argumentation for logistic regression) or through other\nestimation methods. However, suitable data-augmentation schemes are not\navailable for every generalised linear and survival models, and using\nestimations such as Laplace approximation or correlated pseudo-marginal to\nderive marginal likelihood within a locally informed proposal can be\ncomputationally expensive in the \"large n, large p\" settings. In this paper,\nthree main contributions are presented. Firstly, we present an extended\nPoint-wise implementation of Adaptive Random Neighbourhood Informed proposal\n(PARNI) to efficiently sample models directly from the marginal posterior\ndistribution in both generalised linear models and survival models. Secondly,\nin the light of the approximate Laplace approximation, we also describe an\nefficient and accurate estimation method for the marginal likelihood which\ninvolves adaptive parameters. Additionally, we describe a new method to adapt\nthe algorithmic tuning parameters of the PARNI proposal by replacing the\nRao-Blackwellised estimates with the combination of a warm-start estimate and\nan ergodic average. We present numerous numerical results from simulated data\nand 8 high-dimensional gene fine mapping data-sets to showcase the efficiency\nof the novel PARNI proposal compared to the baseline add-delete-swap proposal.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:38:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Liang","Xitong",""],["Livingstone","Samuel",""],["Griffin","Jim",""]]}
{"id":"2308.00870","submitter":"Tri Vu","authors":"Tri Vu, Paul Klippel, Aidan J. Canning, Chenshuo Ma, Huijuan Zhang,\n  Ludmila A. Kasatkina, Yuqi Tang, Jun Xia, Vladislav V. Verkhusha, Tuan\n  Vo-Dinh, Yun Jing, and Junjie Yao","title":"On the importance of low-frequency signals in functional and molecular\n  photoacoustic computed tomography","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":"  In photoacoustic computed tomography (PACT) with short-pulsed laser\nexcitation, wideband acoustic signals are generated in biological tissues with\nfrequencies related to the effective shapes and sizes of the optically\nabsorbing targets. Low-frequency photoacoustic signal components correspond to\nslowly varying spatial features and are often omitted during imaging due to the\nlimited detection bandwidth of the ultrasound transducer, or during image\nreconstruction as undesired background that degrades image contrast. Here we\ndemonstrate that low-frequency photoacoustic signals, in fact, contain\nfunctional and molecular information, and can be used to enhance structural\nvisibility, improve quantitative accuracy, and reduce spare-sampling artifacts.\nWe provide an in-depth theoretical analysis of low-frequency signals in PACT,\nand experimentally evaluate their impact on several representative PACT\napplications, such as mapping temperature in photothermal treatment, measuring\nblood oxygenation in a hypoxia challenge, and detecting photoswitchable\nmolecular probes in deep organs. Our results strongly suggest that\nlow-frequency signals are important for functional and molecular PACT.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:41:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Vu","Tri",""],["Klippel","Paul",""],["Canning","Aidan J.",""],["Ma","Chenshuo",""],["Zhang","Huijuan",""],["Kasatkina","Ludmila A.",""],["Tang","Yuqi",""],["Xia","Jun",""],["Verkhusha","Vladislav V.",""],["Vo-Dinh","Tuan",""],["Jing","Yun",""],["Yao","Junjie",""]]}
{"id":"2308.00871","submitter":"Suzanne Bintanja","authors":"Suzanne Bintanja, Ben Freivogel, and Andrew Rolph","title":"Tunneling to Holographic Traversable Wormholes","comments":"65 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study nonperturbative effects of quantum gravity in a system consisting of\na coupled pair of holographic CFTs. The AdS$_4$/CFT$_3$ system has three\npossible ground states: two copies of empty AdS, a pair of extremal AdS black\nholes, and an eternal AdS traversable wormhole. We give a recipe for\ncalculating transition rates via gravitational instantons and test it by\ncalculating the emission rate of radiation shells from a black hole. We\ncalculate the nucleation rate of a traversable wormhole between a pair of\nAdS-RN black holes in the canonical and microcanonical ensembles. Our results\ngive predictions of nonpertubative quantum gravity that can be tested in a\nholographic simulation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:42:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bintanja","Suzanne",""],["Freivogel","Ben",""],["Rolph","Andrew",""]]}
{"id":"2308.00872","submitter":"Jingchen Hu","authors":"Jingchen Hu, Claire McKay Bowen","title":"Advancing Microdata Privacy Protection: A Review of Synthetic Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Synthetic data generation is a powerful tool for privacy protection when\nconsidering public release of record-level data files. Initially proposed about\nthree decades ago, it has generated significant research and application\ninterest. To meet the pressing demand of data privacy protection in a variety\nof contexts, the field needs more researchers and practitioners. This review\nprovides a comprehensive introduction to synthetic data, including technical\ndetails of their generation and evaluation. Our review also addresses the\nchallenges and limitations of synthetic data, discusses practical applications,\nand provides thoughts for future work.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:55:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hu","Jingchen",""],["Bowen","Claire McKay",""]]}
{"id":"2308.00873","submitter":"Eckhard Krotscheck","authors":"E. Krotscheck\\', P. Papakonstantinou, and J. Wang","title":"Variational and parquet-diagram calculations for neutron matter. V.\n  Triplet pairing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We apply a large-scale summation of Feynman diagrams, including the class of\nparquet-diagrams {\\em plus} important contributions outside the parquet class,\nfor calculating effective pairing interactions and subsequently the superfluid\ngap in P-wave pairing in neutron matter. We employ realistic nucleon-nucleon\ninteractions of the $v_8$ type and perform calculations up to a Fermi momentum\nof $1.8\\,$fm$^{-1}$. We find that many-body correlations lead to a strong\nreduction of the spin-orbit interaction, and, therefore, to an almost complete\nsuppression of the $^3$P$_2$ and $^3$P$_2$-$^3$F$_2$ gaps. We also find pairing\nin $^3$P$_0$ states; the strength of the pairing gap depends sensitively on the\npotential model employed. Our results for triplet pairing are relevant for\nassessing superfluidity in neutron star interiors, whose presence can affect\nthe cooling of neutron stars.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:56:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Krotscheck\\'","E.",""],["Papakonstantinou","P.",""],["Wang","J.",""]]}
{"id":"2308.00874","submitter":"Thanh Vu","authors":"Nguyen Cong Minh and Tran Nam Trung and Thanh Vu","title":"Depth of powers of edge ideals of cycles and trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $I$ be the edge ideal of a cycle of length $n \\ge 5$ over a polynomial\nring $S = \\mathrm{k}[x_1,\\ldots,x_n]$. We prove that for $2 \\le t < \\lceil\n(n+1)/2 \\rceil$,\n  $$\\operatorname{depth} (S/I^t) = \\lceil \\frac{n -t + 1}{3} \\rceil.$$\n  When $G = T_{\\mathbf{a}}$ is a starlike tree which is the join of $k$ paths\nof length $a_1, \\ldots, a_k$ at a common root $1$, we give a formula for the\ndepth of powers of $I(T_{\\mathbf{a}})$.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:58:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Minh","Nguyen Cong",""],["Trung","Tran Nam",""],["Vu","Thanh",""]]}
{"id":"2308.00875","submitter":"Carlo Maccaferri Prof.","authors":"Carlo Maccaferri","title":"String Field Theory","comments":"33 pages, no figures. Invited contribution to Oxford Research\n  Encyclopedia of Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  String Field Theory is a formulation of String Theory as a Quantum Field\nTheory in target space. It allows to tame the infrared divergences of String\nTheory and to approach its non-perturbative structure and background\nindependence. This article gives a concise overview on the subject and of some\nof the main recent progresses.\n  Note: Review article for Oxford Research Encyclopedia of Physics\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:15:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Maccaferri","Carlo",""]]}
{"id":"2308.00876","submitter":"Sanjiang Li","authors":"Sanjiang Li, Ky Dan Nguyen, Zachary Clare, Yuan Feng","title":"Single-Qubit Gates Matter for Optimising Quantum Circuit Depth in Qubit\n  Mapping","comments":"Accepted to The 2023 International Conference on Computer-Aided\n  Design (IEEE/ACM ICCAD'23); 13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AR cs.ET","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Quantum circuit transformation (QCT, a.k.a. qubit mapping) is a critical step\nin quantum circuit compilation. Typically, QCT is achieved by finding an\nappropriate initial mapping and using SWAP gates to route the qubits such that\nall connectivity constraints are satisfied. The objective of QCT can be to\nminimise circuit size or depth. Most existing QCT algorithms prioritise\nminimising circuit size, potentially overlooking the impact of single-qubit\ngates on circuit depth. In this paper, we first point out that a single SWAP\ngate insertion can double the circuit depth, and then propose a simple and\neffective method that takes into account the impact of single-qubit gates on\ncircuit depth. Our method can be combined with many existing QCT algorithms to\noptimise circuit depth. The Qiskit SABRE algorithm has been widely accepted as\nthe state-of-the-art algorithm for optimising both circuit size and depth. We\ndemonstrate the effectiveness of our method by embedding it in SABRE, showing\nthat it can reduce circuit depth by up to 50% and 27% on average on, for\ninstance, Google Sycamore and 117 real quantum circuits from MQTBench.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:16:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Sanjiang",""],["Nguyen","Ky Dan",""],["Clare","Zachary",""],["Feng","Yuan",""]]}
{"id":"2308.00877","submitter":"Kenji Shu","authors":"Kenji Shu, Naoki Miyamoto, Yuto Motohashi, Ryosuke Uozumi, Yohei\n  Tajima, and Kosuke Yoshioka","title":"Development of an optimal laser for chirp cooling of positronium based\n  on chirped pulse-train generator","comments":"11 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics hep-ex physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report the development and characterization of a pulsed 243 nm laser that\nis optimal for the cooling of positronium (Ps). The laser, which is based on\nthe recent chirped pulse-train generator (CPTG) demonstrated by K. Yamada et\nal. (Phys. Rev. Appl. 16, 014009 (2021)), was designed to output a train of\npulses with linewidths of 10 GHz, and with the center frequency of each pulse\nshifting upward (up-chirped) in time by $4.9\\times10^2\\,\\mathrm{GHz\\,\\mu\ns^{-1}}$. These parameters were determined by the mechanism of chirp cooling,\nwhich is the best scheme for cooling many Ps atoms to the recoil temperature of\nlaser cooling. To achieve the designed performance, we drove an optical phase\nmodulator in the CPTG with a deep modulation depth based on the operating\nprinciple of the cooling laser. Time-resolved spectroscopic measurements\nconfirmed that the developed laser satisfied the chirp rate and linewidth\nrequirements for efficient chirp cooling. Combined with pulse energy of\nhundreds of microjoules, we believe that the experimental demonstration of Ps\nlaser cooling has become possible using realistic methods for the generation\nand velocity measurement of Ps.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:23:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shu","Kenji",""],["Miyamoto","Naoki",""],["Motohashi","Yuto",""],["Uozumi","Ryosuke",""],["Tajima","Yohei",""],["Yoshioka","Kosuke",""]]}
{"id":"2308.00878","submitter":"Qingyang Wu","authors":"Qingyang Wu, James Gung, Raphael Shu, Yi Zhang","title":"DiactTOD: Learning Generalizable Latent Dialogue Acts for Controllable\n  Task-Oriented Dialogue Systems","comments":"SIGDial 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dialogue act annotations are important to improve response generation quality\nin task-oriented dialogue systems. However, it can be challenging to use\ndialogue acts to control response generation in a generalizable way because\ndifferent datasets and tasks may have incompatible annotations. While\nalternative methods that utilize latent action spaces or reinforcement learning\ndo not require explicit annotations, they may lack interpretability or face\ndifficulties defining task-specific rewards. In this work, we present a novel\nend-to-end latent dialogue act model (DiactTOD) that represents dialogue acts\nin a latent space. DiactTOD, when pre-trained on a large corpus, is able to\npredict and control dialogue acts to generate controllable responses using\nthese latent representations in a zero-shot fashion. Our approach demonstrates\nstate-of-the-art performance across a wide range of experimental settings on\nthe MultiWOZ dataset, including zero-shot, few-shot, and full data fine-tuning\nwith both end-to-end and policy optimization configurations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:29:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Qingyang",""],["Gung","James",""],["Shu","Raphael",""],["Zhang","Yi",""]]}
{"id":"2308.00879","submitter":"Neil F. Johnson","authors":"Neil F. Johnson, Richard Sear, Lucia Illari","title":"Controlling bad-actor-AI activity at scale across online battlefields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show how the looming threat of bad actors using AI/GPT to generate harms\nacross social media, can be addressed at scale by exploiting the intrinsic\ndynamics of the social media multiverse. We combine a uniquely detailed\ndescription of the current bad-actor-mainstream battlefield with a mathematical\ndescription of its behavior, to show what bad-actor-AI activity will likely\ndominate, where, and when. A dynamical Red Queen analysis predicts an\nescalation to daily bad-actor-AI activity by early 2024, just ahead of U.S. and\nother global elections. We provide a Policy Matrix that quantifies outcomes and\ntrade-offs mathematically for the policy options of containment vs. removal. We\ngive explicit plug-and-play formulae for risk measures.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:40:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Johnson","Neil F.",""],["Sear","Richard",""],["Illari","Lucia",""]]}
{"id":"2308.00880","submitter":"Shuo Yan","authors":"Leonid Koralov and Shuo Yan","title":"Local limit theorem for time-inhomogeneous functions of Markov processes","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 paper, we consider a continuous-time Markov process and prove a local\nlimit theorem for the integral of a time-inhomogeneous function of the process.\nOne application is in the study of the fast oscillating perturbations of linear\ndynamical systems.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:44:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Koralov","Leonid",""],["Yan","Shuo",""]]}
{"id":"2308.00881","submitter":"Masayuki Katsuragawa","authors":"Akihiro Tomura, Makoto Nomura, Chiaki Ohae, and Masayuki Katsuragawa","title":"Generating arbitrary polarization states by manipulating the thicknesses\n  of a pair of uniaxial birefringent plates","comments":"7 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 report an optical method of generating arbitrary polarization states by\nmanipulating the thicknesses of a pair of uniaxial birefringent plates, the\noptical axes of which are set at a crossing angle of {\\pi}/4. The method has\nthe remarkable feature of being able to generate a distribution of arbitrary\npolarization states in a group of highly discrete spectra without spatially\nseparating the individual spectral components. The target polarization-state\ndistribution is obtained as an optimal solution through an exploration. Within\na realistic exploration range, a sufficient number of near-optimal solutions\nare found. This property is also reproduced well by a concise model based on a\ndistribution of exploration points on a Poincar\\'e sphere, showing that the\nnumber of near-optimal solutions behaves according to a power law with respect\nto the number of spectral components of concern. As a typical example of an\napplication, by applying this method to a set of phase-locked highly discrete\nspectra, we numerically demonstrate the continuous generation of a vector-like\noptical electric field waveform, the helicity of which is alternated within a\nsingle optical cycle in the time domain.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:04:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tomura","Akihiro",""],["Nomura","Makoto",""],["Ohae","Chiaki",""],["Katsuragawa","Masayuki",""]]}
{"id":"2308.00882","submitter":"Murat Kuscu Dr","authors":"Iman Mokari Bolhassan, Ali Abdali, Murat Kuscu","title":"Microfluidic Molecular Communication Transmitter Based on Hydrodynamic\n  Gating","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Molecular Communications (MC) is a bio-inspired paradigm for transmitting\ninformation using chemical signals, which can enable novel applications at the\njunction of biotechnology, nanotechnology, and information and communication\ntechnologies. However, designing efficient and reliable MC systems poses\nsignificant challenges due to the complex nature of the physical channel and\nthe limitations of the micro/nanoscale transmitter and receiver devices. In\nthis paper, we propose a practical microfluidic transmitter architecture for MC\nbased on hydrodynamic gating, a widely utilized technique for generating\nchemical waveforms in microfluidic channels with high spatiotemporal\nresolution. We develop an approximate analytical model that can capture the\nfundamental characteristics of the generated molecular pulses, such as pulse\nwidth, pulse amplitude, and pulse delay, as functions of main system\nparameters, such as flow velocity and gating duration. We validate the accuracy\nof our model by comparing it with finite element simulations using COMSOL\nMultiphysics under various system settings. Our analytical model can enable the\noptimization of microfluidic transmitters for MC applications in terms of\nminimizing intersymbol interference and maximizing data transmission rate.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:04:50 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bolhassan","Iman Mokari",""],["Abdali","Ali",""],["Kuscu","Murat",""]]}
{"id":"2308.00883","submitter":"Yu Gan","authors":"Ziyi Huang, Hongshan Liu, Haofeng Zhang, Fuyong Xing, Andrew Laine,\n  Elsa Angelini, Christine Hendon, Yu Gan","title":"Push the Boundary of SAM: A Pseudo-label Correction Framework for\n  Medical Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Segment anything model (SAM) has emerged as the leading approach for\nzero-shot learning in segmentation, offering the advantage of avoiding\npixel-wise annotation. It is particularly appealing in medical image\nsegmentation where annotation is laborious and expertise-demanding. However,\nthe direct application of SAM often yields inferior results compared to\nconventional fully supervised segmentation networks. An alternative approach is\nto use SAM to generate pseudo labels for fully supervised segmentation.\nHowever, the performance is limited by the quality of pseudo labels. In this\npaper, we propose a novel label corruption to push the boundary of SAM-based\nsegmentation. Our model utilizes a novel noise detection module to distinguish\nbetween noisy labels from clean labels. This enables to correct the noisy\nlabels using an uncertainty-based self-correction module, thereby enriching the\nclean training set. Finally, we retrain the network with updated labels to\noptimize its weights for future predictions. One key advantage of our model is\nits ability to train deep networks using SAM-generated pseudo labels without\nrelying on a subset of expert-level annotations, while attaining good\nsegmentation performance. We demonstrate the effectiveness of our proposed\nmodel on both X-ray and lung CT datasets, indicating its ability to improve\nsegmentation accuracy and outperform baseline methods in label correction.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:04:59 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 14:57:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huang","Ziyi",""],["Liu","Hongshan",""],["Zhang","Haofeng",""],["Xing","Fuyong",""],["Laine","Andrew",""],["Angelini","Elsa",""],["Hendon","Christine",""],["Gan","Yu",""]]}
{"id":"2308.00884","submitter":"Takahiro Shibata","authors":"Takahiro Shibata","title":"The classification of smooth quotients of abelian surfaces","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify smooth projective surfaces that are quotients of abelian surfaces\nby finite groups.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:18:05 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 04:16:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shibata","Takahiro",""]]}
{"id":"2308.00885","submitter":"Michele Mugnaine","authors":"Michele Mugnaine, Jos\\'e D. Szezech Jr., Ricardo L. Viana, Iber\\^e L.\n  Caldas","title":"A nontwist field line mapping in a tokamak with ergodic magnetic limiter","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":"  For tokamaks with uniform magnetic shear, Martin and Taylor have proposed a\nsymplectic map has been used to describe the magnetic field lines at the plasma\nedge perturbed by an ergodic magnetic limiter. We propose an analytical\nmagnetic field line map, based on the Martin-Taylor map, for a tokamak with\narbitrary safety factor profile. With the inclusion of a non-monotonic profile,\nwe obtain a nontwist map which presents the characteristic properties of\ndegenerate systems, as the twin islands scenario, the shearless curve and\nseparatrix reconnection. We estimate the width of the islands and describe\ntheir changes of shape for large values of the limiter current. From our\nnumerical simulations about the shearless curve, we show that its position and\naspect depend on the control parameters.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:26:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Mugnaine","Michele",""],["Szezech","Jos\u00e9 D.","Jr."],["Viana","Ricardo L.",""],["Caldas","Iber\u00ea L.",""]]}
{"id":"2308.00886","submitter":"Boluwatife Faremi Mr","authors":"Boluwatife E. Faremi, Jonathon Stavres, Nuno Oliveira, Zhaoxian Zhou\n  and Andrew H. Sung","title":"Enhancing Machine Learning Performance with Continuous In-Session Ground\n  Truth Scores: Pilot Study on Objective Skeletal Muscle Pain Intensity\n  Prediction","comments":"18 pages, 2-page Appendix, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Machine learning (ML) models trained on subjective self-report scores\nstruggle to objectively classify pain accurately due to the significant\nvariance between real-time pain experiences and recorded scores afterwards.\nThis study developed two devices for acquisition of real-time, continuous\nin-session pain scores and gathering of ANS-modulated endodermal activity\n(EDA).The experiment recruited N = 24 subjects who underwent a post-exercise\ncirculatory occlusion (PECO) with stretch, inducing discomfort. Subject data\nwere stored in a custom pain platform, facilitating extraction of time-domain\nEDA features and in-session ground truth scores. Moreover, post-experiment\nvisual analog scale (VAS) scores were collected from each subject. Machine\nlearning models, namely Multi-layer Perceptron (MLP) and Random Forest (RF),\nwere trained using corresponding objective EDA features combined with\nin-session scores and post-session scores, respectively. Over a 10-fold\ncross-validation, the macro-averaged geometric mean score revealed MLP and RF\nmodels trained with objective EDA features and in-session scores achieved\nsuperior performance (75.9% and 78.3%) compared to models trained with\npost-session scores (70.3% and 74.6%) respectively. This pioneering study\ndemonstrates that using continuous in-session ground truth scores significantly\nenhances ML performance in pain intensity characterization, overcoming ground\ntruth sparsity-related issues, data imbalance, and high variance. This study\ninforms future objective-based ML pain system training.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:28:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Faremi","Boluwatife E.",""],["Stavres","Jonathon",""],["Oliveira","Nuno",""],["Zhou","Zhaoxian",""],["Sung","Andrew H.",""]]}
{"id":"2308.00887","submitter":"Zhen Zhang","authors":"Zhen Zhang, Mohammed Haroon Dupty, Fan Wu, Javen Qinfeng Shi and Wee\n  Sun Lee","title":"Factor Graph Neural Networks","comments":"Accepted by JMLR","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In recent years, we have witnessed a surge of Graph Neural Networks (GNNs),\nmost of which can learn powerful representations in an end-to-end fashion with\ngreat success in many real-world applications. They have resemblance to\nProbabilistic Graphical Models (PGMs), but break free from some limitations of\nPGMs. By aiming to provide expressive methods for representation learning\ninstead of computing marginals or most likely configurations, GNNs provide\nflexibility in the choice of information flowing rules while maintaining good\nperformance. Despite their success and inspirations, they lack efficient ways\nto represent and learn higher-order relations among variables/nodes. More\nexpressive higher-order GNNs which operate on k-tuples of nodes need increased\ncomputational resources in order to process higher-order tensors. We propose\nFactor Graph Neural Networks (FGNNs) to effectively capture higher-order\nrelations for inference and learning. To do so, we first derive an efficient\napproximate Sum-Product loopy belief propagation inference algorithm for\ndiscrete higher-order PGMs. We then neuralize the novel message passing scheme\ninto a Factor Graph Neural Network (FGNN) module by allowing richer\nrepresentations of the message update rules; this facilitates both efficient\ninference and powerful end-to-end learning. We further show that with a\nsuitable choice of message aggregation operators, our FGNN is also able to\nrepresent Max-Product belief propagation, providing a single family of\narchitecture that can represent both Max and Sum-Product loopy belief\npropagation. Our extensive experimental evaluation on synthetic as well as real\ndatasets demonstrates the potential of the proposed model.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:32:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Zhen",""],["Dupty","Mohammed Haroon",""],["Wu","Fan",""],["Shi","Javen Qinfeng",""],["Lee","Wee Sun",""]]}
{"id":"2308.00888","submitter":"Atsushi Hatakeyama","authors":"Naota Sekiguchi, Hiroaki Usui and Atsushi Hatakeyama","title":"Hyperfine transition induced by atomic motion above a paraffin-coated\n  magnetic film","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We measured transitions between the hyperfine levels of the electronic ground\nstate of potassium-39 atoms (transition frequency: 460 MHz) as the atoms moved\nthrough a periodic magneto-static field produced above the magnetic-stripe\ndomains of a magnetic film. The period length of the magnetic field was 3.8 um.\nThe atoms were incident to the field as an impinging beam with the most\nprobable velocity of 550 m/s and experienced a peak oscillating field of 20 mT.\nUnwanted spin relaxation caused by the collisions of the atoms with the film\nsurface was suppressed by the paraffin coating on the film. We observed\nincreasing hyperfine transition probabilities as the frequency of the field\noscillations experienced by the atoms increased from 0 to 140 MHz for the\natomic velocity of 550 m/s, by changing the incident angle of the atomic beam\nwith respect to the stripe domains. Numerical calculation of the time evolution\nof the hyperfine states revealed that the oscillating magnetic field\nexperienced by the atoms induced the hyperfine transitions, and the main\nprocess was not a single-quantum transition but rather multi-quanta\ntransitions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:34:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sekiguchi","Naota",""],["Usui","Hiroaki",""],["Hatakeyama","Atsushi",""]]}
{"id":"2308.00889","submitter":"Scott Conn","authors":"Scott Conn, Joseph Fitzgerald, J\\\"orn Callies","title":"Interpreting Observed Interactions between Near-Inertial Waves and\n  Mesoscale Eddies","comments":"Submitted to Journal of Physical Oceanography","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The evolution of wind-generated near-inertial waves (NIWs) is known to be\ninfluenced by the mesoscale eddy field, yet it remains a challenge to\ndisentangle the effects of this interaction in observations. NIWs are often\nmodeled using a slab mixed-layer model with no horizontal structure. Here, the\ntheoretical model of Young and Ben Jelloul, which describes the evolution of\nNIWs in the presence of a slowly-evolving mesoscale eddy field, is compared to\nobservations from a mooring array in the Northeast Atlantic Ocean. The model\ncaptures the evolution of both the observed NIW amplitude and phase much more\naccurately than the slab mixed-layer model, and it allows attributing the\nevolution to specific physical processes. The model reveals that differences in\nNIW amplitude across the mooring array are caused by refraction of NIWs into\nanticyclones. Advection and wave dispersion also make non-negligible\ncontributions to the observed wave evolution. Stimulated generation, a process\nby which mesoscale kinetic energy acts as a source of NIW potential energy, is\nestimated to be 20$\\mu$W in the region of the mooring array. This is two orders\nof magnitude smaller than the global average input to mesoscale kinetic energy\nand likely not an important contribution to the mesoscale kinetic energy budget\nin this region.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:51:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Conn","Scott",""],["Fitzgerald","Joseph",""],["Callies","J\u00f6rn",""]]}
{"id":"2308.00890","submitter":"Shiyang Chen","authors":"Shiyang Chen, Da Zheng, Caiwen Ding, Chengying Huan, Yuede Ji, Hang\n  Liu","title":"Tango: rethinking quantization for graph neural network training on GPUs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph Neural Networks (GNNs) are becoming increasingly popular due to their\nsuperior performance in critical graph-related tasks. While quantization is\nwidely used to accelerate GNN computation, quantized training faces\nunprecedented challenges. Current quantized GNN training systems often have\nlonger training times than their full-precision counterparts for two reasons:\n(i) addressing the accuracy challenge leads to excessive overhead, and (ii) the\noptimization potential exposed by quantization is not adequately leveraged.\nThis paper introduces Tango which re-thinks quantization challenges and\nopportunities for graph neural network training on GPUs with three\ncontributions: Firstly, we introduce efficient rules to maintain accuracy\nduring quantized GNN training. Secondly, we design and implement\nquantization-aware primitives and inter-primitive optimizations that can speed\nup GNN training. Finally, we integrate Tango with the popular Deep Graph\nLibrary (DGL) system and demonstrate its superior performance over\nstate-of-the-art approaches on various GNN models and datasets.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:51:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chen","Shiyang",""],["Zheng","Da",""],["Ding","Caiwen",""],["Huan","Chengying",""],["Ji","Yuede",""],["Liu","Hang",""]]}
{"id":"2308.00891","submitter":"Runzhou Han","authors":"Runzhou Han, Mai Zheng, Suren Byna, Houjun Tang, Bin Dong, Dong Dai,\n  Yong Chen, Dongkyun Kim, Joseph Hassoun, David Thorsley, Matthew Wolf","title":"PROV-IO+: A Cross-Platform Provenance Framework for Scientific Data on\n  HPC Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Data provenance, or data lineage, describes the life cycle of data. In\nscientific workflows on HPC systems, scientists often seek diverse provenance\n(e.g., origins of data products, usage patterns of datasets). Unfortunately,\nexisting provenance solutions cannot address the challenges due to their\nincompatible provenance models and/or system implementations. In this paper, we\nanalyze four representative scientific workflows in collaboration with the\ndomain scientists to identify concrete provenance needs. Based on the\nfirst-hand analysis, we propose a provenance framework called PROV-IO+, which\nincludes an I/O-centric provenance model for describing scientific data and the\nassociated I/O operations and environments precisely. Moreover, we build a\nprototype of PROV-IO+ to enable end-to-end provenance support on real HPC\nsystems with little manual effort. The PROV-IO+ framework can support both\ncontainerized and non-containerized workflows on different HPC platforms with\nflexibility in selecting various classes of provenance. Our experiments with\nrealistic workflows show that PROV-IO+ can address the provenance needs of the\ndomain scientists effectively with reasonable performance (e.g., less than 3.5%\ntracking overhead for most experiments). Moreover, PROV-IO+ outperforms a\nstate-of-the-art system (i.e., ProvLake) in our experiments.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 00:59:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Han","Runzhou",""],["Zheng","Mai",""],["Byna","Suren",""],["Tang","Houjun",""],["Dong","Bin",""],["Dai","Dong",""],["Chen","Yong",""],["Kim","Dongkyun",""],["Hassoun","Joseph",""],["Thorsley","David",""],["Wolf","Matthew",""]]}
{"id":"2308.00892","submitter":"Rapha\\\"el Hardy","authors":"Rapha\\\"el Hardy, Paul Charbonneau, Andrew Cumming","title":"Magnetohydrodynamical torsional oscillations from thermo-resistive\n  instability in hot jupiters","comments":"Submitted to The Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hot jupiter atmospheres may be subject to a thermo-resistive instability\nwhere an increase in the electrical conductivity due to ohmic heating results\nin runaway of the atmospheric temperature. We introduce a simplified\none-dimensional model of the equatorial sub-stellar region of a hot jupiter\nwhich includes the temperature-dependence and time-dependence of the electrical\nconductivity, as well as the dynamical back-reaction of the magnetic field on\nthe flow. This model extends our previous one-zone model to include the radial\nstructure of the atmosphere. Spatial gradients of electrical conductivity\nstrongly modify the radial profile of Alfv\\'en oscillations, leading to\nsteepening and downwards transport of magnetic field, enhancing dissipation at\ndepth. We find unstable solutions that lead to self-sustained oscillations for\nequilibrium temperatures in the range $T_\\mathrm{eq}\\approx 1000$--$1200$~K,\nand magnetic field in the range $\\approx 10$--$100$~G. For a given set of\nparameters, self-sustained oscillations occur in a narrow range of equilibrium\ntemperatures which allow the magnetic Reynolds number to alternate between\nlarge and small values during an oscillation cycle. Outside of this temperature\nwindow, the system reaches a steady state in which the effect of the magnetic\nfield can be approximated as a magnetic drag term. Our results show that\nthermo-resistive instability is a possible source of variability in magnetized\nhot jupiters at colder temperatures, and emphasize the importance of including\nthe temperature-dependence of electrical conductivity in models of atmospheric\ndynamics.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:05:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hardy","Rapha\u00ebl",""],["Charbonneau","Paul",""],["Cumming","Andrew",""]]}
{"id":"2308.00893","submitter":"Le Duc Anh Dr.","authors":"Keita Ishihara, Le Duc Anh, Tomoki Hotta, Kohdai Inagaki, Masaki\n  Kobayashi, and Masaaki Tanaka","title":"Giant superconducting diode effect in ion-beam patterned Sn-based\n  superconductor nanowire / topological Dirac semimetal planar heterostructures","comments":"22 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superconductor/topological material heterostructures are intensively studied\nas a platform for topological superconductivity and Majorana physics. However,\nthe high cost of nanofabrication and the difficulty of preparing high-quality\ninterfaces between the two dissimilar materials are common obstacles that\nhinder the observation of intrinsic physics and the realisation of scalable\ntopological devices and circuits. Here, we demonstrate an innovative method to\ndirectly draw nanoscale superconducting beta-tin (beta-Sn) patterns of any\nshape in the plane of a topological Dirac semimetal (TDS) alpha-tin (alpha-Sn)\nthin film by irradiating a focused ion beam (FIB). We utilise the property that\nalpha-Sn undergoes a phase transition to superconducting beta-Sn upon heating\nby FIB. In beta-Sn nanowires embedded in a TDS alpha-Sn thin film, we observe\ngiant non-reciprocal superconducting transport, where the critical current\nchanges by 69% upon reversing the current direction. The superconducting diode\nrectification ratio reaches a maximum when the magnetic field is applied\nparallel to the current, distinguishing itself from all the previous reports.\nMoreover, it oscillates between alternate signs with increasing magnetic field\nstrength. The angular dependence of the rectification ratio on the magnetic\nfield and current directions is similar to that of the chiral anomaly effect in\nTDS alpha-Sn, suggesting that the non-reciprocal superconducting transport may\noccur at the beta-Sn/alpha-Sn interfaces. The ion-beam patterned Sn-based\nsuperconductor/TDS planar structures thus show promise as a universal platform\nfor investigating novel quantum physics and devices based on topological\nsuperconducting circuits of any shape.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:06:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ishihara","Keita",""],["Anh","Le Duc",""],["Hotta","Tomoki",""],["Inagaki","Kohdai",""],["Kobayashi","Masaki",""],["Tanaka","Masaaki",""]]}
{"id":"2308.00894","submitter":"Juntao Tan","authors":"Juntao Tan, Yingqiang Ge, Yan Zhu, Yinglong Xia, Jiebo Luo, Jianchao\n  Ji, Yongfeng Zhang","title":"User-Controllable Recommendation via Counterfactual Retrospective and\n  Prospective Explanations","comments":"Accepted for presentation at 26th European Conference on Artificial\n  Intelligence (ECAI2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern recommender systems utilize users' historical behaviors to generate\npersonalized recommendations. However, these systems often lack user\ncontrollability, leading to diminished user satisfaction and trust in the\nsystems. Acknowledging the recent advancements in explainable recommender\nsystems that enhance users' understanding of recommendation mechanisms, we\npropose leveraging these advancements to improve user controllability. In this\npaper, we present a user-controllable recommender system that seamlessly\nintegrates explainability and controllability within a unified framework. By\nproviding both retrospective and prospective explanations through\ncounterfactual reasoning, users can customize their control over the system by\ninteracting with these explanations.\n  Furthermore, we introduce and assess two attributes of controllability in\nrecommendation systems: the complexity of controllability and the accuracy of\ncontrollability. Experimental evaluations on MovieLens and Yelp datasets\nsubstantiate the effectiveness of our proposed framework. Additionally, our\nexperiments demonstrate that offering users control options can potentially\nenhance recommendation accuracy in the future. Source code and data are\navailable at \\url{https://github.com/chrisjtan/ucr}.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:13:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tan","Juntao",""],["Ge","Yingqiang",""],["Zhu","Yan",""],["Xia","Yinglong",""],["Luo","Jiebo",""],["Ji","Jianchao",""],["Zhang","Yongfeng",""]]}
{"id":"2308.00895","submitter":"Bo Zhou","authors":"Marc Hallin, Bas Werker, Bo Zhou","title":"On Bounded Completeness and the $L_1$-Denseness of Likelihood Ratios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The classical concept of bounded completeness and its relation to sufficiency\nand ancillarity play a fundamental role in unbiased estimation, unbiased\ntesting, and the validity of inference in the presence of nuisance parameters.\nIn this short note, we provide a direct proof of a little-known result by\n\\cite{Far62} on a characterization of bounded completeness based on an $L^1$\ndenseness property of the linear span of likelihood ratios. As an application,\nwe show that an experiment with infinite-dimensional observation space is\nboundedly complete iff suitably chosen restricted subexperiments with\nfinite-dimensional observation spaces are.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:16:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hallin","Marc",""],["Werker","Bas",""],["Zhou","Bo",""]]}
{"id":"2308.00896","submitter":"Markus Johansson","authors":"Markus Johansson","title":"Lorentz invariant polynomials as entanglement indicators for Dirac\n  particles","comments":"28+4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spinorial degrees of freedom of two or more spacelike separated Dirac\nparticles are considered and a method for constructing mixed polynomials that\nare invariant under the spinor representations of the local proper\northochronous Lorentz groups is described. The method is an extension of the\nmethod for constructing homogeneous polynomials introduced in [Phys. Rev. A\n105, 032402 (2022), arXiv:2103.07784] and [Ann. Phys. (N. Y.) 457, 169410\n(2023), arXiv:2105.07503]. The mixed polynomials constructed by this method are\nidentically zero for all product states. Therefore they are considered\nindicators of the spinor entanglement of Dirac particles. Mixed polynomials can\nbe constructed to indicate spinor entanglement that involves all the particles,\nor alternatively to indicate spinor entanglement that involves only a proper\nsubset of the particles. It is shown that the mixed polynomials can indicate\nsome types of spinor entanglement that involves all the particles but cannot be\nindicated by any homogeneous locally Lorentz invariant polynomial. For the case\nof two Dirac particles mixed polynomials of bidegree (2,2) and bidegree (3,1)\nare constructed. For the case of three Dirac particles mixed polynomials of\nbidegree (2,2), bidegree (3,1) and bidegree (3,3) are constructed. The\nrelations of the polynomials constructed for two and three Dirac particles to\nthe polynomial spin entanglement indicators for two and three non-relativistic\nspin-$\\frac{1}{2}$ particles are described. Moreover, the constructed\npolynomial indicators of spinor entanglement are in general not invariant under\nlocal time evolutions of the particles but evolve dynamically and we discuss\nhow to describe this dynamical evolution.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:20:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Johansson","Markus",""]]}
{"id":"2308.00897","submitter":"Gansukh Tumurtushaa","authors":"Seoktae Koh, Seong Chan Park, and Gansukh Tumurtushaa","title":"Higgs Inflation with a Gauss-Bonnet term","comments":"16 pages, three figures (Fig. 3 and related text updated),\n  comments/suggestions welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Higgs inflation with a Gauss-Bonnet term is studied in the Einstein frame.\nOur model features two coupling functions, $\\Omega^2(\\phi)$ and $\\omega(\\phi)$,\ncoupled to the Ricci scalar and Gauss-Bonnet combinations. We found a special\nrelation $\\Omega^2 \\propto \\omega$ sets the system a lot more simplified;\ntherefore we take it for granted in our analytical studies. As a result of a\nWeyl transformation to the Einstein frame, we notice the emergence of new\ninteractions: a non-minimal kinetic coupling between the scalar field and\ngravity and a derivative self-interaction of the scalar field. In the Einstein\nframe, we investigate the cosmological implications of these interactions by\nderiving the background equation of motion and observable quantities. Our\nnumerical result on $n_S$ vs. $r$ suggests our model is consistent with the\nobservational data for a wide range of the model parameter, $-1.4\\times\n10^4\\lesssim \\alpha \\equiv \\frac{\\omega}{\\Omega^2} \\lesssim 8\\times 10^3$,\nwhere both the positive and negative values of $\\alpha$ are allowed. As the\nGauss-Bonnet contributions decay away with time after inflation, the\npropagation speed of gravitational waves turned out to be consistent with the\nrecent constraints on the propagation speed of gravitational waves (GWs)\nwithout inducing ghost instability.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:26:17 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 07:39:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Koh","Seoktae",""],["Park","Seong Chan",""],["Tumurtushaa","Gansukh",""]]}
{"id":"2308.00898","submitter":"Kaito Kobayashi","authors":"Kaito Kobayashi and Yukitoshi Motome","title":"Quantum Reservoir Probing of Quantum Information Scrambling","comments":"6 + 3 pages, 7 figures","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":"  Quantum information scrambling is the dynamical process where initially\nlocalized quantum information spreads throughout an entire system. Here, by\nextending the idea of quantum reservoir computing, we propose the quantum\nreservoir probing (QRP) to diagnose quantum information scrambling. As a\nparadigmatic example, we investigate scrambling in a one-dimensional quantum\nIsing chain. We show that the QRP successfully distinguishes between\nquasiparticle-mediated information propagation in a free fermion system and\ncorrelation-mediated scrambling in a quantum chaotic system. Furthermore, via\nthe scanning of read-out operators, the QRP can elucidate the dynamical\ndistribution of quantum information in the Hilbert space, a distinct advantage\nover the conventional methods with out-of-time-order correlators and tripartite\nmutual information.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:26:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kobayashi","Kaito",""],["Motome","Yukitoshi",""]]}
{"id":"2308.00899","submitter":"Lexiao Lai","authors":"C\\'edric Josz, Lexiao Lai","title":"Global stability of first-order methods for coercive tame functions","comments":"30 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider first-order methods with constant step size for minimizing\nlocally Lipschitz coercive functions that are tame in an o-minimal structure on\nthe real field. We prove that if the method is approximated by subgradient\ntrajectories, then the iterates eventually remain in a neighborhood of a\nconnected component of the set of critical points. Under suitable\nmethod-dependent regularity assumptions, this result applies to the subgradient\nmethod with momentum, the stochastic subgradient method with random reshuffling\nand momentum, and the random-permutations cyclic coordinate descent method.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:29:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Josz","C\u00e9dric",""],["Lai","Lexiao",""]]}
{"id":"2308.00900","submitter":"Benjamin Holmgren","authors":"Erin Chambers, Brittany Fasy, Benjamin Holmgren, Sushovan Majhi, and\n  Carola Wenk","title":"Metric and Path-Connectedness Properties of the Frechet Distance for\n  Paths and Graphs","comments":"12 pages, 6 figures. Published in the 2023 Canadian Conference on\n  Computational Geometry","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Frechet distance is often used to measure distances between paths, with\napplications in areas ranging from map matching to GPS trajectory analysis to\nhandwriting recognition. More recently, the Frechet distance has been\ngeneralized to a distance between two copies of the same graph embedded or\nimmersed in a metric space; this more general setting opens up a wide range of\nmore complex applications in graph analysis. In this paper, we initiate a study\nof some of the fundamental topological properties of spaces of paths and of\ngraphs mapped to R^n under the Frechet distance, in an effort to lay the\ntheoretical groundwork for understanding how these distances can be used in\npractice. In particular, we prove whether or not these spaces, and the metric\nballs therein, are path-connected.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:29:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chambers","Erin",""],["Fasy","Brittany",""],["Holmgren","Benjamin",""],["Majhi","Sushovan",""],["Wenk","Carola",""]]}
{"id":"2308.00901","submitter":"Taekyun Kim","authors":"Taekyun Kim, Dae San Kim","title":"Higher-order degenerate harmonic numbers related to degenerate Riemann\n  zeta function","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Kim-Kim investigated the degenerate harmonic numbers and the\ndegenerate hyperharmonic numbers as degenerate versions of the harmonic numbers\nand the hyperharmonic numbers, respectively. The aim of this paper is to study\nthe higher-order degenerate harmonic numbers and the higher-order degenerate\nhyperharmonic numbers as higher-order versions for the degenerate harmonic\nnumbers and the degenerate hyperharmonic numbers, respectively. In addition, we\nstudy the higher-order alternating degenerate hyperharmonic numbers as an\n`alternating version' of the higher-order degenerate hyperharmonic numbers. In\nmore detail, we find generating functions of them, explicit expressions for\nthem and some relations among them for those three kinds of numbe\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:35:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kim","Taekyun",""],["Kim","Dae San",""]]}
{"id":"2308.00902","submitter":"Keita Funayama","authors":"Keita Funayama, Jun Hirotani, Atsushi Miura, Hiroya Tanaka","title":"Selectable diffusion direction with topologically protected edge modes","comments":"8 pages, 5 figures","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":"  Topological insulators provide great potentials to control diffusion\nphenomena as well as waves. Here, we show that the direction of thermal\ndiffusion can be selected by the contributions of the topologically protected\nedge modes via the quantum spin Hall effect in a honeycomb-shaped structure. We\ndemonstrate that when we set our structure to the temperature corresponding to\nthe type of edge mode, the direction of thermal diffusion can be tuned.\nMoreover, this diffusion system is found to be immune to defects owing to the\nrobustness of topological states. Our work points to exciting new avenues for\ncontrolling diffusion phenomena.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:36:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Funayama","Keita",""],["Hirotani","Jun",""],["Miura","Atsushi",""],["Tanaka","Hiroya",""]]}
{"id":"2308.00903","submitter":"Giancarlo Lucchini Arteche","authors":"Diego Izquierdo, Giancarlo Lucchini Arteche","title":"Transfer principles for Galois cohomology and Serre's conjecture II","comments":"30 pages, comments are welcome ^^","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we prove three transfer principles for the cohomological\ndimension of fields. Given a fixed field $K$ with finite cohomological\ndimension $\\delta$, they allow to:\n  - construct countable subfields of $K$ with cohomological dimension $\\leq\n\\delta$;\n  - construct totally ramified extensions of $K$ with cohomological dimension\n$\\leq \\delta - 1$ when $K$ is a complete discrete valuation field with\ncountable residue field;\n  - construct algebraic extensions of $K$ with cohomological dimension $\\leq\n\\delta-1$ and satisfying a norm condition when $K$ is countable.\n  We then apply these results to Serre's conjecture II and to some variants for\nfields of any cohomological dimension that are inspired by conjectures of Kato\nand Kuzumaki. In particular, we prove that Serre's conjecture II for\ncharacteristic $0$ fields implies Serre's conjecture II for positive\ncharacteristic fields.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:41:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Izquierdo","Diego",""],["Arteche","Giancarlo Lucchini",""]]}
{"id":"2308.00904","submitter":"Yonghe Zhao","authors":"Yonghe Zhao, Qiang Huang, Siwei Wu, Yun Peng, Huiyan Sun","title":"VLUCI: Variational Learning of Unobserved Confounders for Counterfactual\n  Inference","comments":"15 pages, 8 figures","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":"  Causal inference plays a vital role in diverse domains like epidemiology,\nhealthcare, and economics. De-confounding and counterfactual prediction in\nobservational data has emerged as a prominent concern in causal inference\nresearch. While existing models tackle observed confounders, the presence of\nunobserved confounders remains a significant challenge, distorting causal\ninference and impacting counterfactual outcome accuracy. To address this, we\npropose a novel variational learning model of unobserved confounders for\ncounterfactual inference (VLUCI), which generates the posterior distribution of\nunobserved confounders. VLUCI relaxes the unconfoundedness assumption often\noverlooked by most causal inference methods. By disentangling observed and\nunobserved confounders, VLUCI constructs a doubly variational inference model\nto approximate the distribution of unobserved confounders, which are used for\ninferring more accurate counterfactual outcomes. Extensive experiments on\nsynthetic and semi-synthetic datasets demonstrate VLUCI's superior performance\nin inferring unobserved confounders. It is compatible with state-of-the-art\ncounterfactual inference models, significantly improving inference accuracy at\nboth group and individual levels. Additionally, VLUCI provides confidence\nintervals for counterfactual outcomes, aiding decision-making in risk-sensitive\ndomains. We further clarify the considerations when applying VLUCI to cases\nwhere unobserved confounders don't strictly conform to our model assumptions\nusing the public IHDP dataset as an example, highlighting the practical\nadvantages of VLUCI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:44:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhao","Yonghe",""],["Huang","Qiang",""],["Wu","Siwei",""],["Peng","Yun",""],["Sun","Huiyan",""]]}
{"id":"2308.00905","submitter":"Hidenori Fujiwara","authors":"H. Fujiwara, Y. Nakatani, H. Aratani, Y. Kanai-Nakata, K. Yamagami, S.\n  Hamamoto, T. Kiss, A. Yamasaki, A. Higashiya, S. Imada, A. Tanaka, K.\n  Tamasaku, M. Yabashi, T. Ishikawa, A. Yasui, H. Yamagami, J. Miyawaki, A.\n  Miyake, T. Ebihara, Y. Saitoh, and A. Sekiyama","title":"Impact of the ground-state $4f$ symmetry for anisotropic\n  $cf$-hybridization in the heavy fermion superconductor CeNi$_{2}$Ge$_{2}$","comments":null,"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":"  We report the ground-state symmetry of the Ce $4f$ states in the heavy\nfermion superconductor CeNi$_{2}$Ge$_{2}$, yielding anisotropic\n$cf$-hybridization between the Ce $4f$ states and conducting electrons. By\nanalyzing linear dichroism in soft x-ray absorption and core-level hard x-ray\nphotoemission spectra, the $4f$ symmetry is determined as $\\Sigma$-type\n$\\Gamma_{7}$, promoting predominant hybridization with the conducting electrons\noriginating from the Ge site. The band structures probed by the soft x-ray\nangle-resolved photoemission indicates that the Ge $4p$ components contribute\nto the band renormalization through the anisotropic hybridization effects,\nsuggesting that the control of the electronic structures of Ge orbital gives an\nimpact to achieve the exotic phenomena in CeNi$_{2}$Ge$_{2}$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:47:55 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Fujiwara","H.",""],["Nakatani","Y.",""],["Aratani","H.",""],["Kanai-Nakata","Y.",""],["Yamagami","K.",""],["Hamamoto","S.",""],["Kiss","T.",""],["Yamasaki","A.",""],["Higashiya","A.",""],["Imada","S.",""],["Tanaka","A.",""],["Tamasaku","K.",""],["Yabashi","M.",""],["Ishikawa","T.",""],["Yasui","A.",""],["Yamagami","H.",""],["Miyawaki","J.",""],["Miyake","A.",""],["Ebihara","T.",""],["Saitoh","Y.",""],["Sekiyama","A.",""]]}
{"id":"2308.00906","submitter":"Yasheng Sun","authors":"Yasheng Sun, Yifan Yang, Houwen Peng, Yifei Shen, Yuqing Yang, Han Hu,\n  Lili Qiu and Hideki Koike","title":"ImageBrush: Learning Visual In-Context Instructions for Exemplar-Based\n  Image Manipulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While language-guided image manipulation has made remarkable progress, the\nchallenge of how to instruct the manipulation process faithfully reflecting\nhuman intentions persists. An accurate and comprehensive description of a\nmanipulation task using natural language is laborious and sometimes even\nimpossible, primarily due to the inherent uncertainty and ambiguity present in\nlinguistic expressions. Is it feasible to accomplish image manipulation without\nresorting to external cross-modal language information? If this possibility\nexists, the inherent modality gap would be effortlessly eliminated. In this\npaper, we propose a novel manipulation methodology, dubbed ImageBrush, that\nlearns visual instructions for more accurate image editing. Our key idea is to\nemploy a pair of transformation images as visual instructions, which not only\nprecisely captures human intention but also facilitates accessibility in\nreal-world scenarios. Capturing visual instructions is particularly challenging\nbecause it involves extracting the underlying intentions solely from visual\ndemonstrations and then applying this operation to a new image. To address this\nchallenge, we formulate visual instruction learning as a diffusion-based\ninpainting problem, where the contextual information is fully exploited through\nan iterative process of generation. A visual prompting encoder is carefully\ndevised to enhance the model's capacity in uncovering human intent behind the\nvisual instructions. Extensive experiments show that our method generates\nengaging manipulation results conforming to the transformations entailed in\ndemonstrations. Moreover, our model exhibits robust generalization capabilities\non various downstream tasks such as pose transfer, image translation and video\ninpainting.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 01:57:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sun","Yasheng",""],["Yang","Yifan",""],["Peng","Houwen",""],["Shen","Yifei",""],["Yang","Yuqing",""],["Hu","Han",""],["Qiu","Lili",""],["Koike","Hideki",""]]}
{"id":"2308.00907","submitter":"Xingyu Du","authors":"Xingyu Du, Mohamad Hossein Idjadi, Yixiao Ding, Tao Zhang, Alexander\n  J. Geers, Shun Yao, Jun Beom Pyo, Firooz Aflatouni, Mark Allen, and Roy H.\n  Olsson III","title":"Frequency Tunable Magnetostatic Wave Filters With Zero Static Power\n  Magnetic Biasing Circuitry","comments":"The main manuscript contains 6918 words and 5 figures comprising 15\n  panels in total. The supplementary document consists of 14 Supplementary\n  Notes and 30 Supplementary Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A single tunable filter can reduce the complexity, loss, and size when\ncompared to switchable filter banks and enable new applications. Although\nmagnetostatic wave tunable filters offer broad and continuous frequency tuning\nand high-quality factor (Q-factor), they consume high power and require large\nelectromagnets to alter the magnetostatic wave velocity for filter frequency\ntuning. Here, we demonstrate miniature and high selectivity magnetostatic wave\ntunable filters with zero static power realized in Yttrium Iron Garnet thin\nfilms. The center frequency can be tuned via current pulses applied to a\nmagnetic bias assembly from 3.36 GHz to 11.09 GHz with an insertion loss of 3.2\ndB to 5.1 dB and out-of-band third order input intercept point (IIP3) of 41 to\n44 dBm. Overall, the adaptability, wide frequency tuning range, and zero static\npower consumption of the tunable filter position it as a critical technology,\neffectively addressing challenges in broadband ADCs, RF transceivers, broadband\ndigital phased array antennas, and interference mitigation in 5G and 6G\nnetworks. Broadly frequency tunable, high selectivity filters open new avenues\nfor more efficient and dynamic RF front ends, ensuring optimal performance and\nseamless communication in the ever-evolving landscape of modern wireless\ntechnologies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:01:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Du","Xingyu",""],["Idjadi","Mohamad Hossein",""],["Ding","Yixiao",""],["Zhang","Tao",""],["Geers","Alexander J.",""],["Yao","Shun",""],["Pyo","Jun Beom",""],["Aflatouni","Firooz",""],["Allen","Mark",""],["Olsson","Roy H.","III"]]}
{"id":"2308.00908","submitter":"Peter David Drummond","authors":"Alexander S. Dellios, Margaret D. Reid and Peter D. Drummond","title":"Simulating Gaussian boson sampling quantum computers","comments":"A brief topical review on GBS simulation methods and verification\n  techniques","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A growing cohort of experimental linear photonic networks implementing\nGaussian boson sampling (GBS) have now claimed quantum advantage. However, many\nopen questions remain on how to effectively verify these experimental results,\nas scalable methods are needed that fully capture the rich array of quantum\ncorrelations generated by these photonic quantum computers. In this paper, we\nbriefly review recent theoretical methods to simulate experimental GBS\nnetworks. We focus mostly on methods that use phase-space representations of\nquantum mechanics, as these methods are highly scalable and can be used to\nvalidate experimental outputs and claims of quantum advantage for a variety of\ninput states, ranging from the ideal pure squeezed vacuum state to more\nrealistic thermalized squeezed states. A brief overview of the theory of GBS,\nrecent experiments and other types of methods are also presented. Although this\nis not an exhaustive review, we aim to provide a brief introduction to\nphase-space methods applied to linear photonic networks to encourage further\ntheoretical investigations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:03:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dellios","Alexander S.",""],["Reid","Margaret D.",""],["Drummond","Peter D.",""]]}
{"id":"2308.00909","submitter":"Renzhi Wu","authors":"Renzhi Wu, Jingfan Meng, Jie Jeff Xu, Huayi Wang, Kexin Rong","title":"Rethinking Similarity Search: Embracing Smarter Mechanisms over Smarter\n  Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this vision paper, we propose a shift in perspective for improving the\neffectiveness of similarity search. Rather than focusing solely on enhancing\nthe data quality, particularly machine learning-generated embeddings, we\nadvocate for a more comprehensive approach that also enhances the underpinning\nsearch mechanisms. We highlight three novel avenues that call for a\nredefinition of the similarity search problem: exploiting implicit data\nstructures and distributions, engaging users in an iterative feedback loop, and\nmoving beyond a single query vector. These novel pathways have gained relevance\nin emerging applications such as large-scale language models, video clip\nretrieval, and data labeling. We discuss the corresponding research challenges\nposed by these new problem areas and share insights from our preliminary\ndiscoveries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:11:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Renzhi",""],["Meng","Jingfan",""],["Xu","Jie Jeff",""],["Wang","Huayi",""],["Rong","Kexin",""]]}
{"id":"2308.00910","submitter":"Haifeng Ji","authors":"Haifeng Ji, Dong Liang, Qian Zhang","title":"A Mini Immersed Finite Element Method for Two-Phase Stokes Problems on\n  Cartesian Meshes","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 presents a mini immersed finite element (IFE) method for solving\ntwo- and three-dimensional two-phase Stokes problems on Cartesian meshes. The\nIFE space is constructed from the conventional mini element with shape\nfunctions modified on interface elements according to interface jump\nconditions, while keeping the degrees of freedom unchanged. Both discontinuous\nviscosity coefficients and surface forces are considered in the construction.\nThe interface is approximated via discrete level set functions and explicit\nformulas of IFE basis functions and correction functions are derived, which\nmake the IFE method easy to implement. The optimal approximation capabilities\nof the IFE space and the inf-sup stability and the optimal a priori error\nestimate of the IFE method are derived rigorously with constants independent of\nthe mesh size and how the interface cuts the mesh. It is also proved that the\ncondition number has the usual bound independent of the interface. Numerical\nexperiments are provided to confirm the theoretical results.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:20:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ji","Haifeng",""],["Liang","Dong",""],["Zhang","Qian",""]]}
{"id":"2308.00911","submitter":"Hazhar Rahmani","authors":"Hazhar Rahmani, Arash Ahadi, and Jie Fu","title":"Optimal Sensor Deception to Deviate from an Allowed Itinerary","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we study a class of deception planning problems in which an\nagent aims to alter a security monitoring system's sensor readings so as to\ndisguise its adversarial itinerary as an allowed itinerary in the environment.\nThe adversarial itinerary set and allowed itinerary set are captured by regular\nlanguages. To deviate without being detected, we investigate whether there\nexists a strategy for the agent to alter the sensor readings, with a minimal\ncost, such that for any of those paths it takes, the system thinks the agent\ntook a path within the allowed itinerary. Our formulation assumes an offline\nsensor alteration where the agent determines the sensor alteration strategy and\nimplement it, and then carry out any path in its deviation itinerary. We prove\nthat the problem of solving the optimal sensor alteration is NP-hard, by a\nreduction from the directed multi-cut problem. Further, we present an exact\nalgorithm based on integer linear programming and demonstrate the correctness\nand the efficacy of the algorithm in case studies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:37:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rahmani","Hazhar",""],["Ahadi","Arash",""],["Fu","Jie",""]]}
{"id":"2308.00912","submitter":"Hiroyasu  Koizumi","authors":"Hiroyasu Koizumi","title":"Reversible superconducting-normal phase transition in a magnetic field:\n  The energy-momentum balance including the velocity field of the Berry\n  connection from many-body wave functions","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 velocity field composed of the Berry connection from many-body wave\nfunctions and electromagnetic vector potential explains the energy-momentum\nbalance during the reversible superconducting-normal phase transition in the\npresence of an externally applied magnetic field. In this formalism, forces\nacting on electrons are the Lorentz force and force expressed as the gradient\nof the kinetic energy. In the stationary situation, they balance; however, an\ninfinitesimal imbalance of them causes a phase boundary shift. In order to\nexplain the energy balance during this phase boundary shift, the electromotive\nforce of the Faraday's magnetic induction type is considered for the Berry\nconnection. This theory assumes that supercurrent exists as a collection of\nstable quantized loop currents, and the transition from the superconducting to\nnormal phase is due to the loss of their stabilizations through the thermal\nfluctuation of the winding numbers of the loop currents. We argue that an\nabrupt change of loop current states with integral quantum numbers should be\ntreated as a quantum transition; then, the direct conversion of the quantized\nloop currents to the magnetic field occurs; consequently, the Joule heat\ngeneration does not occur during the phase transition.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:38:32 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 11:22:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Koizumi","Hiroyasu",""]]}
{"id":"2308.00913","submitter":"Ioannis Papageorgiou","authors":"Ioannis Papageorgiou, Ioannis Kontoyiannis","title":"The Bayesian Context Trees State Space Model for time series modelling\n  and forecasting","comments":"arXiv admin note: text overlap with arXiv:2106.03023","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME econ.EM stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A hierarchical Bayesian framework is introduced for developing rich mixture\nmodels for real-valued time series, along with a collection of effective tools\nfor learning and inference. At the top level, meaningful discrete states are\nidentified as appropriately quantised values of some of the most recent\nsamples. This collection of observable states is described as a discrete\ncontext-tree model. Then, at the bottom level, a different, arbitrary model for\nreal-valued time series - a base model - is associated with each state. This\ndefines a very general framework that can be used in conjunction with any\nexisting model class to build flexible and interpretable mixture models. We\ncall this the Bayesian Context Trees State Space Model, or the BCT-X framework.\nEfficient algorithms are introduced that allow for effective, exact Bayesian\ninference; in particular, the maximum a posteriori probability (MAP)\ncontext-tree model can be identified. These algorithms can be updated\nsequentially, facilitating efficient online forecasting. The utility of the\ngeneral framework is illustrated in two particular instances: When\nautoregressive (AR) models are used as base models, resulting in a nonlinear AR\nmixture model, and when conditional heteroscedastic (ARCH) models are used,\nresulting in a mixture model that offers a powerful and systematic way of\nmodelling the well-known volatility asymmetries in financial data. In\nforecasting, the BCT-X methods are found to outperform state-of-the-art\ntechniques on simulated and real-world data, both in terms of accuracy and\ncomputational requirements. In modelling, the BCT-X structure finds natural\nstructure present in the data. In particular, the BCT-ARCH model reveals a\nnovel, important feature of stock market index data, in the form of an enhanced\nleverage effect.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:40:42 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Papageorgiou","Ioannis",""],["Kontoyiannis","Ioannis",""]]}
{"id":"2308.00914","submitter":"Jacob Higgins","authors":"Jacob Higgins, Nicholas Mohammad, Nicola Bezzo","title":"A Model Predictive Path Integral Method for Fast, Proactive, and\n  Uncertainty-Aware UAV Planning in Cluttered Environments","comments":"Accepted to IROS 2023, 8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current motion planning approaches for autonomous mobile robots often assume\nthat the low level controller of the system is able to track the planned motion\nwith very high accuracy. In practice, however, tracking error can be affected\nby many factors, and could lead to potential collisions when the robot must\ntraverse a cluttered environment. To address this problem, this paper proposes\na novel receding-horizon motion planning approach based on Model Predictive\nPath Integral (MPPI) control theory -- a flexible sampling-based control\ntechnique that requires minimal assumptions on vehicle dynamics and cost\nfunctions. This flexibility is leveraged to propose a motion planning framework\nthat also considers a data-informed risk function. Using the MPPI algorithm as\na motion planner also reduces the number of samples required by the algorithm,\nrelaxing the hardware requirements for implementation. The proposed approach is\nvalidated through trajectory generation for a quadrotor unmanned aerial vehicle\n(UAV), where fast motion increases trajectory tracking error and can lead to\ncollisions with nearby obstacles. Simulations and hardware experiments\ndemonstrate that the MPPI motion planner proactively adapts to the obstacles\nthat the UAV must negotiate, slowing down when near obstacles and moving\nquickly when away from obstacles, resulting in a complete reduction of\ncollisions while still producing lively motion.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:50:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Higgins","Jacob",""],["Mohammad","Nicholas",""],["Bezzo","Nicola",""]]}
{"id":"2308.00915","submitter":"Ryota Kawasumi","authors":"Naoya Hatano, Ryota Kawasumi, Hiroki Saito, Hitoshi Tanaka","title":"Choquet integrals, Hausdorff content and fractional operators","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that the fractional integral operator $I_{\\alpha}$, $0<\\alpha<n$,\nand the fractional maximal operator $M_{\\alpha}$, $0\\le\\alpha<n$, are bounded\non weak Choquet spaces with respect to Hausdorff content. We also investigate\nthese operators on Choquet-Morrey spaces. These results are extensions of the\nprevious works due to Adams, Orobitg and Verdera, and Tang. The results for the\nfractional integral operator $I_{\\alpha}$ are essentially new.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:02:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hatano","Naoya",""],["Kawasumi","Ryota",""],["Saito","Hiroki",""],["Tanaka","Hitoshi",""]]}
{"id":"2308.00916","submitter":"Govinda Dhungana","authors":"Govinda Dhungana, Robert Kehoe, Ryan Staten, Jozsef Vinko, J. Craig\n  Wheeler, Carl W. Akerlof, David Doss, Farley V. Farrente, Coyne A. Gibson,\n  James Lasker, G. H. Marion, Shashi Bhushan Pandey, Robert Quimby, Eli Rykoff,\n  Donald A. Smith, Fang Yuan, WeiKang Zheng","title":"Cosmological Distance Measurement of 12 Nearby Supernovae IIP with\n  ROTSE-IIIB","comments":"19 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present cosmological analysis of 12 nearby ($z<0.06$) Type IIP supernovae\n(SNe IIP) observed with the ROTSE-IIIb telescope. To achieve precise\nphotometry, we present a new image differencing technique that is implemented\nfor the first time on the ROTSE SN photometry pipeline. With this method, we\nfind up to a 20\\% increase in the detection efficiency and significant\nreduction in residual RMS scatter of the SN lightcurves when compared to the\nprevious pipeline performance. We use the published optical spectra and\nbroadband photometry of well studied SNe IIP to establish temporal models for\nejecta velocity and photospheric temperature evolution for our SNe IIP\npopulation. This study yields measurements that are competitive to other\nmethods even when the data are limited to a single epoch during the\nphotospheric phase of SNe IIP. Using the fully reduced ROTSE photometry and\noptical spectra, we apply these models to the respective photometric epochs for\neach SN in the ROTSE IIP sample. This facilitates the use of the Expanding\nPhotosphere Method (EPM) to obtain distance estimates to their respective host\ngalaxies. We then perform cosmological parameter fitting using these EPM\ndistances from which we measure the Hubble constant to be\n$72.9^{+5.7}_{-4.3}~{\\rm kms^{-1}~Mpc^{-1}}$, which is consistent with the\nstandard $\\Lambda CDM$ model values derived using other independent techniques.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:11:51 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 13:39:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dhungana","Govinda",""],["Kehoe","Robert",""],["Staten","Ryan",""],["Vinko","Jozsef",""],["Wheeler","J. Craig",""],["Akerlof","Carl W.",""],["Doss","David",""],["Farrente","Farley V.",""],["Gibson","Coyne A.",""],["Lasker","James",""],["Marion","G. H.",""],["Pandey","Shashi Bhushan",""],["Quimby","Robert",""],["Rykoff","Eli",""],["Smith","Donald A.",""],["Yuan","Fang",""],["Zheng","WeiKang",""]]}
{"id":"2308.00917","submitter":"Tayyab Naseer","authors":"M. Sharif, Tayyab Naseer","title":"Cosmological Solutions through Gravitational Decoupling in\n  $f(\\mathcal{R},\\mathcal{T},\\mathcal{R}_{\\mathrm{a}\\mathrm{b}}\\mathcal{T}^{\\mathrm{a}\\mathrm{b}})$\n  Gravity","comments":"30 pages, 10 figures","journal-ref":"Gen. Relativ. Gravit. 55(2023)87","doi":"10.1007/s10714-023-03135-2","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we adopt minimal gravitational decoupling scheme to extend a\nnon-static spherically symmetric isotropic composition to anisotropic interior\nin\n$f(\\mathcal{R},\\mathcal{T},\\mathcal{R}_{\\mathrm{a}\\mathrm{b}}\\mathcal{T}^{\\mathrm{a}\\mathrm{b}})$\ntheory. A geometric deformation is applied only on $g_{rr}$ metric component\nthrough which the modified field equations are separated into two sets, each of\nthem correspond to their parent (seed and newly added) source. An isotropic\nmodel suggested by the Friedmann-Lemaitre-Robertson-Walker metric is adopted to\nreduce the unknowns in the first set. We then obtain an isotropic solution by\nmaking use of a linear equation of state and a particular form of the scale\nfactor. A density-like constraint is chosen to solve the other sector\ncontaining the deformation function and multiple components of an additional\nmatter source. Further, the graphical interpretation of the developed model is\ncarried out to analyze how a decoupling parameter and modified gravity\ninfluence the evolutionary phases of the universe. It is concluded that only\nthe radiation-dominated era meets stability criteria everywhere in this\nmatter-geometry coupled theory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:14:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sharif","M.",""],["Naseer","Tayyab",""]]}
{"id":"2308.00918","submitter":"Dongjia Zhao","authors":"Dongjia Zhao, Lei Qi, Xiao Shi, Yinghuan Shi, Xin Geng","title":"A Novel Cross-Perturbation for Single Domain Generalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single domain generalization aims to enhance the ability of the model to\ngeneralize to unknown domains when trained on a single source domain. However,\nthe limited diversity in the training data hampers the learning of\ndomain-invariant features, resulting in compromised generalization performance.\nTo address this, data perturbation (augmentation) has emerged as a crucial\nmethod to increase data diversity. Nevertheless, existing perturbation methods\noften focus on either image-level or feature-level perturbations independently,\nneglecting their synergistic effects. To overcome these limitations, we propose\nCPerb, a simple yet effective cross-perturbation method. Specifically, CPerb\nutilizes both horizontal and vertical operations. Horizontally, it applies\nimage-level and feature-level perturbations to enhance the diversity of the\ntraining data, mitigating the issue of limited diversity in single-source\ndomains. Vertically, it introduces multi-route perturbation to learn\ndomain-invariant features from different perspectives of samples with the same\nsemantic category, thereby enhancing the generalization capability of the\nmodel. Additionally, we propose MixPatch, a novel feature-level perturbation\nmethod that exploits local image style information to further diversify the\ntraining data. Extensive experiments on various benchmark datasets validate the\neffectiveness of our method.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:16:12 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhao","Dongjia",""],["Qi","Lei",""],["Shi","Xiao",""],["Shi","Yinghuan",""],["Geng","Xin",""]]}
{"id":"2308.00919","submitter":"Johnny H. Esteves","authors":"Johnny H. Esteves, Yousuke Utsumi, Adam Snyder, Theo Schutt, Alex\n  Broughton, Bahrudin Trbalic, Sidney Mau, Andrew Rasmussen, Andr\\'es A. Plazas\n  Malag\\'on, Andrew Bradshaw, Stuart Marshall, Seth Digel, James Chiang,\n  Marcelle Soares-Santos, Aaron Roodman","title":"Photometry, Centroid and Point-Spread Function Measurements in the LSST\n  Camera Focal Plane Using Artificial Stars","comments":"Submitted to PASP","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Vera C. Rubin Observatory's LSST Camera pixel response has been\ncharacterized using laboratory measurements with a grid of artificial stars. We\nquantify the contributions to photometry, centroid, point-spread function size,\nand shape measurement errors due to small anomalies in the LSSTCam CCDs. The\nmain sources of those anomalies are quantum efficiency variations and pixel\narea variations induced by the amplifier segmentation boundaries and\n\"tree-rings\" -- circular variations in silicon doping concentration. We studied\nthe effects using artificial stars projected on the sensors and find that the\nresulting measurement uncertainties pass the ten-year LSST survey science\nrequirements. In addition, we verify that the tree-ring effects can be\ncorrected using flat-field images if needed, because the astronomic shifts and\nshape measurement errors they induce correlate well with the flat-field signal.\nNevertheless, further sensor anomaly studies with on-sky data should probe\npossible temporal and wavelength-dependent effects.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:16:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Esteves","Johnny H.",""],["Utsumi","Yousuke",""],["Snyder","Adam",""],["Schutt","Theo",""],["Broughton","Alex",""],["Trbalic","Bahrudin",""],["Mau","Sidney",""],["Rasmussen","Andrew",""],["Malag\u00f3n","Andr\u00e9s A. Plazas",""],["Bradshaw","Andrew",""],["Marshall","Stuart",""],["Digel","Seth",""],["Chiang","James",""],["Soares-Santos","Marcelle",""],["Roodman","Aaron",""]]}
{"id":"2308.00920","submitter":"Aydogan Ozcan","authors":"Yuzhu Li, Nir Pillar, Jingxi Li, Tairan Liu, Di Wu, Songyu Sun,\n  Guangdong Ma, Kevin de Haan, Luzhe Huang, Sepehr Hamidi, Anatoly Urisman, Tal\n  Keidar Haran, William Dean Wallace, Jonathan E. Zuckerman, Aydogan Ozcan","title":"Virtual histological staining of unlabeled autopsy tissue","comments":"24 Pages, 7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cs.CV cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Histological examination is a crucial step in an autopsy; however, the\ntraditional histochemical staining of post-mortem samples faces multiple\nchallenges, including the inferior staining quality due to autolysis caused by\ndelayed fixation of cadaver tissue, as well as the resource-intensive nature of\nchemical staining procedures covering large tissue areas, which demand\nsubstantial labor, cost, and time. These challenges can become more pronounced\nduring global health crises when the availability of histopathology services is\nlimited, resulting in further delays in tissue fixation and more severe\nstaining artifacts. Here, we report the first demonstration of virtual staining\nof autopsy tissue and show that a trained neural network can rapidly transform\nautofluorescence images of label-free autopsy tissue sections into brightfield\nequivalent images that match hematoxylin and eosin (H&E) stained versions of\nthe same samples, eliminating autolysis-induced severe staining artifacts\ninherent in traditional histochemical staining of autopsied tissue. Our virtual\nH&E model was trained using >0.7 TB of image data and a data-efficient\ncollaboration scheme that integrates the virtual staining network with an image\nregistration network. The trained model effectively accentuated nuclear,\ncytoplasmic and extracellular features in new autopsy tissue samples that\nexperienced severe autolysis, such as COVID-19 samples never seen before, where\nthe traditional histochemical staining failed to provide consistent staining\nquality. This virtual autopsy staining technique can also be extended to\nnecrotic tissue, and can rapidly and cost-effectively generate artifact-free\nH&E stains despite severe autolysis and cell death, also reducing labor, cost\nand infrastructure requirements associated with the standard histochemical\nstaining.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:31:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Yuzhu",""],["Pillar","Nir",""],["Li","Jingxi",""],["Liu","Tairan",""],["Wu","Di",""],["Sun","Songyu",""],["Ma","Guangdong",""],["de Haan","Kevin",""],["Huang","Luzhe",""],["Hamidi","Sepehr",""],["Urisman","Anatoly",""],["Haran","Tal Keidar",""],["Wallace","William Dean",""],["Zuckerman","Jonathan E.",""],["Ozcan","Aydogan",""]]}
{"id":"2308.00921","submitter":"Linfeng Zhang","authors":"Wing Fung Chong, Daniel Linders, Zhiyu Quan, Linfeng Zhang","title":"Incident-Specific Cyber Insurance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.RM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the current market practice, many cyber insurance products offer a\ncoverage bundle for losses arising from various types of incidents, such as\ndata breaches and ransomware attacks, and the coverage for each incident type\ncomes with a separate limit and deductible. Although this gives prospective\ncyber insurance buyers more flexibility in customizing the coverage and better\nmanages the risk exposures of sellers, it complicates the decision-making\nprocess in determining the optimal amount of risks to retain and transfer for\nboth parties. This paper aims to build an economic foundation for these\nincident-specific cyber insurance products with a focus on how\nincident-specific indemnities should be designed for achieving Pareto\noptimality for both the insurance seller and buyer. Real data on cyber\nincidents is used to illustrate the feasibility of this approach. Several\nimplementation improvement methods for practicality are also discussed.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:34:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chong","Wing Fung",""],["Linders","Daniel",""],["Quan","Zhiyu",""],["Zhang","Linfeng",""]]}
{"id":"2308.00922","submitter":"Ran Huang","authors":"Longyan Wu, Lisheng Tang, Ran Huang","title":"Determination of the Ignorable Boundary Condition and Standard Sample\n  for A Novel in-situ Dynamic Mechanical Analysis Method on Soft Matter","comments":"7 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  An in-situ Dynamic Mechanical Analysis (DMA) method for soft matter developed\nby our group [Wu. et.al. 2022] encounters the problem of irregular samples,\nwhich significantly vary in shape and size in practice, therefore a standard\nsample \"large enough\" to ignore the boundary and size effects is necessary to\ndetermine the baseline of test and build the correspondence between this new\nmethod to classical mechanical tests. In this work, we use finite element\nanalysis to approach the optimal size of a brick sample where the stress on the\nboundaries in three spatial directions are ignorable, and certified the results\nby testing a series of silicone gel samples on the in-situ DMA device. The\nstress-strain of tensile and compression are characterized. The material\nproperties of gel are chosen to be close to the biological soft tissue. The\nsize of 40mm(L)*40mm(W)*20mm(H) is determined to be the optimal result.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:44:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Longyan",""],["Tang","Lisheng",""],["Huang","Ran",""]]}
{"id":"2308.00923","submitter":"Keran Ye","authors":"Keran Ye, Kenneth Chung, Konstantinos Karydis","title":"A Novel Lockable Spring-loaded Prismatic Spine to Support Agile\n  Quadrupedal Locomotion","comments":"To appear in 2023 IEEE IROS","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 way to systematically investigate the effect of\ncompliant prismatic spines in quadrupedal robot locomotion. We develop a novel\nspring-loaded lockable spine module, together with a new Spinal\nCompliance-Integrated Quadruped (SCIQ) platform for both empirical and\nnumerical research. Individual spine tests reveal beneficial spinal\ncharacteristics like a degressive spring, and validate the efficacy of a\nproposed compact locking/unlocking mechanism for the spine. Benchmark vertical\njumping and landing tests with our robot show comparable jumping performance\nbetween the rigid and compliant spines. An observed advantage of the compliant\nspine module is that it can alleviate more challenging landing conditions by\nabsorbing impact energy and dissipating the remainder via feet slipping through\nmuch in cat-like stretching fashion.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:46:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ye","Keran",""],["Chung","Kenneth",""],["Karydis","Konstantinos",""]]}
{"id":"2308.00924","submitter":"Chowdhury Sadman Jahan","authors":"Chowdhury Sadman Jahan and Andreas Savakis","title":"Continual Domain Adaptation on Aerial Images under Gradually Degrading\n  Weather","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":"  Domain adaptation (DA) strives to mitigate the domain gap between the source\ndomain where a model is trained, and the target domain where the model is\ndeployed. When a deep learning model is deployed on an aerial platform, it may\nface gradually degrading weather conditions during operation, leading to\nwidening domain gaps between the training data and the encountered evaluation\ndata. We synthesize two such gradually worsening weather conditions on real\nimages from two existing aerial imagery datasets, generating a total of four\nbenchmark datasets. Under the continual, or test-time adaptation setting, we\nevaluate three DA models on our datasets: a baseline standard DA model and two\ncontinual DA models. In such setting, the models can access only one small\nportion, or one batch of the target data at a time, and adaptation takes place\ncontinually, and over only one epoch of the data. The combination of the\nconstraints of continual adaptation, and gradually deteriorating weather\nconditions provide the practical DA scenario for aerial deployment. Among the\nevaluated models, we consider both convolutional and transformer architectures\nfor comparison. We discover stability issues during adaptation for existing\nbuffer-fed continual DA methods, and offer gradient normalization as a simple\nsolution to curb training instability.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:47:19 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 18:10:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jahan","Chowdhury Sadman",""],["Savakis","Andreas",""]]}
{"id":"2308.00925","submitter":"Rao Li","authors":"R. Li, J. Deka, K. Deka","title":"An Algorithm for the Longest Common Subsequence and Substring Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note, we first introduce a new problem called the longest common\nsubsequence and substring problem. Let $X$ and $Y$ be two strings over an\nalphabet $\\Sigma$. The longest common subsequence and substring problem for $X$\nand $Y$ is to find the longest string which is a subsequence of $X$ and a\nsubstring of $Y$. We propose an algorithm to solve the problem.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:55:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","R.",""],["Deka","J.",""],["Deka","K.",""]]}
{"id":"2308.00926","submitter":"Samia Sultana","authors":"Samia Sultana, Shyla Afroge","title":"Detection and Segmentation of Cosmic Objects Based on Adaptive\n  Thresholding and Back Propagation Neural Network","comments":"4 pages, 7 figures, Bachelor Thesis, Rajshahi University of\n  Engineering and Technology","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Astronomical images provide information about the great variety of cosmic\nobjects in the Universe. Due to the large volumes of data, the presence of\ninnumerable bright point sources as well as noise within the frame and the\nspatial gap between objects and satellite cameras, it is a challenging task to\nclassify and detect the celestial objects. We propose an Adaptive Thresholding\nMethod (ATM) based segmentation and Back Propagation Neural Network (BPNN)\nbased cosmic object detection including a well-structured series of\npre-processing steps designed to enhance segmentation and detection.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:02:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sultana","Samia",""],["Afroge","Shyla",""]]}
{"id":"2308.00927","submitter":"Jeremias Garay","authors":"Jeremias Garay, Jocelyn Dunstan, Sergio Uribe, Francisco Sahli\n  Costabal","title":"Physics-informed neural networks for blood flow inverse problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Physics-informed neural networks (PINNs) have emerged as a powerful tool for\nsolving inverse problems, especially in cases where no complete information\nabout the system is known and scatter measurements are available. This is\nespecially useful in hemodynamics since the boundary information is often\ndifficult to model, and high-quality blood flow measurements are generally hard\nto obtain. In this work, we use the PINNs methodology for estimating\nreduced-order model parameters and the full velocity field from scatter 2D\nnoisy measurements in the ascending aorta. The results show stable and accurate\nparameter estimations when using the method with simulated data, while the\nvelocity reconstruction shows dependence on the measurement quality and the\nflow pattern complexity. The method allows for solving clinical-relevant\ninverse problems in hemodynamics and complex coupled physical systems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:04:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Garay","Jeremias",""],["Dunstan","Jocelyn",""],["Uribe","Sergio",""],["Costabal","Francisco Sahli",""]]}
{"id":"2308.00928","submitter":"Angus Dempster","authors":"Angus Dempster, Daniel F. Schmidt, Geoffrey I. Webb","title":"QUANT: A Minimalist Interval Method for Time Series Classification","comments":"26 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that it is possible to achieve the same accuracy, on average, as the\nmost accurate existing interval methods for time series classification on a\nstandard set of benchmark datasets using a single type of feature (quantiles),\nfixed intervals, and an 'off the shelf' classifier. This distillation of\ninterval-based approaches represents a fast and accurate method for time series\nclassification, achieving state-of-the-art accuracy on the expanded set of 142\ndatasets in the UCR archive with a total compute time (training and inference)\nof less than 15 minutes using a single CPU core.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:06:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dempster","Angus",""],["Schmidt","Daniel F.",""],["Webb","Geoffrey I.",""]]}
{"id":"2308.00929","submitter":"Suncheng Xiang","authors":"Suncheng Xiang, Qingzhong Chen, Shilun Cai, Chengfeng Zhou, Crystal\n  Cai, Sijia Du, Dahong Qian","title":"Towards Discriminative Representation with Meta-learning for\n  Colonoscopic Polyp Re-Identification","comments":"arXiv admin note: text overlap with arXiv:2307.10625","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Colonoscopic Polyp Re-Identification aims to match the same polyp from a\nlarge gallery with images from different views taken using different cameras\nand plays an important role in the prevention and treatment of colorectal\ncancer in computer-aided diagnosis. However, traditional methods for object\nReID directly adopting CNN models trained on the ImageNet dataset usually\nproduce unsatisfactory retrieval performance on colonoscopic datasets due to\nthe large domain gap. Additionally, these methods neglect to explore the\npotential of self-discrepancy among intra-class relations in the colonoscopic\npolyp dataset, which remains an open research problem in the medical community.\nTo solve this dilemma, we propose a simple but effective training method named\nColo-ReID, which can help our model to learn more general and discriminative\nknowledge based on the meta-learning strategy in scenarios with fewer samples.\nBased on this, a dynamic Meta-Learning Regulation mechanism called MLR is\nintroduced to further boost the performance of polyp re-identification. To the\nbest of our knowledge, this is the first attempt to leverage the meta-learning\nparadigm instead of traditional machine learning to effectively train deep\nmodels in the task of colonoscopic polyp re-identification. Empirical results\nshow that our method significantly outperforms current state-of-the-art methods\nby a clear margin.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:10:14 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Xiang","Suncheng",""],["Chen","Qingzhong",""],["Cai","Shilun",""],["Zhou","Chengfeng",""],["Cai","Crystal",""],["Du","Sijia",""],["Qian","Dahong",""]]}
{"id":"2308.00930","submitter":"Tadashi Machida","authors":"Tadashi Machida and Tetsuo Hanaguri","title":"Searching for Majorana quasiparticles at vortex cores in iron-based\n  superconductors","comments":"22 pages, 7 figures","journal-ref":null,"doi":"10.1093/ptep/ptad084","report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The unambiguous detection of the Majorana zero mode (MZM), which is essential\nfor future topological quantum computing, has been a challenge in recent\ncondensed matter experiments. The MZM is expected to emerge at the vortex core\nof topological superconductors as a zero-energy vortex bound state (ZVBS),\namenable to detection using scanning tunneling microscopy/spectroscopy\n(STM/STS). However, the typical energy resolution of STM/STS has made it\nchallenging to distinguish the MZM from the low-lying trivial vortex bound\nstates. Here, we review the recent high-energy-resolution STM/STS experiments\non the vortex cores of Fe(Se,Te), where the MZM is expected to emerge, and the\nenergy of the lowest trivial bound states is reasonably high. Tunneling spectra\ntaken at the vortex cores exhibit a ZVBS well below any possible trivial state,\nsuggesting its MZM origin. However, it should be noted that ZVBS is a necessary\nbut not sufficient condition for the MZM; a qualitative feature unique to the\nMZM needs to be explored. We discuss the current status and issues in the\npursuit of such Majorananess, namely the level sequence of the vortex bound\nstates and the conductance plateau of the ZVBS. We also argue for future\nexperiments to confirm the Majorananess, such as the detection of the doubling\nof the shot noise intensity and spin polarization of the MZM.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:11:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Machida","Tadashi",""],["Hanaguri","Tetsuo",""]]}
{"id":"2308.00931","submitter":"Risheng Liu","authors":"Zengxi Zhang, Zhiying Jiang, Jinyuan Liu, Xin Fan, Risheng Liu","title":"WaterFlow: Heuristic Normalizing Flow for Underwater Image Enhancement\n  and Beyond","comments":"10 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Underwater images suffer from light refraction and absorption, which impairs\nvisibility and interferes the subsequent applications. Existing underwater\nimage enhancement methods mainly focus on image quality improvement, ignoring\nthe effect on practice. To balance the visual quality and application, we\npropose a heuristic normalizing flow for detection-driven underwater image\nenhancement, dubbed WaterFlow. Specifically, we first develop an invertible\nmapping to achieve the translation between the degraded image and its clear\ncounterpart. Considering the differentiability and interpretability, we\nincorporate the heuristic prior into the data-driven mapping procedure, where\nthe ambient light and medium transmission coefficient benefit credible\ngeneration. Furthermore, we introduce a detection perception module to transmit\nthe implicit semantic guidance into the enhancement procedure, where the\nenhanced images hold more detection-favorable features and are able to promote\nthe detection performance. Extensive experiments prove the superiority of our\nWaterFlow, against state-of-the-art methods quantitatively and qualitatively.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:17:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Zengxi",""],["Jiang","Zhiying",""],["Liu","Jinyuan",""],["Fan","Xin",""],["Liu","Risheng",""]]}
{"id":"2308.00932","submitter":"Lei Chen","authors":"Yue Wang, Lei Chen, Yinping Pan, Denghui Zhang, Shujie Yu, Guangting\n  Wu, Xiaoyu Liu, Ling Wu, Weifeng Shi, Guofeng Zhang, Lu Zhang, Wei Peng, Jie\n  Ren, Zhen Wang","title":"Geometric Scaling of the Current-Phase Relation of Niobium Nano-Bridge\n  Junctions","comments":"20 pages, 10 figures","journal-ref":null,"doi":"10.1021/acsnano.3c01301","report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nano-bridge junction (NBJ) is a type of Josephson junction that is\nadvantageous for the miniaturization of superconducting circuits. However, the\ncurrent-phase relation (CPR) of the NBJ usually deviates from a sinusoidal\nfunction which has been explained by a simplified model with correlation only\nto its effective length. Here, we investigated both measured and calculated\nCPRs of niobium NBJs of a cuboidal shape with a three-dimensional bank\nstructure. From a sine-wave to a saw-tooth-like form, we showed that deviated\nCPRs of NBJs can be described quantitatively by its skewness {\\Delta}{\\theta}.\nFurthermore, the measured dependency of {\\Delta}{\\theta} on the critical\ncurrent {I_0} from 108 NBJs turned out to be consistent with the calculated\nones derived from the change in geometric dimensions. It suggested that the\nCPRs of NBJs can be tuned by their geometric dimensions. In addition, the\ncalculated scaling behavior of {\\Delta}{\\theta} versus {I_0} in\nthree-dimensional space was provided for the future design of superconducting\ncircuits of a high integration level by using niobium NBJs.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:21:27 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Yue",""],["Chen","Lei",""],["Pan","Yinping",""],["Zhang","Denghui",""],["Yu","Shujie",""],["Wu","Guangting",""],["Liu","Xiaoyu",""],["Wu","Ling",""],["Shi","Weifeng",""],["Zhang","Guofeng",""],["Zhang","Lu",""],["Peng","Wei",""],["Ren","Jie",""],["Wang","Zhen",""]]}
{"id":"2308.00933","submitter":"Yafei Ren","authors":"Yafei Ren, Mark Rudner, and Di Xiao","title":"Light Driven Spontaneous Phonon Chirality and Magnetization in\n  Paramagnets","comments":"5 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":"  Spin-phonon coupling enables the mutual manipulation of phonon and spin\ndegrees of freedom in solids. In this study, we reveal the inherent\nnonlinearity within this coupling. Using a paramagnet as an illustration, we\ndemonstrate the nonlinearity by unveiling spontaneous symmetry breaking under a\nperiodic drive. The drive originates from linearly polarized light, respecting\na mirror reflection symmetry of the system. However, this symmetry is\nspontaneously broken in the steady state, manifested in the emergence of\ncoherent chiral phonons accompanied by a nonzero magnetization. We establish an\nanalytical self-consistent equation to find the parameter regime where\nspontaneous symmetry breaking occurs. Furthermore, we estimate realistic\nparameters and discuss potential materials that could exhibit this behavior.\nOur findings shed light on the exploration of nonlinear phenomena in magnetic\nmaterials and present possibilities for on-demand control of magnetization.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:21:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ren","Yafei",""],["Rudner","Mark",""],["Xiao","Di",""]]}
{"id":"2308.00934","submitter":"Jacob Shapiro","authors":"Jacob Shapiro","title":"Chiral Random Band Matrices at Zero Energy","comments":"4 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":"  We present a special model of random band matrices where, at zero energy, the\nfamous Fyodorov and Mirlin $\\sqrt{N}$-conjecture can be established very\nsimply.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:26:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shapiro","Jacob",""]]}
{"id":"2308.00935","submitter":"Rafael Alves Batista","authors":"Rafael Alves Batista, Cristina Viviente, Gaetano Di Marco, Miguel A.\n  S\\'anchez-Conde","title":"Axion-like particles and high-energy gamma rays: interconversion\n  revisited","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023)","journal-ref":"PoS(ICRC2023)1383","doi":"10.22323/1.444.1383","report-no":null,"categories":"hep-ph astro-ph.CO astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Axion-like particles (ALPs) are hypothetical entities often invoked to solve\nvarious problems in particle physics to cosmology. They are one of the most\npromising candidates to explain the elusive dark matter. A way to search for\nALPs is through their effects on photons. In the presence of external magnetic\nfields, ALPs and photons can convert into one another, leading to measurable\nsignals. In this contribution we present results of Monte Carlo simulations of\nALP-photon interconversion in magnetised environments. We focus on high-energy\ngamma rays with TeV energies travelling over cosmological distances. We include\na full treatment of the intergalactic electromagnetic cascades triggered by the\ngamma rays. Finally, we discuss the impact of this improved treatment of the\npropagation for current and future ALP searches.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:31:43 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 17:42:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Batista","Rafael Alves",""],["Viviente","Cristina",""],["Di Marco","Gaetano",""],["S\u00e1nchez-Conde","Miguel A.",""]]}
{"id":"2308.00936","submitter":"Xinze Li","authors":"Xinze Li, Kezhi Mao, Fanfan Lin, Xin Zhang","title":"Particle swarm optimization with state-based adaptive velocity limit\n  strategy","comments":"33 pages, 8 figures","journal-ref":null,"doi":"10.1016/j.neucom.2021.03.077","report-no":null,"categories":"cs.NE cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Velocity limit (VL) has been widely adopted in many variants of particle\nswarm optimization (PSO) to prevent particles from searching outside the\nsolution space. Several adaptive VL strategies have been introduced with which\nthe performance of PSO can be improved. However, the existing adaptive VL\nstrategies simply adjust their VL based on iterations, leading to\nunsatisfactory optimization results because of the incompatibility between VL\nand the current searching state of particles. To deal with this problem, a\nnovel PSO variant with state-based adaptive velocity limit strategy (PSO-SAVL)\nis proposed. In the proposed PSO-SAVL, VL is adaptively adjusted based on the\nevolutionary state estimation (ESE) in which a high value of VL is set for\nglobal searching state and a low value of VL is set for local searching state.\nBesides that, limit handling strategies have been modified and adopted to\nimprove the capability of avoiding local optima. The good performance of\nPSO-SAVL has been experimentally validated on a wide range of benchmark\nfunctions with 50 dimensions. The satisfactory scalability of PSO-SAVL in\nhigh-dimension and large-scale problems is also verified. Besides, the merits\nof the strategies in PSO-SAVL are verified in experiments. Sensitivity analysis\nfor the relevant hyper-parameters in state-based adaptive VL strategy is\nconducted, and insights in how to select these hyper-parameters are also\ndiscussed.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:33:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Xinze",""],["Mao","Kezhi",""],["Lin","Fanfan",""],["Zhang","Xin",""]]}
{"id":"2308.00937","submitter":"Xiaofeng Gao","authors":"Ran Gong, Xiaofeng Gao, Qiaozi Gao, Suhaila Shakiah, Govind Thattai,\n  Gaurav S. Sukhatme","title":"LEMMA: Learning Language-Conditioned Multi-Robot Manipulation","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Complex manipulation tasks often require robots with complementary\ncapabilities to collaborate. We introduce a benchmark for LanguagE-Conditioned\nMulti-robot MAnipulation (LEMMA) focused on task allocation and long-horizon\nobject manipulation based on human language instructions in a tabletop setting.\nLEMMA features 8 types of procedurally generated tasks with varying degree of\ncomplexity, some of which require the robots to use tools and pass tools to\neach other. For each task, we provide 800 expert demonstrations and human\ninstructions for training and evaluations. LEMMA poses greater challenges\ncompared to existing benchmarks, as it requires the system to identify each\nmanipulator's limitations and assign sub-tasks accordingly while also handling\nstrong temporal dependencies in each task. To address these challenges, we\npropose a modular hierarchical planning approach as a baseline. Our results\nhighlight the potential of LEMMA for developing future language-conditioned\nmulti-robot systems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:37:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gong","Ran",""],["Gao","Xiaofeng",""],["Gao","Qiaozi",""],["Shakiah","Suhaila",""],["Thattai","Govind",""],["Sukhatme","Gaurav S.",""]]}
{"id":"2308.00938","submitter":"Amir Ziai","authors":"Ziheng Wang, Atem Aguer, and Amir Ziai","title":"DPA Load Balancer: Load balancing for Data Parallel Actor-based systems","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this project we explore ways to dynamically load balance actors in a\nstreaming framework. This is used to address input data skew that might lead to\nstragglers. We continuously monitor actors' input queue lengths for load, and\nredistribute inputs among reducers using consistent hashing if we detect\nstragglers. To ensure consistent processing post-redistribution, we adopt an\napproach that uses input forwarding combined with a state merge step at the end\nof the processing. We show that this approach can greatly alleviate stragglers\nfor skewed data.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:42:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Ziheng",""],["Aguer","Atem",""],["Ziai","Amir",""]]}
{"id":"2308.00939","submitter":"Xinze Li","authors":"Xinze Li, Kezhi Mao, Fanfan Lin, Zijian Feng","title":"Feature-aware conditional GAN for category text generation","comments":"27 pages, 8 figures","journal-ref":null,"doi":"10.1016/j.neucom.2023.126352","report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Category text generation receives considerable attentions since it is\nbeneficial for various natural language processing tasks. Recently, the\ngenerative adversarial network (GAN) has attained promising performance in text\ngeneration, attributed to its adversarial training process. However, there are\nseveral issues in text GANs, including discreteness, training instability, mode\ncollapse, lack of diversity and controllability etc. To address these issues,\nthis paper proposes a novel GAN framework, the feature-aware conditional GAN\n(FA-GAN), for controllable category text generation. In FA-GAN, the generator\nhas a sequence-to-sequence structure for improving sentence diversity, which\nconsists of three encoders including a special feature-aware encoder and a\ncategory-aware encoder, and one relational-memory-core-based decoder with the\nGumbel SoftMax activation function. The discriminator has an additional\ncategory classification head. To generate sentences with specified categories,\nthe multi-class classification loss is supplemented in the adversarial\ntraining. Comprehensive experiments have been conducted, and the results show\nthat FA-GAN consistently outperforms 10 state-of-the-art text generation\napproaches on 6 text classification datasets. The case study demonstrates that\nthe synthetic sentences generated by FA-GAN can match the required categories\nand are aware of the features of conditioned sentences, with good readability,\nfluency, and text authenticity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:43:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Xinze",""],["Mao","Kezhi",""],["Lin","Fanfan",""],["Feng","Zijian",""]]}
{"id":"2308.00940","submitter":"Qinfeng Li","authors":"Qinfeng Li, Lu Xu","title":"A stronger constant rank theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated from one-dimensional rigidity results of entire solutions to\nLiouville equation, we consider the semilinear equation \\begin{align}\n  \\label{liouvilleequationab} \\Delta u=G(u) \\quad \\mbox{in $\\mathbb{R}^n$},\n\\end{align}where $G>0, G'<0$ and $GG^{''}\\le A(G')^2$, with $A>0$. Let $u$ be a\nsmooth convex solution and $\\sigma_k(D^2 u)$ be the $k$-th elementary symmetric\npolynomial with respect to $D^2u$. We prove stronger constant rank theorems in\nthe following sense. (1) When $A\\le 2$, if $\\sigma_2(D^2u)$ takes a local\nminimum, then $D^2 u$ has constant rank $1$. (2) When $A\\le \\frac{n}{n-1}$, if\n$\\sigma_n(D^2 u)$ takes a local minimum, then $\\sigma_n(D^2 u)$ is always zero\nin the domain.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:46:16 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 01:57:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Qinfeng",""],["Xu","Lu",""]]}
{"id":"2308.00941","submitter":"Jessica Mount","authors":"Jessica L. Mount, Vernon R. Brown, Justin C. Meadows","title":"Highly Sensitive Dual-Core Photonic Metal Fiber","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this study, we propose an all-solid cladding dual-core metal fiber (DC-MF)\nfilled with toluene and ethanol for temperature sensing applications. Instead\nof using air holes in the cladding region, we employ fluorine doped silica\nglass to form an all-solid cladding. By selectively filling toluene and ethanol\ninto three air holes near the core region, we investigate the temperature\nsensing characteristics numerically. Simulation results demonstrate that the\naverage sensitivity of the temperature sensing can reach -11.64 and -7.41 nm/C\nwithin the temperature ranges of 0 to 70 C and -80 to 0 C, respectively, even\nwith a short DC-MF length of 1.6 mm. The maximum sensitivity in the considered\ntemperature ranges can reach up to -15 and -9 nm/C, respectively. Furthermore,\nthe proposed temperature sensor exhibits insensitivity to hydrostatic pressure.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:51:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Mount","Jessica L.",""],["Brown","Vernon R.",""],["Meadows","Justin C.",""]]}
{"id":"2308.00942","submitter":"Kaiqiang Wang","authors":"Kaiqiang Wang, Li Song, Chutian Wang, Zhenbo Ren, Guangyuan Zhao,\n  Jiazhen Dou, Jianglei Di, George Barbastathis, Renjie Zhou, Jianlin Zhao, and\n  Edmund Y. Lam","title":"On the use of deep learning for phase recovery","comments":"82 pages, 32 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phase recovery (PR) refers to calculating the phase of the light field from\nits intensity measurements. As exemplified from quantitative phase imaging and\ncoherent diffraction imaging to adaptive optics, PR is essential for\nreconstructing the refractive index distribution or topography of an object and\ncorrecting the aberration of an imaging system. In recent years, deep learning\n(DL), often implemented through deep neural networks, has provided\nunprecedented support for computational imaging, leading to more efficient\nsolutions for various PR problems. In this review, we first briefly introduce\nconventional methods for PR. Then, we review how DL provides support for PR\nfrom the following three stages, namely, pre-processing, in-processing, and\npost-processing. We also review how DL is used in phase image processing.\nFinally, we summarize the work in DL for PR and outlook on how to better use DL\nto improve the reliability and efficiency in PR. Furthermore, we present a\nlive-updating resource (https://github.com/kqwang/phase-recovery) for readers\nto learn more about PR.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:52:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Kaiqiang",""],["Song","Li",""],["Wang","Chutian",""],["Ren","Zhenbo",""],["Zhao","Guangyuan",""],["Dou","Jiazhen",""],["Di","Jianglei",""],["Barbastathis","George",""],["Zhou","Renjie",""],["Zhao","Jianlin",""],["Lam","Edmund Y.",""]]}
{"id":"2308.00943","submitter":"Odelu Vanga Dr","authors":"KG Raghavendra Narayan, Srijanee Mookherji, Vanga Odelu, Rajendra\n  Prasath, Anish Chand Turlapaty, Ashok Kumar Das","title":"IIDS: Design of Intelligent Intrusion Detection System for\n  Internet-of-Things Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With rapid technological growth, security attacks are drastically increasing.\nIn many crucial Internet-of-Things (IoT) applications such as healthcare and\ndefense, the early detection of security attacks plays a significant role in\nprotecting huge resources. An intrusion detection system is used to address\nthis problem. The signature-based approaches fail to detect zero-day attacks.\nSo anomaly-based detection particularly AI tools, are becoming popular. In\naddition, the imbalanced dataset leads to biased results. In Machine Learning\n(ML) models, F1 score is an important metric to measure the accuracy of\nclass-level correct predictions. The model may fail to detect the target\nsamples if the F1 is considerably low. It will lead to unrecoverable\nconsequences in sensitive applications such as healthcare and defense. So, any\nimprovement in the F1 score has significant impact on the resource protection.\nIn this paper, we present a framework for ML-based intrusion detection system\nfor an imbalanced dataset. In this study, the most recent dataset, namely\nCICIoT2023 is considered. The random forest (RF) algorithm is used in the\nproposed framework. The proposed approach improves 3.72%, 3.75% and 4.69% in\nprecision, recall and F1 score, respectively, with the existing method.\nAdditionally, for unsaturated classes (i.e., classes with F1 score < 0.99), F1\nscore improved significantly by 7.9%. As a result, the proposed approach is\nmore suitable for IoT security applications for efficient detection of\nintrusion and is useful in further studies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:52:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Narayan","KG Raghavendra",""],["Mookherji","Srijanee",""],["Odelu","Vanga",""],["Prasath","Rajendra",""],["Turlapaty","Anish Chand",""],["Das","Ashok Kumar",""]]}
{"id":"2308.00944","submitter":"Rahul Peddi","authors":"Rahul Peddi and Nicola Bezzo","title":"A Decision Tree-based Monitoring and Recovery Framework for Autonomous\n  Robots with Decision Uncertainties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous mobile robots (AMR) operating in the real world often need to make\ncritical decisions that directly impact their own safety and the safety of\ntheir surroundings. Learning-based approaches for decision making have gained\npopularity in recent years, since decisions can be made very quickly and with\nreasonable levels of accuracy for many applications. These approaches, however,\ntypically return only one decision, and if the learner is poorly trained or\nobservations are noisy, the decision may be incorrect. This problem is further\nexacerbated when the robot is making decisions about its own failures, such as\nfaulty actuators or sensors and external disturbances, when a wrong decision\ncan immediately cause damage to the robot. In this paper, we consider this very\ncase study: a robot dealing with such failures must quickly assess\nuncertainties and make safe decisions. We propose an uncertainty aware\nlearning-based failure detection and recovery approach, in which we leverage\nDecision Tree theory along with Model Predictive Control to detect and explain\nwhich failure is compromising the system, assess uncertainties associated with\nthe failure, and lastly, find and validate corrective controls to recover the\nsystem. Our approach is validated with simulations and real experiments on a\nfaulty unmanned ground vehicle (UGV) navigation case study, demonstrating\nrecovery to safety under uncertainties.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:53:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Peddi","Rahul",""],["Bezzo","Nicola",""]]}
{"id":"2308.00945","submitter":"Yaohui Guo","authors":"Yaohui Guo, X. Jessie Yang, Cong Shi","title":"Reward Shaping for Building Trustworthy Robots in Sequential Human-Robot\n  Interaction","comments":"In Proceedings of 2023 IEEE/RSJ International Conference on\n  Intelligent Robots and Systems (IROS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Trust-aware human-robot interaction (HRI) has received increasing research\nattention, as trust has been shown to be a crucial factor for effective HRI.\nResearch in trust-aware HRI discovered a dilemma -- maximizing task rewards\noften leads to decreased human trust, while maximizing human trust would\ncompromise task performance. In this work, we address this dilemma by\nformulating the HRI process as a two-player Markov game and utilizing the\nreward-shaping technique to improve human trust while limiting performance\nloss. Specifically, we show that when the shaping reward is potential-based,\nthe performance loss can be bounded by the potential functions evaluated at the\nfinal states of the Markov game. We apply the proposed framework to the\nexperience-based trust model, resulting in a linear program that can be\nefficiently solved and deployed in real-world applications. We evaluate the\nproposed framework in a simulation scenario where a human-robot team performs a\nsearch-and-rescue mission. The results demonstrate that the proposed framework\nsuccessfully modifies the robot's optimal policy, enabling it to increase human\ntrust at a minimal task performance cost.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:57:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Guo","Yaohui",""],["Yang","X. Jessie",""],["Shi","Cong",""]]}
{"id":"2308.00946","submitter":"Tim Hartill","authors":"Tim Hartill, Neset Tan, Michael Witbrock, Patricia J. Riddle","title":"Teaching Smaller Language Models To Generalise To Unseen Compositional\n  Questions","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":"  We equip a smaller Language Model to generalise to answering challenging\ncompositional questions that have not been seen in training. To do so we\npropose a combination of multitask supervised pretraining on up to 93 tasks\ndesigned to instill diverse reasoning abilities, and a dense retrieval system\nthat aims to retrieve a set of evidential paragraph fragments. Recent progress\nin question-answering has been achieved either through prompting methods\nagainst very large pretrained Language Models in zero or few-shot fashion, or\nby fine-tuning smaller models, sometimes in conjunction with information\nretrieval. We focus on the less explored question of the extent to which\nzero-shot generalisation can be enabled in smaller models with retrieval\nagainst a corpus within which sufficient information to answer a particular\nquestion may not exist. We establish strong baselines in this setting for\ndiverse evaluation datasets (StrategyQA, CommonsenseQA, IIRC, DROP, Musique and\nARC-DA), and show that performance can be significantly improved by adding\nretrieval-augmented training datasets which are designed to expose our models\nto a variety of heuristic reasoning strategies such as weighing partial\nevidence or ignoring an irrelevant context.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:00:12 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 00:28:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hartill","Tim",""],["Tan","Neset",""],["Witbrock","Michael",""],["Riddle","Patricia J.",""]]}
{"id":"2308.00947","submitter":"Ning Zhenyuan","authors":"Zhenyuan Ning, Yixiao Mao, Qianjin Feng, Shengzhou Zhong, and Yu Zhang","title":"Decomposing and Coupling Saliency Map for Lesion Segmentation in\n  Ultrasound Images","comments":"18 pages, 18 figures","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":"  Complex scenario of ultrasound image, in which adjacent tissues (i.e.,\nbackground) share similar intensity with and even contain richer texture\npatterns than lesion region (i.e., foreground), brings a unique challenge for\naccurate lesion segmentation. This work presents a decomposition-coupling\nnetwork, called DC-Net, to deal with this challenge in a\n(foreground-background) saliency map disentanglement-fusion manner. The DC-Net\nconsists of decomposition and coupling subnets, and the former preliminarily\ndisentangles original image into foreground and background saliency maps,\nfollowed by the latter for accurate segmentation under the assistance of\nsaliency prior fusion. The coupling subnet involves three aspects of fusion\nstrategies, including: 1) regional feature aggregation (via differentiable\ncontext pooling operator in the encoder) to adaptively preserve local\ncontextual details with the larger receptive field during dimension reduction;\n2) relation-aware representation fusion (via cross-correlation fusion module in\nthe decoder) to efficiently fuse low-level visual characteristics and\nhigh-level semantic features during resolution restoration; 3) dependency-aware\nprior incorporation (via coupler) to reinforce foreground-salient\nrepresentation with the complementary information derived from background\nrepresentation. Furthermore, a harmonic loss function is introduced to\nencourage the network to focus more attention on low-confidence and hard\nsamples. The proposed method is evaluated on two ultrasound lesion segmentation\ntasks, which demonstrates the remarkable performance improvement over existing\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:02:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ning","Zhenyuan",""],["Mao","Yixiao",""],["Feng","Qianjin",""],["Zhong","Shengzhou",""],["Zhang","Yu",""]]}
{"id":"2308.00948","submitter":"Mijia Lai","authors":"Mijia Lai and Guoqiang Wu","title":"Rigidity of Schouten Tensor under Conformal Deformation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We obtain some rigidity results for metrics whose Schouten tensor is bounded\nfrom below after conformal transformations. Liang Cheng recently proved that a\ncomplete, nonflat, locally conformally flat manifold with Ricci pinching\ncondition ($Ric-\\epsilon Rg\\geq 0$) must be compact. This answers higher\ndimensional Hamilton's pinching conjecture on locally conformally flat\nmanifolds affirmatively. Since (modified) Schouten tensor being nonnegative is\nequivalent to a Ricci pinching condition, our main result yields a simple proof\nof Cheng's theorem.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:06:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lai","Mijia",""],["Wu","Guoqiang",""]]}
{"id":"2308.00949","submitter":"Yuchen Shen","authors":"Yuchen Shen, Dong Zhang, Yuhui Zheng, Zechao Li, Liyong Fu, Qiaolin Ye","title":"Training-Free Instance Segmentation from Semantic Image Segmentation\n  Masks","comments":"14 pages,5 figures","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 development of instance segmentation has garnered\nsignificant attention in a wide range of applications. However, the training of\na fully-supervised instance segmentation model requires costly both\ninstance-level and pixel-level annotations. In contrast, weakly-supervised\ninstance segmentation methods (i.e., with image-level class labels or point\nlabels) struggle to satisfy the accuracy and recall requirements of practical\nscenarios. In this paper, we propose a novel paradigm for instance segmentation\ncalled training-free instance segmentation (TFISeg), which achieves instance\nsegmentation results from image masks predicted using off-the-shelf semantic\nsegmentation models. TFISeg does not require training a semantic or/and\ninstance segmentation model and avoids the need for instance-level image\nannotations. Therefore, it is highly efficient. Specifically, we first obtain a\nsemantic segmentation mask of the input image via a trained semantic\nsegmentation model. Then, we calculate a displacement field vector for each\npixel based on the segmentation mask, which can indicate representations\nbelonging to the same class but different instances, i.e., obtaining the\ninstance-level object information. Finally, instance segmentation results are\nobtained after being refined by a learnable category-agnostic object boundary\nbranch. Extensive experimental results on two challenging datasets and\nrepresentative semantic segmentation baselines (including CNNs and\nTransformers) demonstrate that TFISeg can achieve competitive results compared\nto the state-of-the-art fully-supervised instance segmentation methods without\nthe need for additional human resources or increased computational costs. The\ncode is available at: TFISeg\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:13:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shen","Yuchen",""],["Zhang","Dong",""],["Zheng","Yuhui",""],["Li","Zechao",""],["Fu","Liyong",""],["Ye","Qiaolin",""]]}
{"id":"2308.00950","submitter":"Guenther Walther","authors":"Guenther Walther and Qian Zhao","title":"Beta-trees: Multivariate histograms with confidence statements","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multivariate histograms are difficult to construct due to the curse of\ndimensionality. Motivated by $k$-d trees in computer science, we show how to\nconstruct an efficient data-adaptive partition of Euclidean space that\npossesses the following two properties: With high confidence the distribution\nfrom which the data are generated is close to uniform on each rectangle of the\npartition; and despite the data-dependent construction we can give guaranteed\nfinite sample simultaneous confidence intervals for the probabilities (and\nhence for the average densities) of each rectangle in the partition. This\npartition will automatically adapt to the sizes of the regions where the\ndistribution is close to uniform. The methodology produces confidence intervals\nwhose widths depend only on the probability content of the rectangles and not\non the dimensionality of the space, thus avoiding the curse of dimensionality.\nMoreover, the widths essentially match the optimal widths in the univariate\nsetting. The simultaneous validity of the confidence intervals allows to use\nthis construction, which we call {\\sl Beta-trees}, for various data-analytic\npurposes. We illustrate this by using Beta-trees for visualizing data and for\nmultivariate mode-hunting.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:16:27 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Walther","Guenther",""],["Zhao","Qian",""]]}
{"id":"2308.00951","submitter":"Joan Puigcerver","authors":"Joan Puigcerver, Carlos Riquelme, Basil Mustafa, Neil Houlsby","title":"From Sparse to Soft Mixtures of Experts","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":"  Sparse mixture of expert architectures (MoEs) scale model capacity without\nlarge increases in training or inference costs. Despite their success, MoEs\nsuffer from a number of issues: training instability, token dropping, inability\nto scale the number of experts, or ineffective finetuning. In this work, we\nproposeSoft MoE, a fully-differentiable sparse Transformer that addresses these\nchallenges, while maintaining the benefits of MoEs. Soft MoE performs an\nimplicit soft assignment by passing different weighted combinations of all\ninput tokens to each expert. As in other MoE works, experts in Soft MoE only\nprocess a subset of the (combined) tokens, enabling larger model capacity at\nlower inference cost. In the context of visual recognition, Soft MoE greatly\noutperforms standard Transformers (ViTs) and popular MoE variants (Tokens\nChoice and Experts Choice). For example, Soft MoE-Base/16 requires 10.5x lower\ninference cost (5.7x lower wall-clock time) than ViT-Huge/14 while matching its\nperformance after similar training. Soft MoE also scales well: Soft MoE Huge/14\nwith 128 experts in 16 MoE layers has over 40x more parameters than ViT\nHuge/14, while inference time cost grows by only 2%, and it performs\nsubstantially better.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:20:55 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Puigcerver","Joan",""],["Riquelme","Carlos",""],["Mustafa","Basil",""],["Houlsby","Neil",""]]}
{"id":"2308.00952","submitter":"Yee Sin Ang","authors":"Bi Hong Tiang, Yee Sin Ang, L. K. Ang","title":"Over-Barrier Photoelectron Emission with Rashba Spin-Orbit Coupling","comments":"6 pages, 3 figures","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":"  We develop a theoretical model to calculate the quantum efficiency (QE) of\nphotoelectron emission from materials with Rashba spin-orbit coupling (RSOC)\neffect. In the low temperature limit, an analytical scaling between QE and the\nRSOC strength is obtained as QE $\\propto (\\hbar\\omega-W)^2+2E_R(\\hbar \\omega-W)\n-E_R^2/3$, where $\\hbar\\omega$, $W$ and $E_R$ are the incident photon energy,\nwork function and the RSOC parameter respectively. Intriguingly, the RSOC\neffect substantially improves the QE for strong RSOC materials. For example,\nthe QE of Bi$_2$Se$_3$ and Bi/Si(111) increases, by 149\\% and 122\\%,\nrespectively due to the presence of strong RSOC. By fitting to the\nphotoelectron emission characteristics, the analytical scaling law can be\nemployed to extract the RSOC strength, thus offering a useful tool to\ncharacterize the RSOC effect in materials. Importantly, when the traditional\nFowler-Dubridge model is used, the extracted results may substantially deviate\nfrom the actual values by $\\sim90\\%$, thus highlighting the importance of\nemploying our model to analyse the photoelectron emission especially for\nmaterials with strong RSOC. These findings provide a theoretical foundation for\nthe design of photoemitters using Rashba spintronic materials.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:22:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tiang","Bi Hong",""],["Ang","Yee Sin",""],["Ang","L. K.",""]]}
{"id":"2308.00953","submitter":"Lei Chen","authors":"Shujie Yu, Lei Chen, Yinping Pan, Yue Wang, Denghui Zhang, Guangting\n  Wu, Xinxin Fan, Xiaoyu Liu, Ling Wu, Lu Zhang, Wei Peng, Jie Ren, Zhen Wang","title":"Gate-Tunable Critical Current of the Three-Dimensional Niobium\n  Nano-Bridge Josephson Junction","comments":"15 pages, 5 figures","journal-ref":null,"doi":"10.1021/acs.nanolett.3c02015","report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent studies have shown that the critical currents of several metallic\nsuperconducting nanowires and Dayem bridges can be locally tuned using a gate\nvoltage {V_g}. Here, we report a gate-tunable Josephson junction structure\nconstructed from a three-dimensional (3D) niobium nano-bridge junction (NBJ)\nwith a voltage gate on top. Measurements up to 6 K showed that the critical\ncurrent of this structure can be tuned to zero by increasing {V_g}. The\ncritical gate voltage Vgc was reduced to 16 V and may possibly be reduced\nfurther by reducing the thickness of the insulation layer between the gate and\nthe NBJ. Furthermore, the flux modulation generated by Josephson interference\nof two parallel 3D NBJs can also be tuned using {V_g} in a similar manner.\nTherefore, we believe that this gate-tunable Josephson junction structure is\npromising for superconducting circuit fabrication at high integration levels.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:24:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yu","Shujie",""],["Chen","Lei",""],["Pan","Yinping",""],["Wang","Yue",""],["Zhang","Denghui",""],["Wu","Guangting",""],["Fan","Xinxin",""],["Liu","Xiaoyu",""],["Wu","Ling",""],["Zhang","Lu",""],["Peng","Wei",""],["Ren","Jie",""],["Wang","Zhen",""]]}
{"id":"2308.00954","submitter":"Nirjan Biswas","authors":"Nirjan Biswas","title":"Study of fractional semipositone problems on $\\mathbb{R}^N$","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $s \\in (0,1)$ and $N \\geq 2$. In this paper, we consider the following\nclass of nonlocal semipositone problems: \\begin{align*}\n  (-\\Delta)^s u= g(x)f_a(u) \\text { in } \\mathbb{R}^N, \\; u > 0 \\text{ in }\n\\mathbb{R}^N, \\end{align*} where the weight $g \\in L^1(\\mathbb{R}^N) \\cap\nL^{\\infty}(\\mathbb{R}^N)$ is positive, $a>0$ is a parameter, and $f_a \\in\nC(\\mathbb{R})$ is negative on $\\mathbb{R}^{-}$. For $f_a$ having subcritical\ngrowth and weaker Ambrosetti-Rabinowitz type nonlinearity, we prove that the\nabove problem admits a mountain pass solution $u_a$, provided `$a$' is near the\norigin. To obtain the positivity of $u_a$, we establish a Brezis-Kato type\nuniform estimate of $(u_a)$ in $L^{\\infty}(\\mathbb{R}^N)$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:32:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Biswas","Nirjan",""]]}
{"id":"2308.00955","submitter":"Yee Sin Ang","authors":"Kok Wai Lee, Yee Sin Ang","title":"Injection-Limited and Space-Charge-Limited Conduction in Wide Bandgap\n  Semiconductors with Velocity Saturation Effect","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Carrier conduction in wide bandgap semiconductors (WBS) often exhibits\nvelocity saturation at the high-electric field regime. How such effect\ninfluences the transition between contact-limited and space-charge-limited\ncurrent in a two-terminal device remains largely unexplored thus far. Here, we\ndevelop a generalized carrier transport model that includes contact-limited\nfield-induced carrier injection, space charge, carrier scattering and velocity\nsaturation effect. The model reveals various transitional behaviors in the\ncurrent-voltage characteristics, encompassing Fowler-Nordheim emission,\ntrap-free Mott-Gurney (MG) SCLC and \\emph{velocity-saturated SCLC}. Using GaN,\n6H-SiC and 4H-SiC WBS as examples, we show that the velocity-saturated SCLC\ncompletely dominates the high-voltage ($10^2 \\sim 10^4$ V) transport for\ntypical sub-$\\mu$m GaN and SiC diodes, thus unravelling velocity-saturated SCLC\nas a central transport mechanism in WBG electronics.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:41:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lee","Kok Wai",""],["Ang","Yee Sin",""]]}
{"id":"2308.00956","submitter":"Chowdhury Sadman Jahan","authors":"Chowdhury Sadman Jahan and Andreas Savakis","title":"Curriculum Guided Domain Adaptation in the Dark","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":"  Addressing the rising concerns of privacy and security, domain adaptation in\nthe dark aims to adapt a black-box source trained model to an unlabeled target\ndomain without access to any source data or source model parameters. The need\nfor domain adaptation of black-box predictors becomes even more pronounced to\nprotect intellectual property as deep learning based solutions are becoming\nincreasingly commercialized. Current methods distill noisy predictions on the\ntarget data obtained from the source model to the target model, and/or separate\nclean/noisy target samples before adapting using traditional noisy label\nlearning algorithms. However, these methods do not utilize the easy-to-hard\nlearning nature of the clean/noisy data splits. Also, none of the existing\nmethods are end-to-end, and require a separate fine-tuning stage and an initial\nwarmup stage. In this work, we present Curriculum Adaptation for Black-Box\n(CABB) which provides a curriculum guided adaptation approach to gradually\ntrain the target model, first on target data with high confidence (clean)\nlabels, and later on target data with noisy labels. CABB utilizes\nJensen-Shannon divergence as a better criterion for clean-noisy sample\nseparation, compared to the traditional criterion of cross entropy loss. Our\nmethod utilizes co-training of a dual-branch network to suppress error\naccumulation resulting from confirmation bias. The proposed approach is\nend-to-end trainable and does not require any extra finetuning stage, unlike\nexisting methods. Empirical results on standard domain adaptation datasets show\nthat CABB outperforms existing state-of-the-art black-box DA models and is\ncomparable to white-box domain adaptation models.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:47:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Jahan","Chowdhury Sadman",""],["Savakis","Andreas",""]]}
{"id":"2308.00957","submitter":"Adel Javanmard","authors":"Adel Javanmard, Vahab Mirrokni, Jean Pouget-Abadie","title":"Causal Inference with Differentially Private (Clustered) Outcomes","comments":"41 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.CR cs.LG stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Estimating causal effects from randomized experiments is only feasible if\nparticipants agree to reveal their potentially sensitive responses. Of the many\nways of ensuring privacy, label differential privacy is a widely used measure\nof an algorithm's privacy guarantee, which might encourage participants to\nshare responses without running the risk of de-anonymization. Many\ndifferentially private mechanisms inject noise into the original data-set to\nachieve this privacy guarantee, which increases the variance of most\nstatistical estimators and makes the precise measurement of causal effects\ndifficult: there exists a fundamental privacy-variance trade-off to performing\ncausal analyses from differentially private data. With the aim of achieving\nlower variance for stronger privacy guarantees, we suggest a new differential\nprivacy mechanism, \"Cluster-DP\", which leverages any given cluster structure of\nthe data while still allowing for the estimation of causal effects. We show\nthat, depending on an intuitive measure of cluster quality, we can improve the\nvariance loss while maintaining our privacy guarantees. We compare its\nperformance, theoretically and empirically, to that of its unclustered version\nand a more extreme uniform-prior version which does not use any of the original\nresponse distribution, both of which are special cases of the \"Cluster-DP\"\nalgorithm.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:51:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Javanmard","Adel",""],["Mirrokni","Vahab",""],["Pouget-Abadie","Jean",""]]}
{"id":"2308.00958","submitter":"Jun Guo","authors":"Jun Guo, Aishan Liu, Xingyu Zheng, Siyuan Liang, Yisong Xiao, Yichao\n  Wu, Xianglong Liu","title":"Isolation and Induction: Training Robust Deep Neural Networks against\n  Model Stealing Attacks","comments":"Accepted by ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the broad application of Machine Learning models as a Service\n(MLaaS), they are vulnerable to model stealing attacks. These attacks can\nreplicate the model functionality by using the black-box query process without\nany prior knowledge of the target victim model. Existing stealing defenses add\ndeceptive perturbations to the victim's posterior probabilities to mislead the\nattackers. However, these defenses are now suffering problems of high inference\ncomputational overheads and unfavorable trade-offs between benign accuracy and\nstealing robustness, which challenges the feasibility of deployed models in\npractice. To address the problems, this paper proposes Isolation and Induction\n(InI), a novel and effective training framework for model stealing defenses.\nInstead of deploying auxiliary defense modules that introduce redundant\ninference time, InI directly trains a defensive model by isolating the\nadversary's training gradient from the expected gradient, which can effectively\nreduce the inference computational cost. In contrast to adding perturbations\nover model predictions that harm the benign accuracy, we train models to\nproduce uninformative outputs against stealing queries, which can induce the\nadversary to extract little useful knowledge from victim models with minimal\nimpact on the benign performance. Extensive experiments on several visual\nclassification datasets (e.g., MNIST and CIFAR10) demonstrate the superior\nrobustness (up to 48% reduction on stealing accuracy) and speed (up to 25.4x\nfaster) of our InI over other state-of-the-art methods. Our codes can be found\nin https://github.com/DIG-Beihang/InI-Model-Stealing-Defense.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:54:01 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 06:27:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Guo","Jun",""],["Liu","Aishan",""],["Zheng","Xingyu",""],["Liang","Siyuan",""],["Xiao","Yisong",""],["Wu","Yichao",""],["Liu","Xianglong",""]]}
{"id":"2308.00959","submitter":"Edoardo Sernesi","authors":"Edoardo Sernesi","title":"On Treibich-Verdier curves","comments":"To appear on Pure and Applied Mathematics Quarterly","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We survey some properties of a class of curves lying on certain elliptic\nruled surfaces, studied by A. Treibich and J.L. Verdier in connection with\nelliptic solitons and KP equations. In particular we discuss their\nBrill-Noether generality, proved by A. Treibich, and we show that they are\nlimits of hyperplane sections of K3 surfaces.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:07:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sernesi","Edoardo",""]]}
{"id":"2308.00960","submitter":"Eduardo Rodriguez","authors":"E. Rodriguez, R. J. J. Mackenbach","title":"Trapped-particle precession and modes in quasi-symmetric stellarators\n  and tokamaks: a near-axis perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents the calculation of the bounce-averaged drift of trapped\nparticles in a near-axis framework for axisymmetric and quasisymmetric magnetic\nfields. This analytic consideration provides important insight on the\ndependence of the bounce-averaged drift on the geometry and stability\nproperties of the field. In particular, we show that, although the\nmaximum-$\\mathcal{J}$ property is unattainable in quasisymmetric stellarators,\none may approach it through increased plasma $\\beta$ and triangular shaping.\nThe description of trapped particles allows us to calculate the available\nenergy of trapped electrons analytically in two asymptotic regimes, providing\ninsight into the behaviour of this measure of turbulence. It is shown that the\navailable energy is intimately related to MHD-stability, providing a potential\nsynergy between this measure of gyrokinetic turbulence and MHD-stability.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:18:15 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rodriguez","E.",""],["Mackenbach","R. J. J.",""]]}
{"id":"2308.00961","submitter":"Felix Schl\\\"uter","authors":"Felix Schl\\\"uter and Simona Toscano (for the IceCube-Gen2\n  Collaboration)","title":"Estimating the coincidence rate between the optical and radio array of\n  IceCube-Gen2","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-1022","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube-Gen2 Neutrino Observatory is proposed to extend the all-flavour\nenergy range of IceCube beyond PeV energies. It will comprise two key\ncomponents: I) An enlarged 8$\\,$km$^3$ in-ice optical Cherenkov array to\nmeasure the continuation of the IceCube astrophysical neutrino flux and improve\nIceCube's point source sensitivity above $\\sim\\,$100$\\,$TeV; and II) A very\nlarge in-ice radio array with a surface area of about 500$\\,$km$^2$. Radio\nwaves propagate through ice with a kilometer-long attenuation length, hence a\nsparse radio array allows us to instrument a huge volume of ice to achieve a\nsufficient sensitivity to detect neutrinos with energies above tens of PeV. The\ndifferent signal topologies for neutrino-induced events measured by the optical\nand in-ice radio detector - the radio detector is mostly sensitive to the\ncascades produced in the neutrino interaction, while the optical detector can\ndetect long-ranging muon and tau leptons with high accuracy - yield highly\ncomplementary information. When detected in coincidence, these signals will\nallow us to reconstruct the neutrino energy and arrival direction with high\nfidelity. Furthermore, if events are detected in coincidence with a sufficient\nrate, they resemble the unique opportunity to study systematic uncertainties\nand to cross-calibrate both detector components. We present the expected rate\nof coincidence events for 10 years of operation. Furthermore, we analyzed\npossible detector optimizations to increase the coincidence rate.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:23:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Schl\u00fcter","Felix","","for the IceCube-Gen2\n  Collaboration"],["Toscano","Simona","","for the IceCube-Gen2\n  Collaboration"]]}
{"id":"2308.00962","submitter":"Keyu Jing","authors":"X. R. Wang, X. Gong, K. Y. Jing","title":"Spin wave amplification through superradiance","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":"  Superradiance is a phenomenon of multiple facets that occurs in classical and\nquantum physics under extreme conditions. Here we present its manifestation in\nspin waves under an easily realized condition. We show that an interface\nbetween a current-free (normal) ferromagnetic (FM) region and a current-flow\n(pumped) FM region can be a spin wave super-mirror whose reflection coefficient\nis larger than 1. The super-reflection is the consequence of current-induced\nspectrum inversion where phase and group velocities of spin waves are in the\nopposite directions. An incident spin wave activates a backward propagating\nrefractive wave inside pumped FM region. The refractive spin wave re-enters the\nnormal FM region to constructively interfere with the reflective wave. It\nappears that the pumped FM region coherently emits reflective waves, leading to\na super-reflection. The process resembles superradiance of a spinning black\nhole through the Hawking radiation process, or Dicke superradiance of cavity\nphotons inside population inverted media.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:27:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","X. R.",""],["Gong","X.",""],["Jing","K. Y.",""]]}
{"id":"2308.00963","submitter":"Pinglan Liu","authors":"Pinglan Liu and Wensheng Zhang","title":"Integrating Homomorphic Encryption and Trusted Execution Technology for\n  Autonomous and Confidential Model Refining in Cloud","comments":"IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the popularity of cloud computing and machine learning, it has been a\ntrend to outsource machine learning processes (including model training and\nmodel-based inference) to cloud. By the outsourcing, other than utilizing the\nextensive and scalable resource offered by the cloud service provider, it will\nalso be attractive to users if the cloud servers can manage the machine\nlearning processes autonomously on behalf of the users. Such a feature will be\nespecially salient when the machine learning is expected to be a long-term\ncontinuous process and the users are not always available to participate. Due\nto security and privacy concerns, it is also desired that the autonomous\nlearning preserves the confidentiality of users' data and models involved.\nHence, in this paper, we aim to design a scheme that enables autonomous and\nconfidential model refining in cloud. Homomorphic encryption and trusted\nexecution environment technology can protect confidentiality for autonomous\ncomputation, but each of them has their limitations respectively and they are\ncomplementary to each other. Therefore, we further propose to integrate these\ntwo techniques in the design of the model refining scheme. Through\nimplementation and experiments, we evaluate the feasibility of our proposed\nscheme. The results indicate that, with our proposed scheme the cloud server\ncan autonomously refine an encrypted model with newly provided encrypted\ntraining data to continuously improve its accuracy. Though the efficiency is\nstill significantly lower than the baseline scheme that refines plaintext-model\nwith plaintext-data, we expect that it can be improved by fully utilizing the\nhigher level of parallelism and the computational power of GPU at the cloud\nserver.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:31:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Liu","Pinglan",""],["Zhang","Wensheng",""]]}
{"id":"2308.00964","submitter":"Yuezun Li","authors":"Jiucui Lu, Yuezun Li, Jiaran Zhou, Bin Li, Junyu Dong, Siwei Lyu","title":"ForensicsForest Family: A Series of Multi-scale Hierarchical Cascade\n  Forests for Detecting GAN-generated Faces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prominent progress in generative models has significantly improved the\nreality of generated faces, bringing serious concerns to society. Since recent\nGAN-generated faces are in high realism, the forgery traces have become more\nimperceptible, increasing the forensics challenge. To combat GAN-generated\nfaces, many countermeasures based on Convolutional Neural Networks (CNNs) have\nbeen spawned due to their strong learning ability. In this paper, we rethink\nthis problem and explore a new approach based on forest models instead of CNNs.\nSpecifically, we describe a simple and effective forest-based method set called\n{\\em ForensicsForest Family} to detect GAN-generate faces. The proposed\nForensicsForest family is composed of three variants, which are {\\em\nForensicsForest}, {\\em Hybrid ForensicsForest} and {\\em Divide-and-Conquer\nForensicsForest} respectively. ForenscisForest is a newly proposed Multi-scale\nHierarchical Cascade Forest, which takes semantic, frequency and biology\nfeatures as input, hierarchically cascades different levels of features for\nauthenticity prediction, and then employs a multi-scale ensemble scheme that\ncan comprehensively consider different levels of information to improve the\nperformance further. Based on ForensicsForest, we develop Hybrid\nForensicsForest, an extended version that integrates the CNN layers into\nmodels, to further refine the effectiveness of augmented features. Moreover, to\nreduce the memory cost in training, we propose Divide-and-Conquer\nForensicsForest, which can construct a forest model using only a portion of\ntraining samplings. In the training stage, we train several candidate forest\nmodels using the subsets of training samples. Then a ForensicsForest is\nassembled by picking the suitable components from these candidate forest\nmodels...\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:41:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lu","Jiucui",""],["Li","Yuezun",""],["Zhou","Jiaran",""],["Li","Bin",""],["Dong","Junyu",""],["Lyu","Siwei",""]]}
{"id":"2308.00965","submitter":"Piotr Ka\\'zmierczak Mgr.","authors":"P. Ka\\'zmierczak, J. Binder, K. Boryczko, T. Ciuk, W. Strupi\\'nski, R.\n  St\\k{e}pniewski, A. Wysmo{\\l}ek","title":"Direction-sensitive graphene flow sensor","comments":"7 pages, 6 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":"  Graphene flow sensors hold great prospects for applications, but also\nencounter many difficulties, such as unwanted electrochemical phenomena, low\nmeasurable signal and limited dependence on the flow direction. This study\nproposes a novel approach allowing for the detection of a flow\ndirection-dependent electric signal in aqueous solutions of salts, acids and\nbases. The key element in the proposed solution is the use of a reference\nelectrode which allows external gating of the graphene structure. Using\nexternal gating enables to enhance substantially the amplitude of the\nflow-generated signal. Simultaneous measurement of the reference electrode\ncurrent allows us to recover a flow-direction-sensitive component of the\nflow-induced voltage in graphene. The obtained results are discussed in terms\nof the Coulomb interaction and other phenomena which can be present at the\ninterface of graphene with the aqueous solution.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:45:18 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 16:52:26 GMT"},{"version":"v3","created":"Fri, 11 Aug 2023 14:30:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ka\u017amierczak","P.",""],["Binder","J.",""],["Boryczko","K.",""],["Ciuk","T.",""],["Strupi\u0144ski","W.",""],["St\u0119pniewski","R.",""],["Wysmo\u0142ek","A.",""]]}
{"id":"2308.00966","submitter":"Weijun Gao","authors":"Zhirong Yang, Weijun Gao, and Chong Han","title":"A Universal Attenuation Model of Terahertz Wave in Space-Air-Ground\n  Channel Medium","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":"  Providing continuous bandwidth over several tens of GHz, the Terahertz (THz)\nband (0.1-10 THz) supports space-air-ground integrated network (SAGIN) in 6G\nand beyond wireless networks. However, it is still mystery how THz waves\ninteract with the channel medium in SAGIN. In this paper, a universal\nspace-air-ground attenuation model is proposed for THz waves, which\nincorporates the attenuation effects induced by particles including condensed\nparticles, molecules, and free electrons. The proposed model is developed from\nthe insight into the attenuation effects, namely, the physical picture that\nattenuation is the result of collision between photons that are the essence of\nTHz waves and particles in the environment. Based on the attenuation model, the\npropagation loss of THz waves in the atmosphere and the outer space are\nnumerically assessed. The results indicate that the attenuation effects except\nfree space loss are all negligible at the altitude higher than 50 km while they\nneed to be considered in the atmosphere lower than 50 km. Furthermore, the\ncapacities of THz SAGIN are evaluated in space-ground, space-sea, ground-sea,\nand sea-sea scenarios, respectively.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:47:48 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Zhirong",""],["Gao","Weijun",""],["Han","Chong",""]]}
{"id":"2308.00967","submitter":"Guillaume Patanchon","authors":"Guillaume Patanchon, Hiroaki Imada, Hirokazu Ishino, Tomotake\n  Matsumura","title":"Effect of Instrumental Polarization with a Half-Wave Plate on the\n  $B$-Mode Signal: Prediction and Correction","comments":"36 pages, 10 figures, submitted to JCAP","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 evaluate the effect of half-wave plate (HWP) imperfections inducing\nintensity leakage to the measurement of Cosmic Microwave Background (CMB)\n$B$-mode polarization signal with future satellite missions focusing on the\ntensor-to-scalar ratio $r$. The HWP is modeled with the Mueller formalism, and\ncoefficients are decomposed for any incident angle into harmonics of the HWP\nrotation frequency due to azimuthal angle dependence. Although we use a general\nformalism, band-averaged matrix coefficients are calculated as an example for a\n9-layer sapphire HWP using EM propagation simulations. We perform simulations\nof multi-detector observations in a band centered at 140\\,GHz using \\LB\ninstrumental configuration. We show both theoretically and with the simulations\nthat most of the artefacts on Stokes parameter maps are produced by the dipole\nleakage on $B$-modes induced by the fourth harmonics $M^{(4f)}_{QI}$ and\n$M^{(4f)}_{UI}$. The resulting effect is strongly linked to the spin-2 focal\nplane scanning cross linking parameters. We develop a maximum likelihood-based\nmethod to correct the IP leakage by joint fitting of the Mueller matrix\ncoefficients as well as the Stokes parameter maps. % by modifying the standard\nmap-making procedure. We show that the residual leakage after correction leads\nto an additional noise limited uncertainty on $r$ of the order of $10^{-7}$,\nindependently of the value of the Mueller matrix coefficients. We discuss the\nimpact of the monopole signal and the potential coupling with other systematic\neffects such as gain variations and detector nonlinearities.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:55:53 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Patanchon","Guillaume",""],["Imada","Hiroaki",""],["Ishino","Hirokazu",""],["Matsumura","Tomotake",""]]}
{"id":"2308.00968","submitter":"Tim Bode","authors":"Tim Bode, Michael Kajan, Francisco Meirinhos, Johann Kroha","title":"Non-Markovian Dynamics of Open Quantum Gases","comments":"6 pages, 4 figures","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 introduce an auxiliary-particle field theory to treat the non-Markovian\ndynamics of driven-dissipative quantum systems of the Jaynes-Cummings type. It\nassigns an individual quantum field to each reservoir state and provides an\nanalytic, faithful representation of the coupled system-bath dynamics. We apply\nthe method to a driven-dissipative photon Bose-Einstein condensate (BEC)\ncoupled to a reservoir of dye molecules with electronic and vibronic\nexcitations. The complete phase diagram of this system exhibits a hidden,\nnon-Hermitian phase transition separating temporally oscillating from\nbiexponentially decaying photon density correlations within the BEC. On one\nhand, this provides a qualitative distinction of the thermal photon BEC from a\nlaser. On the other hand, it shows that one may continuously tune from the BEC\nto the lasing phase by circumventing a critical point. This auxiliary-particle\nmethod is generally applicable to the dynamics of open, non-Markovian quantum\nsystems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:56:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bode","Tim",""],["Kajan","Michael",""],["Meirinhos","Francisco",""],["Kroha","Johann",""]]}
{"id":"2308.00969","submitter":"Randall Rojas Bolivar","authors":"Randall Rojas Bolivar, Daniel Wik, Ay\\c{s}eg\\\"ul T\\\"umer, Fabio\n  Gastaldello, Julie Hlavacek-Larrondo, Paul Nulsen, Valentina Vacca, Grzegorz\n  Madejski, Ming Sun, Craig Sarazin, Jeremy Sanders, Damiano Caprioli, Brian\n  Grefenstette, and Niels-Jorgen Westergaard","title":"NuSTAR Observations of Abell 665 and 2146: Constraints on Non-Thermal\n  Emission","comments":"19 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Observations from past missions such as RXTE and Beppo-SAX suggested the\npresence of inverse Compton (IC) scattering at hard X-ray energies within the\nintracluster medium of some massive galaxy clusters. In subsequent years,\nobservations by, e.g., Suzaku, and now NuSTAR, have not been able to confirm\nthese detections. We report on NuSTAR hard X-ray searches for IC emission in\ntwo massive galaxy clusters, Abell 665 and Abell 2146. To constrain the global\nIC flux in these two clusters, we fit global NuSTAR spectra with three models:\nsingle (1T) and two-temperature (2T) models, and a 1T plus power law component\n(T$+$IC). The temperature components are meant to characterize the thermal ICM\nemission, while the power law represents the IC emission. We find that the 3-30\nkeV Abell 665 and 3-20 keV Abell 2146 spectra are best described by thermal\nemission alone, with average global temperatures of $kT = (9.15\\pm 0.1)$ keV\nfor Abell 665 and $kT = (8.29\\pm 0.1)$ keV for Abell 2146. We constrain the IC\nflux to $F_{\\rm NT} < 0.60 \\times 10^{-12}$ erg s$^{-1}$ cm$^{-2}$ and $F_{\\rm\nNT} < 0.85 \\times 10^{-12}$ erg s$^{-1}$ cm$^{-2}$ (20-80 keV) for Abell 665\nand Abell 2146, respectively both at the 90% confidence level. When we couple\nthe IC flux limits with 1.4 GHz diffuse radio data from the VLA, we set lower\nlimits on the average magnetic field strengths of $>$0.14 $\\mu$G and $>$0.011\n$\\mu$G for Abell 665 and Abell 2146, respectively.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:58:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bolivar","Randall Rojas",""],["Wik","Daniel",""],["T\u00fcmer","Ay\u015feg\u00fcl",""],["Gastaldello","Fabio",""],["Hlavacek-Larrondo","Julie",""],["Nulsen","Paul",""],["Vacca","Valentina",""],["Madejski","Grzegorz",""],["Sun","Ming",""],["Sarazin","Craig",""],["Sanders","Jeremy",""],["Caprioli","Damiano",""],["Grefenstette","Brian",""],["Westergaard","Niels-Jorgen",""]]}
{"id":"2308.00970","submitter":"Suzuna Kinutani","authors":"S. Kinutani, H. Nagahiro, D. Jido","title":"Excitation spectra of heavy baryons in a quark-diquark model with\n  relativistic corrections","comments":"15 pages, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The excitation spectra of \\Lambda_c and \\Lambda_b baryons are investigated by\nusing a quark-diquark model in which a single-heavy baryon is treated as the\nbound state of a heavy quark and a scalar diquark. We take two types of\nrelativistic corrections into account for the quark-diquark potential. In the\nfirst type, we consider the one-gluon exchange between the heavy quark and one\nof the light quarks in the diquark. In the second, we consider the one-gluon\nexchange between a scalar particle and a heavy quark. We find that there is a\nlarge difference between two types of corrections due to different treatment of\nthe internal color structure of the diquark. The relativistic corrections are\nimportant for the solution to the string tension puzzle, particularly, the\nDarwin term makes a large contribution.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:02:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kinutani","S.",""],["Nagahiro","H.",""],["Jido","D.",""]]}
{"id":"2308.00971","submitter":"Hannes Reichert","authors":"Steven Schreck, Hannes Reichert, Manuel Hetzel, Konrad Doll, Bernhard\n  Sick","title":"Height Change Feature Based Free Space Detection","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 the context of autonomous forklifts, ensuring non-collision during travel,\npick, and place operations is crucial. To accomplish this, the forklift must be\nable to detect and locate areas of free space and potential obstacles in its\nenvironment. However, this is particularly challenging in highly dynamic\nenvironments, such as factory sites and production halls, due to numerous\nindustrial trucks and workers moving throughout the area. In this paper, we\npresent a novel method for free space detection, which consists of the\nfollowing steps. We introduce a novel technique for surface normal estimation\nrelying on spherical projected LiDAR data. Subsequently, we employ the\nestimated surface normals to detect free space. The presented method is a\nheuristic approach that does not require labeling and can ensure real-time\napplication due to high processing speed. The effectiveness of the proposed\nmethod is demonstrated through its application to a real-world dataset obtained\non a factory site both indoors and outdoors, and its evaluation on the Semantic\nKITTI dataset [2]. We achieved a mean Intersection over Union (mIoU) score of\n50.90 % on the benchmark dataset, with a processing speed of 105 Hz. In\naddition, we evaluated our approach on our factory site dataset. Our method\nachieved a mIoU score of 63.30 % at 54 Hz\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:03:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Schreck","Steven",""],["Reichert","Hannes",""],["Hetzel","Manuel",""],["Doll","Konrad",""],["Sick","Bernhard",""]]}
{"id":"2308.00972","submitter":"Volkmar Welker","authors":"Eric Babson, Volkmar Welker","title":"Homological algebra and poset versions of the Garland method","comments":"Transversal finiteness condition added to Corollary 4.2","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AT math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Garland introduced a vanishing criterion for a characteristic zero cohomology\ngroup of a locally finite and locally connected simplicial complex. The\ncriterion is based on the spectral gaps of the graph Laplacians of the links of\nfaces and has turned out to be effective in a wide range of examples. In this\nnote we extend the approach to include a range of non-simplicial (co)chain\ncomplexes associated to combinatorial structures we call Garland posets and\nelaborate further on the case of cubical complexes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:04:14 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 09:15:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Babson","Eric",""],["Welker","Volkmar",""]]}
{"id":"2308.00973","submitter":"Tobias Mattsson","authors":"Anders Israelsson, Tobias Mattsson and Wolfgang Staubach","title":"Regularity of oscillatory integral operators","comments":"arXiv admin note: text overlap with arXiv:2302.00312","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we establish the global boundedness of oscillatory integral\noperators on Besov-Lipschitz and Triebel-Lizorkin spaces, with amplitudes in\ngeneral $S^m_{\\rho,\\delta}(\\mathbb{R}^n)$-classes and non-degenerate phase\nfunctions in the class $\\textart F^k$. Our results hold for a wide range of\nparameters $0\\leq\\rho\\leq1$, $0\\leq\\delta<1$, $0<p\\leq\\infty$, $0<q\\leq\\infty$\nand $k>0$. We also provide a sufficient condition for the boundedness of\noperators with amplitudes in the forbidden class $S^m_{1,1}(\\mathbb{R}^n)$ in\nTriebel-Lizorkin spaces.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:04:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Israelsson","Anders",""],["Mattsson","Tobias",""],["Staubach","Wolfgang",""]]}
{"id":"2308.00974","submitter":"Ayumu Inoue","authors":"Ayumu Inoue","title":"Alteration of Seifert surfaces","comments":"9 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the notion of alteration of a surface embedded in a 3-manifold\nextending that of compression. We see that given two Seifert surfaces of the\nsame link are related to each other by ``single'' alteration, even if they are\nnot by compression.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:05:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Inoue","Ayumu",""]]}
{"id":"2308.00975","submitter":"Hao Wang","authors":"Hao Wang, Pengjun Zhao, Xiao-Yong Yan","title":"Quantifying the overall characteristics of urban mobility considering\n  spatial information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantification of the overall characteristics of urban mobility using\ncoarse-grained methods is crucial for urban management, planning and\nsustainable development. Although some recent studies have provided\nquantification methods for coarse-grained numerical information regarding urban\nmobility, a method that can simultaneously capture numerical and spatial\ninformation remains an outstanding problem. Here, we use mathematical vectors\nto depict human mobility, with mobility magnitude representing numerical\ninformation and mobility direction representing spatial information. We then\ndefine anisotropy and centripetality metrics by vector computation to measure\nimbalance in direction distribution and orientation toward the city center of\nmobility flows, respectively. As a case study, we apply our method to 60\nChinese cities and identify three mobility patterns: strong monocentric, weak\nmonocentric and polycentric. To better understand mobility pattern, we further\nstudy the allometric scaling of the average commuting distance and the\nspatiotemporal variations of the two metrics in different patterns. Finally, we\nbuild a microscopic model to explain the key mechanisms driving the diversity\nin anisotropy and centripetality. Our work offers a comprehensive method that\nconsiders both numerical and spatial information to quantify and classify the\noverall characteristics of urban mobility, enhancing our understanding of the\nstructure and evolution of urban mobility systems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:07:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Hao",""],["Zhao","Pengjun",""],["Yan","Xiao-Yong",""]]}
{"id":"2308.00976","submitter":"Wei Zeng","authors":"Wei Zeng, Yi Ling, Qing-Quan Jiang, Guo-Ping Li","title":"Accretion Disk for regular black holes with sub-Planckian curvature","comments":"26 pages,9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the accretion disk for a sort of regular black holes which are\ncharacterized by sub-Planckian curvature and Minkowskian core. We derive null\ngeodesics outside the horizon of such regular black holes and analyze the\nfeature of the light rays from the accretion disk which can be classified into\ndirect emission, lensed rings, and photon rings. We find that the observed\nbrightness under different emission models is mainly determined by direct\nemission, while the contribution from the flux of the lensed and photon rings\nis limited. By comparing with Bardeen black hole with a dS core, it is found\nthat the black hole with a Minkowskian core exhibits distinct astronomical\noptical features when surrounded by accretion disk, which potentially provides\na way to distinguish these two sorts of black holes by astronomical\nobservation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:15:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zeng","Wei",""],["Ling","Yi",""],["Jiang","Qing-Quan",""],["Li","Guo-Ping",""]]}
{"id":"2308.00977","submitter":"Gurleen Kaur Dr.","authors":"Gurleen Kaur, Surinder Kaur, Pooja Singla","title":"On twisted group ring isomorphism problem for p-groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we explore the problem of determining isomorphisms between\nthe twisted complex group algebras of finite $p$-groups. This problem bears\nsimilarity to the classical group algebra isomorphism problem and has been\nrecently examined by Margolis-Schnabel. Our focus lies on a specific invariant,\nreferred to as the generalized corank, which relates to the twisted complex\ngroup algebra isomorphism problem. We provide a solution for non-abelian\n$p$-groups with generalized corank at most three.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:15:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kaur","Gurleen",""],["Kaur","Surinder",""],["Singla","Pooja",""]]}
{"id":"2308.00978","submitter":"Sebastien Gerchinovitz","authors":"\\'Etienne de Montbrun (TSE-R), S\\'ebastien Gerchinovitz (IMT)","title":"Certified Multi-Fidelity Zeroth-Order Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC math.ST stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of multi-fidelity zeroth-order optimization, where\none can evaluate a function $f$ at various approximation levels (of varying\ncosts), and the goal is to optimize $f$ with the cheapest evaluations possible.\nIn this paper, we study \\emph{certified} algorithms, which are additionally\nrequired to output a data-driven upper bound on the optimization error. We\nfirst formalize the problem in terms of a min-max game between an algorithm and\nan evaluation environment. We then propose a certified variant of the MFDOO\nalgorithm and derive a bound on its cost complexity for any Lipschitz function\n$f$. We also prove an $f$-dependent lower bound showing that this algorithm has\na near-optimal cost complexity. We close the paper by addressing the special\ncase of noisy (stochastic) evaluations as a direct example.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:20:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["de Montbrun","\u00c9tienne","","TSE-R"],["Gerchinovitz","S\u00e9bastien","","IMT"]]}
{"id":"2308.00979","submitter":"Sujoy Bhore","authors":"Sujoy Bhore, Martin N\\\"ollenburg, Csaba D. T\\'oth, Jules Wulms","title":"Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic\n  Update Time","comments":"Abstract is shortened to meet Arxiv's requirement on the number of\n  characters","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A fundamental question in computational geometry is for a dynamic collection\nof geometric objects in Euclidean space, whether it is possible to maintain a\nmaximum independent set in polylogarithmic update time. Already, for a set of\nintervals, it is known that no dynamic algorithm can maintain an exact maximum\nindependent set with sublinear update time. Therefore, the typical objective is\nto explore the trade-off between update time and solution size. Substantial\nefforts have been made in recent years to understand this question for various\nfamilies of geometric objects, such as intervals, hypercubes, hyperrectangles,\nand fat objects.\n  We present the first fully dynamic approximation algorithm for disks of\narbitrary radii in the plane that maintains a constant-factor approximate\nmaximum independent set in polylogarithmic update time. First, we show that for\na fully dynamic set of $n$ unit disks in the plane, a $12$-approximate maximum\nindependent set can be maintained with worst-case update time $O(\\log^2 n)$,\nand optimal output-sensitive reporting. Moreover, this result generalizes to\nfat objects of comparable sizes in any fixed dimension $d$, where the\napproximation ratio depends on the dimension and the fatness parameter. Our\nmain result is that for a fully dynamic set of disks of arbitrary radii in the\nplane, an $O(1)$-approximate maximum independent set can be maintained in\npolylogarithmic expected amortized update time.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:22:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bhore","Sujoy",""],["N\u00f6llenburg","Martin",""],["T\u00f3th","Csaba D.",""],["Wulms","Jules",""]]}
{"id":"2308.00980","submitter":"Zhuangzhuang Zhang","authors":"Zhuangzhuang Zhang, Zhenning Zhou, Haili Wang, Zhinan Zhang, Huang\n  Huang and Qixin Cao","title":"Grasp Stability Assessment Through Attention-Guided Cross-Modality\n  Fusion and Transfer Learning","comments":"Accepted by IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extensive research has been conducted on assessing grasp stability, a crucial\nprerequisite for achieving optimal grasping strategies, including the minimum\nforce grasping policy. However, existing works employ basic feature-level\nfusion techniques to combine visual and tactile modalities, resulting in the\ninadequate utilization of complementary information and the inability to model\ninteractions between unimodal features. This work proposes an attention-guided\ncross-modality fusion architecture to comprehensively integrate visual and\ntactile features. This model mainly comprises convolutional neural networks\n(CNNs), self-attention, and cross-attention mechanisms. In addition, most\nexisting methods collect datasets from real-world systems, which is\ntime-consuming and high-cost, and the datasets collected are comparatively\nlimited in size. This work establishes a robotic grasping system through\nphysics simulation to collect a multimodal dataset. To address the sim-to-real\ntransfer gap, we propose a migration strategy encompassing domain randomization\nand domain adaptation techniques. The experimental results demonstrate that the\nproposed fusion framework achieves markedly enhanced prediction performance\n(approximately 10%) compared to other baselines. Moreover, our findings suggest\nthat the trained model can be reliably transferred to real robotic systems,\nindicating its potential to address real-world challenges.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:26:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Zhuangzhuang",""],["Zhou","Zhenning",""],["Wang","Haili",""],["Zhang","Zhinan",""],["Huang","Huang",""],["Cao","Qixin",""]]}
{"id":"2308.00981","submitter":"S. Aria Hosseini","authors":"S. Aria Hosseini, Alex Greaney, Giuseppe Romano","title":"Reduced-Order Model to Predict Thermal Conductivity of\n  Dimensionally-Confined Materials","comments":"This article may be downloaded for personal use only. Any other use\n  requires prior permission of the author and AIP Publishing. This article\n  appeared in S. A. Hosseini et al., Appl. Phys. Lett. 122 (26): 262202 (2023)\n  and may be found at https://doi.org/10.1063/5.0149792","journal-ref":"Appl. Phys. Lett. 122 (26): 262202 (2023)","doi":"10.1063/5.0149792","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting nanoscale thermal transport in dielectrics requires models, such\nas the Boltzmann transport equation (BTE), that account for phonon boundary\nscattering in structures with complex geometries. Although the BTE has been\nvalidated against several key experiments, its computational expense limits its\napplicability. Here, we demonstrate the use of an analytic reduced-order model\nfor predicting the thermal conductivity in dimensionally confined materials,\ni.e., monolithic and porous thin films, and rectangular and cylindrical\nnanowires. The approach uses the recently developed \"Ballistic Correction\nModel\" (BCM) which accounts for materials' full distribution of phonon\nmean-free-paths. The model is validated against BTE simulations for a selection\nof base materials, obtaining excellent agreement. By furnishing a precise yet\neasy-to-use prediction of thermal transport in nanostructures, our work strives\nto accelerate the identification of materials for energy-conversion and\nthermal-management applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:27:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hosseini","S. Aria",""],["Greaney","Alex",""],["Romano","Giuseppe",""]]}
{"id":"2308.00982","submitter":"Fabian Deuser","authors":"Fabian Deuser, Konrad Habel, Martin Werner, Norbert Oswald","title":"Orientation-Guided Contrastive Learning for UAV-View Geo-Localisation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Retrieving relevant multimedia content is one of the main problems in a world\nthat is increasingly data-driven. With the proliferation of drones, high\nquality aerial footage is now available to a wide audience for the first time.\nIntegrating this footage into applications can enable GPS-less geo-localisation\nor location correction.\n  In this paper, we present an orientation-guided training framework for\nUAV-view geo-localisation. Through hierarchical localisation orientations of\nthe UAV images are estimated in relation to the satellite imagery. We propose a\nlightweight prediction module for these pseudo labels which predicts the\norientation between the different views based on the contrastive learned\nembeddings. We experimentally demonstrate that this prediction supports the\ntraining and outperforms previous approaches. The extracted pseudo-labels also\nenable aligned rotation of the satellite image as augmentation to further\nstrengthen the generalisation. During inference, we no longer need this\norientation module, which means that no additional computations are required.\nWe achieve state-of-the-art results on both the University-1652 and\nUniversity-160k datasets.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:32:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Deuser","Fabian",""],["Habel","Konrad",""],["Werner","Martin",""],["Oswald","Norbert",""]]}
{"id":"2308.00983","submitter":"Ramandeep S. Johal","authors":"Vansh Narang and Ramandeep S. Johal","title":"Clausius formula and the Second law in the process of thermalization","comments":"10 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An adiabatic thermalization between $n$ bodies is an irreversible process,\nleading to a rise in the total entropy of the bodies and yields a final common\ntemperature $T_F$. We express the Clausius formula that computes the entropy\nchange between the initial non-equilibrium state and the final equilibrium\nstate, using another equilibrium state of the $n$ bodies for the given initial\nentropy, that corresponds to a temperature $T_f$. The second law inequality\nfollows from the fact $T_f < T_F$, under the assumption of positive heat\ncapacities of the bodies. We derive this inequality for the discrete case of\n$n$ bodies as well as the continuum case of an unequally heated rod. As an\nexample, we illustrate our results for the case of temperature-independent heat\ncapacity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:34:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Narang","Vansh",""],["Johal","Ramandeep S.",""]]}
{"id":"2308.00984","submitter":"Mitsumasa Ikeda","authors":"Mitsumasa Ikeda, Yoriyuki Yamagata, Takayuki Kihara","title":"On the Metric Temporal Logic for Continuous Stochastic Processes","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO math.LO math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we prove measurability of event for which a general\ncontinuous-time stochastic process satisfies continuous-time Metric Temporal\nLogic (MTL) formula. Continuous-time MTL can define temporal constrains for\nphysical system in natural way. Then there are several researches that deal\nwith probability of continuous MTL semantics for stochastic processes. However,\nproving measurability for such events is by no means an obvious task, even\nthough it is essential. The difficulty comes from the semantics of \"until\noperator\", which is defined by logical sum of uncountably many propositions.\nGiven the difficulty involved in proving the measurability of such an event\nusing classical measure-theoretic methods, we employ a theorem from stochastic\nanalysis. This theorem is utilized to prove the measurability of hitting times\nfor stochastic processes, and it stands as a profound result within the theory\nof capacity. Next, we provide an example that illustrates the failure of\nprobability approximation when discretizing the continuous semantics of MTL\nformulas with respect to time. Additionally, we prove that the probability of\nthe discretized semantics converges to that of the continuous semantics when we\nimpose restrictions on diamond operators to prevent nesting.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:34:40 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 02:05:36 GMT"},{"version":"v3","created":"Tue, 8 Aug 2023 03:07:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ikeda","Mitsumasa",""],["Yamagata","Yoriyuki",""],["Kihara","Takayuki",""]]}
{"id":"2308.00985","submitter":"Xuanming Liu","authors":"Xuanming Liu, Xinpeng Yang, Xun Zhang, Xiaohu Yang","title":"Evaluate and Guard the Wisdom of Crowds: Zero Knowledge Proofs for\n  Crowdsourcing Truth Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Due to the risks of correctness and security in outsourced cloud computing,\nwe consider a new paradigm called crowdsourcing: distribute tasks, receive\nanswers and aggregate the results from multiple entities. Through this\napproach, we can aggregate the wisdom of the crowd to complete tasks, ensuring\nthe accuracy of task completion while reducing the risks posed by the malicious\nacts of a single entity. However, the ensuing question is, how can we ensure\nthat the aggregator has done its work honestly and each contributor's work has\nbeen evaluated fairly?\n  In this paper, we propose a new scheme called $\\mathsf{zkTI}$. This scheme\nensures that the aggregator has honestly completed the aggregation and each\ndata source is fairly evaluated. We combine a cryptographic primitive called\n\\textit{zero-knowledge proof} with a class of \\textit{truth inference\nalgorithms} which is widely studied in AI/ML scenarios. Under this scheme,\nvarious complex outsourced tasks can be solved with efficiency and accuracy. To\nbuild our scheme, a novel method to prove the precise computation of\nfloating-point numbers is proposed, which is nearly optimal and well-compatible\nwith existing argument systems. This may become an independent point of\ninterest. Thus our work can prove the process of aggregation and inference\nwithout loss of precision. We fully implement and evaluate our ideas. Compared\nwith recent works, our scheme achieves $2-4 \\times$ efficiency improvement and\nis robust to be widely applied.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:36:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Liu","Xuanming",""],["Yang","Xinpeng",""],["Zhang","Xun",""],["Yang","Xiaohu",""]]}
{"id":"2308.00986","submitter":"Manuel Sebastian Mariani","authors":"Manuel Sebastian Mariani, Dario Mazzilli, Aurelio Patelli, Flaviano\n  Morone","title":"Ranking species in complex ecosystems through nestedness maximization","comments":"28 pages; 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Identifying the rank of species in a social or ecological network is a\ndifficult task, since the rank of each species is invariably determined by\ncomplex interactions stipulated with other species. Simply put, the rank of a\nspecies is a function of the ranks of all other species through the adjacency\nmatrix of the network. A common system of ranking is to order species in such a\nway that their neighbours form maximally nested sets, a problem called nested\nmaximization problem (NMP). Here we show that the NMP can be formulated as an\ninstance of the Quadratic Assignment Problem, one of the most important\ncombinatorial optimization problem widely studied in computer science,\neconomics, and operations research. We tackle the problem by Statistical\nPhysics techniques: we derive a set of self-consistent nonlinear equations\nwhose fixed point represents the optimal rankings of species in an arbitrary\nbipartite mutualistic network, which generalize the Fitness-Complexity\nequations widely used in the field of economic complexity. Furthermore, we\npresent an efficient algorithm to solve the NMP that outperforms\nstate-of-the-art network-based metrics and genetic algorithms. Eventually, our\ntheoretical framework may be easily generalized to study the relationship\nbetween ranking and network structure beyond pairwise interactions, e.g. in\nhigher-order networks.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:40:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Mariani","Manuel Sebastian",""],["Mazzilli","Dario",""],["Patelli","Aurelio",""],["Morone","Flaviano",""]]}
{"id":"2308.00987","submitter":"Alexei Vazquez","authors":"Alexei Vazquez","title":"Percolation in higher order networks via mapping to chygraphs","comments":"8 pages, 4 figures, 1 supp jupyter notebook","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cs.DS cs.SI physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Percolation theory investigates systems of interconnected units, their\nresilience to damage and their propensity to propagation. For random networks\nwe can solve the percolation problems analytically using the generating\nfunction formalism. Yet, with the introduction of higher order networks, the\ngenerating function calculations are becoming difficult to perform and harder\nto validate. Here, I illustrate the mapping of percolation in higher order\nnetworks to percolation in chygraphs. Chygraphs are defined as a set of\ncomplexes where complexes are hypergraphs with vertex sets in the set of\ncomplexes. In a previous work I reported the generating function formalism to\npercolation in chygraphs and obtained an analytical equation for the order\nparameter. Taking advantage of this result, I recapitulate analytical results\nfor percolation problems in higher order networks and report extensions to more\ncomplex scenarios using symbolic calculations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:43:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Vazquez","Alexei",""]]}
{"id":"2308.00988","submitter":"Darius Foo","authors":"Darius Foo, Yahui Song, Wei-Ngan Chin","title":"Staged Specifications for Automated Verification of Higher-Order\n  Imperative Programs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Higher-order functions and imperative references are language features\nsupported by many mainstream languages. Their combination enables the ability\nto package references to code blocks with the captured state from their\nenvironment. Higher-order imperative programs are expressive and useful, but\ncomplicate formal specification and reasoning due to the use of\nyet-to-be-instantiated function parameters, especially when their invocations\nmay mutate memory captured by or reachable from their arguments.\n  Existing state-of-the-art works for verifying higher-order imperative\nbehaviors are restricted in two ways: achieving strong theoretical results\nwithout automated implementations, or achieving automation with the help of\nstrong assumptions from dedicated type systems (e.g. Rust). To enable an\nautomated verification solution for imperative languages without the above\nrestrictions, we introduce Higher-order Staged Separation Logic (HSSL), an\nextension of Hoare logic for call-by-value higher-order functions with ML-like\nlocal references.\n  In this paper, we design a novel staged specification logic, prove its\nsoundness, develop a new automated higher-order verifier, Heifer, for a core\nOCaml-like language, report on experimental results, and present various case\nstudies investigating its capabilities.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:44:42 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Foo","Darius",""],["Song","Yahui",""],["Chin","Wei-Ngan",""]]}
{"id":"2308.00989","submitter":"Haorui Li","authors":"Haorui Li, Jiaqi Liang, Linjing Li, and Daniel Zeng","title":"Wasserstein Diversity-Enriched Regularizer for Hierarchical\n  Reinforcement 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":"  Hierarchical reinforcement learning composites subpolicies in different\nhierarchies to accomplish complex tasks.Automated subpolicies discovery, which\ndoes not depend on domain knowledge, is a promising approach to generating\nsubpolicies.However, the degradation problem is a challenge that existing\nmethods can hardly deal with due to the lack of consideration of diversity or\nthe employment of weak regularizers. In this paper, we propose a novel\ntask-agnostic regularizer called the Wasserstein Diversity-Enriched Regularizer\n(WDER), which enlarges the diversity of subpolicies by maximizing the\nWasserstein distances among action distributions. The proposed WDER can be\neasily incorporated into the loss function of existing methods to boost their\nperformance further.Experimental results demonstrate that our WDER improves\nperformance and sample efficiency in comparison with prior work without\nmodifying hyperparameters, which indicates the applicability and robustness of\nthe WDER.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:45:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Haorui",""],["Liang","Jiaqi",""],["Li","Linjing",""],["Zeng","Daniel",""]]}
{"id":"2308.00990","submitter":"Alexandre Anahory Simoes","authors":"Alexandre Anahory Simoes, Leonardo Colombo, Manuel de Leon, Modesto\n  Salgado and Silvia Souto","title":"Contact formalism for dissipative mechanical systems on Lie algebroids","comments":"36 pages. arXiv admin note: text overlap with arXiv:2204.11537 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce a geometric description of contact Lagrangian and\nHamiltonian systems on Lie algebroids in the framework of contact geometry,\nusing the theory of prolongations. We discuss the relation between Lagrangian\nand Hamiltonian settings through a convenient notion of Legendre\ntransformation. We also discuss the Hamilton-Jacobi problem in this framework\nand introduce the notion of a Legendrian Lie subalgebroid of a contact Lie\nalgebroid.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:48:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Simoes","Alexandre Anahory",""],["Colombo","Leonardo",""],["de Leon","Manuel",""],["Salgado","Modesto",""],["Souto","Silvia",""]]}
{"id":"2308.00991","submitter":"Alessio Cipriani","authors":"Alessio Cipriani, Martina Lanini","title":"Wall And Chamber Structure For A Special Biserial Algebra Coming From\n  Perverse Sheaves on $\\mathbb{P}^n$","comments":"18 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.AG math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe the wall and chamber structure of a special biserial algebra\nwhose module category is equivalent to the category of (middle) perverse\nsheaves on the complex projective space $\\mathbb{P}^n$. In particular, by the\nwell known classification of indecomposable modules for special biserial\nalgebras, we deduce that the algebra of interest is of finite representation\ntype and we provide an explicit description of the walls of the structure. By a\nresult of Bridgeland this wall and chamber structure coincides with the chamber\nstructure in an open subset of the space of stability conditions on the bounded\nderived category of constructible sheaves on $\\mathbb{P}^n$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:51:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cipriani","Alessio",""],["Lanini","Martina",""]]}
{"id":"2308.00992","submitter":"Tanya Araujo","authors":"Tanya Ara\\'ujo, Alexandre Abreu and Francisco Lou\\c{c}\\~a","title":"The evolution of Complexity co-occurring keywords: bibliometric analysis\n  and network approach","comments":"25 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bibliometric studies based on the Web of Science (WOS) database have become\nan increasingly popular method for analysing the structure of scientific\nresearch. So do network approaches, which, based on empirical data, make it\npossible to characterize the emergence of topological structures over time and\nacross multiple research areas. Our paper is a contribution to interweaving\nthese two lines of research that have progressed in separate ways but whose\ncommon applications have been increasingly more frequent. Among other\nattributes, Author Keywords and Keywords Plus are used as units of analysis\nthat enable us to identify changes in the topics of interest and related\nbibliography. By considering the co-occurrence of those keywords with the\nAuthor Keyword \\texttt{Complexity}, we provide an overview of the evolution of\nstudies on Complexity Sciences, and compare this evolution in seven scientific\nfields. The results show a considerable increase in the number of papers\ndealing with complexity, as well as a general tendency across different\ndisciplines for this literature to move from a more foundational, general and\nconceptual to a more applied and specific set of co-occurring keywords.\nMoreover, we provide evidence of changing topologies of networks of\nco-occurring keywords, which are described through the computation of some\ntopological coefficients. In so doing, we emphasize the distinguishing\nstructures that characterize the networks of the seven research areas.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:55:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ara\u00fajo","Tanya",""],["Abreu","Alexandre",""],["Lou\u00e7\u00e3","Francisco",""]]}
{"id":"2308.00993","submitter":"Yan Gong","authors":"Y. Gong, G. N. Ortiz-Le\\'on, M. R. Rugel, K. M. Menten, A. Brunthaler,\n  F. Wyrowski, C. Henkel, H. Beuther, S. A. Dzib, J. S. Urquhart, A. Y. Yang,\n  J. D. Pandian, R. Dokara, V. S. Veena, H. Nguyen, S.-N. X. Medina, W. D.\n  Cotton, W. Reich, B. Winkel, P. M\\\"uller, I. Skretas, T. Csengeri, S. Khan,\n  A. Cheema","title":"A global view on star formation: The GLOSTAR Galactic plane survey VIII.\n  Formaldehyde absorption in Cygnus~X","comments":"27 pages, 23 figures, 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":"  Cygnus X is one of the closest and most active high-mass star-forming regions\nin our Galaxy, making it one of the best laboratories for studying massive star\nformation. As part of the GLOSTAR Galactic plane survey, we performed large\nscale simultaneous H$_{2}$CO (1$_{1,0}$-1$_{1,1}$) spectral line and radio\ncontinuum imaging observations toward Cygnus X at $\\lambda\\sim$6 cm with the\nKarl G. Jansky Very Large Array and the Effelsberg-100 m radio telescope. Our\nEffelsberg observations reveal widespread H$_{2}$CO (1$_{1,0}$-1$_{1,1}$)\nabsorption with a spatial extent of $\\gtrsim$50 pc in Cygnus~X for the first\ntime. On large scales of 4.4 pc, the relative orientation between local\nvelocity gradient and magnetic field tends to be more parallel at H$_{2}$\ncolumn densities of $\\gtrsim$1.8$\\times 10^{22}$~cm$^{-2}$. On the smaller\nscale of 0.17 pc, our VLA+Effelsberg combined data reveal H$_{2}$CO absorption\nonly toward three bright H{\\scriptsize II} regions. Our observations\ndemonstrate that H$_{2}$CO (1$_{1,0}$-1$_{1,1}$) is commonly optically thin.\nKinematic analysis supports the assertion that molecular clouds generally\nexhibit supersonic motions on scales of 0.17-4.4 pc. We show a non-negligible\ncontribution of the cosmic microwave background radiation in producing extended\nabsorption features in Cygnus X. Our observations suggest that H$_{2}$CO\n($1_{1,0}-1_{1,1}$) can trace molecular gas with H$_{2}$ column densities of\n$\\gtrsim 5 \\times 10^{21}$ cm$^{-2}$. The ortho-H$_{2}$CO fractional abundance\nwith respect to H$_{2}$ has a mean value of 7.0$\\times 10^{-10}$. A comparison\nof velocity dispersions on different linear scales suggests that the dominant\n$-3$ km s$^{-1}$ velocity component in the prominent DR21 region has nearly\nidentical velocity dispersions on scales of 0.17-4.4 pc, which deviates from\nthe expected behavior of classic turbulence.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:57:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gong","Y.",""],["Ortiz-Le\u00f3n","G. N.",""],["Rugel","M. R.",""],["Menten","K. M.",""],["Brunthaler","A.",""],["Wyrowski","F.",""],["Henkel","C.",""],["Beuther","H.",""],["Dzib","S. A.",""],["Urquhart","J. S.",""],["Yang","A. Y.",""],["Pandian","J. D.",""],["Dokara","R.",""],["Veena","V. S.",""],["Nguyen","H.",""],["Medina","S. -N. X.",""],["Cotton","W. D.",""],["Reich","W.",""],["Winkel","B.",""],["M\u00fcller","P.",""],["Skretas","I.",""],["Csengeri","T.",""],["Khan","S.",""],["Cheema","A.",""]]}
{"id":"2308.00994","submitter":"Moon Ye-Bin","authors":"Moon Ye-Bin, Nam Hyeon-Woo, Wonseok Choi, Nayeong Kim, Suha Kwak,\n  Tae-Hyun Oh","title":"Exploiting Synthetic Data for Data Imbalance Problems: Baselines from a\n  Data Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We live in a vast ocean of data, and deep neural networks are no exception to\nthis. However, this data exhibits an inherent phenomenon of imbalance. This\nimbalance poses a risk of deep neural networks producing biased predictions,\nleading to potentially severe ethical and social consequences. To address these\nchallenges, we believe that the use of generative models is a promising\napproach for comprehending tasks, given the remarkable advancements\ndemonstrated by recent diffusion models in generating high-quality images. In\nthis work, we propose a simple yet effective baseline, SYNAuG, that utilizes\nsynthetic data as a preliminary step before employing task-specific algorithms\nto address data imbalance problems. This straightforward approach yields\nimpressive performance on datasets such as CIFAR100-LT, ImageNet100-LT,\nUTKFace, and Waterbird, surpassing the performance of existing task-specific\nmethods. While we do not claim that our approach serves as a complete solution\nto the problem of data imbalance, we argue that supplementing the existing data\nwith synthetic data proves to be an effective and crucial preliminary step in\naddressing data imbalance concerns.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:59:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ye-Bin","Moon",""],["Hyeon-Woo","Nam",""],["Choi","Wonseok",""],["Kim","Nayeong",""],["Kwak","Suha",""],["Oh","Tae-Hyun",""]]}
{"id":"2308.00995","submitter":"Peng Wang","authors":"Peng Wang, Lev Kazak, Katharina Senkalla, Petr Siyushev, Ryotaro Abe,\n  Takashi Taniguchi, Shinobu Onoda, Hiromitsu Kato, Toshiharu Makino, Mutsuko\n  Hatano, Fedor Jelezko and Takayuki Iwasaki","title":"Transform-Limited Photon Emission From a Lead-Vacancy Center in Diamond\n  Above 10 K","comments":"13 pages,4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transform-limited photon emission from quantum emitters is essential for\nhigh-fidelity entanglement generation. In this study, we report the coherent\noptical property of a single negatively-charged lead-vacancy (PbV) center in\ndiamond. Photoluminescence excitation measurements reveal stable fluorescence\nwith a linewidth of 39 MHz at 6 K, close to the transform-limit estimated from\nthe lifetime measurement. We observe four orders of magnitude different\nlinewidths of the two zero-phonon-lines, and find that that the phonon-induced\nrelaxation in the ground state contributes to this huge difference in the\nlinewidth. Due to the suppressed phonon absorption in the PbV center, we\nobserve nearly transform-limited photon emission up to 16 K, demonstrating its\nhigh temperature robustness compared to other color centers in diamond.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:06:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Peng",""],["Kazak","Lev",""],["Senkalla","Katharina",""],["Siyushev","Petr",""],["Abe","Ryotaro",""],["Taniguchi","Takashi",""],["Onoda","Shinobu",""],["Kato","Hiromitsu",""],["Makino","Toshiharu",""],["Hatano","Mutsuko",""],["Jelezko","Fedor",""],["Iwasaki","Takayuki",""]]}
{"id":"2308.00996","submitter":"Takashi Nagao","authors":"T. Nagao, F.Patat, A. Cikota, D. Baade, S. Mattila, R. Kotak, H.\n  Kuncarayakti, M. Bulla, B. Ayala","title":"Spectropolarimetry of Type II supernovae (II) Intrinsic supernova\n  polarization and its relations with the photometric/spectroscopic properties","comments":"27 pages, 30 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":"  The explosion processes of supernovae (SNe) are imprinted in their explosion\ngeometries. Here, we study the intrinsic polarization of 15 hydrogen-rich\ncore-collapse SNe and explore the relation with the photometric and\nspectroscopic properties. Our sample shows diverse properties of the continuum\npolarization. The polarization of most SNe has a low degree at early phases but\nshows a sudden rise to $\\sim 1$ \\% degree at certain points during the\nphotospheric phase as well as a slow decline during the tail phase, with a\nconstant polarization angle. The variation in the timing of peak polarisation\nvalues implies diversity in the explosion geometry: some SNe have aspherical\nstructures only in their helium cores, while in other SNe these reach out to a\nsignificant part of the outer hydrogen envelope with a common axis from the\nhelium core to the hydrogen envelope. Other SNe show high polarization from\nearly phases and a change of the polarization angle around the middle of the\nphotospheric phase. This implies that the ejecta are significantly aspherical\nto the outermost layer and have multi-directional aspherical structures.\nExceptionally, the Type~IIL SN~2017ahn shows low polarization at both the\nphotospheric and tail phases. Our results show that the timing of the\npolarization rise in Type~IIP SNe is likely correlated with their brightness,\nvelocity and the amount of radioactive Ni produced: brighter SNe with faster\nejecta velocity and a larger $^{56}$Ni mass have more extended-aspherical\nexplosion geometries. In particular, there is a clear correlation between the\ntiming of the polarization rise and the explosion energy, that is, the\nexplosion asphericity is proportional to the explosion energy. This implies\nthat the development of a global aspherical structure, e.g., a jet, might be\nthe key to realising an energetic SN in the mechanism of SN explosions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:15:12 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nagao","T.",""],["Patat","F.",""],["Cikota","A.",""],["Baade","D.",""],["Mattila","S.",""],["Kotak","R.",""],["Kuncarayakti","H.",""],["Bulla","M.",""],["Ayala","B.",""]]}
{"id":"2308.00997","submitter":"Diogo Costa","authors":"Diogo Costa, Luca Cuomo, Daniel Oliveira, Ida Maria Savino, Bruno\n  Morelli, Jos\\'e Martins, Alessandro Biasci, Sandro Pinto","title":"IRQ Coloring and the Subtle Art of Mitigating Interrupt-generated\n  Interference","comments":"10 pages, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.PF cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Integrating workloads with differing criticality levels presents a formidable\nchallenge in achieving the stringent spatial and temporal isolation\nrequirements imposed by safety-critical standards such as ISO26262. The shift\ntowards high-performance multicore platforms has been posing increasing issues\nto the so-called mixed-criticality systems (MCS) due to the reciprocal\ninterference created by consolidated subsystems vying for access to shared\n(microarchitectural) resources (e.g., caches, bus interconnect, memory\ncontroller). The research community has acknowledged all these challenges.\nThus, several techniques, such as cache partitioning and memory throttling,\nhave been proposed to mitigate such interference; however, these techniques\nhave some drawbacks and limitations that impact performance, memory footprint,\nand availability. In this work, we look from a different perspective. Departing\nfrom the observation that safety-critical workloads are typically event- and\nthus interrupt-driven, we mask \"colored\" interrupts based on the \\ac{QoS}\nassessment, providing fine-grain control to mitigate interference on critical\nworkloads without entirely suspending non-critical workloads. We propose the\nso-called IRQ coloring technique. We implement and evaluate the IRQ Coloring on\na reference high-performance multicore platform, i.e., Xilinx ZCU102. Results\ndemonstrate negligible performance overhead, i.e., <1% for a 100 microseconds\nperiod, and reasonable throughput guarantees for medium-critical workloads. We\nargue that the IRQ coloring technique presents predictability and intermediate\nguarantees advantages compared to state-of-art mechanisms\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:17:53 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Costa","Diogo",""],["Cuomo","Luca",""],["Oliveira","Daniel",""],["Savino","Ida Maria",""],["Morelli","Bruno",""],["Martins","Jos\u00e9",""],["Biasci","Alessandro",""],["Pinto","Sandro",""]]}
{"id":"2308.00998","submitter":"Thierry Paul","authors":"Dario Benedetto (Sapienza University of Rome), Thierry Paul (LJLL\n  (UMR\\_7598)), Stefano Rossi (Sapienza University of Rome)","title":"Propagation of chaos and hydrodynamic description for topological models","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 study the deterministic Cucker-Smale model with topological\ninteraction.Focusing on the solutions of the corresponding Liouville equation,\nwe show that propagation of chaos holds.Moreover, by looking at the monokinetic\nsolutions, we also obtain a rigorous derivation of the hydrodynamic description\ngiven by a pressureless Euler-type system.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:18:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Benedetto","Dario","","Sapienza University of Rome"],["Paul","Thierry","","LJLL"],["Rossi","Stefano","","Sapienza University of Rome"]]}
{"id":"2308.00999","submitter":"Hiroaki Tanaka","authors":"Hiroaki Tanaka, Shota Okazaki, Masaru Kobayashi, Yuto Fukushima,\n  Yosuke Arai, Takushi Iimori, Mikk Lippmaa, Kohei Yamagami, Yoshinori Kotani,\n  Fumio Komori, Kenta Kuroda, Takao Sasagawa, and Takeshi Kondo","title":"Broken Screw Rotational Symmetry in the Near-Surface Electronic\n  Structure of $AB$-Stacked Crystals","comments":"6+11 pages, 4+13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We investigate the electronic structure of $2H$-$\\mathrm{Nb}\\mathrm{S}_2$ and\n$h$$\\mathrm{BN}$ by angle-resolved photoemission spectroscopy (ARPES) and\nphotoemission intensity calculations. Although in bulk form, these materials\nare expected to exhibit band degeneracy in the $k_z=\\pi/c$ plane due to screw\nrotation and time-reversal symmetries, we observe gapped band dispersion near\nthe surface. We extract from first-principles calculations the near-surface\nelectronic structure probed by ARPES and find that the calculated photoemission\nspectra from the near-surface region reproduce the gapped ARPES spectra. Our\nresults show that the near-surface electronic structure can be qualitatively\ndifferent from the bulk one due to partially broken nonsymmorphic symmetries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:18:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tanaka","Hiroaki",""],["Okazaki","Shota",""],["Kobayashi","Masaru",""],["Fukushima","Yuto",""],["Arai","Yosuke",""],["Iimori","Takushi",""],["Lippmaa","Mikk",""],["Yamagami","Kohei",""],["Kotani","Yoshinori",""],["Komori","Fumio",""],["Kuroda","Kenta",""],["Sasagawa","Takao",""],["Kondo","Takeshi",""]]}
{"id":"2308.01000","submitter":"Louis Soum-Fontez","authors":"Louis Soum-Fontez, Jean-Emmanuel Deschaud, Fran\\c{c}ois Goulette","title":"MDT3D: Multi-Dataset Training for LiDAR 3D Object Detection\n  Generalization","comments":"Accepted for publication at IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Supervised 3D Object Detection models have been displaying increasingly\nbetter performance in single-domain cases where the training data comes from\nthe same environment and sensor as the testing data. However, in real-world\nscenarios data from the target domain may not be available for finetuning or\nfor domain adaptation methods. Indeed, 3D object detection models trained on a\nsource dataset with a specific point distribution have shown difficulties in\ngeneralizing to unseen datasets. Therefore, we decided to leverage the\ninformation available from several annotated source datasets with our\nMulti-Dataset Training for 3D Object Detection (MDT3D) method to increase the\nrobustness of 3D object detection models when tested in a new environment with\na different sensor configuration. To tackle the labelling gap between datasets,\nwe used a new label mapping based on coarse labels. Furthermore, we show how we\nmanaged the mix of datasets during training and finally introduce a new\ncross-dataset augmentation method: cross-dataset object injection. We\ndemonstrate that this training paradigm shows improvements for different types\nof 3D object detection models. The source code and additional results for this\nresearch project will be publicly available on GitHub for interested parties to\naccess and utilize: https://github.com/LouisSF/MDT3D\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:20:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Soum-Fontez","Louis",""],["Deschaud","Jean-Emmanuel",""],["Goulette","Fran\u00e7ois",""]]}
{"id":"2308.01001","submitter":"Anirvan Dutta","authors":"Anirvan Dutta, Etienne Burdet, Mohsen Kaboli","title":"Push to know! -- Visuo-Tactile based Active Object Parameter Inference\n  with Dual Differentiable Filtering","comments":"8 pages. Accepted at IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For robotic systems to interact with objects in dynamic environments, it is\nessential to perceive the physical properties of the objects such as shape,\nfriction coefficient, mass, center of mass, and inertia. This not only eases\nselecting manipulation action but also ensures the task is performed as\ndesired. However, estimating the physical properties of especially novel\nobjects is a challenging problem, using either vision or tactile sensing. In\nthis work, we propose a novel framework to estimate key object parameters using\nnon-prehensile manipulation using vision and tactile sensing. Our proposed\nactive dual differentiable filtering (ADDF) approach as part of our framework\nlearns the object-robot interaction during non-prehensile object push to infer\nthe object's parameters. Our proposed method enables the robotic system to\nemploy vision and tactile information to interactively explore a novel object\nvia non-prehensile object push. The novel proposed N-step active formulation\nwithin the differentiable filtering facilitates efficient learning of the\nobject-robot interaction model and during inference by selecting the next best\nexploratory push actions (where to push? and how to push?). We extensively\nevaluated our framework in simulation and real-robotic scenarios, yielding\nsuperior performance to the state-of-the-art baseline.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:21:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dutta","Anirvan",""],["Burdet","Etienne",""],["Kaboli","Mohsen",""]]}
{"id":"2308.01002","submitter":"Jun Yang","authors":"Jun Yang (1), Federico Garc\\'ia (2), Santiago del Palacio (1), Ralph\n  Spencer (3), Zsolt Paragi (4), Noel Castro Segura (5), Biping Gong (6),\n  Hongmin Cao (7), Wen Chen (8) ((1) SEE, Chalmers University of Technology,\n  Sweden, (2) Instituto Argentino de Radioastronom\\'ia, Argentina, (3) Jodrell\n  Bank Centre for Astrophysics, UK (4) JIVE, The Netherlands, (5) University of\n  Southampton, UK, (6) Huazhong University of Science and Technology, China,\n  (7) Shangqiu Normal University, China, (8) Yunnan Observatories, China)","title":"The innermost jet in the hidden ultra-luminous X-ray source Cygnus X-3","comments":"7 pages, 8 figures, accepted for publication in MNRAS Letters","journal-ref":null,"doi":"10.1093/mnrasl/slad111","report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cygnus X-3 is a high-mass X-ray binary with a compact object accreting matter\nfrom a Wolf-Rayet donor star. Recently, it has been revealed by the Imaging\nX-ray Polarimetry Explorer (IXPE) as a hidden Galactic ultra-luminous X-ray\n(ULX) source with a luminosity above the Eddington limit along the direction of\na narrow (opening angle <~32 degree) funnel. In between the IXPE observations,\nwe observed Cyg X-3 with the European VLBI (very long baseline interferometry)\nNetwork at 22 GHz and the NICER X-ray instrument. To probe possible relations\nbetween the X-ray funnel and the potential radio jet from the ULX, we analyzed\nthe simultaneous multi-wavelength data. Our high-resolution VLBI image reveals\nan elongated structure with a position angle of -3.2+/-0.4 degree, accurately\nperpendicular to the direction of the linear X-ray polarization. Because Cyg\nX-3 was in the radio quiescent state on 2022 November 10, we identify the\nmas-scale structure as the innermost radio jet. The finding indicates that the\nradio jet propagates along and within the funnel. Moreover, the jet is\nmarginally resolved in the transverse direction. This possibly results from the\nstrong stellar winds and the rapid orbital motion of the binary system.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:25:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yang","Jun",""],["Garc\u00eda","Federico",""],["del Palacio","Santiago",""],["Spencer","Ralph",""],["Paragi","Zsolt",""],["Segura","Noel Castro",""],["Gong","Biping",""],["Cao","Hongmin",""],["Chen","Wen",""]]}
{"id":"2308.01003","submitter":"Evgeniy Petrov","authors":"Evgeniy Petrov","title":"Fixed point theorem for mappings contracting perimeters of triangles","comments":"8 pages, 1 figure, A full-text view-only version is available online\n  at https://rdcu.be/dijGN","journal-ref":"J. Fixed Point Theory Appl. 25, 74 (2023)","doi":"10.1007/s11784-023-01078-4","report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a new type of mappings in metric spaces which can be\ncharacterized as mappings contracting perimeters of triangles. It is shown that\nsuch mappings are continuous. The fixed-point theorem for such mappings is\nproved and the classical Banach fixed-point theorem is obtained like a simple\ncorollary. An example of a mapping contractive perimeters of triangles which is\nnot a contraction mapping is constructed.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:26:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Petrov","Evgeniy",""]]}
{"id":"2308.01004","submitter":"Irene Rivera Arreba","authors":"Irene Rivera-Arreba and Zhaobin Li and Xiaolei Yang and Erin E.\n  Bachynski-Poli\\'c","title":"Validation of the dynamic wake meandering model against large eddy\n  simulation for horizontal and vertical steering of wind turbine wakes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work focuses on the validation of the dynamic wake meandering (DWM)\nmodel against large eddy simulation (LES). The wake deficit, mean deflection,\nand meandering under different wind turbine misalignment angles in yaw and\ntilt, for the IEA 15MW wind turbine, for two turbulent inflows with different\nshear and turbulence intensities are compared. Simulation results indicate that\nthe DWM model as implemented in FAST.Farm shows very good agreement with the\nLES (VFS-Wind) data when predicting the time-averaged horizontal and vertical\nwake, especially at x > 6D and for cases with positive tilt angles (> 6deg).\nThe wake dynamics captured by the DWM model include the large-eddy-induced wake\nmeandering at low Strouhal number (St < 0.1). Additionally, the wake\noscillation induced by the shear layer at St approx. 0.27 is captured only by\nLES. The mean and standard deviation of the wake deflection, as computed by the\nDWM, are sensitive to the size of the polar grid used to calculate the\nspatial-averaged velocity with which the wake planes meander. The power output\nof a turbine in the wake of a wind turbine in free-wind deflected by a yaw\nangle gamma = 30deg is almost doubled compared to the fully-waked condition.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:29:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rivera-Arreba","Irene",""],["Li","Zhaobin",""],["Yang","Xiaolei",""],["Bachynski-Poli\u0107","Erin E.",""]]}
{"id":"2308.01005","submitter":"Yoni Toker Prof.","authors":"Yehuda Ben-Shabo, Adeliya Kurbanov, Claus Dieter Schroter, Robert\n  Moshammer, Holger Kreckel, Yoni Toker","title":"Velocity Map Imaging with No Spherical Aberrations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atm-clus","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Velocity map imaging (VMI) is a powerful technique that allows to infer the\nkinetic energy of ions or electrons that are produced from a large volume in\nspace with good resolution. The size of the acceptance volume is determined by\nthe spherical aberrations of the ion optical system. Here we present an\nanalytical derivation for velocity map imaging with no spherical aberrations.\nWe will discuss a particular example for the implementation of the technique\nthat allows using the reaction microscope recently installed in the Cryogenic\nstorage ring (CSR) in a VMI mode. SIMION simulations confirm that a beam of\nelectrons produced almost over the entire volume of the source region, with\nwidth of 8 cm, can be focused to a spot of 0.1 mm on the detector. The use of\nthe same formalism for position imaging, as well as an option of position\nimaging in one axis and velocity map imaging in a different axis, are also\ndiscussed.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:29:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ben-Shabo","Yehuda",""],["Kurbanov","Adeliya",""],["Schroter","Claus Dieter",""],["Moshammer","Robert",""],["Kreckel","Holger",""],["Toker","Yoni",""]]}
{"id":"2308.01006","submitter":"Tengju Ye","authors":"Tengju Ye, Wei Jing, Chunyong Hu, Shikun Huang, Lingping Gao, Fangzhen\n  Li, Jingke Wang, Ke Guo, Wencong Xiao, Weibo Mao, Hang Zheng, Kun Li, Junbo\n  Chen, Kaicheng Yu","title":"FusionAD: Multi-modality Fusion for Prediction and Planning Tasks of\n  Autonomous Driving","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Building a multi-modality multi-task neural network toward accurate and\nrobust performance is a de-facto standard in perception task of autonomous\ndriving. However, leveraging such data from multiple sensors to jointly\noptimize the prediction and planning tasks remains largely unexplored. In this\npaper, we present FusionAD, to the best of our knowledge, the first unified\nframework that fuse the information from two most critical sensors, camera and\nLiDAR, goes beyond perception task. Concretely, we first build a transformer\nbased multi-modality fusion network to effectively produce fusion based\nfeatures. In constrast to camera-based end-to-end method UniAD, we then\nestablish a fusion aided modality-aware prediction and status-aware planning\nmodules, dubbed FMSPnP that take advantages of multi-modality features. We\nconduct extensive experiments on commonly used benchmark nuScenes dataset, our\nFusionAD achieves state-of-the-art performance and surpassing baselines on\naverage 15% on perception tasks like detection and tracking, 10% on occupancy\nprediction accuracy, reducing prediction error from 0.708 to 0.389 in ADE score\nand reduces the collision rate from 0.31% to only 0.12%.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:29:44 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 03:10:46 GMT"},{"version":"v3","created":"Tue, 8 Aug 2023 06:45:25 GMT"},{"version":"v4","created":"Mon, 14 Aug 2023 08:28:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ye","Tengju",""],["Jing","Wei",""],["Hu","Chunyong",""],["Huang","Shikun",""],["Gao","Lingping",""],["Li","Fangzhen",""],["Wang","Jingke",""],["Guo","Ke",""],["Xiao","Wencong",""],["Mao","Weibo",""],["Zheng","Hang",""],["Li","Kun",""],["Chen","Junbo",""],["Yu","Kaicheng",""]]}
{"id":"2308.01007","submitter":"Hua-Xing Chen","authors":"Jia-Xin Lin, Hua-Xing Chen, Wei-Hong Liang, Wen-Ying Liu and Dan Zhou","title":"Molecular pentaquark states with open charm and bottom flavors","comments":"48 pages, 5 figures, 5 tables, suggestions and comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the possibly-existing molecular pentaquark states with open charm\nand bottom flavors, {\\it i.e.}, the states with the quark contents\n$c\\bar{b}qqq$ and $b\\bar{c}qqq$ ($q=u,d,s$). We investigate the meson-baryon\ninteractions through the coupled-channel unitary approach within the local\nhidden-gauge formalism, and extract the poles by solving the Bethe-Salpeter\nequation in coupled channels. These poles qualify as molecular pentaquark\nstates, which are dynamically generated from the meson-baryon interactions\nthrough the exchange of vector mesons. We calculate their masses and widths as\nwell as their couplings to various coupled channels. Our results suggest the\nexistence of the $\\Sigma_c^{(*)} B^{(*)}$ and $\\Sigma_b^{(*)} \\bar{D}^{(*)}$\nmolecular states with isospin $I=1/2$ as well as the $\\Xi_c^{(\\prime,*)}\nB^{(*)}$ and $\\Xi_b^{(\\prime,*)} \\bar{D}^{(*)}$ molecular states with isospin\n$I=0$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:30:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lin","Jia-Xin",""],["Chen","Hua-Xing",""],["Liang","Wei-Hong",""],["Liu","Wen-Ying",""],["Zhou","Dan",""]]}
{"id":"2308.01008","submitter":"Thor Wittich","authors":"Thor Wittich","title":"Operations on Milnor-Witt K-theory","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.AG math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For all positive integers $n$ and all homotopy modules $M_*$, we define\ncertain operations $\\underline{\\operatorname{K}}^{\\operatorname{MW}}_n\n\\rightarrow M_*$ and show that these generate the $M_*(k)$-module of all (in\ngeneral non-additive) operations\n$\\underline{\\operatorname{K}}^{\\operatorname{MW}}_n \\rightarrow M_*$ in a\nsuitable sense, if $M_*$ is $\\mathbb{N}$-graded and has a ring structure. This\nalso allows us to explicitly compute the abelian group\n$\\operatorname{Op}(\\underline{\\operatorname{K}}^{\\operatorname{MW}}_n,\\underline{\\operatorname{K}}^{\\operatorname{MW}}_m)$\nand all operations between related theories such as Milnor, Witt and\nMilnor-Witt K-theory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:30:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wittich","Thor",""]]}
{"id":"2308.01009","submitter":"Birgit Stiller","authors":"Birgit Stiller, Kevin Jaksch, Johannes Piotrowski, Moritz Merklein,\n  Mikolaj K. Schmidt, Khu Vu, Pan Ma, Stephen Madden, Michael J. Steel,\n  Christopher G. Poulton, and Benjamin J. Eggleton","title":"Brillouin light storage for 100 pulse widths","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Signal processing based on stimulated Brillouin scattering (SBS) is limited\nby the narrow linewidth of the optoacoustic response, which confines many\nBrillouin applications to continuous wave signals or optical pulses longer than\nseveral nanoseconds. In this work, we experimentally demonstrate Brillouin\ninteractions at the 150 ps time scale and a delay for a record 15 ns which\ncorresponds to a delay of 100 pulse widths. This breakthrough experimental\nresult was enabled by the high local gain of the chalcogenide waveguides as the\noptoacoustic interaction length reduces with pulse width. We successfully\ntransfer 150ps-long pulses to traveling acoustic waves within a Brillouin-based\nmemory setup. The information encoded in the optical pulses is stored for 15 ns\nin the acoustic field. We show the retrieval of eight amplitude levels,\nmultiple consecutive pulses and low distortion in pulse shape. The extension of\nBrillouin-based storage to the ultra-short pulse regime is an important step\nfor the realisation of practical Brillouin-based delay lines and other optical\nprocessing applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:32:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Stiller","Birgit",""],["Jaksch","Kevin",""],["Piotrowski","Johannes",""],["Merklein","Moritz",""],["Schmidt","Mikolaj K.",""],["Vu","Khu",""],["Ma","Pan",""],["Madden","Stephen",""],["Steel","Michael J.",""],["Poulton","Christopher G.",""],["Eggleton","Benjamin J.",""]]}
{"id":"2308.01010","submitter":"Nanami Kotani","authors":"Nanami Kotani and Asako Kanezaki","title":"Point Anywhere: Directed Object Estimation from Omnidirectional Images","comments":"Accepted to SIGGRAPH 2023 Poster. Project page:\n  https://github.com/NKotani/PointAnywhere","journal-ref":null,"doi":"10.1145/3588028.3603650","report-no":null,"categories":"cs.HC cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the intuitive instruction methods in robot navigation is a pointing\ngesture. In this study, we propose a method using an omnidirectional camera to\neliminate the user/object position constraint and the left/right constraint of\nthe pointing arm. Although the accuracy of skeleton and object detection is low\ndue to the high distortion of equirectangular images, the proposed method\nenables highly accurate estimation by repeatedly extracting regions of interest\nfrom the equirectangular image and projecting them onto perspective images.\nFurthermore, we found that training the likelihood of the target object in\nmachine learning further improves the estimation accuracy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:32:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kotani","Nanami",""],["Kanezaki","Asako",""]]}
{"id":"2308.01011","submitter":"Yuankai Wu","authors":"Chunwei Yang, Xiaoxu Chen, Lijun Sun, Hongyu Yang, Yuankai Wu","title":"Enhancing Representation Learning for Periodic Time Series with Floss: A\n  Frequency Domain Regularization Approach","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time series analysis is a fundamental task in various application domains,\nand deep learning approaches have demonstrated remarkable performance in this\narea. However, many real-world time series data exhibit significant periodic or\nquasi-periodic dynamics that are often not adequately captured by existing deep\nlearning-based solutions. This results in an incomplete representation of the\nunderlying dynamic behaviors of interest. To address this gap, we propose an\nunsupervised method called Floss that automatically regularizes learned\nrepresentations in the frequency domain. The Floss method first automatically\ndetects major periodicities from the time series. It then employs periodic\nshift and spectral density similarity measures to learn meaningful\nrepresentations with periodic consistency. In addition, Floss can be easily\nincorporated into both supervised, semi-supervised, and unsupervised learning\nframeworks. We conduct extensive experiments on common time series\nclassification, forecasting, and anomaly detection tasks to demonstrate the\neffectiveness of Floss. We incorporate Floss into several representative deep\nlearning solutions to justify our design choices and demonstrate that it is\ncapable of automatically discovering periodic dynamics and improving\nstate-of-the-art deep learning models.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:37:45 GMT"},{"version":"v2","created":"Sun, 6 Aug 2023 02:24:01 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 06:05:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yang","Chunwei",""],["Chen","Xiaoxu",""],["Sun","Lijun",""],["Yang","Hongyu",""],["Wu","Yuankai",""]]}
{"id":"2308.01012","submitter":"Ze-Yu Peng","authors":"Ze-Yu Peng, Yun-Song Piao","title":"Testing the $n_s-H_0$ scaling relation with Planck-independent CMB data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In early dark energy (EDE) resolution of Hubble tension, the spectral index\n$n_s$ of primordial scalar perturbation follows a scaling relation $\\delta\nn_s\\simeq 0.4\\frac{\\delta H_0}{H_0}$, where $H_0$ is the Hubble constant.\nHowever, this $n_s-H_0$ relation was obtained based on the datasets including\nPlanck cosmic microwave background (CMB) data. In this paper, we investigate\nthis scaling relation with Planck-independent CMB data, i.e. ACT and SPT-3G\ncombined with WMAP(+BAO+Pantheon), respectively. Our results show that the\nWMAP+SPT-3G dataset also follows this scaling relation, while the WMAP+ACT\ndataset seems to favor smaller $n_s$, which is related to the fact that the\ncritical redshift $z_c$, at which EDE is excited, favored by the WMAP+ACT\ndataset is lower and closer to the recombination time.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:47:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Peng","Ze-Yu",""],["Piao","Yun-Song",""]]}
{"id":"2308.01013","submitter":"Anup Aprem","authors":"Anoop C V, Neeraj Negi, Anup Aprem","title":"Bayesian framework for characterizing cryptocurrency market dynamics,\n  structural dependency, and volatility using potential field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Identifying the structural dependence between the cryptocurrencies and\npredicting market trend are fundamental for effective portfolio management in\ncryptocurrency trading. In this paper, we present a unified Bayesian framework\nbased on potential field theory and Gaussian Process to characterize the\nstructural dependency of various cryptocurrencies, using historic price\ninformation. The following are our significant contributions: (i) Proposed a\nnovel model for cryptocurrency price movements as a trajectory of a dynamical\nsystem governed by a time-varying non-linear potential field. (ii) Validated\nthe existence of the non-linear potential function in cryptocurrency market\nthrough Lyapunov stability analysis. (iii) Developed a Bayesian framework for\ninferring the non-linear potential function from observed cryptocurrency\nprices. (iv) Proposed that attractors and repellers inferred from the potential\nfield are reliable cryptocurrency market indicators, surpassing existing\nattributes, such as, mean, open price or close price of an observation window,\nin the literature. (v) Analysis of cryptocurrency market during various Bitcoin\ncrash durations from April 2017 to November 2021, shows that attractors\ncaptured the market trend, volatility, and correlation. In addition, attractors\naids explainability and visualization. (vi) The structural dependence inferred\nby the proposed approach was found to be consistent with results obtained using\nthe popular wavelet coherence approach. (vii) The proposed market indicators\n(attractors and repellers) can be used to improve the prediction performance of\nstate-of-art deep learning price prediction models. As, an example, we show\nimprovement in Litecoin price prediction up to a horizon of 12 days.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:48:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["C","Anoop","V"],["Negi","Neeraj",""],["Aprem","Anup",""]]}
{"id":"2308.01014","submitter":"Andreu Angl\\'es-Castillo","authors":"Andreu Angl\\'es-Castillo, Armando P\\'erez, Eugenio Rold\\'an","title":"Solitons in a photonic nonlinear quantum walk: lessons from the\n  continuum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyse a nonlinear QW model which can be experimentally implemented using\nthe components of the electric field on an optical nonlinear Kerr medium, which\ntranslates into a rotation in the coin operator, with an angle which depends\n(in a nonlinear fashion) on the state of the walker. This simple dependence\nmakes it easy to consider the space-time continuum limit of the evolution\nequation, which takes the form of a nonlinear Dirac equation. The analysis of\nthis continuum limit allows us, under some approximations, to gain some insight\ninto the nature of soliton structures, which is illustrated by our numerical\ncalculations. These solitons are stable structures whose trajectories can be\nmodulated by choosing the appropriate initial conditions. We have also studied\nthe stability of solitons when they are subject to an additional phase that\nsimulates an external electric field, and also explored if they are formed in\nhigher dimensional spaces.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:51:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Angl\u00e9s-Castillo","Andreu",""],["P\u00e9rez","Armando",""],["Rold\u00e1n","Eugenio",""]]}
{"id":"2308.01015","submitter":"Jorge Sarrato-Al\\'os","authors":"Jorge Sarrato-Al\\'os, Christopher Brook and Arianna Di Cintio","title":"Constraining gas metal mixing strength in simulations using observations\n  of the Milky Way's disc","comments":"7 pages, 3 figures, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2365","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work explores the mixing rate of metals in the interstellar medium\n(ISM), comparing observational constraints from our solar neighbourhood to high\nresolution cosmological hydrodynamical simulations of Milky Way (MW)-like\ngalaxies. The mixing rate, described by the coefficient C, is varied in\nsimulations between 0 and 0.05, with resultant simulated galaxies compared to\nobservations of metallicity dispersion in young star clusters, HII regions and\nneutral gas in the disc of the MW. A value of C between 0.003125 and 0.0125 is\nfound to self-consistently match a range of observables, with a best estimate\nof C=0.0064$\\pm$0.0004. We demonstrate that the relationship between metal\ndispersion in young stars, HII regions and neutral gas, versus the coefficient\nC, can be described by a power law. These constrained mixing rates infer a\ncomparatively well mixed ISM in the solar neighbourhood, at odds with some\nrecent observations that have reported a highly inhomogeneous ISM. The degree\nof mixing suggested by this work is lower than what often employed in many\nhydrodynamical simulations. Our results have implications for studying the\nmetallicity distribution of stars as well as of gas in the interstellar and\ncircumgalactic media.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:56:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sarrato-Al\u00f3s","Jorge",""],["Brook","Christopher",""],["Di Cintio","Arianna",""]]}
{"id":"2308.01016","submitter":"Antoine Cyril David Hoffmann A. C. D. Hoffmann","authors":"A.C.D. Hoffmann, B.J. Frei, P. Ricci","title":"Dimits shift and impact of collisions using a gyrokinetic moment-based\n  approach","comments":"20 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.comp-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This study presents a comprehensive benchmark and convergence analysis of the\ngyromoment (GM) approach in the gyrokinetic local flux-tube limit, focusing on\nthe cyclone base case (CBC) and the Dimits shift. The GM approach demonstrates\nits efficacy in accurately capturing the nonlinear dynamics of the CBC with\nfewer velocity space points compared to the GENE code. Increasing velocity\ndissipation enhances convergence, albeit with a slight discrepancy in the\nsaturated heat flux value. The GM approach successfully reproduces the Dimits\nshift and effectively captures its width compared to the ITG threshold. In the\ncollisional case, we obtain a good agreement with previous global PIC results\non transport. We report that the choice of collision model has a minimal impact\nboth on the ITG growth rate and on the nonlinear saturated heat flux. We\nattribute this to the adiabatic electron model that impeaches the electron-ion\ncollisions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:56:36 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 09:09:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hoffmann","A. C. D.",""],["Frei","B. J.",""],["Ricci","P.",""]]}
{"id":"2308.01017","submitter":"Jing Ren","authors":"Di Wu, Pengyuan Gao, Jing Ren, Niayesh Afshordi","title":"Model-agnostic search for the quasinormal modes of gravitational wave\n  echoes","comments":"44 pages, 18 figures, 4 tables. Python code to reproduce figures is\n  available at the link http://github.com/hermione-evans/echomase","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Post-merger gravitational wave echoes provide a unique opportunity to probe\nthe near-horizon structure of astrophysical black holes, that may be modified\ndue to non-perturbative quantum gravity phenomena. However, since the waveform\nis subject to large theoretical uncertainties, it is necessary to develop\nmodel-agnostic search methods for detecting echoes from observational data. A\npromising strategy is to identify the characteristic quasinormal modes (QNMs)\nassociated with echoes, {\\it in frequency space}, which complements existing\nsearches of quasiperiodic pulses in time. In this study, we build upon our\nprevious work targeting these modes by incorporating relative phase information\nto optimize the Bayesian search algorithm. Using a new phase-marginalized\nlikelihood, the performance can be significantly improved for well-resolved\nQNMs. This enables an efficient model-agnostic search for QNMs of different\nshapes by using a simple search template. To demonstrate the robustness of the\nsearch algorithm, we construct four complementary benchmarks for the echo\nwaveform that span a diverse range of different theoretical possibilities for\nthe near-horizon structure. We then validate our Bayesian search algorithms by\ninjecting the benchmark models into different realizations of Gaussian noise.\nUsing two types of phase-marginalized likelihoods, we find that the search\nalgorithm can efficiently detect the corresponding QNMs. Therefore, our search\nstrategy provides a concrete Bayesian and model-agnostic approach to \"quantum\nblack hole seismology\".\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:57:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Di",""],["Gao","Pengyuan",""],["Ren","Jing",""],["Afshordi","Niayesh",""]]}
{"id":"2308.01018","submitter":"Ramanan Sivaguru","authors":"Ramanan Sivaguru, Vasista Sai Lodagala, S Umesh","title":"SALTTS: Leveraging Self-Supervised Speech Representations for improved\n  Text-to-Speech Synthesis","comments":"Accepted for publication at Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  While FastSpeech2 aims to integrate aspects of speech such as pitch, energy,\nand duration as conditional inputs, it still leaves scope for richer\nrepresentations. As a part of this work, we leverage representations from\nvarious Self-Supervised Learning (SSL) models to enhance the quality of the\nsynthesized speech. In particular, we pass the FastSpeech2 encoder's\nlength-regulated outputs through a series of encoder layers with the objective\nof reconstructing the SSL representations. In the SALTTS-parallel\nimplementation, the representations from this second encoder are used for an\nauxiliary reconstruction loss with the SSL features. The SALTTS-cascade\nimplementation, however, passes these representations through the decoder in\naddition to having the reconstruction loss. The richness of speech\ncharacteristics from the SSL features reflects in the output speech quality,\nwith the objective and subjective evaluation measures of the proposed approach\noutperforming the baseline FastSpeech2.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 08:59:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sivaguru","Ramanan",""],["Lodagala","Vasista Sai",""],["Umesh","S",""]]}
{"id":"2308.01019","submitter":"Yang Yang","authors":"Yang Yang, Xi Chen, Zhibo Jiang, Zhiwei Chen, Shuling Yu, Jun Li","title":"In Search of Infall Motion in Molecular Clumps. IV. Mapping of the\n  Global Infall Sources","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We have used the IRAM 30-m telescope to map some targets with HCO$^+$ (1-0)\nand H$^{13}$CO$^+$ (1-0) lines in order to search for gas infall evidence in\nthe clumps. In this paper, we report the mapping results for 13 targets. All of\nthese targets show HCO$^+$ emissions, while H$^{13}$CO$^+$ emissions are\nobserved in ten of them. The HCO$^+$ integrated intensity maps of ten targets\nshow clear clumpy structures, and nine targets show clumpy structures in the\nH$^{13}$CO$^+$ maps. Using the RADEX radiative transfer code, we estimate the\ncolumn density of H$^{13}$CO$^+$, and determine the abundance ratio\n[H$^{13}$CO$^+$]/[H$_2$] to be approximately 10$^{-12}$ to 10$^{-10}$. Based on\nthe asymmetry of the HCO$^+$ line profiles, we identify 11 targets show blue\nprofiles, while six clumps have global infall evidence. We use the RATRAN and\ntwo-layer models to fit the HCO$^+$ line profiles of these infall sources, and\nanalyze their spatial distribution of the infall velocity. The average infall\nvelocities estimated by these two models are 0.24 -- 1.85 km s$^{-1}$ and 0.28\n-- 1.45 km s$^{-1}$, respectively. The mass infall rate ranges from\napproximately 10$^{-5}$ to 10$^{-2}$ M$_{\\odot}$ yr$^{-1}$, which suggests that\nintermediate- or high-mass stars may be forming in the target regions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:02:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Yang",""],["Chen","Xi",""],["Jiang","Zhibo",""],["Chen","Zhiwei",""],["Yu","Shuling",""],["Li","Jun",""]]}
{"id":"2308.01020","submitter":"Ali Arjomandi-Nezhad","authors":"Ali Arjomandi-Nezhad, Yifei Guo, Bikash C. Pal, and Damiano Varagnolo","title":"A Model Predictive Approach for Enhancing Transient Stability of\n  Grid-Forming Converters","comments":"14 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A model-based approach for controlling post-fault transient stability of\ngrid-forming (GFM) converter energy resources is designed and analyzed. This\nproposed controller is activated when the converter enters into the saturated\ncurrent operation mode. It aims at mitigating the issues arising from\ninsufficient post-fault deceleration due to current saturation and thus\nimproving the transient stability of the GFM Inverter Based Resources (IBRs).\nThe considered approach conveniently modifies the post-fault trajectory of GFM\nIBRs by introducing appropriate corrective phase angle jumps and power\nreferences. These corrections are optimised following a model predictive\napproach (the model referring to post-fault dynamics of GFM IBRs in both\nsaturated and normal operation modes). While constructing the proposed\ncontroller, the situation for GFM IBRs to enter into the saturated operation\nmode are identified. The effectiveness of this transient stability enhancement\napproach by means of dynamic simulations under various grid conditions is\ntested and discussed. The results demonstrate much better transient stability\nperformance.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:08:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Arjomandi-Nezhad","Ali",""],["Guo","Yifei",""],["Pal","Bikash C.",""],["Varagnolo","Damiano",""]]}
{"id":"2308.01021","submitter":"Nicholas Sedlmayr","authors":"Szczepan G{\\l}odzik and Nicholas Sedlmayr","title":"Quantized Thermal Hall Conductance and the Topological Phase Diagram of\n  a Superconducting Bismuth Bilayer","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":"  Two dimensional topological superconductors with chiral edge modes are\npredicted to posses a quantized thermal Hall effect, exactly half that for\nchiral topological insulators, which is proportional to the Chern number.\nHowever not much work has been done in identifying this in the standard models\nin the literature. Here we introduce a model based on a proximity induced\nsuperconducting Bismuth bilayer, to directly calculate the thermal Hall\nconductance based on the lattice model. This model serves as a demonstration of\nthe state of the art possible in such a calculation, as well as introducing an\ninteresting paradigmatic topological superconductor with a rich phase diagram.\nWe demonstrate the quantized thermal Hall plateaus in several different\ntopological phases, and compare this to numerical calculations of the Chern\nnumber, as well as analytical calculations of the Chern number's parity\ninvariant. We demonstrate that it is possible to get a reasonable topological\nphase diagram from the quantized thermal Hall calculations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:08:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["G\u0142odzik","Szczepan",""],["Sedlmayr","Nicholas",""]]}
{"id":"2308.01022","submitter":"Wen Wei","authors":"Wen Wei, Jiankun Wang","title":"Ethical Decision-making for Autonomous Driving based on LSTM Trajectory\n  Prediction Network","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The development of autonomous vehicles has brought a great impact and changes\nto the transportation industry, offering numerous benefits in terms of safety\nand efficiency. However, one of the key challenges that autonomous driving\nfaces is how to make ethical decisions in complex situations. To address this\nissue, in this article, a novel trajectory prediction method is proposed to\nachieve ethical decision-making for autonomous driving. Ethical considerations\nare integrated into the decision-making process of autonomous vehicles by\nquantifying the utility principle and incorporating them into mathematical\nformulas. Furthermore, trajectory prediction is optimized using LSTM network\nwith an attention module, resulting in improved accuracy and reliability in\ntrajectory planning and selection. Through extensive simulation experiments, we\ndemonstrate the effectiveness of the proposed method in making ethical\ndecisions and selecting optimal trajectories.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:11:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wei","Wen",""],["Wang","Jiankun",""]]}
{"id":"2308.01023","submitter":"Nathan Huet","authors":"Stephan Cl\\'emen\\c{c}on, Nathan Huet, Anne Sabourin","title":"Regular Variation in Hilbert Spaces and Principal Component Analysis for\n  Functional Extremes","comments":"29 pages (main paper), 5 pages (appendix)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.FA stat.ML stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by the increasing availability of data of functional nature, we\ndevelop a general probabilistic and statistical framework for extremes of\nregularly varying random elements $X$ in $L^2[0,1]$. We place ourselves in a\nPeaks-Over-Threshold framework where a functional extreme is defined as an\nobservation $X$ whose $L^2$-norm $\\|X\\|$ is comparatively large. Our goal is to\npropose a dimension reduction framework resulting into finite dimensional\nprojections for such extreme observations. Our contribution is double. First,\nwe investigate the notion of Regular Variation for random quantities valued in\na general separable Hilbert space, for which we propose a novel concrete\ncharacterization involving solely stochastic convergence of real-valued random\nvariables. Second, we propose a notion of functional Principal Component\nAnalysis (PCA) accounting for the principal `directions' of functional\nextremes. We investigate the statistical properties of the empirical covariance\noperator of the angular component of extreme functions, by upper-bounding the\nHilbert-Schmidt norm of the estimation error for finite sample sizes. Numerical\nexperiments with simulated and real data illustrate this work.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:12:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cl\u00e9men\u00e7on","Stephan",""],["Huet","Nathan",""],["Sabourin","Anne",""]]}
{"id":"2308.01024","submitter":"Koji Nakano","authors":"Koji Nakano and Shunsuke Tsukiyama and Yasuaki Ito and Takashi Yazane\n  and Junko Yano and Takumi Kato and Shiro Ozaki and Rie Mori and Ryota Katsuki","title":"Dual-Matrix Domain-Wall: A Novel Technique for Generating Permutations\n  by QUBO and Ising Models with Quadratic Sizes","comments":"26 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET cs.DC quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Ising model is defined by an objective function using a quadratic formula\nof qubit variables. The problem of an Ising model aims to determine the qubit\nvalues of the variables that minimize the objective function, and many\noptimization problems can be reduced to this problem. In this paper, we focus\non optimization problems related to permutations, where the goal is to find the\noptimal permutation out of the $n!$ possible permutations of $n$ elements. To\nrepresent these problems as Ising models, a commonly employed approach is to\nuse a kernel that utilizes one-hot encoding to find any one of the $n!$\npermutations as the optimal solution. However, this kernel contains a large\nnumber of quadratic terms and high absolute coefficient values. The main\ncontribution of this paper is the introduction of a novel permutation encoding\ntechnique called dual-matrix domain-wall, which significantly reduces the\nnumber of quadratic terms and the maximum absolute coefficient values in the\nkernel. Surprisingly, our dual-matrix domain-wall encoding reduces the\nquadratic term count and maximum absolute coefficient values from $n^3-n^2$ and\n$2n-4$ to $6n^2-12n+4$ and $2$, respectively. We also demonstrate the\napplicability of our encoding technique to partial permutations and Quadratic\nUnconstrained Binary Optimization (QUBO) models. Furthermore, we discuss a\nfamily of permutation problems that can be efficiently implemented using\nIsing/QUBO models with our dual-matrix domain-wall encoding.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:15:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nakano","Koji",""],["Tsukiyama","Shunsuke",""],["Ito","Yasuaki",""],["Yazane","Takashi",""],["Yano","Junko",""],["Kato","Takumi",""],["Ozaki","Shiro",""],["Mori","Rie",""],["Katsuki","Ryota",""]]}
{"id":"2308.01025","submitter":"Young-Man Kim","authors":"Young-Man Kim","title":"Error Analysis of CORDIC Processor with FPGA Implementation","comments":"5 pages, 7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The coordinate rotation digital computer (CORDIC) is a shift-add based fast\ncomputing algorithm which has been found in many digital signal processing\n(DSP) applications. In this paper, a detailed error analysis based on mean\nsquare error criteria and its implementation on FPGA is presented. Two\nconsidered error sources are an angle approximation error and a quantization\nerror due to finite word length in fixed-point number system. The error bound\nand variance are discussed in theory. The CORDIC algorithm is implemented on\nFPGA using the Xilinx Zynq-7000 development board called ZedBoard. Those\nresults of theoretical error analysis are practically investigated by\nimplementing it on actual FPGA board. In addition, Matlab is used to provide\ntheoretical value as a baseline model by being set up in double-precision\nfloating-point to compare it with the practical value of errors on FPGA\nimplementation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:16:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kim","Young-Man",""]]}
{"id":"2308.01026","submitter":"James MacManus","authors":"Severin Bunk, James MacManus, Alexander Schenkel","title":"Lorentzian bordisms in algebraic quantum field theory","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.DG math.MP math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that every algebraic quantum field theory has an underlying\nfunctorial field theory which is defined on a suitable globally hyperbolic\nLorentzian bordism pseudo-category. This means that globally hyperbolic\nLorentzian bordisms between Cauchy surfaces arise naturally in the context of\nalgebraic quantum field theory. The underlying functorial field theory encodes\nthe time evolution of the original theory, but not its spatially local\nstructure. As an illustrative application of these results, the algebraic and\nfunctorial descriptions of a free scalar quantum field are compared in detail.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:17:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bunk","Severin",""],["MacManus","James",""],["Schenkel","Alexander",""]]}
{"id":"2308.01027","submitter":"Marius Kroll","authors":"Holger Dette and Marius Kroll","title":"A Simple Bootstrap for Chatterjee's Rank Correlation","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":"  We prove that an $m$ out of $n$ bootstrap procedure for Chatterjee's rank\ncorrelation is consistent whenever asymptotic normality of Chatterjee's rank\ncorrelation can be established. In particular, we prove that $m$ out of $n$\nbootstrap works for continuous as well as for discrete and independent data;\nfurthermore, simulations indicate that it also performs well for discrete and\ndependent data, and that it outperforms alternative estimation methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:21:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dette","Holger",""],["Kroll","Marius",""]]}
{"id":"2308.01028","submitter":"Aayush Chaudhary","authors":"Aayush Chaudhary, Abhinav Rai, Abhishek Gupta","title":"Maximizing Success Rate of Payment Routing using Non-stationary Bandits","comments":"7 Pages, 6 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper discusses the system architecture design and deployment of\nnon-stationary multi-armed bandit approaches to determine a near-optimal\npayment routing policy based on the recent history of transactions. We propose\na Routing Service architecture using a novel Ray-based implementation for\noptimally scaling bandit-based payment routing to over 10000 transactions per\nsecond, adhering to the system design requirements and ecosystem constraints\nwith Payment Card Industry Data Security Standard (PCI DSS). We first evaluate\nthe effectiveness of multiple bandit-based payment routing algorithms on a\ncustom simulator to benchmark multiple non-stationary bandit approaches and\nidentify the best hyperparameters. We then conducted live experiments on the\npayment transaction system on a fantasy sports platform Dream11. In the live\nexperiments, we demonstrated that our non-stationary bandit-based algorithm\nconsistently improves the success rate of transactions by 0.92\\% compared to\nthe traditional rule-based methods over one month.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:23:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chaudhary","Aayush",""],["Rai","Abhinav",""],["Gupta","Abhishek",""]]}
{"id":"2308.01029","submitter":"Robert Allen","authors":"Robert Allen","title":"Hopf algebroids and Grothendieck-Verdier duality","comments":"12 pages, formerly 'The category of finite-dimensional modules over a\n  Hopf algebroid with bijective antipode is Grothendieck-Verdier'","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.CT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Grothendieck-Verdier duality is a powerful and ubiquitous structure on\nmonoidal categories, which generalises the notion of rigidity. Hopf algebroids\nare a generalisation of Hopf algebras, to a non-commutative base ring. Just as\nthe category of finite-dimensional modules over a Hopf algebra inherits\nrigidity from the category of vector spaces, we show that the category of\nfinite-dimensional modules over a Hopf algebroid with bijective antipode\ninherits a Grothendieck-Verdier structure from the category of bimodules over\nits base algebra. We investigate the structure on both the algebraic and\ncategorical sides of this duality.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:25:16 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 09:37:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Allen","Robert",""]]}
{"id":"2308.01030","submitter":"Hyunjun Choi","authors":"Hyunjun Choi, JaeHo Chung, Hawook Jeong, Jin Young Choi","title":"Three Factors to Improve Out-of-Distribution Detection","comments":"Under review","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 problem of out-of-distribution (OOD) detection, the usage of auxiliary\ndata as outlier data for fine-tuning has demonstrated encouraging performance.\nHowever, previous methods have suffered from a trade-off between classification\naccuracy (ACC) and OOD detection performance (AUROC, FPR, AUPR). To improve\nthis trade-off, we make three contributions: (i) Incorporating a self-knowledge\ndistillation loss can enhance the accuracy of the network; (ii) Sampling\nsemi-hard outlier data for training can improve OOD detection performance with\nminimal impact on accuracy; (iii) The introduction of our novel supervised\ncontrastive learning can simultaneously improve OOD detection performance and\nthe accuracy of the network. By incorporating all three factors, our approach\nenhances both accuracy and OOD detection performance by addressing the\ntrade-off between classification and OOD detection. Our method achieves\nimprovements over previous approaches in both performance metrics.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:27:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Choi","Hyunjun",""],["Chung","JaeHo",""],["Jeong","Hawook",""],["Choi","Jin Young",""]]}
{"id":"2308.01031","submitter":"Massimiliano Lincetto","authors":"Massimiliano Lincetto, Eric Evans-Jacquez, Benedikt Riedel, David\n  Schultz, Tianlu Yuan (for the IceCube Collaboration)","title":"An improved infrastructure for the IceCube realtime system","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions. 8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1106","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube realtime alert system has been operating since 2016. It provides\nprompt alerts on high-energy neutrino events to the astroparticle physics\ncommunity. The localization regions for the incoming direction of neutrinos are\npublished through NASA's Gamma-ray Coordinate Network (GCN). The IceCube\nrealtime system consists of infrastructure dedicated to the selection of alert\nevents, the reconstruction of their topology and arrival direction, the\ncalculation of directional uncertainty contours and the distribution of the\nevent information through public alert networks. Using a message-based workflow\nmanagement system, a dedicated software (SkyDriver) provides a representational\nstate transfer (REST) interface to parallelized reconstruction algorithms. In\nthis contribution, we outline the improvements of the internal infrastructure\nof the IceCube realtime system that aims to streamline the internal handling of\nneutrino events, their distribution to the SkyDriver interface, the collection\nof the reconstruction results as well as their conversion into human- and\nmachine-readable alerts to be publicly distributed through different alert\nnetworks. An approach for the long-term storage and cataloging of alert events\naccording to findability, accessibility, interoperability and reusability\n(FAIR) principles is outlined.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:27:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lincetto","Massimiliano","","for the IceCube Collaboration"],["Evans-Jacquez","Eric","","for the IceCube Collaboration"],["Riedel","Benedikt","","for the IceCube Collaboration"],["Schultz","David","","for the IceCube Collaboration"],["Yuan","Tianlu","","for the IceCube Collaboration"]]}
{"id":"2308.01032","submitter":"Diego Real","authors":"S. Aiello, A. Albert, S. Alves Garre, Z. Aly, A. Ambrosone, F. Ameli,\n  M. Andre, E. Androutsou, M. Anghinolfi, M. Anguita, L. Aphecetche, M. Ardid,\n  S. Ardid, H. Atmani, J. Aublin, C. Bagatelas, L. Bailly-Salins, Z.\n  Barda\\v{c}ov\\'a, B. Baret, S. Basegmez du Pree, Y. Becherini, M. Bendahman,\n  F. Benfenati, M. Benhassi, D. M. Benoit, E. Berbee, V. Bertin, V. van\n  Beveren, S. Biagi, M. Boettcher, J. Boumaaza, M. Bouta, M. Bouwhuis, C.\n  Bozzaa, R. M. Bozza, H.Br\\^anza\\c{s}a, F. Bretaudeau, R. Bruijn, J. Brunner,\n  R. Bruno, E. Buisa, R. Buompane, J. Busto, B. Caiffi, D. Calvo, S. Campion,\n  A. Capone, F. Carenini, V. Carretero, T. Cartraud, P. Castaldia, V. Cecchini,\n  S. Celli, L. Ceris, M. Chabab, M. Chadolia, A. Chen, S. Cherubini, T.\n  Chiarusi, M. Circella, R. Cocimano, J. A. B. Coelho, A. Coleiro, R.\n  Coniglione, P. Coyle, A. Creusot, A. Cruza, G. Cuttone, R. Dallier, Y.\n  Darrasa, A. De Beneditti, B. De Martino, V. Decoene, R. Del Burgo, L. S. Di\n  Mauro, I. Di Palma, A. F. D\\'iaz, D. Diego-Tortosa, C. Distefano, A. Domia,\n  C. Donzaud, D. Dornic, M. D\\\"orra, E. Drakopoulou, D. Drouhin, R.\n  Dvornick\\'y, T. Eberla, E. Eckerov\\', A. Eddymaoui, T. van Eeden, M. Effa, D.\n  van Eijk, I. El Bojaddaini, S. El Hedri, A. Enzenh\\\"ofer, G. Ferrara, M. D.\n  Filipovi\\'c, F. Filippini, L. A. Fusco, O. Gabella, J. Gabriela, S.\n  Gagliardini, T. Gala, J. Garc\\'ia M\\'endez, A. Garcia Soto, C. Gatius Oliver,\n  N. Gei{\\ss}elbrecht, H. Ghaddari, L. Gialanella, B. K. Gibson, E. Giorgio, A.\n  Girardi, I. Goos, D. Goupilliere, S. R. Gozzinic, R. Gracia, K. Graf, C.\n  Guidia, B. Guillon, M. Guti\\'errez, H. van Haren, A. Heijboer, A. Hekalo, L.\n  Hennig, J. J. Hern\\'andez-Rey, F. Huang, W. Idrissi Ibnsalih, G. Illuminati,\n  C. W. Jamesa, P. Jansweijer, M. de Jongat, P. de Jong, B. J. Jung, P.\n  Kalaczy\\'nski, O. Kalekin, U. F. Katz, N. R. Khan Chowdhury, A. Khatun, G.\n  Kistauri, C. Kopper, A. Kouchner, V. Kulikovskiy, R. Kvatadzea, M. Labalme,\n  R. Lahmann, G. Larosa, C. Lastoria, A. Lazo, S. Le Stum, G. Lehaut, E.\n  Leonora, N. Lessing, G. Levi, M. Lindsey Clark, F. Longhitano, J. Majumdar,\n  L. Malerba, F. Mamedov, J. Ma\\'nczakc, A. Manfred, M. Marconi, A. Margiott,\n  A. Marinelli, C. Markou, L. Martin, J. A. Mart\\'inez-Mora, F. Marzaioli, M.\n  Mastrodicasa, S. Mastroianni, S. Miccich\\`e, G. Miele, P. Migliozzi, E.\n  Migneco, S. Minutoli, M. L. Mitsou, C. M. Mollo, L. Morales-Gallegos, C.\n  Morley-Wonga, A. Mosbruggera, A. Moussa, I. Mozun Mateo, R. Muller, M. R.\n  Musone, M. Musumeci, L. Nauta, S. Navas, A. Nayerhoda, C. A. Nicola, B.\n  Nkosi, B. \\'O Fearraigha, V. Oliviero, A. Orlando, E. Oukach, J. Palacios\n  Gonz\\'alez, G. Papalashvilia, E.J. Pastor Gomez, A. M. P\\u{a}un, G. E.\n  P\\u{a}v\\u{a}la\\c{s}, S. Pe\\~na Mart\\'inez, M. Perrin-Terrind, J. Perronnel,\n  V. Pestela, R. Pestes, P. Piattelli, C. Poir\\`e, V. Popa, T. Pradier, S.\n  Pulvirenti, G. Qu\\'em\\'ener, C. Quiroz, U. Rahaman, N. Randazzo, S.\n  Razzaqueb, I. C. Rea, D. Real, S. Reck, G. Riccobene, J. Robinson, A.\n  Romanova, A. Saina, F. Salesa Greus, D. F. E. Samtleben, A. S\\'anchez Losa,\n  M. Sanguineti, C. Santonastaso, D. Santonocito, P. Sapienza, Y. Scarpetta, J.\n  Schnabel, M. F. Schneider, J. Schumann, H. M. Schutte, J. Seneca, B. Setter,\n  I. Sgura, R. Shanidze, Y. Shitov, F. \\v{S}imkovic, A. Simonelli, A.\n  Sinopoulou, M.V. Smirnov, B. Spisso, M. Spurio, D. Stavropoulos, I.\n  \\v{S}tekl, M. Taiuti, Y. Tayalati, H. Tedjditi, H. Thiersen, I. Tosta e Melo,\n  B. Trocme, S. Tsagkli, V. Tsourapis, E. Tzamariudaki, A. Vacheret, V.\n  Valsecchi, V. Van Elewyck G. Vannoye, G. Vasileiadisa, F. Vazquez de Sola, C.\n  Verilhac, A. Veutro, S. Viola, D. Vivolo, H. Warnhofer, J. Wilmsb, E. de\n  Wolf, H. Yepes-Ramirez, G. Zarpapis, S. Zavatarelli, A. Zegarelli, D. Zito,\n  J. D. Zornoza, J. Z\\'u\\~niga, N. Zywucka","title":"Embedded Software of the KM3NeT Central Logic Board","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The KM3NeT Collaboration is building and operating two deep sea neutrino\ntelescopes at the bottom of the Mediterranean Sea. The telescopes consist of\nlatices of photomultiplier tubes housed in pressure-resistant glass spheres,\ncalled digital optical modules and arranged in vertical detection units. The\ntwo main scientific goals are the determination of the neutrino mass ordering\nand the discovery and observation of high-energy neutrino sources in the\nUniverse. Neutrinos are detected via the Cherenkov light, which is induced by\ncharged particles originated in neutrino interactions. The photomultiplier\ntubes convert the Cherenkov light into electrical signals that are acquired and\ntimestamped by the acquisition electronics. Each optical module houses the\nacquisition electronics for collecting and timestamping the photomultiplier\nsignals with one nanosecond accuracy. Once finished, the two telescopes will\nhave installed more than six thousand optical acquisition nodes, completing one\nof the more complex networks in the world in terms of operation and\nsynchronization. The embedded software running in the acquisition nodes has\nbeen designed to provide a framework that will operate with different hardware\nversions and functionalities. The hardware will not be accessible once in\noperation, which complicates the embedded software architecture. The embedded\nsoftware provides a set of tools to facilitate remote manageability of the\ndeployed hardware, including safe reconfiguration of the firmware. This paper\npresents the architecture and the techniques, methods and implementation of the\nembedded software running in the acquisition nodes of the KM3NeT neutrino\ntelescopes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:27:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Aiello","S.",""],["Albert","A.",""],["Garre","S. Alves",""],["Aly","Z.",""],["Ambrosone","A.",""],["Ameli","F.",""],["Andre","M.",""],["Androutsou","E.",""],["Anghinolfi","M.",""],["Anguita","M.",""],["Aphecetche","L.",""],["Ardid","M.",""],["Ardid","S.",""],["Atmani","H.",""],["Aublin","J.",""],["Bagatelas","C.",""],["Bailly-Salins","L.",""],["Barda\u010dov\u00e1","Z.",""],["Baret","B.",""],["Pree","S. Basegmez du",""],["Becherini","Y.",""],["Bendahman","M.",""],["Benfenati","F.",""],["Benhassi","M.",""],["Benoit","D. M.",""],["Berbee","E.",""],["Bertin","V.",""],["van Beveren","V.",""],["Biagi","S.",""],["Boettcher","M.",""],["Boumaaza","J.",""],["Bouta","M.",""],["Bouwhuis","M.",""],["Bozzaa","C.",""],["Bozza","R. M.",""],["Br\u00e2nza\u015fa","H.",""],["Bretaudeau","F.",""],["Bruijn","R.",""],["Brunner","J.",""],["Bruno","R.",""],["Buisa","E.",""],["Buompane","R.",""],["Busto","J.",""],["Caiffi","B.",""],["Calvo","D.",""],["Campion","S.",""],["Capone","A.",""],["Carenini","F.",""],["Carretero","V.",""],["Cartraud","T.",""],["Castaldia","P.",""],["Cecchini","V.",""],["Celli","S.",""],["Ceris","L.",""],["Chabab","M.",""],["Chadolia","M.",""],["Chen","A.",""],["Cherubini","S.",""],["Chiarusi","T.",""],["Circella","M.",""],["Cocimano","R.",""],["Coelho","J. A. B.",""],["Coleiro","A.",""],["Coniglione","R.",""],["Coyle","P.",""],["Creusot","A.",""],["Cruza","A.",""],["Cuttone","G.",""],["Dallier","R.",""],["Darrasa","Y.",""],["De Beneditti","A.",""],["De Martino","B.",""],["Decoene","V.",""],["Del Burgo","R.",""],["Di Mauro","L. S.",""],["Di Palma","I.",""],["D\u00edaz","A. F.",""],["Diego-Tortosa","D.",""],["Distefano","C.",""],["Domia","A.",""],["Donzaud","C.",""],["Dornic","D.",""],["D\u00f6rra","M.",""],["Drakopoulou","E.",""],["Drouhin","D.",""],["Dvornick\u00fd","R.",""],["Eberla","T.",""],["Eckerov\\'","E.",""],["Eddymaoui","A.",""],["van Eeden","T.",""],["Effa","M.",""],["van Eijk","D.",""],["Bojaddaini","I. El",""],["Hedri","S. El",""],["Enzenh\u00f6fer","A.",""],["Ferrara","G.",""],["Filipovi\u0107","M. D.",""],["Filippini","F.",""],["Fusco","L. A.",""],["Gabella","O.",""],["Gabriela","J.",""],["Gagliardini","S.",""],["Gala","T.",""],["M\u00e9ndez","J. Garc\u00eda",""],["Soto","A. Garcia",""],["Oliver","C. Gatius",""],["Gei\u00dfelbrecht","N.",""],["Ghaddari","H.",""],["Gialanella","L.",""],["Gibson","B. K.",""],["Giorgio","E.",""],["Girardi","A.",""],["Goos","I.",""],["Goupilliere","D.",""],["Gozzinic","S. R.",""],["Gracia","R.",""],["Graf","K.",""],["Guidia","C.",""],["Guillon","B.",""],["Guti\u00e9rrez","M.",""],["van Haren","H.",""],["Heijboer","A.",""],["Hekalo","A.",""],["Hennig","L.",""],["Hern\u00e1ndez-Rey","J. J.",""],["Huang","F.",""],["Ibnsalih","W. Idrissi",""],["Illuminati","G.",""],["Jamesa","C. W.",""],["Jansweijer","P.",""],["de Jongat","M.",""],["de Jong","P.",""],["Jung","B. J.",""],["Kalaczy\u0144ski","P.",""],["Kalekin","O.",""],["Katz","U. F.",""],["Chowdhury","N. R. Khan",""],["Khatun","A.",""],["Kistauri","G.",""],["Kopper","C.",""],["Kouchner","A.",""],["Kulikovskiy","V.",""],["Kvatadzea","R.",""],["Labalme","M.",""],["Lahmann","R.",""],["Larosa","G.",""],["Lastoria","C.",""],["Lazo","A.",""],["Stum","S. Le",""],["Lehaut","G.",""],["Leonora","E.",""],["Lessing","N.",""],["Levi","G.",""],["Clark","M. Lindsey",""],["Longhitano","F.",""],["Majumdar","J.",""],["Malerba","L.",""],["Mamedov","F.",""],["Ma\u0144czakc","J.",""],["Manfred","A.",""],["Marconi","M.",""],["Margiott","A.",""],["Marinelli","A.",""],["Markou","C.",""],["Martin","L.",""],["Mart\u00ednez-Mora","J. A.",""],["Marzaioli","F.",""],["Mastrodicasa","M.",""],["Mastroianni","S.",""],["Miccich\u00e8","S.",""],["Miele","G.",""],["Migliozzi","P.",""],["Migneco","E.",""],["Minutoli","S.",""],["Mitsou","M. L.",""],["Mollo","C. M.",""],["Morales-Gallegos","L.",""],["Morley-Wonga","C.",""],["Mosbruggera","A.",""],["Moussa","A.",""],["Mateo","I. Mozun",""],["Muller","R.",""],["Musone","M. R.",""],["Musumeci","M.",""],["Nauta","L.",""],["Navas","S.",""],["Nayerhoda","A.",""],["Nicola","C. A.",""],["Nkosi","B.",""],["Fearraigha","B. \u00d3",""],["Oliviero","V.",""],["Orlando","A.",""],["Oukach","E.",""],["Gonz\u00e1lez","J. Palacios",""],["Papalashvilia","G.",""],["Gomez","E. J. Pastor",""],["P\u0103un","A. M.",""],["P\u0103v\u0103la\u015f","G. E.",""],["Mart\u00ednez","S. Pe\u00f1a",""],["Perrin-Terrind","M.",""],["Perronnel","J.",""],["Pestela","V.",""],["Pestes","R.",""],["Piattelli","P.",""],["Poir\u00e8","C.",""],["Popa","V.",""],["Pradier","T.",""],["Pulvirenti","S.",""],["Qu\u00e9m\u00e9ner","G.",""],["Quiroz","C.",""],["Rahaman","U.",""],["Randazzo","N.",""],["Razzaqueb","S.",""],["Rea","I. C.",""],["Real","D.",""],["Reck","S.",""],["Riccobene","G.",""],["Robinson","J.",""],["Romanova","A.",""],["Saina","A.",""],["Greus","F. Salesa",""],["Samtleben","D. F. E.",""],["Losa","A. S\u00e1nchez",""],["Sanguineti","M.",""],["Santonastaso","C.",""],["Santonocito","D.",""],["Sapienza","P.",""],["Scarpetta","Y.",""],["Schnabel","J.",""],["Schneider","M. F.",""],["Schumann","J.",""],["Schutte","H. M.",""],["Seneca","J.",""],["Setter","B.",""],["Sgura","I.",""],["Shanidze","R.",""],["Shitov","Y.",""],["\u0160imkovic","F.",""],["Simonelli","A.",""],["Sinopoulou","A.",""],["Smirnov","M. V.",""],["Spisso","B.",""],["Spurio","M.",""],["Stavropoulos","D.",""],["\u0160tekl","I.",""],["Taiuti","M.",""],["Tayalati","Y.",""],["Tedjditi","H.",""],["Thiersen","H.",""],["Melo","I. Tosta e",""],["Trocme","B.",""],["Tsagkli","S.",""],["Tsourapis","V.",""],["Tzamariudaki","E.",""],["Vacheret","A.",""],["Valsecchi","V.",""],["Vannoye","V. Van Elewyck G.",""],["Vasileiadisa","G.",""],["de Sola","F. Vazquez",""],["Verilhac","C.",""],["Veutro","A.",""],["Viola","S.",""],["Vivolo","D.",""],["Warnhofer","H.",""],["Wilmsb","J.",""],["de Wolf","E.",""],["Yepes-Ramirez","H.",""],["Zarpapis","G.",""],["Zavatarelli","S.",""],["Zegarelli","A.",""],["Zito","D.",""],["Zornoza","J. D.",""],["Z\u00fa\u00f1iga","J.",""],["Zywucka","N.",""]]}
{"id":"2308.01033","submitter":"Progress Zivuku Ms","authors":"Progress Zivuku, Steven Kisseleff, Wallace A. Martins, Hayder\n  Al-hraishawi, Symeon Chatzinotas, and Bj\\\"orn Ottersten","title":"Performance of Joint Symbol Level Precoding and RIS Phase Shift Design\n  in the Finite Block Length Regime with Constellation Rotation","comments":"6 pages,4 figures. This paper has been accepted by IEEE International\n  Symposium on Personal, Indoor and Mobile Radio 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":"  In this paper, we tackle the problem of joint symbol level precoding (SLP)\nand reconfigurable intelligent surface (RIS) phase shift design with\nconstellation rotation in the finite block length regime. We aim to increase\nenergy efficiency by minimizing the total transmit power while satisfying the\nquality of service constraints. The total power consumption can be\nsignificantly minimized through the exploitation of multiuser interference by\nsymbol level precoding and by the intelligent manipulation of the propagation\nenvironment using reconfigurable intelligent surfaces. In addition, the\nconstellation rotation per user contributes to energy efficiency by aligning\nthe symbol phases of the users, thus improving the utilization of constructive\ninterference. The formulated power minimization problem is non-convex and\ncorrespondingly difficult to solve directly. Hence, we employ an alternating\noptimization algorithm to tackle the joint optimization of SLP and RIS phase\nshift design. The optimal phase of each user's constellation rotation is\nobtained via an exhaustive search algorithm. Through Monte-Carlo simulation\nresults, we demonstrate that the proposed solution yields substantial power\nminimization as compared to conventional SLP, zero forcing precoding with RIS\nas well as the benchmark schemes without RIS.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:27:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zivuku","Progress",""],["Kisseleff","Steven",""],["Martins","Wallace A.",""],["Al-hraishawi","Hayder",""],["Chatzinotas","Symeon",""],["Ottersten","Bj\u00f6rn",""]]}
{"id":"2308.01034","submitter":"Tim Roberts","authors":"T. P. Roberts (1), D. J. Walton (2), A. D. A. Mackenzie (1), M. Heida\n  (3), S. Scaringi (1) ((1) Durham-CEA, (2) Hertfordshire, (3) ESO)","title":"Digging a little deeper: characterising three new extreme ULX candidates","comments":"15 pages, 9 figures, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2367","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A prime motivation for compiling catalogues of any celestial X-ray source is\nto increase our numbers of rare sub-classes. In this work we take a recent\nmulti-mission catalogue of ultraluminous X-ray sources (ULXs) and look for\nhitherto poorly-studied ULX candidates that are luminous ($L_{\\rm X} \\geq\n10^{40} \\rm ~erg~s^{-1}$), bright ($f_{\\rm X} \\geq 5 \\times 10^{-13} \\rm\n~erg~cm~s^{-1}$) and have archival XMM-Newton data. We speculate that this\nluminosity regime may be ideal for identifying new pulsating ULXs (PULXs),\ngiven that the majority of known PULXs reach similar high luminosities. We find\nthree sources that match our criteria, and study them using archival data. We\nfind 4XMM J165251.5-591503 to possess a bright and variable Galactic optical/IR\ncounterpart, and so conclude it is very likely to be a foreground interloper.\n4XMM J091948.8-121429 does appear an excellent ULX candidate associated with\nthe dwarf irregular galaxy PGC 26378, but has only one detection to date with\nlow data quality. The best dataset belongs to 4XMM J112054.3+531040 which we\nfind to be a moderately variable, spectrally hard ($\\Gamma \\approx 1.4$) X-ray\nsource located in a spiral arm of NGC 3631. Its spectral hardness is similar to\nknown PULXs, but no pulsations are detected by accelerated pulsation searches\nin the available data. We discuss whether other missions provide objects for\nsimilar studies, and compare this method to others suggested for identifying\ngood PULX candidates.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:28:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Roberts","T. P.","","Durham-CEA"],["Walton","D. J.","","Hertfordshire"],["Mackenzie","A. D. A.","","Durham-CEA"],["Heida","M.","","ESO"],["Scaringi","S.","","Durham-CEA"]]}
{"id":"2308.01035","submitter":"Khadidja Delloul","authors":"Leyla Benhamida and Khadidja Delloul and Slimane Larabi","title":"TS-RGBD Dataset: a Novel Dataset for Theatre Scenes Description for\n  People with Visual Impairments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Computer vision was long a tool used for aiding visually impaired people to\nmove around their environment and avoid obstacles and falls. Solutions are\nlimited to either indoor or outdoor scenes, which limits the kind of places and\nscenes visually disabled people can be in, including entertainment places such\nas theatres. Furthermore, most of the proposed computer-vision-based methods\nrely on RGB benchmarks to train their models resulting in a limited performance\ndue to the absence of the depth modality.\n  In this paper, we propose a novel RGB-D dataset containing theatre scenes\nwith ground truth human actions and dense captions annotations for image\ncaptioning and human action recognition: TS-RGBD dataset. It includes three\ntypes of data: RGB, depth, and skeleton sequences, captured by Microsoft\nKinect.\n  We test image captioning models on our dataset as well as some skeleton-based\nhuman action recognition models in order to extend the range of environment\ntypes where a visually disabled person can be, by detecting human actions and\ntextually describing appearances of regions of interest in theatre scenes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:28:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Benhamida","Leyla",""],["Delloul","Khadidja",""],["Larabi","Slimane",""]]}
{"id":"2308.01036","submitter":"Muskan M","authors":"Muskan, Ramniwas Meena, Subhashish Banerjee","title":"Analysing QBER and secure key rate under various losses for satellite\n  based free space QKD","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum Key Distribution is a key distribution method that uses the qubits to\nsafely distribute one-time use encryption keys between two or more authorised\nparticipants in a way that ensures the identification of any eavesdropper. In\nthis paper, we have done a comparison between the BB84 and B92 protocols and\nBBM92 and E91 entanglement based protocols for satellite based uplink and\ndownlink in low Earth orbit. The expressions for the quantum bit error rate and\nthe keyrate are given for all four protocols. The results indicate that, when\ncompared to the B92 protocol, the BB84 protocol guarantees the distribution of\na higher secure keyrate for a specific distance. Similarly, it is observed that\nBBM92 ensures higher keyrate in comparison with E91 protocol.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:28:50 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Muskan","",""],["Meena","Ramniwas",""],["Banerjee","Subhashish",""]]}
{"id":"2308.01037","submitter":"Nicolas Guidotti","authors":"Nicolas L. Guidotti, Juan A. Acebr\\'on, Jos\\'e Monteiro","title":"A Fast Monte Carlo algorithm for evaluating matrix functions with\n  application in complex networks","comments":"Submitted to the Journal of Scientific Computing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel stochastic algorithm that randomly samples entire rows and\ncolumns of the matrix as a way to approximate an arbitrary matrix function.\nThis contrasts with the \"classical\" Monte Carlo method which only works with\none entry at a time, resulting in a significant better convergence rate than\nthe \"classical\" approach. To assess the applicability of our method, we compute\nthe subgraph centrality and total communicability of several large networks. In\nall benchmarks analyzed so far, the performance of our method was significantly\nsuperior to the competition, being able to scale up to 64 CPU cores with a\nremarkable efficiency.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:29:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Guidotti","Nicolas L.",""],["Acebr\u00f3n","Juan A.",""],["Monteiro","Jos\u00e9",""]]}
{"id":"2308.01038","submitter":"Anca Radulescu","authors":"Jasmin Nunuvero, Angelique Santiago, Moshe Cohen, Anca Radulescu","title":"Modeling the effects of adherence to vaccination and health protocols in\n  epidemic dynamics by means of an SIR model","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Susceptible-Infected-Recovered (SIR) models have been used for decades to\nunderstand epidemic outbreak dynamics. We develop an SIR model specifically\ndesigned to study the effects of population behavior with respect to health and\nvaccination protocols in a generic epidemic. Through a collection of\nparameters, our model includes the traditional SIR components: population\nbirth, death, infection, recovery and vaccination rates, as well as limited\nimmunity.\n  We first use this simple setup to compare the effects of two vaccination\nschemes, one in which people are vaccinated at a rate proportional with the\npopulation, and one in which vaccines are administered to a fraction of the\nsusceptible people (both of which are know strategies in real life epidemics).\nWe then expand on the model and the analysis by investigating how these two\nvaccination schemes hold under two scenarios of population behavior: one in\nwhich people abide by health protocols and work towards diminishing\ntransmission when infection is high; one in which people relax health protocols\nwhen infection is high.\n  We illustrate these two aspects (vaccination and adherence to health\nprotocols) act together to control the epidemic outbreak. While it is ideal\nthat the tow components act jointly, we also show that tight observance of\nhealth protocols may diminish the need for vaccination in the effort to clear\nor mitigate the outbreak. Conversely, an efficient vaccination strategy can\ncompensate for some degree of laxity in people's behavior.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:30:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nunuvero","Jasmin",""],["Santiago","Angelique",""],["Cohen","Moshe",""],["Radulescu","Anca",""]]}
{"id":"2308.01039","submitter":"Christian D\\\"ull","authors":"Henri Schmidt and Christian D\\\"ull","title":"Computing the Distance between unbalanced Distributions -- The flat\n  Metric","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide an implementation to compute the flat metric in any dimension. The\nflat metric, also called dual bounded Lipschitz distance, generalizes the\nwell-known Wasserstein distance W1 to the case that the distributions are of\nunequal total mass. This is of particular interest for unbalanced optimal\ntransport tasks and for the analysis of data distributions where the sample\nsize is important or normalization is not possible. The core of the method is\nbased on a neural network to determine on optimal test function realizing the\ndistance between two given measures. Special focus was put on achieving\ncomparability of pairwise computed distances from independently trained\nnetworks. We tested the quality of the output in several experiments where\nground truth was available as well as with simulated data.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:30:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Schmidt","Henri",""],["D\u00fcll","Christian",""]]}
{"id":"2308.01040","submitter":"Xinfeng Li","authors":"Xinfeng Li, Chen Yan, Xuancun Lu, Zihan Zeng, Xiaoyu Ji, Wenyuan Xu","title":"Inaudible Adversarial Perturbation: Manipulating the Recognition of User\n  Speech in Real Time","comments":"Accepted by NDSS Symposium 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Automatic speech recognition (ASR) systems have been shown to be vulnerable\nto adversarial examples (AEs). Recent success all assumes that users will not\nnotice or disrupt the attack process despite the existence of music/noise-like\nsounds and spontaneous responses from voice assistants. Nonetheless, in\npractical user-present scenarios, user awareness may nullify existing attack\nattempts that launch unexpected sounds or ASR usage. In this paper, we seek to\nbridge the gap in existing research and extend the attack to user-present\nscenarios. We propose VRIFLE, an inaudible adversarial perturbation (IAP)\nattack via ultrasound delivery that can manipulate ASRs as a user speaks. The\ninherent differences between audible sounds and ultrasounds make IAP delivery\nface unprecedented challenges such as distortion, noise, and instability. In\nthis regard, we design a novel ultrasonic transformation model to enhance the\ncrafted perturbation to be physically effective and even survive long-distance\ndelivery. We further enable VRIFLE's robustness by adopting a series of\naugmentation on user and real-world variations during the generation process.\nIn this way, VRIFLE features an effective real-time manipulation of the ASR\noutput from different distances and under any speech of users, with an\nalter-and-mute strategy that suppresses the impact of user disruption. Our\nextensive experiments in both digital and physical worlds verify VRIFLE's\neffectiveness under various configurations, robustness against six kinds of\ndefenses, and universality in a targeted manner. We also show that VRIFLE can\nbe delivered with a portable attack device and even everyday-life loudspeakers.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:32:17 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 04:32:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Xinfeng",""],["Yan","Chen",""],["Lu","Xuancun",""],["Zeng","Zihan",""],["Ji","Xiaoyu",""],["Xu","Wenyuan",""]]}
{"id":"2308.01041","submitter":"Noemi David","authors":"Noemi David (MMCS, ICJ), Filippo Santambrogio (MMCS, ICJ)","title":"New Lipschitz estimates and long-time asymptotic behavior for porous\n  medium and fast diffusion equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain new estimates for the solution of both the porous medium and the\nfast diffusion equations by studying the evolution of suitable Lipschitz norms.\nOur results include instantaneous regularization for all positive times,\nlong-time decay rates of the norms which are sharp and independent of the\ninitial support, and new convergence results to the Barenblatt profile.\nMoreover, we address nonlinear diffusion equations including quadratic or\nbounded potentials as well. In the slow diffusion case, our strategy requires\nexponents close enough to 1, while in the fast diffusion case, our results\ncover any exponent for which the problem is well-posed and mass-preserving in\nthe whole space.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:34:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["David","Noemi","","MMCS, ICJ"],["Santambrogio","Filippo","","MMCS, ICJ"]]}
{"id":"2308.01042","submitter":"Xingjian Wang","authors":"Xingjian Wang, Li Chai, Jiming Chen, Zhiguo Shi","title":"WCCNet: Wavelet-integrated CNN with Crossmodal Rearranging Fusion for\n  Fast Multispectral Pedestrian Detection","comments":"Submitted to TPAMI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multispectral pedestrian detection achieves better visibility in challenging\nconditions and thus has a broad application in various tasks, for which both\nthe accuracy and computational cost are of paramount importance. Most existing\napproaches treat RGB and infrared modalities equally, typically adopting two\nsymmetrical CNN backbones for multimodal feature extraction, which ignores the\nsubstantial differences between modalities and brings great difficulty for the\nreduction of the computational cost as well as effective crossmodal fusion. In\nthis work, we propose a novel and efficient framework named WCCNet that is able\nto differentially extract rich features of different spectra with lower\ncomputational complexity and semantically rearranges these features for\neffective crossmodal fusion. Specifically, the discrete wavelet transform (DWT)\nallowing fast inference and training speed is embedded to construct a\ndual-stream backbone for efficient feature extraction. The DWT layers of WCCNet\nextract frequency components for infrared modality, while the CNN layers\nextract spatial-domain features for RGB modality. This methodology not only\nsignificantly reduces the computational complexity, but also improves the\nextraction of infrared features to facilitate the subsequent crossmodal fusion.\nBased on the well extracted features, we elaborately design the crossmodal\nrearranging fusion module (CMRF), which can mitigate spatial misalignment and\nmerge semantically complementary features of spatially-related local regions to\namplify the crossmodal complementary information. We conduct comprehensive\nevaluations on KAIST and FLIR benchmarks, in which WCCNet outperforms\nstate-of-the-art methods with considerable computational efficiency and\ncompetitive accuracy. We also perform the ablation study and analyze thoroughly\nthe impact of different components on the performance of WCCNet.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:35:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Xingjian",""],["Chai","Li",""],["Chen","Jiming",""],["Shi","Zhiguo",""]]}
{"id":"2308.01043","submitter":"Yan-Feng Wang","authors":"Shao-Cong Zhang, Hong-Tao Zhou, Xiao-Tong Gong, Yan-Feng Wang,\n  Yue-Sheng Wang","title":"Discrete metasurface for extreme sound transmission through water-air\n  interface","comments":"18pages, 10figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The mismatch of acoustic impedance at water-air interface can lead a low\ntransmitted sound energy. In this paper, we propose a discrete metasurface for\nextreme sound transmission based on the impedance matching theory. By employing\ntopology optimization, discrete unit cells with different aspect ratios are\ndesigned with unitary sound transmission. The unit cell of continuous\nmetasurface is also obtained for comparison. After analyzing the wide-angle\nperformance of discrete unit cells, samples of both discrete and continuous\nmetasurfaces are fabricated. Sound transmission enhancement of discrete\nmetasurface is clearly measured compared to the bare water-air interface. And\nthe amplitude is relatively larger than that of the continuous sample.\nExperimental results are in general agreement with numerical ones when\nviscosity of the sample is considered. Furthermore, the frequency shifts\nbetween experiment and simulation are attributed to the random immersion of\nunit cells for discrete metasurface and the bending of continuous metasurface,\nrespectively. The present work suggests an alternative way for improving the\nefficiency of water-air acoustic communication.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:35:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Shao-Cong",""],["Zhou","Hong-Tao",""],["Gong","Xiao-Tong",""],["Wang","Yan-Feng",""],["Wang","Yue-Sheng",""]]}
{"id":"2308.01044","submitter":"Yunmeng Li","authors":"Yunmeng Li, Jun Suzuki, Makoto Morishita, Kaori Abe, Ryoko Tokuhisa,\n  Ana Brassard, Kentaro Inui","title":"Chat Translation Error Detection for Assisting Cross-lingual\n  Communications","comments":null,"journal-ref":"Proceedings of the 3rd Workshop on Evaluation and Comparison of\n  NLP Systems, pages 88-95, November 2022, Online. Association for\n  Computational Linguistics","doi":"10.18653/v1/2022.eval4nlp-1.9","report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we describe the development of a communication support system\nthat detects erroneous translations to facilitate crosslingual communications\ndue to the limitations of current machine chat translation methods. We trained\nan error detector as the baseline of the system and constructed a new\nJapanese-English bilingual chat corpus, BPersona-chat, which comprises\nmultiturn colloquial chats augmented with crowdsourced quality ratings. The\nerror detector can serve as an encouraging foundation for more advanced\nerroneous translation detection systems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:38:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Yunmeng",""],["Suzuki","Jun",""],["Morishita","Makoto",""],["Abe","Kaori",""],["Tokuhisa","Ryoko",""],["Brassard","Ana",""],["Inui","Kentaro",""]]}
{"id":"2308.01045","submitter":"Bowen Zhang","authors":"Quan Tang, Bowen Zhang, Jiajun Liu, Fagiu Liu, Yifan Liu","title":"Dynamic Token Pruning in Plain Vision Transformers for Semantic\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Vision transformers have achieved leading performance on various visual tasks\nyet still suffer from high computational complexity. The situation deteriorates\nin dense prediction tasks like semantic segmentation, as high-resolution inputs\nand outputs usually imply more tokens involved in computations. Directly\nremoving the less attentive tokens has been discussed for the image\nclassification task but can not be extended to semantic segmentation since a\ndense prediction is required for every patch. To this end, this work introduces\na Dynamic Token Pruning (DToP) method based on the early exit of tokens for\nsemantic segmentation. Motivated by the coarse-to-fine segmentation process by\nhumans, we naturally split the widely adopted auxiliary-loss-based network\narchitecture into several stages, where each auxiliary block grades every\ntoken's difficulty level. We can finalize the prediction of easy tokens in\nadvance without completing the entire forward pass. Moreover, we keep $k$\nhighest confidence tokens for each semantic category to uphold the\nrepresentative context information. Thus, computational complexity will change\nwith the difficulty of the input, akin to the way humans do segmentation.\nExperiments suggest that the proposed DToP architecture reduces on average\n$20\\% - 35\\%$ of computational cost for current semantic segmentation methods\nbased on plain vision transformers without accuracy degradation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:40:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tang","Quan",""],["Zhang","Bowen",""],["Liu","Jiajun",""],["Liu","Fagiu",""],["Liu","Yifan",""]]}
{"id":"2308.01046","submitter":"Haide Wang","authors":"Ji Zhou, Zhenping Xing, Haide Wang, Kuo Zhang, Xi Chen, Qiguang Feng,\n  Keshuang Zheng, Yijia Zhao, Zhen Dong, Tao Gui, Zhicheng Ye, and Liangchuan\n  Li","title":"Flexible Coherent Optical Access: Architectures, Algorithms, and\n  Demonstrations","comments":"The paper has been submitted to the Journal of Lightwave Technology","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To cope with the explosive bandwidth demand, significant progress has been\nmade in the ITU-T standardization sector to define a higher-speed passive\noptical network (PON) with a 50Gb/s line rate. Recently, 50G PON becomes mature\ngradually, which means it is time to discuss beyond 50G PON. For ensuring an\nacceptable optical power budget, beyond 50G PON will potentially use coherent\ntechnologies, which can simultaneously promote the applications of flexible\nmultiple access such as time/frequency-domain multiple access (TFDMA). In this\npaper, we will introduce the architectures, algorithms, and demonstrations for\nTFDMA-based coherent PON. The system architectures based on an ultra-simple\ncoherent transceiver and specific signal spectra are designed to greatly reduce\nthe cost of ONUs. Meanwhile, fast and low-complexity digital signal processing\n(DSP) algorithms are proposed for dealing with upstream and downstream signals.\nBased on the architectures and algorithms, we experimentally demonstrate the\nfirst real-time TFDMA-based coherent PON, which can support at most 256 end\nusers, and peak line rates of 100Gb/s and 200Gb/s in the upstream and\ndownstream scenarios, respectively. In conclusion, the proposed technologies\nfor the coherent PON make it more possible to be applied in the future beyond\n50G PON.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:41:14 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhou","Ji",""],["Xing","Zhenping",""],["Wang","Haide",""],["Zhang","Kuo",""],["Chen","Xi",""],["Feng","Qiguang",""],["Zheng","Keshuang",""],["Zhao","Yijia",""],["Dong","Zhen",""],["Gui","Tao",""],["Ye","Zhicheng",""],["Li","Liangchuan",""]]}
{"id":"2308.01047","submitter":"Massimiliano Lincetto","authors":"Massimiliano Lincetto (for the IceCube Collaboration)","title":"Searching for high-energy neutrinos from shock-interaction powered\n  supernovae with the IceCube Neutrino Observatory","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions. 8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1105","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The sources of the astrophysical neutrino flux discovered by IceCube are for\nthe most part unresolved. Extragalactic core-collapse supernovae (CCSNe) have\nbeen suggested as candidate multi-messenger sources. In interaction-powered\nsupernovae, a shock propagates in a dense circumstellar medium (CSM), producing\na bright optical emission and potentially accelerating particles to\nrelativistic energies. Shock interaction is believed to be the main energy\nsource for Type IIn supernovae (identified by narrow lines in the spectrum),\nhydrogen-rich superluminous supernovae and a subset of hydrogen-poor\nsuperluminous supernovae. Production of high-energy neutrinos is expected in\ncollisions between the accelerated protons in the shocks and the cold CSM\nparticles. We select a catalog of interaction-powered supernovae from the\nBright Transient Survey of the Zwicky Transient Facility. We exploit a novel\nmodeling effort that connects the time evolution of the optical emission to the\nproperties of the ejecta and the CSM, allowing us to set predictions of the\nneutrino flux for each source. In this contribution, we describe a stacking\nsearch for high-energy neutrinos from this population of CCSNe with the IceCube\nNeutrino Observatory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:42:04 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lincetto","Massimiliano","","for the IceCube Collaboration"]]}
{"id":"2308.01048","submitter":"Arieh Zimmerman","authors":"Arieh Zimmerman","title":"Geometric Conditions for Twisted O-Sphericity","comments":"Abridged Master's Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The geometric condition defining a spherical variety for a reductive\nalgebraic group was generalized in [AG21], with applications to representation\ntheory. We twist by a character to generalize this definition, and show its\nequivalence to a property of group actions that generalizes Theorem B of\n[AG21]. We also present an example to demonstrate the necessity of this\ngeneralization.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:44:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zimmerman","Arieh",""]]}
{"id":"2308.01049","submitter":"Matthias K\\\"ohne","authors":"Christian Gesse, Matthias K\\\"ohne, J\\\"urgen Saal","title":"Stability Analysis for a Class of Heterogeneous Catalysis Models","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove stability for a class of heterogeneous catalysis models in the\n$L_p$-setting. We consider a setting in a finite three-dimensional pore of\ncylinder-like geometry, with the lateral walls acting as a catalytic surface.\nUnder a reasonable condition on the involved parameters, we show that given\nequilibria are normally stable, i.e. solutions are attracted at an exponential\nrate. The potential incidence of instability is discussed as well.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:47:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gesse","Christian",""],["K\u00f6hne","Matthias",""],["Saal","J\u00fcrgen",""]]}
{"id":"2308.01050","submitter":"Alessandro Zanardi","authors":"Alessandro Zanardi, Andrea Censi, Margherita Atzei, Luigi Di Lillo,\n  Emilio Frazzoli","title":"A Counterfactual Safety Margin Perspective on the Scoring of Autonomous\n  Vehicles' Riskiness","comments":"updated affiliations","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":"  Autonomous Vehicles (AVs) have the potential to provide numerous societal\nbenefits, such as decreased road accidents and increased overall transportation\nefficiency. However, quantifying the risk associated with AVs is challenging\ndue to the lack of historical data and the rapidly evolving technology. This\npaper presents a data-driven framework for comparing the risk of different AVs'\nbehaviors in various operational design domains (ODDs), based on counterfactual\nsimulations of \"misbehaving\" road users. We introduce the concept of\ncounterfactual safety margin, which represents the minimum deviation from\nnormal behavior that could lead to a collision. This concept helps to find the\nmost critical scenarios but also to assess the frequency and severity of risk\nof AVs. We show that the proposed methodology is applicable even when the AV's\nbehavioral policy is unknown -- through worst- and best-case analyses -- making\nthe method useful also to external third-party risk assessors. Our experimental\nresults demonstrate the correlation between the safety margin, the driving\npolicy quality, and the ODD shedding light on the relative risk associated with\ndifferent AV providers. This work contributes to AV safety assessment and aids\nin addressing legislative and insurance concerns surrounding this emerging\ntechnology.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:48:08 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 12:57:04 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 05:47:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zanardi","Alessandro",""],["Censi","Andrea",""],["Atzei","Margherita",""],["Di Lillo","Luigi",""],["Frazzoli","Emilio",""]]}
{"id":"2308.01051","submitter":"Jobst Ziebell","authors":"Jobst Ziebell","title":"$\\theta$-splitting Densities and Reflection Positivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A simple condition is given that is sufficient to determine whether a measure\nthat is absolutely continuous with respect to a Gau{\\ss}ian measure on the\nspace of distributions is reflection positive. It readily generalises\nconventional lattice results to an abstract setting, enabling the construction\nof many reflection positive measures that are not supported on lattices.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:48:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ziebell","Jobst",""]]}
{"id":"2308.01052","submitter":"Thomas Metzger","authors":"Thomas W.J. Metzger, Kirill A. Grishunin, Chris Reinhoffer, Roman M.\n  Dubrovin, Atiqa Arshad, Igor Ilyakov, Thales V.A.G. de Oliveira, Alexey\n  Ponomaryov, Jan-Christoph Deinert, Sergey Kovalev, Roman V. Pisarev, Mikhail\n  I. Katsnelson, Boris A. Ivanov, Paul H. M. van Loosdrecht, Alexey V. Kimel\n  and Evgeny A. Mashkovich","title":"Impulsive Fermi magnon-phonon resonance in antiferromagnetic $CoF_{2}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding spin-lattice interactions in antiferromagnets is one of the\nmost fundamental issues at the core of the recently emerging and booming fields\nof antiferromagnetic spintronics and magnonics. Recently, coherent nonlinear\nspin-lattice coupling was discovered in an antiferromagnet which opened the\npossibility to control the nonlinear coupling strength and thus showing a novel\npathway to coherently control magnon-phonon dynamics. Here, utilizing intense\nnarrow band terahertz (THz) pulses and tunable magnetic fields up to 7 T, we\nexperimentally realize the conditions of the Fermi magnon-phonon resonance in\nantiferromagnetic $CoF_{2}$. These conditions imply that both the spin and the\nlattice anharmonicities harvest energy transfer between the subsystems, if the\nmagnon eigenfrequency $f_{m}$ is twice lower than the frequency of the phonon\n$2f_{m}=f_{ph}$. Performing THz pump-infrared probe spectroscopy in conjunction\nwith simulations, we explore the coupled magnon-phonon dynamics in the vicinity\nof the Fermi-resonance and reveal the corresponding fingerprints of an\nimpulsive THz-induced response. This study focuses on the role of nonlinearity\nin spin-lattice interactions, providing insights into the control of coherent\nmagnon-phonon energy exchange.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:50:06 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Metzger","Thomas W. J.",""],["Grishunin","Kirill A.",""],["Reinhoffer","Chris",""],["Dubrovin","Roman M.",""],["Arshad","Atiqa",""],["Ilyakov","Igor",""],["de Oliveira","Thales V. A. G.",""],["Ponomaryov","Alexey",""],["Deinert","Jan-Christoph",""],["Kovalev","Sergey",""],["Pisarev","Roman V.",""],["Katsnelson","Mikhail I.",""],["Ivanov","Boris A.",""],["van Loosdrecht","Paul H. M.",""],["Kimel","Alexey V.",""],["Mashkovich","Evgeny A.",""]]}
{"id":"2308.01053","submitter":"Peijun Zhang","authors":"Peijun Zhang, Chuanzeng Zhang, Yan Gu, Wenzhen Qu, Shengdong Zhao","title":"Boundary integrated neural networks (BINNs) for 2D elastostatic and\n  piezoelectric problems: Theory and MATLAB code","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we make the first attempt to apply the boundary integrated\nneural networks (BINNs) for the numerical solution of two-dimensional (2D)\nelastostatic and piezoelectric problems. BINNs combine artificial neural\nnetworks with the well-established boundary integral equations (BIEs) to\neffectively solve partial differential equations (PDEs). The BIEs are utilized\nto map all the unknowns onto the boundary, after which these unknowns are\napproximated using artificial neural networks and resolved via a training\nprocess. In contrast to traditional neural network-based methods, the current\nBINNs offer several distinct advantages. First, by embedding BIEs into the\nlearning procedure, BINNs only need to discretize the boundary of the solution\ndomain, which can lead to a faster and more stable learning process (only the\nboundary conditions need to be fitted during the training). Second, the\ndifferential operator with respect to the PDEs is substituted by an integral\noperator, which effectively eliminates the need for additional differentiation\nof the neural networks (high-order derivatives of neural networks may lead to\ninstability in learning). Third, the loss function of the BINNs only contains\nthe residuals of the BIEs, as all the boundary conditions have been inherently\nincorporated within the formulation. Therefore, there is no necessity for\nemploying any weighing functions, which are commonly used in traditional\nmethods to balance the gradients among different objective functions. Moreover,\nBINNs possess the ability to tackle PDEs in unbounded domains since the\nintegral representation remains valid for both bounded and unbounded domains.\nExtensive numerical experiments show that BINNs are much easier to train and\nusually give more accurate learning solutions as compared to traditional neural\nnetwork-based methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:57:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Peijun",""],["Zhang","Chuanzeng",""],["Gu","Yan",""],["Qu","Wenzhen",""],["Zhao","Shengdong",""]]}
{"id":"2308.01054","submitter":"Simon Dirmeier","authors":"Simon Dirmeier, Carlo Albert, Fernando Perez-Cruz","title":"Simulation-based inference using surjective sequential neural likelihood\n  estimation","comments":null,"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":"  We present Surjective Sequential Neural Likelihood (SSNL) estimation, a novel\nmethod for simulation-based inference in models where the evaluation of the\nlikelihood function is not tractable and only a simulator that can generate\nsynthetic data is available. SSNL fits a dimensionality-reducing surjective\nnormalizing flow model and uses it as a surrogate likelihood function which\nallows for conventional Bayesian inference using either Markov chain Monte\nCarlo methods or variational inference. By embedding the data in a\nlow-dimensional space, SSNL solves several issues previous likelihood-based\nmethods had when applied to high-dimensional data sets that, for instance,\ncontain non-informative data dimensions or lie along a lower-dimensional\nmanifold. We evaluate SSNL on a wide variety of experiments and show that it\ngenerally outperforms contemporary methods used in simulation-based inference,\nfor instance, on a challenging real-world example from astrophysics which\nmodels the magnetic field strength of the sun using a solar dynamo model.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:02:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dirmeier","Simon",""],["Albert","Carlo",""],["Perez-Cruz","Fernando",""]]}
{"id":"2308.01055","submitter":"Phuoc-Truong Huynh","authors":"Phuoc-Truong Huynh, Konstantin Pieper and Daniel Walter","title":"Towards optimal sensor placement for inverse problems in spaces of\n  measures","comments":"31 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies the identification of a linear combination of point\nsources from a finite number of measurements. Since the data are typically\ncontaminated by Gaussian noise, a statistical framework for its recovery is\nconsidered. It relies on two main ingredients, first, a convex but non-smooth\nTikhonov point estimator over the space of Radon measures and, second, a\nsuitable mean-squared error based on its Hellinger-Kantorovich distance to the\nground truth. Assuming standard non-degenerate source conditions as well as\napplying careful linearization arguments, a computable upper bound on the\nlatter is derived. On the one hand, this allows to derive asymptotic\nconvergence results for the mean-squared error of the estimator in the small\nsmall variance case. On the other, it paves the way for applying optimal sensor\nplacement approaches to sparse inverse problems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:05:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Huynh","Phuoc-Truong",""],["Pieper","Konstantin",""],["Walter","Daniel",""]]}
{"id":"2308.01056","submitter":"Martina Muratore","authors":"Martina Muratore, Jonathan Gair, Lorenzo Speri","title":"Impact of the noise knowledge uncertainty for the science exploitation\n  of cosmological and astrophysical stochastic gravitational wave background\n  with LISA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the impact of a lack of knowledge of the instrumental\nnoise on the characterisation of stochastic gravitational wave backgrounds with\nthe Laser Interferometer Space Antenna (LISA). We focus on constraints on\nmodelled backgrounds that represent the possible backgrounds from the mergers\nof binary black holes of stellar origin, from primordial black hole generation,\nfrom non-standard inflation, and from sound wave production during cosmic fluid\nphase transitions. We use splines to model generic, slowly varying,\nuncertainties in the auto and cross-spectral densities of the LISA time delay\ninterferometry channels. We find that allowing for noise knowledge uncertainty\nin this way leads to one to two orders of magnitude degradation in our ability\nto constrain stochastic backgrounds, and a corresponding increase in the\nbackground energy density required for a confident detection. We also find that\nto avoid this degradation, the LISA noise would have to be known at the\nsub-percent level, which is unlikely to be achievable in practice.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:07:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Muratore","Martina",""],["Gair","Jonathan",""],["Speri","Lorenzo",""]]}
{"id":"2308.01057","submitter":"Yijun Yang","authors":"Yijun Yang, Shujun Wang, Lihao Liu, Sarah Hickman, Fiona J Gilbert,\n  Carola-Bibiane Sch\\\"onlieb, Angelica I. Aviles-Rivero","title":"MammoDG: Generalisable Deep Learning Breaks the Limits of Cross-Domain\n  Multi-Center Breast Cancer Screening","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Breast cancer is a major cause of cancer death among women, emphasising the\nimportance of early detection for improved treatment outcomes and quality of\nlife. Mammography, the primary diagnostic imaging test, poses challenges due to\nthe high variability and patterns in mammograms. Double reading of mammograms\nis recommended in many screening programs to improve diagnostic accuracy but\nincreases radiologists' workload. Researchers explore Machine Learning models\nto support expert decision-making. Stand-alone models have shown comparable or\nsuperior performance to radiologists, but some studies note decreased\nsensitivity with multiple datasets, indicating the need for high generalisation\nand robustness models. This work devises MammoDG, a novel deep-learning\nframework for generalisable and reliable analysis of cross-domain multi-center\nmammography data. MammoDG leverages multi-view mammograms and a novel\ncontrastive mechanism to enhance generalisation capabilities. Extensive\nvalidation demonstrates MammoDG's superiority, highlighting the critical\nimportance of domain generalisation for trustworthy mammography analysis in\nimaging protocol variations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:10:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Yijun",""],["Wang","Shujun",""],["Liu","Lihao",""],["Hickman","Sarah",""],["Gilbert","Fiona J",""],["Sch\u00f6nlieb","Carola-Bibiane",""],["Aviles-Rivero","Angelica I.",""]]}
{"id":"2308.01058","submitter":"Alberto Pretto","authors":"Ivano Donadi, Emilio Olivastri, Daniel Fusaro, Wanmeng Li, Daniele\n  Evangelista, and Alberto Pretto","title":"Improving Generalization of Synthetically Trained Sonar Image\n  Descriptors for Underwater Place Recognition","comments":"This paper has been accepted for publication at the 14th\n  International Conference on Computer Vision Systems (ICVS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous navigation in underwater environments presents challenges due to\nfactors such as light absorption and water turbidity, limiting the\neffectiveness of optical sensors. Sonar systems are commonly used for\nperception in underwater operations as they are unaffected by these\nlimitations. Traditional computer vision algorithms are less effective when\napplied to sonar-generated acoustic images, while convolutional neural networks\n(CNNs) typically require large amounts of labeled training data that are often\nunavailable or difficult to acquire. To this end, we propose a novel compact\ndeep sonar descriptor pipeline that can generalize to real scenarios while\nbeing trained exclusively on synthetic data. Our architecture is based on a\nResNet18 back-end and a properly parameterized random Gaussian projection\nlayer, whereas input sonar data is enhanced with standard ad-hoc\nnormalization/prefiltering techniques. A customized synthetic data generation\nprocedure is also presented. The proposed method has been evaluated extensively\nusing both synthetic and publicly available real data, demonstrating its\neffectiveness compared to state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:10:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Donadi","Ivano",""],["Olivastri","Emilio",""],["Fusaro","Daniel",""],["Li","Wanmeng",""],["Evangelista","Daniele",""],["Pretto","Alberto",""]]}
{"id":"2308.01059","submitter":"Giorgio Negrini","authors":"G. Negrini, N. Parolini, M. Verani","title":"The Rhie-Chow stabilized Box Method for the Stokes problem","comments":"27 pages, 6 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Finite Volume method (FVM) is widely adopted in many different\napplications because of its built-in conservation properties, its ability to\ndeal with arbitrary mesh and its computational efficiency. In this work, we\nconsider the Rhie-Chow stabilized Box Method (RCBM) for the approximation of\nthe Stokes problem. The Box Method (BM) is a piecewise linear Petrov-Galerkin\nformulation on the Voronoi dual mesh of a Delaunay triangulation, whereas the\nRhie-Chow (RC) stabilization is a well known stabilization technique for FVM.\nThe first part of the paper provides a variational formulation of the RC\nstabilization and discusses the validity of crucial properties relevant for the\nwell-posedeness and convergence of RCBM. Moreover, a numerical exploration of\nthe convergence properties of the method on 2D and 3D test cases is presented.\nThe last part of the paper considers the theoretically justification of the\nwell-posedeness of RCBM and the experimentally observed convergence rates. This\nlatter justification hinges upon suitable assumptions, whose validity is\nnumerically explored.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:10:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Negrini","G.",""],["Parolini","N.",""],["Verani","M.",""]]}
{"id":"2308.01060","submitter":"Robert Dennison","authors":"Robert Dennison and Steve Maddock","title":"Using The Polynomial Particle-In-Cell Method For Liquid-Fabric\n  Interaction","comments":"10 pages, 8 Figures, 2 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Liquid-fabric interaction simulations using particle-in-cell (PIC) based\nmodels have been used to simulate a wide variety of phenomena and yield\nimpressive visual results. However, these models suffer from numerical damping\ndue to the data interpolation between the particles and grid. Our paper\naddresses this by using the polynomial PIC (PolyPIC) model instead of the\naffine PIC (APIC) model that is used in current state-of-the-art wet cloth\nmodels. The affine transfers of the APIC model are replaced by the higher order\npolynomials of PolyPIC, thus reducing numerical dissipation and improving\nresolution of vorticial details. This improved energy preservation enables more\ndynamic simulations to be generated although this is at an increased\ncomputational cost.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:14:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dennison","Robert",""],["Maddock","Steve",""]]}
{"id":"2308.01061","submitter":"Nicola Paradiso","authors":"Simon Reinhardt, Tim Ascherl, Andreas Costa, Johanna Berger, Sergei\n  Gronin, Geoffrey C. Gardner, Tyler Lindemann, Michael J. Manfra, Jaroslav\n  Fabian, Denis Kochan, Christoph Strunk, and Nicola Paradiso","title":"Link between supercurrent diode and anomalous Josephson effect revealed\n  by gate-controlled interferometry","comments":"15 pages, 8 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":"  In Josephson diodes the asymmetry between positive and negative current\nbranch of the current-phase relation leads to a polarity-dependent critical\ncurrent and Josephson inductance. The supercurrent nonreciprocity can be\ndescribed as a consequence of the anomalous Josephson effect -- a\n$\\varphi_0$-shift of the current-phase relation -- in multichannel ballistic\njunctions with strong spin-orbit interaction. In this work, we simultaneously\ninvestigate $\\varphi_0$-shift and supercurrent diode efficiency on the same\nJosephson junction by means of a superconducting quantum interferometer. By\nelectrostatic gating, we reveal a direct link between $\\varphi_0$-shift and\ndiode effect. Our findings show that the supercurrent diode effect mainly\nresults from magnetochiral anisotropy induced by spin-orbit interaction in\ncombination with a Zeeman field.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:15:42 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Reinhardt","Simon",""],["Ascherl","Tim",""],["Costa","Andreas",""],["Berger","Johanna",""],["Gronin","Sergei",""],["Gardner","Geoffrey C.",""],["Lindemann","Tyler",""],["Manfra","Michael J.",""],["Fabian","Jaroslav",""],["Kochan","Denis",""],["Strunk","Christoph",""],["Paradiso","Nicola",""]]}
{"id":"2308.01062","submitter":"Eloi Martinez-Rabert","authors":"Eloi Martinez-Rabert","title":"Multivariate generalization of Kendall's Tau (Tau-N) using paired\n  orthants","comments":"PDF format. 15 pages with 2 Figures and 4 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multivariate correlation analysis plays an important role in various fields\nsuch as statistics and big data analytics. In this paper, it is presented a new\nnon-parametric measure of rank correlation between more than two variables from\nthe multivariate generalization of the Kendall's Tau coefficient (Tau-N). This\nmultivariate correlation analysis not only evaluates the inter-relatedness of\nmultiple variables, but also determine the specific tendency of the tested data\nset. Additionally, it is discussed how the discordant concept would have some\nlimitations when applied to more than two variables, for which reason this\nmethodology has been developed based on the new concept paired orthants. In\norder to test the proposed methodology, different N-tuple sets (from two to six\nvariables) have been evaluated.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:21:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Martinez-Rabert","Eloi",""]]}
{"id":"2308.01063","submitter":"Xing Ai","authors":"Xing Ai, Jialong Zhou, Yulin Zhu, Gaolei Li, Tomasz P. Michalak, Xiapu\n  Luo, Kai Zhou","title":"Graph Anomaly Detection at Group Level: A Topology Pattern Enhanced\n  Unsupervised Approach","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 (GAD) has achieved success and has been widely\napplied in various domains, such as fraud detection, cybersecurity, finance\nsecurity, and biochemistry. However, existing graph anomaly detection\nalgorithms focus on distinguishing individual entities (nodes or graphs) and\noverlook the possibility of anomalous groups within the graph. To address this\nlimitation, this paper introduces a novel unsupervised framework for a new task\ncalled Group-level Graph Anomaly Detection (Gr-GAD). The proposed framework\nfirst employs a variant of Graph AutoEncoder (GAE) to locate anchor nodes that\nbelong to potential anomaly groups by capturing long-range inconsistencies.\nSubsequently, group sampling is employed to sample candidate groups, which are\nthen fed into the proposed Topology Pattern-based Graph Contrastive Learning\n(TPGCL) method. TPGCL utilizes the topology patterns of groups as clues to\ngenerate embeddings for each candidate group and thus distinct anomaly groups.\nThe experimental results on both real-world and synthetic datasets demonstrate\nthat the proposed framework shows superior performance in identifying and\nlocalizing anomaly groups, highlighting it as a promising solution for Gr-GAD.\nDatasets and codes of the proposed framework are at the github repository\nhttps://anonymous.4open.science/r/Topology-Pattern-Enhanced-Unsupervised-Group-level-Graph-Anomaly-Detection.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:22:04 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ai","Xing",""],["Zhou","Jialong",""],["Zhu","Yulin",""],["Li","Gaolei",""],["Michalak","Tomasz P.",""],["Luo","Xiapu",""],["Zhou","Kai",""]]}
{"id":"2308.01064","submitter":"Khaled Qazaqzeh Dr","authors":"Khaled Qazaqzeh, Ahmad Al-Rhayyel, and Nafaa Chbili","title":"On the Jones polynomial of quasi-alternating links, II","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend a result of Thistlethwaite [17, Theorem 1(iv)] on the structure of\nthe Jones polynomial of alternating links to the wider class of\nquasi-alternating links. In particular, we prove that the Jones polynomial of\nany prime quasi-alternating link that is not a $(2,n)$-torus link has no gap.\nAs an application, we show that the differential grading of the Khovanov\nhomology of any prime quasi-alternating link that is not a $(2,n)$-torus link\nhas no gap. Also, we show that the determinant is an upper bound for the\nbreadth of the Jones polynomial for any quasi-alternating link. Finally, we\nprove that the Jones polynomial of any non-prime quasi-alternating link $L$ has\nmore than one gap if and only if $L$ is a connected sum of Hopf links.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:23:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Qazaqzeh","Khaled",""],["Al-Rhayyel","Ahmad",""],["Chbili","Nafaa",""]]}
{"id":"2308.01065","submitter":"Christopher Scherb","authors":"Maximilian Rosenberg, Bettina Schneider, Christopher Scherb, Petra\n  Maria Asprion","title":"An Adaptable Approach for Successful SIEM Adoption in Companies","comments":"Submitted to the AC2023 Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In corporations around the world, the topic of cybersecurity and information\nsecurity is becoming increasingly important as the number of cyberattacks on\nthemselves continues to grow. Nowadays, it is no longer just a matter of\nprotecting against cyberattacks, but rather of detecting such attacks at an\nearly stage and responding accordingly. There is currently no generic\nmethodological approach for the implementation of Security Information and\nEvent Management (SIEM) systems that takes academic aspects into account and\ncan be applied independently of the product or developers of the systems.\nApplying Hevner's design science research approach, the goal of this paper is\nto develop a holistic procedure model for implementing respective SIEM systems\nin corporations. According to the study during the validation phase, the\nprocedure model was verified to be applicable. As desire for future research,\nthe procedure model should be applied in various implementation projects in\ndifferent enterprises to analyze its applicability and completeness.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:28:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rosenberg","Maximilian",""],["Schneider","Bettina",""],["Scherb","Christopher",""],["Asprion","Petra Maria",""]]}
{"id":"2308.01066","submitter":"Guido Agapito","authors":"Guido Agapito, Enrico Pinna, Simone Esposito, Cedric Ta\\\"issir\n  Heritier, Sylvain Oberti","title":"Non-modulated pyramid wavefront sensor: Use in sensing and correcting\n  atmospheric turbulence","comments":"12 pages with 18 figures; accepted for publication in A&A","journal-ref":null,"doi":"10.1051/0004-6361/202346359","report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. The diffusion of adaptive optics systems in astronomical\ninstrumentation for large ground-based telescopes is rapidly increasing and the\npyramid wavefront sensor is replacing the Shack-Hartmann as the standard\nsolution for single conjugate adaptive optics systems. The pyramid wavefront\nsensor is typically used with a tip-tilt modulation to increase the linearity\nrange of the sensor, but the non-modulated case is interesting because it\nmaximizes the sensor sensitivity. The latter case is generally avoided for the\nreduced linearity range that prevents robust operation in the presence of\natmospheric turbulence.\n  Aims. We aim to solve part of the issues of the non-modulated pyramid\nwavefront sensor by reducing the model error in the interaction matrix. We\nlinearize the sensor response in the working conditions without extending the\nsensor linearity range.\n  Methods. We developed a new calibration approach to model the response of\npyramid wave front sensor in partial correction, whereby the working conditions\nin the presence of residual turbulence are considered.\n  Results. We use in simulations to show how the new calibration approach\nallows for the pyramid wave front sensor without modulation to be used to sense\nand correct atmospheric turbulence and we discuss when this case is preferable\nover the modulated case.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:28:13 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 17:05:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Agapito","Guido",""],["Pinna","Enrico",""],["Esposito","Simone",""],["Heritier","Cedric Ta\u00efssir",""],["Oberti","Sylvain",""]]}
{"id":"2308.01067","submitter":"Tobias Held","authors":"Tobias Held, Sebastian T. Weber and Baerbel Rethfeld","title":"Influence of band occupation on electron-phonon coupling in gold","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electron-phonon coupling is a fundamental process that governs the energy\nrelaxation dynamics of solids excited by ultrafast laser pulses. It has been\nfound to strongly depend on electron temperature as well as on nonequilibrium\neffects. Recently, the effect of occupational nonequilibrium in noble metals,\nwhich outlasts the fully kinetic stage, has come into increased focus. In this\nwork, we investigate the influence of nonequilibrium density distributions in\ngold on the electron-phonon coupling. We find a large effect on the coupling\nparameter which describes the energy exchange between the two subsystems. Our\nresults challenge the conventional view that electron temperature alone is a\nsufficient predictor of electron-phonon coupling.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:32:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Held","Tobias",""],["Weber","Sebastian T.",""],["Rethfeld","Baerbel",""]]}
{"id":"2308.01068","submitter":"Shi-Xin Zhang","authors":"Jiaqi Miao, Chang-Yu Hsieh and Shi-Xin Zhang","title":"Neural network encoded variational quantum algorithms","comments":"4.4 pages, 5 figures, with supplemental materials","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a general framework called neural network (NN) encoded\nvariational quantum algorithms (VQAs), or NN-VQA for short, to address the\nchallenges of implementing VQAs on noisy intermediate-scale quantum (NISQ)\ncomputers. Specifically, NN-VQA feeds input (such as parameters of a\nHamiltonian) from a given problem to a neural network and uses its outputs to\nparameterize an ansatz circuit for the standard VQA. Combining the strengths of\nNN and parameterized quantum circuits, NN-VQA can dramatically accelerate the\ntraining process of VQAs and handle a broad family of related problems with\nvarying input parameters with the pre-trained NN. To concretely illustrate the\nmerits of NN-VQA, we present results on NN-variational quantum eigensolver\n(VQE) for solving the ground state of parameterized XXZ spin models. Our\nresults demonstrate that NN-VQE is able to estimate the ground-state energies\nof parameterized Hamiltonians with high precision without fine-tuning, and\nsignificantly reduce the overall training cost to estimate ground-state\nproperties across the phases of XXZ Hamiltonian. We also employ an\nactive-learning strategy to further increase the training efficiency while\nmaintaining prediction accuracy. These encouraging results demonstrate that\nNN-VQAs offer a new hybrid quantum-classical paradigm to utilize NISQ resources\nfor solving more realistic and challenging computational problems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:32:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Miao","Jiaqi",""],["Hsieh","Chang-Yu",""],["Zhang","Shi-Xin",""]]}
{"id":"2308.01069","submitter":"Serge Hoogendoorn","authors":"Serge Hoogendoorn, Victor Knoop, Hani Mahmassani, and Sascha\n  Hoogendoorn-Lanser","title":"Game-theoretical approach to decentralized multi-drone conflict\n  resolution and emergent traffic flow operations","comments":"Submitted to the TRB Annual Meeting 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces decentralized control concepts for drones using\ndifferential game theory. The approach optimizes the behavior of an ego drone,\nassuming the anticipated behavior of the opponent drones using a receding\nhorizon approach. For each control instant, the scheme computes the Nash\nequilibrium control signal which is applied for the control period. This\nresults in a multi-drone conflict resolution scheme that is applied to all\ndrones considered. The paper discusses the approach and presents the numerical\nalgorithm, showing several examples that illustrate the performance of the\nmodel. We examine at the behavior of the ego drone, and the resulting\ncollective drone flow operations. The latter shows that while the approach aims\nto optimize the operation cost of the ego drone, the experiments provide\nevidence that resulting flow operations are very efficient due to the\nself-organization of various flow patterns. The presented work contributes to\nthe state of the art in providing a generic approach to multi-drone conflict\nresolution with good macroscopic flow performance characteristics. The approach\nenables relatively straightforward inclusion of error due to sensing and\ncommunication. The approach also allows for including different risk levels\n(e.g., for malfunctioning of sensor and communication technology), priority\nrules, regulations, and higher-level control signals (e.g., routing, dynamic\nspeed limits).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:37:14 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hoogendoorn","Serge",""],["Knoop","Victor",""],["Mahmassani","Hani",""],["Hoogendoorn-Lanser","Sascha",""]]}
{"id":"2308.01070","submitter":"Jean-Marc Brossier","authors":"Jean-Marc Brossier, Olivier Lafitte, Lenny R\\'ethor\\'e","title":"When Analytic Calculus Cracks AdaBoost Code","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The principle of boosting in supervised learning involves combining multiple\nweak classifiers to obtain a stronger classifier. AdaBoost has the reputation\nto be a perfect example of this approach. We have previously shown that\nAdaBoost is not truly an optimization algorithm. This paper shows that AdaBoost\nis an algorithm in name only, as the resulting combination of weak classifiers\ncan be explicitly calculated using a truth table. This study is carried out by\nconsidering a problem with two classes and is illustrated by the particular\ncase of three binary classifiers and presents results in comparison with those\nfrom the implementation of AdaBoost algorithm of the Python library\nscikit-learn.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:37:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Brossier","Jean-Marc",""],["Lafitte","Olivier",""],["R\u00e9thor\u00e9","Lenny",""]]}
{"id":"2308.01071","submitter":"Aur\\'elien Renault","authors":"Aur\\'elien Renault and Alexis Bondu and Vincent Lemaire and Dominique\n  Gay","title":"Automatic Feature Engineering for Time Series Classification: Evaluation\n  and Discussion","comments":null,"journal-ref":null,"doi":"10.1109/IJCNN54540.2023.10191074","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time Series Classification (TSC) has received much attention in the past two\ndecades and is still a crucial and challenging problem in data science and\nknowledge engineering. Indeed, along with the increasing availability of time\nseries data, many TSC algorithms have been suggested by the research community\nin the literature. Besides state-of-the-art methods based on similarity\nmeasures, intervals, shapelets, dictionaries, deep learning methods or hybrid\nensemble methods, several tools for extracting unsupervised informative summary\nstatistics, aka features, from time series have been designed in the recent\nyears. Originally designed for descriptive analysis and visualization of time\nseries with informative and interpretable features, very few of these feature\nengineering tools have been benchmarked for TSC problems and compared with\nstate-of-the-art TSC algorithms in terms of predictive performance. In this\narticle, we aim at filling this gap and propose a simple TSC process to\nevaluate the potential predictive performance of the feature sets obtained with\nexisting feature engineering tools. Thus, we present an empirical study of 11\nfeature engineering tools branched with 9 supervised classifiers over 112 time\nseries data sets. The analysis of the results of more than 10000 learning\nexperiments indicate that feature-based methods perform as accurately as\ncurrent state-of-the-art TSC algorithms, and thus should rightfully be\nconsidered further in the TSC literature.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:46:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Renault","Aur\u00e9lien",""],["Bondu","Alexis",""],["Lemaire","Vincent",""],["Gay","Dominique",""]]}
{"id":"2308.01072","submitter":"Obrad Kasum","authors":"Obrad Kasum","title":"Local Definability of $\\mathsf{HOD}$ in $L(\\mathbb{R})$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that in $L(\\mathbb{R})$, assuming large cardinals, $\\mathsf{HOD}\n{\\parallel}\\eta^{+\\mathsf{HOD}}$ is locally definable from $\\mathsf{HOD}\n{\\parallel}\\eta$ for all $\\mathsf{HOD}$-cardinals $\\eta\\in\n[\\boldsymbol{\\delta}^2_1,\\Theta)$. This is a further elaboration of the\nstatement \"$\\mathsf{HOD}^{L(\\mathbb{R})}$ is a core model below $\\Theta$\" made\nby John Steel.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:47:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kasum","Obrad",""]]}
{"id":"2308.01073","submitter":"Jakub Zakrzewski","authors":"Konrad Pawlik, Piotr Sierant, Lev Vidmar, and Jakub Zakrzewski","title":"Many-Body Mobility Edge in Quantum Sun models","comments":"8pp.+ suppl 4pp. Commentas welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.quant-gas quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The 0-dimensional Quantum Sun model is an interacting model that exhibits\nsharp signatures of ergodicity breaking phase transition. Here, we show that\nthe model exhibits a many-body mobility edge. We provide analytical arguments\nfor its existence, complemented by the state-of-the-art numerical simulations.\nWe also introduce the 0-dimensional Quantum Sun model with particle number\nconservation, and we argue that it shares many similarities with his\nunrestricted predecessor.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:49:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Pawlik","Konrad",""],["Sierant","Piotr",""],["Vidmar","Lev",""],["Zakrzewski","Jakub",""]]}
{"id":"2308.01074","submitter":"Ehsan Toreini","authors":"Joshua Harrison, Ehsan Toreini, Maryam Mehrnezhad","title":"A Practical Deep Learning-Based Acoustic Side Channel Attack on\n  Keyboards","comments":"This paper was already accepted in 2023 IEEE European Symposium on\n  Security and Privacy Workshop, SiLM'23 (EuroS&PW)","journal-ref":null,"doi":"10.1109/EuroSPW59978.2023.00034","report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With recent developments in deep learning, the ubiquity of micro-phones and\nthe rise in online services via personal devices, acoustic side channel attacks\npresent a greater threat to keyboards than ever. This paper presents a\npractical implementation of a state-of-the-art deep learning model in order to\nclassify laptop keystrokes, using a smartphone integrated microphone. When\ntrained on keystrokes recorded by a nearby phone, the classifier achieved an\naccuracy of 95%, the highest accuracy seen without the use of a language model.\nWhen trained on keystrokes recorded using the video-conferencing software Zoom,\nan accuracy of 93% was achieved, a new best for the medium. Our results prove\nthe practicality of these side channel attacks via off-the-shelf equipment and\nalgorithms. We discuss a series of mitigation methods to protect users against\nthese series of attacks.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:51:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Harrison","Joshua",""],["Toreini","Ehsan",""],["Mehrnezhad","Maryam",""]]}
{"id":"2308.01075","submitter":"Andrea Svob","authors":"Dean Crnkovi\\'c, Doris Dumi\\v{c}i\\'c Danilovi\\'c, Ana \\v{S}umberac and\n  Andrea \\v{S}vob","title":"Doubly even self-orthogonal codes from quasi-symmetric designs","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we give a construction of doubly even self-orthogonal codes\nfrom quasi-symmetric designs. Further, we study orbit matrices of\nquasi-symmetric designs and give a construction of doubly even self-orthogonal\ncodes from orbit matrices of quasi-symmetric designs of Blokhuis-Haemers type.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:58:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Crnkovi\u0107","Dean",""],["Danilovi\u0107","Doris Dumi\u010di\u0107",""],["\u0160umberac","Ana",""],["\u0160vob","Andrea",""]]}
{"id":"2308.01076","submitter":"Kengo Shimada","authors":"Sinya Aoki, J\\'anos Balog, Kiyoharu Kawana, Kengo Shimada","title":"Bulk modified gravity from a thermal CFT by the conformal flow","comments":"24 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"YITP-23-95","categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a bulk spacetime from a boundary CFT, $O(N)$ free scalar model,\nat finite temperature using a smearing technique, called a conformal flow. The\nbulk metric is constructed as an information metric associated with the\nboundary thermal state. Near the boundary (UV region), an asymptotically AdS\nspacetime is obtained with a leading order perturbation of scalar mode. Based\non the falloff behavior of the perturbations and the $O(N)$ symmetry in the\nCFT, we argue that the corresponding bulk theory is a modified gravity with\nscalar mode such as $f(R)$ gravity rather than Einstein's general relativity\ncoupled minimally to matter fields. Moving to Einstein frame, we show that the\nmetric is asymptotically the same as the AdS black brane solution. On the other\nhand, deep in the bulk (IR region), the spacetime turns out to be conformally\nequivalent to the near horizon limit of AdS extremal black brane, though it is\nno longer a solution of $f(R)$ gravity, and hence more general classes of\nmodified gravity need to be considered.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:01:21 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Aoki","Sinya",""],["Balog","J\u00e1nos",""],["Kawana","Kiyoharu",""],["Shimada","Kengo",""]]}
{"id":"2308.01077","submitter":"Yongpan Zou","authors":"Yongpan Zou","title":"On the Kodaira--Saito vanishing theorem of weakly ample divisor","comments":"arXiv admin note: text overlap with arXiv:2306.00313,\n  arXiv:1605.08088 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  On smooth projective variety, for a reduced effective divisor which is weakly\nample in the sense of cohomology, we introduce a Kadaira--Saito vanishing\ntheorem for it.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:01:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zou","Yongpan",""]]}
{"id":"2308.01078","submitter":"S. N Sajadi","authors":"S.N. Sajadi, Robert B. Mann, H. Sheikhahmadi, M. Khademi","title":"Black hole solutions to Einstein-Bel-Robinson gravity","comments":"16 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":"  By employing a combination of perturbative analytic methods, we study the\nphysical properties of a static-spherically symmetric black hole in the\nframework of the recently proposed Einstien-Bel-Robinson version of gravity. We\nshow that interestingly the theory propagates a transverse and massive graviton\non a maximally symmetric background with positive energy. There is also a\nsingle ghost-free branch that returns to the Einstein case when \\beta\\to 0.\nThen, we obtain the conserved charges of the theory to study the thermodynamics\nof the black hole solutions. We get the thermodynamical quantities and show\nthat the solutions undergo a first-order phase transition with associated Van\nder Waals behavior. We analyze the specific heat, determining that the black\nholes are thermodynamically stable over large regions of parametric space.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:03:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sajadi","S. N.",""],["Mann","Robert B.",""],["Sheikhahmadi","H.",""],["Khademi","M.",""]]}
{"id":"2308.01079","submitter":"Zi-Ting Sun","authors":"Zi-Ting Sun, Jin-Xin Hu, Ying-Ming Xie and K. T. Law","title":"Crossover of $h/e$ and $h/2e$ oscillations in chiral edge-channel\n  Josephson junctions","comments":"6 pages, 4 figures, plus Supplementary Material","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":"  Recently, several experiments reported that the magnetic field interference\npattern of the quantum hall edge states mediated Josephson junctions can\nexhibit Fraunhofer oscillations with a periodicity of either $h/e$ or $h/2e$.\nHowever, a unified understanding of such a phenomenon is still absent. In this\nwork, we show that the competition between local Andreev reflections and\ncrossed Andreev reflections results in the crossover between $h/e$ and $h/2e$\nquantum oscillations in chiral edge-channel Josephson junctions. Our theory\nexplains why recent experiments observed either $h/e$ or $h/2e$ oscillations in\ndifferent samples. Furthermore, we predict a thermal-driven $h/e$ to $h/2e$\nFraunhofer oscillations crossover.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:03:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sun","Zi-Ting",""],["Hu","Jin-Xin",""],["Xie","Ying-Ming",""],["Law","K. T.",""]]}
{"id":"2308.01080","submitter":"Michiel van der Meer","authors":"Lea Krause, Selene B\\'aez Santamar\\'ia, Michiel van der Meer, Urja\n  Khurana","title":"Leveraging Few-Shot Data Augmentation and Waterfall Prompting for\n  Response Generation","comments":"DSTC11","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper discusses our approaches for task-oriented conversational\nmodelling using subjective knowledge, with a particular emphasis on response\ngeneration. Our methodology was shaped by an extensive data analysis that\nevaluated key factors such as response length, sentiment, and dialogue acts\npresent in the provided dataset. We used few-shot learning to augment the data\nwith newly generated subjective knowledge items and present three approaches\nfor DSTC11: (1) task-specific model exploration, (2) incorporation of the most\nfrequent question into all generated responses, and (3) a waterfall prompting\ntechnique using a combination of both GPT-3 and ChatGPT.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:04:27 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Krause","Lea",""],["Santamar\u00eda","Selene B\u00e1ez",""],["van der Meer","Michiel",""],["Khurana","Urja",""]]}
{"id":"2308.01081","submitter":"Alexey Kapranov","authors":"D. A. Khokhlov, R. S. Akzyanov, A. V. Kapranov","title":"Magnetization control of the nematicity direction and nodal points in a\n  superconducting doped topological insulator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the effects of magnetization on the properties of the doped\ntopological insulator with nematic superconductivity. We found that the\ndirection of the in-plane magnetization fixes the direction of the nematicity\nin the system. The chiral state is more favorable than the nematic state for\nlarge values of out-of-plane magnetization. Overall, the critical temperature\nof the nematic state is resilient against magnetization. We explore the\nspectrum of the system with the pinned direction of the nematic order parameter\n$\\Delta_{y}$ in details. Without magnetization, there is a full gap in the\nspectrum. At strong enough out-of-plane $m_z$ or orthogonal in-plane $m_x$\nmagnetization, the spectrum is closed at the nodal points that are split by the\nmagnetization. Flat Majorana surface states connect such split bulk nodal\npoints. Parallel magnetization $m_y$ lifts nodal points and opens a full gap in\nthe spectrum. We discuss relevant experiments and propose experimental\nverifications of our theory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:10:32 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Khokhlov","D. A.",""],["Akzyanov","R. S.",""],["Kapranov","A. V.",""]]}
{"id":"2308.01082","submitter":"Masato Minamitsuji","authors":"Masato Minamitsuji and Kei-ichi Maeda","title":"Black hole thermodynamics in Horndeski theories","comments":"21 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate thermodynamics of static and spherically symmetric black holes\n(BHs) in the Horndeski theories. Because of the presence of the\nhigher-derivative interactions and the nonminimal derivative couplings of the\nscalar field, the standard Wald entropy formula may not be directly applicable.\nHence, following the original formulation by Iyer and Wald, we obtain the\ndifferentials of the BH entropy and the total mass of the system in the\nHorndeski theories, which lead to the first-law of thermodynamics via the\nconservation of the Hamiltonian. Our formulation covers the case of the static\nand spherically symmetric BH solutions with the static scalar field and those\nwith the linearly time-dependent scalar field in the shift-symmetric Horndeski\ntheories. We then apply our results to explicit BH solutions in the Horndeski\ntheories. In the case of the conventional scalar-tensor theories and the\nEinstein-scalar-Gauss-Bonnet theories, we recover the BH entropy obtained by\nthe Wald entropy formula. In the shift-symmetric theories, in the case of the\nBH solutions with the the static scalar field we show that the BH entropy\nfollows the ordinary area law even in the presence of the nontrivial profile of\nthe scalar field. On the other hand, in the case of the BH solutions where the\nscalar field linearly depends on time, i.e., the stealth Schwarzschild and\nSchwarzschild-(anti-) de Sitter solutions, the BH entropy also depends on the\nprofile of the scalar field. By use of the entropy, we find that there exists\nsome range of the parameters in which Schwarzschild$-$(AdS) BH with non-trivial\nscalar field is thermodynamically stable than Schwarzschild$-$(AdS) BH without\nscalar field in general relativity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:12:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Minamitsuji","Masato",""],["Maeda","Kei-ichi",""]]}
{"id":"2308.01083","submitter":"Markus Boettcher","authors":"Markus Boettcher (North-West University, Potchefstroom, South Africa)","title":"Beaming patterns of neutrino emission from photo-pion production in\n  relativistic jets","comments":"Submitted to ApJ Letters. Currently in dispute with editor Fred Rasio\n  over unfair referee report","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the light of growing evidence that blazars are responsible for part of the\nastrophysical very-high-energy neutrino flux detected by IceCube, models for\nneutrino production through photo-pion interactions in blazar jets have been\ndeveloped. Evidence is also mounting that photon fields originating external to\nthe jet are strongly favored over the co-moving primary electron synchrotron\nphoton field as target for photo-pion interactions. Even though those external\nphoton fields appear highly anisotropic in the co-moving frame of the emission\nregion, current models usually consider neutrino production to occur\nisotropically in the co-moving frame, resulting in a beaming pattern that is\nidentical to intrinsically isotropic synchrotron and synchrotron self-Compton\nemission. In this paper, we derive the resulting beaming patterns of neutrinos\nproduced by interactions wich external photon fields, taking into account all\nrelevant anisotropy effects. It is shown that neutrino emission resulting from\nphoto-pion production on a stationary and isotropic (in the AGN rest frame)\nexternal photon field is significantly more strongly beamed along the jet\ndirection than intrinsically isotropic emission. For the most highly beamed\nsources, this implies that expected neutrino fluxes are grossly under-estimated\nor jet-power requirements for the production of a given neutrino flux grossly\nover-estimated when not accounting for the proper Doppler boosting and beaming\ncharacteristics.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:17:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Boettcher","Markus","","North-West University, Potchefstroom, South Africa"]]}
{"id":"2308.01084","submitter":"S\\\"uleyman Yildiz","authors":"S\\\"uleyman Yildiz, Pawan Goyal, Thomas Bendokat and Peter Benner","title":"Data-Driven Identification of Quadratic Symplectic Representations of\n  Nonlinear Hamiltonian Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a framework for learning Hamiltonian systems using data. This work\nis based on the lifting hypothesis, which posits that nonlinear Hamiltonian\nsystems can be written as nonlinear systems with cubic Hamiltonians. By\nleveraging this, we obtain quadratic dynamics that are Hamiltonian in a\ntransformed coordinate system. To that end, for given generalized position and\nmomentum data, we propose a methodology to learn quadratic dynamical systems,\nenforcing the Hamiltonian structure in combination with a symplectic\nauto-encoder. The enforced Hamiltonian structure exhibits long-term stability\nof the system, while the cubic Hamiltonian function provides relatively low\nmodel complexity. For low-dimensional data, we determine a higher-order\ntransformed coordinate system, whereas, for high-dimensional data, we find a\nlower-order coordinate system with the desired properties. We demonstrate the\nproposed methodology by means of both low-dimensional and high-dimensional\nnonlinear Hamiltonian systems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:26:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yildiz","S\u00fcleyman",""],["Goyal","Pawan",""],["Bendokat","Thomas",""],["Benner","Peter",""]]}
{"id":"2308.01085","submitter":"Stanislav Kikot","authors":"Stanislav Kikot","title":"Spatial Intelligence of a Self-driving Car and Rule-Based Decision\n  Making","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we show how rule-based decision making can be combined with\ntraditional motion planning techniques to achieve human-like behavior of a\nself-driving vehicle in complex traffic situations. We give and discuss\nexamples of decision rules in autonomous driving. We draw on these examples to\nillustrate that developing techniques for spatial awareness of robots is an\nexciting activity which deserves more attention from spatial reasoning\ncommunity that it had received so far.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:27:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kikot","Stanislav",""]]}
{"id":"2308.01086","submitter":"Giacomo D'Amicantonio","authors":"Giacomo D'Amicantonio, Egor Bondarau, Peter H.N. De With","title":"Homography Estimation in Complex Topological Scenes","comments":"Will be published in Intelligent Vehicle Symposium 2023","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":"  Surveillance videos and images are used for a broad set of applications,\nranging from traffic analysis to crime detection. Extrinsic camera calibration\ndata is important for most analysis applications. However, security cameras are\nsusceptible to environmental conditions and small camera movements, resulting\nin a need for an automated re-calibration method that can account for these\nvarying conditions. In this paper, we present an automated camera-calibration\nprocess leveraging a dictionary-based approach that does not require prior\nknowledge on any camera settings. The method consists of a custom\nimplementation of a Spatial Transformer Network (STN) and a novel topological\nloss function. Experiments reveal that the proposed method improves the IoU\nmetric by up to 12% w.r.t. a state-of-the-art model across five synthetic\ndatasets and the World Cup 2014 dataset.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:31:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["D'Amicantonio","Giacomo",""],["Bondarau","Egor",""],["De With","Peter H. N.",""]]}
{"id":"2308.01087","submitter":"Zaheer Uddin","authors":"Muhammad Saeed, Zaheer Uddin","title":"Lifetimes of Fine Levels of Li Atom for 20 < n < 31 by Extended Ritz\n  Formula","comments":"9 Pages 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lithium and lithium-like elements look like hydrogen atoms if their two\nelectrons and the nucleus are considered a core around which a single electron\nis orbiting. The energy and radii expressions for hydrogen atoms can be used\nfor lithium and lithium-like elements; an important modification is introducing\nan effective principal quantum number. The effective principal quantum number\ndiffers from the principal quantum number of hydrogen by the quantum defect.\nQuantum defect has respective values for various levels of lithium and lithium\nions. In this study, we used extended Ritz formulas to calculate quantum\ndefects required to calculate energies of ns, np, nd, and nf series. Using\nthese energies, we calculated transition probabilities and then the lifetimes\nof the lithium levels. The lifetimes were calculated with the published data;\nan excellent agreement was recorded. The work also extended the available list\nof lifetimes. Forty lifetimes are new and presented for the first time. a\npolynomial for each of the ns, np, nd, and nf series lifetimes has been\nproduced that fits well the lifetime values\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:35:16 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Saeed","Muhammad",""],["Uddin","Zaheer",""]]}
{"id":"2308.01088","submitter":"Gianluca Amprimo","authors":"Gianluca Amprimo, Giulia Masi, Giuseppe Pettiti, Gabriella Olmo,\n  Lorenzo Priano and Claudia Ferraris","title":"Hand tracking for clinical applications: validation of the Google\n  MediaPipe Hand (GMH) and the depth-enhanced GMH-D frameworks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate 3D tracking of hand and fingers movements poses significant\nchallenges in computer vision. The potential applications span across multiple\ndomains, including human-computer interaction, virtual reality, industry, and\nmedicine. While gesture recognition has achieved remarkable accuracy,\nquantifying fine movements remains a hurdle, particularly in clinical\napplications where the assessment of hand dysfunctions and rehabilitation\ntraining outcomes necessitate precise measurements. Several novel and\nlightweight frameworks based on Deep Learning have emerged to address this\nissue; however, their performance in accurately and reliably measuring fingers\nmovements requires validation against well-established gold standard systems.\nIn this paper, the aim is to validate the handtracking framework implemented by\nGoogle MediaPipe Hand (GMH) and an innovative enhanced version, GMH-D, that\nexploits the depth estimation of an RGB-Depth camera to achieve more accurate\ntracking of 3D movements. Three dynamic exercises commonly administered by\nclinicians to assess hand dysfunctions, namely Hand Opening-Closing, Single\nFinger Tapping and Multiple Finger Tapping are considered. Results demonstrate\nhigh temporal and spectral consistency of both frameworks with the gold\nstandard. However, the enhanced GMH-D framework exhibits superior accuracy in\nspatial measurements compared to the baseline GMH, for both slow and fast\nmovements. Overall, our study contributes to the advancement of hand tracking\ntechnology, the establishment of a validation procedure as a good-practice to\nprove efficacy of deep-learning-based hand-tracking, and proves the\neffectiveness of GMH-D as a reliable framework for assessing 3D hand movements\nin clinical applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:44:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Amprimo","Gianluca",""],["Masi","Giulia",""],["Pettiti","Giuseppe",""],["Olmo","Gabriella",""],["Priano","Lorenzo",""],["Ferraris","Claudia",""]]}
{"id":"2308.01089","submitter":"Benoit Nennig","authors":"N. Even, B. Nennig, G. Lefebvre and E. Perrey-Debain","title":"Experimental observation of exceptional points in coupled pendulums","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concept of exceptional point (EP) is demonstrated experimentally in the\ncase of a simple mechanical system consisting of two coupled pendulums.\nExceptional points correspond to specific values of the system parameters that\nyield defective eigenvalues. These spectral singularities which are typical of\nnon-Hermitian system means that both the eigenvalues and their associated\neigenvectors coalesce. The existence of an EP requires an adequate\nparameterization of the dynamical system. For this aim, the experimental device\nhas been designed with two controllable parameters which are the length of one\npendulum and a viscous-like damping which is produced via electromagnetic\ninduction. Thanks to the observation of the free response of the coupled\npendulums, most EP properties are experimentally investigated, showing good\nagreements with theoretical considerations. In contrast with many studies on\nEPs, mainly in the field of physics, the novelty of the present work is that\ncontrollable parameters are restricted to be real-valued, and this requires the\nuse of adequate search algorithms. Furthermore, it offers the possibility of\nexploiting the existence of EPs in time-domain dynamic problems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:45:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Even","N.",""],["Nennig","B.",""],["Lefebvre","G.",""],["Perrey-Debain","E.",""]]}
{"id":"2308.01090","submitter":"Krzysztof Jod{\\l}owski","authors":"Kiwoon Choi, Sang Hui Im, Krzysztof Jod{\\l}owski","title":"Exploring CP Violation beyond the Standard Model and the PQ Quality with\n  Electric Dipole Moments","comments":"30 pages, 7 figures","journal-ref":null,"doi":null,"report-no":"CTPU-PTC-23-34","categories":"hep-ph hep-ex hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In some models of physics beyond the Standard Model (SM), one of the leading\nlow energy consequences of the model appears in the form of the chromoelectric\ndipole moments (CEDMs) of the gluons and light quarks. We examine if these\nCEDMs can be distinguished from the QCD $\\theta$-term through the\nexperimentally measurable nucleon and atomic electric dipole moments (EDMs) in\nboth cases with and without the Peccei-Quinn (PQ) mechanism solving the strong\nCP problem. We find that the nucleon EDMs can show a distinctive pattern when\nthe EDMs are dominantly induced by light quark CEDMs without the PQ mechanism.\nIn the presence of the PQ mechanism, the nucleon EDMs due to the gluon or light\nquark CEDMs have a similar pattern as those due to the QCD $\\theta$-parameter,\nregardless of the origin of the axion vacuum value which determines the\n$\\theta$-parameter. In contrast, diamagnetic atomic EDMs due to the gluon or\nlight quark CEDMs have characteristic patterns distinguishable from the pattern\ndue to the $\\theta$-parameter which is induced dominantly by UV-originated PQ\nbreaking other than the QCD anomaly, for instance by quantum gravity effects.\nOur results suggest that EDMs may provide information not only on CP violation\nbeyond the SM, but also on the existence of the PQ mechanism and the quality of\nthe PQ symmetry characterized by the strength of UV-originated PQ breaking\nother than the QCD anomaly.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:49:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Choi","Kiwoon",""],["Im","Sang Hui",""],["Jod\u0142owski","Krzysztof",""]]}
{"id":"2308.01091","submitter":"Spencer Jolly","authors":"Miguel A. Porras and Spencer W. Jolly","title":"Control of vortex orientation of ultrashort optical pulses using spatial\n  chirp","comments":"5 pages, 6 figures, submitted for peer review","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Introducing a spatial chirp into a pulse with a longitudinal vortex, such as\na standard pulsed Laguerre-Gauss beam, results in a vortex pulse with an\narbitrary orientation of the line phase singularity between longitudinal and\ntransverse, depending on the amount of chirp. Analytical expressions are given\nfor such pulses with arbitrary topological charge valid at any propagation\ndistance.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:53:01 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 10:23:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Porras","Miguel A.",""],["Jolly","Spencer W.",""]]}
{"id":"2308.01092","submitter":"Aleksei Reznichenko","authors":"A. V. Reznichenko, V. O. Guba","title":"Path-integral approach to mutual information calculation for nonlinear\n  communication channel with small second dispersion at large signal-to-noise\n  power ratio","comments":"42 pages, 5 figures","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 information fiber optical channel modeled by the nonlinear\nSchrodinger equation with additive Gaussian noise. Using path-integral approach\nand perturbation theory for the small dimensionless parameter of the second\ndispersion, we calculate the conditional probability density functional in the\nleading and next-to-leading order in the dimensionless second dispersion\nparameter associated with the input signal bandwidth. Taking into account\nspecific filtering of the output signal by the output signal receiver, we\ncalculate the mutual information in the leading and next-to-leading order in\nthe dispersion parameter and in the leading order in the parameter\nsignal-to-noise ratio (SNR). Further, we find the explicit expression for the\nmutual information in case of the modified Gaussian input signal distribution\ntaking into account the limited frequency bandwidth of the input signal.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:55:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Reznichenko","A. V.",""],["Guba","V. O.",""]]}
{"id":"2308.01093","submitter":"Niklas Kolbe","authors":"Niklas Kolbe, Moritz Berghaus, Eszter Kall\\'o, Michael Herty and\n  Markus Oeser","title":"A data-driven microscopic on-ramp model based on macroscopic network\n  flows","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While macroscopic traffic flow models consider traffic as a fluid,\nmicroscopic traffic flow models describe the dynamics of individual vehicles.\nCapturing macroscopic traffic phenomena remains a challenge for microscopic\nmodels, especially in complex road sections such as on-ramps. In this paper, we\npropose a microscopic model for on-ramps derived from a macroscopic network\nflow model calibrated to real traffic data. The microscopic flow-based model\nrequires additional assumptions regarding the acceleration and the merging\nbehavior on the on-ramp to maintain consistency with the mean speeds, traffic\nflow and density predicted by the macroscopic model. To evaluate the model's\nperformance, we conduct traffic simulations assessing speeds, accelerations,\nlane change positions, and risky behavior. Our results show that, although the\nproposed model may not fully capture all traffic phenomena of on-ramps\naccurately, it performs better than the Intelligent Driver Model (IDM) in most\nevaluated aspects. While the IDM is almost completely free of conflicts, the\nproposed model evokes a realistic amount and severity of conflicts and can\ntherefore be used for safety analysis.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:57:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kolbe","Niklas",""],["Berghaus","Moritz",""],["Kall\u00f3","Eszter",""],["Herty","Michael",""],["Oeser","Markus",""]]}
{"id":"2308.01094","submitter":"Baifan Zhou","authors":"Baifan Zhou, Nikolay Nikolov, Zhuoxun Zheng, Xianghui Luo, Ognjen\n  Savkovic, Dumitru Roman, Ahmet Soylu, Evgeny Kharlamov","title":"Scaling Data Science Solutions with Semantics and Machine Learning:\n  Bosch Case","comments":"Paper accepted at ISWC2023 In-Use track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Industry 4.0 and Internet of Things (IoT) technologies unlock unprecedented\namount of data from factory production, posing big data challenges in volume\nand variety. In that context, distributed computing solutions such as cloud\nsystems are leveraged to parallelise the data processing and reduce computation\ntime. As the cloud systems become increasingly popular, there is increased\ndemand that more users that were originally not cloud experts (such as data\nscientists, domain experts) deploy their solutions on the cloud systems.\nHowever, it is non-trivial to address both the high demand for cloud system\nusers and the excessive time required to train them. To this end, we propose\nSemCloud, a semantics-enhanced cloud system, that couples cloud system with\nsemantic technologies and machine learning. SemCloud relies on domain\nontologies and mappings for data integration, and parallelises the semantic\ndata integration and data analysis on distributed computing nodes. Furthermore,\nSemCloud adopts adaptive Datalog rules and machine learning for automated\nresource configuration, allowing non-cloud experts to use the cloud system. The\nsystem has been evaluated in industrial use case with millions of data,\nthousands of repeated runs, and domain users, showing promising results.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:58:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhou","Baifan",""],["Nikolov","Nikolay",""],["Zheng","Zhuoxun",""],["Luo","Xianghui",""],["Savkovic","Ognjen",""],["Roman","Dumitru",""],["Soylu","Ahmet",""],["Kharlamov","Evgeny",""]]}
{"id":"2308.01095","submitter":"Jinpeng Lin","authors":"Jinpeng Lin, Min Zhou, Ye Ma, Yifan Gao, Chenxi Fei, Yangjian Chen,\n  Zhang Yu, Tiezheng Ge","title":"AutoPoster: A Highly Automatic and Content-aware Design System for\n  Advertising Poster Generation","comments":"Accepted for ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advertising posters, a form of information presentation, combine visual and\nlinguistic modalities. Creating a poster involves multiple steps and\nnecessitates design experience and creativity. This paper introduces\nAutoPoster, a highly automatic and content-aware system for generating\nadvertising posters. With only product images and titles as inputs, AutoPoster\ncan automatically produce posters of varying sizes through four key stages:\nimage cleaning and retargeting, layout generation, tagline generation, and\nstyle attribute prediction. To ensure visual harmony of posters, two\ncontent-aware models are incorporated for layout and tagline generation.\nMoreover, we propose a novel multi-task Style Attribute Predictor (SAP) to\njointly predict visual style attributes. Meanwhile, to our knowledge, we\npropose the first poster generation dataset that includes visual attribute\nannotations for over 76k posters. Qualitative and quantitative outcomes from\nuser studies and experiments substantiate the efficacy of our system and the\naesthetic superiority of the generated posters compared to other poster\ngeneration methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:58:43 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 06:26:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lin","Jinpeng",""],["Zhou","Min",""],["Ma","Ye",""],["Gao","Yifan",""],["Fei","Chenxi",""],["Chen","Yangjian",""],["Yu","Zhang",""],["Ge","Tiezheng",""]]}
{"id":"2308.01096","submitter":"Muhammad Usama Mirza","authors":"Muhammad U. Mirza, Onat Dalmaz, Hasan A. Bedel, Gokberk Elmas, Yilmaz\n  Korkmaz, Alper Gungor, Salman UH Dar, and Tolga \\c{C}ukur","title":"Learning Fourier-Constrained Diffusion Bridges for MRI Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent years have witnessed a surge in deep generative models for accelerated\nMRI reconstruction. Diffusion priors in particular have gained traction with\ntheir superior representational fidelity and diversity. Instead of the target\ntransformation from undersampled to fully-sampled data, common diffusion priors\nare trained to learn a multi-step transformation from Gaussian noise onto\nfully-sampled data. During inference, data-fidelity projections are injected in\nbetween reverse diffusion steps to reach a compromise solution within the span\nof both the diffusion prior and the imaging operator. Unfortunately, suboptimal\nsolutions can arise as the normality assumption of the diffusion prior causes\ndivergence between learned and target transformations. To address this\nlimitation, here we introduce the first diffusion bridge for accelerated MRI\nreconstruction. The proposed Fourier-constrained diffusion bridge (FDB)\nleverages a generalized process to transform between undersampled and\nfully-sampled data via random noise addition and random frequency removal as\ndegradation operators. Unlike common diffusion priors that use an asymptotic\nendpoint based on Gaussian noise, FDB captures a transformation between finite\nendpoints where the initial endpoint is based on moderate degradation of\nfully-sampled data. Demonstrations on brain MRI indicate that FDB outperforms\nstate-of-the-art reconstruction methods including conventional diffusion\npriors.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:04:07 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 09:10:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mirza","Muhammad U.",""],["Dalmaz","Onat",""],["Bedel","Hasan A.",""],["Elmas","Gokberk",""],["Korkmaz","Yilmaz",""],["Gungor","Alper",""],["Dar","Salman UH",""],["\u00c7ukur","Tolga",""]]}
{"id":"2308.01097","submitter":"Jiexin Wang","authors":"Jiexin Wang, Yujie Zhou, Wenwen Qiang, Ying Ba, Bing Su, Ji-Rong Wen","title":"Spatio-Temporal Branching for Motion Prediction using Motion Increments","comments":null,"journal-ref":"ACM MM 2023","doi":"10.1145/3581783.3612330","report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human motion prediction (HMP) has emerged as a popular research topic due to\nits diverse applications, but it remains a challenging task due to the\nstochastic and aperiodic nature of future poses. Traditional methods rely on\nhand-crafted features and machine learning techniques, which often struggle to\nmodel the complex dynamics of human motion. Recent deep learning-based methods\nhave achieved success by learning spatio-temporal representations of motion,\nbut these models often overlook the reliability of motion data. Additionally,\nthe temporal and spatial dependencies of skeleton nodes are distinct. The\ntemporal relationship captures motion information over time, while the spatial\nrelationship describes body structure and the relationships between different\nnodes. In this paper, we propose a novel spatio-temporal branching network\nusing incremental information for HMP, which decouples the learning of\ntemporal-domain and spatial-domain features, extracts more motion information,\nand achieves complementary cross-domain knowledge learning through knowledge\ndistillation. Our approach effectively reduces noise interference and provides\nmore expressive information for characterizing motion by separately extracting\ntemporal and spatial features. We evaluate our approach on standard HMP\nbenchmarks and outperform state-of-the-art methods in terms of prediction\naccuracy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:04:28 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 07:21:53 GMT"},{"version":"v3","created":"Fri, 11 Aug 2023 05:30:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Jiexin",""],["Zhou","Yujie",""],["Qiang","Wenwen",""],["Ba","Ying",""],["Su","Bing",""],["Wen","Ji-Rong",""]]}
{"id":"2308.01098","submitter":"Kun-Peng Ning","authors":"Kun-Peng Ning, Ming Pang, Zheng Fang, Xue Jiang, Xi-Wei Zhao,\n  Chang-Ping Peng, Zhan-Gang Lin, Jing-He Hu, Jing-Ping Shao","title":"Towards Better Query Classification with Multi-Expert Knowledge\n  Condensation in JD Ads Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Search query classification, as an effective way to understand user intents,\nis of great importance in real-world online ads systems. To ensure a lower\nlatency, a shallow model (e.g. FastText) is widely used for efficient online\ninference. However, the representation ability of the FastText model is\ninsufficient, resulting in poor classification performance, especially on some\nlow-frequency queries and tailed categories. Using a deeper and more complex\nmodel (e.g. BERT) is an effective solution, but it will cause a higher online\ninference latency and more expensive computing costs. Thus, how to juggle both\ninference efficiency and classification performance is obviously of great\npractical importance. To overcome this challenge, in this paper, we propose\nknowledge condensation (KC), a simple yet effective knowledge distillation\nframework to boost the classification performance of the online FastText model\nunder strict low latency constraints. Specifically, we propose to train an\noffline BERT model to retrieve more potentially relevant data. Benefiting from\nits powerful semantic representation, more relevant labels not exposed in the\nhistorical data will be added into the training set for better FastText model\ntraining. Moreover, a novel distribution-diverse multi-expert learning strategy\nis proposed to further improve the mining ability of relevant data. By training\nmultiple BERT models from different data distributions, it can respectively\nperform better at high, middle, and low-frequency search queries. The model\nensemble from multi-distribution makes its retrieval ability more powerful. We\nhave deployed two versions of this framework in JD search, and both offline\nexperiments and online A/B testing from multiple datasets have validated the\neffectiveness of the proposed approach.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:05:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ning","Kun-Peng",""],["Pang","Ming",""],["Fang","Zheng",""],["Jiang","Xue",""],["Zhao","Xi-Wei",""],["Peng","Chang-Ping",""],["Lin","Zhan-Gang",""],["Hu","Jing-He",""],["Shao","Jing-Ping",""]]}
{"id":"2308.01099","submitter":"Pim Spelier","authors":"David Holmes, Pim Spelier","title":"Logarithmic cohomological field theories","comments":"40 pages. Comments very welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new logarithmic structure on the moduli stack of stable\ncurves, admitting logarithmic gluing maps. Using this we define cohomological\nfield theories taking values in the logarithmic Chow cohomology ring, a\nrefinement of the usual notion of a cohomological field theory. We realise the\ndouble ramification cycle as a partial logarithmic cohomological field theory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:09:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Holmes","David",""],["Spelier","Pim",""]]}
{"id":"2308.01100","submitter":"Amit Federbush","authors":"Amit Federbush, Amit Moscovich, Yohai Bar-Sinai","title":"Hidden Markov modeling of single particle diffusion with stochastic\n  tethering","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The statistics of the diffusive motion of particles often serve as an\nexperimental proxy for their interaction with the environment. However,\ninferring the physical properties from the observed trajectories is\nchallenging. Inspired by a recent experiment, here we analyze the problem of\nparticles undergoing two-dimensional Brownian motion with transient tethering\nto the surface. We model the problem as a Hidden Markov Model where the\nphysical position is observed, and the tethering state is hidden. We develop an\nalternating maximization algorithm to infer the hidden state of the particle\nand estimate the physical parameters of the system. The crux of our method is a\nsaddle-point-like approximation, which involves finding the most likely\nsequence of hidden states and estimating the physical parameters from it.\nExtensive numerical tests demonstrate that our algorithm reliably finds the\nmodel parameters, and is insensitive to the initial guess. We discuss the\ndifferent regimes of physical parameters and the algorithm's performance in\nthese regimes. We also provide a ready-to-use open source implementation of our\nalgorithm.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:13:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Federbush","Amit",""],["Moscovich","Amit",""],["Bar-Sinai","Yohai",""]]}
{"id":"2308.01101","submitter":"Michael Heins","authors":"Michael Heins, Annika Moucha, Oliver Roth, Toshiyuki Sugawa","title":"Peschl-Minda derivatives and convergent Wick star products on the disk,\n  the sphere and beyond","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math-ph math.FA math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and study invariant differential operators acting on the space\n$\\mathcal{H}(\\Omega)$ of holomorphic functions on the complement\n${\\Omega=\\{(z,w) \\in \\hat{\\mathbb{C}}^2 \\, : \\, z\\cdot w \\not=1\\}}$ of the\n\"complexified unit circle\" $\\{(z,w) \\in \\hat{\\mathbb{C}}^2 \\, : \\, z\\cdot w\n=1\\}$. We obtain recursion identities, describe the behaviour under change of\ncoordinates and find the generators of the corresponding operator algebra. We\nillustrate how this provides a unified framework for investigating conformally\ninvariant differential operators on the unit disk $\\mathbb{D}$ and the Riemann\nsphere $\\hat{\\mathbb{C}}$, which have been studied by Peschl, Aharonov, Minda\nand many others, within their conjecturally natural habitat. We apply the\nmachinery to a problem in deformation quantization by deriving explicit\nformulas for the canonical Wick-type star products on $\\Omega$, the unit disk\n$\\mathbb{D}$ and the Riemann sphere $\\hat{\\mathbb{C}}$ in terms of such\ninvariant differential operators. These formulas are given in form of factorial\nseries which depend holomorphically on a complex deformation parameter $\\hbar$\nand lead to asymptotic expansions of the star products in powers of $\\hbar$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:17:46 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 09:40:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Heins","Michael",""],["Moucha","Annika",""],["Roth","Oliver",""],["Sugawa","Toshiyuki",""]]}
{"id":"2308.01102","submitter":"Jan K\\'ara","authors":"Jan K\\'ara, Linda Schmidtobreick, Anna Francesca Pala, Claus Tappert","title":"Structure of the accretion flow of IX Velorum as revealed by\n  high-resolution spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context: Several high-mass transfer cataclysmic variables show evidence for\noutflow from the system, which could play an important role in their evolution.\nWe investigate the system IX Vel, which was proposed to show similar\ncharacteristics. Aims: We study the structure of the IX Vel system,\nparticularly the structure of its accretion flow and accretion disc. Methods:\nWe use high-resolution time-resolved spectroscopy to construct radial velocity\ncurves of the components in IX Vel, we compute Doppler maps of the system which\nwe use to estimate the temperature distribution maps. Results: We improve the\nspectroscopic ephemeris of the system and its orbital period P_orb =\n0.19392793(3) d. We construct Doppler maps of the system based on hydrogen and\nhelium emission lines and the Bowen blend. The maps show features corresponding\nto the irradiated face of the secondary star, the outer rim of the accretion\ndisc, and low-velocity components located outside the accretion disc and\nreaching towards L3. We constructed a temperature distribution map of the\nsystem using the Doppler maps of Balmer lines. Apart from the features found in\nthe Doppler maps, the temperature distribution map shows a region of high\ntemperature in the accretion disc connecting the expected position of a bright\nspot and the inner parts of the disc. Conclusions: We interpret the\nlow-velocity emission found in the Doppler map as emission originating in the\naccretion disc wind and in an outflow region located in the vicinity of the\nthird Lagrangian point L3. This makes IX Vel a member of the RW Sex class of\nCataclysmic Variables.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:18:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["K\u00e1ra","Jan",""],["Schmidtobreick","Linda",""],["Pala","Anna Francesca",""],["Tappert","Claus",""]]}
{"id":"2308.01103","submitter":"Amnon Yekutieli","authors":"Amnon Yekutieli","title":"Improved Kunneth Tricks","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.KT math.AC math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Kunneth trick is a formula for the top cohomology of the derived tensor\nproduct of two complexes of modules over a ring.\n  In this note we present two improvements of this formula. The first improved\nKunneth trick is a formula for the top cohomology of the plain tensor product\nof two DG modules over a nonpositive DG ring. The second trick handles the\nderived tensor product of two DG modules over a nonpositive DG ring. The proofs\nare elementary.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:19:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yekutieli","Amnon",""]]}
{"id":"2308.01104","submitter":"Alain Lehmann","authors":"Alain Lehmann, Wilhelm Kleiminger, Hakim Invernizzi, Aurel Gautschi","title":"Accelerated Benders Decomposition for Variable-Height Transport\n  Packaging Optimisation","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 tackles the problem of finding optimal variable-height transport\npackaging. The goal is to reduce the empty space left in a box when shipping\ngoods to customers, thereby saving on filler and reducing waste. We cast this\nproblem as a large-scale mixed integer problem (with over seven billion\nvariables) and demonstrate various acceleration techniques to solve it\nefficiently in about three hours on a laptop. We present a KD-Tree algorithm to\navoid exhaustive grid evaluation of the 3D-bin-packing, provide analytical\ntransformations to accelerate the Benders decomposition, and an efficient\nimplementation of the Benders sub problem for significant memory savings and a\nthree order of magnitude runtime speedup.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:20:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lehmann","Alain",""],["Kleiminger","Wilhelm",""],["Invernizzi","Hakim",""],["Gautschi","Aurel",""]]}
{"id":"2308.01105","submitter":"Baifan Zhou","authors":"Zhipeng Tan, Baifan Zhou, Zhuoxun Zheng, Ognjen Savkovic, Ziqi Huang,\n  Irlan-Grangel Gonzalez, Ahmet Soylu, Evgeny Kharlamov","title":"Literal-Aware Knowledge Graph Embedding for Welding Quality Monitoring:\n  A Bosch Case","comments":"Paper accepted at ISWC2023 In-Use track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently there has been a series of studies in knowledge graph embedding\n(KGE), which attempts to learn the embeddings of the entities and relations as\nnumerical vectors and mathematical mappings via machine learning (ML). However,\nthere has been limited research that applies KGE for industrial problems in\nmanufacturing. This paper investigates whether and to what extent KGE can be\nused for an important problem: quality monitoring for welding in manufacturing\nindustry, which is an impactful process accounting for production of millions\nof cars annually. The work is in line with Bosch research of data-driven\nsolutions that intends to replace the traditional way of destroying cars, which\nis extremely costly and produces waste. The paper tackles two very challenging\nquestions simultaneously: how large the welding spot diameter is; and to which\ncar body the welded spot belongs to. The problem setting is difficult for\ntraditional ML because there exist a high number of car bodies that should be\nassigned as class labels. We formulate the problem as link prediction, and\nexperimented popular KGE methods on real industry data, with consideration of\nliterals. Our results reveal both limitations and promising aspects of adapted\nKGE methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:22:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tan","Zhipeng",""],["Zhou","Baifan",""],["Zheng","Zhuoxun",""],["Savkovic","Ognjen",""],["Huang","Ziqi",""],["Gonzalez","Irlan-Grangel",""],["Soylu","Ahmet",""],["Kharlamov","Evgeny",""]]}
{"id":"2308.01106","submitter":"Kai Zhou","authors":"Kai Zhou","title":"Extension of Fujimoto's uniqueness theorems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hirotaka Fujimoto considered two meromorphic maps $ f $ and $ g $ of\n$\\mathbb{C}^m $ into $\\mathbb{P}^n $ such that $ f^*(H_j)=g^*(H_j)$ ($ 1\\leq\nj\\leq q $) for $ q $ hyperplanes $ H_j $ in $\\mathbb{P}^n $ in general position\nand proved $ f=g $ under suitable conditions. This paper considers the case\nwhere $ f $ is into $\\mathbb{P}^n $ and $ g $ is into $\\mathbb{P}^N $ and gives\nextensions of some of Fujimoto's uniqueness theorems. The dimensions $ N $ and\n$ n $ are proved to be equal under suitable conditions. New and interesting\nphenomena also occur.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:30:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhou","Kai",""]]}
{"id":"2308.01107","submitter":"Annika Moucha","authors":"Michael Heins, Annika Moucha, Oliver Roth","title":"Function Theory off the complexified unit circle: Fr\\'echet space\n  structure and automorphisms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math-ph math.FA math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by recent work on strict deformation quantization of the unit disk\nand the Riemann sphere, we study the Fr\\'echet space structure of the set of\nholomorphic functions on the complement $\\Omega:=\\{(z,w)\\in\n\\hat{\\mathbb{C}}^2\\, :\\, z\\cdot w\\not=1\\}$ of the complexified unit circle\n${\\{(z,w) \\in \\hat{\\mathbb{C}}^2 \\, : \\, z\\cdot w=1\\}}$. We also characterize\nthe subgroup of all biholomorphic automorphisms of $\\Omega$ which leave the\ncanonical Laplacian on $\\Omega$ invariant.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:33:54 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 09:51:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Heins","Michael",""],["Moucha","Annika",""],["Roth","Oliver",""]]}
{"id":"2308.01108","submitter":"Mehraveh Nikjoo","authors":"Mehraveh Nikjoo and Tom Zlosnik","title":"Hamiltonian formulation of gravity as a spontaneously-broken gauge\n  theory of the Lorentz group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A number of approaches to gravitation have much in common with the gauge\ntheories of the standard model of particle physics. In this paper, we develop\nthe Hamiltonian formulation of a class of gravitational theories that may be\nregarded as spontaneously-broken gauge theories of the complexified Lorentz\ngroup $SO(1,3)_C$ with the gravitational field described entirely by a gauge\nfield valued in the Lie algebra of $SO(1,3)_C$ and a `Higgs field' valued in\nthe group's fundamental representation. The theories have one free parameter\n$\\beta$ which appears in a similar role to the inverse of the Barbero-Immirzi\nparameter of Einstein-Cartan theory. However, contrary to that parameter, it is\nshown that the number of degrees of freedom crucially depends on the value of\n$\\beta$. For non-zero values of $\\beta$, it is shown that three complex degrees\nof freedom propagate on general backgrounds, and for the specific values\n$\\beta=\\pm i$ an extension to General Relativity is recovered in a\nsymmetry-broken regime. For the value $\\beta=0$, the theory propagates no local\ndegrees of freedom. A non-zero value of $\\beta$ corresponds to the self-dual\nand anti-self-dual gauge fields appearing asymmetrically in the action,\ntherefore in these models, the existence of gravitational degrees of freedom is\ntied to chiral asymmetry in the gravitational sector.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:36:28 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nikjoo","Mehraveh",""],["Zlosnik","Tom",""]]}
{"id":"2308.01109","submitter":"Enrico Iurlano","authors":"Enrico Iurlano, Tatjana Zec, Marko Djukanovic, G\\\"unther R. Raidl","title":"Signed double Roman domination on cubic graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The signed double Roman domination problem is a combinatorial optimization\nproblem on a graph asking to assign a label from $\\{\\pm{}1,2,3\\}$ to each\nvertex feasibly, such that the total sum of assigned labels is minimized. Here\nfeasibility is given whenever (i) vertices labeled $\\pm{}1$ have at least one\nneighbor with label in $\\{2,3\\}$; (ii) each vertex labeled $-1$ has one\n$3$-labeled neighbor or at least two $2$-labeled neighbors; and (iii) the sum\nof labels over the closed neighborhood of any vertex is positive. The\ncumulative weight of an optimal labeling is called signed double Roman\ndomination number (SDRDN). In this work, we first consider the problem on\ngeneral cubic graphs of order $n$ for which we present a sharp $n/2+\\Theta(1)$\nlower bound for the SDRDN by means of the discharging method. Moreover, we\nderive a new best upper bound. Observing that we are often able to minimize the\nSDRDN over the class of cubic graphs of a fixed order, we then study in this\ncontext generalized Petersen graphs for independent interest, for which we\npropose a constraint programming guided proof. We then use these insights to\ndetermine the SDRDNs of subcubic $2\\times m$ grid graphs, among other results.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:37:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Iurlano","Enrico",""],["Zec","Tatjana",""],["Djukanovic","Marko",""],["Raidl","G\u00fcnther R.",""]]}
{"id":"2308.01110","submitter":"Dmitry Kubrak","authors":"Dmitry Kubrak, Georgii Shuklin and Alexander Zakharov","title":"Derived binomial rings I: integral Betti cohomology of log schemes","comments":"61 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AT math.KT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and study a derived version $\\mathbf L\\mathrm{Bin}$ of the\nbinomial monad on the unbounded derived category $\\mathscr D(\\mathbb Z)$ of\n$\\mathbb Z$-modules. This monad acts naturally on singular cohomology of any\ntopological space, and does so more efficiently than the more classical monad\n$\\mathbf L\\mathrm{Sym}_{\\mathbb Z}$. We compute all free derived binomial rings\non abelian groups concentrated in a single degree, in particular identifying\n$C_*^{\\mathrm{sing}}(K(\\mathbb Z,n),\\mathbb Z)$ with $\\mathbf\nL\\mathrm{Bin}(\\mathbb Z[-n])$ via a different argument than in works of To\\\"en\nand Horel. Using this we show that the singular cohomology functor\n$C_*^{\\mathrm{sing}}(-,\\mathbb Z)$ induces a fully faithful embedding of the\ncategory of connected nilpotent spaces of finite type to the category of\nderived binomial rings. We then also define a version $\\mathbf L \\mathcal\nBin_X$ of the derived binomial monad on the $\\infty$-category of $\\mathscr\nD(\\mathbb Z)$-valued sheaves on a sufficiently nice topological space $X$. As\nan application we give a closed formula for the singular cohomology of an fs\nlog complex analytic space $(X,\\mathcal M)$: namely we identify the pushforward\n$R\\pi_*\\underline{\\mathbb Z}$ for the corresponding Kato-Nakayama space\n$\\pi\\colon X^{\\mathrm{log}}\\rightarrow X$ with the free coaugmented derived\nbinomial ring on the 2-term exponential complex $\\mathcal O_X\\rightarrow\n\\mathcal M^{\\mathrm{gr}}$. This gives an extension of Steenbrink's formula and\nits generalization by the second author to $\\mathbb Z$-coefficients.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:44:48 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kubrak","Dmitry",""],["Shuklin","Georgii",""],["Zakharov","Alexander",""]]}
{"id":"2308.01111","submitter":"Jianhui Lian","authors":"Jianhui Lian, Nicholas Storm, Guillaume Guiglion, Aldo Serenelli,\n  Benoit Cote, Amanda I. Karakas, Nick Boardman, and Maria Bergemann","title":"Observational constraints on the origin of the elements. VI. Origin and\n  evolution of neutron-capture elements as probed by the Gaia-ESO survey","comments":"14 pages, 11 figures, accepted by MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2390","report-no":null,"categories":"astro-ph.SR astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most heavy elements beyond the iron peak are synthesized via neutron capture\nprocesses. The nature of the astrophysical sites of neutron capture processes\nis still very unclear. In this work we explore the observational constraints of\nthe chemical abundances of s-process and r-process elements on the sites of\nneutron-capture processes by applying Galactic chemical evolution (GCE) models\nto the data from Gaia-ESO large spectroscopic stellar survey. For the\nr-process, the [Eu/Fe]-[Fe/H] distribution suggests a short delay time of the\nsite that produces Eu. Other independent observations (e.g., NS-NS binaries),\nhowever, suggest a significant fraction of long delayed ($>1$Gyr) neutron star\nmergers (NSM). When assuming NSM as the only r-process sites, these two\nobservational constraints are inconsistent at above 1$\\sigma$ level. Including\nshort delayed r-process sites like magneto-rotational supernova can resolve\nthis inconsistency. For the s-process, we find a weak metallicity dependence of\nthe [Ba/Y] ratio, which traces the s-process efficiency. Our GCE model with\nup-to-date yields of AGB stars qualitatively reproduces this metallicity\ndependence, but the model predicts a much higher [Ba/Y] ratio compared to the\ndata. This mismatch suggests that the s-process efficiency of low mass AGB\nstars in the current AGB nucleosynthesis models could be overestimated.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:45:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lian","Jianhui",""],["Storm","Nicholas",""],["Guiglion","Guillaume",""],["Serenelli","Aldo",""],["Cote","Benoit",""],["Karakas","Amanda I.",""],["Boardman","Nick",""],["Bergemann","Maria",""]]}
{"id":"2308.01112","submitter":"Yuki Sato","authors":"Yuki Sato and Kiyoshi Kanazawa","title":"Quantitative statistical analysis of order-splitting behaviour of\n  individual trading accounts in the Japanese stock market over nine years","comments":"33 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.TR cond-mat.stat-mech q-fin.CP q-fin.GN q-fin.RM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this research, we focus on the order-splitting behavior. The order\nsplitting is a trading strategy to execute their large potential metaorder into\nsmall pieces to reduce transaction cost. This strategic behavior is believed to\nbe important because it is a promising candidate for the microscopic origin of\nthe long-range correlation (LRC) in the persistent order flow. Indeed, in 2005,\nLillo, Mike, and Farmer (LMF) introduced a microscopic model of the\norder-splitting traders to predict the asymptotic behavior of the LRC from the\nmicroscopic dynamics, even quantitatively. The plausibility of this scenario\nhas been qualitatively investigated by Toth et al. 2015. However, no solid\nsupport has been presented yet on the quantitative prediction by the LMF model\nin the lack of large microscopic datasets. In this report, we have provided the\nfirst quantitative statistical analysis of the order-splitting behavior at the\nlevel of each trading account. We analyse a large dataset of the Tokyo stock\nexchange (TSE) market over nine years, including the account data of traders\n(called virtual servers). The virtual server is a unit of trading accounts in\nthe TSE market, and we can effectively define the trader IDs by an appropriate\npreprocessing. We apply a strategy clustering to individual traders to identify\nthe order-splitting traders and the random traders. For most of the stocks, we\nfind that the metaorder length distribution obeys power laws with exponent\n$\\alpha$, such that $P(L)\\propto L^{-\\alpha-1}$ with the metaorder length $L$.\nBy analysing the sign correlation $C(\\tau)\\propto \\tau^{-\\gamma}$, we directly\nconfirmed the LMF prediction $\\gamma \\approx \\alpha-1$. Furthermore, we discuss\nhow to estimate the total number of the splitting traders only from public data\nvia the ACF prefactor formula in the LMF model. Our work provides the first\nquantitative evidence of the LMF model.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:46:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sato","Yuki",""],["Kanazawa","Kiyoshi",""]]}
{"id":"2308.01113","submitter":"Bennet Gebken","authors":"Marco Bernreuther, Michael Dellnitz, Bennet Gebken, Georg M\\\"uller,\n  Sebastian Peitz, Konstantin Sonntag, Stefan Volkwein","title":"Multiobjective Optimization of Non-Smooth PDE-Constrained Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multiobjective optimization plays an increasingly important role in modern\napplications, where several criteria are often of equal importance. The task in\nmultiobjective optimization and multiobjective optimal control is therefore to\ncompute the set of optimal compromises (the Pareto set) between the conflicting\nobjectives. The advances in algorithms and the increasing interest in\nPareto-optimal solutions have led to a wide range of new applications related\nto optimal and feedback control - potentially with non-smoothness both on the\nlevel of the objectives or in the system dynamics. This results in new\nchallenges such as dealing with expensive models (e.g., governed by partial\ndifferential equations (PDEs)) and developing dedicated algorithms handling the\nnon-smoothness. Since in contrast to single-objective optimization, the Pareto\nset generally consists of an infinite number of solutions, the computational\neffort can quickly become challenging, which is particularly problematic when\nthe objectives are costly to evaluate or when a solution has to be presented\nvery quickly. This article gives an overview of recent developments in the\nfield of multiobjective optimization of non-smooth PDE-constrained problems. In\nparticular we report on the advances achieved within Project 2 \"Multiobjective\nOptimization of Non-Smooth PDE-Constrained Problems - Switches, State\nConstraints and Model Order Reduction\" of the DFG Priority Programm 1962\n\"Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation\nand Hierarchical Optimization\".\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:47:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bernreuther","Marco",""],["Dellnitz","Michael",""],["Gebken","Bennet",""],["M\u00fcller","Georg",""],["Peitz","Sebastian",""],["Sonntag","Konstantin",""],["Volkwein","Stefan",""]]}
{"id":"2308.01114","submitter":"Oliver Roth","authors":"Daniela Kraus, Oliver Roth, Sebastian Schleissinger, Stefan Waldmann","title":"Strict Wick-type deformation quantization on Riemann surfaces: Rigidity\n  and Obstructions","comments":"References updated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math-ph math.FA math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be a hyperbolic Riemann surface. We study a convergent Wick-type star\nproduct $\\star_X$ on $X$ which is induced by the canonical convergent star\nproduct $\\star_{\\mathbb{D}}$ on the unit disk $\\mathbb{D}$ via Uniformization\nTheory. While by construction, the resulting Fr\\'echet algebras\n$(\\mathcal{A}(X),\\star_X)$ are strongly isomorphic for conformally equivalent\nRiemann surfaces, our work exhibits additional severe topological obstructions.\nIn particular, we show that the Fr\\'echet algebra $(\\mathcal{A}(X),\\star_X)$\ndegenerates if and only if the connectivity of $X$ is at least $3$, and\n$(\\mathcal{A}(X),\\star_X)$ is noncommutative if and only if $X$ is simply\nconnected. We also explicitly determine the algebra $\\mathcal{A}_X$ and the\nstar product $\\star_X$ for the intermediate case of doubly connected Riemann\nsurfaces $X$. As a perhaps surprinsing result, we deduce that two such\nFr\\'echet algebras are strongly isomorphic if and only if either both Riemann\nsurfaces are conformally equivalent to an (not neccesarily the same) annulus or\nboth are conformally equivalent to a punctured disk.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:53:46 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 06:32:13 GMT"},{"version":"v3","created":"Fri, 4 Aug 2023 07:41:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kraus","Daniela",""],["Roth","Oliver",""],["Schleissinger","Sebastian",""],["Waldmann","Stefan",""]]}
{"id":"2308.01115","submitter":"Sofia Qvarfort","authors":"Sofia Qvarfort","title":"Enhanced optomechanical nonlinearity through non-Markovian mechanical\n  noise","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cavity optomechanical systems in the quantum regime consist of a cavity mode\nand mechanical element coupled together through radiation pressure. In the\nnonlinear optomechanical regime, open-system dynamics is generally challenging\nto treat analytically, since the noise terms do not commute with the\noptomechanical interaction term. Specifically, a general treatment of both\nMarkovian and non-Markovian mechanical noise in the nonlinear optomechanical\nregime is still outstanding. Here we address this question by solving the full\ndynamics of an optomechanical system in the nonlinear regime where the\nmechanical element interacts with a bath of harmonic oscillators, representing\nfull quantum Brownian motion. The solutions, which are exact and analytic,\nallow us to consider the strength of the optomechanical nonlinearity in the\npresence of both Markovian (Ohmic) and non-Markovian (sub-Ohmic and\nsuper-Ohmic) baths. We show that that while the strength of the nonlinearity is\ngenerally reduced by a Markovian bath spectrum, it can be enhanced by\nconstructing a bath with a highly non-Markovian structure. The results have\npotential implications for future optomechanical experiments which seek to\nachieve a strong optomechanical nonlinearity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:54:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Qvarfort","Sofia",""]]}
{"id":"2308.01116","submitter":"Shiv Singh","authors":"Mohammad Azam, Manasa Manasa, Tatiana Zajarniuk, Ryszard Diduszko,\n  Tomasz Cetner, Andrzej Morawski, Jaros{\\l}aw Wi\\k{e}ckowski, Andrzej\n  Wi\\'sniewski, Shiv J. Singh","title":"High-pressure synthesis and the enhancement of the superconducting\n  properties of FeSe0.5Te0.5","comments":null,"journal-ref":"Materials 2023, 16(15), 5358","doi":"10.3390/ma16155358","report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A series of FeSe0.5Te0.5 bulk samples have been prepared through the high gas\npressure and high-temperature synthesis (HP-HTS) method to optimize the growth\nconditions, for the first time and investigated for their superconducting\nproperties using structural, microstructure, transport, and magnetic\nmeasurements to reach the final conclusions. Ex-situ and in-situ processes are\nused to prepare bulk samples under a range of growth pressures using Ta-tube\nand without Tatube. The parent compound synthesized by convenient synthesis\nmethod at ambient pressure (CSP) exhibits a superconducting transition\ntemperature of 14.8 K. Our data demonstrate that the prepared FeSe0.5Te0.5\nsealed in a Ta-tube is of better quality than the samples without a Ta-tube,\nand the optimum growth conditions (500 MPa, 600{\\deg}C for 1 h) are favourable\nfor the development of the tetragonal FeSe0.5Te0.5 phase. The optimum bulk\nFeSe0.5Te0.5 depicts a higher transition temperature of 17.3 K and a high\ncritical current density of the order of >10^4 A/cm^2 at 0 T, which is improved\nover the entire magnetic field range and almost twice higher than the parent\ncompound prepared through CSP. Our studies confirm that the high-pressure\nsynthesis method is a highly efficient way to improve the superconducting\ntransition, grain connectivity, sample density, and also pinning properties of\na superconductor.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:55:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Azam","Mohammad",""],["Manasa","Manasa",""],["Zajarniuk","Tatiana",""],["Diduszko","Ryszard",""],["Cetner","Tomasz",""],["Morawski","Andrzej",""],["Wi\u0119ckowski","Jaros\u0142aw",""],["Wi\u015bniewski","Andrzej",""],["Singh","Shiv J.",""]]}
{"id":"2308.01117","submitter":"Chen Peng","authors":"Chen Peng, Peng Wei, Zhenghao Fei, Yuankai Zhu, Stavros G. Vougioukas","title":"Optimization-Based Motion Planning for Autonomous Agricultural Vehicles\n  Turning in Constrained Headlands","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":"  Headland maneuvering is a crucial aspect of unmanned field operations for\nautonomous agricultural vehicles (AAVs). While motion planning for headland\nturning in open fields has been extensively studied and integrated into\ncommercial auto-guidance systems, the existing methods primarily address\nscenarios with ample headland space and thus may not work in more constrained\nheadland geometries. Commercial orchards often contain narrow and irregularly\nshaped headlands, which may include static obstacles,rendering the task of\nplanning a smooth and collision-free turning trajectory difficult. To address\nthis challenge, we propose an optimization-based motion planning algorithm for\nheadland turning under geometrical constraints imposed by field geometry and\nobstacles.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:56:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Peng","Chen",""],["Wei","Peng",""],["Fei","Zhenghao",""],["Zhu","Yuankai",""],["Vougioukas","Stavros G.",""]]}
{"id":"2308.01118","submitter":"Anastasiia Klimashevskaia","authors":"Anastasiia Klimashevskaia, Dietmar Jannach, Mehdi Elahi, Christoph\n  Trattner","title":"A Survey on Popularity Bias in Recommender Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recommender systems help people find relevant content in a personalized way.\nOne main promise of such systems is that they are able to increase the\nvisibility of items in the long tail, i.e., the lesser-known items in a\ncatalogue. Existing research, however, suggests that in many situations today's\nrecommendation algorithms instead exhibit a popularity bias, meaning that they\noften focus on rather popular items in their recommendations. Such a bias may\nnot only lead to limited value of the recommendations for consumers and\nproviders in the short run, but it may also cause undesired reinforcement\neffects over time. In this paper, we discuss the potential reasons for\npopularity bias and we review existing approaches to detect, quantify and\nmitigate popularity bias in recommender systems. Our survey therefore includes\nboth an overview of the computational metrics used in the literature as well as\na review of the main technical approaches to reduce the bias. We furthermore\ncritically discuss today's literature, where we observe that the research is\nalmost entirely based on computational experiments and on certain assumptions\nregarding the practical effects of including long-tail items in the\nrecommendations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:58:11 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 07:43:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Klimashevskaia","Anastasiia",""],["Jannach","Dietmar",""],["Elahi","Mehdi",""],["Trattner","Christoph",""]]}
{"id":"2308.01119","submitter":"Misgina Tsighe Hagos","authors":"Misgina Tsighe Hagos, Kathleen M. Curran, Brian Mac Namee","title":"Unlearning Spurious Correlations in Chest X-ray Classification","comments":"Accepted at the Discovery Science 2023 conference. arXiv admin note:\n  text overlap with arXiv:2307.06026","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Medical image classification models are frequently trained using training\ndatasets derived from multiple data sources. While leveraging multiple data\nsources is crucial for achieving model generalization, it is important to\nacknowledge that the diverse nature of these sources inherently introduces\nunintended confounders and other challenges that can impact both model accuracy\nand transparency. A notable confounding factor in medical image classification,\nparticularly in musculoskeletal image classification, is skeletal\nmaturation-induced bone growth observed during adolescence. We train a deep\nlearning model using a Covid-19 chest X-ray dataset and we showcase how this\ndataset can lead to spurious correlations due to unintended confounding\nregions. eXplanation Based Learning (XBL) is a deep learning approach that goes\nbeyond interpretability by utilizing model explanations to interactively\nunlearn spurious correlations. This is achieved by integrating interactive user\nfeedback, specifically feature annotations. In our study, we employed two\nnon-demanding manual feedback mechanisms to implement an XBL-based approach for\neffectively eliminating these spurious correlations. Our results underscore the\npromising potential of XBL in constructing robust models even in the presence\nof confounding factors.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:59:10 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 19:27:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hagos","Misgina Tsighe",""],["Curran","Kathleen M.",""],["Mac Namee","Brian",""]]}
{"id":"2308.01120","submitter":"Valentin Rapenne","authors":"V Rapenne (ICJ), C Sabot (ICJ, IUF)","title":"A continuous random operator associated with the Vertex Reinforced Jump\n  Process on the circle and the real line","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 paper, we focus on the scaling-limit of the random potential $\\beta$\nassociated with the Vertex Reinforced Jump Process (VRJP) on one-dimensional\ngraphs. Moreover, we give a few applications of this scaling-limit. By\nconsidering a relevant scaling of $\\beta$, we contruct a continuous-space\nversion of the random Schr{\\\"o}dinger operator $H_\\beta$ which is associated\nwith the VRJP on circles and on R. We also compute the integrated density of\nstates of this operator on R which has a remarkably simple form. Moreover, by\nmeans of the same scaling, we obtain a new proof of the Matsumoto-Yor\nproperties concerning the geometric Brownian motion which were proved in\n[MY01]. This new proof is based on some fundamental properties of the random\npotential $\\beta$. We use also the scaling-limit of $\\beta$ in order to prove\nnew identities in law involving exponential functionals of the Brownian motion\nwhich generalize the Dufresne identity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:59:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rapenne","V","","ICJ"],["Sabot","C","","ICJ, IUF"]]}
{"id":"2308.01121","submitter":"Cyril Benezet","authors":"Cyril B\\'en\\'ezet (ENSIIE, LaMME), Jean-Fran\\c{c}ois Chassagneux (LPSM\n  (UMR\\_8001), UPCit\\'e), Mohan Yang (ADIA)","title":"An optimal transport approach for the multiple quantile hedging problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-fin.CP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the multiple quantile hedging problem, which is a class of\npartial hedging problems containing as special examples the quantile hedging\nproblem (F{\\\"o}llmer \\& Leukert 1999) and the PnL matching problem (introduced\nin Bouchard \\& Vu 2012). In complete non-linear markets, we show that the\nproblem can be reformulated as a kind of Monge optimal transport problem. Using\nthis observation, we introduce a Kantorovitch version of the problem and prove\nthat the value of both problems coincide. In the linear case, we thus obtain\nthat the multiple quantile hedging problem can be seen as a semi-discrete\noptimal transport problem, for which we further introduce the dual problem. We\nthen prove that there is no duality gap, allowing us to design a numerical\nmethod based on SGA algorithms to compute the multiple quantile hedging price.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:04:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["B\u00e9n\u00e9zet","Cyril","","ENSIIE, LaMME"],["Chassagneux","Jean-Fran\u00e7ois","","LPSM"],["Yang","Mohan","","ADIA"]]}
{"id":"2308.01122","submitter":"Mohammed El Ansari","authors":"Mohammed El Ansari, Youssef Akdim, and Soumia Lalaoui Rhali","title":"Measure Data for a General Class of Nonlinear Elliptic Problems","comments":"27","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider nonlinear elliptic inclusion having a measure in the right-hand\nside of the type $\\beta(u)-div a(x,Du)\\ni \\mu$ in $\\Omega$ a bounded domain in\n$\\mathbb{R}^{N},$ with $\\beta$ is a maximal monotone graph in $\\mathbb{R}^2$\nand $a(x,Du)$ is a Leray-Lions type operator. We study a suitable notion of\nsolution for this kind of problem. The functional setting involves anisotropic\nSobolev spaces.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:05:55 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ansari","Mohammed El",""],["Akdim","Youssef",""],["Rhali","Soumia Lalaoui",""]]}
{"id":"2308.01123","submitter":"Gabriel Arslan Waltersson","authors":"Gabriel Arslan Waltersson and Yiannis Karayiannidis","title":"Planar Friction Modelling with LuGre Dynamics and Limit Surfaces","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":"  Contact surfaces in planar motion exhibit a coupling between tangential and\nrotational friction forces. This paper proposes planar friction models grounded\nin the LuGre model and limit surface theory. First, distributed planar extended\nstate models are proposed and the Elasto-Plastic model is extended for\nmulti-dimensional friction. Subsequently, we derive a reduced planar friction\nmodel, coupled with a pre-calculated limit surface, that offers reduced\ncomputational cost. The limit surface approximation through an ellipsoid is\ndiscussed. The properties of the planar friction models are assessed in various\nsimulations, demonstrating that the reduced planar friction model achieves\ncomparable performance to the distributed model while exhibiting ~80 times\nlower computational cost.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:06:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Waltersson","Gabriel Arslan",""],["Karayiannidis","Yiannis",""]]}
{"id":"2308.01124","submitter":"Eleonora Denich","authors":"Eleonora Denich and Paolo Novati","title":"Some notes on the trapezoidal rule for Fourier type integrals","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":"  This paper deals with the error analysis of the trapezoidal rule for the\ncomputation of Fourier type integrals, based on two double exponential\ntransformations. The theory allows to construct algorithms in which the\nsteplength and the number of nodes can be a priori selected. The analysis is\nalso used to design an automatic integrator that can be employed without any\nknowledge of the function involved in the problem. Several numerical examples,\nwhich confirm the reliability of this strategy, are reported.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:06:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Denich","Eleonora",""],["Novati","Paolo",""]]}
{"id":"2308.01125","submitter":"Shenbagaraj Kannapiran","authors":"Shenbagaraj Kannapiran, Nalin Bendapudi, Ming-Yuan Yu, Devarth Parikh,\n  Spring Berman, Ankit Vora, and Gaurav Pandey","title":"Stereo Visual Odometry with Deep Learning-Based Point and Line Feature\n  Matching using an Attention Graph Neural Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robust feature matching forms the backbone for most Visual Simultaneous\nLocalization and Mapping (vSLAM), visual odometry, 3D reconstruction, and\nStructure from Motion (SfM) algorithms. However, recovering feature matches\nfrom texture-poor scenes is a major challenge and still remains an open area of\nresearch. In this paper, we present a Stereo Visual Odometry (StereoVO)\ntechnique based on point and line features which uses a novel feature-matching\nmechanism based on an Attention Graph Neural Network that is designed to\nperform well even under adverse weather conditions such as fog, haze, rain, and\nsnow, and dynamic lighting conditions such as nighttime illumination and glare\nscenarios. We perform experiments on multiple real and synthetic datasets to\nvalidate the ability of our method to perform StereoVO under low visibility\nweather and lighting conditions through robust point and line matches. The\nresults demonstrate that our method achieves more line feature matches than\nstate-of-the-art line matching algorithms, which when complemented with point\nfeature matches perform consistently well in adverse weather and dynamic\nlighting conditions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:09:12 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kannapiran","Shenbagaraj",""],["Bendapudi","Nalin",""],["Yu","Ming-Yuan",""],["Parikh","Devarth",""],["Berman","Spring",""],["Vora","Ankit",""],["Pandey","Gaurav",""]]}
{"id":"2308.01126","submitter":"Kanzhi Cheng","authors":"Kanzhi Cheng, Wenpo Song, Zheng Ma, Wenhao Zhu, Zixuan Zhu, Jianbing\n  Zhang","title":"Beyond Generic: Enhancing Image Captioning with Real-World Knowledge\n  using Vision-Language Pre-Training Model","comments":"Accepted at ACM Multimedia (ACMMM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current captioning approaches tend to generate correct but \"generic\"\ndescriptions that lack real-world knowledge, e.g., named entities and\ncontextual information. Considering that Vision-Language Pre-Training (VLP)\nmodels master massive such knowledge from large-scale web-harvested data, it is\npromising to utilize the generalizability of VLP models to incorporate\nknowledge into image descriptions. However, using VLP models faces challenges:\nzero-shot inference suffers from knowledge hallucination that leads to\nlow-quality descriptions, but the generic bias in downstream task fine-tuning\nhinders the VLP model from expressing knowledge. To address these concerns, we\npropose a simple yet effective method called Knowledge-guided Replay\n(K-Replay), which enables the retention of pre-training knowledge during\nfine-tuning. Our approach consists of two parts: (1) a knowledge prediction\ntask on automatically collected replay exemplars to continuously awaken the VLP\nmodel's memory about knowledge, thus preventing the model from collapsing into\nthe generic pattern; (2) a knowledge distillation constraint to improve the\nfaithfulness of generated descriptions hence alleviating the knowledge\nhallucination. To evaluate knowledge-enhanced descriptions, we construct a\nnovel captioning benchmark KnowCap, containing knowledge of landmarks, famous\nbrands, special foods and movie characters. Experimental results show that our\napproach effectively incorporates knowledge into descriptions, outperforming\nstrong VLP baseline by 20.9 points (78.7->99.6) in CIDEr score and 20.5\npercentage points (34.0%->54.5%) in knowledge recognition accuracy. Our code\nand data is available at https://github.com/njucckevin/KnowCap.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:09:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cheng","Kanzhi",""],["Song","Wenpo",""],["Ma","Zheng",""],["Zhu","Wenhao",""],["Zhu","Zixuan",""],["Zhang","Jianbing",""]]}
{"id":"2308.01127","submitter":"Jingfan Chen","authors":"Jingfan Chen, Yuxi Wang, Pengfei Wang, Xiao Chen, Zhaoxiang Zhang,\n  Zhen Lei and Qing Li","title":"DiffusePast: Diffusion-based Generative Replay for Class Incremental\n  Semantic Segmentation","comments":"e.g.: 13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Class Incremental Semantic Segmentation (CISS) extends the traditional\nsegmentation task by incrementally learning newly added classes. Previous work\nhas introduced generative replay, which involves replaying old class samples\ngenerated from a pre-trained GAN, to address the issues of catastrophic\nforgetting and privacy concerns. However, the generated images lack semantic\nprecision and exhibit out-of-distribution characteristics, resulting in\ninaccurate masks that further degrade the segmentation performance. To tackle\nthese challenges, we propose DiffusePast, a novel framework featuring a\ndiffusion-based generative replay module that generates semantically accurate\nimages with more reliable masks guided by different instructions (e.g., text\nprompts or edge maps). Specifically, DiffusePast introduces a dual-generator\nparadigm, which focuses on generating old class images that align with the\ndistribution of downstream datasets while preserving the structure and layout\nof the original images, enabling more precise masks. To adapt to the novel\nvisual concepts of newly added classes continuously, we incorporate class-wise\ntoken embedding when updating the dual-generator. Moreover, we assign adequate\npseudo-labels of old classes to the background pixels in the new step images,\nfurther mitigating the forgetting of previously learned knowledge. Through\ncomprehensive experiments, our method demonstrates competitive performance\nacross mainstream benchmarks, striking a better balance between the performance\nof old and novel classes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:13:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chen","Jingfan",""],["Wang","Yuxi",""],["Wang","Pengfei",""],["Chen","Xiao",""],["Zhang","Zhaoxiang",""],["Lei","Zhen",""],["Li","Qing",""]]}
{"id":"2308.01128","submitter":"Yulong Gao","authors":"Yulong Gao, Qiusheng Gu, Guilin Liu, Hongxin Zhang, Yong Shi, Jing\n  Dou, Xiangdong Li, and Xu Kong","title":"Merger-induced star formation in low-metallicity dwarf galaxy NGC\n  4809/4810","comments":"13 pages, 12 figures; 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-sa/4.0/","abstract":"  The physical mechanisms driving starbursts in dwarf galaxies are unclear, and\nthe effects of mergers on star formation in these galaxies are still uncertain.\nWe explore how the merger process affects star formation in metal-poor dwarf\ngalaxies by analyzing high-spatial-resolution ($\\sim$ 70 pc) integral field\nspectrograph observations of ionized gas. We use archival data from the Very\nLarge Telescope/Multi Unit Spectroscopic Explorer to map the spatial\ndistribution of strong emission lines (e.g., $\\rm H\\beta$, $\\rm H\\alpha$, $\\rm\n[OIII]\\lambda5007$, $\\rm [NII]\\lambda6583$, etc) in the nearby merging\nstar-forming dwarf galaxy system NGC 4809/4810. We identify approximately 112\nstar-forming knots scattered among the two galaxies, where the gas-phase\nmetallicity distribution is inhomogeneous and mixing with metal-poor and\nmetal-rich ionized gas. Star-forming knots at the interacting region show lower\nmetallicity, the highest star formation rates (SFRs) and SFR to resolved\nmain-sequence-relation (rMSR) ratios. Ionized gas exhibits an obvious\nnortheast-southwest velocity gradient in NGC 4809, while seemingly mixed in NGC\n4810. High virial parameters and the stellar mass-size relation of HII regions\nindicate that these regions are dominated by direct radiation pressure from\nmassive stars/clusters and persistently expanding. We find two different\nstellar mass surface density-stellar age relations in NGC 4809 and NGC 4810,\nand the stellar ages of NGC 4810 are systematically younger than in NGC 4809.\nOur study suggests that the merging stage of two dwarf galaxies can induce\nstarburst activities at the interaction areas, despite the metal-deficient\nenvironment. Considering the high specific SFRs and different stellar ages, we\npropose that the interaction initially triggered star formation in NGC 4809 and\nthen drove star formation in NGC 4810.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:13:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gao","Yulong",""],["Gu","Qiusheng",""],["Liu","Guilin",""],["Zhang","Hongxin",""],["Shi","Yong",""],["Dou","Jing",""],["Li","Xiangdong",""],["Kong","Xu",""]]}
{"id":"2308.01129","submitter":"Nestor Colin","authors":"Nestor Colin, Rita Jim\\'enez Rolland and Miguel A. Xicot\\'encatl","title":"Periodicity of the pure mapping class group of non-orientable surfaces","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the pure mapping class group $\\mathcal{N}_{g}^{k}$ of a\nnon-orientable closed surface of genus $g\\geqslant 2$ with $k\\geqslant 1$\nmarked points has $p$-periodic cohomology for each odd prime $p$ for which\n$\\mathcal{N}_{g}^{k}$ has $p$-torsion. Using the Yagita invariant and the\ncohomology classes obtained by the representation of subgroups of order $p$, we\nobtain that the $p$-period is less than or equal to $4$ when $g\\geqslant 3$ and\n$k\\geqslant 1$. Moreover, combining the Nielsen realization theorem and a\ncharacterization of the $p$-period given in terms of normalizers and\ncentralizers of cyclic subgroups of order $p$, we show that the $p$-period of\n$\\mathcal{N}_{g}^{k}$ is bounded below by $4$, whenever $\\mathcal{N}_{g}^{k}$\nhas $p$-periodic cohomology, $g\\geqslant 3$ and $k\\geqslant 0$. These results\nprovide partial answers to questions proposed by G. Hope and U. Tillmann.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:13:48 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Colin","Nestor",""],["Rolland","Rita Jim\u00e9nez",""],["Xicot\u00e9ncatl","Miguel A.",""]]}
{"id":"2308.01130","submitter":"Fridrich Valach","authors":"Ondrej Hulik, Emanuel Malek, Fridrich Valach, Daniel Waldram","title":"Y-algebroids and $E_{7(7)} \\times \\mathbb{R}^+$-generalised geometry","comments":"19 pages","journal-ref":null,"doi":null,"report-no":"HU-EP-23/42, Imperial/TP/23/DW/1","categories":"hep-th math-ph math.DG math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define the notion of Y-algebroids, generalising the Lie, Courant, and\nexceptional algebroids that have been used to capture the local symmetry\nstructure of type II string theory and M-theory compactifications to $D \\geq 5$\ndimensions. Instead of an invariant inner product, or its generalisation\narising in exceptional algebroids, Y-algebroids are built around a specific\ntype of tensor, denoted $Y$, that provides exactly the necessary properties to\nalso describe compactifications to $D=4$ dimensions. We classify ``M-exact''\n$E_7$-algebroids and show that this precisely matches the form of the\ngeneralised tangent space of $E_{7(7)} \\times \\mathbb{R}^+$-generalised\ngeometry, with possible twists due to 1-, 4- and 7-form fluxes, corresponding\nphysically to the derivative of the warp factor and the M-theory fluxes. We\ntranslate the notion of generalised Leibniz parallelisable spaces, relevant to\nconsistent truncations, into this language, where they are mapped to so-called\nexceptional Manin pairs. We also show how to understand Poisson--Lie U-duality\nand exceptional complex structures using Y-algebroids.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:14:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hulik","Ondrej",""],["Malek","Emanuel",""],["Valach","Fridrich",""],["Waldram","Daniel",""]]}
{"id":"2308.01131","submitter":"Geoffrey Cruttwell","authors":"Geoffrey Cruttwell and Jean-Simon Pacaud Lemay","title":"Reverse tangent categories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Previous work has shown that reverse differential categories give an abstract\nsetting for gradient-based learning of functions between Euclidean spaces.\nHowever, reverse differential categories are not suited to handle\ngradient-based learning for functions between more general spaces such as\nsmooth manifolds. In this paper we propose a setting to handle this, which we\ncall reverse tangent categories: tangent categories with an involution\noperation for their differential bundles.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:14:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cruttwell","Geoffrey",""],["Lemay","Jean-Simon Pacaud",""]]}
{"id":"2308.01132","submitter":"Peymaneh Rafieipour","authors":"Peymaneh Rafieipour, Aminreza Mohandes, Mohammad Moaddeli, Mansour\n  Kanani","title":"Integrating transfer matrix method into SCAPS-1D for addressing optical\n  losses and per-layer optical properties in perovskite/Silicon tandem solar\n  cells","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  SCAPS-1D software ignores optical losses and recombination junction (RJ)\nlayer in studying tandem solar cells (TSCs). This paper presents an\noptoelectronic study of a perovskite/Silicon TSC, comparing the effects of\nusing two different methods of calculating filtered spectra on the photovoltaic\nperformance parameters of tandem device. It is shown that integrating transfer\nmatrix (TM) method into SCAPS-1D addresses per-layer optical losses and\nprovides a platform for optimizing the RJ layer in TSCs. Using Beer-Lambert\n(BL) method for calculating the filtered spectra transmitted from the\nperovskite top sub-cell is revealed to overestimate the cell efficiency by ~4%,\ndue to its inability to fully address optical losses. Also, the BL method fails\nto tackle any issues regarding optical improvement through ITO ad-layer on the\nRJ. Using TM formalism, the efficiency of the proposed perovskite/Silicon TSC\nis shown to be increased from 19.81% to 23.10%, by introducing the ITO ad-layer\non the RJ. It is the first time that the effect of filtered spectrum\ncalculation method is clearly investigated in simulating TSCs with SCAPS-1D.\nThe results pave the way to introduce the optical loss effects in SCAPS-1D and\ndemonstrate that the BL method that has been used before needs to be revised.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:18:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Rafieipour","Peymaneh",""],["Mohandes","Aminreza",""],["Moaddeli","Mohammad",""],["Kanani","Mansour",""]]}
{"id":"2308.01133","submitter":"Mayer Humi","authors":"T. Carter and M. Humi","title":"Determination of the Optimal Elliptical Trajectories Around the Earth\n  and Moon","comments":"21 pages 9 figs","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current space exploration programs call for the establishment of a permanent\nHuman presence on the Moon. This paper considers periodic orbits of a shuttle\nbetween the Earth and the Moon. Such a shuttle will be needed to bring supplies\nto the Moon outpost and carry back those resources that are in short supply on\nEarth. To keep this shuttle in permanent periodic orbit it must have a thruster\nthat forces it into an elliptical orbit from perigee near Earth to an apogee\njust beyond the Moon and back to perigee. The impacts of the Earth, Moon and\nSun gravity on this orbit are considered. For this model we determine the\neccentricity that minimizes the thrust requirements and the lunar $\\Delta\\, v$\nrequirements. We show that optimal placements of the eccentricity of the\nshuttle orbit can produce significant improvement in thrust (and fuel)\nrequirements.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:22:15 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Carter","T.",""],["Humi","M.",""]]}
{"id":"2308.01134","submitter":"Farzin Salek","authors":"Farzin Salek, Andreas Winter","title":"New Protocols for Conference Key and Multipartite Entanglement\n  Distillation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We approach two interconnected problems of quantum information processing in\nnetworks: Conference key agreement and entanglement distillation, both in the\nso-called source model where the given resource is a multipartite quantum state\nand the players interact over public classical channels to generate the desired\ncorrelation. The first problem is the distillation of a conference key when the\nsource state is shared between a number of legal players and an eavesdropper;\nthe eavesdropper, apart from starting off with this quantum side information,\nalso observes the public communication between the players. The second is the\ndistillation of Greenberger-Horne-Zeilinger (GHZ) states by means of local\noperations and classical communication (LOCC) from the given mixed state. These\nproblem settings extend our previous paper [IEEE Trans. Inf. Theory\n68(2):976-988, 2022], and we generalise its results: using a quantum version of\nthe task of communication for omniscience, we derive novel lower bounds on the\ndistillable conference key from any multipartite quantum state by means of\nnon-interacting communication protocols. Secondly, we establish novel lower\nbounds on the yield of GHZ states from multipartite mixed states. Namely, we\npresent two methods to produce bipartite entanglement between sufficiently many\nnodes so as to produce GHZ states. Next, we show that the conference key\nagreement protocol can be made coherent under certain conditions, enabling the\ndirect generation of multipartite GHZ states.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:23:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Salek","Farzin",""],["Winter","Andreas",""]]}
{"id":"2308.01135","submitter":"Francisco Munoz","authors":"J. Cabezas-Escares, N. F. Barrera, R. H. Lavroff, A. N. Alexandrova C.\n  Cardenas and F. Munoz","title":"Theoretical insight on the LK-99 material (Large update)","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/4.0/","abstract":"  Two recent preprints in the physics archive (arXiv) have called the attention\nas they claim experimental evidence that a Cu-substituted apatite material\n(called LK-99) exhibits superconductivity at room temperature and pressure. If\nthis proves to be true, LK-99 will be a ``holy grail\" of superconductors. In\nthis work, we used Density Functional Theory (DFT+U) calculations to elucidate\nsome key features of the electronic structure of LK-99. Although some aspects\nof our calculations are preliminary, we find two different phases of this\nmaterial: (i) a hexagonal lattice featuring metallic half-filled and spin-split\nbands, a nesting of the Fermi surface, a remarkably large electron-phonon\ncoupling, but this lattice is vibrationally unstable. (ii) a triclinic lattice,\nwith the Cu and surrounding O distorted. This lattice is vibrationally stable\nand its bands correspond to an insulator. In a crystal the Cu atoms should\noscillate between equivalent triclinic positions, with an average close to the\nhexagonal positions. We discuss the electronic structure expected from these\nfluctuations and if it is compatible with superconductivity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:28:10 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 12:51:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cabezas-Escares","J.",""],["Barrera","N. F.",""],["Lavroff","R. H.",""],["Cardenas","A. N. Alexandrova C.",""],["Munoz","F.",""]]}
{"id":"2308.01136","submitter":"Dimitrios Tsourounis","authors":"Dimitrios Tsourounis, Ilias Theodorakopoulos, Elias N. Zois and George\n  Economou","title":"Leveraging Expert Models for Training Deep Neural Networks in Scarce\n  Data Domains: Application to Offline Handwritten Signature Verification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper introduces a novel approach to leverage the knowledge of existing\nexpert models for training new Convolutional Neural Networks, on domains where\ntask-specific data are limited or unavailable. The presented scheme is applied\nin offline handwritten signature verification (OffSV) which, akin to other\nbiometric applications, suffers from inherent data limitations due to\nregulatory restrictions. The proposed Student-Teacher (S-T) configuration\nutilizes feature-based knowledge distillation (FKD), combining graph-based\nsimilarity for local activations with global similarity measures to supervise\nstudent's training, using only handwritten text data. Remarkably, the models\ntrained using this technique exhibit comparable, if not superior, performance\nto the teacher model across three popular signature datasets. More importantly,\nthese results are attained without employing any signatures during the feature\nextraction training process. This study demonstrates the efficacy of leveraging\nexisting expert models to overcome data scarcity challenges in OffSV and\npotentially other related domains.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:28:12 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tsourounis","Dimitrios",""],["Theodorakopoulos","Ilias",""],["Zois","Elias N.",""],["Economou","George",""]]}
{"id":"2308.01137","submitter":"Weronika Hryniewska-Guzik","authors":"Weronika Hryniewska-Guzik, Maria K\\k{e}dzierska, Przemys{\\l}aw Biecek","title":"Multi-task learning for classification, segmentation, reconstruction,\n  and detection on chest CT scans","comments":"presented at the Polish Conference on Artificial Intelligence\n  (PP-RAI), 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":"  Lung cancer and covid-19 have one of the highest morbidity and mortality\nrates in the world. For physicians, the identification of lesions is difficult\nin the early stages of the disease and time-consuming. Therefore, multi-task\nlearning is an approach to extracting important features, such as lesions, from\nsmall amounts of medical data because it learns to generalize better. We\npropose a novel multi-task framework for classification, segmentation,\nreconstruction, and detection. To the best of our knowledge, we are the first\nones who added detection to the multi-task solution. Additionally, we checked\nthe possibility of using two different backbones and different loss functions\nin the segmentation task.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:28:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hryniewska-Guzik","Weronika",""],["K\u0119dzierska","Maria",""],["Biecek","Przemys\u0142aw",""]]}
{"id":"2308.01138","submitter":"Haiwen Du Dr.","authors":"Haiwen Du, Zheng Ju, Yu An, Honghui Du, Dongjie Zhu, Zhaoshuo Tian,\n  Aonghus Lawlor, Ruihai Dong","title":"Can We Transfer Noise Patterns? A Multi-environment Spectrum Analysis\n  Model Using Generated Cases","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":"  Spectrum analysis systems in online water quality testing are designed to\ndetect types and concentrations of pollutants and enable regulatory agencies to\nrespond promptly to pollution incidents. However, spectral data-based testing\ndevices suffer from complex noise patterns when deployed in non-laboratory\nenvironments. To make the analysis model applicable to more environments, we\npropose a noise patterns transferring model, which takes the spectrum of\nstandard water samples in different environments as cases and learns the\ndifferences in their noise patterns, thus enabling noise patterns to transfer\nto unknown samples. Unfortunately, the inevitable sample-level baseline noise\nmakes the model unable to obtain the paired data that only differ in\ndataset-level environmental noise. To address the problem, we generate a\nsample-to-sample case-base to exclude the interference of sample-level noise on\ndataset-level noise learning, enhancing the system's learning performance.\nExperiments on spectral data with different background noises demonstrate the\ngood noise-transferring ability of the proposed method against baseline systems\nranging from wavelet denoising, deep neural networks, and generative models.\nFrom this research, we posit that our method can enhance the performance of DL\nmodels by generating high-quality cases. The source code is made publicly\navailable online at https://github.com/Magnomic/CNST.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:29:31 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 12:37:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Du","Haiwen",""],["Ju","Zheng",""],["An","Yu",""],["Du","Honghui",""],["Zhu","Dongjie",""],["Tian","Zhaoshuo",""],["Lawlor","Aonghus",""],["Dong","Ruihai",""]]}
{"id":"2308.01139","submitter":"Jiaojiao Zhang","authors":"Jiaojiao Zhang, Dominik Fay, and Mikael Johansson","title":"Dynamic Privacy Allocation for Locally Differentially Private Federated\n  Learning with Composite Objectives","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a locally differentially private federated learning\nalgorithm for strongly convex but possibly nonsmooth problems that protects the\ngradients of each worker against an honest but curious server. The proposed\nalgorithm adds artificial noise to the shared information to ensure privacy and\ndynamically allocates the time-varying noise variance to minimize an upper\nbound of the optimization error subject to a predefined privacy budget\nconstraint. This allows for an arbitrarily large but finite number of\niterations to achieve both privacy protection and utility up to a neighborhood\nof the optimal solution, removing the need for tuning the number of iterations.\nNumerical results show the superiority of the proposed algorithm over\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:30:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Jiaojiao",""],["Fay","Dominik",""],["Johansson","Mikael",""]]}
{"id":"2308.01140","submitter":"Siladittya Manna","authors":"Siladittya Manna, Soumitri Chattopadhyay, Rakesh Dey, Saumik\n  Bhattacharya, Umapada Pal","title":"DySTreSS: Dynamically Scaled Temperature in Self-Supervised Contrastive\n  Learning","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":"  In contemporary self-supervised contrastive algorithms like SimCLR, MoCo,\netc., the task of balancing attraction between two semantically similar samples\nand repulsion between two samples from different classes is primarily affected\nby the presence of hard negative samples. While the InfoNCE loss has been shown\nto impose penalties based on hardness, the temperature hyper-parameter is the\nkey to regulating the penalties and the trade-off between uniformity and\ntolerance. In this work, we focus our attention to improve the performance of\nInfoNCE loss in SSL by studying the effect of temperature hyper-parameter\nvalues. We propose a cosine similarity-dependent temperature scaling function\nto effectively optimize the distribution of the samples in the feature space.\nWe further analyze the uniformity and tolerance metrics to investigate the\noptimal regions in the cosine similarity space for better optimization.\nAdditionally, we offer a comprehensive examination of the behavior of local and\nglobal structures in the feature space throughout the pre-training phase, as\nthe temperature varies. Experimental evidence shows that the proposed framework\noutperforms or is at par with the contrastive loss-based SSL algorithms. We\nbelieve our work (DySTreSS) on temperature scaling in SSL provides a foundation\nfor future research in contrastive learning.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:31:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Manna","Siladittya",""],["Chattopadhyay","Soumitri",""],["Dey","Rakesh",""],["Bhattacharya","Saumik",""],["Pal","Umapada",""]]}
{"id":"2308.01141","submitter":"Majid Haghparast","authors":"Majid Haghparast, Tommi Mikkonen, Jukka K. Nurminen, Vlad Stirbu","title":"Quantum Software Engineering Challenges from Developers' Perspective:\n  Mapping Research Challenges to the Proposed Workflow Model","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the increasing interest in quantum computing, the aspect of\ndevelopment to achieve cost-effective and reliable quantum software\napplications has been slow. One barrier is the software engineering of quantum\nprograms, which can be approached from two directions. On the one hand, many\nsoftware engineering practices, debugging in particular, are bound to classical\ncomputing. On the other hand, quantum programming is closely associated with\nthe phenomena of quantum physics, and consequently, the way we express programs\nresembles the early days of programming. Moreover, much of the software\nengineering research today focuses on agile development, where computing cycles\nare cheap and new software can be rapidly deployed and tested, whereas in the\nquantum context, executions may consume lots of energy, and test runs may\nrequire lots of work to interpret. In this paper, we aim at bridging this gap\nby starting with the quantum computing workflow and by mapping existing\nsoftware engineering research to this workflow. Based on the mapping, we then\nidentify directions for software engineering research for quantum computing.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:32:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Haghparast","Majid",""],["Mikkonen","Tommi",""],["Nurminen","Jukka K.",""],["Stirbu","Vlad",""]]}
{"id":"2308.01142","submitter":"Junyan Zhang","authors":"Jiawei Wang, Junyan Zhang","title":"Incompressible Limit of Compressible Ideal MHD Flows inside a Perfectly\n  Conducting Wall","comments":"28 pages. Typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the incompressible limit of compressible ideal\nmagnetohydrodynamic(MHD) flows in a reference domain where the magnetic field\nis tangential to the boundary. Unlike the case of transversal magnetic fields,\nthe linearized problem of our case is not well-posed in standard Sobolev space\n$H^m~(m\\geq 2)$, while the incompressible problem is still well-posed in $H^m$.\nThe key observation to overcome the difficulty is a hidden structure\ncontributed by Lorentz force in the vorticity analysis, which reveals that one\nshould trade one normal derivative for two tangential derivatives together with\na gain of Mach number weight $\\varepsilon^2$. Thus, the energy functional\nshould be defined by using suitable anisotropic Sobolev spaces. The weights of\nMach number should be carefully chosen according to the number of tangential\nderivatives, such that the energy estimates are uniform in Mach number.\nBesides, part of the proof is similar to the study of compressible water waves,\nso our result opens the possibility to study the incompressible limit of\nfree-boundary problems in ideal MHD.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:32:35 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 13:40:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jiawei",""],["Zhang","Junyan",""]]}
{"id":"2308.01143","submitter":"Kanzhi Cheng","authors":"Kanzhi Cheng, Zheng Ma, Shi Zong, Jianbing Zhang, Xinyu Dai, Jiajun\n  Chen","title":"ADS-Cap: A Framework for Accurate and Diverse Stylized Captioning with\n  Unpaired Stylistic Corpora","comments":"Accepted at Natural Language Processing and Chinese Computing (NLPCC)\n  2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generating visually grounded image captions with specific linguistic styles\nusing unpaired stylistic corpora is a challenging task, especially since we\nexpect stylized captions with a wide variety of stylistic patterns. In this\npaper, we propose a novel framework to generate Accurate and Diverse Stylized\nCaptions (ADS-Cap). Our ADS-Cap first uses a contrastive learning module to\nalign the image and text features, which unifies paired factual and unpaired\nstylistic corpora during the training process. A conditional variational\nauto-encoder is then used to automatically memorize diverse stylistic patterns\nin latent space and enhance diversity through sampling. We also design a simple\nbut effective recheck module to boost style accuracy by filtering\nstyle-specific captions. Experimental results on two widely used stylized image\ncaptioning datasets show that regarding consistency with the image, style\naccuracy and diversity, ADS-Cap achieves outstanding performances compared to\nvarious baselines. We finally conduct extensive analyses to understand the\neffectiveness of our method. Our code is available at\nhttps://github.com/njucckevin/ADS-Cap.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:33:20 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cheng","Kanzhi",""],["Ma","Zheng",""],["Zong","Shi",""],["Zhang","Jianbing",""],["Dai","Xinyu",""],["Chen","Jiajun",""]]}
{"id":"2308.01144","submitter":"Tao Xu","authors":"Tao Xu, Wang Xi, and Jianping He","title":"Optimal Mixed Strategies to the Zero-sum Linear Differential Game","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 exploits the weak approximation method to study a zero-sum linear\ndifferential game under mixed strategies. The stochastic nature of mixed\nstrategies poses challenges in evaluating the game value and deriving the\noptimal strategies. To overcome these challenges, we first define the mixed\nstrategy based on time discretization given the control period $\\delta$. Then,\nwe design a stochastic differential equation (SDE) to approximate the\ndiscretized game dynamic with a small approximation error of scale\n$\\mathcal{O}(\\delta^2)$ in the weak sense. Moreover, we prove that the game\npayoff is also approximated in the same order of accuracy. Next, we solve the\noptimal mixed strategies and game values for the linear quadratic differential\ngames. The effect of the control period is explicitly analyzed when the payoff\nis a terminal cost. Our results provide the first implementable form of the\noptimal mixed strategies for a zero-sum linear differential game. Finally, we\nprovide numerical examples to illustrate and elaborate on our results.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:33:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Xu","Tao",""],["Xi","Wang",""],["He","Jianping",""]]}
{"id":"2308.01145","submitter":"Georgia Pierrou","authors":"Georgia Pierrou and Gabriela Hug","title":"Integrating Optimal EV Charging in the Energy Management of Electric\n  Railway Stations","comments":"to appear in IEEE PowerTech, Belgrade, Serbia, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, an electric railway Energy Management System (EMS) with\nintegration of an Energy Storage System (ESS), Regenerative Braking Energy\n(RBE), and renewable generation is proposed to minimize the daily operating\ncosts of the railway station while meeting railway and Electric Vehicle (EV)\ncharging demand. Compared to other railway EMS methods, the proposed approach\nintegrates an optimal EV charging policy at the railway station to avoid high\npower demand due to charging requirements. Specifically, receding horizon\ncontrol is leveraged to minimize the daily peak power spent on EV charging. The\nnumerical study on an actual railway station in Chur, Switzerland shows that\nthe proposed method that integrates railway demand and optimal EV charging\nalong with ESS, RBE, and renewable generation can significantly reduce the\naverage daily operating cost of the railway station over a large number of\ndifferent scenarios while ensuring that peak load capacity limits are\nrespected.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:37:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Pierrou","Georgia",""],["Hug","Gabriela",""]]}
{"id":"2308.01146","submitter":"Qingsong Xu","authors":"Qingsong Xu, Yilei Shi, Jianhua Guo, Chaojun Ouyang, Xiao Xiang Zhu","title":"UCDFormer: Unsupervised Change Detection Using a Transformer-driven\n  Image Translation","comments":"16 pages, 7 figures, IEEE Transactions on Geoscience and Remote\n  Sensing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Change detection (CD) by comparing two bi-temporal images is a crucial task\nin remote sensing. With the advantages of requiring no cumbersome labeled\nchange information, unsupervised CD has attracted extensive attention in the\ncommunity. However, existing unsupervised CD approaches rarely consider the\nseasonal and style differences incurred by the illumination and atmospheric\nconditions in multi-temporal images. To this end, we propose a change detection\nwith domain shift setting for remote sensing images. Furthermore, we present a\nnovel unsupervised CD method using a light-weight transformer, called\nUCDFormer. Specifically, a transformer-driven image translation composed of a\nlight-weight transformer and a domain-specific affinity weight is first\nproposed to mitigate domain shift between two images with real-time efficiency.\nAfter image translation, we can generate the difference map between the\ntranslated before-event image and the original after-event image. Then, a novel\nreliable pixel extraction module is proposed to select significantly\nchanged/unchanged pixel positions by fusing the pseudo change maps of fuzzy\nc-means clustering and adaptive threshold. Finally, a binary change map is\nobtained based on these selected pixel pairs and a binary classifier.\nExperimental results on different unsupervised CD tasks with seasonal and style\nchanges demonstrate the effectiveness of the proposed UCDFormer. For example,\ncompared with several other related methods, UCDFormer improves performance on\nthe Kappa coefficient by more than 12\\%. In addition, UCDFormer achieves\nexcellent performance for earthquake-induced landslide detection when\nconsidering large-scale applications. The code is available at\n\\url{https://github.com/zhu-xlab/UCDFormer}\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:39:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Xu","Qingsong",""],["Shi","Yilei",""],["Guo","Jianhua",""],["Ouyang","Chaojun",""],["Zhu","Xiao Xiang",""]]}
{"id":"2308.01147","submitter":"Kailun Yang","authors":"Guojin Zhong, Jin Yuan, Pan Wang, Kailun Yang, Weili Guan, Zhiyong Li","title":"Contrast-augmented Diffusion Model with Fine-grained Sequence Alignment\n  for Markup-to-Image Generation","comments":"Accepted to ACM MM 2023. The code will be released at\n  https://github.com/zgj77/FSACDM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recently rising markup-to-image generation poses greater challenges as\ncompared to natural image generation, due to its low tolerance for errors as\nwell as the complex sequence and context correlations between markup and\nrendered image. This paper proposes a novel model named \"Contrast-augmented\nDiffusion Model with Fine-grained Sequence Alignment\" (FSA-CDM), which\nintroduces contrastive positive/negative samples into the diffusion model to\nboost performance for markup-to-image generation. Technically, we design a\nfine-grained cross-modal alignment module to well explore the sequence\nsimilarity between the two modalities for learning robust feature\nrepresentations. To improve the generalization ability, we propose a\ncontrast-augmented diffusion model to explicitly explore positive and negative\nsamples by maximizing a novel contrastive variational objective, which is\nmathematically inferred to provide a tighter bound for the model's\noptimization. Moreover, the context-aware cross attention module is developed\nto capture the contextual information within markup language during the\ndenoising process, yielding better noise prediction results. Extensive\nexperiments are conducted on four benchmark datasets from different domains,\nand the experimental results demonstrate the effectiveness of the proposed\ncomponents in FSA-CDM, significantly exceeding state-of-the-art performance by\nabout 2%-12% DTW improvements. The code will be released at\nhttps://github.com/zgj77/FSACDM.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:43:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhong","Guojin",""],["Yuan","Jin",""],["Wang","Pan",""],["Yang","Kailun",""],["Guan","Weili",""],["Li","Zhiyong",""]]}
{"id":"2308.01148","submitter":"Daniele Paesani","authors":"C. Cantone, S. Carsi, S. Ceravolo, E. Di Meco, E. Diociaiuti, I.\n  Frank, S. Kholodenko, S. Martellotti, M. Mirra, P. Monti-Guarnieri, M.\n  Moulson, D. Paesani, M. Prest, M. Romagnoni, I. Sarra, F. Sgarbossa, M.\n  Soldani, E. Vallazza","title":"Beam test, simulation, and performance evaluation of PbF$_2$ and PWO-UF\n  crystals with SiPM readout for a semi-homogeneous calorimeter prototype with\n  longitudinal segmentation","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":"  Crilin (Crystal Calorimeter with Longitudinal Information) is a\nsemi-homogeneous, longitudinally segmented electromagnetic calorimeter based on\nhigh-$Z$, ultra-fast crystals with UV-extended SiPM readout. The Crilin design\nhas been proposed as a candidate solution for both a future Muon Collider\nbarrel ECAL and for the Small Angle Calorimeter of the HIKE experiment. As a\npart of the Crilin development program, we have carried out beam tests of small\n($10\\times10\\times40$~mm$^3$) lead fluoride (PbF$_2$) and ultra-fast lead\ntungstate (PbWO$_4$, PWO) crystals with 120~GeV electrons at the CERN SPS to\nstudy the light yield, timing response, and systematics of light collection\nwith a proposed readout scheme. For a single crystal of PbF$_2$, corresponding\nto a single Crilin cell, a time resolution of better than 25~ps is obtained for\n$>$3 GeV of deposited energy. For a single cell of \\pwo, a time resolution of\nbetter than 45~ps is obtained for the same range of deposited energy. This\ntiming performance fully satisfies the design requirements for the Muon\nCollider and HIKE experiments. Further optimizations of the readout scheme and\ncrystal surface preparation are expected to bring further improvements.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:46:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cantone","C.",""],["Carsi","S.",""],["Ceravolo","S.",""],["Di Meco","E.",""],["Diociaiuti","E.",""],["Frank","I.",""],["Kholodenko","S.",""],["Martellotti","S.",""],["Mirra","M.",""],["Monti-Guarnieri","P.",""],["Moulson","M.",""],["Paesani","D.",""],["Prest","M.",""],["Romagnoni","M.",""],["Sarra","I.",""],["Sgarbossa","F.",""],["Soldani","M.",""],["Vallazza","E.",""]]}
{"id":"2308.01149","submitter":"Jagannath Santara","authors":"Chethan N. Gowdigere, Sachin Kala, Jagannath Santara","title":"Classifying three-character RCFTs with Wronskian index equalling 3 or 4","comments":"64 pages, 20 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the Mathur-Mukhi-Sen (MMS) classification scheme for rational conformal\nfield theories (RCFTs), a RCFT is identified by a pair of non-negative integers\n$\\mathbf{[n, \\ell]}$, with $\\mathbf{n}$ being the number of characters and\n$\\mathbf{\\ell}$ the Wronskian index. The modular linear differential equation\n(MLDE) that the characters of a RCFT solve are labelled similarly. All RCFTs\nwith a given $\\mathbf{[n, \\ell]}$ solve the modular linear differential\nequation (MLDE) labelled by the same $\\mathbf{[n, \\ell]}$. With the goal of\nclassifying $\\mathbf{[3,3]}$ and $\\mathbf{[3,4]}$ CFTs, we set-up and solve\nthose MLDEs, each of which is a three-parameter non-rigid MLDE, for\ncharacter-like solutions. In the former case, we obtain four infinite families\nand a discrete set of $15$ solutions, all in the range $0 < c \\leq 32$. Amongst\nthese $\\mathbf{[3,3]}$ character-like solutions, we find pairs of them that\nform coset-bilinear relations with meromorphic CFTs/characters of central\ncharges $16, 24, 32, 40, 48, 56, 64$. There are six families of coset-bilinear\nrelations where both the RCFTs of the pair are drawn from the infinite families\nof solutions. There are an additional $23$ coset-bilinear relations between\ncharacter-like solutions of the discrete set. The coset-bilinear relations\nshould help in identifying the $\\mathbf{[3,3]}$ CFTs. In the $\\mathbf{[3,4]}$\ncase, we obtain nine character-like solutions each of which is a\n$\\mathbf{[2,2]}$ character-like solution adjoined with a constant character.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:49:12 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gowdigere","Chethan N.",""],["Kala","Sachin",""],["Santara","Jagannath",""]]}
{"id":"2308.01150","submitter":"James Kerlidis","authors":"Peter Braunsteins, Sophie Hautphenne, James Kerlidis","title":"Linking Population-Size-Dependent and Controlled Branching Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Population-size dependent branching processes (PSDBP) and controlled\nbranching processes (CBP) are two classes of branching processes widely used to\nmodel biological populations that exhibit logistic growth. In this paper we\ndevelop connections between the two, with the ultimate goal of determining when\na population is more appropriately modelled with a PSDBP or a CBP. In\nparticular, we state conditions for the existence of equivalent PSDBPs and\nCBPs, we then consider the subclass of CBPs with deterministic control\nfunctions (DCBPs), stating a necessary and sufficient condition for DCBP-PSDBP\nequivalence. Finally, we derive an upper bound on the total variation distance\nbetween non-equivalent DCBPs and PSDBPs with matching first and second moments\nand equal initial population size, and show that under certain conditions this\nbound tends to zero as the initial population size becomes large.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:50:38 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Braunsteins","Peter",""],["Hautphenne","Sophie",""],["Kerlidis","James",""]]}
{"id":"2308.01151","submitter":"Fabian Rupp","authors":"Anna Dall'Acqua, Gaspard Jankowiak, Leonie Langer, Fabian Rupp","title":"Conservation, convergence, and computation for evolving heterogeneous\n  elastic wires","comments":"34 pages, 13 figures. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.NA math.DG math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The elastic energy of a bending-resistant interface depends both on its\ngeometry and its material composition. We consider such a heterogeneous\ninterface in the plane, modeled by a curve equipped with an additional density\nfunction. The resulting energy captures the complex interplay between curvature\nand density effects, resembling the Canham-Helfrich functional. We describe the\ncurve by its inclination angle, so that the equilibrium equations reduce to an\nelliptic system of second order. After a brief variational discussion, we\ninvestigate the associated nonlocal $L^2$-gradient flow evolution, a coupled\nquasilinear parabolic problem. We analyze the (non)preservation of quantities\nsuch as convexity, positivity, and symmetry, as well as the asymptotic behavior\nof the system. The results are illustrated by numerical experiments.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:50:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Dall'Acqua","Anna",""],["Jankowiak","Gaspard",""],["Langer","Leonie",""],["Rupp","Fabian",""]]}
{"id":"2308.01152","submitter":"Jo\\\"el Ouaknine","authors":"Florian Luca, James Maynard, Armand Noubissie, Jo\\\"el Ouaknine, James\n  Worrell","title":"Skolem Meets Bateman-Horn","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Skolem Problem asks to determine whether a given integer linear\nrecurrence sequence has a zero term. This problem arises across a wide range of\ntopics in computer science, including loop termination, (weighted) automata\ntheory, and the analysis of linear dynamical systems, amongst many others.\nDecidability of the Skolem Problem is notoriously open. The state of the art is\na decision procedure for recurrences of order at most 4: an advance achieved\nsome 40 years ago based on Baker's theorem on linear forms in logarithms of\nalgebraic numbers.\n  Recently, a new approach to the Skolem Problem was initiated via the notion\nof a Universal Skolem Set: a set $\\mathbf{S}$ of positive integers such that it\nis decidable whether a given non-degenerate linear recurrence sequence has a\nzero in $\\mathbf{S}$. Clearly, proving decidability of the Skolem Problem is\nequivalent to showing that $\\mathbb{N}$ is a Universal Skolem Set. The main\ncontribution of the present paper is to exhibit a Universal Skolem Set of\npositive density that moreover has density one subject to the Bateman-Horn\nconjecture in number theory. The latter is a central unifying hypothesis\nconcerning the frequency of prime numbers among the values of systems of\npolynomials, and provides a far-reaching generalisation of many classical\nresults and conjectures on the distribution of primes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:57:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Luca","Florian",""],["Maynard","James",""],["Noubissie","Armand",""],["Ouaknine","Jo\u00ebl",""],["Worrell","James",""]]}
{"id":"2308.01153","submitter":"Mirco Piccinini","authors":"Giampiero Palatucci, Mirco Piccinini, Letizia Temperini","title":"Struwe's Global Compactness and energy approximation of the critical\n  Sobolev embedding in the Heisenberg group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate some of the effects of the lack of compactness in the critical\nFolland-Stein-Sobolev embedding in very general (possible non-smooth) domains,\nby proving via De Giorgi's $\\Gamma$-convergence techniques that optimal\nfunctions for a natural subcritical approximations of the Sobolev quotient\nconcentrate energy at one point. In the second part of the paper, we try to\nrestore the compactness by extending the celebrated Global Compactness result\nto the Heisenberg group via a completely different approach with respect to the\noriginal one by Struwe (Math. Z. 1984).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:57:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Palatucci","Giampiero",""],["Piccinini","Mirco",""],["Temperini","Letizia",""]]}
{"id":"2308.01154","submitter":"Matteo Ferrara","authors":"Davide Maltoni and Matteo Ferrara","title":"Arithmetic with Language Models: from Memorization to Computation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A better understanding of the emergent computation and problem-solving\ncapabilities of recent large language models is of paramount importance to\nfurther improve them and broaden their applicability. This work investigates\nhow a language model, trained to predict the next token, can perform arithmetic\ncomputations generalizing beyond training data. Binary addition and\nmultiplication constitute a good testbed for this purpose, since they require a\nvery small vocabulary and exhibit relevant input/output discontinuities making\nsmooth input interpolation ineffective for novel data. We successfully trained\na light language model to learn these tasks and ran a number of experiments to\ninvestigate the extrapolation capabilities and internal information processing.\nOur findings support the hypotheses that the language model works as an\nEncoding-Regression-Decoding machine where the computation takes place in the\nvalue space once the input token representation is mapped to an appropriate\ninternal representation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:58:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Maltoni","Davide",""],["Ferrara","Matteo",""]]}
{"id":"2308.01155","submitter":"Akash Biswas","authors":"Akash Biswas, Bidya Binay Karak, and Pawan Kumar","title":"Exploring the reliability of polar field rise rate as a precursor for an\n  early prediction of solar cycle","comments":"Under review in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prediction of the strength of an upcoming solar cycle has been a\nlong-standing challenge in the field of solar physics. The inherent stochastic\nnature of the underlying solar dynamo makes the strength of the solar cycle\nvary in a wide range. Till now, the polar precursor methods and the dynamo\nsimulations, that use the strength of the polar field at the cycle minimum to\npredict the strength of the following cycle has gained reasonable consensus by\nproviding convergence in the predictions for solar cycles 24 and 25. Recently,\nit has been shown that just by using the observed correlation of the polar\nfield rise rate with the peak of the polar field at the cycle minimum and the\namplitude of the following cycle, a reliable prediction can be made much\nearlier than the cycle minimum. In this work, we perform surface flux transport\n(SFT) simulations to explore the robustness of this correlation against the\nstochastic fluctuations of BMR tilt properties including anti-Joy and anti-Hale\ntype anomalous BMRs, and against the variation of meridional flow speed. We\nfind that the observed correlation is a robust feature of the solar cycles and\nthus it can be utilized for a reliable prediction of solar cycle much earlier\nthan the cycle minimum, the usual landmark of the solar cycle prediction.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:59:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Biswas","Akash",""],["Karak","Bidya Binay",""],["Kumar","Pawan",""]]}
{"id":"2308.01156","submitter":"Fr\\'ed\\'eric Ouimet","authors":"Karine Bertin, Nicolas Klutchnikoff, Fr\\'ed\\'eric Ouimet","title":"A new adaptive local polynomial density estimation procedure on\n  complicated domains","comments":"35 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.AP stat.ME stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel approach for pointwise estimation of multivariate\ndensity functions on known domains of arbitrary dimensions using nonparametric\nlocal polynomial estimators. Our method is highly flexible, as it applies to\nboth simple domains, such as open connected sets, and more complicated domains\nthat are not star-shaped around the point of estimation. This enables us to\nhandle domains with sharp concavities, holes, and local pinches, such as\npolynomial sectors. Additionally, we introduce a data-driven selection rule\nbased on the general ideas of Goldenshluger and Lepski. Our results demonstrate\nthat the local polynomial estimators are minimax under a $L^2$ risk across a\nwide range of H\\\"older-type functional classes. In the adaptive case, we\nprovide oracle inequalities and explicitly determine the convergence rate of\nour statistical procedure. Simulations on polynomial sectors show that our\noracle estimates outperform those of the most popular alternative method, found\nin the sparr package for the R software. Our statistical procedure is\nimplemented in an online R package which is readily accessible.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:59:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bertin","Karine",""],["Klutchnikoff","Nicolas",""],["Ouimet","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.01157","submitter":"Benjamin Lengerich","authors":"Benjamin J. Lengerich, Sebastian Bordt, Harsha Nori, Mark E. Nunnally,\n  Yin Aphinyanaphongs, Manolis Kellis, Rich Caruana","title":"LLMs Understand Glass-Box Models, Discover Surprises, and Suggest\n  Repairs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We show that large language models (LLMs) are remarkably good at working with\ninterpretable models that decompose complex outcomes into univariate\ngraph-represented components. By adopting a hierarchical approach to reasoning,\nLLMs can provide comprehensive model-level summaries without ever requiring the\nentire model to fit in context. This approach enables LLMs to apply their\nextensive background knowledge to automate common tasks in data science such as\ndetecting anomalies that contradict prior knowledge, describing potential\nreasons for the anomalies, and suggesting repairs that would remove the\nanomalies. We use multiple examples in healthcare to demonstrate the utility of\nthese new capabilities of LLMs, with particular emphasis on Generalized\nAdditive Models (GAMs). Finally, we present the package $\\texttt{TalkToEBM}$ as\nan open-source LLM-GAM interface.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:59:35 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 17:06:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lengerich","Benjamin J.",""],["Bordt","Sebastian",""],["Nori","Harsha",""],["Nunnally","Mark E.",""],["Aphinyanaphongs","Yin",""],["Kellis","Manolis",""],["Caruana","Rich",""]]}
{"id":"2308.01158","submitter":"Anindya Maiti","authors":"Scott Seidenberger, Alec Sokol, Anindya Maiti","title":"Stake Your Claim: Zero-Trust Validator Deployment Leveraging NFTs and\n  Smart Contracts in Proof-of-Stake Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present a novel method for a multi-party, zero-trust validator\ninfrastructure deployment arrangement via smart contracts to secure\nProof-of-Stake (PoS) blockchains. The proposed arrangement architecture employs\na combination of non-fungible tokens (NFTs), a treasury contract, and validator\nsmart contract wallets to facilitate trustless participation in staking\nmechanisms. The NFT minting process allows depositors to exchange their capital\nfor an NFT representing their stake in a validator, while the treasury contract\nmanages the registry of NFT holders and handles rewards distribution. Validator\nsmart contract wallets are employed to create a trustless connection between\nthe validator operator and the treasury, enabling autonomous staking and\nunstaking processes based on predefined conditions. In addition, the proposed\nsystem incorporates protection mechanisms for depositors, such as triggered\nexits in case of non-payment of rewards and a penalty payout from the validator\noperator. The arrangement benefits from the extensibility and interoperability\nof web3 technologies, with potential applications in the broader digital\necosystem. This zero-trust staking mechanism aims to serve users who desire\nincreased privacy, trust, and flexibility in managing their digital wealth,\nwhile promoting greater decentralization and transparency in the PoS ecosystem.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:04:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Seidenberger","Scott",""],["Sokol","Alec",""],["Maiti","Anindya",""]]}
{"id":"2308.01159","submitter":"Amnon Aharony","authors":"O. Entin-Wohlman, R. I. Shekhter, M. Jonson, and A. Aharony","title":"Magnetizing a BCS superconductor by spin-dependent tunneling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spin-dependent electron tunneling through a voltage-biased micro-constriction\nbetween two bulk superconductors is shown to create a static magnetization near\nthe constriction and an ac Josephson-like spin current. Although spin-dependent\ntunneling generates quantum spin fluctuations even in the absence of a bias,\nthe formation of spin-triplet Cooper pairs necessary for the creation of\nmagnetization is blocked by destructive interference between different\nquasi-electron and quasi-hole tunneling channels, unless there is an asymmetry\nbetween the tunneling densities of states for electrons and holes. Breaking the\nsymmetry in the electron-hole tunnel density of states and creating\nelectron-hole tunneling imbalance by biasing the device destroys the\ndestructive interference and enables triplet Cooper-pair formation. As a\nresult, magnetizing the superconductor becomes possible. The role of the\nvoltage in lifting the blockade hindering the spin-triplet Cooper pair\nformation is an example of an electrically-controlled dissipation-less\nspintronic phenomenon.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:05:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Entin-Wohlman","O.",""],["Shekhter","R. I.",""],["Jonson","M.",""],["Aharony","A.",""]]}
{"id":"2308.01160","submitter":"Amedeo Balbi","authors":"Amedeo Balbi and Adam Frank","title":"The Oxygen Bottleneck for Technospheres","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph physics.pop-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  On Earth, the development of technology required easy access to open air\ncombustion, which is only possible when oxygen partial pressure, P(O$_2$), is\nabove 18\\%. This suggests that only planets with significant atmospheric oxygen\nconcentrations will be capable of developing ``advanced'' technospheres and\nhence detectable technosignatures.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:06:04 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Balbi","Amedeo",""],["Frank","Adam",""]]}
{"id":"2308.01161","submitter":"Anton Zabrodin","authors":"A. Zabrodin","title":"Tau-function of the multi-component CKP hierarchy","comments":"14 pages, no figures. arXiv admin note: text overlap with\n  arXiv:2103.07357","journal-ref":null,"doi":null,"report-no":"ITEP-TH-18/23","categories":"nlin.SI math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove existence of the tau-function for the multi-component CKP hierarchy\nand find how it is related to the tau-function of the multi-component KP\nhierarchy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:07:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zabrodin","A.",""]]}
{"id":"2308.01162","submitter":"Jonas St\\\"ober","authors":"Jonas St\\\"ober, Arnd B\\\"acker, Roland Ketzmerick","title":"Quantum transport through partial barriers in higher-dimensional systems","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Partial transport barriers in the chaotic sea of Hamiltonian systems\ninfluence classical transport, as they allow for a small flux between chaotic\nphase-space regions only. We establish for higher-dimensional systems that\nquantum transport through such a partial barrier follows a universal transition\nfrom quantum suppression to mimicking classical transport. The scaling\nparameter involves the flux, the size of a Planck cell, and the localization\nlength due to dynamical localization along a resonance channel. This is\nnumerically demonstrated for coupled kicked rotors with a partial barrier that\ngeneralizes a cantorus to higher dimensions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:07:15 GMT"}],"update_date":"2023-08-03","authors_parsed":[["St\u00f6ber","Jonas",""],["B\u00e4cker","Arnd",""],["Ketzmerick","Roland",""]]}
{"id":"2308.01163","submitter":"Yuri Nakao","authors":"Yuri Nakao, Takuya Yokota","title":"Stakeholder-in-the-Loop Fair Decisions: A Framework to Design Decision\n  Support Systems in Public and Private Organizations","comments":null,"journal-ref":null,"doi":"10.1007/978-3-031-35969-9_3","report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the opacity of machine learning technology, there is a need for\nexplainability and fairness in the decision support systems used in public or\nprivate organizations. Although the criteria for appropriate explanations and\nfair decisions change depending on the values of those who are affected by the\ndecisions, there is a lack of discussion framework to consider the appropriate\noutputs for each stakeholder. In this paper, we propose a discussion framework\nthat we call \"stakeholder-in-the-loop fair decisions.\" This is proposed to\nconsider the requirements for appropriate explanations and fair decisions. We\nidentified four stakeholders that need to be considered to design accountable\ndecision support systems and discussed how to consider the appropriate outputs\nfor each stakeholder by referring to our works. By clarifying the\ncharacteristics of specific stakeholders in each application domain and\nintegrating the stakeholders' values into outputs that all stakeholders agree\nupon, decision support systems can be designed as systems that ensure\naccountable decision makings.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:07:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nakao","Yuri",""],["Yokota","Takuya",""]]}
{"id":"2308.01164","submitter":"Lingxiao Meng","authors":"Lingxiao Meng, Jiangshan Liu, Wei Chai, Jiankun Wang, Max Q.-H. Meng","title":"Virtual Reality Based Robot Teleoperation via Human-Scene Interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robot teleoperation gains great success in various situations, including\nchemical pollution rescue, disaster relief, and long-distance manipulation. In\nthis article, we propose a virtual reality (VR) based robot teleoperation\nsystem to achieve more efficient and natural interaction with humans in\ndifferent scenes. A user-friendly VR interface is designed to help users\ninteract with a desktop scene using their hands efficiently and intuitively. To\nimprove user experience and reduce workload, we simulate the process in the\nphysics engine to help build a preview of the scene after manipulation in the\nvirtual scene before execution. We conduct experiments with different users and\ncompare our system with a direct control method across several teleoperation\ntasks. The user study demonstrates that the proposed system enables users to\nperform operations more instinctively with a lighter mental workload. Users can\nperform pick-and-place and object-stacking tasks in a considerably short time,\neven for beginners. Our code is available at\nhttps://github.com/lingxiaomeng/VR_Teleoperation_Gen3.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:08:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Meng","Lingxiao",""],["Liu","Jiangshan",""],["Chai","Wei",""],["Wang","Jiankun",""],["Meng","Max Q. -H.",""]]}
{"id":"2308.01165","submitter":"Daniele Nantes-Sobrinho","authors":"Joseph W. N. Paulus, Jorge A. P\\'erez, Daniele Nantes-Sobrinho","title":"Termination in Concurrency, Revisited","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Termination is a central property in sequential programming models: a term is\nterminating if all its reduction sequences are finite. Termination is also\nimportant in concurrency in general, and for message-passing programs in\nparticular. A variety of type systems that enforce termination by typing have\nbeen developed. In this paper, we rigorously compare several type systems for\n$\\pi$-calculus processes from the unifying perspective of termination. Adopting\nsession types as reference framework, we consider two different type systems:\none follows Deng and Sangiorgi's weight-based approach; the other is Caires and\nPfenning's Curry-Howard correspondence between linear logic and session types.\nOur technical results precisely connect these very different type systems, and\nshed light on the classes of client/server interactions they admit as correct.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:09:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Paulus","Joseph W. N.",""],["P\u00e9rez","Jorge A.",""],["Nantes-Sobrinho","Daniele",""]]}
{"id":"2308.01166","submitter":"Hosho Katsura","authors":"Shunta Kitahama, Hironobu Yoshida, Ryo Toyota, Hosho Katsura","title":"Jordan Decomposition of Non-Hermitian Fermionic Quadratic Forms","comments":"11 pages, no 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":"  We give a rigorous proof of Conjecture 3.1 by Prosen [Prosen T 2010 J. Stat.\nMech. $\\textbf{2010}$ P07020] on the nilpotent part of the Jordan decomposition\nof a quadratic fermionic Liouvillian. We also show that the number of the\nJordan blocks of each size can be expressed in terms of the coefficients of a\npolynomial called the $q$-binomial coefficient and describe the procedure to\nobtain the Jordan canonical form of the nilpotent part.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:12:14 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 15:43:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kitahama","Shunta",""],["Yoshida","Hironobu",""],["Toyota","Ryo",""],["Katsura","Hosho",""]]}
{"id":"2308.01167","submitter":"Santosh Kumar Das","authors":"Santosh K. Das","title":"Open heavy flavors: Theory","comments":"Hard Probes 2023 conference proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A brief overview of the theory of open heavy flavor dynamics in QCD matter\nproduced in high energy heavy-ion collisions is presented. First, we will\nsummarise the phenomenological efforts to estimate the heavy quark diffusion\ncoefficients obtained within different models. Then, the recent theoretical\ndevelopments from different groups to probe the medium properties using heavy\nquarks will be presented. Heavy quarks are also considered as an ideal probe\nfor the initial stage of heavy-ion collisions. In the end, we present the\nrecent theoretical progress made to probe the early-stage effects,\npre-equilibrium phase, and electromagnetic fields.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:12:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Das","Santosh K.",""]]}
{"id":"2308.01168","submitter":"Baolei Liu","authors":"Jiaqi Song, Baolei Liu, Yao Wang, Chaohao Chen, Xuchen Shan, Xiaolan\n  Zhong, Ling-An Wu, and Fan Wang","title":"Quantitative and dark field ghost imaging with ultraviolet light","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultraviolet (UV) imaging enables a diverse array of applications, such as\nmaterial composition analysis, biological fluorescence imaging, and detecting\ndefects in semiconductor manufacturing. However, scientific-grade UV cameras\nwith high quantum efficiency are expensive and include a complex thermoelectric\ncooling system. Here, we demonstrate a UV computational ghost imaging (UV-CGI)\nmethod to provide a cost-effective UV imaging and detection strategy. By\napplying spatial-temporal illumination patterns and using a 325 nm laser\nsource, a single-pixel detector is enough to reconstruct the images of objects.\nTo demonstrate its capability for quantitative detection, we use UV-CGI to\ndistinguish four UV-sensitive sunscreen areas with different densities on a\nsample. Furthermore, we demonstrate dark field UV-CGI in both transmission and\nreflection schemes. By only collecting the scattered light from objects, we can\ndetect the edges of pure phase objects and small scratches on a compact disc.\nOur results showcase a feasible low-cost solution for non-destructive UV\nimaging and detection. By combining it with other imaging techniques, such as\nhyperspectral imaging or time-resolved imaging, a compact and versatile UV\ncomputational imaging platform may be realized for future applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:14:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Song","Jiaqi",""],["Liu","Baolei",""],["Wang","Yao",""],["Chen","Chaohao",""],["Shan","Xuchen",""],["Zhong","Xiaolan",""],["Wu","Ling-An",""],["Wang","Fan",""]]}
{"id":"2308.01169","submitter":"Sergey Godunov","authors":"S. I. Godunov, E. K. Karkaryan, V. A. Novikov, A. N. Rozanov, M. I.\n  Vysotsky, E. V. Zhemchugov","title":"Weak interaction corrections to muon pair production via the photon\n  fusion at the LHC","comments":"17 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analytical formulas describing the correction due to the $Z$ boson exchange\nto the cross section of the reaction $pp\\rightarrow p\\mu^+\\mu^- X$ are\npresented. When the invariant mass of the produced muon pair $W\\gtrsim\n150~\\text{GeV}$ and its total transverse momentum is large, the correction is\nof the order of 20%.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:15:28 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Godunov","S. I.",""],["Karkaryan","E. K.",""],["Novikov","V. A.",""],["Rozanov","A. N.",""],["Vysotsky","M. I.",""],["Zhemchugov","E. V.",""]]}
{"id":"2308.01170","submitter":"Shangtong Zhang","authors":"Xiaochi Qian, Shangtong Zhang","title":"Direct Gradient Temporal Difference Learning","comments":"Submitted to JMLR in Apr 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Off-policy learning enables a reinforcement learning (RL) agent to reason\ncounterfactually about policies that are not executed and is one of the most\nimportant ideas in RL. It, however, can lead to instability when combined with\nfunction approximation and bootstrapping, two arguably indispensable\ningredients for large-scale reinforcement learning. This is the notorious\ndeadly triad. Gradient Temporal Difference (GTD) is one powerful tool to solve\nthe deadly triad. Its success results from solving a doubling sampling issue\nindirectly with weight duplication or Fenchel duality. In this paper, we\ninstead propose a direct method to solve the double sampling issue by simply\nusing two samples in a Markovian data stream with an increasing gap. The\nresulting algorithm is as computationally efficient as GTD but gets rid of\nGTD's extra weights. The only price we pay is a logarithmically increasing\nmemory as time progresses. We provide both asymptotic and finite sample\nanalysis, where the convergence rate is on-par with the canonical on-policy\ntemporal difference learning. Key to our analysis is a novel refined\ndiscretization of limiting ODEs.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:16:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Qian","Xiaochi",""],["Zhang","Shangtong",""]]}
{"id":"2308.01171","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Measurement of the $B_s^0 \\to \\mu\\mu$ Effective Lifetime with the ATLAS\n  Detector","comments":"32 pages in total, author list starting page 14, 4 figures. All\n  figures/tables (including auxiliary ones), are available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/BPHY-2020-07/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-139","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper reports the first ATLAS measurement of the $B_s^0 \\to \\mu\\mu$\neffective lifetime. The measurement is based on the data collected in\n2015-2016, amounting to 26.3 fb$^{-1}$ of 13 TeV LHC proton-proton collisions.\nThe proper decay-time distribution of $58\\pm13$ background-subtracted signal\ncandidates is fit with simulated signal templates parameterised as a function\nof the $B_s^0$ effective lifetime, with statistical uncertainties extracted\nthrough a Neyman construction. The resulting effective measurement of the\n$B_s^0 \\to \\mu\\mu$ lifetime is $0.99^{+0.42}_{-0.07} \\, (\\text{stat.})\\pm 0.17\n\\text{ (syst.)}\\,\\mathrm{ps}$ and it is found to be consistent with the\nStandard Model.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:16:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.01172","submitter":"Lutz K\\\"opke","authors":"IceCube Collaboration","title":"Search for Galactic core-collapse supernovae in a decade of data taken\n  with the IceCube Neutrino Observatory","comments":"14 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The IceCube Neutrino Observatory has been continuously taking data to search\nfor O(0.5-10) s long neutrino bursts since 2007. Even if a Galactic\ncore-collapse supernova is optically obscured or collapses to a black hole\ninstead of exploding, it will be detectable via the O(10) MeV neutrino burst\nemitted during the collapse. We discuss a search for such events covering the\ntime between April 17, 2008 and December 31, 2019. Considering the average data\ntaking and analysis uptime of 91.7% after all selection cuts, this is\nequivalent to 10.735 years of continuous data taking. In order to test the most\nconservative neutrino production scenario, the selection cuts were optimized\nfor a model based on a 8.8 solar mass progenitor collapsing to an O-Ne-Mg core.\nConservative assumptions on the effects of neutrino oscillations in the\nexploding star were made. The final selection cut was set to ensure that the\nprobability to detect such a supernova within the Milky Way exceeds 99%. No\nsuch neutrino burst was found in the data after performing a blind analysis.\nHence, a 90% C.L. upper limit on the rate of core-collapse supernovae out to\ndistances of ~ 25kpc was determined to be 0.23/yr. For the more distant\nMagellanic Clouds, only high neutrino luminosity supernovae will be detectable\nby IceCube, unless external information on the burst time is available. We\ndetermined a model-independent limit by parameterizing the dependence on the\nneutrino luminosity and the energy spectrum.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:18:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["IceCube Collaboration","",""]]}
{"id":"2308.01173","submitter":"ZeJun Wu","authors":"Zejun Wu, Jiechao Wang, Zunquan Chen, Qinqin Yang, Shuhui Cai, Zhong\n  Chen, Congbo Cai","title":"High-efficient deep learning-based DTI reconstruction with flexible\n  diffusion gradient encoding scheme","comments":"11 pages,6 figures,3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Purpose: To develop and evaluate a novel dynamic-convolution-based method\ncalled FlexDTI for high-efficient diffusion tensor reconstruction with flexible\ndiffusion encoding gradient schemes. Methods: FlexDTI was developed to achieve\nhigh-quality DTI parametric mapping with flexible number and directions of\ndiffusion encoding gradients. The proposed method used dynamic convolution\nkernels to embed diffusion gradient direction information into feature maps of\nthe corresponding diffusion signal. Besides, our method realized the\ngeneralization of a flexible number of diffusion gradient directions by setting\nthe maximum number of input channels of the network. The network was trained\nand tested using data sets from the Human Connectome Project and a local\nhospital. Results from FlexDTI and other advanced tensor parameter estimation\nmethods were compared. Results: Compared to other methods, FlexDTI successfully\nachieves high-quality diffusion tensor-derived variables even if the number and\ndirections of diffusion encoding gradients are variable. It increases peak\nsignal-to-noise ratio (PSNR) by about 10 dB on Fractional Anisotropy (FA) and\nMean Diffusivity (MD), compared with the state-of-the-art deep learning method\nwith flexible diffusion encoding gradient schemes. Conclusion: FlexDTI can well\nlearn diffusion gradient direction information to achieve generalized DTI\nreconstruction with flexible diffusion gradient schemes. Both flexibility and\nreconstruction quality can be taken into account in this network.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:25:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Zejun",""],["Wang","Jiechao",""],["Chen","Zunquan",""],["Yang","Qinqin",""],["Cai","Shuhui",""],["Chen","Zhong",""],["Cai","Congbo",""]]}
{"id":"2308.01174","submitter":"Achim Blumensath","authors":"Achim Blumensath","title":"The Expansion Problem for Infinite Trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study Ramsey like theorems for infinite trees and similar combinatorial\ntools. As an application we consider the expansion problem for tree algebras.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:26:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Blumensath","Achim",""]]}
{"id":"2308.01175","submitter":"Huzheng Yang","authors":"Huzheng Yang, James Gee, Jianbo Shi","title":"Memory Encoding Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We explore a new class of brain encoding model by adding memory-related\ninformation as input. Memory is an essential brain mechanism that works\nalongside visual stimuli. During a vision-memory cognitive task, we found the\nnon-visual brain is largely predictable using previously seen images. Our\nMemory Encoding Model (Mem) won the Algonauts 2023 visual brain competition\neven without model ensemble (single model score 66.8, ensemble score 70.8). Our\nensemble model without memory input (61.4) can also stand a 3rd place.\nFurthermore, we observe periodic delayed brain response correlated to 6th-7th\nprior image, and hippocampus also showed correlated activity timed with this\nperiodicity. We conjuncture that the periodic replay could be related to memory\nmechanism to enhance the working memory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:29:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Huzheng",""],["Gee","James",""],["Shi","Jianbo",""]]}
{"id":"2308.01176","submitter":"Yi-feng Yang","authors":"Yi-feng Yang, Guang-Ming Zhang, Fu-Chun Zhang","title":"Minimal effective model and possible high-$T_{c}$ mechanism for\n  superconductivity of La$_{3}$Ni$_{2}$O$_{7}$ under high pressure","comments":"6 pages, 3 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 recent discovery of high-$T_{c}$ superconductivity in bilayer nickelate\nLa$_{3}$Ni$_{2}$O$_{7}$ under high pressure has stimulated great interest\nconcerning its pairing mechanism. We argue that the weak coupling model from\nthe almost fully-filled $d_{z^{2}}$ bonding band cannot give rise to its high\n$T_{c}$, and thus propose a strong coupling model based on local inter-layer\nspin singlets of Ni-$d_{z^{2}}$ electrons due to their strong on-site Coulomb\nrepulsion. This leads to a minimal effective model that contains local pairing\nof $d_{z^{2}}$ electrons and a considerable hybridization with near\nquarter-filled itinerant $d_{x^{2}-y^{2}}$ electrons on nearest-neighbor sites.\nThe strong coupling between two components provides a composite scenario to\nachieve high-$T_{c}$ superconductivity. Our theory highlights the importance of\nthe bilayer structure of superconducting La$_{3}$Ni$_{2}$O$_{7}$ and points out\na potential route for the exploration of more high-$T_{c}$ superconductors.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:34:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Yi-feng",""],["Zhang","Guang-Ming",""],["Zhang","Fu-Chun",""]]}
{"id":"2308.01177","submitter":"Fabian Zhou","authors":"Fabian Zhou, Jasmine Brewer, Aleksas Mazeliauskas","title":"Thermalization of a jet wake in QCD kinetic theory","comments":"6 pages, 7 figures, proceedings of the 11th International Conference\n  on Hard and Electromagnetic Probes of High Energy Nuclear Collisions (Hard\n  Probes 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the energy deposition of a high-momentum parton traveling through a\nQuark-Gluon Plasma using QCD kinetic theory. We show that the energy is first\ntransported to the soft sector by collinear cascade and then isotropised by\nelastic scatterings. Remarkably, we find that the jet wake can be well\ndescribed by a thermal distribution function with angle-dependent temperature.\nThis could be used for effective phenomenological descriptions of jet\nthermalization in realistic heavy-ion collision simulations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:38:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhou","Fabian",""],["Brewer","Jasmine",""],["Mazeliauskas","Aleksas",""]]}
{"id":"2308.01178","submitter":"Ruiyang Li","authors":"Ruiyang Li, Xi Zhu, Seonjoo Lee","title":"Model Selection for Exposure-Mediator Interaction","comments":"15 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In mediation analysis, the exposure often influences the mediating effect,\ni.e., there is an interaction between exposure and mediator on the dependent\nvariable. When the mediator is high-dimensional, it is necessary to identify\nnon-zero mediators (M) and exposure-by-mediator (X-by-M) interactions. Although\nseveral high-dimensional mediation methods can naturally handle X-by-M\ninteractions, research is scarce in preserving the underlying hierarchical\nstructure between the main effects and the interactions. To fill the knowledge\ngap, we develop the XMInt procedure to select M and X-by-M interactions in the\nhigh-dimensional mediators setting while preserving the hierarchical structure.\nOur proposed method employs a sequential regularization-based forward-selection\napproach to identify the mediators and their hierarchically preserved\ninteraction with exposure. Our numerical experiments showed promising selection\nresults. Further, we applied our method to ADNI morphological data and examined\nthe role of cortical thickness and subcortical volumes on the effect of\namyloid-beta accumulation on cognitive performance, which could be helpful in\nunderstanding the brain compensation mechanism.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:39:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Ruiyang",""],["Zhu","Xi",""],["Lee","Seonjoo",""]]}
{"id":"2308.01179","submitter":"Clare Burrage","authors":"Kate Clements and Benjamin Elder and Lucia Hackermueller and Mark\n  Fromhold and Clare Burrage","title":"Detecting Dark Domain Walls","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ex quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Light scalar fields, with double well potentials and direct matter couplings,\nundergo density driven phase transitions, leading to the formation of domain\nwalls. Such theories could explain dark energy, dark matter or source the\nnanoHz gravitational-wave background. We describe an experiment that could be\nused to detect such domain walls in a laboratory experiment, solving for the\nscalar field profile, and showing how the domain wall affects the motion of a\ntest particle. We find that, in currently unconstrained regions of parameter\nspace, the domain walls leave detectable signatures.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:39:50 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Clements","Kate",""],["Elder","Benjamin",""],["Hackermueller","Lucia",""],["Fromhold","Mark",""],["Burrage","Clare",""]]}
{"id":"2308.01180","submitter":"Yiyang Sun","authors":"Yiyang Sun, Xiaonian Wang, Yangyang Zhang, Jiagui Tang, Xiaqiang Tang,\n  Jing Yao","title":"Interpretable End-to-End Driving Model for Implicit Scene Understanding","comments":"Accepted by 26th IEEE International Conference on Intelligent\n  Transportation Systems (ITSC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Driving scene understanding is to obtain comprehensive scene information\nthrough the sensor data and provide a basis for downstream tasks, which is\nindispensable for the safety of self-driving vehicles. Specific perception\ntasks, such as object detection and scene graph generation, are commonly used.\nHowever, the results of these tasks are only equivalent to the characterization\nof sampling from high-dimensional scene features, which are not sufficient to\nrepresent the scenario. In addition, the goal of perception tasks is\ninconsistent with human driving that just focuses on what may affect the\nego-trajectory. Therefore, we propose an end-to-end Interpretable Implicit\nDriving Scene Understanding (II-DSU) model to extract implicit high-dimensional\nscene features as scene understanding results guided by a planning module and\nto validate the plausibility of scene understanding using auxiliary perception\ntasks for visualization. Experimental results on CARLA benchmarks show that our\napproach achieves the new state-of-the-art and is able to obtain scene features\nthat embody richer scene information relevant to driving, enabling superior\nperformance of the downstream planning.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:43:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sun","Yiyang",""],["Wang","Xiaonian",""],["Zhang","Yangyang",""],["Tang","Jiagui",""],["Tang","Xiaqiang",""],["Yao","Jing",""]]}
{"id":"2308.01181","submitter":"Olivier Rahavandrainy","authors":"Luis H. Gallardo and Olivier Rahavandrainy","title":"On Collatz Conjecture for binary polynomials","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We build a variant of Collatz Conjecture for polynomials over $\\mathbb{F}_2$\nand we prove that it is solved. By the way, we give several examples.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:43:48 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 08:36:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gallardo","Luis H.",""],["Rahavandrainy","Olivier",""]]}
{"id":"2308.01182","submitter":"Ademir Hujdurovi\\'c","authors":"Ademir Hujdurovi\\'c and Istv\\'an Kov\\'acs","title":"Stability of Cayley graphs and Schur rings","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 graph $\\Gamma$ is said to be unstable if for the direct product $\\Gamma\n\\times K_2$, $Aut(\\Gamma \\times K_2)$ is not isomorphic to $Aut(\\Gamma) \\times\n\\mathbb{Z}_2$. In this paper we show that a connected and non-bipartite Cayley\ngraph $Cay(H,S)$ is unstable if and only if the set $S \\times \\{1\\}$ belongs to\na Schur ring over the group $H \\times \\mathbb{Z}_2$ having certain properties.\nThe Schur rings with these properties are characterized if $H$ is an abelian\ngroup of odd order or a cyclic group of twice odd order. As an application, a\nshort proof is given for the result of Witte Morris stating that every\nconnected unstable Cayley graph on an abelian group of odd order has twins\n(Electron.~J.~Combin, 2021). As another application, sufficient and necessary\nconditions are given for a connected and non-bipartite circulant graph of order\n$2p^e$ to be unstable, where $p$ is an odd prime and $e \\ge 1$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:47:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hujdurovi\u0107","Ademir",""],["Kov\u00e1cs","Istv\u00e1n",""]]}
{"id":"2308.01183","submitter":"Molly Andersen","authors":"Molly P. Andersen, Evgeny Mikheev, Ilan T. Rosen, Lixuan Tai, Peng\n  Zhang, Kang L. Wang, Marc A. Kastner, David Goldhaber-Gordon","title":"Universal conductance fluctuations in a MnBi$_2$Te$_4$ thin film","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum coherence of electrons can produce striking behaviors in mesoscopic\nconductors, including weak localization and the Aharonov-Bohm effect. Although\nmagnetic order can also strongly affect transport, the combination of coherence\nand magnetic order has been largely unexplored. Here, we examine quantum\ncoherence-driven universal conductance fluctuations in the antiferromagnetic,\ncanted antiferromagnetic, and ferromagnetic phases of a thin film of the\ntopological material MnBi$_2$Te$_4$. In each magnetic phase we extract a charge\ncarrier phase coherence length of about 100 nm. The conductance\nmagnetofingerprint is repeatable when sweeping applied magnetic field within\none magnetic phase, but changes when the applied magnetic field crosses the\nantiferromagnetic/canted antiferromagnetic magnetic phase boundary.\nSurprisingly, in the antiferromagnetic and canted antiferromagnetic phase, but\nnot in the ferromagnetic phase, the magnetofingerprint depends on the direction\nof the field sweep. To explain these observations, we suggest that conductance\nfluctuation measurements are sensitive to the motion and nucleation of magnetic\ndomain walls in MnBi$_2$Te$_4$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:48:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Andersen","Molly P.",""],["Mikheev","Evgeny",""],["Rosen","Ilan T.",""],["Tai","Lixuan",""],["Zhang","Peng",""],["Wang","Kang L.",""],["Kastner","Marc A.",""],["Goldhaber-Gordon","David",""]]}
{"id":"2308.01184","submitter":"Fengbei Liu","authors":"Fengbei Liu, Yuanhong Chen, Chong Wang, Yuyuan Liu, Gustavo Carneiro","title":"Generative Noisy-Label Learning by Implicit Dicriminative Approximation\n  with Partial Label Prior","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The learning with noisy labels has been addressed with both discriminative\nand generative models. Although discriminative models have dominated the field\ndue to their simpler modeling and more efficient computational training\nprocesses, generative models offer a more effective means of disentangling\nclean and noisy labels and improving the estimation of the label transition\nmatrix. However, generative approaches maximize the joint likelihood of noisy\nlabels and data using a complex formulation that only indirectly optimizes the\nmodel of interest associating data and clean labels. Additionally, these\napproaches rely on generative models that are challenging to train and tend to\nuse uninformative clean label priors. In this paper, we propose a new\ngenerative noisy-label learning approach that addresses these three issues.\nFirst, we propose a new model optimisation that directly associates data and\nclean labels. Second, the generative model is implicitly estimated using a\ndiscriminative model, eliminating the inefficient training of a generative\nmodel. Third, we propose a new informative label prior inspired by partial\nlabel learning as supervision signal for noisy label learning. Extensive\nexperiments on several noisy-label benchmarks demonstrate that our generative\nmodel provides state-of-the-art results while maintaining a similar\ncomputational complexity as discriminative models.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:48:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Liu","Fengbei",""],["Chen","Yuanhong",""],["Wang","Chong",""],["Liu","Yuyuan",""],["Carneiro","Gustavo",""]]}
{"id":"2308.01185","submitter":"Stefan Kurth","authors":"Nahual Sobrino and David Jacob and Stefan Kurth","title":"What can lattice DFT teach us about real-space DFT?","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we establish a connection between density functional theory\n(DFT) for lattice models and common real-space DFT. We consider the lattice DFT\ndescription of a two-level model subject to generic interactions in Mermin's\nDFT formulation in the grand canonical ensemble at finite temperature. The case\nof only density-density and Hund's rule interaction studied in earlier work is\nshown to be equivalent to an exact-exchange description of DFT in the\nreal-space picture. In addition, we also include the so-called pair-hopping\ninteraction which can be treated analytically and, crucially, leads to\nnon-integer occupations of the Kohn-Sham levels even in the limit of zero\ntemperature. Treating the hydrogen molecule in a minimal basis is shown to be\nequivalent to our two-level lattice DFT model. By means of the fractional\noccupations of the KS orbitals (which, in this case, are identical to the\nmany-body ones) we reproduce the results of full configuration interaction,\neven in the dissociation limit and without breaking the spin symmetry. Beyond\nthe minimal basis, we embed our HOMO-LUMO model into a standard DFT calculation\nand, again, obtain results in overall good agreement with exact ones without\nthe need of breaking the spin symmetry.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:50:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sobrino","Nahual",""],["Jacob","David",""],["Kurth","Stefan",""]]}
{"id":"2308.01186","submitter":"Jan Hrabovsky","authors":"J. Hrabovsky, L. Strizik, F. Desevedavy, S. Tazlaru, M. Kucera, L.\n  Nowak, R. Krystufek, J. Mistrik, V. Dedic, V. Kopecky Jr., G. Gadret, T.\n  Wagner, F. Smektala, M. Veis","title":"Optical, magneto-optical properties and fiber-drawing ability of\n  tellurite glasses in the TeO2-ZnO-BaO ternary system","comments":null,"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":"  The presented work is focused on the optical and magneto-optical\ncharacterization of TeO2-ZnO-BaO (TZB) tellurite glasses. We investigated the\nrefractive index and extinction coefficient dispersion by spectroscopic\nellipsometry from ultraviolet, 0.193 um, up to mid infrared, 25 um spectral\nregion. Studied glasses exhibited large values of linear (n632 = 1.91-2.09) and\nnon-linear refractive index (n2 = 1.20-2.67x10-11 esu), Verdet constant (V632 =\n22-33 radT-1m-1) and optical band gap energy (Eg = 3.7-4.1 eV). The materials\ncharacterization revealed that BaO substitution by ZnO leads (at constant\ncontent of TeO2) to an increase in linear and nonlinear refractive index as\nwell as Verdet constant while the optical band gap energy decreases. Fiber\ndrawing ability of TeO2-ZnO-BaO glassy system has been demonstrated on\n60TeO2-20ZnO-20BaO glass with presented mid infrared attenuation coefficient.\nSpecific parameters such as dispersion and single oscillator energy, Abbe\nnumber, and first-/ third-order optical susceptibility are enclosed together\nwith the values of magneto-optic anomaly derived from the calculation of\nmeasured dispersion of the refractive index.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:50:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hrabovsky","J.",""],["Strizik","L.",""],["Desevedavy","F.",""],["Tazlaru","S.",""],["Kucera","M.",""],["Nowak","L.",""],["Krystufek","R.",""],["Mistrik","J.",""],["Dedic","V.",""],["Kopecky","V.","Jr."],["Gadret","G.",""],["Wagner","T.",""],["Smektala","F.",""],["Veis","M.",""]]}
{"id":"2308.01187","submitter":"Chang-Bin Jeon","authors":"Chang-Bin Jeon, Kyogu Lee","title":"Music De-limiter Networks via Sample-wise Gain Inversion","comments":"Accepted to IEEE Workshop on Applications of Signal Processing to\n  Audio and Acoustics (WASPAA) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The loudness war, an ongoing phenomenon in the music industry characterized\nby the increasing final loudness of music while reducing its dynamic range, has\nbeen a controversial topic for decades. Music mastering engineers have used\nlimiters to heavily compress and make music louder, which can induce ear\nfatigue and hearing loss in listeners. In this paper, we introduce music\nde-limiter networks that estimate uncompressed music from heavily compressed\nsignals. Inspired by the principle of a limiter, which performs sample-wise\ngain reduction of a given signal, we propose the framework of sample-wise gain\ninversion (SGI). We also present the musdb-XL-train dataset, consisting of 300k\nsegments created by applying a commercial limiter plug-in for training\nreal-world friendly de-limiter networks. Our proposed de-limiter network\nachieves excellent performance with a scale-invariant source-to-distortion\nratio (SI-SDR) of 23.8 dB in reconstructing musdb-HQ from musdb- XL data, a\nlimiter-applied version of musdb-HQ. The training data, codes, and model\nweights are available in our repository\n(https://github.com/jeonchangbin49/De-limiter).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:51:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Jeon","Chang-Bin",""],["Lee","Kyogu",""]]}
{"id":"2308.01188","submitter":"Fu-Quan Dou","authors":"Dong-Lin Yang, Fang-Mei Yang, and Fu-Quan Dou","title":"Three-level Dicke quantum battery","comments":"9 Pages, 9 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum battery (QB) is the energy storage and extraction device that is\ngoverned by the principles of quantum mechanics. Here we propose a three-level\nDicke QB and investigate its charging process by considering three quantum\noptical states: a Fock state, a coherent state, and a squeezed state. The\nperformance of the QB in a coherent state is substantially improved compared to\na Fock and squeezed states. We find that the locked energy is positively\nrelated to the entanglement between the charger and the battery, and\ndiminishing the entanglement leads to the enhancement of the ergotropy. We\ndemonstrate the QB system is asymptotically free as $N \\rightarrow \\infty$. The\nstored energy becomes fully extractable when $N=10$, and the charging power\nfollows the consistent behavior as the stored energy, independent of the\ninitial state of the charger.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:53:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yang","Dong-Lin",""],["Yang","Fang-Mei",""],["Dou","Fu-Quan",""]]}
{"id":"2308.01189","submitter":"Yongkang He","authors":"Yongkang He, Mingjin Chen, Zhijing Yang, Yongyi Lu","title":"Data-Centric Diet: Effective Multi-center Dataset Pruning for Medical\n  Image Segmentation","comments":"Accepted by ICML workshops 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper seeks to address the dense labeling problems where a significant\nfraction of the dataset can be pruned without sacrificing much accuracy. We\nobserve that, on standard medical image segmentation benchmarks, the loss\ngradient norm-based metrics of individual training examples applied in image\nclassification fail to identify the important samples. To address this issue,\nwe propose a data pruning method by taking into consideration the training\ndynamics on target regions using Dynamic Average Dice (DAD) score. To the best\nof our knowledge, we are among the first to address the data importance in\ndense labeling tasks in the field of medical image analysis, making the\nfollowing contributions: (1) investigating the underlying causes with rigorous\nempirical analysis, and (2) determining effective data pruning approach in\ndense labeling problems. Our solution can be used as a strong yet simple\nbaseline to select important examples for medical image segmentation with\ncombined data sources.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:53:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["He","Yongkang",""],["Chen","Mingjin",""],["Yang","Zhijing",""],["Lu","Yongyi",""]]}
{"id":"2308.01190","submitter":"Arif Mohd","authors":"Musfar Muhamed Kozhikkal, Arif Mohd","title":"Bogoliubov Transformation and Schrodinger Representation on Curved Space","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  It is usually accepted that quantum dynamics described by Schrodinger\nequation that determines the evolution of states from one Cauchy surface to\nanother is unitary. However, it has been known for some time that this\nexpectation is not borne out in the conventional setting in which one envisages\nthe dynamics on a fixed Hilbert space. Indeed it is not even true for linear\nquantum field theory on Minkowski space if the chosen Cauchy surfaces are not\npreserved by the flow of a timelike Killing vector. This issue was elegantly\naddressed and resolved by Agullo and Ashtekar who showed that in a general\nsetting quantum dynamics in the Schrodinger picture does not take place in a\nfixed Hilbert space. Instead, it takes place on a non-trivial bundle over time,\nthe Hilbert bundle, whose fibre at a given time is a Hilbert space at that\ntime. In this article, we postulate a Schrodinger equation that incorporates\nthe effect of change in vacuum during time evolution by including the\nBogoliubov transformation explicitly in the Schrodinger equation. More\nprecisely, for a linear (real) Klein-Gordon field on a globally hyperbolic\nspacetime we write down a Schrodinger equation that propagates states between\narbitrary chosen Cauchy surfaces, thus describing the quantum dynamics on a\nHilbert bundle. We show that this dynamics is unitary if a specific tensor on\nthe canonical phase space satisfies the Hilbert-Schmidt condition. Generalized\nunitarity condition of Agullo-Ashtekar follows quite naturally from our\nconstruction.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:55:31 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kozhikkal","Musfar Muhamed",""],["Mohd","Arif",""]]}
{"id":"2308.01191","submitter":"Shihan Dou","authors":"Shihan Dou, Junjie Shan, Haoxiang Jia, Wenhao Deng, Zhiheng Xi, Wei\n  He, Yueming Wu, Tao Gui, Yang Liu, Xuanjing Huang","title":"Towards Understanding the Capability of Large Language Models on Code\n  Clone Detection: A Survey","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Code cloning, the duplication of code fragments, is common in software\ndevelopment. While some reuse aids productivity, excessive cloning hurts\nmaintainability and introduces bugs. Hence, automatic code clone detection is\nvital. Meanwhile, large language models (LLMs) possess diverse code-related\nknowledge, making them versatile for various software engineering challenges.\nHowever, LLMs' performance in code clone detection is unclear and needs more\nstudy for accurate assessment. In this paper, we provide the first\ncomprehensive evaluation of LLMs for clone detection, covering different clone\ntypes, languages, and prompts. We find advanced LLMs excel in detecting complex\nsemantic clones, surpassing existing methods. Adding intermediate reasoning\nsteps via chain-of-thought prompts noticeably enhances performance.\nAdditionally, representing code as vector embeddings, especially with text\nencoders, effectively aids clone detection.Lastly, the ability of LLMs to\ndetect code clones differs among various programming languages. Our study\nsuggests that LLMs have potential for clone detection due to their language\ncapabilities, offering insights for developing robust LLM-based methods to\nenhance software engineering.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:56:01 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 06:14:05 GMT"},{"version":"v3","created":"Sun, 6 Aug 2023 01:40:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dou","Shihan",""],["Shan","Junjie",""],["Jia","Haoxiang",""],["Deng","Wenhao",""],["Xi","Zhiheng",""],["He","Wei",""],["Wu","Yueming",""],["Gui","Tao",""],["Liu","Yang",""],["Huang","Xuanjing",""]]}
{"id":"2308.01192","submitter":"Yue Sun","authors":"Qiang Hou, Wei Wei, Xin Zhou, Yue Sun, Zhixiang Shi","title":"Observation of zero resistance above 100$^\\circ$ K in\n  Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O","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":"  Room-temperature superconductivity has always been regarded as the ultimate\ngoal in the fields of solid-state physics and materials science, with its\nrealization holding revolutionary significance, capable of triggering\nsignificant changes in energy transmission and storage. However, achieving it\nposes various challenges. Recent research revealed that material\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O displays room-temperature superconductivity\nunder atmospheric pressure, sparking global interest in further exploration.\nHere, we utilized solid-phase synthesis to obtain a polycrystalline sample of\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O. X-ray diffraction confirmed its structural\nconsistency with referenced literature. Zero resistance, which is important\nevidence for superconductivity, was observed above 100$^\\circ$ K under ambient\npressure in our experiment. Our finding indicates that\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O is a possible candidate for searching\nhigh-temperature superconductors.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:59:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hou","Qiang",""],["Wei","Wei",""],["Zhou","Xin",""],["Sun","Yue",""],["Shi","Zhixiang",""]]}
{"id":"2308.01193","submitter":"Xiaobei Yan","authors":"Xiaobei Yan, Xiaoxuan Lou, Guowen Xu, Han Qiu, Shangwei Guo, Chip Hong\n  Chang, Tianwei Zhang","title":"Mercury: An Automated Remote Side-channel Attack to Nvidia Deep Learning\n  Accelerator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  DNN accelerators have been widely deployed in many scenarios to speed up the\ninference process and reduce the energy consumption. One big concern about the\nusage of the accelerators is the confidentiality of the deployed models: model\ninference execution on the accelerators could leak side-channel information,\nwhich enables an adversary to preciously recover the model details. Such model\nextraction attacks can not only compromise the intellectual property of DNN\nmodels, but also facilitate some adversarial attacks.\n  Although previous works have demonstrated a number of side-channel techniques\nto extract models from DNN accelerators, they are not practical for two\nreasons. (1) They only target simplified accelerator implementations, which\nhave limited practicality in the real world. (2) They require heavy human\nanalysis and domain knowledge. To overcome these limitations, this paper\npresents Mercury, the first automated remote side-channel attack against the\noff-the-shelf Nvidia DNN accelerator. The key insight of Mercury is to model\nthe side-channel extraction process as a sequence-to-sequence problem. The\nadversary can leverage a time-to-digital converter (TDC) to remotely collect\nthe power trace of the target model's inference. Then he uses a learning model\nto automatically recover the architecture details of the victim model from the\npower trace without any prior knowledge. The adversary can further use the\nattention mechanism to localize the leakage points that contribute most to the\nattack. Evaluation results indicate that Mercury can keep the error rate of\nmodel extraction below 1%.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:02:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yan","Xiaobei",""],["Lou","Xiaoxuan",""],["Xu","Guowen",""],["Qiu","Han",""],["Guo","Shangwei",""],["Chang","Chip Hong",""],["Zhang","Tianwei",""]]}
{"id":"2308.01194","submitter":"Siao Liu","authors":"Siao Liu, Zhaoyu Chen, Yang Liu, Yuzheng Wang, Dingkang Yang, Zhile\n  Zhao, Ziqing Zhou, Xie Yi, Wei Li, Wenqiang Zhang, Zhongxue Gan","title":"Improving Generalization in Visual Reinforcement Learning via\n  Conflict-aware Gradient Agreement Augmentation","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":"  Learning a policy with great generalization to unseen environments remains\nchallenging but critical in visual reinforcement learning. Despite the success\nof augmentation combination in the supervised learning generalization, naively\napplying it to visual RL algorithms may damage the training efficiency,\nsuffering from serve performance degradation. In this paper, we first conduct\nqualitative analysis and illuminate the main causes: (i) high-variance gradient\nmagnitudes and (ii) gradient conflicts existed in various augmentation methods.\nTo alleviate these issues, we propose a general policy gradient optimization\nframework, named Conflict-aware Gradient Agreement Augmentation (CG2A), and\nbetter integrate augmentation combination into visual RL algorithms to address\nthe generalization bias. In particular, CG2A develops a Gradient Agreement\nSolver to adaptively balance the varying gradient magnitudes, and introduces a\nSoft Gradient Surgery strategy to alleviate the gradient conflicts. Extensive\nexperiments demonstrate that CG2A significantly improves the generalization\nperformance and sample efficiency of visual RL algorithms.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:03:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Liu","Siao",""],["Chen","Zhaoyu",""],["Liu","Yang",""],["Wang","Yuzheng",""],["Yang","Dingkang",""],["Zhao","Zhile",""],["Zhou","Ziqing",""],["Yi","Xie",""],["Li","Wei",""],["Zhang","Wenqiang",""],["Gan","Zhongxue",""]]}
{"id":"2308.01198","submitter":"Georges Sfeir","authors":"Georges Sfeir, Filipe Rodrigues, Maya Abou Zeid, Francisco Camara\n  Pereira","title":"Analyzing the Reporting Error of Public Transport Trips in the Danish\n  National Travel Survey Using Smart Card Data","comments":"22 pages, 3 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP econ.EM stat.OT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Household travel surveys have been used for decades to collect individuals\nand households' travel behavior. However, self-reported surveys are subject to\nrecall bias, as respondents might struggle to recall and report their\nactivities accurately. This study addresses examines the time reporting error\nof public transit users in a nationwide household travel survey by matching, at\nthe individual level, five consecutive years of data from two sources, namely\nthe Danish National Travel Survey (TU) and the Danish Smart Card system\n(Rejsekort). Survey respondents are matched with travel cards from the\nRejsekort data solely based on the respondents' declared spatiotemporal travel\nbehavior. Approximately, 70% of the respondents were successfully matched with\nRejsekort travel cards. The findings reveal a median time reporting error of\n11.34 minutes, with an Interquartile Range of 28.14 minutes. Furthermore, a\nstatistical analysis was performed to explore the relationships between the\nsurvey respondents' reporting error and their socio-economic and demographic\ncharacteristics. The results indicate that females and respondents with a fixed\nschedule are in general more accurate than males and respondents with a\nflexible schedule in reporting their times of travel. Moreover, trips reported\nduring weekdays or via the internet displayed higher accuracies compared to\ntrips reported during weekends and holidays or via telephones. This\ndisaggregated analysis provides valuable insights that could help in improving\nthe design and analysis of travel surveys, as well accounting for reporting\nerrors/biases in travel survey-based applications. Furthermore, it offers\nvaluable insights underlying the psychology of travel recall by survey\nrespondents.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:07:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sfeir","Georges",""],["Rodrigues","Filipe",""],["Zeid","Maya Abou",""],["Pereira","Francisco Camara",""]]}
{"id":"2308.01199","submitter":"Ellis Hershkowitz","authors":"Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D Ellis\n  Hershkowitz, Rajmohan Rajaraman","title":"One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree","comments":"@FOCS23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A spanning tree $T$ of graph $G$ is a $\\rho$-approximate universal Steiner\ntree (UST) for root vertex $r$ if, for any subset of vertices $S$ containing\n$r$, the cost of the minimal subgraph of $T$ connecting $S$ is within a $\\rho$\nfactor of the minimum cost tree connecting $S$ in $G$. Busch et al. (FOCS 2012)\nshowed that every graph admits $2^{O(\\sqrt{\\log n})}$-approximate USTs by\nshowing that USTs are equivalent to strong sparse partition hierarchies (up to\npoly-logs). Further, they posed poly-logarithmic USTs and strong sparse\npartition hierarchies as open questions.\n  We settle these open questions by giving polynomial-time algorithms for\ncomputing both $O(\\log ^ 7 n)$-approximate USTs and poly-logarithmic strong\nsparse partition hierarchies. For graphs with constant doubling dimension or\nconstant pathwidth we improve this to $O(\\log n)$-approximate USTs and $O(1)$\nstrong sparse partition hierarchies. Our doubling dimension result is tight up\nto second order terms. We reduce the existence of these objects to the\npreviously studied cluster aggregation problem and what we call dangling nets.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:07:41 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Busch","Costas",""],["Chen","Da Qi",""],["Filtser","Arnold",""],["Hathcock","Daniel",""],["Hershkowitz","D Ellis",""],["Rajaraman","Rajmohan",""]]}
{"id":"2308.01200","submitter":"Andreas Lymperis","authors":"Spyros Basilakos, Andreas Lymperis, Maria Petronikolou, Emmanuel N.\n  Saridakis","title":"Alleviating both $H_0$ and $\\sigma_8$ tensions in Tsallis cosmology","comments":"14 pages, 4 figures","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 present how Tsallis cosmology can alleviate both $H_0$ and $\\sigma_8$\ntensions simultaneously. Such a modified cosmological scenario is obtained by\nthe application of the gravity-thermodynamics conjecture, but using the\nnon-additive Tsallis entropy, instead of the standard Bekenstein-Hawking one.\nHence, one obtains modified Friedmann equations, with extra terms that depend\non the new Tsallis exponent $\\delta$ that quantifies the departure from\nstandard entropy. We show that for particular $\\delta$ choices we can obtain a\nphantom effective dark energy, which is known to be one of the sufficient\nmechanisms that can alleviate $H_0$ tension. Additionally, for the same\nparameter choice we obtain an increased friction term and an effective Newton's\nconstant smaller than the usual one, and thus the $\\sigma_8$ tension is also\nsolved. These features act as a significant advantage of Tsallis modified\ncosmology.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:08:20 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Basilakos","Spyros",""],["Lymperis","Andreas",""],["Petronikolou","Maria",""],["Saridakis","Emmanuel N.",""]]}
{"id":"2308.01201","submitter":"Sheng Yu","authors":"Sheng Yu, Xiao Pan, Anastasis Georgiou, Boli Chen, Imad M. Jaimoukha\n  and Simos A. Evangelou","title":"A Real-Time Robust Ecological-Adaptive Cruise Control Strategy for\n  Battery Electric Vehicles","comments":"15 pages, 12 figures and 2 tables. This work has been submitted to\n  the IEEE for possible publication. Copyright may be transferred without\n  notice, after which this version may no longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work addresses the ecological-adaptive cruise control problem for\nconnected electric vehicles by a computationally efficient robust control\nstrategy. The problem is formulated in the space-domain with a realistic\ndescription of the nonlinear electric powertrain model and motion dynamics to\nyield a convex optimal control problem (OCP). The OCP is approached by a novel\nrobust model predictive control (RMPC) method handling various disturbances due\nto modelling mismatch and inaccurate leading vehicle information. The RMPC\nproblem is solved by semi-definite programming relaxation and single linear\nmatrix inequality (sLMI) techniques for further enhanced computational\nefficiency. The performance of the proposed real-time robust\necological-adaptive cruise control (REACC) method is evaluated using an\nexperimentally collected driving cycle. Its robustness is verified by\ncomparison with a nominal MPC which is shown to result in speed-limit\nconstraint violations. The energy economy of the proposed method outperforms a\nstate-of-the-art time-domain RMPC scheme, as a more precisely fitted convex\npowertrain model can be integrated into the space-domain scheme. The additional\ncomparison with a traditional constant distance following strategy (CDFS)\nfurther verifies the effectiveness of the proposed REACC. Finally, it is\nverified that the REACC can be potentially implemented in real-time owing to\nthe sLMI and resulting convex algorithm.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:08:22 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 09:27:43 GMT"},{"version":"v3","created":"Tue, 15 Aug 2023 11:43:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yu","Sheng",""],["Pan","Xiao",""],["Georgiou","Anastasis",""],["Chen","Boli",""],["Jaimoukha","Imad M.",""],["Evangelou","Simos A.",""]]}
{"id":"2308.01202","submitter":"Michael T. Anderson","authors":"Michael T. Anderson","title":"The Bartnik quasi-local mass conjectures","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is a tribute to Robert Bartnik and his work and conjectures on\nquasi-local mass. We present a framework in which to clearly analyse Bartnik's\nstatic vacuum extension conjecture. While we prove that this conjecture is not\ntrue in general, it remains a fundamental open problem to understand the realm\nof its validity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:08:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Anderson","Michael T.",""]]}
{"id":"2308.01206","submitter":"Dimitrios Thanos","authors":"Dimitrios Thanos, Tim Coopmans, Alfons Laarman","title":"Fast equivalence checking of quantum circuits of Clifford gates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Checking whether two quantum circuits are equivalent is important for the\ndesign and optimization of quantum-computer applications with real-world\ndevices. We consider quantum circuits consisting of Clifford gates, a\npractically-relevant subset of all quantum operations which is large enough to\nexhibit quantum features such as entanglement and forms the basis of, for\nexample, quantum-error correction and many quantum-network applications. We\npresent a deterministic algorithm that is based on a folklore mathematical\nresult and demonstrate that it is capable of outperforming previously\nconsidered state-of-the-art method. In particular, given two Clifford circuits\nas sequences of single- and two-qubit Clifford gates, the algorithm checks\ntheir equivalence in $O(n \\cdot m)$ time in the number of qubits $n$ and number\nof elementary Clifford gates $m$. Using the performant Stim simulator as\nbackend, our implementation checks equivalence of quantum circuits with 1000\nqubits (and a circuit depth of 10.000 gates) in $\\sim$22 seconds and circuits\nwith 100.000 qubits (depth 10) in $\\sim$15 minutes, outperforming the existing\nSAT-based and path-integral based approaches by orders of magnitude. This\napproach shows that the correctness of application-relevant subsets of quantum\noperations can be verified up to large circuits in practice.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:10:48 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Thanos","Dimitrios",""],["Coopmans","Tim",""],["Laarman","Alfons",""]]}
{"id":"2308.01207","submitter":"Zhi Wang","authors":"Junyi Wang, Yuanyang Zhu, Zhi Wang, Yan Zheng, Jianye Hao, Chunlin\n  Chen","title":"BiERL: A Meta Evolutionary Reinforcement Learning Framework via Bilevel\n  Optimization","comments":"Published as a conference paper at European Conference on Artificial\n  Intelligence (ECAI) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Evolutionary reinforcement learning (ERL) algorithms recently raise attention\nin tackling complex reinforcement learning (RL) problems due to high\nparallelism, while they are prone to insufficient exploration or model collapse\nwithout carefully tuning hyperparameters (aka meta-parameters). In the paper,\nwe propose a general meta ERL framework via bilevel optimization (BiERL) to\njointly update hyperparameters in parallel to training the ERL model within a\nsingle agent, which relieves the need for prior domain knowledge or costly\noptimization procedure before model deployment. We design an elegant meta-level\narchitecture that embeds the inner-level's evolving experience into an\ninformative population representation and introduce a simple and feasible\nevaluation of the meta-level fitness function to facilitate learning\nefficiency. We perform extensive experiments in MuJoCo and Box2D tasks to\nverify that as a general framework, BiERL outperforms various baselines and\nconsistently improves the learning performance for a diversity of ERL\nalgorithms.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:31:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Junyi",""],["Zhu","Yuanyang",""],["Wang","Zhi",""],["Zheng","Yan",""],["Hao","Jianye",""],["Chen","Chunlin",""]]}
{"id":"2308.01208","submitter":"Ashraf Ghiye","authors":"Ashraf Ghiye, Baptiste Barreau, Laurent Carlier, Michalis Vazirgiannis","title":"Adaptive Collaborative Filtering with Personalized Time Decay Functions\n  for Financial Product Recommendation","comments":"10 pages, 1 figure, 2 tables, to be published in the Seventeenth ACM\n  Conference on Recommender Systems (RecSys '23)","journal-ref":null,"doi":"10.1145/3604915.3608832","report-no":null,"categories":"cs.IR cs.LG q-fin.CP stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classical recommender systems often assume that historical data are\nstationary and fail to account for the dynamic nature of user preferences,\nlimiting their ability to provide reliable recommendations in time-sensitive\nsettings. This assumption is particularly problematic in finance, where\nfinancial products exhibit continuous changes in valuations, leading to\nfrequent shifts in client interests. These evolving interests, summarized in\nthe past client-product interactions, see their utility fade over time with a\ndegree that might differ from one client to another. To address this challenge,\nwe propose a time-dependent collaborative filtering algorithm that can\nadaptively discount distant client-product interactions using personalized\ndecay functions. Our approach is designed to handle the non-stationarity of\nfinancial data and produce reliable recommendations by modeling the dynamic\ncollaborative signals between clients and products. We evaluate our method\nusing a proprietary dataset from BNP Paribas and demonstrate significant\nimprovements over state-of-the-art benchmarks from relevant literature. Our\nfindings emphasize the importance of incorporating time explicitly in the model\nto enhance the accuracy of financial product recommendation.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:27:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ghiye","Ashraf",""],["Barreau","Baptiste",""],["Carlier","Laurent",""],["Vazirgiannis","Michalis",""]]}
{"id":"2308.01209","submitter":"Anass Nassabein Mr.","authors":"Anass Nassabein, Therrar Kadri, Seifideen Kadry, Khaled Smaili","title":"The Exponentiated Hypoexponential Disribution","comments":"26 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.PR math.ST stat.TH","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper we study the Exponentiated Hypoexponential Distribution with\ndifferent parameters. The distribution added a parameter to the n parameters of\nthe Hypoexponenial distribution. We first derive a closed expression of the\nprobability density function and the cumulative distribution function of\nMaximum Exponentiated Exponential distribution. These functions are used to\ndetermine an exact expression of the probability density function, the\ncumulative function, reliability function, and hazard function of our\nExponentiated Hypoexponential Distribution. We discuss estimation of the\nparameters by maximum likelihood estimators. The distribution has been fitted\nto a real life data set and the fit has been found to be a serious competitor\nto the others.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:26:11 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Nassabein","Anass",""],["Kadri","Therrar",""],["Kadry","Seifideen",""],["Smaili","Khaled",""]]}
{"id":"2308.01210","submitter":"Jetze Schuurmans","authors":"Jetze Schuurmans, Flavius Frasincar","title":"Global Hierarchical Neural Networks using Hierarchical Softmax","comments":"Submitted to the 35th Symposium on Applied Computing (SAC'20,\n  https://www.sigapp.org/sac/sac2020/), to the Machine Learning and its\n  Applications track (MLA, https://sites.google.com/view/acmsac2020/)","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a framework in which hierarchical softmax is used to\ncreate a global hierarchical classifier. The approach is applicable for any\nclassification task where there is a natural hierarchy among classes. We show\nempirical results on four text classification datasets. In all datasets the\nhierarchical softmax improved on the regular softmax used in a flat classifier\nin terms of macro-F1 and macro-recall. In three out of four datasets\nhierarchical softmax achieved a higher micro-accuracy and macro-precision.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:12:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Schuurmans","Jetze",""],["Frasincar","Flavius",""]]}
{"id":"2308.01212","submitter":"Yi Sheng Chai","authors":"Long Zhang, Tianyang Wang, Yugang Zhang, Shuang Liu, Yuping Sun,\n  Xiaoyuan Zhou, Young Sun, Mingquan He, Aifeng Wang, Xuan Luo, Yisheng Chai","title":"Comprehensive investigation of Quantum Oscillations in Semimetal Using\n  an ac Composite Magnetoelectric Technique with Ultrahigh Sensitivity","comments":"22 pages, 4 figures","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":"  Quantum oscillation (QO), a physical phenomenon that reflects the\ncharacteristics of the Fermi surface and transport fermions, has been\nextensively observed in metals and semimetals through various approaches, like\nmagnetostriction, magnetization, resistivity, and thermoelectric power.\nHowever, only some allowed oscillation frequencies can be revealed by each\nindividual method, particularly in semimetals with intricate Fermi pockets and\nassociated magnetic breakdown phenomena. In this paper, we present the\napplication of an ac composite magnetoelectric (ME) technique to measure the\nQOs of a topological nodal-line semimetal, ZrSiS, which possesses six\nfundamental QO frequencies. By employing the ME technique with a maximum\nmagnetic field of 13 T and a minimum temperature of 2 K, we are able to capture\nall the fundamental frequencies and most of the permissible magnetic breakdown\nfrequencies. In comparison, some of the frequencies were missing in the\naforementioned four methods under identical measurement conditions. Remarkably,\na series of magnetic breakdown frequencies around 8000 T were revealed even in\na magnetic field as low as 7.5 T. These findings highlight the ME technique as\nan ultrahigh-sensitive tool for studying Dirac Fermions and other topological\nsemimetals with complex Fermi surfaces.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:15:04 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhang","Long",""],["Wang","Tianyang",""],["Zhang","Yugang",""],["Liu","Shuang",""],["Sun","Yuping",""],["Zhou","Xiaoyuan",""],["Sun","Young",""],["He","Mingquan",""],["Wang","Aifeng",""],["Luo","Xuan",""],["Chai","Yisheng",""]]}
{"id":"2308.01213","submitter":"Sara-Viola Kuntz","authors":"Christian Kuehn and Sara-Viola Kuntz","title":"Embedding Capabilities of Neural ODEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A class of neural networks that gained particular interest in the last years\nare neural ordinary differential equations (neural ODEs). We study input-output\nrelations of neural ODEs using dynamical systems theory and prove several\nresults about the exact embedding of maps in different neural ODE architectures\nin low and high dimension. The embedding capability of a neural ODE\narchitecture can be increased by adding, for example, a linear layer, or\naugmenting the phase space. Yet, there is currently no systematic theory\navailable and our work contributes towards this goal by developing various\nembedding results as well as identifying situations, where no embedding is\npossible. The mathematical techniques used include as main components iterative\nfunctional equations, Morse functions and suspension flows, as well as several\nfurther ideas from analysis. Although practically, mainly universal\napproximation theorems are used, our geometric dynamical systems viewpoint on\nuniversal embedding provides a fundamental understanding, why certain neural\nODE architectures perform better than others.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:16:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kuehn","Christian",""],["Kuntz","Sara-Viola",""]]}
{"id":"2308.01214","submitter":"Juan Carlos Riano Rojas","authors":"Juan Carlos Riano-Rojas","title":"An optimal convergent Collatz algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this research an optimal algorithm of the Collatz conjecture is proposed,\nand the convergence of the application is demonstrated. In addition, the result\nis related to the classical Collatz conjecture, presenting a possible important\nproof and an equation that relates them.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:16:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Riano-Rojas","Juan Carlos",""]]}
{"id":"2308.01215","submitter":"Bao Truong","authors":"Bao Truong, Thiem Hoang, Nguyen Chau Giang, Pham Ngoc Diep, Dieu D.\n  Nguyen, Nguyen Bich Ngoc","title":"Numerical modeling of thermal dust polarization from aligned grains in\n  the envelope of evolved stars with updated POLARIS","comments":"27 pages, 23 figures, 1 table, to be submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic fields are thought to influence the formation and evolution of\nevolved star envelopes. Thermal dust polarization from magnetically aligned\ngrains is potentially a powerful tool for probing magnetic fields and dust\nproperties in these circumstellar environments. In this paper, we present\nnumerical modeling of thermal dust polarization from the envelope of IK Tau\nusing the magnetically enhanced radiative torque (MRAT) alignment theory\nimplemented in our updated POLARIS code. Due to the strong stellar radiation\nfield, the minimum size required for RAT alignment of silicate grains is $\\sim\n0.005 - 0.05\\,\\rm\\mu m$. Additionally, ordinary paramagnetic grains can achieve\nperfect alignment by MRAT in the inner regions of $r < 500\\,\\rm au$ due to\nstronger magnetic fields of $B\\sim 10$ mG - 1G, producing thermal dust\npolarization degree of $\\sim 10\\,\\%$. The polarization degree can be enhanced\nto $\\sim 20-40\\%$ for grains with embedded iron inclusions. We also find that\nthe magnetic field geometry affects the alignment size and the resulting\npolarization degree due to the projection effect in the plane-of-sky. We also\nstudy the spectrum of polarized thermal dust emission and find the increased\npolarization degree toward $\\lambda > 50\\,\\rm\\mu m$ due to the alignment of\nsmall grains by MRAT. Furthermore, we investigate the impact of rotational\ndisruption by RATs (RAT-D) and find the RAT-D effect cause a decrease in the\ndust polarization fraction. Finally, we compare our numerical results with\navailable polarization data observed by SOFIA/HAWC+ for constraining dust\nproperties, suggesting grains are unlikely to have embedded iron clusters and\nmight have slightly elongated shapes. Our modeling results suggest further\nobservational studies at far-infrared/sub-millimeter wavelengths to understand\nthe properties of magnetic fields and dust in AGB envelopes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:20:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Truong","Bao",""],["Hoang","Thiem",""],["Giang","Nguyen Chau",""],["Diep","Pham Ngoc",""],["Nguyen","Dieu D.",""],["Ngoc","Nguyen Bich",""]]}
{"id":"2308.01216","submitter":"Jacob Laubacher","authors":"Jacob Laubacher, Mark Medwid, Dylan Schuster","title":"Classifying character degree graphs with seven vertices","comments":"28 pages, 18 figures. arXiv admin note: text overlap with\n  arXiv:2108.08330","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study here the graphs with seven vertices in an effort to classify which\nof them appear as the prime character degree graphs of finite solvable groups.\nThis classification is complete for the disconnected graphs. Of the 853\nnon-isomorphic connected graphs, we were able to demonstrate that twenty-two\noccur as prime character degree graphs. Two are of diameter three, while the\nremaining are constructed as direct products. Forty-four graphs remain\nunclassified.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:21:20 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Laubacher","Jacob",""],["Medwid","Mark",""],["Schuster","Dylan",""]]}
{"id":"2308.01217","submitter":"Kaibin Tian","authors":"Kaibin Tian, Ruixiang Zhao, Hu Hu, Runquan Xie, Fengzong Lian, Zhanhui\n  Kang and Xirong Li","title":"TeachCLIP: Multi-Grained Teaching for Efficient Text-to-Video Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For text-to-video retrieval (T2VR), which aims to retrieve unlabeled videos\nby ad-hoc textual queries, CLIP-based methods are dominating. Compared to\nCLIP4Clip which is efficient and compact, the state-of-the-art models tend to\ncompute video-text similarity by fine-grained cross-modal feature interaction\nand matching, putting their scalability for large-scale T2VR into doubt. For\nefficient T2VR, we propose TeachCLIP with multi-grained teaching to let a\nCLIP4Clip based student network learn from more advanced yet computationally\nheavy models such as X-CLIP, TS2-Net and X-Pool . To improve the student's\nlearning capability, we add an Attentional frame-Feature Aggregation (AFA)\nblock, which by design adds no extra storage/computation overhead at the\nretrieval stage. While attentive weights produced by AFA are commonly used for\ncombining frame-level features, we propose a novel use of the weights to let\nthem imitate frame-text relevance estimated by the teacher network. As such,\nAFA provides a fine-grained learning (teaching) channel for the student\n(teacher). Extensive experiments on multiple public datasets justify the\nviability of the proposed method.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:22:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Tian","Kaibin",""],["Zhao","Ruixiang",""],["Hu","Hu",""],["Xie","Runquan",""],["Lian","Fengzong",""],["Kang","Zhanhui",""],["Li","Xirong",""]]}
{"id":"2308.01218","submitter":"Manuel Valle Torre","authors":"Manuel Valle Torre, Marcus Specht, Catharine Oertel","title":"The sequence matters: A systematic literature review of using sequence\n  analysis in Learning Analytics","comments":"Submitted to the Journal of Learning Analytics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Describing and analysing sequences of learner actions is becoming more\npopular in learning analytics. Nevertheless, the authors found a variety of\ndefinitions of what a learning sequence is, of which data is used for the\nanalysis, and which methods are implemented, as well as of the purpose and\neducational interventions designed with them. In this literature review, the\nauthors aim to generate an overview of these concepts to develop a decision\nframework for using sequence analysis in educational research. After analysing\n44 articles, the conclusions enable us to highlight different learning tasks\nand educational settings where sequences are analysed, identify data mapping\nmodels for different types of sequence actions, differentiate methods based on\npurpose and scope, and identify possible educational interventions based on the\noutcomes of sequence analysis.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:22:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Torre","Manuel Valle",""],["Specht","Marcus",""],["Oertel","Catharine",""]]}
{"id":"2308.01219","submitter":"Jianshi Yan","authors":"Jianshi Yan","title":"On the pluricanonical map and the canonical volume of projective 4-folds\n  of general type","comments":"11 pages. Comments are welcome. arXiv admin note: text overlap with\n  arXiv:1904.09393","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For nonsingular projective 4-folds V of general type with plurigenus\n$P_{m_0}(V) \\geq 2$ for some positive integer $m_0$, we show that $\\varphi_{m}$\nis birational onto its image for all integers $m \\geq 76m_0+77$ and the\ncanonical volume Vol(V) has the lower bound $\\frac{1}{1680m_0(m_0+1)^3}$. This\nimproves earlier results of Meng Chen.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:25:57 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yan","Jianshi",""]]}
{"id":"2308.01220","submitter":"Rebekka G\\\"orge Ms","authors":"Rebekka G\\\"orge, Elena Haedecke, Michael Mock","title":"Using ScrutinAI for Visual Inspection of DNN Performance in a Medical\n  Use Case","comments":"Accepted at AAAI Spring Symposium 2023 AITA: AI Trustworthiness\n  Assessment","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CY cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our Visual Analytics (VA) tool ScrutinAI supports human analysts to\ninvestigate interactively model performanceand data sets. Model performance\ndepends on labeling quality to a large extent. In particular in medical\nsettings, generation of high quality labels requires in depth expert knowledge\nand is very costly. Often, data sets are labeled by collecting opinions of\ngroups of experts. We use our VA tool to analyse the influence of label\nvariations between different experts on the model performance. ScrutinAI\nfacilitates to perform a root cause analysis that distinguishes weaknesses of\ndeep neural network (DNN) models caused by varying or missing labeling quality\nfrom true weaknesses. We scrutinize the overall detection of intracranial\nhemorrhages and the more subtle differentiation between subtypes in a publicly\navailable data set.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:26:08 GMT"}],"update_date":"2023-08-03","authors_parsed":[["G\u00f6rge","Rebekka",""],["Haedecke","Elena",""],["Mock","Michael",""]]}
{"id":"2308.01221","submitter":"Cintia Pacchiano Camacho","authors":"Antonella Nastasi, Cintia Pacchiano Camacho","title":"Regularity results for quasiminima of a class of double phase problems","comments":"arXiv admin note: text overlap with arXiv:2304.14858","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove boundedness, H\\\"older continuity, Harnack inequality results for\nlocal quasiminima to elliptic double phase problems of $p$-Laplace type in the\ngeneral context of metric measure spaces. The proofs follow a variational\napproach and they are based on the De Giorgi method, a careful phase analysis\nand estimates in the intrinsic geometries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:27:34 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 14:52:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Nastasi","Antonella",""],["Camacho","Cintia Pacchiano",""]]}
{"id":"2308.01222","submitter":"Cheng Wang","authors":"Cheng Wang","title":"Calibration in Deep Learning: A Survey of the State-of-the-Art","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Calibrating deep neural models plays an important role in building reliable,\nrobust AI systems in safety-critical applications. Recent work has shown that\nmodern neural networks that possess high predictive capability are poorly\ncalibrated and produce unreliable model predictions. Though deep learning\nmodels achieve remarkable performance on various benchmarks, the study of model\ncalibration and reliability is relatively underexplored. Ideal deep models\nshould have not only high predictive performance but also be well calibrated.\nThere have been some recent methods proposed to calibrate deep models by using\ndifferent mechanisms. In this survey, we review the state-of-the-art\ncalibration methods and provide an understanding of their principles for\nperforming model calibration. First, we start with the definition of model\ncalibration and explain the root causes of model miscalibration. Then we\nintroduce the key metrics that can measure this aspect. It is followed by a\nsummary of calibration methods that we roughly classified into four categories:\npost-hoc calibration, regularization methods, uncertainty estimation, and\ncomposition methods. We also covered some recent advancements in calibrating\nlarge models, particularly large language models (LLMs). Finally, we discuss\nsome open issues, challenges, and potential directions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:28:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Cheng",""]]}
{"id":"2308.01223","submitter":"Julen Etxaniz","authors":"Julen Etxaniz, Gorka Azkune, Aitor Soroa, Oier Lopez de Lacalle, Mikel\n  Artetxe","title":"Do Multilingual Language Models Think Better in English?","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":"  Translate-test is a popular technique to improve the performance of\nmultilingual language models. This approach works by translating the input into\nEnglish using an external machine translation system, and running inference\nover the translated input. However, these improvements can be attributed to the\nuse of a separate translation system, which is typically trained on large\namounts of parallel data not seen by the language model. In this work, we\nintroduce a new approach called self-translate, which overcomes the need of an\nexternal translation system by leveraging the few-shot translation capabilities\nof multilingual language models. Experiments over 5 tasks show that\nself-translate consistently outperforms direct inference, demonstrating that\nlanguage models are unable to leverage their full multilingual potential when\nprompted in non-English languages. Our code is available at\nhttps://github.com/juletx/self-translate.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:29:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Etxaniz","Julen",""],["Azkune","Gorka",""],["Soroa","Aitor",""],["de Lacalle","Oier Lopez",""],["Artetxe","Mikel",""]]}
{"id":"2308.01224","submitter":"Roberta Arnaldi","authors":"Roberta Arnaldi (for the NA60+ Collaboration)","title":"Prospects for open heavy-flavour and quarkonium measurements with NA60+","comments":"6 pages, 5 figures, contribution to the proceedings of the 11th\n  International Conference on Hard and Electromagnetic Probes of High-Energy\n  Nuclear Collisions (Hard Probes 2023), Aschaffenburg (Germany), March 26-31,\n  2023. Submitted to PoS","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The high-intensity beams provided by the CERN SPS in a large range of\nenergies offer a unique opportunity to investigate the region of the QCD phase\ndiagram at high baryochemical potential. The NA60+ experiment, proposed for\ntaking data with heavy-ion collisions at the SPS in the next years, is in an\nideal position to provide new insights into the QCD phase diagram, measuring\nrare probes via a Pb-Pb and p-A beam-energy scan, in the collisions energy\ninterval $\\sqrt{s_{NN}}$= 6-17 GeV. NA60+ plans to measure the production of\nhidden and open charm hadrons and prospects on these measurements will be\ndiscussed. Open charm hadrons will be measured from their decays into charged\nhadrons, reconstructed from the tracks in the silicon detectors of the vertex\ntelescope. This will enable high-precision measurements of the yield of\nD$^{0}$, D$^{+}$, and D$^{+}_{s}$ mesons, and of $\\Lambda_{c}^{+}$ baryons,\nthus allowing us to constrain the transport properties of the QGP and the\ncharm-quark hadronisation. Charmonium states, J/$\\psi$ and $\\psi$(2S), will be\nmeasured through dimuon decays reconstructed with the muon spectrometer. Hence,\nby measuring the charmonium yield in p-A and Pb-Pb collisions at different\ncollision energies, NA60+ will have a unique opportunity to study the threshold\nenergy for the onset of deconfinement.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:30:49 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Arnaldi","Roberta","","for the NA60+ Collaboration"]]}
{"id":"2308.01225","submitter":"Egor Voronetsky","authors":"Egor Voronetsky","title":"Groups with $\\mathsf{BC}_\\ell$-commutator relations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Isotropic odd unitary groups generalize the Chevalley groups of classical\ntypes over commutative rings and their twisted forms. Such groups have root\nsubgroups parameterized by a root system $\\mathsf{BC}_\\ell$ and may be\nconstructed by so-called odd form rings with Peirce decompositions. We show the\nconverse: if a group $G$ has root subgroups indexed by roots of\n$\\mathsf{BC}_\\ell$ and satisfying natural conditions, then there is a\nhomomorphism $\\mathrm{StU}(R, \\Delta) \\to G$ inducing isomorphisms on the root\nsubgroups, where $\\mathrm{StU}(R, \\Delta)$ is the odd unitary Steinberg group\nconstructed by an odd form ring $(R, \\Delta)$ with a Peirce decomposition. For\ngroups with root subgroups indexed by $\\mathsf A_\\ell$ (the already known case)\nthe resulting odd form ring is essentially a generalized matrix ring.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:32:00 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Voronetsky","Egor",""]]}
{"id":"2308.01226","submitter":"Changyu Guo","authors":"Xing Cheng, Chang-Yu Guo and Yunrui Zheng","title":"Global weak solution of 3-D focusing energy-critical nonlinear\n  Schr\\\"odinger equation","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this article, we prove the existence of global weak solutions to the\nthree-dimensional focusing energy-critical nonlinear Schr\\\"odinger (NLS)\nequation in the non-radial case. Furthermore, we prove the weak-strong\nuniqueness for some class of initial data. The main ingredient of our new\napproach is to use solutions of an energy-critical Ginzburg-Landau equation as\napproximations for the corresponding nonlinear Sch\\\"ordinger equation.\n  In our proofs, we first show the dichotomy of global well-posedness versus\nfinite time blow-up of energy-critical Ginzburg-Landau equation in $\\dot{H}^1(\n\\mathbb{R}^d)$ for $d = 3,4 $ when the energy is less than the energy of the\nstationary solution $W$. We follow the strategy of C. E. Kenig and F. Merle\n[25,26], using a concentration-compactness/rigidity argument to reduce the\nglobal well-posedness to the exclusion of a critical element. The critical\nelement is ruled out by dissipation of the Ginzburg-Landau equation, including\nlocal smoothness, backwards uniqueness and unique continuation. The existence\nof global weak solution of the three dimensional focusing energy-critical\nnonlinear Schr\\\"odinger equation in the non-radial case then follows from the\nglobal well-posedness of the energy-critical Ginzburg-Landau equation via a\nlimitation argument. We also adapt the arguments of M. Struwe [37,38] to prove\nthe weak-strong uniqueness when the $\\dot{H}^1$-norm of the initial data is\nbounded by a constant depending on the stationary solution $W$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:32:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Cheng","Xing",""],["Guo","Chang-Yu",""],["Zheng","Yunrui",""]]}
{"id":"2308.01227","submitter":"Wonjae Shin","authors":"Aryan Kaushik, Rohit Singh, Shalanika Dayarathna, Rajitha Senanayake,\n  Marco Di Renzo, Miguel Dajer, Hyoungju Ji, Younsun Kim, Vincenzo\n  Sciancalepore, Alessio Zappone, Wonjae Shin","title":"Towards Integrated Sensing and Communications for 6G: A Standardization\n  Perspective","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The radio communication division of the International Telecommunication Union\n(ITU-R) has recently adopted Integrated Sensing and Communication (ISAC) among\nthe key usage scenarios for IMT-2030/6G. ISAC is envisioned to play a vital\nrole in the upcoming wireless generation standards. In this work, we bring\ntogether several paramount and innovative aspects of ISAC technology from a\nglobal 6G standardization perspective, including both industrial and academic\nprogress. Specifically, this article provides 6G requirements and ISAC-enabled\nvision, including various aspects of 6G standardization, benefits of ISAC\nco-existence, and integration challenges. Moreover, we present key enabling\ntechnologies, including intelligent metasurface-aided ISAC, as well as\nOrthogonal Time Frequency Space (OTFS) waveform design and interference\nmanagement for ISAC. Finally, future aspects are discussed to open various\nresearch opportunities and challenges on the ISAC technology towards 6G\nwireless communications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:37:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kaushik","Aryan",""],["Singh","Rohit",""],["Dayarathna","Shalanika",""],["Senanayake","Rajitha",""],["Di Renzo","Marco",""],["Dajer","Miguel",""],["Ji","Hyoungju",""],["Kim","Younsun",""],["Sciancalepore","Vincenzo",""],["Zappone","Alessio",""],["Shin","Wonjae",""]]}
{"id":"2308.01228","submitter":"Hao Wu","authors":"Hao Wu and Shengqin Xu","title":"Well-posedness and Long-time Behavior of a Bulk-surface Coupled\n  Cahn-Hilliard-diffusion System with Singular Potential for Lipid Raft\n  Formation","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 a bulk-surface coupled system that describes the processes of\nlipid-phase separation and lipid-cholesterol interaction on cell membranes, in\nwhich cholesterol exchange between cytosol and cell membrane is also\nincorporated. The PDE system consists of a surface Cahn-Hilliard equation for\nthe relative concentration of saturated/unsaturated lipids and a surface\ndiffusion-reaction equation for the cholesterol concentration on the membrane,\ntogether with a diffusion equation for the cytosolic cholesterol concentration\nin the bulk. The detailed coupling between bulk and surface evolutions is\ncharacterized by a mass exchange term $q$. For the system with a physically\nrelevant singular potential, we first prove the existence, uniqueness and\nregularity of global weak solutions to the full bulk-surface coupled system\nunder suitable assumptions on the initial data and the mass exchange term $q$.\nNext, we investigate the large cytosolic diffusion limit that gives a reduction\nof the full bulk-surface coupled system to a system of surface equations with\nnon-local contributions. Afterwards, we study the long-time behavior of global\nsolutions in two categories, i.e., the equilibrium and non-equilibrium models\naccording to different choices of the mass exchange term $q$. For the full\nbulk-surface coupled system with a decreasing total free energy, we prove that\nevery global weak solution converges to a single equilibrium as $t\\to +\\infty$.\nFor the reduced surface system with a mass exchange term of reaction type, we\nestablish the existence of a global attractor.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:38:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Hao",""],["Xu","Shengqin",""]]}
{"id":"2308.01229","submitter":"Andrea Capa Salinas","authors":"Andrea N. Capa Salinas, Brenden R. Ortiz, Calvin Bales, Jonathan\n  Frassineti, Vesna F. Mitrovi\\'c and Stephen D. Wilson","title":"Electron-hole asymmetry in the phase diagram of carrier-tuned\n  CsV$_3$Sb$_5$","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Here we study the effect of electron doping the kagome superconductor\nCsV$_3$Sb$_5$. Single crystals and powders of CsV$_3$Sb$_{5-x}$Te$_x$ are\nsynthesized and characterized via magnetic susceptibility, nuclear quadrupole\nresonance, and x-ray diffraction measurements, where we observe a slight\nsuppression of the charge density wave transition temperature and\nsuperconducting temperature with the introduction of electron dopants. In\ncontrast to hole-doping, both transitions survive relatively unperturbed up to\nthe solubility limit of Te within the lattice. A comparison is presented\nbetween the electronic phase diagrams of electron- and hole-tuned\nCsV$_3$Sb$_5$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:38:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Salinas","Andrea N. Capa",""],["Ortiz","Brenden R.",""],["Bales","Calvin",""],["Frassineti","Jonathan",""],["Mitrovi\u0107","Vesna F.",""],["Wilson","Stephen D.",""]]}
{"id":"2308.01230","submitter":"Roberto Maiolino","authors":"Roberto Maiolino, Jan Scholtz, Emma Curtis-Lake, Stefano Carniani,\n  William Baker, Anna de Graaff, Sandro Tacchella, Hannah \\\"Ubler, Francesco\n  D'Eugenio, Joris Witstok, Mirko Curti, Santiago Arribas, Andrew J. Bunker,\n  St\\'ephane Charlot, Jacopo Chevallard, Daniel J. Eisenstein, Eiichi Egami,\n  Zhiyuan Ji, Gareth C. Jones, Jianwei Lyu, Tim Rawle, Brant Robertson, Wiphu\n  Rujopakarn, Michele Perna, Fengwu Sun, Giacomo Venturi, Christina C.\n  Williams, and Chris Willott","title":"JADES. The diverse population of infant Black Holes at 4<z<11: merging,\n  tiny, poor, but mighty","comments":"Submitted to A&A, 25 pages, 13 figures, 4 tables; replaced with\n  updated M_BH-Mstar panel in Fig.7","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 12 new AGN at 4<z<7 in the JADES survey (in addition to the\npreviously identified AGN in GN-z11 at z=10.6) revealed through the detection\nof a Broad Line Region as seen in Halpha. The depth of JADES, together with the\nuse of three different spectral resolutions, enables us to probe a lower mass\nregime relative to previous studies. In a few cases we find evidence for two\nbroad components of Halpha which suggests that these could be candidate merging\nblack holes (BHs). The inferred BH masses range between 8 x 10^7 Msun down to 4\nx 10^5 Msun, interestingly probing the regime expected for Direct Collapse\nBlack Holes (DCBHs). The inferred AGN bolometric luminosities (~10^44-10^45\nerg/s) imply accretion rates that are < 0.5 times the Eddington rate in most\ncases. However, small BHs, with M_BH ~ 10^6 Msun, tend to accrete at Eddington\nor super-Eddington rates. These BH at z~4-11 are over-massive relative to their\nhost galaxies stellar masses when compared to the local M_BH-Mstar relation,\nand even approaching M_BH~Mstar, as expected for DCBHs and super-Eddington\nscenarios. However, we find that these early BHs tend to be more consistent\nwith the local relation between M_BH and velocity dispersion, as well as\nbetween M_BH and dynamical mass, suggesting that these are more fundamental and\nuniversal relations. On the BPT excitation-diagnostic diagram these AGN are\nlocated in the region that is that is locally occupied by star-forming\ngalaxies, implying that they would be missed by the standard classification\ntechniques if they did not display broad lines. Their location on the diagram\nis consistent with what expected for AGN hosted in metal poor galaxies (Z ~\n0.1-0.2 Zsun). The fraction of broad line AGN with L_AGN > 10^44 erg/s, among\ngalaxies in the redshift range 4<z<6, is about 10%, suggesting that the\ncontribution of AGN and their hosts to the reionization of the Universe is >\n10%.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:38:52 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 16:55:57 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 09:33:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Maiolino","Roberto",""],["Scholtz","Jan",""],["Curtis-Lake","Emma",""],["Carniani","Stefano",""],["Baker","William",""],["de Graaff","Anna",""],["Tacchella","Sandro",""],["\u00dcbler","Hannah",""],["D'Eugenio","Francesco",""],["Witstok","Joris",""],["Curti","Mirko",""],["Arribas","Santiago",""],["Bunker","Andrew J.",""],["Charlot","St\u00e9phane",""],["Chevallard","Jacopo",""],["Eisenstein","Daniel J.",""],["Egami","Eiichi",""],["Ji","Zhiyuan",""],["Jones","Gareth C.",""],["Lyu","Jianwei",""],["Rawle","Tim",""],["Robertson","Brant",""],["Rujopakarn","Wiphu",""],["Perna","Michele",""],["Sun","Fengwu",""],["Venturi","Giacomo",""],["Williams","Christina C.",""],["Willott","Chris",""]]}
{"id":"2308.01232","submitter":"Bayan Bekbolat","authors":"Bayan Bekbolat, Niyaz Tokmagambetov","title":"One inverse source problem generated by the Dunkl operator","comments":"20 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of this paper is to study time-fractional pseudo-parabolic type\nequations generated by the Dunkl operator. The forward problem is considered\nand its well-posedness is established. In particular, a prior estimates are\nobtained in the Sobolev type spaces and, explicit formulas for solutions of the\nproblems are derived. Here we also deal with the left-sided Caputo fractional\ntime derivative.\n  As an application, we investigate an inverse source problem. Existence and\nuniqueness of the solution is proved. Moreover, we show that a solution pair is\ncontinuously depending on the initial and additional data, finalizing with a\nnumerical test.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:39:26 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bekbolat","Bayan",""],["Tokmagambetov","Niyaz",""]]}
{"id":"2308.01233","submitter":"Martiros Khurshudyan","authors":"Martiros Khurshudyan","title":"Swampland criteria and neutrino generation in a non-cold dark matter\n  universe","comments":"accepted in Astrophysics (Astrofizika)","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, the implications of string Swampland criteria for a dark\nenergy-dominated universe, where we have a deviation from the cold dark matter\nmodel, will be discussed. In particular, we have considered two models. One of\nthem is one parameter model, while the second one has been crafted to reveal\nthe dynamics in the deviation. The analysis has been obtained through the use\nof Gaussian processes (GPs) and $H(z)$ expansion rate data (a $30$-point sample\ndeduced from a differential age method and a $10$-point sample obtained from\nthe radial BAO method). We learned that the tension with the Swampland criteria\nstill will survive as in the cases of the models where dark matter is cold. In\nthe analysis besides mentioned $40$-point $H(z)$ data, we used the latest\nvalues of $H_{0}$ reported by the Planck and Hubble missions to reveal possible\nsolutions for the $H_{0}$ tension problem. Finally, the constraints on the\nneutrino generation number have been obtained revealing interesting results to\nbe discussed yet. This and various related questions have been left to be\ndiscussed in forthcoming papers.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:40:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Khurshudyan","Martiros",""]]}
{"id":"2308.01234","submitter":"Olcay Goksu","authors":"Ates Goksu, Taylor Kutra, Yanqin Wu (Toronto)","title":"Eccentric Gas Disk Orbiting the White Dwarf SDSS J1228+1040","comments":"Submitted to 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":"  Metal pollution onto white dwarfs is a wide-spread phenomenon that remains\npuzzling. Some of these white dwarfs also harbour gaseous debris disks. Their\nemission lines open a unique window to the physical properties of the polluting\nmaterial, lending insights to their origin. Here, we model the emission line\nkinematics for the gas disk around SDSS J1228+1040, a system that has been\ncontinuously monitored for over two decades. Our model shows that the disk mass\nis strongly peaked at one solar radius (modulo the unknown inclination), and\nthe disk eccentricity decreases from a value of 0.44 at the disk inner edge, to\nnearly zero at the outer edge. This eccentricity profile is exactly what one\nexpects if the disk is in a global eccentric mode, precessing rigidly under the\ncombined forces of general relativity and gas pressure, and with a period of 20\nyrs. The gas disk contains a mass that is roughly equivalent to that of a\n100-km rocky body, while the mass of the accompanying dust disk is likely\ninsignificant. The disk eccentricity confirms an origin in tidal disruption,\nand we suggest that the disrupted body is sourced from a Mars-mass planetesimal\ndisk within a few AU. More detailed analysis of this disk is warranted.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:42:02 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Goksu","Ates","","Toronto"],["Kutra","Taylor","","Toronto"],["Wu","Yanqin","","Toronto"]]}
{"id":"2308.01235","submitter":"Stanislav Baturin","authors":"L.A. Shaposhnikov and S.S. Baturin","title":"Geometric wakes in collimators and step transitions of arbitrary\n  cross-sections: conformal mapping approach","comments":"11 pages 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.class-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present study, we extend the approach of the wake field conformal\nmapping technique to the case of the step transition and a collimator. We\nassume that all pipes have different arbitrary cross-sectional shapes. We\nderive simple analytical expressions for the lower and upper bounds of both\nlongitudinal and transverse wake potentials. We test the derived expressions\nagainst well-known formulas in several representative examples. The proposed\nmethod can greatly simplify the optimization of collimating sections as well as\nbecome a useful tool in the exploration of transverse beam shaping ideas.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:44:27 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Shaposhnikov","L. A.",""],["Baturin","S. S.",""]]}
{"id":"2308.01236","submitter":"Yana Wei","authors":"Yu Wu, Yana Wei, Haozhe Wang, Yongfei Liu, Sibei Yang, Xuming He","title":"Grounded Image Text Matching with Mismatched Relation Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces Grounded Image Text Matching with Mismatched Relation\n(GITM-MR), a novel visual-linguistic joint task that evaluates the relation\nunderstanding capabilities of transformer-based pre-trained models. GITM-MR\nrequires a model to first determine if an expression describes an image, then\nlocalize referred objects or ground the mismatched parts of the text. We\nprovide a benchmark for evaluating pre-trained models on this task, with a\nfocus on the challenging settings of limited data and out-of-distribution\nsentence lengths. Our evaluation demonstrates that pre-trained models lack data\nefficiency and length generalization ability. To address this, we propose the\nRelation-sensitive Correspondence Reasoning Network (RCRN), which incorporates\nrelation-aware reasoning via bi-directional message propagation guided by\nlanguage structure. RCRN can be interpreted as a modular program and delivers\nstrong performance in both length generalization and data efficiency.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:44:36 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 17:51:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wu","Yu",""],["Wei","Yana",""],["Wang","Haozhe",""],["Liu","Yongfei",""],["Yang","Sibei",""],["He","Xuming",""]]}
{"id":"2308.01237","submitter":"Pengzhou Cheng","authors":"Pengzhou Cheng, Lei Hua, Haobin Jiang, Mohammad Samie, Gongshen Liu","title":"LSF-IDM: Automotive Intrusion Detection Model with Lightweight\n  Attribution and Semantic Fusion","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous vehicles (AVs) are more vulnerable to network attacks due to the\nhigh connectivity and diverse communication modes between vehicles and external\nnetworks. Deep learning-based Intrusion detection, an effective method for\ndetecting network attacks, can provide functional safety as well as a real-time\ncommunication guarantee for vehicles, thereby being widely used for AVs.\nExisting works well for cyber-attacks such as simple-mode but become a higher\nfalse alarm with a resource-limited environment required when the attack is\nconcealed within a contextual feature. In this paper, we present a novel\nautomotive intrusion detection model with lightweight attribution and semantic\nfusion, named LSF-IDM. Our motivation is based on the observation that, when\ninjected the malicious packets to the in-vehicle networks (IVNs), the packet\nlog presents a strict order of context feature because of the periodicity and\nbroadcast nature of the CAN bus. Therefore, this model first captures the\ncontext as the semantic feature of messages by the BERT language framework.\nThereafter, the lightweight model (e.g., BiLSTM) learns the fused feature from\nan input packet's classification and its output distribution in BERT based on\nknowledge distillation. Experiment results demonstrate the effectiveness of our\nmethods in defending against several representative attacks from IVNs. We also\nperform the difference analysis of the proposed method with lightweight models\nand Bert to attain a deeper understanding of how the model balance detection\nperformance and model complexity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:48:33 GMT"},{"version":"v2","created":"Sun, 6 Aug 2023 01:02:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cheng","Pengzhou",""],["Hua","Lei",""],["Jiang","Haobin",""],["Samie","Mohammad",""],["Liu","Gongshen",""]]}
{"id":"2308.01238","submitter":"Roberto Turolla","authors":"Roberto Turolla, Roberto Taverna, Gian Luca Israel, Fabio Muleri,\n  Silvia Zane, Matteo Bachetti, Jeremy Heyl, Alessandro Di Marco, Ephraim Gau,\n  Henric Krawczynski, Mason Ng, Andrea Possenti, Juri Poutanen, Luca Baldini,\n  Giorgio Matt, Michela Negro, Ivan Agudo, Lucio Angelo Antonelli, Wayne H.\n  Baumgartner, Ronaldo Bellazzini, Stefano Bianchi, Stephen D. Bongiorno,\n  Raffaella Bonino, Alessandro Brez, Niccolo' Bucciantini, Fiamma Capitanio,\n  Simone Castellano, Elisabetta Cavazzuti, Chien-Ting J. Chen, Stefano Ciprini,\n  Enrico Costa, Alessandra De Rosa, Ettore Del Monte, Laura Di Gesu, Niccolo'\n  Di Lalla, Immacolata Donnarumma, Victor Doroshenko, Michal Doviak, Steven R.\n  Ehlert, Teruaki Enoto, Yuri Evangelista, Sergio Fabiani, Riccardo Ferrazzoli,\n  Javier A. Garcia, Shuichi Gunji, Kiyoshi Hayashida, Wataru Iwakiri, Svetlana\n  G. Jorstad, Philip Kaaret, Vladimir Karas, Fabian Kislat, Takao Kitaguchi,\n  Jeffrey Kolodziejczak, Fabio La Monaca, Luca Latronico, Ioannis Liodakis,\n  Simone Maldera, Alberto Manfreda, Frederic Marin, Andrea Marinucci, Alan P.\n  Marscher, Herman L. Marshall, Francesco Massaro, Ikuyuki Mitsuishi, Tsunefumi\n  Mizuno, Stephen Chi-Yung Ng, Stephen L. O'Dell, Nicola Omodei, Chiara\n  Oppedisano, Alessandro Papitto, George G. Pavlov, Abel L. Peirson, Matteo\n  Perri, Melissa Pesce-Rollins, Pierre-Olivier Petrucci, Maura Pilia, Simonetta\n  Puccetti, Brian Ramsey, John Rankin, Ajay Ratheesh, Oliver J. Roberts, Roger\n  W. Romani, Carmelo Sgro', Patrick Slane, Paolo Soffitta, Gloria Spandre,\n  Douglas A. Swartz, Toru Tamagawa, Fabrizio Tavecchio, Yuzuru Tawara, Allyn F.\n  Tennant, N. Thomas, Francesco Tombesi, Alessio Trois, Sergey S. Tsygankov,\n  Jacco Vink, Martin C. Weisskopf, Kinwah Wu, Fei Xie","title":"IXPE and XMM-Newton observations of the Soft Gamma Repeater SGR 1806-20","comments":"11 pages, 3 figures, 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-nc-nd/4.0/","abstract":"  Recent observations with the Imaging X-ray Polarimetry Explorer (IXPE) of two\nanomalous X-ray pulsars provided evidence that X-ray emission from magnetar\nsources is strongly polarized. Here we report on the joint IXPE and XMM-Newton\nobservations of the soft {\\gamma}-repeater SGR 1806-20. The spectral and timing\nproperties of SGR 1806-20 derived from XMM-Newton data are in broad agreement\nwith previous measurements; however, we found the source at an all-time-low\npersistent flux level. No significant polarization was measured apart from the\n4-5 keV energy range, where a probable detection with PD=31.6\\pm 10.5% and\nPA=-17.6\\pm 15 deg was obtained. The resulting polarization signal, together\nwith the upper limits we derive at lower and higher energies 2-4 and 5-8 keV,\nrespectively) is compatible with a picture in which thermal radiation from the\ncondensed star surface is reprocessed by resonant Compton scattering in the\nmagnetosphere, similar to what proposed for the bright magnetar 4U 0142+61.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:51:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Turolla","Roberto",""],["Taverna","Roberto",""],["Israel","Gian Luca",""],["Muleri","Fabio",""],["Zane","Silvia",""],["Bachetti","Matteo",""],["Heyl","Jeremy",""],["Di Marco","Alessandro",""],["Gau","Ephraim",""],["Krawczynski","Henric",""],["Ng","Mason",""],["Possenti","Andrea",""],["Poutanen","Juri",""],["Baldini","Luca",""],["Matt","Giorgio",""],["Negro","Michela",""],["Agudo","Ivan",""],["Antonelli","Lucio Angelo",""],["Baumgartner","Wayne H.",""],["Bellazzini","Ronaldo",""],["Bianchi","Stefano",""],["Bongiorno","Stephen D.",""],["Bonino","Raffaella",""],["Brez","Alessandro",""],["Bucciantini","Niccolo'",""],["Capitanio","Fiamma",""],["Castellano","Simone",""],["Cavazzuti","Elisabetta",""],["Chen","Chien-Ting J.",""],["Ciprini","Stefano",""],["Costa","Enrico",""],["De Rosa","Alessandra",""],["Del Monte","Ettore",""],["Di Gesu","Laura",""],["Di Lalla","Niccolo'",""],["Donnarumma","Immacolata",""],["Doroshenko","Victor",""],["Doviak","Michal",""],["Ehlert","Steven R.",""],["Enoto","Teruaki",""],["Evangelista","Yuri",""],["Fabiani","Sergio",""],["Ferrazzoli","Riccardo",""],["Garcia","Javier A.",""],["Gunji","Shuichi",""],["Hayashida","Kiyoshi",""],["Iwakiri","Wataru",""],["Jorstad","Svetlana G.",""],["Kaaret","Philip",""],["Karas","Vladimir",""],["Kislat","Fabian",""],["Kitaguchi","Takao",""],["Kolodziejczak","Jeffrey",""],["La Monaca","Fabio",""],["Latronico","Luca",""],["Liodakis","Ioannis",""],["Maldera","Simone",""],["Manfreda","Alberto",""],["Marin","Frederic",""],["Marinucci","Andrea",""],["Marscher","Alan P.",""],["Marshall","Herman L.",""],["Massaro","Francesco",""],["Mitsuishi","Ikuyuki",""],["Mizuno","Tsunefumi",""],["Ng","Stephen Chi-Yung",""],["O'Dell","Stephen L.",""],["Omodei","Nicola",""],["Oppedisano","Chiara",""],["Papitto","Alessandro",""],["Pavlov","George G.",""],["Peirson","Abel L.",""],["Perri","Matteo",""],["Pesce-Rollins","Melissa",""],["Petrucci","Pierre-Olivier",""],["Pilia","Maura",""],["Puccetti","Simonetta",""],["Ramsey","Brian",""],["Rankin","John",""],["Ratheesh","Ajay",""],["Roberts","Oliver J.",""],["Romani","Roger W.",""],["Sgro'","Carmelo",""],["Slane","Patrick",""],["Soffitta","Paolo",""],["Spandre","Gloria",""],["Swartz","Douglas A.",""],["Tamagawa","Toru",""],["Tavecchio","Fabrizio",""],["Tawara","Yuzuru",""],["Tennant","Allyn F.",""],["Thomas","N.",""],["Tombesi","Francesco",""],["Trois","Alessio",""],["Tsygankov","Sergey S.",""],["Vink","Jacco",""],["Weisskopf","Martin C.",""],["Wu","Kinwah",""],["Xie","Fei",""]]}
{"id":"2308.01239","submitter":"Fenghe Tang","authors":"Fenghe Tang, Jianrui Ding, Lingtao Wang, Chunping Ning, S. Kevin Zhou","title":"CMUNeXt: An Efficient Medical Image Segmentation Network based on Large\n  Kernel and Skip Fusion","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The U-shaped architecture has emerged as a crucial paradigm in the design of\nmedical image segmentation networks. However, due to the inherent local\nlimitations of convolution, a fully convolutional segmentation network with\nU-shaped architecture struggles to effectively extract global context\ninformation, which is vital for the precise localization of lesions. While\nhybrid architectures combining CNNs and Transformers can address these issues,\ntheir application in real medical scenarios is limited due to the computational\nresource constraints imposed by the environment and edge devices. In addition,\nthe convolutional inductive bias in lightweight networks adeptly fits the\nscarce medical data, which is lacking in the Transformer based network. In\norder to extract global context information while taking advantage of the\ninductive bias, we propose CMUNeXt, an efficient fully convolutional\nlightweight medical image segmentation network, which enables fast and accurate\nauxiliary diagnosis in real scene scenarios. CMUNeXt leverages large kernel and\ninverted bottleneck design to thoroughly mix distant spatial and location\ninformation, efficiently extracting global context information. We also\nintroduce the Skip-Fusion block, designed to enable smooth skip-connections and\nensure ample feature fusion. Experimental results on multiple medical image\ndatasets demonstrate that CMUNeXt outperforms existing heavyweight and\nlightweight medical image segmentation networks in terms of segmentation\nperformance, while offering a faster inference speed, lighter weights, and a\nreduced computational cost. The code is available at\nhttps://github.com/FengheTan9/CMUNeXt.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:54:00 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 02:05:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Tang","Fenghe",""],["Ding","Jianrui",""],["Wang","Lingtao",""],["Ning","Chunping",""],["Zhou","S. Kevin",""]]}
{"id":"2308.01240","submitter":"Zhiqiang Yuan","authors":"Zhiqiang Yuan, Junwei Liu, Qiancheng Zi, Mingwei Liu, Xin Peng, Yiling\n  Lou","title":"Evaluating Instruction-Tuned Large Language Models on Code Comprehension\n  and 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":"  In this work, we evaluate 10 open-source instructed LLMs on four\nrepresentative code comprehension and generation tasks. We have the following\nmain findings. First, for the zero-shot setting, instructed LLMs are very\ncompetitive on code comprehension and generation tasks and sometimes even\nbetter than small SOTA models specifically fine-tuned on each downstream task.\nWe also find that larger instructed LLMs are not always better on code-related\ntasks. Second, for the few-shot setting, we find that adding demonstration\nexamples substantially helps instructed LLMs perform better on most code\ncomprehension and generation tasks; however, the examples would sometimes\ninduce unstable or even worse performance. Furthermore, we find widely-used\nBM25-based shot selection strategy significantly outperforms the basic random\nselection or fixed selection only on generation problems. Third, for the\nfine-tuning setting, we find that fine-tuning could further improve the model\nperformance on downstream code comprehension and generation tasks compared to\nthe zero-shot/one-shot performance. In addition, after being fine-tuned on the\nsame downstream task dataset, instructed LLMs outperform both the small SOTA\nmodels and similar-scaled LLMs without instruction tuning. Based on our\nfindings, we further present practical implications on model and usage\nrecommendation, performance and cost trade-offs, and future direction.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:54:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Yuan","Zhiqiang",""],["Liu","Junwei",""],["Zi","Qiancheng",""],["Liu","Mingwei",""],["Peng","Xin",""],["Lou","Yiling",""]]}
{"id":"2308.01241","submitter":"Wenlian Lu","authors":"Wenlian Lu, Longbin Zeng, Xin Du, Wenyong Zhang, Shitong Xiang, Huarui\n  Wang, Jiexiang Wang, Mingda Ji, Yubo Hou, Minglong Wang, Yuhao Liu, Zhongyu\n  Chen, Qibao Zheng, Ningsheng Xu, Jianfeng Feng","title":"Digital Twin Brain: a simulation and assimilation platform for whole\n  human brain","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we present a computing platform named digital twin brain (DTB)\nthat can simulate spiking neuronal networks of the whole human brain scale and\nmore importantly, a personalized biological brain structure. In comparison to\nmost brain simulations with a homogeneous global structure, we highlight that\nthe sparseness, couplingness and heterogeneity in the sMRI, DTI and PET data of\nthe brain has an essential impact on the efficiency of brain simulation, which\nis proved from the scaling experiments that the DTB of human brain simulation\nis communication-intensive and memory-access intensive computing systems rather\nthan computation-intensive. We utilize a number of optimization techniques to\nbalance and integrate the computation loads and communication traffics from the\nheterogeneous biological structure to the general GPU-based HPC and achieve\nleading simulation performance for the whole human brain-scaled spiking\nneuronal networks. On the other hand, the biological structure, equipped with a\nmesoscopic data assimilation, enables the DTB to investigate brain cognitive\nfunction by a reverse-engineering method, which is demonstrated by a digital\nexperiment of visual evaluation on the DTB. Furthermore, we believe that the\ndeveloping DTB will be a promising powerful platform for a large of research\norients including brain-inspiredintelligence, rain disease medicine and\nbrain-machine interface.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:56:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lu","Wenlian",""],["Zeng","Longbin",""],["Du","Xin",""],["Zhang","Wenyong",""],["Xiang","Shitong",""],["Wang","Huarui",""],["Wang","Jiexiang",""],["Ji","Mingda",""],["Hou","Yubo",""],["Wang","Minglong",""],["Liu","Yuhao",""],["Chen","Zhongyu",""],["Zheng","Qibao",""],["Xu","Ningsheng",""],["Feng","Jianfeng",""]]}
{"id":"2308.01242","submitter":"Andrea Jimenez","authors":"Andrea Jim\\'enez, Jessica Mcdonald, Reza Naserasr, Kathryn Nurse and\n  Daniel A. Quiroz","title":"Balanced-chromatic number and Hadwiger-like conjectures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by different characterizations of planar graphs and the 4-Color\nTheorem, several structural results concerning graphs of high chromatic number\nhave been obtained. Toward strengthening some of these results, we consider the\n\\emph{balanced chromatic number}, $\\chi_b(\\hat{G})$, of a signed graph\n$\\hat{G}$. This is the minimum number of parts into which the vertices of a\nsigned graph can be partitioned so that none of the parts induces a negative\ncycle. This extends the notion of the chromatic number of a graph since\n$\\chi(G)=\\chi_b(\\tilde{G})$, where $\\tilde{G}$ denotes the signed graph\nobtained from~$G$ by replacing each edge with a pair of (parallel) positive and\nnegative edges. We introduce a signed version of Hadwiger's conjecture as\nfollows.\n  Conjecture: If a signed graph $\\hat{G}$ has no negative loop and no\n$\\tilde{K_t}$-minor, then its balanced chromatic number is at most $t-1$.\n  We prove that this conjecture is, in fact, equivalent to Hadwiger's\nconjecture and show its relation to the Odd Hadwiger Conjecture.\n  Motivated by these results, we also consider the relation between\nsubdivisions and balanced chromatic number. We prove that if $(G, \\sigma)$ has\nno negative loop and no $\\tilde{K_t}$-subdivision, then it admits a balanced\n$\\frac{79}{2}t^2$-coloring. This qualitatively generalizes a result of\nKawarabayashi (2013) on totally odd subdivisions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:57:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Jim\u00e9nez","Andrea",""],["Mcdonald","Jessica",""],["Naserasr","Reza",""],["Nurse","Kathryn",""],["Quiroz","Daniel A.",""]]}
{"id":"2308.01243","submitter":"Luis L\\'opez","authors":"L. A. L\\'opez and Omar Pedraza","title":"Quasinormal modes of the Schwarzchild black hole with a deficit solid\n  angle and quintessence-like matter: Scalar and electromagnetic perturbations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the quasinormal modes (QNM) for scalar, and electromagnetic\nperturbations in the Schwarzchild black hole with a deficit solid angle and\nquintessence-like matter. Using the sixth--order WKB approximation and the\nimproved asymptotic iteration method (AIM) we can determine the dependence of\nthe quasinormal modes on the parameters of the black hole and the parameters on\nthe test fields. The values of the real part and imaginary parts of the\nquasi--normal modes increase with the decrease of the values of the deficit\nsolid angle and density of quintessence-like matter. The quasinormal modes\ngotten by these two methods are in good agreement. Using the finite difference\nmethod, we obtain the time evolution profile of such perturbations in this\nBlack Hole.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:58:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["L\u00f3pez","L. A.",""],["Pedraza","Omar",""]]}
{"id":"2308.01244","submitter":"Prisco Lo Chiatto","authors":"Prisco Lo Chiatto, Sebastian Schenk, Felix Yu","title":"Quantum Imprint of the Anharmonic Oscillator","comments":"23 pages","journal-ref":null,"doi":null,"report-no":"MITP-23-034","categories":"hep-th hep-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the anharmonic double well in quantum mechanics using exact\nWentzel-Kramers-Brillouin (WKB) methods in a 't Hooft-like double scaling limit\nwhere classical behavior is expected to dominate. We compute the tunneling\naction in this double scaling limit, and compare it to the transition amplitude\nfrom the vacuum to a highly excited state. Our results, exact in the\nsemiclassical limit, show that the two expressions coincide, apart from an\nirreducible and surprising instanton contribution. Thus, the semiclassical\nlimit of the anharmonic oscillator betrays its quantum origin as a rule, which\nwe dub the \"quantum imprint rule,\" showing that the quantum theory is\nintrinsically gapped from classical behavior. Besides an example of the failure\nof reductionism and an example of a resurgent connection between perturbative\nand nonperturbative physics, this work provides a possible classification of\ntheories according to their quantum imprints.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:58:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Chiatto","Prisco Lo",""],["Schenk","Sebastian",""],["Yu","Felix",""]]}
{"id":"2308.01245","submitter":"Andrew Krause","authors":"Benjamin J. Walker, Adam K. Townsend, Alexander K. Chudasama, Andrew\n  L. Krause","title":"VisualPDE: rapid interactive simulations of partial differential\n  equations","comments":"18 pages, 7 figures. This is a companion paper to the website\n  https://visualpde.com/","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph nlin.PS physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computing has revolutionised the study of complex nonlinear systems, both by\nallowing us to solve previously intractable models and through the ability to\nvisualise solutions in different ways. Using ubiquitous computing\ninfrastructure, we hope to convince the reader that we can go one step further\nin using computers to understand complex models through instantaneous and\ninteractive exploration. This has enormous potential in education, outreach and\nresearch. Here, we present VisualPDE, an online, interactive solver for a broad\nclass of 1D and 2D PDE systems. Abstract dynamical systems concepts such as\nsymmetry-breaking instabilities, subcritical bifurcations and the role of\ninitial data in multistable nonlinear models become much more intuitive when\nyou can play with these models yourself, and immediately answer questions about\nhow the system responds to changes in parameters, initial conditions, boundary\nconditions or even spatiotemporal forcing. Importantly, VisualPDE is freely\navailable, open source and highly customisable. We give several examples in\nteaching, research and knowledge exchange, providing high-level discussions of\nhow it may be employed in different settings. This includes designing web-based\ncourse materials structured around interactive simulations, or easily crafting\nspecific simulations that can be shared with students or collaborators via a\nsimple URL. We envisage VisualPDE becoming an invaluable resource for teaching\nand research in mathematical biology and beyond. We also hope that it inspires\nother efforts to make mathematics more interactive and accessible.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:00:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Walker","Benjamin J.",""],["Townsend","Adam K.",""],["Chudasama","Alexander K.",""],["Krause","Andrew L.",""]]}
{"id":"2308.01246","submitter":"Jyotirmaya Shivottam Mr.","authors":"Jyotirmaya Shivottam and Subhankar Mishra","title":"Tirtha -- An Automated Platform to Crowdsource Images and Create 3D\n  Models of Heritage Sites","comments":"Accepted at The 28th International ACM Conference on 3D Web\n  Technology (Web3D 2023)","journal-ref":null,"doi":"10.1145/3611314.3615904","report-no":null,"categories":"cs.CV cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Digital preservation of Cultural Heritage (CH) sites is crucial to protect\nthem against damage from natural disasters or human activities. Creating 3D\nmodels of CH sites has become a popular method of digital preservation thanks\nto advancements in computer vision and photogrammetry. However, the process is\ntime-consuming, expensive, and typically requires specialized equipment and\nexpertise, posing challenges in resource-limited developing countries.\nAdditionally, the lack of an open repository for 3D models hinders research and\npublic engagement with their heritage. To address these issues, we propose\nTirtha, a web platform for crowdsourcing images of CH sites and creating their\n3D models. Tirtha utilizes state-of-the-art Structure from Motion (SfM) and\nMulti-View Stereo (MVS) techniques. It is modular, extensible and\ncost-effective, allowing for the incorporation of new techniques as\nphotogrammetry advances. Tirtha is accessible through a web interface at\nhttps://tirtha.niser.ac.in and can be deployed on-premise or in a cloud\nenvironment. In our case studies, we demonstrate the pipeline's effectiveness\nby creating 3D models of temples in Odisha, India, using crowdsourced images.\nThese models are available for viewing, interaction, and download on the Tirtha\nwebsite. Our work aims to provide a dataset of crowdsourced images and 3D\nreconstructions for research in computer vision, heritage conservation, and\nrelated domains. Overall, Tirtha is a step towards democratizing digital\npreservation, primarily in resource-limited developing countries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:00:39 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 17:39:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shivottam","Jyotirmaya",""],["Mishra","Subhankar",""]]}
{"id":"2308.01247","submitter":"Rigoberto Zelada","authors":"Bassam Fayad, Adam Kanigowski, Rigoberto Zelada","title":"A non-mixing Arnold flow on a surface","comments":"50 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a smooth area preserving flow on a genus 2 surface with exactly\none open uniquely ergodic component, that is asymmetrically bounded by\nseparatrices of non-degenerate saddles and that is nevertheless not mixing.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:01:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Fayad","Bassam",""],["Kanigowski","Adam",""],["Zelada","Rigoberto",""]]}
{"id":"2308.01248","submitter":"Vincenzo Mariano Scarrica","authors":"Vincenzo Mariano Scarrica, Ciro Panariello, Alessio Ferone, Antonino\n  Staiano","title":"A Hybrid Approach To Real-Time Multi-Object Tracking","comments":"11 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-Object Tracking, also known as Multi-Target Tracking, is a significant\narea of computer vision that has many uses in a variety of settings. The\ndevelopment of deep learning, which has encouraged researchers to propose more\nand more work in this direction, has significantly impacted the scientific\nadvancement around the study of tracking as well as many other domains related\nto computer vision. In fact, all of the solutions that are currently\nstate-of-the-art in the literature and in the tracking industry, are built on\ntop of deep learning methodologies that produce exceptionally good results.\nDeep learning is enabled thanks to the ever more powerful technology\nresearchers can use to handle the significant computational resources demanded\nby these models. However, when real-time is a main requirement, developing a\ntracking system without being constrained by expensive hardware support with\nenormous computational resources is necessary to widen tracking applications in\nreal-world contexts. To this end, a compromise is to combine powerful deep\nstrategies with more traditional approaches to favor considerably lower\nprocessing solutions at the cost of less accurate tracking results even though\nsuitable for real-time domains. Indeed, the present work goes in that\ndirection, proposing a hybrid strategy for real-time multi-target tracking that\ncombines effectively a classical optical flow algorithm with a deep learning\narchitecture, targeted to a human-crowd tracking system exhibiting a desirable\ntrade-off between performance in tracking precision and computational costs.\nThe developed architecture was experimented with different settings, and\nyielded a MOTA of 0.608 out of the compared state-of-the-art 0.549 results, and\nabout half the running time when introducing the optical flow phase, achieving\nalmost the same performance in terms of accuracy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:02:42 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Scarrica","Vincenzo Mariano",""],["Panariello","Ciro",""],["Ferone","Alessio",""],["Staiano","Antonino",""]]}
{"id":"2308.01249","submitter":"Haizheng Li","authors":"Haizheng Li and Laurent Schmalen","title":"A Spatially Coupled LDPC Coding Scheme with Scalable Decoders for Space\n  Division Multiplexing","comments":"3 pages plus comments, 3 figures, European Conference on Optical\n  Communication (ECOC) 2023","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 study the application of spatially coupled LDPC codes with\nsub-block locality for space division multiplexing. We focus on the information\nexchange between the sub-blocks and compare decoding strategies with respect to\nthe complexity, performance and the information flow.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:09:07 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Haizheng",""],["Schmalen","Laurent",""]]}
{"id":"2308.01250","submitter":"Andres Ruderman","authors":"Andr\\'es Ruderman, M. B. Oviedo, S. A. Paz, and E. P. M. Leiva","title":"Diversity of behavior after collisions of Sn and Si nanoparticles found\n  using a new Density-Functional Tight-Binding model","comments":"13 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a new approach to studying nanoparticle collisions using Density\nFunctional based Tight Binding (DFTB). A novel DFTB parameterisation has been\ndeveloped to study the collision process of Sn and Si nanoparticles (NPs) using\nMolecular Dynamics (MD). While bulk structures were used as training sets, we\nshow that our model is able to accurately reproduce the cohesive energy of the\nnanoparticles using Density Functional Theory (DFT) as a reference. A\nsurprising variety of phenomena are revealed for the Si/Sn nanoparticle\ncollisions, depending on the size and velocity of the collision: from\ncore-shell structure formation to bounce-off phenomena.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:09:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ruderman","Andr\u00e9s",""],["Oviedo","M. B.",""],["Paz","S. A.",""],["Leiva","E. P. M.",""]]}
{"id":"2308.01251","submitter":"Yiming Zhou","authors":"Yiming Zhou, Yuexing Peng, Wei Li, Junchuan Yu, Daqing Ge, Wei Xiang","title":"A Hyper-pixel-wise Contrastive Learning Augmented Segmentation Network\n  for Old Landslide Detection Using High-Resolution Remote Sensing Images and\n  Digital Elevation Model Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a harzard disaster, landslide often brings tremendous losses to humanity,\nso it's necessary to achieve reliable detection of landslide. However, the\nproblems of visual blur and small-sized dataset cause great challenges for old\nlandslide detection task when using remote sensing data. To reliably extract\nsemantic features, a hyper-pixel-wise contrastive learning augmented\nsegmentation network (HPCL-Net) is proposed, which augments the local salient\nfeature extraction from the boundaries of landslides through HPCL and fuses the\nheterogeneous infromation in the semantic space from High-Resolution Remote\nSensing Images and Digital Elevation Model Data data. For full utilization of\nthe precious samples, a global hyper-pixel-wise sample pair queues-based\ncontrastive learning method, which includes the construction of global queues\nthat store hyper-pixel-wise samples and the updating scheme of a momentum\nencoder, is developed, reliably enhancing the extraction ability of semantic\nfeatures. The proposed HPCL-Net is evaluated on a Loess Plateau old landslide\ndataset and experiment results show that the model greatly improves the\nreliablity of old landslide detection compared to the previous old landslide\nsegmentation model, where mIoU metric is increased from 0.620 to 0.651,\nLandslide IoU metric is increased from 0.334 to 0.394 and F1-score metric is\nincreased from 0.501 to 0.565.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:11:51 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhou","Yiming",""],["Peng","Yuexing",""],["Li","Wei",""],["Yu","Junchuan",""],["Ge","Daqing",""],["Xiang","Wei",""]]}
{"id":"2308.01252","submitter":"Ruyu Wang","authors":"Ruyu Wang, Chao Zhang","title":"Stochastic smoothing accelerated gradient method for nonsmooth convex\n  composite optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a novel stochastic smoothing accelerated gradient (SSAG) method\nfor general constrained nonsmooth convex composite optimization, and analyze\nthe convergence rates. The SSAG method allows various smoothing techniques, and\ncan deal with the nonsmooth term that is not easy to compute its proximal term,\nor that does not own the linear max structure. To the best of our knowledge, it\nis the first stochastic approximation type method with solid convergence result\nto solve the convex composite optimization problem whose nonsmooth term is the\nmaximization of numerous nonlinear convex functions. We prove that the SSAG\nmethod achieves the best-known complexity bounds in terms of the stochastic\nfirst-order oracle ($\\mathcal{SFO}$), using either diminishing smoothing\nparameters or a fixed smoothing parameter. We give two applications of our\nresults to distributionally robust optimization problems. Numerical results on\nthe two applications demonstrate the effectiveness and efficiency of the\nproposed SSAG method.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:13:23 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 18:16:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Ruyu",""],["Zhang","Chao",""]]}
{"id":"2308.01253","submitter":"The CMS Collaboration","authors":"CMS Collaboration","title":"Measurement of the Higgs boson production via vector boson fusion and\n  its decay into bottom quarks in proton-proton collisions at $\\sqrt{s}$ = 13\n  TeV","comments":"Submitted to the Journal of High Energy Physics. All figures and\n  tables can be found at\n  http://cms-results.web.cern.ch/cms-results/public-results/publications/HIG-22-009\n  (CMS Public Pages)","journal-ref":null,"doi":null,"report-no":"CMS-HIG-22-009, CERN-EP-2023-110","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A measurement of the Higgs boson (H) production via vector boson fusion (VBF)\nand its decay into a bottom quark-antiquark pair ($\\mathrm{b\\bar{b}}$) is\npresented using proton-proton collision data recorded by the CMS experiment at\n$\\sqrt{s}$ = 13 TeV and corresponding to an integrated luminosity of 90.8\nfb$^{-1}$. Treating the gluon-gluon fusion process as a background and\nconstraining its rate to the value expected in the standard model (SM) within\nuncertainties, the signal strength of the VBF process, defined as the ratio of\nthe observed signal rate to that predicted by the SM, is measured to be\n$\\mu^\\text{qqH}_\\mathrm{Hb\\bar{b}}$ = 1.01$^{+0.55}_{-0.46}$. The VBF signal is\nobserved with a significance of 2.4 standard deviations relative to the\nbackground prediction, while the expected significance is 2.7 standard\ndeviations. Considering inclusive Higgs boson production and decay into bottom\nquarks, the signal strength is measured to be\n$\\mu^\\text{incl.}_\\mathrm{Hb\\bar{b}}$ = 0.99$^{+0.48}_{-0.41}$, corresponding\nto an observed (expected) significance of 2.6 (2.9) standard deviations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:13:24 GMT"}],"update_date":"2023-08-03","authors_parsed":[["CMS Collaboration","",""]]}
{"id":"2308.01254","submitter":"Sarah Louisa Pitz","authors":"Sarah Louisa Pitz and J\\\"urgen Schaffner-Bielich","title":"Generating ultra compact boson stars with modified scalar potentials","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The properties of selfinteracting boson stars with different scalar\npotentials going beyond the commonly used $\\phi^4$ ansatz are studied. The\nscalar potential is extended to different values of the exponent $n$ of the\nform $V \\propto \\phi^n$. Two stability mechanism for boson stars are\nintroduced, the first being a mass term and the second one a vacuum term. We\npresent analytic scale-invariant expressions for these two classes of equations\nof state. The resulting properties of the boson star configurations differ\nconsiderably from previous calculations. We find three different categories of\nmass-radius relation: the first category resembles the mass-radius curve of\nselfbound stars, the second one those of neutron stars and the third one is the\nwell known constant radius case from the standard $\\phi^4$ potential. We\ndemonstrate that the maximal compactness can reach extremely high values going\nto the limit of causality $C_\\text{max} = 0.354$ asymptotically for\n$n\\to\\infty$. The maximal compactnesses exceed previously calculated values of\n$C_\\text{max}=0.16$ for the standard $\\phi^4$-theory and $C_\\text{max}=0.21$\nfor vector-like interactions and is in line with previous results for solitonic\nboson stars. Hence, boson stars even described by a simple modified scalar\npotential in the form of $V \\propto \\phi^n$ can be ultra compact black hole\nmimickers where the photon ring is located outside the radius of the star.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:15:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Pitz","Sarah Louisa",""],["Schaffner-Bielich","J\u00fcrgen",""]]}
{"id":"2308.01255","submitter":"YunZhuo Fan","authors":"Yun-Zhuo Fan and Dan-Bo Zhang","title":"Full-counting statistics of particle distribution on a digital quantum\n  computer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Full-counting statistics (FCS) provides a powerful framework to access the\nstatistical information of a system from the characteristic function. However,\napplications of FCS for generic interacting quantum systems often be hindered\nby the intrinsic difficulty of classical simulation of quantum many-body\nproblems. Here, we propose a quantum algorithm for FCS that can obtain both the\nparticle distribution and cumulants of interacting systems. The algorithm\nevaluates the characteristic functions by quantum computing and then extracts\nthe distribution and cumulants with classical post-processing. With digital\nsignal processing theory, we analyze the dependency of accuracy with the number\nof sampling points for the characteristic functions. We show that the desired\nnumber of sampling points for accurate FCS can be reduced by filtering some\ncomponents of the quantum state that are not of interest. By numeral\nsimulation, we demonstrate FCS of domain walls for the mixed Ising model. The\nalgorithm suggests an avenue for studying full-counting statistics on quantum\ncomputers.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:19:52 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 09:06:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fan","Yun-Zhuo",""],["Zhang","Dan-Bo",""]]}
{"id":"2308.01256","submitter":"Vincenzo Mariano Scarrica","authors":"Vincenzo Mariano Scarrica, Antonino Staiano","title":"Learning Spatial Distribution of Long-Term Trackers Scores","comments":"20 pages, 11 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Long-Term tracking is a hot topic in Computer Vision. In this context,\ncompetitive models are presented every year, showing a constant growth rate in\nperformances, mainly measured in standardized protocols as Visual Object\nTracking (VOT) and Object Tracking Benchmark (OTB). Fusion-trackers strategy\nhas been applied over last few years for overcoming the known re-detection\nproblem, turning out to be an important breakthrough. Following this approach,\nthis work aims to generalize the fusion concept to an arbitrary number of\ntrackers used as baseline trackers in the pipeline, leveraging a learning phase\nto better understand how outcomes correlate with each other, even when no\ntarget is present. A model and data independence conjecture will be evidenced\nin the manuscript, yielding a recall of 0.738 on LTB-50 dataset when learning\nfrom VOT-LT2022, and 0.619 by reversing the two datasets. In both cases,\nresults are strongly competitive with state-of-the-art and recall turns out to\nbe the first on the podium.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:26:54 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Scarrica","Vincenzo Mariano",""],["Staiano","Antonino",""]]}
{"id":"2308.01257","submitter":"Anna Fang","authors":"Anna Fang, Wenjie Yang, Haiyi Zhu","title":"Shaping Online Dialogue: Examining How Community Rules Affect Discussion\n  Structures on Reddit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Community rules play a key part in enabling or constraining the behaviors of\nmembers in online communities. However, little is unknown regarding whether and\nto what degree changing rules actually affects community dynamics. In this\npaper, we seek to understand how these behavior-governing rules shape the\ninteractions between users, as well as the structure of their discussion. Using\nthe top communities on Reddit (i.e. subreddits), we first contribute a taxonomy\nof behavior-based rule categories across Reddit. Then, we use a network\nanalysis perspective to discover how changing implementation of different rule\ncategories affects subreddits' user interaction and discussion networks over a\n1.5 year period. Our study find several significant effects, including greater\nclustering among users when subreddits increase rules focused on structural\nregulation and how restricting allowable content surprisingly leads to more\ninteractions between users. Our findings contribute to research in proactive\nmoderation through rule setting, as well as lend valuable insights for online\ncommunity designers and moderators to achieve desired community dynamics.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:27:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Fang","Anna",""],["Yang","Wenjie",""],["Zhu","Haiyi",""]]}
{"id":"2308.01258","submitter":"Jaime Gutierrez","authors":"Jaime Gutierrez and Jorge Jimenez Urroz","title":"Permutation and local permutation polynomial of maximum degree","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":"  Let $F_q$ be the finite field with $q$ elements and $F_q[x_1,\\ldots, x_n]$\nthe ring of polynomials in $n$ variables over $F_q$. In this paper we consider\npermutation polynomials and local permutation polynomials over $F_q[x_1,\\ldots,\nx_n]$, which define interesting generalizations of permutations over finite\nfields. We are able to construct permutation polynomials in $F_q[x_1,\\ldots,\nx_n]$ of maximum degree $n(q-1)-1$ and local permutation polynomials in\n$F_q[x_1,\\ldots, x_n]$ of maximum degree $n(q-2)$ when $q>3$, extending\nprevious results.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:28:37 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 12:30:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gutierrez","Jaime",""],["Urroz","Jorge Jimenez",""]]}
{"id":"2308.01259","submitter":"Anton Lipin","authors":"Anton Lipin","title":"On resolvability, connectedness and pseudocompactness","comments":"12 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that:\n  I. If $L$ is a $T_1$ space, $|L|>1$ and $d(L) \\leq \\kappa \\geq \\omega$, then\nthere is a submaximal dense subspace $X$ of $L^{2^\\kappa}$ such that\n$|X|=\\Delta(X)=\\kappa$;\n  II. If $\\frak{c}\\leq\\kappa=\\kappa^\\omega<\\lambda$ and $2^\\kappa=2^\\lambda$,\nthen there is a Tychonoff pseudocompact globally and locally connected space\n$X$ such that $|X|=\\Delta(X)=\\lambda$ and $X$ is not $\\kappa^+$-resolvable;\n  III. If $\\omega_1\\leq\\kappa<\\lambda$ and $2^\\kappa=2^\\lambda$, then there is\na regular space $X$ such that $|X|=\\Delta(X)=\\lambda$, all continuous\nreal-valued functions on $X$ are constant (so $X$ is pseudocompact and\nconnected) and $X$ is not $\\kappa^+$-resolvable.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:29:35 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lipin","Anton",""]]}
{"id":"2308.01260","submitter":"Gennaro Vitucci","authors":"Gennaro Vitucci","title":"Cruciform specimens biaxial extension performance relationship to\n  constitutive identification","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":"  Main desired features of biaxial tests are: uniformity of stresses and\nstrains; high strain levels in gauge areas; reliable constitutive parameters\nidentification. Despite cruciform specimen suitability to modern tensile\ndevices, standard testing techniques are still debated because of difficulties\nin matching these demands. This work aims at providing rational performance\nobjectives and efficient cruciform specimens shapes in view of constitutive\nparameter fitting. Objective performance is evaluated along particular lines\nlying on principal directions in equibiaxial tensile tests. A rich specimen\nprofile geometry is purposely optimized in silico by varying cost function and\nmaterial compressibility. Experimental tests, monitored via digital image\ncorrelation, are carried out for validation. New shapes are designed and tested\nin a biaxial tensile apparatus and show to perform better than existing ones.\nParameter fitting is efficiently performed by only exploiting full field strain\nmeasurements along lines. Small gauge areas and small fillet radii cruciform\nspecimens get closer to the ideal behavior. For constitutive parameters\nidentification in two-dimensional tensile experiments, data analysis on gauge\nlines deformation suffices.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:30:03 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Vitucci","Gennaro",""]]}
{"id":"2308.01261","submitter":"Zhihi Li","authors":"Zhihui Li, Francesco Montomoli","title":"Surrogate modelling and uncertainty quantification based on\n  multi-fidelity deep neural network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To reduce training costs, several Deep neural networks (DNNs) that can learn\nfrom a small set of HF data and a sufficient number of low-fidelity (LF) data\nhave been proposed. In these established neural networks, a parallel structure\nis commonly proposed to separately approximate the non-linear and linear\ncorrelation between the HF- and LF data. In this paper, a new architecture of\nmulti-fidelity deep neural network (MF-DNN) was proposed where one subnetwork\nwas built to approximate both the non-linear and linear correlation\nsimultaneously. Rather than manually allocating the output weights for the\nparalleled linear and nonlinear correction networks, the proposed MF-DNN can\nautonomously learn arbitrary correlation. The prediction accuracy of the\nproposed MF-DNN was firstly demonstrated by approximating the 1-, 32- and\n100-dimensional benchmark functions with either the linear or non-linear\ncorrelation. The surrogating modelling results revealed that MF-DNN exhibited\nexcellent approximation capabilities for the test functions. Subsequently, the\nMF DNN was deployed to simulate the 1-, 32- and 100-dimensional aleatory\nuncertainty propagation progress with the influence of either the uniform or\nGaussian distributions of input uncertainties. The uncertainty quantification\n(UQ) results validated that the MF-DNN efficiently predicted the probability\ndensity distributions of quantities of interest (QoI) as well as the\nstatistical moments without significant compromise of accuracy. MF-DNN was also\ndeployed to model the physical flow of turbine vane LS89. The distributions of\nisentropic Mach number were well-predicted by MF-DNN based on the 2D Euler flow\nfield and few experimental measurement data points. The proposed MF-DNN should\nbe promising in solving UQ and robust optimization problems in practical\nengineering applications with multi-fidelity data sources.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:30:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Zhihui",""],["Montomoli","Francesco",""]]}
{"id":"2308.01262","submitter":"Michael Gableman","authors":"Michael Gableman and Avinash Kak","title":"Incorporating Season and Solar Specificity into Renderings made by a\n  NeRF Architecture using Satellite Images","comments":"18 pages, 17 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a result of Shadow NeRF and Sat-NeRF, it is possible to take the solar\nangle into account in a NeRF-based framework for rendering a scene from a novel\nviewpoint using satellite images for training. Our work extends those\ncontributions and shows how one can make the renderings season-specific. Our\nmain challenge was creating a Neural Radiance Field (NeRF) that could render\nseasonal features independently of viewing angle and solar angle while still\nbeing able to render shadows. We teach our network to render seasonal features\nby introducing one more input variable -- time of the year. However, the small\ntraining datasets typical of satellite imagery can introduce ambiguities in\ncases where shadows are present in the same location for every image of a\nparticular season. We add additional terms to the loss function to discourage\nthe network from using seasonal features for accounting for shadows. We show\nthe performance of our network on eight Areas of Interest containing images\ncaptured by the Maxar WorldView-3 satellite. This evaluation includes tests\nmeasuring the ability of our framework to accurately render novel views,\ngenerate height maps, predict shadows, and specify seasonal features\nindependently from shadows. Our ablation studies justify the choices made for\nnetwork design parameters.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:30:18 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Gableman","Michael",""],["Kak","Avinash",""]]}
{"id":"2308.01263","submitter":"Paul R\\\"ottger","authors":"Paul R\\\"ottger, Hannah Rose Kirk, Bertie Vidgen, Giuseppe Attanasio,\n  Federico Bianchi, Dirk Hovy","title":"XSTest: A Test Suite for Identifying Exaggerated Safety Behaviours in\n  Large Language Models","comments":"v1 to document initial data release","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Without proper safeguards, large language models will readily follow\nmalicious instructions and generate toxic content. This motivates safety\nefforts such as red-teaming and large-scale feedback learning, which aim to\nmake models both helpful and harmless. However, there is a tension between\nthese two objectives, since harmlessness requires models to refuse complying\nwith unsafe prompts, and thus not be helpful. Recent anecdotal evidence\nsuggests that some models may have struck a poor balance, so that even clearly\nsafe prompts are refused if they use similar language to unsafe prompts or\nmention sensitive topics. In this paper, we introduce a new test suite called\nXSTest to identify such eXaggerated Safety behaviours in a structured and\nsystematic way. In its current form, XSTest comprises 200 safe prompts across\nten prompt types that well-calibrated models should not refuse to comply with.\nWe describe XSTest's creation and composition, and use the test suite to\nhighlight systematic failure modes in a recently-released state-of-the-art\nlanguage model.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:30:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["R\u00f6ttger","Paul",""],["Kirk","Hannah Rose",""],["Vidgen","Bertie",""],["Attanasio","Giuseppe",""],["Bianchi","Federico",""],["Hovy","Dirk",""]]}
{"id":"2308.01264","submitter":"Jos\\'e Luiz Nunes","authors":"Guilherme F. C. F. Almeida, Jos\\'e Luiz Nunes, Neele Engelmann, Alex\n  Wiegmann, Marcelo de Ara\\'ujo","title":"Exploring the psychology of GPT-4's Moral and Legal Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Large language models have been used as the foundation of highly\nsophisticated artificial intelligences, capable of delivering human-like\nresponses to probes about legal and moral issues. However, these models are\nunreliable guides to their own inner workings, and even the engineering teams\nbehind their creation are unable to explain exactly how they came to develop\nall of the capabilities they currently have. The emerging field of machine\npsychology seeks to gain insight into the processes and concepts that these\nmodels possess. In this paper, we employ the methods of psychology to probe\ninto GPT-4's moral and legal reasoning. More specifically, we investigate the\nsimilarities and differences between GPT-4 and humans when it comes to\nintentionality ascriptions, judgments about causation, the morality of\ndeception, moral foundations, the impact of moral luck on legal judgments, the\nconcept of consent, and rule violation judgments. We find high correlations\nbetween human and AI responses, but also several significant systematic\ndifferences between them. We conclude with a discussion of the philosophical\nimplications of our findings.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:36:58 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Almeida","Guilherme F. C. F.",""],["Nunes","Jos\u00e9 Luiz",""],["Engelmann","Neele",""],["Wiegmann","Alex",""],["de Ara\u00fajo","Marcelo",""]]}
{"id":"2308.01266","submitter":"Zhaoting Wei","authors":"Zhaoting Wei","title":"Deformations of cohesive modules on compact complex manifolds","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CT math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cohesive modules give a dg-enhancement of the bounded derived category of\ncoherent sheaves on a complex manifold via superconnections. In this paper we\ndiscuss the deformation theory of cohesive modules on compact complex\nmanifolds. This generalizes the deformation theory of holomorphic vector\nbundles and coherent sheaves. We also develop the theory of Kuranishi maps and\nobstructions of deformations of cohesive modules and give some examples of\nunobstructed deformations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:42:47 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wei","Zhaoting",""]]}
{"id":"2308.01267","submitter":"Jacob Hass","authors":"Jacob B. Hass, Ivan Corwin, Eric I. Corwin","title":"First Passage Time for Many Particle Diffusion in Space-Time Random\n  Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The first passage time for a single diffusing particle has been studied\nextensively, but the first passage time of a system of many diffusing\nparticles, as is often the case in physical systems, has received little\nattention until recently. We consider two models for many particle diffusion --\none treats each particle as independent simple random walkers while the other\ntreats them as coupled to a common space-time random forcing field that biases\nparticles nearby in space and time in similar ways. The first passage time of a\nsingle diffusing particle under both of these models show the same statistics\nand scaling behavior. However, for many particle diffusions, the first passage\ntime among all particles (the `extreme first passage time') is very different\nbetween the two models, effected in the latter case by the randomness of the\ncommon forcing field. We develop an asymptotic (in the number of particles and\nlocation where first passage is being probed) theoretical framework to separate\nout the impact of the random environment with that of sampling trajectories\nwithin it. We identify a new power-law describing the impact to the extreme\nfirst passage time variance of the environment. Through numerical simulations\nwe verify that the predictions from this asymptotic theory hold even for\nsystems with widely varying numbers of particles, all the way down to 100\nparticles. This shows that measurements of the extreme first passage time for\nmany-particle diffusions provide an indirect measurement of the underlying\nenvironment in which the diffusion is occurring.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:43:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hass","Jacob B.",""],["Corwin","Ivan",""],["Corwin","Eric I.",""]]}
{"id":"2308.01271","submitter":"Masoumeh Javanbakhat","authors":"Masoumeh Javanbakhat, Christoph Lippert","title":"A Probabilistic Approach to Self-Supervised Learning using Cyclical\n  Stochastic Gradient MCMC","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 this paper we present a practical Bayesian self-supervised learning method\nwith Cyclical Stochastic Gradient Hamiltonian Monte Carlo (cSGHMC). Within this\nframework, we place a prior over the parameters of a self-supervised learning\nmodel and use cSGHMC to approximate the high dimensional and multimodal\nposterior distribution over the embeddings. By exploring an expressive\nposterior over the embeddings, Bayesian self-supervised learning produces\ninterpretable and diverse representations. Marginalizing over these\nrepresentations yields a significant gain in performance, calibration and\nout-of-distribution detection on a variety of downstream classification tasks.\nWe provide experimental results on multiple classification tasks on four\nchallenging datasets. Moreover, we demonstrate the effectiveness of the\nproposed method in out-of-distribution detection using the SVHN and CIFAR-10\ndatasets.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:52:56 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Javanbakhat","Masoumeh",""],["Lippert","Christoph",""]]}
{"id":"2308.01272","submitter":"Makram Hamouda Dr.","authors":"Makram Hamouda, Mohamed Ali Hamza and Bouthaina Yousfi","title":"Blow-up and lifespan estimate for the generalized tricomi equation with\n  the scale-invariant damping and time derivative nonlinearity on exterior\n  domain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The article is devoted to investigating the initial boundary value problem\nfor the damped wave equation in the scale-invariant case with time-dependent\nspeed of propagation on the exterior domain. By presenting suitable multipliers\nand applying the test-function technique, we study the blow-up and the lifespan\nof the solutions to the problem with derivative-type nonlinearity\n  $ \\d u_{tt}-t^{2m}\\Delta u+\\frac{\\mu}{t}u_t=|u_t|^p, \\quad \\mbox{in}\\\n\\Omega^{c}\\times[1,\\infty), $\n  that we associate with appropriate small initial data.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:54:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hamouda","Makram",""],["Hamza","Mohamed Ali",""],["Yousfi","Bouthaina",""]]}
{"id":"2308.01273","submitter":"Giada Stivala","authors":"Giada Stivala, Sahar Abdelnabi, Andrea Mengascini, Mariano Graziano,\n  Mario Fritz, Giancarlo Pellegrino","title":"A Large-Scale Study of Phishing PDF Documents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phishing PDFs are malicious PDF documents that do not embed malware but trick\nvictims into visiting malicious web pages leading to password theft or drive-by\ndownloads. While recent reports indicate a surge of phishing PDFs, prior works\nhave largely neglected this new threat, positioning phishing PDFs as\naccessories distributed via email phishing campaigns.\n  This paper challenges this belief and presents the first systematic and\ncomprehensive study centered on phishing PDFs. Starting from a real-world\ndataset, we first identify 44 phishing PDF campaigns via clustering and\ncharacterize them by looking at their volumetric, temporal, and visual\nfeatures. Among these, we identify three large campaigns covering 89% of the\ndataset, exhibiting significantly different volumetric and temporal properties\ncompared to classical email phishing, and relying on web UI elements as visual\nbaits. Finally, we look at the distribution vectors and show that phishing PDFs\nare not only distributed via attachments but also via SEO attacks, placing\nphishing PDFs outside the email distribution ecosystem.\n  This paper also assesses the usefulness of the VirusTotal scoring system,\nshowing that phishing PDFs are ranked considerably low, creating a blind spot\nfor organizations. While URL blocklists can help to prevent victims from\nvisiting the attack web pages, PDF documents seem not subjected to any form of\ncontent-based filtering or detection.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:56:17 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Stivala","Giada",""],["Abdelnabi","Sahar",""],["Mengascini","Andrea",""],["Graziano","Mariano",""],["Fritz","Mario",""],["Pellegrino","Giancarlo",""]]}
{"id":"2308.01274","submitter":"Md Tamjid Hossain","authors":"Md Tamjid Hossain, Hung Manh La, Shahriar Badsha, and Anton Netchaev","title":"BRNES: Enabling Security and Privacy-aware Experience Sharing in\n  Multiagent Robotic and Autonomous Systems","comments":"8 pages, 6 figures, 3 tables, Accepted for publication in the\n  proceeding of The 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS 2023), Oct 01-05, 2023, Detroit, Michigan, USA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.LG cs.MA cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Although experience sharing (ES) accelerates multiagent reinforcement\nlearning (MARL) in an advisor-advisee framework, attempts to apply ES to\ndecentralized multiagent systems have so far relied on trusted environments and\noverlooked the possibility of adversarial manipulation and inference.\nNevertheless, in a real-world setting, some Byzantine attackers, disguised as\nadvisors, may provide false advice to the advisee and catastrophically degrade\nthe overall learning performance. Also, an inference attacker, disguised as an\nadvisee, may conduct several queries to infer the advisors' private information\nand make the entire ES process questionable in terms of privacy leakage. To\naddress and tackle these issues, we propose a novel MARL framework (BRNES) that\nheuristically selects a dynamic neighbor zone for each advisee at each learning\nstep and adopts a weighted experience aggregation technique to reduce Byzantine\nattack impact. Furthermore, to keep the agent's private information safe from\nadversarial inference attacks, we leverage the local differential privacy\n(LDP)-induced noise during the ES process. Our experiments show that our\nframework outperforms the state-of-the-art in terms of the steps to goal,\nobtained reward, and time to goal metrics. Particularly, our evaluation shows\nthat the proposed framework is 8.32x faster than the current non-private\nframeworks and 1.41x faster than the private frameworks in an adversarial\nsetting.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 16:57:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Hossain","Md Tamjid",""],["La","Hung Manh",""],["Badsha","Shahriar",""],["Netchaev","Anton",""]]}
{"id":"2308.01275","submitter":"K Navamani","authors":"K. Navamani","title":"Unified Entropy-Ruled Einstein Relation for Bulk and Low-Dimensional\n  Systems: A Hopping to Band Shift Analysis","comments":"10 pages and 4 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this letter, we present the unified paradigm on entropy-ruled Einstein\ndiffusion-mobility relation ({\\mu}/D ratio) for all dimensional systems (1D, 2D\nand 3D) of molecules and materials. The different dimension-associated\nfractional value of the variation in differential entropy with respect to the\nchemical potential ({\\Delta}h/{\\Delta}{\\eta}) gives the quantum-classical\ntransition version of {\\mu}/D relation. This is a new alternative version for\nquantum devices, instead of Einstein original relation of {\\mu}/D = q/kT; where\nq, k and T are the electric charge, Boltzmann constant and temperature,\nrespectively. It is found that the fractional value of {\\Delta}h/{\\Delta}{\\eta}\nfor {\\mu}/D ratio for different dimensional systems or devices is a direct\nconsequences with the average energy-Fermi energy relation, which can varies\nwith the typical dimensions, whether the system belongs to 1D or 2D or 3D. This\nunified entropy-ruled transport formalism works well for both the quantum and\nclassical systems with equilibrium as well as non-equilibrium conditions. Based\non the dimensional dependent entropy-ruled {\\mu}/D factor, the\nNavamani-Shockley diode equation is transformed.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:00:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Navamani","K.",""]]}
{"id":"2308.01276","submitter":"Alexander Warwick","authors":"Alexander Warwick, Jonathan Gratus","title":"Moment tracking and their coordinate transformations for macroparticles\n  with an application to plasmas around black holes","comments":"25 pages, 8 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph astro-ph.HE physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Particle-in-cell codes usually represent large groups of particles as a\nsingle macroparticle. These codes are computationally efficient but lose\ninformation about the internal structure of the macroparticle. To improve the\naccuracy of these codes, this work presents a method in which, as well as\ntracking the macroparticle, the moments of the macroparticle are also tracked.\nAlthough the equations needed to track these moments are known, the coordinate\ntransformations for moments where the space and time coordinates are mixed\ncannot be calculated using the standard method for representing moments. These\ncoordinate transformations are important in astrophysical plasma, where there\nis no preferred coordinate system. This work uses the language of Schwartz\ndistributions to calculate the coordinate transformations of moments. Both the\nmoment tracking and coordinate transformation equations are tested by modelling\nthe motion of uncharged particles in a circular orbit around a black hole in\nboth Schwarzschild and Kruskal-Szekeres coordinates. Numerical testing shows\nthat the error in tracking moments is small, and scales quadratically. This\nerror can be improved by including higher order moments. By choosing an\nappropriate method for using these moments to deposit the charge back onto the\ngrid, a full particle-in-cell code can be developed.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:01:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Warwick","Alexander",""],["Gratus","Jonathan",""]]}
{"id":"2308.01277","submitter":"Giuseppe Di Somma","authors":"Giuseppe Di Somma, Nicol\\`o Beverini, Giorgio Carelli, Simone\n  Castellano, Roberto Devoti, Enrico Maccioni, Paolo Marsili, and Angela D.V.\n  Di Virgilio","title":"Comparative analysis of local angular rotation between the Ring Laser\n  Gyroscope GINGERINO and GNSS stations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph gr-qc physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of local deformations is a hot topic in geodesy. Local rotations of\nthe crust around the vertical axis can be caused by deformations. In the Gran\nSasso area the ring laser gyroscope GINGERINO and the GNSS array are operative.\nOne year of data of GINGERINO is compared with the ones from the GNSS stations,\nhomogeneously selected around the position of GINGERINO, aiming at looking for\nrotational signals with period of days common to both systems. At that purpose\nthe rotational component of the area circumscribed by the GNSS stations has\nbeen evaluated and compared with the GINGERINO data. The coherences between the\nsignals show structures that even exceed 60$\\%$ coherence over the 6-60 days\nperiod; this unprecedented analysis is validated by two different methods that\nevaluate the local rotation using the GNSS stations. The analysis reveals that\nthe shared rotational signal's amplitude in both instruments is approximately\n$10^{-13} rad/s$, an order of magnitude lower than the amplitudes of the\nsignals examined using the coherence method. The comparison of the ring laser\ndata with GNSS antennas provides evidence of the validity of the ring laser\ndata for very low frequency investigation, essential for fundamental physics\ntest.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:03:05 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 13:33:31 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 09:42:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Di Somma","Giuseppe",""],["Beverini","Nicol\u00f2",""],["Carelli","Giorgio",""],["Castellano","Simone",""],["Devoti","Roberto",""],["Maccioni","Enrico",""],["Marsili","Paolo",""],["Di Virgilio","Angela D. V.",""]]}
{"id":"2308.01278","submitter":"Sandro Wieser","authors":"Sandro Wieser, Egbert Zojer","title":"Machine learned Force-Fields for an ab-initio Quality Description of\n  Metal-Organic Frameworks","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":"  Metal-organic frameworks (MOFs) are an incredibly diverse group of highly\nporous hybrid materials, which are interesting for a wide range of possible\napplications. For a reliable description of many of their properties accurate\ncomputationally highly efficient methods, like force-field potentials (FFPs),\nare required. With the advent of machine learning approaches, it is now\npossible to generate such potentials with relatively little human effort. Here,\nwe present a recipe to parametrize two fundamentally different types of\nexceptionally accurate and computationally highly efficient machine learned\npotentials, which belong to the moment-tensor and kernel-based potential\nfamilies. They are parametrized relying on reference configurations generated\nin the course of molecular dynamics based, active learning runs and their\nperformance is benchmarked for a representative selection of commonly studied\nMOFs. For both potentials, comparison to a random set of validation structures\nreveals close to DFT precision in predicted forces and structural parameters of\nall MOFs. Essentially the same applies to elastic constants and phonon band\nstructures. Additionally, for MOF-5 the thermal conductivity is obtained with\nfull quantitative agreement to single-crystal experiments. All this is possible\nwhile maintaining a high degree of computational efficiency, with the obtained\nmachine learned potentials being only moderately slower than the extremely\nsimple UFF4MOF or Dreiding force fields. The exceptional accuracy of the\npresented FFPs combined with their computational efficiency has the potential\nof lifting the computational modelling of MOFs to the next level.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:04:01 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 09:41:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wieser","Sandro",""],["Zojer","Egbert",""]]}
{"id":"2308.01279","submitter":"Giuseppe Clemente","authors":"Riccardo Aiudi, Claudio Bonanno, Claudio Bonati, Giuseppe Clemente,\n  Massimo D'Elia, Lorenzo Maio, Davide Rossini, Salvatore Tirone, Kevin\n  Zambello","title":"Quantum Algorithms for the computation of quantum thermal averages at\n  work","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, a variety of quantum algorithms have been devised to estimate\nthermal averages on a genuine quantum processor. In this paper, we consider the\npractical implementation of the so-called Quantum-Quantum Metropolis algorithm.\nAs a testbed for this purpose, we simulate a basic system of three frustrated\nquantum spins and discuss its systematics, also in comparison with the Quantum\nMetropolis Sampling algorithm.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:05:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Aiudi","Riccardo",""],["Bonanno","Claudio",""],["Bonati","Claudio",""],["Clemente","Giuseppe",""],["D'Elia","Massimo",""],["Maio","Lorenzo",""],["Rossini","Davide",""],["Tirone","Salvatore",""],["Zambello","Kevin",""]]}
{"id":"2308.01280","submitter":"Aydin Abadi","authors":"Aydin Abadi and Dan Ristea and Steven J. Murdoch","title":"Delegated Time-Lock Puzzle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time-Lock Puzzles (TLPs) are cryptographic protocols that enable a client to\nlock a message in such a way that a server can only unlock it after a specific\ntime period. However, existing TLPs have certain limitations: (i) they assume\nthat both the client and server always possess sufficient computational\nresources and (ii) they solely focus on the lower time bound for finding a\nsolution, disregarding the upper bound that guarantees a regular server can\nfind a solution within a certain time frame. Additionally, existing TLPs\ndesigned to handle multiple puzzles either (a) entail high verification costs\nor (b) lack generality, requiring identical time intervals between consecutive\nsolutions. To address these limitations, this paper introduces, for the first\ntime, the concept of a \"Delegated Time-Lock Puzzle\" and presents a protocol\ncalled \"Efficient Delegated Time-Lock Puzzle\" (ED-TLP) that realises this\nconcept. ED-TLP allows the client and server to delegate their\nresource-demanding tasks to third-party helpers. It facilitates real-time\nverification of solution correctness and efficiently handles multiple puzzles\nwith varying time intervals. ED-TLP ensures the delivery of solutions within\npredefined time limits by incorporating both an upper bound and a fair payment\nalgorithm. We have implemented ED-TLP and conducted a comprehensive analysis of\nits overheads, demonstrating the efficiency of the construction.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:05:40 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Abadi","Aydin",""],["Ristea","Dan",""],["Murdoch","Steven J.",""]]}
{"id":"2308.01281","submitter":"Claudio Dappiaggi","authors":"Lissa de Souza Campos, Claudio Dappiaggi and Luca Sinibaldi","title":"Boundary conditions and infrared divergences","comments":"11 pages, 2 figures","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":"  We review the procedure to construct quasi-free ground states, for real\nscalar fields whose dynamics is dictated by the Klein-Gordon equation, on\nstandard static Lorentzian manifolds with a time-like boundary. We observe\nthat, depending on the assigned boundary condition of Robin type, this\nprocedure does not always lead to the existence of a suitable bi-distribution\n$w_2\\in \\mathcal{D}'(M\\times M)$ due to the presence of infrared divergences.\nAs a concrete example we consider a Bertotti-Robinson spacetime in two\ndifferent coordinate patches. In one case we show that infrared divergences do\nnot occur only for Dirichlet boundary conditions as one might expect a priori,\nwhile, in the other case, we prove that they occur only when Neumann boundary\nconditions are imposed at the time-like boundary.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:07:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Campos","Lissa de Souza",""],["Dappiaggi","Claudio",""],["Sinibaldi","Luca",""]]}
{"id":"2308.01282","submitter":"Hiroaki Karuo","authors":"Hiroaki Karuo","title":"On positivity of Roger--Yang skein algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.QA math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the positivity conjecture of (Kauffman bracket) skein algebras\nto Roger--Yang skein algebras. To generalize it, we use explicit polynomials\nlike Chebyshev polynomials of the first kind to give candidates of positive\nbases. Moreover, the polynomials form a lower bound in the sense of [L\\^e18]\nand [LTY21]. We also discuss a relation between the polynomials and the centers\nof Roger--Yang skein algebras when the quantum parameter is a complex root of\nunity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:08:53 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Karuo","Hiroaki",""]]}
{"id":"2308.01283","submitter":"W. A. Zuniga-Galindo","authors":"W. A. Z\\'u\\~niga-Galindo","title":"The p-Adic Schr\\\"odinger Equation and the Two-slit Experiment in Quantum\n  Mechanics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  p-Adic quantum mechanics is constructed from the Dirac-von Neumann axioms\nidentifying quantum states with square-integrable functions on the\nN-dimensional p-adic space, Q_{p}^{N}. The time is assumed to be a real\nvariable. The time evolution is controlled by a nonlocal Schr\\\"odinger equation\nobtained from a p-adic heat equation by a temporal Wick rotation. This p-adic\nheat equation describes a particle performing a random motion in Q_{p}^{N}. The\nHamiltonian is a nonlocal operator; thus, the Schr\\\"odinger equation describes\nthe evolution of a quantum state under nonlocal interactions. In this\nframework, the Schr\\\"odinger equation admits plane wave solutions, but the de\nBroglie wave-particle duality is ruled out since the time is real and the\nposition is p-adic. Consequently, our model has no quantum waves. Using a\nsuitable Cauchy problem for the p-adic Schr\\\"odinger equation, we construct a\nmathematical model for the two-slit and one-slit experiments. At the time zero,\nat each slit, there is a localized particle; these particles interact with each\nother in a nonlocal way to produce an interference pattern. The pattern created\nby two slits looks like the pattern produced by one slit if the distance to the\nslits is sufficiently large. Finally, we propose that the classical de Broglie\nwave-particle duality is just a manifestation of the discreteness of\nspace-time.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:10:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Z\u00fa\u00f1iga-Galindo","W. A.",""]]}
{"id":"2308.01284","submitter":"Amrita Bhattacharjee","authors":"Amrita Bhattacharjee, Huan Liu","title":"Fighting Fire with Fire: Can ChatGPT Detect AI-generated Text?","comments":"to appear in SIGKDD Explorations (December 2023)","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) such as ChatGPT are increasingly being used for\nvarious use cases, including text content generation at scale. Although\ndetection methods for such AI-generated text exist already, we investigate\nChatGPT's performance as a detector on such AI-generated text, inspired by\nworks that use ChatGPT as a data labeler or annotator. We evaluate the\nzero-shot performance of ChatGPT in the task of human-written vs. AI-generated\ntext detection, and perform experiments on publicly available datasets. We\nempirically investigate if ChatGPT is symmetrically effective in detecting\nAI-generated or human-written text. Our findings provide insight on how ChatGPT\nand similar LLMs may be leveraged in automated detection pipelines by simply\nfocusing on solving a specific aspect of the problem and deriving the rest from\nthat solution. All code and data is available at\nhttps://github.com/AmritaBh/ChatGPT-as-Detector.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:11:37 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 22:34:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhattacharjee","Amrita",""],["Liu","Huan",""]]}
{"id":"2308.01285","submitter":"Martin Josifoski","authors":"Martin Josifoski, Lars Klein, Maxime Peyrard, Yifei Li, Saibo Geng,\n  Julian Paul Schnitzler, Yuxing Yao, Jiheng Wei, Debjit Paul, Robert West","title":"Flows: Building Blocks of Reasoning and Collaborating AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in artificial intelligence (AI) have produced highly capable\nand controllable systems. This creates unprecedented opportunities for\nstructured reasoning as well as collaboration among multiple AI systems and\nhumans. To fully realize this potential, it is essential to develop a\nprincipled way of designing and studying such structured interactions. For this\npurpose, we introduce the conceptual framework of Flows: a systematic approach\nto modeling complex interactions. Flows are self-contained building blocks of\ncomputation, with an isolated state, communicating through a standardized\nmessage-based interface. This modular design allows Flows to be recursively\ncomposed into arbitrarily nested interactions, with a substantial reduction of\ncomplexity. Crucially, any interaction can be implemented using this framework,\nincluding prior work on AI--AI and human--AI interactions, prompt engineering\nschemes, and tool augmentation. We demonstrate the potential of Flows on the\ntask of competitive coding, a challenging task on which even GPT-4 struggles.\nOur results suggest that structured reasoning and collaboration substantially\nimprove generalization, with AI-only Flows adding +$21$ and human--AI Flows\nadding +$54$ absolute points in terms of solve rate. To support rapid and\nrigorous research, we introduce the aiFlows library. The library comes with a\nrepository of Flows that can be easily used, extended, and composed into novel,\nmore complex Flows.\n  The aiFlows library is available at https://github.com/epfl-dlab/aiflows.\nData and Flows for reproducing our experiments are available at\nhttps://github.com/epfl-dlab/cc_flows.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:14:22 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Josifoski","Martin",""],["Klein","Lars",""],["Peyrard","Maxime",""],["Li","Yifei",""],["Geng","Saibo",""],["Schnitzler","Julian Paul",""],["Yao","Yuxing",""],["Wei","Jiheng",""],["Paul","Debjit",""],["West","Robert",""]]}
{"id":"2308.01286","submitter":"Diptapriyo Majumdar","authors":"Lawqueen Kanesh, Diptapriyo Majumdar, M. S. Ramanujan","title":"Polynomial-delay Enumeration Kernelizations for Cuts of Bounded Degree","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Enumeration kernelization was first proposed by Creignou et al. [TOCS 2017]\nand was later refined by Golovach et al. [JCSS 2022] into two different\nvariants: fully-polynomial enumeration kernelization and polynomial-delay\nenumeration kernelization. In this paper, we consider the d-CUT problem from\nthe perspective of (polynomial-delay) enumeration kenrelization. Given an\nundirected graph G = (V, E), a cut F = E(A, B) is a d-cut of G if every u in A\nhas at most d neighbors in B and every v in B has at most d neighbors in A.\nChecking the existence of a d-cut in a graph is a well-known NP-hard problem\nand is well-studied in parameterized complexity [Algorithmica 2021, IWOCA\n2021]. This problem also generalizes a well-studied problem MATCHING CUT (set d\n= 1) that has been a central problem in the literature of polynomial-delay\nenumeration kernelization. In this paper, we study three different enumeration\nvariants of this problem, ENUM d-CUT, ENUM MIN-d-CUT and ENUM MAX-d-CUT that\nintends to enumerate all the d-cuts, all the minimal d-cuts and all the maximal\nd-cuts respectively. We consider various structural parameters of the input and\nprovide polynomial-delay enumeration kernels for ENUM d-CUT and ENUM MAX-d-CUT\nand fully-polynomial enumeration kernels of polynomial size for ENUM MIN-d-CUT.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:18:19 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kanesh","Lawqueen",""],["Majumdar","Diptapriyo",""],["Ramanujan","M. S.",""]]}
{"id":"2308.01287","submitter":"Claudio Bonanno","authors":"Claudio Bonanno, Francesco D'Angelo, Massimo D'Elia, Lorenzo Maio and\n  Manuel Naviglio","title":"Sphaleron rate of $N_f=2+1$ QCD","comments":"Main text: 5 pages, 4 figures. Supplementary Material: 8 pages, 29\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the sphaleron rate of $N_f=2+1$ QCD at the physical point for a\nrange of temperatures $200$ MeV $\\lesssim T \\lesssim 600$ MeV. We adopt a\nstrategy recently applied in the quenched case, based on the extraction of the\nrate via a modified version of the Backus-Gilbert method from\nfinite-lattice-spacing and finite-smoothing-radius Euclidean topological charge\ndensity correlators. The physical sphaleron rate is finally computed by\nperforming a continuum limit at fixed physical smoothing radius, followed by a\nzero-smoothing extrapolation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:19:39 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bonanno","Claudio",""],["D'Angelo","Francesco",""],["D'Elia","Massimo",""],["Maio","Lorenzo",""],["Naviglio","Manuel",""]]}
{"id":"2308.01288","submitter":"Manuel Ma\\~nas","authors":"Am\\'ilcar Branquinho, Juan E. F. D\\'iaz, Ana Foulqui\\'e-Moreno, Manuel\n  Ma\\~nas","title":"Bidiagonal factorization of the recurrence matrix for the Hahn multiple\n  orthogonal polynomials","comments":"14 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores a factorization using bidiagonal matrices of the\nrecurrence matrix of Hahn multiple orthogonal polynomials. The factorization is\nexpressed in terms of ratios involving the generalized hypergeometric function\n${}_3F_2$ and is proven using recently discovered contiguous relations.\nMoreover, employing the multiple Askey scheme, a bidiagonal factorization is\nderived for the Hahn descendants, including Jacobi-Pi\\~neiro, multiple Meixner\n(kinds I and II), multiple Laguerre (kinds I and II), multiple Kravchuk, and\nmultiple Charlier, all represented in terms of hypergeometric functions. For\nthe cases of multiple Hahn, Jacobi-Pi\\~neiro, Meixner of kind II, and Laguerre\nof kind I, where there exists a region where the recurrence matrix is\nnonnegative, subregions are identified where the bidiagonal factorization\nbecomes a positive bidiagonal factorization.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:20:29 GMT"},{"version":"v2","created":"Thu, 3 Aug 2023 06:50:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Branquinho","Am\u00edlcar",""],["D\u00edaz","Juan E. F.",""],["Foulqui\u00e9-Moreno","Ana",""],["Ma\u00f1as","Manuel",""]]}
{"id":"2308.01289","submitter":"Gregory Beylkin","authors":"Gregory Beylkin","title":"On representations of the Helmholtz Green's function","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We consider the free space Helmholtz Green's function and split it into the\nsum of oscillatory and non-oscillatory (singular) components. The goal is to\nseparate the impact of the singularity of the real part at the origin from the\noscillatory behavior controlled by the wave number k. The oscillatory component\ncan be chosen to have any finite number of continuous derivatives at the origin\nand can be applied to a function in the Fourier space in\n$\\mathcal{O}\\left(k^{d}\\log k\\right)$ operations. The non-oscillatory component\nhas a multiresolution representation via a linear combination of Gaussians and\nis applied efficiently in space.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:22:07 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 17:38:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Beylkin","Gregory",""]]}
{"id":"2308.01290","submitter":"Xiaofeng Yang","authors":"Qian Wang, Huiqiao Xie, Tonghe Wang, Justin Roper, Hao Gao, Zhen Tian,\n  Xiangyang Tang, Jeffrey D. Bradley, Tian liu and Xiaofeng Yang","title":"One-step Iterative Estimation of Effective Atomic Number and Electron\n  Density for Dual Energy CT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dual-energy computed tomography (DECT) is a promising technology that has\nshown a number of clinical advantages over conventional X-ray CT, such as\nimproved material identification, artifact suppression, etc. For proton therapy\ntreatment planning, besides material-selective images, maps of effective atomic\nnumber (Z) and relative electron density to that of water ($\\rho_e$) can also\nbe achieved and further employed to improve stopping power ratio accuracy and\nreduce range uncertainty. In this work, we propose a one-step iterative\nestimation method, which employs multi-domain gradient $L_0$-norm minimization,\nfor Z and $\\rho_e$ maps reconstruction. The algorithm was implemented on GPU to\naccelerate the predictive procedure and to support potential real-time adaptive\ntreatment planning. The performance of the proposed method is demonstrated via\nboth phantom and patient studies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:22:33 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Qian",""],["Xie","Huiqiao",""],["Wang","Tonghe",""],["Roper","Justin",""],["Gao","Hao",""],["Tian","Zhen",""],["Tang","Xiangyang",""],["Bradley","Jeffrey D.",""],["liu","Tian",""],["Yang","Xiaofeng",""]]}
{"id":"2308.01291","submitter":"Aifeng Wang","authors":"Xueliang Wu, Xinrun Mi, Long Zhang, Xiaoyuan Zhou, Mingquan He,\n  Yisheng Chai, and Aifeng Wang","title":"Annealing tunable charge density wave order in a magnetic kagome\n  material FeGe","comments":"8 pages, 4 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-sa/4.0/","abstract":"  In the magnetic kagome metal FeGe, a charge density wave (CDW) order emerges\ninside the antiferromagnetic phase, providing a fertile playground to\ninvestigate the interplay between charge and magnetic orders. Here, we\ndemonstrate that the CDW order, as well as magnetic properties, can be\nreversibly tuned on a large scale through post-growth annealing treatments. The\nantiferromagnetic and CDW transitions vary systematically as functions of both\nthe temperature and the time period of annealing. Long-range CDW order with a\nmaximum $T_{\\mathrm{CDW}}$ and a minimum $T_{\\mathrm{N}}$ can be realized in\ncrystals annealed at \\SI{320}{\\degreeCelsius} for over 48 h. Using\nmagnetization and magnetostrictive coefficient measurements, it is found that\nthe CDW transition is rather stable against an external magnetic field and\nspin-flop transition. On the other hand, the critical field for spin-flop\ntransition is significantly reduced in the long-range ordered CDW phase. Our\nresults indicate that the CDW in FeGe is immune to variations in magnetic\norders, while the magnetocrystalline anisotropy energy and the corresponding\nmagnetic ground state can be altered significantly by the charge order. These\nfindings provide crucial clues for further investigation and a better\nunderstanding of the nature of the CDW order in FeGe.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:22:53 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wu","Xueliang",""],["Mi","Xinrun",""],["Zhang","Long",""],["Zhou","Xiaoyuan",""],["He","Mingquan",""],["Chai","Yisheng",""],["Wang","Aifeng",""]]}
{"id":"2308.01292","submitter":"John Salzer","authors":"Jennifer Sieben, David J. Carr, John J. Salzer, Alec S. Hirschauer","title":"The Star Formation Across Cosmic Time (SFACT) Survey. II. The First\n  Catalog from a New Narrow-Band Survey for Emission-Line Objects","comments":"26 pages, 12 figures. Accepted for publication in the Astronomical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Star Formation Across Cosmic Time (SFACT) is a new narrowband survey designed\nto detect faint emission-line galaxies and QSOs over a broad range of\nredshifts. Here we present the first list of SFACT candidates from our\npilot-study fields. Using the WIYN 3.5m telescope, we are able to achieve good\nimage quality with excellent depth and routinely detect ELGs to r = 25.0. The\nlimiting line flux of the survey is ~1.0 x 10^16 erg/s/cm^2. SFACT targets\nthree primary emission lines: H-alpha, [O III]5007, and [O II]3727. The\ncorresponding redshift windows allow for the detection of objects at z ~ 0-1.\nWith a coverage of 1.50 square degrees in our three pilot-study fields, a total\nof 533 SFACT candidates have been detected (355 candidates per square degree).\nWe detail the process by which these candidates are selected in an efficient\nand primarily automated manner, then tabulate accurate coordinates, broadband\nphotometry, and narrowband fluxes for each source.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:25:13 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Sieben","Jennifer",""],["Carr","David J.",""],["Salzer","John J.",""],["Hirschauer","Alec S.",""]]}
{"id":"2308.01293","submitter":"Christos Gagatsos","authors":"Boyu Zhou, Saikat Guha, Christos N. Gagatsos","title":"Bayesian quantum phase estimation with fixed photon states","comments":"Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the generic form of a two-mode bosonic state $|\\Psi_n\\rangle$\nwith finite Fock expansion and fixed mean photon number to an integer $n\\geq1$.\nThe upper and lower modes of the input state $|\\Psi_n\\rangle$ pick up a phase\n$\\phi$ and $-\\phi$ respectively and we study the form of the optimal input\nstate, i.e., the form of the state's Fock coefficients, such that the mean\nsquare error (MSE) for estimating $\\phi$ is minimized while the MSE is always\nattainable by a measurement. Our setting is Bayesian, meaning that we consider\n$\\phi$ as a random variable that follows a prior probability distribution\nfunction (PDF). For the celebrated NOON state (equal superposition of\n$|n0\\rangle$ and $|0n\\rangle$), which is a special case of the input state we\nconsider, and for a flat prior PDF we find that the Heisenberg scaling is lost\nand the attainable minimum mean square error (MMSE) is found to be\n$\\pi^2/3-1/4n^2$, which is a manifestation of the fundamental difference\nbetween the Fisherian and Bayesian approaches. Then, our numerical analysis\nprovides the optimal form of the generic input state for fixed values of $n$\nand we provide evidence that a state $|\\Psi_{\\tau}\\rangle$ produced by mixing a\nFock state with vacuum in a beam-splitter of transmissivity $\\tau$ (i.e. a\nspecial case of the state $|\\Psi_n\\rangle$), must correspond to $\\tau=0.5$.\nFinally, we consider an example of an adaptive technique: We consider a state\nof the form of $|\\Psi_n\\rangle$ for $n=1$. We start with a flat prior PDF, and\nfor each subsequent step we use as prior PDF the posterior probability of the\nprevious step, while for each step we update the optimal state and optimal\nmeasurement. We show our analysis for up to five steps, but one can allow the\nalgorithm to run further. Finally, we conjecture the form the of the prior PDF\nand the optimal state for the infinite step and we calculate the corresponding\nMMSE.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:26:10 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zhou","Boyu",""],["Guha","Saikat",""],["Gagatsos","Christos N.",""]]}
{"id":"2308.01294","submitter":"Jo\\~ao Barata","authors":"Jo\\~ao Barata, Jos\\'e Guilherme Milhano, Andrey V. Sadofyev","title":"Picturing QCD jets in anisotropic matter: from jet shapes to Energy\n  Energy Correlators","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent theoretical developments in the description of jet evolution in the\nquark gluon plasma have allowed to account for the effects of hydrodynamic\ngradients in the medium modified jet spectra. These constitute a crucial step\ntowards using jets as tomographic probes of the nuclear matter they traverse.\nIn this work, we complement these studies by providing leading order\ncalculations of widely studied jet observables, taking into account matter\nanisotropies. We show that the energy distribution inside a jet is pushed\ntowards the direction of the largest matter anisotropy, while the away region\nis depleted. As a consequence, the jet mass and girth gain a non-trivial\nazimuthal dependence, with the average value of the distribution increasing\nalong the direction of largest gradients. However, we find that, for these jet\nshapes, matter anisotropic effects can be potentially suppressed by vacuum\nSudakov factors. We argue that the recently proposed measurements of energy\ncorrelations within jets do not suffer from such effects, with the azimuthal\ndependence being visible in a large angular window, regardless of the shape of\nthe distribution.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:26:44 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Barata","Jo\u00e3o",""],["Milhano","Jos\u00e9 Guilherme",""],["Sadofyev","Andrey V.",""]]}
{"id":"2308.01295","submitter":"Gordian Edenhofer","authors":"Gordian Edenhofer, Catherine Zucker, Philipp Frank, Andrew K.\n  Saydjari, Joshua S. Speagle, Douglas Finkbeiner, Torsten En{\\ss}lin","title":"A Parsec-Scale Galactic 3D Dust Map out to 1.25 kpc from the Sun","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-resolution 3D maps of interstellar dust are critical for probing the\nunderlying physics shaping the structure of the interstellar medium, and for\nforeground correction of astrophysical observations affected by dust. We aim to\nconstruct a new 3D map of the spatial distribution of interstellar dust\nextinction out to a distance of 1.25 kpc from the Sun. We leverage distance and\nextinction estimates to 54 million nearby stars derived from the Gaia BP/RP\nspectra. Using the stellar distance and extinction information, we infer the\nspatial distribution of dust extinction. We model the logarithmic dust\nextinction with a Gaussian Process in a spherical coordinate system via\nIterative Charted Refinement and a correlation kernel inferred in previous\nwork. We probe our 661 million dimensional posterior distribution using the\nvariational inference method MGVI. Our 3D dust map achieves an angular\nresolution of 14' (Nside = 256). We sample the dust extinction in 516 distance\nbins spanning 69 pc to 1250 pc. We obtain a maximum distance resolution of 0.4\npc at 69 pc and a minimum distance resolution of 7 pc at 1.25 kpc. Our map\nresolves the internal structure of hundreds of molecular clouds in the solar\nneighborhood and will be broadly useful for studies of star formation, Galactic\nstructure, and young stellar populations. It is available for download in a\nvariety of coordinate systems at https://doi.org/10.5281/zenodo.8187943 and can\nalso be queried via the publicly available dustmaps Python package.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:29:50 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Edenhofer","Gordian",""],["Zucker","Catherine",""],["Frank","Philipp",""],["Saydjari","Andrew K.",""],["Speagle","Joshua S.",""],["Finkbeiner","Douglas",""],["En\u00dflin","Torsten",""]]}
{"id":"2308.01296","submitter":"Zhilin Wang","authors":"Zhilin Wang, Qin Hu, Minghui Xu, Zeihui Xiong","title":"Straggler Mitigation and Latency Optimization in Blockchain-based\n  Hierarchical Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloud-edge-device hierarchical federated learning (HFL) has been recently\nproposed to achieve communication-efficient and privacy-preserving distributed\nlearning. However, there exist several critical challenges, such as the single\npoint of failure and potential stragglers in both edge servers and local\ndevices. To resolve these issues, we propose a decentralized and\nstraggler-tolerant blockchain-based HFL (BHFL) framework. Specifically, a\nRaft-based consortium blockchain is deployed on edge servers to provide a\ndistributed and trusted computing environment for global model aggregation in\nBHFL. To mitigate the influence of stragglers on learning, we propose a novel\naggregation method, HieAvg, which utilizes the historical weights of stragglers\nto estimate the missing submissions. Furthermore, we optimize the overall\nlatency of BHFL by jointly considering the constraints of global model\nconvergence and blockchain consensus delay. Theoretical analysis and\nexperimental evaluation show that our proposed BHFL based on HieAvg can\nconverge in the presence of stragglers, which performs better than the\ntraditional methods even when the loss function is non-convex and the data on\nlocal devices are non-independent and identically distributed (non-IID).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:33:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Wang","Zhilin",""],["Hu","Qin",""],["Xu","Minghui",""],["Xiong","Zeihui",""]]}
{"id":"2308.01297","submitter":"John Salzer","authors":"David J. Carr, Jennifer Sieben, John J. Salzer, Samantha W. Brunker,\n  and Bryce Cousins","title":"The Star Formation Across Cosmic Time (SFACT) Survey. III. Spectroscopy\n  of the Initial Catalog of Emission-Line Objects","comments":"20 pages, 10 figures. Accepted for publication in the Astronomical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Star Formation Across Cosmic Time (SFACT) survey is a new narrowband\nsurvey designed to detect emission-line galaxies (ELGs) and quasi-stellar\nobjects (QSOs) over a wide range of redshifts in discrete redshift windows. The\nsurvey utilizes the WIYN 3.5m telescope and the Hydra multifiber positioner to\nperform efficient follow-up spectroscopy on galaxies identified in the imaging\npart of the survey. Since the objects in the SFACT survey are selected by their\nstrong emission lines, it is possible to obtain useful spectra for even the\nfaintest of our sources (r ~ 25). Here we present the 453 objects that have\nspectroscopic data from the three SFACT pilot-study fields, 415 of which are\nconfirmed ELGs. The methodology for processing and measuring these data is\noutlined in this paper and example spectra are displayed for each of the three\nprimary emission lines used to detect objects in the survey (H-alpha, [O\nIII]5007, and [O II]3727). Spectra of additional QSOs and non-primary\nemission-line detections are also shown as examples. The redshift distribution\nof the pilot-study sample is examined and the ELGs are placed in different\nemission-line diagnostic diagrams in order to distinguish the star-forming\ngalaxies from the active galactic nuclei.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:33:43 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Carr","David J.",""],["Sieben","Jennifer",""],["Salzer","John J.",""],["Brunker","Samantha W.",""],["Cousins","Bryce",""]]}
{"id":"2308.01298","submitter":"Jiawei Lu","authors":"Jiawei Lu, Connor Riley, Krishna Murthy Gurumurthy, Pascal Van\n  Hentenryck","title":"Revitalizing Public Transit in Low Ridership Areas: An Exploration of\n  On-Demand Multimodal Transit Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Public transit plays an essential role in mitigating traffic congestion,\nreducing emissions, and enhancing travel accessibility and equity. One of the\ncritical challenges in designing public transit systems is distributing finite\nservice supplies temporally and spatially to accommodate time-varying and\nspace-heterogeneous travel demands. Particularly, for regions with low or\nscattered ridership, there is a dilemma in designing traditional transit lines\nand corresponding service frequencies. Dense transit lines and high service\nfrequency increase operation costs, while sparse transit lines and low service\nfrequency result in poor accessibility and long passenger waiting time. In the\ncoming era of Mobility-as-a-Service, the aforementioned challenge is expected\nto be addressed by on-demand services. In this study, we design an On-Demand\nMultimodel Transit System (ODMTS) for regions with low or scattered travel\ndemands, in which some low-ridership bus lines are replaced with flexible\non-demand ride-sharing shuttles. In the proposed ODMTS, riders within service\nregions can request shuttles to finish their trips or to connect to fixed-route\nservices such as bus, metro, and light rail. Leveraging the integrated\ntransportation system modeling platform, POLARIS, a simulation-based case study\nis conducted to assess the effectiveness of this system in Austin, Texas.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:38:42 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Lu","Jiawei",""],["Riley","Connor",""],["Gurumurthy","Krishna Murthy",""],["Van Hentenryck","Pascal",""]]}
{"id":"2308.01299","submitter":"Armin Rainer","authors":"Adam Parusi\\'nski and Armin Rainer","title":"Perturbation theory of polynomials and linear operators","comments":"65 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.AG math.CA math.DG math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This survey revolves around the question how the roots of a monic polynomial\n(resp. the spectral decomposition of a linear operator), whose coefficients\ndepend in a smooth way on parameters, depend on those parameters. The parameter\ndependence of the polynomials (resp. operators) ranges from real analytic over\n$C^\\infty$ to differentiable of finite order with often drastically different\nregularity results for the roots (resp. eigenvalues and eigenvectors). Another\ninteresting point is the difference between the perturbation theory of\nhyperbolic polynomials (where, by definition, all roots are real) and that of\ngeneral complex polynomials. The subject, which started with Rellich's work in\nthe 1930s, enjoyed sustained interest through time that intensified in the last\ntwo decades, bringing some definitive optimal results. Throughout we try to\nexplain the main proof ideas; Rellich's theorem and Bronshtein's theorem on\nhyperbolic polynomials are presented with full proofs. The survey is written\nfor readers interested in singularity theory but also for those who intend to\napply the results in other fields.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:39:23 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Parusi\u0144ski","Adam",""],["Rainer","Armin",""]]}
{"id":"2308.01300","submitter":"Yan Ma","authors":"Yan Ma, Weicong Liang, Yiduo Hao, Bohan Chen, Xiangyu Yue, Chao Zhang,\n  Yuhui Yuan","title":"Revisiting DETR Pre-training for Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by that DETR-based approaches have established new records on COCO\ndetection and segmentation benchmarks, many recent endeavors show increasing\ninterest in how to further improve DETR-based approaches by pre-training the\nTransformer in a self-supervised manner while keeping the backbone frozen. Some\nstudies already claimed significant improvements in accuracy. In this paper, we\ntake a closer look at their experimental methodology and check if their\napproaches are still effective on the very recent state-of-the-art such as\n$\\mathcal{H}$-Deformable-DETR. We conduct thorough experiments on COCO object\ndetection tasks to study the influence of the choice of pre-training datasets,\nlocalization, and classification target generation schemes. Unfortunately, we\nfind the previous representative self-supervised approach such as DETReg, fails\nto boost the performance of the strong DETR-based approaches on full data\nregimes. We further analyze the reasons and find that simply combining a more\naccurate box predictor and Objects$365$ benchmark can significantly improve the\nresults in follow-up experiments. We demonstrate the effectiveness of our\napproach by achieving strong object detection results of AP=$59.3\\%$ on COCO\nval set, which surpasses $\\mathcal{H}$-Deformable-DETR + Swin-L by +$1.4\\%$.\nLast, we generate a series of synthetic pre-training datasets by combining the\nvery recent image-to-text captioning models (LLaVA) and text-to-image\ngenerative models (SDXL). Notably, pre-training on these synthetic datasets\nleads to notable improvements in object detection performance. Looking ahead,\nwe anticipate substantial advantages through the future expansion of the\nsynthetic pre-training dataset.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:39:30 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ma","Yan",""],["Liang","Weicong",""],["Hao","Yiduo",""],["Chen","Bohan",""],["Yue","Xiangyu",""],["Zhang","Chao",""],["Yuan","Yuhui",""]]}
{"id":"2308.01301","submitter":"Alexander Zakharov","authors":"Alexander F. Zakharov","title":"Shadows near supermassive black holes: from a theoretical concept to GR\n  test","comments":"12 pages, 1 figure, presented as a talk at The 6th International\n  Conference on Particle Physics and Astrophysics (ICPPA-2022), accepted in\n  IJMPD","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.GA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  General relativity (GR) passed many astronomical tests but in majority of\nthem GR predictions have been tested in a weak gravitational field\napproximation. Around 50 years ago a shadow has been introduced by J. Bardeen\nas a purely theoretical concept but due to an enormous progress in\nobservational and computational facilities this theoretical prediction has been\nconfirmed and the most solid argument for an existence of supermassive black\nholes in Sgr A* and M87* has been obtained.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:40:28 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Zakharov","Alexander F.",""]]}
{"id":"2308.01302","submitter":"Ridhi Jain","authors":"Vini Kanvar, Ridhi Jain and Srikanth Tamilselvam","title":"Handling Communication via APIs for Microservices","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Enterprises in their journey to the cloud, want to decompose their monolith\napplications into microservices to maximize cloud benefits. Current research\nfocuses a lot on how to partition the monolith into smaller clusters that\nperform well across standard metrics like coupling, cohesion, etc. However,\nthere is little research done on taking the partitions, identifying their\ndependencies between the microservices, exploring ways to further reduce the\ndependencies, and making appropriate code changes to enable robust\ncommunication without modifying the application behaviour.\n  In this work, we discuss the challenges with the conventional techniques of\ncommunication using JSON and propose an alternative way of ID-passing via APIs.\nWe also devise an algorithm to reduce the number of APIs. For this, we\nconstruct subgraphs of methods and their associated variables in each class and\nrelocate them to their more functionally aligned microservices. Our\nquantitative and qualitative studies on five public Java applications clearly\ndemonstrate that our refactored microservices using ID have decidedly better\ntime and memory complexities than JSON. Our automation reduces 40-60\\% of the\nmanual refactoring efforts.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:40:34 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Kanvar","Vini",""],["Jain","Ridhi",""],["Tamilselvam","Srikanth",""]]}
{"id":"2308.01303","submitter":"Claudio Bonanno","authors":"Claudio Bonanno, Francesco D'Angelo and Massimo D'Elia","title":"The chiral condensate of $N_f=2+1$ QCD from the spectrum of the\n  staggered Dirac operator","comments":"31 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the chiral condensate of $2+1$ QCD from the mode number of the\nstaggered Dirac operator, performing controlled extrapolations to both the\ncontinuum and the chiral limit. We consider also alternative strategies, based\non the quark mass dependence of the topological susceptibility and of the pion\nmass, and obtain consistent results within errors. Results are also consistent\nwith phenomenological expectations and with previous numerical determinations\nobtained with different lattice discretizations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:40:36 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bonanno","Claudio",""],["D'Angelo","Francesco",""],["D'Elia","Massimo",""]]}
{"id":"2308.01304","submitter":"Kyle Beadle","authors":"Kyle Beadle and Marie Vasek","title":"Peer Surveillance in Online Communities","comments":null,"journal-ref":"7th Workshop on Inclusive Privacy and Security (WIPS), 2023","doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Online communities are not safe spaces for user privacy. Even though existing\nresearch focuses on creating and improving various content moderation\nstrategies and privacy preserving technologies, platforms hosting online\ncommunities support features allowing users to surveil one another--leading to\nharassment, personal data breaches, and offline harm. To tackle this problem,\nwe introduce a new, work-in-progress framework for analyzing data privacy\nwithin vulnerable, identity-based online communities. Where current SOUPS\npapers study surveillance and longitudinal user data as two distinct challenges\nto user privacy, more work needs to be done in exploring the sites where\nsurveillance and historical user data assemble. By synthesizing over 40 years\nof developments in the analysis of surveillance, we derive properties of online\ncommunities that enable the abuse of user data by fellow community members and\nsuggest key steps to improving security for vulnerable users. Deploying this\nnew framework on new and existing platforms will ensure that online communities\nare privacy-conscious and designed more inclusively.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:47:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Beadle","Kyle",""],["Vasek","Marie",""]]}
{"id":"2308.01305","submitter":"Bernhard Meister","authors":"Bernhard K Meister and Henry C W Price","title":"A quantum double-or-nothing game: The Kelly Criterion for Spins","comments":"8 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph q-fin.PM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A sequence of spin-1/2 particles polarised in one of two possible directions\nis presented to an experimenter, who can wager in a double-or-nothing game on\nthe outcomes of measurements in freely chosen polarisation directions. Wealth\nis accrued through astute betting. As information is gained from the stream of\nparticles, the measurement directions are progressively adjusted, and the\nportfolio growth rate is raised. The optimal quantum strategy is determined\nnumerically and shown to differ from the classical strategy, which is\nassociated with the Kelly criterion. The paper contributes to the development\nof quantum finance, as aspects of portfolio optimisation are extended to the\nquantum realm.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:48:52 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Meister","Bernhard K",""],["Price","Henry C W",""]]}
{"id":"2308.01306","submitter":"Emma Houston","authors":"Emma Houston, Oluwatomi Akindele, Marc Bergevin, Adam Bernstein,\n  Steven Dazley, Sandra Bogetic","title":"A Neutrino Detector Design for Safeguarding Small Modular Reactors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nuclear reactors have long been a favored source for antineutrino\nmeasurements for estimates of power and burnup. With appropriate detector\nparameters and background rejection, an estimate of the reactor power can be\nderived from the measured antineutrino event rate. Antineutrino detectors are\npotentially attractive as a safeguards technology that can monitor reactor\noperations and thermal power from a distance. Advanced reactors have diverse\nfeatures that may present challenges for current safeguards methods. By\ncomparison, neutrino detectors offer complementary features, including a\nremote, continuous, unattended, and near-real-time monitoring capability, that\nmay make them useful for safeguarding certain classes of advanced reactors.\nThis study investigates the minimum depth and size of an antineutrino detector\nfor a SMR to meet safeguards needs for advanced reactors. Extrapolating\nperformance from several prior reactor antineutrino experiments, this study\nuses an analytical approach to develop a possible design for a remote\nantineutrino-based monitoring device.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:49:55 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Houston","Emma",""],["Akindele","Oluwatomi",""],["Bergevin","Marc",""],["Bernstein","Adam",""],["Dazley","Steven",""],["Bogetic","Sandra",""]]}
{"id":"2308.01307","submitter":"Ganapathy Baskaran","authors":"G. Baskaran","title":"Broad Band Mott Localization is all you need for Hot Superconductivity:\n  Atom Mott Insulator Theory for Cu-Pb Apatite","comments":"6 pages. arXiv admin note: text overlap with arXiv:1906.02143","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A hypothetical non-dimerized Cu chain in equilibrium is a spin-\\half atom\nMott insulator (AMI), eventhough its band width is high ~ 10 eV. This RVB\nreservoir has a large exchange coupling J ~ 2 eV. This idea of, \\textit{broad\nband Mott localization} was used by us in our earlier works, including\nprediction of high Tc superconductivity in doped graphene, silicene and a\ntheory for hot superconductivity reported in Ag-Au nanostructures (TP 2008). In\nthe present work we identify possible random AMI subsystems in Cu-Pb Apatite\nand develop a model for reported hot superconductivity (LKK 2023). In apatite\nstructure, network of interstitial columnar spaces run parallel to c-axis and\nab-plane. They accomodate excess copper, as neutral Cu atom clusters, chains\nand planar segments. They are our emergent AMI's. Electron transfer from AMI's\nto insulating host, generates strong local superconducting correlation, via\nphyics of doped Mott insulator. Josephson coupling between doped AMI's,\nestablishes hot superconductivity. A major Challenge to superconducting order\nin real material is competing insulating phases - valence bond solid\n(spin-Peirels)-lattice distortions etc. AMI theory points to ways of making the\n\\textit{elusive superconductivity} palpable. We recommend exploration of hot\nsuperconductivity in the rich world of minerals and insulators, via metal atom\ninclusion.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:51:46 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Baskaran","G.",""]]}
{"id":"2308.01308","submitter":"Ming Li","authors":"Ming Li, Mozhdeh Ariannezhad, Andrew Yates, Maarten de Rijke","title":"Masked and Swapped Sequence Modeling for Next Novel Basket\n  Recommendation in Grocery Shopping","comments":"To appear at RecSys'23","journal-ref":null,"doi":"10.1145/3604915.3608803","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Next basket recommendation (NBR) is the task of predicting the next set of\nitems based on a sequence of already purchased baskets. It is a recommendation\ntask that has been widely studied, especially in the context of grocery\nshopping. In next basket recommendation (NBR), it is useful to distinguish\nbetween repeat items, i.e., items that a user has consumed before, and explore\nitems, i.e., items that a user has not consumed before. Most NBR work either\nignores this distinction or focuses on repeat items. We formulate the next\nnovel basket recommendation (NNBR) task, i.e., the task of recommending a\nbasket that only consists of novel items, which is valuable for both real-world\napplication and NBR evaluation. We evaluate how existing NBR methods perform on\nthe NNBR task and find that, so far, limited progress has been made w.r.t. the\nNNBR task. To address the NNBR task, we propose a simple bi-directional\ntransformer basket recommendation model (BTBR), which is focused on directly\nmodeling item-to-item correlations within and across baskets instead of\nlearning complex basket representations. To properly train BTBR, we propose and\ninvestigate several masking strategies and training objectives: (i) item-level\nrandom masking, (ii) item-level select masking, (iii) basket-level all masking,\n(iv) basket-level explore masking, and (v) joint masking. In addition, an\nitem-basket swapping strategy is proposed to enrich the item interactions\nwithin the same baskets. We conduct extensive experiments on three open\ndatasets with various characteristics. The results demonstrate the\neffectiveness of BTBR and our masking and swapping strategies for the NNBR\ntask. BTBR with a properly selected masking and swapping strategy can\nsubstantially improve NNBR performance.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:52:37 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Li","Ming",""],["Ariannezhad","Mozhdeh",""],["Yates","Andrew",""],["de Rijke","Maarten",""]]}
{"id":"2308.01309","submitter":"Pankaj Saini","authors":"Pankaj Saini, N.V.Krishnendu","title":"Constraining the nature of dark compact objects with spin-induced\n  octupole moment measurement","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Various theoretical models predict the existence of exotic compact objects\nthat can mimic the properties of black holes (BHs). Gravitational waves (GWs)\nfrom the mergers of compact objects have the potential to distinguish between\nexotic compact objects and BHs. The measurement of spin-induced multipole\nmoments of compact objects in binaries provides a unique way to test the nature\nof compact objects. The observations of GWs by LIGO and Virgo have already put\nconstraints on the spin-induced quadrupole moment, the leading order\nspin-induced moment. In this work, we develop a Bayesian framework to measure\nthe spin-induced octupole moment, the next-to-leading order spin-induced\nmoment. The precise measurement of the spin-induced octupole moment will allow\nus to test its consistency with that of Kerr BHs in general relativity and\nconstrain the allowed parameter space for non-BH compact objects. For various\nsimulated compact object binaries, we explore the ability of the LIGO and Virgo\ndetector network to constrain spin-induced octupole moment of compact objects.\nWe find that LIGO and Virgo at design sensitivity can constrain the symmetric\ncombination of component spin-induced octupole moments of binary for\ndimensionless spin magnitudes $\\sim 0.8$. Further, we study the possibility of\nsimultaneously measuring the spin-induced quadrupole and octupole moments.\nFinally, we perform this test on selected GW events reported in the third GW\ncatalog. These are the first constraints on spin-induced octupole moment using\nfull Bayesian analysis.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:55:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Saini","Pankaj",""],["Krishnendu","N. V.",""]]}
{"id":"2308.01310","submitter":"Gaurav Narain","authors":"Manishankar Ailiga, Shubhashis Mallik, Gaurav Narain","title":"Lorentzian Robin Universe","comments":"v2: 1+36 pages, 5 figures. Typos corrected, references added","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 delve into the gravitational path integral of Gauss-Bonnet\ngravity in four spacetime dimensions, in the mini-superspace approximation. Our\nprimary focus lies in investigating the transition amplitude between distinct\nboundary configurations. Of particular interest is the case of Robin boundary\nconditions, known to lead to a stable Universe in Einstein-Hilbert gravity,\nalongside Neumann boundary conditions. To ensure a consistent variational\nproblem, we supplement the bulk action with suitable surface terms. This study\nleads us to compute the necessary surface terms required for Gauss-Bonnet\ngravity with the Robin boundary condition, which wasn't known earlier.\nThereafter, we perform an exact computation of the transition amplitude.\nThrough $\\hbar\\to0$ analysis, we discover that the Gauss-Bonnet gravity\ninherently favors the initial configuration, aligning with the Hartle-Hawking\nno-boundary proposal. Remarkably, as the Universe expands, it undergoes a\ntransition from the Euclidean (imaginary time) to the Lorentzian signature\n(real time). To further reinforce our findings, we employ a saddle point\nanalysis utilizing the Picard-Lefschetz methods. The saddle point analysis\nallows us to find the boundary configurations which lead to Hartle-Hawking\nno-boundary Universe that agrees with the exact computations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:55:49 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 17:11:12 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ailiga","Manishankar",""],["Mallik","Shubhashis",""],["Narain","Gaurav",""]]}
{"id":"2308.01311","submitter":"Mahboubeh Dadkhah","authors":"Amin Abbasishahkoo and Mahboubeh Dadkhah and Lionel Briand and Dayi\n  Lin","title":"TEASMA: A Practical Approach for the Test Assessment of Deep Neural\n  Networks using Mutation Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Successful deployment of Deep Neural Networks (DNNs), particularly in\nsafety-critical systems, requires their validation with an adequate test set to\nensure a sufficient degree of confidence in test outcomes. Mutation analysis,\none of the main techniques for measuring test adequacy in traditional software,\nhas been adapted to DNNs in recent years. This technique is based on generating\nmutants that aim to be representative of actual faults and thus can be used for\ntest adequacy assessment. In this paper, we investigate for the first time\nwhether mutation operators that directly modify the trained DNN model (i.e.,\npost-training) can be used for reliably assessing the test inputs of DNNs. We\npropose and evaluate TEASMA, an approach based on post-training mutation for\nassessing the adequacy of DNN's test sets. In practice, TEASMA allows engineers\nto decide whether they will be able to trust test results and thus validate the\nDNN before its deployment. Based on a DNN model's training set, TEASMA provides\na methodology to build accurate prediction models of the Fault Detection Rate\n(FDR) of a test set from its mutation score, thus enabling its assessment. Our\nlarge empirical evaluation, across multiple DNN models, shows that predicted\nFDR values have a strong linear correlation (R2 >= 0.94) with actual values.\nConsequently, empirical evidence suggests that TEASMA provides a reliable basis\nfor confidently deciding whether to trust test results or improve the test set.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:56:05 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Abbasishahkoo","Amin",""],["Dadkhah","Mahboubeh",""],["Briand","Lionel",""],["Lin","Dayi",""]]}
{"id":"2308.01312","submitter":"Debosmita Bhaumik","authors":"Debosmita Bhaumik, Ahmed Khalifa, Julian Togelius","title":"Lode Encoder: AI-constrained co-creativity","comments":null,"journal-ref":"2021 IEEE Conference on Games (CoG), Copenhagen, Denmark, 2021,\n  pp. 01-08","doi":"10.1109/CoG52621.2021.9619009","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Lode Encoder, a gamified mixed-initiative level creation system\nfor the classic platform-puzzle game Lode Runner. The system is built around\nseveral autoencoders which are trained on sets of Lode Runner levels. When fed\nwith the user's design, each autoencoder produces a version of that design\nwhich is closer in style to the levels that it was trained on. The Lode Encoder\ninterface allows the user to build and edit levels through 'painting' from the\nsuggestions provided by the autoencoders. Crucially, in order to encourage\ndesigners to explore new possibilities, the system does not include more\ntraditional editing tools. We report on the system design and training\nprocedure, as well as on the evolution of the system itself and user tests.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:56:29 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Bhaumik","Debosmita",""],["Khalifa","Ahmed",""],["Togelius","Julian",""]]}
{"id":"2308.01313","submitter":"Bang An","authors":"Bang An, Sicheng Zhu, Michael-Andrei Panaitescu-Liess, Chaithanya\n  Kumar Mummadi, Furong Huang","title":"More Context, Less Distraction: Visual Classification by Inferring and\n  Conditioning on Contextual Attributes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  CLIP, as a foundational vision language model, is widely used in zero-shot\nimage classification due to its ability to understand various visual concepts\nand natural language descriptions. However, how to fully leverage CLIP's\nunprecedented human-like understanding capabilities to achieve better zero-shot\nclassification is still an open question. This paper draws inspiration from the\nhuman visual perception process: a modern neuroscience view suggests that in\nclassifying an object, humans first infer its class-independent attributes\n(e.g., background and orientation) which help separate the foreground object\nfrom the background, and then make decisions based on this information.\nInspired by this, we observe that providing CLIP with contextual attributes\nimproves zero-shot classification and mitigates reliance on spurious features.\nWe also observe that CLIP itself can reasonably infer the attributes from an\nimage. With these observations, we propose a training-free, two-step zero-shot\nclassification method named PerceptionCLIP. Given an image, it first infers\ncontextual attributes (e.g., background) and then performs object\nclassification conditioning on them. Our experiments show that PerceptionCLIP\nachieves better generalization, group robustness, and better interpretability.\nFor example, PerceptionCLIP with ViT-L/14 improves the worst group accuracy by\n16.5% on the Waterbirds dataset and by 3.5% on CelebA.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:57:25 GMT"}],"update_date":"2023-08-03","authors_parsed":[["An","Bang",""],["Zhu","Sicheng",""],["Panaitescu-Liess","Michael-Andrei",""],["Mummadi","Chaithanya Kumar",""],["Huang","Furong",""]]}
{"id":"2308.01315","submitter":"Thomas Scaffidi","authors":"Omid Tavakol, Thomas Scaffidi","title":"Minimal model for the flat bands in copper-substituted lead phosphate\n  apatite","comments":"Typos fixed, real-space version of the Hamiltonian added","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":"  Two recent preprints gave evidence that a copper-substituted lead apatite,\ndenoted as CuPb$_9$(PO$_4$)$_6$OH$_2$ and also known as LK-99, could be a\nroom-temperature superconductor. While other research groups have not yet\nreplicated the superconductivity in this material, a recent Density Functional\nTheory (DFT) calculation indicated the presence of two nearly flat bands near\nthe Fermi level. Such flat bands are known to exhibit strongly correlated\nphysics, which could potentially explain the reported high-$T_c$\nsuperconductivity. In order to facilitate the theoretical study of the\nintriguing physics associated with these two flat bands, we propose a minimal\ntight-binding model which reproduces their main features. We also discuss\nimplications for superconductivity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:57:47 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 17:37:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tavakol","Omid",""],["Scaffidi","Thomas",""]]}
{"id":"2308.01316","submitter":"Zheng Ding","authors":"Zheng Ding, Mengqi Zhang, Jiajun Wu, Zhuowen Tu","title":"Patched Denoising Diffusion Models For High-Resolution Image Synthesis","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 an effective denoising diffusion model for generating\nhigh-resolution images (e.g., 1024$\\times$512), trained on small-size image\npatches (e.g., 64$\\times$64). We name our algorithm Patch-DM, in which a new\nfeature collage strategy is designed to avoid the boundary artifact when\nsynthesizing large-size images. Feature collage systematically crops and\ncombines partial features of the neighboring patches to predict the features of\na shifted image patch, allowing the seamless generation of the entire image due\nto the overlap in the patch feature space. Patch-DM produces high-quality image\nsynthesis results on our newly collected dataset of nature images\n(1024$\\times$512), as well as on standard benchmarks of smaller sizes\n(256$\\times$256), including LSUN-Bedroom, LSUN-Church, and FFHQ. We compare our\nmethod with previous patch-based generation methods and achieve\nstate-of-the-art FID scores on all four datasets. Further, Patch-DM also\nreduces memory complexity compared to the classic diffusion models.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:58:01 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Ding","Zheng",""],["Zhang","Mengqi",""],["Wu","Jiajun",""],["Tu","Zhuowen",""]]}
{"id":"2308.01317","submitter":"Andrew Sellergren","authors":"Shawn Xu, Lin Yang, Christopher Kelly, Marcin Sieniek, Timo\n  Kohlberger, Martin Ma, Wei-Hung Weng, Attila Kiraly, Sahar Kazemzadeh, Zakkai\n  Melamed, Jungyeon Park, Patricia Strachan, Yun Liu, Chuck Lau, Preeti Singh,\n  Christina Chen, Mozziyar Etemadi, Sreenivasa Raju Kalidindi, Yossi Matias,\n  Katherine Chou, Greg S. Corrado, Shravya Shetty, Daniel Tse, Shruthi\n  Prabhakara, Daniel Golden, Rory Pilgrim, Krish Eswaran, Andrew Sellergren","title":"ELIXR: Towards a general purpose X-ray artificial intelligence system\n  through alignment of large language models and radiology vision encoders","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":"  Our approach, which we call Embeddings for Language/Image-aligned X-Rays, or\nELIXR, leverages a language-aligned image encoder combined or grafted onto a\nfixed LLM, PaLM 2, to perform a broad range of tasks. We train this lightweight\nadapter architecture using images paired with corresponding free-text radiology\nreports from the MIMIC-CXR dataset. ELIXR achieved state-of-the-art performance\non zero-shot chest X-ray (CXR) classification (mean AUC of 0.850 across 13\nfindings), data-efficient CXR classification (mean AUCs of 0.893 and 0.898\nacross five findings (atelectasis, cardiomegaly, consolidation, pleural\neffusion, and pulmonary edema) for 1% (~2,200 images) and 10% (~22,000 images)\ntraining data), and semantic search (0.76 normalized discounted cumulative gain\n(NDCG) across nineteen queries, including perfect retrieval on twelve of them).\nCompared to existing data-efficient methods including supervised contrastive\nlearning (SupCon), ELIXR required two orders of magnitude less data to reach\nsimilar performance. ELIXR also showed promise on CXR vision-language tasks,\ndemonstrating overall accuracies of 58.7% and 62.5% on visual question\nanswering and report quality assurance tasks, respectively. These results\nsuggest that ELIXR is a robust and versatile approach to CXR AI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:59:45 GMT"}],"update_date":"2023-08-03","authors_parsed":[["Xu","Shawn",""],["Yang","Lin",""],["Kelly","Christopher",""],["Sieniek","Marcin",""],["Kohlberger","Timo",""],["Ma","Martin",""],["Weng","Wei-Hung",""],["Kiraly","Attila",""],["Kazemzadeh","Sahar",""],["Melamed","Zakkai",""],["Park","Jungyeon",""],["Strachan","Patricia",""],["Liu","Yun",""],["Lau","Chuck",""],["Singh","Preeti",""],["Chen","Christina",""],["Etemadi","Mozziyar",""],["Kalidindi","Sreenivasa Raju",""],["Matias","Yossi",""],["Chou","Katherine",""],["Corrado","Greg S.",""],["Shetty","Shravya",""],["Tse","Daniel",""],["Prabhakara","Shruthi",""],["Golden","Daniel",""],["Pilgrim","Rory",""],["Eswaran","Krish",""],["Sellergren","Andrew",""]]}
{"id":"2308.01320","submitter":"Zhewei Yao","authors":"Zhewei Yao, Reza Yazdani Aminabadi, Olatunji Ruwase, Samyam\n  Rajbhandari, Xiaoxia Wu, Ammar Ahmad Awan, Jeff Rasley, Minjia Zhang,\n  Conglong Li, Connor Holmes, Zhongzhu Zhou, Michael Wyatt, Molly Smith, Lev\n  Kurilenko, Heyang Qin, Masahiro Tanaka, Shuai Che, Shuaiwen Leon Song,\n  Yuxiong He","title":"DeepSpeed-Chat: Easy, Fast and Affordable RLHF Training of ChatGPT-like\n  Models at All Scales","comments":"14 pages, 7 figures","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":"  ChatGPT-like models have revolutionized various applications in artificial\nintelligence, from summarization and coding to translation, matching or even\nsurpassing human performance. However, the current landscape lacks an\naccessible, efficient, and cost-effective end-to-end RLHF (Reinforcement\nLearning with Human Feedback) training pipeline for these powerful models,\nparticularly when training at the scale of billions of parameters. This paper\nintroduces DeepSpeed-Chat, a novel system that democratizes RLHF training,\nmaking it accessible to the AI community. DeepSpeed-Chat offers three key\ncapabilities: an easy-to-use training and inference experience for ChatGPT-like\nmodels, a DeepSpeed-RLHF pipeline that replicates the training pipeline from\nInstructGPT, and a robust DeepSpeed-RLHF system that combines various\noptimizations for training and inference in a unified way. The system delivers\nunparalleled efficiency and scalability, enabling training of models with\nhundreds of billions of parameters in record time and at a fraction of the\ncost. With this development, DeepSpeed-Chat paves the way for broader access to\nadvanced RLHF training, even for data scientists with limited resources,\nthereby fostering innovation and further development in the field of AI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:49:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yao","Zhewei",""],["Aminabadi","Reza Yazdani",""],["Ruwase","Olatunji",""],["Rajbhandari","Samyam",""],["Wu","Xiaoxia",""],["Awan","Ammar Ahmad",""],["Rasley","Jeff",""],["Zhang","Minjia",""],["Li","Conglong",""],["Holmes","Connor",""],["Zhou","Zhongzhu",""],["Wyatt","Michael",""],["Smith","Molly",""],["Kurilenko","Lev",""],["Qin","Heyang",""],["Tanaka","Masahiro",""],["Che","Shuai",""],["Song","Shuaiwen Leon",""],["He","Yuxiong",""]]}
{"id":"2308.01321","submitter":"Ivan L. Zhogin","authors":"I. L. Zhogin","title":"Extragalactic TeV Photons and the Zero-point Vibration Spectrum Limit","comments":"To be submitted to Proc. of PIRT-2023 (pirt.bmstu.ru/en); 3 pages,\n  Latex","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE gr-qc","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  There are observations indicating a possible anomalous transparency of\nintergalactic space (filled with infrared background light) for extragalactic\ngamma-rays of very high energy. The anomaly is usually associated with effects\nof some new physics. However, another explanation is possible -- as a\nmanifestation relating to a cut-off of the zero-point vibration spectrum.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:34:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhogin","I. L.",""]]}
{"id":"2308.01322","submitter":"Rao Li","authors":"R. Li, J. Deka, K. Deka, D. Li","title":"An Algorithm for the Constrained Longest Common Subsequence and\n  Substring Problem","comments":"arXiv admin note: text overlap with arXiv:2308.00925","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\Sigma$ be an alphabet. For two strings $X$, $Y$, and a constrained\nstring $P$ over the alphabet $\\Sigma$, the constrained longest common\nsubsequence and substring problem for two strings $X$ and $Y$ with respect to\n$P$ is to find a longest string $Z$ which is a subsequence of $X$, a substring\nof $Y$, and has $P$ as a subsequence. In this paper, we propose an algorithm\nfor the constrained longest common subsequence and substring problem for two\nstrings with a constrained string.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 04:08:20 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","R.",""],["Deka","J.",""],["Deka","K.",""],["Li","D.",""]]}
{"id":"2308.01323","submitter":"Silke Szymczak","authors":"Jianchang Hu, Silke Szymczak","title":"Evaluation of network-guided random forest for disease gene discovery","comments":"23 pages, 2 tables, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gene network information is believed to be beneficial for disease module and\npathway identification, but has not been explicitly utilized in the standard\nrandom forest (RF) algorithm for gene expression data analysis. We investigate\nthe performance of a network-guided RF where the network information is\nsummarized into a sampling probability of predictor variables which is further\nused in the construction of the RF. Our results suggest that network-guided RF\ndoes not provide better disease prediction than the standard RF. In terms of\ndisease gene discovery, if disease genes form module(s), network-guided RF\nidentifies them more accurately. In addition, when disease status is\nindependent from genes in the given network, spurious gene selection results\ncan occur when using network information, especially on hub genes. Our\nempirical analysis on two balanced microarray and RNA-Seq breast cancer\ndatasets from The Cancer Genome Atlas (TCGA) for classification of progesterone\nreceptor (PR) status also demonstrates that network-guided RF can identify\ngenes from PGR-related pathways, which leads to a better connected module of\nidentified genes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:34:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hu","Jianchang",""],["Szymczak","Silke",""]]}
{"id":"2308.01324","submitter":"Semen Gorfman","authors":"Ido Biran, Semen Gorfman","title":"Permissible domain walls in monoclinic MAB ferroelectric phases","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 concept of monoclinic ferroelectric phases has been extensively used over\nrecent decades for the understanding of ferroelectric materials. Monoclinic\nphases have been actively invoked to describe the phase boundaries such as\nMorphotropic Phase Boundary in functional perovskite oxides. These phases are\nbelieved to play the major role in the enhancement of functional properties\nsuch as dielectricity and electromechanical coupling through rotation of\nspontaneous polarization and modification of the rich domain microstructures.\nUnfortunately, such microstructures remain poorly understood due to the\ncomplexity of the subject. The goal of this work is to formulate the\ngeometrical laws behind the monoclinic domain microstructures. Specifically, we\nimplement the result of our previous work (Gorfman et al, 2022) to catalogue\nand outline some properties of permissible domain walls that connect strain\ndomains with monoclinic (MAB type) symmetry, occurring in ferroelectric\nperovskite oxides. The term permissible (Fousek & Janovec, 1969) pertains to\nthe domain walls, connecting a pair of strain domains without a lattice\nmismatch. We found that 12 monoclinic domains may form pairs connected along 84\ntypes of permissible domain walls. These contain 48 domain walls with fixed\nMiller indices (known as W-walls) and 36 domain walls whose Miller indices may\nchange when free lattice parameters change as well (known as S-walls). We\nprovide simple analytical expressions for the orientation of these domain\nwalls, the matrices of transformation between crystallographic basis vectors\nand for the separation between Bragg peaks, diffracted from each of the pairs\nof domains, connected along 84 permissible domain walls. The resultscan\ncontribute to the understanding and facilitate investigation of complex\nmonoclinic domain microstructures.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:28:28 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Biran","Ido",""],["Gorfman","Semen",""]]}
{"id":"2308.01325","submitter":"Kai Zhou","authors":"Kai Zhou","title":"A uniqueness theorem for meromorphic maps into $\\mathbb{P}^n$ with\n  generic $(2n+2)$ hyperplanes","comments":"arXiv admin note: substantial text overlap with arXiv:2308.01106","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $ H_1,\\dots,H_{2n+2}$ be \\emph{generic} $(2n+2)$ hyperplanes in\n$\\mathbb{P}^n.$ It is proved that if meromorphic maps $ f $ and $ g $ of\n$\\mathbb{C}^m $ into $\\mathbb{P}^n $ satisfy $ f^*(H_j)=g^*(H_j)$ $(1\\leq j\\leq\n2n+2)$ and $ g $ is algebraically non-degenerate then $ f=g.$ This result is\nessentially implied by the proof of Hirotaka Fujimoto in papers [Nagoya Math.\nJ., 1976(64): 117--147] and [Nagoya Math. J., 1978(71): 13--24]. This note\ngives a complete proof of the above uniqueness result.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:33:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhou","Kai",""]]}
{"id":"2308.01326","submitter":"Burkhard Duenweg","authors":"Aaron Brunk, Joydip Chaudhuri, Maria Lukacova-Medvidova, and Burkhard\n  Duenweg","title":"Fundamentals of the Oldroyd-B model revisited: Tensorial vs. vectorial\n  theory","comments":"submitted to Journal of Rheology","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":"  The standard derivation of the Oldroyd-B model starts from a coupled system\nof the momentum equation for the macroscopic flow on the one hand, and\nFokker-Planck dynamics for molecular dumbbells on the other. The constitutive\nequation is then derived via a closure based upon the second moment of the\nend-to-end vector distribution. We here present an alternative closure that is\nrather based upon the first moment, and gives rise to an even simpler\nconstitutive equation. We establish that both closures are physically sound,\nsince both can be derived from (different) well-defined non-equilibrium\nensembles, and both are consistent with the Second Law of thermodynamics. In\ncontrast to the standard model, the new model has a free energy and a\ndissipation rate that are both regular at vanishing conformation tensor. We\nspeculate that this might perhaps alleviate the well-known high Weissenberg\nnumber problem, i. e. severe numerical instabilities of the standard model at\nlarge flow rates. As the new model permits a trivial solution (vanishing\nconformation tensor, vanishing polymer stress), an extension may be needed,\nwhich includes Langevin noise in order to model thermal fluctuations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:42:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Brunk","Aaron",""],["Chaudhuri","Joydip",""],["Lukacova-Medvidova","Maria",""],["Duenweg","Burkhard",""]]}
{"id":"2308.01327","submitter":"Mario Zusag","authors":"Laurin Wagner, Mario Zusag, Theresa Bloder","title":"Careful Whisper -- leveraging advances in automatic speech recognition\n  for robust and interpretable aphasia subtype classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a fully automated approach for identifying speech\nanomalies from voice recordings to aid in the assessment of speech impairments.\nBy combining Connectionist Temporal Classification (CTC) and\nencoder-decoder-based automatic speech recognition models, we generate rich\nacoustic and clean transcripts. We then apply several natural language\nprocessing methods to extract features from these transcripts to produce\nprototypes of healthy speech. Basic distance measures from these prototypes\nserve as input features for standard machine learning classifiers, yielding\nhuman-level accuracy for the distinction between recordings of people with\naphasia and a healthy control group. Furthermore, the most frequently occurring\naphasia types can be distinguished with 90% accuracy. The pipeline is directly\napplicable to other diseases and languages, showing promise for robustly\nextracting diagnostic speech biomarkers.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:53:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wagner","Laurin",""],["Zusag","Mario",""],["Bloder","Theresa",""]]}
{"id":"2308.01328","submitter":"Bilel Guetarni","authors":"Bilel Guetarni, Feryal Windal, Halim Benhabiles, Marianne Petit,\n  Romain Dubois, Emmanuelle Leteurtre, Dominique Collard","title":"A vision transformer-based framework for knowledge transfer from\n  multi-modal to mono-modal lymphoma subtyping models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Determining lymphoma subtypes is a crucial step for better patients treatment\ntargeting to potentially increase their survival chances. In this context, the\nexisting gold standard diagnosis method, which is based on gene expression\ntechnology, is highly expensive and time-consuming making difficult its\naccessibility. Although alternative diagnosis methods based on IHC\n(immunohistochemistry) technologies exist (recommended by the WHO), they still\nsuffer from similar limitations and are less accurate. WSI (Whole Slide Image)\nanalysis by deep learning models showed promising new directions for cancer\ndiagnosis that would be cheaper and faster than existing alternative methods.\nIn this work, we propose a vision transformer-based framework for\ndistinguishing DLBCL (Diffuse Large B-Cell Lymphoma) cancer subtypes from\nhigh-resolution WSIs. To this end, we propose a multi-modal architecture to\ntrain a classifier model from various WSI modalities. We then exploit this\nmodel through a knowledge distillation mechanism for efficiently driving the\nlearning of a mono-modal classifier. Our experimental study conducted on a\ndataset of 157 patients shows the promising performance of our mono-modal\nclassification model, outperforming six recent methods from the\nstate-of-the-art dedicated for cancer classification. Moreover, the power-law\ncurve, estimated on our experimental data, shows that our classification model\nrequires a reasonable number of additional patients for its training to\npotentially reach identical diagnosis accuracy as IHC technologies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:05:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Guetarni","Bilel",""],["Windal","Feryal",""],["Benhabiles","Halim",""],["Petit","Marianne",""],["Dubois","Romain",""],["Leteurtre","Emmanuelle",""],["Collard","Dominique",""]]}
{"id":"2308.01329","submitter":"Yan Zheng","authors":"Yan Zheng, Junpeng Wang, Chin-Chia Michael Yeh, Yujie Fan, Huiyuan\n  Chen, Liang Wang, Wei Zhang","title":"EmbeddingTree: Hierarchical Exploration of Entity Features in Embedding","comments":"5 pages, 3 figures, accepted by PacificVis 2023","journal-ref":null,"doi":"10.1109/PacificVis56936.2023.00032","report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Embedding learning transforms discrete data entities into continuous\nnumerical representations, encoding features/properties of the entities.\nDespite the outstanding performance reported from different embedding learning\nalgorithms, few efforts were devoted to structurally interpreting how features\nare encoded in the learned embedding space. This work proposes EmbeddingTree, a\nhierarchical embedding exploration algorithm that relates the semantics of\nentity features with the less-interpretable embedding vectors. An interactive\nvisualization tool is also developed based on EmbeddingTree to explore\nhigh-dimensional embeddings. The tool helps users discover nuance features of\ndata entities, perform feature denoising/injecting in embedding training, and\ngenerate embeddings for unseen entities. We demonstrate the efficacy of\nEmbeddingTree and our visualization tool through embeddings generated for\nindustry-scale merchant data and the public 30Music listening/playlists\ndataset.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:22:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zheng","Yan",""],["Wang","Junpeng",""],["Yeh","Chin-Chia Michael",""],["Fan","Yujie",""],["Chen","Huiyuan",""],["Wang","Liang",""],["Zhang","Wei",""]]}
{"id":"2308.01330","submitter":"Juan Diego Soler","authors":"J. D. Soler, E. Zari, D. Elia, S. Molinari, C. Mininni, E. Schisano,\n  A. Traficante, R. S. Klessen, S. C. O. Glover, P. Hennebelle, T. Colman, N.\n  Frankel, T. Wenger","title":"A comparison of the Milky Way's recent star formation revealed by dust\n  thermal emission and high-mass stars","comments":"Submitted to A&A (31JUL2023). 8 pages, 7 figures. Comments are\n  welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comparison of the Milky Way's star formation rate (SFR) surface\ndensity ($\\Sigma_{\\rm SFR}$) obtained with two independent state-of-the-art\nobservational methods. The first method infers $\\Sigma_{\\rm SFR}$ from the\nobservations of the dust thermal emission from interstellar dust grains in far\ninfrared wavelengths registered in the Herschel Infrared Galactic Plane Survey\n(Hi-GAL), as presented in Elia et al. (2022). The second method obtains\n$\\Sigma_{\\rm SFR}$ by modeling the current population of O-, B-, and A-type\nstars in a 6 kpc $\\times$ 6 kpc area around the Sun, as presented in Zari et\nal. (2023). We found an agreement between the two methods within a factor of\ntwo for the mean SFRs and the SFR surface density profiles. Given the broad\ndifferences between the observational techniques and the independent\nassumptions in the methods to compute the SFRs, this agreement constitutes a\nsignificant advance in our understanding of the star formation of our Galaxy\nand implies that the local SFR has been roughly constant over the past 10 Myr.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Soler","J. D.",""],["Zari","E.",""],["Elia","D.",""],["Molinari","S.",""],["Mininni","C.",""],["Schisano","E.",""],["Traficante","A.",""],["Klessen","R. S.",""],["Glover","S. C. O.",""],["Hennebelle","P.",""],["Colman","T.",""],["Frankel","N.",""],["Wenger","T.",""]]}
{"id":"2308.01331","submitter":"Muldrow Etheredge","authors":"Muldrow Etheredge","title":"Dense Geodesics, Tower Alignment, and the Sharpened Distance Conjecture","comments":"41 pages, 11 figures","journal-ref":null,"doi":null,"report-no":"ACFI-T23-04","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Sharpened Distance Conjecture and Tower Scalar Weak Gravity Conjecture\nare closely related but distinct conjectures, neither one implying the other.\nMotivated by examples, I propose that both are consequences of two new\nconjectures: 1. The infinite distance geodesics passing through an arbitrary\npoint $\\phi$ in the moduli space populate a dense set of directions in the\ntangent space at $\\phi$. 2. Along any infinite distance geodesic, there exists\na tower of particles whose scalar-charge-to-mass ratio ($-\\nabla \\log m$)\nprojection everywhere along the geodesic is greater than or equal to\n$1/\\sqrt{d-2}$. I perform several nontrivial tests of these new conjectures in\nmaximal and half-maximal supergravity examples. I also use the Tower Scalar\nWeak Gravity Conjecture to conjecture a sharp bound on exponentially heavy\ntowers that accompany infinite distance limits.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Etheredge","Muldrow",""]]}
{"id":"2308.01332","submitter":"Kyle Lee","authors":"Kyle Lee, Ian Moult","title":"Joint Track Functions: Expanding the Space of Calculable Correlations at\n  Colliders","comments":"25 pages, 9 fancy figures","journal-ref":null,"doi":null,"report-no":"MIT-CTP-5591","categories":"hep-ph hep-ex nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The theoretical description of observables at collider experiments relies on\nfactorization theorems separating perturbative dynamics from universal\nnon-perturbative matrix elements. Despite significant recent progress in\nextending these factorization theorems to increasingly differential jet\nsubstructure observables, the focus has been primarily on infrared safe\nobservables sensitive only to correlations in the energy of final state\nhadrons. However, significant information about the dynamics of the underlying\ncollision is encoded in how energy is correlated between hadrons of different\nquantum numbers. In this paper we extend the class of calculable correlations\nby deriving factorization theorems for a broad class of correlations, $\\langle\n\\mathcal{E}_{R_1}(n_1) \\cdots \\mathcal{E}_{R_k}(n_k) \\rangle$, between the\nenergy flux carried by hadrons specified by quantum numbers, $R_1, \\cdots,\nR_k$. We show that these factorization theorems involve moments of a new class\nof universal non-perturbative functions, the \"joint track functions\", which\nextend the track function formalism to describe the fraction of energy carried\nby hadrons of multiple quantum numbers arising from the fragmentation of quarks\nor gluons. We study the general properties of these functions, and then apply\nthis to the specific case of joint track functions for positive and negative\nelectromagnetic charges. We extract these from parton shower Monte Carlo\nprograms and use them to calculate correlations in electromagnetically charged\nenergy flux. We additionally propose and study a C-odd\n$\\mathcal{E}_{\\mathcal{Q}}$ detector, which results in a qualitatively distinct\nscaling behavior compared to the standard energy correlators. Our formalism\nsignificantly extends the class of observables that can be computed at hadron\ncolliders, with a wide range of applications from particle to nuclear physics.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lee","Kyle",""],["Moult","Ian",""]]}
{"id":"2308.01333","submitter":"James Cline","authors":"James M. Cline, Matteo Puel, Takashi Toma","title":"Boosted dark matter from a phantom fluid","comments":"4 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"KANAZAWA-23-07","categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is known that theories of phantom dark energy, considered as quantum\nfields, predict a continuous production of positive- plus negative-energy\nparticles, from spontaneous decay of the vacuum. We show that this can be a new\nsource of boosted dark matter or radiation, with consequences for direct\ndetection. We set constraints on such models using data from the XENONnT\nexperiment, and we show that recent excess events reported by the DAMIC\nexperiment can be consistently described as coming from dark radiation,\nproduced by vacuum decay, interacting with electrons.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cline","James M.",""],["Puel","Matteo",""],["Toma","Takashi",""]]}
{"id":"2308.01334","submitter":"Benjamin Safdi","authors":"Joshua N. Benabou, Malte Buschmann, Soubhik Kumar, Yujin Park,\n  Benjamin R. Safdi","title":"Signatures of Primordial Energy Injection from Axion Strings","comments":"30 pages, 20 figures, Supplementary Animations at\n  https://goo.by/qHk9d, Video Abstract at https://youtu.be/Ae4AR46qKnU","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO astro-ph.HE hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Axion strings are horizon-size topological defects that may be produced in\nthe early Universe. Ultra-light axion-like particles may form strings that\npersist to temperatures below that of big bang nucleosynthesis. Such strings\nhave been considered previously as sources of gravitational waves and cosmic\nmicrowave background (CMB) polarization rotation. In this work we show, through\nanalytic arguments and dedicated adaptive mesh refinement cosmological\nsimulations, that axion strings deposit a sub-dominant fraction of their energy\ninto high-energy Standard Model (SM) final states, for example, by the direct\nproduction of heavy radial modes that subsequently decay to SM particles. This\nhigh-energy SM radiation is absorbed by the primordial plasma, leading to novel\nsignatures in precision big bang nucleosynthesis, the CMB power spectrum, and\ngamma-ray surveys. In particular, we show that CMB power spectrum data\nconstrains axion strings with decay constants $f_a \\lesssim 10^{12}$ GeV, up to\nmodel dependence on the ultraviolet completion, for axion masses $m_a \\lesssim\n10^{-29}$ eV; future CMB surveys could find striking evidence of axion strings\nwith lower decay constants.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Benabou","Joshua N.",""],["Buschmann","Malte",""],["Kumar","Soubhik",""],["Park","Yujin",""],["Safdi","Benjamin R.",""]]}
{"id":"2308.01335","submitter":"Richard Parker","authors":"Richard J. Parker (1) and Catarina Alves de Oliveira (2) (1:\n  University of Sheffield, UK, 2: ESA, Madrid, Spain)","title":"On the origin of planetary-mass objects in NGC1333","comments":"11 pages, 8 figures, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2378","report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dominant formation mechanism of brown dwarfs and planetary mass objects\nin star-forming regions is presently uncertain. Do they form like stars, via\nthe collapse and fragmentation of cores in Giant Molecular clouds, or do they\nform like planets in the discs around stars and are ejected via dynamical\ninteractions? In this paper, we quantify the spatial distribution of substellar\nobjects in NGC1333, in particular focusing on planetary-mass objects that have\nbeen the target of recent deep imaging observations. We find that these objects\nhave a spatial distribution that is indistinguishable from the stars, and more\nmassive brown dwarfs. We also analyse N-body simulations and find that a\npopulation of ejected planets would have a significantly different spatial and\nkinematic distribution to stars, and brown dwarfs that also formed through\ngravitational collapse and fragmentation. We therefore conclude that the\nlow-mass substellar objects in NGC1333 formed more like stars than planets,\nalthough we predict that a population of hitherto undetected ejected planetary\nmass objects may be lurking in this, and other star-forming regions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Parker","Richard J.",""],["de Oliveira","Catarina Alves",""]]}
{"id":"2308.01336","submitter":"Jan Heisig","authors":"Tobias Binder, Mathias Garny, Jan Heisig, Stefan Lederer, Kai Urban","title":"Excited bound states and their role in dark matter production","comments":"21 pages + references, 10 figures","journal-ref":null,"doi":null,"report-no":"TUM-HEP 1469/23, TTK-23-21","categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the impact of highly excited bound states on the evolution of\nnumber densities of new physics particles, specifically dark matter, in the\nearly Universe. Focusing on dipole transitions within perturbative, unbroken\ngauge theories, we develop an efficient method for including around a million\nbound state formation and bound-to-bound transition processes. This enables us\nto examine partial-wave unitarity and accurately describe the freeze-out\ndynamics down to very low temperatures. In the non-Abelian case, we find that\nhighly excited states can prevent the particles from freezing out, supporting a\ncontinuous depletion in the regime consistent with perturbativity and\nunitarity. We apply our formalism to a simplified dark matter model featuring a\ncolored and electrically charged $t$-channel mediator. Our focus is on the\nregime of superWIMP production which is commonly characterized by a mediator\nfreeze-out followed by its late decay into dark matter. In contrast, we find\nthat excited states render mediator depletion efficient all the way until its\ndecay, introducing a dependence of the dark matter density on the mediator\nlifetime as a novel feature. The impact on the viable dark matter mass can\namount to an order of magnitude, relaxing constraints from Lyman-$\\alpha$\nobservations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Binder","Tobias",""],["Garny","Mathias",""],["Heisig","Jan",""],["Lederer","Stefan",""],["Urban","Kai",""]]}
{"id":"2308.01337","submitter":"Michael Antesberger","authors":"Michael Antesberger, Carla M. D. Richter, Francesco Poletti, Radan\n  Slav\\'ik, Periklis Petropoulos, Hannes H\\\"ubel, Alessandro Trenti, Philip\n  Walther, and Lee A. Rozema","title":"Distribution of telecom Time-Bin Entangled Photons through a 7.7 km\n  Hollow-Core Fiber","comments":"9 pages (incl. 2 pages appendix), 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  State of the art classical and quantum communication rely on standard optical\nfibers with solid cores to transmit light over long distances. However, recent\nadvances have led to the emergence of hollow-core optical fibers (HCFs), which\ndue to the novel fiber geometry, show remarkable optical guiding properties,\nwhich are not as limited by the material properties as solid-core fibers. In\nthis paper, we explore the transmission of entangled photons through a novel\n7.7 km HCF, presenting the first successful demonstration of entanglement\ndistribution via long-distance HCF. Our study highlights the low latency and\nlow chromatic dispersion intrinsic to HCF, which can increase the secure key\nrate in time-bin based quantum key distribution protocols.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Antesberger","Michael",""],["Richter","Carla M. D.",""],["Poletti","Francesco",""],["Slav\u00edk","Radan",""],["Petropoulos","Periklis",""],["H\u00fcbel","Hannes",""],["Trenti","Alessandro",""],["Walther","Philip",""],["Rozema","Lee A.",""]]}
{"id":"2308.01338","submitter":"Matthias Neubert","authors":"Anne Mareike Galda and Matthias Neubert (Johannes Gutenberg\n  University, Mainz)","title":"ALP-LEFT Interference and the Muon $(g-2)$","comments":"30 pages, 6 figures, 1 table, 1 appendix","journal-ref":null,"doi":null,"report-no":"MITP-23-039","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The low-energy effective field theory (LEFT) provides the appropriate\nframework to describe particle interactions below the scale of electroweak\nsymmetry breaking, $\\mu_w\\sim v$. By matching the Standard Model onto the LEFT,\nnon-zero Wilson coefficients of higher-dimensional operators are generated,\nsuppressed by the corresponding power of $1/v$. An axion or axion-like particle\n(ALP) with mass $m_a\\ll\\mu_w$ that interacts with the Standard Model via\nclassically shift-invariant dimension-five operators would also contribute to\nthe LEFT Wilson coefficients, since it can appear as a virtual particle in\ndivergent Green's functions and thus has an impact on the renormalization of\nthe LEFT operators. We present the full set of one-loop ALP-induced source\nterms modifying the renormalization-group evolution equations of the LEFT\nWilson coefficients up to dimension-six order. Our framework allows for\nmodel-independent ALP searches at low energies from current bounds on LEFT\nWilson coefficients. As a concrete application, we present an improved\nprediction for ALP effects on the anomalous magnetic moment of the muon.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Galda","Anne Mareike","","Johannes Gutenberg\n  University, Mainz"],["Neubert","Matthias","","Johannes Gutenberg\n  University, Mainz"]]}
{"id":"2308.01339","submitter":"Mor Moshe Roses","authors":"Emanuele G. Dalla Torre and Mor M. Roses","title":"Dissipative mean-field theory of IBM utility experiment","comments":"4 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In spite of remarkable recent advances, quantum computers have not yet found\nany useful applications. A promising direction for such utility is offered by\nthe simulation of the dynamics of many-body quantum systems, which cannot be\nefficiently computed classically. Recently, IBM used a superconducting quantum\ncomputer to simulate a kicked quantum Ising model for large numbers of qubits\nand time steps. By employing powerful error mitigation techniques, they were\nable to obtain an excellent agreement with the exact solution of the model.\nThis result is very surprising, considering that the total error accumulated by\nthe circuit is prohibitively large. In this letter, we address this paradox by\nintroducing a dissipative mean-field approximation based on Kraus operators.\nOur effective theory reproduces the many-body unitary dynamics and matches\nquantitatively local and non-local observables. These findings demonstrate that\nthe observed dynamics is equivalent to a single qubit undergoing rotations and\ndephasing. Our emergent description can explain the success of the quantum\ncomputer in solving this specific problem.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Torre","Emanuele G. Dalla",""],["Roses","Mor M.",""]]}
{"id":"2308.01340","submitter":"Arindam Bhattacharya","authors":"Pouya Asadi, Arindam Bhattacharya, Katherine Fraser, Samuel Homiller,\n  Aditya Parikh","title":"Wrinkles in the Froggatt-Nielsen Mechanism and Flavorful New Physics","comments":"31 pages plus appendices, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When the Froggatt-Nielsen mechanism is used to explain the Standard Model\nflavor hierarchy, new physics couplings are also determined by the horizontal\nsymmetry. However, additional symmetries or dynamics in the UV can sometimes\nlead to a departure from this na\\\"ive scaling for the new physics couplings. We\nshow that an effective way to keep track of these changes is by using the new\nspurions of the $\\mathrm{U}(3)^5$ global flavor symmetry, where we parameterize\nextra suppression or enhancement factors, referred to as wrinkles, using the\nsame power counting parameter as in the original Froggatt-Nielsen model. As a\nconcrete realization, we consider two flavor spurions of the $S_1$ leptoquark,\nand demonstrate that wrinkles can be used to make an enhanced value of\n$\\textrm{BR}(B^+ \\to K^+\\nu\\bar{\\nu})$ consistent with other flavor\nobservables. We also present example UV models that realize wrinkles, and\ncomment on choosing consistent charges in ordinary Froggatt-Nielsen models\nwithout the typical monotonicity condition.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Asadi","Pouya",""],["Bhattacharya","Arindam",""],["Fraser","Katherine",""],["Homiller","Samuel",""],["Parikh","Aditya",""]]}
{"id":"2308.01341","submitter":"Salvador Rosauro Alcaraz","authors":"A. Abada, G. Arcadi, M. Lucente, G. Piazza, S. Rosauro-Alcaraz","title":"Thermal effects in freeze-in neutrino dark matter production","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a detailed study of the production of dark matter in the form of a\nsterile neutrino via freeze-in from decays of heavy right-handed neutrinos. Our\ntreatment accounts for thermal effects in the effective couplings, generated\nvia neutrino mixing, of the new heavy neutrinos with the Standard Model gauge\nand Higgs bosons and can be applied to several low-energy fermion seesaw\nscenarios featuring heavy neutrinos in thermal equilibrium with the primordial\nplasma. We find that the production of dark matter is not as suppressed as to\nwhat is found when considering only Standard Model gauge interactions. Our\nstudy shows that the freeze-in dark matter production could be efficient.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Abada","A.",""],["Arcadi","G.",""],["Lucente","M.",""],["Piazza","G.",""],["Rosauro-Alcaraz","S.",""]]}
{"id":"2308.01342","submitter":"Maria Jesus Jimenez-Donaire","authors":"M. J. Jim\\'enez-Donaire, A. Usero, I. Be\\v{s}li\\'c, M. Tafalla, A.\n  Chac\\'on-Tanarro, Q. Salom\\'e, C. Eibensteiner, A. Garc\\'ia-Rodr\\'iguez, A.\n  Hacar, A. T. Barnes, F. Bigiel, M. Chevance, D. Colombo, D. A. Dale, T. A.\n  Davis, S. C. O. Glover, J. Kauffmann, R. S. Klessen, A. K. Leroy, L. Neumann,\n  H. Pan, J. Pety, M. Querejeta, T. Saito, E. Schinnerer, S. Stuber and T. G.\n  Williams","title":"A constant N$_2$H$^+$(1-0)-to-HCN(1-0) ratio on kiloparsec scales","comments":"Accepted for publication in Astronomy & Astrophysics","journal-ref":"A&A 676, L11 (2023)","doi":"10.1051/0004-6361/202347050","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nitrogen hydrides such as NH$_3$ and N$_2$H$^+$ are widely used by Galactic\nobservers to trace the cold dense regions of the interstellar medium. In\nexternal galaxies, because of limited sensitivity, HCN has become the most\ncommon tracer of dense gas over large parts of galaxies. We provide the first\nsystematic measurements of N$_2$H$^+$(1-0) across different environments of an\nexternal spiral galaxy, NGC6946. We find a strong correlation ($r>0.98,p<0.01$)\nbetween the HCN(1-0) and N$_2$H$^+$(1-0) intensities across the inner\n$\\sim8\\mathrm{kpc}$ of the galaxy, at kiloparsec scales. This correlation is\nequally strong between the ratios N$_2$H$^+$(1-0)/CO(1-0) and HCN(1-0)/CO(1-0),\ntracers of dense gas fractions ($f_\\mathrm{dense}$). We measure an average\nintensity ratio of N$_2$H$^+$(1-0)/HCN(1-0)$=0.15\\pm0.02$ over our set of five\nIRAM-30m pointings. These trends are further supported by existing measurements\nfor Galactic and extragalactic sources. This narrow distribution in the average\nratio suggests that the observed systematic trends found in kiloparsec-scale\nextragalactic studies of $f_\\mathrm{dense}$ and the efficiency of dense gas\n(SFE$_\\mathrm{dense}$) would not change if we employed N$_2$H$^+$(1-0) as a\nmore direct tracer of dense gas. At kiloparsec scales our results indicate that\nthe HCN(1-0) emission can be used to predict the expected N$_2$H$^+$(1-0) over\nthose regions. Our results suggest that, even if HCN(1-0) and N$_2$H$^+$(1-0)\ntrace different density regimes within molecular clouds, subcloud differences\naverage out at kiloparsec scales, yielding the two tracers proportional to each\nother.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jim\u00e9nez-Donaire","M. J.",""],["Usero","A.",""],["Be\u0161li\u0107","I.",""],["Tafalla","M.",""],["Chac\u00f3n-Tanarro","A.",""],["Salom\u00e9","Q.",""],["Eibensteiner","C.",""],["Garc\u00eda-Rodr\u00edguez","A.",""],["Hacar","A.",""],["Barnes","A. T.",""],["Bigiel","F.",""],["Chevance","M.",""],["Colombo","D.",""],["Dale","D. A.",""],["Davis","T. A.",""],["Glover","S. C. O.",""],["Kauffmann","J.",""],["Klessen","R. S.",""],["Leroy","A. K.",""],["Neumann","L.",""],["Pan","H.",""],["Pety","J.",""],["Querejeta","M.",""],["Saito","T.",""],["Schinnerer","E.",""],["Stuber","S.",""],["Williams","T. G.",""]]}
{"id":"2308.01343","submitter":"Evert Nasedkin","authors":"Evert Nasedkin, Paul Molli\\`ere, Jason Wang, Faustine Cantalloube,\n  Laura Kreidberg, Laurent Pueyo, Tomas Stolker, Arthur Vigan","title":"Impacts of high-contrast image processing on atmospheric retrievals","comments":"22 pages, 13 figures, accepted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many post-processing algorithms have been developed in order to better\nseparate the signal of a companion from the bright light of the host star, but\nthe effect of such algorithms on the shape of exoplanet spectra extracted from\nintegral field spectrograph data is poorly understood. The resulting spectra\nare affected by noise that is correlated in wavelength space due to both\noptical and data processing effects. Within the framework of Bayesian\natmospheric retrievals, we aim to understand how these correlations and other\nsystematic effects impact the inferred physical parameters. We consider three\nalgorithms (KLIP, PynPoint and ANDROMEDA), optimizing the choice of algorithmic\nparameters using a series of injection tests into archival SPHERE and GPI data\nof the HR 8799 system. The wavelength-dependent covariance matrix is calculated\nto provide a measure of instrumental and algorithmic systematics. We perform\natmospheric retrievals using petitRADTRANS on optimally extracted spectra to\nmeasure how these data processing systematics influence the retrieved parameter\ndistributions. The choice of data processing algorithm and parameters\nsignificantly impact the accuracy of retrieval results, with the mean posterior\nparameter bias ranging from 1 to 3 $\\sigma$ from the true input parameters.\nIncluding the full covariance matrix in the likelihood improves the accuracy of\ninferred parameters, and cannot be accounted for using ad hoc scaling\nparameters in the retrieval framework. Using the Bayesian information criterion\nand other statistical measures as a heuristic goodness-of-fit metrics, the\nretrievals including the full covariance matrix are favoured when compared to\nusing only the diagonal elements.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Nasedkin","Evert",""],["Molli\u00e8re","Paul",""],["Wang","Jason",""],["Cantalloube","Faustine",""],["Kreidberg","Laura",""],["Pueyo","Laurent",""],["Stolker","Tomas",""],["Vigan","Arthur",""]]}
{"id":"2308.01344","submitter":"Nicolas Martin","authors":"Nicolas F. Martin, Else Starkenburg, Zhen Yuan, Morgan Fouesneau, Anke\n  Arentsen, Francesca De Angeli, Felipe Gran, Martin Montelius, Ren\\'e Andrae,\n  Michele Bellazzini, Paolo Montegriffo, Anna F. Esselink, Hanyuan Zhang, Kim\n  A. Venn, Akshara Viswanathan, David S. Aguado, Giuseppina Battaglia, Manuel\n  Bayer, Piercarlo Bonifacio, Elisabetta Caffau, Patrick C\\^ot\\'e, Raymond\n  Carlberg, S\\'ebastien Fabbro, Emma Fern\\'andez Alvar, Jonay I. Gonz\\'alez\n  Hern\\'andez, Isaure Gonz\\'alez Rivera de La Vernhe, Vanessa Hill, Rodrigo A.\n  Ibata, Pascale Jablonka, Georges Kordopatis, Carmela Lardo, Alan W.\n  McConnachie, Camila Navarrete, Julio Navarro, Alejandra Recio-Blanco, Rub\\'en\n  S\\'anchez Janssen, Federico Sestito, Guillaume F. Thomas, Sara Vitali,\n  Kristopher Youakim","title":"The Pristine survey -- XXIII. Data Release 1 and an all-sky metallicity\n  catalogue based on Gaia DR3 BP/RP spectro-photometry","comments":"30 pages, 24 figures, submitted to A&A. First two authors are\n  co-first author. The CaHK photometry catalogue and the two photometric\n  metallicity catalogues are available, before acceptance, as large compressed\n  csv files at: https://seafile.unistra.fr/d/ee0c0f05719d4368bcbb/","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the spectro-photometric information of ~219 million stars from Gaia's\nDR3 to calculate synthetic, narrow-band, metallicity-sensitive CaHK magnitudes\nthat mimic the observations of the Pristine survey, a survey of photometric\nmetallicities of Milky Way stars that has been mapping more than 6,500 deg^2 of\nthe northern sky with the CFHT since 2015. These synthetic magnitudes are used\nfor an absolute re-calibration of the deeper Pristine photometry and, combined\nwith broadband Gaia information, synthetic and Pristine CaHK magnitudes are\nused to estimate photometric metallicities over the whole sky. The resulting\nmetallicity catalogue is accurate down to [Fe/H]~-3.5 and is particularly\nsuited for the exploration of the metal-poor Milky Way ([Fe/H]<-1.0). We make\navailable here the catalogue of synthetic CaHK_syn magnitudes for all stars\nwith BP/RP information in Gaia DR3, as well as an associated catalogue of more\nthan ~30 million photometric metallicities for high S/N FGK stars. This paper\nfurther provides the first public DR of the Pristine catalogue in the form of\nhigher quality recalibrated Pristine CaHK magnitudes and photometric\nmetallicities for all stars in common with the BP/RP information in Gaia DR3.\nWe demonstrate that, when available, the much deeper Pristine data greatly\nenhances the quality of the derived metallicities, in particular at the faint\nend of the catalogue (G_BP>16). Combined, both catalogues include more than 2\nmillion metal-poor star candidates as well as more than 200,000 and ~8,000 very\nand extremely metal-poor candidates. Finally, we show that these metallicity\ncatalogues can be used efficiently, among other applications, for Galactic\narchaeology, to hunt for the most metal-poor stars, and to study how the\nstructure of the Milky Way varies with metallicity, from the flat distribution\nof disk stars to the spheroid-shaped metal-poor halo. (Shortened)\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Martin","Nicolas F.",""],["Starkenburg","Else",""],["Yuan","Zhen",""],["Fouesneau","Morgan",""],["Arentsen","Anke",""],["De Angeli","Francesca",""],["Gran","Felipe",""],["Montelius","Martin",""],["Andrae","Ren\u00e9",""],["Bellazzini","Michele",""],["Montegriffo","Paolo",""],["Esselink","Anna F.",""],["Zhang","Hanyuan",""],["Venn","Kim A.",""],["Viswanathan","Akshara",""],["Aguado","David S.",""],["Battaglia","Giuseppina",""],["Bayer","Manuel",""],["Bonifacio","Piercarlo",""],["Caffau","Elisabetta",""],["C\u00f4t\u00e9","Patrick",""],["Carlberg","Raymond",""],["Fabbro","S\u00e9bastien",""],["Alvar","Emma Fern\u00e1ndez",""],["Hern\u00e1ndez","Jonay I. Gonz\u00e1lez",""],["de La Vernhe","Isaure Gonz\u00e1lez Rivera",""],["Hill","Vanessa",""],["Ibata","Rodrigo A.",""],["Jablonka","Pascale",""],["Kordopatis","Georges",""],["Lardo","Carmela",""],["McConnachie","Alan W.",""],["Navarrete","Camila",""],["Navarro","Julio",""],["Recio-Blanco","Alejandra",""],["Janssen","Rub\u00e9n S\u00e1nchez",""],["Sestito","Federico",""],["Thomas","Guillaume F.",""],["Vitali","Sara",""],["Youakim","Kristopher",""]]}
{"id":"2308.01345","submitter":"Bartolomeo Trefoloni","authors":"Bartolomeo Trefoloni","title":"Searching for outflows in X-ray weak quasars","comments":"IAU Symposyum 378 Proceeding, accepted for pubblication, 6 pages, 2\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The connection between X-ray weakness and powerful X-ray outflows is both\nexpected in a scenario where outflows are connected with radiation-driven\nwinds, and observed in several sources, both in the local Universe and at high\nredshift. Here I present the first results of a new study of this possible\nconnection based on a search for SDSS quasars with weak X-ray emission in\nserendipitous XMM-Newton observations. The selected objects have a \"normal\"\noptical/UV blue continuum, but a flat and extraordinarily weak X-ray spectrum.\nThe availability of rest-frame optical/UV spectra allows to check for the\nsignature of outflows in the absorption lines and/or in the profiles of the\nemission lines. This method could reveal the presence of a population of so-far\noverlooked outflowing quasars and confirm the connection between winds and\nX-ray weakness in quasars.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Trefoloni","Bartolomeo",""]]}
{"id":"2308.01346","submitter":"Kay Sch\\\"onwald","authors":"Manuel Egner, Matteo Fael, Kay Sch\\\"onwald, Matthias Steinhauser","title":"Revisiting semileptonic $B$ meson decays at next-to-next-to-leading\n  order","comments":"25 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"P3H-23-053, TTP23-030, ZU-TH 41/23, CERN-TH-2023-151","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute next-to-next-to-leading order corrections to the semileptonic\ndecay rate of $B$ mesons for arbitrary values of the final-state quark mass.\nFor the contribution with one massive quark in the final state, we extend the\nliterature result and obtain analytic expressions in terms of iterated\nintegrals. For the complete contribution, which also includes contributions\nwith three massive quarks in the final state, we present a semi-analytic\nmethod, which leads to a precise approximation formula for the decay rate. Our\nresults agree with the expansions available for $b\\to c\\ell \\bar{\\nu}_\\ell$ and\n$b\\to u\\ell \\bar{\\nu}_\\ell$ in the literature. The main emphasize of this paper\nis on the technical aspects of the calculation which are useful for a wider\nrange of applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Egner","Manuel",""],["Fael","Matteo",""],["Sch\u00f6nwald","Kay",""],["Steinhauser","Matthias",""]]}
{"id":"2308.01347","submitter":"Aidan Reilly","authors":"Aidan Reilly and Natalia Toro","title":"Ultraviolet Running Constraints on Low Mass Dark Sectors","comments":"30 pages, 12 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze the UV breakdown of Sub-GeV dark matter models that live in a new,\ndark U(1) sector. Many of these models include a scalar field, which is either\nthe dark matter itself or a dark Higgs field that generates mass terms for the\ndark matter particle via spontaneous symmetry breaking. A quartic self coupling\nof this scalar field is generically allowed, and we show that its running is\nlargely governed by the strength of the U(1) gauge field, $\\alpha_D$.\nFurthermore, it consistently has a lower Landau pole than the gauge coupling.\nLink fields, which couple to both the dark sector and the Standard Model (SM),\nconnect these Landau poles to constraints on SM charged particles. Current LHC\nconstraints on link fields are compatible with $\\alpha_D \\lesssim 0.5 - 1$ for\nmost of the mass range in most models, while smaller values, $\\alpha_D \\lesssim\n0.15$, are favored for Majorana DM.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Reilly","Aidan",""],["Toro","Natalia",""]]}
{"id":"2308.01348","submitter":"Ancy Anna John","authors":"Ancy Anna John, Andrew Collier Cameron, Jo\\~ao P. Faria, Annelies\n  Mortier, Thomas G. Wilson and HARPS-N team","title":"Sub-m s$^{-1}$ upper limits from a deep HARPS-N radial-velocity search\n  for planets orbiting HD 166620 and HD 144579","comments":"7 tables, 24 figures (including those in appendix)","journal-ref":null,"doi":"10.1093/mnras/stad2381","report-no":null,"categories":"astro-ph.EP astro-ph.IM astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Minimising the impact of stellar variability in Radial Velocity (RV)\nmeasurements is a critical challenge in achieving the 10 cm s$^{-1}$ precision\nneeded to hunt for Earth twins. Since 2012, a dedicated programme has been\nunderway with HARPS-N, to conduct a blind RV Rocky Planets Search (RPS) around\nbright stars in the Northern Hemisphere. Here we describe the results of a\ncomprehensive search for planetary systems in two RPS targets, HD 166620 and HD\n144579. Using wavelength-domain line-profile decorrelation vectors to mitigate\nthe stellar activity and performing a deep search for planetary reflex motions\nusing a trans-dimensional nested sampler, we found no significant planetary\nsignals in the data sets of either of the stars. We validated the results via\ndata-splitting and injection recovery tests. Additionally, we obtained the 95th\npercentile detection limits on the HARPS-N RVs. We found that the likelihood of\nfinding a low-mass planet increases noticeably across a wide period range when\nthe inherent stellar variability is corrected for using scalpels U-vectors. We\nare able to detect planet signals with $M\\sin i \\leq 1$ M$_\\oplus$ for orbital\nperiods shorter than 10 days. We demonstrate that with our decorrelation\ntechnique, we are able to detect signals as low as 54 cm s$^{-1}$, which brings\nus closer to the calibration limit of 50 cm s$^{-1}$ demonstrated by HARPS-N.\nTherefore, we show that we can push down towards the RV precision required to\nfind Earth analogues using high-precision radial velocity data with novel\ndata-analysis techniques.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["John","Ancy Anna",""],["Cameron","Andrew Collier",""],["Faria","Jo\u00e3o P.",""],["Mortier","Annelies",""],["Wilson","Thomas G.",""],["team","HARPS-N",""]]}
{"id":"2308.01349","submitter":"Jongjun Lee","authors":"Jongjun M. Lee, Myung-Joong Hwang, Hyun-Woo Lee","title":"Topological magnon-photon interaction for cavity magnonics","comments":"8 pages, 2 figures, Accepted version to Communications Physics","journal-ref":"Communications Physics 6, 194 (2023)","doi":"10.1038/s42005-023-01316-8","report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The study of cavity magnonics and topological insulators has made significant\nadvances over the past decade, however the possibility of combining the two\nfields is still unexplored. Here, we explore such connection by investigating\nhybrid cavity systems that incorporate both a ferromagnet and a topological\ninsulator. We find that electrons in the topological surface state efficiently\nmediate the effective electric dipole coupling between the spin of the\nferromagnet and the electric field of the cavity, in contrast with the\nconventional cavity magnonics theory based on magnetic dipole coupling. We\nrefer to this coupling as topological magnon-photon interaction, estimating it\none order of magnitude stronger than the conventional magnon-photon coupling,\nand showing that its sign can be manipulated. We discuss the potential of our\nproposed device to allow for scaling down and controlling the cavity system\nusing electronics. Our results provide solid ground for exploring the\nfunctionalities enabled by merging cavity magnonics with topological\ninsulators.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lee","Jongjun M.",""],["Hwang","Myung-Joong",""],["Lee","Hyun-Woo",""]]}
{"id":"2308.01350","submitter":"Luis A. Colmenarez","authors":"Luis Colmenarez, David J. Luitz and Wojciech De Roeck","title":"Ergodic inclusions in many body localized systems","comments":"11 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the effect of ergodic inclusions in putative many-body\nlocalized systems. To this end, we consider the random field Heisenberg chain,\nwhich is many-body localized at strong disorder and we couple it to an ergodic\nbubble, modeled by a random matrix Hamiltonian. Recent theoretical work\nsuggests that the ergodic bubble destabilizes the apparent localized phase at\nintermediate disorder strength and finite sizes. We tentatively confirm this by\nnumerically analyzing the response of the local thermality, quantified by\none-site purities, to the insertion of the bubble. For a range of intermediate\ndisorder strengths, this response decays very slowly, or not at all, with\nincreasing distance to the bubble. This suggests that at those disorder\nstrengths, the system is delocalized in the thermodynamic limit. However, the\nnumerics is unfortunately not unambiguous and we cannot definitely rule out\nartefacts.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:04 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 08:29:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Colmenarez","Luis",""],["Luitz","David J.",""],["De Roeck","Wojciech",""]]}
{"id":"2308.01351","submitter":"Jonathan Curtis","authors":"Jonathan B. Curtis, Prineha Narang, Victor Galitski","title":"Absence of Weak Localization on Negative Curvature Surfaces","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interplay between disorder and quantum interference leads to a wide\nvariety of physical phenomena including celebrated Anderson localization -- the\ncomplete absence of diffusive transport due to quantum interference between\ndifferent particle trajectories. In two dimensions, any amount of disorder is\nthought to induce localization of all states at long enough length scales,\nthough this may be prevented if bands are topological or have strong spin-orbit\ncoupling. In this note, we present a simple argument providing another\nmechanism for disrupting localization: by tuning the underlying curvature of\nthe manifold on which diffusion takes place. We show that negative curvature\nmanifolds contain a natural infrared cut off for the probability of self\nreturning paths. We provide explicit calculations of the Cooperon -- directly\nrelated to the weak-localization corrections to the conductivity -- in\nhyperbolic space. It is shown that constant negative curvature leads to a rapid\ngrowth in the number of available trajectories a particle can coherently\ntraverse in a given time, reducing the importance of interference effects and\nrestoring classical diffusive behavior even in the absence of inelastic\ncollisions. We conclude by arguing that this result may be amenable to\nexperimental verification through the use of quantum simulators.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Curtis","Jonathan B.",""],["Narang","Prineha",""],["Galitski","Victor",""]]}
{"id":"2308.01352","submitter":"Jacek Ksawery Osi\\'nski","authors":"Paola Arias, Nicol\\'as Bernal, Jacek K. Osi\\'nski, Leszek Roszkowski,\n  Moira Venegas","title":"Revisiting signatures of thermal axions in nonstandard cosmologies","comments":"40 pages, 10 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":"  We revisit the formation of a thermal population of hadronic axions in\nnonstandard cosmologies, in light of the recent developments in obtaining\ncontinuous and smooth interaction rates for both the gluon and photon\ncouplings. For certain cosmological histories, such as low-temperature\nreheating (LTR) and kination-like scenarios, the thermalization of the axion\ncan be severely delayed to higher masses. In the case that thermal equilibrium\nis achieved, we improve the constraints on LTR for axion masses around the eV\nscale with respect to previous works and we constrain for the first time early\nmatter-dominated (EMD) cosmologies. We also point out the possibility of having\nthe co-existence of cold and warm dark matter populations of axions in\nkination-like scenarios in the eV mass range.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Arias","Paola",""],["Bernal","Nicol\u00e1s",""],["Osi\u0144ski","Jacek K.",""],["Roszkowski","Leszek",""],["Venegas","Moira",""]]}
{"id":"2308.01353","submitter":"Alessandro Morandini","authors":"Alessandro Morandini, Torben Ferber, Felix Kahlhoefer","title":"Reconstructing axion-like particles from beam dumps with\n  simulation-based inference","comments":"34 pages, 18 figures, code available at\n  https://github.com/amorandini/SBI_axion","journal-ref":null,"doi":null,"report-no":"TTP23-031, P3H-23-054","categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Axion-like particles (ALPs) that decay into photon pairs pose a challenge for\nexperiments that rely on the construction of a decay vertex in order to search\nfor long-lived particles. This is particularly true for beam-dump experiments,\nwhere the distance between the unknown decay position and the calorimeter can\nbe very large. In this work we use machine learning to explore the possibility\nto reconstruct the ALP properties, in particular its mass and lifetime, from\nsuch inaccurate observations. We use a simulation-based inference approach\nbased on conditional invertible neural networks to reconstruct the posterior\nprobability of the ALP parameters for a given set of events. We find that for\nrealistic angular and energy resolution, such a neural network significantly\noutperforms parameter reconstruction from conventional high-level variables\nwhile at the same time providing reliable uncertainty estimates. Moreover, the\nneural network can quickly be re-trained for different detector properties,\nmaking it an ideal framework for optimizing experimental design.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Morandini","Alessandro",""],["Ferber","Torben",""],["Kahlhoefer","Felix",""]]}
{"id":"2308.01354","submitter":"Katherine Follette","authors":"Katherine B Follette","title":"An Introduction to High Contrast Differential Imaging of Exoplanets and\n  Disks","comments":"Accepted for publication in the Proceedings of the Astronomical\n  Society of the Pacific (PASP)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This tutorial is an introduction to High-Contrast Imaging, a technique that\nenables astronomers to isolate light from faint planets and/or circumstellar\ndisks that would otherwise be lost amidst the light of their host stars.\nAlthough technically challenging, high-contrast imaging allows for direct\ncharacterization of the properties of detected circumstellar sources. The\nintent of the article is to provide newcomers to the field a general overview\nof the terminology, observational considerations, data reduction strategies,\nand analysis techniques high-contrast imagers employ to identify, vet, and\ncharacterize planet and disk candidates.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Follette","Katherine B",""]]}
{"id":"2308.01355","submitter":"Hantian Zhang","authors":"Joshua Davies, Kay Sch\\\"onwald, Matthias Steinhauser, Hantian Zhang","title":"Next-to-leading order electroweak corrections to $gg \\to HH$ and $gg \\to\n  gH$ in the large-$m_t$ limit","comments":null,"journal-ref":null,"doi":null,"report-no":"P3H-23-051, TTP23-029, ZU-TH 40/23","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute two-loop electroweak corrections to Higgs boson pair and Higgs\nplus jet production, taking into account all sectors of the Standard Model. All\ndiagrams with virtual top quarks are computed in an expansion for large top\nquark mass up to order $1/m_t^8$ or more. We present analytic results for the\nform factors and discuss the convergence properties. For the process $gg\\to gH$\nwe also consider QCD corrections in the large-$m_t$ limit.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Davies","Joshua",""],["Sch\u00f6nwald","Kay",""],["Steinhauser","Matthias",""],["Zhang","Hantian",""]]}
{"id":"2308.01356","submitter":"Ting Gao","authors":"Yohei Ema, Ting Gao, Maxim Pospelov","title":"Muon spin force","comments":"5 pages, 1 figure + references and supplemental material","journal-ref":null,"doi":null,"report-no":"UMN-TH-4219/23,FTPI-MINN-23-12","categories":"hep-ph hep-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current discrepancy between the measurement and the prediction of the muon\nanomalous magnetic moment can be resolved in the presence of a long-range force\ncreated by ordinary atoms acting on the muon spin via axial-vector and/or\npseudoscalar coupling, and requiring a tiny, $\\mathcal{O}(10^{-13}\\,{\\rm eV})$\nspin energy splitting between muon state polarized in the vertical direction.\nWe suggest that an extension of the muon spin resonance ($\\mu$SR) experiments\ncan provide a definitive test of this class of models. We also derive indirect\nconstraints on the strength of the muon spin force, by considering the\nmuon-loop-induced interactions between nuclear spin and external directions.\nThe limits on the muon spin force extracted from the comparison of\n$^{199}$Hg/$^{201}$Hg and $^{129}$Xe/$^{131}$Xe spin precession are strong for\nthe pseudoscalar coupling, but are significantly relaxed for the axial-vector\none. These limits suffer from significant model uncertainties, poorly known\nproton/neutron spin content of these nuclei, and therefore do not exclude the\npossibility of a muon spin force relevant for the muon $g-2$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:00:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ema","Yohei",""],["Gao","Ting",""],["Pospelov","Maxim",""]]}
{"id":"2308.01357","submitter":"Susan Loepp","authors":"S. Loepp and Liz Ostermeyer","title":"Gluing Associated Prime Ideals of Small Height","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $B$ be a local (Noetherian) ring and suppose that $B$ has $n$ associated\nprime ideals where $n \\geq 2$. We identify sufficient conditions for there to\nexist a local (Noetherian) subring $S$ of $B$ such that $S$ and $B$ have the\nsame completion and $S$ has exactly $n - 1$ associated prime ideals. We include\napplications and consequences of this result.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:01:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Loepp","S.",""],["Ostermeyer","Liz",""]]}
{"id":"2308.01358","submitter":"Constantin Philippenko","authors":"Constantin Philippenko and Aymeric Dieuleveut","title":"Compressed and distributed least-squares regression: convergence rates\n  with applications to Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the impact of compression on stochastic\ngradient algorithms for machine learning, a technique widely used in\ndistributed and federated learning. We underline differences in terms of\nconvergence rates between several unbiased compression operators, that all\nsatisfy the same condition on their variance, thus going beyond the classical\nworst-case analysis. To do so, we focus on the case of least-squares regression\n(LSR) and analyze a general stochastic approximation algorithm for minimizing\nquadratic functions relying on a random field. We consider weak assumptions on\nthe random field, tailored to the analysis (specifically, expected H\\\"older\nregularity), and on the noise covariance, enabling the analysis of various\nrandomizing mechanisms, including compression. We then extend our results to\nthe case of federated learning.\n  More formally, we highlight the impact on the convergence of the covariance\n$\\mathfrak{C}_{\\mathrm{ania}}$ of the additive noise induced by the algorithm.\nWe demonstrate despite the non-regularity of the stochastic field, that the\nlimit variance term scales with $\\mathrm{Tr}(\\mathfrak{C}_{\\mathrm{ania}}\nH^{-1})/K$ (where $H$ is the Hessian of the optimization problem and $K$ the\nnumber of iterations) generalizing the rate for the vanilla LSR case where it\nis $\\sigma^2 \\mathrm{Tr}(H H^{-1}) / K = \\sigma^2 d / K$ (Bach and Moulines,\n2013). Then, we analyze the dependency of $\\mathfrak{C}_{\\mathrm{ania}}$ on the\ncompression strategy and ultimately its impact on convergence, first in the\ncentralized case, then in two heterogeneous FL frameworks.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:02:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Philippenko","Constantin",""],["Dieuleveut","Aymeric",""]]}
{"id":"2308.01359","submitter":"Maxime Flin","authors":"Maxime Flin, Magn\\'us M. Halld\\'orsson and Alexandre Nolin","title":"Fast Coloring Despite Congested Relays","comments":"37 pages. To appear in proceedings of DISC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a $O(\\log^6 \\log n)$-round randomized algorithm for distance-2\ncoloring in CONGEST with $\\Delta^2+1$ colors. For\n$\\Delta\\gg\\operatorname{poly}\\log n$, this improves exponentially on the\n$O(\\log\\Delta+\\operatorname{poly}\\log\\log n)$ algorithm of [Halld\\'orsson,\nKuhn, Maus, Nolin, DISC'20].\n  Our study is motivated by the ubiquity and hardness of local reductions in\nCONGEST. For instance, algorithms for the Local Lov\\'asz Lemma [Moser, Tardos,\nJACM'10; Fischer, Ghaffari, DISC'17; Davies, SODA'23] usually assume\ncommunication on the conflict graph, which can be simulated in LOCAL with only\nconstant overhead, while this may be prohibitively expensive in CONGEST. We\nhope our techniques help tackle in CONGEST other coloring problems defined by\nlocal relations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:04:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Flin","Maxime",""],["Halld\u00f3rsson","Magn\u00fas M.",""],["Nolin","Alexandre",""]]}
{"id":"2308.01360","submitter":"James W. Swift Ph.D.","authors":"Shafiu Jibrin and James W. Swift","title":"On Second-Order Cone Functions","comments":"21 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the second-order cone function (SOCF) $f: {\\mathbb R}^n \\to\n\\mathbb R$ defined by $f(x)= c^T x + d -\\|A x + b \\|$. Every SOCF is concave.\nWe give necessary and sufficient conditions for strict concavity of $f$. The\nparameters $A \\in {\\mathbb R}^{m \\times n}$ and $b \\in {\\mathbb R}^m$ are not\nuniquely determined. We show that every SOCF can be written in the form $f(x) =\nc^T x + d -\\sqrt{\\delta^2 + (x-x_*)^TM(x-x_*)}$. We give necessary and\nsufficient conditions for the parameters $c$, $d$, $\\delta$, $M = A^T A$, and\n$x_*$ to be uniquely determined. We also give necessary and sufficient\nconditions for $f$ to be bounded above.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:06:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jibrin","Shafiu",""],["Swift","James W.",""]]}
{"id":"2308.01361","submitter":"Ramin Fakhimi","authors":"Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tam\\'as Terlaky, Luis\n  F. Zuluaga","title":"On relaxations of the max $k$-cut problem formulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A tight continuous relaxation is a crucial factor in solving mixed integer\nformulations of many NP-hard combinatorial optimization problems. The\n(weighted) max $k$-cut problem is a fundamental combinatorial optimization\nproblem with multiple notorious mixed integer optimization formulations. In\nthis paper, we explore four existing mixed integer optimization formulations of\nthe max $k$-cut problem. Specifically, we show that the continuous relaxation\nof a binary quadratic optimization formulation of the problem is: (i) stronger\nthan the continuous relaxation of two mixed integer linear optimization\nformulations and (ii) at least as strong as the continuous relaxation of a\nmixed integer semidefinite optimization formulation. We also conduct a set of\nexperiments on multiple sets of instances of the max $k$-cut problem using\nstate-of-the-art solvers that empirically confirm the theoretical results in\nitem (i). Furthermore, these numerical results illustrate the advances in the\nefficiency of global non-convex quadratic optimization solvers and more general\nmixed integer nonlinear optimization solvers. As a result, these solvers\nprovide a promising option to solve combinatorial optimization problems. Our\ncodes and data are available on GitHub.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:07:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fakhimi","Ramin",""],["Validi","Hamidreza",""],["Hicks","Illya V.",""],["Terlaky","Tam\u00e1s",""],["Zuluaga","Luis F.",""]]}
{"id":"2308.01362","submitter":"James Lu","authors":"Mark Laurie and James Lu","title":"Explainable Deep Learning for Tumor Dynamic Modeling and Overall\n  Survival Prediction using Neural-ODE","comments":"23 pages, 4 figures and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  While tumor dynamic modeling has been widely applied to support the\ndevelopment of oncology drugs, there remains a need to increase predictivity,\nenable personalized therapy, and improve decision-making. We propose the use of\nTumor Dynamic Neural-ODE (TDNODE) as a pharmacology-informed neural network to\nenable model discovery from longitudinal tumor size data. We show that TDNODE\novercomes a key limitation of existing models in its ability to make unbiased\npredictions from truncated data. The encoder-decoder architecture is designed\nto express an underlying dynamical law which possesses the fundamental property\nof generalized homogeneity with respect to time. Thus, the modeling formalism\nenables the encoder output to be interpreted as kinetic rate metrics, with\ninverse time as the physical unit. We show that the generated metrics can be\nused to predict patients' overall survival (OS) with high accuracy. The\nproposed modeling formalism provides a principled way to integrate multimodal\ndynamical datasets in oncology disease modeling.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:08:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Laurie","Mark",""],["Lu","James",""]]}
{"id":"2308.01363","submitter":"Abraham Espinoza-Garc\\'ia","authors":"Luis Rey D\\'iaz-Barr\\'on, Abraham Espinoza-Garc\\'ia, S.\n  P\\'erez-Pay\\'an, and J. Socorro","title":"Noncommutative effective LQC: A (pre-)inflationary dynamics\n  investigation","comments":"22 pages, 18 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We conduct a (pre-)inflationary dynamics study within the framework of a\nsimple noncommutative extension of effective loop quantum cosmology -- put\nforward recently by the authors -- which preserves its key features (in\nparticular, the quantum bounce is maintained). A thorough investigation shows\nthat the (pre-)inflationary scenario associated to the chaotic quadratic\npotential is in the overall the same as the one featured in standard loop\nquantum cosmology (which reinforces the conclusion reached by the authors in a\npreliminary analysis). Hence, this (pre-)inflationary scenario does not easily\ndistinguish between standard loop quantum cosmology and the aforementioned\nnoncommutative scheme. It is argued that a particular tuning of the\nnoncommutativity parameter could accommodate for subtle effects at the level of\nprimordial perturbations (the hybrid quantization framework being a tentative\nroute of analysis).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:08:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["D\u00edaz-Barr\u00f3n","Luis Rey",""],["Espinoza-Garc\u00eda","Abraham",""],["P\u00e9rez-Pay\u00e1n","S.",""],["Socorro","J.",""]]}
{"id":"2308.01364","submitter":"Daniel P\\'erez-Palau","authors":"Marc Jorba-Cusc\\'o (1) and Ruth I. Oliva-Z\\'uniga (2) and Josep\n  Sardany\\'es (1) and Daniel P\\'erez-Palau (3) ((1) Centre de Recerca\n  Matem\\`atica, (2) Universidad Nacional Aut\\'onoma de Honduras, (3)\n  Universidad Internacional de la Rioja)","title":"Dispersal-enhanced resilience in two-patch metapopulations: origin's\n  instability type matters","comments":"submitted to International Journal of Bifurcation and Chaos","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many populations of animals or plants, exhibit a metapopulation structure\nwith close, spatially-separated subpopulations. The field of metapopulation\ntheory has made significant advancements since the influential Levins model.\nVarious modeling approaches have provided valuable insights to theoretical\nEcology. Despite extensive research on metapopulation models, there are still\nchallenging questions that are difficult to answer from ecological\nmetapopulational data or multi-patch models. Low-dimension mathematical models\noffer a promising avenue to address these questions, especially for global\ndynamics which have been scarcely investigated. In this study, we investigate a\ntwo-patch metapopulation model with logistic growth and diffusion between\npatches. By using analytical and numerical methods, we thoroughly analyze the\nimpact of diffusion on the dynamics of the metapopulation. We identify the\nequilibrium points and assess their local and global stability. Furthermore, we\nanalytically derive the optimal diffusion rate that leads to the highest\nmetapopulation values. Our findings demonstrate that increased diffusion plays\na crucial role in the preservation of both subpopulations and the full\nmetapopulation, especially under the presence of stochastic perturbations.\nSpecifically, at low diffusion values, the origin is a repeller, causing orbits\nstarting around it to travel closely parallel to the axes. This configuration\nmakes the metapopulation less resilient and thus more susceptible to local and\nglobal extinctions. However, as diffusion increases, the repeller transitions\nto a saddle point, and orbits starting near the origin rapidly converge to the\nunstable manifold of the saddle. This phenomenon reduces the likelihood of\nstochastic extinctions and the metapopulation becomes more resilient due to\nthese changes in the vector field of the phase space.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:11:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jorba-Cusc\u00f3","Marc",""],["Oliva-Z\u00faniga","Ruth I.",""],["Sardany\u00e9s","Josep",""],["P\u00e9rez-Palau","Daniel",""]]}
{"id":"2308.01365","submitter":"Philippe Ruelle","authors":"Jean-Fran\\c{c}ois de Kemmeter, Nicolas Robert and Philippe Ruelle","title":"On $\\lambda$-determinants and tiling problems","comments":"30 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.stat-mech math.CO math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review the connections between the octahedral recurrence,\n$\\lambda$-determinants and tiling problems. This provides in particular a\ndirect combinatorial interpretation of the $\\lambda$-determinant (and\ngeneralizations thereof) of an arbitrary matrix in terms of domino tilings of\nAztec diamonds. We also reinterpret the general Robbins-Rumsey formula for the\nrational function of consecutive minors, given by a summation over pairs of\ncompatible alternating sign matrices, as the partition function for tilings of\nAztec diamonds equipped with a general measure.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:13:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["de Kemmeter","Jean-Fran\u00e7ois",""],["Robert","Nicolas",""],["Ruelle","Philippe",""]]}
{"id":"2308.01366","submitter":"Effie Papageorgiou","authors":"Effie Papageorgiou","title":"Asymptotic behavior of solutions to the extension problem for the\n  fractional Laplacian on noncompact symmetric spaces","comments":"28 pages, 1 figure. arXiv admin note: text overlap with\n  arXiv:2112.01323","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work deals with the extension problem for the fractional Laplacian on\nRiemannian symmetric spaces $G/K$ of noncompact type and of general rank, which\ngives rise to a family of convolution operators, including the Poisson\noperator. More precisely, motivated by Euclidean results for the Poisson\nsemigroup, we study the long-time asymptotic behavior of solutions to the\nextension problem for $L^1$ initial data. In the case of the Laplace-Beltrami\noperator, we show that if the initial data is bi-$K$-invariant, then the\nsolution to the extension problem behaves asymptotically as the mass times the\nfundamental solution, but this convergence may break down in the non\nbi-$K$-invariant case. In the second part, we investigate the long-time\nasymptotic behavior of the extension problem associated with the so-called\ndistinguished Laplacian on $G/K$. In this case, we observe phenomena which are\nsimilar to the Euclidean setting for the Poisson semigroup, such as $L^1$\nasymptotic convergence without the assumption of bi-$K$-invariance.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:15:32 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 18:18:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Papageorgiou","Effie",""]]}
{"id":"2308.01367","submitter":"Shiv Singh","authors":"Manasa Manasa, Mohammad Azam, Tatiana Zajarniuk, Ryszard Diduszko,\n  Tomasz Cetner, Andrzej Morawski, Andrzej Wi\\'sniewski, Shiv J. Singh","title":"Cometal addition effect on superconducting properties and granular\n  behaviours of polycrystalline FeSe0.5Te0.5","comments":null,"journal-ref":"Materials 2023, 16(7), 2892","doi":"10.3390/ma16072892","report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The enhanced performance of superconducting FeSe0.5Te0.5 materials with added\nmicrosized Pb and Sn particles is presented. A series of Pb and Sn added\nFeSe0.5Te0.5 (FeSe0.5Te0.5 + xPb + ySn; x = y = 0-0.1) bulks are fabricated by\nsolid-state reaction method and characterized through various measurements. A\nvery small amount of Sn and Pb additions enhance the transition temperature\n(Tconset) of pure FeSe0.5Te0.5 by 1 K, sharpening the superconducting\ntransition and improving the metallic nature in the normal state, whereas\nlarger metal additions reduce Tconset by broadening the superconducting\ntransition. Microstructural analysis and transport studies suggest that at\nx=y>0.02, Pb and Sn additions enhance the impurity phases, reduce the coupling\nbetween grains, and suppress the superconducting percolation, leading to a\nbroad transition. FeSe0.5Te0.5 samples with 2wt% of cometal additions show the\nbest performance with their critical current density, Jc, and the pinning\nforce, Fp, which might be attributable to providing effective flux pinning\ncentres. Our study shows that the inclusion of a relatively small amount of Pb\nand Sn works effectively for the enhancement of superconducting properties with\nan improvement of intergrain connections as well as better phase uniformity.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:18:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Manasa","Manasa",""],["Azam","Mohammad",""],["Zajarniuk","Tatiana",""],["Diduszko","Ryszard",""],["Cetner","Tomasz",""],["Morawski","Andrzej",""],["Wi\u015bniewski","Andrzej",""],["Singh","Shiv J.",""]]}
{"id":"2308.01368","submitter":"Michael Carl","authors":"Michael Carl","title":"Empirical Translation Process Research: Past and Possible Future\n  Perspectives","comments":"To be published in Translation, Cognition and Behavior: \"Translation\n  and cognition in the 21st century: Goals met, goals ahead\", John Benjamins","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past four decades, efforts have been made to develop and evaluate\nmodels for Empirical Translation Process Research (TPR), yet a comprehensive\nframework remains elusive. This article traces the evolution of empirical TPR\nwithin the CRITT TPR-DB tradition and proposes the Free Energy Principle (FEP)\nand Active Inference (AIF) as a framework for modeling deeply embedded\ntranslation processes. It introduces novel approaches for quantifying\nfundamental concepts of Relevance Theory (relevance, s-mode, i-mode), and\nestablishes their relation to the Monitor Model, framing relevance maximization\nas a special case of minimizing free energy. FEP/AIF provides a mathematically\nrigorous foundation that enables modeling of deep temporal architectures in\nwhich embedded translation processes unfold on different timelines. This\nframework opens up exciting prospects for future research in predictive TPR,\nlikely to enrich our comprehension of human translation processes, and making\nvaluable contributions to the wider realm of translation studies and the design\nof cognitive architectures.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:22:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Carl","Michael",""]]}
{"id":"2308.01369","submitter":"Ni Dong","authors":"Ni Dong, Shuming Chen, Yina Wu, Yiheng Feng, Xiaobo Liu","title":"An enhanced motion planning approach by integrating driving\n  heterogeneity and long-term trajectory prediction for automated driving\n  systems","comments":"33 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Navigating automated driving systems (ADSs) through complex driving\nenvironments is difficult. Predicting the driving behavior of surrounding\nhuman-driven vehicles (HDVs) is a critical component of an ADS. This paper\nproposes an enhanced motion-planning approach for an ADS in a highway-merging\nscenario. The proposed enhanced approach utilizes the results of two aspects:\nthe driving behavior and long-term trajectory of surrounding HDVs, which are\ncoupled using a hierarchical model that is used for the motion planning of an\nADS to improve driving safety.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:23:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dong","Ni",""],["Chen","Shuming",""],["Wu","Yina",""],["Feng","Yiheng",""],["Liu","Xiaobo",""]]}
{"id":"2308.01370","submitter":"Vidya Setlur","authors":"Dennis Bromley and Vidya Setlur","title":"What Is the Difference Between a Mountain and a Molehill? Quantifying\n  Semantic Labeling of Visual Features in Line Charts","comments":"5 pages and 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Relevant language describing visual features in charts can be useful for\nauthoring captions and summaries about the charts to help with readers'\ntakeaways. To better understand the interplay between concepts that describe\nvisual features and the semantic relationships among those concepts (e.g.,\n'sharp increase' vs. 'gradual rise'), we conducted a crowdsourced study to\ncollect labels and visual feature pairs for univariate line charts. Using this\ncrowdsourced dataset of labeled visual signatures, this paper proposes a novel\nmethod for labeling visual chart features based on combining feature-word\ndistributions with the visual features and the data domain of the charts. These\nfeature-word-topic models identify word associations with similar yet subtle\ndifferences in semantics, such as 'flat,' 'plateau,' and 'stagnant,' and\ndescriptors of the visual features, such as 'sharp increase,' 'slow climb,' and\n'peak.' Our feature-word-topic model is computed using both a quantified\nsemantics approach and a signal processing-inspired least-errors\nshape-similarity approach. We finally demonstrate the application of this\ndataset for annotating charts and generating textual data summaries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:24:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bromley","Dennis",""],["Setlur","Vidya",""]]}
{"id":"2308.01371","submitter":"Timotej Lemut","authors":"Sa\\v{s}o Grozdanov, Timotej Lemut, Juan F. Pedraza","title":"Reconstruction of the quasinormal spectrum from pole-skipping","comments":"10 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-94","categories":"hep-th gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The holographic gauge/gravity duality provides an explicit reduction of\nquantum field theory (QFT) calculations in the semi-classical large-$N$ limit\nto sets of `gravitational' differential equations whose analysis can reveal all\ndetails of the spectra of thermal QFT correlators. We argue that in certain\ncases, a complete reconstruction of the spectrum and of the corresponding\ncorrelator is possible from only the knowledge of an infinite, discrete set of\npole-skipping points traversed by a single (hydrodynamic) mode computed in a\nseries expansion in an inverse number of spacetime dimensions. Conceptually,\nthis reduces the computation of a QFT correlator spectrum to performing a set\nof purely algebraic manipulations. With the help of the pole-skipping analysis,\nwe also uncover a novel structure underpinning the coefficients that enter the\nhydrodynamic dispersion relations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:24:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Grozdanov","Sa\u0161o",""],["Lemut","Timotej",""],["Pedraza","Juan F.",""]]}
{"id":"2308.01372","submitter":"Brian E. Wood","authors":"Brian E. Wood, Phillip Hess, Yu Chen, Qiang Hu","title":"Sequential Small Coronal Mass Ejections Observed In~situ and in\n  White-Light Images by Parker Solar Probe","comments":"17 pages, 11 figures, to appear in The Astrophysical Journal","journal-ref":null,"doi":"10.3847/1538-4357/ace259","report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We reconstruct the morphology and kinematics of a series of small transients\nthat erupt from the Sun on 2021 April 24 using observations primarily from\nParker Solar Probe (PSP). These sequential small coronal mass ejections (CMEs)\nmay be the product of continuous reconnection at a current sheet, a macroscopic\nexample of the more microscopic reconnection activity that has been proposed to\naccelerate the solar wind more generally. These particular CMEs are of interest\nbecause they are the first CMEs to hit PSP and be simultaneously imaged by it,\nusing the Wide-field Imager for Solar Probe (WISPR) instrument. Based on\nimaging from WISPR and STEREO-A, we identify and model six discrete transients,\nand determine that it is the second of them (CME2) that first hits PSP,\nalthough PSP later more obliquely encounters the third transient as well.\nSignatures of these encounters are seen in the PSP in situ data. Within these\ndata, we identify six candidate magnetic flux ropes (MFRs), all but one of\nwhich are associated with the second transient. The five CME2 MFRs have\norientations roughly consistent with PSP encountering the right sides of\nroughly E-W oriented MFRs, which are sloping back towards the Sun.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:25:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wood","Brian E.",""],["Hess","Phillip",""],["Chen","Yu",""],["Hu","Qiang",""]]}
{"id":"2308.01373","submitter":"Chao Zu","authors":"Senhua Zhu, Yufeng Lu, and Chao Zu","title":"Which hyponormal block Toeplitz operators are either normal or analytic?","comments":"arXiv admin note: text overlap with arXiv:1201.5976 by other authors","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 continue Curto-Hwang-Lee's work to study the connection\nbetween hyponormality and subnormality for block Toeplitz operators acting on\nthe vector-valued Hardy space of the unit circle.Curto-Hwang-Lee's work focuses\nprimarily on hyponormality and subnormality of block Toeplitz operators with\nrational symbols. By studying the \"weak\" commutativity, we extend\nCurto-Hwang-Lee's result to block Toeplitz operators with symbols of bounded\ntype.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:25:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhu","Senhua",""],["Lu","Yufeng",""],["Zu","Chao",""]]}
{"id":"2308.01374","submitter":"Nancy Remage Evans","authors":"Nancy Remage Evans, Mckenzie G. Ferrari, Joanna Kuraszkiewicz, Steven\n  Silverberg, Joy Nichols, Guillermo Torres, and Makenzi Fischbach","title":"The Mass-Temperature Relation for B and Early A Stars Based on IUE\n  Spectra of Detached Eclipsing Binaries","comments":"accepted by AJ","journal-ref":null,"doi":null,"report-no":"04","categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultraviolet spectra were taken of 25 Detached Eclipsing Binaries (DEBs) with\nspectral types O, B, and early A with the International Ultraviolet Explorer\n(IUE) satellite in the 1150 to 1900 ${\\AA}$ region. The spectra were compared\nwith BOSZ model atmospheres (Bohlin, et al. 2017). The composite spectra of the\nDEBs were modeled by a combination of models representing the hot and cool\ncomponents, and the temperatures of the hottest components of the systems were\ndetermined. From these temperatures a direct Mass-Temperature relation was\nobtained for stars close to the main sequence with solar metallicity for B and\nearly A stars: log M/Msun = -5.90 $\\pm$ 0.27 + (1.56 $\\pm$ 0.07) x log T This\nrelation allows a mass to be inferred for comparable stars from an ultraviolet\nspectrum. The five chemically peculiar Am stars in the sample have larger radii\nthan normal A stars of the same mass.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:26:25 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Evans","Nancy Remage",""],["Ferrari","Mckenzie G.",""],["Kuraszkiewicz","Joanna",""],["Silverberg","Steven",""],["Nichols","Joy",""],["Torres","Guillermo",""],["Fischbach","Makenzi",""]]}
{"id":"2308.01375","submitter":"Robert Maier","authors":"Robert Maier, Andreas Schlattl, Thomas Guess, J\\\"urgen Mottok","title":"CausalOps -- Towards an Industrial Lifecycle for Causal Probabilistic\n  Graphical Models","comments":"Submitted to Springer Information Systems Frontiers (Author Version)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Causal probabilistic graph-based models have gained widespread utility,\nenabling the modeling of cause-and-effect relationships across diverse domains.\nWith their rising adoption in new areas, such as automotive system safety and\nmachine learning, the need for an integrated lifecycle framework akin to DevOps\nand MLOps has emerged. Currently, a process reference for organizations\ninterested in employing causal engineering is missing. To address this gap and\nfoster widespread industrial adoption, we propose CausalOps, a novel lifecycle\nframework for causal model development and application. By defining key\nentities, dependencies, and intermediate artifacts generated during causal\nengineering, we establish a consistent vocabulary and workflow model. This work\ncontextualizes causal model usage across different stages and stakeholders,\noutlining a holistic view of creating and maintaining them. CausalOps' aim is\nto drive the adoption of causal methods in practical applications within\ninterested organizations and the causality community.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:26:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Maier","Robert",""],["Schlattl","Andreas",""],["Guess","Thomas",""],["Mottok","J\u00fcrgen",""]]}
{"id":"2308.01376","submitter":"Daniel Litt","authors":"Yeuk Hay Joshua Lam, Aaron Landesman, and Daniel Litt","title":"Finite braid group orbits on $SL_2$-character varieties","comments":"28 pages, 2 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let X be a 2-sphere with n punctures. We classify all conjugacy classes of\nZariski-dense representations $$\\rho: \\pi_1(X)\\to SL_2(\\mathbb{C})$$ with\nfinite orbit under the mapping class group of X, such that the local monodromy\nat one or more punctures has infinite order. We show that all such\nrepresentations are \"of pullback type\" or arise via middle convolution from\nfinite complex reflection groups. In particular, we classify all rank 2 local\nsystems of geometric origin on the projective line with n generic punctures,\nand with local monodromy of infinite order about at least one puncture.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:31:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lam","Yeuk Hay Joshua",""],["Landesman","Aaron",""],["Litt","Daniel",""]]}
{"id":"2308.01377","submitter":"Osama Muhammad Raisuddin","authors":"Osama Muhammad Raisuddin, Suvranu De","title":"Quantum Relaxation Method for Linear Systems in Finite Element Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Quantum linear system algorithms (QLSAs) for gate-based quantum computing can\nprovide exponential speedups for linear systems of equations. The growth of the\ncondition number with problem size for a system of equations arising from a\nfinite element discretization inhibits the direct application of QLSAs for a\nspeedup. Furthermore, QLSAs cannot use an approximate solution or initial guess\nto output an improved solution. Here, we present Quantum Relaxation for Linear\nSystem (qRLS), as an iterative approach for gate-based quantum computers by\nembedding linear stationary iterations into a larger block linear system. The\ncondition number of the block linear system scales linearly with the number of\niterations independent of the size and condition number of the original system,\neffectively managing the condition number of the finite element problem. The\nwell-conditioned system enables a practical iterative solution of finite\nelement problems using the state-of-the-art Quantum Signal Processing (QSP)\nvariant of QLSAs, for which we provide numerical results using a quantum\ncomputer simulator. The complexity of the iterations scales favorably compared\nto classical architectures due to solution time scaling independent of system\nsize with O(log(N)) qubits, an exponential improvement opening a new paradigm\nfor iterative finite element solutions on quantum hardware.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:31:33 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 17:20:08 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 19:51:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Raisuddin","Osama Muhammad",""],["De","Suvranu",""]]}
{"id":"2308.01378","submitter":"Kihoon Seong","authors":"Kihoon Seong","title":"Exponential ergodicity for the stochastic hyperbolic sine-Gordon\n  equation on the circle","comments":"31 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, we show that the Gibbs measure of the stochastic hyperbolic\nsine-Gordon equation on the circle is the unique invariant measure for the\nMarkov process. Moreover, the Markov transition probabilities converge\nexponentially fast to the unique invariant measure in a type of 1-Wasserstein\ndistance. The main difficulty comes from the fact that the hyperbolic dynamics\ndoes not satisfy the strong Feller property even if sufficiently many\ndirections in a phase space are forced by the space-time white noise forcing.\nWe instead establish that solutions give rise to a Markov process whose\ntransition semigroup satisfies the asymptotic strong Feller property and\nconvergence to equilibrium in a type of Wasserstein distance.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:36:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Seong","Kihoon",""]]}
{"id":"2308.01379","submitter":"Eric Tabellion","authors":"Eric Tabellion, Nikhil Karnad, Noa Glaser, Ben Weiss, David E. Jacobs,\n  Yael Pritch","title":"Computational Long Exposure Mobile Photography","comments":"15 pages, 17 figures","journal-ref":"ACM Trans. Graph. 42, 4, Article 48 (August 2023)","doi":"10.1145/3592124","report-no":null,"categories":"cs.CV cs.GR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Long exposure photography produces stunning imagery, representing moving\nelements in a scene with motion-blur. It is generally employed in two\nmodalities, producing either a foreground or a background blur effect.\nForeground blur images are traditionally captured on a tripod-mounted camera\nand portray blurred moving foreground elements, such as silky water or light\ntrails, over a perfectly sharp background landscape. Background blur images,\nalso called panning photography, are captured while the camera is tracking a\nmoving subject, to produce an image of a sharp subject over a background\nblurred by relative motion. Both techniques are notoriously challenging and\nrequire additional equipment and advanced skills. In this paper, we describe a\ncomputational burst photography system that operates in a hand-held smartphone\ncamera app, and achieves these effects fully automatically, at the tap of the\nshutter button. Our approach first detects and segments the salient subject. We\ntrack the scene motion over multiple frames and align the images in order to\npreserve desired sharpness and to produce aesthetically pleasing motion\nstreaks. We capture an under-exposed burst and select the subset of input\nframes that will produce blur trails of controlled length, regardless of scene\nor camera motion velocity. We predict inter-frame motion and synthesize\nmotion-blur to fill the temporal gaps between the input frames. Finally, we\ncomposite the blurred image with the sharp regular exposure to protect the\nsharpness of faces or areas of the scene that are barely moving, and produce a\nfinal high resolution and high dynamic range (HDR) photograph. Our system\ndemocratizes a capability previously reserved to professionals, and makes this\ncreative style accessible to most casual photographers.\n  More information and supplementary material can be found on our project\nwebpage: https://motion-mode.github.io/\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:36:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Tabellion","Eric",""],["Karnad","Nikhil",""],["Glaser","Noa",""],["Weiss","Ben",""],["Jacobs","David E.",""],["Pritch","Yael",""]]}
{"id":"2308.01380","submitter":"Marco Arroyo","authors":"M. A. Arroyo-Ure\\~na, J. Lorenzo D\\'iaz-Cruz, O. F\\'elix-Beltr\\'an and\n  M. Zeleny-Mora","title":"Lessons from LHC on the LFV Higgs decays $h \\to \\ell_a \\ell_b$ in the\n  Two-Higgs Doublet Models","comments":"28 pages, 16 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The non-conservation of the lepton number has been explored at the LHC\nthrough the Lepton-Flavor Violating (LFV) Higgs decays $h\\to\\ell_a\\ell_b$, with\n$\\ell_{a,\\,b}=e,\\,\\mu,\\,\\tau$ $(a \\neq b)$. Current limits on these decays are\na source of valuable information on the structure of the Yukawa and Higgs\nsectors. The LFV Higgs couplings can arise within the general Two-Higgs Doublet\nModel (2HDM); the predicted rates for these decay modes depend on the specific\nYukawa structure being considered, ranging from a vanishing branching ratio at\ntree-level for some versions (2HDM-I, II, X, Y), up to large and detectable\nratios within the general 2HDM-III. An attractive scenario is given by the\ntexturized version of the model (2HDM-Tx), with the Yukawa matrices having some\ntexture zeros, such as the minimal version with the so-called Cheng-Sher\nansazt. We study the constraints on the parameter space of the 2HDM provided by\nexperimental and theoretical restrictions, and use them to study the detection\nof LFV Higgs modes at LHC. We find several encouraging scenarios to the search\nfor the decay $h \\to\\tau\\mu$ that could be achieved in the High-Luminosity LHC.\nOn the other hand, LFV Higgs couplings can also be induced at one-loop level in\nthe 2HDM with neutrino masses, with the loops being mediated by neutrino\ninteractions; we find that the resulting branching ratios are of order\n$10^{-7}$ at best, which is out of the reach of current and future phases of\nthe LHC.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:37:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Arroyo-Ure\u00f1a","M. A.",""],["D\u00edaz-Cruz","J. Lorenzo",""],["F\u00e9lix-Beltr\u00e1n","O.",""],["Zeleny-Mora","M.",""]]}
{"id":"2308.01381","submitter":"Laura Boucheron","authors":"Luis G. Varela, Laura E. Boucheron, Steven Sandoval, David Voelz, Abu\n  Bucker Siddik","title":"Estimation of motion blur kernel parameters using regression\n  convolutional neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many deblurring and blur kernel estimation methods use MAP or classification\ndeep learning techniques to sharpen an image and predict the blur kernel. We\npropose a regression approach using neural networks to predict the parameters\nof linear motion blur kernels. These kernels can be parameterized by its length\nof blur and the orientation of the blur.This paper will analyze the\nrelationship between length and angle of linear motion blur. This analysis will\nhelp establish a foundation to using regression prediction in uniformed motion\nblur images.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:44:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Varela","Luis G.",""],["Boucheron","Laura E.",""],["Sandoval","Steven",""],["Voelz","David",""],["Siddik","Abu Bucker",""]]}
{"id":"2308.01382","submitter":"Kevin Dunne","authors":"Kevin Dunne","title":"Metric Space Spread, Intrinsic Dimension and the Manifold Hypothesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concepts of spread and spread dimension of a metric space were introduced\nby Willerton in the context of quantifying biodiversity of ecosystems. This\npaper develops practical applications of spread dimension in the context of\nmachine learning and manifold learning; we show that the topological dimension\nof a Riemannian manifold can be accurately estimated by computing the spread\ndimension of a finite subset. These results are presented as the theoretical\nbasis for a novel method of estimating the intrinsic dimension of data. The\npractical applications of this method are demonstrated with empirical\ncomputations using real and synthetic data.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:49:29 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dunne","Kevin",""]]}
{"id":"2308.01383","submitter":"Rosa-Laura Lechuga R.L. Lechuga","authors":"R.L. Lechuga, D. Sudarsky, Instituto de Ciencias Nucleares,\n  Universidad Nacional Aut\\'onoma de M\\'exico","title":"Eternal inflation and collapse theories","comments":"33 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The eternal inflation problem continues to be considered one of standard's\ncosmology most serious shortcomings. This arises when one considers the effects\nof \"quantum fluctuations\" (QF) on the zero mode of inflaton field during a\nHubble time in the inflationary epoch. In the slow-roll regime it is quite\nclear that such QF could dwarf the classical rolling down of the inflaton, and\nwith overwhelming probability this prevents inflation from ever ending. When\none recognizes that QF can not be taken as synonymous of stochastic\nfluctuations, but rather intrinsic levels of indefiniteness in the quantities,\none concludes that the eternal inflation problem simply does not exist.\nHowever, the same argument would serve to invalidate the account for the\ngeneration of the primordial seeds of cosmic structure. In order to do address\nthat issue, one must explain the breaking of homogeneity and isotropy of the\nearly inflationary epoch. The so called spontaneous collapse theories offer an\nadditional element namely the stochastic and spontaneous state reduction\ncharacteristic of those proposals possesses the basic features to break those\nsymmetries. In fact, a version of the CSL theory adapted to the cosmological\ncontext has been shown to offer a satisfactory account for the origin the seeds\nof cosmic structure with an adequate power spectrum, and will serve as the\nbasis of our analysis. However, once such stochastic collapse is introduced\ninto the theoretical framework the eternal inflation problem has the potential\nreappear. In this manuscript we explore those issues in detail and discuss an\navenue that seems to allow for a satisfactory account for the generation of the\nprimordial inhomogeneities and anisotropies while freeing the theory from the\neternal inflation problem.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:52:28 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lechuga","R. L.",""],["Sudarsky","D.",""],["Nucleares","Instituto de Ciencias",""],["de M\u00e9xico","Universidad Nacional Aut\u00f3noma",""]]}
{"id":"2308.01384","submitter":"Franciele Conrado","authors":"Franciele Conrado","title":"Rigidity for the logarithmic Sobolev inequality on complete metric\n  measure spaces","comments":"To appears in Archiv der Mathematik. 7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we study the rigidity problem for the logarithmic Sobolev\ninequality on a complete metric measure space $(M^n,g,f)$ with Bakry-\\'Emery\nRicci curvature satisfying $Ric_f\\geq \\frac{a}{2}g$, for some $a>0$. We prove\nthat if equality holds then $M$ is isometric to $\\Sigma\\times \\mathbb{R}$ for\nsome complete $(n-1)$-dimensional Riemannian manifold $\\Sigma$ and by passing\nan isometry, $(M^n,g,f)$ must split off the Gaussian shrinking soliton\n$(\\mathbb{R}, dt^2, \\frac{a}{2}|.|^2)$. This was proved in 2019 by Ohta and\nTakatsu. In this paper, we prove this rigidity result using a different method.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:54:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Conrado","Franciele",""]]}
{"id":"2308.01385","submitter":"Suryansh Sharma","authors":"Suryansh Sharma, Ashutosh Simha, R. Venkatesha Prasad, Shubham\n  Deshmukh, Kavin B. Saravanan, Ravi Ramesh, Luca Mottola","title":"BEAVIS: Balloon Enabled Aerial Vehicle for IoT and Sensing","comments":"To be published in the 29th Annual International Conference on Mobile\n  Computing and Networking (ACM MobiCom 23), October 2-6, 2023, Madrid, Spain.\n  ACM, New York, NY, USA, 15 pages","journal-ref":null,"doi":"10.1145/3570361.3592498","report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  UAVs are becoming versatile and valuable platforms for various applications.\nHowever, the main limitation is their flying time. We present BEAVIS, a novel\naerial robotic platform striking an unparalleled trade-off between the\nmanoeuvrability of drones and the long lasting capacity of blimps. BEAVIS\nscores highly in applications where drones enjoy unconstrained mobility yet\nsuffer from limited lifetime. A nonlinear flight controller exploiting novel,\nunexplored, aerodynamic phenomena to regulate the ambient pressure and enable\nall translational and yaw degrees of freedom is proposed without direct\nactuation in the vertical direction. BEAVIS has built-in rotor fault detection\nand tolerance. We explain the design and the necessary background in detail. We\nverify the dynamics of BEAVIS and demonstrate its distinct advantages, such as\nagility, over existing platforms including the degrees of freedom akin to a\ndrone with 11.36x increased lifetime. We exemplify the potential of BEAVIS to\nbecome an invaluable platform for many applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:01:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sharma","Suryansh",""],["Simha","Ashutosh",""],["Prasad","R. Venkatesha",""],["Deshmukh","Shubham",""],["Saravanan","Kavin B.",""],["Ramesh","Ravi",""],["Mottola","Luca",""]]}
{"id":"2308.01386","submitter":"Elvys Soares","authors":"Elvys Soares, Manoel Aranda, Naelson Oliveira, M\\'arcio Ribeiro, Rohit\n  Gheyi, Emerson Souza, Ivan Machado, Andr\\'e Santos, Baldoino Fonseca, Rodrigo\n  Bonif\\'acio","title":"Manual Tests Do Smell! Cataloging and Identifying Natural Language Test\n  Smells","comments":"The 17th ACM/IEEE International Symposium on Empirical Software\n  Engineering and Measurement (ESEM), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Background: Test smells indicate potential problems in the design and\nimplementation of automated software tests that may negatively impact test code\nmaintainability, coverage, and reliability. When poorly described, manual tests\nwritten in natural language may suffer from related problems, which enable\ntheir analysis from the point of view of test smells. Despite the possible\nprejudice to manually tested software products, little is known about test\nsmells in manual tests, which results in many open questions regarding their\ntypes, frequency, and harm to tests written in natural language. Aims:\nTherefore, this study aims to contribute to a catalog of test smells for manual\ntests. Method: We perform a two-fold empirical strategy. First, an exploratory\nstudy in manual tests of three systems: the Ubuntu Operational System, the\nBrazilian Electronic Voting Machine, and the User Interface of a large\nsmartphone manufacturer. We use our findings to propose a catalog of eight test\nsmells and identification rules based on syntactical and morphological text\nanalysis, validating our catalog with 24 in-company test engineers. Second,\nusing our proposals, we create a tool based on Natural Language Processing\n(NLP) to analyze the subject systems' tests, validating the results. Results:\nWe observed the occurrence of eight test smells. A survey of 24 in-company test\nprofessionals showed that 80.7% agreed with our catalog definitions and\nexamples. Our NLP-based tool achieved a precision of 92%, recall of 95%, and\nf-measure of 93.5%, and its execution evidenced 13,169 occurrences of our\ncataloged test smells in the analyzed systems. Conclusion: We contribute with a\ncatalog of natural language test smells and novel detection strategies that\nbetter explore the capabilities of current NLP mechanisms with promising\nresults and reduced effort to analyze tests written in different idioms.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:05:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Soares","Elvys",""],["Aranda","Manoel",""],["Oliveira","Naelson",""],["Ribeiro","M\u00e1rcio",""],["Gheyi","Rohit",""],["Souza","Emerson",""],["Machado","Ivan",""],["Santos","Andr\u00e9",""],["Fonseca","Baldoino",""],["Bonif\u00e1cio","Rodrigo",""]]}
{"id":"2308.01387","submitter":"Huan Liu","authors":"Huan Liu and Richard D. James","title":"Design of origami structures with curved tiles between the creases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An efficient way to introduce elastic energy that can bias an origami\nstructure toward desired shapes is to allow curved tiles between the creases.\nThe bending of the tiles supplies the energy and the tiles themselves may have\nadditional functionality. In this paper, we present the theorem and systematic\ndesign methods for quite general curved origami structures that can be folded\nfrom a flat sheet, and we present methods to accurately find the stored elastic\nenergy. Here the tiles are allowed to undergo curved isometric mappings, and\nthe associated creases necessarily undergo isometric mappings as curves. These\nassumptions are consistent with a variety of practical methods for crease\ndesign. The h^3 scaling of the energy of thin sheets (h = thickness) spans a\nbroad energy range. Different tiles in an origami design can have different\nvalues of h, and individual tiles can also have varying h. Following\ndevelopments for piecewise rigid origami, we develop further the Lagrangian\napproach and the group orbit procedure in this context. We notice that some of\nthe simplest designs that arise from the group orbit procedure for certain\nhelical and conformal groups provide better matches to the buckling patterns\nobserved in compressed cylinders and cones than known patterns.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:06:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Huan",""],["James","Richard D.",""]]}
{"id":"2308.01388","submitter":"Patrice Sawyer","authors":"P. Graczyk and P. Sawyer","title":"A formula and sharp estimates for the Dunkl kernel for the root system\n  $A_2$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we transform a formula for the $A_2$ Dunkl kernel by B\\'echir\nAmri. The resulting formula expresses the $A_2$ Dunkl kernel in terms of the\n$A_1$ Dunkl kernel involving only positive terms. This result allows us to\nderive sharp estimates for the $A_2$ Dunkl kernel. As an interesting\nby-product, we obtain sharp esitmates for the corresponding heat kernel.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:07:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Graczyk","P.",""],["Sawyer","P.",""]]}
{"id":"2308.01389","submitter":"Jumman Hossain","authors":"Jumman Hossain, Maliha Momtaz","title":"Follow the Soldiers with Optimized Single-Shot Multibox Detection and\n  Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nowadays, autonomous cars are gaining traction due to their numerous\npotential applications on battlefields and in resolving a variety of other\nreal-world challenges. The main goal of our project is to build an autonomous\nsystem using DeepRacer which will follow a specific person (for our project, a\nsoldier) when they will be moving in any direction. Two main components to\naccomplish this project is an optimized Single-Shot Multibox Detection (SSD)\nobject detection model and a Reinforcement Learning (RL) model. We accomplished\nthe task using SSD Lite instead of SSD and at the end, compared the results\namong SSD, SSD with Neural Computing Stick (NCS), and SSD Lite. Experimental\nresults show that SSD Lite gives better performance among these three\ntechniques and exhibits a considerable boost in inference speed (~2-3 times)\nwithout compromising accuracy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:08:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hossain","Jumman",""],["Momtaz","Maliha",""]]}
{"id":"2308.01390","submitter":"Anas Awadalla","authors":"Anas Awadalla and Irena Gao and Josh Gardner and Jack Hessel and Yusuf\n  Hanafy and Wanrong Zhu and Kalyani Marathe and Yonatan Bitton and Samir Gadre\n  and Shiori Sagawa and Jenia Jitsev and Simon Kornblith and Pang Wei Koh and\n  Gabriel Ilharco and Mitchell Wortsman and Ludwig Schmidt","title":"OpenFlamingo: An Open-Source Framework for Training Large Autoregressive\n  Vision-Language Models","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":"  We introduce OpenFlamingo, a family of autoregressive vision-language models\nranging from 3B to 9B parameters. OpenFlamingo is an ongoing effort to produce\nan open-source replication of DeepMind's Flamingo models. On seven\nvision-language datasets, OpenFlamingo models average between 80 - 89% of\ncorresponding Flamingo performance. This technical report describes our models,\ntraining data, hyperparameters, and evaluation suite. We share our models and\ncode at https://github.com/mlfoundations/open_flamingo.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:10:23 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 17:53:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Awadalla","Anas",""],["Gao","Irena",""],["Gardner","Josh",""],["Hessel","Jack",""],["Hanafy","Yusuf",""],["Zhu","Wanrong",""],["Marathe","Kalyani",""],["Bitton","Yonatan",""],["Gadre","Samir",""],["Sagawa","Shiori",""],["Jitsev","Jenia",""],["Kornblith","Simon",""],["Koh","Pang Wei",""],["Ilharco","Gabriel",""],["Wortsman","Mitchell",""],["Schmidt","Ludwig",""]]}
{"id":"2308.01391","submitter":"Masaru Yamada","authors":"Masaru Yamada","title":"Optimizing Machine Translation through Prompt Engineering: An\n  Investigation into ChatGPT's Customizability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper explores the influence of integrating the purpose of the\ntranslation and the target audience into prompts on the quality of translations\nproduced by ChatGPT. Drawing on previous translation studies, industry\npractices, and ISO standards, the research underscores the significance of the\npre-production phase in the translation process. The study reveals that the\ninclusion of suitable prompts in large-scale language models like ChatGPT can\nyield flexible translations, a feat yet to be realized by conventional Machine\nTranslation (MT). The research scrutinizes the changes in translation quality\nwhen prompts are used to generate translations that meet specific conditions.\nThe evaluation is conducted from a practicing translator's viewpoint, both\nsubjectively and qualitatively, supplemented by the use of OpenAI's word\nembedding API for cosine similarity calculations. The findings suggest that the\nintegration of the purpose and target audience into prompts can indeed modify\nthe generated translations, generally enhancing the translation quality by\nindustry standards. The study also demonstrates the practical application of\nthe \"good translation\" concept, particularly in the context of marketing\ndocuments and culturally dependent idioms.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:11:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yamada","Masaru",""]]}
{"id":"2308.01392","submitter":"Anshumitra Baul","authors":"Anshumitra Baul, Herbert F Fotso, Hanna Terletska, Juana Moreno,\n  Ka-Ming Tam","title":"Quantum Classical Algorithm for the Study of Phase Transitions in the\n  Hubbard Model via Dynamical Mean-Field Theory","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-nc-nd/4.0/","abstract":"  Simulating quantum many-body systems is believed to be one of the most\npromising applications of near-term noisy quantum computers. However, in the\nnear term, system size limitation will remain a severe barrier for applications\nin materials science or strongly correlated systems. A promising avenue of\nresearch is to combine many-body physics with machine learning for the\nclassification of distinct phases. In this paper, we propose a workflow that\nsynergizes quantum computing, many-body theory, and quantum machine\nlearning(QML) for studying strongly correlated systems. In particular, it can\ncapture a putative quantum phase transition of the stereotypical strongly\ncorrelated system, the Hubbard model. Following the recent proposal of the\nhybrid classical-quantum algorithm for the two-site dynamical mean-field\ntheory(DMFT), we present a modification that allows the self-consistent\nsolution of the single bath site DMFT. The modified algorithm can easily be\ngeneralized for multiple bath sites. This approach is used to generate a\ndatabase of zero-temperature wavefunctions of the Hubbard model within the DMFT\napproximation. We then use a QML algorithm to distinguish between the metallic\nphase and the Mott insulator phase to capture the metal-to-Mott insulator phase\ntransition. We train a quantum convolutional neural network(QCNN) and then\nutilize the QCNN as a quantum classifier to capture the phase transition\nregion. This work provides a recipe for application to other phase transitions\nin strongly correlated systems and represents an exciting application of\nsmall-scale quantum devices realizable with near-term technology.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:11:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Baul","Anshumitra",""],["Fotso","Herbert F",""],["Terletska","Hanna",""],["Moreno","Juana",""],["Tam","Ka-Ming",""]]}
{"id":"2308.01393","submitter":"Eamonn Corrigan","authors":"Eamonn Corrigan, Martin Williams, Mary A. Wells","title":"Beyond gender: Intersecting demographic factors that influence students'\n  continuation in high school physics","comments":"17 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This study examines the complex interplay of gender and other demographics on\ncontinuation rates in high school physics. Using a diverse dataset that\ncombines demographics from the Canadian Census and 11 years of gendered\nenrolment data from the Ontario Ministry of Education, we track student cohorts\nas they transition from mandatory science to elective physics courses. We then\nemploy hierarchical linear modelling to quantify the interaction effects\nbetween gender and other demographics, providing a detailed perspective on the\non continuation in physics. Our results indicate the racial demographics of a\nschool's neighbourhood have a limited impact on continuation once controlling\nfor other factors such as socioeconomic status, though neighbourhoods with a\nhigher Black population were a notable exception, consistently exhibiting\nsignificantly lower continuation rates for both male and female students. A\npotential role model effect related to parental education was also found as the\nproportion of parents with STEM degrees correlates positively with increased\ncontinuation rates, whereas an increase in non-STEM degrees corresponds with\nreduced continuation. The most pronounced effects are school-level factors.\nContinuation rates in physics are very strongly correlated with continuation in\nchemistry or calculus - effects which are much stronger for male than female\nstudents. Conversely, continuation in biology positively correlates with the\ncontinuation of female students in physics, with little to no effect found for\nmale students. Nevertheless, the effect sizes observed for chemistry and\ncalculus markedly outweigh that for biology. This is further evidence that\nconsidering STEM as homogeneous when examining gender disparities is misguided.\nThese insights can guide future education policies and initiatives to increase\ncontinuation rates and foster greater gender equity in physics education.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:17:41 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 17:25:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Corrigan","Eamonn",""],["Williams","Martin",""],["Wells","Mary A.",""]]}
{"id":"2308.01394","submitter":"Harald W. Griesshammer","authors":"Harald W. Griesshammer (George Washington U.) and Ubirajara van Kolck\n  (CNRS/IN2P3 and U. of Arizona)","title":"Universality of Three Identical Bosons with Large, Negative Effective\n  Range","comments":"40 pages LaTeX2e (pdflatex) including 11 figures as 13 .pdf files\n  using includegraphics","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th cond-mat.quant-gas physics.atm-clus physics.atom-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  \"Resummed-Range Effective Field Theory'' is a consistent nonrelativistic\neffective field theory of contact interactions with large scattering length $a$\nand an effective range $r_0$ large in magnitude but negative. Its leading order\nis non-perturbative. Its observables are universal, i.e.~they depend only on\nthe dimensionless ratio $\\xi:=2r_0/a$, with the overall distance scale set by\n$|r_0|$. In the two-body sector, the position of the two shallow $S$-wave poles\nin the complex plane is determined by $\\xi$. We investigate three identical\nbosons at leading order for a two-body system with one bound and one virtual\nstate ($\\xi\\le0$), or with two virtual states ($0\\le\\xi<1$). Such conditions\nmight, for example, be found in systems of heavy mesons. We find that no\nthree-body interaction is needed to renormalise (and stabilise) Resummed-Range\nEFT at LO. A well-defined ground state exists for\n$0.366\\ldots\\le\\xi\\le-8.72\\ldots$. Three-body excitations appear for even\nsmaller ranges of $\\xi$ around the ``quasi-unitarity point'' $\\xi=0$\n($|r_0|\\ll|a|\\to\\infty$) and obey discrete scaling relations. We explore in\ndetail the ground state and the lowest three excitations and parametrise their\ntrajectories as function of $\\xi$ and of the binding momentum $\\kappa_2^-$ of\nthe shallowest \\twoB state from where three-body and two-body binding energies\nare identical to zero three-body binding. As $|r_0|\\ll|a|$ becomes\nperturbative, this version turns into the ``Short-Range EFT'' which needs a\nstabilising three-body interaction and exhibits Efimov's Discrete Scale\nInvariance. By interpreting that EFT as a low-energy version of Resummed-Range\nEFT, we match spectra to determine Efimov's scale-breaking parameter\n$\\Lambda_*$ in a renormalisation scheme with a ``hard'' cutoff. Finally, we\ncompare phase shifts for scattering a boson on the two-boson bound state with\nthat of the equivalent Efimov system.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:25:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Griesshammer","Harald W.","","George Washington U."],["van Kolck","Ubirajara","","CNRS/IN2P3 and U. of Arizona"]]}
{"id":"2308.01395","submitter":"Thorsten Feichtner","authors":"Amro Sweedan, Mariela J. Pavan, Enno Schatz, Henriette Maa{\\ss},\n  Ashageru Tsega, Vered Tzin, Katja H\\\"oflich, Paul M\\\"ork, Thorsten Feichtner\n  and Muhammad Y. Bashouti","title":"Evolutionary Optimized, Monocrystalline Gold Double Wire Gratings as a\n  SERS Sensing Platform","comments":"22 pages, 6 Figures, 12 pages Supplementary","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Achieving reliable and quantifiable performance in large-area\nsurface-enhanced Raman spectroscopy (SERS) substrates has long been a\nformidable challenge. It requires substantial signal enhancement while\nmaintaining a reproducible and uniform response. Conventional SERS substrates\nare typically made of inhomogeneous materials with random resonator geometries\nand distributions. As a result, they exhibit several or broadened plasmonic\nresonances, undesired absorptive losses, and inhomogeneous field enhancement.\nThese limitations diminish the signal strength and hamper reproducibility,\nmaking it difficult to conduct comparative studies with high sensitivity. In\nthis study, we propose an approach that utilizes monocrystalline gold flakes to\nfabricate well-defined gratings composed of plasmonic double-wire resonators,\nwhich are fabricated through focused ion-beam lithography. The geometry of the\ndouble wire grating substrate (DWGS) was evolutionary optimized to achieve\nefficient enhancement for both excitation and emission processes. The use of\nmonocrystalline material minimizes absorption losses while enhancing the shape\nfidelity during the nanofabrication process. The DWGS shows notable\nreproducibility (RSD=6.6%), repeatability (RSD=5.6%), and large-area\nhomogeneity over areas $>10^4\\,\\mu$m$^2$. Moreover, it provides a SERS\nenhancement factor of $\\approx 10^6$ for 4-Aminothiophenol (4-ATP) analyte and\ndetection capability for sub-monolayer coverage. The DWGS demonstrates\nreusability, as well as long-term stability on the shelf. Experimental\nvalidation with various analytes, in different states of matter, including\nbiological macromolecules, confirms the sensitive and reproducible nature of\nDWGSs, thereby establishing them as a promising SERS substrate design for\nfuture sensing applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:26:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sweedan","Amro",""],["Pavan","Mariela J.",""],["Schatz","Enno",""],["Maa\u00df","Henriette",""],["Tsega","Ashageru",""],["Tzin","Vered",""],["H\u00f6flich","Katja",""],["M\u00f6rk","Paul",""],["Feichtner","Thorsten",""],["Bashouti","Muhammad Y.",""]]}
{"id":"2308.01396","submitter":"Mao-Rui Cai","authors":"Mao-Rui Cai, Xue Zhang, Zi-Qian Cheng, Teng-Fei Yan, Hui Dong","title":"Cross-phase modulation in the two dimensional spectroscopy","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Developing from the transient absorption (TA) spectroscopy, the two\ndimensional (2D) spectroscopy with pump-probe geometry has emerged as a\nversatile approach for alleviating the difficulty on implementing the 2D\nspectroscopy with other geometries. However, the presence of cross-phase\nmodulation (XPM) in TA spectroscopy introduces significant spectral\ndistortions, particularly when the pump and probe pulses overlap. We\ndemonstrate that this phenomenon is extended to the 2D spectroscopy with\npump-probe geometry and the XPM is induced by the interference of the two pump\npulse. We present the oscillatory behavior of XPM in the 2D spectrum and its\ndisplacement with respect to the waiting time delay through both experimental\nmeasurements and numerical simulations. Additionally, we explore the influence\nof probe pulse chirp on XPM and discover that by compressing the chirp, the\nimpact of XPM on the desired signal can be reduced.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:28:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cai","Mao-Rui",""],["Zhang","Xue",""],["Cheng","Zi-Qian",""],["Yan","Teng-Fei",""],["Dong","Hui",""]]}
{"id":"2308.01397","submitter":"Xavier Mart\\'inez-Rivera","authors":"Xavier Mart\\'inez-Rivera, Kamonchanok Saejeam","title":"On the signs of the principal minors of Hermitian matrices","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The signed enhanced principal rank characteristic sequence (sepr-sequence) of\na given $n \\times n$ Hermitian matrix $B$ is the sequence $t_1t_2 \\cdots t_n$,\nwhere $t_k$ is $\\tt A^*$, $\\tt A^+$, $\\tt A^-$, $\\tt N$, $\\tt S^*$, $\\tt S^+$,\nor $\\tt S^-$, based on the following criteria: $t_k = \\tt A^*$ if all the\norder-$k$ principal minors of $B$ are nonzero, and two of those minors are of\nopposite sign; $t_k = \\tt A^+$ (respectively, $t_k = \\tt A^-$) if all the\norder-$k$ principal minors of $B$ are positive (respectively, negative); $t_k =\n\\tt N$ if all the order-$k$ principal minors of $B$ are zero; $t_k = \\tt S^*$\nif $B$ has a positive, a negative, and a zero order-$k$ principal minor; $t_k =\n\\tt S^+$ (respectively, $t_k = \\tt S^-$) if $B$ has both a zero and a nonzero\norder-$k$ principal minor, and all the nonzero order-$k$ principal minors of\n$B$ are positive (respectively, negative). A complete characterization of the\nsequences of order $2$ and order $3$ that do not occur as a subsequence of the\nsepr-sequence of any Hermitian matrix is presented (a sequence has order $k$ if\nit has $k$ terms). An analogous characterization for real symmetric matrices is\npresented as well.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:35:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mart\u00ednez-Rivera","Xavier",""],["Saejeam","Kamonchanok",""]]}
{"id":"2308.01398","submitter":"Cora Dimmig","authors":"Cora A. Dimmig, Anna Goodridge, Gabriel Baraban, Pupei Zhu, Joyraj\n  Bhowmick, Marin Kobilarov","title":"A Small Form Factor Aerial Research Vehicle for Pick-and-Place Tasks\n  with Onboard Real-Time Object Detection and Visual Odometry","comments":"\\copyright 2023 IEEE. Personal use of this material is permitted.\n  Permission from IEEE must be obtained for all other uses, in any current or\n  future media, including reprinting/republishing this material for advertising\n  or promotional purposes, creating new collective works, for resale or\n  redistribution to servers or lists, or reuse of any copyrighted component of\n  this work in other works","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, small form-factor, aerial vehicle research\nplatform for agile object detection, classification, tracking, and interaction\ntasks. General-purpose hardware components were designed to augment a given\naerial vehicle and enable it to perform safe and reliable grasping. These\ncomponents include a custom collision tolerant cage and low-cost Gripper\nExtension Package, which we call GREP, for object grasping. Small vehicles\nenable applications in highly constrained environments, but are often limited\nby computational resources. This work evaluates the challenges of\npick-and-place tasks, with entirely onboard computation of object pose and\nvisual odometry based state estimation on a small platform, and demonstrates\nexperiments with enough accuracy to reliably grasp objects. In a total of 70\ntrials across challenging cases such as cluttered environments, obstructed\ntargets, and multiple instances of the same target, we demonstrated\nsuccessfully grasping the target in 93% of trials. Both the hardware component\ndesigns and software framework are released as open-source, since our intention\nis to enable easy reproduction and application on a wide range of small\nvehicles.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:40:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dimmig","Cora A.",""],["Goodridge","Anna",""],["Baraban","Gabriel",""],["Zhu","Pupei",""],["Bhowmick","Joyraj",""],["Kobilarov","Marin",""]]}
{"id":"2308.01400","submitter":"Isaac Ross","authors":"I. M. Ross","title":"A Universal Birkhoff Theory for Fast Trajectory Optimization","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":"  Over the last two decades, pseudospectral methods based on Lagrange\ninterpolants have flourished in solving trajectory optimization problems and\ntheir flight implementations. In a seemingly unjustified departure from these\nhighly successful methods, a new starting point for trajectory optimization is\nproposed. This starting point is based on the recently-developed concept of\nuniversal Birkhoff interpolants. The new approach offers a substantial\ncomputational upgrade to the Lagrange theory in completely flattening the rapid\ngrowth of the condition numbers from O(N2) to O(1), where N is the number of\ngrid points. In addition, the Birkhoff-specific primal-dual computations are\nisolated to a well-conditioned linear system even for nonlinear, nonconvex\nproblems. This is part I of a two-part paper. In part I, a new theory is\ndeveloped on the basis of two hypotheses. Other than these hypotheses, the\ntheoretical development makes no assumptions on the choices of basis functions\nor the selection of grid points. Several covector mapping theorems are proved\nto establish the mathematical equivalence between direct and indirect Birkhoff\nmethods. In part II of this paper (with Proulx), it is shown that a select\nfamily of Gegenbauer grids satisfy the two hypotheses required for the theory\nto hold. Numerical examples in part II illustrate the power and utility of the\nnew theory.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:46:41 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 01:05:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ross","I. M.",""]]}
{"id":"2308.01401","submitter":"N\\'estor Armesto","authors":"Tolga Altinoluk, N\\'estor Armesto, Alexander Kovner, Michael Lublinsky","title":"Single inclusive particle production in pA collisions at forward\n  rapidities: beyond the hybrid model","comments":"LaTeX, 7 pages, contribution to DIS2023: XXX International Workshop\n  on Deep-Inelastic Scattering and Related Subjects, Michigan State University,\n  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":"  In this contribution we reconsider the calculation at next-to-leading order\nof forward inclusive single hadron production in $pA$ collisions within the\nhybrid approach. We conclude that the proper framework to compute this cross\nsection beyond leading order is not collinear factorization as assumed so far,\nbut the TMD factorized framework.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:49:29 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Altinoluk","Tolga",""],["Armesto","N\u00e9stor",""],["Kovner","Alexander",""],["Lublinsky","Michael",""]]}
{"id":"2308.01402","submitter":"Daisy Yi Ding","authors":"Daisy Yi Ding, Yuhui Zhang, Yuan Jia, Jiuzhi Sun","title":"Machine Learning-guided Lipid Nanoparticle Design for mRNA Delivery","comments":"The 2023 ICML Workshop on Computational Biology","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While RNA technologies hold immense therapeutic potential in a range of\napplications from vaccination to gene editing, the broad implementation of\nthese technologies is hindered by the challenge of delivering these agents\neffectively. Lipid nanoparticles have emerged as one of the most widely used\ndelivery agents, but their design optimization relies on laborious and costly\nexperimental methods. We propose to in silico optimize LNP design with machine\nlearning models. On a curated dataset of 622 LNPs from published studies, we\ndemonstrate the effectiveness of our model in predicting the transfection\nefficiency of unseen LNPs, with the multilayer perceptron achieving a\nclassification accuracy of 98% on the test set. Our work represents a\npioneering effort in combining ML and LNP design, offering significant\npotential for improving screening efficiency by computationally prioritizing\nLNP candidates for experimental validation and accelerating the development of\neffective mRNA delivery systems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:53:04 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 01:48:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ding","Daisy Yi",""],["Zhang","Yuhui",""],["Jia","Yuan",""],["Sun","Jiuzhi",""]]}
{"id":"2308.01403","submitter":"Damiano Francesco Giuseppe Fiorillo","authors":"Damiano F. G. Fiorillo, Malte Heinlein, Hans-Thomas Janka, Georg\n  Raffelt, Edoardo Vitagliano","title":"Supernova Simulations Confront SN 1987A Neutrinos","comments":"51 pages, 30 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We return to interpreting the historical SN~1987A neutrino data from a modern\nperspective. To this end, we construct a suite of spherically symmetric\nsupernova models with the Prometheus-Vertex code, using four different\nequations of state and five choices of final baryonic neutron-star (NS) mass in\nthe 1.36-1.93 M$_\\odot$ range. Our models include muons and proto-neutron star\n(PNS) convection by a mixing-length approximation. The time-integrated signals\nof our 1.44 M$_\\odot$ models agree reasonably well with the combined data of\nthe four relevant experiments, IMB, Kam-II, BUST, and LSD, but the\nhigh-threshold IMB detector alone favors a NS mass of 1.7-1.8 M$_\\odot$,\nwhereas Kam-II alone prefers a mass around 1.4 M$_\\odot$. The cumulative energy\ndistributions in these two detectors are well matched by models for such NS\nmasses, and the previous tension between predicted mean neutrino energies and\nthe combined measurements is gone, with and without flavor swap. Generally, our\npredicted signals do not strongly depend on assumptions about flavor mixing,\nbecause the PNS flux spectra depend only weakly on antineutrino flavor. While\nour models show compatibility with the events detected during the first\nseconds, PNS convection and nucleon correlations in the neutrino opacities lead\nto short PNS cooling times of 5-9 s, in conflict with the late event bunches in\nKam-II and BUST after 8-9 s, which are also difficult to explain by background.\nSpeculative interpretations include the onset of fallback of transiently\nejected material onto the NS, a late phase transition in the nuclear medium,\ne.g., from hadronic to quark matter, or other effects that add to the standard\nPNS cooling emission and either stretch the signal or provide a late source of\nenergy. More research, including systematic 3D simulations, is needed to assess\nthese open issues.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:53:40 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fiorillo","Damiano F. G.",""],["Heinlein","Malte",""],["Janka","Hans-Thomas",""],["Raffelt","Georg",""],["Vitagliano","Edoardo",""]]}
{"id":"2308.01405","submitter":"Amanda Young","authors":"Amanda Young","title":"On a bulk gap strategy for quantum lattice models","comments":"Contribution for the proceedings of QMATH 15","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Establishing the (non)existence of a spectral gap above the ground state in\nthe thermodynamic limit is one of the fundamental steps for characterizing the\ntopological phase of a quantum lattice model. This is particularly challenging\nwhen a model is expected to have low-lying edge excitations, but nevertheless a\npositive bulk gap. We review the bulk gap strategy introduced in [Warzel, Young\n'22] and [Warzel, Young '23] while studying truncated Haldane pseudopotentials.\nThis approach is able to avoid low-lying edge modes by separating the ground\nstates and edge states into different invariant subspaces before applying\nspectral gap bounding techniques. The approach is stated in a general context,\nand we reformulate specific spectral gap methods in an invariant subspace\ncontext to illustrate the necessary conditions for combining them with the bulk\ngap strategy. We then review its application to a truncation of the 1/3-filled\nHaldane pseudopotential in the cylinder geometry.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:59:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Young","Amanda",""]]}
{"id":"2308.01406","submitter":"Victor Reis","authors":"Janardhan Kulkarni, Victor Reis and Thomas Rothvoss","title":"Optimal Online Discrepancy Minimization","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that there exists an online algorithm that for any sequence of\nvectors $v_1,\\ldots,v_T \\in \\mathbb{R}^n$ with $\\|v_i\\|_2 \\leq 1$, arriving one\nat a time, decides random signs $x_1,\\ldots,x_T \\in \\{ -1,1\\}$ so that for\nevery $t \\le T$, the prefix sum $\\sum_{i=1}^t x_iv_i$ is $10$-subgaussian. This\nimproves over the work of Alweiss, Liu and Sawhney who kept prefix sums\n$O(\\sqrt{\\log (nT)})$-subgaussian, and gives a $O(\\sqrt{\\log T})$ bound on the\ndiscrepancy $\\max_{t \\in T} \\|\\sum_{i=1}^t x_i v_i\\|_\\infty$. Our proof\ncombines a generalization of Banaszczyk's prefix balancing result to trees with\na cloning argument to find distributions rather than single colorings. We also\nshow a matching $\\Omega(\\sqrt{\\log T})$ strategy for an oblivious adversary.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:01:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kulkarni","Janardhan",""],["Reis","Victor",""],["Rothvoss","Thomas",""]]}
{"id":"2308.01407","submitter":"Sarel (Charl) Van Der Walt","authors":"S. J. van der Walt, L. E. Kristensen, H. Calcutt, J. K. J{\\o}rgensen\n  and R. T. Garrod","title":"Protostellar Interferometric Line Survey of the Cygnus-X region\n  (PILS-Cygnus) -- The role of the external environment in setting the\n  chemistry of protostars","comments":"19 pages, 77 pages appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  (Abridged) Molecular lines are commonly detected towards protostellar\nsources. However, to get a better understanding of the chemistry of these\nsources we need unbiased molecular surveys over a wide frequency range for as\nmany sources as possible to shed light on the origin of this chemistry,\nparticularly any influence from the external environment. We present results\nfrom the PILS-Cygnus survey of ten intermediate- to high-mass protostellar\nsources in the nearby Cygnus-X complex, through high angular resolution\ninterferometric observations over a wide frequency range. Using the\nSubmillimeter Array (SMA), a spectral line survey of ten sources was performed\nin the frequency range 329-361 GHz, with an angular resolution of\n$\\sim$1\\farcs5, ($\\sim$2000 AU, source distance of 1.3 kpc). Spectral modelling\nwas performed to identify molecular emission and determine column densities and\nexcitation temperatures for each source. We detect CH$_3$OH towards nine of the\nten sources, CH$_3$OCH$_3$ and CH$_3$OCHO towards three sources, and CH$_3$CN\ntowards four sources. Towards five sources the chemistry is spatially\ndifferentiated (different species peak at different positions and are offset\nfrom the peak continuum emission). The chemical properties of each source do\nnot correlate with their position in the Cygnus-X complex, nor do the distance\nor direction to the nearest OB associations. However, the five sources located\nin the DR21 filament do appear to show less line emission compared to the five\nsources outside the filament. This work shows how important wide frequency\ncoverage observations are combined with high angular resolution observations\nfor studying the protostellar environment. Based on the ten sources observed\nhere, the external environment appears to only play a minor role in setting the\nchemical environment on these small scales ($<$ 2000 AU).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:04:38 GMT"}],"update_date":"2023-08-04","authors_parsed":[["van der Walt","S. J.",""],["Kristensen","L. E.",""],["Calcutt","H.",""],["J\u00f8rgensen","J. K.",""],["Garrod","R. T.",""]]}
{"id":"2308.01408","submitter":"Andrei Preda","authors":"Andrei-Alexandru Preda, Dumitru-Clementin Cercel, Traian Rebedea,\n  Costin-Gabriel Chiru","title":"UPB at IberLEF-2023 AuTexTification: Detection of Machine-Generated Text\n  using Transformer Ensembles","comments":"10 pages. Accepted for publication in the IberLEF 2023 Proceedings,\n  at https://ceur-ws.org/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes the solutions submitted by the UPB team to the\nAuTexTification shared task, featured as part of IberLEF-2023. Our team\nparticipated in the first subtask, identifying text documents produced by large\nlanguage models instead of humans. The organizers provided a bilingual dataset\nfor this subtask, comprising English and Spanish texts covering multiple\ndomains, such as legal texts, social media posts, and how-to articles. We\nexperimented mostly with deep learning models based on Transformers, as well as\ntraining techniques such as multi-task learning and virtual adversarial\ntraining to obtain better results. We submitted three runs, two of which\nconsisted of ensemble models. Our best-performing model achieved macro\nF1-scores of 66.63% on the English dataset and 67.10% on the Spanish dataset.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:08:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Preda","Andrei-Alexandru",""],["Cercel","Dumitru-Clementin",""],["Rebedea","Traian",""],["Chiru","Costin-Gabriel",""]]}
{"id":"2308.01409","submitter":"Tania Varesano","authors":"T. Varesano, D. M. Hassler, N. Zambrana Prado, J. Plowman, G. Del\n  Zanna, S. Parenti, H. E. Mason, A. Giunta, F. Auchere, M. Carlsson, A.\n  Fludra, H. Peter, D. Muller, D. Williams, R. Aznar Cuadrado, K. Barczynski,\n  E. Buchlin, M. Caldwell, T. Fredvik, T. Grundy, S. Guest, L. Harra, M.\n  Janvier, T. Kucera, S. Leeks, W. Schmutz, U. Schuehle, S. Sidher, L. Teriaca,\n  W. Thompson, and S. L. Yardley","title":"SPICE Connection Mosaics to link the Sun's surface and the heliosphere","comments":"20 pages, 19 figures, submitted to A&A on August 3rd","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an analysis of the first connection mosaic made by the SPICE\ninstrument on board of the ESA / NASA Solar Orbiter mission on March 2$^{nd}$,\n2022. The data will be used to map coronal composition that will be compared\nwith in-situ measurements taken by SWA/HIS to establish the coronal origin of\nthe solar wind plasma observed at Solar Orbiter. The SPICE spectral lines were\nchosen to have varying sensitivity to the First Ionization Potential (FIP)\neffect, and therefore the radiances of the spectral lines will vary\nsignificantly depending on whether the elemental composition is coronal or\nphotospheric. We perform temperature diagnostics using line ratios and Emission\nMeasure (EM) loci, and compute relative FIP biases using three different\napproaches (two line ratio (2LR), ratios of linear combinations of spectral\nlines (LCR), and differential emission measure (DEM) inversion) in order to\nperform composition diagnostics in the corona. We then compare the SPICE\ncomposition analysis and EUI data of the potential solar wind sources regions\nto the SWA / HIS data products. Radiance maps are extracted from SPICE spectral\ndata cubes, with values matching previous observations. We find isothermal\nplasma of around LogT=5.8 for the active region loops targeted, and that higher\nFIP-bias values are present at the footpoints of the coronal loops associated\nwith two active regions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:12:15 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 14:54:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Varesano","T.",""],["Hassler","D. M.",""],["Prado","N. Zambrana",""],["Plowman","J.",""],["Del Zanna","G.",""],["Parenti","S.",""],["Mason","H. E.",""],["Giunta","A.",""],["Auchere","F.",""],["Carlsson","M.",""],["Fludra","A.",""],["Peter","H.",""],["Muller","D.",""],["Williams","D.",""],["Cuadrado","R. Aznar",""],["Barczynski","K.",""],["Buchlin","E.",""],["Caldwell","M.",""],["Fredvik","T.",""],["Grundy","T.",""],["Guest","S.",""],["Harra","L.",""],["Janvier","M.",""],["Kucera","T.",""],["Leeks","S.",""],["Schmutz","W.",""],["Schuehle","U.",""],["Sidher","S.",""],["Teriaca","L.",""],["Thompson","W.",""],["Yardley","S. L.",""]]}
{"id":"2308.01410","submitter":"Anh Trong Nam Hoang","authors":"Anh Trong Nam Hoang","title":"Fox-Neuwirth cells, quantum shuffle algebras, and character sums of the\n  resultant","comments":"37 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2207.12469","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give an upper bound on character sums of the resultant over pairs of monic\nsquare-free polynomials of given degrees, answering a question of Ellenberg and\nShusterman in the quadratic case. Our approach is topological: we compute the\nhomology of braid groups on multi-punctured planes and prove a vanishing range\nfor the homology of mixed braid groups with rank-1 local coefficients\nassociated to characters of finite fields. Our method involves constructing a\ncellular stratification for configuration spaces of multi-punctured planes and\nrelating their twisted homology with more general exponential coefficients to\nthe cohomology of certain bimodules over quantum shuffle algebras.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:12:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hoang","Anh Trong Nam",""]]}
{"id":"2308.01411","submitter":"Ganesh Vaidya","authors":"Aekta Aggarwal, Helge Holden and Ganesh Vaidya","title":"Well-posedness and error estimates for coupled systems of nonlocal\n  conservation laws","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":"  This article deals with the error estimates for numerical approximations of\nthe entropy solutions of coupled systems of nonlocal hyperbolic conservation\nlaws. The systems can be strongly coupled through the nonlocal coefficient\npresent in the convection term. A fairly general class of fluxes is being\nconsidered, where the local part of the flux can be discontinuous at infinitely\nmany points, with possible accumulation points. The aims of the paper are\nthreefold: 1. Establishing existence of entropy solutions with rough local flux\nfor such systems, by deriving a uniform BV bound on the numerical\napproximations; 2. Deriving a general Kuznetsov-type lemma (and hence\nuniqueness) for such systems with both smooth and rough local fluxes; 3.\nProving the convergence rate of the finite volume approximations to the entropy\nsolutions of the system as $1/2$ and $1/3$, with homogeneous (in any dimension)\nand rough local parts (in one dimension), respectively. Numerical experiments\nare included to illustrate the convergence rates.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:13:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Aggarwal","Aekta",""],["Holden","Helge",""],["Vaidya","Ganesh",""]]}
{"id":"2308.01412","submitter":"Sergio Naval Marimont","authors":"Sergio Naval Marimont and Giacomo Tarroni","title":"Harder synthetic anomalies to improve OoD detection in Medical Images","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our method builds upon previous Medical Out-of-Distribution (MOOD) challenge\nwinners that empirically show that synthetic local anomalies generated copying\n/ interpolating foreign patches are useful to train segmentation networks able\nto generalize to unseen types of anomalies. In terms of the synthetic anomaly\ngeneration process, our contributions makes synthetic anomalies more\nheterogeneous and challenging by 1) using random shapes instead of squares and\n2) smoothing the interpolation edge of anomalies so networks cannot rely on the\nhigh gradient between image - foreign patch to identify anomalies. Our\nexperiments using the validation set of 2020 MOOD winners show that both\ncontributions improved substantially the method performance. We used a standard\n3D U-Net architecture as segmentation network, trained patch-wise in both brain\nand abdominal datasets. Our final challenge submission consisted of 10 U-Nets\ntrained across 5 data folds with different configurations of the anomaly\ngeneration process. Our method achieved first position in both sample-wise and\npixel-wise tasks in the 2022 edition of the Medical Out-of-Distribution held at\nMICCAI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:16:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Marimont","Sergio Naval",""],["Tarroni","Giacomo",""]]}
{"id":"2308.01416","submitter":"Zheshen Zhang","authors":"Zheshen Zhang, Chenglong You, Omar S. Maga\\~na-Loaiza, Robert Fickler,\n  Roberto de J. Le\\'on-Montiel, Juan P. Torres, Travis Humble, Shuai Liu, Yi\n  Xia, Quntao Zhuang","title":"Entanglement-Based Quantum Information Technology","comments":"87 pages, 40 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Entanglement is a quintessential quantum mechanical phenomenon with no\nclassical equivalent. First discussed by Einstein, Podolsky, and Rosen and\nformally introduced by Schr\\\"odinger in 1935, entanglement has grown from a\nscientific debate to a radically new resource that sparks a technological\nrevolution. This review focuses on the fundamentals and recent advances in\nentanglement-based quantum information technology (QIT), specifically in\nphotonic systems. Photons are unique quantum information carriers with several\nadvantages, such as their ability to operate at room temperature, their\ncompatibility with existing communication and sensing infrastructures, and the\navailability of readily accessible optical components. Photons also interface\nwell with other solid-state quantum platforms. We will first provide an\noverview on entanglement, starting with an introduction to its development from\na historical perspective followed by the theory for entanglement generation and\nthe associated representative experiments. We will then dive into the\napplications of entanglement-based QIT for sensing, imaging, spectroscopy, data\nprocessing, and communication. Before closing, we will present an outlook for\nthe architecture of the next-generation entanglement-based QIT and its\nprospective applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:28:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Zheshen",""],["You","Chenglong",""],["Maga\u00f1a-Loaiza","Omar S.",""],["Fickler","Robert",""],["Le\u00f3n-Montiel","Roberto de J.",""],["Torres","Juan P.",""],["Humble","Travis",""],["Liu","Shuai",""],["Xia","Yi",""],["Zhuang","Quntao",""]]}
{"id":"2308.01417","submitter":"Andreas Habring","authors":"Andreas Habring and Martin Holler and Thomas Pock","title":"Subgradient Langevin Methods for Sampling from Non-smooth Potentials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with sampling from probability distributions $\\pi$ on\n$\\mathbb{R}^d$ admitting a density of the form $\\pi(x) \\propto e^{-U(x)}$,\nwhere $U(x)=F(x)+G(Kx)$ with $K$ being a linear operator and $G$ being\nnon-differentiable. Two different methods are proposed, both employing a\nsubgradient step with respect to $G\\circ K$, but, depending on the regularity\nof $F$, either an explicit or an implicit gradient step with respect to $F$ can\nbe implemented. For both methods, non-asymptotic convergence proofs are\nprovided, with improved convergence results for more regular $F$. Further,\nnumerical experiments are conducted for simple 2D examples, illustrating the\nconvergence rates, and for examples of Bayesian imaging, showing the practical\nfeasibility of the proposed methods for high dimensional data.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:30:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Habring","Andreas",""],["Holler","Martin",""],["Pock","Thomas",""]]}
{"id":"2308.01418","submitter":"Christis Katsouris","authors":"Christis Katsouris","title":"Limit Theory under Network Dependence and Nonstationarity","comments":"arXiv admin note: text overlap with arXiv:1705.08413 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  These lecture notes represent supplementary material for a short course on\ntime series econometrics and network econometrics. We give emphasis on limit\ntheory for time series regression models as well as the use of the\nlocal-to-unity parametrization when modeling time series nonstationarity.\nMoreover, we present various non-asymptotic theory results for moderate\ndeviation principles when considering the eigenvalues of covariance matrices as\nwell as asymptotics for unit root moderate deviations in nonstationary\nautoregressive processes. Although not all applications from the literature are\ncovered we also discuss some open problems in the time series and network\neconometrics literature.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:32:19 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 13:43:32 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 12:59:27 GMT"},{"version":"v4","created":"Mon, 14 Aug 2023 11:31:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Katsouris","Christis",""]]}
{"id":"2308.01419","submitter":"Chao Zhang","authors":"Chao Zhang, Xingyue Pu, Mihai Cucuringu, Xiaowen Dong","title":"Graph Neural Networks for Forecasting Multivariate Realized Volatility\n  with Spillover Effects","comments":"8 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.LG q-fin.RM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a novel methodology for modeling and forecasting multivariate\nrealized volatilities using customized graph neural networks to incorporate\nspillover effects across stocks. The proposed model offers the benefits of\nincorporating spillover effects from multi-hop neighbors, capturing nonlinear\nrelationships, and flexible training with different loss functions. Our\nempirical findings provide compelling evidence that incorporating spillover\neffects from multi-hop neighbors alone does not yield a clear advantage in\nterms of predictive accuracy. However, modeling nonlinear spillover effects\nenhances the forecasting accuracy of realized volatilities, particularly for\nshort-term horizons of up to one week. Moreover, our results consistently\nindicate that training with the Quasi-likelihood loss leads to substantial\nimprovements in model performance compared to the commonly-used mean squared\nerror. A comprehensive series of empirical evaluations in alternative settings\nconfirm the robustness of our results.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:39:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Chao",""],["Pu","Xingyue",""],["Cucuringu","Mihai",""],["Dong","Xiaowen",""]]}
{"id":"2308.01421","submitter":"Elena Agliari","authors":"Elena Agliari, Miriam Aquaro, Francesco Alemanno, Alberto Fachechi","title":"Regularization, early-stopping and dreaming: a Hopfield-like setup to\n  address generalization and overfitting","comments":null,"journal-ref":null,"doi":null,"report-no":"Roma01.Math","categories":"cs.LG cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work we approach attractor neural networks from a machine learning\nperspective: we look for optimal network parameters by applying a gradient\ndescent over a regularized loss function. Within this framework, the optimal\nneuron-interaction matrices turn out to be a class of matrices which correspond\nto Hebbian kernels revised by iteratively applying some unlearning protocols.\nRemarkably, the number of unlearning steps is proved to be related to the\nregularization hyperparameters of the loss function and to the training time.\nThus, we can design strategies to avoid overfitting that are formulated in\nterms of the algebraic properties of the interaction matrix, or, equivalently,\nin terms of regularization tuning and early-stopping strategies. The\ngeneralization capabilities of these attractor networks are also investigated:\nanalytical results are obtained for random synthetic datasets, next, the\nemerging picture is corroborated by numerical experiments that highlight the\nexistence of several regimes (i.e., overfitting, failure and success) as the\ndataset parameters are varied.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:04:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Agliari","Elena",""],["Aquaro","Miriam",""],["Alemanno","Francesco",""],["Fachechi","Alberto",""]]}
{"id":"2308.01422","submitter":"Patrick Uftring","authors":"Patrick Uftring","title":"Weihrauch degrees without roots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We answer the following question by Arno Pauly: \"Is there a square-root\noperator on the Weihrauch degrees?\". In fact, we show that there are\nuncountably many pairwise incomparable Weihrauch degrees without any roots. We\nalso prove that the omniscience principles of LPO and LLPO do not have roots.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:19:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Uftring","Patrick",""]]}
{"id":"2308.01423","submitter":"Yeonghun Kang Mr","authors":"Yeonghun Kang, Jihan Kim","title":"ChatMOF: An Autonomous AI System for Predicting and Generating\n  Metal-Organic Frameworks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  ChatMOF is an autonomous Artificial Intelligence (AI) system that is built to\npredict and generate metal-organic frameworks (MOFs). By leveraging a\nlarge-scale language model (GPT-4 and GPT-3.5-turbo), ChatMOF extracts key\ndetails from textual inputs and delivers appropriate responses, thus\neliminating the necessity for rigid structured queries. The system is comprised\nof three core components (i.e. an agent, a toolkit, and an evaluator) and it\nforms a robust pipeline that manages a variety of tasks, including data\nretrieval, property prediction, and structure generations. The study further\nexplores the merits and constraints of using large language models (LLMs) AI\nsystem in material sciences using and showcases its transformative potential\nfor future advancements.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 02:08:13 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 15:13:46 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kang","Yeonghun",""],["Kim","Jihan",""]]}
{"id":"2308.01424","submitter":"Jonathan Schmidt","authors":"Jonathan Schmidt, Qadeer Khan, Daniel Cremers","title":"LiDAR View Synthesis for Robust Vehicle Navigation Without Expert Labels","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 models for self-driving cars require a diverse training dataset\nto manage critical driving scenarios on public roads safely. This includes\nhaving data from divergent trajectories, such as the oncoming traffic lane or\nsidewalks. Such data would be too dangerous to collect in the real world. Data\naugmentation approaches have been proposed to tackle this issue using RGB\nimages. However, solutions based on LiDAR sensors are scarce. Therefore, we\npropose synthesizing additional LiDAR point clouds from novel viewpoints\nwithout physically driving at dangerous positions. The LiDAR view synthesis is\ndone using mesh reconstruction and ray casting. We train a deep learning model,\nwhich takes a LiDAR scan as input and predicts the future trajectory as output.\nA waypoint controller is then applied to this predicted trajectory to determine\nthe throttle and steering labels of the ego-vehicle. Our method neither\nrequires expert driving labels for the original nor the synthesized LiDAR\nsequence. Instead, we infer labels from LiDAR odometry. We demonstrate the\neffectiveness of our approach in a comprehensive online evaluation and with a\ncomparison to concurrent work. Our results show the importance of synthesizing\nadditional LiDAR point clouds, particularly in terms of model robustness.\nProject page: https://jonathsch.github.io/lidar-synthesis/\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:46:43 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 19:25:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Schmidt","Jonathan",""],["Khan","Qadeer",""],["Cremers","Daniel",""]]}
{"id":"2308.01425","submitter":"Zihuai Lin","authors":"W. Li, Z. Lin, Q. Guo, B. Vucetic","title":"Exploiting Structured Sparsity with Low Complexity Sparse Bayesian\n  Learning for RIS-assisted MIMO Channel Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As an emerging communication auxiliary technology, reconfigurable intelligent\nsurface (RIS) is expected to play a significant role in the upcoming 6G\nnetworks. Due to its total reflection characteristics, it is challenging to\nimplement conventional channel estimation algorithms. This work focuses on\nRIS-assisted MIMO communications. Although many algorithms have been proposed\nto address this issue, there are still ample opportunities for improvement in\nterms of estimation accuracy, complexity, and applicability. To fully exploit\nthe structured sparsity of the multiple-input-multiple-output (MIMO) channels,\nwe propose a new channel estimation algorithm called unitary approximate\nmessage passing sparse Bayesian learning with partial common support\nidentification (UAMPSBL-PCI). Thanks to the mechanism of PCI and the use of\nUAMP, the proposed algorithm has a lower complexity while delivering enhanced\nperformance relative to existing channel estimation algorithms. Extensive\nsimulations demonstrate its excellent performance in various environments.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:51:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","W.",""],["Lin","Z.",""],["Guo","Q.",""],["Vucetic","B.",""]]}
{"id":"2308.01426","submitter":"Stephen Strickland","authors":"Stephen L. Strickland, Karen E. Daniels, Michael Shearer","title":"The Onset Acceleration for Surfactant Covered Faraday Waves","comments":"31 pages , 12 figures , 3 tables , 3 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Faraday waves are gravity-capillary waves that emerge on the surface of a\nvertically vibrated fluid when the energy injected via vibration exceeds the\nenergy lost due to viscous dissipation. Because this dissipation primarily\noccurs in the free surface boundary layer, their emergence is particularly\nsensitive to free surface properties including the surface tension, elasticity,\nand viscosity of surfactants present at the free surface. We study this\nsensitivity by considering a Newtonian fluid bath covered by an insoluble\nsurfactant subject to vertical vibrations which produce sub-harmonic Faraday\nwaves. By assuming a finite-depth, infinite-breadth, low-viscosity bulk fluid\nand accounting for surface tension, Marangoni, and Boussinesq effects, we\nderive an expression for the onset acceleration up to second order in the\nexpansion parameter $\\Upsilon = \\sqrt{\\tfrac{1}{\\mathcal{R}e}}$. We recover the\nresults of previous numerical investigations, but only by modifying the\nMarangoni and Boussinesq numbers to account for the low-viscosity limit. The\nanalytic expression allows us to consider a range of parameters not previously\nstudied, including a wide variety of fluid depths and driving frequencies. In\naddition, we uncover regions of parameter space for which our model predicts\nthat the addition of surfactant would lower, rather than elevate, the onset\nacceleration. We discuss the possible use of this model in developing a surface\nviscometer for surfactant monolayers.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:52:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Strickland","Stephen L.",""],["Daniels","Karen E.",""],["Shearer","Michael",""]]}
{"id":"2308.01427","submitter":"Gines Carrascal De Las Heras","authors":"Gines Carrascal, Beatriz Roman, Guillermo Botella and Alberto del\n  Barrio","title":"Differential Evolution VQE for Crypto-currency Arbitrage. Quantum\n  Optimization with many local minima","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Crypto-currency markets are known to exhibit inefficiencies, which presents\nopportunities for profitable cyclic transactions or arbitrage, where one\ncurrency is traded for another in a way that results in a net gain without\nincurring any risk. Quantum computing has shown promise in financial\napplications, particularly in resolving optimization problems like arbitrage.\nIn this paper, we introduce a differential evolution (DE) optimization\nalgorithm for Variational Quantum Eigensolver (VQE) using Qiskit framework. We\nelucidate the application of crypto-currency arbitrage using different VQE\noptimizers. Our findings indicate that the proposed DE-based method effectively\nconverges to the optimal solution in scenarios where other commonly used\noptimizers, such as COBYLA, struggle to find the global minimum. We further\ntest this procedure's feasibility on IBM's real quantum machines up to 127\nqubits. With a three-currency scenario, the algorithm converged in 417 steps\nover a 12-hour period on the \"ibm_geneva\" machine. These results suggest the\npotential for achieving a quantum advantage in solving increasingly complex\nproblems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:58:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Carrascal","Gines",""],["Roman","Beatriz",""],["Botella","Guillermo",""],["del Barrio","Alberto",""]]}
{"id":"2308.01428","submitter":"Natalie Frank","authors":"Natalie Violetta Frank, Maria Eletta Negretti, Joel Sommeria, Mart\\'in\n  Obligado, Ra\\'ul Bayo\\'an Cal","title":"Coriolis force deflects wind plant wakes left in the Northern Hemisphere","comments":"8 pages, 4 figures, submitted to Nature Communications and is under\n  review","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The physical growth of wind energy over several decades, caused a\nre-investigation mesoscale effects on wind plant dynamics. At a large scale\noperation, understanding the interactions between atmospheric phenomena and\nwind plant wakes is crucial to improving models. Within a wind plant, wakes are\ngenerated by individual turbines and the summation of individual wakes is the\nglobal plant wake. In both cases, the dynamics are sensitive to atmospheric\nconditions; one of interest to wind and atmospheric scientists is the Coriolis\nforce. Current research noted spatial and temporal influences on the global\nplant wakes caused by the Coriolis force. Due to the presence of wind veer in\nthe atmospheric boundary layer, field research is notoriously difficult. As a\nresult, investigations have been lead by numerical simulations. This proved\nhelpful for initial queries, established the significance of the Coriolis force\nas a non trivial parameter of wind plant dynamics. This works presents a novel\nexperimental study of the impact of the Coriolis force on the dynamics of a\nscaled wind plant. The experiments show that for a single turbine the wake\ndeflection is insignificant. Additionally, the results show that the global\nplant wake deflects in the anti-clockwise direction in the Northern hemisphere.\nThe outcomes of this work yield unique experimental methods for research in\nwind energy, and provide a new basis for the fundamental dynamics of a wind\nplant under influence of the Coriolis force for future wind plant models\ncausing influence on the global expansion of wind energy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:00:41 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Frank","Natalie Violetta",""],["Negretti","Maria Eletta",""],["Sommeria","Joel",""],["Obligado","Mart\u00edn",""],["Cal","Ra\u00fal Bayo\u00e1n",""]]}
{"id":"2308.01429","submitter":"George Rupp","authors":"Maurizio Consoli and George Rupp","title":"Second resonance of the Higgs field: motivations, experimental signals,\n  unitarity constraints","comments":"Plain LaTeX, 36 pages, 12 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Perturbative calculations predict that the Standard Model (SM) effective\npotential should have a new minimum, well beyond the Planck scale, much deeper\nthan the electroweak vacuum. As it is not obvious that gravitational effects\ncan get so strong to stabilize the potential, most authors have accepted the\nmetastability scenario in a cosmological perspective. This perspective is\nneeded to explain why the theory remains trapped into our electroweak vacuum,\nbut requires to control the properties of matter in the extreme conditions of\nthe early universe. Alternatively, one can consider the completely different\nidea of a non-perturbative effective potential which, as at the beginning of\nthe SM, is restricted to the pure $\\Phi^4$ sector yet consistent with the now\nexisting analytical and numerical studies. In this approach, where the\nelectroweak vacuum is the lowest-energy state, besides the resonance of mass\n$m_h=125$ GeV defined by the quadratic shape of the potential at its minimum,\nthe Higgs field should exhibit a second resonance with mass $690\\pm10({\\rm\nstat})\\pm20({\\rm sys})$ GeV associated with the zero-point energy determining\nthe potential depth. Despite its large mass, this would couple to longitudinal\n$W$s with the same typical strength as the low-mass state at 125 GeV and\nrepresent a relatively narrow resonance of width $\\Gamma_H=30\\div 38$ GeV,\nmainly produced at LHC by gluon-gluon fusion. So it is interesting that, in the\nLHC data, one can find various indications for a new resonance in the expected\nmass range with a non-negligible statistical significance. As this could become\nan important new discovery by just adding two missing samples of RUN2 data, we\noutline further refinements of the theoretical predictions that could be\nobtained by implementing unitarity constraints, in the presence of fermion and\ngauge fields, with coupled-channel calculations used for meson spectroscopy.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:02:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Consoli","Maurizio",""],["Rupp","George",""]]}
{"id":"2308.01431","submitter":"Catherine Galbraith","authors":"James A. Galbraith and Catherine G. Galbraith","title":"Using Single Molecule Imaging to Explore Intracellular Heterogeneity","comments":"21 pages, 2 figures, 1 table","journal-ref":null,"doi":"10.1016/j.biocel.2023.106455","report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Despite more than 100 years of study, it is unclear if the movement of\nproteins inside the cell is best described as a mosh pit or an exquisitely\nchoreographed dance. Recent studies suggest the latter. Local interactions\ninduce molecular condensates such as liquid-liquid phase separations (LLPSs) or\nnon-liquid, functionally significant molecular aggregates, including synaptic\ndensities, nucleoli, and Amyloid fibrils. Molecular condensates trigger\nintracellular signaling and drive processes ranging from gene expression to\ncell division. However, the descriptions of condensates tend to be qualitative\nand correlative. Here, we indicate how single-molecule imaging and analyses can\nbe applied to quantify condensates. We discuss the pros and cons of different\ntechniques for measuring differences between transient molecular behaviors\ninside and outside condensates. Finally, we offer suggestions for how imaging\nand analyses from different time and space regimes can be combined to identify\nmolecular behaviors indicative of condensates within the dynamic high-density\nintracellular environment.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:03:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Galbraith","James A.",""],["Galbraith","Catherine G.",""]]}
{"id":"2308.01432","submitter":"Matthew Goh","authors":"Matthew L. Goh, Martin Larocca, Lukasz Cincio, M. Cerezo, Fr\\'ed\\'eric\n  Sauvage","title":"Lie-algebraic classical simulations for variational quantum computing","comments":"17 pages main text, 12 pages appendices","journal-ref":null,"doi":null,"report-no":"LA-UR-23-26071","categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classical simulation of quantum dynamics plays an important role in our\nunderstanding of quantum complexity, and in the development of quantum\ntechnologies. Compared to other techniques for efficient classical simulations,\nmethods relying on the Lie-algebraic structure of quantum dynamics have\nreceived relatively little attention. At their core, these simulations leverage\nthe underlying Lie algebra - and the associated Lie group - of a dynamical\nprocess. As such, rather than keeping track of the individual entries of large\nmatrices, one instead keeps track of how its algebraic decomposition changes\nduring the evolution. When the dimension of the algebra is small (e.g., growing\nat most polynomially in the system size), one can leverage efficient simulation\ntechniques. In this work, we review the basis for such methods, presenting a\nframework that we call \"$\\mathfrak{g}$-sim\", and showcase their efficient\nimplementation in several paradigmatic variational quantum computing tasks.\nSpecifically, we perform Lie-algebraic simulations to train and optimize\nparametrized quantum circuits, design enhanced parameter initialization\nstrategies, solve tasks of quantum circuit synthesis, and train a quantum-phase\nclassifier.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:08:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Goh","Matthew L.",""],["Larocca","Martin",""],["Cincio","Lukasz",""],["Cerezo","M.",""],["Sauvage","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.01433","submitter":"Joao Comba","authors":"Noemi Maritza L. Romero and Ricco Vasconcellos and Mariana R. Mendoza\n  and Jo\\~ao L. D. Comba","title":"COVID-VR: A Deep Learning COVID-19 Classification Model Using\n  Volume-Rendered Computer Tomography","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":"  The COVID-19 pandemic presented numerous challenges to healthcare systems\nworldwide. Given that lung infections are prevalent among COVID-19 patients,\nchest Computer Tomography (CT) scans have frequently been utilized as an\nalternative method for identifying COVID-19 conditions and various other types\nof pulmonary diseases. Deep learning architectures have emerged to automate the\nidentification of pulmonary disease types by leveraging CT scan slices as\ninputs for classification models. This paper introduces COVID-VR, a novel\napproach for classifying pulmonary diseases based on volume rendering images of\nthe lungs captured from multiple angles, thereby providing a comprehensive view\nof the entire lung in each image. To assess the effectiveness of our proposal,\nwe compared it against competing strategies utilizing both private data\nobtained from partner hospitals and a publicly available dataset. The results\ndemonstrate that our approach effectively identifies pulmonary lesions and\nperforms competitively when compared to slice-based methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:13:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Romero","Noemi Maritza L.",""],["Vasconcellos","Ricco",""],["Mendoza","Mariana R.",""],["Comba","Jo\u00e3o L. D.",""]]}
{"id":"2308.01434","submitter":"Andrew Gillespie Gillespie","authors":"R. V. Duncan (Texas Tech University), Cuikun Lin (Texas Tech\n  University), Andrew K. Gillespie (Texas Tech University), John Gahl\n  (University of Missouri)","title":"Prospects For A New Light-Nuclei, Fission-Fusion Energy Cycle","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Future advanced nuclear rocket propulsion, and the availability of new\nnuclear power cycle designs, will benefit substantially from the large current\ninvestment in alternative nuclear energy that is underway today. We propose a\nnew nuclear cycle which includes the primary fission of lithium-6, followed by\nsecondary fusion of deuterium and tritium, and a secondary fission of lithium-7\nby tritium. This cycle does not produce nuclear waste from its nuclear fuel,\nsince all byproducts of these cascade reactions are stable, provided that the\ntriton production during the primary reaction is fully consumed in the\nsecondary reactions. This cycle may, however, activate surrounding technical\nmaterials from its neutron flux. This light-element nuclear fuel is readily\nobtained through the ongoing expansion of the lithium mining industry and\nelectric vehicle (EV) battery recycling industries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:13:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Duncan","R. V.","","Texas Tech University"],["Lin","Cuikun","","Texas Tech\n  University"],["Gillespie","Andrew K.","","Texas Tech University"],["Gahl","John","","University of Missouri"]]}
{"id":"2308.01435","submitter":"Jos\\'e Gustavo Coelho","authors":"Jos\\'e Gustavo Coelho, Fabio Enrique Brochero Mart\\'inez","title":"Counting roots of fully triangular polynomials over finite fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mathbb{F}_q$ be a finite field with $q$ elements, $f \\in\n\\mathbb{F}_q[x_1, \\dots, x_n]$ a polynomial in $n$ variables and let us denote\nby $N(f)$ the number of roots of $f$ in $\\mathbb{F}_q^n$. %Many authors, such\nas Wei Cao and Kung Jiang have used augmented degree matrices to determine\n$N(f)$ for different families of polynomials. In this paper we consider the\nfamily of fully triangular polynomials, i.e., polynomials of the form\n\\begin{equation*}\n  f(x_1, \\dots, x_n) = a_1 x_1^{d_{1,1}} + a_2 x_1^{d_{1,2}} x_2^{d_{2,2}} +\n\\dots + a_n x_1^{d_{1,n}}\\cdots x_n^{d_{n,n}} - b, \\end{equation*} where\n$d_{i,j} > 0$ for all $1 \\le i \\le j \\le n$. For these polynomials, we obtain\nexplicit formulas for $N(f)$ when the augmented degree matrix of $f$ is\nrow-equivalent to the augmented degree matrix of a linear polynomial or a\nquadratic diagonal polynomial.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:15:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Coelho","Jos\u00e9 Gustavo",""],["Mart\u00ednez","Fabio Enrique Brochero",""]]}
{"id":"2308.01436","submitter":"Vladimir Dvorkin","authors":"Vladimir Dvorkin and Ferdinando Fioretto","title":"Price-Aware Deep Learning for Electricity Markets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While deep learning gradually penetrates operational planning, its inherent\nprediction errors may significantly affect electricity prices. This letter\nexamines how prediction errors propagate into electricity prices, revealing\nnotable pricing errors and their spatial disparity in congested power systems.\nTo improve fairness, we propose to embed electricity market-clearing\noptimization as a deep learning layer. Differentiating through this layer\nallows for balancing between prediction and pricing errors, as oppose to\nminimizing prediction errors alone. This layer implicitly optimizes fairness\nand controls the spatial distribution of price errors across the system. We\nshowcase the price-aware deep learning in the nexus of wind power forecasting\nand short-term electricity market clearing.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:16:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dvorkin","Vladimir",""],["Fioretto","Ferdinando",""]]}
{"id":"2308.01437","submitter":"David Wick","authors":"W. David Wick","title":"Can Schrodingerist Wavefunction Physics Explain Brownian Motion? II. The\n  Diffusion Coefficient","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the first paper of this series, I investigated whether a wavefunction\nmodel of a heavy particle and a collection of light particles might generate\n\"Brownian-Motion-Like\" trajectories of the heavy particle. I concluded that it\nwas possible, but left unsettled the second claim in Einstein's classical\nprogram: diffusive motion, proportional to the square-root of time, as opposed\nto ballistic motion, proportional to the time. In this paper, I derive a\ncriterion for diffusive motion, as well as an expression for the diffusion\ncoefficient. Unfortunately, as in paper I, no exact solutions are available for\nthe models, making checking the criterion difficult. But a virtue of the method\nemployed here is that, given adequate information about model eigenvalues and\neigenfunctions, diffusion can be definitively ruled in or out.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:20:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wick","W. David",""]]}
{"id":"2308.01438","submitter":"Ahmad Mohammadshirazi","authors":"Ahmad Mohammadshirazi, Aida Nadafian, Amin Karimi Monsefi, Mohammad H.\n  Rafiei, Rajiv Ramnath","title":"Novel Physics-Based Machine-Learning Models for Indoor Air Quality\n  Approximations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cost-effective sensors are capable of real-time capturing a variety of air\nquality-related modalities from different pollutant concentrations to\nindoor/outdoor humidity and temperature. Machine learning (ML) models are\ncapable of performing air-quality \"ahead-of-time\" approximations. Undoubtedly,\naccurate indoor air quality approximation significantly helps provide a healthy\nindoor environment, optimize associated energy consumption, and offer human\ncomfort. However, it is crucial to design an ML architecture to capture the\ndomain knowledge, so-called problem physics. In this study, we propose six\nnovel physics-based ML models for accurate indoor pollutant concentration\napproximations. The proposed models include an adroit combination of\nstate-space concepts in physics, Gated Recurrent Units, and Decomposition\ntechniques. The proposed models were illustrated using data collected from five\noffices in a commercial building in California. The proposed models are shown\nto be less complex, computationally more efficient, and more accurate than\nsimilar state-of-the-art transformer-based models. The superiority of the\nproposed models is due to their relatively light architecture (computational\nefficiency) and, more importantly, their ability to capture the underlying\nhighly nonlinear patterns embedded in the often contaminated sensor-collected\nindoor air quality temporal data.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:22:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mohammadshirazi","Ahmad",""],["Nadafian","Aida",""],["Monsefi","Amin Karimi",""],["Rafiei","Mohammad H.",""],["Ramnath","Rajiv",""]]}
{"id":"2308.01439","submitter":"Diego Valencia-Enr\\'iquez","authors":"Diego Valencia-Enr\\'iquez, Iv\\^anio Puerari, and Leonardo\n  Chaves-Velasquez","title":"Orbital Structure Evolution in Self-Consistent N-body Simulations","comments":"20 pages, 14 figures. Paper accepted 2023 August 01. Received 2023\n  August 01; in original form 2022 July 06 in Monthly Notices of the Royal\n  Astronomical Society Main Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The bar structure in disk galaxies models is formed by different families of\norbits; however, it is not clear how these families of orbits support the bar\nthroughout its secular evolution. Here, we analyze the orbital structure on\nthree stellar disk N-body models embedded in a live dark matter halo. During\nthe evolution of the models, disks naturally form a bar that buckles out of the\ngalactic plane at different ages of the galaxy evolution generating boxy, X,\npeanut, and/or elongated shapes. To understand how the orbit families hold the\nbar structure, we evaluate the orbital evolution using the frequency analysis\non phase space coordinates for all disk particles at different time intervals.\nWe analyze the density maps morphology of the 2:1 family as the bar potential\nevolves. We showed that the families of orbits providing bar support exhibit\nvariations during different stages of its evolutionary process, specifically\nprior to and subsequent to the buckling phase, likewise in the secular\nevolution of the bar. The disk-dominated model develops an internal boxy\nstructure after the first Gyr. Afterwards, the outer part of the disk evolves\ninto a peanut-shape, which lasts till the end of the simulation. The\nintermediary model develops the boxy structure only after 2 Gyr of evolution.\nThe peanut shape appears 2 Gyr later and evolves slowly. The halo-dominated\nmodel develops the boxy structure much later, around 3 Gyr, and the peanut\nmorphology is just incipient at the end of the simulation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:25:45 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Valencia-Enr\u00edquez","Diego",""],["Puerari","Iv\u00e2nio",""],["Chaves-Velasquez","Leonardo",""]]}
{"id":"2308.01440","submitter":"Saeed Karimi-Bidhendi","authors":"Saeed Karimi-Bidhendi, Giovanni Geraci, and Hamid Jafarkhani","title":"Optimizing Cellular Networks for UAV Corridors via Quantization Theory","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 present a new framework based on quantization theory to design cellular\nnetworks optimized for both legacy ground users and uncrewed aerial vehicle\n(UAV) corridors, dedicated aerial highways for safe UAV flights. Our framework\nleverages antenna tilts and transmit power at each base station to enhance\ncoverage and quality of service among users. We develop a comprehensive\nmathematical analysis and optimization algorithms for multiple system-level\nperformance metrics, including received signal strength and\nsignal-to-interference-plus-noise ratio. Realistic antenna radiation patterns\nand propagation channel models are considered, alongside a generic 3D user\ndistribution that allows for performance prioritization on the ground, along\nUAV corridors, or a desired tradeoff between the two. We demonstrate the\nefficacy of the proposed framework through case studies, showcasing the\nnon-trivial combinations of antenna tilts and power levels that improve\ncoverage and signal quality along UAV corridors while incurring only a marginal\nimpact on the ground user performance compared to scenarios without UAVs.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:27:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Karimi-Bidhendi","Saeed",""],["Geraci","Giovanni",""],["Jafarkhani","Hamid",""]]}
{"id":"2308.01441","submitter":"Andrew Gillespie Gillespie","authors":"John Gahl (University of Missouri), Andrew K. Gillespie (Texas Tech\n  University), Cuikun Lin (Texas Tech University), R.V. Duncan (Texas Tech\n  University)","title":"The Fission Fragment Rocket Engine for Mars Fast Transit","comments":"10 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we discuss the advantages and challenges of utilizing Fission\nFragment Rocket Engines (FFREs) to dramatically reduce transit time in space\ntravel, for example, traveling to Mars. We discuss methods to decrease the size\nand weight of FFREs. These include utilizing metallic deuterides as moderators,\ndriving the engines with electron beam bremsstrahlung, and operating the FFREs\nas subcritical assemblies, not as nuclear reactors. We discuss these and other\nnew innovations based upon improved materials and technology that may be\nintegrated into a revolutionary nuclear rocket technology.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:30:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gahl","John","","University of Missouri"],["Gillespie","Andrew K.","","Texas Tech\n  University"],["Lin","Cuikun","","Texas Tech University"],["Duncan","R. V.","","Texas Tech\n  University"]]}
{"id":"2308.01442","submitter":"Luz Roncal","authors":"Francesco Di Plinio, Mikel Fl\\'orez-Amatriain, Ioannis Parissis and\n  Luz Roncal","title":"Pointwise localization and sharp weighted bounds for Rubio de Francia\n  square functions","comments":"27 pages; submitted. v2: typos fixed and more details provided","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $H_\\omega f$ be the Fourier restriction of $f\\in L^2(\\mathbb{R})$ to an\ninterval $\\omega\\subset \\mathbb{R}$. If $\\Omega$ is an arbitrary collection of\npairwise disjoint intervals, the square function of $\\{H_\\omega f: \\omega \\in\n\\Omega\\}$ is termed the Rubio de Francia square function $T^\\Omega$. This\narticle proves a pointwise bound for $T^\\Omega f$ by a sparse operator\ninvolving local $L^2$-averages. A pointwise bound for the smooth version of\n$T^\\Omega$ by a sparse square function is also proved. These pointwise\nlocalization principles lead to quantified $L^p(w)$, $p>2$ and weak $L^p(w)$,\n$p\\geq 2$ norm inequalities for $T^\\Omega$. In particular, the obtained weak\n$L^p(w)$ norm bounds are new for $p\\geq 2$ and sharp for $p>2$. The proofs rely\non sparse bounds for abstract balayages of Carleson sequences, local\northogonality and very elementary time-frequency analysis techniques. The paper\nalso contains two results related to the outstanding conjecture that $T^\\Omega$\nis bounded on $L^2(w)$ if and only if $w\\in A_1$. The conjecture is verified\nfor radially decreasing even $A_1$ weights, and in full generality for the\nWalsh group analogue of $T^\\Omega$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:33:08 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 20:01:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Di Plinio","Francesco",""],["Fl\u00f3rez-Amatriain","Mikel",""],["Parissis","Ioannis",""],["Roncal","Luz",""]]}
{"id":"2308.01443","submitter":"Takayuki Makino","authors":"Kyosuke Saeki and Takayuki Makino","title":"Evaluation of optical constants in oxide thin films using machine\n  learning","comments":"13 pages; 6 figures; accepted for publication in Jpn. J. Appl. Phys.\n  as a regular article","journal-ref":"Jpn. J. Appl. Phys. 62 p. 081002 (2023)","doi":"10.35848/1347-4065/acea4b","report-no":null,"categories":"physics.optics cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper describes an inverse analysis method using neural networks on\noptical spectroscopy, and its application to the quantitative optical constant\nevaluation. The present method consists of three subprocesses. First,\nmeasurable UV-visible spectroscopic quantities were calculated as functions of\nthe optical constants of the solid based on the Tomlin equations [J. Phys. D 1\n1667 (1968)] by carefully eliminating the unpractical combinations of optical\nconstants. Second, the back-propagation neural network is trained using the\ncalculated relationships between the measurable quantities and the optical\nconstants. Finally, the trained network is utilized to determine the optical\nconstants from measured responses. The conventional (Newton-Raphson) method\ntends to require the judgement of a well-experienced analyst, while machine\nlearning shows automatically human-free performance in data conversion.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:34:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Saeki","Kyosuke",""],["Makino","Takayuki",""]]}
{"id":"2308.01444","submitter":"Maxim Olshanskii","authors":"Michael Neilan and Maxim Olshanskii","title":"An Eulerian finite element method for the linearized Navier--Stokes\n  problem in an evolving domain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper addresses an error analysis of an Eulerian finite element method\nused for solving a linearized Navier--Stokes problem in a time-dependent\ndomain. In this study, the domain's evolution is assumed to be known and\nindependent of the solution to the problem at hand. The numerical method\nemployed in the study combines a standard Backward Differentiation Formula\n(BDF)-type time-stepping procedure with a geometrically unfitted finite element\ndiscretization technique. Additionally, Nitsche's method is utilized to enforce\nthe boundary conditions. The paper presents a convergence estimate for several\nvelocity--pressure elements that are inf-sup stable. The estimate demonstrates\noptimal order convergence in the energy norm for the velocity component and a\nscaled $L^2(H^1)$-type norm for the pressure component.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:37:41 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Neilan","Michael",""],["Olshanskii","Maxim",""]]}
{"id":"2308.01445","submitter":"Marco Tezzele","authors":"Matteo Torzoni and Marco Tezzele and Stefano Mariani and Andrea\n  Manzoni and Karen E. Willcox","title":"A digital twin framework for civil engineering structures","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":"  The digital twin concept represents an appealing opportunity to advance\ncondition-based and predictive maintenance paradigms for civil engineering\nsystems, thus allowing reduced lifecycle costs, increased system safety, and\nincreased system availability. This work proposes a predictive digital twin\napproach to the health monitoring, maintenance, and management planning of\ncivil engineering structures. The asset-twin coupled dynamical system is\nencoded employing a probabilistic graphical model, which allows all relevant\nsources of uncertainty to be taken into account. In particular, the\ntime-repeating observations-to-decisions flow is modeled using a dynamic\nBayesian network. Real-time structural health diagnostics are provided by\nassimilating sensed data with deep learning models. The digital twin state is\ncontinually updated in a sequential Bayesian inference fashion. This is then\nexploited to inform the optimal planning of maintenance and management actions\nwithin a dynamic decision-making framework. A preliminary offline phase\ninvolves the population of training datasets through a reduced-order numerical\nmodel and the computation of a health-dependent control policy. The strategy is\nassessed on two synthetic case studies, involving a cantilever beam and a\nrailway bridge, demonstrating the dynamic decision-making capabilities of\nhealth-aware digital twins.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:38:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Torzoni","Matteo",""],["Tezzele","Marco",""],["Mariani","Stefano",""],["Manzoni","Andrea",""],["Willcox","Karen E.",""]]}
{"id":"2308.01446","submitter":"Yue Ma","authors":"Yue Ma and M. S. Kim","title":"Limitations of quantum error mitigation for open dynamics beyond\n  sampling overhead","comments":"12 pages, 11 figures, including appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum simulation of dynamics is an important goal in the NISQ era, within\nwhich quantum error mitigation may be a viable path towards modifying or\neliminating the effects of noise. Most studies on quantum error mitigation have\nbeen focused on the resource cost due to its exponential scaling in the circuit\ndepth. However, as methods such as probabilistic error cancellation rely on\ndiscretizing the evolution into finite time steps and applying the mitigation\nlayer after each time step, modifying only the noise part without any\nHamiltonian-dependence, there may be Trotter-like errors in the simulation\nresults even if the error mitigation is implemented ideally, meaning that the\nnumber of samples is taken as infinite. Here we analyze the aforementioned\nerrors which have been largely neglected and show that, they are determined by\nthe commutating relations between the superoperators of the unitary part, the\ndevice noise part and the noise part of the open dynamics to be simulated. We\ninclude both digital quantum simulation and analog quantum simulation setups,\nand consider defining the ideal error mitigation map both by exactly inverting\nthe noise channel and by approximating it to the first order in the time step.\nWe take single-qubit toy models to numerically demonstrate our findings. Our\nresults illustrate fundamental limitations of applying quantum error mitigation\nmethods in a stepwise manner to continuous dynamics, thus motivating the\ninvestigations of truly time-continuous error cancellation methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:45:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ma","Yue",""],["Kim","M. S.",""]]}
{"id":"2308.01447","submitter":"Ko Arimatsu","authors":"Ko Arimatsu, Kohji Tsumura, Fumihiko Usui, and Jun-ichi Watanabe","title":"Cloud reflection modelling for impact flashes on Jupiter: A new\n  constraint on the bulk properties of the impact objects","comments":"6 pages, 4 figures, accepted for publication in Astronomy &\n  Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate optical characteristics of flashes caused by impacting meter-\nto decameter-sized outer solar system objects on Jupiter and contributions of\nreflected light from surface clouds at visible wavelengths to estimate more\naccurate bulk parameters such as the luminous energy of the flash, the kinetic\nenergy, the mass, and the size of the impact object. Based on the results of\nrecent reflectivity studies of the Jovian surface, we develop a cloud\nreflection model that calculates the contribution of the reflected light\nrelative to that directly from the flash. We compare the apparent luminous\nenergy of the previously reported flashes with the expected cloud reflection\ncontributions to obtain their revised bulk parameters. We found that the cloud\nreflection contributions can be up to 200% of the flux directly from the flash\nand thus can be the most significant uncertainty in the measurement of the bulk\nparameters. The reflection contributions strongly depend on wavelength. With\nour cloud reflection correction, the revised bulk parameters of the previously\nreported flashes are obtained. Our cloud reflection correction provides a\nbetter understanding of the properties of impacting objects on Jupiter and is\ncrucial for ongoing detailed investigations using high-sensitivity and\nmulti-wavelength observation systems such as PONCOTS. It will also be useful\nfor understanding other optical transients in Jupiter's upper atmosphere, such\nas the recently discovered sprite-like events.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:48:29 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Arimatsu","Ko",""],["Tsumura","Kohji",""],["Usui","Fumihiko",""],["Watanabe","Jun-ichi",""]]}
{"id":"2308.01448","submitter":"Robert Haslhofer","authors":"Robert Haslhofer","title":"On $\\kappa$-solutions and canonical neighborhoods in 4d Ricci flow","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a classification conjecture for $\\kappa$-solutions in 4d Ricci\nflow. Our conjectured list includes known examples from the literature, but\nalso a new 1-parameter family of $\\mathbb{Z}_2^2\\times \\mathrm{O}_3$-symmetric\nbubble-sheet ovals that we construct. We observe that some special cases of the\nconjecture follow from recent results in the literature. We also introduce a\nstronger variant of the classification conjecture for ancient asymptotically\ncylindrical 4d Ricci flows, which does not assume smoothness and nonnegative\ncurvature operator a priori. Assuming this stronger variant holds true, we\nestablish a canonical neighborhood theorem for 4d Ricci flow through\ncylindrical singularities, which shares some elements in common with Perelman's\ncanonical neighborhood theorem for 3d Ricci flow as well as the mean-convex\nneighborhood theorem for mean curvature flow through neck-singularities.\nFinally, we argue that quotient-necks lead to new phenomena, and sketch an\nexample of non-uniqueness for 4d Ricci flow through singularities.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:50:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Haslhofer","Robert",""]]}
{"id":"2308.01449","submitter":"Fernando Cortez","authors":"Manuel Fernando Cortez, Oscar Jarrin","title":"Sharp well-posedness and spatial decaying for a generalized\n  dispersive-dissipative Kuramoto-type equation and applications to related\n  models","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a fairly general dispersive-dissipative nonlinear equation,\nwhich is characterized by fractional Laplacian operators in both the dispersive\nand dissipative terms. This equation includes some physically relevant models\nof fluid dynamics as particular cases. Among them are the \\emph{dispersive\nKuramoto-Velarde}, the \\emph{Kuramoto-Sivashinsky} equation, and some nonlocal\nperturbations of the \\emph{KdV} and the \\emph{Benjamin-Ono} equations. We\nthoroughly study the effects of the fractional Laplacian operators in the\nqualitative study of solutions: on the one hand, we prove a sharp\nwell-posedness result in the framework of Sobolev spaces of negative order, and\non the other hand, we investigate the pointwise decaying properties of\nsolutions in the spatial variable, which are optimal in some cases. These last\nresults are of particular interest for the corresponding physical models.\nPrecisely, they align with previous numerical works on the spatial decay of a\nparticular kind of solutions, commonly referred to as solitary waves.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:52:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cortez","Manuel Fernando",""],["Jarrin","Oscar",""]]}
{"id":"2308.01450","submitter":"Isaac Ross","authors":"R. J. Proulx and I. M. Ross","title":"Implementations of the Universal Birkhoff Theory for Fast Trajectory\n  Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA cs.RO cs.SY eess.SY math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This is part II of a two-part paper. Part I presented a universal Birkhoff\ntheory for fast and accurate trajectory optimization. The theory rested on two\nmain hypotheses. In this paper, it is shown that if the computational grid is\nselected from any one of the Legendre and Chebyshev family of node points, be\nit Lobatto, Radau or Gauss, then, the resulting collection of trajectory\noptimization methods satisfy the hypotheses required for the universal Birkhoff\ntheory to hold. All of these grid points can be generated at an\n$\\mathcal{O}(1)$ computational speed. Furthermore, all Birkhoff-generated\nsolutions can be tested for optimality by a joint application of Pontryagin's-\nand Covector-Mapping Principles, where the latter was developed in Part~I. More\nimportantly, the optimality checks can be performed without resorting to an\nindirect method or even explicitly producing the full differential-algebraic\nboundary value problem that results from an application of Pontryagin's\nPrinciple. Numerical problems are solved to illustrate all these ideas. The\nexamples are chosen to particularly highlight three practically useful features\nof Birkhoff methods: (1) bang-bang optimal controls can be produced without\nsuffering any Gibbs phenomenon, (2) discontinuous and even Dirac delta covector\ntrajectories can be well approximated, and (3) extremal solutions over dense\ngrids can be computed in a stable and efficient manner.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:53:32 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 01:08:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Proulx","R. J.",""],["Ross","I. M.",""]]}
{"id":"2308.01451","submitter":"Anton Orlichenko","authors":"Anton Orlichenko, Gang Qu, Kuan-Jui Su, Anqi Liu, Hui Shen, Hong-Wen\n  Deng, Yu-Ping Wang","title":"Identifiability in Functional Connectivity May Unintentionally Inflate\n  Prediction Results","comments":"8 pages, 11 with references","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Functional magnetic resonance (fMRI) is an invaluable tool in studying\ncognitive processes in vivo. Many recent studies use functional connectivity\n(FC), partial correlation connectivity (PC), or fMRI-derived brain networks to\npredict phenotypes with results that sometimes cannot be replicated. At the\nsame time, FC can be used to identify the same subject from different scans\nwith great accuracy. In this paper, we show a method by which one can\nunknowingly inflate classification results from 61% accuracy to 86% accuracy by\ntreating longitudinal or contemporaneous scans of the same subject as\nindependent data points. Using the UK Biobank dataset, we find one can achieve\nthe same level of variance explained with 50 training subjects by exploiting\nidentifiability as with 10,000 training subjects without double-dipping. We\nreplicate this effect in four different datasets: the UK Biobank (UKB), the\nPhiladelphia Neurodevelopmental Cohort (PNC), the Bipolar and Schizophrenia\nNetwork for Intermediate Phenotypes (BSNIP), and an OpenNeuro Fibromyalgia\ndataset (Fibro). The unintentional improvement ranges between 7% and 25% in the\nfour datasets. Additionally, we find that by using dynamic functional\nconnectivity (dFC), one can apply this method even when one is limited to a\nsingle scan per subject. One major problem is that features such as ROIs or\nconnectivities that are reported alongside inflated results may confuse future\nwork. This article hopes to shed light on how even minor pipeline anomalies may\nlead to unexpectedly superb results.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:59:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Orlichenko","Anton",""],["Qu","Gang",""],["Su","Kuan-Jui",""],["Liu","Anqi",""],["Shen","Hui",""],["Deng","Hong-Wen",""],["Wang","Yu-Ping",""]]}
{"id":"2308.01452","submitter":"Phillip Wilson","authors":"Elliott Hughes, Miguel Moyers-Gonzalez, Rua Murray, Phillip L. Wilson","title":"A Mathematically Robust Model of Exotic Pine Invasions","comments":"36 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Invasive pine trees pose a threat to biodiversity in a variety of Southern\nHemisphere countries, but understanding of the dynamics of invasions and the\nfactors that retard or accelerate spread is limited. Here, we consider the past\nmodels of wilding pine spread and develop a new model of pine invasion. We show\nthat many prior models feature parameter estimates which are not biologically\nsupported and rely on a conjecture to obtain an asymptotic spread speed of\ninvasive pine populations, the main output of these models. In contrast to\nprior approaches, we use partial differential equations to model an invasion.\nWe show that invasions are almost static for a significant period of time\nbefore rapidly accelerating to spread at a constant rate, matching observed\nbehaviour in at least some field sites. Our work suggests that prior methods\nfor estimating invasion speeds may not accurately predict spread and are\nsensitive to assumptions about the distribution of parameters. However, we\npresent alternative estimation methods and suggest directions for further\nresearch.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:59:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hughes","Elliott",""],["Moyers-Gonzalez","Miguel",""],["Murray","Rua",""],["Wilson","Phillip L.",""]]}
{"id":"2308.01453","submitter":"Siqi Wu","authors":"Cai Yang, Lexing Xie, Siqi Wu","title":"The Shapes of the Fourth Estate During the Pandemic: Profiling COVID-19\n  News Consumption in Eight Countries","comments":"Accepted into CSCW 2023, the code and datasets are publicly available\n  at https://github.com/computationalmedia/media_landscape","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  News media is often referred to as the Fourth Estate, a recognition of its\npolitical power. New understandings of how media shape political beliefs and\ninfluence collective behaviors are urgently needed in an era when public\nopinion polls do not necessarily reflect election results and users influence\neach other in real-time under algorithm-mediated content personalization. In\nthis work, we measure not only the average but also the distribution of\naudience political leanings for different media across different countries. The\nmethodological components of these new measures include a high-fidelity\nCOVID-19 tweet dataset; high-precision user geolocation extraction; and user\npolitical leaning estimated from the within-country retweet networks involving\nlocal politicians. We focus on geolocated users from eight countries, profile\nuser leaning distribution for each country, and analyze bridging users who have\ninteractions across multiple countries. Except for France and Turkey, we\nobserve consistent bi-modal user leaning distributions in the other six\ncountries, and find that cross-country retweeting behaviors do not oscillate\nacross the partisan divide. More importantly, this study contributes a new set\nof media bias estimates by averaging the leaning scores of users who share the\nURLs from media domains. Through two validations, we find that the new average\naudience leaning scores strongly correlate with existing media bias scores.\nLastly, we profile the COVID-19 news consumption by examining the audience\nleaning distribution for top media in each country, and for selected media\nacross all countries. Those analyses help answer questions such as: Does center\nmedia Reuters have a more balanced audience base than partisan media CNN in the\nUS? Does far-right media Breitbart attract any left-leaning readers in any\ncountries? Does CNN reach a more balanced audience base in the US than in the\nUK?\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:00:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yang","Cai",""],["Xie","Lexing",""],["Wu","Siqi",""]]}
{"id":"2308.01454","submitter":"Jose Manuel Almenara Villa","authors":"J.M. Almenara, X. Bonfils, E. M. Bryant, A. Jord\\'an, G. H\\'ebrard, E.\n  Martioli, A. C. M. Correia, N. Astudillo-Defru, C. Cadieux, L. Arnold, \\'E.\n  Artigau, G.\\'A. Bakos, S.C.C. Barros, D. Bayliss, F. Bouchy, G. Bou\\'e, R.\n  Brahm, A. Carmona, D. Charbonneau, D.R. Ciardi, R. Cloutier, M. Cointepas,\n  N.J. Cook, N.B. Cowan, X. Delfosse, J. Dias do Nascimento, J.-F. Donati, R.\n  Doyon, T. Forveille, P. Fouqu\\'e, E. Gaidos, E.A. Gilbert, J. Gomes da Silva,\n  J.D. Hartman, K. Hesse, M.J. Hobson, J.M. Jenkins, F. Kiefer, V.B. Kostov, J.\n  Laskar, M. Lendl, A. L'Heureux, J.H.C. Martins, K. Menou, C. Moutou, F.\n  Murgas, A.S. Polanski, D. Rapetti, E. Sedaghati, H. Shang","title":"TOI-4860 b, a short-period giant planet transiting an M3.5 dwarf","comments":"16 pages, 14 figures, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the discovery and characterisation of a giant transiting planet\norbiting around a nearby M3.5V dwarf (d = 80.4 pc, G = 15.1 mag, K=11.2 mag,\nR$_\\star$ = 0.354 $\\pm$ 0.011 R$_\\odot$, M$_\\star$ = 0.3400 $\\pm$ 0.0086\nM$_\\odot$). Using the photometric time series from the Transiting Exoplanet\nSurvey Satellite (TESS) sectors 10, 36, 46, and 63, and near-infrared\nspectrophotometry from ExTrA, we measured a planetary radius of 0.766 $\\pm$\n0.026 R$_J$ and an orbital period of 1.52 days. With high-resolution\nspectroscopy taken by the CFHT/SPIRou and ESO/ESPRESSO spectrographs, we\nrefined the host star parameters ([Fe/H] = 0.27 $\\pm$ 0.12) and measured the\nmass of the planet (0.2729 $\\pm$ 0.0058 M$_J$). Based on these measurements,\nTOI- 4860 b joins the small set of massive planets found around mid-to-late M\ndwarfs (< 0.4 R$_\\odot$), providing both an interesting challenge to planet\nformation theory and a favourable target for further atmospheric studies with\ntransmission spectroscopy. We identify an additional signal in the radial\nvelocity data that we attribute to an eccentric (e = 0.657 $\\pm$ 0.089) planet\ncandidate with an orbital period of 426.9 $\\pm$ 7.4 days and a minimum mass of\n1.66 $\\pm$ 0.26 M$_J$.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:05:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Almenara","J. M.",""],["Bonfils","X.",""],["Bryant","E. M.",""],["Jord\u00e1n","A.",""],["H\u00e9brard","G.",""],["Martioli","E.",""],["Correia","A. C. M.",""],["Astudillo-Defru","N.",""],["Cadieux","C.",""],["Arnold","L.",""],["Artigau","\u00c9.",""],["Bakos","G. \u00c1.",""],["Barros","S. C. C.",""],["Bayliss","D.",""],["Bouchy","F.",""],["Bou\u00e9","G.",""],["Brahm","R.",""],["Carmona","A.",""],["Charbonneau","D.",""],["Ciardi","D. R.",""],["Cloutier","R.",""],["Cointepas","M.",""],["Cook","N. J.",""],["Cowan","N. B.",""],["Delfosse","X.",""],["Nascimento","J. Dias do",""],["Donati","J. -F.",""],["Doyon","R.",""],["Forveille","T.",""],["Fouqu\u00e9","P.",""],["Gaidos","E.",""],["Gilbert","E. A.",""],["da Silva","J. Gomes",""],["Hartman","J. D.",""],["Hesse","K.",""],["Hobson","M. J.",""],["Jenkins","J. M.",""],["Kiefer","F.",""],["Kostov","V. B.",""],["Laskar","J.",""],["Lendl","M.",""],["L'Heureux","A.",""],["Martins","J. H. C.",""],["Menou","K.",""],["Moutou","C.",""],["Murgas","F.",""],["Polanski","A. S.",""],["Rapetti","D.",""],["Sedaghati","E.",""],["Shang","H.",""]]}
{"id":"2308.01455","submitter":"Petr Sulc","authors":"Michael Matthies, Matthew Sample, Petr \\v{S}ulc","title":"Coarse-grained simulations of DNA and RNA systems with oxDNA and oxRNA\n  models: Introductory tutorial","comments":"submitted to Winter Simulation Conference (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph physics.comp-ph physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a tutorial on setting-up the oxDNA coarse-grained model for\nsimulations of DNA and RNA nanotechnology. The model is a popular tool used\nboth by theorists and experimentalists to simulate nucleic acid systems both in\nbiology and nanotechnology settings. The tutorial is aimed at new users asking\n\"Where should I start if I want to use oxDNA\". We assume no prior background in\nusing the model. This tutorial shows basic examples that can get a novice user\nstarted with the model, and points the prospective user towards additional\nreading and online resources depending on which aspect of the model they are\ninterested in pursuing.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:07:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Matthies","Michael",""],["Sample","Matthew",""],["\u0160ulc","Petr",""]]}
{"id":"2308.01456","submitter":"Rose McCarty","authors":"Rose McCarty","title":"Decomposing a signed graph into rooted circuits","comments":"22 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a precise min-max theorem for the following problem. Let $G$ be an\nEulerian graph with a specified set of edges $S \\subseteq E(G)$, and let $b$ be\na vertex of $G$. Then what is the maximum integer $k$ so that the edge-set of\n$G$ can be partitioned into $k$ non-zero $b$-trails? That is, each trail must\nbegin and end at $b$ and contain an odd number of edges from $S$. This theorem\nis motivated by a connection to vertex-minors and yields two conjectures of\nM\\'{a}\\v{c}ajov\\'{a} and \\v{S}koviera as corollaries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:12:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["McCarty","Rose",""]]}
{"id":"2308.01457","submitter":"Paul Escapil-Inchausp\\'e","authors":"Paul Escapil-Inchausp\\'e and Carlos Jerez-Hanckes","title":"Shape Uncertainty Quantification for Electromagnetic Wave Scattering via\n  First-Order Sparse Boundary Element Approximation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantifying the effects on electromagnetic waves scattered by objects of\nuncertain shape is key for robust design, particularly in high precision\napplications. Assuming small random perturbations departing from a nominal\ndomain, the first-order sparse boundary element method (FOSB) has been proven\nto directly compute statistical moments with poly-logarithmic complexity for a\nprescribed accuracy, without resorting to computationally intense Monte Carlo\nsimulations. However, implementing the FOSB is not straightforward. To this\nend, we introduce an easy-to-use with open-source framework to directly apply\nthe technique when dealing with complex objects. Exhaustive computational\nexperiments confirm our claims and demonstrate the technique's applicability as\nwell as provide pathways for further improvement.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:16:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Escapil-Inchausp\u00e9","Paul",""],["Jerez-Hanckes","Carlos",""]]}
{"id":"2308.01458","submitter":"Daisy Yi Ding","authors":"Daisy Yi Ding, Xiaotao Shen, Michael Snyder, Robert Tibshirani","title":"Semi-supervised Cooperative Learning for Multiomics Data Fusion","comments":"The 2023 ICML Workshop on Machine Learning for Multimodal Healthcare\n  Data. arXiv admin note: text overlap with arXiv:2112.12337","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM q-bio.GN stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multiomics data fusion integrates diverse data modalities, ranging from\ntranscriptomics to proteomics, to gain a comprehensive understanding of\nbiological systems and enhance predictions on outcomes of interest related to\ndisease phenotypes and treatment responses. Cooperative learning, a recently\nproposed method, unifies the commonly-used fusion approaches, including early\nand late fusion, and offers a systematic framework for leveraging the shared\nunderlying relationships across omics to strengthen signals. However, the\nchallenge of acquiring large-scale labeled data remains, and there are cases\nwhere multiomics data are available but in the absence of annotated labels. To\nharness the potential of unlabeled multiomcis data, we introduce\nsemi-supervised cooperative learning. By utilizing an \"agreement penalty\", our\nmethod incorporates the additional unlabeled data in the learning process and\nachieves consistently superior predictive performance on simulated data and a\nreal multiomics study of aging. It offers an effective solution to multiomics\ndata fusion in settings with both labeled and unlabeled data and maximizes the\nutility of available data resources, with the potential of significantly\nimproving predictive models for diagnostics and therapeutics in an increasingly\nmultiomics world.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:18:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ding","Daisy Yi",""],["Shen","Xiaotao",""],["Snyder","Michael",""],["Tibshirani","Robert",""]]}
{"id":"2308.01459","submitter":"Marcos M Tirador","authors":"Caroline Liu, Pedro Rodriguez and Marcos Tirador","title":"Atomicity in Rank-2 Lattice Monoids","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $M$ be a cancellative and commutative monoid (written additively). The\nmonoid $M$ is atomic if every non-invertible element can be written as a sum of\nirreducible elements (often called atoms in the literature). Weaker versions of\natomicity have been recently introduced and investigated, including the\nproperties of being nearly atomic, almost atomic, quasi-atomic, and\nFurstenberg. In this paper, we investigate the atomic structure of lattice\nmonoids, (i.e., submonoids of a finite-rank free abelian group), putting\nspecial emphasis on the four mentioned atomic properties.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:23:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Caroline",""],["Rodriguez","Pedro",""],["Tirador","Marcos",""]]}
{"id":"2308.01460","submitter":"Bernd Schober","authors":"Sabrina Alexandra Gaube, Bernd Schober","title":"Desingularization of generic symmetric and generic skew-symmetric\n  determinantal singularities","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss how to resolve generic skew-symmetric and generic symmetric\ndeterminantal singularities. The key ingredients are (skew-) symmetry\npreserving matrix operations in order to deduce an inductive argument.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:24:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gaube","Sabrina Alexandra",""],["Schober","Bernd",""]]}
{"id":"2308.01461","submitter":"Magdalena Prorok","authors":"Sebastian Babi\\'nski, Andrzej Grzesik, Magdalena Prorok","title":"Directed graphs without rainbow triangles","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the most fundamental results in graph theory is Mantel's theorem which\ndetermines the maximum number of edges in a triangle-free graph of order $n$.\nRecently a colorful variant of this problem has been solved. In such a variant\nwe consider $c$ graphs on a common vertex set, thinking of each graph as edges\nin a distinct color, and want to determine the smallest number of edges in each\ncolor which guarantees existence of a rainbow triangle. Here, we solve the\nanalogous problem for directed graphs without rainbow triangles, either\ndirected or transitive, for any number of colors. The constructions and proofs\nessentially differ for $c=3$ and $c \\geq 4$ and the type of the forbidden\ntriangle. Additionally, we also solve the analogous problem in the setting of\noriented graphs.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:29:02 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 19:48:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Babi\u0144ski","Sebastian",""],["Grzesik","Andrzej",""],["Prorok","Magdalena",""]]}
{"id":"2308.01462","submitter":"Roc\\'io D\\'iaz Mart\\'in","authors":"Akram Aldroubi, Rocio Diaz Martin, Ivan Medri","title":"Dynamical Sampling for the Recovery of Spatially Constant Source Terms\n  in Dynamical Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we investigate the problem of source recovery in a dynamical\nsystem utilizing space-time samples. This is a specific issue within the\nbroader field of dynamical sampling, which involves collecting samples from\nsolutions to a differential equation across both space and time with the aim of\nrecovering critical data, such as initial values, the sources, the driving\noperator, or other relevant details. Our focus in this study is the recovery of\nunknown, stationary sources across both space and time, leveraging space-time\nsamples. This research may have significant applications; for instance, it\ncould provide a model for strategically placing devices to measure the quantity\nof pollutants emanating from factory smokestacks and dispersing across a\nspecific area. Space-time samples could be collected using measuring devices\nplaced at various spatial locations and activated at different times. We\npresent necessary and sufficient conditions for the positioning of these\nmeasuring devices to successfully resolve this dynamical sampling problem. This\npaper provides both a theoretical foundation for the recovery of sources in\ndynamical systems and potential practical applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:46:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Aldroubi","Akram",""],["Martin","Rocio Diaz",""],["Medri","Ivan",""]]}
{"id":"2308.01463","submitter":"Zian Liu","authors":"Zian Liu, Zhi Zhang, Siqi Ma, Dongxi Liu, Jun Zhang, Chao Chen,\n  Shigang Liu, Muhammad Ejaz Ahmed, Yang Xiang","title":"SemDiff: Binary Similarity Detection by Diffing Key-Semantics Graphs","comments":"12 pages, conference paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Binary similarity detection is a critical technique that has been applied in\nmany real-world scenarios where source code is not available, e.g., bug search,\nmalware analysis, and code plagiarism detection. Existing works are ineffective\nin detecting similar binaries in cases where different compiling optimizations,\ncompilers, source code versions, or obfuscation are deployed.\n  We observe that all the cases do not change a binary's key code behaviors\nalthough they significantly modify its syntax and structure. With this key\nobservation, we extract a set of key instructions from a binary to capture its\nkey code behaviors. By detecting the similarity between two binaries' key\ninstructions, we can address well the ineffectiveness limitation of existing\nworks. Specifically, we translate each extracted key instruction into a\nself-defined key expression, generating a key-semantics graph based on the\nbinary's control flow. Each node in the key-semantics graph denotes a key\ninstruction, and the node attribute is the key expression. To quantify the\nsimilarity between two given key-semantics graphs, we first serialize each\ngraph into a sequence of key expressions by topological sort. Then, we tokenize\nand concatenate key expressions to generate token lists. We calculate the\nlocality-sensitive hash value for all token lists and quantify their\nsimilarity. %We implement a prototype, called SemDiff, consisting of two\nmodules: graph generation and graph diffing. The first module generates a pair\nof key-semantics graphs and the second module diffs the graphs. Our evaluation\nresults show that overall, SemDiff outperforms state-of-the-art tools when\ndetecting the similarity of binaries generated from different optimization\nlevels, compilers, and obfuscations. SemDiff is also effective for library\nversion search and finding similar vulnerabilities in firmware.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:48:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Zian",""],["Zhang","Zhi",""],["Ma","Siqi",""],["Liu","Dongxi",""],["Zhang","Jun",""],["Chen","Chao",""],["Liu","Shigang",""],["Ahmed","Muhammad Ejaz",""],["Xiang","Yang",""]]}
{"id":"2308.01464","submitter":"Christopher Riseley","authors":"C. J. Riseley, N. Biava, G. Lusetti, A. Bonafede, E. Bonnassieux, A.\n  Botteon, F. Loi, G. Brunetti, R. Cassano, E. Osinga, K. Rajpurohit, H. J. A.\n  Rottgering, T. Shimwell, R. Timmerman, R. J. van Weeren","title":"A MeerKAT-meets-LOFAR study of Abell 1413: a moderately disturbed\n  non-cool-core cluster hosting a $\\sim 500$ kpc 'mini'-halo","comments":"19 pages, 11 figures, 4 tables. Accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2218","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many relaxed cool-core clusters host diffuse radio emission on scales of\nhundreds of kiloparsecs: mini-haloes. However, the mechanism responsible for\ngenerating them, as well as their connection with central active galactic\nnuclei, is elusive and many questions related to their physical properties and\norigins remain unanswered. This paper presents new radio observations of the\ngalaxy cluster Abell 1413 performed with MeerKAT (L-band; 872 to 1712 MHz) and\nLOFAR HBA (120 to 168 MHz) as part of a statistical and homogeneous census of\nmini-haloes. Abell 1413 is unique among mini-halo clusters as it is a\nmoderately-disturbed non-cool-core cluster. Our study reveals an asymmetric\nmini-halo up to 584 kpc in size at 1283 MHz, twice as large as first reported\nat similar frequencies. The spectral index is flatter than previously reported,\nwith an integrated value of $\\alpha = -1.01 \\pm 0.06$, shows significant\nspatial variation, and a tentative radial steepening. We studied the\npoint-to-point X-ray/radio surface brightness correlation to investigate the\nthermal/non-thermal connection: our results show a strong connection between\nthese components, with a super-linear slope of $b = 1.63 \\pm 0.10$ at 1283 MHz\nand $b = 1.20 \\pm 0.12$ at 145 MHz. We also explore the X-ray surface\nbrightness/radio spectral index correlation, finding a slope of $b = 0.59 \\pm\n0.11$. Both investigations support the evidence of spectral steepening.\nFinally, in the context of understanding the particle acceleration mechanism,\nwe present a simple theoretical model which demonstrates that hybrid scenarios\n- secondary electrons (re-)accelerated by turbulence - reproduce a super-linear\ncorrelation slope.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:53:31 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Riseley","C. J.",""],["Biava","N.",""],["Lusetti","G.",""],["Bonafede","A.",""],["Bonnassieux","E.",""],["Botteon","A.",""],["Loi","F.",""],["Brunetti","G.",""],["Cassano","R.",""],["Osinga","E.",""],["Rajpurohit","K.",""],["Rottgering","H. J. A.",""],["Shimwell","T.",""],["Timmerman","R.",""],["van Weeren","R. J.",""]]}
{"id":"2308.01465","submitter":"Charlotte Zimmerman","authors":"Charlotte Zimmerman, Alexis Olsho, Michael Loverude, Suzanne White\n  Brahmia","title":"Empirical evidence of the inseparability of mathematics and physics in\n  expert reasoning about novel graphing tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pre-college mathematics modeling instruction often frames mathematics as\nbeing separated from reasoning about the real world -- and commonly treats\nreasoning mathematically and reasoning about the real-world context as separate\nstages of a modeling cycle. In this paper, we present evidence that helps\ncharacterize how experts use mathematics in physics contexts while developing\ngraphical models. An important finding is that there was essentially no\nevidence of experts reasoning in a context-free way with these tasks, but\ninstead they used physical reasoning -- either grounded in the context of the\ntask or from abstract physical models -- to guide their mathematics. The\ndifference in approach of physics instructors and students may lead to a\nmismatch in expectations, and frustration, for both parties. This work\ncontributes to the body of knowledge about how mathematical reasoning appears\nin physics, and can help researchers and instructors recognize the connections\nto the physical world in expert mathematical reasoning. This can help\ninstructors and researchers be better equipped to develop materials and methods\nthat can help students start building those connections as well.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:53:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zimmerman","Charlotte",""],["Olsho","Alexis",""],["Loverude","Michael",""],["Brahmia","Suzanne White",""]]}
{"id":"2308.01466","submitter":"Pierce Howell","authors":"Pierce Howell, Jack Kolb, Yifan Liu, Harish Ravichandar","title":"The Effects of Robot Motion on Comfort Dynamics of Novice Users in\n  Close-Proximity Human-Robot Interaction","comments":"Accepted to The 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS). Additional Info: 6 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Effective and fluent close-proximity human-robot interaction requires\nunderstanding how humans get habituated to robots and how robot motion affects\nhuman comfort. While prior work has identified humans' preferences over robot\nmotion characteristics and studied their influence on comfort, we are yet to\nunderstand how novice first-time robot users get habituated to robots and how\nrobot motion impacts the dynamics of comfort over repeated interactions. To\ntake the first step towards such understanding, we carry out a user study to\ninvestigate the connections between robot motion and user comfort and\nhabituation. Specifically, we study the influence of workspace overlap,\nend-effector speed, and robot motion legibility on overall comfort and its\nevolution over repeated interactions. Our analyses reveal that workspace\noverlap, in contrast to speed and legibility, has a significant impact on\nusers' perceived comfort and habituation. In particular, lower workspace\noverlap leads to users reporting significantly higher overall comfort, lower\nvariations in comfort, and fewer fluctuations in comfort levels during\nhabituation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:54:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Howell","Pierce",""],["Kolb","Jack",""],["Liu","Yifan",""],["Ravichandar","Harish",""]]}
{"id":"2308.01467","submitter":"Julia Slipantschuk","authors":"Oscar F. Bandtlow, Wolfram Just and Julia Slipantschuk","title":"EDMD for expanding circle maps and their complex perturbations","comments":"18 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that spectral data of the Koopman operator arising from an analytic\nexpanding circle map $\\tau$ can be effectively calculated using an EDMD-type\nalgorithm combining a collocation method of order m with a Galerkin method of\norder n. The main result is that if $m \\geq \\delta n$, where $\\delta$ is an\nexplicitly given positive number quantifying by how much $\\tau$ expands\nconcentric annuli containing the unit circle, then the method converges and\napproximates the spectrum of the Koopman operator, taken to be acting on a\nspace of analytic hyperfunctions, exponentially fast in n. Additionally, these\nresults extend to more general expansive maps on suitable annuli containing the\nunit circle.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:07:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bandtlow","Oscar F.",""],["Just","Wolfram",""],["Slipantschuk","Julia",""]]}
{"id":"2308.01468","submitter":"Veronika Chobanova","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, D. Bacher, I. Bachiller Perea, S. Bachmann, M.\n  Bachmayer, J.J. Back, A. Bailly-reyre, P. Baladron Rodriguez, V. Balagura, W.\n  Baldini, J. Baptista de Souza Leite, M. Barbetti, I. R. Barbosa, R.J. Barlow,\n  S. Barsuk, W. Barter, M. Bartolini, F. Baryshnikov, J.M. Basels, G. Bassi, B.\n  Batsukh, A. Battig, A. Bay, A. Beck, M. Becker, F. Bedeschi, I.B. Bediaga, A.\n  Beiter, 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, L. Grazette, G. Graziani, A. T. Grecu, L.M. Greeven,\n  N.A. Grieser, L. Grillo, S. Gromov, C. Gu, M. Guarise, M. Guittiere, V.\n  Guliaeva, P. A. G\\\"unther, A.K. Guseinov, E. Gushchin, Y. Guz, T. Gys, T.\n  Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, J. Haimberger, S.C.\n  Haines, M. Hajheidari, T. Halewood-leagas, M.M. Halvorsen, P.M. Hamilton, J.\n  Hammerich, Q. Han, X. Han, S. Hansmann-Menzemer, L. Hao, N. Harnew, T.\n  Harrison, M. Hartmann, C. Hasse, M. Hatch, J. He, K. Heijhoff, F. Hemmer, C.\n  Henderson, R.D.L. Henderson, A.M. Hennequin, K. Hennessy, L. Henry, J. Herd,\n  J. Heuel, A. Hicheur, D. Hill, M. Hilton, S.E. Hollitt, J. Horswill, R. Hou,\n  Y. Hou, N. Howarth, J. Hu, J. Hu, W. Hu, X. Hu, W. Huang, X. Huang, W.\n  Hulsbergen, R.J. Hunter, M. Hushchyn, D. Hutchcroft, P. Ibis, M. Idzik, D.\n  Ilin, P. Ilten, A. Inglessi, A. Iniukhin, A. Ishteev, K. Ivshin, R.\n  Jacobsson, H. Jage, S.J. Jaimes Elles, S. Jakobsen, E. Jans, B.K. Jashal, A.\n  Jawahery, V. Jevtic, E. Jiang, X. Jiang, Y. Jiang, Y. J. Jiang, M. John, D.\n  Johnson, C.R. Jones, T.P. Jones, S. Joshi, B. Jost, N. Jurik, I. Juszczak, D.\n  Kaminaris, S. Kandybei, Y. Kang, M. Karacson, D. Karpenkov, M. Karpov, A. M.\n  Kauniskangas, J.W. Kautz, F. Keizer, D.M. Keller, M. Kenzie, T. Ketel, B.\n  Khanji, A. Kharisova, S. Kholodenko, G. Khreich, T. Kirn, V.S. Kirsebom, O.\n  Kitouni, S. Klaver, N. Kleijne, K. Klimaszewski, M.R. Kmiec, S. Koliiev, L.\n  Kolk, A. Konoplyannikov, P. Kopciewicz, R. Kopecna, P. Koppenburg, M.\n  Korolev, I. Kostiuk, O. Kot, S. Kotriakhova, A. Kozachuk, P. Kravchenko, L.\n  Kravchuk, M. Kreps, S. Kretzschmar, P. Krokovny, W. Krupa, W. Krzemien, J.\n  Kubat, S. Kubis, W. Kucewicz, M. Kucharczyk, V. Kudryavtsev, E. Kulikova, A.\n  Kupsc, B. K. Kutsenko, D. Lacarrere, G. Lafferty, A. Lai, A. Lampis, D.\n  Lancierini, C. Landesa Gomez, J.J. Lane, R. Lane, C. Langenbruch, J. Langer,\n  O. Lantwin, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, S.H. Lee, R.\n  Lef\\`evre, A. Leflat, S. Legotin, O. Leroy, T. Lesiak, B. Leverington, A. Li,\n  H. Li, K. Li, L. Li, P. Li, P.-R. Li, S. Li, T. Li, T. Li, Y. Li, Z. Li, Z.\n  Lian, X. Liang, C. Lin, T. Lin, R. Lindner, V. Lisovskyi, R. Litvinov, G.\n  Liu, H. Liu, K. Liu, Q. Liu, S. Liu, Y. Liu, Y. Liu, A. Lobo Salvia, A. Loi,\n  J. Lomba Castro, T. Long, I. Longstaff, J.H. Lopes, A. Lopez Huertas, S.\n  L\\'opez Soli\\~no, G.H. Lovell, Y. Lu, C. Lucarelli, D. Lucchesi, S. Luchuk,\n  M. Lucio Martinez, V. Lukashenko, Y. Luo, A. Lupato, E. Luppi, K. Lynch,\n  X.-R. Lyu, R. Ma, S. Maccolini, F. Machefert, F. Maciuc, I. Mackay, L.R.\n  Madhan Mohan, M. M. Madurai, A. Maevskiy, D. Magdalinski, D. Maisuzenko, M.W.\n  Majewski, J.J. Malczewski, S. Malde, B. Malecki, L. Malentacca, A. Malinin,\n  T. Maltsev, G. Manca, G. Mancinelli, C. Mancuso, R. Manera Escalero, D.\n  Manuzzi, C.A. Manzari, D. Marangotto, J.F. Marchand, U. Marconi, S. Mariani,\n  C. Marin Benito, J. Marks, A.M. Marshall, P.J. Marshall, G. Martelli, G.\n  Martellotti, L. Martinazzoli, M. Martinelli, D. Martinez Santos, F. Martinez\n  Vidal, A. Massafferri, M. Materok, R. Matev, A. Mathad, V. Matiunin, C.\n  Matteuzzi, K.R. Mattioli, A. Mauri, E. Maurice, J. Mauricio, M. Mazurek, M.\n  McCann, L. Mcconnell, T.H. McGrath, N.T. McHugh, A. McNab, R. McNulty, B.\n  Meadows, G. Meier, D. Melnychuk, M. Merk, A. Merli, L. Meyer Garcia, D. Miao,\n  H. Miao, M. Mikhasenko, D.A. Milanes, M.-N. Minard, A. Minotti, E. Minucci,\n  T. Miralles, S.E. Mitchell, B. Mitreska, D.S. Mitzel, A. Modak, A. M\\\"odden,\n  R.A. Mohammed, R.D. Moise, S. Mokhnenko, T. Momb\\\"acher, M. Monk, I.A.\n  Monroy, S. Monteil, A. Morcillo Gomez, G. Morello, M.J. Morello, M.P.\n  Morgenthaler, J. Moron, A.B. Morris, A.G. Morris, R. Mountain, H. Mu, Z. M.\n  Mu, E. Muhammad, F. Muheim, M. Mulder, K. M\\\"uller, F. M{\\~u}noz-Rojas, R.\n  Murta, P. Naik, T. Nakada, R. Nandakumar, T. Nanut, I. Nasteva, M. Needham,\n  N. Neri, S. Neubert, N. Neufeld, P. Neustroev, R. Newcombe, J. Nicolini, D.\n  Nicotra, E.M. Niel, N. Nikitin, P. Nogga, N.S. Nolte, C. Normand, J. Novoa\n  Fernandez, G. Nowak, C. Nunez, H. N. Nur, A. Oblakowska-Mucha, V. Obraztsov,\n  T. Oeser, S. Okamura, R. Oldeman, F. Oliva, M. Olocco, C.J.G. Onderwater,\n  R.H. O'Neil, J.M. Otalora Goicochea, T. Ovsiannikova, P. Owen, A. Oyanguren,\n  O. Ozcelik, K.O. Padeken, B. Pagare, P.R. Pais, T. Pajero, A. Palano, M.\n  Palutan, G. Panshin, L. Paolucci, A. Papanestis, M. Pappagallo, L.L.\n  Pappalardo, C. Pappenheimer, C. Parkes, B. Passalacqua, G. Passaleva, D.\n  Passaro, A. Pastore, M. Patel, J. Patoc, C. Patrignani, C.J. Pawley, A.\n  Pellegrino, M. Pepe Altarelli, S. Perazzini, D. Pereima, A. Pereiro Castro,\n  P. Perret, A. Perro, K. Petridis, A. Petrolini, S. Petrucci, H. Pham, A.\n  Philippov, L. Pica, M. Piccini, B. Pietrzyk, G. Pietrzyk, D. Pinci, F.\n  Pisani, M. Pizzichemi, V. Placinta, M. Plo Casasus, F. Polci, M. Poli Lener,\n  A. Poluektov, N. Polukhina, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, S.\n  Poslavskii, K. Prasanth, L. Promberger, C. Prouve, V. Pugatch, V. Puill, G.\n  Punzi, H.R. Qi, W. Qian, N. Qin, S. Qu, R. Quagliani, B. Rachwal, J.H.\n  Rademacker, M. Rama, M. Ram\\'irez Garc\\'ia, M. Ramos Pernas, M.S. Rangel, F.\n  Ratnikov, G. Raven, M. Rebollo De Miguel, F. Redi, J. Reich, F. Reiss, Z.\n  Ren, P.K. Resmi, R. Ribatti, G. R. Ricart, D. Riccardi, S. Ricciardi, K.\n  Richardson, M. Richardson-Slipper, K. Rinnert, P. Robbe, G. Robertson, E.\n  Rodrigues, E. Rodriguez Fernandez, J.A. Rodriguez Lopez, E. Rodriguez\n  Rodriguez, A. Rogovskiy, D.L. Rolf, A. Rollings, P. Roloff, V. Romanovskiy,\n  M. Romero Lamas, A. Romero Vidal, G. Romolini, F. Ronchetti, M. Rotondo, M.S.\n  Rudolph, T. Ruf, R.A. Ruiz Fernandez, J. Ruiz Vidal, A. Ryzhikov, J. Ryzka,\n  J.J. Saborido Silva, N. Sagidova, N. Sahoo, B. Saitta, M. Salomoni, C.\n  Sanchez Gras, I. Sanderswood, R. Santacesaria, C. Santamarina Rios, M.\n  Santimaria, L. Santoro, E. Santovetti, D. Saranin, G. Sarpis, M. Sarpis, A.\n  Sarti, C. Satriano, A. Satta, M. Saur, D. Savrina, H. Sazak, L.G. Scantlebury\n  Smead, A. Scarabotto, S. Schael, S. Scherl, A. M. Schertz, M. Schiller, H.\n  Schindler, M. Schmelling, B. Schmidt, S. Schmitt, O. Schneider, A. Schopper,\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, Z. Wang, Z. Wang, Z. Wang, J.A.\n  Ward, N.K. Watson, D. Websdale, Y. Wei, B.D.C. Westhenry, D.J. White, M.\n  Whitehead, A.R. Wiederhold, D. Wiedner, G. Wilkinson, M.K. Wilkinson, I.\n  Williams, M. Williams, M.R.J. Williams, R. Williams, F.F. Wilson, W.\n  Wislicki, M. Witek, L. Witola, C.P. Wong, G. Wormser, S.A. Wotton, H. Wu, J.\n  Wu, Y. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, A. Xu, J. Xu, L. Xu, L. Xu,\n  M. Xu, Z. Xu, Z. Xu, Z. Xu, D. Yang, S. Yang, X. Yang, Y. Yang, Z. Yang, Z.\n  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":"Improved measurement of $CP$ violation parameters in $B^0_s\\to J/\\psi\n  K^{+}K^{-}$ decays in the vicinity of the $\\phi(1020)$ resonance","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-016.html (LHCb\n  public pages)","journal-ref":null,"doi":null,"report-no":"LHCb-PAPER-2023-016, CERN-EP-2023-145 CERN-EP-2023-145;\n  LHCb-PAPER-2023-016","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The decay-time-dependent $CP$ asymmetry in $B^0_s\\to J/\\psi(\\to\n\\mu^{+}\\mu^{-}) K^{+}K^{-}$ decays is measured using proton-proton collision\ndata, corresponding to an integrated luminosity of 6 $fb^{-1}$, collected with\nthe LHCb detector at a center-of-mass energy of 13 TeV. Using a sample of\napproximately 349 000 $B^{0}_{s}$ signal decays with an invariant $K^{+}K^{-}$\nmass in the vicinity of the $\\phi(1020)$ resonance, the $CP$-violating phase\n$\\phi_s$ is measured, along with the difference in decay widths of the light\nand heavy mass eigenstates of the $B^0_s$-$\\bar{B}^0_s$ system,\n$\\Delta\\Gamma_s$, and the difference of the average $B^0_s$ and $B^0$ meson\ndecay widths, $\\Gamma_s-\\Gamma_d$. The values obtained are $\\phi_s = \\ -0.039\n\\pm 0.022 \\pm 0.006$ rad, $\\Delta\\Gamma_s = 0.0845 \\pm 0.0044 \\pm 0.0024 $\nps$^{-1}$ and $\\Gamma_s-\\Gamma_d = -0.0056 ^{+ 0.0013}_{-0.0015} \\pm 0.0014$\nps$^{-1}$, where the first uncertainty is statistical and the second\nsystematic. These are the most precise single measurements to date and are\nconsistent with expectations based on the Standard Model and with the previous\nLHCb analyses of this decay. These results are combined with previous\nindependent LHCb measurements. The phase $\\phi_s$ is also measured\nindependently for each polarization state of the $K^{+}K^{-}$ system and shows\nno evidence for polarization dependence.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:11:20 GMT"}],"update_date":"2023-08-04","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.",""],["Bacher","D.",""],["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.",""],["Grazette","L.",""],["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.",""],["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.",""],["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.",""],["Mohan","L. R. Madhan",""],["Madurai","M. M.",""],["Maevskiy","A.",""],["Magdalinski","D.",""],["Maisuzenko","D.",""],["Majewski","M. W.",""],["Malczewski","J. J.",""],["Malde","S.",""],["Malecki","B.",""],["Malentacca","L.",""],["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.",""],["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.",""],["Gomez","A. Morcillo",""],["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.",""],["M{\u0169}noz-Rojas","F.",""],["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.",""],["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.",""],["Passaro","D.",""],["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.",""],["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.",""],["Riccardi","D.",""],["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",""],["Rogovskiy","A.",""],["Rolf","D. L.",""],["Rollings","A.",""],["Roloff","P.",""],["Romanovskiy","V.",""],["Lamas","M. Romero",""],["Vidal","A. Romero",""],["Romolini","G.",""],["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.",""],["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","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.01469","submitter":"Ruyi Ding","authors":"Ruyi Ding, Shijin Duan, Xiaolin Xu, Yunsi Fei","title":"VertexSerum: Poisoning Graph Neural Networks for Link Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph neural networks (GNNs) have brought superb performance to various\napplications utilizing graph structural data, such as social analysis and fraud\ndetection. The graph links, e.g., social relationships and transaction history,\nare sensitive and valuable information, which raises privacy concerns when\nusing GNNs. To exploit these vulnerabilities, we propose VertexSerum, a novel\ngraph poisoning attack that increases the effectiveness of graph link stealing\nby amplifying the link connectivity leakage. To infer node adjacency more\naccurately, we propose an attention mechanism that can be embedded into the\nlink detection network. Our experiments demonstrate that VertexSerum\nsignificantly outperforms the SOTA link inference attack, improving the AUC\nscores by an average of $9.8\\%$ across four real-world datasets and three\ndifferent GNN structures. Furthermore, our experiments reveal the effectiveness\nof VertexSerum in both black-box and online learning settings, further\nvalidating its applicability in real-world scenarios.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:13:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ding","Ruyi",""],["Duan","Shijin",""],["Xu","Xiaolin",""],["Fei","Yunsi",""]]}
{"id":"2308.01470","submitter":"Marlena Bannick","authors":"Marlena S. Bannick and Noah Simon","title":"Improved convergence rates of nonparametric penalized regression under\n  misspecified total variation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ME stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Penalties that induce smoothness are common in nonparametric regression. In\nmany settings, the amount of smoothness in the data generating function will\nnot be known. Simon and Shojaie (2021) derived convergence rates for\nnonparametric estimators under misspecified smoothness. We show that their\ntheoretical convergence rates can be improved by working with convenient\napproximating functions. Properties of convolutions and higher-order kernels\nallow these approximation functions to match the true functions more closely\nthan those used in Simon and Shojaie (2021). As a result, we obtain tighter\nconvergence rates.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:37:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bannick","Marlena S.",""],["Simon","Noah",""]]}
{"id":"2308.01471","submitter":"Ben Agro","authors":"Ben Agro, Quinlan Sykora, Sergio Casas, Raquel Urtasun","title":"Implicit Occupancy Flow Fields for Perception and Prediction in\n  Self-Driving","comments":"19 pages, 13 figures","journal-ref":"Proceedings of the IEEE/CVF Conference on Computer Vision and\n  Pattern Recognition (CVPR), 2023, pp. 1379-1388","doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A self-driving vehicle (SDV) must be able to perceive its surroundings and\npredict the future behavior of other traffic participants. Existing works\neither perform object detection followed by trajectory forecasting of the\ndetected objects, or predict dense occupancy and flow grids for the whole\nscene. The former poses a safety concern as the number of detections needs to\nbe kept low for efficiency reasons, sacrificing object recall. The latter is\ncomputationally expensive due to the high-dimensionality of the output grid,\nand suffers from the limited receptive field inherent to fully convolutional\nnetworks. Furthermore, both approaches employ many computational resources\npredicting areas or objects that might never be queried by the motion planner.\nThis motivates our unified approach to perception and future prediction that\nimplicitly represents occupancy and flow over time with a single neural\nnetwork. Our method avoids unnecessary computation, as it can be directly\nqueried by the motion planner at continuous spatio-temporal locations.\nMoreover, we design an architecture that overcomes the limited receptive field\nof previous explicit occupancy prediction methods by adding an efficient yet\neffective global attention mechanism. Through extensive experiments in both\nurban and highway settings, we demonstrate that our implicit model outperforms\nthe current state-of-the-art. For more information, visit the project website:\nhttps://waabi.ai/research/implicito.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:39:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Agro","Ben",""],["Sykora","Quinlan",""],["Casas","Sergio",""],["Urtasun","Raquel",""]]}
{"id":"2308.01472","submitter":"Radu Tudor Ionescu","authors":"Florinel-Alin Croitoru, Vlad Hondru, Radu Tudor Ionescu, Mubarak Shah","title":"Reverse Stable Diffusion: What prompt was used to generate this image?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-to-image diffusion models such as Stable Diffusion have recently\nattracted the interest of many researchers, and inverting the diffusion process\ncan play an important role in better understanding the generative process and\nhow to engineer prompts in order to obtain the desired images. To this end, we\nintroduce the new task of predicting the text prompt given an image generated\nby a generative diffusion model. We combine a series of white-box and black-box\nmodels (with and without access to the weights of the diffusion network) to\ndeal with the proposed task. We propose a novel learning framework comprising\nof a joint prompt regression and multi-label vocabulary classification\nobjective that generates improved prompts. To further improve our method, we\nemploy a curriculum learning procedure that promotes the learning of\nimage-prompt pairs with lower labeling noise (i.e. that are better aligned),\nand an unsupervised domain-adaptive kernel learning method that uses the\nsimilarities between samples in the source and target domains as extra\nfeatures. We conduct experiments on the DiffusionDB data set, predicting text\nprompts from images generated by Stable Diffusion. Our novel learning framework\nproduces excellent results on the aforementioned task, yielding the highest\ngains when applied on the white-box model. In addition, we make an interesting\ndiscovery: training a diffusion model on the prompt generation task can make\nthe model generate images that are much better aligned with the input prompts,\nwhen the model is directly reused for text-to-image generation.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:39:29 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Croitoru","Florinel-Alin",""],["Hondru","Vlad",""],["Ionescu","Radu Tudor",""],["Shah","Mubarak",""]]}
{"id":"2308.01473","submitter":"Jingshan Chen","authors":"Jinshan Chen","title":"The minimal and next minimal volumes of normal KSBA stable surfaces with\n  $p_g\\ge 2$","comments":"31 pages, 6 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 investigate the minimal and the next minimal volumes of\nnormal KSBA stable surfaces with $p_g\\ge 2$. We show that in case of $|K_X|$\nnot composed with a pencil, the minimal and next minimal volumes are $2p_g-4$\nand $2p_g-4+\\frac{1}{3}$. In case of $|K_X|$ composed with a pencil, the\nminimal and next minimal volumes are $\\frac{p_g-1}{p_g+1}(p_g-1)$ and\n$\\mathrm{min}\\{\\frac{2p_g-2}{2p_g+1}(p_g-1), \\frac{(3p_g-2)p_g-4}{3(p_g+2)}\\}$.\nWe also characterize the surfaces achieving the minimal volumes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:40:52 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 10:22:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Jinshan",""]]}
{"id":"2308.01474","submitter":"Rabimba Karanjai","authors":"Rabimba Karanjai, Rowan Collier, Zhimin Gao, Lin Chen, Xinxin Fan,\n  Taeweon Suh, Weidong Shi, Lei Xu","title":"Decentralized Translator of Trust: Supporting Heterogeneous TEE for\n  Critical Infrastructure Protection","comments":"Appeared in ACM BSCI'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Trusted execution environment (TEE) technology has found many applications in\nmitigating various security risks in an efficient manner, which is attractive\nfor critical infrastructure protection. First, the natural of critical\ninfrastructure requires it to be well protected from various cyber attacks.\nSecond, performance is usually important for critical infrastructure and it\ncannot afford an expensive protection mechanism. While a large number of\nTEE-based critical infrastructure protection systems have been proposed to\naddress various security challenges (e.g., secure sensing and reliable\ncontrol), most existing works ignore one important feature, i.e., devices\ncomprised the critical infrastructure may be equipped with multiple\nincompatible TEE technologies and belongs to different owners. This feature\nmakes it hard for these devices to establish mutual trust and form a unified\nTEE environment. To address these challenges and fully unleash the potential of\nTEE technology for critical infrastructure protection, we propose DHTee, a\ndecentralized coordination mechanism. DHTee uses blockchain technology to\nsupport key TEE functions in a heterogeneous TEE environment, especially the\nattestation service. A Device equipped with one TEE can interact securely with\nthe blockchain to verify whether another potential collaborating device\nclaiming to have a different TEE meets the security requirements. DHTee is also\nflexible and can support new TEE schemes without affecting devices using\nexisting TEEs that have been supported by the system.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:44:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Karanjai","Rabimba",""],["Collier","Rowan",""],["Gao","Zhimin",""],["Chen","Lin",""],["Fan","Xinxin",""],["Suh","Taeweon",""],["Shi","Weidong",""],["Xu","Lei",""]]}
{"id":"2308.01475","submitter":"Lili Zheng","authors":"Genevera I. Allen, Luqin Gan, Lili Zheng","title":"Interpretable Machine Learning for Discovery: Statistical Challenges \\&\n  Opportunities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  New technologies have led to vast troves of large and complex datasets across\nmany scientific domains and industries. People routinely use machine learning\ntechniques to not only process, visualize, and make predictions from this big\ndata, but also to make data-driven discoveries. These discoveries are often\nmade using Interpretable Machine Learning, or machine learning models and\ntechniques that yield human understandable insights. In this paper, we discuss\nand review the field of interpretable machine learning, focusing especially on\nthe techniques as they are often employed to generate new knowledge or make\ndiscoveries from large data sets. We outline the types of discoveries that can\nbe made using Interpretable Machine Learning in both supervised and\nunsupervised settings. Additionally, we focus on the grand challenge of how to\nvalidate these discoveries in a data-driven manner, which promotes trust in\nmachine learning systems and reproducibility in science. We discuss validation\nfrom both a practical perspective, reviewing approaches based on data-splitting\nand stability, as well as from a theoretical perspective, reviewing statistical\nresults on model selection consistency and uncertainty quantification via\nstatistical inference. Finally, we conclude by highlighting open challenges in\nusing interpretable machine learning techniques to make discoveries, including\ngaps between theory and practice for validating data-driven-discoveries.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:57:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Allen","Genevera I.",""],["Gan","Luqin",""],["Zheng","Lili",""]]}
{"id":"2308.01476","submitter":"Ivan Kostyuk","authors":"Ivan Kostyuk, Benedetta Ciardi and Andrea Ferrara","title":"Physically motivated modeling of LyC escape fraction during reionization","comments":"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 present an analysis of the Lyman continuum (LyC) escape fraction based on\na physically motivated model, and applied to galaxies of the Illustris TNG50\nsimulation in the redshift range $z=5.2-20$. Our study reveals a bimodal nature\nof LyC escape, which is associated either to (a) high metallicity\n($10^{-3.5}<Z<10^{-2}$), low mass ($M_\\star<10^7\\mathrm{M}_\\odot$) galaxies\nexhibiting extended star formation, with photons escaping primarily from the\nouter regions of the galactic disk ({\\it ext}-mode), or (b) low metallicity\n($Z<10^{-3}$), moderately massive galaxies ($M_\\star<10^8\\mathrm{M}_\\odot$)\nwith localized LyC escape originating from small central regions of high star\nformation ({\\it loc}-mode). While the {\\it loc}-mode is present at all\nredshifts under investigation, the {\\it ext}-mode becomes prominent in small\ngalaxies at later cosmic times, once sufficient metal enrichment has occurred.\nBuilding on these findings, we develop an analytical fitting formula to\ndetermine the escape fraction of galaxies based on their stellar and gas mass,\nas well as redshift, providing a valuable subgrid modelling tool for future\nstudies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:59:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kostyuk","Ivan",""],["Ciardi","Benedetta",""],["Ferrara","Andrea",""]]}
{"id":"2308.01477","submitter":"Stan Birchfield","authors":"Andrew Guo, Bowen Wen, Jianhe Yuan, Jonathan Tremblay, Stephen Tyree,\n  Jeffrey Smith, Stan Birchfield","title":"HANDAL: A Dataset of Real-World Manipulable Object Categories with Pose\n  Annotations, Affordances, and Reconstructions","comments":"IROS 2023. Project page: https://nvlabs.github.io/HANDAL/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the HANDAL dataset for category-level object pose estimation and\naffordance prediction. Unlike previous datasets, ours is focused on\nrobotics-ready manipulable objects that are of the proper size and shape for\nfunctional grasping by robot manipulators, such as pliers, utensils, and\nscrewdrivers. Our annotation process is streamlined, requiring only a single\noff-the-shelf camera and semi-automated processing, allowing us to produce\nhigh-quality 3D annotations without crowd-sourcing. The dataset consists of\n308k annotated image frames from 2.2k videos of 212 real-world objects in 17\ncategories. We focus on hardware and kitchen tool objects to facilitate\nresearch in practical scenarios in which a robot manipulator needs to interact\nwith the environment beyond simple pushing or indiscriminate grasping. We\noutline the usefulness of our dataset for 6-DoF category-level pose+scale\nestimation and related tasks. We also provide 3D reconstructed meshes of all\nobjects, and we outline some of the bottlenecks to be addressed for\ndemocratizing the collection of datasets like this one.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:59:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Guo","Andrew",""],["Wen","Bowen",""],["Yuan","Jianhe",""],["Tremblay","Jonathan",""],["Tyree","Stephen",""],["Smith","Jeffrey",""],["Birchfield","Stan",""]]}
{"id":"2308.01478","submitter":"Taro Matsuo","authors":"Taro Matsuo, Felix Dannert, Romain Laugier, Sascha P. Quanz, Andjelka\n  B. Kovacevic, and LIFE collaboration","title":"Large Interferometer For Exoplanets (LIFE): XI. Phase-space synthesis\n  decomposition for planet detection and characterization","comments":"Accepted for publication by A&A - 14 pages main text including 10\n  Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A mid-infrared nulling-space interferometer is a promising way to\ncharacterize thermal light from habitable planet candidates around Sun-like\nstars. However, one of the main challenges for achieving this ambitious goal is\na high-precision stability of the optical path difference (OPD) and amplitude\nover a few days for planet detection and up to a few weeks for in-depth\ncharacterization. Here we propose a new method called phase-space synthesis\ndecomposition (PSSD) to shorten the stability requirement to minutes,\nsignificantly relaxing the technological challenges of the mission. Focusing on\nwhat exactly modulates the planet signal in the presence of the stellar leak\nand systematic error, PSSD prioritizes the modulation of the signals along the\nwavelength domain rather than baseline rotation. Modulation along the\nwavelength domain allows us to extract source positions in parallel to the\nbaseline vector for each exposure. The sum of the one-dimensional data converts\ninto two-dimensional information. Based on the reconstructed image, we\nconstruct a continuous equation and extract the spectra through the singular\nvalue decomposition (SVD) while efficiently separating them from a long-term\nsystematic stellar leak. We performed numerical simulations to investigate the\nfeasibility of PSSD for the LIFE mission concept. We confirm that multiple\nterrestrial planets in the habitable zone around a Sun-like star at 10 pc can\nbe detected and characterized despite high levels and long durations of\nsystematic noise. We also find that PSSD is more robust against a sparse\nsampling of the array rotation compared to purely rotation-based signal\nextraction. Using PSSD as signal extraction method significantly relaxes the\ntechnical requirements on signal stability and further increases the\nfeasibility of the LIFE mission.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:07:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Matsuo","Taro",""],["Dannert","Felix",""],["Laugier","Romain",""],["Quanz","Sascha P.",""],["Kovacevic","Andjelka B.",""],["collaboration","LIFE",""]]}
{"id":"2308.01479","submitter":"Baber Khalid","authors":"Baber Khalid and Matthew Stone","title":"Investigating Reinforcement Learning for Communication Strategies in a\n  Task-Initiative Setting","comments":"Peer-reviewed and Published at IWSDS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many conversational domains require the system to present nuanced information\nto users. Such systems must follow up what they say to address clarification\nquestions and repair misunderstandings. In this work, we explore this\ninteractive strategy in a referential communication task. Using simulation, we\nanalyze the communication trade-offs between initial presentation and\nsubsequent followup as a function of user clarification strategy, and compare\nthe performance of several baseline strategies to policies derived by\nreinforcement learning. We find surprising advantages to coherence-based\nrepresentations of dialogue strategy, which bring minimal data requirements,\nexplainable choices, and strong audit capabilities, but incur little loss in\npredicted outcomes across a wide range of user models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:10:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Khalid","Baber",""],["Stone","Matthew",""]]}
{"id":"2308.01480","submitter":"Gaohang Yu","authors":"Gaohang Yu, Jinhong Feng, Zhongming Chen, Xiaohao Cai, Liqun Qi","title":"A Randomized Block Krylov Method for Tensor Train Approximation","comments":"23 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tensor train decomposition is a powerful tool for dealing with\nhigh-dimensional, large-scale tensor data, which is not suffering from the\ncurse of dimensionality. To accelerate the calculation of the auxiliary\nunfolding matrix, some randomized algorithms have been proposed; however, they\nare not suitable for noisy data. The randomized block Krylov method is capable\nof dealing with heavy-tailed noisy data in the low-rank approximation of\nmatrices. In this paper, we present a randomized algorithm for low-rank tensor\ntrain approximation of large-scale tensors based on randomized block Krylov\nsubspace iteration and provide theoretical guarantees. Numerical experiments on\nsynthetic and real-world tensor data demonstrate the effectiveness of the\nproposed algorithm.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:19:13 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 16:03:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yu","Gaohang",""],["Feng","Jinhong",""],["Chen","Zhongming",""],["Cai","Xiaohao",""],["Qi","Liqun",""]]}
{"id":"2308.01481","submitter":"Abhishek Roy","authors":"Abhishek Roy, Krishnakumar Balasubramanian","title":"Online covariance estimation for stochastic gradient descent under\n  Markovian sampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST cs.LG math.OC stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the online overlapping batch-means covariance estimator for\nStochastic Gradient Descent (SGD) under Markovian sampling. We show that the\nconvergence rates of the covariance estimator are\n$O\\big(\\sqrt{d}\\,n^{-1/8}(\\log n)^{1/4}\\big)$ and\n$O\\big(\\sqrt{d}\\,n^{-1/8}\\big)$ under state-dependent and state-independent\nMarkovian sampling, respectively, with $d$ representing dimensionality and $n$\ndenoting the number of observations or SGD iterations. Remarkably, these rates\nmatch the best-known convergence rate previously established for the\nindependent and identically distributed ($\\iid$) case by \\cite{zhu2021online},\nup to logarithmic factors. Our analysis overcomes significant challenges that\narise due to Markovian sampling, leading to the introduction of additional\nerror terms and complex dependencies between the blocks of the batch-means\ncovariance estimator. Moreover, we establish the convergence rate for the first\nfour moments of the $\\ell_2$ norm of the error of SGD dynamics under\nstate-dependent Markovian data, which holds potential interest as an\nindependent result. To validate our theoretical findings, we provide numerical\nillustrations to derive confidence intervals for SGD when training linear and\nlogistic regression models under Markovian sampling. Additionally, we apply our\napproach to tackle the intriguing problem of strategic classification with\nlogistic regression, where adversaries can adaptively modify features during\nthe training process to increase their chances of being classified in a\nspecific target class.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:21:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Roy","Abhishek",""],["Balasubramanian","Krishnakumar",""]]}
{"id":"2308.01482","submitter":"Amruta Mishra","authors":"Amruta Mishra and Ankit Kumar","title":"Production cross-sections and Radiative Decay widths of Heavy Quarkonia\n  in magnetized matter","comments":"29 pages, 9 figures. arXiv admin note: text overlap with\n  arXiv:2210.09192, arXiv:2208.14962","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We study the production cross-sections and radiative decay widths of heavy\nquarkonia (charmonia and bottomonia) in magnetized nuclear matter. The\nproduction cross-sections of the $\\psi(3770)$ and $\\Upsilon(4S)$ are studied\nfrom the medium modifications of the masses and partial decay widths to open\ncharm (bottom) mesons. The heavy flavour meson masses are computed within a\nchiral effective model, including the effects of the Dirac sea (DS) of\nnucleons. The mixing of the pseudoscalar (P) meson and the longitudinal\ncomponent of the vector (V) meson (PV mixing) due to the presence of the\nmagnetic field are considered in the present study. The radiative decay widths\nof the vector (V) heavy quarkonia to the pseudoscalar (P) mesons\n($J/\\psi\\rightarrow \\eta_c(1S) \\gamma$, $\\psi(2S)\\rightarrow \\eta_c(2S) \\gamma$\nand $\\psi(1D)\\rightarrow \\eta_c(2S) \\gamma$ for the charm sector and\n$\\Upsilon(NS)\\rightarrow \\eta_b(NS)\\gamma$, $N$=1,2,3,4, for the bottom sector)\nin the magnetized asymmetric nuclear matter are also investigated in the\npresent work. The difference in the mass of the transverse component from the\nlongitudinal component of the vector meson, arising due to PV mixing, is\nobserved as a distinct double peak structure in the invariant mass spectrum of\nthe production cross-section of $\\psi(3770)$. The modifications of the\nproduction cross-sections as well as the radiative decay widths of the heavy\nquarkonia in the magnetized matter should have observable consequences on the\nproduction of these heavy flavour mesons resulting from ultra-relativistic\nperipheral heavy ion collision experiments, where the created magnetic field\ncan be extremely large.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:24:45 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mishra","Amruta",""],["Kumar","Ankit",""]]}
{"id":"2308.01483","submitter":"Guillaume Berger","authors":"Antoine Mercier and Ruan Erasmus and Yashesh Savani and Manik Dhingra\n  and Fatih Porikli and Guillaume Berger","title":"Efficient neural supersampling on a novel gaming dataset","comments":"ICCV'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Real-time rendering for video games has become increasingly challenging due\nto the need for higher resolutions, framerates and photorealism. Supersampling\nhas emerged as an effective solution to address this challenge. Our work\nintroduces a novel neural algorithm for supersampling rendered content that is\n4 times more efficient than existing methods while maintaining the same level\nof accuracy. Additionally, we introduce a new dataset which provides auxiliary\nmodalities such as motion vectors and depth generated using graphics rendering\nfeatures like viewport jittering and mipmap biasing at different resolutions.\nWe believe that this dataset fills a gap in the current dataset landscape and\ncan serve as a valuable resource to help measure progress in the field and\nadvance the state-of-the-art in super-resolution techniques for gaming content.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:42:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mercier","Antoine",""],["Erasmus","Ruan",""],["Savani","Yashesh",""],["Dhingra","Manik",""],["Porikli","Fatih",""],["Berger","Guillaume",""]]}
{"id":"2308.01484","submitter":"Jyotirish Das","authors":"Jyotirish Das, Muhammad Akram, Onur Erten","title":"Revival of antibiskyrmionic magnetic phases in bilayer NiI$_2$","comments":"10 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic skyrmions are topologically protected spin textures with potential\napplications in memory and logic devices. Skyrmions have been commonly observed\nin systems with Dzyaloshinskii-Moriya interaction due to broken inversion\nsymmetry. Yet, recent studies suggest that skyrmions can also be stabilized in\nsystems with inversion symmetry such as Ni-based dihalides due to magnetic\nfrustration. In this article, we employ atomistic simulations to investigate\nchiral magnetic phases in bilayers of NiI$_2$ and NiBr$_2$. We show that the\nantiferromagnetic interlayer coupling introduces an additional magnetic\nfrustration and gives rise to a variety of novel spin textures with different\ntopological charges. Specifically for NiI$_2$, we observe that the skyrmions\nwith the in-plane component of spins wrapping around twice (biskyrmions) have\nan enhanced stability compared to the monolayer case. We also study the\npolarization induced by the non-colinear magnetic order in NiI$_2$ bilayers and\nshow that the polarization of the topologically nontrivial phases is negligible\ncompared to the spiral phases. Thus, we conclude that polarization measurements\ncan be an indirect route for detecting skyrmions in upcoming experiments.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:45:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Das","Jyotirish",""],["Akram","Muhammad",""],["Erten","Onur",""]]}
{"id":"2308.01485","submitter":"Christoph Borgers","authors":"Christoph B\\\"orgers and Claude Greengard","title":"A new probabilistic analysis of the yard-sale model","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.GN physics.soc-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In Chakraborti's yard-sale model of an economy, identical agents engage in\ntrades that result in wealth exchanges, but conserve the combined wealth of all\nagents and each agent's expected wealth. In this model, wealth condensation,\nthat is, convergence to a state in which one agent owns everything and the\nothers own nothing, occurs almost surely. We give a proof of this fact that is\nmuch shorter than existing ones and extends to a modified model in which there\nis a wealth-acquired advantage, i.e., the wealthier of two trading partners is\nmore likely to benefit from the trade.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:48:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["B\u00f6rgers","Christoph",""],["Greengard","Claude",""]]}
{"id":"2308.01486","submitter":"Rudy Morel","authors":"Rudy Morel, St\\'ephane Mallat and Jean-Philippe Bouchaud","title":"Path Shadowing Monte-Carlo","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF q-fin.CP q-fin.PR q-fin.ST","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a Path Shadowing Monte-Carlo method, which provides prediction\nof future paths, given any generative model. At any given date, it averages\nfuture quantities over generated price paths whose past history matches, or\n`shadows', the actual (observed) history. We test our approach using paths\ngenerated from a maximum entropy model of financial prices, based on a recently\nproposed multi-scale analogue of the standard skewness and kurtosis called\n`Scattering Spectra'. This model promotes diversity of generated paths while\nreproducing the main statistical properties of financial prices, including\nstylized facts on volatility roughness. Our method yields state-of-the-art\npredictions for future realized volatility and allows one to determine\nconditional option smiles for the S\\&P500 that outperform both the current\nversion of the Path-Dependent Volatility model and the option market itself.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:51:38 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Morel","Rudy",""],["Mallat","St\u00e9phane",""],["Bouchaud","Jean-Philippe",""]]}
{"id":"2308.01487","submitter":"Chinmay Sahu","authors":"Chinmay Sahu, Mahesh Banavar, Jie Sun","title":"Data-Driven Nonlinear TDOA for Accurate Source Localization in Complex\n  Signal Dynamics","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The complex and dynamic propagation of oscillations and waves is often\ntriggered by sources at unknown locations. Accurate source localization enables\nthe elimination of the rotor core in atrial fibrillation (AFib) as an effective\ntreatment for such severe cardiac disorder; it also finds potential use in\nlocating the spreading source in natural disasters such as forest fires and\ntsunamis. However, existing approaches such as time of arrival (TOA) and time\ndifference of arrival (TDOA) do not yield accurate localization results since\nthey tacitly assume a constant signal propagation speed whereas realistic\npropagation is often non-static and heterogeneous. In this paper, we develop a\nnonlinear TDOA (NTDOA) approach which utilizes observational data from various\npositions to jointly learn the propagation speed at different angles and\ndistances as well as the location of the source itself. Through examples of\nsimulating the complex dynamics of electrical signals along the surface of the\nheart and satellite imagery from forest fires and tsunamis, we show that with a\nsmall handful of measurements, NTDOA, as a data-driven approach, can\nsuccessfully locate the spreading source, leading also to better forecasting of\nthe speed and direction of subsequent propagation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 00:57:29 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sahu","Chinmay",""],["Banavar","Mahesh",""],["Sun","Jie",""]]}
{"id":"2308.01488","submitter":"Parisa Fatheddin","authors":"Parisa Fatheddin and Hannelore Lisei","title":"Moderate Deviations for a Stochastic Schr\\\"odinger Type Equation with\n  Linear Drift","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Moderate deviation principle is achieved by the weak convergence approach for\na stochastic Schr\\\"odinger type equation with linear drift term and noise\ndriven by a $Q$-Wiener process. The central limit theorem is also shown for the\nequation to further analyze its asymptotic behavior.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:01:28 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fatheddin","Parisa",""],["Lisei","Hannelore",""]]}
{"id":"2308.01489","submitter":"Christoph Borgers","authors":"Christoph B\\\"orgers, Natasa Dragovic, Anna Haensch, Arkadz Kirshtein,\n  and Lilla Orr","title":"ODEs and Mandatory Voting","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper presents mathematics relevant to the question whether voting\nshould be mandatory. Assuming a static distribution of voters' political\nbeliefs, we model how politicians might adjust their positions to raise their\nshare of the vote. Various scenarios can be explored using our web-based app\n(see text for the link). Abstentions are found to have great impact on the\ndynamics of candidates, and in particular to introduce the possibility of\ndiscontinuous jumps in optimal candidate positions. This is a paper intended\nfor undergraduate students. It is an unusual application of ODEs. We hope that\nit might help engage some students who may find it harder to connect with the\nmore customary applications from the natural sciences.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:06:33 GMT"}],"update_date":"2023-08-04","authors_parsed":[["B\u00f6rgers","Christoph",""],["Dragovic","Natasa",""],["Haensch","Anna",""],["Kirshtein","Arkadz",""],["Orr","Lilla",""]]}
{"id":"2308.01490","submitter":"Puning Zhao","authors":"Puning Zhao, Lifeng Lai","title":"Minimax Optimal $Q$ Learning with Nearest Neighbors","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":"  $Q$ learning is a popular model free reinforcement learning method. Most of\nexisting works focus on analyzing $Q$ learning for finite state and action\nspaces. If the state space is continuous, then the original $Q$ learning method\ncan not be directly used. A modification of the original $Q$ learning method\nwas proposed in (Shah and Xie, 2018), which estimates $Q$ values with nearest\nneighbors. Such modification makes $Q$ learning suitable for continuous state\nspace. (Shah and Xie, 2018) shows that the convergence rate of estimated $Q$\nfunction is $\\tilde{O}(T^{-1/(d+3)})$, which is slower than the minimax lower\nbound $\\tilde{\\Omega}(T^{-1/(d+2)})$, indicating that this method is not\nefficient. This paper proposes two new $Q$ learning methods to bridge the gap\nof convergence rates in (Shah and Xie, 2018), with one of them being offline,\nwhile the other is online. Despite that we still use nearest neighbor approach\nto estimate $Q$ function, the algorithms are crucially different from (Shah and\nXie, 2018). In particular, we replace the kernel nearest neighbor in\ndiscretized region with a direct nearest neighbor approach. Consequently, our\napproach significantly improves the convergence rate. Moreover, the time\ncomplexity is also significantly improved in high dimensional state spaces. Our\nanalysis shows that both offline and online methods are minimax rate optimal.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:08:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhao","Puning",""],["Lai","Lifeng",""]]}
{"id":"2308.01491","submitter":"Aparajitha Karthikeyan","authors":"Bhaskar Dutta, Aparajitha Karthikeyan, Doojin Kim","title":"Longer-Lived Mediators from Charged Mesons and Photons at Neutrino\n  Experiments","comments":"14 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"MI-HET-809","categories":"hep-ph hep-ex","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Since many of the dark-sector particles interact with Standard Model (SM)\nparticles in multiple ways, they can appear in experimental facilities where SM\nparticles appear in abundance. In this study, we explore a particular class of\nlonger-lived mediators that are produced from photons, charged mesons, neutral\nmesons, and $e^\\pm$ that arise in proton-beam fixed-target-type neutrino\nexperiments. This class of mediators encompasses light scalars that appear in\ntheories like extended Higgs sectors, muon(electro)philic scalars, etc. We\nevaluate the sensitivities of these mediators at beam-based neutrino\nexperiments such as the finished ArgoNeuT, ongoing MicroBooNE, SBND, ICARUS,\nand the upcoming DUNE experiment. We realize that scalars are more enhanced\nwhile produced from three-body decay of charged mesons, especially if they are\nmuonphilic in nature. For scenarios that contain muonphilic scalars, these\nexperiments can probe unexplored regions of parameter space that can explain\nthe current discrepancy in the anomalous magnetic moment of muons. The\nsensitivity of electrophilic scalars at the DUNE Near Detector can explore new\nregions. We also show that Bethe-Heitler scattering processes can be used to\nprobe flavor-specific lepton final states even for the mediator masses below\ntwice the lepton mass.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:20:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dutta","Bhaskar",""],["Karthikeyan","Aparajitha",""],["Kim","Doojin",""]]}
{"id":"2308.01492","submitter":"Ramanathan Subramanian","authors":"Blooma John, Ramanathan Subramanian, Jayan Chirayath Kurian","title":"A Virtual Reality Game to Improve Physical and Cognitive Acuity","comments":"5 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the Virtual Human Benchmark (VHB) game to evaluate and improve\nphysical and cognitive acuity. VHB simulates in 3D the BATAK lightboard game,\nwhich is designed to improve physical reaction and hand-eye coordination, on\nthe \\textit{Oculus Rift} and \\textit{Quest} headsets. The game comprises the\n\\textit{reaction}, \\textit{accumulator} and \\textit{sequence} modes; \\bj{along}\nwith the \\textit{reaction} and \\textit{accumulator} modes which mimic BATAK\nfunctionalities, the \\textit{sequence} mode involves the user repeating a\nsequence of illuminated targets with increasing complexity to train visual\nmemory and cognitive processing. A first version of the game (VHB v1) was\nevaluated against the real-world BATAK by 20 users, and their feedback was\nutilized to improve game design and obtain a second version (VHB v2). Another\nstudy to evaluate VHB v2 was conducted with 20 users, whose results confirmed\nthat the deign improvements enhanced game usability and user experience in\nmultiple respects. Also, logging and visualization of performance data such as\n\\textit{reaction time}, \\textit{speed between targets} and \\textit{completed\nsequence patterns} provides useful data for coaches/therapists monitoring\nsports/rehabilitation regimens.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:26:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["John","Blooma",""],["Subramanian","Ramanathan",""],["Kurian","Jayan Chirayath",""]]}
{"id":"2308.01493","submitter":"Barnali Das","authors":"B. Das and S. P. Owocki","title":"On the spatial distribution of electron energy loss due to gyro-cooling\n  in hot-star magnetospheres","comments":"9 pages, 7 figures; accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2389","report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hot magnetic stars often exhibit incoherent circularly polarized radio\nemission thought to arise from gyro-synchrotron emission by energetic electrons\ntrapped in the circumstellar magnetosphere. Theoretical scalings for electron\nacceleration by magnetic reconnection driven by centrifugal breakout match well\nthe empirical scalings for observed radio luminosity with both the magnetic\nfield strength and the stellar rotation rate. This paper now examines how\nenergetic electrons introduced near the top of closed magnetic loops are\nsubsequently cooled by the energy loss associated with their gyro-synchrotron\nradio emission. For sample assumed distributions for energetic electron\ndeposition about the loop apex, we derive the spatial distribution of the\nradiated energy from such \"gyro-cooling\". For sub-relativistic electrons, we\nshow explicitly that this is independent of the input energy, but also find\nthat even extensions to the relativistic regime still yield a quite similar\nspatial distribution. However, cooling by coulomb collisions with even a modest\nambient density of thermal electrons can effectively quench the emission from\nsub-relativistic electrons, indicating that the observed radio emission likely\nstems from relativistic electrons that are less affected by such collisional\ncooling. The overall results form an initial basis for computing radio emission\nspectra in future models that account for such cooling and multimode excitation\nabout the fundamental gyro-frequency. Though motivated in the context of\nhot-stars, the basic results here could also be applied to gyro-emission in any\ndipole magnetospheres, including those of ultra-cool dwarfs and even\n(exo)-planets.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:31:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Das","B.",""],["Owocki","S. P.",""]]}
{"id":"2308.01494","submitter":"Ensuo Ma","authors":"E. S. Ma and Z. Song","title":"Polarity of the fermionic condensation in the $p$-wave Kitaev model on a\n  square lattice","comments":null,"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":"  In a $p$-wave Kitaev model, the nearest neighbor pairing term results in the\nformation of the Bardeen-Cooper-Schrieffer (BCS) pair in the ground state. In\nthis work, we study the fermionic condensation of real-space pairs in a\n$p$-wave Kitaev model on a square lattice with a uniform phase gradient pairing\nterm along both directions. The exact solution shows that the ground state can\nbe expressed in a coherent-state-like form, indicating the condensation of a\ncollective pairing mode, which is the superposition of different configurations\nof pairs in real space. The amplitudes of each configuration depend not only on\nthe size but also on the orientation of the pair. We employ three quantities to\ncharacterize the ground state in the thermodynamic limit. (i) A BCS-pair order\nparameter is introduced to characterize the phase diagram, consisting of gapful\nand topological gapless phases. (ii) The particle-particle correlation length\nis obtained to reveal the polarity of the pair condensation. In addition, (iii)\na pair-pair correlator is analytically derived to indicate the possessing of\noff-diagonal long-range order. Our work proposes an alternative method for\nunderstanding fermionic condensation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:41:05 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 07:24:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ma","E. S.",""],["Song","Z.",""]]}
{"id":"2308.01495","submitter":"Kristen Windoloski","authors":"Kristen A. Windoloski, Susanne Janum, Ronan M.G. Berg, Mette S.\n  Olufsen","title":"Characterization of differences in immune responses during bolus and\n  continuous infusion endotoxin challenges using mathematical modeling","comments":"39 pages, 9 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Endotoxin administration is commonly used to study the inflammatory response,\nand though traditionally given as a bolus injection, it can be administered as\na continuous infusion over multiple hours. Several studies hypothesize that the\nlatter better represents the prolonged and pronounced inflammation observed in\nconditions like sepsis. Yet, very few experimental studies have administered\nendotoxin using both strategies, leaving significant gaps in determining the\nunderlying mechanisms responsible for their differing immune responses. We use\nmathematical modeling to analyze cytokine data from two studies administering a\n2 ng/kg dose of endotoxin, one as a bolus and the other as a continuous\ninfusion over four hours. Using our model, we simulate the dynamics of mean and\nsubject-specific cytokine responses as well as the response to long-term\nendotoxin administration. Cytokine measurements reveal that the bolus injection\nleads to significantly higher peaks for IL-8, while IL-10 reaches significantly\nhigher peaks during continuous administration. Moreover, the peak timing of all\nmeasured cytokines occurs later in the continuous infusion. We identify three\nmodel parameters that significantly differ between the two administration\nmethods. Monocyte activation of IL-10 is greater during the continuous\ninfusion, while recovery rates of IL-8 is faster for the bolus injection. This\nsuggests that a continuous infusion elicits a stronger, longer-lasting systemic\nreaction through increased stimulation of monocyte anti-inflammatory mediator\nproduction and decreased recovery of pro-inflammatory catalysts. Furthermore,\nour continuous infusion model exhibits prolonged inflammation with recurrent\npeaks resolving within two days during long-term (20-32 hours) endotoxin\nadministration.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:43:09 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Windoloski","Kristen A.",""],["Janum","Susanne",""],["Berg","Ronan M. G.",""],["Olufsen","Mette S.",""]]}
{"id":"2308.01496","submitter":"Jingyu Du","authors":"Jingyu Du and Yang Zhao and Hong Cheng","title":"Target-point Attention Transformer: A novel trajectory predict network\n  for end-to-end autonomous driving","comments":"7 pages, 4 figures, 44 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the field of autonomous driving, there have been many excellent perception\nmodels for object detection, semantic segmentation, and other tasks, but how\ncan we effectively use the perception models for vehicle planning? Traditional\nautonomous vehicle trajectory prediction methods not only need to obey traffic\nrules to avoid collisions, but also need to follow the prescribed route to\nreach the destination. In this paper, we propose a Transformer-based trajectory\nprediction network for end-to-end autonomous driving without rules called\nTarget-point Attention Transformer network (TAT). We use the attention\nmechanism to realize the interaction between the predicted trajectory and the\nperception features as well as target-points. We demonstrate that our proposed\nmethod outperforms existing conditional imitation learning and GRU-based\nmethods, significantly reducing the occurrence of accidents and improving route\ncompletion. We evaluate our approach in complex closed loop driving scenarios\nin cities using the CARLA simulator and achieve state-of-the-art performance.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:44:40 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Du","Jingyu",""],["Zhao","Yang",""],["Cheng","Hong",""]]}
{"id":"2308.01497","submitter":"Nicholas Ichien","authors":"Nicholas Ichien, Du\\v{s}an Stamenkovi\\'c, Keith J. Holyoak","title":"Large Language Model Displays Emergent Ability to Interpret Novel\n  Literary Metaphors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances in the performance of large language models (LLMs) have\nsparked debate over whether, given sufficient training, high-level human\nabilities emerge in such generic forms of artificial intelligence (AI). Despite\nthe exceptional performance of LLMs on a wide range of tasks involving natural\nlanguage processing and reasoning, there has been sharp disagreement as to\nwhether their abilities extend to more creative human abilities. A core example\nis the ability to interpret novel metaphors. Given the enormous and non-curated\ntext corpora used to train LLMs, a serious obstacle to designing tests is the\nrequirement of finding novel yet high-quality metaphors that are unlikely to\nhave been included in the training data. Here we assessed the ability of GPT-4,\na state-of-the-art large language model, to provide natural-language\ninterpretations of novel literary metaphors drawn from Serbian poetry and\ntranslated into English. Despite exhibiting no signs of having been exposed to\nthese metaphors previously, the AI system consistently produced detailed and\nincisive interpretations. Human judge - blind to the fact that an AI model was\ninvolved - rated metaphor interpretations generated by GPT-4 as superior to\nthose provided by a group of college students. In interpreting reversed\nmetaphors, GPT-4, as well as humans, exhibited signs of sensitivity to the\nGricean cooperative principle. These results indicate that LLMs such as GPT-4\nhave acquired an emergent ability to interpret complex novel metaphors.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:46:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ichien","Nicholas",""],["Stamenkovi\u0107","Du\u0161an",""],["Holyoak","Keith J.",""]]}
{"id":"2308.01498","submitter":"P. A. Gonzalez","authors":"P. A. Gonz\\'alez, Marco Olivares, Yerko V\\'asquez, J. R. Villanueva","title":"Timelike geodesics for five-dimensional Schwarzschild and\n  Reissner-Nordstr\\\"om Anti-de Sitter black holes","comments":"15 pages, and 15 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 timelike structure of the five-dimensional Schwarzschild and\nReissner-Nordstr\\\"om Anti-de Sitter black holes is studied in detail. Different\nkinds of motion are allowed and studied by using an adequate effective\npotential. Then, by solving the corresponding equations of motion, several\ntrajectories and orbits are described in terms of Weierstrass elliptic\nfunctions and elementary functions for neutral particles.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:50:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gonz\u00e1lez","P. A.",""],["Olivares","Marco",""],["V\u00e1squez","Yerko",""],["Villanueva","J. R.",""]]}
{"id":"2308.01499","submitter":"Qi Yang","authors":"Qi Yang, Joel Jung, Timon Deschamps, Xiaozhong Xu, and Shan Liu","title":"TDMD: A Database for Dynamic Color Mesh Subjective and Objective Quality\n  Explorations","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":"  Dynamic colored meshes (DCM) are widely used in various applications;\nhowever, these meshes may undergo different processes, such as compression or\ntransmission, which can distort them and degrade their quality. To facilitate\nthe development of objective metrics for DCMs and study the influence of\ntypical distortions on their perception, we create the Tencent - dynamic\ncolored mesh database (TDMD) containing eight reference DCM objects with six\ntypical distortions. Using processed video sequences (PVS) derived from the\nDCM, we have conducted a large-scale subjective experiment that resulted in 303\ndistorted DCM samples with mean opinion scores, making the TDMD the largest\navailable DCM database to our knowledge. This database enabled us to study the\nimpact of different types of distortion on human perception and offer\nrecommendations for DCM compression and related tasks. Additionally, we have\nevaluated three types of state-of-the-art objective metrics on the TDMD,\nincluding image-based, point-based, and video-based metrics, on the TDMD. Our\nexperimental results highlight the strengths and weaknesses of each metric, and\nwe provide suggestions about the selection of metrics in practical DCM\napplications. The TDMD will be made publicly available at the following\nlocation: https://multimedia.tencent.com/resources/tdmd.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:50:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yang","Qi",""],["Jung","Joel",""],["Deschamps","Timon",""],["Xu","Xiaozhong",""],["Liu","Shan",""]]}
{"id":"2308.01500","submitter":"Christoph Borgers","authors":"Bruce Boghosian and Christoph B\\\"orgers","title":"ODE models of wealth concentration and taxation","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We refer to an individual holding a non-negligible fraction of the country's\ntotal wealth as an oligarch. We explain how a model due to Boghosian et al. can\nbe used to explore the effects of taxation on the emergence of oligarchs. The\nmodel suggests that oligarchs will emerge when wealth taxation is below a\ncertain threshold, not when it is above the threshold. The underlying mechanism\nis a transcritical bifurcation. The model also suggests that taxation of income\nand capital gains alone cannot prevent the emergence of oligarchs. This is an\narticle intended for undergraduate students. We suggest several opportunities\nfor students to explore modifications of the model.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:51:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Boghosian","Bruce",""],["B\u00f6rgers","Christoph",""]]}
{"id":"2308.01501","submitter":"Danial Motlagh","authors":"Danial Motlagh and Nathan Wiebe","title":"Generalized Quantum Signal Processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum Signal Processing (QSP) and Quantum Singular Value Transformation\n(QSVT) currently stand as the most efficient techniques for implementing\nfunctions of block encoded matrices, a central task that lies at the heart of\nmost prominent quantum algorithms. However, current QSP approaches face several\nchallenges, such as the restrictions imposed on the family of achievable\npolynomials and the difficulty of calculating the required phase angles for\nspecific transformations. In this paper, we present a Generalized Quantum\nSignal Processing (GQSP) approach, employing general SU(2) rotations as our\nsignal processing operators, rather than relying solely on rotations in a\nsingle basis. Our approach lifts all practical restrictions on the family of\nachievable transformations, with the sole remaining condition being that\n$|P|\\leq 1$, a restriction necessary due to the unitary nature of quantum\ncomputation. Furthermore, GQSP provides a straightforward recursive formula for\ndetermining the rotation angles needed to construct the polynomials in cases\nwhere $P$ and $Q$ are known. In cases where only $P$ is known, we provide an\nefficient optimization algorithm capable of identifying in under a minute of\nGPU time, a corresponding $Q$ for polynomials of degree on the order of $10^7$.\nWe further illustrate GQSP simplifies QSP-based strategies for Hamiltonian\nsimulation, offer an optimal solution to the $\\epsilon$-approximate fractional\nquery problem that requires $O(\\frac{1}{\\delta} +\n\\log(\\large\\frac{1}{\\epsilon}))$ queries to perform where $O(1/\\delta)$ is a\nproved lower bound, and introduces novel approaches for implementing bosonic\noperators. Moreover, we propose a novel framework for the implementation of\nnormal matrices, demonstrating its applicability through the development of a\nnew convolution algorithm that runs in $O(d \\log{N} + \\log^2N)$ 1 and 2-qubit\ngates for a filter of lengths $d$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:51:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Motlagh","Danial",""],["Wiebe","Nathan",""]]}
{"id":"2308.01502","submitter":"Sepehr Hajebi","authors":"Sepehr Hajebi","title":"Induced subdivisions with pinned branch vertices","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 for all integers $r\\geq 0$ and $s,t\\geq 1$, there exists an\ninteger $\\Omega=\\Omega(r,s,t)\\geq 1$ with the following property. Let $G$ be a\ngraph and let $H$ be a subgraph of $G$ isomorphic to a $(\\leq r)$-subdivision\nof $K_{\\Omega}$. Then either $G$ contains $K_t$ or $K_{t,t}$ as an induced\nsubgraph, or there is an induced subgraph $J$ of $G$ isomorphic to a proper\n$(\\leq r)$-subdivision of $K_s$ such that every branch vertex of $J$ is a\nbranch vertex of $H$. This answers in the affirmative a question of Lozin and\nRazgon. In fact, we show that both the branch vertices and the paths\ncorresponding to the subdivided edges between them can be preserved.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:52:47 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 01:49:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hajebi","Sepehr",""]]}
{"id":"2308.01503","submitter":"Julia Domingues Lemos","authors":"Julia Domingues Lemos, Alexei A. Mailybaev","title":"Data-based approach for time-correlated closures of turbulence models","comments":"23 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Developed turbulent motion of fluid still lacks an analytical description\ndespite more than a century of active research. Nowadays phenomenological ideas\nare widely used in practical applications, such as small-scale closures for\nnumerical simulations of turbulent flows. In the present work, we use a shell\nmodel of turbulence to construct a closure intended to have a solid theoretical\nbackground and to capture intrinsic probabilistic features of turbulence. Shell\nmodels of turbulence are dynamical deterministic systems used to model energy\ncascade and other key aspects of the Navier-Stokes such as intermittency. We\nrescale the variables of the Sabra model in a way which leads to hidden\nsymmetries and universal distributions. We then use such fine distributions to\nwrite closures, i.e., missing expressions for some of the Sabra variables. Our\nclosures rely on approximating probability density functions using a Gaussian\nMixture Model, which makes them probabilistic by nature and allows us to write\ntime-correlated closures. We also provide a framework where other Machine\nLearning tools can be employed with reduced black-box aspects.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:10:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lemos","Julia Domingues",""],["Mailybaev","Alexei A.",""]]}
{"id":"2308.01504","submitter":"Boqing Xue","authors":"Thang Pham, Boqing Xue","title":"New-type Quasirandom Groups and Applications","comments":"V2: references updated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper aims to introduce a more general definition of quasirandom groups\nand generalize several well-known results in the literature in this new\nsetting. More precisely, let $G$ be a semi-direct product of groups and\n$X\\subseteq G$, we provide conditions such that one can find tuples $(x_0,\n\\ldots, x_k)\\in X^{k+1}$ satisfying $x_1x_2\\ldots x_k=x_0$ or conditions to\nguarantee that the product set $XX$ grows exponentially. In a special case of\nthe group of rigid-motions in the plane over an arbitrary finite field, our\nresults offer a reasonably complete description of structures of this group.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:11:03 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 02:56:35 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 12:37:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pham","Thang",""],["Xue","Boqing",""]]}
{"id":"2308.01505","submitter":"Eric Flesch","authors":"Eric Wim Flesch","title":"The Million Quasars (Milliquas) Catalogue, v8","comments":"7 pages, 5 tables, 2 figures. Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Announcing the final release, v8, of the Milliquas (Million Quasars) quasar\ncatalogue which presents all published quasars to 30 June 2023, including\nquasars from the first releases of the Dark Energy Spectroscopic Instrument\n(DESI) and the SDSS-DR18 Black Hole Mapper. Its totals are 907,144 type-I\nQSOs/AGN and 66,026 high-confidence (~99% likelihood) radio/X-ray associated\nquasar candidates. Type-II and Bl Lac type objects are also included, bringing\nthe total count to 1,021,800. Gaia-EDR3 astrometry is given for most objects.\nThe catalogue is available on NASA HEASARC and CDS and on its home page.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:12:25 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 02:55:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Flesch","Eric Wim",""]]}
{"id":"2308.01506","submitter":"Jingpeng Wu","authors":"Jingpeng Wu and Xianwen Zhang","title":"Non-uniqueness of the transport equation at high spacial integrability","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 show the non-uniqueness of the weak solution in the class\n$\\rho\\in L^{s}_tL^p_x$ for the transport equation driven by a divergence-free\nvector field $\\boldsymbol{u}\\in L^{\\tilde{s}}_tW^{1,q}_x\\cap L_t^{s'}L_x^{p'}$\nhappens in the range $1/p+1/q>1-\\frac{p-1}{4(p+1)p}$ with some $\\tilde{s}>1$,\nas long as $1\\le s<\\infty$, $p>1$. As a corollary, $L^{\\infty}$ in time of the\ndensity $\\rho$ is critical in some sense for the uniqueness of weak solution.\nOur proof is based on the convex integration method developed in [Modena and\nSattig, 2020, Ann. Inst. H. Poincar\\'e C Anal. Non Lin\\'eaire], [Cheskidov and\nLuo, 2021, Ann. PDE].\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:15:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wu","Jingpeng",""],["Zhang","Xianwen",""]]}
{"id":"2308.01507","submitter":"Eric Flesch","authors":"Eric Wim Flesch","title":"The Millions of Optical-Radio/X-ray Associations (MORX) Catalogue","comments":"5 pages, 2 tables, 1 figure. Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Announcing the release v2 of the MORX (Millions of Optical-Radio/X-ray\nAssociations) catalogue which presents probable (40%-100% likelihood)\nradio/X-ray associations, including double radio lobes, to optical objects. All\nthe large radio/X-ray surveys to June 2023 are included, being VLASS, LoTSS,\nRACS, FIRST, NVSS, and SUMSS radio surveys and Chandra, XMM-Newton, Swift, and\nROSAT X-ray surveys. The totals are 3,115,575 optical objects of all\nclassifications (or unclassified) so associated. The catalogue is available on\nmultiple sites.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:28:57 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 02:58:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Flesch","Eric Wim",""]]}
{"id":"2308.01508","submitter":"Minh Pham","authors":"Minh Pham, Kelly O. Marshall, Chinmay Hegde","title":"Circumventing Concept Erasure Methods For Text-to-Image Generative\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-to-image generative models can produce photo-realistic images for an\nextremely broad range of concepts, and their usage has proliferated widely\namong the general public. On the flip side, these models have numerous\ndrawbacks, including their potential to generate images featuring sexually\nexplicit content, mirror artistic styles without permission, or even\nhallucinate (or deepfake) the likenesses of celebrities. Consequently, various\nmethods have been proposed in order to \"erase\" sensitive concepts from\ntext-to-image models. In this work, we examine five recently proposed concept\nerasure methods, and show that targeted concepts are not fully excised from any\nof these methods. Specifically, we leverage the existence of special learned\nword embeddings that can retrieve \"erased\" concepts from the sanitized models\nwith no alterations to their weights. Our results highlight the brittleness of\npost hoc concept erasure methods, and call into question their use in the\nalgorithmic toolkit for AI safety.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:34:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Pham","Minh",""],["Marshall","Kelly O.",""],["Hegde","Chinmay",""]]}
{"id":"2308.01509","submitter":"Samuel Timothy Spencer Dr","authors":"Samuel T. Spencer, Thomas Lang, Alison M.W. Mitchell","title":"The Influence of Satellite Trails on H.E.S.S. Gamma-Ray Astronomical\n  Observations","comments":"8 pages, 5 figures, 1 table. Short summary of a full paper which can\n  be found here: arXiv:2307.13293","journal-ref":"Proceedings of the 38th International Cosmic Ray Conference\n  (ICRC2023). PoS(ICRC2023)694","doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The number of satellites launched into low earth orbit has almost tripled (to\nover 4000) in the last three years due to the increasing commercialisation of\nspace. Satellite constellations with a total of over 400,000 satellites are\nproposed to be launched in the near future. Many of these satellites are highly\nreflective, resulting in a high optical brightness that affects ground-based\nastronomical observations across the electromagnetic spectrum. Despite this,\nthe potential effect of these satellites on Imaging Atmospheric Cherenkov\nTelescopes (IACTs) has so far been assumed to be negligible due to their\nnanosecond integration times. This has, however, never been verified. We aim to\nidentify satellite trails in data taken by the High Energy Stereoscopic System\n(H.E.S.S.) IACT array in Namibia, using Night Sky Background (NSB) data from\nthe CT5 camera installed in 2019. We determine which observation times and\npointing directions are affected the most, and evaluate the impact on Hillas\nparameters used for classification and reconstruction of high-energy Extensive\nAir Shower events. Finally, we predict how future planned satellite launches\nwill affect gamma-ray observations with IACTs.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:35:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Spencer","Samuel T.",""],["Lang","Thomas",""],["Mitchell","Alison M. W.",""]]}
{"id":"2308.01510","submitter":"Brendan Meade","authors":"Brendan J. Meade","title":"Kinematic Afterslip Patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-inertial afterslip has been inferred to occur following large\nearthquakes. An explanation for this slow slip phenomenon is that coseismically\ngenerated stresses induce sliding on parts of a fault surface with\nvelocity-strengthening frictional properties. Here we develop an alternative\nexplanation for afterslip based on the idea that afterslip may occur on any\nportion of a fault that exhibits positive residual geometric moment following\nan earthquake, including sections that ruptured coseismically. Following a\nlarge earthquake, this model exhibits exponential time decay of afterslip and\nallows for variable sensitivity to coseismic event magnitude and residual\ngeometric moment. This model provides a partial explanation for the spatial\nrelationship of co- and post-seismic slip associated with the 2011\n$\\mathrm{M_W}{=}9$ Tohoku-oki earthquake.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:45:09 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Meade","Brendan J.",""]]}
{"id":"2308.01511","submitter":"Jiahui Li","authors":"Jiahui Li, Geng Sun, Lingjie Duan, Qingqing Wu","title":"Multi-Objective Optimization for UAV Swarm-Assisted IoT with Virtual\n  Antenna Arrays","comments":"This paper has been accepted by IEEE Transactions on Mobile Computing","journal-ref":null,"doi":"10.1109/TMC.2023.3298888","report-no":null,"categories":"cs.NE cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unmanned aerial vehicle (UAV) network is a promising technology for assisting\nInternet-of-Things (IoT), where a UAV can use its limited service coverage to\nharvest and disseminate data from IoT devices with low transmission abilities.\nThe existing UAV-assisted data harvesting and dissemination schemes largely\nrequire UAVs to frequently fly between the IoTs and access points, resulting in\nextra energy and time costs. To reduce both energy and time costs, a key way is\nto enhance the transmission performance of IoT and UAVs. In this work, we\nintroduce collaborative beamforming into IoTs and UAVs simultaneously to\nachieve energy and time-efficient data harvesting and dissemination from\nmultiple IoT clusters to remote base stations (BSs). Except for reducing these\ncosts, another non-ignorable threat lies in the existence of the potential\neavesdroppers, whereas the handling of eavesdroppers often increases the energy\nand time costs, resulting in a conflict with the minimization of the costs.\nMoreover, the importance of these goals may vary relatively in different\napplications. Thus, we formulate a multi-objective optimization problem (MOP)\nto simultaneously minimize the mission completion time, signal strength towards\nthe eavesdropper, and total energy cost of the UAVs. We prove that the\nformulated MOP is an NP-hard, mixed-variable optimization, and large-scale\noptimization problem. Thus, we propose a swarm intelligence-based algorithm to\nfind a set of candidate solutions with different trade-offs which can meet\nvarious requirements in a low computational complexity. We also show that swarm\nintelligence methods need to enhance solution initialization, solution update,\nand algorithm parameter update phases when dealing with mixed-variable\noptimization and large-scale problems. Simulation results demonstrate the\nproposed algorithm outperforms state-of-the-art swarm intelligence algorithms.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:49:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Jiahui",""],["Sun","Geng",""],["Duan","Lingjie",""],["Wu","Qingqing",""]]}
{"id":"2308.01512","submitter":"Hangcheng Liu","authors":"Hangcheng Liu, Tao Xiang, Shangwei Guo, Han Li, Tianwei Zhang, and\n  Xiaofeng Liao","title":"Erase and Repair: An Efficient Box-Free Removal Attack on High-Capacity\n  Deep Hiding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep hiding, embedding images with others using deep neural networks, has\ndemonstrated impressive efficacy in increasing the message capacity and\nrobustness of secret sharing. In this paper, we challenge the robustness of\nexisting deep hiding schemes by preventing the recovery of secret images,\nbuilding on our in-depth study of state-of-the-art deep hiding schemes and\ntheir vulnerabilities. Leveraging our analysis, we first propose a simple\nbox-free removal attack on deep hiding that does not require any prior\nknowledge of the deep hiding schemes.\n  To improve the removal performance on the deep hiding schemes that may be\nenhanced by adversarial training, we further design a more powerful removal\nattack, efficient box-free removal attack (EBRA), which employs image\ninpainting techniques to remove secret images from container images. In\naddition, to ensure the effectiveness of our attack and preserve the fidelity\nof the processed container images, we design an erasing phase based on the\nlocality of deep hiding to remove secret information and then make full use of\nthe visual information of container images to repair the erased visual content.\nExtensive evaluations show our method can completely remove secret images from\ncontainer images with negligible impact on the quality of container images.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:51:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Hangcheng",""],["Xiang","Tao",""],["Guo","Shangwei",""],["Li","Han",""],["Zhang","Tianwei",""],["Liao","Xiaofeng",""]]}
{"id":"2308.01513","submitter":"Kwanpyo Kim","authors":"Jun-Yeong Yoon, Yangjin Lee, Dong-Gyu Kim, Dong Gun Oh, Jin Kyun Kim,\n  Linshuo Guo, Jungcheol Kim, Jeongheon Choe, Kihyun Lee, Hyeonsik Cheong, Chae\n  Un Kim, Young Jai Choi, Yanhang Ma, Kwanpyo Kim","title":"Type-II Red Phosphorus: Wavy Packing of Twisted Pentagonal Tubes","comments":"16 pages, 5 figures, 1 table","journal-ref":"Angew. Chem. Int. Ed. e202307102 (2023)","doi":"10.1002/anie.202307102","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Elemental phosphorus exhibits fascinating structural varieties and versatile\nproperties. The unique nature of phosphorus bonds can lead to the formation of\nextremely complex structures, and detailed structural information on some\nphosphorus polymorphs is yet to be investigated. In this study, we investigated\nan unidentified crystalline phase of phosphorus, type-II red phosphorus (RP),\nby combining state-of-the-art structural characterization techniques. Electron\ndiffraction tomography, atomic-resolution scanning transmission electron\nmicroscopy (STEM), powder X-ray diffraction, and Raman spectroscopy were\nconcurrently used to elucidate the hidden structural motifs and their packing\nin type-II RP. Electron diffraction tomography, performed using individual\ncrystalline nanowires, was used to identify a triclinic unit cell with volume\nof 5330 {\\AA}^3, the largest unit cell for elemental phosphorus crystals up to\nnow, which contains approximately 250 phosphorus atoms. Atomic-resolution STEM\nimaging, which was performed along different crystal-zone axes, confirmed that\nthe twisted wavy tubular motif is the basic building block of type-II RP. Our\nstudy discovered and presented a new variation of building blocks in\nphosphorus, and it provides insights to clarify the complexities observed in\nphosphorus as well as other relevant systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:10:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yoon","Jun-Yeong",""],["Lee","Yangjin",""],["Kim","Dong-Gyu",""],["Oh","Dong Gun",""],["Kim","Jin Kyun",""],["Guo","Linshuo",""],["Kim","Jungcheol",""],["Choe","Jeongheon",""],["Lee","Kihyun",""],["Cheong","Hyeonsik",""],["Kim","Chae Un",""],["Choi","Young Jai",""],["Ma","Yanhang",""],["Kim","Kwanpyo",""]]}
{"id":"2308.01514","submitter":"Jamal Sakhr","authors":"Jamal Sakhr","title":"A class of 2 X 2 correlated random-matrix models with Brody spacing\n  distribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP nlin.CD quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A class of 2 X 2 random-matrix models is introduced for which the Brody\ndistribution is the exact eigenvalue spacing distribution. The matrix elements\nare linear combinations of an exponential random variable raised to various\npowers that depend on the Brody parameter. The random matrices introduced here\ndiffer from those of the Gaussian Orthogonal Ensemble (GOE) in three important\nways: the matrix elements are not independent and identically distributed\n(i.e., not IID) nor Gaussian-distributed, and the matrices are not necessarily\nreal and/or symmetric. The first two features arise from dropping the classical\nindependence assumption, and the third feature arises from dropping the\nquantum-mechanical conditions that are imposed in the construction of the GOE.\nIn particular, the hermiticity condition, which in the present model, is a\nsufficient but not necessary condition for the eigenvalues to be real, is not\nimposed. Consequently, complex non-Hermitian 2 X 2 random matrices with real or\ncomplex eigenvalues can also have spacing distributions that are intermediate\nbetween those of the Poisson and Wigner classes. Numerical examples are\nprovided for different types of random matrices, including complex-symmetric\nmatrices with real or complex-conjugate eigenvalues.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:11:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sakhr","Jamal",""]]}
{"id":"2308.01515","submitter":"Xiyuan Liu","authors":"Xiyuan Liu, Qingqing Wu, Die Hu, Rui Wang and Jun Wu","title":"Hierarchical Codebook Design and Analytical Beamforming Solution for IRS\n  Assisted Communication","comments":"33 pages, 11 figures","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 intelligent reflecting surface (IRS) assisted communication, beam search\nis usually time-consuming as the multiple-input multiple-output (MIMO) of IRS\nis usually very large. Hierarchical codebooks is a widely accepted method for\nreducing the complexity of searching time. The performance of this method\nstrongly depends on the design scheme of beamforming of different beamwidths.\nIn this paper, a non-constant phase difference (NCPD) beamforming algorithm is\nproposed. To implement the NCPD algorithm, we first model the phase shift of\nIRS as a continuous function, and then determine the parameters of the\ncontinuous function through the analysis of its array factor. Then, we propose\na hierarchical codebook and two beam training schemes, namely the joint\nsearching (JS) scheme and direction-wise searching (DWS) scheme by using the\nNCPD algorithm which can flexibly change the width, direction and shape of the\nbeam formed by the IRS array. Simulation results show that the NCPD algorithm\nis more accurate with smaller side lobes, and also more stable on IRS of\ndifferent sizes compared to other wide beam algorithms. The misalignment rate\nof the beam formed by the NCPD method is significantly reduced. The time\ncomplexity of the NCPD algorithm is constant, thus making it more suitable for\nsolving the beamforming design problem with practically large IRS.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:13:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Xiyuan",""],["Wu","Qingqing",""],["Hu","Die",""],["Wang","Rui",""],["Wu","Jun",""]]}
{"id":"2308.01516","submitter":"Haixin Chang","authors":"Hao Wu, Li Yang, Bichen Xiao, Haixin Chang","title":"Successful growth and room temperature ambient-pressure magnetic\n  levitation of LK-99","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, Sukbae Lee et al. reported inspiring experimental findings on the\natmospheric superconductivity of a modified lead apatite crystal (LK-99) at\nroom temperature (10.6111/JKCGCT.2023.33.2.061, arXiv: 2307.12008, arXiv:\n2307.12037). They claimed that the synthesized LK-99 materials exhibit the\nMeissner levitation phenomenon of superconductors and have a superconducting\ntransition temperature (Tc) higher than 400 K. Here, for the first time, we\nsuccessfully verify and synthesize the LK-99 crystals which can be magnetically\nlevitated with larger levitated angle than Sukbae Lee's sample at room\ntemperature. It is expected to realize the true potential of room temperature,\nnon-contact superconducting magnetic levitation in near future.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:13:51 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wu","Hao",""],["Yang","Li",""],["Xiao","Bichen",""],["Chang","Haixin",""]]}
{"id":"2308.01517","submitter":"Rui Zhao","authors":"Rui Zhao, Zhongze Yang, Dong Liang and Fan Xue","title":"Automated Machine Learning in the smart construction era:Significance\n  and accessibility for industrial classification and regression tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores the application of automated machine learning (AutoML)\ntechniques to the construction industry, a sector vital to the global economy.\nTraditional ML model construction methods were complex, time-consuming, reliant\non data science expertise, and expensive. AutoML shows the potential to\nautomate many tasks in ML construction and to create outperformed ML models.\nThis paper aims to verify the feasibility of applying AutoML to industrial\ndatasets for the smart construction domain, with a specific case study\ndemonstrating its effectiveness. Two data challenges that were unique to\nindustrial construction datasets are focused on, in addition to the normal\nsteps of dataset preparation, model training, and evaluation. A real-world\napplication case of construction project type prediction is provided to\nillustrate the accessibility of AutoML. By leveraging AutoML, construction\nprofessionals without data science expertise can now utilize software to\nprocess industrial data into ML models that assist in project management. The\nfindings in this paper may bridge the gap between data-intensive smart\nconstruction practices and the emerging field of AutoML, encouraging its\nadoption for improved decision-making, project outcomes, and efficiency\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:17:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhao","Rui",""],["Yang","Zhongze",""],["Liang","Dong",""],["Xue","Fan",""]]}
{"id":"2308.01518","submitter":"Fernanda Lang Schumacher","authors":"Daniela C. R. Oliveira, Fernanda L. Schumacher, and Victor H. Lachos","title":"The use of the EM algorithm for regularization problems in\n  high-dimensional linear mixed-effects models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The EM algorithm is a popular tool for maximum likelihood estimation but has\nnot been used much for high-dimensional regularization problems in linear\nmixed-effects models. In this paper, we introduce the EMLMLasso algorithm,\nwhich combines the EM algorithm and the popular and efficient R package glmnet\nfor Lasso variable selection of fixed effects in linear mixed-effects models.\nWe compare the performance of our proposed EMLMLasso algorithm with the one\nimplemented in the well-known R package glmmLasso through the analyses of both\nsimulated and real-world applications. The simulations and applications\ndemonstrated good properties, such as consistency, and the effectiveness of the\nproposed variable selection procedure, for both $p < n$ and $p > n$. Moreover,\nin all evaluated scenarios, the EMLMLasso algorithm outperformed glmmLasso. The\nproposed method is quite general and can be easily extended for ridge and\nelastic net penalties in linear mixed-effects models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:19:34 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Oliveira","Daniela C. R.",""],["Schumacher","Fernanda L.",""],["Lachos","Victor H.",""]]}
{"id":"2308.01519","submitter":"Chanyoung Park","authors":"Soohyun Park, Jae Pyoung Kim, Chanyoung Park, Soyi Jung, Joongheon Kim","title":"Quantum Multi-Agent Reinforcement Learning for Autonomous Mobility\n  Cooperation","comments":"7 pages, 3 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For Industry 4.0 Revolution, cooperative autonomous mobility systems are\nwidely used based on multi-agent reinforcement learning (MARL). However, the\nMARL-based algorithms suffer from huge parameter utilization and convergence\ndifficulties with many agents. To tackle these problems, a quantum MARL (QMARL)\nalgorithm based on the concept of actor-critic network is proposed, which is\nbeneficial in terms of scalability, to deal with the limitations in the noisy\nintermediate-scale quantum (NISQ) era. Additionally, our QMARL is also\nbeneficial in terms of efficient parameter utilization and fast convergence due\nto quantum supremacy. Note that the reward in our QMARL is defined as task\nprecision over computation time in multiple agents, thus, multi-agent\ncooperation can be realized. For further improvement, an additional technique\nfor scalability is proposed, which is called projection value measure (PVM).\nBased on PVM, our proposed QMARL can achieve the highest reward, by reducing\nthe action dimension into a logarithmic-scale. Finally, we can conclude that\nour proposed QMARL with PVM outperforms the other algorithms in terms of\nefficient parameter utilization, fast convergence, and scalability.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:29:25 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Park","Soohyun",""],["Kim","Jae Pyoung",""],["Park","Chanyoung",""],["Jung","Soyi",""],["Kim","Joongheon",""]]}
{"id":"2308.01520","submitter":"Cong Zhang","authors":"Cong Zhang, Honggang Qi, Yuezun Li, Siwei Lyu","title":"Contrastive Multi-FaceForensics: An End-to-end Bi-grained Contrastive\n  Learning Approach for Multi-face Forgery Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  DeepFakes have raised serious societal concerns, leading to a great surge in\ndetection-based forensics methods in recent years. Face forgery recognition is\nthe conventional detection method that usually follows a two-phase pipeline: it\nextracts the face first and then determines its authenticity by classification.\nSince DeepFakes in the wild usually contain multiple faces, using face forgery\ndetection methods is merely practical as they have to process faces in a\nsequel, i.e., only one face is processed at the same time. One straightforward\nway to address this issue is to integrate face extraction and forgery detection\nin an end-to-end fashion by adapting advanced object detection architectures.\nHowever, as these object detection architectures are designed to capture the\nsemantic information of different object categories rather than the subtle\nforgery traces among the faces, the direct adaptation is far from optimal. In\nthis paper, we describe a new end-to-end framework, Contrastive\nMulti-FaceForensics (COMICS), to enhance multi-face forgery detection. The core\nof the proposed framework is a novel bi-grained contrastive learning approach\nthat explores effective face forgery traces at both the coarse- and\nfine-grained levels. Specifically, the coarse-grained level contrastive\nlearning captures the discriminative features among positive and negative\nproposal pairs in multiple scales with the instruction of the proposal\ngenerator, and the fine-grained level contrastive learning captures the\npixel-wise discrepancy between the forged and original areas of the same face\nand the pixel-wise content inconsistency between different faces. Extensive\nexperiments on the OpenForensics dataset demonstrate our method outperforms\nother counterparts by a large margin (~18.5%) and shows great potential for\nintegration into various architectures.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:37:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Cong",""],["Qi","Honggang",""],["Li","Yuezun",""],["Lyu","Siwei",""]]}
{"id":"2308.01521","submitter":"Liang Wang","authors":"Liang Wang and Xiaogang Wang","title":"PPI-NET: End-to-End Parametric Primitive Inference","comments":"arXiv admin note: text overlap with arXiv:2203.01305 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In engineering applications, line, circle, arc, and point are collectively\nreferred to as primitives, and they play a crucial role in path planning,\nsimulation analysis, and manufacturing. When designing CAD models, engineers\ntypically start by sketching the model's orthographic view on paper or a\nwhiteboard and then translate the design intent into a CAD program. Although\nthis design method is powerful, it often involves challenging and repetitive\ntasks, requiring engineers to perform numerous similar operations in each\ndesign. To address this conversion process, we propose an efficient and\naccurate end-to-end method that avoids the inefficiency and error accumulation\nissues associated with using auto-regressive models to infer parametric\nprimitives from hand-drawn sketch images. Since our model samples match the\nrepresentation format of standard CAD software, they can be imported into CAD\nsoftware for solving, editing, and applied to downstream design tasks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:50:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wang","Liang",""],["Wang","Xiaogang",""]]}
{"id":"2308.01522","submitter":"Dermot McCarthy","authors":"Dermot McCarthy","title":"The number of $\\mathbb{F}_q$-points on diagonal hypersurfaces with\n  monomial deformation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the family of diagonal hypersurfaces with monomial deformation\n$$D_{d, \\lambda, h}: x_1^d + x_2^d \\dots + x_n^d - d \\lambda \\, x_1^{h_1}\nx_2^{h_2} \\dots x_n^{h_n}=0$$ where $d = h_1+h_2 +\\dots + h_n$ with $\\gcd(h_1,\nh_2, \\dots h_n)=1$. We first provide a formula for the number of\n$\\mathbb{F}_{q}$-points on $D_{d, \\lambda, h}$ in terms of Gauss and Jacobi\nsums. This generalizes a result of Koblitz, which holds in the special case ${d\n\\mid {q-1}}$. We then express the number of $\\mathbb{F}_{q}$-points on $D_{d,\n\\lambda, h}$ in terms of a $p$-adic hypergeometric function previously defined\nby the author. The parameters in this hypergeometric function mirror exactly\nthose described by Koblitz when drawing an analogy between his result and\nclassical hypergeometric functions. This generalizes a result by Sulakashna and\nBarman, which holds in the case $\\gcd(d,{q-1})=1$. In the special case $h_1 =\nh_2 = \\dots =h_n = 1$ and $d=n$, i.e., the Dwork hypersurface, we also\ngeneralize a previous result of the author which holds when $q$ is prime.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:52:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["McCarthy","Dermot",""]]}
{"id":"2308.01523","submitter":"Ethan Baron","authors":"Ethan Baron and Nathan Sandholtz and Timothy Chan and Devin Pleuler","title":"Miss It Like Messi: Extracting Value from Off-Target Shots in Soccer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measuring soccer shooting skill is a challenging analytics problem due to the\nscarcity and highly contextual nature of scoring events. The introduction of\nmore advanced data surrounding soccer shots has given rise to model-based\nmetrics which better cope with these challenges. Specifically, metrics such as\nexpected goals added, goals above expectation, and post-shot expected goals all\nuse advanced data to offer an improvement over the classical conversion rate.\nHowever, all metrics developed to date assign a value of zero to off-target\nshots, which account for almost two-thirds of all shots, since these shots have\nno probability of scoring. We posit that there is non-negligible shooting skill\nsignal contained in the trajectories of off-target shots and propose two\nshooting skill metrics that incorporate the signal contained in off-target\nshots. Specifically, we develop a player-specific generative model for shot\ntrajectories based on a mixture of truncated bivariate Gaussian distributions.\nWe use this generative model to compute metrics that allow us to attach\nnon-zero value to off-target shots. We demonstrate that our proposed metrics\nare more stable than current state-of-the-art metrics and have increased\npredictive power.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:53:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Baron","Ethan",""],["Sandholtz","Nathan",""],["Chan","Timothy",""],["Pleuler","Devin",""]]}
{"id":"2308.01524","submitter":"Sen Liu","authors":"Rui Liu, Sen Liu and Xiaoli Zhang","title":"Unsupervised Learning of Part Similarity for Goal-Guided Accelerated\n  Experiment Design in Metal Additive Manufacturing","comments":"30 pages, 10 figures, journal paper manuscript under review","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Metal additive manufacturing is gaining broad interest and increased use in\nthe industrial and academic fields. However, the quantification and\ncommercialization of standard parts usually require extensive experiments and\nexpensive post-characterization, which impedes the rapid development and\nadaptation of metal AM technologies. In this work, a similarity-based\nacceleration (S-acceleration) method for design of experiments is developed to\nreduce the time and costs associated with unveiling process-property (porosity\ndefects) relationships during manufacturing. With S-acceleration, part semantic\nfeatures from machine-setting parameters and physics-effects informed\ncharacteristics are explored for measuring mutual part similarities. A\nuser-defined simplification rate of experiments is proposed to purposely remove\nredundant parts before conducting experiments printing without sacrificing\ninformation gain as original full factorial experiment design. This\nS-acceleration design of experiments is demonstrated on a Concept Laser M2\nmachine for the experimental plan of modeling relationships between process\nparameters and part porosity defects. The printed part has 2 mm diameter by 4\nmm tall pin geometry considering variations in build location and orientation,\nlaser settings and powder feedstock are held constant. In total, 242 parts are\nmeasured to create a ground truth data set of porosity levels by using X-ray\ntomography microscopy. The S-acceleration method is assessed for performance\nconsidering 40%, 50%, and 60% of user-defined experiment simplification rates.\nThe repeated experiments are removed without ignoring the minority experiments\noutlier, assuring a similar process-property relation in the original\nexperiment plan. The experiment number is significantly reduced based on part\nsimilarity with minimal compromise of model accuracy and obtained knowledge.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:03:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Rui",""],["Liu","Sen",""],["Zhang","Xiaoli",""]]}
{"id":"2308.01525","submitter":"Jiyoung Lee","authors":"Jiyoung Lee, Seungho Kim, Seunghyun Won, Joonseok Lee, Marzyeh\n  Ghassemi, James Thorne, Jaeseok Choi, O-Kil Kwon, Edward Choi","title":"VisAlign: Dataset for Measuring the Degree of Alignment between AI and\n  Humans in Visual Perception","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  AI alignment refers to models acting towards human-intended goals,\npreferences, or ethical principles. Given that most large-scale deep learning\nmodels act as black boxes and cannot be manually controlled, analyzing the\nsimilarity between models and humans can be a proxy measure for ensuring AI\nsafety. In this paper, we focus on the models' visual perception alignment with\nhumans, further referred to as AI-human visual alignment. Specifically, we\npropose a new dataset for measuring AI-human visual alignment in terms of image\nclassification, a fundamental task in machine perception. In order to evaluate\nAI-human visual alignment, a dataset should encompass samples with various\nscenarios that may arise in the real world and have gold human perception\nlabels. Our dataset consists of three groups of samples, namely Must-Act (i.e.,\nMust-Classify), Must-Abstain, and Uncertain, based on the quantity and clarity\nof visual information in an image and further divided into eight categories.\nAll samples have a gold human perception label; even Uncertain (severely\nblurry) sample labels were obtained via crowd-sourcing. The validity of our\ndataset is verified by sampling theory, statistical theories related to survey\ndesign, and experts in the related fields. Using our dataset, we analyze the\nvisual alignment and reliability of five popular visual perception models and\nseven abstention methods. Our code and data is available at\n\\url{https://github.com/jiyounglee-0523/VisAlign}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:04:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lee","Jiyoung",""],["Kim","Seungho",""],["Won","Seunghyun",""],["Lee","Joonseok",""],["Ghassemi","Marzyeh",""],["Thorne","James",""],["Choi","Jaeseok",""],["Kwon","O-Kil",""],["Choi","Edward",""]]}
{"id":"2308.01526","submitter":"Kun Li","authors":"Kun Li, Dan Guo, Guoliang Chen, Feiyang Liu, Meng Wang","title":"Data Augmentation for Human Behavior Analysis in Multi-Person\n  Conversations","comments":"Solutions of HFUT-VUT Team at the ACM MM 2023 Grand Challenge\n  (MultiMediate: Multi-modal Behaviour Analysis for Artificial Mediation).\n  Accepted at ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612856","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present the solution of our team HFUT-VUT for the\nMultiMediate Grand Challenge 2023 at ACM Multimedia 2023. The solution covers\nthree sub-challenges: bodily behavior recognition, eye contact detection, and\nnext speaker prediction. We select Swin Transformer as the baseline and exploit\ndata augmentation strategies to address the above three tasks. Specifically, we\ncrop the raw video to remove the noise from other parts. At the same time, we\nutilize data augmentation to improve the generalization of the model. As a\nresult, our solution achieves the best results of 0.6262 for bodily behavior\nrecognition in terms of mean average precision and the accuracy of 0.7771 for\neye contact detection on the corresponding test set. In addition, our approach\nalso achieves comparable results of 0.5281 for the next speaker prediction in\nterms of unweighted average recall.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:04:40 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Kun",""],["Guo","Dan",""],["Chen","Guoliang",""],["Liu","Feiyang",""],["Wang","Meng",""]]}
{"id":"2308.01527","submitter":"Will Johnson","authors":"Will Johnson and Ningyuan Yao","title":"One-dimensional subgroups and connected components in non-abelian\n  $p$-adic definable groups","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize two of our previous results on abelian definable groups in\n$p$-adically closed fields to the non-abelian case. First, we show that if $G$\nis a definable group that is not definably compact, then $G$ has a\none-dimensional definable subgroup which is not definably compact. This is a\n$p$-adic analogue of the Peterzil-Steinhorn theorem for o-minimal theories.\nSecond, we show that if $G$ is a group definable over the standard model\n$\\mathbb{Q}_p$, then $G^0 = G^{00}$. As an application, definably amenable\ngroups over $\\mathbb{Q}_p$ are open subgroups of algebraic groups, up to finite\nfactors. We also prove that $G^0 = G^{00}$ when $G$ is a definable subgroup of\na linear algebraic group, over any model.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:06:45 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Johnson","Will",""],["Yao","Ningyuan",""]]}
{"id":"2308.01528","submitter":"De Huang","authors":"De Huang, Xiang Qin, Xiuyuan Wang, Dongyi Wei","title":"On the exact self-similar finite-time blowup of the Hou-Luo model with\n  smooth profiles","comments":"32 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2305.05895","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the 1D Hou-Luo model on the real line admits exact self-similar\nfinite-time blowup solutions with smooth self-similar profiles. The existence\nof these profiles is established via a fixed-point method that is purely\nanalytic. We also prove that the profiles satisfy some monotonicity and\nconvexity properties that are unknown before, and we give rigorous estimates on\nthe algebraic decay rates of the profiles in the far field. Our result\nsupplements the previous computer-assisted proof of self-similar finite-time\nblowup for the Hou-Luo model with finer characterizations of the profiles.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:07:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Huang","De",""],["Qin","Xiang",""],["Wang","Xiuyuan",""],["Wei","Dongyi",""]]}
{"id":"2308.01529","submitter":"Judy Fox","authors":"Navya Annapareddy, Yingzheng Liu, Judy Fox","title":"Towards Fair and Privacy Preserving Federated Learning for the\n  Healthcare Domain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning enables data sharing in healthcare contexts where it might\notherwise be difficult due to data-use-ordinances or security and communication\nconstraints. Distributed and shared data models allow models to become\ngeneralizable and learn from heterogeneous clients. While addressing data\nsecurity, privacy, and vulnerability considerations, data itself is not shared\nacross nodes in a given learning network. On the other hand, FL models often\nstruggle with variable client data distributions and operate on an assumption\nof independent and identically distributed data. As the field has grown, the\nnotion of fairness-aware federated learning mechanisms has also been introduced\nand is of distinct significance to the healthcare domain where many sensitive\ngroups and protected classes exist. In this paper, we create a benchmark\nmethodology for FAFL mechanisms under various heterogeneous conditions on\ndatasets in the healthcare domain typically outside the scope of current\nfederated learning benchmarks, such as medical imaging and waveform data\nformats. Our results indicate considerable variation in how various FAFL\nschemes respond to high levels of data heterogeneity. Additionally, doing so\nunder privacy-preserving conditions can create significant increases in network\ncommunication cost and latency compared to the typical federated learning\nscheme.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:08:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Annapareddy","Navya",""],["Liu","Yingzheng",""],["Fox","Judy",""]]}
{"id":"2308.01530","submitter":"Charles Xiao","authors":"Charles Xiao, Bolin Liao, and Elliot W. Hawkes","title":"Passively Adaptive Radiative Switch for Thermoregulation in Buildings","comments":"21 pages with supplementary information included","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the ever-growing need to reduce energy consumption, building materials\nthat passively heat or cool are gaining importance. However, many buildings\nrequire both heating and cooling, even within the same day. To date, few\ntechnologies can automatically switch between passive heating and cooling, and\nthose that can require a large temperature range to cycle states (>15o C),\nmaking them ineffective for daily switching. We present a passively adaptive\nradiative switch that leverages the expansion in phase-change energy storage\nmaterials to actuate the motion of louvers and can cycle states in less than 3o\nC. The black selective-absorber louvers induce high heat gain when closed, yet\nwhen open, expose a white, emissive surface for low heat gain. During an\noutdoor test in which temperature was held steady, our device reduced the\nenergetic cost of cooling by 3.1x and heating by 2.6x compared to non-switching\ndevices. Our concept opens the door for passively adaptive thermoregulating\nbuilding materials.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:09:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Xiao","Charles",""],["Liao","Bolin",""],["Hawkes","Elliot W.",""]]}
{"id":"2308.01531","submitter":"Ma Guancong","authors":"Hongkuan Zhang, Qiyuan Wang, Mathias Fink, Guancong Ma","title":"Optimizing multi-user sound communications in reverberating environments\n  with acoustic reconfigurable metasurfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  How do you ensure that, in a reverberant room, several people can speak\nsimultaneously to several other people, making themselves perfectly understood\nand without any crosstalk between messages? In this work, we report a\nconceptual solution to this problem by developing an intelligent acoustic wall,\nwhich can be reconfigured electronically and is controlled by a learning\nalgorithm that adapts to the geometry of the room and the positions of sources\nand receivers. To this end, a portion of the room boundaries is covered with a\nsmart mirror made of a broadband acoustic reconfigurable metasurface (ARMs)\ndesigned to provide a two-state (0 or {\\pi}) phase shift in the reflected waves\nby 200 independently tunable units. The whole phase pattern is optimized to\nmaximize the Shannon capacity while minimizing crosstalk between the different\nsources and receivers. We demonstrate the control of multi-spectral sound\nfields covering a spectrum much larger than the coherence bandwidth of the room\nfor diverse striking functionalities, including crosstalk-free acoustic\ncommunication, frequency-multiplexed communications, and multi-user\ncommunications. An experiment conducted with two music sources for two\ndifferent people demonstrates a crosstalk-free simultaneous music playback. Our\nwork opens new routes for the control of sound waves in complex media and for a\nnew generation of acoustic devices.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:10:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Hongkuan",""],["Wang","Qiyuan",""],["Fink","Mathias",""],["Ma","Guancong",""]]}
{"id":"2308.01532","submitter":"Jiazheng Xing","authors":"Jiazheng Xing, Mengmeng Wang, Xiaojun Hou, Guang Dai, Jingdong Wang,\n  Yong Liu","title":"Multimodal Adaptation of CLIP for Few-Shot 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":"  Applying large-scale pre-trained visual models like CLIP to few-shot action\nrecognition tasks can benefit performance and efficiency. Utilizing the\n\"pre-training, fine-tuning\" paradigm makes it possible to avoid training a\nnetwork from scratch, which can be time-consuming and resource-intensive.\nHowever, this method has two drawbacks. First, limited labeled samples for\nfew-shot action recognition necessitate minimizing the number of tunable\nparameters to mitigate over-fitting, also leading to inadequate fine-tuning\nthat increases resource consumption and may disrupt the generalized\nrepresentation of models. Second, the video's extra-temporal dimension\nchallenges few-shot recognition's effective temporal modeling, while\npre-trained visual models are usually image models. This paper proposes a novel\nmethod called Multimodal Adaptation of CLIP (MA-CLIP) to address these issues.\nIt adapts CLIP for few-shot action recognition by adding lightweight adapters,\nwhich can minimize the number of learnable parameters and enable the model to\ntransfer across different tasks quickly. The adapters we design can combine\ninformation from video-text multimodal sources for task-oriented spatiotemporal\nmodeling, which is fast, efficient, and has low training costs. Additionally,\nbased on the attention mechanism, we design a text-guided prototype\nconstruction module that can fully utilize video-text information to enhance\nthe representation of video prototypes. Our MA-CLIP is plug-and-play, which can\nbe used in any different few-shot action recognition temporal alignment metric.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:17:25 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Xing","Jiazheng",""],["Wang","Mengmeng",""],["Hou","Xiaojun",""],["Dai","Guang",""],["Wang","Jingdong",""],["Liu","Yong",""]]}
{"id":"2308.01533","submitter":"Biru Zhang","authors":"Biru Zhang, Jiankun Wang, Max Q.-H. Meng","title":"Multi-robot Path Planning with Rapidly-exploring Random Disjointed-Trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-robot path planning is a computational process involving finding paths\nfor each robot from its start to the goal while ensuring collision-free\noperation. It is widely used in robots and autonomous driving. However, the\ncomputational time of multi-robot path planning algorithms is enormous,\nresulting in low efficiency in practical applications. To address this problem,\nthis article proposes a novel multi-robot path planning algorithm (Multi-Agent\nRapidly-exploring Random Disjointed-Trees*, MA-RRdT*) based on multi-tree\nrandom sampling. The proposed algorithm is based on a single-robot path\nplanning algorithm (Rapidly-exploring Random disjointed-Trees*, RRdT*). The\nnovel MA-RRdT* algorithm has the advantages of fast speed, high space\nexploration efficiency, and suitability for complex maps. Comparative\nexperiments are completed to evaluate the effectiveness of MA-RRdT*. The final\nexperimental results validate the superior performance of the MA-RRdT*\nalgorithm in terms of time cost and space exploration efficiency.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:21:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Biru",""],["Wang","Jiankun",""],["Meng","Max Q. -H.",""]]}
{"id":"2308.01534","submitter":"Heather Newman","authors":"Sami Davies, Benjamin Moseley, Heather Newman","title":"One Partition Approximating All $\\ell_p$-norm Objectives in Correlation\n  Clustering","comments":"24 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper considers correlation clustering on unweighted complete graphs. We\ngive a combinatorial algorithm that returns a single clustering solution that\nis simultaneously $O(1)$-approximate for all $\\ell_p$-norms of the disagreement\nvector. This proves that minimal sacrifice is needed in order to optimize\ndifferent norms of the disagreement vector. Our algorithm is the first\ncombinatorial approximation algorithm for the $\\ell_2$-norm objective, and more\ngenerally the first combinatorial algorithm for the $\\ell_p$-norm objective\nwhen $2 \\leq p < \\infty$. It is also faster than all previous algorithms that\nminimize the $\\ell_p$-norm of the disagreement vector, with run-time\n$O(n^\\omega)$, where $O(n^\\omega)$ is the time for matrix multiplication on $n\n\\times n$ matrices. When the maximum positive degree in the graph is at most\n$\\Delta$, this can be improved to a run-time of $O(n\\Delta^2 \\log n)$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:26:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Davies","Sami",""],["Moseley","Benjamin",""],["Newman","Heather",""]]}
{"id":"2308.01535","submitter":"Hancheng Cao","authors":"Hancheng Cao, Sofia Eleni Spatharioti, Daniel G. Goldstein, Jake M.\n  Hofman","title":"Comparing scalable strategies for generating numerical perspectives","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL cs.CY","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Numerical perspectives help people understand extreme and unfamiliar numbers\n(e.g., \\$330 billion is about \\$1,000 per person in the United States). While\nresearch shows perspectives to be helpful, generating them at scale is\nchallenging both because it is difficult to identify what makes some analogies\nmore helpful than others, and because what is most helpful can vary based on\nthe context in which a given number appears. Here we present and compare three\npolicies for large-scale perspective generation: a rule-based approach, a\ncrowdsourced system, and a model that uses Wikipedia data and semantic\nsimilarity (via BERT embeddings) to generate context-specific perspectives. We\nfind that the combination of these three approaches dominates any single\nmethod, with different approaches excelling in different settings and users\ndisplaying heterogeneous preferences across approaches. We conclude by\ndiscussing our deployment of perspectives in a widely-used online word\nprocessor.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:35:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cao","Hancheng",""],["Spatharioti","Sofia Eleni",""],["Goldstein","Daniel G.",""],["Hofman","Jake M.",""]]}
{"id":"2308.01536","submitter":"Sanghyeon Na","authors":"Sanghyeon Na","title":"MFIM: Megapixel Facial Identity Manipulation","comments":"ECCV 2022 accepted","journal-ref":null,"doi":"10.1007/978-3-031-19778-9_9","report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Face swapping is a task that changes a facial identity of a given image to\nthat of another person. In this work, we propose a novel face-swapping\nframework called Megapixel Facial Identity Manipulation (MFIM). The\nface-swapping model should achieve two goals. First, it should be able to\ngenerate a high-quality image. We argue that a model which is proficient in\ngenerating a megapixel image can achieve this goal. However, generating a\nmegapixel image is generally difficult without careful model design. Therefore,\nour model exploits pretrained StyleGAN in the manner of GAN-inversion to\neffectively generate a megapixel image. Second, it should be able to\neffectively transform the identity of a given image. Specifically, it should be\nable to actively transform ID attributes (e.g., face shape and eyes) of a given\nimage into those of another person, while preserving ID-irrelevant attributes\n(e.g., pose and expression). To achieve this goal, we exploit 3DMM that can\ncapture various facial attributes. Specifically, we explicitly supervise our\nmodel to generate a face-swapped image with the desirable attributes using\n3DMM. We show that our model achieves state-of-the-art performance through\nextensive experiments. Furthermore, we propose a new operation called ID\nmixing, which creates a new identity by semantically mixing the identities of\nseveral people. It allows the user to customize the new identity.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:36:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Na","Sanghyeon",""]]}
{"id":"2308.01537","submitter":"Yang Liu","authors":"Yang Liu, Zhaoyang Xia, Mengyang Zhao, Donglai Wei, Yuzheng Wang, Liu\n  Siao, Bobo Ju, Gaoyun Fang, Jing Liu, Liang Song","title":"Learning Causality-inspired Representation Consistency for Video Anomaly\n  Detection","comments":"Accepted to ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video anomaly detection is an essential yet challenging task in the\nmultimedia community, with promising applications in smart cities and secure\ncommunities. Existing methods attempt to learn abstract representations of\nregular events with statistical dependence to model the endogenous normality,\nwhich discriminates anomalies by measuring the deviations to the learned\ndistribution. However, conventional representation learning is only a crude\ndescription of video normality and lacks an exploration of its underlying\ncausality. The learned statistical dependence is unreliable for diverse regular\nevents in the real world and may cause high false alarms due to\novergeneralization. Inspired by causal representation learning, we think that\nthere exists a causal variable capable of adequately representing the general\npatterns of regular events in which anomalies will present significant\nvariations. Therefore, we design a causality-inspired representation\nconsistency (CRC) framework to implicitly learn the unobservable causal\nvariables of normality directly from available normal videos and detect\nabnormal events with the learned representation consistency. Extensive\nexperiments show that the causality-inspired normality is robust to regular\nevents with label-independent shifts, and the proposed CRC framework can\nquickly and accurately detect various complicated anomalies from real-world\nsurveillance videos.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:45:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Yang",""],["Xia","Zhaoyang",""],["Zhao","Mengyang",""],["Wei","Donglai",""],["Wang","Yuzheng",""],["Siao","Liu",""],["Ju","Bobo",""],["Fang","Gaoyun",""],["Liu","Jing",""],["Song","Liang",""]]}
{"id":"2308.01538","submitter":"Weishun Zhong","authors":"Weishun Zhong","title":"Non-equilibrium physics: from spin glasses to machine and neural\n  learning","comments":"PhD dissertation, MIT Physics (2023). This arXiv version contains a\n  updated summary of the thesis in Chapter 1","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cs.AI quant-ph stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Disordered many-body systems exhibit a wide range of emergent phenomena\nacross different scales. These complex behaviors can be utilized for various\ninformation processing tasks such as error correction, learning, and\noptimization. Despite the empirical success of utilizing these systems for\nintelligent tasks, the underlying principles that govern their emergent\nintelligent behaviors remain largely unknown. In this thesis, we aim to\ncharacterize such emergent intelligence in disordered systems through\nstatistical physics. We chart a roadmap for our efforts in this thesis based on\ntwo axes: learning mechanisms (long-term memory vs. working memory) and\nlearning dynamics (artificial vs. natural). Throughout our journey, we uncover\nrelationships between learning mechanisms and physical dynamics that could\nserve as guiding principles for designing intelligent systems. We hope that our\ninvestigation into the emergent intelligence of seemingly disparate learning\nsystems can expand our current understanding of intelligence beyond neural\nsystems and uncover a wider range of computational substrates suitable for AI\napplications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:56:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhong","Weishun",""]]}
{"id":"2308.01539","submitter":"Rahma Mukta","authors":"Rahma Mukta, Rue C. Teh, Hye-young Paik, Qinghua Lu and Salil S.\n  Kanhere","title":"VCTP: A Verifiable Credential-based Trust Propagation Protocol for\n  Personal Issuers in Self-Sovereign Identity Platforms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self Sovereign Identity (SSI) is an emerging identity system that facilitates\nsecure credential issuance and verification without placing trust in any\ncentralised authority. To bypass central trust, most SSI implementations place\nblockchain as a trusted mediator by placing credential transactions on-chain.\nYet, existing SSI platforms face trust issues as all credential issuers in SSI\nare not supported with adequate trust. Current SSI solutions provide trust\nsupport to the officiated issuers (e.g., government agencies), who must follow\na precise process to assess their credentials. However, there is no structured\ntrust support for individuals of SSI who may attempt to issue a credential\n(e.g., letter of consent) in the context of business processes. Therefore, some\nrisk-averse verifiers in the system may not accept the credentials from\nindividual issuers to avoid carrying the cost of mishaps from potentially\ninadmissible credentials without reliance on a trusted agency. This paper\nproposes a trust propagation protocol that supports individual users to be\ntrusted as verifiable issuers in the SSI platform by establishing a trust\npropagation credential template in the blockchain. Our approach utilises (i)\nthe sanitizable signature scheme to propagate the required trust to an\nindividual issuer, (ii) a voting mechanism to minimises the possibility of\ncollusion. Our implementation demonstrates that the solution is both practical\nand performs well under varying system loads.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:01:51 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mukta","Rahma",""],["Teh","Rue C.",""],["Paik","Hye-young",""],["Lu","Qinghua",""],["Kanhere","Salil S.",""]]}
{"id":"2308.01540","submitter":"Di Huang","authors":"Di Huang, Abdusalam Abdukerim, Zihao Bo, Wei Chen, Xun Chen, Yunhua\n  Chen, Chen Cheng, Zhaokan Cheng, Xiangyi Cui, Yingjie Fan, Deqing Fang,\n  Changbo Fu, Mengting Fu, Lisheng Geng, Karl Giboni, Linhui Gu, Xuyuan Guo,\n  Chencheng Han, Ke Han, Changda He, Jinrong He, Yanlin Huang, Zhou Huang,\n  Ruquan Hou, Xiangdong Ji, Yonglin Ju, Chenxiang Li, Jiafu Li, Mingchuan Li,\n  Shu Li, Shuaijie Li, Qing Lin, Jianglai Liu, Xiaoying Lu, Lingyin Luo,\n  Yunyang Luo, Wenbo Ma, Yugang Ma, Yajun Mao, Yue Meng, Xuyang Ning, Ningchun\n  Qi, Zhicheng Qian, Xiangxiang Ren, Nasir Shaheed, Changsong Shang, Xiaofeng\n  Shang, Guofang Shen, Lin Si, Wenliang Sun, Andi Tan, Yi Tao, Anqing Wang,\n  Meng Wang, Qiuhong Wang, Shaobo Wang, Siguang Wang, Wei Wang, Xiuli Wang,\n  Zhou Wang, Yuehuan Wei, Mengmeng Wu, Weihao Wu, Jingkai Xia, Mengjiao Xiao,\n  Xiang Xiao, Pengwei Xie, Binbin Yan, Xiyu Yan, Jijun Yang, Yong Yang, Yukun\n  Yao, Chunxu Yu, Jumin Yuan, Ying Yuan, Zhe Yuan, Xinning Zeng, Dan Zhang,\n  Minzhen Zhang, Peng Zhang, Shibo Zhang, Shu Zhang, Tao Zhang, Yang Zhang,\n  Yingxin Zhang, Yuanyuan Zhang, Li Zhao, Qibin Zheng, Jifang Zhou, Ning Zhou,\n  Xiaopeng Zhou, Yong Zhou, Yubo Zhou (for the PandaX Collaboration) Ran Huo","title":"A search for dark matter-nucleon interactions with a dark mediator in\n  PandaX-4T","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report results of a search for dark matter-nucleon interactions via a dark\nmediator using optimized low-energy data from the PandaX-4T liquid xenon\nexperiment. With the ionization-signal-only data and utilizing the Migdal\neffect, we set the most stringent limits on the cross section for dark matter\nmasses ranging from 40~$\\rm{MeV}$$/c^2$ to 2~$\\rm{GeV}$$/c^2$. Under the\nassumption that the dark mediator is a dark photon, we provide new limits on\nthe kinetic mixing parameter between the dark photon and the ordinary photon,\nand rule out significant parameter space of the thermal relic dark matter under\nthis scenario.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:03:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Huang","Di","","for the PandaX Collaboration"],["Abdukerim","Abdusalam","","for the PandaX Collaboration"],["Bo","Zihao","","for the PandaX Collaboration"],["Chen","Wei","","for the PandaX Collaboration"],["Chen","Xun","","for the PandaX Collaboration"],["Chen","Yunhua","","for the PandaX Collaboration"],["Cheng","Chen","","for the PandaX Collaboration"],["Cheng","Zhaokan","","for the PandaX Collaboration"],["Cui","Xiangyi","","for the PandaX Collaboration"],["Fan","Yingjie","","for the PandaX Collaboration"],["Fang","Deqing","","for the PandaX Collaboration"],["Fu","Changbo","","for the PandaX Collaboration"],["Fu","Mengting","","for the PandaX Collaboration"],["Geng","Lisheng","","for the PandaX Collaboration"],["Giboni","Karl","","for the PandaX Collaboration"],["Gu","Linhui","","for the PandaX Collaboration"],["Guo","Xuyuan","","for the PandaX Collaboration"],["Han","Chencheng","","for the PandaX Collaboration"],["Han","Ke","","for the PandaX Collaboration"],["He","Changda","","for the PandaX Collaboration"],["He","Jinrong","","for the PandaX Collaboration"],["Huang","Yanlin","","for the PandaX Collaboration"],["Huang","Zhou","","for the PandaX Collaboration"],["Hou","Ruquan","","for the PandaX Collaboration"],["Ji","Xiangdong","","for the PandaX Collaboration"],["Ju","Yonglin","","for the PandaX Collaboration"],["Li","Chenxiang","","for the PandaX Collaboration"],["Li","Jiafu","","for the PandaX Collaboration"],["Li","Mingchuan","","for the PandaX Collaboration"],["Li","Shu","","for the PandaX Collaboration"],["Li","Shuaijie","","for the PandaX Collaboration"],["Lin","Qing","","for the PandaX Collaboration"],["Liu","Jianglai","","for the PandaX Collaboration"],["Lu","Xiaoying","","for the PandaX Collaboration"],["Luo","Lingyin","","for the PandaX Collaboration"],["Luo","Yunyang","","for the PandaX Collaboration"],["Ma","Wenbo","","for the PandaX Collaboration"],["Ma","Yugang","","for the PandaX Collaboration"],["Mao","Yajun","","for the PandaX Collaboration"],["Meng","Yue","","for the PandaX Collaboration"],["Ning","Xuyang","","for the PandaX Collaboration"],["Qi","Ningchun","","for the PandaX Collaboration"],["Qian","Zhicheng","","for the PandaX Collaboration"],["Ren","Xiangxiang","","for the PandaX Collaboration"],["Shaheed","Nasir","","for the PandaX Collaboration"],["Shang","Changsong","","for the PandaX Collaboration"],["Shang","Xiaofeng","","for the PandaX Collaboration"],["Shen","Guofang","","for the PandaX Collaboration"],["Si","Lin","","for the PandaX Collaboration"],["Sun","Wenliang","","for the PandaX Collaboration"],["Tan","Andi","","for the PandaX Collaboration"],["Tao","Yi","","for the PandaX Collaboration"],["Wang","Anqing","","for the PandaX Collaboration"],["Wang","Meng","","for the PandaX Collaboration"],["Wang","Qiuhong","","for the PandaX Collaboration"],["Wang","Shaobo","","for the PandaX Collaboration"],["Wang","Siguang","","for the PandaX Collaboration"],["Wang","Wei","","for the PandaX Collaboration"],["Wang","Xiuli","","for the PandaX Collaboration"],["Wang","Zhou","","for the PandaX Collaboration"],["Wei","Yuehuan","","for the PandaX Collaboration"],["Wu","Mengmeng","","for the PandaX Collaboration"],["Wu","Weihao","","for the PandaX Collaboration"],["Xia","Jingkai","","for the PandaX Collaboration"],["Xiao","Mengjiao","","for the PandaX Collaboration"],["Xiao","Xiang","","for the PandaX Collaboration"],["Xie","Pengwei","","for the PandaX Collaboration"],["Yan","Binbin","","for the PandaX Collaboration"],["Yan","Xiyu","","for the PandaX Collaboration"],["Yang","Jijun","","for the PandaX Collaboration"],["Yang","Yong","","for the PandaX Collaboration"],["Yao","Yukun","","for the PandaX Collaboration"],["Yu","Chunxu","","for the PandaX Collaboration"],["Yuan","Jumin","","for the PandaX Collaboration"],["Yuan","Ying","","for the PandaX Collaboration"],["Yuan","Zhe","","for the PandaX Collaboration"],["Zeng","Xinning","","for the PandaX Collaboration"],["Zhang","Dan","","for the PandaX Collaboration"],["Zhang","Minzhen","","for the PandaX Collaboration"],["Zhang","Peng","","for the PandaX Collaboration"],["Zhang","Shibo","","for the PandaX Collaboration"],["Zhang","Shu","","for the PandaX Collaboration"],["Zhang","Tao","","for the PandaX Collaboration"],["Zhang","Yang","","for the PandaX Collaboration"],["Zhang","Yingxin","","for the PandaX Collaboration"],["Zhang","Yuanyuan","","for the PandaX Collaboration"],["Zhao","Li","","for the PandaX Collaboration"],["Zheng","Qibin","","for the PandaX Collaboration"],["Zhou","Jifang","","for the PandaX Collaboration"],["Zhou","Ning","","for the PandaX Collaboration"],["Zhou","Xiaopeng","","for the PandaX Collaboration"],["Zhou","Yong","","for the PandaX Collaboration"],["Zhou","Yubo","","for the PandaX Collaboration"],["Huo","Ran",""]]}
{"id":"2308.01541","submitter":"Zeyu Cai","authors":"Zeyu Cai, Chengqian Jin, Feipeng Da","title":"DMDC: Dynamic-mask-based dual camera design for snapshot Hyperspectral\n  Imaging","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning methods are developing rapidly in coded aperture snapshot\nspectral imaging (CASSI). The number of parameters and FLOPs of existing\nstate-of-the-art methods (SOTA) continues to increase, but the reconstruction\naccuracy improves slowly. Current methods still face two problems: 1) The\nperformance of the spatial light modulator (SLM) is not fully developed due to\nthe limitation of fixed Mask coding. 2) The single input limits the network\nperformance. In this paper we present a dynamic-mask-based dual camera system,\nwhich consists of an RGB camera and a CASSI system running in parallel. First,\nthe system learns the spatial feature distribution of the scene based on the\nRGB images, then instructs the SLM to encode each scene, and finally sends both\nRGB and CASSI images to the network for reconstruction. We further designed the\nDMDC-net, which consists of two separate networks, a small-scale CNN-based\ndynamic mask network for dynamic adjustment of the mask and a multimodal\nreconstruction network for reconstruction using RGB and CASSI measurements.\nExtensive experiments on multiple datasets show that our method achieves more\nthan 9 dB improvement in PSNR over the SOTA.\n(https://github.com/caizeyu1992/DMDC)\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:10:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cai","Zeyu",""],["Jin","Chengqian",""],["Da","Feipeng",""]]}
{"id":"2308.01542","submitter":"Ziheng Huang","authors":"Ziheng Huang, Sebastian Gutierrez, Hemanth Kamana, Stephen MacNeil","title":"Memory Sandbox: Transparent and Interactive Memory Management for\n  Conversational Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The recent advent of large language models (LLM) has resulted in\nhigh-performing conversational agents such as chatGPT. These agents must\nremember key information from an ongoing conversation to provide responses that\nare contextually relevant to the user. However, these agents have limited\nmemory and can be distracted by irrelevant parts of the conversation. While\nmany strategies exist to manage conversational memory, users currently lack\naffordances for viewing and controlling what the agent remembers, resulting in\na poor mental model and conversational breakdowns. In this paper, we present\nMemory Sandbox, an interactive system and design probe that allows users to\nmanage the conversational memory of LLM-powered agents. By treating memories as\ndata objects that can be viewed, manipulated, recorded, summarized, and shared\nacross conversations, Memory Sandbox provides interaction affordances for users\nto manage how the agent should `see' the conversation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:11:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Huang","Ziheng",""],["Gutierrez","Sebastian",""],["Kamana","Hemanth",""],["MacNeil","Stephen",""]]}
{"id":"2308.01543","submitter":"Debosmita Bhaumik","authors":"Debosmita Bhaumik, Julian Togelius, Georgios N. Yannakakis, Ahmed\n  Khalifa","title":"Lode Enhancer: Level Co-creation Through Scaling","comments":null,"journal-ref":null,"doi":"10.1145/3582437.3587206","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore AI-powered upscaling as a design assistance tool in the context of\ncreating 2D game levels. Deep neural networks are used to upscale artificially\ndownscaled patches of levels from the puzzle platformer game Lode Runner. The\ntrained networks are incorporated into a web-based editor, where the user can\ncreate and edit levels at three different levels of resolution: 4x4, 8x8, and\n16x16. An edit at any resolution instantly transfers to the other resolutions.\nAs upscaling requires inventing features that might not be present at lower\nresolutions, we train neural networks to reproduce these features. We introduce\na neural network architecture that is capable of not only learning upscaling\nbut also giving higher priority to less frequent tiles. To investigate the\npotential of this tool and guide further development, we conduct a qualitative\nstudy with 3 designers to understand how they use it. Designers enjoyed\nco-designing with the tool, liked its underlying concept, and provided feedback\nfor further improvement.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:23:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bhaumik","Debosmita",""],["Togelius","Julian",""],["Yannakakis","Georgios N.",""],["Khalifa","Ahmed",""]]}
{"id":"2308.01544","submitter":"Sarah Schwettmann","authors":"Sarah Schwettmann, Neil Chowdhury, Antonio Torralba","title":"Multimodal Neurons in Pretrained Text-Only Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Language models demonstrate remarkable capacity to generalize representations\nlearned in one modality to downstream tasks in other modalities. Can we trace\nthis ability to individual neurons? We study the case where a frozen text\ntransformer is augmented with vision using a self-supervised visual encoder and\na single linear projection learned on an image-to-text task. Outputs of the\nprojection layer are not immediately decodable into language describing image\ncontent; instead, we find that translation between modalities occurs deeper\nwithin the transformer. We introduce a procedure for identifying \"multimodal\nneurons\" that convert visual representations into corresponding text, and\ndecoding the concepts they inject into the model's residual stream. In a series\nof experiments, we show that multimodal neurons operate on specific visual\nconcepts across inputs, and have a systematic causal effect on image\ncaptioning.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:27:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Schwettmann","Sarah",""],["Chowdhury","Neil",""],["Torralba","Antonio",""]]}
{"id":"2308.01545","submitter":"Somayeh Mehrabankar","authors":"Somayeh Mehrabankar, Miguel \\'Angel Garc\\'ia-March, Carmen G.\n  Almud\\'ever, and Armando P\\'erez","title":"Reducing the number of qubits by a half in one dimensional quantum\n  simulations of Ising chains","comments":"14 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the Ising model using the Block Renormalization Group Method\n(BRGM), focusing on its behavior across different system sizes. The BRGM\nreduces the number of spins by a factor of 1/2, effectively preserving\nessential physical features of the Ising model while using only half the spins.\nThrough a comparative analysis, we demonstrate that as the system size\nincreases, there is a convergence between results obtained from the original\nand renormalized Hamiltonians, provided the coupling constants are redefined\naccordingly. Remarkably, for a spin chain with 24 spins, all physical features,\nincluding magnetization, correlation function, and entanglement entropy,\nexhibit an exact correspondence with the results from the original Hamiltonian.\nThe success of BRGM in accurately characterizing the Ising model, even with a\nrelatively small number of spins, underscores its robustness and utility in\nstudying complex physical systems, and facilitates its simulation on current\nNISQ computers, where the available number of qubits is largely constrained.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:33:31 GMT"},{"version":"v2","created":"Sun, 6 Aug 2023 11:10:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mehrabankar","Somayeh",""],["Garc\u00eda-March","Miguel \u00c1ngel",""],["Almud\u00e9ver","Carmen G.",""],["P\u00e9rez","Armando",""]]}
{"id":"2308.01546","submitter":"Ke Chen","authors":"Ke Chen, Yusong Wu, Haohe Liu, Marianna Nezhurina, Taylor\n  Berg-Kirkpatrick, Shlomo Dubnov","title":"MusicLDM: Enhancing Novelty in Text-to-Music Generation Using\n  Beat-Synchronous Mixup Strategies","comments":"16 pages, 3 figures, 2 tables, demo page: https://musicldm.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.LG cs.MM eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Diffusion models have shown promising results in cross-modal generation\ntasks, including text-to-image and text-to-audio generation. However,\ngenerating music, as a special type of audio, presents unique challenges due to\nlimited availability of music data and sensitive issues related to copyright\nand plagiarism. In this paper, to tackle these challenges, we first construct a\nstate-of-the-art text-to-music model, MusicLDM, that adapts Stable Diffusion\nand AudioLDM architectures to the music domain. We achieve this by retraining\nthe contrastive language-audio pretraining model (CLAP) and the Hifi-GAN\nvocoder, as components of MusicLDM, on a collection of music data samples.\nThen, to address the limitations of training data and to avoid plagiarism, we\nleverage a beat tracking model and propose two different mixup strategies for\ndata augmentation: beat-synchronous audio mixup and beat-synchronous latent\nmixup, which recombine training audio directly or via a latent embeddings\nspace, respectively. Such mixup strategies encourage the model to interpolate\nbetween musical training samples and generate new music within the convex hull\nof the training data, making the generated music more diverse while still\nstaying faithful to the corresponding style. In addition to popular evaluation\nmetrics, we design several new evaluation metrics based on CLAP score to\ndemonstrate that our proposed MusicLDM and beat-synchronous mixup strategies\nimprove both the quality and novelty of generated music, as well as the\ncorrespondence between input text and generated music.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 05:35:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chen","Ke",""],["Wu","Yusong",""],["Liu","Haohe",""],["Nezhurina","Marianna",""],["Berg-Kirkpatrick","Taylor",""],["Dubnov","Shlomo",""]]}
{"id":"2308.01547","submitter":"Haoqi Wang","authors":"Haoqi Wang, Zhizhong Li and Wayne Zhang","title":"Get the Best of Both Worlds: Improving Accuracy and Transferability by\n  Grassmann Class Representation","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generalize the class vectors found in neural networks to linear subspaces\n(i.e.~points in the Grassmann manifold) and show that the Grassmann Class\nRepresentation (GCR) enables the simultaneous improvement in accuracy and\nfeature transferability. In GCR, each class is a subspace and the logit is\ndefined as the norm of the projection of a feature onto the class subspace. We\nintegrate Riemannian SGD into deep learning frameworks such that class\nsubspaces in a Grassmannian are jointly optimized with the rest model\nparameters. Compared to the vector form, the representative capability of\nsubspaces is more powerful. We show that on ImageNet-1K, the top-1 error of\nResNet50-D, ResNeXt50, Swin-T and Deit3-S are reduced by 5.6%, 4.5%, 3.0% and\n3.5%, respectively. Subspaces also provide freedom for features to vary and we\nobserved that the intra-class feature variability grows when the subspace\ndimension increases. Consequently, we found the quality of GCR features is\nbetter for downstream tasks. For ResNet50-D, the average linear transfer\naccuracy across 6 datasets improves from 77.98% to 79.70% compared to the\nstrong baseline of vanilla softmax. For Swin-T, it improves from 81.5% to 83.4%\nand for Deit3, it improves from 73.8% to 81.4%. With these encouraging results,\nwe believe that more applications could benefit from the Grassmann class\nrepresentation. Code is released at https://github.com/innerlee/GCR.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:02:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wang","Haoqi",""],["Li","Zhizhong",""],["Zhang","Wayne",""]]}
{"id":"2308.01548","submitter":"Molla Ahamed","authors":"Sanju Mandal, Partha Pratim Roy, Molla Basir Ahamed","title":"Hankel and Toeplitz determinants of logarithmic coefficients of Inverse\n  functions for certain classes of univalent functions","comments":"15 pages. arXiv admin note: substantial text overlap with\n  arXiv:2305.12500, arXiv:2307.14365","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Hankel and Toeplitz determinants $H_{2,1}(F_{f^{-1}}/2)$ and\n$T_{2,1}(F_{f^{-1}}/2)$ are defined as: \\begin{align*}\n  H_{2,1}(F_{f^{-1}}/2):= \\begin{vmatrix}\n  \\Gamma_1 & \\Gamma_2\n  \\Gamma_2 & \\Gamma_3\n  \\end{vmatrix}\n  \\;\\;\\mbox{and} \\;\\;\n  T_{2,1}(F_{f^{-1}}/2):= \\begin{vmatrix}\n  \\Gamma_1 & \\Gamma_2\n  \\Gamma_2 & \\Gamma_1\n  \\end{vmatrix} \\end{align*} where $\\Gamma_1, \\Gamma_2,$ and $\\Gamma_3$ are the\nfirst, second and third logarithmic coefficients of inverse functions belonging\nto the class $\\mathcal{S}$ of normalized univalent functions. In this article,\nwe establish sharp inequalities $|H_{2,1}(F_{f^{-1}}/2)|\\leq 1/4$,\n$|H_{2,1}(F_{f^{-1}}/2)| \\leq 1/36$, $|T_{2,1}(F_{f^{-1}}/2)|\\leq 5/16$ and\n$|T_{2,1}(F_{f^{-1}}/2)|\\leq 145/2304$ for the logarithmic coefficients of\ninverse functions for the classes starlike functions and convex functions with\nrespect to symmetric points. In addition, our findings are substantiated\nfurther through the incorporation of illustrative examples, which support the\nstrict inequality and lend credence to our conclusions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:03:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mandal","Sanju",""],["Roy","Partha Pratim",""],["Ahamed","Molla Basir",""]]}
{"id":"2308.01549","submitter":"Zhifei Li","authors":"Zhifei Li and Daiqin Su","title":"Correcting biased noise using Gottesman-Kitaev-Preskill repetition code\n  with noisy ancilla","comments":"22 pages, 16 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Concatenation of a bosonic code with a qubit code is one of the promising\nways to achieve fault-tolerant quantum computation. As one of the most\nimportant bosonic codes, Gottesman-Kitaev-Preskill (GKP) code is proposed to\ncorrect small displacement error in phase space. If the noise in phase space is\nbiased, square-lattice GKP code can be concatenated with XZZX surface code or\nrepetition code that promises a high fault-tolerant threshold to suppress the\nlogical error. In this work, we study the performance of GKP repetition codes\nwith physical ancillary GKP qubits in correcting biased noise. We find that\nthere exists a critical value of noise variance for the ancillary GKP qubit\nsuch that the logical Pauli error rate decreases when increasing the code size.\nFurthermore, one round of GKP error correction has to be performed before\nconcatenating with repetition code. Our study paves the way for practical\nimplementation of error correction by concatenating GKP code with low-level\nqubit codes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:14:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Zhifei",""],["Su","Daiqin",""]]}
{"id":"2308.01550","submitter":"Mariola Klusek-Gawenda","authors":"P. Jucha, M. Klusek-Gawenda and A. Szczurek","title":"Light-by-light scattering in ultraperipheral collisions of heavy ions\n  with future FoCal and ALICE 3 detectors","comments":"20 pages, 19 Figures, 3 Tables; misprint corrected, 2 figures added","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss possible future studies of photon-photon (light-by-light)\nscattering using a planned FoCal and ALICE 3 detectors. We include different\nmechanisms of $\\gamma\\gamma\\to\\gamma\\gamma$ scattering, such as double-hadronic\nphoton fluctuations, $t/u$-channel neutral pion exchange or resonance\nexcitations ($\\gamma \\gamma \\to R$) and deexcitation ($R \\to \\gamma \\gamma$).\nThe broad range of (pseudo)rapidities and lower cuts on transverse momenta open\na necessity to consider not only dominant box contributions but also other\nsubleading contributions. Here we include low mass resonant $R = \\pi^0$,\n$\\eta$, $\\eta'$ contributions. The resonance contributions give intermediate\nphoton transverse momenta. However, these contributions can be eliminated by\nimposing windows on di-photon invariant mass. We study and quantify individual\nbox contributions (leptonic, quarkish). The electron/positron boxes dominate at\nlow $M_{\\gamma \\gamma}<1$ GeV di-photon invariant masses. The\nPbPb$\\to$PbPb$\\gamma \\gamma$ cross section is calculated within equivalent\nphoton approximation in the impact parameter space. Several differential\ndistributions are presented and discussed. We consider four different kinematic\nregions. We predict cross section in the (mb-b) range for typical ALICE 3 cuts,\na few orders of magnitude larger than for the current ATLAS or CMS experiments.\nWe also consider the two-$\\pi^0$ background which can, in principle, be\neliminated at the new kinematical range for the ALICE 3 measurements by\nimposing dedicated cuts on di-photon transverse momentum and\\or so-called\nvector asymmetry.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:18:43 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 09:37:23 GMT"},{"version":"v3","created":"Wed, 16 Aug 2023 15:29:09 GMT"},{"version":"v4","created":"Fri, 18 Aug 2023 19:26:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jucha","P.",""],["Klusek-Gawenda","M.",""],["Szczurek","A.",""]]}
{"id":"2308.01551","submitter":"Wenkai Yang","authors":"Yang Wenkai Ji Ruihang Zhang Yuxiang Lei Hao and Zhao Zijie","title":"Avoidance Navigation Based on Offline Pre-Training Reinforcement\n  Learning","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":"  This paper presents a Pre-Training Deep Reinforcement Learning(DRL) for\navoidance navigation without map for mobile robots which map raw sensor data to\ncontrol variable and navigate in an unknown environment. The efficient offline\ntraining strategy is proposed to speed up the inefficient random explorations\nin early stage and we also collect a universal dataset including expert\nexperience for offline training, which is of some significance for other\nnavigation training work. The pre-training and prioritized expert experience\nare proposed to reduce 80\\% training time and has been verified to improve the\n2 times reward of DRL. The advanced simulation gazebo with real physical\nmodelling and dynamic equations reduce the gap between sim-to-real. We train\nour model a corridor environment, and evaluate the model in different\nenvironment getting the same effect. Compared to traditional method navigation,\nwe can confirm the trained model can be directly applied into different\nscenarios and have the ability to no collision navigate. It was demonstrated\nthat our DRL model have universal general capacity in different environment.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:19:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hao","Yang Wenkai Ji Ruihang Zhang Yuxiang Lei",""],["Zijie","Zhao",""]]}
{"id":"2308.01552","submitter":"Polin Chen","authors":"Po-Lin Chen, Cheng-Shang Chang","title":"InterAct: Exploring the Potentials of ChatGPT as a Cooperative Agent","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research paper delves into the integration of OpenAI's ChatGPT into\nembodied agent systems, evaluating its influence on interactive decision-making\nbenchmark. Drawing a parallel to the concept of people assuming roles according\nto their unique strengths, we introduce InterAct. In this approach, we feed\nChatGPT with varied prompts, assigning it a numerous roles like a checker and a\nsorter, then integrating them with the original language model. Our research\nshows a remarkable success rate of 98% in AlfWorld, which consists of 6\ndifferent tasks in a simulated household environment, emphasizing the\nsignificance of proficient prompt engineering. The results highlight ChatGPT's\ncompetence in comprehending and performing intricate tasks effectively in\nreal-world settings, thus paving the way for further advancements in task\nplanning.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:19:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chen","Po-Lin",""],["Chang","Cheng-Shang",""]]}
{"id":"2308.01553","submitter":"Maxime Vaidis","authors":"Maxime Vaidis, William Dubois, Effie Daum, Damien LaRocque,\n  Fran\\c{c}ois Pomerleau","title":"Uncertainty analysis for accurate ground truth trajectories with robotic\n  total stations","comments":"8 pages, 5 figure, accepted for IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the context of robotics, accurate ground truth positioning is essential\nfor the development of Simultaneous Localization and Mapping (SLAM) and control\nalgorithms. Robotic Total Stations (RTSs) provide accurate and precise\nreference positions in different types of outdoor environments, especially when\ncompared to the limited accuracy of Global Navigation Satellite System (GNSS)\nin cluttered areas. Three RTSs give the possibility to obtain the six-Degrees\nOf Freedom (DOF) reference pose of a robotic platform. However, the uncertainty\nof every pose is rarely computed for trajectory evaluation. As evaluation\nalgorithms are getting increasingly precise, it becomes crucial to take into\naccount this uncertainty. We propose a method to compute this six-DOF\nuncertainty from the fusion of three RTSs based on Monte Carlo (MC) methods.\nThis solution relies on point-to-point minimization to propagate the noise of\nRTSs on the pose of the robotic platform. Five main noise sources are\nidentified to model this uncertainty: noise inherent to the instrument, tilt\nnoise, atmospheric factors, time synchronization noise, and extrinsic\ncalibration noise. Based on extensive experimental work, we compare the impact\nof each noise source on the prism uncertainty and the final estimated pose.\nTested on more than 50 km of trajectories, our comparison highlighted the\nimportance of the calibration noise and the measurement distance, which should\nbe ideally under 75 m. Moreover, it has been noted that the uncertainty on the\npose of the robot is not prominently affected by one particular noise source,\ncompared to the others.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:24:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Vaidis","Maxime",""],["Dubois","William",""],["Daum","Effie",""],["LaRocque","Damien",""],["Pomerleau","Fran\u00e7ois",""]]}
{"id":"2308.01554","submitter":"Charitha Saumya Gusthinna Waduge","authors":"Charitha Saumya, Rohan Gangaraju, Kirshanthan Sundararajah, Milind\n  Kulkarni","title":"Targeted Control-flow Transformations for Mitigating Path Explosion in\n  Dynamic Symbolic Execution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic symbolic execution (DSE) suffers from path explosion problem when the\ntarget program has many conditional branches. Classical approach for managing\nthe path explosion problem is dynamic state merging. Dynamic state merging\ncombines similar symbolic program states together to avoid the exponential\ngrowth of states in DSE. However, state merging still requires solver\ninvocations at each branch point of the program even when both paths of the\nbranch is feasible and, the best path search strategy for DSE may not create\nthe best state merging opportunities. Some drawbacks of state merging can be\nmitigated by compile-time state merging i.e. branch elimination by converting\ncontrol-flow into data-flow. In this paper, we propose a non-semantics\npreserving but failure-preserving compiler technique for removing expensive\nsymbolic branches in a program to improve the scalability of DSE. We develop a\nframework for detecting spurious bugs that can be inserted by our\ntransformation. Finally, we show that our transformation can significantly\nimprove the performance of exhaustive DSE on variety of benchmarks and helps in\nachieving more coverage in a large real-world subjects within a limited time\nbudget.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:34:34 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Saumya","Charitha",""],["Gangaraju","Rohan",""],["Sundararajah","Kirshanthan",""],["Kulkarni","Milind",""]]}
{"id":"2308.01555","submitter":"Zhe Zhang","authors":"Zhe Zhang, Wei Chai, Jiankun Wang","title":"Mani-GPT: A Generative Model for Interactive Robotic Manipulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In real-world scenarios, human dialogues are multi-round and diverse.\nFurthermore, human instructions can be unclear and human responses are\nunrestricted. Interactive robots face difficulties in understanding human\nintents and generating suitable strategies for assisting individuals through\nmanipulation. In this article, we propose Mani-GPT, a Generative Pre-trained\nTransformer (GPT) for interactive robotic manipulation. The proposed model has\nthe ability to understand the environment through object information,\nunderstand human intent through dialogues, generate natural language responses\nto human input, and generate appropriate manipulation plans to assist the\nhuman. This makes the human-robot interaction more natural and humanized. In\nour experiment, Mani-GPT outperforms existing algorithms with an accuracy of\n84.6% in intent recognition and decision-making for actions. Furthermore, it\ndemonstrates satisfying performance in real-world dialogue tests with users,\nachieving an average response accuracy of 70%.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:35:10 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 02:13:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Zhe",""],["Chai","Wei",""],["Wang","Jiankun",""]]}
{"id":"2308.01556","submitter":"Zhengyang Zhang","authors":"Zhang Zhengyang and Dong Wei and Liu jun and Sun Xinya and Ji Yindong","title":"A Global Transport Capacity Risk Prediction Method for Rail Transit\n  Based on Gaussian Bayesian Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aiming at the prediction problem of transport capacity risk caused by the\nmismatch between the carrying capacity of rail transit network and passenger\nflow demand, this paper proposes an explainable prediction method of rail\ntransit network transport capacity risk based on linear Gaussian Bayesian\nnetwork. This method obtains the training data of the prediction model based on\nthe simulation model of the rail transit system with a three-layer structure\nincluding rail transit network, train flow and passenger flow. A Bayesian\nnetwork structure construction method based on the topology of the rail transit\nnetwork is proposed, and the MLE (Maximum Likelihood Estimation) method is used\nto realize the parameter learning of the Bayesian network. Finally, the\neffectiveness of the proposed method is verified by simulation examples.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:36:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhengyang","Zhang",""],["Wei","Dong",""],["jun","Liu",""],["Xinya","Sun",""],["Yindong","Ji",""]]}
{"id":"2308.01557","submitter":"Jo\\~ao Carvalho","authors":"Joao Carvalho, An T. Le, Mark Baierl, Dorothea Koert, Jan Peters","title":"Motion Planning Diffusion: Learning and Planning of Robot Motions with\n  Diffusion Models","comments":null,"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":"  Learning priors on trajectory distributions can help accelerate robot motion\nplanning optimization. Given previously successful plans, learning trajectory\ngenerative models as priors for a new planning problem is highly desirable.\nPrior works propose several ways on utilizing this prior to bootstrapping the\nmotion planning problem. Either sampling the prior for initializations or using\nthe prior distribution in a maximum-a-posterior formulation for trajectory\noptimization. In this work, we propose learning diffusion models as priors. We\nthen can sample directly from the posterior trajectory distribution conditioned\non task goals, by leveraging the inverse denoising process of diffusion models.\nFurthermore, diffusion has been recently shown to effectively encode data\nmultimodality in high-dimensional settings, which is particularly well-suited\nfor large trajectory dataset. To demonstrate our method efficacy, we compare\nour proposed method - Motion Planning Diffusion - against several baselines in\nsimulated planar robot and 7-dof robot arm manipulator environments. To assess\nthe generalization capabilities of our method, we test it in environments with\npreviously unseen obstacles. Our experiments show that diffusion models are\nstrong priors to encode high-dimensional trajectory distributions of robot\nmotions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:36:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Carvalho","Joao",""],["Le","An T.",""],["Baierl","Mark",""],["Koert","Dorothea",""],["Peters","Jan",""]]}
{"id":"2308.01558","submitter":"Umut Demirhan","authors":"Hao Luo, Umut Demirhan and Ahmed Alkhateeb","title":"Millimeter Wave V2V Beam Tracking using Radar: Algorithms and Real-World\n  Demonstration","comments":"5 pages, 5 figures. To appear in EUSIPCO 2023. The dataset is\n  available on the DeepSense 6G website http://deepsense6g.net/","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Utilizing radar sensing for assisting communication has attracted increasing\ninterest thanks to its potential in dynamic environments. A particularly\ninteresting problem for this approach appears in the vehicle-to-vehicle (V2V)\nmillimeter wave and terahertz communication scenarios, where the narrow beams\nchange with the movement of both vehicles. To address this problem, in this\nwork, we develop a radar-aided beam-tracking framework, where a single initial\nbeam and a set of radar measurements over a period of time are utilized to\npredict the future beams after this time duration. Within this framework, we\ndevelop two approaches with the combination of various degrees of radar signal\nprocessing and machine learning. To evaluate the feasibility of the solutions\nin a realistic scenario, we test their performance on a real-world V2V dataset.\nOur results indicated the importance of high angular resolution radar for this\ntask and affirmed the potential of using radar for the V2V beam management\nproblems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:39:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Luo","Hao",""],["Demirhan","Umut",""],["Alkhateeb","Ahmed",""]]}
{"id":"2308.01559","submitter":"Junxu Li","authors":"Junxu Li, Xingyu Gao, Manas Sajjan, Ji-Hu Su, Zhao-Kai Li, Sabre Kais","title":"M{\\o}ller-Plesset Perturbation Theory Calculations on Quantum Devices","comments":"14 Pages, 4 Figures (in main article)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate electronic structure calculations might be one of the most\nanticipated applications of quantum computing.The recent landscape of quantum\nsimulations within the Hartree-Fock approximation raises the prospect of\nsubstantial theory and hardware developments in this context.Here we propose a\ngeneral quantum circuit for M{\\o}ller-Plesset perturbation theory (MPPT)\ncalculations, which is a popular and powerful post-Hartree-Fock method widly\nharnessed in solving electronic structure problems. MPPT improves on the\nHartree-Fock method by including electron correlation effects wherewith\nRayleigh-Schrodinger perturbation theory. Given the Hartree-Fock results, the\nproposed circuit is designed to estimate the second order energy corrections\nwith MPPT methods. In addition to demonstration of the theoretical scheme, the\nproposed circuit is further employed to calculate the second order energy\ncorrection for the ground state of Helium atom, and the total error rate is\naround 2.3%. Experiments on IBM 27-qubit quantum computers express the\nfeasibility on near term quantum devices, and the capability to estimate the\nsecond order energy correction accurately. In imitation of the classical MPPT,\nour approach is non-heuristic, guaranteeing that all parameters in the circuit\nare directly determined by the given Hartree-Fock results. Moreover, the\nproposed circuit shows a potential quantum speedup comparing to the traditional\nMPPT calculations. Our work paves the way forward the implementation of more\nintricate post-Hartree-Fock methods on quantum hardware, enriching the toolkit\nsolving electronic structure problems on quantum computing platforms.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:50:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Junxu",""],["Gao","Xingyu",""],["Sajjan","Manas",""],["Su","Ji-Hu",""],["Li","Zhao-Kai",""],["Kais","Sabre",""]]}
{"id":"2308.01560","submitter":"L\\'aszl\\'o Moln\\'ar","authors":"L\\'aszl\\'o Moln\\'ar, Emese Plachy, Attila B\\'odi, Andr\\'as P\\'al,\n  Meridith Joyce, Csilla Kalup, Christian I. Johnson, Zolt\\'an Dencs, Szabolcs\n  M\\'esz\\'aros, Henryka Netzel, Karen Kinemuchi, Juna A. Kollmeier, Jose Luis\n  Prieto, Aliz Derekas","title":"To Grow Old and Peculiar: A Survey of Anomalous Variable Stars in M80\n  and Age Determination using K2 and Gaia","comments":"23 pages, 18 figures, accepted for publication in A&A. v2: minor\n  edits and updates to the text","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":"  The globular cluster Messier 80 was monitored by the Kepler space telescope\nfor 80 days during the K2 mission. Continuous, high-precision photometry of\nsuch an old, compact cluster allows us to study its variable star population in\nunprecedented detail. We extract light curves for 27 variable stars using\ndifferential-image photometry. A search for new variables in the images led to\nthe discovery of two new variable stars: an RR Lyrae and a variable red giant\nstar, respectively. Analysis of the RR Lyrae population reveals multiple RRc\nstars with additional modes and/or peculiar modulation cycles. We newly\nclassify star V28 as a spotted extreme horizontal branch variable. Despite\ntheir faintness, we clearly detect the three SX Phe stars but we did not find\nnew pulsation modes beyond the known ones in them. Spectra taken with the VLT\nand Magellan Clay telescopes, as well as absolute color-magnitude diagrams of\nthe cluster based on Gaia and Pan-STARRS observations confirm the\nclassification of the peculiar modulated variables as bona-fide RRc stars. We\npropose that they highlight a subgroup of overtone stars that may have been\noverlooked before. We fit MESA isochrones to the CMDs to estimate the age and\nmetallicity of the cluster. We confirm that M80 is old and metal-poor, but show\nthat isochrone fitting to old populations comes with numerous uncertainties.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:55:38 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 09:06:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Moln\u00e1r","L\u00e1szl\u00f3",""],["Plachy","Emese",""],["B\u00f3di","Attila",""],["P\u00e1l","Andr\u00e1s",""],["Joyce","Meridith",""],["Kalup","Csilla",""],["Johnson","Christian I.",""],["Dencs","Zolt\u00e1n",""],["M\u00e9sz\u00e1ros","Szabolcs",""],["Netzel","Henryka",""],["Kinemuchi","Karen",""],["Kollmeier","Juna A.",""],["Prieto","Jose Luis",""],["Derekas","Aliz",""]]}
{"id":"2308.01561","submitter":"Subhabrata Paul","authors":"Subhabrata Paul and Kamal Santra","title":"Algorithmic study of $d_2$-transitivity of graphs","comments":"arXiv admin note: text overlap with arXiv:2211.13931","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets,\nrespectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$\n\\emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex\nof $A$. A vertex partition $\\pi = \\{V_1, V_2, \\ldots, V_k\\}$ of $G$ is called a\n\\emph{transitive partition} of size $k$ if $V_i$ dominates $V_j$ for all $1\\leq\ni<j\\leq k$. In this article, we initiate the study of a generalization of\ntransitive partition, namely \\emph{$d_2$-transitive partition}. For two\ndisjoint subsets $A$ and $B$ of $V$, we say $A$ \\emph{$d_2$-dominates} $B$ if,\nfor every vertex of $B$, there exists a vertex in $A$, such that the distance\nbetween them is at most two. A vertex partition $\\pi = \\{V_1, V_2, \\ldots,\nV_k\\}$ of $G$ is called a \\emph{$d_2$-transitive partition} of size $k$ if\n$V_i$ $d_2$-dominates $V_j$ for all $1\\leq i<j\\leq k$. The maximum integer $k$\nfor which the above partition exists is called \\emph{$d_2$-transitivity} of\n$G$, and it is denoted by $Tr_{d_2}(G)$. The \\textsc{Maximum $d_2$-Transitivity\nProblem} is to find a $d_2$-transitive partition of a given graph with the\nmaximum number of parts. We show that this problem can be solved in linear time\nfor the complement of bipartite graphs and bipartite chain graphs. On the\nnegative side, we prove that the decision version of the \\textsc{Maximum\n$d_2$-Transitivity Problem} is NP-complete for split graphs, bipartite graphs,\nand star-convex bipartite graphs.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:00:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Paul","Subhabrata",""],["Santra","Kamal",""]]}
{"id":"2308.01562","submitter":"Md Ferdous Pervej","authors":"Md Ferdous Pervej, Richeng Jin, Huaiyu Dai","title":"Hierarchical Federated Learning in Wireless Networks: Pruning Tackles\n  Bandwidth Scarcity and System Heterogeneity","comments":"Under review for possible publications in IEEE TWC","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.NI cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While a practical wireless network has many tiers where end users do not\ndirectly communicate with the central server, the users' devices have limited\ncomputation and battery powers, and the serving base station (BS) has a fixed\nbandwidth. Owing to these practical constraints and system models, this paper\nleverages model pruning and proposes a pruning-enabled hierarchical federated\nlearning (PHFL) in heterogeneous networks (HetNets). We first derive an upper\nbound of the convergence rate that clearly demonstrates the impact of the model\npruning and wireless communications between the clients and the associated BS.\nThen we jointly optimize the model pruning ratio, central processing unit (CPU)\nfrequency and transmission power of the clients in order to minimize the\ncontrollable terms of the convergence bound under strict delay and energy\nconstraints. However, since the original problem is not convex, we perform\nsuccessive convex approximation (SCA) and jointly optimize the parameters for\nthe relaxed convex problem. Through extensive simulation, we validate the\neffectiveness of our proposed PHFL algorithm in terms of test accuracy, wall\nclock time, energy consumption and bandwidth requirement.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:03:33 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Pervej","Md Ferdous",""],["Jin","Richeng",""],["Dai","Huaiyu",""]]}
{"id":"2308.01563","submitter":"Nikhil Mehta","authors":"Nikhil Mehta, Anima Singh, Xinyang Yi, Sagar Jain, Lichan Hong and Ed\n  H. Chi","title":"Density Weighting for Multi-Interest Personalized Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using multiple user representations (MUR) to model user behavior instead of a\nsingle user representation (SUR) has been shown to improve personalization in\nrecommendation systems. However, the performance gains observed with MUR can be\nsensitive to the skewness in the item and/or user interest distribution. When\nthe data distribution is highly skewed, the gains observed by learning multiple\nrepresentations diminish since the model dominates on head items/interests,\nleading to poor performance on tail items. Robustness to data sparsity is\ntherefore essential for MUR-based approaches to achieve good performance for\nrecommendations. Yet, research in MUR and data imbalance have largely been done\nindependently. In this paper, we delve deeper into the shortcomings of MUR\ninferred from imbalanced data distributions. We make several contributions: (1)\nUsing synthetic datasets, we demonstrate the sensitivity of MUR with respect to\ndata imbalance, (2) To improve MUR for tail items, we propose an iterative\ndensity weighting scheme (IDW) with user tower calibration to mitigate the\neffect of training over long-tail distribution on personalization, and (3)\nThrough extensive experiments on three real-world benchmarks, we demonstrate\nIDW outperforms other alternatives that address data imbalance.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:06:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mehta","Nikhil",""],["Singh","Anima",""],["Yi","Xinyang",""],["Jain","Sagar",""],["Hong","Lichan",""],["Chi","Ed H.",""]]}
{"id":"2308.01564","submitter":"Yahav Alon","authors":"Yahav Alon and Michael Krivelevich","title":"Sparse pancyclic subgraphs of random graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is known that the complete graph $K_n$ contains a pancyclic subgraph with\n$n+(1+o(1))\\cdot \\log _2 n$ edges, and that there is no pancyclic graph on $n$\nvertices with fewer than $n+\\log _2 (n-1) -1$ edges. We show that, with high\nprobability, $G(n,p)$ contains a pancyclic subgraph with $n+(1+o(1))\\log_2 n$\nedges for $p \\ge p^*$, where $p^*=(1+o(1))\\ln n/n$, right above the threshold\nfor pancyclicity.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:10:41 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Alon","Yahav",""],["Krivelevich","Michael",""]]}
{"id":"2308.01565","submitter":"Takeshi Araki","authors":"Takeshi Araki, Kento Asai, Tomoya Iizawa, Hidetoshi Otono, Takashi\n  Shimomura, and Yosuke Takubo","title":"New Constraint on Dark Photon at T2K Off-Axis Near Detector","comments":"22 pages","journal-ref":null,"doi":null,"report-no":"UME-PP-026, KYUSHU-HET-262","categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The T2K experiment is one of the most powerful long-baseline experiments to\ninvestigate neutrino oscillations. The off-axis near detector called ND280 is\ninstalled 280 m downstream from the neutrino production target to measure the\nneutrino energy spectrum. In this paper, we study the capability of the ND280\ndetector to search for the dark photon produced through the meson rare decay\nand proton bremsstrahlung processes at the proton beam dump. We find that the\nten-year operation of T2K with the ND280 detector excludes the unexplored\nparameter region for the dark photon mass and kinetic mixing. We also show that\na broader parameter region can be searched by the ND280 in the future T2K\noperation for dark photon as well as U(1)$_{B-L}$ gauge boson.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:12:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Araki","Takeshi",""],["Asai","Kento",""],["Iizawa","Tomoya",""],["Otono","Hidetoshi",""],["Shimomura","Takashi",""],["Takubo","Yosuke",""]]}
{"id":"2308.01566","submitter":"Otmane Sakhi","authors":"Otmane Sakhi, David Rohde, Nicolas Chopin","title":"Fast Slate Policy Optimization: Going Beyond Plackett-Luce","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IR stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An increasingly important building block of large scale machine learning\nsystems is based on returning slates; an ordered lists of items given a query.\nApplications of this technology include: search, information retrieval and\nrecommender systems. When the action space is large, decision systems are\nrestricted to a particular structure to complete online queries quickly. This\npaper addresses the optimization of these large scale decision systems given an\narbitrary reward function. We cast this learning problem in a policy\noptimization framework and propose a new class of policies, born from a novel\nrelaxation of decision functions. This results in a simple, yet efficient\nlearning algorithm that scales to massive action spaces. We compare our method\nto the commonly adopted Plackett-Luce policy class and demonstrate the\neffectiveness of our approach on problems with action space sizes in the order\nof millions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:13:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sakhi","Otmane",""],["Rohde","David",""],["Chopin","Nicolas",""]]}
{"id":"2308.01567","submitter":"Chuancun Shu","authors":"Li-Bao Fan, and Chuan-Cun Shu","title":"Pulse-area theorem for precision control of the rotational motions of a\n  single molecule in a cavity","comments":"6 figures","journal-ref":"Journal of Physics A: Mathematical and Theoretical, 2023","doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform a combined analytical and numerical investigation to explore how\nan analytically designed pulse can precisely control the rotational motions of\na single-molecular polariton formed by the strong coupling of two low-lying\nrotational states with a single-mode cavity. To this end, we derive a\npulse-area theorem that gives amplitude and phase conditions of the pulses in\nthe frequency domain for driving the polariton from a given initial state to an\narbitrary coherent state. The pulse-area theorem is examined for generating the\nmaximum degree of orientation using a pair of pulses. We show that the phase\ncondition can be satisfied by setting the initial phases of the two identically\noverlapped pulses or by controlling the time delay between pulses for practical\napplications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:15:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fan","Li-Bao",""],["Shu","Chuan-Cun",""]]}
{"id":"2308.01568","submitter":"Shili Zhou","authors":"Shili Zhou, Xuhao Jiang, Weimin Tan, Ruian He and Bo Yan","title":"MVFlow: Deep Optical Flow Estimation of Compressed Videos with Motion\n  Vector Prior","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":"  In recent years, many deep learning-based methods have been proposed to\ntackle the problem of optical flow estimation and achieved promising results.\nHowever, they hardly consider that most videos are compressed and thus ignore\nthe pre-computed information in compressed video streams. Motion vectors, one\nof the compression information, record the motion of the video frames. They can\nbe directly extracted from the compression code stream without computational\ncost and serve as a solid prior for optical flow estimation. Therefore, we\npropose an optical flow model, MVFlow, which uses motion vectors to improve the\nspeed and accuracy of optical flow estimation for compressed videos. In detail,\nMVFlow includes a key Motion-Vector Converting Module, which ensures that the\nmotion vectors can be transformed into the same domain of optical flow and then\nbe utilized fully by the flow estimation module. Meanwhile, we construct four\noptical flow datasets for compressed videos containing frames and motion\nvectors in pairs. The experimental results demonstrate the superiority of our\nproposed MVFlow, which can reduce the AEPE by 1.09 compared to existing models\nor save 52% time to achieve similar accuracy to existing models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:16:18 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 04:18:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhou","Shili",""],["Jiang","Xuhao",""],["Tan","Weimin",""],["He","Ruian",""],["Yan","Bo",""]]}
{"id":"2308.01569","submitter":"Hao Wu","authors":"Marco Abatangelo, Cecilia Cavaterra, Maurizio Grasselli, Hao Wu","title":"Optimal Distributed Control for a Cahn-Hilliard-Darcy System with Mass\n  Sources, Unmatched Viscosities and Singular Potential","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a Cahn-Hilliard-Darcy system in two dimensions with mass sources,\nunmatched viscosities and singular potential. This system is equipped with\nno-flux boundary conditions for the (volume) averaged velocity $\\mathbf{u}$,\nthe difference of the volume fractions $\\varphi$, and the chemical potential\n$\\mu$, along with an initial condition for $\\varphi$. The resulting initial\nboundary value problem can be considered as a basic, though simplified, model\nfor the evolution of solid tumor growth. The source term in the Cahn-Hilliard\nequation contains a control $R$ that can be thought, for instance, as a drug or\na nutrient. Our goal is to study an optimal control problem with a tracking\ntype cost functional given by the sum of three $L^2$ norms involving\n$\\varphi(T)$ ($T>0$ is the final time), $\\varphi$ and $R$. We first prove the\nexistence and uniqueness of a global strong solution with $\\varphi$ being\nstrictly separated from the pure phases $\\pm 1$. Thanks to this result, we are\nable to analyze the control-to-state mapping $\\mathcal{S}: R \\mapsto \\varphi$,\nobtaining the existence of an optimal control, the Fr\\'{e}chet\ndifferentiability of $\\mathcal{S}$ and first-order necessary optimality\nconditions expressed through a suitable variational inequality for the adjoint\nvariables. Finally, we show the differentiability of the control-to-costate\noperator and establish a second-order sufficient condition for the strict local\noptimality.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:17:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Abatangelo","Marco",""],["Cavaterra","Cecilia",""],["Grasselli","Maurizio",""],["Wu","Hao",""]]}
{"id":"2308.01570","submitter":"Janaka Adassuriya","authors":"D P S Nilagarathne, J Adassuriya, H O Wijewardane","title":"The Effect of Uniform and Non-uniform Electron Density Models for\n  Determining Shock Speed of a Type II Solar Radio Burst","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar flare is one of the most important solar activities which emit all\nelectromagnetic waves in gigantic burst. The radio emission can be used to\ndetermine the physical properties of the solar flares. The e-CALLISTO worldwide\nnetwork is designed to detect the radio emission of the solar flares and this\nstudy used the spectroscopic data from the e-CALLISTO system. Among the five\ntypes of solar radio bursts, this study was focused on type II radio bursts.\nThe spectroscopic analysis estimated the shock speed of type II radio bursts\nusing the uniform electron density model and the nonuniform electron density\nmodel of the sun. The shock speed is proportional to the electron density (Ne)\nand inversely proportional to the rate of change in electron density with\naltitude (dNe/dr). The determined shock speed at the altitude of one solar\nradius is 2131 km/s for uniform model and 766 km/s for non-uniform model.\nAlthough the uniform electron density model is widely used we attempted the\nnon-uniform electron density since in the active region of the sun, the\nelectron densities are non-uniform. The estimated shock speeds of uniform\ndensity model is relatively high so that it is reasonable to use non-uniform\nelectron density model for shock speed estimation of type II radio bursts.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:17:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Nilagarathne","D P S",""],["Adassuriya","J",""],["Wijewardane","H O",""]]}
{"id":"2308.01571","submitter":"Krzysztof Kowalski","authors":"Krzysztof Kowalski","title":"Branching random walks with regularly varying perturbations","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a modification of classical branching random walk, where we add\ni.i.d. perturbations to the positions of the particles in each generation. In\nthis model, which was introduced and studied by Bandyopadhyay and Ghosh (2023),\nperturbations take form $\\frac 1 \\theta \\log\\frac X E$, where $\\theta$ is a\npositive parameter, $X$ has arbitrary distribution $\\mu$ and $E$ is exponential\nwith parameter 1, independent of $X$. Working under finite mean assumption for\n$\\mu$, they proved almost sure convergence of the rightmost position to a\nconstant limit, and identified the weak centered asymptotics when $\\theta$ does\nnot exceed certain critical parameter $\\theta_0$. This paper complements their\nwork by providing weak centered asymptotics for the case when $\\theta >\n\\theta_0$ and extending the results to $\\mu$ with regularly varying tails. We\nprove almost sure convergence of the rightmost position and identify the\nappropriate centering for the weak convergence, which is of form $\\alpha n + c\n\\log n$, with constants $\\alpha$, $c$ depending on the ratio of $\\theta$ and\n$\\theta_0$. We describe the limiting distribution and provide explicitly the\nconstants appearing in the centering.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:18:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kowalski","Krzysztof",""]]}
{"id":"2308.01572","submitter":"Naoki Ishikawa","authors":"Yuki Sano, Kosuke Mitarai, Naoki Yamamoto, and Naoki Ishikawa","title":"Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction\n  Strategies with Higher-Order Formulations","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Grover adaptive search (GAS) is a quantum exhaustive search algorithm\ndesigned to solve binary optimization problems. In this paper, we propose\nhigher-order binary formulations that can simultaneously reduce the numbers of\nqubits and gates required for GAS. Specifically, we consider two novel\nstrategies: one that reduces the number of gates through polynomial\nfactorization, and the other that halves the order of the objective function,\nsubsequently decreasing circuit runtime and implementation cost. Our analysis\ndemonstrates that the proposed higher-order formulations improve the\nconvergence performance of GAS by both reducing the search space size and the\nnumber of quantum gates. Our strategies are also beneficial for general\ncombinatorial optimization problems using one-hot encoding.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:20:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sano","Yuki",""],["Mitarai","Kosuke",""],["Yamamoto","Naoki",""],["Ishikawa","Naoki",""]]}
{"id":"2308.01573","submitter":"Yong-Hoon Choi","authors":"Myeongjin Ko and Yong-Hoon Choi","title":"Adversarial Training of Denoising Diffusion Model Using Dual\n  Discriminators for High-Fidelity Multi-Speaker TTS","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The diffusion model is capable of generating high-quality data through a\nprobabilistic approach. However, it suffers from the drawback of slow\ngeneration speed due to the requirement of a large number of time steps. To\naddress this limitation, recent models such as denoising diffusion implicit\nmodels (DDIM) focus on generating samples without directly modeling the\nprobability distribution, while models like denoising diffusion generative\nadversarial networks (GAN) combine diffusion processes with GANs. In the field\nof speech synthesis, a recent diffusion speech synthesis model called\nDiffGAN-TTS, utilizing the structure of GANs, has been introduced and\ndemonstrates superior performance in both speech quality and generation speed.\nIn this paper, to further enhance the performance of DiffGAN-TTS, we propose a\nspeech synthesis model with two discriminators: a diffusion discriminator for\nlearning the distribution of the reverse process and a spectrogram\ndiscriminator for learning the distribution of the generated data. Objective\nmetrics such as structural similarity index measure (SSIM), mel-cepstral\ndistortion (MCD), F0 root mean squared error (F0 RMSE), short-time objective\nintelligibility (STOI), perceptual evaluation of speech quality (PESQ), as well\nas subjective metrics like mean opinion score (MOS), are used to evaluate the\nperformance of the proposed model. The evaluation results show that the\nproposed model outperforms recent state-of-the-art models such as FastSpeech2\nand DiffGAN-TTS in various metrics. Our implementation and audio samples are\nlocated on GitHub.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:22:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ko","Myeongjin",""],["Choi","Yong-Hoon",""]]}
{"id":"2308.01574","submitter":"Andreas Bj\\\"orklund","authors":"Andreas Bj\\\"orklund, Petteri Kaski, and Jesper Nederlof","title":"Another Hamiltonian Cycle in Bipartite Pfaffian Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a linear-time algorithm that, given as input (i) a bipartite\nPfaffian graph $G$ of minimum degree three, (ii) a Hamiltonian cycle $H$ in\n$G$, and (iii) an edge $e$ in $H$, outputs at least three other Hamiltonian\ncycles through the edge $e$ in $G$. This linear-time complexity of finding\nanother Hamiltonian cycle given one is in sharp contrast to the problem of\ndeciding the existence of a Hamiltonian cycle, which is NP-complete already for\ncubic bipartite planar graphs; such graphs are Pfaffian. Also, without the\ndegree requirement, we show that it is NP-hard to find another Hamiltonian\ncycle in a bipartite Pfaffian graph. We present further improved algorithms for\nfinding optimal traveling salesperson tours and counting Hamiltonian cycles in\nbipartite planar graphs with running times that are not known to hold in\ngeneral planar graphs.\n  We prove our results by a new structural technique that efficiently witnesses\neach Hamiltonian cycle $H$ through an arbitrary fixed anchor edge $e$ in a\nbipartite Pfaffian graph using a two-coloring of the vertices as advice that is\nunique to $H$. Previous techniques -- the Cut&Count technique of Cygan et al.\n[FOCS'11, TALG'22] in particular -- were able to reduce the Hamiltonian cycle\nproblem only to essentially counting problems; our results show that counting\ncan be avoided by leveraging properties of bipartite Pfaffian graphs. Our\ntechnique also has purely graph-theoretical consequences; for example, we show\nthat every cubic bipartite Pfaffian graph has either zero or at least six\ndistinct Hamiltonian cycles; the latter case is tight for the cube graph.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:22:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bj\u00f6rklund","Andreas",""],["Kaski","Petteri",""],["Nederlof","Jesper",""]]}
{"id":"2308.01575","submitter":"Rui-Hui Lin","authors":"Rui-Hui Lin, Rui Jiang and Xiang-Hua Zhai","title":"Quasinormal modes of the spherical bumblebee black holes with a global\n  monopole","comments":"accepted by Eur. Phys. J. C","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The bumblebee model is an extension of the Einstein-Maxwell theory that\nallows for the spontaneous breaking of the Lorentz symmetry of the spacetime.\nIn this paper, we study the quasinormal modes of the spherical black holes in\nthis model that are characterized by a global monopole. We analyze the two\ncases with a vanishing cosmological constant or a negative one (the anti-de\nSitter case). We find that the black holes are stable under the perturbation of\na massless scalar field. However, both the Lorentz symmetry breaking and the\nglobal monopole have notable impacts on the evolution of the perturbation. The\nLorentz symmetry breaking may prolong or shorten the decay of the perturbation\naccording to the sign of the breaking parameter. The global monopole, on the\nother hand, has different effects depending on whether a nonzero cosmological\nconstant presences: it reduces the damping of the perturbations for the case\nwith a vanishing cosmological constant, but has little influence for the\nanti-de Sitter case.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:22:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Rui-Hui",""],["Jiang","Rui",""],["Zhai","Xiang-Hua",""]]}
{"id":"2308.01576","submitter":"Dheeraj Kulkarni","authors":"Sannidhi Alape, Atreyee Bhattacharya and Dheeraj Kulkarni","title":"On Certain Rigidity Results of Compact Regular $(\\kappa, \\mu)\n  $-Manifolds","comments":"16 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math-ph math.GT math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we investigate the Riemannian and semi-Riemannian metrics on\nthe base space of the Boothby-Wang fibration of a closed regular non-Sasakian\n$(\\kappa, \\mu)$-manifold. To this end, we study a natural class of deviations\nof the projection map from being (semi-)Riemannian submersions. We consider\ndeviations that preserve the canonical bi-Legendrian structure on the given\n$(\\kappa, \\mu)$-manifold. We present rigidity results for Riemannian and\nsemi-Riemannian metrics on the base space which orthogonalize the natural\nbi-Lagrangian structure induced by the $(\\kappa, \\mu)$-structure. This approach\ngives a unified framework to analyze rigidity results in both categories. More\nprecisely, in the Riemannian category, we obtain uniqueness of Sasakian\nstructure on the given $(\\kappa, \\mu)$-manifold which orthogonalizes the\ncanonical bi-Legendrian structure. In the semi-Riemannian category, we obtain\nan explicit description of the finitely many para-contact structures which\northogonalize the canonical bi-Legendrian structure.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:25:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Alape","Sannidhi",""],["Bhattacharya","Atreyee",""],["Kulkarni","Dheeraj",""]]}
{"id":"2308.01577","submitter":"Geumsook Park","authors":"Geumsook Park, Bon-Chul Koo, Kee-Tae Kim, Bruce Elmegreen","title":"Neutral atomic and molecular clouds and star formation in the outer\n  Carina arm","comments":"26 pages, 14 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 present a comprehensive investigation of HI (super)clouds, molecular\nclouds (MCs), and star formation in the Carina spiral arm of the outer Galaxy.\nUtilizing HI4PI and CfA CO survey data, we identify HI clouds and MCs based on\nthe ($l$, ${v_\\mathrm{LSR}}$) locations of the Carina arm. We analyzed 26 HI\nclouds and 48 MCs. Most of the identified HI clouds are superclouds, with\nmasses exceeding $10^6~{\\mathrm{M_\\odot}}$. We find that 15 of these\nsuperclouds have associated MC(s) with ${M_\\mathrm{HI}} \\gtrsim\n10^6~{\\mathrm{M_\\odot}}$ and ${\\Sigma_\\mathrm{HI+H_2}} \\gtrsim$ 50\n${\\mathrm{M_\\odot}} \\rm pc^{-2}$. Our virial equilibrium analysis suggests that\nthese CO-bright HI clouds are gravitationally bound or marginally bound. We\nreport an anti-correlation between molecular mass fractions and Galactocentric\ndistances, and a correlation with total gas surface densities. Nine CO-bright\nHI superclouds are associated with HII regions, indicating ongoing star\nformation. We confirm the regular spacing of HI superclouds along the spiral\narm, which is likely due to some underlying physical process, such as\ngravitational instabilities. We observe a strong spatial correlation between\nHII regions and MCs, with some offsets between MCs and local HI column density\npeaks. Our study reveals that in the context of HI superclouds, the star\nformation rate surface density is independent of HI and total gas surface\ndensities but positively correlates with molecular gas surface density. This\nfinding is consistent with both extragalactic studies of the resolved\nKennicutt-Schmidt relation and local giant molecular clouds study of Lada et\nal. (2013), emphasizing the crucial role of molecular gas in regulating star\nformation processes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:27:40 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Park","Geumsook",""],["Koo","Bon-Chul",""],["Kim","Kee-Tae",""],["Elmegreen","Bruce",""]]}
{"id":"2308.01578","submitter":"Qianwen Meng","authors":"Qianwen Meng, Hangwei Qian, Yong Liu, Yonghui Xu, Zhiqi Shen, Lizhen\n  Cui","title":"Unsupervised Representation Learning for Time Series: A Review","comments":"In submission to IEEE","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unsupervised representation learning approaches aim to learn discriminative\nfeature representations from unlabeled data, without the requirement of\nannotating every sample. Enabling unsupervised representation learning is\nextremely crucial for time series data, due to its unique annotation bottleneck\ncaused by its complex characteristics and lack of visual cues compared with\nother data modalities. In recent years, unsupervised representation learning\ntechniques have advanced rapidly in various domains. However, there is a lack\nof systematic analysis of unsupervised representation learning approaches for\ntime series. To fill the gap, we conduct a comprehensive literature review of\nexisting rapidly evolving unsupervised representation learning approaches for\ntime series. Moreover, we also develop a unified and standardized library,\nnamed ULTS (i.e., Unsupervised Learning for Time Series), to facilitate fast\nimplementations and unified evaluations on various models. With ULTS, we\nempirically evaluate state-of-the-art approaches, especially the rapidly\nevolving contrastive learning methods, on 9 diverse real-world datasets. We\nfurther discuss practical considerations as well as open research challenges on\nunsupervised representation learning for time series to facilitate future\nresearch in this field.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:28:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Meng","Qianwen",""],["Qian","Hangwei",""],["Liu","Yong",""],["Xu","Yonghui",""],["Shen","Zhiqi",""],["Cui","Lizhen",""]]}
{"id":"2308.01579","submitter":"Kohki Kawabata","authors":"Kohki Kawabata, Tatsuma Nishioka and Takuya Okuda","title":"Narain CFTs from quantum codes and their $\\mathbb{Z}_2$ gauging","comments":"60 pages, 8 figures; v2: addition and minor correction in section 5,\n  references added; v3: minor change","journal-ref":null,"doi":null,"report-no":"OU-HET-1196, UT-Komaba/23-10","categories":"hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the gauging of a $\\mathbb{Z}_2$ symmetry in Narain conformal\nfield theories (CFTs) constructed from qudit stabilizer codes. Considering both\norbifold and fermionization, we establish a connection between $\\mathbb{Z}_2$\ngauging procedures and modifications of the momentum lattice by vectors\ncharacterizing the $\\mathbb{Z}_2$ symmetry. We also provide three-dimensional\ninterpretations of $\\mathbb{Z}_2$ gaugings through abelian Chern-Simons\ntheories, which act as symmetry topological field theories.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:29:04 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 14:55:53 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 14:07:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kawabata","Kohki",""],["Nishioka","Tatsuma",""],["Okuda","Takuya",""]]}
{"id":"2308.01580","submitter":"Giovanni Fantuzzi","authors":"Francesco Della Pietra, Giovanni Fantuzzi, Liviu I. Ignat, Alba Lia\n  Masiello, Gloria Paoli, Enrique Zuazua","title":"Finite element approximation of the Hardy constant","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider finite element approximations to the optimal constant for the\nHardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or\n$n\\geq 3$. For finite element spaces of piecewise linear and continuous\nfunctions on a mesh of size $h$, we prove that the approximate Hardy constant,\n$S_h^n$, converges to the optimal Hardy constant $S^n$ no slower than\n$O(1/\\vert \\log h \\vert)$. We also show that the convergence is no faster than\n$O(1/\\vert \\log h \\vert^2)$ if $n=1$ or if $n\\geq 3$, the domain is the unit\nball, and the finite element discretization exploits the rotational symmetry of\nthe problem. Our estimates are compared to exact values for $S_h^n$ obtained\ncomputationally.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:35:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Della Pietra","Francesco",""],["Fantuzzi","Giovanni",""],["Ignat","Liviu I.",""],["Masiello","Alba Lia",""],["Paoli","Gloria",""],["Zuazua","Enrique",""]]}
{"id":"2308.01581","submitter":"Janaka Adassuriya","authors":"J Adassuriya, S Gunasekera, KPSC Jayaratne, C Monstein","title":"Observation of Solar Radio Bursts Using E-CallistoSystem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A CALLISTO system was set up at the Arthur C Clarke Institute and connected\nto the e-CALLISTO global network which observes the solar radio bursts in 24\nhours. CALLISTO is the foremost observation facility to investigate celestial\nobjects in radio region in Sri Lanka. The system consists of the CALLISTO\nspectrometer and controlling software,logarithmic periodic antenna and\npre-amplifier. CALLISTO spectrometer is able to detect solar radio bursts in\nthe frequency range of 45 MHz to 870 MHz with a channel resolution of 62.5\nkHz.The log-periodic antenna was designed for 7 dBi gain and achieved the\nvoltage standing wave ratio, less than 1.5 which is acquired by the overall\nimpedance of the antenna, 49.3 ohms. The linear polarized antenna is pointing\nto zenith and the dipoles directed to north-south direction. The system detects\nsolar radio emissions originated by solar flares and corona mass ejections. The\nradio bursts occurs as emission stripes in the radio spectra and classify from\ntype I to V mainly on drift rate and band width. The system observed a type III\nsolar radio burst on 5th July 2013 and a type II burst on 25th October 2013\nwhich was originated by X1.7 solar flare. The type II bursts characterize with\nnarrow bandwidth and drift slowly from higher to lower frequencies while the\nmain features of type III bursts are high drift rate and broad bandwidth.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:36:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Adassuriya","J",""],["Gunasekera","S",""],["Jayaratne","KPSC",""],["Monstein","C",""]]}
{"id":"2308.01582","submitter":"Chenyi Zhang","authors":"Aaron Sidford and Chenyi Zhang","title":"Quantum speedups for stochastic optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DS math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of minimizing a continuous function given quantum\naccess to a stochastic gradient oracle. We provide two new methods for the\nspecial case of minimizing a Lipschitz convex function. Each method obtains a\ndimension versus accuracy trade-off which is provably unachievable classically\nand we prove that one method is asymptotically optimal in low-dimensional\nsettings. Additionally, we provide quantum algorithms for computing a critical\npoint of a smooth non-convex function at rates not known to be achievable\nclassically. To obtain these results we build upon the quantum multivariate\nmean estimation result of Cornelissen et al. 2022 and provide a general\nquantum-variance reduction technique of independent interest.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:39:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sidford","Aaron",""],["Zhang","Chenyi",""]]}
{"id":"2308.01583","submitter":"Xinhua Xiong","authors":"Xiaoyu Liu and Xinhua Xiong","title":"Values and recurrence relations for integrals of powers of arctan and\n  logarithm and associated Euler-like sums","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we give evaluations of integrals involving the arctan and the\nlogarithm functions, and present several new summation identities for odd\nharmonic numbers and Milgram constants. These summation identities can be\nexpressed as finite sums of special constants such as $\\pi$, the Catalan\nconstant, the values of Riemann zeta function at the positive odd numbers and\n$\\ln2$ etc.. Some examples are detailed to illustrate the theorems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:40:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Xiaoyu",""],["Xiong","Xinhua",""]]}
{"id":"2308.01584","submitter":"Ankit Singh Mr.","authors":"Ankit Singh, Changbom Park, Ena Choi, Juhan Kim, Hyunsung Jun, Brad K.\n  Gibson, Yonghwi Kim, Jaehyun Lee, Owain Snaith","title":"On the Effects of Local Environment on Active Galactic Nucleus (AGN) in\n  the Horizon Run 5 Simulation","comments":"25 pages, 18 figures, 1 table, published in the the Astrophysical\n  Journal (ApJ)","journal-ref":null,"doi":"10.3847/1538-4357/acdd6b","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the Horizon Run 5 cosmological simulation to study the effect of\ngalaxy intrinsic properties and the local environment on AGNs characterized by\ntheir threshold of the accretion rate. We select galaxies in the stellar mass\nrange $10^{9.5} \\le M^{}{*}/M^{}{\\odot} \\le 10^{10.5}$ in the snapshot at\nredshift $z$=0.625. Among various intrinsic properties, we find that the star\nformation rate of the host galaxy is most correlated to the AGN activity. To\nquantify the environment, we use background galaxy number density (large-scale\nenvironment) and distance and morphological type of the nearest neighbors\n(small-scale environment), and study their relative effects on the AGN\nproperties. We find that, compared to the background density, the nearest\nneighbor environment is the dominant quantity determining the bolometric\nluminosity, star formation rate, and kinematic properties of AGNs and better\ndictates the gas mass of the host galaxy. We show that the cold gas content in\nthe host galaxies is crucial in triggering AGN activity. However, when the\nnearest neighbor environment effects start to act at the neighbor distance of\nless than about half the virial radius of the neighbor, the neighbor\nenvironmental effects are the most dominant factor for quasar activity.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:40:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Singh","Ankit",""],["Park","Changbom",""],["Choi","Ena",""],["Kim","Juhan",""],["Jun","Hyunsung",""],["Gibson","Brad K.",""],["Kim","Yonghwi",""],["Lee","Jaehyun",""],["Snaith","Owain",""]]}
{"id":"2308.01585","submitter":"Davide Franco","authors":"Davide Franco","title":"A footnote to a paper of Deodhar","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X\\subseteq G\\slash B$ be a Schubert variety in a flag manifold and let\n$\\pi: \\tilde X \\rightarrow X$ be a Bott-Samelson resolution of $X$. In this\npaper we prove an effective version of the decomposition theorem for the\nderived pushforward $R \\pi_{*} \\mathbb{Q}_{\\tilde{X}}$. As a by-product, we\nobtain recursive procedure to extract Kazhdan-Lusztig polynomials from the\npolynomials introduced by V. Deodhar in \\cite{Deo}, which does not require\nprior knowledge of a minimal set. We also observe that any family of\nequivariant resolutions of Schubert varieties allows to define a new basis in\nthe Hecke algebra and we show a way to compute the transition matrix, from the\nKazhdan-Lusztig basis to the new one.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:41:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Franco","Davide",""]]}
{"id":"2308.01586","submitter":"Pakkasit Sriamorntrakul","authors":"Patsita Sirawongphatsara, Phisit Pornpongtechavanich, Pakkasit\n  Sriamorntrakul, Therdpong Daengsi","title":"Analyzing Bank Account Information of Nominees and Scammers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Nowadays, people heavily rely on the Internet for various activities, such as\ne-commerce (e.g., online shopping) and online banking. While online\ntransactions are practical, they also provide scammers with a new way to\nexploit unsuspecting individuals. This study and investigation utilized data\nfrom ChaladOhn, a website designed and developed by academics and policemen.\nThe data covered the period from February 2022 to January 2023. After analyzing\nand investigating, the results reveal that the total losses amounted to over\n3,100 million Thai Baht, with each case incurring losses of less than 10\nmillion. Furthermore, the investigation discovered the involvement of the top\ntwo banks in the market, KB*** and BB*, in the fraud. These banks accounted\nfor: 1) 28.2% and 16.0% of the total number of scam accounts, 2) 25.6% and\n20.5% of the total transactions, and 3) 35.7% and 14.9% of the total losses\nfrom the victims as recorded in the database, respectively. Considering the\nanticipated deterioration of this issue, it is crucial to inform regulators and\nrelevant organizations about the investigation's findings. This will enable the\ndevelopment, suggestion, and implementation of an efficient solution to address\nthe rapidly increasing number of online scam cases.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:45:15 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sirawongphatsara","Patsita",""],["Pornpongtechavanich","Phisit",""],["Sriamorntrakul","Pakkasit",""],["Daengsi","Therdpong",""]]}
{"id":"2308.01587","submitter":"Longxiang Tang","authors":"Longxiang Tang, Kai Li, Chunming He, Yulun Zhang, Xiu Li","title":"Consistency Regularization for Generalizable Source-free Domain\n  Adaptation","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Source-free domain adaptation (SFDA) aims to adapt a well-trained source\nmodel to an unlabelled target domain without accessing the source dataset,\nmaking it applicable in a variety of real-world scenarios. Existing SFDA\nmethods ONLY assess their adapted models on the target training set, neglecting\nthe data from unseen but identically distributed testing sets. This oversight\nleads to overfitting issues and constrains the model's generalization ability.\nIn this paper, we propose a consistency regularization framework to develop a\nmore generalizable SFDA method, which simultaneously boosts model performance\non both target training and testing datasets. Our method leverages soft\npseudo-labels generated from weakly augmented images to supervise strongly\naugmented images, facilitating the model training process and enhancing the\ngeneralization ability of the adapted model. To leverage more potentially\nuseful supervision, we present a sampling-based pseudo-label selection\nstrategy, taking samples with severer domain shift into consideration.\nMoreover, global-oriented calibration methods are introduced to exploit global\nclass distribution and feature cluster information, further improving the\nadaptation process. Extensive experiments demonstrate our method achieves\nstate-of-the-art performance on several SFDA benchmarks, and exhibits\nrobustness on unseen testing datasets.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:45:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Tang","Longxiang",""],["Li","Kai",""],["He","Chunming",""],["Zhang","Yulun",""],["Li","Xiu",""]]}
{"id":"2308.01588","submitter":"Garvin Yim","authors":"Garvin Yim, Yong Gao, Yacheng Kang, Lijing Shao, Renxin Xu","title":"Continuous gravitational waves from trapped magnetar ejecta and the\n  connection to glitches and antiglitches","comments":"14 pages, 6 figures, 1 appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gravitational waves from isolated sources have eluded detection so far. The\nupper limit of long-lasting continuous gravitational wave emission is now at\nthe stage of probing physically-motivated models with the most optimistic being\nstrongly constrained. One potential avenue to remedy this is to relax the\nassumption of the gravitational wave being quasi-infinite in duration, leading\nto the idea of transient continuous gravitational waves. In this paper, we\noutline how to get transient continuous waves from magnetars (or\nstrongly-magnetised neutron stars) that exhibit glitches and/or antiglitches.\nWe put forward a toy model whereby at a glitch or antiglitch, mass is ejected\nfrom the magnetar but becomes trapped on its outward journey through the\nmagnetosphere. Depending on the specific values of the height of the trapped\nejecta and the magnetic inclination angle, we are able to reproduce both\nglitches and antiglitches from simple angular momentum arguments. The trapped\nejecta sets the magnetar into precession causing gravitational waves to be\nemitted at once and twice the magnetar's spin frequency, for a duration equal\nto however long the ejecta is trapped for. We find that the gravitational waves\nare more likely to be detectable when the magnetar is: closer, rotating faster,\nor has larger glitches/antiglitches. Specific to this model, we find that the\ndetectability improves when the ejecta height and magnetic inclination angle\nhave values near the boundary in the parameter space that separates glitches\nand antiglitches, though this requires more mass to be ejected to remain\nconsistent with the observed glitch/antiglitch.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:47:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yim","Garvin",""],["Gao","Yong",""],["Kang","Yacheng",""],["Shao","Lijing",""],["Xu","Renxin",""]]}
{"id":"2308.01589","submitter":"Dimosthenis Tsouros","authors":"Dimos Tsouros, H\\'el\\`ene Verhaeghe, Serdar Kad{\\i}o\\u{g}lu and Tias\n  Guns","title":"Holy Grail 2.0: From Natural Language to Constraint Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Twenty-seven years ago, E. Freuder highlighted that \"Constraint programming\nrepresents one of the closest approaches computer science has yet made to the\nHoly Grail of programming: the user states the problem, the computer solves\nit\". Nowadays, CP users have great modeling tools available (like Minizinc and\nCPMpy), allowing them to formulate the problem and then let a solver do the\nrest of the job, getting closer to the stated goal. However, this still\nrequires the CP user to know the formalism and respect it. Another significant\nchallenge lies in the expertise required to effectively model combinatorial\nproblems. All this limits the wider adoption of CP. In this position paper, we\ninvestigate a possible approach to leverage pre-trained Large Language Models\nto extract models from textual problem descriptions. More specifically, we take\ninspiration from the Natural Language Processing for Optimization (NL4OPT)\nchallenge and present early results with a decomposition-based prompting\napproach to GPT Models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:48:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Tsouros","Dimos",""],["Verhaeghe","H\u00e9l\u00e8ne",""],["Kad\u0131o\u011flu","Serdar",""],["Guns","Tias",""]]}
{"id":"2308.01590","submitter":"Sam Hughes","authors":"Yassine Guerch, Sam Hughes, Luis Jorge S\\'anchez Salda\\~na","title":"Centralisers and the virtually cyclic dimension of $\\mathrm{Out}(F_N)$","comments":"35 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.AT math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that the virtually cyclic (geometric) dimension of the finite index\ncongruence subgroup $\\mathrm{IA}_N(3)$ of $\\mathrm{Out}(F_N)$ is $2N-2$. From\nthis we deduce the virtually cyclic dimension of $\\mathrm{Out}(F_N)$ is finite.\nAlong the way we prove L\\\"uck's property (C) holds for $\\mathrm{Out}(F_N)$, we\nprove that the commensurator of a cyclic subgroup of $\\mathrm{IA}_N(3)$ equals\nits centraliser, we give an $\\mathrm{IA}_N(3)$ analogue of various exact\nsequences arising from reduction systems for mapping class groups, and give a\nnear complete description of centralisers of infinite order elements in\n$\\mathrm{IA}_3(3)$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:49:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Guerch","Yassine",""],["Hughes","Sam",""],["Salda\u00f1a","Luis Jorge S\u00e1nchez",""]]}
{"id":"2308.01591","submitter":"Yuzuru Inahama","authors":"Yuzuru Inahama, Yong Xu, Xiaoyu Yang","title":"Moderate deviations for rough differential equations","comments":"11 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Small noise problems are quite important for all types of stochastic\ndifferential equations. In this paper we focus on rough differential equations\ndriven by scaled fractional Brownian rough path with Hurst parameter H between\n1/4 and 1/2. We prove a moderate deviation principle for this equation as the\nscale parameter tends to zero.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:49:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Inahama","Yuzuru",""],["Xu","Yong",""],["Yang","Xiaoyu",""]]}
{"id":"2308.01592","submitter":"Tianyin Ren","authors":"Tianyin Ren, Xiaochun Rong","title":"Quantitative Maximal Diameter Rigidity of Positive Ricci Curvature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In Riemannian geometry, the Cheng's maximal diameter rigidity theorem says\nthat if a complete $n$-manifold $M$ of Ricci curvature,\n$\\operatorname{Ric}_M\\ge (n-1)$, has the maximal diameter $\\pi$, then $M$ is\nisometric to the unit sphere $S^n_1$. The main result in this paper is a\nquantitative maximal diameter rigidity: if $M$ satisfies that\n$\\operatorname{Ric}_M\\ge n-1$, $\\operatorname{diam}(M)\\approx \\pi$, and the\nRiemannian universal cover of every metric ball in $M$ of a definite radius\nsatisfies a Riefenberg condition, then $M$ is diffeomorphic and bi-H\\\"older\nclose to $S^n_1$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:54:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ren","Tianyin",""],["Rong","Xiaochun",""]]}
{"id":"2308.01593","submitter":"Hanbin Zhang","authors":"Dongchun Han, Hanbin Zhang","title":"New constructions of NMDS self-dual codes","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Near maximum distance separable (NMDS) codes are important in finite geometry\nand coding theory. Self-dual codes are closely related to combinatorics,\nlattice theory, and have important application in cryptography. In this paper,\nwe construct a class of $q$-ary linear codes and prove that they are either MDS\nor NMDS which depends on certain zero-sum condition. In the NMDS case, we\nprovide an effective approach to construct NMDS self-dual codes which largely\nextend known parameters of such codes. In particular, we proved that for square\n$q$, almost $q/8$ NMDS self-dual $q$-ary codes can be constructed.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:55:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Han","Dongchun",""],["Zhang","Hanbin",""]]}
{"id":"2308.01594","submitter":"Kyungryun Lee","authors":"Kyungryun Lee and Won-Ki Jeong","title":"Reference-Free Isotropic 3D EM Reconstruction using Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Electron microscopy (EM) images exhibit anisotropic axial resolution due to\nthe characteristics inherent to the imaging modality, presenting challenges in\nanalysis and downstream tasks.In this paper, we propose a diffusion-model-based\nframework that overcomes the limitations of requiring reference data or prior\nknowledge about the degradation process. Our approach utilizes 2D diffusion\nmodels to consistently reconstruct 3D volumes and is well-suited for highly\ndownsampled data. Extensive experiments conducted on two public datasets\ndemonstrate the robustness and superiority of leveraging the generative prior\ncompared to supervised learning methods. Additionally, we demonstrate our\nmethod's feasibility for self-supervised reconstruction, which can restore a\nsingle anisotropic volume without any training data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:57:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lee","Kyungryun",""],["Jeong","Won-Ki",""]]}
{"id":"2308.01595","submitter":"Bai-Ling Wang","authors":"Bohui Chen, Kaoru Ono and Bai-Ling Wang","title":"Twisted sectors for Lagrangian Floer theory on symplectic orbifolds","comments":"In honour of Professor Jean-Pierre Bourguignon on the occasion of his\n  75th birthday","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce the notion of Lagrangians in a symplectic\norbifold and their dihedral twisted sectors. We also give a brief discussion on\nthe filtered $A_\\infty$-algebra associated with a Lagrangian in a closed\nsymplectic orbifold.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:57:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chen","Bohui",""],["Ono","Kaoru",""],["Wang","Bai-Ling",""]]}
{"id":"2308.01596","submitter":"Silvia Sarpietro","authors":"Raffaella Giacomini, Sokbae Lee, Silvia Sarpietro","title":"A Robust Method for Microforecasting and Estimation of Random Effects","comments":"45 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a method for forecasting individual outcomes and estimating random\neffects in linear panel data models and value-added models when the panel has a\nshort time dimension. The method is robust, trivial to implement and requires\nminimal assumptions. The idea is to take a weighted average of time series- and\npooled forecasts/estimators, with individual weights that are based on time\nseries information. We show the forecast optimality of individual weights, both\nin terms of minimax-regret and of mean squared forecast error. We then provide\nfeasible weights that ensure good performance under weaker assumptions than\nthose required by existing approaches. Unlike existing shrinkage methods, our\napproach borrows the strength - but avoids the tyranny - of the majority, by\ntargeting individual (instead of group) accuracy and letting the data decide\nhow much strength each individual should borrow. Unlike existing empirical\nBayesian methods, our frequentist approach requires no distributional\nassumptions, and, in fact, it is particularly advantageous in the presence of\nfeatures such as heavy tails that would make a fully nonparametric procedure\nproblematic.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:01:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Giacomini","Raffaella",""],["Lee","Sokbae",""],["Sarpietro","Silvia",""]]}
{"id":"2308.01597","submitter":"Stefano Borgo","authors":"Stefano Borgo, Roberta Ferrario, Aldo Gangemi, Nicola Guarino, Claudio\n  Masolo, Daniele Porello, Emilio M. Sanfilippo, Laure Vieu","title":"DOLCE: A Descriptive Ontology for Linguistic and Cognitive Engineering","comments":"25 pages, 7 figures","journal-ref":"Applied Ontology 17 (2022):45-69","doi":"10.3233/AO-210259","report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  DOLCE, the first top-level (foundational) ontology to be axiomatized, has\nremained stable for twenty years and today is broadly used in a variety of\ndomains. DOLCE is inspired by cognitive and linguistic considerations and aims\nto model a commonsense view of reality, like the one human beings exploit in\neveryday life in areas as diverse as socio-technical systems, manufacturing,\nfinancial transactions and cultural heritage. DOLCE clearly lists the\nontological choices it is based upon, relies on philosophical principles, is\nrichly formalized, and is built according to well-established ontological\nmethodologies, e.g. OntoClean. Because of these features, it has inspired most\nof the existing top-level ontologies and has been used to develop or improve\nstandards and public domain resources (e.g. CIDOC CRM, DBpedia and WordNet).\nBeing a foundational ontology, DOLCE is not directly concerned with domain\nknowledge. Its purpose is to provide the general categories and relations\nneeded to give a coherent view of reality, to integrate domain knowledge, and\nto mediate across domains. In these 20 years DOLCE has shown that applied\nontologies can be stable and that interoperability across reference and domain\nontologies is a reality. This paper briefly introduces the ontology and shows\nhow to use it on a few modeling cases.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:03:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Borgo","Stefano",""],["Ferrario","Roberta",""],["Gangemi","Aldo",""],["Guarino","Nicola",""],["Masolo","Claudio",""],["Porello","Daniele",""],["Sanfilippo","Emilio M.",""],["Vieu","Laure",""]]}
{"id":"2308.01598","submitter":"Ramanujan M. S.","authors":"Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan,\n  Saket Saurabh, Meirav Zehavi","title":"Meta-theorems for Parameterized Streaming Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The streaming model was introduced to parameterized complexity independently\nby Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and\nMonemizadeh [SODA15]. Subsequently, it was broadened by Chitnis, Cormode,\nEsfandiari, Hajiaghayi and Monemizadeh [SPAA15] and by Chitnis, Cormode,\nEsfandiari, Hajiaghayi, McGregor, Monemizadeh and Vorotnikova [SODA16]. Despite\nits strong motivation, the applicability of the streaming model to central\nproblems in parameterized complexity has remained, for almost a decade, quite\nlimited. Indeed, due to simple $\\Omega(n)$-space lower bounds for many of these\nproblems, the $k^{O(1)}\\cdot {\\rm polylog}(n)$-space requirement in the model\nis too strict.\n  Thus, we explore {\\em semi-streaming} algorithms for parameterized graph\nproblems, and present the first systematic study of this topic. Crucially, we\naim to construct succinct representations of the input on which optimal\npost-processing time complexity can be achieved.\n  - We devise meta-theorems specifically designed for parameterized streaming\nand demonstrate their applicability by obtaining the first $k^{O(1)}\\cdot\nn\\cdot {\\rm polylog}(n)$-space streaming algorithms for well-studied problems\nsuch as Feedback Vertex Set on Tournaments, Cluster Vertex Deletion, Proper\nInterval Vertex Deletion and Block Vertex Deletion. In the process, we\ndemonstrate a fundamental connection between semi-streaming algorithms for\nrecognizing graphs in a graph class H and semi-streaming algorithms for the\nproblem of vertex deletion into H.\n  - We present an algorithmic machinery for obtaining streaming algorithms for\ncut problems and exemplify this by giving the first $k^{O(1)}\\cdot n\\cdot {\\rm\npolylog}(n)$-space streaming algorithms for Graph Bipartitization, Multiway Cut\nand Subset Feedback Vertex Set.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:05:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lokshtanov","Daniel",""],["Misra","Pranabendu",""],["Panolan","Fahad",""],["Ramanujan","M. S.",""],["Saurabh","Saket",""],["Zehavi","Meirav",""]]}
{"id":"2308.01599","submitter":"Lucas Guillemot","authors":"Lucas Guillemot, Isma\\\"el Cognard, Willem van Straten, Gilles\n  Theureau, Eric G\\'erard","title":"Improving pulsar polarization and timing measurements with the\n  Nan\\c{c}ay Radio Telescope","comments":"Accepted to Astronomy & Astrophysics. 20 pages, 16 figures, 2 tables,\n  abstract significantly shortened to match astro-ph limit","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate polarimetric calibration of the radio pulse profiles from pulsars is\ncrucial for studying their radiation properties at these wavelengths.\nInaccurate calibration can also distort recorded pulse profiles, introducing\nnoise in time of arrival (TOA) data and thus degrading pulsar timing analyses.\nOne method for determining the full polarimetric response of a given telescope\nis to conduct observations of bright polarized pulsars over wide ranges of\nparallactic angles, to sample different orientations of their polarization\nangle and determine the cross-couplings between polarization feeds. The\nNan\\c{c}ay decimetric Radio Telescope (NRT) is a 94m equivalent meridian\ntelescope, capable of tracking a given pulsar for approximately one hour around\ntransit. In November 2019, we began conducting regular observations of the\nbright and highly linearly polarized pulsar PSR~J0742$-$2822, in a special mode\nwhere the feed horn rotates by $\\sim 180^\\circ$ over the course of the one hour\nobservation, mimicking wide parallactic angle variations and enabling us to\ndetermine the polarimetric response of the NRT at 1.4~GHz. The improved\npolarimetric response of the NRT as determined from these observations was\napplied to observations of a selection of MSPs with published polarimetric\nproperties. We find that the new polarimetric profiles and polarization\nposition angles are consistent with previous findings, unlike NRT polarimetric\nresults obtained with the previously used method of calibration. The analysis\nof timing data on J1730$-$2304, J1744$-$1134, and J1857+0953 shows that the new\ncalibration method improves the quality of the timing, and the Matrix Template\nMatching (MTM) method proves very effective at reducing noise from imperfect\ncalibration. For pulsars with sufficient degrees of polarization, the MTM\nmethod appears to be the preferred method for extracting TOAs from NRT\nobservations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:07:27 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 08:50:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guillemot","Lucas",""],["Cognard","Isma\u00ebl",""],["van Straten","Willem",""],["Theureau","Gilles",""],["G\u00e9rard","Eric",""]]}
{"id":"2308.01600","submitter":"Shihan Lu","authors":"Shihan Lu, Heather Culbertson","title":"Active Acoustic Sensing for Robot Manipulation","comments":"8 pages, 9 figures. Conference paper accepted to 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://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Perception in robot manipulation has been actively explored with the goal of\nadvancing and integrating vision and touch for global and local feature\nextraction. However, it is difficult to perceive certain object internal\nstates, and the integration of visual and haptic perception is not compact and\nis easily biased. We propose to address these limitations by developing an\nactive acoustic sensing method for robot manipulation. Active acoustic sensing\nrelies on the resonant properties of the object, which are related to its\nmaterial, shape, internal structure, and contact interactions with the gripper\nand environment. The sensor consists of a vibration actuator paired with a\npiezo-electric microphone. The actuator generates a waveform, and the\nmicrophone tracks the waveform's propagation and distortion as it travels\nthrough the object. This paper presents the sensing principles, hardware\ndesign, simulation development, and evaluation of physical and simulated\nsensory data under different conditions as a proof-of-concept. This work aims\nto provide fundamentals on a useful tool for downstream robot manipulation\ntasks using active acoustic sensing, such as object recognition, grasping point\nestimation, object pose estimation, and external contact formation detection.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:10:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lu","Shihan",""],["Culbertson","Heather",""]]}
{"id":"2308.01601","submitter":"Mousumi Das","authors":"Mousumi Das (IIA), Roger Ianjamasimanana (CSIC), Stacy McGaugh (CWRU),\n  James Schombert (University of Oregon), K.S.Dwarakanath (RRI)","title":"The oblateness of dark matter halos of nearby galaxies and its\n  correlation with gas mass fractions","comments":"6 pages, 3 figures. Appeared in the proceedings of Dynamical Masses\n  of Local Group Galaxies: IAU Symposium 379, held in Potsdam, March 2023","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 a method to measure the the oblateness parameter q of the dark\nmatter halos of gas rich galaxies that have extended HI disks. We have applied\nour model to a sample of 20 nearby galaxies that are gas rich and close to\nface-on, of which 6 are large disk galaxies, 8 have moderate stellar masses and\n6 are low surface brightness (LSB) dwarf galaxies. We have used the stacked HI\nvelocity dispersion and HI surface densities to derive q in the outer disk\nregions. Our most important result is that gas dominated galaxies (such as LSB\ndwarfs) that have M(gas)/M(baryons)>0.5 have oblate halos (q<0.55), whereas\nstellar dominated galaxies have a range of q values from 0.2 to 1.3. We also\nfind a significant positive correlation between q and stellar mass, which\nindicates that galaxies with massive stellar disks have a higher probability of\nhaving halos that are spherical or slightly prolate, whereas low mass galaxies\npreferably have oblate halos. We briefly also discuss how the halo shape\naffects the disks of galaxies, especially the oblate halos.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:12:26 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Das","Mousumi","","IIA"],["Ianjamasimanana","Roger","","CSIC"],["McGaugh","Stacy","","CWRU"],["Schombert","James","","University of Oregon"],["Dwarakanath","K. S.","","RRI"]]}
{"id":"2308.01602","submitter":"Nicola Rares Franco","authors":"Nicola Rares Franco, Stefania Fresca, Filippo Tombari and Andrea\n  Manzoni","title":"Deep Learning-based surrogate models for parametrized PDEs: handling\n  geometric variability through graph neural networks","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":"  Mesh-based simulations play a key role when modeling complex physical systems\nthat, in many disciplines across science and engineering, require the solution\nof parametrized time-dependent nonlinear partial differential equations (PDEs).\nIn this context, full order models (FOMs), such as those relying on the finite\nelement method, can reach high levels of accuracy, however often yielding\nintensive simulations to run. For this reason, surrogate models are developed\nto replace computationally expensive solvers with more efficient ones, which\ncan strike favorable trade-offs between accuracy and efficiency. This work\nexplores the potential usage of graph neural networks (GNNs) for the simulation\nof time-dependent PDEs in the presence of geometrical variability. In\nparticular, we propose a systematic strategy to build surrogate models based on\na data-driven time-stepping scheme where a GNN architecture is used to\nefficiently evolve the system. With respect to the majority of surrogate\nmodels, the proposed approach stands out for its ability of tackling problems\nwith parameter dependent spatial domains, while simultaneously generalizing to\ndifferent geometries and mesh resolutions. We assess the effectiveness of the\nproposed approach through a series of numerical experiments, involving both\ntwo- and three-dimensional problems, showing that GNNs can provide a valid\nalternative to traditional surrogate models in terms of computational\nefficiency and generalization to new scenarios. We also assess, from a\nnumerical standpoint, the importance of using GNNs, rather than classical dense\ndeep neural networks, for the proposed framework.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:14:28 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Franco","Nicola Rares",""],["Fresca","Stefania",""],["Tombari","Filippo",""],["Manzoni","Andrea",""]]}
{"id":"2308.01603","submitter":"Reyhaneh Khasseh","authors":"Reyhaneh Khasseh, Sascha Wald, Roderich Moessner, Christoph A. Weber,\n  Markus Heyl","title":"Active quantum flocks","comments":"4+ pages and 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.quant-gas cond-mat.stat-mech cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Flocks of animals represent a fascinating archetype of collective behavior in\nthe macroscopic classical world, where the constituents, such as birds,\nconcertedly perform motions and actions as if being one single entity. Here, we\naddress the outstanding question of whether flocks can also form in the\nmicroscopic world at the quantum level. For that purpose, we introduce the\nconcept of active quantum matter by formulating a class of models of active\nquantum particles on a one-dimensional lattice. We provide both analytical and\nlarge-scale numerical evidence that these systems can give rise to quantum\nflocks. A key finding is that these flocks, unlike classical ones, exhibit\ndistinct quantum properties by developing strong quantum coherence over long\ndistances. We propose that quantum flocks could be experimentally observed in\nRydberg atom arrays. Our work paves the way towards realizing the intriguing\ncollective behaviors of biological active particles in quantum matter systems.\nWe expect that this opens up a path towards a yet totally unexplored class of\nnonequilibrium quantum many-body systems with unique properties.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:15:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Khasseh","Reyhaneh",""],["Wald","Sascha",""],["Moessner","Roderich",""],["Weber","Christoph A.",""],["Heyl","Markus",""]]}
{"id":"2308.01604","submitter":"Muhammad Salman Ikrar Musyaffa","authors":"Muhammad Salman Ikrar Musyaffa, Novanto Yudistira, Muhammad Arif\n  Rahman","title":"IndoHerb: Indonesia Medicinal Plants Recognition using Transfer Learning\n  and Deep Learning","comments":"25 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Herbal plants are nutritious plants that can be used as an alternative to\ntraditional disease healing. In Indonesia there are various types of herbal\nplants. But with the development of the times, the existence of herbal plants\nas traditional medicines began to be forgotten so that not everyone could\nrecognize them. Having the ability to identify herbal plants can have many\npositive impacts. However, there is a problem where identifying plants can take\na long time because it requires in-depth knowledge and careful examination of\nplant criteria. So that the application of computer vision can help identify\nherbal plants. Previously, research had been conducted on the introduction of\nherbal plants from Vietnam using several algorithms, but from these research\nthe accuracy was not high enough. Therefore, this study intends to implement\ntransfer learning from the Convolutional Neural Network (CNN) algorithm to\nclassify types of herbal plants from Indonesia. This research was conducted by\ncollecting image data of herbal plants from Indonesia independently through the\nGoogle Images search engine. After that, it will go through the data\npreprocessing, classification using the transfer learning method from CNN, and\nanalysis will be carried out. The CNN transfer learning models used are\nResNet34, DenseNet121, and VGG11_bn. Based on the test results of the three\nmodels, it was found that DenseNet121 was the model with the highest accuracy,\nwhich was 87.4%. In addition, testing was also carried out using the scratch\nmodel and obtained an accuracy of 43.53%. The Hyperparameter configuration used\nin this test is the ExponentialLR scheduler with a gamma value of 0.9; learning\nrate 0.001; Cross Entropy Loss function; Adam optimizer; and the number of\nepochs is 50. Indonesia Medicinal Plant Dataset can be accessed at the\nfollowing link https://github.com/Salmanim20/indo_medicinal_plant\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:16:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Musyaffa","Muhammad Salman Ikrar",""],["Yudistira","Novanto",""],["Rahman","Muhammad Arif",""]]}
{"id":"2308.01605","submitter":"Matthieu Doutreligne","authors":"Matthieu Doutreligne (SODA), Tristan Struja (MIT, SODA), Judith\n  Abecassis (SODA), Claire Morgand (ARS IDF), Leo Anthony Celi (MIT), Ga\\\"el\n  Varoquaux (SODA)","title":"Causal thinking for decision making on Electronic Health Records: why\n  and how","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate predictions, as with machine learning, may not suffice to provide\noptimal healthcare for every patient. Indeed, prediction can be driven by\nshortcuts in the data, such as racial biases. Causal thinking is needed for\ndata-driven decisions. Here, we give an introduction to the key elements,\nfocusing on routinely-collected data, electronic health records (EHRs) and\nclaims data. Using such data to assess the value of an intervention requires\ncare: temporal dependencies and existing practices easily confound the causal\neffect. We present a step-by-step framework to help build valid decision making\nfrom real-life patient records by emulating a randomized trial before\nindividualizing decisions, eg with machine learning. Our framework highlights\nthe most important pitfalls and considerations in analysing EHRs or claims data\nto draw causal conclusions. We illustrate the various choices in studying the\neffect of albumin on sepsis mortality in the Medical Information Mart for\nIntensive Care database (MIMIC-IV). We study the impact of various choices at\nevery step, from feature extraction to causal-estimator selection. In a\ntutorial spirit, the code and the data are openly available.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:17:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Doutreligne","Matthieu","","SODA"],["Struja","Tristan","","MIT, SODA"],["Abecassis","Judith","","SODA"],["Morgand","Claire","","ARS IDF"],["Celi","Leo Anthony","","MIT"],["Varoquaux","Ga\u00ebl","","SODA"]]}
{"id":"2308.01606","submitter":"Liang Peng","authors":"Liang Peng and Xin Wang and Xiaofeng Zhu","title":"Unsupervised Multiplex Graph Learning with Complementary and Consistent\n  Information","comments":null,"journal-ref":null,"doi":"10.1145/3581783.3611971","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unsupervised multiplex graph learning (UMGL) has been shown to achieve\nsignificant effectiveness for different downstream tasks by exploring both\ncomplementary information and consistent information among multiple graphs.\nHowever, previous methods usually overlook the issues in practical\napplications, i.e., the out-of-sample issue and the noise issue. To address the\nabove issues, in this paper, we propose an effective and efficient UMGL method\nto explore both complementary and consistent information. To do this, our\nmethod employs multiple MLP encoders rather than graph convolutional network\n(GCN) to conduct representation learning with two constraints, i.e., preserving\nthe local graph structure among nodes to handle the out-of-sample issue, and\nmaximizing the correlation of multiple node representations to handle the noise\nissue. Comprehensive experiments demonstrate that our proposed method achieves\nsuperior effectiveness and efficiency over the comparison methods and\neffectively tackles those two issues. Code is available at\nhttps://github.com/LarryUESTC/CoCoMG.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:24:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Peng","Liang",""],["Wang","Xin",""],["Zhu","Xiaofeng",""]]}
{"id":"2308.01607","submitter":"Ahmed Eleliemy","authors":"Ahmed Eleliemy and Florina M. Ciorba","title":"DaphneSched: A Scheduler for Integrated Data Analysis Pipelines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  DAPHNE is a new open-source software infrastructure designed to address the\nincreasing demands of integrated data analysis (IDA) pipelines, comprising data\nmanagement (DM), high performance computing (HPC), and machine learning (ML)\nsystems. Efficiently executing IDA pipelines is challenging due to their\ndiverse computing characteristics and demands. Therefore, IDA pipelines\nexecuted with the DAPHNE infrastructure require an efficient and versatile\nscheduler to support these demands. This work introduces DaphneSched, the\ntask-based scheduler at the core of DAPHNE. DaphneSched is versatile by\nincorporating eleven task partitioning and three task assignment techniques,\nbringing the state-of-the-art closer to the state-of-the-practice task\nscheduling. To showcase DaphneSched's effectiveness in scheduling IDA\npipelines, we evaluate its performance on two applications: a product\nrecommendation system and a linear regression model training. We conduct\nperformance experiments on multicore platforms with 20 and 56 cores. The\nresults show that the versatility of DaphneSched enabled combinations of\nscheduling strategies that outperform commonly used scheduling techniques by up\nto 13%. This work confirms the benefits of employing DaphneSched for the\nefficient execution of applications with IDA pipelines.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:26:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Eleliemy","Ahmed",""],["Ciorba","Florina M.",""]]}
{"id":"2308.01608","submitter":"Jian-Jian Cheng","authors":"Jian-Jian Cheng","title":"Manifestation of topological phase in neutron spin rotation without\n  adiabatic regime","comments":"4 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Bitter-Dubbers (BD) experiment is an important experiment that originally\naimed to measure topological phase using polarized-neutron spin rotation in a\nhelical magnetic field under adiabatic conditions. Contrary to expectations,\nupon reevaluation of the BD experiment, it has been found that adiabatic\nconditions are not necessary for measuring topological phase. In scenarios\nwhere the magnetic field is neither homogeneous nor strong enough, and the\nneutron has a fast velocity, the topological phase can still be manifested. To\ndemonstrate this, we analytically solve the time-dependent Schrodinger equation\nfor the neutron spin rotation in general rotating systems. These exact\nsolutions are then utilized to investigate the nonadiabatic topological phase\nunder the conditions mentioned above. The numerical simulations of the\nnonadiabatic topological phase have shown a strong concurrence with the BD\nexperimental data. This novel result extends our understanding of the\ntopological phase observed in neutron spin rotation, even in more complex and\ndynamic scenarios beyond the originally required adiabatic conditions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:28:18 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 05:03:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cheng","Jian-Jian",""]]}
{"id":"2308.01609","submitter":"Lu Zeng","authors":"Lu Zeng, Xuan Chen, Xiaoshuang Shi, Heng Tao Shen","title":"Feature Noise Boosts DNN Generalization under Label Noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The presence of label noise in the training data has a profound impact on the\ngeneralization of deep neural networks (DNNs). In this study, we introduce and\ntheoretically demonstrate a simple feature noise method, which directly adds\nnoise to the features of training data, can enhance the generalization of DNNs\nunder label noise. Specifically, we conduct theoretical analyses to reveal that\nlabel noise leads to weakened DNN generalization by loosening the PAC-Bayes\ngeneralization bound, and feature noise results in better DNN generalization by\nimposing an upper bound on the mutual information between the model weights and\nthe features, which constrains the PAC-Bayes generalization bound. Furthermore,\nto ensure effective generalization of DNNs in the presence of label noise, we\nconduct application analyses to identify the optimal types and levels of\nfeature noise to add for obtaining desirable label noise generalization.\nFinally, extensive experimental results on several popular datasets demonstrate\nthe feature noise method can significantly enhance the label noise\ngeneralization of the state-of-the-art label noise method.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:31:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zeng","Lu",""],["Chen","Xuan",""],["Shi","Xiaoshuang",""],["Shen","Heng Tao",""]]}
{"id":"2308.01610","submitter":"Jonas Sommerfeldt","authors":"J. Sommerfeldt, V. A. Yerokhin, A. Surzhykov","title":"Delbr\\\"uck scattering above the pair production threshold: Going beyond\n  the Born approximation","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 present a theoretical method to calculate Delbr\\\"uck scattering amplitudes\nfor photon energies above the electron-positron pair production threshold. The\nmethod is based on the application of the relativistic Dirac-Coulomb Green\nfunction and describes the interaction of the virtual $e^+e^-$ pair with the\nCoulomb field of a target to all orders in the coupling strength parameter\n$\\alpha Z$. To illustrate the application of the developed approach, detailed\ncalculations have been performed for the scattering of 2.754~MeV photons off\nbare ions with a wide range of nuclear charge numbers. Results of these\ncalculations clearly indicate that the higher-order terms beyond the Born\napproximation lead to a strong enhancement of the imaginary part of the\nDelbr\\\"uck amplitude and have to be taken into account for the analysis and\nguidance of gamma-ray scattering experiments.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:32:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sommerfeldt","J.",""],["Yerokhin","V. A.",""],["Surzhykov","A.",""]]}
{"id":"2308.01611","submitter":"Fatiha Alabau-Boussouira","authors":"Fatiha Alabau-Boussouira","title":"Part I: Rebuttal to \"Uniform stabilization for the Timoshenko beam by a\n  locally distributed damping\"","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A paper, entitled \"Uniform stabilization for the Timoshenko beam by a locally\ndistributed damping\" was published in 2003, in the journal Electronic Journal\nof Differential Equations. Its title concerns exclusively its Section 3,\ndevoted to the case of equal speeds of propagation and to its main theorem,\nnamely Theorem 3.1. It states that the solutions of the Timoshenko system (see\n(1.3) in [1]) decays exponentially when the damping coefficient b is locally\ndistributed. The proof of Theorem 3.1 is crucially based on Lemma 3.6, which\nstates the existence of a strict Lyapunov function along which the solutions of\n(1.3) decay when the speeds of propagation are equal. This rebuttal shows the\nmajor gap and flaws in the proof of Lemma 3.6, which invalidate the proofs of\nLemma 3.6 and Theorem 3.1. Lemma 3.6 is stated at the top of page 12. The main\npart of its proof is given in the pages 12 and 13. In the last eight lines of\npage 13, eight inequalities are requested to hold together for the proof of\nLemma 3.6. They don't appear in the statements of Lemma 3.6. The subsequent\nflaws come from the evidence that several of them are contradictory either\nbetween them or with claims in the title of the article. We also point in this\nrebuttal other flaws, or gaps in the proofs of Theorem 2.2 related to strong\nstability and non uniform stability for the case of distinct speeds of\npropagation. In [3], we correct and complete the proof of strong stability. We\nalso correct, set up the missing functional frames, fill the gaps in the proof\nof non uniform stability in the cases of different speeds of propagation, and\ncomplete a missing argument in the proof of Theorem A in [4] (see Remark 4.3),\nthe result of Theorem A being used in the paper [1] on which this rebuttal is\nmainly devoted.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:35:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Alabau-Boussouira","Fatiha",""]]}
{"id":"2308.01612","submitter":"Gurleen Kaur Dr.","authors":"Gurleen Kaur, Amit Kulshrestha, Anupam Singh","title":"Representation dimension of some finite groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a finite group $G$, the representation dimension is the smallest integer\nrealizable as the degree of a complex faithful representation of $G$. In this\narticle, we compute representation dimension for some $p$-groups, their direct\nproducts, and groups with certain conditions on nonlinear irreducible\ncharacters. We also make similar computations for the smallest integer\nrealizable as the degree of an irreducible complex faithful representation of\n$G$, if one exists. In the appendix, we present GAP codes to compute these\nnumbers.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:37:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kaur","Gurleen",""],["Kulshrestha","Amit",""],["Singh","Anupam",""]]}
{"id":"2308.01613","submitter":"Alexander Sommer","authors":"Alexander Sommer, Ulrich Schwanecke, Elmar Sch\\\"omer","title":"Real-time Light Estimation and Neural Soft Shadows for AR Indoor\n  Scenarios","comments":null,"journal-ref":"Journal of WSCG, Vol.31 (2023) 1-2","doi":"10.24132/JWSCG.2023.8","report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present a pipeline for realistic embedding of virtual objects into footage\nof indoor scenes with focus on real-time AR applications. Our pipeline consists\nof two main components: A light estimator and a neural soft shadow texture\ngenerator. Our light estimation is based on deep neural nets and determines the\nmain light direction, light color, ambient color and an opacity parameter for\nthe shadow texture. Our neural soft shadow method encodes object-based\nrealistic soft shadows as light direction dependent textures in a small MLP. We\nshow that our pipeline can be used to integrate objects into AR scenes in a new\nlevel of realism in real-time. Our models are small enough to run on current\nmobile devices. We achieve runtimes of 9ms for light estimation and 5ms for\nneural shadows on an iPhone 11 Pro.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:41:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sommer","Alexander",""],["Schwanecke","Ulrich",""],["Sch\u00f6mer","Elmar",""]]}
{"id":"2308.01614","submitter":"Sujan Sai Gannamaneni","authors":"Sujan Sai Gannamaneni, Michael Mock, Maram Akila","title":"Assessing Systematic Weaknesses of DNNs using Counterfactuals","comments":"AAAI Spring Symposium 2023","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":"  With the advancement of DNNs into safety-critical applications, testing\napproaches for such models have gained more attention. A current direction is\nthe search for and identification of systematic weaknesses that put safety\nassumptions based on average performance values at risk. Such weaknesses can\ntake on the form of (semantically coherent) subsets or areas in the input space\nwhere a DNN performs systematically worse than its expected average. However,\nit is non-trivial to attribute the reason for such observed low performances to\nthe specific semantic features that describe the subset. For instance,\ninhomogeneities within the data w.r.t. other (non-considered) attributes might\ndistort results. However, taking into account all (available) attributes and\ntheir interaction is often computationally highly expensive. Inspired by\ncounterfactual explanations, we propose an effective and computationally cheap\nalgorithm to validate the semantic attribution of existing subsets, i.e., to\ncheck whether the identified attribute is likely to have caused the degraded\nperformance. We demonstrate this approach on an example from the autonomous\ndriving domain using highly annotated simulated data, where we show for a\nsemantic segmentation model that (i) performance differences among the\ndifferent pedestrian assets exist, but (ii) only in some cases is the asset\ntype itself the reason for this reduction in the performance.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:41:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gannamaneni","Sujan Sai",""],["Mock","Michael",""],["Akila","Maram",""]]}
{"id":"2308.01615","submitter":"Nigel Bishop","authors":"Vishnu Kakkat and Nigel T. Bishop and Amos S. Kubeka","title":"Gravitational Wave Heating","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  It was shown in previous work that when a gravitational wave (GW) passes\nthrough a viscous shell of matter the magnitude of the GW will be damped and\nthere are astrohysical circumstances in which the damping is almost complete.\nThe energy transfer from the GWs to the fluid will increase its temperature. We\nconstruct a model for this process and obtain an expression for the temperature\ndistribution inside the shell in terms of spherical harmonics. Further, it is\nshown that this effect is astrophysically significant: a model problem is\nconstructed for which the temperature increase is of order $10^7{}^\\circ$K.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:42:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kakkat","Vishnu",""],["Bishop","Nigel T.",""],["Kubeka","Amos S.",""]]}
{"id":"2308.01616","submitter":"Tomas Barta","authors":"Tom\\'a\\v{s} B\\'arta, Paige Davis, Petr Kaplick\\'y","title":"Maximal regularity of Stokes problem with dynamic boundary condition --\n  Hilbert setting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For the evolutionary Stokes problem with dynamic boundary condition we show\nmaximal regularity of weak solutions in time. Due to the characteriation of\n$R$-sectorial operators on Hilbert spaces, the proof reduces to finding the\ncorrect functional analytic setting and proving that an operator is sectorial,\ni.e. generates an analytic semigroup.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:47:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["B\u00e1rta","Tom\u00e1\u0161",""],["Davis","Paige",""],["Kaplick\u00fd","Petr",""]]}
{"id":"2308.01617","submitter":"Adeel A. Khan","authors":"Adeel A. Khan","title":"The lattice property for perfect complexes on singular stacks","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let C be the stable oo-category of perfect complexes on a derived\nDeligne-Mumford stack X of finite type over the complex numbers. We prove that\nthe complexified noncommutative topological Chern character is an isomorphism\nfor C. In the appendix we show the same property for C the stable oo-category\nof coherent complexes on a derived algebraic space.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:47:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Khan","Adeel A.",""]]}
{"id":"2308.01618","submitter":"Peng Wang","authors":"Peng Wang, Fanwei Zeng, Yuntao Qian","title":"A Survey on Deep Learning-based Spatio-temporal Action Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spatio-temporal action detection (STAD) aims to classify the actions present\nin a video and localize them in space and time. It has become a particularly\nactive area of research in computer vision because of its explosively emerging\nreal-world applications, such as autonomous driving, visual surveillance,\nentertainment, etc. Many efforts have been devoted in recent years to building\na robust and effective framework for STAD. This paper provides a comprehensive\nreview of the state-of-the-art deep learning-based methods for STAD. Firstly, a\ntaxonomy is developed to organize these methods. Next, the linking algorithms,\nwhich aim to associate the frame- or clip-level detection results together to\nform action tubes, are reviewed. Then, the commonly used benchmark datasets and\nevaluation metrics are introduced, and the performance of state-of-the-art\nmodels is compared. At last, this paper is concluded, and a set of potential\nresearch directions of STAD are discussed.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:48:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wang","Peng",""],["Zeng","Fanwei",""],["Qian","Yuntao",""]]}
{"id":"2308.01619","submitter":"Yuriy Klymenko Dr.","authors":"O. K. Cheremnykh, A. K. Fedorenko, E. I. Kryuchkov, Yu. O. Klymenko,\n  I. T. Zhuk","title":"development of models of acoustic-gravity waves in the upper atmosphere\n  (overview)","comments":"14 pages, 8 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present the results of studies of acoustic-gravity waves (AGWs) in the\nupper atmosphere of the Earth. The work has been mainly aimed at studying the\npeculiarities of atmospheric AGWs in the atmosphere based on the theoretical\nmodels taking into account the properties of the real atmosphere and the model\nverification based on spacecraft measurement data. This overview includes the\nmain results obtained by the authors over the last years. The details of the\ncalculations are contained in the authors' works cited here. The possibility of\nthe existence of new types of evanescent acoustic-gravity waves in the\nisothermal atmosphere is theoretically predicted. A previously unknown\ninelastic mode and a family of evanescent pseudo-modes are discussed. The\npeculiarities of the propagation of the acoustic-gravity waves at the boundary\nof two isothermal half-spaces with different temperatures are studied in\ndependence of their spectral parameters and the magnitude of the temperature\njump at the boundary. The peculiarities of the interaction of acoustic-gravity\nwaves with spatially inhomogeneous atmospheric flows are also studied. It is\nanalyzed the observed effects that are a consequence of such interaction. The\ninfluence of vertical non-isothermality on propagation of acoustic-gravity\nwaves including the modification of acoustic and gravitational regions\ndepending on the temperature is studied. On the basis of modified Navier-Stokes\nand heat transfer equations, the influence of attenuation on the propagation of\nacoustic-gravity waves in the atmosphere is analyzed. It is also considered the\nattenuation of various types of evanescent acoustic-gravity waves in the\natmosphere. It is shown that the rotation of the atmosphere leads to the\nmodification of the continuous spectrum of evanescent acoustic-gravity waves\nwith frequencies greater than the Coriolis parameter.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:49:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cheremnykh","O. K.",""],["Fedorenko","A. K.",""],["Kryuchkov","E. I.",""],["Klymenko","Yu. O.",""],["Zhuk","I. T.",""]]}
{"id":"2308.01620","submitter":"Ayato Mitsuishi","authors":"Syota Esaki, Daisuke Kazukawa, Ayato Mitsuishi","title":"Invariants for Gromov's pyramids and their applications","comments":"62 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pyramids introduced by Gromov are generalized objects of metric spaces with\nBorel probability measures. We study non-trivial pyramids, where non-trivial\nmeans that they are not represented as metric measure spaces. In this paper, we\nestablish general theory of invariants of pyramids and construct several\ninvariants. Using them, we distinguish concrete pyramids. Furthermore, we study\na space consisting of non-trivial pyramids and prove that the space have\ninfinite dimension.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:50:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Esaki","Syota",""],["Kazukawa","Daisuke",""],["Mitsuishi","Ayato",""]]}
{"id":"2308.01621","submitter":"Yao Liu","authors":"Yao Liu, Hang Shao, Bing Bai","title":"A Novel Convolutional Neural Network Architecture with a Continuous\n  Symmetry","comments":"Accepted by the 3rd CAAI International Conference on Artificial\n  Intelligence (CICAI), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.NE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper introduces a new Convolutional Neural Network (ConvNet)\narchitecture inspired by a class of partial differential equations (PDEs)\ncalled quasi-linear hyperbolic systems. With comparable performance on the\nimage classification task, it allows for the modification of the weights via a\ncontinuous group of symmetry. This is a significant shift from traditional\nmodels where the architecture and weights are essentially fixed. We wish to\npromote the (internal) symmetry as a new desirable property for a neural\nnetwork, and to draw attention to the PDE perspective in analyzing and\ninterpreting ConvNets in the broader Deep Learning community.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:50:48 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 08:42:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Yao",""],["Shao","Hang",""],["Bai","Bing",""]]}
{"id":"2308.01622","submitter":"Kaer Huang Carl","authors":"Kaer Huang, Bingchuan Sun, Feng Chen, Tao Zhang, Jun Xie, Jian Li,\n  Christopher Walter Twombly, Zhepeng Wang","title":"ReIDTrack: Multi-Object Track and Segmentation Without Motion","comments":null,"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, dominant Multi-object tracking (MOT) and segmentation (MOTS)\nmethods mainly follow the tracking-by-detection paradigm. Transformer-based\nend-to-end (E2E) solutions bring some ideas to MOT and MOTS, but they cannot\nachieve a new state-of-the-art (SOTA) performance in major MOT and MOTS\nbenchmarks. Detection and association are two main modules of the\ntracking-by-detection paradigm. Association techniques mainly depend on the\ncombination of motion and appearance information. As deep learning has been\nrecently developed, the performance of the detection and appearance model is\nrapidly improved. These trends made us consider whether we can achieve SOTA\nbased on only high-performance detection and appearance model. Our paper mainly\nfocuses on exploring this direction based on CBNetV2 with Swin-B as a detection\nmodel and MoCo-v2 as a self-supervised appearance model. Motion information and\nIoU mapping were removed during the association. Our method wins 1st place on\nthe MOTS track and wins 2nd on the MOT track in the CVPR2023 WAD workshop. We\nhope our simple and effective method can give some insights to the MOT and MOTS\nresearch community. Source code will be released under this git repository\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:53:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Huang","Kaer",""],["Sun","Bingchuan",""],["Chen","Feng",""],["Zhang","Tao",""],["Xie","Jun",""],["Li","Jian",""],["Twombly","Christopher Walter",""],["Wang","Zhepeng",""]]}
{"id":"2308.01623","submitter":"Doratossadat Dastgheib","authors":"Doratossadat Dastgheib, Hadi Farahani","title":"A proof for completeness of \\L ukasiewicz logic","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we give a new proof for the completeness of infinite valued\npropositional \\L ukasiewicz logic introduced by \\L ukasiewicz and Tarski in\n1930. Our approach employs a Hilbert-style proof that relies on the concept of\nmaximal consistent extensions, and unlike classical logic, in this context, the\nmaximal extensions are not required to include all formulas or their negations.\nTo illustrate this point, we provide examples of such formulas.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:53:58 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 05:19:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dastgheib","Doratossadat",""],["Farahani","Hadi",""]]}
{"id":"2308.01624","submitter":"Pierre Le Bris","authors":"Arnaud Guillin, Pierre Le Bris, Pierre Monmarch\\'e","title":"Some remarks on the effect of the Random Batch Method on phase\n  transition","comments":"39 pages, 7 figures. Codes are available on PLB's webpage. Comments\n  are welcome","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":"  In this article, we focus on two toy models : the Curie-Weiss model and the\nsystem of $N$ particles in linear interactions in a double well confining\npotential. Both models, which have been extensively studied, describe a large\nsystem of particles with a mean-field limit that admits a phase transition. We\nare concerned with the numerical simulation of these particle systems. To deal\nwith the quadratic complexity of the numerical scheme, corresponding to the\ncomputation of the $O(N^2)$ interactions per time step, the Random Batch Method\n(RBM) has been suggested. It consists in randomly (and uniformly) dividing the\nparticles into batches of size $p>1$, and computing the interactions only\nwithin each batch, thus reducing the numerical complexity to $O(Np)$ per time\nstep. The convergence of this numerical method has been proved in other works.\n  This work is motivated by the observation that the RBM, via the random\nconstructions of batches, artificially adds noise to the particle system. The\ngoal of this article is to study the effect of this added noise on the phase\ntransition of the nonlinear limit, and more precisely we study the effective\ndynamics of the two models to show how a phase transition may still be observed\nwith the RBM but at a lower critical temperature.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:54:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Guillin","Arnaud",""],["Bris","Pierre Le",""],["Monmarch\u00e9","Pierre",""]]}
{"id":"2308.01625","submitter":"Fatiha Alabau-Boussouira","authors":"Fatiha Alabau-Boussouira","title":"Part II On strong and non uniform stability of locally damped Timoshenko\n  beam: Mathematical corrections to the proof of Theorem 2.2 in the publication\n  referenced as [1] in the bibliography","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In part I of the rebuttal (see [2] to the article [1] entitled \"Uniform\nstabilization for the Timoshenko beam by a locally distributed damping\"\npublished in 2003, in the journal Electronic Journal of Differential Equations,\nwe prove that Lemma 3.6 and Theorem 3.1 are unproved due to major flaws\n(contradictory assumptions). We also show that Theorem 2.2 and its proofs of\nstrong stability, and non uniform stability in the case of different speeds of\npropagation, contain several incorrect arguments and several gaps (including\nmissing functional frames). In this part II, we give the precise missing\nfunctional frames, fill the gaps and correct several parts contained in the\nproof of Theorem 2.2 in [1]. We also complete a missing argument (see Remark\n4.23 and Remark 3.2) in the proof of Theorem A in [5] used by [1]. For this we\nstate and prove Proposition 4.4 (see also Proposition 4.6 for a general\nformulation in Banach spaces). We also give the correct formulations, and\nproofs of strong stability and non uniform stability (in case of different\nspeeds of propagation) for Timoshenko beams.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:54:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Alabau-Boussouira","Fatiha",""]]}
{"id":"2308.01626","submitter":"Adrian Groza","authors":"Alexandru Motogna, Adrian Groza","title":"Interleaving GANs with knowledge graphs to support design creativity for\n  book covers","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":"  An attractive book cover is important for the success of a book. In this\npaper, we apply Generative Adversarial Networks (GANs) to the book covers\ndomain, using different methods for training in order to obtain better\ngenerated images. We interleave GANs with knowledge graphs to alter the input\ntitle to obtain multiple possible options for any given title, which are then\nused as an augmented input to the generator. Finally, we use the discriminator\nobtained during the training phase to select the best images generated with new\ntitles. Our method performed better at generating book covers than previous\nattempts, and the knowledge graph gives better options to the book author or\neditor compared to using GANs alone.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:56:56 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Motogna","Alexandru",""],["Groza","Adrian",""]]}
{"id":"2308.01627","submitter":"Ando Razafindrakoto","authors":"G. Bezhanishvili, F. Dashiell, A. Razafindrakoto, J. Walters-Wayland","title":"Semilattice base hierarchy for frames and its topological ramifications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We develop a hierarchy of semilattice bases (S-bases) for frames. For a given\n(unbounded) meet-semilattice $A$, we analyze the interval in the coframe of\nsublocales of the frame of downsets of $A$ formed by all frames with the S-base\n$A$. We give an explicit description of the nuclei associated with these\nsublocales. We study various degrees of completeness of $A$, which generalize\nthe concepts of extremally disconnected and basically disconnected frames. We\nalso introduce the concepts of D-bases and L-bases, as well as their bounded\ncounterparts, and show how our results specialize and sharpen in these cases.\nClassic examples that are covered by our approach include zero-dimensional,\ncompletely regular, and coherent frames, allowing us to provide a new\nperspective on these well-studied classes of frames, as well as their spatial\ncounterparts.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:57:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bezhanishvili","G.",""],["Dashiell","F.",""],["Razafindrakoto","A.",""],["Walters-Wayland","J.",""]]}
{"id":"2308.01628","submitter":"Luca Merlo","authors":"Luca Merlo and Francesca Dominici and Lea Petrella and Nicola Salvati\n  and Xiao Wu","title":"Estimating causal quantile exposure response functions via matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop new matching estimators for estimating causal quantile\nexposure-response functions and quantile exposure effects with continuous\ntreatments. We provide identification results for the parameters of interest\nand establish the asymptotic properties of the derived estimators. We introduce\na two-step estimation procedure. In the first step, we construct a matched data\nset via generalized propensity score matching, adjusting for measured\nconfounding. In the second step, we fit a kernel quantile regression to the\nmatched set. We also derive a consistent estimator of the variance of the\nmatching estimators. Using simulation studies, we compare the introduced\napproach with existing alternatives in various settings. We apply the proposed\nmethod to Medicare claims data for the period 2012-2014, and we estimate the\ncausal effect of exposure to PM$_{2.5}$ on the length of hospital stay for each\nzip code of the contiguous United States.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:59:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Merlo","Luca",""],["Dominici","Francesca",""],["Petrella","Lea",""],["Salvati","Nicola",""],["Wu","Xiao",""]]}
{"id":"2308.01629","submitter":"Alexander Sommer","authors":"Alexander Sommer, Ulrich Schwanecke, Elmar Sch\\\"omer","title":"Interactive High-Resolution Simulation of Granular Material","comments":null,"journal-ref":"Journal of WSCG, Vol.30 (2022) 1-2","doi":"10.24132/JWSCG.2022.2","report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce a particle-based simulation method for granular material in\ninteractive frame rates. We divide the simulation into two decoupled steps. In\nthe first step, a relatively small number of particles is accurately simulated\nwith a constraint-based method. Here, all collisions and the resulting friction\nbetween the particles are taken into account. In the second step, the small\nnumber of particles is significantly increased by an efficient sampling\nalgorithm without creating additional artifacts. The method is particularly\nrobust and allows relatively large time steps, which makes it well suited for\nreal-time applications. With our method, up to 500k particles can be computed\nin interactive frame rates on consumer CPUs without relying on GPU support for\nmassive parallel computing. This makes it well suited for applications where a\nlot of GPU power is already needed for render tasks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:03:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sommer","Alexander",""],["Schwanecke","Ulrich",""],["Sch\u00f6mer","Elmar",""]]}
{"id":"2308.01630","submitter":"Qishun Wang","authors":"Zhengzheng Tu, Qishun Wang, Hongshun Wang, Kunpeng Wang, Chenglong Li","title":"Erasure-based Interaction Network for RGBT Video Object Detection and A\n  Unified Benchmark","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, many breakthroughs are made in the field of Video Object Detection\n(VOD), but the performance is still limited due to the imaging limitations of\nRGB sensors in adverse illumination conditions. To alleviate this issue, this\nwork introduces a new computer vision task called RGB-thermal (RGBT) VOD by\nintroducing the thermal modality that is insensitive to adverse illumination\nconditions. To promote the research and development of RGBT VOD, we design a\nnovel Erasure-based Interaction Network (EINet) and establish a comprehensive\nbenchmark dataset (VT-VOD50) for this task. Traditional VOD methods often\nleverage temporal information by using many auxiliary frames, and thus have\nlarge computational burden. Considering that thermal images exhibit less noise\nthan RGB ones, we develop a negative activation function that is used to erase\nthe noise of RGB features with the help of thermal image features. Furthermore,\nwith the benefits from thermal images, we rely only on a small temporal window\nto model the spatio-temporal information to greatly improve efficiency while\nmaintaining detection accuracy.\n  VT-VOD50 dataset consists of 50 pairs of challenging RGBT video sequences\nwith complex backgrounds, various objects and different illuminations, which\nare collected in real traffic scenarios. Extensive experiments on VT-VOD50\ndataset demonstrate the effectiveness and efficiency of our proposed method\nagainst existing mainstream VOD methods. The code of EINet and the dataset will\nbe released to the public for free academic usage.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:04:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Tu","Zhengzheng",""],["Wang","Qishun",""],["Wang","Hongshun",""],["Wang","Kunpeng",""],["Li","Chenglong",""]]}
{"id":"2308.01631","submitter":"Sergi G. Leyva","authors":"Sergi G. Leyva, Ignacio Pagonabarraga","title":"Clogging transition and anomalous transport in driven suspensions in a\n  disordered medium","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 computationally the dynamics of forced, Brownian particles through a\ndisordered system. As the concentration of mobile particles and/or fixed\nobstacles increase, we characterize the different regimes of flow and address\nhow clogging develops. We show that clogging is preceded by a wide region of\nanomalous transport, characterized by a power law decay of intermittent bursts.\nWe analyze the velocity distribution of the moving particles and show that this\nabnormal flow region is characterized by a coexistence between mobile and\narrested particles, and their relative populations change smoothly as clogging\nis approached. The comparison of the regimes of anomalous transport and\nclogging with the corresponding scenarios of particles pushed through a single\nbottleneck show qualitatively the same trends highlighting the generality of\nthe transport regimes leading to clogging.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:06:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Leyva","Sergi G.",""],["Pagonabarraga","Ignacio",""]]}
{"id":"2308.01632","submitter":"Benjamin Castle","authors":"Benjamin Castle and Chieu-Minh Tran","title":"Model Theory of Complex Numbers with Polynomial Functions","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathbb C$ be the set of complex numbers, and let $\\mathcal P$ be a\ncollection of complex polynomial maps in several variables. Assuming at least\none $P\\in\\mathcal P$ depends on at least two variables, we classify all\npossibilities for the structure $(\\mathscr M;\\mathcal P)$ up to definable\nequivalence. In particular, outside a short list of exceptions, we show that\n$(\\mathscr M;\\mathcal P)$ always defines $+$ and $\\times$. Our tools include\nZilber's Restricted Trichotomy, as well as the classification of symmetric\nnon-expanding pairs of polynomials over $\\mathbb C$ from arithmetic\ncombinatorics. Along the way, we also give a new condition for a reduct\n$\\mathscr M=(M,...)$ of a smooth curve over an algebraically closed field to\nrecover all constructible subsets of powers of $M$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:06:25 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Castle","Benjamin",""],["Tran","Chieu-Minh",""]]}
{"id":"2308.01633","submitter":"Alexander Sommer","authors":"Alexander Sommer, Ulrich Schwanecke","title":"LEAVEN -- Lightweight Surface and Volume Mesh Sampling Application for\n  Particle-based Simulations","comments":"Computer Science Research Notes [CSRN] (2021). Code available at:\n  https://github.com/a1ex90/Leaven","journal-ref":null,"doi":"10.24132/CSRN.2021.3101.17","report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present an easy-to-use and lightweight surface and volume mesh sampling\nstandalone application tailored for the needs of particle-based simulation. We\ndescribe the surface and volume sampling algorithms used in LEAVEN in a\nbeginner-friendly fashion. Furthermore, we describe a novel method of\ngenerating random volume samples that satisfy blue noise criteria by modifying\na surface sampling algorithm. We aim to lower one entry barrier for starting\nwith particle-based simulations while still pose a benefit to advanced users.\nThe goal is to provide a useful tool to the community and lowering the need for\nheavyweight third-party applications, especially for starters.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:09:10 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sommer","Alexander",""],["Schwanecke","Ulrich",""]]}
{"id":"2308.01634","submitter":"Guanzhou Ke","authors":"Guanzhou Ke, Yang Yu, Guoqing Chao, Xiaoli Wang, Chenyang Xu, and\n  Shengfeng He","title":"Disentangling Multi-view Representations Beyond Inductive Bias","comments":"9 pages, 5 figures, 4 tables","journal-ref":"In Proceedings of the 31st ACM International Conference on\n  Multimedia (MM '23), 2023","doi":"10.1145/3581783.3611794","report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-view (or -modality) representation learning aims to understand the\nrelationships between different view representations. Existing methods\ndisentangle multi-view representations into consistent and view-specific\nrepresentations by introducing strong inductive biases, which can limit their\ngeneralization ability. In this paper, we propose a novel multi-view\nrepresentation disentangling method that aims to go beyond inductive biases,\nensuring both interpretability and generalizability of the resulting\nrepresentations. Our method is based on the observation that discovering\nmulti-view consistency in advance can determine the disentangling information\nboundary, leading to a decoupled learning objective. We also found that the\nconsistency can be easily extracted by maximizing the transformation invariance\nand clustering consistency between views. These observations drive us to\npropose a two-stage framework. In the first stage, we obtain multi-view\nconsistency by training a consistent encoder to produce semantically-consistent\nrepresentations across views as well as their corresponding pseudo-labels. In\nthe second stage, we disentangle specificity from comprehensive representations\nby minimizing the upper bound of mutual information between consistent and\ncomprehensive representations. Finally, we reconstruct the original data by\nconcatenating pseudo-labels and view-specific representations. Our experiments\non four multi-view datasets demonstrate that our proposed method outperforms 12\ncomparison methods in terms of clustering and classification performance. The\nvisualization results also show that the extracted consistency and specificity\nare compact and interpretable. Our code can be found at\n\\url{https://github.com/Guanzhou-Ke/DMRIB}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:09:28 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 13:22:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ke","Guanzhou",""],["Yu","Yang",""],["Chao","Guoqing",""],["Wang","Xiaoli",""],["Xu","Chenyang",""],["He","Shengfeng",""]]}
{"id":"2308.01635","submitter":"Wei Liu","authors":"Wei Liu, Zi-Hao Chen, Yu Su, Yao Wang and Wenjie Dou","title":"Predicting rate kernels via dynamic mode decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Simulating dynamics of open quantum systems is sometimes a significant\nchallenge, despite the availability of various exact or approximate methods.\nParticularly when dealing with complex systems, the huge computational cost\nwill largely limit the applicability of these methods. We investigate the usage\nof dynamic mode decomposition (DMD) to evaluate the rate kernels in quantum\nrate processes. DMD is a data-driven model reduction technique that\ncharacterizes the rate kernels using snapshots collected from a small time\nwindow, allowing us to predict the long-term behaviors with only a limited\nnumber of samples. Our investigations show that whether the external field is\ninvolved or not, the DMD can give accurate prediction of the result compared\nwith the traditional propagations, and simultaneously reduce the required\ncomputational cost.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:10:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Wei",""],["Chen","Zi-Hao",""],["Su","Yu",""],["Wang","Yao",""],["Dou","Wenjie",""]]}
{"id":"2308.01636","submitter":"Yoosik Kim","authors":"Yoosik Kim","title":"On non-displaceable Lagrangian submanifolds in two-step flag varieties","comments":"21 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the two-step flag variety $\\mathcal{F}\\ell(1,n;n+1)$ carries a\nnon-displaceable and non-monotone Lagrangian Gelfand--Zeitlin fiber\ndiffeomorphic to $S^3 \\times T^{2n-4}$ and a continuum family of\nnon-displaceable Lagrangian Gelfand--Zeitlin torus fibers when $n > 2$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:11:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kim","Yoosik",""]]}
{"id":"2308.01637","submitter":"Vladimir I. Korobov","authors":"D.T. Aznabayev, A.K. Bekbaev, V.I. Korobov","title":"Magnetic dipole transitions in the H$_2^+$ ion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The magnetic dipole transitions in the homonuclear molecular ion H$_2^+$ are\nobtained for a wide range of $v$ and $L$, vibrational and total orbital\nmomentum quantum numbers, respectively. Calculations are performed in the\nnonrelativistic approximation. Spin consideration is also included.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:16:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Aznabayev","D. T.",""],["Bekbaev","A. K.",""],["Korobov","V. I.",""]]}
{"id":"2308.01638","submitter":"Aaron Brunk","authors":"Aaron Brunk, Herbert Egger, Oliver Habrich","title":"A second-order structure-preserving discretization for the\n  Cahn-Hilliard/Allen-Cahn system with cross-kinetic coupling","comments":"23 pages, 14 figures, 1 table. arXiv admin note: text overlap with\n  arXiv:2209.03849","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the numerical solution of a Cahn-Hilliard/Allen-Cahn system with\nstrong coupling through state and gradient dependent non-diagonal mobility\nmatrices. A fully discrete approximation scheme in space and time is proposed\nwhich preserves the underlying gradient flow structure and leads to dissipation\nof the free-energy on the discrete level. Existence and uniqueness of the\ndiscrete solution is established and relative energy estimates are used to\nprove optimal convergence rates in space and time under minimal smoothness\nassumptions. Numerical tests are presented for illustration of the theoretical\nresults and to demonstrate the viability of the proposed methods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:16:09 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Brunk","Aaron",""],["Egger","Herbert",""],["Habrich","Oliver",""]]}
{"id":"2308.01639","submitter":"Chaoqin Huang","authors":"Aofan Jiang, Chaoqin Huang, Qing Cao, Shuang Wu, Zi Zeng, Kang Chen,\n  Ya Zhang, and Yanfeng Wang","title":"Multi-scale Cross-restoration Framework for Electrocardiogram Anomaly\n  Detection","comments":"MICCAI 2023 Early Accept","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electrocardiogram (ECG) is a widely used diagnostic tool for detecting heart\nconditions. Rare cardiac diseases may be underdiagnosed using traditional ECG\nanalysis, considering that no training dataset can exhaust all possible cardiac\ndisorders. This paper proposes using anomaly detection to identify any\nunhealthy status, with normal ECGs solely for training. However, detecting\nanomalies in ECG can be challenging due to significant inter-individual\ndifferences and anomalies present in both global rhythm and local morphology.\nTo address this challenge, this paper introduces a novel multi-scale\ncross-restoration framework for ECG anomaly detection and localization that\nconsiders both local and global ECG characteristics. The proposed framework\nemploys a two-branch autoencoder to facilitate multi-scale feature learning\nthrough a masking and restoration process, with one branch focusing on global\nfeatures from the entire ECG and the other on local features from\nheartbeat-level details, mimicking the diagnostic process of cardiologists.\nAnomalies are identified by their high restoration errors. To evaluate the\nperformance on a large number of individuals, this paper introduces a new\nchallenging benchmark with signal point-level ground truths annotated by\nexperienced cardiologists. The proposed method demonstrates state-of-the-art\nperformance on this benchmark and two other well-known ECG datasets. The\nbenchmark dataset and source code are available at:\n\\url{https://github.com/MediaBrain-SJTU/ECGAD}\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:16:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jiang","Aofan",""],["Huang","Chaoqin",""],["Cao","Qing",""],["Wu","Shuang",""],["Zeng","Zi",""],["Chen","Kang",""],["Zhang","Ya",""],["Wang","Yanfeng",""]]}
{"id":"2308.01640","submitter":"Hardi Peter","authors":"J. Gorman, L. P. Chitta, H. Peter, D. Berghmans, F. Auch\\`ere, R.\n  Aznar Cuadrado, L. Teriaca, S.K. Solanki, C. Verbeeck, E. Kraaikamp, K.\n  Stegen, S. Gissot","title":"Beyond small-scale transients: a closer look at the diffuse quiet solar\n  corona","comments":"Accepted for publication in A&A. 10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Within the quiet Sun corona imaged at 1 MK, much of the field of view\nconsists of diffuse emission that appears to lack the spatial structuring that\nis so evident in coronal loops or bright points. We seek to determine if these\ndiffuse regions are categorically different in terms of their intensity\nfluctuations and spatial configuration from the more well-studied dynamic\ncoronal features. We analyze a time series of observations from Solar Orbiter's\nHigh Resolution Imager in the Extreme Ultraviolet to quantify the\ncharacterization of the diffuse corona at high spatial and temporal\nresolutions. We then compare this to the dynamic features within the field of\nview, mainly a coronal bright point. We find that the diffuse corona lacks\nvisible structuring, such as small embedded loops, and that this is persistent\nover the 25 min duration of the observation. The intensity fluctuations of the\ndiffuse corona, which are within +/-5%, are significantly smaller in comparison\nto the coronal bright point. Yet, the total intensity observed in the diffuse\ncorona is of the same order as the bright point. It seems inconsistent with our\ndata that the diffuse corona is a composition of small loops or jets or that it\nis driven by discrete small heating events that follow a power-law-like\ndistribution. We speculate that small-scale processes like MHD turbulence might\nbe energizing the diffuse regions, but at this point we cannot offer a\nconclusive explanation for the nature of this feature.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:17:56 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gorman","J.",""],["Chitta","L. P.",""],["Peter","H.",""],["Berghmans","D.",""],["Auch\u00e8re","F.",""],["Cuadrado","R. Aznar",""],["Teriaca","L.",""],["Solanki","S. K.",""],["Verbeeck","C.",""],["Kraaikamp","E.",""],["Stegen","K.",""],["Gissot","S.",""]]}
{"id":"2308.01641","submitter":"YongKeun Park","authors":"Herve Hugonnet, HyunJun Han, Weisun Park, and YongKeun Park","title":"Improving specificity and axial spatial resolution of refractive index\n  imaging by exploiting uncorrelated subcellular dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Holotomography, a three-dimensional quantitative phase imaging technique,\npresents an innovative, non-invasive approach to studying biological samples by\nexploiting the refractive index as an intrinsic imaging contrast. Despite\noffering label-free quantitative imaging capabilities, its potential in cell\nbiology research has been stifled due to limitations in molecular specificity\nand axial resolution. Here, we propose and experimentally validate a solution\nto overcome these constraints by capitalizing on the intrinsic dynamic\nmovements of subcellular organelles and biological molecules within living\ncells. Our findings elucidate that leveraging such sample motions enhances\naxial resolution. Furthermore, we demonstrate that the extraction of\nuncorrelated dynamic signals from refractive index distributions unveils a\ntrove of previously unexplored dynamic imaging data. This enriched dataset\npaves the way for fresh insights into cellular morphologic dynamics and the\nmetabolic shifts occurring in response to external stimuli. This promising\ndevelopment could broaden the utility of holotomography in cell biology.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:18:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hugonnet","Herve",""],["Han","HyunJun",""],["Park","Weisun",""],["Park","YongKeun",""]]}
{"id":"2308.01642","submitter":"Carlo Orrieri","authors":"Federico Bertacco, Carlo Orrieri, Luca Scarpa","title":"Weak uniqueness by noise for singular stochastic PDEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove weak uniqueness for a general class of SPDEs on a Hilbert space. The\nmain novelty is that the drift is only defined on a Sobolev-type subspace and\nno H\\\"older-continuity assumptions are required. This allows us to cover\nexamples such as equations with divergence-form drift and Cahn-Hilliard-type\nequations with possibly singular perturbations. The main idea is to consider a\nsuitable coloured Wiener noise so that both the solvability of the SPDE and the\nregularising effect of the Kolmogorov operator are preserved via stochastic\nmaximal regularity results. As a by-product, this also allows us to generalise\nthe available results of uniqueness by noise for perturbations of the heat\nequation to higher dimensions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:19:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bertacco","Federico",""],["Orrieri","Carlo",""],["Scarpa","Luca",""]]}
{"id":"2308.01643","submitter":"Nikolaos Misirlis","authors":"Nikolaos Misirlis","title":"I am a global citizen. Or am I not? International Business Schools\n  students and Global Citizenship unified framework & a scoping literature\n  review of the last decade (2013-2022)","comments":"5 pages, 2 figures, conference article","journal-ref":null,"doi":"10.26352/H629_2384-9509","report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This review examines the scientific articles of the last decade, approaching\nthe subject through the methodology of the scoping literature review. Starting\nwith the Boolean search global citizens AND education AND (international\nbusiness OR international business school) in the ScienceDirect, Emerald, and\nScopus databases, the review resulted in only scientific journal articles,\nstrictly targeted at tertiary education ONLY of international business schools\nand ONLY in those articles that study global citizenship. For reasons of\nup-to-date knowledge, the present literature was content with the final decade.\nA total of 13 articles are recorded as a result of the aforementioned Boolean\nsearch from a total of 216 articles identified in the first phase of the\nsearch. The results will help the researchers to acquire the required knowledge\nbase for their research, the academics to incorporate new methods in their\nteaching and the approach of their students, and the policymakers to adapt the\nschools curricula according to the data from the articles present in the\nliterature review.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:20:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Misirlis","Nikolaos",""]]}
{"id":"2308.01644","submitter":"Andrzej Sitarz","authors":"Ludwik D\\k{a}browski, Andrzej Sitarz and Pawe{\\l} Zalecki","title":"Spectral Torsion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA gr-qc math-ph math.DG math.MP math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a trilinear functional of differential one-forms for a finitely\nsummable regular spectral triple with a noncommutative residue. We demonstrate\nthat for a canonical spectral triple over a spin manifold it recovers the\ntorsion of the linear connection. We examine several spectral triples,\nincluding Hodge-de\\,Rham, Einstein-Yang-Mills, almost-commutative two-sheeted\nspace, conformally rescaled noncommutative tori, and quantum $SU(2)$ group,\nshowing that the third one has a nonvanishing torsion if nontrivially coupled.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:21:03 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 15:09:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["D\u0105browski","Ludwik",""],["Sitarz","Andrzej",""],["Zalecki","Pawe\u0142",""]]}
{"id":"2308.01645","submitter":"Nicolas Boltz","authors":"Felix Schwickerath, Nicolas Boltz, Sebastian Hahner, Maximilian\n  Walter, Christopher Gerking, Robert Heinrich","title":"Tool-Supported Architecture-Based Data Flow Analysis for Confidentiality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Through the increasing interconnection between various systems, the need for\nconfidential systems is increasing. Confidential systems share data only with\nauthorized entities. However, estimating the confidentiality of a system is\ncomplex, and adjusting an already deployed software is costly. Thus, it is\nhelpful to have confidentiality analyses, which can estimate the\nconfidentiality already at design time. Based on an existing data-flow-based\nconfidentiality analysis concept, we reimplemented a data flow analysis as a\nJava-based tool. The tool uses the software architecture to identify access\nviolations based on the data flow. The evaluation for our tool indicates that\nwe can analyze similar scenarios and scale for certain scenarios better than\nthe existing analysis.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:21:20 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Schwickerath","Felix",""],["Boltz","Nicolas",""],["Hahner","Sebastian",""],["Walter","Maximilian",""],["Gerking","Christopher",""],["Heinrich","Robert",""]]}
{"id":"2308.01646","submitter":"Andalib Shams","authors":"Andalib Shams and Christopher M. Day","title":"Impact of Sensing Range on Real-Time Adaptive Control of Signalized\n  Intersections Using Vehicle Trajectory Information","comments":"17 pages, 5 figures, Presented at Transportation Research Board 100th\n  Annual Meeting","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advanced signal control algorithms are anticipated with the increasing\navailability of vehicle speed and position data from vehicle-to-infrastructure\ncommunication and from sensors. This study examines the impact of the sensing\nrange, meaning the distance from the intersection that such data can be\nobtained, on the quality of the signal control. Two advanced signal control\nmethods, a Self-Organizing Algorithm (SOA) and Phase Allocation Algorithm\n(PAA), were implemented in simulation and tested to understand the impact of\nsensing ranges. SOA is based on fully-actuated control with an added secondary\nextension for vehicle platoons along the arterial. PAA uses dynamic programming\nto optimize phase sequences and phase duration within a planning horizon. Three\ndifferent traffic scenarios were developed: symmetric, asymmetric, and\nbalanced. In general, both algorithms exhibited improvements in performance as\nthe sensing range was increased. Under the symmetric volume scenario, SOA\nconverged at 1000 ft and PAA converged at 1500 ft (with vehicles traveling at\n45mph). Under the asymmetrical and balanced volume scenarios, both algorithms\noutperformed conventional methods. Both algorithms performed better than\ncoordinated-actuated control if the sensing range is 660 ft or higher. For low\nsensing ranges, SOA experiences similar delay compared to fully-actuated\ncontrol with advance detector and PAA experienced more delay than\ncoordinated-actuated control in symmetric and asymmetric scenario but performed\nbetter for asymmetric scenario. The results suggest that for the SOA algorithm,\nthe sensing range may constrain the maximum allowable secondary extension,\nhence as the sensing range increases, the vehicular delay would decrease for\narterial movements and increase for non-arterial movements. For PAA, arterial\nand non-arterial delay decreases with increase in sensing range until it\nconverges.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:28:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Shams","Andalib",""],["Day","Christopher M.",""]]}
{"id":"2308.01647","submitter":"Luis Espath","authors":"Anne Boschman, Luis Espath, Kris van der Zee","title":"A bulk-surface continuum theory for fluid flows and phase segregation\n  with finite surface thickness","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 this continuum theory, we propose a mathematical framework to study the\nmechanical interplay of bulk-surfaces materials undergoing deformation and\nphase segregation. To this end, we devise a principle of virtual powers with a\nbulk-surface dynamics, which is postulated on an arbitrary part $\\mathcal{P}$\nwhere the boundary $\\partial\\mathcal{P}$ may lose smoothness, that is, the\nnormal field may be discontinuous at an edge $\\partial^2\\mathcal{P}$. The final\nset of equations somewhat resemble the Navier--Stokes--Cahn--Hilliard equation\nfor the bulk and the surface. Aside from the systematical treatment based on a\nspecialized version of the virtual power principle and free-energy imbalances\nfor bulk-surface theories, we consider two additional ingredients: an explicit\ndependency of the apparent surface density on the surface thickness and mixed\nboundary conditions for the velocity, chemical potential, and microstructure.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:29:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Boschman","Anne",""],["Espath","Luis",""],["van der Zee","Kris",""]]}
{"id":"2308.01648","submitter":"Yu Ishihara","authors":"Yu Ishihara, Yuichi Hazama, Kousuke Suzuki, Jerry Jun Yokono, Kohtaro\n  Sabe, Kenta Kawamoto","title":"Improving Wind Resistance Performance of Cascaded PID Controlled\n  Quadcopters using Residual Reinforcement Learning","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":"  Wind resistance control is an essential feature for quadcopters to maintain\ntheir position to avoid deviation from target position and prevent collisions\nwith obstacles. Conventionally, cascaded PID controller is used for the control\nof quadcopters for its simplicity and ease of tuning its parameters. However,\nit is weak against wind disturbances and the quadcopter can easily deviate from\ntarget position. In this work, we propose a residual reinforcement learning\nbased approach to build a wind resistance controller of a quadcopter. By\nlearning only the residual that compensates the disturbance, we can continue\nusing the cascaded PID controller as the base controller of the quadcopter but\nimprove its performance against wind disturbances. To avoid unexpected crashes\nand destructions of quadcopters, our method does not require real hardware for\ndata collection and training. The controller is trained only on a simulator and\ndirectly applied to the target hardware without extra finetuning process. We\ndemonstrate the effectiveness of our approach through various experiments\nincluding an experiment in an outdoor scene with wind speed greater than 13\nm/s. Despite its simplicity, our controller reduces the position deviation by\napproximately 50% compared to the quadcopter controlled with the conventional\ncascaded PID controller. Furthermore, trained controller is robust and\npreserves its performance even though the quadcopter's mass and propeller's\nlift coefficient is changed between 50% to 150% from original training time.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:29:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ishihara","Yu",""],["Hazama","Yuichi",""],["Suzuki","Kousuke",""],["Yokono","Jerry Jun",""],["Sabe","Kohtaro",""],["Kawamoto","Kenta",""]]}
{"id":"2308.01649","submitter":"Remi Leluc","authors":"R\\'emi Leluc, Elie Kadoche, Antoine Bertoncello, S\\'ebastien\n  Gourv\\'enec","title":"MARLIM: Multi-Agent Reinforcement Learning for Inventory Management","comments":"Accepted at NeurIPS 2022 Workshop: Reinforcement Learning for Real\n  Life (https://nips.cc/virtual/2022/workshop/50014)","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":"  Maintaining a balance between the supply and demand of products by optimizing\nreplenishment decisions is one of the most important challenges in the supply\nchain industry. This paper presents a novel reinforcement learning framework\ncalled MARLIM, to address the inventory management problem for a single-echelon\nmulti-products supply chain with stochastic demands and lead-times. Within this\ncontext, controllers are developed through single or multiple agents in a\ncooperative setting. Numerical experiments on real data demonstrate the\nbenefits of reinforcement learning methods over traditional baselines.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:31:45 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Leluc","R\u00e9mi",""],["Kadoche","Elie",""],["Bertoncello","Antoine",""],["Gourv\u00e9nec","S\u00e9bastien",""]]}
{"id":"2308.01650","submitter":"Siyang Leng","authors":"Minhao Zou, Zhongxue Gan, Yutong Wang, Junheng Zhang, Dongyan Sui,\n  Chun Guan, Siyang Leng","title":"UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph and hypergraph representation learning has attracted increasing\nattention from various research fields. Despite the decent performance and\nfruitful applications of Graph Neural Networks (GNNs), Hypergraph Neural\nNetworks (HGNNs), and their well-designed variants, on some commonly used\nbenchmark graphs and hypergraphs, they are outperformed by even a simple\nMulti-Layer Perceptron. This observation motivates a reexamination of the\ndesign paradigm of the current GNNs and HGNNs and poses challenges of\nextracting graph features effectively. In this work, a universal feature\nencoder for both graph and hypergraph representation learning is designed,\ncalled UniG-Encoder. The architecture starts with a forward transformation of\nthe topological relationships of connected nodes into edge or hyperedge\nfeatures via a normalized projection matrix. The resulting edge/hyperedge\nfeatures, together with the original node features, are fed into a neural\nnetwork. The encoded node embeddings are then derived from the reversed\ntransformation, described by the transpose of the projection matrix, of the\nnetwork's output, which can be further used for tasks such as node\nclassification. The proposed architecture, in contrast to the traditional\nspectral-based and/or message passing approaches, simultaneously and\ncomprehensively exploits the node features and graph/hypergraph topologies in\nan efficient and unified manner, covering both heterophilic and homophilic\ngraphs. The designed projection matrix, encoding the graph features, is\nintuitive and interpretable. Extensive experiments are conducted and\ndemonstrate the superior performance of the proposed framework on twelve\nrepresentative hypergraph datasets and six real-world graph datasets, compared\nto the state-of-the-art methods. Our implementation is available online at\nhttps://github.com/MinhZou/UniG-Encoder.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:32:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zou","Minhao",""],["Gan","Zhongxue",""],["Wang","Yutong",""],["Zhang","Junheng",""],["Sui","Dongyan",""],["Guan","Chun",""],["Leng","Siyang",""]]}
{"id":"2308.01651","submitter":"Roberto Piersanti","authors":"Pasquale C. Africa, Roberto Piersanti, Francesco Regazzoni, Michele\n  Bucelli, Matteo Salvador, Marco Fedele, Stefano Pagani, Luca Dede', and Alfio\n  Quarteroni","title":"lifex-ep: a robust and efficient software for cardiac electrophysiology\n  simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simulating the cardiac function requires the numerical solution of\nmulti-physics and multi-scale mathematical models. This underscores the need\nfor streamlined, accurate, and high-performance computational tools. Despite\nthe dedicated endeavors of various research teams, comprehensive and\nuser-friendly software programs for cardiac simulations are still in the\nprocess of achieving full maturity within the scientific community. This work\nintroduces lifex-ep, a publicly available software for numerical simulations of\nthe electrophysiology activity of the cardiac muscle, under both physiological\nand pathological conditions. lifex-ep employs the monodomain equation to model\nthe heart's electrical activity. It incorporates both phenomenological and\nsecond-generation ionic models. These models are discretized using the Finite\nElement method on tetrahedral or hexahedral meshes. Additionally, lifex-ep\nintegrates the generation of myocardial fibers based on Laplace-Dirichlet\nRule-Based Methods, previously released in Africa et al., 2023, within\nlifex-fiber. This paper provides a concise overview of the mathematical models\nand numerical methods underlying lifex-ep, along with comprehensive\nimplementation details and instructions for users. lifex-ep features\nexceptional parallel speedup, scaling efficiently when using up to thousands of\ncores, and its implementation has been verified against an established\nbenchmark problem for computational electrophysiology. We showcase the key\nfeatures of lifex-ep through various idealized and realistic simulations.\nlifex-ep offers a user-friendly and flexible interface. lifex-ep provides easy\naccess to cardiac electrophysiology simulations for a wide user community. It\noffers a computational tool that integrates models and accurate methods for\nsimulating cardiac electrophysiology within a high-performance framework, while\nmaintaining a user-friendly interface.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:34:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Africa","Pasquale C.",""],["Piersanti","Roberto",""],["Regazzoni","Francesco",""],["Bucelli","Michele",""],["Salvador","Matteo",""],["Fedele","Marco",""],["Pagani","Stefano",""],["Dede'","Luca",""],["Quarteroni","Alfio",""]]}
{"id":"2308.01652","submitter":"Adeel A. Khan","authors":"Adeel A. Khan, Charanya Ravi","title":"Cohomological and categorical concentration","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a torus action on a compact space X, a fundamental result of Borel and\nAtiyah-Segal asserts that the equivariant cohomology of X is concentrated in\nthe fixed locus X^T, up to inverting enough Chern classes. We prove an analogue\nfor algebraic varieties over an arbitrary field. In fact, we deduce this from a\ncategorification at the level of equivariant derived categories and even\nequivariant stable motivic homotopy categories, which also gives concentration\nat the level of Voevodsky motives and for homotopy K-theory.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:34:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Khan","Adeel A.",""],["Ravi","Charanya",""]]}
{"id":"2308.01653","submitter":"Yi-Zhuang You","authors":"Ahmed A. Akhtar, Hong-Ye Hu, Yi-Zhuang You","title":"Measurement-Induced Criticality is Tomographically Optimal","comments":"6 pages, 4 figures + 13 pages appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a classical shadow tomography protocol utilizing the randomized\nmeasurement scheme based on hybrid quantum circuits, which consist of layers of\ntwo-qubit random unitary gates mixed with single-qubit random projective\nmeasurements. Unlike conventional protocols that perform all measurements by\nthe end of unitary evolutions, our protocol allows measurements to occur at any\nspacetime position throughout the quantum evolution. We provide a universal\nclassical post-processing strategy to approximately reconstruct the original\nquantum state from intermittent measurement outcomes given the corresponding\nrandom circuit realizations over repeated experiments. We investigated the\nsample complexity for estimating different observables at different measurement\nrates of the hybrid quantum circuits. Our result shows that the sample\ncomplexity has an optimal scaling at the critical measurement rate when the\nhybrid circuit undergoes the measurement-induced transition.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:35:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Akhtar","Ahmed A.",""],["Hu","Hong-Ye",""],["You","Yi-Zhuang",""]]}
{"id":"2308.01654","submitter":"Gamal Elghazaly Dr.","authors":"Mehdi Testouri, Gamal Elghazaly, Raphael Frank","title":"Towards a Safe Real-Time Motion Planning Framework for Autonomous\n  Driving Systems: An MPPI Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Planning safe trajectories in Autonomous Driving Systems (ADS) is a complex\nproblem to solve in real-time. The main challenge to solve this problem arises\nfrom the various conditions and constraints imposed by road geometry, semantics\nand traffic rules, as well as the presence of dynamic agents. Recently, Model\nPredictive Path Integral (MPPI) has shown to be an effective framework for\noptimal motion planning and control in robot navigation in unstructured and\nhighly uncertain environments. In this paper, we formulate the motion planning\nproblem in ADS as a nonlinear stochastic dynamic optimization problem that can\nbe solved using an MPPI strategy. The main technical contribution of this work\nis a method to handle obstacles within the MPPI formulation safely. In this\nmethod, obstacles are approximated by circles that can be easily integrated\ninto the MPPI cost formulation while considering safety margins. The proposed\nMPPI framework has been efficiently implemented in our autonomous vehicle and\nexperimentally validated using three different primitive scenarios.\nExperimental results show that generated trajectories are safe, feasible and\nperfectly achieve the planning objective. The video results as well as the\nopen-source implementation are available at:\nhttps://gitlab.uni.lu/360lab-public/mppi\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:37:34 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Testouri","Mehdi",""],["Elghazaly","Gamal",""],["Frank","Raphael",""]]}
{"id":"2308.01655","submitter":"Jianxin Lin","authors":"Jianxin Lin, Peng Xiao, Yijun Wang, Rongju Zhang, Xiangxiang Zeng","title":"DiffColor: Toward High Fidelity Text-Guided Image Colorization with\n  Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent data-driven image colorization methods have enabled automatic or\nreference-based colorization, while still suffering from unsatisfactory and\ninaccurate object-level color control. To address these issues, we propose a\nnew method called DiffColor that leverages the power of pre-trained diffusion\nmodels to recover vivid colors conditioned on a prompt text, without any\nadditional inputs. DiffColor mainly contains two stages: colorization with\ngenerative color prior and in-context controllable colorization. Specifically,\nwe first fine-tune a pre-trained text-to-image model to generate colorized\nimages using a CLIP-based contrastive loss. Then we try to obtain an optimized\ntext embedding aligning the colorized image and the text prompt, and a\nfine-tuned diffusion model enabling high-quality image reconstruction. Our\nmethod can produce vivid and diverse colors with a few iterations, and keep the\nstructure and background intact while having colors well-aligned with the\ntarget language guidance. Moreover, our method allows for in-context\ncolorization, i.e., producing different colorization results by modifying\nprompt texts without any fine-tuning, and can achieve object-level controllable\ncolorization results. Extensive experiments and user studies demonstrate that\nDiffColor outperforms previous works in terms of visual quality, color\nfidelity, and diversity of colorization options.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:38:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Jianxin",""],["Xiao","Peng",""],["Wang","Yijun",""],["Zhang","Rongju",""],["Zeng","Xiangxiang",""]]}
{"id":"2308.01656","submitter":"Benjamin Anderson-Sackaney","authors":"Benjamin Anderson-Sackaney and Leonid Vainerman","title":"Fusion modules and amenability of coideals of compact and discrete\n  quantum groups","comments":"38 pages + references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a definition of an amenable fusion module over a fusion algebra. A\nnotion of quasi-integrability for the `coduals' of coideals of compact quantum\ngroups was recently introduced in the joint work of de Commer and Dzokou Talla.\nWe use this property to construct an analogue of the quasi-regular\nrepresentation. Then, we characterize a certain coamenability property of\nquasi-regular representations with amenability of their associated fusion\nmodules. Afterwards, we obtain a duality result that generalizes Tomatsu's\ntheorem for this coamenability property and an amenability property of their\n`codual' coideals (under an additional assumption). As an example, we apply\nthis result to show the fusion modules associated to certain non-standard\nPodle\\'s spheres are amenable.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:40:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Anderson-Sackaney","Benjamin",""],["Vainerman","Leonid",""]]}
{"id":"2308.01657","submitter":"Amruta Mishra","authors":"Pallabi Parui and Amruta Mishra","title":"Spectral properties of $\\omega$, $\\rho$ and $A_1$ mesons in hot\n  magnetized matter: effects of (inverse) magnetic catalysis","comments":"32 pages, 14 figures. arXiv admin note: substantial text overlap with\n  arXiv:2209.02455","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In-medium masses of the light vector $\\omega$, $\\rho$ and axial-vector $A_1$\nmesons are studied in the magnetized nuclear matter, accounting for the effects\nof (inverse) magnetic catalysis at finite temperature. The in-medium partial\ndecay widths for the $A_1\\rightarrow \\rho \\pi$ channels are studied from the\nin-medium masses of the initial and the final state particles, by applying a\nphenomenological Lagrangian to account for the $A_1\\rho\\pi$ interaction\nvertices. The masses are calculated within the QCD sum rule framework, with the\nmedium effects coming through the light quark ($\\sim \\langle \\bar{q}q \\rangle$)\nand the scalar gluon condensates ($\\sim \\langle G^2 \\rangle$), as well as the\nlight four-quark condensate ($\\sim \\langle \\bar{q}q\\rangle^2 $). The\ncondensates are calculated within the chiral $SU(3)$ model in terms of the\nmedium modified scalar fields: isoscalar $\\sigma$, $\\zeta$, isovector $\\delta$\nand the dilaton field $\\chi$. The effects of magnetic fields are incorporated\nthrough the magnetized Dirac sea contribution as well as the Landau energy\nlevels of protons and anomalous magnetic moments (AMMs) of the nucleons at\nfinite temperature nuclear matter. The incorporation of the magnetic field\nthrough the Dirac sea of nucleons lead to an enhancement (reduction) of the\nlight quark condensates with magnetic field, give rise to the phenomenon of\nmagnetic (inverse) catalysis. The effects of (inverse) magnetic catalysis at\nfinite temperature nuclear matter are studied on the spectral functions and\nproduction cross-sections of the neutral $\\rho$ and $A_1$ mesons. This may\naffect the production of the light vector and axial-vector mesons in the\nperipheral heavy-ion collision experiments, where estimated magnetic field is\nvery large at the early stages of collisions with very high temperature.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:44:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Parui","Pallabi",""],["Mishra","Amruta",""]]}
{"id":"2308.01658","submitter":"Chandradoy Chatterjee","authors":"F.Bradamante, A. Bressan, A. Cicuttin, M. L. Crespo, C. Chatterjee, P.\n  Ciliberti, S. Dalla Torre, W. Florian, L. Garcia Ordonez, M. Gregori, A.\n  Kerbizi, S. Levorato, A. Martin, G. Menon, R. S. Molina, A. Moretti, F.\n  Tessarotto, Triloki, B. Valinoti","title":"Long term experience with perfluorobutane in COMPASS RICH","comments":"4 pages, 3 figures 2 tables","journal-ref":null,"doi":"10.1016/j.nima.2023.168579","report-no":null,"categories":"physics.ins-det hep-ex nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  COMPASS RICH-1 has used high-purity perfluorobutane as radiator gas since\n2001. The operation and control of the radiator gas has evolved over years with\ncontinuous improvements. We report on the experience gained in the 20 year-long\noperation of perfluorobutane as COMPASS RICH radiator. Very accurate values for\nthe radiator gas refractive index are needed for high-performance particle\nidentification. The procedure has evolved over years and the one presently in\nuse, which provides refractive index estimate at the 1 ppm level, is discussed.\nPerfluorobutane procurement is becoming challenging, and the minimization of\nmaterial waste is now a priority for the protection of the environment.\nCommercially available perfluorobutane needs dedicated filtering before usage\nand typical material losses in the filtering procedure were around 30%. Recent\nefforts allowed us to reduce them to about 5%. A potential alternative to\nfluorocarbon radiators in gaseous RICHes is also presented.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:49:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bradamante","F.",""],["Bressan","A.",""],["Cicuttin","A.",""],["Crespo","M. L.",""],["Chatterjee","C.",""],["Ciliberti","P.",""],["Torre","S. Dalla",""],["Florian","W.",""],["Ordonez","L. Garcia",""],["Gregori","M.",""],["Kerbizi","A.",""],["Levorato","S.",""],["Martin","A.",""],["Menon","G.",""],["Molina","R. S.",""],["Moretti","A.",""],["Tessarotto","F.",""],["Triloki","",""],["Valinoti","B.",""]]}
{"id":"2308.01659","submitter":"Gianluca Degli Esposti","authors":"Gianluca Degli Esposti, Greger Torgrimsson","title":"Momentum spectrum of Schwinger pair production in four-dimensional\n  e-dipole fields","comments":"22 pages, 12 figures. Version 2: added high-frequency approximation\n  of widths","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We calculate the momentum spectrum of electron-positron pairs created via the\nSchwinger mechanism by a class of four-dimensional electromagnetic fields\ncalled e-dipole fields. To the best of our knowledge, this is the first time\nthe momentum spectrum has been calculated for 4D, exact solutions to Maxwell's\nequations. Moreover, these solutions give fields that are optimally focused,\nand are hence particularly relevant for future experiments. To achieve this we\nhave developed a worldline instanton formalism where we separate the process\ninto a formation and an acceleration region.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:49:37 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 13:45:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Esposti","Gianluca Degli",""],["Torgrimsson","Greger",""]]}
{"id":"2308.01660","submitter":"Vitaly Khonik Alexandrovich","authors":"A.S. Makarov, G.V. Afonin, R.A. Konchakov, V.A. Khonik, J.C. Qiao,\n  A.N. Vasiliev, N.P. Kobelev","title":"Dimensionless parameter of structural ordering and excess entropy of\n  metallic and tellurite glasses","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using a notion on the excess entropy of glass with respect to the counterpart\ncrystal, we introduce a simple dimensionless order parameter $\\xi$, which\nchanges from $\\xi \\rightarrow 0$ to $\\xi \\rightarrow 1$. The former case\ncorresponds to a strongly disordered liquid-like structure while the latter\nsituation describes a highly ordered crystal-like glass. This approach is\napplied to 13 metallic and 2 tellurite glasses. We found that $\\xi$ is strongly\nsensitive to structural state and/or chemical composition. It can be also used\nfor a comparison of the order in glasses belonging to different classes and\nappear to represent a new way of structural analysis.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:53:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Makarov","A. S.",""],["Afonin","G. V.",""],["Konchakov","R. A.",""],["Khonik","V. A.",""],["Qiao","J. C.",""],["Vasiliev","A. N.",""],["Kobelev","N. P.",""]]}
{"id":"2308.01661","submitter":"Enhui Ma","authors":"Kairui Yang, Enhui Ma, Jibin Peng, Qing Guo, Di Lin, Kaicheng Yu","title":"BEVControl: Accurately Controlling Street-view Elements with\n  Multi-perspective Consistency via BEV Sketch Layout","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using synthesized images to boost the performance of perception models is a\nlong-standing research challenge in computer vision. It becomes more eminent in\nvisual-centric autonomous driving systems with multi-view cameras as some\nlong-tail scenarios can never be collected. Guided by the BEV segmentation\nlayouts, the existing generative networks seem to synthesize photo-realistic\nstreet-view images when evaluated solely on scene-level metrics. However, once\nzoom-in, they usually fail to produce accurate foreground and background\ndetails such as heading. To this end, we propose a two-stage generative method,\ndubbed BEVControl, that can generate accurate foreground and background\ncontents. In contrast to segmentation-like input, it also supports sketch style\ninput, which is more flexible for humans to edit. In addition, we propose a\ncomprehensive multi-level evaluation protocol to fairly compare the quality of\nthe generated scene, foreground object, and background geometry. Our extensive\nexperiments show that our BEVControl surpasses the state-of-the-art method,\nBEVGen, by a significant margin, from 5.89 to 26.80 on foreground segmentation\nmIoU. In addition, we show that using images generated by BEVControl to train\nthe downstream perception model, it achieves on average 1.29 improvement in NDS\nscore.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:56:31 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 03:00:58 GMT"},{"version":"v3","created":"Mon, 7 Aug 2023 08:00:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Kairui",""],["Ma","Enhui",""],["Peng","Jibin",""],["Guo","Qing",""],["Lin","Di",""],["Yu","Kaicheng",""]]}
{"id":"2308.01662","submitter":"Yuta Yamamoto","authors":"Yuta Yamamoto","title":"Bicategorical Models of Classical Propositional Logic","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  F\\\"uhrmann and Pym constructed models of classical propositional logic in an\norder-enriched categorical setting, whose typical example is the category\n$\\mathbf{Rel}$ of sets and relations. It is remarkable in that they are both\nnon-degenerate and symmetric, i.e., free from the choices of the reduction\nstrategy.\n  As a furter categorification of this direction, we give bicategorical models\nof classical propositional logic that is also symmetric and non-degenerate.\nPrimal examples of our models include $\\mathbf{Rel}$, $\\mathbf{Span}$, and\n$\\mathbf{Prof}$, which shows that we can construct models that are\nnon-degenerate not only for $1$-cells but also for $2$-cells and the logical\nnegations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:00:26 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yamamoto","Yuta",""]]}
{"id":"2308.01663","submitter":"Davide Grassano","authors":"Davide Grassano, Nicola Marzari, Davide Campi","title":"High-throughput screening of Weyl semimetals","comments":"Fixed author order","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":"  Topological Weyl semimetals represent a novel class of non-trivial materials,\nwhere band crossings with linear dispersions take place at generic momenta\nacross reciprocal space. These crossings give rise to low-energy properties\nakin to those of Weyl fermions, and are responsible for several exotic\nphenomena. Up to this day, only a handful of Weyl semimetals have been\ndiscovered, and the search for new ones remains a very active area. The main\nchallenge on the computational side arises from the fact that many of the tools\nused to identify the topological class of a material do not provide a complete\npicture in the case of Weyl semimetals. In this work, we propose an alternative\nand inexpensive, criterion to screen for possible Weyl fermions, based on the\nanalysis of the band structure along high-symmetry directions in the absence of\nspin-orbit coupling. We test the method by running a high-throughput screening\non a set of 5455 inorganic bulk materials and identify 49 possible candidates\nfor topological properties. A further analysis, carried out by identifying and\ncharacterizing the crossings in the Brillouin zone, shows us that 3 of these\ncandidates are Weyl semimetals. Interestingly, while these 3 materials\nunderwent other high-throughput screenings, none had revealed their topological\nbehavior before.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:07:10 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 09:15:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Grassano","Davide",""],["Marzari","Nicola",""],["Campi","Davide",""]]}
{"id":"2308.01664","submitter":"Thomas Crawford","authors":"Benjamin G. Peyton, Zhe Wang, and T. Daniel Crawford","title":"Reduced Scaling Real-Time Coupled Cluster Theory","comments":"43 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-time coupled cluster (CC) methods have several advantages over their\nfrequency-domain counterparts, namely, response and equation of motion CC\ntheories. Broadband spectra, strong fields, and pulse manipulation allow for\nthe simulation of complex spectroscopies which are unreachable using\nfrequency-domain approaches. Due to the high-order polynomial scaling, the\nrequired numerical time-propagation of the CC residual expressions is a\ncomputationally demanding process. This scaling may be reduced by local\ncorrelation schemes, which aim to reduce the size of the (virtual) orbital\nspace by truncating it according to user-defined parameters. We present the\nfirst application of local correlation to real-time CC. As in previous studies\nof locally correlated frequency-domain CC, traditional local correlation\nschemes are of limited utility for field-dependent properties; however, a\nperturbation-aware scheme proves promising. A detailed analysis of the\namplitude dynamics suggests the main challenge is a strong time-dependence of\nthe wave function sparsity.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:08:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Peyton","Benjamin G.",""],["Wang","Zhe",""],["Crawford","T. Daniel",""]]}
{"id":"2308.01665","submitter":"Keidai Arai","authors":"Keidai Arai, Koki Yamada, Kohei Yatabe","title":"Versatile Time-Frequency Representations Realized by Convex Penalty on\n  Magnitude Spectrogram","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sparse time-frequency (T-F) representations have been an important research\ntopic for more than several decades. Among them, optimization-based methods (in\nparticular, extensions of basis pursuit) allow us to design the representations\nthrough objective functions. Since acoustic signal processing utilizes models\nof spectrogram, the flexibility of optimization-based T-F representations is\nhelpful for adjusting the representation for each application. However,\nacoustic applications often require models of \\textit{magnitude} of T-F\nrepresentations obtained by discrete Gabor transform (DGT). Adjusting a T-F\nrepresentation to such a magnitude model (e.g., smoothness of magnitude of DGT\ncoefficients) results in a non-convex optimization problem that is difficult to\nsolve. In this paper, instead of tackling difficult non-convex problems, we\npropose a convex optimization-based framework that realizes a T-F\nrepresentation whose magnitude has characteristics specified by the user. We\nanalyzed the properties of the proposed method and provide numerical examples\nof sparse T-F representations having, e.g., low-rank or smooth magnitude, which\nhave not been realized before.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:08:51 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Arai","Keidai",""],["Yamada","Koki",""],["Yatabe","Kohei",""]]}
{"id":"2308.01666","submitter":"Ivo Fins Dr","authors":"Ivo S. Fins (1), Heather Davies (1), Sean Farrell (2), Jose R.Torres\n  (3), Gina Pinchbeck (1), Alan D. Radford (1), Peter-John Noble (1) ((1) Small\n  Animal Veterinary Surveillance Network, Institute of Infection, Veterinary\n  and Ecological Sciences, University of Liverpool, Liverpool, UK, (2)\n  Department of Computer Science, Durham University, Durham, UK, (3) Institute\n  for Animal Health and Food Safety, University of Las Palmas de Gran Canaria,\n  Las Palmas, Canary Archipelago, Spain)","title":"Evaluating ChatGPT text-mining of clinical records for obesity\n  monitoring","comments":"Supplementary Material: The data that support the findings of this\n  study are available in the ancillary files of this submission. 5 pages, 2\n  figures (textboxes)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Background: Veterinary clinical narratives remain a largely untapped resource\nfor addressing complex diseases. Here we compare the ability of a large\nlanguage model (ChatGPT) and a previously developed regular expression (RegexT)\nto identify overweight body condition scores (BCS) in veterinary narratives.\nMethods: BCS values were extracted from 4,415 anonymised clinical narratives\nusing either RegexT or by appending the narrative to a prompt sent to ChatGPT\ncoercing the model to return the BCS information. Data were manually reviewed\nfor comparison. Results: The precision of RegexT was higher (100%, 95% CI\n94.81-100%) than the ChatGPT (89.3%; 95% CI82.75-93.64%). However, the recall\nof ChatGPT (100%. 95% CI 96.18-100%) was considerably higher than that of\nRegexT (72.6%, 95% CI 63.92-79.94%). Limitations: Subtle prompt engineering is\nneeded to improve ChatGPT output. Conclusions: Large language models create\ndiverse opportunities and, whilst complex, present an intuitive interface to\ninformation but require careful implementation to avoid unpredictable errors.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:11:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fins","Ivo S.",""],["Davies","Heather",""],["Farrell","Sean",""],["Torres","Jose R.",""],["Pinchbeck","Gina",""],["Radford","Alan D.",""],["Noble","Peter-John",""]]}
{"id":"2308.01667","submitter":"Sebastian Fehlinger","authors":"Sebastian Fehlinger and Benno Liebchen","title":"Collective behavior of active molecules: dynamic clusters, holes and\n  active fractalytes","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":"  Recent experiments have led to active colloidal molecules which aggregate\nfrom non-motile building blocks and acquire self-propulsion through their\nnon-reciprocal interactions. Here, we model the collective behavior of such\nactive molecules and predict, besides dynamic clusters, the existence of a\nso-far unknown state of active matter made of 'active fractalytes' which are\nmotile crystallites featuring internal holes, gaps and a fractal dimension.\nThese structures could serve as a starting point for the creation of active\nmaterials with a low density and mechanical properties that can be designed\nthrough their fractal internal structure.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:12:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fehlinger","Sebastian",""],["Liebchen","Benno",""]]}
{"id":"2308.01668","submitter":"Babak Jabbar Nezhad","authors":"Babak Jabbar Nezhad","title":"Equations of the multi-Rees algebra of fattened coordinate subspaces","comments":"The paper is accepted in the Journal of Algebra and Its Applications.\n  This version is first submitted version in the journal. arXiv admin note:\n  text overlap with arXiv:1809.09316]","journal-ref":null,"doi":"10.1142/S0219498825500045","report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we describe the equations defining the multi-Rees algebra\n$k[x_1,\\dots,x_n][I_1^{a_1}t_1,\\dots,I_r^{a_r}t_r]$, where the ideals are\ngenerated by subsets of $x_1,\\dots,x_n$. We also show that a family of\nbinomials whose leading terms are squrefree, form a Gr\\\"{o}bner basis for the\ndefining equations with lexicographic order. We show that if we remove\nbinomials that include $x$'s, then remaining binomials form a Gr\\\"{o}bner basis\nfor the toric ideal associated to the multi-fiber ring. However binomials,\nincluding $x$'s, in Gr\\\"{o}bner basis of defining equations of the multi-Rees\nalgebra are not necessarily defining equations of corresponding symmetric\nalgebra. Despite this fact, we show that this family of ideals is of\nmulti-fiber type.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:13:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Nezhad","Babak Jabbar",""]]}
{"id":"2308.01669","submitter":"Edward Smith Dr","authors":"Edward R. Smith and Panagiotis E. Theodorakis","title":"Multiscale Simulation of Fluids: Coupling Molecular and Continuum","comments":"21 pages, 8 figures perspective paper submitted to Physical Chemistry\n  Chemical Physics (PCCP)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computer simulation is an important tool for scientific progress, especially\nwhen lab experiments are either extremely costly and difficult or lack the\nrequired resolution. However, all of the simulation methods come with\nlimitations. In molecular dynamics (MD) simulation, the length and time scales\nthat can be captured are limited, while computational fluid dynamics (CFD)\nmethods are built on a range of assumptions, from the continuum hypothesis\nitself, to a variety of closure assumptions. To address these issues, the\ncoupling of different methodologies provides a way to retain the best of both\nmethods. Here, we provide a perspective on multiscale simulation based on the\ncoupling of MD and CFD with each a distinct part of the simulation domain. This\nstyle of coupling allows molecular detail to be present only where it is\nneeded, so CFD can model larger scales than possible with MD alone. We present\na unified perspective of the literature, showing the links between state and\nflux coupling and discuss the various assumptions required for both. A unique\nchallenge in such coupled simulation is obtaining averages and constraining\nlocal parts of a molecular simulation. We highlight that incorrect localisation\nhas resulted in an error in the literature for both pressure tensor and\ncoupling constraints. We then finish with some applications, focused on the\nsimulation of fluids. Thus, we hope to motivate further research in this\nexciting area with applications across the spectrum of scientific disciplines.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:13:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Smith","Edward R.",""],["Theodorakis","Panagiotis E.",""]]}
{"id":"2308.01670","submitter":"Bertrand To\\\"en","authors":"Bertrand Toen","title":"Generalized local jacobians and commutative group stacks","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In [CS01, Page 109] Grothendieck sketches the construction of a complex\nJ_*(X) or commutative pro-algebraic groups, associated to a smooth variety X,\nand for which each J_i(X) is a product of local factors called the local\ngeneralized jacobians. The purpose of this note is to recast this construction\nin the setting of higher algebraic group stacks for the fppf topology. For\nthis, we introduce a notion of algebraic homology associated to a scheme which\nis a universal object computing fppf cohomology with coefficients in group\nschemes. We endow this algebraic homology with a filtration by dimension of\nsupports, and prove that, when X is smooth, J_*(X) appears as the E1-page of\nthe corresponding spectral sequence. In a final part we partially extends our\nconstructions and results over arbitrary bases.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:14:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Toen","Bertrand",""]]}
{"id":"2308.01671","submitter":"Maksim Zhukovskii","authors":"Yury Demidovich, Yaroslav Panichkin, Maksim Zhukovskii","title":"Reconstruction of colours","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a graph $G$, when is it possible to reconstruct with high probability a\nuniformly random colouring of its vertices in $r$ colours from its $k$-deck,\ni.e. a set of its induced (coloured) subgraphs of size $k$? In this paper, we\nreconstruct random colourings of lattices and random graphs. Recently,\nNarayanan and Yap proved that, for $d=2$, with high probability a random\ncolouring of vertices of a $d$-dimensional $n$-lattice ($n\\times n$ grid) is\nreconstructibe from its deck of all $k$-subgrids ($k\\times k$ grids) if\n$k\\geq\\sqrt{2\\log_2 n}+\\frac{3}{4}$ and is not reconstructible if\n$k<\\sqrt{2\\log_2 n}-\\frac{1}{4}$. We prove that the same \"two-point\nconcentration\" result for the minimum size of subgrids that determine the\nentire colouring holds true in any dimension $d\\geq 2$. We also prove that with\nhigh probability a uniformly random $r$-colouring of the vertices of the random\ngraph $G(n,1/2)$ is reconstructible from its full $k$-deck if $k\\geq 2\\log_2\nn+8$ and is not reconstructible if $k\\leq\\sqrt{2\\log_2 n}$.\n  We further show that the colour reconstruction algorithm for random graphs\ncan be modified and used for graph reconstruction: we prove that with high\nprobability $G(n,1/2)$ is reconstructible from its full $k$-deck if $k\\geq\n2\\log_2 n+11$ (while it is not reconstructible with high probability if $k\\leq\n2\\sqrt{\\log_2 n}$). This significantly improves the best known upper bound for\nthe minimum size of subgraphs in a deck that can be used to reconstruct the\nrandom graph with high probability.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:18:36 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 08:35:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Demidovich","Yury",""],["Panichkin","Yaroslav",""],["Zhukovskii","Maksim",""]]}
{"id":"2308.01672","submitter":"Shixin Chen","authors":"Shixin Chen, Shanyi Li, Zhen Zhuang, Su Zheng, Zheng Liang, Tsung-Yi\n  Ho, Bei Yu, Alberto L. Sangiovanni-Vincentelli","title":"Floorplet: Performance-aware Floorplan Framework for Chiplet Integration","comments":"9 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A chiplet is an integrated circuit that encompasses a well-defined subset of\nan overall system's functionality. In contrast to traditional monolithic\nsystem-on-chips (SoCs), chiplet-based architecture can reduce costs and\nincrease reusability, representing a promising avenue for continuing Moore's\nLaw. Despite the advantages of multi-chiplet architectures, floorplan design in\na chiplet-based architecture has received limited attention. Conflicts between\ncost and performance necessitate a trade-off in chiplet floorplan design since\nadditional latency introduced by advanced packaging can decrease performance.\nConsequently, balancing power, performance, cost, area, and reliability is of\nparamount importance. To address this challenge, we propose Floorplet, a\nframework comprising simulation tools for performance reporting and\ncomprehensive models for cost and reliability optimization. Our framework\nemploys the open-source Gem5 simulator to establish the relationship between\nperformance and floorplan for the first time, guiding the floorplan\noptimization of multi-chiplet architecture. The experimental results show that\nour framework decreases inter-chiplet communication costs by 24.81%.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:20:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chen","Shixin",""],["Li","Shanyi",""],["Zhuang","Zhen",""],["Zheng","Su",""],["Liang","Zheng",""],["Ho","Tsung-Yi",""],["Yu","Bei",""],["Sangiovanni-Vincentelli","Alberto L.",""]]}
{"id":"2308.01673","submitter":"Yuanping Cui","authors":"Yuanping Cui, Xiaoyue Li, Xuerong Mao, Hongfu Yang","title":"Wolbachia invasion to wild mosquito population in stochastic environment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Releasing sterile Wolbachia-infected mosquitoes to invade wild mosquito\npopulation is a method of mosquito control. In this paper, a stochastic\nmosquito population model with Wolbachia invasion perturbed by environmental\nfluctuation is studied. Firstly, well-posedness, positivity and Markov-Feller\nproperty of solution for this model are proved. Then a group of sharp\nthreshold-type conditions is provided to characterize the long-term behavior of\nthe model, which pinpoints the almost necessary and sufficient conditions for\npersistence and extinction of Wolbachia-infected and uninfected mosquito\npopulations. Especially, our results indicates that even the initial Wolbachia\ninfection frequency is low, the Wolbachia invasion into wild mosquito\npopulation can be promoted by stochastic environmental fluctuations. Finally,\nsome numerical experiments are carried out to support our theoretical results.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:21:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cui","Yuanping",""],["Li","Xiaoyue",""],["Mao","Xuerong",""],["Yang","Hongfu",""]]}
{"id":"2308.01674","submitter":"Manuel Dahmen","authors":"Daniel Mayfrank, Alexander Mitsos, Manuel Dahmen","title":"End-to-End Reinforcement Learning of Koopman Models for Economic\n  Nonlinear Model Predictive Control","comments":"manuscript (18 pages, 7 figures, 5 tables), supplementary materials\n  (3 pages, 2 tables)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  (Economic) nonlinear model predictive control ((e)NMPC) requires dynamic\nsystem models that are sufficiently accurate in all relevant state-space\nregions. These models must also be computationally cheap enough to ensure\nreal-time tractability. Data-driven surrogate models for mechanistic models can\nbe used to reduce the computational burden of (e)NMPC; however, such models are\ntypically trained by system identification for maximum average prediction\naccuracy on simulation samples and perform suboptimally as part of actual\n(e)NMPC. We present a method for end-to-end reinforcement learning of dynamic\nsurrogate models for optimal performance in (e)NMPC applications, resulting in\npredictive controllers that strike a favorable balance between control\nperformance and computational demand. We validate our method on two\napplications derived from an established nonlinear continuous stirred-tank\nreactor model. We compare the controller performance to that of MPCs utilizing\nmodels trained by the prevailing maximum prediction accuracy paradigm, and\nmodel-free neural network controllers trained using reinforcement learning. We\nshow that our method matches the performance of the model-free neural network\ncontrollers while consistently outperforming models derived from system\nidentification. Additionally, we show that the MPC policies can react to\nchanges in the control setting without retraining.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:21:53 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 15:38:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mayfrank","Daniel",""],["Mitsos","Alexander",""],["Dahmen","Manuel",""]]}
{"id":"2308.01675","submitter":"Lukas Sohlbach","authors":"Lukas Sohlbach, Hamza Hobbani, Chistopher Blase, Fernando\n  Perez-Pe\\~na, Karsten Schmidt","title":"Modelling and simulation of a commercially available dielectric\n  elastomer actuator","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 order to fully harness the potential of dielectric elastomer actu-ators\n(DEAs) in soft robots, advanced control methods are need-ed. An important\ngroundwork for this is the development of a control-oriented model that can\nadequately describe the underly-ing dynamics of a DEA. A common feature of\nexisting models is that always custom-made DEAs were investigated. This makes\nthe modelling process easier, as all specifications and the struc-ture of the\nactuator are well known. In the case of a commercial actuator, however, only\nthe information from the manufacturer is available and must be checked or\ncompleted during the modelling process. The aim of this paper is to explore how\na commercial stacked silicone-based DEA can be modelled and how complex the\nmodel should be to properly replicate the features of the actu-ator. The static\ndescription has demonstrated the suitability of Hooke's law. In the case of\ndynamic description, it is shown that no viscoelastic model is needed for\ncontrol-oriented modelling. However, if all features of the DEA are considered,\nthe general-ized Kelvin-Maxwell model with three Maxwell elements shows good\nresults, stability and computational efficiency.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:22:58 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sohlbach","Lukas",""],["Hobbani","Hamza",""],["Blase","Chistopher",""],["Perez-Pe\u00f1a","Fernando",""],["Schmidt","Karsten",""]]}
{"id":"2308.01676","submitter":"Guillaume Baudart","authors":"Guillaume Baudart, Louis Mandel, Christine Tasson","title":"Density-Based Semantics for Reactive Probabilistic Programming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synchronous languages are now a standard industry tool for critical embedded\nsystems. Designers write high-level specifications by composing streams of\nvalues using block diagrams. These languages have been extended with Bayesian\nreasoning to program state-space models which compute a stream of distributions\ngiven a stream of observations. However, the semantics of probabilistic models\nis only defined for scheduled equations -- a significant limitation compared to\ndataflow synchronous languages and block diagrams which do not require any\nordering.\n  In this paper we propose two schedule agnostic semantics for a probabilistic\nsynchronous language. The key idea is to interpret probabilistic expressions as\na stream of un-normalized density functions which maps random variable values\nto a result and positive score. The co-iterative semantics interprets programs\nas state machines and equations are computed using a fixpoint operator. The\nrelational semantics directly manipulates streams and is thus a better fit to\nreason about program equivalence. We use the relational semantics to prove the\ncorrectness of a program transformation required to run an optimized inference\nalgorithm for state-space models with constant parameters.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:26:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Baudart","Guillaume",""],["Mandel","Louis",""],["Tasson","Christine",""]]}
{"id":"2308.01677","submitter":"Dan Garber","authors":"Dan Garber, Atara Kaplan","title":"Efficiency of First-Order Methods for Low-Rank Tensor Recovery with the\n  Tensor Nuclear Norm Under Strict Complementarity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider convex relaxations for recovering low-rank tensors based on\nconstrained minimization over a ball induced by the tensor nuclear norm,\nrecently introduced in \\cite{tensor_tSVD}. We build on a recent line of results\nthat considered convex relaxations for the recovery of low-rank matrices and\nestablished that under a strict complementarity condition (SC), both the\nconvergence rate and per-iteration runtime of standard gradient methods may\nimprove dramatically. We develop the appropriate strict complementarity\ncondition for the tensor nuclear norm ball and obtain the following main\nresults under this condition: 1. When the objective to minimize is of the form\n$f(\\mX)=g(\\mA\\mX)+\\langle{\\mC,\\mX}\\rangle$ , where $g$ is strongly convex and\n$\\mA$ is a linear map (e.g., least squares), a quadratic growth bound holds,\nwhich implies linear convergence rates for standard projected gradient methods,\ndespite the fact that $f$ need not be strongly convex. 2. For a smooth\nobjective function, when initialized in certain proximity of an optimal\nsolution which satisfies SC, standard projected gradient methods only require\nSVD computations (for projecting onto the tensor nuclear norm ball) of rank\nthat matches the tubal rank of the optimal solution. In particular, when the\ntubal rank is constant, this implies nearly linear (in the size of the tensor)\nruntime per iteration, as opposed to super linear without further assumptions.\n3. For a nonsmooth objective function which admits a popular smooth\nsaddle-point formulation, we derive similar results to the latter for the well\nknown extragradient method. An additional contribution which may be of\nindependent interest, is the rigorous extension of many basic results regarding\ntensors of arbitrary order, which were previously obtained only for third-order\ntensors.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:31:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Garber","Dan",""],["Kaplan","Atara",""]]}
{"id":"2308.01678","submitter":"Danilo Nikolic","authors":"Subrata Chakraborty, Danilo Nikoli\\'c, Rub\\'en Seoane Souto, Wolfgang\n  Belzig, Juan Carlos Cuevas","title":"DC Josephson effect between two Yu-Shiba-Rusinov bound states","comments":"7 pages, 4 figures, submitted to PRB","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by recent experiments [Nat. Phys. 16, 1227 (2020)] we present here\na theoretical study of the dc Josephson effect in a system comprising two\nmagnetic impurities coupled to their respective superconducting electrodes and\nthat exhibit Yu-Shiba-Rusinov (YSR) states. We make use of a mean-field\nAnderson model with broken spin symmetry to compute the supercurrent in this\nsystem for arbitrary range of parameters (coupling between the impurities,\norientation of the impurity spins, etc.). We predict a variety of physical\nphenomena such as: (i) the occurrence of multiple $0$-$\\pi$ transitions in the\nregime of weak coupling that can be induced by changing the energy of the YSR\nstates or the temperature, (ii) the critical current strongly depends on the\nrelative orientation of the impurity spins and it is maximized when the spins\nare either parallel or antiparallel, depending on the ground state of the\nimpurities, and (iii) upon increasing the coupling between impurities, triplet\nsuperconductivity is generated in the system and it is manifested in a highly\nnon-sinusoidal current-phase relation. In principle, these predictions can be\ntested experimentally with the existing realization of this system and the main\nlessons of this Letter are of great relevance for the field of superconducting\nspintronics.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:36:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chakraborty","Subrata",""],["Nikoli\u0107","Danilo",""],["Souto","Rub\u00e9n Seoane",""],["Belzig","Wolfgang",""],["Cuevas","Juan Carlos",""]]}
{"id":"2308.01679","submitter":"Pavel Gevorgyan","authors":"Pavel S. Gevorgyan","title":"Equivariant Movability of Topological Groups","comments":"7 pages","journal-ref":"Topology and its Applications, 159 (2012), 1761--1766","doi":"10.1016/j.topol.2011.04.019","report-no":null,"categories":"math.GN math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The equivariant movability of topological spaces with an action of a given\ntopological group $G$ is considered. In particular, the equivariant movability\nof topological groups is studied. It is proved that a second countable group\n$G$ is Lie if and only if it is equivariantly movable.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:41:36 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gevorgyan","Pavel S.",""]]}
{"id":"2308.01680","submitter":"Fu Bo","authors":"Bo Fu, Yanru Chen, Weiwei Chen, Wei Zhu, Ping Cui, Qunxiang Li, Zhenyu\n  Zhang, Qinwei Shi","title":"Disorder Effects on the Quasiparticle and Transport Properties of\n  Two-Dimensional Dirac Fermionic Systems","comments":"15 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite extensive existing studies, a complete understanding of the role of\ndisorder in affecting the physical properties of two-dimensional Dirac\nfermionic systems remains a standing challenge, largely due to obstacles\nencountered in treating multiple scattering events for such inherently strong\nscattering systems. Using graphene as an example and a nonperturbative\nnumerical technique, here we reveal that the low energy quasiparticle\nproperties are considerably modified by multiple scattering processes even in\nthe presence of weak scalar potentials. We extract unified power-law energy\ndependences of the self-energy with fractional exponents from the weak\nscattering limit to the strong scattering limit from our numerical analysis,\nleading to sharp reductions of the quasiparticle residues near the Dirac point,\neventually vanishing at the Dirac point. The central findings stay valid when\nthe Anderson-type impurities are replaced by correlated Gaussian- or\nYukawa-type disorder with varying correlation lengths. The improved\nunderstanding gained here also enables us to provide better interpretations of\nthe experimental observations surrounding the temperature and carrier density\ndependences of the conductivity in ultra-high mobility graphene samples. The\napproach demonstrated here is expected to find broad applicability in\nunderstanding the role of various other types of impurities in two-dimensional\nDirac systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:47:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fu","Bo",""],["Chen","Yanru",""],["Chen","Weiwei",""],["Zhu","Wei",""],["Cui","Ping",""],["Li","Qunxiang",""],["Zhang","Zhenyu",""],["Shi","Qinwei",""]]}
{"id":"2308.01681","submitter":"Shaina Raza Dr.","authors":"Shaina Raza, Muskan Garg, Deepak John Reji, Syed Raza Bashir, Chen\n  Ding","title":"NBIAS: A Natural Language Processing Framework for Bias Identification\n  in Text","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Bias in textual data can lead to skewed interpretations and outcomes when the\ndata is used. These biases could perpetuate stereotypes, discrimination, or\nother forms of unfair treatment. An algorithm trained on biased data may end up\nmaking decisions that disproportionately impact a certain group of people.\nTherefore, it is crucial to detect and remove these biases to ensure the fair\nand ethical use of data. To this end, we develop a comprehensive and robust\nframework NBIAS that consists of four main layers: data, corpus construction,\nmodel development and an evaluation layer. The dataset is constructed by\ncollecting diverse data from various domains, including social media,\nhealthcare, and job hiring portals. As such, we applied a transformer-based\ntoken classification model that is able to identify bias words/ phrases through\na unique named entity BIAS. In the evaluation procedure, we incorporate a blend\nof quantitative and qualitative measures to gauge the effectiveness of our\nmodels. We achieve accuracy improvements ranging from 1% to 8% compared to\nbaselines. We are also able to generate a robust understanding of the model\nfunctioning. The proposed approach is applicable to a variety of biases and\ncontributes to the fair and ethical use of textual data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:48:30 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 03:19:10 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 12:20:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Raza","Shaina",""],["Garg","Muskan",""],["Reji","Deepak John",""],["Bashir","Syed Raza",""],["Ding","Chen",""]]}
{"id":"2308.01682","submitter":"Claudio Borile","authors":"Claudio Borile, Alan Perotti, Andr\\'e Panisson","title":"Evaluating Link Prediction Explanations for Graph Neural Networks","comments":"This work has been accepted to be presented to The 1st World\n  Conference on eXplainable Artificial Intelligence (xAI 2023), July 26-28,\n  2023 - Lisboa, Portugal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Machine Learning (GML) has numerous applications, such as node/graph\nclassification and link prediction, in real-world domains. Providing\nhuman-understandable explanations for GML models is a challenging yet\nfundamental task to foster their adoption, but validating explanations for link\nprediction models has received little attention. In this paper, we provide\nquantitative metrics to assess the quality of link prediction explanations,\nwith or without ground-truth. State-of-the-art explainability methods for Graph\nNeural Networks are evaluated using these metrics. We discuss how underlying\nassumptions and technical details specific to the link prediction task, such as\nthe choice of distance between node embeddings, can influence the quality of\nthe explanations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:48:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Borile","Claudio",""],["Perotti","Alan",""],["Panisson","Andr\u00e9",""]]}
{"id":"2308.01683","submitter":"Hansol Kim","authors":"Bo-Hae Im and Hansol Kim","title":"Growth of Torsion Groups of Elliptic Curves Over Number Fields without\n  Rationally Defined CM","comments":"The title and typos are corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  For a quadratic field $\\mathcal{K}$ without rationally defined CM, we prove\nthat there exists of a prime $p_{\\mathcal{K}}$ depending only on $\\mathcal{K}$\nsuch that if $d$ is a positive integer whose minimal prime divisor is greater\nthan $p_{\\mathcal{K}}$, then for any extension $L/\\mathcal{K}$ of degree d and\nany elliptic curve $E/\\mathcal{K}$, we have\n$E\\left(L\\right)_{\\operatorname{tors}} =\nE\\left(\\mathcal{K}\\right)_{\\operatorname{tors}}$. By not assuming the GRH, this\nis a generalization of the results by Genao, and Gon\\'alez-Jim\\'enez and\nNajman.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:50:27 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 01:22:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Im","Bo-Hae",""],["Kim","Hansol",""]]}
{"id":"2308.01684","submitter":"Bolei Ma","authors":"Zheyu Zhang, Han Yang, Bolei Ma, David R\\\"ugamer, Ercong Nie","title":"Baby's CoThought: Leveraging Large Language Models for Enhanced\n  Reasoning in Compact Models","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) demonstrate remarkable performance on a variety\nof Natural Language Understanding (NLU) tasks, primarily due to their\nin-context learning ability. This ability is utilized in our proposed\n\"CoThought\" pipeline, which efficiently trains smaller \"baby\" language models\n(BabyLMs) by leveraging the Chain of Thought (CoT) prompting of LLMs. Our\npipeline restructures a dataset of less than 100M in size using GPT-3.5-turbo,\ntransforming it into task-oriented, human-readable texts that are comparable to\nthe school texts for language learners. The BabyLM is then pretrained on this\nrestructured dataset in a RoBERTa (Liu et al., 2019) fashion. In evaluations\nacross 4 benchmarks, our BabyLM outperforms the RoBERTa-base in 10 linguistic,\nNLU, and question answering tasks by more than 3 points, showing superior\nability to extract contextual information. These results suggest that compact\nLMs pretrained on small, LLM-restructured data can better understand tasks and\nachieve improved performance. The code for data processing and model training\nis available at: https://github.com/oooranz/Baby-CoThought.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:52:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Zheyu",""],["Yang","Han",""],["Ma","Bolei",""],["R\u00fcgamer","David",""],["Nie","Ercong",""]]}
{"id":"2308.01685","submitter":"Ohr Kadrawi","authors":"Ohr Kadrawi and Vadim E. Levit","title":"Inequalities Connecting the Annihilation and Independence Numbers","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a graph $G$, the number of its vertices is represented by $n(G)$, while\nthe number of its edges is denoted as $m(G)$.\n  An independent set in a graph is a set of vertices where no two vertices are\nadjacent to each other and the size of the maximum independent set is denoted\nby $\\alpha(G)$. A matching in a graph refers to a set of edges where no two\nedges share a common vertex and the maximum matching size is denoted by\n$\\mu(G)$. If $\\alpha(G) + \\mu(G) = n(G)$, then the graph $G$ is called a\nK\\\"{o}nig-Egerv\\'{a}ry graph.\n  Considering a graph $G$ with a degree sequence $d_1 \\leq d_2 \\leq \\cdots \\leq\nd_n$, the annihilation number $a(G)$ is defined as the largest integer $k$ such\nthat the sum of the first $k$ degrees in the sequence is less than or equal to\n$m(G)$ (Pepper, 2004).\n  It is a known fact that $\\alpha(G)$ is less than or equal to $a(G)$ for any\ngraph $G$. Our goal is to estimate the difference between these two parameters.\nSpecifically, we prove a series of inequalities, including\n  $a(G) - \\alpha(G) \\leq \\frac{\\mu(G) - 1}{2}$ for trees, $a(G) - \\alpha(G)\n\\leq 2 + \\mu(G) - 2\\sqrt{1 + \\mu(G)}$ for bipartite graphs and $a(G) -\n\\alpha(G) \\leq \\mu(G) - 2$ for K\\\"{o}nig-Egerv\\'{a}ry graphs. Furthermore, we\ndemonstrate that these inequalities serve as tight upper bounds for the\ndifference between the annihilation and independence numbers, regardless of the\nassigned value for $\\mu(G)$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:53:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kadrawi","Ohr",""],["Levit","Vadim E.",""]]}
{"id":"2308.01686","submitter":"Zhiwei Zhang","authors":"Zhiwei Zhang, Zhizhong Zhang, Qian Yu, Ran Yi, Yuan Xie and Lizhuang\n  Ma","title":"LiDAR-Camera Panoptic Segmentation via Geometry-Consistent and\n  Semantic-Aware Alignment","comments":"Accepted as ICCV 2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  3D panoptic segmentation is a challenging perception task that requires both\nsemantic segmentation and instance segmentation. In this task, we notice that\nimages could provide rich texture, color, and discriminative information, which\ncan complement LiDAR data for evident performance improvement, but their fusion\nremains a challenging problem. To this end, we propose LCPS, the first\nLiDAR-Camera Panoptic Segmentation network. In our approach, we conduct\nLiDAR-Camera fusion in three stages: 1) an Asynchronous Compensation Pixel\nAlignment (ACPA) module that calibrates the coordinate misalignment caused by\nasynchronous problems between sensors; 2) a Semantic-Aware Region Alignment\n(SARA) module that extends the one-to-one point-pixel mapping to one-to-many\nsemantic relations; 3) a Point-to-Voxel feature Propagation (PVP) module that\nintegrates both geometric and semantic fusion information for the entire point\ncloud. Our fusion strategy improves about 6.9% PQ performance over the\nLiDAR-only baseline on NuScenes dataset. Extensive quantitative and qualitative\nexperiments further demonstrate the effectiveness of our novel framework. The\ncode will be released at https://github.com/zhangzw12319/lcps.git.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:57:58 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 18:32:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Zhiwei",""],["Zhang","Zhizhong",""],["Yu","Qian",""],["Yi","Ran",""],["Xie","Yuan",""],["Ma","Lizhuang",""]]}
{"id":"2308.01687","submitter":"Gergely Barcza","authors":"\\'Ad\\'am Ganyecz, Rohit Babar, Zsolt Benedek, Igor Aharonovich,\n  Gergely Barcza, Viktor Iv\\'ady","title":"First principles theory of the nitrogen interstitial in hBN: a plausible\n  model for the blue emitter","comments":"33 pages, 10 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Color centers in hexagonal boron nitride (hBN) have attracted considerable\nattention due to their remarkable optical properties enabling robust room\ntemperature photonics and quantum optics applications in the visible spectral\nrange. On the other hand, identification of the microscopic origin of color\ncenters in hBN has turned out to be a great challenge that hinders in-depth\ntheoretical characterization, on-demand fabrication, and development of\nintegrated photonic devices. This is also true for the blue emitter, which is\nan irradiation damage in hBN emitting at 436 nm wavelengths with desirable\nproperties. Here, we propose the negatively charged nitrogen split interstitial\ndefect in hBN as a plausible microscopic model for the blue emitter. To this\nend, we carry out a comprehensive first principles theoretical study of the\nnitrogen interstitial. We carefully analyze the accuracy of first principles\nmethods and show that the commonly used HSE hybrid exchange-correlation\nfunctional fails to describe the electronic structure of this defect. Using the\ngeneralized Koopman's theorem, we fine tune the functional and obtain a\nzero-phonon photoluminescence (ZPL) energy in the blue spectral range. We show\nthat the defect exhibits high emission rate in the ZPL line and features a\ncharacteristic phonon side band that resembles the blue emitter's spectrum.\nFurthermore, we study the electric field dependence of the ZPL and numerically\nshow that the defect exhibits a quadratic Stark shift for perpendicular to\nplane electric fields, making the emitter insensitive to electric field\nfluctuations in first order. Our work emphasize the need for assessing the\naccuracy of common first principles methods in hBN and exemplifies a workaround\nmethodology. Furthermore, our work is a step towards understanding the\nstructure of the blue emitter and utilizing it in photonics applications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:59:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ganyecz","\u00c1d\u00e1m",""],["Babar","Rohit",""],["Benedek","Zsolt",""],["Aharonovich","Igor",""],["Barcza","Gergely",""],["Iv\u00e1dy","Viktor",""]]}
{"id":"2308.01688","submitter":"Ren\\'e Van Westen","authors":"Ren\\'e M. van Westen, Michael Kliphuis, Henk A. Dijkstra","title":"New Physics-Based Early Warning Signal shows AMOC is on Tipping Course","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most prominent climate tipping elements is the Atlantic Meridional\nOverturning Circulation (AMOC), which can potentially collapse due to the input\nof fresh water in the North Atlantic. Although AMOC collapses have been induced\nin state-of-the-art Global Climate Models (GCMs) by strong freshwater forcing,\nan AMOC tipping event has so far not been found. Here, we show results of the\nfirst AMOC tipping event in such a GCM, the Community Earth System Model,\nincluding the large climate impacts of the associated AMOC collapse. Using\nthese results, we develop a new physics-based and observable early warning\nsignal of AMOC tipping: the minimum of the AMOC induced freshwater transport at\nthe southern boundary of the Atlantic. Available observational and reanalysis\ndata indicate that the present-day AMOC is on route to tipping. The new early\nwarning signal is a useful alternative to classical statistical ones which,\nwhen applied to our simulated AMOC tipping event, turn out to be sensitive to\nthe analysed time interval before tipping.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:03:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["van Westen","Ren\u00e9 M.",""],["Kliphuis","Michael",""],["Dijkstra","Henk A.",""]]}
{"id":"2308.01689","submitter":"Alexander Rudenko S.","authors":"A.D. Dolgov, A.S. Rudenko","title":"Conversion of protons to positrons by a black hole","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The conversion of protons to positrons at the horizon of a black hole (BH) is\nconsidered. It is shown that the process may efficiently proceed for BHs with\nmasses in the range $\\sim 10^{18}$ -- $10^{21}$ g. It is argued that the\nelectric charge of BH acquired by the proton accretion to BH could create\nelectric field near BH horizon close to the critical Schwinger one. It leads to\nefficient electron-positron pair production, when electron is back capture by\nthe BH while positron is emitted into outer space. The electron-positron\nannihilation in the interstellar medium may explain the origin of the observed\n511 keV line.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:03:20 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dolgov","A. D.",""],["Rudenko","A. S.",""]]}
{"id":"2308.01690","submitter":"Sergei Garmaev","authors":"Sergei Garmaev and Olga Fink","title":"Deep Koopman Operator-based degradation modelling","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":"  With the current trend of increasing complexity of industrial systems, the\nconstruction and monitoring of health indicators becomes even more challenging.\nGiven that health indicators are commonly employed to predict the end of life,\na crucial criterion for reliable health indicators is their capability to\ndiscern a degradation trend. However, trending can pose challenges due to the\nvariability of operating conditions. An optimal transformation of health\nindicators would therefore be one that converts degradation dynamics into a\ncoordinate system where degradation trends exhibit linearity. Koopman theory\nframework is well-suited to address these challenges. In this work, we\ndemonstrate the successful extension of the previously proposed Deep Koopman\nOperator approach to learn the dynamics of industrial systems by transforming\nthem into linearized coordinate systems, resulting in a latent representation\nthat provides sufficient information for estimating the system's remaining\nuseful life. Additionally, we propose a novel Koopman-Inspired Degradation\nModel for degradation modelling of dynamical systems with control. The proposed\napproach effectively disentangles the impact of degradation and imposed control\non the latent dynamics. The algorithm consistently outperforms in predicting\nthe remaining useful life of CNC milling machine cutters and Li-ion batteries,\nwhether operated under constant and varying current loads. Furthermore, we\nhighlight the utility of learned Koopman-inspired degradation operators\nanalyzing the influence of imposed control on the system's health state.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:09:33 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Garmaev","Sergei",""],["Fink","Olga",""]]}
{"id":"2308.01691","submitter":"Mengliang Liu","authors":"Mengliang Liu and Mengyun Liu","title":"Blow-up for semilinear wave equations with damping and potential in high\n  dimensional Schwarzschild spacetime","comments":"18 pages, 1 figures","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 study the blow up results to power-type semilinear wave\nequation in the high dimensional Schwarzschild spacetime, with damping and\npotential terms. We can obtain the upper bound estimates of lifespan without\nthe assumption that the support of the initial date should be far away from the\nblack hole.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:13:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liu","Mengliang",""],["Liu","Mengyun",""]]}
{"id":"2308.01692","submitter":"Josep Sardany\\'es","authors":"E. Fontich, A. Guillamon, J. Perona, J. Sardany\\'es","title":"Functional shift-induced degenerate transcritical Neimark-Sacker\n  bifurcation in a discrete hypercycle","comments":"13 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article we investigate the impact of functional shifts in a\ntime-discrete cross-catalytic system. We use the hypercycle model considering\nthat one of the species shifts from a cooperator to a degradader. At the\nbifurcation caused by this functional shift, an invariant curve collapses to a\npoint $P$ while, simultaneously, two fixed points collide with $P$ in a\ntranscritical manner. All points of a line containing $P$ become fixed points\nat the bifurcation and only at the bifurcation. Hofbauer and\nIooss~\\cite{HofbauerIooss1984} presented and proved a result that provides\nsufficient conditions for a Neimark-Sacker bifurcation (the authors called it\n\"Hopf\") to occur in a special degenerate situation. They use it to prove the\nexistence of an invariant curve for the model when a parameter related to the\ntime discreteness of the system goes to infinity becoming a continuous-time\nsystem. Here we study the bifurcation that governs the functional shift and\ndemonstrate the existence of an invariant curve when the cooperation parameter\napproaches zero and thus approaches the switch to degrading species. This\ninvariant curve lives in a different domain and exists for a different set of\nvalues of the parameters described by these authors. In order to apply the\nmentioned result we uncouple the Neimark-Sacker and the transcritical\nbifurcations. This is accomplished by a preliminary singular change of\ncoordinates that puts the involved fixed points at a fixed position, so that\nthey stay at a fixed distance among them. Finally, going back to the original\nvariables, we can describe mathematically the details of this bifurcation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:21:45 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fontich","E.",""],["Guillamon","A.",""],["Perona","J.",""],["Sardany\u00e9s","J.",""]]}
{"id":"2308.01693","submitter":"Yongliang Wang","authors":"Yongliang Wang","title":"A general flux-Based Circuit Theory for Superconducting Josephson\n  Junction Circuits","comments":"35 pages, 52 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Superconducting quantum interference devices (SQUIDs), single flux-quantum\n(SFQ) logic circuits, and quantum Josephson junction circuits have been\ndeveloped into a family of superconductor integrated circuit, and are widely\napplied for subtle magnetic-field measurements, energy-efficient computing, and\nquantum computing, respectively. They are Josephson junction networks composed\nof Josephson junctions and normal resistor-inductor-capacitor (RLC) components,\nworking with the fluxoid-quantization principle and Josephson effects to\nachieve unique flux-modulated dynamics and characteristics; they react to the\nvector potential of magnetic fields rather than the electric potential.\nHowever, the conventional circuit diagrams and nodal analysis methods focus on\nthe electric charges flowing though branches and nodes, ignoring dynamics of\nthe magnetic fluxes flowing from loop to loop. This article introduces a\ngeneral flux-based circuit theory to unify the analyses of Josephson junction\ncircuits and normal RLC circuits. This theory presents a\nmagnetic-flux-generator (MFG) concept to unify Josephson junctions and normal\ncircuit elements, and abstract both Josephson junction circuits and normal RLC\ncircuits as MFG network; it derives a general network equation to describe\ndynamics of Josephson junction circuits, and invents a kind of magnetic-flux\nflow (MFF) diagram to depict the working principles of magnetic-flux flows\ninside Josephson junction circuits. The flux-based theory is complementary to\nthe conventional circuit theories in the design and analysis of superconductor\nintegrated circuits.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:22:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wang","Yongliang",""]]}
{"id":"2308.01694","submitter":"Armand Bernou","authors":"Armand Bernou","title":"Asymptotic Behavior of Degenerate Linear Kinetic Equations with\n  Non-Isothermal Boundary Conditions","comments":"35 pages, 1 table. Comments are welcome","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 study the degenerate linear Boltzmann equation inside a bounded domain\nwith the Maxwell and the Cercignani-Lampis boundary conditions, two\ngeneralizations of the diffuse reflection, with variable temperature. This\nincludes a model of relaxation towards a space-dependent steady state. For both\nboundary conditions, we prove for the first time the existence of a steady\nstate and a rate of convergence towards it without assumptions on the\ntemperature variations. Our results for the Cercignani-Lampis boundary\ncondition make also no hypotheses on the accommodation coefficients. The proven\nrate is exponential when a control condition on the degeneracy of the collision\noperator is satisfied, and only polynomial when this assumption is not met, in\nline with our previous results regarding the free-transport equation. We also\nprovide a precise description of the different convergence rates, including\nlower bounds, when the steady state is bounded. Our method yields constructive\nconstants.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:24:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bernou","Armand",""]]}
{"id":"2308.01695","submitter":"Marvin Weidner","authors":"Xavier Ros-Oton, Marvin Weidner","title":"Obstacle problems for nonlocal operators 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":"  In this paper we establish optimal regularity estimates and smoothness of\nfree boundaries for nonlocal obstacle problems governed by a very general class\nof integro-differential operators with possibly singular kernels. More\nprecisely, in contrast to all previous known results, we are able to treat\nnonlocal operators whose kernels are not necessarily pointwise comparable to\nthe one of the fractional Laplacian. Such operators might be very anisotropic\nin the sense that they \"do not see\" certain directions at all, or might have\nsubstantial oscillatory behavior, causing the nonlocal Harnack inequality to\nfail.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:28:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ros-Oton","Xavier",""],["Weidner","Marvin",""]]}
{"id":"2308.01696","submitter":"Yinwei Du","authors":"Yinwei Du, Yue Li, Stelian Coros, Bernhard Thomaszewski","title":"No Free Slide: Spurious Contact Forces in Incremental Potential Contact","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modeling contact between deformable solids is a fundamental problem in\ncomputer animation, mechanical design, and robotics. Existing methods based on\n$C^0$-discretizations -- piece-wise linear or polynomial surfaces -- suffer\nfrom discontinuities and irregularities in tangential contact forces, which can\nsignificantly affect simulation outcomes and even prevent convergence. To\novercome this limitation, we employ smooth surface representations for both\ncontacting bodies. Through a series of test cases, we show that our approach\noffers advantages over existing methods in terms of accuracy and robustness for\nboth forward and inverse problems. The contributions of our work include\nidentifying the limitations of existing methods, examining the advantages of\nsmooth surface representation, and proposing forward and inverse problems to\nanalyze contact force irregularities.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:29:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Du","Yinwei",""],["Li","Yue",""],["Coros","Stelian",""],["Thomaszewski","Bernhard",""]]}
{"id":"2308.01697","submitter":"Enrico Valdinoci","authors":"Serena Dipierro, Ovidiu Savin, and Enrico Valdinoci","title":"A strict maximum principle for nonlocal minimal surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the setting of fractional minimal surfaces, we prove that if two nonlocal\nminimal sets are one included in the other and share a common boundary point,\nthen they must necessarily coincide.\n  This strict maximum principle is not obvious, since the surfaces may touch at\nan irregular point, therefore a suitable blow-up analysis must be combined with\na bespoke regularity theory to obtain this result.\n  For the classical case, an analogous result was proved by Leon Simon. Our\nproof also relies on a Harnack Inequality for nonlocal minimal surfaces that\nhas been recently introduced by Xavier Cabr\\'e and Matteo Cozzi and which can\nbe seen as a fractional counterpart of a classical result by Enrico Bombieri\nand Enrico Giusti.\n  In our setting, an additional difficulty comes from the analysis of the\ncorresponding nonlocal integral equation on a hypersurface, which presents a\nremainder whose sign and fine properties need to be carefully addressed.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:32:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dipierro","Serena",""],["Savin","Ovidiu",""],["Valdinoci","Enrico",""]]}
{"id":"2308.01698","submitter":"Yuhang Zhou","authors":"Yuhang Zhou, Jiangchao Yao, Feng Hong, Ya Zhang, and Yanfeng Wang","title":"Balanced Destruction-Reconstruction Dynamics for Memory-replay Class\n  Incremental Learning","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 incrementally update a trained model\nwith the new classes of samples (plasticity) while retaining previously learned\nability (stability). To address the most challenging issue in this goal, i.e.,\ncatastrophic forgetting, the mainstream paradigm is memory-replay CIL, which\nconsolidates old knowledge by replaying a small number of old classes of\nsamples saved in the memory. Despite effectiveness, the inherent\ndestruction-reconstruction dynamics in memory-replay CIL are an intrinsic\nlimitation: if the old knowledge is severely destructed, it will be quite hard\nto reconstruct the lossless counterpart. Our theoretical analysis shows that\nthe destruction of old knowledge can be effectively alleviated by balancing the\ncontribution of samples from the current phase and those saved in the memory.\nMotivated by this theoretical finding, we propose a novel Balanced\nDestruction-Reconstruction module (BDR) for memory-replay CIL, which can\nachieve better knowledge reconstruction by reducing the degree of maximal\ndestruction of old knowledge. Specifically, to achieve a better balance between\nold knowledge and new classes, the proposed BDR module takes into account two\nfactors: the variance in training status across different classes and the\nquantity imbalance of samples from the current phase and memory. By dynamically\nmanipulating the gradient during training based on these factors, BDR can\neffectively alleviate knowledge destruction and improve knowledge\nreconstruction. Extensive experiments on a range of CIL benchmarks have shown\nthat as a lightweight plug-and-play module, BDR can significantly improve the\nperformance of existing state-of-the-art methods with good generalization.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:33:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhou","Yuhang",""],["Yao","Jiangchao",""],["Hong","Feng",""],["Zhang","Ya",""],["Wang","Yanfeng",""]]}
{"id":"2308.01699","submitter":"Vicente Miquel","authors":"Alexander A. Borisenko and Vicente Miquel","title":"Geodesic loops on tetrahedra in spaces of constant sectional curvature","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Geodesic loops on polyhedra were studied only for Euclidean space and it was\nknown that there are no simple geodesic loops on regular tetrahedra. Here we\nprove that: 1) On the spherical space, there are no simple geodesic loops on\ntetrahedra with internal angles $\\pi/3 < \\alpha_i<\\pi/2$ or regular tetrahedra\nwith $\\alpha_i=\\pi/2$, and there are three simple geodesic loops for each\nvertex of a tetrahedra with $\\alpha_i > \\pi/2$ and the lengths of the edges\n$alpha_i>\\pi/2$. 2) On the hyperbolic space, for every regular tetrahedron $T$\nand every pair of coprime numbers $(p,q)$, there is one simple geodesic loop of\n$(p,q)$ type through every vertex of $T$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:33:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Borisenko","Alexander A.",""],["Miquel","Vicente",""]]}
{"id":"2308.01700","submitter":"Seyed Muhammad Hossein Mousavi","authors":"Seyed Muhammad Hossein Mousavi and Atiye Ilanloo","title":"Bees Local Phase Quantization Feature Selection for RGB-D Facial\n  Expressions Recognition","comments":"The International Workshop on the Bees Algorithm and its\n  Applications, Birmingham, UK\n  (https://sites.google.com/view/baaworkshop/baa-past-events/2022)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Feature selection could be defined as an optimization problem and solved by\nbio-inspired algorithms. Bees Algorithm (BA) shows decent performance in\nfeature selection optimization tasks. On the other hand, Local Phase\nQuantization (LPQ) is a frequency domain feature which has excellent\nperformance on Depth images. Here, after extracting LPQ features out of RGB\n(colour) and Depth images from the Iranian Kinect Face Database (IKFDB), the\nBees feature selection algorithm applies to select the desired number of\nfeatures for final classification tasks. IKFDB is recorded with Kinect sensor\nV.2 and contains colour and depth images for facial and facial\nmicro-expressions recognition purposes. Here five facial expressions of Anger,\nJoy, Surprise, Disgust and Fear are used for final validation. The proposed\nBees LPQ method is compared with Particle Swarm Optimization (PSO) LPQ, PCA\nLPQ, Lasso LPQ, and just LPQ features for classification tasks with Support\nVector Machines (SVM), K-Nearest Neighbourhood (KNN), Shallow Neural Network\nand Ensemble Subspace KNN. Returned results, show a decent performance of the\nproposed algorithm (99 % accuracy) in comparison with others.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:34:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mousavi","Seyed Muhammad Hossein",""],["Ilanloo","Atiye",""]]}
{"id":"2308.01701","submitter":"Sourav Sarkar","authors":"Sayan Karmakar, Md Safwan Mondal, Anish Pal, Sourav Sarkar","title":"Optimizing Sorting of Micro-Sized Bio-Cells in Symmetric Serpentine\n  Microchannel using Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient sorting of target cells is crucial for advancing cellular research\nin biology and medical diagnostics. Inertial microfluidics, an emerging\ntechnology, offers a promising approach for label-free particle sorting with\nhigh throughput. This paper presents a comprehensive study employing numerical\ncomputational fluid dynamics (CFD) simulations to investigate particle\nmigration and sorting within a symmetric serpentine microchannel. By adopting a\nEulerian approach to solve fluid dynamics and a Lagrangian framework to track\nparticles, the research explores the impact of flow Reynolds number and the\nnumber of loops in the serpentine channel on sorting efficiency. To generate a\nrobust data-driven model, the authors performed CFD simulations for 200\ncombinations of randomly generated data points. The study leverages the\ncollected data to develop a data-centric machine learning model capable of\naccurately predicting flow parameters for specific sorting efficiencies.\nRemarkably, the developed model achieved a 92% accuracy in predicting the\nChannel Reynolds Number during testing. However, it is worth noting that the\nmodel currently faces challenges in accurately predicting the required number\nof loops for efficient sorting.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:35:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Karmakar","Sayan",""],["Mondal","Md Safwan",""],["Pal","Anish",""],["Sarkar","Sourav",""]]}
{"id":"2308.01702","submitter":"Erik Leitinger","authors":"Stefan Grebien, Erik Leitinger, Klaus Witrisal, Bernard H. Fleury","title":"Super-Resolution Estimation of UWB Channels including the Diffuse\n  Component -- An SBL-Inspired Approach","comments":"34 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present an iterative algorithm that detects and estimates\nthe specular components and estimates the diffuse component of\nsingle-input-multiple-output (SIMO) ultra-wide-band (UWB) multipath channels.\nSpecifically, the algorithm super-resolves the specular components in the\ndelay-angle-of-arrival domain and estimates the parameters of a parametric\nmodel of the delay-angle power spectrum characterizing the diffuse component.\nChannel noise is also estimated. In essence, the algorithm solves the problem\nof estimating spectral lines (the specular components) in colored noise\n(generated by the diffuse component and channel noise). Its design is inspired\nby the sparse Bayesian learning (SBL) framework. As a result the iteration\nprocess contains a threshold condition that determines whether a candidate\nspecular component shall be retained or pruned. By relying to results from\nextreme-value analysis the threshold of this condition is suitably adapted to\nensure a prescribed probability of detecting spurious specular components.\nStudies using synthetic and real channel measurement data demonstrate the\nvirtues of the algorithm: it is able to still detect and accurately estimate\nspecular components, even when their separation in delay and angle is down to\nhalf the Rayleigh resolution limit (RRL) of the equipment; it is robust in the\nsense that it tends to return no more specular components than the actual ones.\nFinally, the algorithm is shown to outperform a state-of-the-art\nsuper-resolution channel estimator.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:41:36 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 13:19:03 GMT"},{"version":"v3","created":"Fri, 11 Aug 2023 13:34:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Grebien","Stefan",""],["Leitinger","Erik",""],["Witrisal","Klaus",""],["Fleury","Bernard H.",""]]}
{"id":"2308.01703","submitter":"Istv\\'an Andr\\'as Seres","authors":"Alex Kov\\'acs and Istv\\'an Andr\\'as Seres","title":"Anonymity Analysis of the Umbra Stealth Address Scheme on Ethereum","comments":"Pre-print in 7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Stealth addresses are a privacy-enhancing technology that provides recipient\nanonymity on blockchains. In this work, we investigate the recipient anonymity\nand unlinkability guarantees of Umbra, the most widely used implementation of\nthe stealth address scheme on Ethereum, and its three off-chain scalability\nsolutions, e.g., Arbitrum, Optimism, and Polygon. We define and evaluate four\nheuristics to uncover the real recipients of stealth payments. We find that for\nthe majority of Umbra payments, it is straightforward to establish the\nrecipient, hence nullifying the benefits of using Umbra. Specifically, we find\nthe real recipient of $48.5\\%$, $25.8\\%$, $65.7\\%$, and $52.6\\%$ of all Umbra\ntransactions on the Ethereum main net, Polygon, Arbitrum, and Optimism\nnetworks, respectively. Finally, we suggest easily implementable\ncountermeasures to evade our deanonymization and linking attacks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:46:23 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 10:07:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kov\u00e1cs","Alex",""],["Seres","Istv\u00e1n Andr\u00e1s",""]]}
{"id":"2308.01704","submitter":"Tomoya Wakayama","authors":"Tomoya Wakayama, Shonosuke Sugasawa, Genya Kobayashi","title":"Similarity-based Random Partition Distribution for Clustering Functional\n  Data","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Random partitioned distribution is a powerful tool for model-based\nclustering. However, the implementation in practice can be challenging for\nfunctional spatial data such as hourly observed population data observed in\neach region. The reason is that high dimensionality tends to yield excess\nclusters, and spatial dependencies are challenging to represent with a simple\nrandom partition distribution (e.g., the Dirichlet process). This paper\naddresses these issues by extending the generalized Dirichlet process to\nincorporate pairwise similarity information, which we call the similarity-based\ngeneralized Dirichlet process (SGDP), and provides theoretical justification\nfor this approach. We apply SGDP to hourly population data observed in 500m\nmeshes in Tokyo, and demonstrate its usefulness for functional clustering by\ntaking account of spatial information.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:49:09 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wakayama","Tomoya",""],["Sugasawa","Shonosuke",""],["Kobayashi","Genya",""]]}
{"id":"2308.01705","submitter":"Marcin Wnuk","authors":"Robert Kunsch, Erich Novak, Marcin Wnuk","title":"Randomized approximation of summable sequences -- adaptive and\n  non-adaptive","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.FA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove lower bounds for the randomized approximation of the embedding\n$\\ell_1^m \\rightarrow \\ell_\\infty^m$ based on algorithms that use arbitrary\nlinear (hence non-adaptive) information provided by a (randomized) measurement\nmatrix $N \\in \\mathbb{R}^{n \\times m}$. These lower bounds reflect the\nincreasing difficulty of the problem for $m \\to \\infty$, namely, a term\n$\\sqrt{\\log m}$ in the complexity $n$. This result implies that non-compact\noperators between arbitrary Banach spaces are not approximable using\nnon-adaptive Monte Carlo methods. We also compare these lower bounds for\nnon-adaptive methods with upper bounds based on adaptive, randomized methods\nfor recovery for which the complexity $n$ only exhibits a $(\\log\\log\nm)$-dependence. In doing so we give an example of linear problems where the\nerror for adaptive vs. non-adaptive Monte Carlo methods shows a gap of order\n$n^{1/2} ( \\log n)^{-1/2}$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:57:35 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 11:45:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kunsch","Robert",""],["Novak","Erich",""],["Wnuk","Marcin",""]]}
{"id":"2308.01706","submitter":"Hamza Ounesli","authors":"Hamza Ounesli","title":"C1-genericity of unbounded distortion for ergodic conservative expanding\n  circle maps","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 within the space of ergodic Lebesgue-preserving C1 expanding\nmaps of the circle, unbounded distortion is C1-generic.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:58:30 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ounesli","Hamza",""]]}
{"id":"2308.01707","submitter":"Julian Wiederer","authors":"Julian Wiederer, Julian Schmidt, Ulrich Kressel, Klaus Dietmayer,\n  Vasileios Belagiannis","title":"Joint Out-of-Distribution Detection and Uncertainty Estimation for\n  Trajectory Prediction","comments":"Accepted to the 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the significant research efforts on trajectory prediction for\nautomated driving, limited work exists on assessing the prediction reliability.\nTo address this limitation we propose an approach that covers two sources of\nerror, namely novel situations with out-of-distribution (OOD) detection and the\ncomplexity in in-distribution (ID) situations with uncertainty estimation. We\nintroduce two modules next to an encoder-decoder network for trajectory\nprediction. Firstly, a Gaussian mixture model learns the probability density\nfunction of the ID encoder features during training, and then it is used to\ndetect the OOD samples in regions of the feature space with low likelihood.\nSecondly, an error regression network is applied to the encoder, which learns\nto estimate the trajectory prediction error in supervised training. During\ninference, the estimated prediction error is used as the uncertainty. In our\nexperiments, the combination of both modules outperforms the prior work in OOD\ndetection and uncertainty estimation, on the Shifts robust trajectory\nprediction dataset by $2.8 \\%$ and $10.1 \\%$, respectively. The code is\npublicly available.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:59:38 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 11:53:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wiederer","Julian",""],["Schmidt","Julian",""],["Kressel","Ulrich",""],["Dietmayer","Klaus",""],["Belagiannis","Vasileios",""]]}
{"id":"2308.01708","submitter":"Ivan Christov","authors":"Ivan P. Christov","title":"Local entanglement of electrons in 1D hydrogen molecule","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 entanglement entropy of the electrons in one-dimensional hydrogen\nmolecule is quantified locally using an appropriate partitioning of the\ntwo-dimensional configuration space. Both the global and the local entanglement\nentropy exhibit a monotonic increase when increasing the inter-nuclear\ndistance, while the local entropy remains peaked at the middle between the\nnuclei with its width decreasing. Our findings show that at the inter-nuclear\ndistance where stable hydrogen molecule is formed, the quantum entropy shows no\npeculiarity thus indicating that the entropy and the energy measures display\ndifferent sensitivity with respect to the interaction between the two electrons\ninvolved. One possible explanation is that the calculation of the quantum\nentropy does not account for explicitly the distance between the nuclei, which\ncontrasts to the total energy calculation where the energy minimum depends\ndecisively on that distance. The numerically exact and the time-dependent\nquantum Monte Carlo calculations show close results.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:01:34 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Christov","Ivan P.",""]]}
{"id":"2308.01709","submitter":"Harsh Narola","authors":"Harsh Narola, Justin Janquart, Le\\\"ila Haegel, K. Haris, Otto A.\n  Hannuksela, Chris Van Den Broeck","title":"How well can modified gravitational wave propagation be constrained with\n  strong lensing?","comments":"Arxiv submission","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strong gravitational lensing produces multiple images of a gravitational wave\n(GW) signal, which can be observed by detectors as time-separated copies of the\nsame event. It has been shown that under favourable circumstances, by combining\ninformation from a quadruply lensed GW with electromagnetic observations of\nlensed galaxies, it is possible to identify the host galaxy of a binary black\nhole coalescence. Comparing the luminosity distance obtained through\nelectromagnetic means with the effective luminosity distance inferred from the\nlensed GW signal would then enable us to constrain alternative theories of\ngravity that allow for modified GW propagation. Here we analyze models\nincluding large extra spatial dimensions, a running Planck mass, and a model\nthat captures propagation effects occurring in a variety of alternative\ntheories to general relativity. We consider a plausible population of lenses\nand binary black holes and use Bayesian inference on simulated GW signals as\nseen in current detectors at design sensitivity, to arrive at a realistic\nassessment of the bounds that could be placed. We find that, due to the fact\nthat the sources of lensed events will typically be at much larger redshifts,\nthis method can improve over bounds from GW170817 and its electromagnetic\ncounterpart by a factor of $\\sim 5$ to $\\mathcal{O}(10^2)$, depending on the\nalternative gravity model.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:08:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Narola","Harsh",""],["Janquart","Justin",""],["Haegel","Le\u00efla",""],["Haris","K.",""],["Hannuksela","Otto A.",""],["Broeck","Chris Van Den",""]]}
{"id":"2308.01710","submitter":"Megan Lewis","authors":"M.O. Lewis, R. Bhattacharya, L.O. Sjouwerman, Y. M. Pihlstr\\\"om, G.\n  Pietrzy\\'nski, R. Sahai, P. Karczmarek, M. G\\'orski","title":"Long-period maser-bearing Miras in the Galactic center:\n  period-luminosity relations and extinction estimates","comments":"14 pages, 10 figures; accepted to A&A","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":"  We establish a sample of 370 Mira variables that are likely near the Galactic\ncenter (GC). The sources have been selected from the OGLE and BAaDE surveys\nbased on their sky coordinates, OGLE classifications, and BAaDE maser-derived\nline-of-sight velocities. As the distance to the GC is known to a high\naccuracy, this sample is a test bed for reddening and extinction studies toward\nthe GC and in Mira envelopes. We calculated separate interstellar- and\ncircumstellar-extinction values for individual sources, showing that there is a\nwide range of circumstellar extinction values (up to four magnitudes in the\nK$_s$ band) in the sample, and that circumstellar reddening is statistically\ndifferent from interstellar reddening laws. Further, the reddening laws in the\ncircumstellar environments of our sample and the circumstellar environments of\nLarge Magellanic Cloud (LMC) Miras are strikingly similar despite the different\nmetallicities of the samples. Period-magnitude relations for the mid-infrared\n(MIR) WISE and MSX bands are also explored, and in the WISE bands we compare\nthese to period-magnitude relationships derived from Miras in the LMC as it is\nimportant to compare these LMC relations to those in a higher metallicity\nenvironment. Emission from the envelope itself may contaminate MIR magnitudes\naltering the relations, especially for sources with thick envelopes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:08:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lewis","M. O.",""],["Bhattacharya","R.",""],["Sjouwerman","L. O.",""],["Pihlstr\u00f6m","Y. M.",""],["Pietrzy\u0144ski","G.",""],["Sahai","R.",""],["Karczmarek","P.",""],["G\u00f3rski","M.",""]]}
{"id":"2308.01711","submitter":"Shinnosuke Koyama","authors":"Shinnosuke Koyama, Joji Nasu","title":"Flavor-wave theory with quasiparticle damping at finite temperatures:\n  Application to chiral edge modes in the Kitaev model","comments":"19 pages, 10 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 propose a theoretical framework to investigate elementary excitations at\nfinite temperatures within a localized electron model that describes the\ninteractions between multiple degrees of freedom, such as quantum spin models\nand Kugel-Khomskii models. Thus far, their excitation structures have been\nmainly examined using the linear flavor-wave theory, an SU($N$) generalization\nof the linear spin-wave theory. These techniques introduce noninteracting\nbosonic quasiparticles as elementary excitations from the ground state, thereby\nelucidating numerous physical phenomena, including excitation spectra and\ntransport properties characterized by topologically nontrivial band structures.\nNevertheless, the interactions between quasiparticles cannot be ignored in\nsystems exemplified by $S=1/2$ quantum spin models, where strong quantum\nfluctuations are present. Recent studies have investigated the effects of\nquasiparticle damping at zero temperature in such models. In our study,\nextending this approach to the flavor-wave theory for general localized\nelectron models, we construct a comprehensive method to calculate excitation\nspectra with the quasiparticle damping at finite temperatures. We apply our\nmethod to the Kitaev model under magnetic fields, a typical example of models\nwith topologically nontrivial magnon bands. Our calculations reveal that chiral\nedge modes undergo significant damping in weak magnetic fields, amplifying the\ndamping rate by the temperature increase. This effect is caused by collisions\nwith thermally excited quasiparticles. Since our approach starts from a general\nHamiltonian, it will be widely applicable to other localized systems, such as\nspin-orbital coupled systems derived from multi-orbital Hubbard models in the\nstrong correlation limit.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:11:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Koyama","Shinnosuke",""],["Nasu","Joji",""]]}
{"id":"2308.01712","submitter":"Reginald Christian Bernardo","authors":"Stephen Appleby and Reginald Christian Bernardo","title":"Tadpole Cosmology: Milne Solution as a Cosmological Constant Hideout","comments":"20 pages + refs, 4 figures, comments welcome","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":"  Dynamical cancellation frameworks present a potential means of mitigating the\neffect of a large vacuum energy, that would otherwise ruin the late-time, low\nenergy dynamics of the Universe. Certain models in the literature, such as the\nFab Four and Well Tempering, realize this idea by introducing some degeneracy\nin the dynamical equations. In this paper, we introduce a third potential route\nto self-tuning, and infer the existence of a new, exact Milne solution in the\nsimplest tadpole plus cubic-Galileon scalar-tensor theory. We study the\ndynamics of the scalar field and metric in the vicinity of the Milne coordinate\nsingularity, and find that the vacuum solution belongs to a more general family\nof Milne-like metrics. By numerically evolving the field equations for a range\nof initial conditions, we show that the Milne solution is not an attractor, and\nvarying the initial scalar field data can lead to completely different\nasymptotic states; exponential growth of the scale factor, a static\nnon-spatially flat metric or a severe finite-time instability in the scalar\nfield and metric. We generalise the Milne solution to a class of FLRW\nspacetimes, finding that the tadpole-cubic Galileon model admits\nperfect-fluid-like solutions in the presence of matter. Finally, we present a\nsecond Horndeski model which also admits an exact Milne solution, hinting at\nthe existence of a larger undiscovered model space containing\nvacuum-energy-screened solutions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:11:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Appleby","Stephen",""],["Bernardo","Reginald Christian",""]]}
{"id":"2308.01713","submitter":"Roberto Rojas-Cessa","authors":"Roberto Rojas-Cessa","title":"Experiments on Computer Networks: Quickly Knowing the Protocols in the\n  TCP/IP Suite","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Manual of practical experiments on protocols used in the Internet or TCP/IP\nSuite. This manual is a collection of experiments that have been used in\nundergraduate and graduate courses taught at New Jersey Institute of Technology\nfor a few years (ECE429 and ECE637). The manual is updated periodically to\naccommodate emerging needs and technologies, including virtualization of the\nexperiments for their use during lockdowns as the one we experienced during the\nCOVID-19 pandemic in 2020 and part of 2021. The manual may be used by all those\ninterested in knowing and experiencing some of the basic protocols that run on\nthe Internet. The goal is to get some understanding on protocol design and not\nnecessarily on a particular software or operative system. Yet, the exercises\nwill give the interested person a practical perspective. Experiments are\ntargeted towards using Linux but most of them can also be performed on Windows\noperating systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:13:43 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 11:01:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Rojas-Cessa","Roberto",""]]}
{"id":"2308.01714","submitter":"George Biswas","authors":"George Biswas, Debasish Biswas, Anindya Biswas","title":"Fidelity and Entanglement of Random Bipartite Pure States: Insights and\n  Applications","comments":"6 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigated the fidelity of typical random bipartite pure states from a\nfixed quantum state and their bipartite entanglement. By plotting the fidelity\nand entanglement on perpendicular axes, we observed that the resulting plots\nexhibit non-uniform distributions and possess an upper bound. The shape of the\nupper bound curve depends on the entanglement of the fixed quantum state used\nto measure the fidelity of the random pure states. We find that the average\nfidelity of a randomly chosen fixed quantum state from typical random pure\nbipartite qubits is 0.250 within a narrow entanglement range. Furthermore, when\ninvestigating random pure product states, we find that their fidelity values\nfrom a fixed maximally entangled state are uniformly distributed between 0 and\n0.5. This finding opens possibilities for employing such systems as quantum\nrandom number generators. Expanding our study to higher dimensional bipartite\nqudits, we find that the average fidelity of typical random pure bipartite\nqudits from a randomly chosen quantum qudit remains constant within a narrow\nentanglement range. The values of these constants are different for different\ndimensional bipartite qudits. This observation suggests a consistent\nrelationship between entanglement and fidelity across different dimensions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:14:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Biswas","George",""],["Biswas","Debasish",""],["Biswas","Anindya",""]]}
{"id":"2308.01715","submitter":"Shang Li","authors":"Shang Li","title":"An equivariant compactification for adjoint reductive group schemes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wonderful compactifications of adjoint reductive groups over an algebraically\nclosed field play an important role in algebraic geometry and representation\ntheory. In this paper, we construct an equivariant compactification for adjoint\nreductive groups over arbitrary base schemes. Our compactifications\nparameterize classical wonderful compactifications of De Concini and Procesi as\ngeometric fibers. Our construction is based on a variant of the Artin-Weil\nmethod of birational group laws. In particular, our construction gives a new\nintrinsic construction of wonderful compactifications. The Picard group scheme\nof our compactifications is computed. We also discuss several applications of\nour compactification in the study of torsors under reductive group schemes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:15:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Shang",""]]}
{"id":"2308.01716","submitter":"Hugo Aramberri","authors":"Hugo Aramberri and Jorge \\'I\\~niguez","title":"Brownian electric bubble quasiparticles","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent works on electric bubbles (including the experimental demonstration of\nelectric skyrmions) constitute a breakthrough akin to the discovery of magnetic\nskyrmions some 15 years ago. So far research has focused on obtaining and\nvisualizing these objects, which often appear to be immobile (pinned) in\nexperiments. Thus, critical aspects of magnetic skyrmions - e.g., their\nquasiparticle nature, Brownian motion - remain unexplored (unproven) for\nelectric bubbles. Here we use predictive atomistic simulations to investigate\nthe basic dynamical properties of these objects in pinning-free model systems.\nWe show that it is possible to find regimes where the electric bubbles can\npresent long lifetimes ($\\sim$ ns) despite being relatively small ($\\varnothing\n<$ 2 nm). Additionally, we find that they can display stochastic dynamics with\nlarge and highly tunable diffusion constants. We thus establish the\nquasiparticle nature of electric bubbles and put them forward for the physical\neffects and applications (e.g., in token-based Probabilistic Computing)\nconsidered for magnetic skyrmions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:16:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Aramberri","Hugo",""],["\u00cd\u00f1iguez","Jorge",""]]}
{"id":"2308.01717","submitter":"Ki-Hong Lee","authors":"Minseok Cho, Sunjin Choi, Ki-Hong Lee, Jaewon Song","title":"Supersymmetric Cardy Formula and the Weak Gravity Conjecture in AdS/CFT","comments":"25 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"KIAS-P23032","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Weak Gravity Conjecture (WGC) in anti-de Sitter spacetime (AdS) asserts\nthe existence of an operator in the boundary conformal field theory (CFT) whose\nscaling dimension-to-charge ratio satisfies a certain upper bound. This bound\nis specified by the ratio of the conformal central charge $c$ and the flavor\ncentral charge $k_F$. We propose a modified bound in AdS5/CFT4, determined by a\ncombination of two central charges $3c-2a$ instead of $c$. This combination\narises in the Cardy-like limit of the 4d superconformal index, which captures\nthe Bekenstein-Hawking entropy of large BPS black holes in AdS5. Using the new\nbound, we find that certain superconformal field theories (SCFTs) that are\npreviously thought to violate the AdS WGC, including SQCDs in the conformal\nwindow, do satisfy the WGC. We check this version of the WGC against all\npossible superconformal gauge theories with SU(N) gauge group admitting a large\nN limit when the superpotential is absent. We conjecture the modified version\nof the WGC is a generic property of any 4d SCFT, regardless of the existence of\na weakly coupled gravity dual or a large N limit.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:19:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cho","Minseok",""],["Choi","Sunjin",""],["Lee","Ki-Hong",""],["Song","Jaewon",""]]}
{"id":"2308.01718","submitter":"Hideya Watanabe","authors":"Hideya Watanabe","title":"Symplectic tableaux and quantum symmetric pairs","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide a new branching rule from the general linear group\n$GL_{2n}(\\mathbb{C})$ to the symplectic group $Sp_{2n}(\\mathbb{C})$ by\nestablishing a simple algorithm which gives rise to a bijection from the set of\nsemistandard tableaux of a fixed shape to a disjoint union of several copies of\nsets of symplectic tableaux of various shapes. The algorithm arises from\nrepresentation theory of a quantum symmetric pair of type\n$A\\mathrm{II}_{2n-1}$, which is a $q$-analogue of the classical symmetric pair\n$(\\mathfrak{gl}_{2n}(\\mathbb{C}), \\mathfrak{sp}_{2n}(\\mathbb{C}))$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:22:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Watanabe","Hideya",""]]}
{"id":"2308.01719","submitter":"James Meech","authors":"James T. Meech, Vasileios Tsoutsouras, and Phillip Stanley-Marbell","title":"The Data Movement Bottleneck: Theoretical Shortcomings of Analog Optical\n  Fourier Transform and Convolution Computing Accelerators","comments":"10 pages, 7 figures and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern computing tasks are constrained to having digital electronic input and\noutput data. Due to these constraints imposed by the user, any analog computing\naccelerator must perform an analog-to-digital conversion on its input data and\na subsequent digital-to-analog conversion on its output data. To avoid this the\nanalog hardware would need to completely replace the full functionality of\ntraditional digital electronic computer hardware. Using 27 empirically-measured\nbenchmarks we estimate that an ideal optical accelerator that accelerates\nFourier transforms and convolutions can produce an average speedup of 9.4\ntimes, and a median speedup of 1.9 times for the set of benchmarks. The maximum\nspeedups achieved were 45.3 times for a pure Fourier transform and 159.4 times\nfor a pure convolution. These results show that an optical accelerator only\nproduces significant speedup for applications consisting exclusively of Fourier\ntransforms and convolutions. In addition to the theoretical results we quantify\nthe data movement bottleneck which causes a 23.8 times slowdown in a prototype\noptical Fourier transform accelerator which we built from widely-available\noff-the-shelf parts.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:25:33 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Meech","James T.",""],["Tsoutsouras","Vasileios",""],["Stanley-Marbell","Phillip",""]]}
{"id":"2308.01720","submitter":"Valentin John","authors":"Valentin John, Francesco Borsoi, Zolt\\'an Gy\\\"orgy, Chien-An Wang,\n  G\\'abor Sz\\'echenyi, Floor van Riggelen, William I. L. Lawrie, Nico W.\n  Hendrickx, Amir Sammak, Giordano Scappucci, Andr\\'as P\\'alyi, Menno Veldhorst","title":"Bichromatic Rabi control of semiconductor qubits","comments":"5 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":"  Electrically-driven spin resonance is a powerful technique for controlling\nsemiconductor spin qubits. However, it faces challenges in qubit addressability\nand off-resonance driving in larger systems. We demonstrate coherent\nbichromatic Rabi control of quantum dot hole spin qubits, offering a\nspatially-selective approach for large qubit arrays. By applying simultaneous\nmicrowave bursts to different gate electrodes, we observe multichromatic\nresonance lines and resonance anticrossings that are caused by the ac Stark\nshift. Our theoretical framework aligns with experimental data, highlighting\ninterdot motion as the dominant mechanism for bichromatic driving.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:26:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["John","Valentin",""],["Borsoi","Francesco",""],["Gy\u00f6rgy","Zolt\u00e1n",""],["Wang","Chien-An",""],["Sz\u00e9chenyi","G\u00e1bor",""],["van Riggelen","Floor",""],["Lawrie","William I. L.",""],["Hendrickx","Nico W.",""],["Sammak","Amir",""],["Scappucci","Giordano",""],["P\u00e1lyi","Andr\u00e1s",""],["Veldhorst","Menno",""]]}
{"id":"2308.01721","submitter":"Shichao Dong","authors":"Shichao Dong, Guosheng Lin","title":"Weakly Supervised 3D Instance Segmentation without Instance-level\n  Annotations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D semantic scene understanding tasks have achieved great success with the\nemergence of deep learning, but often require a huge amount of manually\nannotated training data. To alleviate the annotation cost, we propose the first\nweakly-supervised 3D instance segmentation method that only requires\ncategorical semantic labels as supervision, and we do not need instance-level\nlabels. The required semantic annotations can be either dense or extreme sparse\n(e.g. 0.02% of total points). Even without having any instance-related\nground-truth, we design an approach to break point clouds into raw fragments\nand find the most confident samples for learning instance centroids.\nFurthermore, we construct a recomposed dataset using pseudo instances, which is\nused to learn our defined multilevel shape-aware objectness signal. An\nasymmetrical object inference algorithm is followed to process core points and\nboundary points with different strategies, and generate high-quality pseudo\ninstance labels to guide iterative training. Experiments demonstrate that our\nmethod can achieve comparable results with recent fully supervised methods. By\ngenerating pseudo instance labels from categorical semantic labels, our\ndesigned approach can also assist existing methods for learning 3D instance\nsegmentation at reduced annotation cost.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:30:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dong","Shichao",""],["Lin","Guosheng",""]]}
{"id":"2308.01722","submitter":"Juergen Lerner","authors":"J\\\"urgen Lerner, Marian-Gabriel H\\^ancean, and Alessandro Lomi","title":"Relational hyperevent models for the coevolution of coauthoring and\n  citation networks","comments":"Preprint of a submitted manuscript","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interest in the network analysis of bibliographic data has increased\nsignificantly in recent years. Yet, appropriate statistical models for\nexamining the full dynamics of scientific citation networks, connecting authors\nto the papers they write and papers to other papers they cite, are not\navailable. Very few studies exist that have examined how the social network\nbetween co-authors and the citation network among the papers shape one another\nand co-evolve. In consequence, our understanding of scientific citation\nnetworks remains incomplete. In this paper we extend recently derived\nrelational hyperevent models (RHEM) to the analysis of scientific networks,\nproviding a general framework to model the multiple dependencies involved in\nthe relation linking multiple authors to the papers they write, and papers to\nthe multiple references they cite. We demonstrate the empirical value of our\nmodel in an analysis of publicly available data on a scientific network\ncomprising millions of authors and papers and assess the relative strength of\nvarious effects explaining scientific production. We outline the implications\nof the model for the evaluation of scientific research.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:31:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lerner","J\u00fcrgen",""],["H\u00e2ncean","Marian-Gabriel",""],["Lomi","Alessandro",""]]}
{"id":"2308.01723","submitter":"Serafim Teknowijoyo","authors":"P. Abramian, A. Kuzanyan, V. Nikoghosyan, S. Teknowijoyo and A. Gulian","title":"Some remarks on possible superconductivity of composition\n  Pb$_9$CuP$_6$O$_{25}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A material called LK-99, a modified-lead apatite crystal structure with the\ncomposition Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O ($0.9<x<1.1$) has been reported to\nbe an above-room-temperature superconductor at ambient pressure. It is hard to\nexpect that it will be straightforward for other groups to reproduce the\noriginal results. We provide here some remarks which may be helpful for a\nsuccess.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:32:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Abramian","P.",""],["Kuzanyan","A.",""],["Nikoghosyan","V.",""],["Teknowijoyo","S.",""],["Gulian","A.",""]]}
{"id":"2308.01724","submitter":"Tomoya Wakayama","authors":"Tomoya Wakayama, Hidetoshi Matsui","title":"Functional Data Regression Reconciles with Excess Bases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the development of measuring instruments and computers has accelerated the\ncollection of massive data, functional data analysis (FDA) has gained a surge\nof attention. FDA is a methodology that treats longitudinal data as a function\nand performs inference, including regression. Functionalizing data typically\ninvolves fitting it with basis functions. However, the number of these\nfunctions smaller than the sample size is selected commonly. This paper casts\ndoubt on this convention. Recent statistical theory has witnessed a phenomenon\n(the so-called double descent) in which excess parameters overcome overfitting\nand lead to precise interpolation. If we transfer this idea to the choice of\nthe number of bases for functional data, providing an excess number of bases\ncan lead to accurate predictions. We have explored this phenomenon in a\nfunctional regression problem and examined its validity through numerical\nexperiments. In addition, through application to real-world datasets, we\ndemonstrated that the double descent goes beyond just theoretical and numerical\nexperiments - it is also important for practical use.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:32:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wakayama","Tomoya",""],["Matsui","Hidetoshi",""]]}
{"id":"2308.01725","submitter":"Iana Zhura","authors":"Iana Zhura, Denis Davletshin, Nipun Dhananjaya Weerakkodi Mudalige,\n  Aleksey Fedoseev, Robinroy Peter and Dzmitry Tsetserukou","title":"NeuroSwarm: Multi-Agent Neural 3D Scene Reconstruction and Segmentation\n  with UAV for Optimal Navigation of Quadruped Robot","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quadruped robots have the distinct ability to adapt their body and step\nheight to navigate through cluttered environments. Nonetheless, for these\nrobots to utilize their full potential in real-world scenarios, they require\nawareness of their environment and obstacle geometry. We propose a novel\nmulti-agent robotic system that incorporates cutting-edge technologies. The\nproposed solution features a 3D neural reconstruction algorithm that enables\nnavigation of a quadruped robot in both static and semi-static environments.\nThe prior areas of the environment are also segmented according to the\nquadruped robots' abilities to pass them. Moreover, we have developed an\nadaptive neural field optimal motion planner (ANFOMP) that considers both\ncollision probability and obstacle height in 2D space.Our new navigation and\nmapping approach enables quadruped robots to adjust their height and behavior\nto navigate under arches and push through obstacles with smaller dimensions.\nThe multi-agent mapping operation has proven to be highly accurate, with an\nobstacle reconstruction precision of 82%. Moreover, the quadruped robot can\nnavigate with 3D obstacle information and the ANFOMP system, resulting in a\n33.3% reduction in path length and a 70% reduction in navigation time.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:33:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhura","Iana",""],["Davletshin","Denis",""],["Mudalige","Nipun Dhananjaya Weerakkodi",""],["Fedoseev","Aleksey",""],["Peter","Robinroy",""],["Tsetserukou","Dzmitry",""]]}
{"id":"2308.01726","submitter":"Alexander Cherny Yu.","authors":"Alexander Yu. Cherny, Eugen M. Anitas, Artem A. Vladimirov, and\n  Vladimir A. Osipov","title":"Dense Random Packing of Disks With a Power-Law Size Distribution in\n  Thermodynamic Limit: Fractal-like Properties","comments":"6 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":"  The correlation properties of a dense random system of disks with a power-law\nsize distribution are analyzed in momentum space in the thermodynamic limit.\nThe limit assumes that the total number the disks increases infinitely, while\nthe mean density of the disk centers and the range of the size distribution are\nkept constant. The structure factor dependence on momentum transfer is\ninvestigated for various numbers of disks and extrapolated to the thermodynamic\nlimit. The fractal power-law decay of the structure factor is recovered in\nmomentum space within the fractal range, which corresponds to the range of the\nsize distribution in real space. The fractal exponent coincides with the\nexponent of the power-law size distribution as was shown previously by the\nauthors [Cherny, Anitas, Osipov, J. Chem. Phys. 158 (4), 044114 (2023)]. The\nfinite-size effects are also studied at very small momentum of order of the\ninverse system size. We show that the structure factor is parabolic in this\nregion and calculate the prefactor analytically. The obtained results reveal\nfractal-like properties of the packing. Our findings can be used to analyze\nsmall-angle scattering from such systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:33:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cherny","Alexander Yu.",""],["Anitas","Eugen M.",""],["Vladimirov","Artem A.",""],["Osipov","Vladimir A.",""]]}
{"id":"2308.01727","submitter":"Cody Bumgardner","authors":"V. K. Cody Bumgardner, Aaron Mullen, Sam Armstrong, Caylin Hickey, and\n  Jeff Talbert","title":"Local Large Language Models for Complex Structured Medical Tasks","comments":"12 pages, Preprint of an article submitted for consideration in\n  Pacific Symposium on Biocomputing \\c{opyright} 2024 copyright World\n  Scientific Publishing Company https://www.worldscientific.com/","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 paper introduces an approach that combines the language reasoning\ncapabilities of large language models (LLMs) with the benefits of local\ntraining to tackle complex, domain-specific tasks. Specifically, the authors\ndemonstrate their approach by extracting structured condition codes from\npathology reports. The proposed approach utilizes local LLMs, which can be\nfine-tuned to respond to specific generative instructions and provide\nstructured outputs. The authors collected a dataset of over 150k uncurated\nsurgical pathology reports, containing gross descriptions, final diagnoses, and\ncondition codes. They trained different model architectures, including LLaMA,\nBERT and LongFormer and evaluated their performance. The results show that the\nLLaMA-based models significantly outperform BERT-style models across all\nevaluated metrics, even with extremely reduced precision. The LLaMA models\nperformed especially well with large datasets, demonstrating their ability to\nhandle complex, multi-label tasks. Overall, this work presents an effective\napproach for utilizing LLMs to perform domain-specific tasks using accessible\nhardware, with potential applications in the medical domain, where complex data\nextraction and classification are required.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:36:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bumgardner","V. K. Cody",""],["Mullen","Aaron",""],["Armstrong","Sam",""],["Hickey","Caylin",""],["Talbert","Jeff",""]]}
{"id":"2308.01728","submitter":"Christian Boehmer","authors":"Christian G. Boehmer, Erik Jensko","title":"A new 2D limit of general relativity","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is well known that the Einstein-Hilbert action in two dimensions is\ntopological and yields an identically vanishing Einstein tensor. Consequently\none is faced with difficulties when formulating a non-trivial gravity model. We\npresent a new, intrinsically two-dimensional, approach to this problem based on\nthe Einstein action. This yields a well defined variational approach which\nresults in new field equations that break diffeomorphism invariance. Our\nproposed approach does not require the introduction of additional scalar\nfields, nor the use of conformal transformations. However, we can show how\nincluding conformal counter terms leads to equivalent results. In doing so, we\ncan provide an explanation for why previous approaches worked. Solutions to the\nfield equations are briefly discussed.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:38:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Boehmer","Christian G.",""],["Jensko","Erik",""]]}
{"id":"2308.01729","submitter":"Francis Duval","authors":"Francis Duval, Jean-Philippe Boucher, Mathieu Pigeon","title":"Telematics Combined Actuarial Neural Networks for Cross-Sectional and\n  Longitudinal Claim Count Data","comments":"30 pages, 10 tables, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present novel cross-sectional and longitudinal claim count models for\nvehicle insurance built upon the Combined Actuarial Neural Network (CANN)\nframework proposed by Mario W\\\"uthrich and Michael Merz. The CANN approach\ncombines a classical actuarial model, such as a generalized linear model, with\na neural network. This blending of models results in a two-component model\ncomprising a classical regression model and a neural network part. The CANN\nmodel leverages the strengths of both components, providing a solid foundation\nand interpretability from the classical model while harnessing the flexibility\nand capacity to capture intricate relationships and interactions offered by the\nneural network. In our proposed models, we use well-known log-linear claim\ncount regression models for the classical regression part and a multilayer\nperceptron (MLP) for the neural network part. The MLP part is used to process\ntelematics car driving data given as a vector characterizing the driving\nbehavior of each insured driver. In addition to the Poisson and negative\nbinomial distributions for cross-sectional data, we propose a procedure for\ntraining our CANN model with a multivariate negative binomial (MVNB)\nspecification. By doing so, we introduce a longitudinal model that accounts for\nthe dependence between contracts from the same insured. Our results reveal that\nthe CANN models exhibit superior performance compared to log-linear models that\nrely on manually engineered telematics features.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:40:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Duval","Francis",""],["Boucher","Jean-Philippe",""],["Pigeon","Mathieu",""]]}
{"id":"2308.01730","submitter":"Aritra Kumar Gon","authors":"Aritra Kumar Gon and Rishi Khatri","title":"The pairwise and cross-pairwise y-type polarised kinetic Sunyaev\n  Zeldovich effect from transverse velocity of galaxy clusters","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 develop a new theoretical framework for studying the pairwise and\ncross-pairwise polarised kinetic Sunyaev Zeldovich (pkSZ) effect arising from\nthe transverse peculiar velocity of galaxy clusters. The pkSZ effect is second\norder in peculiar velocities and has a spectrum that can be decomposed into\ny-type and blackbody components, whereas the unpolarised linear kSZ effect has\nonly the blackbody component. Thus, the detectability of the pkSZ effect\ndepends only on the sensitivity and the number of frequency channels of the\nsurvey and not on the other primary and secondary CMB anisotropies. We consider\npairing of clusters with other clusters as well as cross-pairing of clusters\nwith galaxies from spectroscopic galaxy surveys. The pairwise pkSZ signal is a\nfunction of intra-pair spatial separation. We develop and compare estimators of\nthe pairwise pkSZ effect and study the detectability of the pairwise signal\nwith cluster catalogs consisting of a few hundred thousand clusters expected\nfrom surveys such as eROSITA and CMB-S4. We find that cross-pairing clusters\nwith galaxies from a large overlapping spectroscopic survey having a few\n$\\mathrm{billion}$ galaxies will enable us to detect the pairwise pkSZ effect\nwith CMB-S4. The pairwise pkSZ effect will thus open up a new window into the\nlarge-scale structure of the Universe in the coming decades.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:42:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gon","Aritra Kumar",""],["Khatri","Rishi",""]]}
{"id":"2308.01731","submitter":"Katar\\'ina T\\'othov\\'a","authors":"Katar\\'ina T\\'othov\\'a, \\v{L}ubor Ladick\\'y, Daniel Thul, Marc\n  Pollefeys, Ender Konukoglu","title":"Quantification of Predictive Uncertainty via Inference-Time Sampling","comments":null,"journal-ref":"Lecture Notes in Computer Science, vol 13563. Springer, Cham, 2022","doi":"10.1007/978-3-031-16749-2_2","report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predictive variability due to data ambiguities has typically been addressed\nvia construction of dedicated models with built-in probabilistic capabilities\nthat are trained to predict uncertainty estimates as variables of interest.\nThese approaches require distinct architectural components and training\nmechanisms, may include restrictive assumptions and exhibit overconfidence,\ni.e., high confidence in imprecise predictions. In this work, we propose a\npost-hoc sampling strategy for estimating predictive uncertainty accounting for\ndata ambiguity. The method can generate different plausible outputs for a given\ninput and does not assume parametric forms of predictive distributions. It is\narchitecture agnostic and can be applied to any feed-forward deterministic\nnetwork without changes to the architecture or training procedure. Experiments\non regression tasks on imaging and non-imaging input data show the method's\nability to generate diverse and multi-modal predictive distributions, and a\ndesirable correlation of the estimated uncertainty with the prediction error.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:43:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["T\u00f3thov\u00e1","Katar\u00edna",""],["Ladick\u00fd","\u013dubor",""],["Thul","Daniel",""],["Pollefeys","Marc",""],["Konukoglu","Ender",""]]}
{"id":"2308.01732","submitter":"Christian Jilek","authors":"Christian Jilek, Markus Schr\\\"oder, Heiko Maus, Sven Schwarz, Andreas\n  Dengel","title":"Towards Self-organizing Personal Knowledge Assistants in Evolving\n  Corporate Memories","comments":"73 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a retrospective overview of a decade of research in our\ndepartment towards self-organizing personal knowledge assistants in evolving\ncorporate memories. Our research is typically inspired by real-world problems\nand often conducted in interdisciplinary collaborations with research and\nindustry partners. We summarize past experiments and results comprising topics\nlike various ways of knowledge graph construction in corporate and personal\nsettings, Managed Forgetting and (Self-organizing) Context Spaces as a novel\napproach to Personal Information Management (PIM) and knowledge work support.\nPast results are complemented by an overview of related work and some of our\nlatest findings not published so far. Last, we give an overview of our related\nindustry use cases including a detailed look into CoMem, a Corporate Memory\nbased on our presented research already in productive use and providing\nchallenges for further research. Many contributions are only first steps in new\ndirections with still a lot of untapped potential, especially with regard to\nfurther increasing the automation in PIM and knowledge work support.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:48:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jilek","Christian",""],["Schr\u00f6der","Markus",""],["Maus","Heiko",""],["Schwarz","Sven",""],["Dengel","Andreas",""]]}
{"id":"2308.01733","submitter":"Ivan Prusak","authors":"Ivan Prusak, Davide Torlo, Monica Nonino, Gianluigi Rozza","title":"An optimisation-based domain-decomposition reduced order model for\n  parameter-dependent non-stationary fluid dynamics problems","comments":"arXiv admin note: substantial text overlap with arXiv:2211.14528","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we address parametric non-stationary fluid dynamics problems\nwithin a model order reduction setting based on domain decomposition. Starting\nfrom the domain decomposition approach, we derive an optimal control problem,\nfor which we present the convergence analysis. The snapshots for the\nhigh-fidelity model are obtained with the Finite Element discretisation, and\nthe model order reduction is then proposed both in terms of time and physical\nparameters, with a standard POD-Galerkin projection. We test the proposed\nmethodology on two fluid dynamics benchmarks: the non-stationary\nbackward-facing step and lid-driven cavity flow. Finally, also in view of\nfuture works, we compare the intrusive POD--Galerkin approach with a\nnon--intrusive approach based on Neural Networks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:52:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Prusak","Ivan",""],["Torlo","Davide",""],["Nonino","Monica",""],["Rozza","Gianluigi",""]]}
{"id":"2308.01734","submitter":"Xiangyu Peng","authors":"Zexin Chen, Eric Zhou, Kenneth Eaton, Xiangyu Peng, Mark Riedl","title":"Ambient Adventures: Teaching ChatGPT on Developing Complex Stories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Imaginative play is an area of creativity that could allow robots to engage\nwith the world around them in a much more personified way. Imaginary play can\nbe seen as taking real objects and locations and using them as imaginary\nobjects and locations in virtual scenarios. We adopted the story generation\ncapability of large language models (LLMs) to obtain the stories used for\nimaginary play with human-written prompts. Those generated stories will be\nsimplified and mapped into action sequences that can guide the agent in\nimaginary play. To evaluate whether the agent can successfully finish the\nimaginary play, we also designed a text adventure game to simulate a house as\nthe playground for the agent to interact.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:52:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chen","Zexin",""],["Zhou","Eric",""],["Eaton","Kenneth",""],["Peng","Xiangyu",""],["Riedl","Mark",""]]}
{"id":"2308.01735","submitter":"Martin Kreuzer","authors":"Martin Kreuzer and Alexei Miasnikov and Florian Walsh","title":"Decomposing Finite $\\mathbb{Z}$-Algebras","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.AC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For a finite $\\mathbb{Z}$-algebra $R$, i.e., for a ring which is not\nnecessarily associative or unitary, but whose additive group is finitely\ngenerated, we construct a decomposition of $R/{\\rm Ann}(R)$ into directly\nindecomposable factors under weak hypotheses. The method is based on\nconstructing and decomposing a ring of scalars $S$, and then lifting the\ndecomposition of $S$ to the bilinear map given by the multiplication of $R$,\nand finally to $R/{\\rm Ann}(R)$. All steps of the construction are given as\nexplicit algorithms and it is shown that the entire procedure has a\nprobabilistic polynomial time complexity in the bit size of the input, except\nfor the possible need to calculate the prime factorization of one integer. In\nparticular, in the case when ${\\rm Ann}(R) = 0$, these algorithms compute a\ndirect decomposition of $R$ into directly indecomposable factors.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:53:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kreuzer","Martin",""],["Miasnikov","Alexei",""],["Walsh","Florian",""]]}
{"id":"2308.01736","submitter":"Calum Robson","authors":"Calum Robson","title":"Sourceless Maxwell and Dirac equations via Clifford Analysis","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of complex functions is based around the study of holomorphic\nfunctions, satisfying the Cauchy-Riemann equations. The complex numbers are a\nsubset [the even subalgebra] of $Cl(2)$, and therefore we can ask whether there\nare analogues for the Cauchy-Riemann equations for other Clifford algebras.\nThis has been extensively explored under the name of Clifford Analysis. Here I\nexplicitly decompose the Cauchy-Riemann equations for a general Clifford\nalgebra into grades using the Geometric Algebra formalism,, and show that for\nthe Spacetime Algebra $Cl(3,1)$ these equations are the equations for a\nself-dual source free Electromagnetic field, and for a massless uncharged\nSpinor.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:54:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Robson","Calum",""]]}
{"id":"2308.01737","submitter":"Jianghao Lin","authors":"Jianghao Lin, Yanru Qu, Wei Guo, Xinyi Dai, Ruiming Tang, Yong Yu,\n  Weinan Zhang","title":"MAP: A Model-agnostic Pretraining Framework for Click-through Rate\n  Prediction","comments":"KDD 2023","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":"  With the widespread application of personalized online services,\nclick-through rate (CTR) prediction has received more and more attention and\nresearch. The most prominent features of CTR prediction are its multi-field\ncategorical data format, and vast and daily-growing data volume. The large\ncapacity of neural models helps digest such massive amounts of data under the\nsupervised learning paradigm, yet they fail to utilize the substantial data to\nits full potential, since the 1-bit click signal is not sufficient to guide the\nmodel to learn capable representations of features and instances. The\nself-supervised learning paradigm provides a more promising pretrain-finetune\nsolution to better exploit the large amount of user click logs, and learn more\ngeneralized and effective representations. However, self-supervised learning\nfor CTR prediction is still an open question, since current works on this line\nare only preliminary and rudimentary. To this end, we propose a Model-agnostic\npretraining (MAP) framework that applies feature corruption and recovery on\nmulti-field categorical data, and more specifically, we derive two practical\nalgorithms: masked feature prediction (MFP) and replaced feature detection\n(RFD). MFP digs into feature interactions within each instance through masking\nand predicting a small portion of input features, and introduces noise\ncontrastive estimation (NCE) to handle large feature spaces. RFD further turns\nMFP into a binary classification mode through replacing and detecting changes\nin input features, making it even simpler and more effective for CTR\npretraining. Our extensive experiments on two real-world large-scale datasets\n(i.e., Avazu, Criteo) demonstrate the advantages of these two methods on\nseveral strong backbones (e.g., DCNv2, DeepFM), and achieve new\nstate-of-the-art performance in terms of both effectiveness and efficiency for\nCTR prediction.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:55:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Jianghao",""],["Qu","Yanru",""],["Guo","Wei",""],["Dai","Xinyi",""],["Tang","Ruiming",""],["Yu","Yong",""],["Zhang","Weinan",""]]}
{"id":"2308.01738","submitter":"Yeying Jin","authors":"Yeying Jin, Beibei Lin, Wending Yan, Wei Ye, Yuan Yuan and Robby T.\n  Tan","title":"Enhancing Visibility in Nighttime Haze Images Using Guided APSF and\n  Gradient Adaptive Convolution","comments":"Accepted to ACMMM2023, https://github.com/jinyeying/nighttime_dehaze","journal-ref":"Published in ACMMM2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visibility in hazy nighttime scenes is frequently reduced by multiple\nfactors, including low light, intense glow, light scattering, and the presence\nof multicolored light sources. Existing nighttime dehazing methods often\nstruggle with handling glow or low-light conditions, resulting in either\nexcessively dark visuals or unsuppressed glow outputs. In this paper, we\nenhance the visibility from a single nighttime haze image by suppressing glow\nand enhancing low-light regions. To handle glow effects, our framework learns\nfrom the rendered glow pairs. Specifically, a light source aware network is\nproposed to detect light sources of night images, followed by the APSF (Angular\nPoint Spread Function)-guided glow rendering. Our framework is then trained on\nthe rendered images, resulting in glow suppression. Moreover, we utilize\ngradient-adaptive convolution, to capture edges and textures in hazy scenes. By\nleveraging extracted edges and textures, we enhance the contrast of the scene\nwithout losing important structural details. To boost low-light intensity, our\nnetwork learns an attention map, then adjusted by gamma correction. This\nattention has high values on low-light regions and low values on haze and glow\nregions. Extensive evaluation on real nighttime haze images, demonstrates the\neffectiveness of our method. Our experiments demonstrate that our method\nachieves a PSNR of 30.38dB, outperforming state-of-the-art methods by 13$\\%$ on\nGTA5 nighttime haze dataset. Our data and code is available at:\n\\url{https://github.com/jinyeying/nighttime_dehaze}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:58:23 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 17:05:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jin","Yeying",""],["Lin","Beibei",""],["Yan","Wending",""],["Ye","Wei",""],["Yuan","Yuan",""],["Tan","Robby T.",""]]}
{"id":"2308.01739","submitter":"Alexander Marynych","authors":"Zakaria Derbazi and Alexander Gnedin and Alexander Marynych","title":"Records in the Infinite Occupancy Scheme","comments":"23 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 classic infinite occupancy scheme, where balls are thrown in\nboxes independently, with probability $p_j$ of hitting box $j$. Each time a box\nreceives its first ball we speak of a record and, more generally, call an\n$r$-record every event when a box receives its $r$th ball. Assuming that the\nsequence $(p_j)$ is not decaying too fast, we show that after many balls have\nbeen thrown, the suitably scaled point process of $r$-record times is\napproximately Poisson. The joint convergence of $r$-record processes is argued\nunder a condition of regular variation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:00:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Derbazi","Zakaria",""],["Gnedin","Alexander",""],["Marynych","Alexander",""]]}
{"id":"2308.01740","submitter":"Chao Zhang Dr.","authors":"Linn\\'ea Andersson and Chao Zhang","title":"Molecular dynamics simulations of metal-electrolyte interfaces under\n  potential control","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 interfaces between metal electrodes and liquid electrolytes are\nprototypical in electrochemistry. That is why it is crucial to have a molecular\nand dynamical understating of such interfaces for both electrical properties\nand chemical reactivities under potential control. In this short review, we\nwill categorize different schemes for modelling electrified metal-electrolyte\ninterfaces used in molecular dynamics simulations. Our focus is on the\nsimilarities between seemingly different methods and their conceptual\nconnections in terms of relevant electrochemical quantities. Therefore, it can\nbe used as a guideline for developing new methods and building modularized\ncomputational protocols for simulating electrified interfaces.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:03:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Andersson","Linn\u00e9a",""],["Zhang","Chao",""]]}
{"id":"2308.01741","submitter":"Jagabondhu Hazra","authors":"Ayush Jain, Manikandan Padmanaban, Jagabondhu Hazra, Shantanu Godbole,\n  Kommy Weldemariam","title":"Supply chain emission estimation using large language models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large enterprises face a crucial imperative to achieve the Sustainable\nDevelopment Goals (SDGs), especially goal 13, which focuses on combating\nclimate change and its impacts. To mitigate the effects of climate change,\nreducing enterprise Scope 3 (supply chain emissions) is vital, as it accounts\nfor more than 90\\% of total emission inventories. However, tracking Scope 3\nemissions proves challenging, as data must be collected from thousands of\nupstream and downstream suppliers.To address the above mentioned challenges, we\npropose a first-of-a-kind framework that uses domain-adapted NLP foundation\nmodels to estimate Scope 3 emissions, by utilizing financial transactions as a\nproxy for purchased goods and services. We compared the performance of the\nproposed framework with the state-of-art text classification models such as\nTF-IDF, word2Vec, and Zero shot learning. Our results show that the\ndomain-adapted foundation model outperforms state-of-the-art text mining\ntechniques and performs as well as a subject matter expert (SME). The proposed\nframework could accelerate the Scope 3 estimation at Enterprise scale and will\nhelp to take appropriate climate actions to achieve SDG 13.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:06:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jain","Ayush",""],["Padmanaban","Manikandan",""],["Hazra","Jagabondhu",""],["Godbole","Shantanu",""],["Weldemariam","Kommy",""]]}
{"id":"2308.01742","submitter":"Zhiqiang Kou","authors":"Zhiqiang Kou jing wang yuheng jia xin geng","title":"Exploiting Multi-Label Correlation in Label Distribution Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Label Distribution Learning (LDL) is a novel machine learning paradigm that\nassigns label distribution to each instance. Many LDL methods proposed to\nleverage label correlation in the learning process to solve the\nexponential-sized output space; among these, many exploited the low-rank\nstructure of label distribution to capture label correlation. However, recent\nstudies disclosed that label distribution matrices are typically full-rank,\nposing challenges to those works exploiting low-rank label correlation. Note\nthat multi-label is generally low-rank; low-rank label correlation is widely\nadopted in multi-label learning (MLL) literature. Inspired by that, we\nintroduce an auxiliary MLL process in LDL and capture low-rank label\ncorrelation on that MLL rather than LDL. In such a way, low-rank label\ncorrelation is appropriately exploited in our LDL methods. We conduct\ncomprehensive experiments and demonstrate that our methods are superior to\nexisting LDL methods. Besides, the ablation studies justify the advantages of\nexploiting low-rank label correlation in the auxiliary MLL.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:06:45 GMT"}],"update_date":"2023-08-04","authors_parsed":[["geng","Zhiqiang Kou jing wang yuheng jia xin",""]]}
{"id":"2308.01743","submitter":"Franz Martin Rohrhofer","authors":"Stefan Posch, Clemens G\\\"o{\\ss}nitzer, Franz Rohrhofer, Bernhard C.\n  Geiger, Andreas Wimmer","title":"Finding the Optimum Design of Large Gas Engines Prechambers Using CFD\n  and Bayesian Optimization","comments":"9 pages. Part of Scientific Computing 2023 Conference Proceedings\n  (ISBN e-Book: 978-3-903318-20-5)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The turbulent jet ignition concept using prechambers is a promising solution\nto achieve stable combustion at lean conditions in large gas engines, leading\nto high efficiency at low emission levels. Due to the wide range of design and\noperating parameters for large gas engine prechambers, the preferred method for\nevaluating different designs is computational fluid dynamics (CFD), as testing\nin test bed measurement campaigns is time-consuming and expensive. However, the\nsignificant computational time required for detailed CFD simulations due to the\ncomplexity of solving the underlying physics also limits its applicability. In\noptimization settings similar to the present case, i.e., where the evaluation\nof the objective function(s) is computationally costly, Bayesian optimization\nhas largely replaced classical design-of-experiment. Thus, the present study\ndeals with the computationally efficient Bayesian optimization of large gas\nengine prechambers design using CFD simulation. Reynolds-averaged-Navier-Stokes\nsimulations are used to determine the target values as a function of the\nselected prechamber design parameters. The results indicate that the chosen\nstrategy is effective to find a prechamber design that achieves the desired\ntarget values.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:07:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Posch","Stefan",""],["G\u00f6\u00dfnitzer","Clemens",""],["Rohrhofer","Franz",""],["Geiger","Bernhard C.",""],["Wimmer","Andreas",""]]}
{"id":"2308.01744","submitter":"Pier Giuseppe Sessa","authors":"Pier Giuseppe Sessa, Pierre Laforgue, Nicol\\`o Cesa-Bianchi, Andreas\n  Krause","title":"Multitask Learning with No Regret: from Improved Confidence Bounds to\n  Active Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multitask learning is a powerful framework that enables one to simultaneously\nlearn multiple related tasks by sharing information between them. Quantifying\nuncertainty in the estimated tasks is of pivotal importance for many downstream\napplications, such as online or active learning. In this work, we provide novel\nmultitask confidence intervals in the challenging agnostic setting, i.e., when\nneither the similarity between tasks nor the tasks' features are available to\nthe learner. The obtained intervals do not require i.i.d. data and can be\ndirectly applied to bound the regret in online learning. Through a refined\nanalysis of the multitask information gain, we obtain new regret guarantees\nthat, depending on a task similarity parameter, can significantly improve over\ntreating tasks independently. We further propose a novel online learning\nalgorithm that achieves such improved regret without knowing this parameter in\nadvance, i.e., automatically adapting to task similarity. As a second key\napplication of our results, we introduce a novel multitask active learning\nsetup where several tasks must be simultaneously optimized, but only one of\nthem can be queried for feedback by the learner at each round. For this\nproblem, we design a no-regret algorithm that uses our confidence intervals to\ndecide which task should be queried. Finally, we empirically validate our\nbounds and algorithms on synthetic and real-world (drug discovery) data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:08:09 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sessa","Pier Giuseppe",""],["Laforgue","Pierre",""],["Cesa-Bianchi","Nicol\u00f2",""],["Krause","Andreas",""]]}
{"id":"2308.01745","submitter":"Andrey Sherstobitov","authors":"G. M. Minkov, O. E. Rut, A. A. Sherstobitov, S. A. Dvoretski, N. N.\n  Mikhailov, V. Ya. Aleshkin","title":"Energy spectrum of valence band in HgTe quantum wells on the way from a\n  two to the three dimensional topological insulator","comments":"7 pages 8 figures","journal-ref":"JETP Letters volume 117, page 916 (2023)","doi":"10.1134/S0021364023601240","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The magnetic field, temperature dependence and the Hall effect have been\nmeasured in order to determine the energy spectrum of the valence band in HgTe\nquantum wells with the width (20-200)nm. The comparison of hole densities\ndetermined from the period Shubnikov-de Haas oscillations and the Hall effect\nshows that states at the top of valence band are double degenerate in teh entry\nquantum wells width the width range. The cyclotron mass determined from\ntemperature dependence of SdH oscillations increases monotonically from\n(0.2-0.3) mass of the free electron, with increasing hole density from 2e11 to\n6e11 cm^-2. The determined dependence has been compared to theoretical one\ncalculate within the four band kp model. The experimental dependence was found\nto be strongly inconsistent with this predictions. It has been shown that the\ninclusion of additional factors (electric field, strain) does not remove the\ncontradiction between experiment and theory. Consequently it is doubtful that\nthe mentioned kp calculations adequately describe the valence band for any\nwidth of quantum well.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:08:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Minkov","G. M.",""],["Rut","O. E.",""],["Sherstobitov","A. A.",""],["Dvoretski","S. A.",""],["Mikhailov","N. N.",""],["Aleshkin","V. Ya.",""]]}
{"id":"2308.01746","submitter":"Yibo Yang","authors":"Yibo Yang, Haobo Yuan, Xiangtai Li, Jianlong Wu, Lefei Zhang, Zhouchen\n  Lin, Philip Torr, Dacheng Tao, Bernard Ghanem","title":"Neural Collapse Terminus: A Unified Solution for Class Incremental\n  Learning and Its Variants","comments":"An extension of our ICLR 2023 paper\n  https://openreview.net/pdf?id=y5W8tpojhtJ. arXiv admin note: text overlap\n  with arXiv:2302.03004","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  How to enable learnability for new classes while keeping the capability well\non old classes has been a crucial challenge for class incremental learning.\nBeyond the normal case, long-tail class incremental learning and few-shot class\nincremental learning are also proposed to consider the data imbalance and data\nscarcity, respectively, which are common in real-world implementations and\nfurther exacerbate the well-known problem of catastrophic forgetting. Existing\nmethods are specifically proposed for one of the three tasks. In this paper, we\noffer a unified solution to the misalignment dilemma in the three tasks.\nConcretely, we propose neural collapse terminus that is a fixed structure with\nthe maximal equiangular inter-class separation for the whole label space. It\nserves as a consistent target throughout the incremental training to avoid\ndividing the feature space incrementally. For CIL and LTCIL, we further propose\na prototype evolving scheme to drive the backbone features into our neural\ncollapse terminus smoothly. Our method also works for FSCIL with only minor\nadaptations. Theoretical analysis indicates that our method holds the neural\ncollapse optimality in an incremental fashion regardless of data imbalance or\ndata scarcity. We also design a generalized case where we do not know the total\nnumber of classes and whether the data distribution is normal, long-tail, or\nfew-shot for each coming session, to test the generalizability of our method.\nExtensive experiments with multiple datasets are conducted to demonstrate the\neffectiveness of our unified solution to all the three tasks and the\ngeneralized case.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:09:59 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yang","Yibo",""],["Yuan","Haobo",""],["Li","Xiangtai",""],["Wu","Jianlong",""],["Zhang","Lefei",""],["Lin","Zhouchen",""],["Torr","Philip",""],["Tao","Dacheng",""],["Ghanem","Bernard",""]]}
{"id":"2308.01747","submitter":"Issam-Ali Moindji\\'e","authors":"Issam-Ali Moindji\\'e and Cristian Preda","title":"Regression models with repeated functional data","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":"  Linear regression and classification models with repeated functional data are\nconsidered. For each statistical unit in the sample, a real-valued parameter is\nobserved over time under different conditions. Two regression models based on\nfusion penalties are presented. The first one is a generalization of the\nvariable fusion model based on the 1-nearest neighbor. The second one, called\ngroup fusion lasso, assumes some grouping structure of conditions and allows\nfor homogeneity among the regression coefficient functions within groups. A\nfinite sample numerical simulation and an application on EEG data are\npresented.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:10:56 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Moindji\u00e9","Issam-Ali",""],["Preda","Cristian",""]]}
{"id":"2308.01748","submitter":"Matthew McCormack","authors":"Andrei Teimurazov, Matthew McCormack, Moritz Linkmann and Olga\n  Shishkina","title":"Unifying heat transport model for the transition between\n  buoyancy-dominated and Lorentz-force-dominated regimes in quasistatic\n  magnetoconvection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In magnetoconvection, the flow of electromagnetically conductive fluid is\ndriven by a combination of buoyancy forces, which create the fluid motion due\nto thermal expansion and contraction, and Lorentz forces, which distort the\nconvective flow structure in the presence of a magnetic field. The differences\nin the global flow structures in the buoyancy-dominated and\nLorentz-force-dominated regimes lead to different heat transport properties in\nthese regimes, reflected in distinct dimensionless scaling relations of the\nglobal heat flux (Nusselt number $\\textrm{Nu}$) versus the strength of buoyancy\n(Rayleigh number $\\textrm{Ra}$) and electromagnetic forces (Hartmann number\n$\\textrm{Ha}$). Here, we propose a theoretical model for the transition between\nthese two regimes for the case of a quasistatic vertical magnetic field applied\nto a convective fluid layer confined between two isothermal, a lower warmer and\nan upper colder, horizontal surfaces. The model suggests that the scaling\nexponents $\\gamma$ in the buoyancy-dominated regime,\n$\\textrm{Nu}\\sim\\textrm{Ra}^\\gamma$, and $\\xi$ in the Lorentz-force-dominated\nregime, $\\textrm{Nu}\\sim(\\textrm{Ha}^{-2}\\textrm{Ra})^\\xi$, are related as\n$\\xi=\\gamma/(1-2\\gamma)$, and the onset of the transition scales with\n$\\textrm{Ha}^{-1/\\gamma}\\textrm{Ra}$. These theoretical results are supported\nby our Direct Numerical Simulations for $10\\leq \\textrm{Ha}\\leq2000$, Prandtl\nnumber $\\textrm{Pr}=0.025$ and $\\textrm{Ra}$ up to $10^9$ and data from the\nliterature.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:11:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Teimurazov","Andrei",""],["McCormack","Matthew",""],["Linkmann","Moritz",""],["Shishkina","Olga",""]]}
{"id":"2308.01749","submitter":"Friedrich G\\\"otze","authors":"S.G. Bobkov, G.P. Chistyakov and F. G\\\"otze","title":"Strictly subgaussian probability distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the class of probability distributions on the real line whose\nLaplace transform admits a strong upper bound of subgaussian type. Using\nHadamard's factorization theorem, we extend the class $\\mathfrak L$ of Newman\nand propose new sufficient conditions for this property in terms of location of\nzeros of the associated characteristic functions in the complex plane. The\nsecond part of this note deals with Laplace transforms of strictly subgaussian\ndistributions with periodic components. This subclass contains interesting\nexamples, for which the central limit theorem with respect to the R\\'enyi\nentropy divergence of infinite order holds.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:11:26 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bobkov","S. G.",""],["Chistyakov","G. P.",""],["G\u00f6tze","F.",""]]}
{"id":"2308.01750","submitter":"Fabio Saracco","authors":"Manuel Pratelli, Fabio Saracco, Marinella Petrocchi","title":"Entropy-based detection of Twitter echo chambers","comments":"27 pages, 12 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI physics.data-an physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The presence of echo chambers, i.e. clusters of users exposed to news or\nopinions in line with their previous beliefs, was observed in many online\ndebates on social platforms. Users form an echo chamber when two different\nphenomena appear at the same time: 1. users interact with ones sharing similar\nopinions; 2. users with similar opinions refer to the same pieces of news. We\npropose a completely unbiased entropy-based procedure to spot echo chambers.\nRemarkably, the method is completely agnostic about the nature of the data. In\nthe Italian Twitter debate about Covid-19 vaccination, we find a limited\npresence of users in echo chambers (around 0.35% of all users), due to the\nlimited number of validated users who are exposed to the same news.\nNevertheless, their impact on the formation of a common discourse is strong,\nsince echo chambers are responsible for nearly one-third of retweets of their\ndiscursive communities.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:12:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Pratelli","Manuel",""],["Saracco","Fabio",""],["Petrocchi","Marinella",""]]}
{"id":"2308.01751","submitter":"Alexander Vieth","authors":"Alexander Vieth, Thomas Kroes, Julian Thijssen, Baldur van Lew, Jeroen\n  Eggermont, Soumyadeep Basu, Elmar Eisemann, Anna Vilanova, Thomas H\\\"ollt,\n  Boudewijn Lelieveldt","title":"ManiVault: A Flexible and Extensible Visual Analytics Framework for\n  High-Dimensional Data","comments":"11 pages paper (incl. 2 pages references and acknowledgements), 2\n  pages supplement","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Exploration and analysis of high-dimensional data are important tasks in many\nfields that produce large and complex data, like the financial sector, systems\nbiology, or cultural heritage. Tailor-made visual analytics software is\ndeveloped for each specific application, limiting their applicability in other\nfields. However, as diverse as these fields are, their characteristics and\nrequirements for data analysis are conceptually similar. Many applications\nshare abstract tasks and data types and are often constructed with similar\nbuilding blocks. Developing such applications, even when based mostly on\nexisting building blocks, requires significant engineering efforts. We\ndeveloped ManiVault, a flexible and extensible open-source visual analytics\nframework for analyzing high-dimensional data. The primary objective of\nManiVault is to facilitate rapid prototyping of visual analytics workflows for\nvisualization software developers and practitioners alike. ManiVault is built\nusing a plugin-based architecture that offers easy extensibility. While our\narchitecture deliberately keeps plugins self-contained, to guarantee maximum\nflexibility and re-usability, we have designed and implemented a messaging API\nfor tight integration and linking of modules to support common visual analytics\ndesign patterns. We provide several visualization and analytics plugins, and\nManiVault's API makes the integration of new plugins easy for developers.\nManiVault facilitates the distribution of visualization and analysis pipelines\nand results for practitioners through saving and reproducing complete\napplication states. As such, ManiVault can be used as a communication tool\namong researchers to discuss workflows and results. A copy of this paper and\nall supplemental material is available at https://osf.io/9k6jw and source code\nat https://github.com/ManiVaultStudio.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:22:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Vieth","Alexander",""],["Kroes","Thomas",""],["Thijssen","Julian",""],["van Lew","Baldur",""],["Eggermont","Jeroen",""],["Basu","Soumyadeep",""],["Eisemann","Elmar",""],["Vilanova","Anna",""],["H\u00f6llt","Thomas",""],["Lelieveldt","Boudewijn",""]]}
{"id":"2308.01752","submitter":"Joachim Meyer","authors":"Nir Douer, Joachim Meyer","title":"Quantifying Retrospective Human Responsibility in Intelligent Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.SY econ.GN eess.SY q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intelligent systems have become a major part of our lives. Human\nresponsibility for outcomes becomes unclear in the interaction with these\nsystems, as parts of information acquisition, decision-making, and action\nimplementation may be carried out jointly by humans and systems. Determining\nhuman causal responsibility with intelligent systems is particularly important\nin events that end with adverse outcomes. We developed three measures of\nretrospective human causal responsibility when using intelligent systems. The\nfirst measure concerns repetitive human interactions with a system. Using\ninformation theory, it quantifies the average human's unique contribution to\nthe outcomes of past events. The second and third measures concern human causal\nresponsibility in a single past interaction with an intelligent system. They\nquantify, respectively, the unique human contribution in forming the\ninformation used for decision-making and the reasonability of the actions that\nthe human carried out. The results show that human retrospective responsibility\ndepends on the combined effects of system design and its reliability, the\nhuman's role and authority, and probabilistic factors related to the system and\nthe environment. The new responsibility measures can serve to investigate and\nanalyze past events involving intelligent systems. They may aid the judgment of\nhuman responsibility and ethical and legal discussions, providing a novel\nquantitative perspective.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:24:21 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Douer","Nir",""],["Meyer","Joachim",""]]}
{"id":"2308.01753","submitter":"{\\AA}smund Hausken Sande","authors":"{\\AA}smund Hausken Sande and Johan S. Wind","title":"Minimal Convex Environmental Contours","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 develop a numerical method for the computation of a minimal convex and\ncompact set, $\\mathcal{B}\\subset\\mathbb{R}^N$, in the sense of mean width. This\nminimisation is constrained by the requirement that\n$\\max_{b\\in\\mathcal{B}}\\langle b , u\\rangle\\geq C(u)$ for all unit vectors\n$u\\in S^{N-1}$ given some Lipschitz function $C$.\n  This problem arises in the construction of environmental contours under the\nassumption of convex failure sets. Environmental contours offer descriptions of\nextreme environmental conditions commonly applied for reliability analysis in\nthe early design phase of marine structures. Usually, they are applied in order\nto reduce the number of computationally expensive response analyses needed for\nreliability estimation.\n  We solve this problem by reformulating it as a linear programming problem.\nRigorous convergence analysis is performed, both in terms of convergence of\nmean widths and in the sense of the Hausdorff metric. Additionally, numerical\nexamples are provided to illustrate the presented methods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:28:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sande","\u00c5smund Hausken",""],["Wind","Johan S.",""]]}
{"id":"2308.01754","submitter":"Montie Avery","authors":"Montie Avery, Matt Holzer, Arnd Scheel","title":"Pushed and pulled fronts in a logistic Keller-Segel model with\n  chemorepulsion","comments":"34 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze spatial spreading in a population model with logistic growth and\nchemorepulsion. In a parameter range of short-range chemo-diffusion, we use\ngeometric singular perturbation theory and functional-analytic farfield-core\ndecompositions to identify spreading speeds with marginally stable front\nprofiles. In particular, we identify a sharp boundary between between linearly\ndetermined, pulled propagation, and nonlinearly determined, pushed propagation,\ninduced by the chemorepulsion. The results are motivated by recent work on\nsingular limits in this regime using PDE methods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:32:33 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Avery","Montie",""],["Holzer","Matt",""],["Scheel","Arnd",""]]}
{"id":"2308.01755","submitter":"Benjamin Heymann","authors":"Benjamin Heymann, Alexandre Gilotte, R\\'emi Chan-Renous","title":"Repeated Bidding with Dynamic Value","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 a repeated auction where the buyer's utility for an item depends\non the time that elapsed since his last purchase. We present an algorithm to\nbuild the optimal bidding policy, and then, because optimal might be\nimpractical, we discuss the cost for the buyer of limiting himself to shading\npolicies.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:36:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Heymann","Benjamin",""],["Gilotte","Alexandre",""],["Chan-Renous","R\u00e9mi",""]]}
{"id":"2308.01756","submitter":"Hoai Le","authors":"Hoai Le, Johann Haidenbauer, Ulf-G. Mei{\\ss}ner and Andreas Nogga","title":"Separation energies of light $\\Lambda$ hypernuclei and their theoretical\n  uncertainties","comments":"17 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Separation energies of light $\\Lambda$ hypernuclei ($A\\leq 5$) and their\ntheoretical uncertainties are investigated. Few-body calculations are performed\nwithin the Faddeev-Yakubovsky scheme and the no-core shell model. Thereby,\nmodern and up-to-date $N\\!N$ and $Y\\!N$ potentials derived within chiral\neffective field theory are employed. % It is found that the numerical\nuncertainties of the few-body methods are well under control and an accuracy of\naround $1$~keV for the hypertriton and of less than $20$~keV for the separation\nenergies of the $^4_{\\Lambda}\\mathrm{He}$ and $^5_{\\Lambda}\\mathrm{He}$\nhypernuclei can be achieved. Variations caused by differences in the $N\\!N$\ninteraction are in the order of $10$~keV for $^3_{\\Lambda}\\mathrm{H}$ and no\nmore than $110$~keV for $A=4,\\,5$ $\\Lambda$ hypernuclei, when recent\nhigh-precision potentials up to fifth order in the chiral expansion are\nemployed. The variations are smaller than expected contributions from chiral\n$Y\\!N\\!N$ three-body forces (3BFs) which arise at the chiral order of\nstate-of-the-art $Y\\!N$ potentials. Estimates for those 3BFs are deduced from a\nstudy of the truncation uncertainties in the chiral expansion.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:36:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Le","Hoai",""],["Haidenbauer","Johann",""],["Mei\u00dfner","Ulf-G.",""],["Nogga","Andreas",""]]}
{"id":"2308.01757","submitter":"Yong-il Shin","authors":"Jong Heum Jung, Junghoon Lee, Jongmin Kim, Yong-il Shin","title":"Random spin textures in turbulent spinor Bose-Einstein condensates","comments":"11 pages, 7 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 numerically investigate the stationary turbulent states of spin-1\nBose-Einstein condensates under continuous spin driving. We analyze the\nentanglement entropy and magnetization correlation function to demonstrate the\nisotropic nature of the intricate spin texture that is generated in the\nnonequilibrium steady state. We observe a $-7/3$ power-law behavior in the\nspin-dependent interaction energy spectrum. To gain further insight into the\nstatistical properties of the spin texture, we introduce a spin state ensemble\nobtained through position projection, revealing its close resemblance to the\nHaar random ensemble for spin-1 systems. We also present the probability\ndistribution of the spin vector magnitude in the turbulent condensate, which\ncan be tested in experiments. Our numerical study highlights the\ncharacteristics of stationary turbulence in the spinor BEC system and confirms\nprevious experimental findings by Hong et al. [Phys. Rev. A 108, 013318\n(2023)].\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:38:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jung","Jong Heum",""],["Lee","Junghoon",""],["Kim","Jongmin",""],["Shin","Yong-il",""]]}
{"id":"2308.01758","submitter":"Lois Liow","authors":"Lois Liow, James Brett, Josh Pinskier, Lauren Hanson, Louis Tidswell,\n  Navinda Kottege, David Howard","title":"A Compliant Robotic Leg Based on Fibre Jamming","comments":"15 pages, 20 figures, IEEE Transactions on Robotics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Humans possess a remarkable ability to react to sudden and unpredictable\nperturbations through immediate mechanical responses, which harness the\nvisco-elastic properties of muscles to perform auto-corrective movements to\nmaintain balance. In this paper, we propose a novel design of a robotic leg\ninspired by this mechanism. We develop multi-material fibre jammed tendons, and\ndemonstrate their use as passive compliant mechanisms to achieve variable joint\nstiffness and improve stability. Through numerical simulations and extensive\nexperimentation, we demonstrate the ability for our system to achieve a wide\nrange of potentially beneficial compliance regimes. We show the role and\ncontribution of each tendon quantitatively by evaluating their individual force\ncontribution in resisting rotational perturbations. We also perform walking\nexperiments with programmed bioinspired gaits that varying the stiffness of the\ntendons throughout the gait cycle, demonstrating a stable and consistent\nbehaviour. We show the potential of such systems when integrated into legged\nrobots, where compliance and shock absorption can be provided entirely through\nthe morphological properties of the leg.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:39:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Liow","Lois",""],["Brett","James",""],["Pinskier","Josh",""],["Hanson","Lauren",""],["Tidswell","Louis",""],["Kottege","Navinda",""],["Howard","David",""]]}
{"id":"2308.01759","submitter":"Luchen Li","authors":"Asen Nachkov and Luchen Li and Giulia Luise and Filippo Valdettaro and\n  Aldo Faisal","title":"Bag of Policies for Distributional Deep Exploration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Efficient exploration in complex environments remains a major challenge for\nreinforcement learning (RL). Compared to previous Thompson sampling-inspired\nmechanisms that enable temporally extended exploration, i.e., deep exploration,\nwe focus on deep exploration in distributional RL. We develop here a general\npurpose approach, Bag of Policies (BoP), that can be built on top of any return\ndistribution estimator by maintaining a population of its copies. BoP consists\nof an ensemble of multiple heads that are updated independently. During\ntraining, each episode is controlled by only one of the heads and the collected\nstate-action pairs are used to update all heads off-policy, leading to distinct\nlearning signals for each head which diversify learning and behaviour. To test\nwhether optimistic ensemble method can improve on distributional RL as did on\nscalar RL, by e.g. Bootstrapped DQN, we implement the BoP approach with a\npopulation of distributional actor-critics using Bayesian Distributional Policy\nGradients (BDPG). The population thus approximates a posterior distribution of\nreturn distributions along with a posterior distribution of policies. Another\nbenefit of building upon BDPG is that it allows to analyze global posterior\nuncertainty along with local curiosity bonus simultaneously for exploration. As\nBDPG is already an optimistic method, this pairing helps to investigate if\noptimism is accumulatable in distributional RL. Overall BoP results in greater\nrobustness and speed during learning as demonstrated by our experimental\nresults on ALE Atari games.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:43:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Nachkov","Asen",""],["Li","Luchen",""],["Luise","Giulia",""],["Valdettaro","Filippo",""],["Faisal","Aldo",""]]}
{"id":"2308.01760","submitter":"Amirreza Mahbod","authors":"Amirreza Mahbod, Christine Polak, Katharina Feldmann, Rumsha Khan,\n  Katharina Gelles, Georg Dorffner, Ramona Woitek, Sepideh Hatamikia, Isabella\n  Ellinger","title":"NuInsSeg: A Fully Annotated Dataset for Nuclei Instance Segmentation in\n  H&E-Stained Histological Images","comments":"7 pages, 1 Figure","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In computational pathology, automatic nuclei instance segmentation plays an\nessential role in whole slide image analysis. While many computerized\napproaches have been proposed for this task, supervised deep learning (DL)\nmethods have shown superior segmentation performances compared to classical\nmachine learning and image processing techniques. However, these models need\nfully annotated datasets for training which is challenging to acquire,\nespecially in the medical domain. In this work, we release one of the biggest\nfully manually annotated datasets of nuclei in Hematoxylin and Eosin\n(H&E)-stained histological images, called NuInsSeg. This dataset contains 665\nimage patches with more than 30,000 manually segmented nuclei from 31 human and\nmouse organs. Moreover, for the first time, we provide additional ambiguous\narea masks for the entire dataset. These vague areas represent the parts of the\nimages where precise and deterministic manual annotations are impossible, even\nfor human experts. The dataset and detailed step-by-step instructions to\ngenerate related segmentation masks are publicly available at\nhttps://www.kaggle.com/datasets/ipateam/nuinsseg and\nhttps://github.com/masih4/NuInsSeg, respectively.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:45:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mahbod","Amirreza",""],["Polak","Christine",""],["Feldmann","Katharina",""],["Khan","Rumsha",""],["Gelles","Katharina",""],["Dorffner","Georg",""],["Woitek","Ramona",""],["Hatamikia","Sepideh",""],["Ellinger","Isabella",""]]}
{"id":"2308.01761","submitter":"Matan Solomon","authors":"Matan Solomon, Bar Genossar, Roee Shraga, Avigdor Gal","title":"LOUC: Leave-One-Out-Calibration Measure for Analyzing Human Matcher\n  Performance","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Schema matching is a core data integration task, focusing on identifying\ncorrespondences among attributes of multiple schemata. Numerous algorithmic\napproaches were suggested for schema matching over the years, aiming at solving\nthe task with as little human involvement as possible. Yet, humans are still\nrequired in the loop -- to validate algorithms and to produce ground truth data\nfor algorithms to be trained against. In recent years, a new research direction\ninvestigates the capabilities and behavior of humans while performing matching\ntasks. Previous works utilized this knowledge to predict, and even improve, the\nperformance of human matchers. In this work, we continue this line of research\nby suggesting a novel measure to evaluate the performance of human matchers,\nbased on calibration, a common meta-cognition measure. The proposed measure\nenables detailed analysis of various factors of the behavior of human matchers\nand their relation to human performance. Such analysis can be further utilized\nto develop heuristics and methods to better asses and improve the annotation\nquality.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:49:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Solomon","Matan",""],["Genossar","Bar",""],["Shraga","Roee",""],["Gal","Avigdor",""]]}
{"id":"2308.01762","submitter":"Peter McNamara","authors":"Peter J. McNamara","title":"On a braid group action","comments":"20pp","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss some consequences of the invertibility of Rickard complexes in a\ncategorified quantum group. Results include a description of reflection\nfunctors for quiver Hecke algebras and a theory of restricting categorical\nrepresentations along a face.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:52:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["McNamara","Peter J.",""]]}
{"id":"2308.01763","submitter":"Kannan S","authors":"S. Kannan and C. Sudheesh","title":"Janus-faced tomograms and retrieval of quadrature moments for\n  $q$-deformed states","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":"  In this work, we derive the optical tomograms of various $q$-deformed quantum\nstates. We found that the optical tomograms of the states under consideration\nexhibit a fascinating `Janus faced' nature, irrespective of the deformation\nparameter $q$. We also derived a general method to extract the quadrature\nmoments from the optical tomograms of any $q$-deformed states. We also note\nthat this technique can be used in high-precision experiments to observe\ndeviations from the standard quantum mechanical behavior.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:54:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kannan","S.",""],["Sudheesh","C.",""]]}
{"id":"2308.01764","submitter":"P. H. Souto Ribeiro Prof.","authors":"R. C. Souza Pimenta, G. H. dos Santos, A. B. Barreto, L. C. Celeri and\n  P. H. Souto Ribeiro","title":"Photonic entanglement with accelerated light","comments":"4 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accelerated light has been demonstrated with laser light and diffraction.\nWithin the diffracting field it is possible to identify a portion that carries\nmost of the beam energy, which propagates in a curved trajectory as it would\nhave been accelerated by a gravitational field for instance. Here, we analyze\nthe effects of this kind of acceleration over the entanglement between twin\nbeams produced in spontaneous parametric down-conversion. Our results show that\nacceleration does not affect entanglement significantly, under ideal\nconditions. The optical scheme introduced can be useful in the understanding of\nprocesses in the boundary between gravitation and quantum physics.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:54:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Pimenta","R. C. Souza",""],["Santos","G. H. dos",""],["Barreto","A. B.",""],["Celeri","L. C.",""],["Ribeiro","P. H. Souto",""]]}
{"id":"2308.01765","submitter":"Milo Moses","authors":"Milo Moses, Konrad Deka","title":"Anyons in a highly-entangled toric xy model","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While ostensibly coined in 1989 by Xiao-Gang Wen, the term \"topological\norder\" has been in use since 1972 by Kosterlitz-Thouless to describe the\nbehavior of the classical xy model. It has been noted that the xy model does\nnot have Wen's topological order since it is also subject a non-topological\nU(1) gauge action. We show in a sense this is the only obstruction. That is, if\nthe xy model evolves quantumly into gauge invariant states then one recovers\npure topological order. In fact, we show the quantum xy topological order is an\ninfinite lattice limit of Kitaev's quantum double model applied to the group\nG=Z.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:55:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Moses","Milo",""],["Deka","Konrad",""]]}
{"id":"2308.01766","submitter":"H\\'ector Andrade-Loarca","authors":"Hector Andrade-Loarca, Julius Hege, Aras Bacho, Gitta Kutyniok","title":"PoissonNet: Resolution-Agnostic 3D Shape Reconstruction using Fourier\n  Neural Operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce PoissonNet, an architecture for shape reconstruction that\naddresses the challenge of recovering 3D shapes from points. Traditional deep\nneural networks face challenges with common 3D shape discretization techniques\ndue to their computational complexity at higher resolutions. To overcome this,\nwe leverage Fourier Neural Operators (FNOs) to solve the Poisson equation and\nreconstruct a mesh from oriented point cloud measurements. PoissonNet exhibits\ntwo main advantages. First, it enables efficient training on low-resolution\ndata while achieving comparable performance at high-resolution evaluation,\nthanks to the resolution-agnostic nature of FNOs. This feature allows for\none-shot super-resolution. Second, our method surpasses existing approaches in\nreconstruction quality while being differentiable. Overall, our proposed method\nnot only improves upon the limitations of classical deep neural networks in\nshape reconstruction but also achieves superior results in terms of\nreconstruction quality, running time, and resolution flexibility. Furthermore,\nwe demonstrate that the Poisson surface reconstruction problem is well-posed in\nthe limit case by showing a universal approximation theorem for the solution\noperator of the Poisson equation with distributional data utilizing the Fourier\nNeural Operator, which provides a theoretical foundation for our numerical\nresults. The code to reproduce the experiments is available on:\n\\url{https://github.com/arsenal9971/PoissonNet}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:56:07 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 18:01:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Andrade-Loarca","Hector",""],["Hege","Julius",""],["Bacho","Aras",""],["Kutyniok","Gitta",""]]}
{"id":"2308.01767","submitter":"Dave Murphy","authors":"Dave Murphy","title":"Bounding The Orlov Spectrum For A Completion Of Discrete Cluster\n  Categories","comments":"31 pages, Sections 3 and 5 overlap with author's PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify thick subcategories in a Paquette-Y\\i ld\\i r\\i m completion\n$\\overline{\\mathcal{C}}$ of a discrete cluster category of Dynkin type\n$A_{\\infty}$. To do this we introduce the notion of homologically connected\nobjects, and the hc (=homologically connected) decomposition of an object into\nhomologically connected objects in a $\\mathrm{Hom}$-finite, Krull-Schmidt\ntriangulated category. We show that any object in a $\\overline{\\mathcal{C}}$\nhas a hc decomposition, and that the hc decomposition determines the thick\nclosure of an object. Moreover, we use this result to classify the classical\ngenerators of $\\overline{\\mathcal{C}}$ as homologically connected objects\nsatisfying a maximality condition.\n  Every homologically connected object has an invariant, known as the\nhomological length, and we show that in $\\overline{\\mathcal{C}}$ this\nhomological length is an upper bound for the generation time of a classical\ngenerator. This allows us to provide an upper bound for the Orlov spectrum of\n$\\overline{\\mathcal{C}}$, as well as giving the Rouquier dimension.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:57:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Murphy","Dave",""]]}
{"id":"2308.01768","submitter":"Mansoor Rezghi","authors":"Mahdi Molavi, Mansoor Rezghi, and Tayyebeh Saeedi","title":"Multidimensional Data Analysis Based on Block Convolutional Tensor\n  Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tensor decompositions are powerful tools for analyzing multi-dimensional data\nin their original format. Besides tensor decompositions like Tucker and CP,\nTensor SVD (t-SVD) which is based on the t-product of tensors is another\nextension of SVD to tensors that recently developed and has found numerous\napplications in analyzing high dimensional data. This paper offers a new\ninsight into the t-Product and shows that this product is a block convolution\nof two tensors with periodic boundary conditions. Based on this viewpoint, we\npropose a new tensor-tensor product called the $\\star_c{}\\text{-Product}$ based\non Block convolution with reflective boundary conditions. Using a tensor\nframework, this product can be easily extended to tensors of arbitrary order.\nAdditionally, we introduce a tensor decomposition based on our\n$\\star_c{}\\text{-Product}$ for arbitrary order tensors. Compared to t-SVD, our\nnew decomposition has lower complexity, and experiments show that it yields\nhigher-quality results in applications such as classification and compression.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:58:21 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 21:23:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Molavi","Mahdi",""],["Rezghi","Mansoor",""],["Saeedi","Tayyebeh",""]]}
{"id":"2308.01769","submitter":"Jonas Utz","authors":"Jonas Utz, Tobias Weise, Maja Schlereth, Fabian Wagner, Mareike Thies,\n  Mingxuan Gu, Stefan Uderhardt, Katharina Breininger","title":"Focus on Content not Noise: Improving Image Generation for Nuclei\n  Segmentation by Suppressing Steganography in CycleGAN","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Annotating nuclei in microscopy images for the training of neural networks is\na laborious task that requires expert knowledge and suffers from inter- and\nintra-rater variability, especially in fluorescence microscopy. Generative\nnetworks such as CycleGAN can inverse the process and generate synthetic\nmicroscopy images for a given mask, thereby building a synthetic dataset.\nHowever, past works report content inconsistencies between the mask and\ngenerated image, partially due to CycleGAN minimizing its loss by hiding\nshortcut information for the image reconstruction in high frequencies rather\nthan encoding the desired image content and learning the target task. In this\nwork, we propose to remove the hidden shortcut information, called\nsteganography, from generated images by employing a low pass filtering based on\nthe DCT. We show that this increases coherence between generated images and\ncycled masks and evaluate synthetic datasets on a downstream nuclei\nsegmentation task. Here we achieve an improvement of 5.4 percentage points in\nthe F1-score compared to a vanilla CycleGAN. Integrating advanced\nregularization techniques into the CycleGAN architecture may help mitigate\nsteganography-related issues and produce more accurate synthetic datasets for\nnuclei segmentation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:58:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Utz","Jonas",""],["Weise","Tobias",""],["Schlereth","Maja",""],["Wagner","Fabian",""],["Thies","Mareike",""],["Gu","Mingxuan",""],["Uderhardt","Stefan",""],["Breininger","Katharina",""]]}
{"id":"2308.01770","submitter":"Yong-Liang Ma","authors":"Ling-Jun Guo, Wen-Cong Yang, Yong-Liang Ma and Yue-Liang Wu","title":"Probing hadron-quark transition through binary neutron star merger","comments":"6 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The cores of massive neutron stars provide a unique environment for the dense\nnuclear matter in the universe. The global properties of a neutron star and\ngravitational waves emitted from the binary neutron star merger carry\ninformation about dense nuclear matter. We study in this paper the effect of\nthe possible hadron-quark transition on the properties of the neutron star and\nthe gravitational waves emitted from the binary neutron star merger by using\nthe equations of state constructed from the Maxwell ansatz, Gibbs ansatz and,\nthe crossover scenario. Our results show that the short period of the inspiral\nphase and the earlier collapse to a black hole indicate a soft equation of\nstate. In combination with the future detection of the $10$kHz gravitational\nwaves emitted from the binary neutron star merger and the signals from the\nelectromagnetic counterparts, we expect the present study could reveal some\ncharacters of the dense nuclear matter.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:59:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Guo","Ling-Jun",""],["Yang","Wen-Cong",""],["Ma","Yong-Liang",""],["Wu","Yue-Liang",""]]}
{"id":"2308.01771","submitter":"Yasin Shokrollahi","authors":"Yasin Shokrollahi1, Pengfei Dong1, Xianqi Li, Linxia Gu","title":"Deep Learning-based Prediction of Stress and Strain Maps in Arterial\n  Walls for Improved Cardiovascular Risk Assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigated the potential of end-to-end deep learning tools as a\nmore effective substitute for FEM in predicting stress-strain fields within 2D\ncross sections of arterial wall. We first proposed a U-Net based fully\nconvolutional neural network (CNN) to predict the von Mises stress and strain\ndistribution based on the spatial arrangement of calcification within arterial\nwall cross-sections. Further, we developed a conditional generative adversarial\nnetwork (cGAN) to enhance, particularly from the perceptual perspective, the\nprediction accuracy of stress and strain field maps for arterial walls with\nvarious calcification quantities and spatial configurations. On top of U-Net\nand cGAN, we also proposed their ensemble approaches, respectively, to further\nimprove the prediction accuracy of field maps. Our dataset, consisting of input\nand output images, was generated by implementing boundary conditions and\nextracting stress-strain field maps. The trained U-Net models can accurately\npredict von Mises stress and strain fields, with structural similarity index\nscores (SSIM) of 0.854 and 0.830 and mean squared errors of 0.017 and 0.018 for\nstress and strain, respectively, on a reserved test set. Meanwhile, the cGAN\nmodels in a combination of ensemble and transfer learning techniques\ndemonstrate high accuracy in predicting von Mises stress and strain fields, as\nevidenced by SSIM scores of 0.890 for stress and 0.803 for strain.\nAdditionally, mean squared errors of 0.008 for stress and 0.017 for strain\nfurther support the model's performance on a designated test set. Overall, this\nstudy developed a surrogate model for finite element analysis, which can\naccurately and efficiently predict stress-strain fields of arterial walls\nregardless of complex geometries and boundary conditions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:00:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Shokrollahi1","Yasin",""],["Dong1","Pengfei",""],["Li","Xianqi",""],["Gu","Linxia",""]]}
{"id":"2308.01772","submitter":"Kento Katayama","authors":"Shinya Kanemura, Kento Katayama, Tanmoy Mondal, Kei Yagyu","title":"Multi-photon signatures as a probe of CP-violation in extended Higgs\n  sectors","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"OU-HET-1197","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel signature with four-photon final states to probe\nCP-violating (CPV) extended Higgs sectors via $f \\bar{f} \\to Z^* \\to H_1H_2 \\to\n4 \\gamma$ processes with $H_{1,2}$ being additional neutral Higgs bosons. We\nfocus on the nearly Higgs alignment scenario, in which the discovered Higgs\nboson almost corresponds to a neutral scalar state belonging to the isospin\ndoublet field with the vacuum expectation value $v \\simeq 246$ GeV. We show\nthat the branching ratios of $H_{1,2} \\to \\gamma \\gamma$ can simultaneously be\nsizable when CPV phases in the Higgs potential are of order one due to the\nenhancement of charged-Higgs boson loops. Such branching ratios can be\nespecially significant when the fermiophobic scenario is taken into account. As\na simple example, we consider the general two Higgs doublet model, and\ndemonstrate that the cross section for the four-photon process can be 0.1 fb at\nLHC with the masses of $H_{1,2}$ to be a few 100 GeV in the Higgs alignment\nlimit under the constraints from electric dipole moments (EDMs) and LHC Run-II\ndata. We also illustrate that the searches for EDMs and di-photon resonances at\nhigh-luminosity LHC play complementary roles to explore CPV extended Higgs\nsectors.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:01:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kanemura","Shinya",""],["Katayama","Kento",""],["Mondal","Tanmoy",""],["Yagyu","Kei",""]]}
{"id":"2308.01773","submitter":"Tommaso Taddei","authors":"Nicolas Barral, Tommaso Taddei, Ishak Tifouti","title":"Registration-based model reduction of parameterized PDEs with\n  spatio-parameter adaptivity","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 propose an automated nonlinear model reduction and mesh adaptation\nframework for rapid and reliable solution of parameterized advection-dominated\nproblems, with emphasis on compressible flows. The key features of our approach\nare threefold: (i) a metric-based mesh adaptation technique to generate an\naccurate mesh for a range of parameters, (ii) a general (i.e., independent of\nthe underlying equations) registration procedure for the computation of a\nmapping $\\Phi$ that tracks moving features of the solution field, and (iii) an\nhyper-reduced least-square Petrov-Galerkin reduced-order model for the rapid\nand reliable estimation of the mapped solution. We discuss a general paradigm\n-- which mimics the refinement loop considered in mesh adaptation -- to\nsimultaneously construct the high-fidelity and the reduced-order\napproximations, and we discuss actionable strategies to accelerate the offline\nphase. We present extensive numerical investigations for a quasi-1D nozzle\nproblem and for a two-dimensional inviscid flow past a Gaussian bump to display\nthe many features of the methodology and to assess the performance for problems\nwith discontinuous solutions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:02:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Barral","Nicolas",""],["Taddei","Tommaso",""],["Tifouti","Ishak",""]]}
{"id":"2308.01774","submitter":"Torstein S{\\ae}ter Mr","authors":"Torstein S{\\ae}ter, Christian Pedersen, Jacco H. Snoeijer, Thomas\n  Salez, and Andreas Carlson","title":"Coalescence of elastic blisters filled with a viscous fluid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pockets of viscous fluid coalescing beneath an elastic plate are encountered\nin a wide range of natural phenomena and engineering processes, spanning across\nscales. As the pockets merge, a bridge is formed with a height increasing as\nthe plate relaxes. We study the spatiotemporal dynamics of such an\nelasto-hydrodynamic coalescence process by combining experiments, lubrication\ntheory and numerical simulations. The bridge height exhibits an exponential\ngrowth with time, which corresponds to a self-similar solution of the\nbending-driven thin-film equation. We address this unique self-similarity and\nthe self-similar shape of the bridge, both of which are corroborated in\nnumerical simulations and experiments.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:06:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["S\u00e6ter","Torstein",""],["Pedersen","Christian",""],["Snoeijer","Jacco H.",""],["Salez","Thomas",""],["Carlson","Andreas",""]]}
{"id":"2308.01775","submitter":"Priyanka Gawade","authors":"Priyanka Gawade, Surhud More, Varun Bhalerao","title":"On the feasibility of primordial black hole abundance constraints using\n  lensing parallax of GRBs","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Primordial black holes, which could have formed during the early Universe\nthrough overdensities in primordial density fluctuations during inflation, are\npotential candidates for dark matter. We explore the use of lensing parallax of\nGamma ray bursts, which results in different fluxes being observed from two\ndifferent vantage points, in order to probe the abundance of primordial black\nholes in the unexplored window within the mass range\n$[10^{-15}-10^{-11}]M_\\odot$. We derive the optical depth for the detectability\nof lensing of GRBs with a distribution of source properties and realistic\ndetector sensitivities. We comment on the ability of the proposed Indian twin\nsatellite mission Daksha in its low earth orbit to conduct this experiment. If\nthe two Daksha satellites observe 10000 GRBs simultaneously and the entirety of\ndark matter is made up of $[10^{-15}-10^{-12}]M_\\odot$ black holes, Daksha will\ndetect non-zero lensing events with a probability ranging from [80, 50] per\ncent. Non-detections will not conclusively rule out primordial black holes as\ndark matter in this mass range. However, we show that meaningful constraints\ncan be obtained in such a case if the two satellites are separated by at least\nthe Earth-Moon distance.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:07:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gawade","Priyanka",""],["More","Surhud",""],["Bhalerao","Varun",""]]}
{"id":"2308.01776","submitter":"Xiaowu Zhang","authors":"Xiaowu Zhang and Xiaotian Zhang and Cheng Yang and Hang Yan and Xipeng\n  Qiu","title":"Does Correction Remain A Problem For Large Language Models?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As large language models, such as GPT, continue to advance the capabilities\nof natural language processing (NLP), the question arises: does the problem of\ncorrection still persist? This paper investigates the role of correction in the\ncontext of large language models by conducting two experiments. The first\nexperiment focuses on correction as a standalone task, employing few-shot\nlearning techniques with GPT-like models for error correction. The second\nexperiment explores the notion of correction as a preparatory task for other\nNLP tasks, examining whether large language models can tolerate and perform\nadequately on texts containing certain levels of noise or errors. By addressing\nthese experiments, we aim to shed light on the significance of correction in\nthe era of large language models and its implications for various NLP\napplications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:09:31 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 09:15:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Xiaowu",""],["Zhang","Xiaotian",""],["Yang","Cheng",""],["Yan","Hang",""],["Qiu","Xipeng",""]]}
{"id":"2308.01777","submitter":"Mogeng Li","authors":"Mogeng Li, Charitha M. de Silva, Amirreza Rouhi, Rio Baidya, Daniel\n  Chung, Ivan Marusic and Nicholas Hutchins","title":"Recovery of the wall-shear stress to equilibrium flow conditions after a\n  rough-to-smooth step-change in turbulent boundary layers","comments":null,"journal-ref":"Journal of Fluid Mechanics, 872, 472-491 (2019)","doi":"10.1017/jfm.2019.351","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper examines recovery of the wall-shear stress of a turbulent boundary\nlayer that has undergone a sudden transition from a rough to a smooth surface.\nEarly works of Antonia and Luxton questioned the reliability of standard\nsmooth-wall methods to measure wall-shear stress in such conditions, and\nsubsequent studies show significant disagreement depending on the approach used\nto determine the wall-shear stress downstream. Here we address this by\nutilising a collection of experimental databases at Re_\\tau \\approx 4100 that\nhave access to both `direct' and `indirect' measures of the wall-shear stress\nto understand the recovery to equilibrium conditions to the new surface. Our\nresults reveal that the viscous region (z^+\\lesssim 4) recovers almost\nimmediately to an equilibrium state with the new wall conditions, however, the\nbuffer region and beyond takes several boundary layer thicknesses before\nrecovering to equilibrium conditions, which is longer than previously thought.\nA unique direct numerical simulation database of a wall-bounded flow with a\nrough-to-smooth wall transition is employed to confirm these findings. In doing\nso, we present evidence that any estimate of the wall-shear stress from the\nmean velocity profile in the buffer region or further away from the wall tends\nto underestimate its magnitude in the near vicinity of the rough-to-smooth\ntransition, and this is likely to be partly responsible for the large scatter\nof recovery lengths to equilibrium conditions reported in the literature. Our\nresults also reveal that the smaller energetic scales in the near-wall region\nrecover to an equilibrium state associated with the new wall conditions within\none boundary layer thickness downstream of the transition, while the larger\nenergetic scales exhibit an over-energised state for several boundary layer\nthicknesses downstream of the transition.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:10:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Mogeng",""],["de Silva","Charitha M.",""],["Rouhi","Amirreza",""],["Baidya","Rio",""],["Chung","Daniel",""],["Marusic","Ivan",""],["Hutchins","Nicholas",""]]}
{"id":"2308.01778","submitter":"Atacan K{\\i}l{\\i}\\c{c}gedik","authors":"Atacan K{\\i}l{\\i}\\c{c}gedik, Ayt\\\"ul Ad{\\i}g\\\"uzel, Asl{\\i}han\n  \\c{C}a\\u{g}lar, Emre \\c{C}elebi, \\c{S}eyma Esen, Mithat Kaya, \\\"Umit Kaya,\n  Veysi Erkcan \\\"Ozcan, G\\\"orkem T\\\"uremen, Nafiz G\\\"okhan \\\"Unel, Fatih Yaman","title":"Electromagnetic and vacuum tests of the PTAK-RFQ module 0","comments":"14 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new Radio-frequency quadrupole (RFQ), which operates at 800 MHz high\nfrequency and will enable to accelerate of the proton beam efficiently was\ndesigned at KAHVELab (Kandilli Detector, Accelerator and Instrumentation\nLaboratory) at Bo\\u{g}azi\\c{c}i University in \\.Istanbul, Turkey. The so-called\nPTAK-RFQ, which consists of two modules with a total length of less than one\nmeter will accelerate protons to 2 MeV at the Proton Testbeam at the Kandilli\ncampus, known as the PTAK project. The prototype of the first module of the 800\nMHz PTAK-RFQ (called the PTAK-RFQ module 0), which captures and bunches the\nproton beam injected from the ion source was fabricated by a local manufacturer\nfrom ordinary copper material. The PTAK-RFQ module 0 was subjected to various\ntests to ensure that its mechanics, pressure, field distribution, and frequency\nare operationally adjusted. The facilitating solutions emerging from the\ndetailed testing of the PTAK-RFQ module 0 will ultimately guide all mechanical,\nvacuum, rf testing, final design, and manufacturing processes of the final\nPTAK-RFQ. The PTAK-RFQ module 0 was first subjected to vacuum tests and then to\ndetailed vacuum leak tests. Subsequently, low-power rf measurements were\nperformed for tuning of field and frequency. The tuning algorithm developed by\nCERN was optimized for 16 tuners and 6 test field points to be adjusted to the\nPTAK-RFQ module 0 to the desired field distribution. The tuning algorithm is\nbased on a response matrix, whose inputs are created by bead-pull measurements\nof individual tuner movements. The tuning algorithm gives some predictions for\ncorrective tuner movements to achieve desired field distribution. In the\nframework of all these RF tuning processes, the field distribution was tuned\nthrough the tuning algorithm and then the frequency was tuned manually.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:11:03 GMT"}],"update_date":"2023-08-04","authors_parsed":[["K\u0131l\u0131\u00e7gedik","Atacan",""],["Ad\u0131g\u00fczel","Ayt\u00fcl",""],["\u00c7a\u011flar","Asl\u0131han",""],["\u00c7elebi","Emre",""],["Esen","\u015eeyma",""],["Kaya","Mithat",""],["Kaya","\u00dcmit",""],["\u00d6zcan","Veysi Erkcan",""],["T\u00fcremen","G\u00f6rkem",""],["\u00dcnel","Nafiz G\u00f6khan",""],["Yaman","Fatih",""]]}
{"id":"2308.01779","submitter":"Wentong Li","authors":"Wentong Li, Yuqian Yuan, Song Wang, Jianke Zhu, Jianshu Li, Jian Liu,\n  Lei Zhang","title":"Point2Mask: Point-supervised Panoptic Segmentation via Optimal Transport","comments":"14 pages, 8 figures, ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weakly-supervised image segmentation has recently attracted increasing\nresearch attentions, aiming to avoid the expensive pixel-wise labeling. In this\npaper, we present an effective method, namely Point2Mask, to achieve\nhigh-quality panoptic prediction using only a single random point annotation\nper target for training. Specifically, we formulate the panoptic pseudo-mask\ngeneration as an Optimal Transport (OT) problem, where each ground-truth (gt)\npoint label and pixel sample are defined as the label supplier and consumer,\nrespectively. The transportation cost is calculated by the introduced\ntask-oriented maps, which focus on the category-wise and instance-wise\ndifferences among the various thing and stuff targets. Furthermore, a\ncentroid-based scheme is proposed to set the accurate unit number for each gt\npoint supplier. Hence, the pseudo-mask generation is converted into finding the\noptimal transport plan at a globally minimal transportation cost, which can be\nsolved via the Sinkhorn-Knopp Iteration. Experimental results on Pascal VOC and\nCOCO demonstrate the promising performance of our proposed Point2Mask approach\nto point-supervised panoptic segmentation. Source code is available at:\nhttps://github.com/LiWentomng/Point2Mask.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:11:56 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Wentong",""],["Yuan","Yuqian",""],["Wang","Song",""],["Zhu","Jianke",""],["Li","Jianshu",""],["Liu","Jian",""],["Zhang","Lei",""]]}
{"id":"2308.01780","submitter":"A. Lusakowski","authors":"M. G\\'orska, {\\L}. Kila\\'nski, A. {\\L}usakowski","title":"Magnetic interactions in IV-VI diluted magnetic semiconductors","comments":null,"journal-ref":"Phys. Status Solidi B, 259, 2100592 (2022)","doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Diluted magnetic semiconductors (DMS) are interesting because of the\ninterplay between the electronic and magnetic subsystems. We describe selected\nmagnetic properties of IV-VI diluted magnetic semiconductors, looking at the\nsimilarities and differences between magnetic properties of II-VI, IV-VI, and\nIII-V DMS. We focus on the influence of the crystalline and electronic\nstructure of the material on its magnetic properties, especially on the\nexchange interactions among magnetic ions. We describe methods of determination\nof the exchange parameters by using different experimental techniques, such as\nmeasurements of magnetic susceptibility, magnetization, and specific heat. We\nfollow the development in the material technology from bulk crystals to thin\nfilms and nanostructures.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:13:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["G\u00f3rska","M.",""],["Kila\u0144ski","\u0141.",""],["\u0141usakowski","A.",""]]}
{"id":"2308.01781","submitter":"Jason LeGrow","authors":"Hailey Egan, Jason T. LeGrow, Gretchen L. Matthews, Jeff Suliga","title":"Influences of some families of error-correcting codes","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Binary codes of length $n$ may be viewed as subsets of vertices of the\nBoolean hypercube $\\{0,1\\}^n$. The ability of a linear error-correcting code to\nrecover erasures is connected to influences of particular monotone Boolean\nfunctions. These functions provide insight into the role that particular\ncoordinates play in a code's erasure repair capability. In this paper, we\nconsider directly the influences of coordinates of a code. We describe a family\nof codes, called codes with minimum disjoint support, for which all influences\nmay be determined. As a consequence, we find influences of repetition codes and\ncertain distinct weight codes. Computing influences is typically circumvented\nby appealing to the transitivity of the automorphism group of the code. Some of\nthe codes considered here fail to meet the transitivity conditions requires for\nthese standard approaches, yet we can compute them directly.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:15:51 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Egan","Hailey",""],["LeGrow","Jason T.",""],["Matthews","Gretchen L.",""],["Suliga","Jeff",""]]}
{"id":"2308.01782","submitter":"Nurgissa Yessirkegenov","authors":"Durvudkhan Suragan and Nurgissa Yessirkegenov","title":"Unified weighted Hardy-type inequalities","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a unified approach to obtain Hardy-type inequalities in the\ncontext of nilpotent Lie groups with sharp constants. The unified methodology\nemployed herein allows for exploration of the sharp Hardy inequalities on\nvarious Lie group structures and improves previously known inequalities even in\nthe classical Euclidean setting. By leveraging this framework, as an\napplication, we derive new Caffarelli-Kohn-Nirenberg type inequalities both in\nthe classical Euclidean setting and on general homogeneous Lie groups.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:18:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Suragan","Durvudkhan",""],["Yessirkegenov","Nurgissa",""]]}
{"id":"2308.01783","submitter":"Tanjila Mawla","authors":"Tanjila Mawla, Maanak Gupta, Safwa Ameer, Ravi Sandhu","title":"The ACAC_D Model for Mutable Activity Control and Chain of Dependencies\n  in Smart and Collaborative Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the integration of connected devices, artificial intelligence, and\nheterogeneous networks in IoT-driven cyber-physical systems, our society is\nevolving as a smart, automated, and connected community. In such dynamic and\ndistributed environments, various operations are carried out considering\ndifferent contextual factors to support the automation of collaborative devices\nand systems. These devices often perform long-lived operations or tasks\n(referred to as activities) to fulfill larger goals in the collaborative\nenvironment. These activities are usually mutable (change states) and\ninterdependent. They can influence the execution of other activities in the\necosystem, requiring active and real-time monitoring of the entire connected\nenvironment.\n  Recently, a vision for activity-centric access control(ACAC) was proposed to\nenable security modeling and enforcement from the perspective and abstraction\nof interdependent activities. The proposed ACAC incorporates four decision\nparameters: Authorizations(A), oBligations(B), Conditions(C), and activity\nDependencies(D) for an object agnostic access control in smart systems. In this\npaper, we take a step further towards maturing ACAC by focusing on activity\ndependencies(D) and developing a family of formal mathematically grounded\nmodels, referred to as ACAC_D. These formal models consider the real-time\nmutability of activities in resolving active dependencies among various\nactivities in the ecosystem. Activity dependencies can form a chain where it is\npossible to have dependencies of dependencies. In ACAC, we also consider the\nchain of dependencies while handling the mutability of an activity. We\nhighlight the challenges while dealing with chain of dependencies, and provide\nsolutions to resolve these challenges. We also present a proof of concept\nimplementation of with performance analysis for a smart farming use case.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:20:50 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mawla","Tanjila",""],["Gupta","Maanak",""],["Ameer","Safwa",""],["Sandhu","Ravi",""]]}
{"id":"2308.01784","submitter":"Aleksander Kozak","authors":"Aleksander Kozak, Aneta Wojnar","title":"Earthquakes as probing tools for gravity theories","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel method for testing gravity models using seismic data from\nEarth. By imposing observational constraints on Earth's moment of inertia and\nmass, we rigorously limit the gravitational models' parameters within a\n$2\\sigma$ accuracy. Our method constrains the parameters governing additional\nterms to the General Relativity Lagrangian to the following ranges:\n$-2\\times10^9\\lesssim\\beta\\lesssim 10^9 \\text{m}^2$ for Palatini $f(R)$\ngravity, $-8\\times10^9\\lesssim\\epsilon\\lesssim 4\\times 10^9 \\text{m}^2$ for\nEddington-inspired Born-Infeld gravity, and\n$-10^{-3}\\lesssim\\Upsilon\\lesssim10^{-3}$ for Degenerate Higher-Order\nScalar-Tensor theories. We also discuss potential avenues to enhance the\nproposed method, aiming to impose even tighter constraints on gravity models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:23:33 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kozak","Aleksander",""],["Wojnar","Aneta",""]]}
{"id":"2308.01785","submitter":"Muhidin Mohamed","authors":"Shafie Abdi Mohamed, Muhidin Abdullahi Mohamed","title":"Lexicon and Rule-based Word Lemmatization Approach for the Somali\n  Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lemmatization is a Natural Language Processing (NLP) technique used to\nnormalize text by changing morphological derivations of words to their root\nforms. It is used as a core pre-processing step in many NLP tasks including\ntext indexing, information retrieval, and machine learning for NLP, among\nothers. This paper pioneers the development of text lemmatization for the\nSomali language, a low-resource language with very limited or no prior\neffective adoption of NLP methods and datasets. We especially develop a lexicon\nand rule-based lemmatizer for Somali text, which is a starting point for a\nfull-fledged Somali lemmatization system for various NLP tasks. With\nconsideration of the language morphological rules, we have developed an initial\nlexicon of 1247 root words and 7173 derivationally related terms enriched with\nrules for lemmatizing words not present in the lexicon. We have tested the\nalgorithm on 120 documents of various lengths including news articles, social\nmedia posts, and text messages. Our initial results demonstrate that the\nalgorithm achieves an accuracy of 57\\% for relatively long documents (e.g. full\nnews articles), 60.57\\% for news article extracts, and high accuracy of 95.87\\%\nfor short texts such as social media messages.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:31:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mohamed","Shafie Abdi",""],["Mohamed","Muhidin Abdullahi",""]]}
{"id":"2308.01786","submitter":"Koki Shinada","authors":"Koki Shinada and Robert Peters","title":"Unique properties of the optical activity in noncentrosymmetric\n  superconductors: sum rule, missing area, and relation with the\n  superconducting Edelstein effect","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":"  We present general properties of the optical activity in noncentrosymmetric\nmaterials, including superconductors. We derive a sum rule of the optical\nactivity in general electric states and show that the summation of the spectrum\nis zero, which is independent of the details of electric states. The optical\nactivity has a $\\delta$-function singularity that vanishes in normal phases.\nHowever, the singularity emerges in superconducting phases, corresponding to\nthe Meissner effect in the optical conductivity. The spectrum decreases by the\nsuperconducting gap and has a missing area compared to the normal phase. This\narea is exactly equivalent to the coefficient of the $\\delta$-function\nsingularity due to the universal sum rule. Furthermore, the coefficient is\nexactly equivalent to the superconducting Edelstein effect, which has not yet\nbeen observed in experiments. Thus, this measurement of the missing area offers\nan alternative way to observe the superconducting Edelstein effect.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:35:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Shinada","Koki",""],["Peters","Robert",""]]}
{"id":"2308.01787","submitter":"Eric Perlmutter","authors":"Gabriele Di Ubaldo, Eric Perlmutter","title":"AdS$_3$ Pure Gravity and Stringy Unitarity","comments":"It's short","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct a unitary, modular-invariant torus partition function of a\ntwo-dimensional conformal field theory with a Virasoro primary spectral gap of\n$\\Delta_* = \\frac{c-1}{12}$ above the vacuum. The twist gap is identical, apart\nfrom two states $\\mathcal{O}_*$ with spin scaling linearly in the central\ncharge $c$. These states admit an AdS$_3$ interpretation as strongly coupled\nstrings. All other states are black hole microstates.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:36:15 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Di Ubaldo","Gabriele",""],["Perlmutter","Eric",""]]}
{"id":"2308.01788","submitter":"Nick Wulbusch","authors":"Nick Wulbusch, Reinhild Roden, Matthias Blau, Alexey Chernov","title":"Bayesian parameter identification in impedance boundary conditions for\n  Helmholtz problems","comments":"22 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 consider the problem of identifying the acoustic impedance of a wall\nsurface from noisy pressure measurements in a closed room using a Bayesian\napproach. The room acoustics is modeled by the interior Helmholtz equation with\nimpedance boundary conditions. The aim is to compute moments of the acoustic\nimpedance to estimate a suitable density function of the impedance coefficient.\nFor the computation of moments we use ratio estimators and Monte-Carlo\nsampling. We consider two different experimental scenarios. In the first\nscenario, the noisy measurements correspond to a wall modeled by impedance\nboundary conditions. In this case, the Bayesian algorithm uses a model that is\n(up to the noise) consistent with the measurements and our algorithm is able to\nidentify acoustic impedance with high accuracy. In the second scenario, the\nnoisy measurements come from a coupled acoustic-structural problem, modeling a\nwall made of glass, whereas the Bayesian algorithm still uses a model with\nimpedance boundary conditions. In this case, the parameter identification model\nis inconsistent with the measurements and therefore is not capable to represent\nthem well. Nonetheless, for particular frequency bands the Bayesian algorithm\nidentifies estimates with high likelihood. Outside these frequency bands the\nalgorithm fails. We discuss the results of both examples and possible reasons\nfor the failure of the latter case for particular frequency values.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:36:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wulbusch","Nick",""],["Roden","Reinhild",""],["Blau","Matthias",""],["Chernov","Alexey",""]]}
{"id":"2308.01789","submitter":"Gloria Turati","authors":"Gloria Turati (1), Maurizio Ferrari Dacrema (1), Paolo Cremonesi (1)\n  ((1) Politecnico di Milano)","title":"Benchmarking Adaptative Variational Quantum Algorithms on QUBO Instances","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, Variational Quantum Algorithms (VQAs) have emerged as a\npromising approach for solving optimization problems on quantum computers in\nthe NISQ era. However, one limitation of VQAs is their reliance on\nfixed-structure circuits, which may not be taylored for specific problems or\nhardware configurations. A leading strategy to address this issue are\nAdaptative VQAs, which dynamically modify the circuit structure by adding and\nremoving gates, and optimize their parameters during the training. Several\nAdaptative VQAs, based on heuristics such as circuit shallowness, entanglement\ncapability and hardware compatibility, have already been proposed in the\nliterature, but there is still lack of a systematic comparison between the\ndifferent methods. In this paper, we aim to fill this gap by analyzing three\nAdaptative VQAs: Evolutionary Variational Quantum Eigensolver (EVQE), Variable\nAnsatz (VAns), already proposed in the literature, and Random Adapt-VQE\n(RA-VQE), a random approach we introduce as a baseline. In order to compare\nthese algorithms to traditional VQAs, we also include the Quantum Approximate\nOptimization Algorithm (QAOA) in our analysis. We apply these algorithms to\nQUBO problems and study their performance by examining the quality of the\nsolutions found and the computational times required. Additionally, we\ninvestigate how the choice of the hyperparameters can impact the overall\nperformance of the algorithms, highlighting the importance of selecting an\nappropriate methodology for hyperparameter tuning. Our analysis sets benchmarks\nfor Adaptative VQAs designed for near-term quantum devices and provides\nvaluable insights to guide future research in this area.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:39:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Turati","Gloria","","Politecnico di Milano"],["Dacrema","Maurizio Ferrari","","Politecnico di Milano"],["Cremonesi","Paolo","","Politecnico di Milano"]]}
{"id":"2308.01790","submitter":"Eric Hanson","authors":"Benjamin Blanchette, Thomas Br\\\"ustle, and Eric J. Hanson","title":"Exact structures for persistence modules","comments":"v2: corrected typos and minor erros, 25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT cs.CG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss applications of exact structures and relative homological algebra\nto the study of invariants of multiparameter persistence modules. This paper is\nmostly expository, but does contain a pair of novel results. Over finite\nposets, classical arguments about the relative projective modules of an exact\nstructure make use of Auslander-Reiten theory. One of our results establishes a\nnew adjunction which allows us to \"lift\" these arguments to certain infinite\nposets over which Auslander-Reiten theory is not available. We give several\nexamples of this lifting, in particular highlighting the non-existence and\nexistence of resolutions by upsets when working with finitely presentable\nrepresentations of the plane and of the closure of the positive quadrant,\nrespectively. We then restrict our attention to finite posets. In this setting,\nwe discuss the relationship between the global dimension of an exact structure\nand the representation dimension of the incidence algebra of the poset. We\nconclude with our second novel contribution. This is an explicit description of\nthe irreducible morphisms between relative projective modules for several exact\nstructures which have appeared previously in the literature.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:39:04 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 11:58:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Blanchette","Benjamin",""],["Br\u00fcstle","Thomas",""],["Hanson","Eric J.",""]]}
{"id":"2308.01791","submitter":"FangYiKuang Ding","authors":"FangYiKuang Ding, Jie Xu, Mingke Li","title":"Collective action and spontaneity cycles: Cascading dynamics under\n  Bayesian games","comments":"arXiv admin note: text overlap with arXiv:2207.02133 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The formation mechanisms and cyclical conditions of collective action have\nbecome open issues in research involving public choice, social movements, and\nmore. For this reason, on the basis of rational decision-making and social\nassimilation, this paper proposes an action model that combines Bayesian game\nand social network dynamics, and incorporates exogenous cycles into it. For\nthis model, this paper proves the spontaneous action theorem and action cycle\ntheorem of collective action, and based on numerical simulation and empirical\ncalibration, further confirms the theoretical mechanism involving elements such\nas risk/risk-free incentives and the number of social ties. Based on such\nconclusions and evidence, this paper proposes a theory of spontaneous cycles as\nan integrative answer to the open question of collective action\nformation/cycles.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:39:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ding","FangYiKuang",""],["Xu","Jie",""],["Li","Mingke",""]]}
{"id":"2308.01792","submitter":"Nils Kohl","authors":"Nils Kohl, Daniel Bauer, Fabian B\\\"ohm, Ulrich R\\\"ude","title":"Fundamental Data Structures for Matrix-Free Finite Elements on Hybrid\n  Tetrahedral Grids","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents efficient data structures for the implementation of\nmatrix-free finite element methods on block-structured, hybrid tetrahedral\ngrids. It provides a complete categorization of all geometric sub-objects that\nemerge from the regular refinement of the unstructured, tetrahedral coarse grid\nand describes efficient iteration patterns and analytical linearization\nfunctions for the mapping of coefficients to memory addresses. This foundation\nenables the implementation of fast, extreme-scalable, matrix-free, iterative\nsolvers, and in particular geometric multigrid methods by design. Their\napplication to the variable-coefficient Stokes system subject to an enriched\nGalerkin discretization and to the curl-curl problem discretized with\nN\\'ed\\'elec edge elements showcases the flexibility of the implementation.\nEventually, the solution of a curl-curl problem with $1.6 \\cdot 10^{11}$ (more\nthan one hundred billion) unknowns on more than $32000$ processes with a\nmatrix-free full multigrid solver demonstrates its extreme-scalability.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:41:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kohl","Nils",""],["Bauer","Daniel",""],["B\u00f6hm","Fabian",""],["R\u00fcde","Ulrich",""]]}
{"id":"2308.01793","submitter":"Stanis{\\l}aw Kurzyna","authors":"Marcin Jastrz\\k{e}bski, Stanis{\\l}aw Kurzyna, Bartosz Niewelt, Mateusz\n  Mazelanik, Wojciech Wasilewski, Micha{\\l} Parniak","title":"Spectrum-to-position mapping via programmable spatial dispersion\n  implemented in an optical quantum memory","comments":"7 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectro-temporal processing is essential in reaching ultimate per-photon\ninformation capacity in optical communication and metrology. In contrast to the\nspatial domain, complex multimode processing in the time-frequency domain is\nhowever challenging. Here we propose a protocol for spectrum-to-position\nconversion using spatial spin wave modulation technique in gradient echo\nquantum memory. This way we link the two domains and allow the processing to be\nperformed purely on the spatial modes using conventional optics. We present the\ncharacterization of our interface as well as the frequency estimation\nuncertainty discussion including the comparison with Cram\\'er-Rao bound. The\nexperimental results are backed up by numerical numerical simulations. The\nmeasurements were performed on a single-photon level demonstrating low added\nnoise and proving applicability in a photon-starved regime. Our results hold\nprospects for ultra-precise spectroscopy and present an opportunity to enhance\nmany protocols in quantum and classical communication, sensing, and computing.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:41:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jastrz\u0119bski","Marcin",""],["Kurzyna","Stanis\u0142aw",""],["Niewelt","Bartosz",""],["Mazelanik","Mateusz",""],["Wasilewski","Wojciech",""],["Parniak","Micha\u0142",""]]}
{"id":"2308.01794","submitter":"Qisheng Wang","authors":"Qisheng Wang and Zhicheng Zhang","title":"Quantum Lower Bounds by Sample-to-Query Lifting","comments":"38 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a quantum sample-to-query lifting theorem. It reveals a quadratic\nrelation between quantum sample and query complexities regarding quantum\nproperty testing, which is optimal and saturated by quantum state\ndiscrimination. Based on it, we provide a new method for proving lower bounds\non quantum query algorithms from an information theory perspective. Using this\nmethod, we prove the following new results:\n  1. A matching lower bound $\\widetilde \\Omega(\\beta)$ for quantum Gibbs\nsampling at inverse temperature $\\beta$, showing that the quantum Gibbs sampler\nby Gily\\'en, Su, Low, and Wiebe (2019) is optimal.\n  2. A new lower bound $\\widetilde \\Omega(1/\\sqrt{\\Delta})$ for the\nentanglement entropy problem with gap $\\Delta$, which was recently studied by\nShe and Yuen (2023).\n  In addition, we also provide unified proofs for some known lower bounds that\nhave been proven previously via different techniques, including those for\nphase/amplitude estimation and Hamiltonian simulation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:41:49 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wang","Qisheng",""],["Zhang","Zhicheng",""]]}
{"id":"2308.01795","submitter":"Fabian Hebestreit","authors":"Fabian Hebestreit, Achim Krause, Maxime Ramzi","title":"A note on quadratic forms","comments":"12 pages, comments very welcome (in particular regarding previously\n  known results!)","journal-ref":null,"doi":null,"report-no":"CPH-GEOTOP-DNRF151","categories":"math.AC math.KT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For a field extension $L/K$ we consider maps that are quadratic over $L$ but\nwhose polarisation is only bilinear over $K$. Our main result is that all such\nare automatically quadratic forms over $L$ in the usual sense if and only if\n$L/K$ is formally unramified. In particular, this shows that over finite and\nnumber fields, one of the axioms in the standard definition of quadratic forms\nis superfluous.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:50:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hebestreit","Fabian",""],["Krause","Achim",""],["Ramzi","Maxime",""]]}
{"id":"2308.01796","submitter":"Tianyi Sun","authors":"Tianyi Sun and Bradley Nelson","title":"Greedy Matroid Algorithm And Computational Persistent Homology","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An important problem in computational topology is to calculate the homology\nof a space from samples. In this work, we develop a statistical approach to\nthis problem by calculating the expected rank of an induced map on homology\nfrom a sub-sample to the full space. We develop a greedy matroid algorithm for\nfinding an optimal basis for the image of the induced map, and investigate the\nrelationship between this algorithm and the probability of sampling vectors in\nthe image of the induced map.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:50:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sun","Tianyi",""],["Nelson","Bradley",""]]}
{"id":"2308.01797","submitter":"Davide Zago","authors":"Giovanni Bonetta, Davide Zago, Rossella Cancelliere, Andrea Grosso","title":"Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to\n  Sequence approach","comments":null,"journal-ref":"Proceedings of the International Conference on Learning and\n  Intelligent Optimization (LION17). Springer International Publishing (2023,\n  June)","doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.NE math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Job scheduling is a well-known Combinatorial Optimization problem with\nendless applications. Well planned schedules bring many benefits in the context\nof automated systems: among others, they limit production costs and waste.\nNevertheless, the NP-hardness of this problem makes it essential to use\nheuristics whose design is difficult, requires specialized knowledge and often\nproduces methods tailored to the specific task. This paper presents an original\nend-to-end Deep Reinforcement Learning approach to scheduling that\nautomatically learns dispatching rules. Our technique is inspired by natural\nlanguage encoder-decoder models for sequence processing and has never been\nused, to the best of our knowledge, for scheduling purposes. We applied and\ntested our method in particular to some benchmark instances of Job Shop\nProblem, but this technique is general enough to be potentially used to tackle\nother different optimal job scheduling tasks with minimal intervention. Results\ndemonstrate that we outperform many classical approaches exploiting priority\ndispatching rules and show competitive results on state-of-the-art Deep\nReinforcement Learning ones.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:52:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bonetta","Giovanni",""],["Zago","Davide",""],["Cancelliere","Rossella",""],["Grosso","Andrea",""]]}
{"id":"2308.01798","submitter":"Peng Du","authors":"Peng Du","title":"Reshaping limit diagrams and cofinality in higher category theory","comments":"17 pages, with small correction and addition; reshaped section 6 into\n  two. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present some results on (co)limits of diagrams in $\\infty$-categories, as\nwell as those in $(n, 1)$-categories. In particular, we deduce a way to reshape\ncolimit diagrams into simplicial ones, and a characterizations of\n$n$-cofinality for functor between $\\infty$-categories. Some basics on\n$n$-siftedness are also briefly treated.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:56:29 GMT"},{"version":"v2","created":"Sat, 5 Aug 2023 17:26:19 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 14:52:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Du","Peng",""]]}
{"id":"2308.01799","submitter":"Omar Osenda","authors":"Nicol\\'as Legnazzi and Omar Osenda","title":"Quantum entropies of realistic states of a topological insulator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nanowires of BiSe show topological states localized near the surface of the\nmaterial. The topological nature of these states can be analyzed using\nwell-known quantities. In this paper, we calculate the topological entropy\nsuggested by Kitaev and Preskill for these states together with a new entropy\nbased on a reduced density matrix that we propose as a measure to distinguish\ntopological one-electron states. Our results show that the topological entropy\nis a constant independent of the parameters that characterize a topological\nstate as its angular momentum, longitudinal wave vector, and radius of the\nnanowire. The new entropy is always larger for topological states than for\nnormal ones, allowing the identification of the topological ones. We show how\nthe reduced density matrices associated with both entropies are constructed\nfrom the pure state using positive maps and explicitly obtaining the Krauss\noperators.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:58:00 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Legnazzi","Nicol\u00e1s",""],["Osenda","Omar",""]]}
{"id":"2308.01800","submitter":"Turgay Caglar","authors":"Turgay Caglar, Michael J. Koss, Leonard Burtscher, Benny Trakhtenbrot,\n  M. Kiyami Erdim, Julian E. Mej\\'ia-Restrepo, Federica Ricci, Meredith C.\n  Powell, Claudio Ricci, Richard Mushotzky, Franz E. Bauer, Tonima T. Ananna,\n  Rudolf E. B\\\"ar, Bernhard Brandl, Jarle Brinchmann, Fiona Harrison, Kohei\n  Ichikawa, Darshan Kakkad, Kyuseok Oh, Rog\\'erio Riffel, Lia F. Sartori,\n  Krista L. Smith, Daniel Stern and C. Megan Urry","title":"BASS XXXV. The $M_\\rm{BH}$-$\\sigma_\\rm{\\star}$ Relation of 105-Month\n  Swift-BAT Type 1 AGNs","comments":"Accepted by the 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 two independent measurements of stellar velocity dispersions (\n$\\sigma_\\rm{\\star}$ ) from the Ca\\,H+K \\& Mg\\,\\textsc{i} region\n(3880--5550~\\AA) and the Calcium Triplet region (CaT, 8350--8750~\\AA) for 173\nhard X-ray-selected Type 1 AGNs ($z \\leq$ 0.08) from the 105-month Swift-BAT\ncatalog. We construct one of the largest samples of local Type 1 AGNs that have\nboth single-epoch (SE) 'virial' black hole mass ($M_\\rm{BH}$) estimates and\n$\\sigma_\\rm{\\star}$ measurements obtained from high spectral resolution data,\nallowing us to test the usage of such methods for SMBH studies. We find that\nthe two independent $\\sigma_\\rm{\\star}$ measurements are highly consistent with\neach other, with an average offset of only $0.002\\pm0.001$ dex. Comparing\n$M_\\rm{BH}$ estimates based on broad emission lines and stellar velocity\ndispersion measurements, we find that the former is systematically lower by\n$\\approx$0.12 dex. Consequently, Eddington ratios estimated through broad-line\n$M_\\rm{BH}$ determinations are similarly biased (but in the opposite way). We\nargue that the discrepancy is driven by extinction in the broad-line region\n(BLR). We also find an anti-correlation between the offset from the $M_\\rm{BH}$\n- $\\sigma_\\rm{\\star}$ relation and the Eddington ratio. Our sample of Type 1\nAGNs shows a shallower $M_\\rm{BH}$ - $\\sigma_\\rm{\\star}$ relation (with a power\nlaw exponent of $\\approx$3.5) compared with that of inactive galaxies (with a\npower-law exponent of $\\approx$4.5), confirming earlier results obtained from\nsmaller samples.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:58:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Caglar","Turgay",""],["Koss","Michael J.",""],["Burtscher","Leonard",""],["Trakhtenbrot","Benny",""],["Erdim","M. Kiyami",""],["Mej\u00eda-Restrepo","Julian E.",""],["Ricci","Federica",""],["Powell","Meredith C.",""],["Ricci","Claudio",""],["Mushotzky","Richard",""],["Bauer","Franz E.",""],["Ananna","Tonima T.",""],["B\u00e4r","Rudolf E.",""],["Brandl","Bernhard",""],["Brinchmann","Jarle",""],["Harrison","Fiona",""],["Ichikawa","Kohei",""],["Kakkad","Darshan",""],["Oh","Kyuseok",""],["Riffel","Rog\u00e9rio",""],["Sartori","Lia F.",""],["Smith","Krista L.",""],["Stern","Daniel",""],["Urry","C. Megan",""]]}
{"id":"2308.01801","submitter":"Kyle Gannon","authors":"Gabriel Conant, Kyle Gannon, James E. Hanson","title":"Generic stability, randomizations, and NIP formulas","comments":"37 pages; Fixed important typo","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a number of results relating the concepts of Keisler measures,\ngeneric stability, randomizations, and NIP formulas. Among other things, we do\nthe following: (1) We introduce the notion of a Keisler-Morley measure, which\nplays the role of a Morley sequence for a Keisler measure. We prove that if\n$\\mu$ is fim over $M$, then for any Keisler-Morley measure $\\lambda$ in $\\mu$\nover $M$ and any formula $\\varphi(x,b)$, $\\lim_{i \\to \\infty}\n\\lambda(\\varphi(x_i,b)) = \\mu(\\varphi(x,b))$. We also show that any measure\nsatisfying this conclusion must be fam. (2) We study the map, defined by Ben\nYaacov, taking a definable measure $\\mu$ to a type $r_\\mu$ in the\nrandomization. We prove that this map commutes with Morley products, and that\nif $\\mu$ is fim then $r_\\mu$ is generically stable. (3) We characterize when\ngenerically stable types are closed under Morley products by means of a\nvariation of ict-patterns. Moreover, we show that NTP$_2$ theories satisfy this\nproperty. (4) We prove that if a local measure admits a suitably tame global\nextension, then it has finite packing numbers with respect to any definable\nfamily. We also characterize NIP formulas via the existence of tame extensions\nfor local measures.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:02:52 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 17:32:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Conant","Gabriel",""],["Gannon","Kyle",""],["Hanson","James E.",""]]}
{"id":"2308.01802","submitter":"Hai Lin","authors":"Hai Lin, Jinhong Yuan, Wei Yu, Jingxian Wu, Lajos Hanzo","title":"Multi-Carrier Modulation: An Evolution from Time-Frequency Domain to\n  Delay-Doppler Domain","comments":"This paper has been submitted to the IEEE for possible publication.\n  The supplementary material of this work will be posted at\n  https://www.omu.ac.jp/eng/ees-sic/oddm/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The recently proposed orthogonal delay-Doppler division multiplexing (ODDM)\nmodulation, which is based on the new delay-Doppler (DD) domain orthogonal\npulse (DDOP), is studied. A substantial benefit of the DDOP-based ODDM or\ngeneral delay-Doppler domain multi-carrier (DDMC) modulation is that it\nachieves orthogonality with respect to the fine time and frequency resolutions\nof the DD domain. We first revisit the family of wireless channel models\nconceived for linear time-varying (LTV) channels, and then review the\nconventional multi-carrier (MC) modulation schemes and their design guidelines\nfor both linear time-invariant (LTI) and LTV channels. Then we discuss the\ntime-varying property of the LTV channels' DD domain impulse response and\npropose an impulse function based transmission strategy for equivalent sampled\nDD domain (ESDD) channels. Next, we take an in-depth look into the DDOP and the\ncorresponding ODDM modulation to unveil its unique input-output relation for\ntransmission over ESDD channels. Then, we point out that the conventional MC\nmodulation design guidelines based on the Wely-Heisenberg (WH) frame theory can\nbe relaxed without compromising its orthogonality or without violating the WH\nframe theory. More specifically, for a communication system having given\nbandwidth and duration, MC modulation signals can be designed based on a WH\nsubset associated with sufficient (bi)orthogonality, which governs the\n(bi)orthogonality of the MC signal within the bandwidth and duration. This\nnovel design guideline could potentially open up opportunities for developing\nfuture waveforms required by new applications such as communication systems\nassociated with high delay and/or Doppler shifts, as well as integrated sensing\nand communications, etc.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:03:40 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Hai",""],["Yuan","Jinhong",""],["Yu","Wei",""],["Wu","Jingxian",""],["Hanzo","Lajos",""]]}
{"id":"2308.01803","submitter":"Wenpin Tang","authors":"Wenpin Tang","title":"Trading and wealth evolution in the Proof of Stake protocol","comments":"23 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2206.10105","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN math.OC q-fin.EC q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the increasing adoption of the Proof of Stake (PoS) blockchain, it is\ntimely to study the economy created by such blockchain. In this chapter, we\nwill survey recent progress on the trading and wealth evolution in a\ncryptocurrency where the new coins are issued according to the PoS protocol. We\nfirst consider the wealth evolution in the PoS protocol assuming no trading,\nand focus on the problem of decentralisation. Next we consider each miner's\ntrading incentive and strategy through the lens of optimal control, where the\nminer needs to trade off PoS mining and trading. Finally, we study the\ncollective behavior of the miners in a PoS trading environment by a mean field\nmodel. We use both stochastic and analytic tools in our study. A list of open\nproblems are also presented.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:05:08 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 00:24:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tang","Wenpin",""]]}
{"id":"2308.01804","submitter":"Siqi Fan","authors":"Siqi Fan, Haibao Yu, Wenxian Yang, Jirui Yuan, Zaiqing Nie","title":"QUEST: Query Stream for Vehicle-Infrastructure Cooperative Perception","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cooperative perception can effectively enhance individual perception\nperformance by providing additional viewpoint and expanding the sensing field.\nExisting cooperation paradigms are either interpretable (result cooperation) or\nflexible (feature cooperation). In this paper, we propose the concept of query\ncooperation to enable interpretable instance-level flexible feature\ninteraction. To specifically explain the concept, we propose a cooperative\nperception framework, termed QUEST, which let query stream flow among agents.\nThe cross-agent queries are interacted via fusion for co-aware instances and\ncomplementation for individual unaware instances. Taking camera-based\nvehicle-infrastructure perception as a typical practical application scene, the\nexperimental results on the real-world dataset, DAIR-V2X-Seq, demonstrate the\neffectiveness of QUEST and further reveal the advantage of the query\ncooperation paradigm on transmission flexibility and robustness to packet\ndropout. We hope our work can further facilitate the cross-agent representation\ninteraction for better cooperative perception in practice.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:06:23 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fan","Siqi",""],["Yu","Haibao",""],["Yang","Wenxian",""],["Yuan","Jirui",""],["Nie","Zaiqing",""]]}
{"id":"2308.01805","submitter":"A. Salch","authors":"A. Salch","title":"KU-local zeta-functions of finite CW-complexes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Begin with the Hasse-Weil zeta-function of a smooth projective variety over\nthe rational numbers. Replace the variety with a finite CW-complex, replace\netale cohomology with complex K-theory $KU^*$, and replace the $p$-Frobenius\noperator with the $p$th Adams operation on $K$-theory. This simple idea yields\na kind of \"$KU$-local zeta-function\" of a finite CW-complex. For a wide range\nof finite CW-complexes $X$ with torsion-free $K$-theory, we show that this\nzeta-function admits analytic continuation to a meromorphic function on the\ncomplex plane, with a nice functional equation, and whose special values in the\nleft half-plane recover the $KU$-local stable homotopy groups of $X$ away from\n$2$.\n  We then consider a more general and sophisticated version of the $KU$-local\nzeta-function, one which is suited to finite CW-complexes $X$ with nontrivial\ntorsion in their $K$-theory. This more sophisticated $KU$-local zeta-function\ninvolves a product of $L$-functions of complex representations of the torsion\nsubgroup of $KU^0(X)$, similar to how the Dedekind zeta-function of a number\nfield factors as a product of Artin $L$-functions of complex representations of\nthe Galois group. For a wide range of such finite CW-complexes $X$, we prove\nanalytic continuation, and we show that the special values in the left\nhalf-plane recover the $KU$-local stable homotopy groups of $X$ away from $2$\nif and only if the skeletal filtration on the torsion subgroup of $KU^0(X)$\nsplits completely.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:08:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Salch","A.",""]]}
{"id":"2308.01806","submitter":"Giampaolo Folena","authors":"Giampaolo Folena and Patrick Charbonneau","title":"Glass-like Caging with Random Planes","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The richness of the mean-field solution of simple glasses leaves many of its\nfeatures challenging to interpret. A minimal model that illuminates glass\nphysics the same way the random energy model clarifies spin glass behavior\nwould therefore be beneficial. Here, we propose such a real-space model that is\namenable to infinite-dimensional analysis and is exactly solvable at high and\nlow densities in finite dimension. By joining analysis with numerical\nsimulations, we uncover geometrical signatures of the dynamical and jamming\ntransitions and provides insight into the origin of activated processes.\nTranslating these findings to the context of standard glass formers further\nreveals the role played by non-convexity in the emergence of Gardner physics.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:11:46 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Folena","Giampaolo",""],["Charbonneau","Patrick",""]]}
{"id":"2308.01807","submitter":"Boris Bantysh","authors":"A. Yu. Chernyavskiy, B. I. Bantysh","title":"Entropic property of randomized QAOA circuits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum approximate optimization algorithm (QAOA) aims to minimize some\nbinary objective function by sampling bitstrings using a parameterized quantum\ncircuit. In contrast to common optimization-based methods for searching circuit\nparameters (angles), here we consider choosing them at random. Despite the fact\nthat this approach does not outperform classical algorithms for quadratic\nunconstrained spin optimization (QUSO) problems, including Max-Cut, it\nsurprisingly provides an advantage over the classical random search.\nInvestigation of this effect has led us to the following conjecture: given the\nprobability distribution of obtaining distinct objective values, random\nparameters QAOA for QUSO problems always gives a higher entropy of this\ndistribution than the classical random search. We also provide an analytical\nexpressions for the distribution.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:13:23 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 15:38:04 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 15:21:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chernyavskiy","A. Yu.",""],["Bantysh","B. I.",""]]}
{"id":"2308.01808","submitter":"Atanu Koley","authors":"Atanu Koley","title":"Turbulence measurements in the neutral ISM from Hi-21 cm\n  emission-absorption spectra","comments":"Accepted for publication in PASA","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the correlation between the non-thermal velocity dispersion\n($\\sigma_{\\rm nth}$) and the length-scale (L) in the neutral interstellar\nmedium (ISM) using a large number of Hi gas components taken from various\npublished Hi surveys and previous Hi studies. We notice that above the\nlength-scale ($L$) of 0.40 pc, there is a power-law relationship between\n$\\sigma_{\\rm nth}$ and $L$. However, below 0.40 pc, there is a break in the\npower-law, where $\\sigma_{\\rm nth}$ is not significantly correlated with $L$.\nIt has been observed from the Markov chain Monte Carlo (MCMC) method that for\nthe dataset of $L > 0.40$ pc, the most probable values of intensity ($A$) and\npower-law index ($p$) are 1.14 and 0.55 respectively. Result of $p$ suggests\nthat the power-law is steeper than the standard Kolmogorov law of turbulence.\nThis is due to the dominance of clouds in the cold neutral medium. This is even\nmore clear when we separate the clouds into two categories: one for $L$ is >\n0.40 pc and the kinetic temperature ($T_k$ ) is < 250 K, which are in the cold\nneutral medium (CNM) and for other one where L is > 0.40 pc and T k is between\n250 K and 5000 K, which are in the thermally unstable phase (UNM). Most\nprobable values of $A$ and $p$ are 1.14 and 0.67 respectively in the CNM phase\nand 1.01 and 0.52 respectively in the UNM phase. A greater number of data\npoints is effective for the UNM phase in constructing a more accurate estimate\nof $A$ and $p$, since most of the clouds in the UNM phase lie below 500 K.\nHowever, from the value of $p$ in the CNM phase, it appears that there is a\nsignificant difference from the Kolmogorov scaling, which can be attributed to\na shock-dominated medium.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:15:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Koley","Atanu",""]]}
{"id":"2308.01809","submitter":"Eric Vasserot","authors":"Michela Varagnolo and Eric Vasserot","title":"Non symmetric quantum loop groups and critical convolution algebras","comments":"37 pages. arXiv admin note: text overlap with arXiv:2302.01418","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We realize the quantum loop groups and shifted quantum loop groups of\narbitrary types, possibly non symmetric, via the K-theoretical critical\nconvolution algebras introduced by Varagnolo-Vasserot. This yields a\ngeneralization of Nakajima's construction of symmetric quantum loop groups via\nquiver varieties to non symmetric types. We also construct some simple modules,\nin particular all Kirillov-Reshethikin modules, using critical K-theory.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:17:19 GMT"}],"update_date":"2023-08-05","authors_parsed":[["Varagnolo","Michela",""],["Vasserot","Eric",""]]}
{"id":"2308.01810","submitter":"Zeman Shao","authors":"Zeman Shao, Gautham Vinod, Jiangpeng He, Fengqing Zhu","title":"An End-to-end Food Portion Estimation Framework Based on Shape\n  Reconstruction from Monocular Image","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dietary assessment is a key contributor to monitoring health status. Existing\nself-report methods are tedious and time-consuming with substantial biases and\nerrors. Image-based food portion estimation aims to estimate food energy values\ndirectly from food images, showing great potential for automated dietary\nassessment solutions. Existing image-based methods either use a single-view\nimage or incorporate multi-view images and depth information to estimate the\nfood energy, which either has limited performance or creates user burdens. In\nthis paper, we propose an end-to-end deep learning framework for food energy\nestimation from a monocular image through 3D shape reconstruction. We leverage\na generative model to reconstruct the voxel representation of the food object\nfrom the input image to recover the missing 3D information. Our method is\nevaluated on a publicly available food image dataset Nutrition5k, resulting a\nMean Absolute Error (MAE) of 40.05 kCal and Mean Absolute Percentage Error\n(MAPE) of 11.47% for food energy estimation. Our method uses RGB image as the\nonly input at the inference stage and achieves competitive results compared to\nthe existing method requiring both RGB and depth information.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:17:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Shao","Zeman",""],["Vinod","Gautham",""],["He","Jiangpeng",""],["Zhu","Fengqing",""]]}
{"id":"2308.01811","submitter":"Zhiyun Cheng","authors":"Zhiyun Cheng","title":"Intersection graph and writhe polynomial","comments":"9 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that two virtual knots have equivalent intersection graphs if and\nonly if they have the same writhe polynomial.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:17:26 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cheng","Zhiyun",""]]}
{"id":"2308.01812","submitter":"Daniela Cors","authors":"Daniela Cors, Sarah Renkhoff, Hannes R. R\\\"uter, David Hilditch and\n  Bernd Br\\\"ugmann","title":"Formulation Improvements for Critical Collapse Simulations","comments":"19 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The precise tuning required to observe critical phenomena in gravitational\ncollapse poses a challenge for most numerical codes. First, threshold\nestimation searches may be obstructed by the appearance of coordinate\nsingularities, indicating the need for a better gauge choice. Second, the\nconstraint violations to which simulations are susceptible may be too large and\nforce searches to terminate prematurely. This is a particularly serious issue\nfor first order formulations. We want our adaptive pseudospectral code bamps to\nbe a robust tool for the study of critical phenomena so, having encountered\nboth of these difficulties in work on the vacuum setting, we turn here to\ninvestigate these issues in the classic context of a spherically symmetric\nmassless scalar field. We suggest two general improvements. We propose a\nnecessary condition for a gauge choice to respect discrete self-similarity\n(DSS). The condition is not restricted to spherical symmetry and could be\nverified with any 3+1 formulation. After evaluating common gauge choices\nagainst this condition, we suggest a DSS-compatible gauge source function in\ngeneralized harmonic gauge (GHG). To control constraint violations, we modify\nthe constraint damping parameters of GHG, adapting them to collapse spacetimes.\nThis allows us to improve our tuning of the critical amplitude for several\nfamilies of initial data, even going from 6 up to 11 digits. This is the most\nprecise tuning achieved with the first order GHG formulation to date.\nConsequently, we are able to reproduce the well known critical phenomena as\nwell as competing formulations and methods, clearly observing up to 3 echoes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:17:42 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cors","Daniela",""],["Renkhoff","Sarah",""],["R\u00fcter","Hannes R.",""],["Hilditch","David",""],["Br\u00fcgmann","Bernd",""]]}
{"id":"2308.01813","submitter":"Asish Bera","authors":"Asish Bera, Debotosh Bhattacharjee, and Mita Nasipuri","title":"Deep Neural Networks Fused with Textures for Image Classification","comments":"14 pages, 6 figures, 4 tables, conference","journal-ref":"Proceedings of International Conference on Frontiers in Computing\n  and Systems. COMSYS 2022","doi":"10.1007/978-981-99-2680-0_10","report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fine-grained image classification (FGIC) is a challenging task in computer\nvision for due to small visual differences among inter-subcategories, but,\nlarge intra-class variations. Deep learning methods have achieved remarkable\nsuccess in solving FGIC. In this paper, we propose a fusion approach to address\nFGIC by combining global texture with local patch-based information. The first\npipeline extracts deep features from various fixed-size non-overlapping patches\nand encodes features by sequential modelling using the long short-term memory\n(LSTM). Another path computes image-level textures at multiple scales using the\nlocal binary patterns (LBP). The advantages of both streams are integrated to\nrepresent an efficient feature vector for image classification. The method is\ntested on eight datasets representing the human faces, skin lesions, food\ndishes, marine lives, etc. using four standard backbone CNNs. Our method has\nattained better classification accuracy over existing methods with notable\nmargins.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:21:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bera","Asish",""],["Bhattacharjee","Debotosh",""],["Nasipuri","Mita",""]]}
{"id":"2308.01814","submitter":"Greg Yang","authors":"Greg Yang, Etai Littwin","title":"Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limit","comments":"This is the complete version of \"Adaptive Optimization in the\n  Infinite-Width Limit\" in ICLR 2023,\n  https://openreview.net/forum?id=zgVDqw9ZUES","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cond-mat.dis-nn cs.NE math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Going beyond stochastic gradient descent (SGD), what new phenomena emerge in\nwide neural networks trained by adaptive optimizers like Adam? Here we show:\nThe same dichotomy between feature learning and kernel behaviors (as in SGD)\nholds for general optimizers as well, including Adam -- albeit with a nonlinear\nnotion of \"kernel.\" We derive the corresponding \"neural tangent\" and \"maximal\nupdate\" limits for any architecture. Two foundational advances underlie the\nabove results: 1) A new Tensor Program language, NEXORT, that can express how\nadaptive optimizers process gradients into updates. 2) The introduction of\nbra-ket notation to drastically simplify expressions and calculations in Tensor\nPrograms. This work summarizes and generalizes all previous results in the\nTensor Programs series of papers.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:22:51 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 04:47:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Greg",""],["Littwin","Etai",""]]}
{"id":"2308.01815","submitter":"Marie-No\\\"elle C\\'el\\'erier","authors":"M.-N. C\\'el\\'erier","title":"Interior spacetimes sourced by stationary differentially rotating\n  irrotational cylindrical fluids. IV. Radial pressure","comments":"18 pages, no figure. arXiv admin note: text overlap with\n  arXiv:2307.13547, arXiv:2307.07263","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent series of papers new exact analytical solutions of the field\nequations of General Relativity representing interior spacetimes sourced by\nstationary rigidly rotating cylinders of fluids with various equations of state\nhave been displayed. This work is currently extended to the cases of\ndifferentially rotating irrotational fluids. The results are presented in a new\nseries of papers considering, in turn, a perfect fluid source, as well as the\nthree anisotropic pressure cases already studied in the rigidly rotating\nconfiguration. Here, we analyze the case of a fluid with radially directed\npressure. Four classes of solutions are identified from the field equations.\nAmong them, class I and III are fully integrated, and their mathematical and\nphysical properties are studied, which implies a ruling out of class III for\nlack of proper metric signature. For each of the two other classes, a set of\nsimplified differential equation is displayed so as to ease their possible\nfurther numerical integration. Finally, a comparison with the corresponding\nrigidly rotating fluid solution is provided.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:24:52 GMT"}],"update_date":"2023-08-04","authors_parsed":[["C\u00e9l\u00e9rier","M. -N.",""]]}
{"id":"2308.01816","submitter":"Sergei Silvestrov","authors":"Talat Nazir, Zakaria Ali, Shahin Nosrat Jogan, Sergei Silvestrov","title":"Fixed point results for set-contractions on semi-metric space with a\n  directed graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fixed point results with respect to generalized rational contractive mappings\nin semi-metric spaces endowed with a directed graph are proved. Some examples\nare provided to illustrate the results. The obtained results extend, improve\nand generalize many results in the existing literature.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 02:20:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Nazir","Talat",""],["Ali","Zakaria",""],["Jogan","Shahin Nosrat",""],["Silvestrov","Sergei",""]]}
{"id":"2308.01817","submitter":"Youngseo Kim","authors":"Youngseo Kim, Samitha Samaranayake, Damon Wischik","title":"A Combined Convex Model for Travel Demand Forecasting with Hierarchical\n  Extended Logit Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The travel demand forecasting model plays a crucial role in evaluating\nlarge-scale infrastructure projects, such as the construction of new roads or\ntransit lines. While combined modeling approaches have been explored as a\nsolution to overcome the problem of input and output discrepancies in a\nsequential four-step modeling process, previous attempts at combined models\nhave encountered challenges in real-world applications, primarily due to their\nlimited behavioral richness or computational tractability. In this study, we\npropose a novel convex programming approach and present a key theorem\ndemonstrating that the optimal solution is the same as the one from solving the\nhierarchical extended logit model. This model is specifically designed to\ncapture correlations existing in travelers' choices, including similarities\namong transport modes and route overlaps. The convex property of our model\nensures the existence and uniqueness of solutions and offers computational\nefficiency. The advantages of our proposed model are twofold. Firstly, it\nprovides a single unifying rationale (i.e., utility maximization) that is valid\nacross all steps. Secondly, its combined nature allows a systematic approach to\nhandling observed data, enabling a more realistic representation of reality. By\naddressing the limited behavior richness of previous combined models, our\nconvex programming-based approach shows promise in enhancing the accuracy and\napplicability of travel demand forecasting, thereby aiding in the planning and\ndecision-making processes for infrastructure projects.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:22:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kim","Youngseo",""],["Samaranayake","Samitha",""],["Wischik","Damon",""]]}
{"id":"2308.01818","submitter":"Carlo Bellavita","authors":"Carlo Bellavita, Marco M. Peloso","title":"Duality, $BMO$ and Hankel operators on Bernstein spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we deal with the problem of describing the dual space\n$(B^1_\\kappa)^*$ of the Bernstein space $B^1_\\kappa$, that is the space of\nentire functions of exponential type at most $\\kappa>0$ whose restriction to\nthe real line is Lebesgue integrable. We provide several characterisations,\nshowing that such dual space can be described as a quotient of the space of\nentire functions of exponential type $\\kappa$ whose restrictions to the real\nline is Lebesgue integrable. We provide several characterisations, showing that\nsuch dual space can be described as a quotient of the space of entire functions\nof exponential type $\\kappa$ whose restrictions to the real line is in a\nsuitable $BMO$-type space, or as the space of symbols $b$ for which the Hankel\noperatorc $H_b$ is bounded on the Paley-Wiener space $B^2_{\\kappa/2}$. We also\nprovide a characterisation of $(B^1_\\kappa)^*$ as the $BMO$ space w.r.t. the\nClark measure of the inner function $e^{i\\kappa z}$ on the upper half-plane, in\nanalogy with the known description of the dual of backward-shift invariant\n$1$-spaces on the torus. Furthermore, we show that the orthogonal projection\n$P_\\kappa\\ : L^2(R)\\to B^2_\\kappa$ induces a bounded operator from\n$L^\\infty(R)$ onto $(B^1_\\kappa)^*$. Finally, we show that $B^1_\\kappa$ is the\ndual space of the suitable $VMO$-type space or as the space of symbols $b$ for\nwhich the Hankel opertor $H_b$ on the Paley-Wiener space $B^2_{k/2}$ is\ncompact.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:28:09 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bellavita","Carlo",""],["Peloso","Marco M.",""]]}
{"id":"2308.01819","submitter":"Andrea Ercolino","authors":"Andrea Ercolino, Harim Jin, Norbert Langer, Luc Dessart","title":"Interacting supernovae from wide massive binary systems","comments":"27 pages, 16 figures. Submitted to A&A. Abstract is abridged.\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":"  Many supernovae (SNe) imply an interaction of the SN ejecta with matter (CSM)\nsurrounding the progenitor star. This suggests that many massive stars may\nundergo various degrees of envelope stripping shortly before exploding, and\nproduce a considerable diversity in their pre-explosion CSM properties. We\nexplore a generic set of ~100 detailed massive binary evolution models to\ncharacterize the amount of envelope stripping and the expected CSM\nconfigurations. Our binary models were computed with the MESA stellar evolution\ncode, considering an initial primary star mass of 12.6 Msun, and focus on\ninitial orbital periods above 500 d. We compute these models up to the time of\nthe primary's iron core collapse. We find that Roche lobe overflow often leads\nto incomplete stripping of the mass donor, resulting in a large variety of\npre-SN envelope masses. Many of our models' red supergiant (RSG) donors undergo\ncore collapse during Roche lobe overflow, with mass transfer and thus system\nmass loss rates of up to 0.01 Msun/yr at that time. The corresponding CSM\ndensities are similar to those inferred for Type IIn SNe like 1998S. In other\ncases, the mass transfer turns unstable, leading to a common envelope phase at\nsuch late time that the mass donor explodes before the common envelope is fully\nejected or the system has merged. We argue that this may cause significant\npre-SN variability, as for example in SN 2020tlf. Other models suggest a common\nenvelope ejection just centuries before core collapse, which may lead to the\nstrongest interactions, as in superluminous Type IIn SNe like 1994W, or 2006gy.\nWide massive binaries offer a natural framework to understand a broad range of\nhydrogen-rich interacting SNe. On the other hand, the flash features observed\nin many Type IIP SNe, like in SN 2013fs, may indicate that RSGs are more\nextended than currently assumed.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:30:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ercolino","Andrea",""],["Jin","Harim",""],["Langer","Norbert",""],["Dessart","Luc",""]]}
{"id":"2308.01820","submitter":"Justin Feuto","authors":"Jean-Marcel Tanoh Dje and Justin Feuto","title":"A generalization of representation theorems in Hardy-Orlicz spaces on\n  the upper complex half-plane","comments":"37 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we give Poisson and Cauchy representation theorems in\nHardy-Orlicz spaces on the upper complex half-plane. We use these theorems for\nthe construction of dual spaces of certain Hardy-Orlicz spaces and also for the\ncharacterization of some classical operators in Orlicz spaces.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:31:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Dje","Jean-Marcel Tanoh",""],["Feuto","Justin",""]]}
{"id":"2308.01821","submitter":"Benjamin Hollering","authors":"Mathias Drton, Benjamin Hollering, and Jun Wu","title":"Identifiability of Homoscedastic Linear Structural Equation Models using\n  Algebraic Matroids","comments":"21 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider structural equation models (SEMs), in which every variable is a\nfunction of a subset of the other variables and a stochastic error. Each such\nSEM is naturally associated with a directed graph describing the relationships\nbetween variables. When the errors are homoscedastic, recent work has proposed\nmethods for inferring the graph from observational data under the assumption\nthat the graph is acyclic (i.e., the SEM is recursive). In this work, we study\nthe setting of homoscedastic errors but allow the graph to be cyclic (i.e., the\nSEM to be non-recursive). Using an algebraic approach that compares matroids\nderived from the parameterizations of the models, we derive sufficient\nconditions for when two simple directed graphs generate different distributions\ngenerically. Based on these conditions, we exhibit subclasses of graphs that\nallow for directed cycles, yet are generically identifiable. We also conjecture\na strengthening of our graphical criterion which can be used to distinguish\nmany more non-complete graphs.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:32:54 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Drton","Mathias",""],["Hollering","Benjamin",""],["Wu","Jun",""]]}
{"id":"2308.01822","submitter":"Birgit Jacob","authors":"Birgit Jacob and Hans Zwart","title":"Infinite-dimensional linear port-Hamiltonian systems on a\n  one-dimensional spatial domain: An Introduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide an introduction to infinite-dimensional port-Hamiltonian systems.\nAs this research field is quite rich, we restrict ourselves to the class of\ninfinite-dimensional linear port-Hamiltonian systems on a one-dimensional\nspatial domainand we will focus on topics such as Dirac structures,\nwell-posedness, stability and stabilizability, Riesz-bases and dissipativity.\nWe combine the abstract operator theoretic approach with the more physical\napproach based on Hamiltonians. This enables us to derive easy verifiable\nconditions for well-posedness and stability.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:33:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Jacob","Birgit",""],["Zwart","Hans",""]]}
{"id":"2308.01823","submitter":"Xiang Ji","authors":"Chenhao Lin, Xiang Ji, Yulong Yang, Qian Li, Chao Shen, Run Wang,\n  Liming Fang","title":"Hard Adversarial Example Mining for Improving Robust Fairness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adversarial training (AT) is widely considered the state-of-the-art technique\nfor improving the robustness of deep neural networks (DNNs) against adversarial\nexamples (AE). Nevertheless, recent studies have revealed that adversarially\ntrained models are prone to unfairness problems, restricting their\napplicability. In this paper, we empirically observe that this limitation may\nbe attributed to serious adversarial confidence overfitting, i.e., certain\nadversarial examples with overconfidence. To alleviate this problem, we propose\nHAM, a straightforward yet effective framework via adaptive Hard Adversarial\nexample Mining.HAM concentrates on mining hard adversarial examples while\ndiscarding the easy ones in an adaptive fashion. Specifically, HAM identifies\nhard AEs in terms of their step sizes needed to cross the decision boundary\nwhen calculating loss value. Besides, an early-dropping mechanism is\nincorporated to discard the easy examples at the initial stages of AE\ngeneration, resulting in efficient AT. Extensive experimental results on\nCIFAR-10, SVHN, and Imagenette demonstrate that HAM achieves significant\nimprovement in robust fairness while reducing computational cost compared to\nseveral state-of-the-art adversarial training methods. The code will be made\npublicly available.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:33:24 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Chenhao",""],["Ji","Xiang",""],["Yang","Yulong",""],["Li","Qian",""],["Shen","Chao",""],["Wang","Run",""],["Fang","Liming",""]]}
{"id":"2308.01824","submitter":"Miaomiao Han","authors":"Jiani Zou, Miaomiao Han, Hong-Jian Lai","title":"Square Coloring of Planar Graphs with Maximum Degree at Most Five","comments":"This is the second version. The preliminary version is uploaded to\n  arxiv on Augest 2nd. After completing this paper, we learned that Kengo Aoki\n  also proved the main result of this paper independently in arXiv:2307.16394","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The \\textit{square} of a graph $G$, denoted by $G^2$, is obtained from $G$ by\nadding an edge to connect every pair of vertices with a common neighbor in $G$.\nIn this paper we prove that for every planar graph $G$ with maximum degree at\nmost $5$, $G^2$ admits a proper vertex coloring using at most $17$ colors,\nwhich improves the upper bound $18$ recently obtained by Hou, Jin, Miao, and\nZhao.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:33:53 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 10:02:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zou","Jiani",""],["Han","Miaomiao",""],["Lai","Hong-Jian",""]]}
{"id":"2308.01825","submitter":"Hongyi Yuan","authors":"Zheng Yuan, Hongyi Yuan, Chengpeng Li, Guanting Dong, Chuanqi Tan,\n  Chang Zhou","title":"Scaling Relationship on Learning Mathematical Reasoning with Large\n  Language Models","comments":"Working in Progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mathematical reasoning is a challenging task for large language models\n(LLMs), while the scaling relationship of it with respect to LLM capacity is\nunder-explored. In this paper, we investigate how the pre-training loss,\nsupervised data amount, and augmented data amount influence the reasoning\nperformances of a supervised LLM. We find that pre-training loss is a better\nindicator of the model's performance than the model's parameter count. We apply\nsupervised fine-tuning (SFT) with different amounts of supervised data and\nempirically find a log-linear relation between data amount and model\nperformance, and we find better models improve less with enlarged supervised\ndatasets. To augment more data samples for improving model performances without\nany human effort, we propose to apply Rejection sampling Fine-Tuning (RFT). RFT\nuses supervised models to generate and collect correct reasoning paths as\naugmented fine-tuning datasets. We find with augmented samples containing more\ndistinct reasoning paths, RFT improves mathematical reasoning performance more\nfor LLMs. We also find RFT brings more improvement for less performant LLMs.\nFurthermore, we combine rejection samples from multiple models which push\nLLaMA-7B to an accuracy of 49.3% and outperforms the supervised fine-tuning\n(SFT) accuracy of 35.9% significantly.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:34:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yuan","Zheng",""],["Yuan","Hongyi",""],["Li","Chengpeng",""],["Dong","Guanting",""],["Tan","Chuanqi",""],["Zhou","Chang",""]]}
{"id":"2308.01826","submitter":"Leon Baeck","authors":"Leon Baeck, Sebastian Blauth, Christian Leith\\\"auser, Ren\\'e Pinnau,\n  Kevin Sturm","title":"Topology Optimization for Uniform Flow Distribution in Electrolysis\n  Cells","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we consider the topology optimization for a bipolar plate of a\nhydrogen electrolysis cell. We present a model for the bipolar plate using the\nStokes equation with an additional drag term, which models the influence of\nfluid and solid regions. Furthermore, we derive a criterion for a uniform flow\ndistribution in the bipolar plate. To obtain shapes that are\nwell-manufacturable, we introduce a novel smoothing technique for the fluid\nvelocity. Finally, we present some numerical results and investigate the\ninfluence of the smoothing on the obtained shapes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:37:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Baeck","Leon",""],["Blauth","Sebastian",""],["Leith\u00e4user","Christian",""],["Pinnau","Ren\u00e9",""],["Sturm","Kevin",""]]}
{"id":"2308.01827","submitter":"Oleksandr Kyriienko","authors":"Annie E. Paine, Vincent E. Elfving, Oleksandr Kyriienko","title":"Physics-Informed Quantum Machine Learning: Solving nonlinear\n  differential equations in latent spaces without costly grid evaluations","comments":"14+2 pages, 6+1 figures. Codename: \"parallel DQC\"","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":"  We propose a physics-informed quantum algorithm to solve nonlinear and\nmultidimensional differential equations (DEs) in a quantum latent space. We\nsuggest a strategy for building quantum models as state overlaps, where\nexponentially large sets of independent basis functions are used for implicitly\nrepresenting solutions. By measuring the overlaps between states which are\nrepresentations of DE terms, we construct a loss that does not require\nindependent sequential function evaluations on grid points. In this sense, the\nsolver evaluates the loss in an intrinsically parallel way, utilizing a global\ntype of the model. When the loss is trained variationally, our approach can be\nrelated to the differentiable quantum circuit protocol, which does not scale\nwith the training grid size. Specifically, using the proposed model definition\nand feature map encoding, we represent function- and derivative-based terms of\na differential equation as corresponding quantum states. Importantly, we\npropose an efficient way for encoding nonlinearity, for some bases requiring\nonly an additive linear increase of the system size $\\mathcal{O}(N + p)$ in the\ndegree of nonlinearity $p$. By utilizing basis mapping, we show how the\nproposed model can be evaluated explicitly. This allows to implement arbitrary\nfunctions of independent variables, treat problems with various initial and\nboundary conditions, and include data and regularization terms in the\nphysics-informed machine learning setting. On the technical side, we present\ntoolboxes for exponential Chebyshev and Fourier basis sets, developing tools\nfor automatic differentiation and multiplication, implementing nonlinearity,\nand describing multivariate extensions. The approach is compatible with, and\ntested on, a range of problems including linear, nonlinear and multidimensional\ndifferential equations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:38:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Paine","Annie E.",""],["Elfving","Vincent E.",""],["Kyriienko","Oleksandr",""]]}
{"id":"2308.01828","submitter":"Stav Marcus","authors":"Stav Marcus, Ari M Turner and Guy Bunin","title":"Local and extensive fluctuations in sparsely-interacting ecological\n  communities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE cond-mat.dis-nn cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ecological communities with many species can be classified into dynamical\nphases. In systems with all-to-all interactions, a phase where a fixed point is\nalways reached and a dynamically-fluctuating phase have been found. The\ndynamics when interactions are sparse, with each species interacting with only\nseveral others, has remained largely unexplored. Here we show that a new type\nof phase appears in the phase diagram, where for the same control parameters\ndifferent communities may reach either a fixed point or a state where the\nabundances of a finite subset of species fluctuate, and calculate the\nprobability for each outcome. These fluctuating species are organized around\nshort cycles in the interaction graph, and their abundances undergo large\nnon-linear fluctuations. We characterize the approach from this phase to a\nphase with extensively many fluctuating species, and show that the probability\nof fluctuations grows continuously to one as the transition is approached, and\nthat the number of fluctuating species diverges. This is qualitatively distinct\nfrom the transition to extensive fluctuations coming from a fixed point phase,\nwhich is marked by a loss of linear stability. The differences are traced back\nto the emergent binary character of the dynamics when far away from short\ncycles in the local fluctuations phase.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:39:26 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Marcus","Stav",""],["Turner","Ari M",""],["Bunin","Guy",""]]}
{"id":"2308.01829","submitter":"Parker Ewen","authors":"Parker Ewen, Gitesh Gunjal, Joey Wilson, Jinsun Liu, Challen Enninful\n  Adu, and Ram Vasudevan","title":"Not All Actions Are Created Equal: Bayesian Optimal Experimental Design\n  for Safe and Optimal Nonlinear System Identification","comments":null,"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":"  Uncertainty in state or model parameters is common in robotics and typically\nhandled by acquiring system measurements that yield information about the\nuncertain quantities of interest. Inputs to a nonlinear dynamical system yield\noutcomes that produce varying amounts of information about the underlying\nuncertain parameters of the system. To maximize information gained with respect\nto these uncertain parameters we present a Bayesian approach to data collection\nfor system identification called Bayesian Optimal Experimental Design (BOED).\nThe formulation uses parameterized trajectories and cubature to compute\nmaximally informative system trajectories which obtain as much information as\npossible about unknown system parameters while also ensuring safety under mild\nassumptions. The proposed method is applicable to non-linear and non-Gaussian\nsystems and is applied to a high-fidelity vehicle model from the literature. It\nis shown the proposed approach requires orders of magnitude fewer samples\ncompared to state-of-the-art BOED algorithms from the literature while\nsimultaneously providing safety guarantees.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:40:08 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ewen","Parker",""],["Gunjal","Gitesh",""],["Wilson","Joey",""],["Liu","Jinsun",""],["Adu","Challen Enninful",""],["Vasudevan","Ram",""]]}
{"id":"2308.01830","submitter":"Nicolas Deperrois","authors":"Nicolas Deperrois, Mihai A. Petrovici, Walter Senn, and Jakob Jordan","title":"Learning beyond sensations: how dreams organize neuronal representations","comments":"16 pages, 3 figures, perspective article","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semantic representations in higher sensory cortices form the basis for\nrobust, yet flexible behavior. These representations are acquired over the\ncourse of development in an unsupervised fashion and continuously maintained\nover an organism's lifespan. Predictive learning theories propose that these\nrepresentations emerge from predicting or reconstructing sensory inputs.\nHowever, brains are known to generate virtual experiences, such as during\nimagination and dreaming, that go beyond previously experienced inputs. Here,\nwe suggest that virtual experiences may be just as relevant as actual sensory\ninputs in shaping cortical representations. In particular, we discuss two\ncomplementary learning principles that organize representations through the\ngeneration of virtual experiences. First, \"adversarial dreaming\" proposes that\ncreative dreams support a cortical implementation of adversarial learning in\nwhich feedback and feedforward pathways engage in a productive game of trying\nto fool each other. Second, \"contrastive dreaming\" proposes that the invariance\nof neuronal representations to irrelevant factors of variation is acquired by\ntrying to map similar virtual experiences together via a contrastive learning\nprocess. These principles are compatible with known cortical structure and\ndynamics and the phenomenology of sleep thus providing promising directions to\nexplain cortical learning beyond the classical predictive learning paradigm.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:45:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Deperrois","Nicolas",""],["Petrovici","Mihai A.",""],["Senn","Walter",""],["Jordan","Jakob",""]]}
{"id":"2308.01831","submitter":"Minsu Kim","authors":"Minsu Kim, Jeongsoo Choi, Dahun Kim, Yong Man Ro","title":"Many-to-Many Spoken Language Translation via Unified Speech and Text\n  Representation Learning with Unit-to-Unit Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL eess.AS eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a method to learn unified representations of\nmultilingual speech and text with a single model, especially focusing on the\npurpose of speech synthesis. We represent multilingual speech audio with speech\nunits, the quantized representations of speech features encoded from a\nself-supervised speech model. Therefore, we can focus on their linguistic\ncontent by treating the audio as pseudo text and can build a unified\nrepresentation of speech and text. Then, we propose to train an encoder-decoder\nstructured model with a Unit-to-Unit Translation (UTUT) objective on\nmultilingual data. Specifically, by conditioning the encoder with the source\nlanguage token and the decoder with the target language token, the model is\noptimized to translate the spoken language into that of the target language, in\na many-to-many language translation setting. Therefore, the model can build the\nknowledge of how spoken languages are comprehended and how to relate them to\ndifferent languages. A single pre-trained model with UTUT can be employed for\ndiverse multilingual speech- and text-related tasks, such as Speech-to-Speech\nTranslation (STS), multilingual Text-to-Speech Synthesis (TTS), and\nText-to-Speech Translation (TTST). By conducting comprehensive experiments\nencompassing various languages, we validate the efficacy of the proposed method\nacross diverse multilingual tasks. Moreover, we show UTUT can perform\nmany-to-many language STS, which has not been previously explored in the\nliterature. Samples are available on https://choijeongsoo.github.io/utut.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:47:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kim","Minsu",""],["Choi","Jeongsoo",""],["Kim","Dahun",""],["Ro","Yong Man",""]]}
{"id":"2308.01832","submitter":"Federico Capannoli","authors":"Luca Avena, Federico Capannoli, Rajat Subhra Hazra, Matteo Quattropani","title":"Meeting, coalescence and consensus time on random directed graphs","comments":"55 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider Markovian dynamics on a typical realization of the so-called\nDirected Configuration Model (DCM), that is, a random directed graph with\nprescribed in- and out-degrees. In this random geometry, we study the meeting\ntime of two random walks on a typical realization of the graph starting at\nstationarity, the coalescence time for a system of coalescent random walks, and\nthe consensus time of the voter model. Indeed, it is known that the latter\nthree quantities are related to each other when the underlying sequence of\ngraphs satisfies certain mean field conditions. Such conditions can be\nsummarized by requiring a fast mixing time of the random walk and some\nanti-concentration of its stationary distribution: properties that a typical\nrandom directed graph is known to have under natural assumptions on the degree\nsequence. In this paper we show that, for a typical large graph from the DCM\nensemble, the distribution of the meeting time is well-approximated by an\nexponential random variable and we provide the first-order approximation of its\nexpectation, showing that the latter is linear in the size of the graph, and\nthe preconstant depends on some easy statistics of the degree sequence. As a\nbyproduct, we are able to analyze the effect of the degree sequence in changing\nthe meeting, coalescence and consensus time. Our approach follows the classical\nidea of converting meeting into hitting times of a proper collapsed chain,\nwhich we control by the so-called First Visit Time Lemma.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:47:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Avena","Luca",""],["Capannoli","Federico",""],["Hazra","Rajat Subhra",""],["Quattropani","Matteo",""]]}
{"id":"2308.01833","submitter":"Luca Crupi","authors":"Luca Crupi, Elia Cereda, Alessandro Giusti, and Daniele Palossi","title":"Sim-to-Real Vision-depth Fusion CNNs for Robust Pose Estimation Aboard\n  Autonomous Nano-quadcopter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nano-quadcopters are versatile platforms attracting the interest of both\nacademia and industry. Their tiny form factor, i.e., $\\,$10 cm diameter, makes\nthem particularly useful in narrow scenarios and harmless in human proximity.\nHowever, these advantages come at the price of ultra-constrained onboard\ncomputational and sensorial resources for autonomous operations. This work\naddresses the task of estimating human pose aboard nano-drones by fusing depth\nand images in a novel CNN exclusively trained in simulation yet capable of\nrobust predictions in the real world. We extend a commercial off-the-shelf\n(COTS) Crazyflie nano-drone -- equipped with a 320$\\times$240 px camera and an\nultra-low-power System-on-Chip -- with a novel multi-zone (8$\\times$8) depth\nsensor. We design and compare different deep-learning models that fuse depth\nand image inputs. Our models are trained exclusively on simulated data for both\ninputs, and transfer well to the real world: field testing shows an improvement\nof 58% and 51% of our depth+camera system w.r.t. a camera-only State-of-the-Art\nbaseline on the horizontal and angular mean pose errors, respectively. Our\nprototype is based on COTS components, which facilitates reproducibility and\nadoption of this novel class of systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:51:07 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Crupi","Luca",""],["Cereda","Elia",""],["Giusti","Alessandro",""],["Palossi","Daniele",""]]}
{"id":"2308.01834","submitter":"Daniel McDuff","authors":"Isaac R. Galatzer-Levy, Daniel McDuff, Vivek Natarajan, Alan\n  Karthikesalingam and Matteo Malgaroli","title":"The Capability of Large Language Models to Measure Psychiatric\n  Functioning","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 current work investigates the capability of Large language models (LLMs)\nthat are explicitly trained on large corpuses of medical knowledge (Med-PaLM 2)\nto predict psychiatric functioning from patient interviews and clinical\ndescriptions without being trained to do so. To assess this, n = 145 depression\nand n =115 PTSD assessments and n = 46 clinical case studies across high\nprevalence/high comorbidity disorders (Depressive, Anxiety, Psychotic, trauma\nand stress, Addictive disorders) were analyzed using prompts to extract\nestimated clinical scores and diagnoses. Results demonstrate that Med-PaLM 2 is\ncapable of assessing psychiatric functioning across a range of psychiatric\nconditions with the strongest performance being the prediction of depression\nscores based on standardized assessments (Accuracy range= 0.80 - 0.84) which\nwere statistically indistinguishable from human clinical raters t(1,144) =\n1.20; p = 0.23. Results show the potential for general clinical language models\nto flexibly predict psychiatric risk based on free descriptions of functioning\nfrom both patients and clinicians.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:52:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Galatzer-Levy","Isaac R.",""],["McDuff","Daniel",""],["Natarajan","Vivek",""],["Karthikesalingam","Alan",""],["Malgaroli","Matteo",""]]}
{"id":"2308.01835","submitter":"Bal\\'azs Csan\\'ad Cs\\'aji","authors":"Ambrus Tam\\'as and Bal\\'azs Csan\\'ad Cs\\'aji","title":"Distribution-Free Inference for the Regression Function of Binary\n  Classification","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":"  One of the key objects of binary classification is the regression function,\ni.e., the conditional expectation of the class labels given the inputs. With\nthe regression function not only a Bayes optimal classifier can be defined, but\nit also encodes the corresponding misclassification probabilities. The paper\npresents a resampling framework to construct exact, distribution-free and\nnon-asymptotically guaranteed confidence regions for the true regression\nfunction for any user-chosen confidence level. Then, specific algorithms are\nsuggested to demonstrate the framework. It is proved that the constructed\nconfidence regions are strongly consistent, that is, any false model is\nexcluded in the long run with probability one. The exclusion is quantified with\nprobably approximately correct type bounds, as well. Finally, the algorithms\nare validated via numerical experiments, and the methods are compared to\napproximate asymptotic confidence ellipsoids.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:52:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Tam\u00e1s","Ambrus",""],["Cs\u00e1ji","Bal\u00e1zs Csan\u00e1d",""]]}
{"id":"2308.01836","submitter":"Kashif Rashid","authors":"Kashif Rashid, Lukasz Zielinski, Junyi Yuan, Andrew Speck","title":"Subspace-Constrained Continuous Methane Leak Monitoring and Optimal\n  Sensor Placement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents a procedure that can quickly identify and isolate methane\nemission sources leading to expedient remediation. Minimizing the time required\nto identify a leak and the subsequent time to dispatch repair crews can\nsignificantly reduce the amount of methane released into the atmosphere. The\nprocedure developed utilizes permanently installed low-cost methane sensors at\nan oilfield facility to continuously monitor leaked gas concentration above\nbackground levels. The methods developed for optimal sensor placement and leak\ninversion in consideration of predefined subspaces and restricted zones are\npresented. In particular, subspaces represent regions comprising one or more\nequipment items that may leak, and restricted zones define regions in which a\nsensor may not be placed due to site restrictions by design. Thus, subspaces\nconstrain the inversion problem to specified locales, while restricted zones\nconstrain sensor placement to feasible zones. The development of synthetic wind\nmodels, and those based on historical data, are also presented as a means to\naccommodate optimal sensor placement under wind uncertainty. The wind models\nserve as realizations for planning purposes, with the aim of maximizing the\nmean coverage measure for a given number of sensors. Once the optimal design is\nestablished, continuous real-time monitoring permits localization and\nquantification of a methane leak source. The necessary methods, mathematical\nformulation and demonstrative test results are presented.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:53:01 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Rashid","Kashif",""],["Zielinski","Lukasz",""],["Yuan","Junyi",""],["Speck","Andrew",""]]}
{"id":"2308.01837","submitter":"Braden Kronheim","authors":"B. Kronheim, A. Belloni, T.K. Edberg, S.C. Eno, C. Howe, C. Palmer, C.\n  Papageorgakis, M. Paranjpe, S. Sriram","title":"Reduction of light output of plastic scintillator tiles during\n  irradiation at cold temperatures and in low-oxygen environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The advent of the silicon photomultiplier has allowed the development of\nhighly segmented calorimeters using plastic scintillator as the active media,\nwith photodetectors embedded in the calorimeter, in dimples in the plastic. To\nreduce the photodetector's dark current and radiation damage, the high\ngranularity calorimeter designed for the high luminosity upgrade of the CMS\ndetector at CERN's Large Hadron Collider will be operated at a temperature of\nabout -30$^\\circ$C. Due to flammability considerations, a low oxygen\nenvironment is being considered. However, the radiation damage to the plastic\nscintillator during irradiation in this operating environment needs to be\nconsidered. In this paper, we present measurements of the relative decrease of\nlight output during irradiation of small plastic scintillator tiles read out by\nsilicon photomultipliers. The irradiations were performed using a\n$^{60}\\mathrm{Co}$ source both to produce the tiles' light and as a source of\nionizing irradiation at dose rates of 0.3, 1.3, and $1.6\\,$Gy/hr, temperatures\nof -30, -15, -5, and 0$^\\circ$C, and with several different oxygen\nconcentrations in the surrounding atmosphere. The effect of the material used\nto wrap the tile was also studied. Substantial temporary damage, which annealed\nwhen the sample was warmed, was seen during the low-temperature irradiations,\nregardless of the oxygen concentration and wrapping material. The relative\nlight loss was largest with 3M$^{\\tiny \\textrm{TM}}$ Enhanced Specular\nReflector Film wrapping and smallest with no wrapping, although due to the\nsubstantially higher light yield with wrapping, the final light output is\nlargest with wrapping. The light loss was less at warmer temperatures. Damage\nwith $3\\%$ oxygen was similar to that in standard atmosphere. Evidence of a\nplateau in the radical density was seen for the 0$^\\circ$C data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:54:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kronheim","B.",""],["Belloni","A.",""],["Edberg","T. K.",""],["Eno","S. C.",""],["Howe","C.",""],["Palmer","C.",""],["Papageorgakis","C.",""],["Paranjpe","M.",""],["Sriram","S.",""]]}
{"id":"2308.01838","submitter":"Stephen Dolan","authors":"J. Chakrani, S. Dolan, M. Buizza Avanzini, A. Ershova, L. Koch, K.\n  McFarland, G. D. Megias, L. Munteanu, L. Pickering, K. Skwarczynski, V. Q.\n  Nguyen, C. Wret","title":"Parametrized uncertainties in the spectral function model of neutrino\n  charged-current quasielastic interactions for oscillation analyses","comments":"26 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A substantial fraction of systematic uncertainties in neutrino oscillation\nexperiments stem from the lack of precision in modeling the nuclear target in\nneutrino-nucleus interactions. Whilst this has driven significant progress in\nthe development of improved nuclear models for neutrino scattering, it is\ncrucial that the models used in neutrino data analyses be accompanied by\nparameters and associated uncertainties that allow the coverage of plausible\nnuclear physics. Based on constraints from electron scattering data, we develop\nsuch a set of parameters, which can be applied to nuclear shell models, and\ntest their application to the Benhar et al spectral function model. The\nparametrization is validated through a series of maximum likelihood fits to\ncross-section measurements made by the T2K and MINERvA experiments, which also\npermit an exploration of the power of near-detector data to provide constraints\non the parameters in neutrino oscillation analyses.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:59:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chakrani","J.",""],["Dolan","S.",""],["Avanzini","M. Buizza",""],["Ershova","A.",""],["Koch","L.",""],["McFarland","K.",""],["Megias","G. D.",""],["Munteanu","L.",""],["Pickering","L.",""],["Skwarczynski","K.",""],["Nguyen","V. Q.",""],["Wret","C.",""]]}
{"id":"2308.01839","submitter":"Rong Ma","authors":"Rong Ma, Eric D. Sun, David Donoho and James Zou","title":"Is your data alignable? Principled and interpretable alignability\n  testing and integration of single-cell data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.CV q-bio.GN stat.AP stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Single-cell data integration can provide a comprehensive molecular view of\ncells, and many algorithms have been developed to remove unwanted technical or\nbiological variations and integrate heterogeneous single-cell datasets. Despite\ntheir wide usage, existing methods suffer from several fundamental limitations.\nIn particular, we lack a rigorous statistical test for whether two\nhigh-dimensional single-cell datasets are alignable (and therefore should even\nbe aligned). Moreover, popular methods can substantially distort the data\nduring alignment, making the aligned data and downstream analysis difficult to\ninterpret. To overcome these limitations, we present a spectral manifold\nalignment and inference (SMAI) framework, which enables principled and\ninterpretable alignability testing and structure-preserving integration of\nsingle-cell data. SMAI provides a statistical test to robustly determine the\nalignability between datasets to avoid misleading inference, and is justified\nby high-dimensional statistical theory. On a diverse range of real and\nsimulated benchmark datasets, it outperforms commonly used alignment methods.\nMoreover, we show that SMAI improves various downstream analyses such as\nidentification of differentially expressed genes and imputation of single-cell\nspatial transcriptomics, providing further biological insights. SMAI's\ninterpretability also enables quantification and a deeper understanding of the\nsources of technical confounders in single-cell data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:04:14 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ma","Rong",""],["Sun","Eric D.",""],["Donoho","David",""],["Zou","James",""]]}
{"id":"2308.01840","submitter":"Kevin Eykholt","authors":"Kevin Eykholt, Taesung Lee, Douglas Schales, Jiyong Jang, Ian Molloy,\n  and Masha Zorin","title":"URET: Universal Robustness Evaluation Toolkit (for Evasion)","comments":"Accepted at USENIX '23","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 models are known to be vulnerable to adversarial evasion\nattacks as illustrated by image classification models. Thoroughly understanding\nsuch attacks is critical in order to ensure the safety and robustness of\ncritical AI tasks. However, most evasion attacks are difficult to deploy\nagainst a majority of AI systems because they have focused on image domain with\nonly few constraints. An image is composed of homogeneous, numerical,\ncontinuous, and independent features, unlike many other input types to AI\nsystems used in practice. Furthermore, some input types include additional\nsemantic and functional constraints that must be observed to generate realistic\nadversarial inputs. In this work, we propose a new framework to enable the\ngeneration of adversarial inputs irrespective of the input type and task\ndomain. Given an input and a set of pre-defined input transformations, our\nframework discovers a sequence of transformations that result in a semantically\ncorrect and functional adversarial input. We demonstrate the generality of our\napproach on several diverse machine learning tasks with various input\nrepresentations. We also show the importance of generating adversarial examples\nas they enable the deployment of mitigation techniques.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:05:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Eykholt","Kevin",""],["Lee","Taesung",""],["Schales","Douglas",""],["Jang","Jiyong",""],["Molloy","Ian",""],["Zorin","Masha",""]]}
{"id":"2308.01841","submitter":"Sudip Chakraborty","authors":"Sudip Chakraborty, Ajay Ratheesh, Francesco Tombesi, Rodrigo Nemmen,\n  Srimanta Banerjee","title":"Universality of coronal properties in accreting black holes across mass\n  and accretion rate","comments":"9 pages, 3 figures. Shortened abstract. Accepted for publication in\n  A&A Letters","journal-ref":"A&A 676, L13 (2023)","doi":"10.1051/0004-6361/202347181","report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Through their radio loudness, lack of thermal UV emission from the accretion\ndisk and power-law dominated spectra, Low Luminosity AGN (LLAGN) display\nsimilarity with the hard state of stellar-mass black hole X-Ray Binaries\n(BHBs). In this work we perform a systematic hard X-ray spectral study of a\ncarefully selected sample of unobscured LLAGN using archival $NuSTAR$ data, to\nunderstand the central engine properties in the lower accretion regime. We\nanalyze the $NuSTAR$ spectra of a sample of 16 LLAGN. We model the continuum\nemission with detailed Comptonization models. We find a strong anti-correlation\nbetween the optical depth and the electron temperature of the corona,\npreviously also observed in the brighter Seyferts. This anti-correlation is\npresent irrespective of the shape of the corona, and the slope of this\nanti-correlation in the log space for LLAGN (0.68-1.06) closely matches that of\nthe higher accretion rate Seyferts (0.55-1.11) and hard state of BHBs\n($\\sim$0.87). This anti-correlation may indicate a departure from a fixed\ndisk-corona configuration in radiative balance. Our result, therefore,\ndemonstrates a possible universality in Comptonization processes of black hole\nX-ray sources across multiple orders of magnitude in mass and accretion rate.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:05:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chakraborty","Sudip",""],["Ratheesh","Ajay",""],["Tombesi","Francesco",""],["Nemmen","Rodrigo",""],["Banerjee","Srimanta",""]]}
{"id":"2308.01842","submitter":"Pete Rigas","authors":"Pete Rigas","title":"Eigenvectors of Toeplitz matrices from Fisher-Hartwig symbols with\n  greater than, or equal to, one singularity","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.stat-mech math.MP math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Asymptotically, we analytically derive the form of eigenvectors for two\nFisher-Hartwig symbols besides those which were previously investigated in a\n$2016$ work due to Movassagh and Kadanoff, in which the authors characterized\nthe eigenpairs of Toeplitz matrices generated by Fisher-Hartwig symbols with\none singularity. To perform such computations, we extend their methods which\nconsists of formulating an eigenvalue problem, obtained by a Wiener-Hopf\nmethod, from which a suitable winding number is defined for passing to Fourier\nspace, and introducing a factorization dependent upon the winding number, for\nother Fisher-Hartwig symbols which have previously been defined in the\nliterature. Following the computations required for the proof after obtaining\nthe asymptotic approximation of the eigenvectors, we provide a table from which\neigenvalues of one Fisher-Hartwig symbol for different complex valued functions\n$b$ can be inferred.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:06:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Rigas","Pete",""]]}
{"id":"2308.01843","submitter":"Spencer Griswold","authors":"Spencer Griswold and Segev BenZvi (for the IceCube Collaboration)","title":"Galactic Core-Collapse Supernovae at IceCube: \"Fire Drill\" Data\n  Challenges and follow-up","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-1111","categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The next Galactic core-collapse supernova (CCSN) presents a\nonce-in-a-lifetime opportunity to make astrophysical measurements using\nneutrinos, gravitational waves, and electromagnetic radiation. CCSNe local to\nthe Milky Way are extremely rare, so it is paramount that detectors are\nprepared to observe the signal when it arrives. The IceCube Neutrino\nObservatory, a gigaton water Cherenkov detector below the South Pole, is\nsensitive to the burst of neutrinos released by a Galactic CCSN at a level\n$>$10$\\sigma$. This burst of neutrinos precedes optical emission by hours to\ndays, enabling neutrinos to serve as an early warning for follow-up\nobservation. IceCube's detection capabilities make it a cornerstone of the\nglobal network of neutrino detectors monitoring for Galactic CCSNe, the\nSuperNova Early Warning System (SNEWS 2.0). In this contribution, we describe\nIceCube's sensitivity to Galactic CCSNe and strategies for operational\nreadiness, including \"fire drill\" data challenges. We also discuss coordination\nwith SNEWS 2.0.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:07:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Griswold","Spencer","","for the IceCube Collaboration"],["BenZvi","Segev","","for the IceCube Collaboration"]]}
{"id":"2308.01844","submitter":"Yen Jui Chang","authors":"Yen-Jui Chang, Wei-Ting Wang, Hao-Yuan Chen, Shih-Wei Liao, Ching-Ray\n  Chang","title":"A novel approach for quantum financial simulation and quantum state\n  preparation","comments":"13 pages, 13 figures. arXiv admin note: text overlap with\n  arXiv:2302.12500","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph q-fin.CP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum state preparation is vital in quantum computing and information\nprocessing. The ability to accurately and reliably prepare specific quantum\nstates is essential for various applications. One of the promising applications\nof quantum computers is quantum simulation. This requires preparing a quantum\nstate representing the system we are trying to simulate. This research\nintroduces a novel simulation algorithm, the multi-Split-Steps Quantum Walk\n(multi-SSQW), designed to learn and load complicated probability distributions\nusing parameterized quantum circuits (PQC) with a variational solver on\nclassical simulators. The multi-SSQW algorithm is a modified version of the\nsplit-steps quantum walk, enhanced to incorporate a multi-agent decision-making\nprocess, rendering it suitable for modeling financial markets. The study\nprovides theoretical descriptions and empirical investigations of the\nmulti-SSQW algorithm to demonstrate its promising capabilities in probability\ndistribution simulation and financial market modeling. Harnessing the\nadvantages of quantum computation, the multi-SSQW models complex financial\ndistributions and scenarios with high accuracy, providing valuable insights and\nmechanisms for financial analysis and decision-making. The multi-SSQW's key\nbenefits include its modeling flexibility, stable convergence, and\ninstantaneous computation. These advantages underscore its rapid modeling and\nprediction potential in dynamic financial markets.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:08:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chang","Yen-Jui",""],["Wang","Wei-Ting",""],["Chen","Hao-Yuan",""],["Liao","Shih-Wei",""],["Chang","Ching-Ray",""]]}
{"id":"2308.01845","submitter":"Bayram Tekin","authors":"Kezban Tasseten and Bayram Tekin","title":"A New Geometric Flow on 3-Manifolds: the $K$-Flow","comments":"41 pages, 7 figures, a reference along with its explanation regarding\n  the short-time existence and the uniqueness of the flow is added","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG gr-qc hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define a new geometric flow, which we shall call the $K$-flow, on\n3-dimensional Riemannian manifolds; and study the behavior of Thurston's model\ngeometries under this flow both analytically and numerically. As an example, we\nshow that an initially arbitrarily deformed homogeneous 3-sphere flows into a\nround 3-sphere and shrinks to a point in the unnormalized flow; or stays as a\nround 3-sphere in the volume normalized flow. The $K$-flow equation arises as\nthe gradient flow of a specific purely quadratic action functional that has\nappeared as the quadratic part of New Massive Gravity in physics; and a decade\nearlier in the mathematics literature, as a new variational characterization of\nthree-dimensional space forms. We show the short-time existence of the $K$-flow\nusing a DeTurck-type argument.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:11:23 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 08:16:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tasseten","Kezban",""],["Tekin","Bayram",""]]}
{"id":"2308.01846","submitter":"Hao Fei","authors":"Hao Fei, Meishan Zhang, Min Zhang, Tat-Seng Chua","title":"XNLP: An Interactive Demonstration System for Universal Structured NLP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Structured Natural Language Processing (XNLP) is an important subset of NLP\nthat entails understanding the underlying semantic or syntactic structure of\ntexts, which serves as a foundational component for many downstream\napplications. Despite certain recent efforts to explore universal solutions for\nspecific categories of XNLP tasks, a comprehensive and effective approach for\nunifying all XNLP tasks long remains underdeveloped. In the meanwhile, while\nXNLP demonstration systems are vital for researchers exploring various XNLP\ntasks, existing platforms can be limited to, e.g., supporting few XNLP tasks,\nlacking interactivity and universalness. To this end, we propose an advanced\nXNLP demonstration platform, where we propose leveraging LLM to achieve\nuniversal XNLP, with one model for all with high generalizability. Overall, our\nsystem advances in multiple aspects, including universal XNLP modeling, high\nperformance, interpretability, scalability, and interactivity, providing a\nunified platform for exploring diverse XNLP tasks in the community. XNLP is\nonline: https://xnlp.haofei.vip\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:13:05 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fei","Hao",""],["Zhang","Meishan",""],["Zhang","Min",""],["Chua","Tat-Seng",""]]}
{"id":"2308.01847","submitter":"Shubham Ganar","authors":"Shubham Ganar and Arindam Das","title":"Unraveling the Interplay of Leaf Structure and Wettability: A\n  Comparative Study on Superhydrophobic Leaves of Cassia tora, Adiantum\n  capillus-veneris, and Bauhinia variegata","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 this article, superhydrophobic leaves of Cassia tora, Adiantum\ncapillus-veneris (ACV), and Bauhinia Variegate are reported for the first time,\nand the wettability of these leaf's surfaces was correlated with their surface\nmorphology at micro and nanoscale. Field Emission Scanning Electron Microscopy\n(FESEM) images of the surfaces were used to get surface morphological\ninformation at the micro-nanoscale structures. A special drying method was\nimplemented to ensure the minimal structural collapse of these surfaces under\nthe high vacuum of FESEM. FESEM images of Cassia tora leaves showed widely\nspaced, low aspect ratio nano petals distributed on bumpy blunt micro features,\nresponsible for high contact angle hysteresis and high roll angle measured on\nthe Cassia tora leaves. ACV leaves showed the presence of micron-scale\nspherical morphology made of nanoscale hair-like features. These hierarchical\nre-entrant surface features generated a very high contact angle and low\nroll-off angle. Leaves of Bauhinia variegate showed similar superhydrophobic\nand self-cleaning properties. However, surface features were different, which\nconsisted of a higher aspect ratio and closely spaced nano petals uniformly\ndistributed over flat surfaces consisting of micro-scale ridges. Droplet impact\nstudies on these surfaces at different Weber numbers showed different behaviour\ndue to these different micro-nano features.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:16:19 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 04:10:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ganar","Shubham",""],["Das","Arindam",""]]}
{"id":"2308.01848","submitter":"Yury Kochetkov","authors":"Yury Kochetkov and Alexandr Osipov","title":"A two dimensional analog of the three gap theorem","comments":"3 pages, 1 figure, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For a two dimensional vector $\\bar v=(\\alpha,\\beta)$, where $\\alpha>0,\n\\beta>0$ are irrational numbers independent over $\\mathbb{Q}$, we consider the\nset $D_n=\\{(i\\alpha\\,{\\rm mod}\\,1,i\\beta\\,{\\rm mod}\\,1),i=1,\\ldots,n\\}$ in a\ntwo dimensional torus and the partition of this torus into Voronoi cells. Areas\nand forms of these cells are the subject of this experimental work.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:17:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kochetkov","Yury",""],["Osipov","Alexandr",""]]}
{"id":"2308.01849","submitter":"Jader S\\'a","authors":"Jader Martins Camboim de S\\'a, Matheus Ferraroni Sanches, Rafael Roque\n  de Souza, J\\'ulio Cesar dos Reis, Leandro Aparecido Villas","title":"Curricular Transfer Learning for Sentence Encoded Tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fine-tuning language models in a downstream task is the standard approach for\nmany state-of-the-art methodologies in the field of NLP. However, when the\ndistribution between the source task and target task drifts, \\textit{e.g.},\nconversational environments, these gains tend to be diminished. This article\nproposes a sequence of pre-training steps (a curriculum) guided by \"data\nhacking\" and grammar analysis that allows further gradual adaptation between\npre-training distributions. In our experiments, we acquire a considerable\nimprovement from our method compared to other known pre-training approaches for\nthe MultiWoZ task.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:18:19 GMT"}],"update_date":"2023-08-04","authors_parsed":[["de S\u00e1","Jader Martins Camboim",""],["Sanches","Matheus Ferraroni",""],["de Souza","Rafael Roque",""],["Reis","J\u00falio Cesar dos",""],["Villas","Leandro Aparecido",""]]}
{"id":"2308.01850","submitter":"Zhao Yang","authors":"Zhao Yang, Bing Su and Ji-Rong Wen","title":"Synthesizing Long-Term Human Motions with Diffusion Models via Coherent\n  Sampling","comments":"Accepted at ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-to-motion generation has gained increasing attention, but most existing\nmethods are limited to generating short-term motions that correspond to a\nsingle sentence describing a single action. However, when a text stream\ndescribes a sequence of continuous motions, the generated motions corresponding\nto each sentence may not be coherently linked. Existing long-term motion\ngeneration methods face two main issues. Firstly, they cannot directly generate\ncoherent motions and require additional operations such as interpolation to\nprocess the generated actions. Secondly, they generate subsequent actions in an\nautoregressive manner without considering the influence of future actions on\nprevious ones. To address these issues, we propose a novel approach that\nutilizes a past-conditioned diffusion model with two optional coherent sampling\nmethods: Past Inpainting Sampling and Compositional Transition Sampling. Past\nInpainting Sampling completes subsequent motions by treating previous motions\nas conditions, while Compositional Transition Sampling models the distribution\nof the transition as the composition of two adjacent motions guided by\ndifferent text prompts. Our experimental results demonstrate that our proposed\nmethod is capable of generating compositional and coherent long-term 3D human\nmotions controlled by a user-instructed long text stream. The code is available\nat\n\\href{https://github.com/yangzhao1230/PCMDM}{https://github.com/yangzhao1230/PCMDM}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:18:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yang","Zhao",""],["Su","Bing",""],["Wen","Ji-Rong",""]]}
{"id":"2308.01851","submitter":"Carlos de Gois","authors":"Carlos de Gois, Matthias Kleinmann","title":"User-friendly confidence regions for quantum state tomography","comments":"5 + 11 pages, 7 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 is the standard technique for reconstructing a\nquantum state from experimental data. Given finite statistics, experimental\ndata cannot give perfect information about the quantum state. A common way to\nexpress this limited knowledge is by providing confidence regions in state\nspace. Though plenty of confidence regions have been previously proposed, they\nare often too loose to use for large systems or difficult to apply to\nnonstandard measurement schemes. Starting from a vector Bernstein inequality,\nwe consider concentration bounds for random vectors following multinomial\ndistributions and analyse optimal strategies to distribute a fixed budget of\nsamples across them. Interpreting this as a tomography experiment leads to two\nconfidence regions, one of which performs comparably well to the best regions\nin the literature. The regions describe an ellipsoid in the state space and\nhave the appeal of being efficient in the required number of samples as well as\nbeing easily applicable to any measurement scheme.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:18:44 GMT"}],"update_date":"2023-08-04","authors_parsed":[["de Gois","Carlos",""],["Kleinmann","Matthias",""]]}
{"id":"2308.01852","submitter":"Molly Sager","authors":"Jonah Marcus, Molly Sager","title":"Schwartz Functions and Compactifications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the early 20th century, Laurent Schwartz observed that we can identify\nfunctions that extend smoothly to the point at infinity of one-point\ncompactifications of Euclidean spaces. We show a similar result for a different\ncompactification of Euclidean spaces, namely, the real projective spaces.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:19:13 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Marcus","Jonah",""],["Sager","Molly",""]]}
{"id":"2308.01853","submitter":"Patrick Chao","authors":"Patrick Chao, Edgar Dobriban","title":"Statistical Estimation Under Distribution Shift: Wasserstein\n  Perturbations and Minimax Theory","comments":"60 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Distribution shifts are a serious concern in modern statistical learning as\nthey can systematically change the properties of the data away from the truth.\nWe focus on Wasserstein distribution shifts, where every data point may undergo\na slight perturbation, as opposed to the Huber contamination model where a\nfraction of observations are outliers. We formulate and study shifts beyond\nindependent perturbations, exploring Joint Distribution Shifts, where the\nper-observation perturbations can be coordinated. We analyze several important\nstatistical problems, including location estimation, linear regression, and\nnon-parametric density estimation. Under a squared loss for mean estimation and\nprediction error in linear regression, we find the exact minimax risk, a least\nfavorable perturbation, and show that the sample mean and least squares\nestimators are respectively optimal. This holds for both independent and joint\nshifts, but the least favorable perturbations and minimax risks differ. For\nother problems, we provide nearly optimal estimators and precise finite-sample\nbounds. We also introduce several tools for bounding the minimax risk under\ndistribution shift, such as a smoothing technique for location families, and\ngeneralizations of classical tools including least favorable sequences of\npriors, the modulus of continuity, Le Cam's, Fano's, and Assouad's methods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:19:40 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chao","Patrick",""],["Dobriban","Edgar",""]]}
{"id":"2308.01854","submitter":"Mihai Fieraru","authors":"Mihai Fieraru, Mihai Zanfir, Elisabeta Oneata, Alin-Ionut Popa, Vlad\n  Olaru, Cristian Sminchisescu","title":"Reconstructing Three-Dimensional Models of Interacting Humans","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding 3d human interactions is fundamental for fine-grained scene\nanalysis and behavioural modeling. However, most of the existing models predict\nincorrect, lifeless 3d estimates, that miss the subtle human contact\naspects--the essence of the event--and are of little use for detailed\nbehavioral understanding. This paper addresses such issues with several\ncontributions: (1) we introduce models for interaction signature estimation\n(ISP) encompassing contact detection, segmentation, and 3d contact signature\nprediction; (2) we show how such components can be leveraged to ensure contact\nconsistency during 3d reconstruction; (3) we construct several large datasets\nfor learning and evaluating 3d contact prediction and reconstruction methods;\nspecifically, we introduce CHI3D, a lab-based accurate 3d motion capture\ndataset with 631 sequences containing $2,525$ contact events, $728,664$ ground\ntruth 3d poses, as well as FlickrCI3D, a dataset of $11,216$ images, with\n$14,081$ processed pairs of people, and $81,233$ facet-level surface\ncorrespondences. Finally, (4) we propose methodology for recovering the\nground-truth pose and shape of interacting people in a controlled setup and (5)\nannotate all 3d interaction motions in CHI3D with textual descriptions. Motion\ndata in multiple formats (GHUM and SMPLX parameters, Human3.6m 3d joints) is\nmade available for research purposes at \\url{https://ci3d.imar.ro}, together\nwith an evaluation server and a public benchmark.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:20:33 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 08:34:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fieraru","Mihai",""],["Zanfir","Mihai",""],["Oneata","Elisabeta",""],["Popa","Alin-Ionut",""],["Olaru","Vlad",""],["Sminchisescu","Cristian",""]]}
{"id":"2308.01855","submitter":"Serafino Cicerone","authors":"Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo\n  Navarra","title":"Time-optimal geodesic mutual visibility of robots on grids within\n  minimum area","comments":"28 pages, 9 figures. To appear in the proceedings of the 25th\n  International Symposium on Stabilization, Safety, and Security of Distributed\n  Systems (SSS 2023), Institute for Future Technologies, Jersey City, New\n  Jersey, USA, October 2-4, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The \\textsc{Mutual Visibility} is a well-known problem in the context of\nmobile robots. For a set of $n$ robots disposed in the Euclidean plane, it asks\nfor moving the robots without collisions so as to achieve a placement ensuring\nthat no three robots are collinear. For robots moving on graphs, we consider\nthe \\textsc{Geodesic Mutual Visibility} ($\\GMV$) problem. Robots move along the\nedges of the graph, without collisions, so as to occupy some vertices that\nguarantee they become pairwise geodesic mutually visible. This means that there\nis a shortest path (i.e., a \"geodesic\") between each pair of robots along which\nno other robots reside. We study this problem in the context of finite and\ninfinite square grids, for robots operating under the standard\nLook-Compute-Move model. In both scenarios, we provide resolution algorithms\nalong with formal correctness proofs, highlighting the most relevant\npeculiarities arising within the different contexts, while optimizing the time\ncomplexity.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:20:36 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cicerone","Serafino",""],["Di Fonso","Alessia",""],["Di Stefano","Gabriele",""],["Navarra","Alfredo",""]]}
{"id":"2308.01856","submitter":"Xiao Fang","authors":"Xiao Fang, Elisabeth Krause, Tim Eifler, Simone Ferraro, Karim\n  Benabed, Pranjal R. S., Emma Ay\\c{c}oberry, Yohan Dubois, Vivian Miranda","title":"Cosmology from weak lensing, galaxy clustering, CMB lensing and tSZ: I.\n  10x2pt Modelling Methodology","comments":"12 pages, 9 figures, to be submitted. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The overlap of galaxy surveys and CMB experiments presents an ideal\nopportunity for joint cosmological dataset analyses. In this paper we develop a\nhalo-model-based method for the first joint analysis combining these two\nexperiments using 10 correlated two-point functions (10x2pt) derived from\ngalaxy position, galaxy shear, CMB lensing convergence, and Compton-y fields.\nWe explore this method using the Vera Rubin Observatory Legacy Survey of Space\nand Time (LSST) and the Simons Observatory (SO) as examples. We find such\nLSSxCMB joint analyses lead to significant improvement in Figure-of-Merit of\n$\\Omega_m$ and $S_8$ over the constraints from using LSS-only probes within\n$\\Lambda$CDM. We identify that the shear-$y$ and $y$-$y$ correlations are the\nmost valuable additions when tSZ is included. We further identify the dominant\nsources of halo model uncertainties in the small-scale modelling, and\ninvestigate the impact of halo self-calibration due to the inclusion of\nsmall-scale tSZ information.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:20:48 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Fang","Xiao",""],["Krause","Elisabeth",""],["Eifler","Tim",""],["Ferraro","Simone",""],["Benabed","Karim",""],["S.","Pranjal R.",""],["Ay\u00e7oberry","Emma",""],["Dubois","Yohan",""],["Miranda","Vivian",""]]}
{"id":"2308.01857","submitter":"Wenxing Zhu","authors":"Xingquan Li, Simin Tao, Zengrong Huang, Shijian Chen, Zhisheng Zeng,\n  Liwei Ni, Zhipeng Huang, Chunan Zhuang, Hongxi Wu, Weiguo Li1, Xueyan Zhao,\n  He Liu, Shuaiying Long, Wei He, Bojun Liu, Sifeng Gan, Zihao Yu, Tong Liu,\n  Yuchi Miao, Zhiyuan Yan, Hao Wang, Jie Zhao, Yifan Li, Ruizhi Liu, Xiaoze\n  Lin, Bo Yang, Zhen Xue, Fuxing Huang, Zonglin Yang, Zhenggang Wu, Jiangkao\n  Li, Yuezuo Liu, Ming Peng, Yihang Qiu, Wenrui Wu, Zheqing Shao, Kai Mo,\n  Jikang Liu, Yuyao Liang, Mingzhe Zhang, Zhuang Ma, Xiang Cong, Daxiang Huang,\n  Guojie Luo, Huawei Li, Haihua Shen, Mingyu Chen, Dongbo Bu, Wenxing Zhu, Ye\n  Cai, Xiaoming Xiong, Ying Jiang, Yi Heng, Peng Zhang, Biwei Xie, Yungang Bao","title":"iEDA: An Open-Source Intelligent Physical Implementation Toolkit and\n  Library","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Open-source EDA shows promising potential in unleashing EDA innovation and\nlowering the cost of chip design. This paper presents an open-source EDA\nproject, iEDA, aiming for building a basic infrastructure for EDA technology\nevolution and closing the industrial-academic gap in the EDA area. iEDA now\ncovers the whole flow of physical design (including Floorplan, Placement, CTS,\nRouting, Timing Optimization etc.), and part of the analysis tools (Static\nTiming Analysis and Power Analysis). To demonstrate the effectiveness of iEDA,\nwe implement and tape out three chips of different scales (from 700k to 1.5M\ngates) on different process nodes (110nm and 28nm) with iEDA. iEDA is publicly\navailable from the project home page http://ieda.oscc.cc.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:24:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Xingquan",""],["Tao","Simin",""],["Huang","Zengrong",""],["Chen","Shijian",""],["Zeng","Zhisheng",""],["Ni","Liwei",""],["Huang","Zhipeng",""],["Zhuang","Chunan",""],["Wu","Hongxi",""],["Li1","Weiguo",""],["Zhao","Xueyan",""],["Liu","He",""],["Long","Shuaiying",""],["He","Wei",""],["Liu","Bojun",""],["Gan","Sifeng",""],["Yu","Zihao",""],["Liu","Tong",""],["Miao","Yuchi",""],["Yan","Zhiyuan",""],["Wang","Hao",""],["Zhao","Jie",""],["Li","Yifan",""],["Liu","Ruizhi",""],["Lin","Xiaoze",""],["Yang","Bo",""],["Xue","Zhen",""],["Huang","Fuxing",""],["Yang","Zonglin",""],["Wu","Zhenggang",""],["Li","Jiangkao",""],["Liu","Yuezuo",""],["Peng","Ming",""],["Qiu","Yihang",""],["Wu","Wenrui",""],["Shao","Zheqing",""],["Mo","Kai",""],["Liu","Jikang",""],["Liang","Yuyao",""],["Zhang","Mingzhe",""],["Ma","Zhuang",""],["Cong","Xiang",""],["Huang","Daxiang",""],["Luo","Guojie",""],["Li","Huawei",""],["Shen","Haihua",""],["Chen","Mingyu",""],["Bu","Dongbo",""],["Zhu","Wenxing",""],["Cai","Ye",""],["Xiong","Xiaoming",""],["Jiang","Ying",""],["Heng","Yi",""],["Zhang","Peng",""],["Xie","Biwei",""],["Bao","Yungang",""]]}
{"id":"2308.01858","submitter":"Nicholas Fleece","authors":"Danielle Bowerman, Nicholas Fleece, Matt Insall","title":"Introducing $n$-Magic Groups and Characterizing $3$-Magic Finitely\n  Generated Abelian Groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we define an $n$-magic square in a group to be an $(n\\times\nn)$ array of group elements whose rows, columns, and diagonals have the same\nproduct. This definition is akin to the idea of magic squares in the integers.\nGroups that have an $n$-magic square are said to be $n$-magic. We begin with\nsome preliminary results and focus much of our attention on $3$-magic groups.\nThrough a series of propositions, we ultimately prove a characterization\ntheorem for $3$-magic finitely generated abelian groups. We then discuss some\nadditional results about non-abelian groups as well as $n$-magic groups where\n$n>3$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:26:57 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bowerman","Danielle",""],["Fleece","Nicholas",""],["Insall","Matt",""]]}
{"id":"2308.01859","submitter":"Nimisha Krishnan","authors":"Nimisha Krishnan, Niranjan Sarpangala, Maria Gamez, Ajay Gopinathan,\n  Jennifer L Ross","title":"Effects of Cytoskeletal Network Mesh Size on Cargo Transport","comments":"23 Pages, 7 Figures, 4 Tables","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":"  Intracellular transport of cargoes in the cell is essential for the\norganization and functioning cells, especially those that are large and\nelongated. The cytoskeletal networks inside large cells can be highly complex,\nand this cytoskeletal organization can have impacts on the distance and\ntrajectories of travel. Here, we experimentally created microtubule networks\nwith varying mesh sizes and examined the ability of kinesin-driven quantum dot\ncargoes to traverse the network. Using the experimental data, we deduced\nparameters for cargo detachment at intersections and away from intersections,\nallowing us to create an analytical theory for the run length as a function of\nmesh size. We also used these parameters to perform simulations of cargoes\nalong paths extracted from the experimental networks. We find excellent\nagreement between the trends in run length, displacement, and trajectory\npersistence length comparing the experimental and simulated trajectories.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:30:25 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Krishnan","Nimisha",""],["Sarpangala","Niranjan",""],["Gamez","Maria",""],["Gopinathan","Ajay",""],["Ross","Jennifer L",""]]}
{"id":"2308.01860","submitter":"Liran Shirizly","authors":"Liran Shirizly, Gr\\'egoire Misguich and Haggai Landa","title":"Dissipative Dynamics of Graph-State Stabilizers with Superconducting\n  Qubits","comments":"15 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the noisy evolution of multipartite entangled states, focusing on\nsuperconducting-qubit devices accessible via the cloud. We experimentally\ncharacterize the single-qubit coherent and incoherent error parameters together\nwith the effective two-qubit interactions, whose combined action dominates the\ndecoherence of quantum memory states. We find that a valid modeling of the\ndynamics of superconducting qubits requires one to properly account for\ncoherent frequency shifts, caused by stochastic charge-parity fluctuations. We\npresent a numerical approach that is scalable to tens of qubits, allowing us to\nsimulate efficiently the dissipative dynamics of some large multiqubit states.\nComparing our simulations to measurements of stabilizers dynamics of graph\nstates realized experimentally with up to 12 qubits on a ring, we find that a\nvery good agreement is achievable. Our approach allows us to probe nonlocal\nstate characteristics that are inaccessible in the experiment. We show evidence\nfor a significant improvement of the many-body state fidelity using dynamical\ndecoupling sequences, mitigating the effect of charge-parity oscillations and\ntwo-qubit crosstalk.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:30:35 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Shirizly","Liran",""],["Misguich","Gr\u00e9goire",""],["Landa","Haggai",""]]}
{"id":"2308.01861","submitter":"Xueying Du","authors":"Xueying Du, Mingwei Liu, Kaixin Wang, Hanlin Wang, Junwei Liu, Yixuan\n  Chen, Jiayi Feng, Chaofeng Sha, Xin Peng, Yiling Lou","title":"ClassEval: A Manually-Crafted Benchmark for Evaluating LLMs on\n  Class-level Code Generation","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":"  In this work, we make the first attempt to evaluate LLMs in a more\nchallenging code generation scenario, i.e. class-level code generation. We\nfirst manually construct the first class-level code generation benchmark\nClassEval of 100 class-level Python code generation tasks with approximately\n500 person-hours. Based on it, we then perform the first study of 11\nstate-of-the-art LLMs on class-level code generation. Based on our results, we\nhave the following main findings. First, we find that all existing LLMs show\nmuch worse performance on class-level code generation compared to on standalone\nmethod-level code generation benchmarks like HumanEval; and the method-level\ncoding ability cannot equivalently reflect the class-level coding ability among\nLLMs. Second, we find that GPT-4 and GPT-3.5 still exhibit dominate superior\nthan other LLMs on class-level code generation, and the second-tier models\nincludes Instruct-Starcoder, Instruct-Codegen, and Wizardcoder with very\nsimilar performance. Third, we find that generating the entire class all at\nonce (i.e. holistic generation strategy) is the best generation strategy only\nfor GPT-4 and GPT-3.5, while method-by-method generation (i.e. incremental and\ncompositional) is better strategies for the other models with limited ability\nof understanding long instructions and utilizing the middle information.\nLastly, we find the limited model ability of generating method-dependent code\nand discuss the frequent error types in generated classes. Our benchmark is\navailable at https://github.com/FudanSELab/ClassEval.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:31:02 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 09:07:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Du","Xueying",""],["Liu","Mingwei",""],["Wang","Kaixin",""],["Wang","Hanlin",""],["Liu","Junwei",""],["Chen","Yixuan",""],["Feng","Jiayi",""],["Sha","Chaofeng",""],["Peng","Xin",""],["Lou","Yiling",""]]}
{"id":"2308.01862","submitter":"Xinghua Zhang","authors":"Xinghua Zhang, Bowen Yu, Haiyang Yu, Yangyu Lv, Tingwen Liu, Fei\n  Huang, Hongbo Xu, Yongbin Li","title":"Wider and Deeper LLM Networks are Fairer LLM Evaluators","comments":"Work in Progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measuring the quality of responses generated by LLMs is a challenging task,\nparticularly when it comes to evaluating whether the response is aligned with\nhuman preference. A novel approach involves using the LLM itself to make\nevaluation and stabilizing the results through multiple independent\nevaluations, similar to a single-layer narrow LLM network. This network\nconsists of a fixed number of neurons, with each neuron being the same LLM. In\nthis paper, we draw upon the extensive research on deep neural networks to\nexplore whether deeper and wider networks can lead to fairer evaluations.\nSpecifically, inspired by the observation that different neurons in a neural\nnetwork are responsible for detecting different concepts, we first adaptively\ngenerate as many neuron roles as possible for each evaluation sample. Each\nperspective corresponds to the role of a specific LLM neuron in the first\nlayer. In subsequent layers, we follow the idea that higher layers in deep\nnetworks are responsible for more comprehensive features, each layer receives\nrepresentations from all neurons in the previous layer, integrating the locally\nlearned evaluation information to obtain a more comprehensive evaluation\nresult. Interestingly, this network design resembles the process of academic\npaper reviewing. To validate the effectiveness of our method, we construct the\nlargest and most diverse English evaluation benchmark LLMEval$^2$ for LLM\nevaluators, comprising 15 tasks, 8 abilities, and 2,553 samples. Experimental\nresults demonstrate that a wider network (involving many reviewers) with 2\nlayers (one round of discussion) performs the best, improving kappa correlation\ncoefficient from 0.28 to 0.34. We also leverage WideDeep to aid in the\nassessment of Chinese LLMs, which has accelerated the evaluation time by 4.6\ntimes, resulting in a 60% cost saving. WideDeep achieves a remarkable 93%\nagreement level among humans.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:38:34 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Zhang","Xinghua",""],["Yu","Bowen",""],["Yu","Haiyang",""],["Lv","Yangyu",""],["Liu","Tingwen",""],["Huang","Fei",""],["Xu","Hongbo",""],["Li","Yongbin",""]]}
{"id":"2308.01863","submitter":"Taha Lokat Mr","authors":"Taha Lokat, Divyam Prajapati, Shubhada Labde","title":"Tag Prediction of Competitive Programming Problems using Deep Learning\n  Techniques","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the past decade, the amount of research being done in the fields of\nmachine learning and deep learning, predominantly in the area of natural\nlanguage processing (NLP), has risen dramatically. A well-liked method for\ndeveloping programming abilities like logic building and problem solving is\ncompetitive programming. It can be tough for novices and even veteran\nprogrammers to traverse the wide collection of questions due to the massive\nnumber of accessible questions and the variety of themes, levels of difficulty,\nand questions offered. In order to help programmers find questions that are\nappropriate for their knowledge and interests, there is a need for an automated\nmethod. This can be done using automated tagging of the questions using Text\nClassification. Text classification is one of the important tasks widely\nresearched in the field of Natural Language Processing. In this paper, we\npresent a way to use text classification techniques to determine the domain of\na competitive programming problem. A variety of models, including are\nimplemented LSTM, GRU, and MLP. The dataset has been scraped from Codeforces, a\nmajor competitive programming website. A total of 2400 problems were scraped\nand preprocessed, which we used as a dataset for our training and testing of\nmodels. The maximum accuracy reached using our model is 78.0% by MLP(Multi\nLayer Perceptron).\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:39:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lokat","Taha",""],["Prajapati","Divyam",""],["Labde","Shubhada",""]]}
{"id":"2308.01864","submitter":"Alexander Dimoff","authors":"Alexander J. Dimoff, Jerome A. Orosz","title":"Modeling Apsidal Motion in Eclipsing Binaries using ELC","comments":"12 pages, 7 figures, published in AAS Journals","journal-ref":"AJ 166 114 (2023)","doi":"10.3847/1538-3881/aceaf4","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Apsidal motion is the precession of the line of apsides in the orbit of a\nbinary star due to perturbations from General Relativity (GR), tides, or\nthird-body interactions. The rate of precession due to tidal effects depends on\nthe interior structures of the stars, and as a result, binaries in which this\nprecession occurs are of great interest. Apsidal motion is observed through the\nanalysis of eclipse times, which reveal small changes in the average interval\nbetween successive primary and secondary eclipses, taking all available\nobserved times of eclipse and yielding an estimate of the apsidal rate. Given\nthat this is a single observed quantity, various degeneracies are unavoidably\npresent. Ideally, one would have a model that predicts eclipse times given the\norbital and stellar parameters. These parameters for a given binary could then\nbe computed using least squares, provided a suitably large number of eclipse\ntimes. Here we use the eclipsing light curve (ELC) program as such a model. The\nNewtonian equations of motion with additional force terms accounting for GR\ncontributions and tidal distortions are integrated, yielding precise sky\npositions as a function of time. Times of mid-eclipse and instantaneous orbital\nelements are computed as a function of time. In this paper, we outline the\nmethod and compare numerically computed apsidal rates with standard formulae\nusing a set of 15 binaries based on real systems. For our simulated systems,\nthe derived apsidal rates agree with the standard formula.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:39:34 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 20:48:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dimoff","Alexander J.",""],["Orosz","Jerome A.",""]]}
{"id":"2308.01865","submitter":"Raj Patil","authors":"Manoj K. Mandal, Pierpaolo Mastrolia, Hector O. Silva, Raj Patil, Jan\n  Steinhoff","title":"Renormalizing Love: tidal effects at the third post-Newtonian order","comments":"27 pages, 3 figures, 1 table. arXiv admin note: text overlap with\n  arXiv:2304.02030","journal-ref":null,"doi":null,"report-no":"HU-EP-23/43-RTG","categories":"hep-th astro-ph.HE gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the conservative effective two-body Hamiltonian at the third order\nin the post-Newtonian expansion with gravitoelectric quadrupolar dynamical\ntidal-interactions. Our derivation of the effective two-body Lagrangian is\nbased on the diagrammatic effective field theory approach and it involves\nFeynman integrals up to three loops, which are evaluated within the dimensional\nregularization scheme. The elimination of the divergent terms occurring in the\neffective Lagrangian requires the addition of counterterms to ensure finite\nobservables, thereby introducing a renormalization group flow to the\npost-adiabatic Love number. As a limiting case of the renormalized dynamical\neffective Hamiltonian, we also derive the effective Hamiltonian for adiabatic\ntides, and, in this regime, calculate the binding energy for a circular orbit,\nand the scattering angle in a hyperbolic scattering.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:40:41 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mandal","Manoj K.",""],["Mastrolia","Pierpaolo",""],["Silva","Hector O.",""],["Patil","Raj",""],["Steinhoff","Jan",""]]}
{"id":"2308.01866","submitter":"Richard Cushman","authors":"Richard Cushman","title":"A momentum map for the Heisenberg group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  These notes treat a momentum map associated to the Heisenberg group. We\nclassify the coadjoint orbits of the Heisenberg group and show that the cocycle\nassociated to the momentum map becomes a value of the modulus of a coadjoint\norbit. We give a representation theoretic description of this modulus.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:42:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cushman","Richard",""]]}
{"id":"2308.01867","submitter":"Sankalp Dayal","authors":"Manasa Manohara, Sankalp Dayal, Tariq Afzal, Rahul Bakshi, Kahkuen Fu","title":"MRQ:Support Multiple Quantization Schemes through Model Re-Quantization","comments":"8 pages, 6 figures, 3 tables, TinyML Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the proliferation of diverse hardware accelerators (e.g., NPU, TPU,\nDPU), deploying deep learning models on edge devices with fixed-point hardware\nis still challenging due to complex model quantization and conversion. Existing\nmodel quantization frameworks like Tensorflow QAT [1], TFLite PTQ [2], and\nQualcomm AIMET [3] supports only a limited set of quantization schemes (e.g.,\nonly asymmetric per-tensor quantization in TF1.x QAT [4]). Accordingly, deep\nlearning models cannot be easily quantized for diverse fixed-point hardwares,\nmainly due to slightly different quantization requirements. In this paper, we\nenvision a new type of model quantization approach called MRQ (model\nre-quantization), which takes existing quantized models and quickly transforms\nthe models to meet different quantization requirements (e.g., asymmetric ->\nsymmetric, non-power-of-2 scale -> power-of-2 scale). Re-quantization is much\nsimpler than quantizing from scratch because it avoids costly re-training and\nprovides support for multiple quantization schemes simultaneously. To minimize\nre-quantization error, we developed a new set of re-quantization algorithms\nincluding weight correction and rounding error folding. We have demonstrated\nthat MobileNetV2 QAT model [7] can be quickly re-quantized into two different\nquantization schemes (i.e., symmetric and symmetric+power-of-2 scale) with less\nthan 0.64 units of accuracy loss. We believe our work is the first to leverage\nthis concept of re-quantization for model quantization and models obtained from\nthe re-quantization process have been successfully deployed on NNA in the Echo\nShow devices.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 08:15:30 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 02:21:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Manohara","Manasa",""],["Dayal","Sankalp",""],["Afzal","Tariq",""],["Bakshi","Rahul",""],["Fu","Kahkuen",""]]}
{"id":"2308.01868","submitter":"Jose Gonz\\'alez-Abad","authors":"Jose Gonz\\'alez-Abad, \\'Alex Hern\\'andez-Garc\\'ia, Paula Harder, David\n  Rolnick, Jos\\'e Manuel Guti\\'errez","title":"Multi-variable Hard Physical Constraints for Climate Model Downscaling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Global Climate Models (GCMs) are the primary tool to simulate climate\nevolution and assess the impacts of climate change. However, they often operate\nat a coarse spatial resolution that limits their accuracy in reproducing\nlocal-scale phenomena. Statistical downscaling methods leveraging deep learning\noffer a solution to this problem by approximating local-scale climate fields\nfrom coarse variables, thus enabling regional GCM projections. Typically,\nclimate fields of different variables of interest are downscaled independently,\nresulting in violations of fundamental physical properties across\ninterconnected variables. This study investigates the scope of this problem\nand, through an application on temperature, lays the foundation for a framework\nintroducing multi-variable hard constraints that guarantees physical\nrelationships between groups of downscaled climate variables.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:42:02 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gonz\u00e1lez-Abad","Jose",""],["Hern\u00e1ndez-Garc\u00eda","\u00c1lex",""],["Harder","Paula",""],["Rolnick","David",""],["Guti\u00e9rrez","Jos\u00e9 Manuel",""]]}
{"id":"2308.01869","submitter":"Mingjie Li","authors":"Mingjie Li, S. A. R. Horsley","title":"The Electronic and Electromagnetic Dirac Equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Maxwell's equations and the Dirac equation are the first-order differential\nrelativistic wave equation for electromagnetic waves and electronic waves\nrespectively. Hence, there is a notable similarity between these two wave\nequations, which has been widely researched since the Dirac equation was\nproposed. In this paper, we show that the Maxwell equations can be written in\nan exact form of the Dirac equation by representing the four Dirac operators\nwith $8\\times8$ matrices. Unlike the ordinary $4\\times4$ Dirac equation, both\nspin--1/2 and spin--1 operators can be derived from the $8\\times8$ Dirac\nequation, manifesting that the $8\\times8$ Dirac equation is able to describe\nboth electrons and photons. As a result of the restrictions that the\nelectromagnetic wave is a transverse wave, the photon is a spin--1 particle.\nThe four--current in the Maxwell equations and the mass in the electronic Dirac\nequation also force the electromagnetic field to transform differently to the\nelectronic field. We use this $8\\times8$ representation to find that the\nZitterbewegung of the photon is actually the oscillatory part of the Poynting\nvector, often neglected upon time averaging.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:47:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Li","Mingjie",""],["Horsley","S. A. R.",""]]}
{"id":"2308.01871","submitter":"Suk Kim","authors":"Eunsuk Seo, Suk Kim, Youngdae Lee, Sang-Il Han, Hak-Sub Kim, Soo-Chang\n  Rey, and Hyunmi Song","title":"Similar image retrieval using Autoencoder. I. Automatic morphology\n  classification of galaxies","comments":"Accepted for publication to PASP; 19 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the construction of an image similarity retrieval engine for the\nmorphological classification of galaxies using the Convolutional AutoEncoder\n(CAE). The CAE is trained on 90,370 preprocessed Sloan Digital Sky Survey\ngalaxy images listed in the Galaxy Zoo 2 (GZ2) catalog. The visually similar\noutput images returned by the trained CAE suggest that the encoder efficiently\ncompresses input images into latent features, which are then used to calculate\nsimilarity parameters. Our Tool for Searching a similar Galaxy Image based on a\nConvolutional Autoencoder using Similarity (TSGICAS) leverages this similarity\nparameter to classify galaxies' morphological types, enabling the\nidentification of a wider range of classes with high accuracy compared to\ntraditional supervised ML techniques. This approach streamlines the\nresearcher's work by allowing quick prioritization of the most relevant images\nfrom the latent feature database. We investigate the accuracy of our automatic\nmorphological classifications using three galaxy catalogs: GZ2, Extraction de\nFormes Id\\'ealis\\'ees de Galaxies en Imagerie (EFIGI), and Nair $\\&$ Abraham\n(NA10). The correlation coefficients between the morphological types of input\nand retrieved galaxy images were found to be 0.735, 0.811, and 0.815 for GZ2,\nEFIGI, and NA10 catalogs, respectively. Despite differences in morphology tags\nbetween input and retrieved galaxy images, visual inspection showed that the\ntwo galaxies were very similar, highlighting TSGICAS's superior performance in\nimage similarity search. We propose that morphological classifications of\ngalaxies using TSGICAS are fast and efficient, making it a valuable tool for\ndetailed galaxy morphological classifications in other imaging surveys.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:49:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Seo","Eunsuk",""],["Kim","Suk",""],["Lee","Youngdae",""],["Han","Sang-Il",""],["Kim","Hak-Sub",""],["Rey","Soo-Chang",""],["Song","Hyunmi",""]]}
{"id":"2308.01872","submitter":"Mark Riedl","authors":"Christopher Cui, Xiangyu Peng, Mark Riedl","title":"Thespian: Multi-Character Text Role-Playing Game Agents","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-adventure games and text role-playing games are grand challenges for\nreinforcement learning game playing agents. Text role-playing games are\nopen-ended environments where an agent must faithfully play a particular\ncharacter. We consider the distinction between characters and actors, where an\nactor agent has the ability to play multiple characters. We present a framework\nwe call a thespian agent that can learn to emulate multiple characters along\nwith a soft prompt that can be used to direct it as to which character to play\nat any time. We further describe an attention mechanism that allows the agent\nto learn new characters that are based on previously learned characters in a\nfew-shot fashion. We show that our agent outperforms the state of the art agent\nframework in multi-character learning and few-shot learning.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:53:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cui","Christopher",""],["Peng","Xiangyu",""],["Riedl","Mark",""]]}
{"id":"2308.01873","submitter":"Hana Jia Kong","authors":"Gabriel Angelini-Knoll, Mark Behrens, Eva Belmont, Hana Jia Kong","title":"A deformation of Borel equivariant homotopy","comments":"49 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We describe a deformation of the $\\infty$-category of Borel $G$-spectra for a\nfinite group $G$. This provides a new presentation of the $a$-complete real\nArtin--Tate motivic stable homotopy category when $G=C_2$ and gives a new\ninterpretation of the $a$-completed $C_2$-effective slice spectral sequence. As\na new computational tool, we present a modified Adams--Novikov spectral\nsequence which computes the $RO(G)$-graded Mackey functor valued homotopy of\nBorel $G$-spectra.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:59:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Angelini-Knoll","Gabriel",""],["Behrens","Mark",""],["Belmont","Eva",""],["Kong","Hana Jia",""]]}
{"id":"2308.01874","submitter":"Roberta Flenghi","authors":"Roberta Flenghi and Benjamin Jourdain","title":"Convergence to the uniform distribution of vectors of partial sums\n  modulo one with a common factor","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 prove the joint convergence in distribution of $q$ variables\nmodulo one obtained as partial sums of a sequence of i.i.d. square integrable\nrandom variables multiplied by a common factor given by some function of an\nempirical mean of the same sequence. The limit is uniformy distributed over\n$[0,1]^q$. To deal with the coupling introduced by the common factor, we assume\nthat the joint distribution of the random variables has a non zero component\nabsolutely continuous with respect to the Lebesgue measure, so that the\nconvergence in the central limit theorem for this sequence holds in total\nvariation distance. While our result provides a generalization of Benford's law\nto a data adapted mantissa, our main motivation is the derivation of a central\nlimit theorem for the stratified resampling mechanism, which is performed in\nthe companion paper \\cite{echant}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:04:19 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 12:40:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Flenghi","Roberta",""],["Jourdain","Benjamin",""]]}
{"id":"2308.01875","submitter":"Syed Uddin","authors":"Syed A. Uddin, Christopher R. Burns, Mark M. Phillips, Nicholas B.\n  Suntzeff, Wendy L. Freedman, Peter J. Brown, Nidia Morrell, Mario Hamuy,\n  Kevin Krisciunas, Lifan Wang, Eric Y. Hsiao, Ariel Goobar, Saul Perlmutter,\n  Jing Lu, Maximilian Stritzinger, Joseph P. Anderson, Chris Ashall, Peter\n  Hoeflich, Benjamin J. Shappee, S. E. Persson, Anthony L. Piro, Eddie Baron,\n  Carlos Contreras, Llu\\'is Galbany, Sahana Kumar, Melissa Shahbandeh, Scott\n  Davis, Jorge Anais, Luis Busta, Abdo Campillay, Sergio Castell\\'on, Carlos\n  Corco, Tiara Diamond, Christa Gall, Consuelo Gonzalez, Simon Holmbo, Miguel\n  Roth, Jacqueline Ser\\'on, Francesco Taddia, Sim\\'on Torres, Charles Baltay,\n  Gast\\'on Folatelli, Ellie Hadjiyska, Mansi Kasliwal, Peter E. Nugent, David\n  Rabinowitz, Stuart D. Ryder, Brian P. Schmidt","title":"Carnegie Supernova Project-I and -II: Measurements of $H_0$ using\n  Cepheid, TRGB, and SBF Distance Calibration to Type Ia Supernovae","comments":"Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an analysis of Type Ia Supernovae (SNe~Ia) from both the Carnegie\nSupernova Project~I (CSP-I) and II (CSP-II), and extend the Hubble diagram from\nthe optical to the near-infrared wavelengths ($uBgVriYJH$). We calculate the\nHubble constant, $H_0$ using various distance calibrators: Cepheids, Tip of the\nRed Giant Branch (TRGB), and Surface Brightness Fluctuations (SBF). Combining\nall methods of calibrations, we derive $\\rm H_0=71.43 \\pm 0.62 \\ (stat) \\pm\n2.43 \\ (sys) \\ km \\ s^{-1} \\ Mpc^{-1}$ from $B$-band, and $\\rm H_0=72.65 \\pm\n0.63 \\ (stat) \\pm 2.88 \\ (sys) \\ km \\ s^{-1} \\ Mpc^{-1}$ from $H$-band. By\nassigning equal weight to the Cepheid, TRGB, and SBF calibrators, we derive the\nsystematic errors required for consistency in the first rung of the distance\nladder, resulting in an increased systematic error in $H_0$. As a result, the\ntension between the late-time $H_0$ we derive by combining the various distance\ncalibrators and the early-time $H_0$ from the Cosmic Microwave Background is\nreduced. The highest precision in SN~Ia luminosity is found in the $Y$ band\n($0.12\\pm0.01$ mag), as defined by the intrinsic scatter ($\\sigma_{int}$). We\nrevisit SN~Ia Hubble residual-host mass correlations and recover previous\nresults that these correlations do not change significantly between the optical\nand the near-infrared wavelengths. Finally, SNe~Ia that explode beyond 10 kpc\nfrom their host centers exhibit smaller dispersion in their luminosity,\nconfirming our earlier findings. Reduced effect of dust in the outskirt of\nhosts may be responsible for this effect.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:05:32 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Uddin","Syed A.",""],["Burns","Christopher R.",""],["Phillips","Mark M.",""],["Suntzeff","Nicholas B.",""],["Freedman","Wendy L.",""],["Brown","Peter J.",""],["Morrell","Nidia",""],["Hamuy","Mario",""],["Krisciunas","Kevin",""],["Wang","Lifan",""],["Hsiao","Eric Y.",""],["Goobar","Ariel",""],["Perlmutter","Saul",""],["Lu","Jing",""],["Stritzinger","Maximilian",""],["Anderson","Joseph P.",""],["Ashall","Chris",""],["Hoeflich","Peter",""],["Shappee","Benjamin J.",""],["Persson","S. E.",""],["Piro","Anthony L.",""],["Baron","Eddie",""],["Contreras","Carlos",""],["Galbany","Llu\u00eds",""],["Kumar","Sahana",""],["Shahbandeh","Melissa",""],["Davis","Scott",""],["Anais","Jorge",""],["Busta","Luis",""],["Campillay","Abdo",""],["Castell\u00f3n","Sergio",""],["Corco","Carlos",""],["Diamond","Tiara",""],["Gall","Christa",""],["Gonzalez","Consuelo",""],["Holmbo","Simon",""],["Roth","Miguel",""],["Ser\u00f3n","Jacqueline",""],["Taddia","Francesco",""],["Torres","Sim\u00f3n",""],["Baltay","Charles",""],["Folatelli","Gast\u00f3n",""],["Hadjiyska","Ellie",""],["Kasliwal","Mansi",""],["Nugent","Peter E.",""],["Rabinowitz","David",""],["Ryder","Stuart D.",""],["Schmidt","Brian P.",""]]}
{"id":"2308.01876","submitter":"Bingcheng Suo","authors":"Bingcheng Suo, A. C. Quillen, Max Neiderbach, Luke O'Brient, Abobakar\n  Sediq Miakhel, Nathan Skerrett, J\\'er\\'emy Couturier, Victor Lherm, Jiaxin\n  Wang, Hesam Askari, Esteban Wright, Paul S\\'anchez","title":"Subsurface pulse, crater and ejecta asymmetry from oblique impacts into\n  granular media","comments":"28 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM cond-mat.soft physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We carry out experiments of 104 m/s velocity oblique impacts into a granular\nmedium (sand). Impact craters have nearly round rims even at a grazing angle of\nabout $10^\\circ$, however, the strength of seismic pulses excited by the impact\nis dependent upon impact angle, and the ratio between uprange and downrange\nvelocity peaks can be as large as 5, particularly at shallow depths. Crater\nslope, an offset between crater center and impact site, crater volume,\nazimuthal variation in ejection angle, seismic pulse shapes and subsurface flow\ndirection are also sensitive to impact angle, but to a much lower degree than\nsubsurface pulse strength. Uprange and downrange pulse peak amplitudes can be\nestimated from the horizontal and vertical components of the momentum imparted\nto the medium from the projectile\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:06:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Suo","Bingcheng",""],["Quillen","A. C.",""],["Neiderbach","Max",""],["O'Brient","Luke",""],["Miakhel","Abobakar Sediq",""],["Skerrett","Nathan",""],["Couturier","J\u00e9r\u00e9my",""],["Lherm","Victor",""],["Wang","Jiaxin",""],["Askari","Hesam",""],["Wright","Esteban",""],["S\u00e1nchez","Paul",""]]}
{"id":"2308.01877","submitter":"Giulio Tiozzo","authors":"Kunal Chawla, Inhyeok Choi and Giulio Tiozzo","title":"Genericity of contracting geodesics in groups","comments":"20 pages","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":"  Let G be a finitely generated group and Cay(G, S) be the Cayley graph of G\nwith respect to a finite generating set S. We characterize the Gromov\nhyperbolicity of G in terms of the genericity of contracting elements in Cay(G,\nS).\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:09:41 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chawla","Kunal",""],["Choi","Inhyeok",""],["Tiozzo","Giulio",""]]}
{"id":"2308.01878","submitter":"Lankeswar Dey","authors":"Mauri J. Valtonen, Lankeswar Dey, Achamveedu Gopakumar, Staszek Zola,\n  Anne L\\\"ahteenm\\\"aki, Merja Tornikoski, Alok C. Gupta, Tapio Pursimo, Emil\n  Knudstrup, Jose L. Gomez, Rene Hudec, Martin Jel\\'inek, Jan \\v{S}trobl,\n  Andrei V. Berdyugin, Stefano Ciprini, Daniel E. Reichart, Vladimir V.\n  Kouprianov, Katsura Matsumoto, Marek Drozdz, Markus Mugrauer, Alberto Sadun,\n  Michal Zejmo, Aimo Sillanp\\\"a\\\"a, Harry J. Lehto, Kari Nilsson, Ryo Imazawa\n  and Makoto Uemura","title":"Observational Implications of OJ 287's Predicted 2022 Disk Impact in the\n  Black Hole Binary Model","comments":"24 pages, 13 figures, published in Galaxies as part of the Special\n  Issue Distant Glowing Objects: Quest for Quasars","journal-ref":null,"doi":"10.3390/galaxies11040082","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a summary of the results of the OJ 287 observational campaign,\nwhich was carried out during the 2021/2022 observational season. This season is\nspecial in the binary model because the major axis of the precessing binary\nhappens to lie almost exactly in the plane of the accretion disc of the\nprimary. This leads to pairs of almost identical impacts between the secondary\nblack hole and the accretion disk in 2005 and 2022. In 2005, a special flare\ncalled \"blue flash\" was observed 35 days after the disk impact, which should\nhave also been verifiable in 2022. We did observe a similar flash and were able\nto obtain more details of its properties. We describe this in the framework of\nexpanding cloud models. In addition, we were able to identify the flare arising\nexactly at the time of the disc crossing from its photo-polarimetric and\ngamma-ray properties. This is an important identification, as it directly\nconfirms the orbit model. Moreover, we saw a huge flare that lasted only one\nday. We may understand this as the lighting up of the jet of the secondary\nblack hole when its Roche lobe is suddenly flooded by the gas from the primary\ndisk. Therefore, this may be the first time we directly observed the secondary\nblack hole in the OJ 287 binary system.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:14:12 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Valtonen","Mauri J.",""],["Dey","Lankeswar",""],["Gopakumar","Achamveedu",""],["Zola","Staszek",""],["L\u00e4hteenm\u00e4ki","Anne",""],["Tornikoski","Merja",""],["Gupta","Alok C.",""],["Pursimo","Tapio",""],["Knudstrup","Emil",""],["Gomez","Jose L.",""],["Hudec","Rene",""],["Jel\u00ednek","Martin",""],["\u0160trobl","Jan",""],["Berdyugin","Andrei V.",""],["Ciprini","Stefano",""],["Reichart","Daniel E.",""],["Kouprianov","Vladimir V.",""],["Matsumoto","Katsura",""],["Drozdz","Marek",""],["Mugrauer","Markus",""],["Sadun","Alberto",""],["Zejmo","Michal",""],["Sillanp\u00e4\u00e4","Aimo",""],["Lehto","Harry J.",""],["Nilsson","Kari",""],["Imazawa","Ryo",""],["Uemura","Makoto",""]]}
{"id":"2308.01879","submitter":"Luke Mortimer MPhys","authors":"Luke Mortimer","title":"Mutually unbiased bases as a commuting polynomial optimisation problem","comments":"9 pages, 2 figures, 9 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of mutually unbiased bases as a polynomial\noptimization problem over the reals. We heavily reduce it using known\nsymmetries before exploring it using two methods, combining a number of\noptimization techniques. The first of these is a search for bases using\nLagrange-multipliers that converges rapidly in case of MUB existence, whilst\nthe second combines a hierarchy of semidefinite programs with branch-and-bound\ntechniques to perform a global search. We demonstrate that such an algorithm\nwould eventually solve the open question regarding dimension 6 with finite\nmemory, although it still remains intractable. We explore the idea that to show\nthe inexistence of bases, it suffices to search for orthonormal vector sets of\ncertain smaller sizes, rather than full bases. We use our two methods to\nconjecture the minimum set sizes required to show infeasibility, proving it for\ndimensions 3. The fact that such sub-problems seem to also be infeasible\nheavily reduces the number of variables, by 66\\% in the case of the open\nproblem, potentially providing an large speedup for other algorithms and\nbringing them into the realm of tractability.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:14:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Mortimer","Luke",""]]}
{"id":"2308.01880","submitter":"Arturo Miranda-Rosete","authors":"Arturo Miranda-Rosete (1) and Ant\\'igona Segura (1 and 2) and Edward\n  W. Schwieterman (2 and 3 and 4) ((1) Instituto de Ciencias Nucleares, UNAM,\n  (2) Virtual Planet Laboratory, (3) University of California. Riverside, (4)\n  Blue Marble Space Institute of Science)","title":"Biosignature false positives in potentially habitable planets around M\n  dwarfs: the effect of UV radiation from one flare","comments":"Accepted for publication in ApJ. 31 pages, 14 figures. Revised proof","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Many past studies have predicted the steady-state production and maintenance\nof abiotic O$_2$ and O$_3$ in the atmospheres of CO$_2$-rich terrestrial\nplanets orbiting M dwarf stars. However, the time-dependent responses of these\nplanetary atmospheres to flare events - and the possible temporary production\nor enhancement of false positive biosignatures therein - has been comparatively\nless well studied. Most past works that have modeled the photochemical response\nto flares have assumed abundant free oxygen like that of the modern or\nProterozoic Earth. Here we examine in detail the photochemical impact of the UV\nemitted by a single flare on abiotic O$_2$/O$_3$ production in prebiotic,\nCO$_2$-dominated atmospheres of M dwarf planets with CO$_2$ levels ranging from\n10% to 90% of 1 bar. We find that a single flare generally destroys O$_2$ while\nmodestly enhancing O$_3$ column densities. We simulate the spectral observables\nof both the steady-state atmosphere and time-dependent spectral response over\nthe flare window for both emitted and transmitted light spectra. Over the\ncourse of the flare, the O$_3$ UV Hartley band is modestly enhanced by a\nmaximum of 6 ppm while the CO$_2$ molecular transit depths modestly decline by\n7 ppm. In both emitted and transmitted light spectra, the 9.65 $\\mu$m O$_3$\nband is hidden by the overlapping 9.4 $\\mu$m CO$_2$ band for all scenarios\nconsidered. Overall, we find that the possible enhancements of abiotic O$_3$\ndue to a single flare are small compared to O$_3$'s sensitivity to other\nparameters such as CO$_2$ and H$_2$O abundances or the availability of reducing\ngases such as H$_2$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:15:33 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 03:31:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Miranda-Rosete","Arturo","","1 and 2"],["Segura","Ant\u00edgona","","1 and 2"],["Schwieterman","Edward W.","","2 and 3 and 4"]]}
{"id":"2308.01881","submitter":"Felix Brandt","authors":"Felix Brandt and Florian Grundbacher","title":"The Banks Set and the Bipartisan Set May be Disjoint","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tournament solutions play an important role within social choice theory and\nthe mathematical social sciences at large. We construct a tournament of order\n36 for which the Banks set and the bipartisan set are disjoint. This implies\nthat refinements of the Banks set, such as the minimal extending set and the\ntournament equilibrium set, can also be disjoint from the bipartisan set.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:15:34 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Brandt","Felix",""],["Grundbacher","Florian",""]]}
{"id":"2308.01882","submitter":"Andreas Hanel","authors":"Sebastian Miehling, Andreas Hanel, Jerry Lambert, Sebastian Fendt,\n  Hartmut Spliethoff","title":"Energy System Optimisation using (Mixed Integer) Linear Programming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.CE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Although energy system optimisation based on linear optimisation is often\nused for influential energy outlooks and studies for political decision-makers,\nthe underlying background still needs to be described in the scientific\nliterature in a concise and general form. This study presents the main\nequations and advanced ideas and explains further possibilities mixed integer\nlinear programming offers in energy system optimisation. Furthermore, the\nequations are shown using an example system to present a more practical point\nof view. Therefore, this study is aimed at researchers trying to understand the\nbackground of studies using energy system optimisation and researchers building\ntheir implementation into a new framework. This study describes how to build a\nstandard model, how to implement advanced equations using linear programming,\nand how to implement advanced equations using mixed integer linear programming,\nas well as shows a small exemplary system. - Presentation of the OpTUMus energy\nsystem optimisation framework - Set of equations for a fully functional energy\nsystem model - Example of a simple energy system model\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:16:30 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 12:38:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Miehling","Sebastian",""],["Hanel","Andreas",""],["Lambert","Jerry",""],["Fendt","Sebastian",""],["Spliethoff","Hartmut",""]]}
{"id":"2308.01883","submitter":"Tobias Schmid","authors":"Tobias Schmid","title":"Blow up dynamics for the 3D energy-critical Nonlinear Schr\\\"odinger\n  equation","comments":"123 p","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a two-parameter continuum of type II blow up solutions for the\nenergy-critical focusing NLS in dimension $ d = 3$. The solutions collapse to a\nsingle energy bubble in finite time, precisely they have the form $ u(t,x) =\ne^{i \\alpha(t)}\\lambda(t)^{\\frac{1}{2}}W(\\lambda(t) x) + \\eta(t, x )$, $ t\n\\in[0, T)$, $ x \\in \\mathbb{R}^3$, where $ W( x) = \\big( 1 +\n\\frac{|x|^2}{3}\\big)^{-\\frac{1}{2}}$ is the ground state solution, $\\lambda(t)\n= (T-t)^{- \\frac12 - \\nu} $ for suitable $ \\nu > 0 $, $ \\alpha(t) = \\alpha_0\n\\log(T - t)$ and $ T= T(\\nu, \\alpha_0) > 0 $. Further $ \\|\\eta(t) -\n\\eta_T\\|_{\\dot{H}^1 \\cap \\dot{H}^2} = o(1)$ as $ t \\to T^-$ for some $ \\eta_T\n\\in \\dot{H}^{1} \\cap~ \\dot{H}^2$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:16:31 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Schmid","Tobias",""]]}
{"id":"2308.01884","submitter":"Giulia Lusetti","authors":"Giulia Lusetti, Annalisa Bonafede, Lorenzo Lovisari, Myriam Gitti,\n  Stefano Ettori, Rossella Cassano, Christopher J. Riseley, Federica Govoni,\n  Marcus Br\\\"uggen, Luca Bruno, Reinout J. van Weeren, Andrea Botteon, Duy N.\n  Hoang, Fabio Gastaldello, Alessandro Ignesti, Mariachiara Rossetti, Timothy\n  W. Shimwell","title":"LOFAR detection of extended emission around a mini-halo in the galaxy\n  cluster Abell 1413","comments":"14 pages, 8 figures, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The relation between giant radio halos and mini-halos in galaxy clusters is\nnot understood. The former are usually associated with merging clusters, the\nlatter are found in relaxed systems. In the last years, the advent of\nlow-frequency radio observations has challenged this dichotomy, finding\nintermediate objects with a hybrid radio morphology. We aim to investigate the\npresence of diffuse radio emission in the cluster Abell 1413 and determine its\ndynamical status. We used LOFAR HBA observations centred at 144 MHz to study\nthe diffuse emission hosted by this cluster.To investigate the dynamical state\nof the system, we complete our study with newly analysed XMM-Newton archival\ndata. A1413 shows features that are typically present in both relaxed (e.g.,\npeaked x-ray surface brightness distribution and little large-scale\ninhomogeneities) and disturbed (e.g., flatter temperature and metallicity\nprofiles) clusters.This evidence supports the scenario that A1413 is neither a\ndisturbed nor fully relaxed object. We argue that it is an intermediate-phase\ncluster.Using radio observations at 144 MHz, we discover the presence of a\nwider diffuse component surrounding the previously reported mini-halo at the\ncluster centre. By fitting the radio surface brightness profile with a\ndouble-exponential model, we can disentangle the two components. We find an\ninner mini-halo with an e-folding radius r_e1=28 kpc and the extended component\nwith r_e2 = 290 kpc. We also performed point-to-point correlations between\nradio and X-ray surface brightness, finding a sub-linear relation for the outer\nemission and a super-linear relation for the mini-halo.The mini-halo and the\ndiffuse emission extend over different scales and show different features,\nconfirming the double nature of the radio emission and suggesting that the\nmechanisms responsible for the re-acceleration of the radio-emitting particle\nmight be different.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:17:51 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lusetti","Giulia",""],["Bonafede","Annalisa",""],["Lovisari","Lorenzo",""],["Gitti","Myriam",""],["Ettori","Stefano",""],["Cassano","Rossella",""],["Riseley","Christopher J.",""],["Govoni","Federica",""],["Br\u00fcggen","Marcus",""],["Bruno","Luca",""],["van Weeren","Reinout J.",""],["Botteon","Andrea",""],["Hoang","Duy N.",""],["Gastaldello","Fabio",""],["Ignesti","Alessandro",""],["Rossetti","Mariachiara",""],["Shimwell","Timothy W.",""]]}
{"id":"2308.01885","submitter":"Mohamed Tahar Kadaoui Abbassi","authors":"Mohamed Tahar Kadaoui Abbassi, Souhail Doua and Ibrahim Lakrini","title":"On biharmonic functions on vector bundles","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is devoted to the investigation of harmonic and biharmonic\nfunctions on vector bundles equipped with spherically symmetric metrics. We\nwill study the biharmonicity of vertical lifts of functions as well as\n$r$-radial functions on vector bundle manifolds and, as a consequence, we will\nconstruct an infinite two-parameter family of proper biharmonic functions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:18:37 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Abbassi","Mohamed Tahar Kadaoui",""],["Doua","Souhail",""],["Lakrini","Ibrahim",""]]}
{"id":"2308.01886","submitter":"You Zhou","authors":"Junjie Chen, Yuxuan Yan, You Zhou","title":"Magic of quantum hypergraph states","comments":"12+15 pages, 4 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magic, or nonstabilizerness, characterizes the deviation of a quantum state\nfrom the set of stabilizer states and plays a fundamental role from quantum\nstate complexity to universal fault-tolerant quantum computing. However,\nanalytical or even numerical characterizations of magic are very challenging,\nespecially in the multi-qubit system, even with a moderate qubit number. Here\nwe systemically and analytically investigate the magic resource of archetypal\nmultipartite quantum states -- quantum hypergraph states, which can be\ngenerated by multi-qubit Controlled-phase gates encoded by hypergraphs. We\nfirst give the magic formula in terms of the stabilizer\nR$\\mathrm{\\acute{e}}$nyi-$\\alpha$ entropies for general quantum hypergraph\nstates and prove the magic can not reach the maximal value, if the average\ndegree of the corresponding hypergraph is constant. Then we investigate the\nstatistical behaviors of random hypergraph states and prove the concentration\nresult that typically random hypergraph states can reach the maximal magic.\nThis also suggests an efficient way to generate maximal magic states with\nrandom diagonal circuits. Finally, we study some highly symmetric hypergraph\nstates with permutation-symmetry, such as the one whose associated hypergraph\nis $3$-complete, i.e., any three vertices are connected by a hyperedge.\nCounterintuitively, such states can only possess constant or even exponentially\nsmall magic for $\\alpha\\geq 2$. Our study advances the understanding of\nmultipartite quantum magic and could lead to applications in quantum computing\nand quantum many-body physics.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:21:55 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Chen","Junjie",""],["Yan","Yuxuan",""],["Zhou","You",""]]}
{"id":"2308.01887","submitter":"Marilyn Walker","authors":"Omkar Patil, Lena Reed, Kevin K. Bowden, Juraj Juraska, Wen Cui,\n  Vrindavan Harrison, Rishi Rajasekaran, Angela Ramirez, Cecilia Li, Eduardo\n  Zamora, Phillip Lee, Jeshwanth Bheemanpally, Rohan Pandey, Adwait\n  Ratnaparkhi, and Marilyn Walker","title":"Athena 2.0: Discourse and User Modeling in Open Domain Dialogue","comments":"Alexa Prize Proceedings, 2021. Socialbot Grand Challenge 4","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conversational agents are consistently growing in popularity and many people\ninteract with them every day. While many conversational agents act as personal\nassistants, they can have many different goals. Some are task-oriented, such as\nproviding customer support for a bank or making a reservation. Others are\ndesigned to be empathetic and to form emotional connections with the user. The\nAlexa Prize Challenge aims to create a socialbot, which allows the user to\nengage in coherent conversations, on a range of popular topics that will\ninterest the user. Here we describe Athena 2.0, UCSC's conversational agent for\nAmazon's Socialbot Grand Challenge 4. Athena 2.0 utilizes a novel\nknowledge-grounded discourse model that tracks the entity links that Athena\nintroduces into the dialogue, and uses them to constrain named-entity\nrecognition and linking, and coreference resolution. Athena 2.0 also relies on\na user model to personalize topic selection and other aspects of the\nconversation to individual users.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:30:39 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Patil","Omkar",""],["Reed","Lena",""],["Bowden","Kevin K.",""],["Juraska","Juraj",""],["Cui","Wen",""],["Harrison","Vrindavan",""],["Rajasekaran","Rishi",""],["Ramirez","Angela",""],["Li","Cecilia",""],["Zamora","Eduardo",""],["Lee","Phillip",""],["Bheemanpally","Jeshwanth",""],["Pandey","Rohan",""],["Ratnaparkhi","Adwait",""],["Walker","Marilyn",""]]}
{"id":"2308.01888","submitter":"Muhammad Awais","authors":"Muhammad, Awais, Weiming, Zhuang, Lingjuan, Lyu, Sung-Ho, Bae","title":"FROD: Robust Object Detection for Free","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Object detection is a vital task in computer vision and has become an\nintegral component of numerous critical systems. However, state-of-the-art\nobject detectors, similar to their classification counterparts, are susceptible\nto small adversarial perturbations that can significantly alter their normal\nbehavior. Unlike classification, the robustness of object detectors has not\nbeen thoroughly explored. In this work, we take the initial step towards\nbridging the gap between the robustness of classification and object detection\nby leveraging adversarially trained classification models. Merely utilizing\nadversarially trained models as backbones for object detection does not result\nin robustness. We propose effective modifications to the classification-based\nbackbone to instill robustness in object detection without incurring any\ncomputational overhead. To further enhance the robustness achieved by the\nproposed modified backbone, we introduce two lightweight components: imitation\nloss and delayed adversarial training. Extensive experiments on the MS-COCO and\nPascal VOC datasets are conducted to demonstrate the effectiveness of our\nproposed approach.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:31:22 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Muhammad","",""],["Awais","",""],["Weiming","",""],["Zhuang","",""],["Lingjuan","",""],["Lyu","",""],["Sung-Ho","",""],["Bae","",""]]}
{"id":"2308.01889","submitter":"Bavo Van Kerrebroeck","authors":"Bavo Van Kerrebroeck, Kristel Cromb\\'e, St\\'ephanie Wilain, Marc\n  Leman, Pieter-Jan Maes","title":"The virtual drum circle: polyrhythmic music interactions in extended\n  reality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emerging technologies in the domain of extended reality offer rich, new\npossibilities for the study and practice of joint music performance. Apart from\nthe technological challenges, bringing music players together in extended\nreality raises important questions on their performance and embodied\ncoordination. In this study, we designed an extended reality platform to assess\na remote, bidirectional polyrhythmic interaction between two players, mediated\nin real time by their three-dimensional embodied avatars and a shared, virtual\ndrum circle. We leveraged a multi-layered analysis framework to assess their\nperformance quality, embodied co-regulation and first-person interaction\nexperience, using statistical techniques for time-series analysis and\nmixed-effect regression and focusing on contrasts of visual coupling (not\nseeing / seeing as avatars / seeing as real) and auditory context (metronome /\nmusic). Results reveal that an auditory context with music improved the\nperformance output as measured by a prediction error, increased movement energy\nand levels of experienced agency. Visual coupling impacted experiential\nqualities and induced prosocial effects with increased levels of partner\nrealism resulting in increased levels of shared agency and self-other merging.\nEmbodied co-regulation between players was impacted by auditory context and\nvisual coupling, suggesting prediction-based compensatory mechanisms to deal\nwith the novelty, difficulty, and expressivity in the musical interaction. This\nstudy contributes to the understanding of music performance in extended reality\nby using a methodological approach to demonstrate how co-regulation between\nplayers is impacted by visual coupling and auditory context and provides a\nbasis and future directions for further action-oriented research.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:31:55 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 14:30:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Van Kerrebroeck","Bavo",""],["Cromb\u00e9","Kristel",""],["Wilain","St\u00e9phanie",""],["Leman","Marc",""],["Maes","Pieter-Jan",""]]}
{"id":"2308.01890","submitter":"Ping Hu","authors":"Ping Hu, Ximeng Sun, Stan Sclaroff, and Kate Saenko","title":"DualCoOp++: Fast and Effective Adaptation to Multi-Label Recognition\n  with Limited Annotations","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. arXiv admin note: substantial text overlap with\n  arXiv:2206.09541","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multi-label image recognition in the low-label regime is a task of great\nchallenge and practical significance. Previous works have focused on learning\nthe alignment between textual and visual spaces to compensate for limited image\nlabels, yet may suffer from reduced accuracy due to the scarcity of\nhigh-quality multi-label annotations. In this research, we leverage the\npowerful alignment between textual and visual features pretrained with millions\nof auxiliary image-text pairs. We introduce an efficient and effective\nframework called Evidence-guided Dual Context Optimization (DualCoOp++), which\nserves as a unified approach for addressing partial-label and zero-shot\nmulti-label recognition. In DualCoOp++ we separately encode evidential,\npositive, and negative contexts for target classes as parametric components of\nthe linguistic input (i.e., prompts). The evidential context aims to discover\nall the related visual content for the target class, and serves as guidance to\naggregate positive and negative contexts from the spatial domain of the image,\nenabling better distinguishment between similar categories. Additionally, we\nintroduce a Winner-Take-All module that promotes inter-class interaction during\ntraining, while avoiding the need for extra parameters and costs. As DualCoOp++\nimposes minimal additional learnable overhead on the pretrained vision-language\nframework, it enables rapid adaptation to multi-label recognition tasks with\nlimited annotations and even unseen classes. Experiments on standard\nmulti-label recognition benchmarks across two challenging low-label settings\ndemonstrate the superior performance of our approach compared to\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:33:20 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hu","Ping",""],["Sun","Ximeng",""],["Sclaroff","Stan",""],["Saenko","Kate",""]]}
{"id":"2308.01891","submitter":"Shawn L. Kiser","authors":"Shawn L. Kiser, Mikhail Guskov, Marc R\\'ebillat, Nicolas Ranc","title":"Exact identification of nonlinear dynamical systems by Trimmed Lasso","comments":"24 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY math.DS math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Identification of nonlinear dynamical systems has been popularized by sparse\nidentification of the nonlinear dynamics (SINDy) via the sequentially\nthresholded least squares (STLS) algorithm. Many extensions SINDy have emerged\nin the literature to deal with experimental data which are finite in length and\nnoisy. Recently, the computationally intensive method of ensembling\nbootstrapped SINDy models (E-SINDy) was proposed for model identification,\nhandling finite, highly noisy data. While the extensions of SINDy are numerous,\ntheir sparsity-promoting estimators occasionally provide sparse approximations\nof the dynamics as opposed to exact recovery. Furthermore, these estimators\nsuffer under multicollinearity, e.g. the irrepresentable condition for the\nLasso. In this paper, we demonstrate that the Trimmed Lasso for robust\nidentification of models (TRIM) can provide exact recovery under more severe\nnoise, finite data, and multicollinearity as opposed to E-SINDy. Additionally,\nthe computational cost of TRIM is asymptotically equal to STLS since the\nsparsity parameter of the TRIM can be solved efficiently by convex solvers. We\ncompare these methodologies on challenging nonlinear systems, specifically the\nLorenz 63 system, the Bouc Wen oscillator from the nonlinear dynamics benchmark\nof No\\\"el and Schoukens, 2016, and a time delay system describing tool cutting\ndynamics. This study emphasizes the comparisons between STLS, reweighted\n$\\ell_1$ minimization, and Trimmed Lasso in identification with respect to\nproblems faced by practitioners: the problem of finite and noisy data, the\nperformance of the sparse regression of when the library grows in dimension\n(multicollinearity), and automatic methods for choice of regularization\nparameters.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:37:18 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Kiser","Shawn L.",""],["Guskov","Mikhail",""],["R\u00e9billat","Marc",""],["Ranc","Nicolas",""]]}
{"id":"2308.01892","submitter":"J. Harnad","authors":"J. Harnad","title":"Hamiltonian structure of isomonodromic deformation dynamics in linear\n  systems of PDE's","comments":"Conference proceedings write-up of plenary talk given at: XL Workshop\n  on Geometric Methods in Physics, July 2-8, 2023, Bialowieza, Poland. 16\n  pages. (Typos corrected; added missing second Hamiltonian vector field in eq.\n  (3.11), references updated.)","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP math.SG nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Hamiltonian approach to isomonodromic deformation systems for generic\nrational covariant derivative operators on the Riemann sphere, having any\nmatrix dimension $r$ and any number of isolated singularities of arbitrary\nPoincar\\'e rank, is derived using the split classical rational $R$-matrix\nPoisson bracket structure on the dual space $L^*{\\frak gl}(r)$ of the loop\nalgebra $L{\\frak gl}(r)$. Nonautonomous isomonodromic counterparts of\nisospectral systems are obtained by identifying the deformation parameters as\nCasimir elements on the phase space. These are shown to coincide with the\nhigher Birkhoff invariants determining the local asymptotics near to irregular\nsingular points, together with the pole loci. They appear as the negative power\ncoefficients in the principal part of the Laurent expansion of the fundamental\nmeromorphic differential on the associated spectral curve, while the\ncorresponding dual spectral invariant Hamiltonians appear as the \"mirror image\"\npositive power terms in the analytic part. Infinitesimal isomonodromic\ndeformations are generated by the sum of the Hamiltonian vector field and an\nexplicit derivative vector field that is transversal to the symplectic\nfoliation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:39:28 GMT"},{"version":"v2","created":"Fri, 4 Aug 2023 16:53:39 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 15:15:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Harnad","J.",""]]}
{"id":"2308.01893","submitter":"Mark Harrison","authors":"Michael Efseaff and Mark C. Harrison","title":"Strategies for optimizing plasmonic grating couplers with topology-based\n  inverse design","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":"  Numerical simulations have become a cornerstone technology in the development\nof nanophotonic devices. Specifically, 3D finite difference time domain (FDTD)\nsimulations are a widely used due to their flexibility and powerful design\ncapabilities. More recently, FDTD simulations in conjunction with a design\nmethodology called inverse design has become a popular way to optimize device\ntopology, reducing a device's footprint and increasing performance. We\nimplement a commercial inverse design tool to generate complex grating couplers\nand explore a variety of grating coupler design methodologies. We compare the\nconventionally designed grating couplers to those generated by the inverse\ndesign tool. Finally, we discuss the limitations of the inverse design tool and\nhow different design strategies for grating couplers affect inverse design\nperformance, both in terms of computational cost and performance of the\nresulting device.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:41:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Efseaff","Michael",""],["Harrison","Mark C.",""]]}
{"id":"2308.01894","submitter":"Ningping Cao","authors":"Ningping Cao, Maxwell Fitzsimmons, Zachary Mann, Rajesh Pereira, and\n  Raymond Laflamme","title":"Quantum Maps Between CPTP and HPTP","comments":"7 pages + 9 pages, 3+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":"  For an open quantum system to evolve under CPTP maps, assumptions are made on\nthe initial correlations between the system and the environment.\nHermitian-preserving trace-preserving (HPTP) maps are considered as the local\ndynamic maps beyond CPTP. In this paper, we provide a succinct answer to the\nquestion of what physical maps are in the HPTP realm by two approaches. The\nfirst is by taking one step out of the CPTP set, which provides us with\nSemi-Positivity (SP) TP maps. The second way is by examining the physicality of\nHPTP maps, which leads to Semi-Nonnegative (SN) TP maps. Physical\ninterpretations and geometrical structures are studied for these maps. The\nnon-CP SPTP maps $\\Psi$ correspond to the quantum non-Markovian process under\nthe CP-divisibility definition ($\\Psi = \\Xi \\circ \\Phi^{-1}$, where $\\Xi$ and\n$\\Phi$ are CPTP). When removing the invertibility assumption on $\\Phi$, we land\nin the set of SNTP maps. A by-product of set relations is an answer to the\nfollowing question -- what kind of dynamics the system will go through when the\nprevious dynamic $\\Phi$ is non-invertible. In this case, the only locally\nwell-defined maps are in $SN\\backslash SP$, they live on the boundary of $SN$.\nOtherwise, the non-local information will be irreplaceable in the system's\ndynamic.\n  With the understanding of physical maps beyond CPTP, we prove that the\ncurrent quantum error correction scheme is still sufficient to correct quantum\nnon-Markovian errors. In some special cases, lack of complete positivity could\nprovide us with more error correction methods with less overhead.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:44:53 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Cao","Ningping",""],["Fitzsimmons","Maxwell",""],["Mann","Zachary",""],["Pereira","Rajesh",""],["Laflamme","Raymond",""]]}
{"id":"2308.01895","submitter":"Daniel Brignac","authors":"Daniel Brignac, Niels Lobo, Abhijit Mahalanobis","title":"Improving Replay Sample Selection and Storage for Less Forgetting in\n  Continual 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":"  Continual learning seeks to enable deep learners to train on a series of\ntasks of unknown length without suffering from the catastrophic forgetting of\nprevious tasks. One effective solution is replay, which involves storing few\nprevious experiences in memory and replaying them when learning the current\ntask. However, there is still room for improvement when it comes to selecting\nthe most informative samples for storage and determining the optimal number of\nsamples to be stored. This study aims to address these issues with a novel\ncomparison of the commonly used reservoir sampling to various alternative\npopulation strategies and providing a novel detailed analysis of how to find\nthe optimal number of stored samples.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:46:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Brignac","Daniel",""],["Lobo","Niels",""],["Mahalanobis","Abhijit",""]]}
{"id":"2308.01896","submitter":"Moise Blanchard","authors":"Mo\\\"ise Blanchard and V\\'aclav Vor\\'a\\v{c}ek","title":"Tight Bounds for Local Glivenko-Cantelli","comments":null,"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":"  This paper addresses the statistical problem of estimating the infinite-norm\ndeviation from the empirical mean to the distribution mean for high-dimensional\ndistributions on $\\{0,1\\}^d$, with potentially $d=\\infty$. Unlike traditional\nbounds as in the classical Glivenko-Cantelli theorem, we explore the\ninstance-dependent convergence behavior. For product distributions, we provide\nthe exact non-asymptotic behavior of the expected maximum deviation, revealing\nvarious regimes of decay. In particular, these tight bounds recover the known\nasymptotic sub-Gaussian behavior, and demonstrate the necessity of a previously\nproposed factor for an upper bound, answering a corresponding COLT 2023 open\nproblem.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:52:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Blanchard","Mo\u00efse",""],["Vor\u00e1\u010dek","V\u00e1clav",""]]}
{"id":"2308.01897","submitter":"Elena Kaisina","authors":"Valentina E. Karachentseva, Igor D. Karachentsev, Elena I. Kaisina,\n  Serafim S. Kaisin","title":"The M101 galaxy group as a node in the nearby cosmic filament","comments":"9 pages, 3 figures, 3 tables, 1 appendix. accepted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We performed a search for faint low surface brightness dwarf galaxies around\nthe major spiral galaxy M\\,101 and in the large rectangular area within SGL =\n[30 -- 80]$^{\\circ}$, SGB =[10 -- 37]$^{\\circ}$ spanning a chain of galaxies:\nM\\,63, M\\,51, M\\,101, and NGC\\,6503, based on the data from DESI Legacy Imaging\nSurveys. Six new supposed dwarf members of the complex were discovered. We\npresent a list of 25 prospective members of the M\\,101 group and estimate the\ntotal mass and the total-mass-to-$K$-band luminosity ratio of the group as\n$(1.02\\pm0.42)\\times10^{12}~M_{\\odot}$ and $(16.0\\pm6.5)~M_{\\odot}/L_{\\odot}$,\nrespectively. We notice that the average dark mass-to-luminosity ratio in the\ngroups around M\\,63, M\\,51, and M\\,101 is $(12\\pm4)M_{\\odot}/L_{\\odot}$ that\nalmost an order of magnitude lower than the global cosmic ratio,\n$(102\\pm5)M_{\\odot}/L_{\\odot}$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:53:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Karachentseva","Valentina E.",""],["Karachentsev","Igor D.",""],["Kaisina","Elena I.",""],["Kaisin","Serafim S.",""]]}
{"id":"2308.01898","submitter":"Ze Yang","authors":"Ze Yang, Yun Chen, Jingkang Wang, Sivabalan Manivasagam, Wei-Chiu Ma,\n  Anqi Joyce Yang, Raquel Urtasun","title":"UniSim: A Neural Closed-Loop Sensor Simulator","comments":"CVPR 2023 Highlight. Project page: https://waabi.ai/research/unisim/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rigorously testing autonomy systems is essential for making safe self-driving\nvehicles (SDV) a reality. It requires one to generate safety critical scenarios\nbeyond what can be collected safely in the world, as many scenarios happen\nrarely on public roads. To accurately evaluate performance, we need to test the\nSDV on these scenarios in closed-loop, where the SDV and other actors interact\nwith each other at each timestep. Previously recorded driving logs provide a\nrich resource to build these new scenarios from, but for closed loop\nevaluation, we need to modify the sensor data based on the new scene\nconfiguration and the SDV's decisions, as actors might be added or removed and\nthe trajectories of existing actors and the SDV will differ from the original\nlog. In this paper, we present UniSim, a neural sensor simulator that takes a\nsingle recorded log captured by a sensor-equipped vehicle and converts it into\na realistic closed-loop multi-sensor simulation. UniSim builds neural feature\ngrids to reconstruct both the static background and dynamic actors in the\nscene, and composites them together to simulate LiDAR and camera data at new\nviewpoints, with actors added or removed and at new placements. To better\nhandle extrapolated views, we incorporate learnable priors for dynamic objects,\nand leverage a convolutional network to complete unseen regions. Our\nexperiments show UniSim can simulate realistic sensor data with small domain\ngap on downstream tasks. With UniSim, we demonstrate closed-loop evaluation of\nan autonomy system on safety-critical scenarios as if it were in the real\nworld.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:56:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Yang","Ze",""],["Chen","Yun",""],["Wang","Jingkang",""],["Manivasagam","Sivabalan",""],["Ma","Wei-Chiu",""],["Yang","Anqi Joyce",""],["Urtasun","Raquel",""]]}
{"id":"2308.01899","submitter":"Jialiang Lin","authors":"Jialiang Lin, Yao Yu, Yu Zhou, Zhiyang Zhou, Xiaodong Shi","title":"How many preprints have actually been printed and why: a case study of\n  computer science preprints on arXiv","comments":"Please cite the version of Scientometrics","journal-ref":"Scientometrics, Vol. 124, Issue 1, pp. 555-574 (2020)","doi":"10.1007/s11192-020-03430-8","report-no":null,"categories":"cs.DL cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Preprints play an increasingly critical role in academic communities. There\nare many reasons driving researchers to post their manuscripts to preprint\nservers before formal submission to journals or conferences, but the use of\npreprints has also sparked considerable controversy, especially surrounding the\nclaim of priority. In this paper, a case study of computer science preprints\nsubmitted to arXiv from 2008 to 2017 is conducted to quantify how many\npreprints have eventually been printed in peer-reviewed venues. Among those\npublished manuscripts, some are published under different titles and without an\nupdate to their preprints on arXiv. In the case of these manuscripts, the\ntraditional fuzzy matching method is incapable of mapping the preprint to the\nfinal published version. In view of this issue, we introduce a semantics-based\nmapping method with the employment of Bidirectional Encoder Representations\nfrom Transformers (BERT). With this new mapping method and a plurality of data\nsources, we find that 66% of all sampled preprints are published under\nunchanged titles and 11% are published under different titles and with other\nmodifications. A further analysis was then performed to investigate why these\npreprints but not others were accepted for publication. Our comparison reveals\nthat in the field of computer science, published preprints feature adequate\nrevisions, multiple authorship, detailed abstract and introduction, extensive\nand authoritative references and available source code.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:56:16 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Jialiang",""],["Yu","Yao",""],["Zhou","Yu",""],["Zhou","Zhiyang",""],["Shi","Xiaodong",""]]}
{"id":"2308.01900","submitter":"Paolo Villoresi","authors":"Elisa Bazzani, Anna Valeria Guglielmi, Roberto Corvaja, Nicola\n  Laurenti, Filippo Romanato, Gianluca Ruffato, Andrea Vogliardi, Francesco\n  Vedovato, Giuseppe Vallone, Lorenzo Vangelista and Paolo Villoresi","title":"The Tree of Light as interstellar optical transmitter system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This work aims at investigating the optical transmission system needed for\nsuch lightweight sail, taking into account the physical constraints of such\nunprecedented link and focusing on the optimal scheme for the optical signal\nemission. In particular, the optical signal is distributed to several emitters\non the sail. The light diffraction resulting from the pattern of the emitters\nacting coherently determines the characteristics of the whole beam transmitted\nby the sail and of the received signal on the Earth. The performance of the\ndigital communication system using pulse position modulation (PPM) can be\nassessed and channel coding schemes are proposed. We are using the paradigm for\nwhich the entire sail communication system is described as a Tree-of-light: the\ndetectors, CPU, memory and laser transmitter are the central unit, representing\nthe trunk of the tree. The branches of the tree are the waveguides, directed to\nthe sail surface. By means of multimode splitters, the signal is further\ndistributed via the petioles to the emitters, the leaves, realized by grating\ncouplers (GCs), on which this work is more focused.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:56:17 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Bazzani","Elisa",""],["Guglielmi","Anna Valeria",""],["Corvaja","Roberto",""],["Laurenti","Nicola",""],["Romanato","Filippo",""],["Ruffato","Gianluca",""],["Vogliardi","Andrea",""],["Vedovato","Francesco",""],["Vallone","Giuseppe",""],["Vangelista","Lorenzo",""],["Villoresi","Paolo",""]]}
{"id":"2308.01901","submitter":"Judith Ard\\`evol","authors":"J. Ard\\`evol, M. Mongui\\'o, F. Figueras, M. Romero-G\\'omez, J. M.\n  Carrasco","title":"Exploring the structure and kinematics of the Milky Way through A stars","comments":"15 pages, 13 figures. Accepted for publication in Astronomy &\n  Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite their relatively high intrinsic brightness and the fact that they are\nmore numerous than younger OB stars and kinematically colder than older red\ngiants, A-type stars have rarely been used as Galactic tracers. They may, in\nfact, be used to fill the age gap between these two tracers, thereby allowing\nus to study the transition between them.\n  We analyse Galactic disc structure and kinematic perturbations up to 6 kpc\nfrom the Sun based on observations of A-type stars.\n  This work presents a catalogue of A-type stars selected using the IGAPS\nphotometric survey. It covers the Galactic disc within $30^{o}\\leq\nl\\leq215^{o}$ and $|b|\\leq5^{o}$ up to a magnitude of $r\\leq19$ mag with about\n3.5 million sources. We used Gaia Data Release 3 parallaxes and proper motions,\nas well as the line-of-sight velocities, to analyse the large-scale features of\nthe Galactic disc. We carried out a study of the completeness of the detected\ndensity distributions, along with a comparison between the $b<0^{o}$ and\n$b>0^{o}$ regions. Possible biases caused by interstellar extinction or by the\nusage of some kinematic approximations were examined as well.\n  We find stellar overdensities associated with the Local and the Perseus\nspiral arms, as well as with the Cygnus region. A-type stars also provide\nkinematic indications of the Galactic warp towards the anticentre, which\ndisplays a median vertical motion of ~6-7 km/s at a Galactocentric radius of\nR=14 kpc. It starts at R=12 kpc, which supports the scenario where the warp\nbegins at larger radii for younger tracers when compared with other samples in\nthe literature. We also detect a region with downward mean motion extending\nbeyond 2 kpc from the Sun towards $60^{o}<l<75^{o}$ that may be associated with\na compression breathing mode. Furthermore, A-type stars reveal very clumpy\ninhomogeneities and asymmetries in the $V_Z$-$V_{\\phi}$ velocity space plane.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:56:43 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Ard\u00e8vol","J.",""],["Mongui\u00f3","M.",""],["Figueras","F.",""],["Romero-G\u00f3mez","M.",""],["Carrasco","J. M.",""]]}
{"id":"2308.01902","submitter":"Brian Punsly","authors":"Brian Punsly","title":"HST-1 as a Window to the Energetics of the Jet Spine of M87","comments":"To appear in Astronomy and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new interpretation of the optical knot in the jet of M87, HST-1, is\npresented. High sensitivity 22 GHz Very Large Array images locate HST-1 to\nwithin 6 mas of the jet axis immediately upstream. 1.7 GHz Very Long Baseline\nArray images of a bright flare in 2005 indicates that the preponderance of\nemission in the early stages originates in an elongated region that is tilted\n$12.5^{\\circ}$ from the jet axis. The superluminal motion, shape, location and\nthe large jet-aligned optical/UV polarization suggest an identification with\nthe putative relativistic spine of the jet. As such, energy flux estimates for\nHST-1, $\\sim 870$ mas from the nucleus, published in 2006 indicate that the\ncentral engine injected $Q_{\\rm{spine}}\\approx 2.5 \\times 10^{41}\\rm{ergs/s}$\ninto the base of the spine $\\sim 200$ years earler. Furthermore, previous\nstudies reveal a tubular protonic jet on sub-mas scales that envelopes a low\nluminosity core, presumably the faint spine base. It was estimated that the\ncentral engine injected $Q_{\\rm{tubular\\,jet}}\\approx 6.1\\times\n10^{41}\\rm{ergs/s}$ $\\sim 1.5$ years earlier. If one component of the jet is\ninherently more powerful, a firm constraint on total jet power in the recent\npast exists. If the emitted jet is inherently dominated by the spine (tubular\njet) then the total bilaterally symmetric jet power emitted from the central\nengine was $<4Q_{\\rm{spine}}\\approx 1.0 \\times 10^{42}\\rm{ergs/s}$ ($<\n4Q_{\\rm{tubular\\,jet}}\\approx 2.4\\times 10^{42}\\rm{ergs/s}$) $\\sim 200$ ($\\sim\n1.5$) years earlier. Assuming a nearly constant central engine injected jet\npower for $\\sim 200$ years indicates a total jet power of $\\lesssim 2\\times\n10^{42}$ ergs/s in epochs of modern observation or $\\lesssim 3.5\\%$ jet\nproduction efficiency for an accretion rate of 0.001$M_{\\odot}$/yr.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:57:26 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Punsly","Brian",""]]}
{"id":"2308.01903","submitter":"Liangdong Hu","authors":"Liangdong Hu, Yin-Chen He, W. Zhu","title":"Solving Conformal Defects in 3D Conformal Field Theory using Fuzzy\n  Sphere Regularization","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.str-el hep-lat hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Defects in conformal field theory (CFT) are of significant theoretical and\nexperimental importance. The presence of defects theoretically enriches the\nstructure of the CFT, but at the same time, it makes it more challenging to\nstudy, especially in dimensions higher than two. Here, we demonstrate that the\nrecently-developed theoretical scheme, fuzzy (non-commutative) sphere\nregularization, provides a powerful lens through which one can dissect the\ndefect of 3D CFTs in a transparent way. As a notable example, we study the\nmagnetic line defect of 3D Ising CFT and clearly demonstrate that it flows to a\nconformal defect fixed point. We have identified 6 low-lying defect primary\noperators, including the displacement operator, and accurately extract their\nscaling dimensions through the state-operator correspondence. Moreover, we also\ncompute one-point bulk correlators and two-point bulk-defect correlators, which\nshow great agreement with predictions of defect conformal symmetry, and from\nwhich we extract various bulk-defect operator product expansion coefficients.\nOur work demonstrates that the fuzzy sphere offers a powerful tool for\nexploring the rich physics in 3D defect CFTs.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:58:11 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Hu","Liangdong",""],["He","Yin-Chen",""],["Zhu","W.",""]]}
{"id":"2308.01904","submitter":"Yutong Lin","authors":"Yutong Lin, Yuhui Yuan, Zheng Zhang, Chen Li, Nanning Zheng, Han Hu","title":"DETR Doesn't Need Multi-Scale or Locality Design","comments":"To be published in ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an improved DETR detector that maintains a \"plain\"\nnature: using a single-scale feature map and global cross-attention\ncalculations without specific locality constraints, in contrast to previous\nleading DETR-based detectors that reintroduce architectural inductive biases of\nmulti-scale and locality into the decoder. We show that two simple technologies\nare surprisingly effective within a plain design to compensate for the lack of\nmulti-scale feature maps and locality constraints. The first is a box-to-pixel\nrelative position bias (BoxRPB) term added to the cross-attention formulation,\nwhich well guides each query to attend to the corresponding object region while\nalso providing encoding flexibility. The second is masked image modeling\n(MIM)-based backbone pre-training which helps learn representation with\nfine-grained localization ability and proves crucial for remedying dependencies\non the multi-scale feature maps. By incorporating these technologies and recent\nadvancements in training and problem formation, the improved \"plain\" DETR\nshowed exceptional improvements over the original DETR detector. By leveraging\nthe Object365 dataset for pre-training, it achieved 63.9 mAP accuracy using a\nSwin-L backbone, which is highly competitive with state-of-the-art detectors\nwhich all heavily rely on multi-scale feature maps and region-based feature\nextraction. Code is available at https://github.com/impiga/Plain-DETR .\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:59:04 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Lin","Yutong",""],["Yuan","Yuhui",""],["Zhang","Zheng",""],["Li","Chen",""],["Zheng","Nanning",""],["Hu","Han",""]]}
{"id":"2308.01905","submitter":"Xinglong Sun","authors":"Xinglong Sun, Jean Ponce, Yu-Xiong Wang","title":"Revisiting Deformable Convolution for Depth Completion","comments":"Accepted and going to appear at IROS2023","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":"  Depth completion, which aims to generate high-quality dense depth maps from\nsparse depth maps, has attracted increasing attention in recent years. Previous\nwork usually employs RGB images as guidance, and introduces iterative spatial\npropagation to refine estimated coarse depth maps. However, most of the\npropagation refinement methods require several iterations and suffer from a\nfixed receptive field, which may contain irrelevant and useless information\nwith very sparse input. In this paper, we address these two challenges\nsimultaneously by revisiting the idea of deformable convolution. We propose an\neffective architecture that leverages deformable kernel convolution as a\nsingle-pass refinement module, and empirically demonstrate its superiority. To\nbetter understand the function of deformable convolution and exploit it for\ndepth completion, we further systematically investigate a variety of\nrepresentative strategies. Our study reveals that, different from prior work,\ndeformable convolution needs to be applied on an estimated depth map with a\nrelatively high density for better performance. We evaluate our model on the\nlarge-scale KITTI dataset and achieve state-of-the-art level performance in\nboth accuracy and inference speed. Our code is available at\nhttps://github.com/AlexSunNik/ReDC.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:59:06 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Sun","Xinglong",""],["Ponce","Jean",""],["Wang","Yu-Xiong",""]]}
{"id":"2308.01906","submitter":"Nikunj Saunshi","authors":"Vedant Gaur, Nikunj Saunshi","title":"Reasoning in Large Language Models Through Symbolic Math Word Problems","comments":"Accepted at the Findings of ACL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) have revolutionized NLP by solving downstream\ntasks with little to no labeled data. Despite their versatile abilities, the\nlarger question of their ability to reason remains ill-understood. This paper\naddresses reasoning in math word problems (MWPs) by studying symbolic versions\nof the numeric problems, since a symbolic expression is a \"concise explanation\"\nof the numeric answer. We create and use a symbolic version of the SVAMP\ndataset and find that GPT-3's davinci-002 model also has good zero-shot\naccuracy on symbolic MWPs. To evaluate the faithfulness of the model's\nreasoning, we go beyond accuracy and additionally evaluate the alignment\nbetween the final answer and the outputted reasoning, which correspond to\nnumeric and symbolic answers respectively for MWPs. We explore a self-prompting\napproach to encourage the symbolic reasoning to align with the numeric answer,\nthus equipping the LLM with the ability to provide a concise and verifiable\nreasoning and making it more interpretable. Surprisingly, self-prompting also\nimproves the symbolic accuracy to be higher than both the numeric and symbolic\naccuracies, thus providing an ensembling effect. The SVAMP_Sym dataset will be\nreleased for future research on symbolic math problems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:59:27 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Gaur","Vedant",""],["Saunshi","Nikunj",""]]}
{"id":"2308.01907","submitter":"Wenhai Wang","authors":"Weiyun Wang, Min Shi, Qingyun Li, Wenhai Wang, Zhenhang Huang, Linjie\n  Xing, Zhe Chen, Hao Li, Xizhou Zhu, Zhiguo Cao, Yushi Chen, Tong Lu, Jifeng\n  Dai, Yu Qiao","title":"The All-Seeing Project: Towards Panoptic Visual Recognition and\n  Understanding of the Open World","comments":"Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the All-Seeing (AS) project: a large-scale data and model for\nrecognizing and understanding everything in the open world. Using a scalable\ndata engine that incorporates human feedback and efficient models in the loop,\nwe create a new dataset (AS-1B) with over 1 billion regions annotated with\nsemantic tags, question-answering pairs, and detailed captions. It covers a\nwide range of 3.5 million common and rare concepts in the real world, and has\n132.2 billion tokens that describe the concepts and their attributes.\nLeveraging this new dataset, we develop the All-Seeing model (ASM), a unified\nframework for panoptic visual recognition and understanding. The model is\ntrained with open-ended language prompts and locations, which allows it to\ngeneralize to various vision and language tasks with remarkable zero-shot\nperformance, including region-text retrieval, region recognition, captioning,\nand question-answering. We hope that this project can serve as a foundation for\nvision-language artificial general intelligence research. Models and the\ndataset shall be released at https://github.com/OpenGVLab/All-Seeing, and demo\ncan be seen at https://huggingface.co/spaces/OpenGVLab/all-seeing.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:59:47 GMT"}],"update_date":"2023-08-04","authors_parsed":[["Wang","Weiyun",""],["Shi","Min",""],["Li","Qingyun",""],["Wang","Wenhai",""],["Huang","Zhenhang",""],["Xing","Linjie",""],["Chen","Zhe",""],["Li","Hao",""],["Zhu","Xizhou",""],["Cao","Zhiguo",""],["Chen","Yushi",""],["Lu","Tong",""],["Dai","Jifeng",""],["Qiao","Yu",""]]}
{"id":"2308.01925","submitter":"Petar Radanliev","authors":"Dr Petar Radanliev, Professor David De Roure, Dr Peter Novitzky, Dr\n  Ivo Sluganovic","title":"Accessibility and Inclusiveness of New Information and Communication\n  Technologies for Disabled Users and Content Creators in the Metaverse","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.CV cs.MM cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the proliferation of Blockchain Metaverse projects, the inclusion of\nphysically disabled individuals in the Metaverse remains distant, with limited\nstandards and regulations in place. However, the article proposes a concept of\nthe Metaverse that leverages emerging technologies, such as Virtual and\nAugmented Reality, and the Internet of Things, to enable greater engagement of\ndisabled creatives. This approach aims to enhance inclusiveness in the\nMetaverse landscape. Based on the findings, the paper concludes that the active\ninvolvement of physically disabled individuals in the design and development of\nMetaverse platforms is crucial for promoting inclusivity. The proposed\nframework for accessibility and inclusiveness in Virtual, Augmented, and Mixed\nrealities of decentralised Metaverses provides a basis for the meaningful\nparticipation of disabled creatives. The article emphasises the importance of\naddressing the mechanisms for art production by individuals with disabilities\nin the emerging Metaverse landscape. Additionally, it highlights the need for\nfurther research and collaboration to establish standards and regulations that\nfacilitate the inclusion of physically disabled individuals in Metaverse\nprojects.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:39:12 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Radanliev","Dr Petar",""],["De Roure","Professor David",""],["Novitzky","Dr Peter",""],["Sluganovic","Dr Ivo",""]]}
{"id":"2308.01926","submitter":"Mieczys{\\l}aw K{\\l}opotek","authors":"Mieczys{\\l}aw A. K{\\l}opotek","title":"Are Easy Data Easy (for K-Means)","comments":"12 figures, 19 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the capability of correctly recovering well-separated\nclusters by various brands of the $k$-means algorithm. The concept of\nwell-separatedness used here is derived directly from the common definition of\nclusters, which imposes an interplay between the requirements of\nwithin-cluster-homogenicity and between-clusters-diversity. Conditions are\nderived for a special case of well-separated clusters such that the global\nminimum of $k$-means cost function coincides with the well-separatedness. An\nexperimental investigation is performed to find out whether or no various\nbrands of $k$-means are actually capable of discovering well separated\nclusters. It turns out that they are not. A new algorithm is proposed that is a\nvariation of $k$-means++ via repeated {sub}sampling when choosing a seed. The\nnew algorithm outperforms four other algorithms from $k$-means family on the\ntask.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 09:40:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["K\u0142opotek","Mieczys\u0142aw A.",""]]}
{"id":"2308.01927","submitter":"Xiaocan Zeng","authors":"Xiaocan Zeng, Pengfei Wang, Yuren Mao, Lu Chen, Xiaoze Liu, Yunjun Gao","title":"MultiEM: Efficient and Effective Unsupervised Multi-Table Entity\n  Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.CL cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Entity Matching (EM), which aims to identify all entity pairs referring to\nthe same real-world entity from relational tables, is one of the most important\ntasks in real-world data management systems. Due to the labeling process of EM\nbeing extremely labor-intensive, unsupervised EM is more applicable than\nsupervised EM in practical scenarios. Traditional unsupervised EM assumes that\nall entities come from two tables; however, it is more common to match entities\nfrom multiple tables in practical applications, that is, multi-table entity\nmatching (multi-table EM). Unfortunately, effective and efficient unsupervised\nmulti-table EM remains under-explored. To fill this gap, this paper formally\nstudies the problem of unsupervised multi-table entity matching and proposes an\neffective and efficient solution, termed as MultiEM. MultiEM is a parallelable\npipeline of enhanced entity representation, table-wise hierarchical merging,\nand density-based pruning. Extensive experimental results on six real-world\nbenchmark datasets demonstrate the superiority of MultiEM in terms of\neffectiveness and efficiency.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:39:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zeng","Xiaocan",""],["Wang","Pengfei",""],["Mao","Yuren",""],["Chen","Lu",""],["Liu","Xiaoze",""],["Gao","Yunjun",""]]}
{"id":"2308.01928","submitter":"Ronaldo Da Silva","authors":"R. da Silva, V. D'Orazi, M. Palla, G. Bono, V.F. Braga, M. Fabrizio,\n  B. Lemasle, E. Spitoni, F. Matteucci, H. Jonsson, V. Kovtyukh, L. Magrini, M.\n  Bergemann, M. Dall'Ora, I. Ferraro, G. Fiorentino, P. Francois, G. Iannicola,\n  L. Inno, R.-P. Kudritzki, N. Matsunaga, M. Monelli, M. Nonino, C. Sneden, J.\n  Storm, F. Thevenin, T. Tsujimoto, and A. Zocchi","title":"Oxygen, sulfur, and iron radial abundance gradients of classical\n  Cepheids across the Galactic thin disk","comments":"21 pages, 13 figures, 3 tables; to be published in the A&A 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":"  Classical Cepheids (CCs) are solid distance indicators and tracers of young\nstellar populations. Our aim is to provide iron, oxygen, and sulfur abundances\nfor the largest and most homogeneous sample of Galactic CCs ever analyzed. The\ncurrent sample covers a wide range in Galactocentric distances (RG), pulsation\nmodes and periods. High-resolution and high S/N spectra collected with\ndifferent spectrographs were adopted to estimate the atmospheric parameters.\nIndividual distances are based on Gaia trigonometric parallaxes or on\nnear-infrared Period-Luminosity relations. We found that Fe and alpha-element\nradial gradients based on CCs display a well-defined change in the slope for RG\nlarger than 12 kpc. Radial gradients based on open clusters, covering a wide\nrange in age, display similar trends, meaning that the flattening in the outer\ndisk is an intrinsic feature of the radial gradients since it is independent of\nage. Empirical evidence indicates that the radial gradient for S is steeper\nthan for Fe. The difference in the slope is a factor of two in the linear fit.\nWe also found that S is, on average, under-abundant compared with O. We\nperformed a detailed comparison with Galactic chemical evolution models and we\nfound that a constant Star Formation Efficiency for RG larger than 12 kpc takes\naccount for the flattening in both Fe and alpha-elements. To further constrain\nthe impact that predicted S yields for massive stars have on radial gradients,\nwe adopted a \"toy model\" and we found that the flattening in the outermost\nregions requires a decrease of a factor of four in the current S predictions.\nSulfur photospheric abundances, compared with other alpha-elements, have the\nkey advantage of being a volatile element. Therefore, stellar S abundances can\nbe directly compared with nebular S abundances in external galaxies.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:24:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["da Silva","R.",""],["D'Orazi","V.",""],["Palla","M.",""],["Bono","G.",""],["Braga","V. F.",""],["Fabrizio","M.",""],["Lemasle","B.",""],["Spitoni","E.",""],["Matteucci","F.",""],["Jonsson","H.",""],["Kovtyukh","V.",""],["Magrini","L.",""],["Bergemann","M.",""],["Dall'Ora","M.",""],["Ferraro","I.",""],["Fiorentino","G.",""],["Francois","P.",""],["Iannicola","G.",""],["Inno","L.",""],["Kudritzki","R. -P.",""],["Matsunaga","N.",""],["Monelli","M.",""],["Nonino","M.",""],["Sneden","C.",""],["Storm","J.",""],["Thevenin","F.",""],["Tsujimoto","T.",""],["Zocchi","A.",""]]}
{"id":"2308.01929","submitter":"Yongkang He","authors":"Yongkang He, Siyuan Peng, Mingjin Chen, Zhijing Yang, Yuanhui Chen","title":"A Transformer-based Prediction Method for Depth of Anesthesia During\n  Target-controlled Infusion of Propofol and Remifentanil","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":"  Accurately predicting anesthetic effects is essential for target-controlled\ninfusion systems. The traditional (PK-PD) models for Bispectral index (BIS)\nprediction require manual selection of model parameters, which can be\nchallenging in clinical settings. Recently proposed deep learning methods can\nonly capture general trends and may not predict abrupt changes in BIS. To\naddress these issues, we propose a transformer-based method for predicting the\ndepth of anesthesia (DOA) using drug infusions of propofol and remifentanil.\nOur method employs long short-term memory (LSTM) and gate residual network\n(GRN) networks to improve the efficiency of feature fusion and applies an\nattention mechanism to discover the interactions between the drugs. We also use\nlabel distribution smoothing and reweighting losses to address data imbalance.\nExperimental results show that our proposed method outperforms traditional\nPK-PD models and previous deep learning methods, effectively predicting\nanesthetic depth under sudden and deep anesthesia conditions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:49:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["He","Yongkang",""],["Peng","Siyuan",""],["Chen","Mingjin",""],["Yang","Zhijing",""],["Chen","Yuanhui",""]]}
{"id":"2308.01930","submitter":"Filipe Augusto De Castro Oliveira","authors":"Filipe A. C. Oliveira, Felipe M. Dias, Marcelo A. F. Toledo, Diego A.\n  C. Cardenas, Douglas A. Almeida, Estela Ribeiro, Jose E. Krieger, Marco A.\n  Gutierrez","title":"Machine Learning-Based Diabetes Detection Using Photoplethysmography\n  Signal Features","comments":"11 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diabetes is a prevalent chronic condition that compromises the health of\nmillions of people worldwide. Minimally invasive methods are needed to prevent\nand control diabetes but most devices for measuring glucose levels are invasive\nand not amenable for continuous monitoring. Here, we present an alternative\nmethod to overcome these shortcomings based on non-invasive optical\nphotoplethysmography (PPG) for detecting diabetes. We classify non-Diabetic and\nDiabetic patients using the PPG signal and metadata for training Logistic\nRegression (LR) and eXtreme Gradient Boosting (XGBoost) algorithms. We used PPG\nsignals from a publicly available dataset. To prevent overfitting, we divided\nthe data into five folds for cross-validation. By ensuring that patients in the\ntraining set are not in the testing set, the model's performance can be\nevaluated on unseen subjects' data, providing a more accurate assessment of its\ngeneralization. Our model achieved an F1-Score and AUC of $58.8\\pm20.0\\%$ and\n$79.2\\pm15.0\\%$ for LR and $51.7\\pm16.5\\%$ and $73.6\\pm17.0\\%$ for XGBoost,\nrespectively. Feature analysis suggested that PPG morphological features\ncontains diabetes-related information alongside metadata. Our findings are\nwithin the same range reported in the literature, indicating that machine\nlearning methods are promising for developing remote, non-invasive, and\ncontinuous measurement devices for detecting and preventing diabetes.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 14:10:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Oliveira","Filipe A. C.",""],["Dias","Felipe M.",""],["Toledo","Marcelo A. F.",""],["Cardenas","Diego A. C.",""],["Almeida","Douglas A.",""],["Ribeiro","Estela",""],["Krieger","Jose E.",""],["Gutierrez","Marco A.",""]]}
{"id":"2308.01931","submitter":"Albino Carbognani","authors":"Albino Carbognani and Marco Fenucci","title":"Identifying parent bodies of meteorites among near-Earth asteroids","comments":"22 pages, 13 figures, accepted in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2382","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Meteorites provide an important source of information about the formation and\ncomposition of asteroids, because the level of accuracy of studies and analyses\nperformed in a laboratory cannot be achieved by any ground or space based\nobservation. To better understand what asteroid types a meteorite represents,\nit is crucial to identify the body they originated from. In this paper, we aim\nto determine possible parent bodies for the known meteorite falls among the\nknown population of near-Earth asteroids (NEAs). By using the similarity\ncriterion $D_N$, based on geocentric quantities, we found 20 possible\nNEA-meteorite pairs. By performing additional numerical simulations of the\nbackward dynamics, we found that 12 of these pairs may be associated with a\npossible separation event from the progenitor NEA, while the remaining 8 pairs\nappear to be ambiguous or random associations. The most interesting are the\nPribram and Neuschwanstein meteorites, which are dynamically associated with\n(482488) 2012 SW20 with a common separation age dating back to about 20$-$30\nkyr ago, and the Motopi Pan meteorite, that has three candidate parent bodies:\n(454100) 2013 BO73, 2017 MC3, and 2009 FZ4. The average time of separation\nbetween our meteorite list and the progenitor body appears to be about 10 kyr,\na time consistent with what is expected from the collision frequency of small\nNEAs. Based on our results, we suggest that about 25 per cent of meteorites do\nnot originate in the main belt, but mainly from little collision events\nhappening between NEAs in the inner Solar System.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:48:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Carbognani","Albino",""],["Fenucci","Marco",""]]}
{"id":"2308.01932","submitter":"Rashed Hasan Ratul","authors":"Fatin Abrar Shams, Rashed Hasan Ratul, Ahnaf Islam Naf, Syed Shaek\n  Hossain Samir, Mirza Muntasir Nishat, Fahim Faisal and Md. Ashraful Hoque","title":"Investigation on Machine Learning Based Approaches for Estimating the\n  Critical Temperature of Superconductors","comments":"Accepted for publication on IEEE INTERNATIONAL CONFERENCE ON\n  ARTIFICIAL INTELLIGENCE, ROBOTICS,SIGNAL, AND IMAGE PROCESSING (AIRoSIP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Superconductors have been among the most fascinating substances, as the\nfundamental concept of superconductivity as well as the correlation of critical\ntemperature and superconductive materials have been the focus of extensive\ninvestigation since their discovery. However, superconductors at normal\ntemperatures have yet to be identified. Additionally, there are still many\nunknown factors and gaps of understanding regarding this unique phenomenon,\nparticularly the connection between superconductivity and the fundamental\ncriteria to estimate the critical temperature. To bridge the gap, numerous\nmachine learning techniques have been established to estimate critical\ntemperatures as it is extremely challenging to determine. Furthermore, the need\nfor a sophisticated and feasible method for determining the temperature range\nthat goes beyond the scope of the standard empirical formula appears to be\nstrongly emphasized by various machine-learning approaches. This paper uses a\nstacking machine learning approach to train itself on the complex\ncharacteristics of superconductive materials in order to accurately predict\ncritical temperatures. In comparison to other previous accessible research\ninvestigations, this model demonstrated a promising performance with an RMSE of\n9.68 and an R2 score of 0.922. The findings presented here could be a viable\ntechnique to shed new insight on the efficient implementation of the stacking\nensemble method with hyperparameter optimization (HPO).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:11:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shams","Fatin Abrar",""],["Ratul","Rashed Hasan",""],["Naf","Ahnaf Islam",""],["Samir","Syed Shaek Hossain",""],["Nishat","Mirza Muntasir",""],["Faisal","Fahim",""],["Hoque","Md. Ashraful",""]]}
{"id":"2308.01933","submitter":"Michael Unterkalmsteiner","authors":"Elizabeth Bjarnason, Mirko Morandini, Markus Borg, Michael\n  Unterkalmsteiner, Michael Felderer, Matthew Staats","title":"Summary of 2nd International Workshop on Requirements Engineering and\n  Testing (RET)","comments":"Co-located with ICSE 2015. SIGSOFT Software Engineering Notes. Volume\n  40 Issue 5","journal-ref":null,"doi":"10.1109/ICSE.2015.351","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 goal is to improve the\nconnection and alignment of these two areas through an exchange of ideas,\nchallenges, practices, experiences and results. 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 2nd workshop was held in co-location with ICSE 2015 in Florence,\nItaly. The workshop continued in the same interactive vein as the 1st one and\nincluded a keynote, paper presentations with ample time for discussions, and a\ngroup exercise. For true impact and relevance this cross-cutting area requires\ncontribution from both RE and Testing, and from both researchers and\npractitioners. A range of papers were presented from short experience papers to\nfull research papers that cover connections between the two fields. One of the\nmain outputs of the 2nd workshop was a categorization of the presented workshop\npapers according to an initial definition of the area of RET which identifies\nthe aspects RE, Testing and coordination effect.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:25:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bjarnason","Elizabeth",""],["Morandini","Mirko",""],["Borg","Markus",""],["Unterkalmsteiner","Michael",""],["Felderer","Michael",""],["Staats","Matthew",""]]}
{"id":"2308.01934","submitter":"Prof. Surajit Dhara","authors":"Abinash Barthakur, Jakub Karcz, Przemyslaw Kula and Surajit Dhara","title":"Mixing Twist-Bend and Ferroelectric nematic liquid crystals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Twist-bend (Ntb) and ferroelectric (NF) nematic liquid crystals exhibit\nseveral novel effects and new physical properties. The question of what happens\nin binary mixtures is interesting as a matter of curiosity and pure science.\nHere, we report experimental studies on the phase diagram and some physical\nproperties of binary mixtures of the above-mentioned nematic liquid crystals.\nBoth N-Ntb and N-NF phase transition temperatures and the corresponding\nenthalpies decrease significantly and eventually, these transitions disappear\nin some intermediate compositions. Temperature dependent birefringence above\nthe N-Ntb phase transition temperature shows critical behaviour, and the\ncritical range of the tilt fluctuations becomes wider in the mixtures. The\nmagnitudes and the temperature dependence of the splay elastic constant of the\nmixtures' high-temperature nematic (N) phase strikingly differ from that of the\npristine twist-bend and ferroelectric nematic liquid crystals. The study shows\nthat Ntb and NF liquid crystals are incompatible.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:13:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Barthakur","Abinash",""],["Karcz","Jakub",""],["Kula","Przemyslaw",""],["Dhara","Surajit",""]]}
{"id":"2308.01935","submitter":"Graeme Baker","authors":"Graeme Baker","title":"Sensitivity to Initial Data for Physical and Minimal Solutions of the\n  Supercooled Stefan Problem","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the problem of well-posedness for physical and minimal solutions\nto a probabilistic reformulation of the supercooled Stefan problem by\ninvestigating the sensitivity of these solutions to changes in the initial\ndata. We show that the solution map for physical solutions is continuous under\nperturbations to the initial condition $X_{0-}$ (in the weak sense of\nprobability measures), provided that $X_{0-}$ admits a unique physical\nsolution. Furthermore, we show continuous dependency of the solution map for\nminimal solutions when the data is shifted to the right; however, continuity of\nthis solution map is shown to fail at $X_{0-}$ for shifts to the left unless\nuniqueness of physical solutions holds. As a result, we show that the question\nof whether the solution map for minimal solutions is continuous at $X_{0-}$ is\nequivalent to the question of whether the given data $X_{0-}$ admits a unique\nphysical solution.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:00:35 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Baker","Graeme",""]]}
{"id":"2308.01936","submitter":"Thilini Wijesiriwardene","authors":"Thilini Wijesiriwardene and Amit Sheth and Valerie L. Shalin and\n  Amitava Das","title":"Why Do We Need Neuro-symbolic AI to Model Pragmatic Analogies?","comments":"12 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":"  A hallmark of intelligence is the ability to use a familiar domain to make\ninferences about a less familiar domain, known as analogical reasoning. In this\narticle, we delve into the performance of Large Language Models (LLMs) in\ndealing with progressively complex analogies expressed in unstructured text. We\ndiscuss analogies at four distinct levels of complexity: lexical analogies,\nsyntactic analogies, semantic analogies, and pragmatic analogies. As the\nanalogies become more complex, they require increasingly extensive, diverse\nknowledge beyond the textual content, unlikely to be found in the lexical\nco-occurrence statistics that power LLMs. To address this, we discuss the\nnecessity of employing Neuro-symbolic AI techniques that combine statistical\nand symbolic AI, informing the representation of unstructured text to highlight\nand augment relevant content, provide abstraction and guide the mapping\nprocess. Our knowledge-informed approach maintains the efficiency of LLMs while\npreserving the ability to explain analogies for pedagogical applications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:13:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wijesiriwardene","Thilini",""],["Sheth","Amit",""],["Shalin","Valerie L.",""],["Das","Amitava",""]]}
{"id":"2308.01937","submitter":"Aditya Golatkar","authors":"Aditya Golatkar, Alessandro Achille, Ashwin Swaminathan, Stefano\n  Soatto","title":"Training Data Protection with Compositional Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce Compartmentalized Diffusion Models (CDM), a method to train\ndifferent diffusion models (or prompts) on distinct data sources and\narbitrarily compose them at inference time. The individual models can be\ntrained in isolation, at different times, and on different distributions and\ndomains and can be later composed to achieve performance comparable to a\nparagon model trained on all data simultaneously. Furthermore, each model only\ncontains information about the subset of the data it was exposed to during\ntraining, enabling several forms of training data protection. In particular,\nCDMs are the first method to enable both selective forgetting and continual\nlearning for large-scale diffusion models, as well as allowing serving\ncustomized models based on the user's access rights. CDMs also allow\ndetermining the importance of a subset of the data in generating particular\nsamples.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:27:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Golatkar","Aditya",""],["Achille","Alessandro",""],["Swaminathan","Ashwin",""],["Soatto","Stefano",""]]}
{"id":"2308.01938","submitter":"Gabriel R Lencione","authors":"Gabriel R. Lencione, Fernando J. Von Zuben","title":"Online Multi-Task Learning with Recursive Least Squares and Recursive\n  Kernel Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces two novel approaches for Online Multi-Task Learning\n(MTL) Regression Problems. We employ a high performance graph-based MTL\nformulation and develop its recursive versions based on the Weighted Recursive\nLeast Squares (WRLS) and the Online Sparse Least Squares Support Vector\nRegression (OSLSSVR). Adopting task-stacking transformations, we demonstrate\nthe existence of a single matrix incorporating the relationship of multiple\ntasks and providing structural information to be embodied by the MT-WRLS method\nin its initialization procedure and by the MT-OSLSSVR in its multi-task kernel\nfunction. Contrasting the existing literature, which is mostly based on Online\nGradient Descent (OGD) or cubic inexact approaches, we achieve exact and\napproximate recursions with quadratic per-instance cost on the dimension of the\ninput space (MT-WRLS) or on the size of the dictionary of instances\n(MT-OSLSSVR). We compare our online MTL methods to other contenders in a\nreal-world wind speed forecasting case study, evidencing the significant gain\nin performance of both proposed approaches.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 01:41:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lencione","Gabriel R.",""],["Von Zuben","Fernando J.",""]]}
{"id":"2308.01939","submitter":"Ines Gonzalez Pepe","authors":"In\\'es Gonzalez Pepe, Vinuyan Sivakolunthu, Hae Lang Park, Yohan\n  Chatelain and Tristan Glatard","title":"Numerical Uncertainty of Convolutional Neural Networks Inference for\n  Structural Brain MRI Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the numerical uncertainty of Convolutional Neural\nNetworks (CNNs) inference for structural brain MRI analysis. It applies Random\nRounding -- a stochastic arithmetic technique -- to CNN models employed in\nnon-linear registration (SynthMorph) and whole-brain segmentation (FastSurfer),\nand compares the resulting numerical uncertainty to the one measured in a\nreference image-processing pipeline (FreeSurfer recon-all). Results obtained on\n32 representative subjects show that CNN predictions are substantially more\naccurate numerically than traditional image-processing results (non-linear\nregistration: 19 vs 13 significant bits on average; whole-brain segmentation:\n0.99 vs 0.92 S{\\o}rensen-Dice score on average), which suggests a better\nreproducibility of CNN results across execution environments.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:17:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Pepe","In\u00e9s Gonzalez",""],["Sivakolunthu","Vinuyan",""],["Park","Hae Lang",""],["Chatelain","Yohan",""],["Glatard","Tristan",""]]}
{"id":"2308.01940","submitter":"Qi Yang","authors":"Qi Yang, Joel Jung, Haiqiang Wang, Xiaozhong Xu, and Shan Liu","title":"TSMD: A Database for Static Color Mesh Quality Assessment Study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Static meshes with texture map are widely used in modern industrial and\nmanufacturing sectors, attracting considerable attention in the mesh\ncompression community due to its huge amount of data. To facilitate the study\nof static mesh compression algorithm and objective quality metric, we create\nthe Tencent - Static Mesh Dataset (TSMD) containing 42 reference meshes with\nrich visual characteristics. 210 distorted samples are generated by the lossy\ncompression scheme developed for the Call for Proposals on polygonal static\nmesh coding, released on June 23 by the Alliance for Open Media Volumetric\nVisual Media group. Using processed video sequences, a large-scale,\ncrowdsourcing-based, subjective experiment was conducted to collect subjective\nscores from 74 viewers. The dataset undergoes analysis to validate its sample\ndiversity and Mean Opinion Scores (MOS) accuracy, establishing its\nheterogeneous nature and reliability. State-of-the-art objective metrics are\nevaluated on the new dataset. Pearson and Spearman correlations around 0.75 are\nreported, deviating from results typically observed on less heterogeneous\ndatasets, demonstrating the need for further development of more robust\nmetrics. The TSMD, including meshes, PVSs, bitstreams, and MOS, is made\npublicly available at the following location:\nhttps://multimedia.tencent.com/resources/tsmd.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:19:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yang","Qi",""],["Jung","Joel",""],["Wang","Haiqiang",""],["Xu","Xiaozhong",""],["Liu","Shan",""]]}
{"id":"2308.01941","submitter":"Hui Xiong","authors":"Hui Xiong, Congying Chu, Lingzhong Fan, Ming Song, Jiaqi Zhang, Yawei\n  Ma, Ruonan Zheng, Junyang Zhang, Zhengyi Yang, Tianzi Jiang","title":"Digital twin brain: a bridge between biological intelligence and\n  artificial intelligence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI cs.NE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, advances in neuroscience and artificial intelligence have\npaved the way for unprecedented opportunities for understanding the complexity\nof the brain and its emulation by computational systems. Cutting-edge\nadvancements in neuroscience research have revealed the intricate relationship\nbetween brain structure and function, while the success of artificial neural\nnetworks highlights the importance of network architecture. Now is the time to\nbring them together to better unravel how intelligence emerges from the brain's\nmultiscale repositories. In this review, we propose the Digital Twin Brain\n(DTB) as a transformative platform that bridges the gap between biological and\nartificial intelligence. It consists of three core elements: the brain\nstructure that is fundamental to the twinning process, bottom-layer models to\ngenerate brain functions, and its wide spectrum of applications. Crucially,\nbrain atlases provide a vital constraint, preserving the brain's network\norganization within the DTB. Furthermore, we highlight open questions that\ninvite joint efforts from interdisciplinary fields and emphasize the\nfar-reaching implications of the DTB. The DTB can offer unprecedented insights\ninto the emergence of intelligence and neurological disorders, which holds\ntremendous promise for advancing our understanding of both biological and\nartificial intelligence, and ultimately propelling the development of\nartificial general intelligence and facilitating precision mental healthcare.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 03:36:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xiong","Hui",""],["Chu","Congying",""],["Fan","Lingzhong",""],["Song","Ming",""],["Zhang","Jiaqi",""],["Ma","Yawei",""],["Zheng","Ruonan",""],["Zhang","Junyang",""],["Yang","Zhengyi",""],["Jiang","Tianzi",""]]}
{"id":"2308.01942","submitter":"Shisheng Zhang","authors":"Yang Xiao, Si-Zhe Xu, Ru-You Zheng, Xiang-Xiang Sun, Li-Sheng Geng,\n  and Shi-Sheng Zhang","title":"One-proton emission from 148,149,150,151Lu in the DRHBc plus WKB\n  approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One-proton radioactivity in 149Lu, the latest identified proton emitter, is\nstudied in the Wentzel-Kramers-Brillouin (WKB) approach with the proton-nucleus\npotential extracted from the deformed relativistic Hartree-Bogoliubov theory in\ncontinuum (DRHBc) for the first time. The predicted half-life turns out to be\nconsistent with the experimental measurement within uncertainties and (almost)\nindependent of the density functionals in the DRHBc theory. Such a microscopic\nself-consistent calculation reveals that 149Lu is oblately deformed with a\nquadrupole deformation -0.18, and rules out the possibility of a prolate\nquadrupole deformation suggested in the nonadiabatic quasiparticle model. We\nalso check the validity of this approach in the description of 150,151Lu and\ntheir isomeric states. The deviations of the predicted half-lives from their\nexperimental counterparts are mostly smaller than those of the theoretical\nstudies without considering deformation effects. Furthermore, we predict 148Lu\nto be a more oblately deformed proton-emitter with a longer half-life than that\nof 149Lu, which can be checked in the future. Our studies show that the DRHBc\nplus WKB approach provides a new alternative method to evaluate the half-lives\nof well-deformed proton emitters.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:40:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xiao","Yang",""],["Xu","Si-Zhe",""],["Zheng","Ru-You",""],["Sun","Xiang-Xiang",""],["Geng","Li-Sheng",""],["Zhang","Shi-Sheng",""]]}
{"id":"2308.01943","submitter":"Ioannis Rousochatzakis","authors":"Ioannis Rousochatzakis, Natalia B. Perkins, Qiang Luo, Hae-Young Kee","title":"Beyond Kitaev physics in strong spin-orbit coupled magnets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We review the recent advances and current challenges in the field of strong\nspin-orbit coupled Kitaev materials, with a particular emphasis on the physics\nbeyond the exactly-solvable Kitaev spin liquid point. To that end, we give a\ncomprehensive overview of the most relevant exchange interactions in $d^5$ and\n$d^7$ iridates and similar compounds, an exposition of their microscopic\norigin, and a systematic attempt to map out the most interesting correlated\nregimes of the multi-dimensional parameter space, guided by powerful symmetry\nand duality transformations as well as by insights from wide-ranging analytical\nand numerical studies. We also survey recent exciting results on quasi-1D\nmodels and discuss their relevance to higher-dimensional models. Finally, we\nhighlight some of the key questions in the field as well as future directions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:09:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Rousochatzakis","Ioannis",""],["Perkins","Natalia B.",""],["Luo","Qiang",""],["Kee","Hae-Young",""]]}
{"id":"2308.01944","submitter":"Yuang Liu","authors":"Yuang Liu, Qiang Zhou, Jing Wang, Fan Wang, Jun Wang, Wei Zhang","title":"Dynamic Token-Pass Transformers for Semantic Segmentation","comments":"10 pages, 6 figures","journal-ref":"WACV 2024","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vision transformers (ViT) usually extract features via forwarding all the\ntokens in the self-attention layers from top to toe. In this paper, we\nintroduce dynamic token-pass vision transformers (DoViT) for semantic\nsegmentation, which can adaptively reduce the inference cost for images with\ndifferent complexity. DoViT gradually stops partial easy tokens from\nself-attention calculation and keeps the hard tokens forwarding until meeting\nthe stopping criteria. We employ lightweight auxiliary heads to make the\ntoken-pass decision and divide the tokens into keeping/stopping parts. With a\ntoken separate calculation, the self-attention layers are speeded up with\nsparse tokens and still work friendly with hardware. A token reconstruction\nmodule is built to collect and reset the grouped tokens to their original\nposition in the sequence, which is necessary to predict correct semantic masks.\nWe conduct extensive experiments on two common semantic segmentation tasks, and\ndemonstrate that our method greatly reduces about 40% $\\sim$ 60% FLOPs and the\ndrop of mIoU is within 0.8% for various segmentation transformers. The\nthroughput and inference speed of ViT-L/B are increased to more than 2$\\times$\non Cityscapes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:14:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Yuang",""],["Zhou","Qiang",""],["Wang","Jing",""],["Wang","Fan",""],["Wang","Jun",""],["Zhang","Wei",""]]}
{"id":"2308.01945","submitter":"Masataka Kimizu","authors":"Masataka Kimizu, Fuyuhiko Tanaka, Akio Fujiwara","title":"Adaptive quantum state estimation for two optical point sources","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In classical optics, there is a well-known resolution limit, called\nRayleigh's curse, in the separation of two incoherent optical sources in close\nproximity. Recently, Tsang et al. revealed that this difficulty may be\ncircumvented in the framework of quantum theory. Following their work, various\nestimation methods have been proposed to overcome Rayleigh's curse, but none of\nthem enables us to estimate the positions of two point sources simultaneously\nbased on single-photon measurements with high accuracy. In this study, we\npropose a method to simultaneously estimate the positions of two point sources\nwith the highest accuracy using adaptive quantum state estimation scheme.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:47:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kimizu","Masataka",""],["Tanaka","Fuyuhiko",""],["Fujiwara","Akio",""]]}
{"id":"2308.01946","submitter":"Tianlei Zhu","authors":"Tianlei Zhu, Renzhe Zhu","title":"Experimental Results regarding multiple Machine Learning via Quaternions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents an experimental study on the application of quaternions\nin several machine learning algorithms. Quaternion is a mathematical\nrepresentation of rotation in three-dimensional space, which can be used to\nrepresent complex data transformations. In this study, we explore the use of\nquaternions to represent and classify rotation data, using randomly generated\nquaternion data and corresponding labels, converting quaternions to rotation\nmatrices, and using them as input features. Based on quaternions and multiple\nmachine learning algorithms, it has shown higher accuracy and significantly\nimproved performance in prediction tasks. Overall, this study provides an\nempirical basis for exploiting quaternions for machine learning tasks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:14:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhu","Tianlei",""],["Zhu","Renzhe",""]]}
{"id":"2308.01947","submitter":"Zitong Wang","authors":"Fu Lin, Xuexiong Luo, Jia Wu, Jian Yang, Shan Xue, Zitong Wang, Haonan\n  Gong","title":"Discriminative Graph-level Anomaly Detection via Dual-students-teacher\n  Model","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":"  Different from the current node-level anomaly detection task, the goal of\ngraph-level anomaly detection is to find abnormal graphs that significantly\ndiffer from others in a graph set. Due to the scarcity of research on the work\nof graph-level anomaly detection, the detailed description of graph-level\nanomaly is insufficient. Furthermore, existing works focus on capturing\nanomalous graph information to learn better graph representations, but they\nignore the importance of an effective anomaly score function for evaluating\nabnormal graphs. Thus, in this work, we first define anomalous graph\ninformation including node and graph property anomalies in a graph set and\nadopt node-level and graph-level information differences to identify them,\nrespectively. Then, we introduce a discriminative graph-level anomaly detection\nframework with dual-students-teacher model, where the teacher model with a\nheuristic loss are trained to make graph representations more divergent. Then,\ntwo competing student models trained by normal and abnormal graphs respectively\nfit graph representations of the teacher model in terms of node-level and\ngraph-level representation perspectives. Finally, we combine representation\nerrors between two student models to discriminatively distinguish anomalous\ngraphs. Extensive experiment analysis demonstrates that our method is effective\nfor the graph-level anomaly detection task on graph datasets in the real world.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:29:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lin","Fu",""],["Luo","Xuexiong",""],["Wu","Jia",""],["Yang","Jian",""],["Xue","Shan",""],["Wang","Zitong",""],["Gong","Haonan",""]]}
{"id":"2308.01948","submitter":"Jannik Brinkmann","authors":"Jannik Brinkmann, Paul Swoboda, Christian Bartelt","title":"A Multidimensional Analysis of Social Biases in Vision Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The embedding spaces of image models have been shown to encode a range of\nsocial biases such as racism and sexism. Here, we investigate specific factors\nthat contribute to the emergence of these biases in Vision Transformers (ViT).\nTherefore, we measure the impact of training data, model architecture, and\ntraining objectives on social biases in the learned representations of ViTs.\nOur findings indicate that counterfactual augmentation training using\ndiffusion-based image editing can mitigate biases, but does not eliminate them.\nMoreover, we find that larger models are less biased than smaller models, and\nthat models trained using discriminative objectives are less biased than those\ntrained using generative objectives. In addition, we observe inconsistencies in\nthe learned social biases. To our surprise, ViTs can exhibit opposite biases\nwhen trained on the same data set using different self-supervised objectives.\nOur findings give insights into the factors that contribute to the emergence of\nsocial biases and suggests that we could achieve substantial fairness\nimprovements based on model design choices.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:03:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Brinkmann","Jannik",""],["Swoboda","Paul",""],["Bartelt","Christian",""]]}
{"id":"2308.01949","submitter":"Guojun Yu","authors":"Guojun Yu, Jialiang Zhang, Shuo Li, Zifeng Xu, Lei Zhang, Aizhong\n  Huang, Ming Qi","title":"Analysis of Light Attenuation Length Measurement of a High Quality\n  Linear Alkylbenzene for the JUNO Experiment","comments":"12 pages, 11 figures, 31 references","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex physics.acc-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Jiangmen Underground Neutrino Observatory (JUNO) is the next generation\nneutrino experiment which aims at neutrino mass hierarchy problem along with\nmany other cutting-edge studies concerning neutrinos. Located 700m underground\nin Jiangmen China, JUNO's central detector is an acrylic sphere filled with\n20kt liquid scintillator with linear alkylbenzene(LAB) as scintillator solvent.\nTo ensure that an unprecedented energy resolution of $\\sigma_E/E \\leqslant 3\\%$\ncan be reached, LAB used in JUNO must have excellent transparency at the\nwavelength ranging from 350nm to 450nm.\n  In the past decade much effort has been devoted to the development of high\ntransparency LAB based on the measurement of light attenuation length. Through\na close cooperation with Jingling Petrochemical Corporation in Nanjing,\ntransparency of LAB samples prepared for JUNO has been improved progressively.\nHowever, this improvement is also pushing our apparatus towards approaching its\nmeasuring limit, undermining the credibility of our measurement. In order to\nget a result accurate and precise, an apparatus upgrading and a more detailed\nerror analysis is inevitable.\n  In this article, we present an analysis of how apparatus upgrading helps with\ndecreasing measuring errors, and we conducted measurements using the new\napparatus on several samples. A detailed error analysis is followed to validate\nthe results. We propose to apply statistical methods featuring Monte Carlo\nsimulation to estimate systematic uncertainties. Deviations caused by fit\nmodels is also considered and the overall uncertainty is obtained by combining\ntwo independent measurements. We finally report the light attenuation length of\na newly improved LAB sample to be $29.90\\pm 0.95$m, which gives a new high of\nall the preceding samples we tested. This study may provide a strong evidence\nof JUNO's feasibility to reach its energy resolution.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:33:53 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yu","Guojun",""],["Zhang","Jialiang",""],["Li","Shuo",""],["Xu","Zifeng",""],["Zhang","Lei",""],["Huang","Aizhong",""],["Qi","Ming",""]]}
{"id":"2308.01950","submitter":"Pedro Vaz","authors":"Elia Rizzo and Pedro Vaz","title":"Enhanced nilHecke algebras and baby Verma modules","comments":"v1, 41 pages, Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define a derivation on the enhanced nilHecke algebra yielding a p-dg\nalgebra when working over a field of characteristic p. We define functors on\nthe category of p-dg modules resulting in an action of small quantum sl2 on the\nGrothendieck group, which is isomorphic to a baby Verma module. We upgrade the\nderivation into an action of the Lie algebra sl(2).\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:52:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Rizzo","Elia",""],["Vaz","Pedro",""]]}
{"id":"2308.01951","submitter":"Dmitry Pidgayko","authors":"Dmitry Pidgayko, Aleksandr Tusnin, Johann Riemensberger, Anton\n  Stroganov, Alexey Tikan, Tobias J. Kippenberg","title":"Voltage-tunable OPO with an alternating dispersion dimer integrated on\n  chip","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical parametric oscillators enable the conversion of pump light to new\nfrequency bands using nonlinear optical processes. Recent advances in\nintegrated nonlinear photonics have led to create compact, chip-scale sources\nvia Kerr nonlinearity-induced parametric oscillations. While these sources have\nprovided broadband wavelength tuning, the ability to tune the emission\nwavelength via dynamically altering the dispersion, has not been attained so\nfar. Here we present a voltage-tunable, on-chip integrated optical parametric\noscillator based on alternating dispersiondimer, allowing to tune the emission\nover nearly 20 THz near 1550 nm. Unlike previous approaches, our device\neliminates the need for a widely tunable pump laser source and provides\nefficient pump filtering at the drop port of the auxiliary ring. Integration of\nthis scheme on a chip opens up the possibility of compact and low-cost\nvoltage-tunable parametric oscillators with diverse application possibilities.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:28:27 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 14:55:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pidgayko","Dmitry",""],["Tusnin","Aleksandr",""],["Riemensberger","Johann",""],["Stroganov","Anton",""],["Tikan","Alexey",""],["Kippenberg","Tobias J.",""]]}
{"id":"2308.01952","submitter":"Andalib Shams","authors":"Andalib Shams, A. M. Tahsin Emtenan, and Christopher M. Day","title":"A Taxonomy of Adaptive Traffic Signal Control","comments":"19 pages, 3 figures, 7 tables, submitted to IEEE Transactions on\n  Intelligent Transportation Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Research on adaptive traffic signal control (ATSC) extends back to at least\nthe 1960s, and many ATSC methods have been proposed over the years. This paper\nprovides a review of this research and proposes a taxonomy for organizing it,\naccompanied by a consistent vocabulary for discussing the control concepts. We\nbegin from the well-established concept of control generations. Next, we\nclassify the ATSC methods according to their topographic structure (local-only,\nsystem/hierarchical), time resolution of decision-making (continuous versus\nplanning-horizon), type of decision (rule-based or optimization), objective\nfunction, cyclic/acyclic nature,and additional subcategories relevant to\ncertain \"families\" of methods. These various elements of system control are\norganized into a taxonomy of ATSC to help future researchers understand the\nwide diversity of algorithmic approaches to the signal control problem that\nhave been proposed to date, and which can be updated or expanded to incorporate\nfuture research.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:29:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shams","Andalib",""],["Emtenan","A. M. Tahsin",""],["Day","Christopher M.",""]]}
{"id":"2308.01953","submitter":"Jie Ren","authors":"Chenwen Yang, Danmei Zhang, Jinfeng Zhao, Wenting Gao, Weitao Yuan,\n  Yang Long, Yongdong Pan, Hong Chen, Franco Nori, Konstantin Y. Bliokh, Zheng\n  Zhong and Jie Ren","title":"Hybrid Spin and Anomalous Spin-Momentum Locking in Surface Elastic Waves","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transverse spin of surface waves is a universal phenomenon which has recently\nattracted significant attention in optics and acoustics. It appears in gravity\nwater waves, surface plasmon-polaritons, surface acoustic waves, and exhibits\nremarkable intrinsic spin-momentum locking, which has found useful applications\nfor efficient spin-direction couplers. Here we demonstrate, both theoretically\nand experimentally, that the transverse spin of surface elastic (Rayleigh)\nwaves has an anomalous sign near the surface, opposite to that in the case of\nelectromagnetic, sound, or water surface waves. This anomalous sign appears due\nto the hybrid (neither transverse nor longitudinal) nature of elastic surface\nwaves. Furthermore, we show that this sign anomaly can be employed for the\nselective spin-controlled excitation of symmetric and antisymmetric Lamb modes\npropagating in opposite directions in an elastic plate. Our results pave the\nway for spin-controlled manipulation of elastic waves and can be important for\na variety of areas, from phononic spin-based devices to seismic waves.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:06:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yang","Chenwen",""],["Zhang","Danmei",""],["Zhao","Jinfeng",""],["Gao","Wenting",""],["Yuan","Weitao",""],["Long","Yang",""],["Pan","Yongdong",""],["Chen","Hong",""],["Nori","Franco",""],["Bliokh","Konstantin Y.",""],["Zhong","Zheng",""],["Ren","Jie",""]]}
{"id":"2308.01954","submitter":"Franz Martin Rohrhofer","authors":"Franz M. Rohrhofer, Stefan Posch, Clemens G\\\"o{\\ss}nitzer, Jos\\'e M.\n  Garc\\'ia-Oliver, Bernhard C. Geiger","title":"Bringing Chemistry to Scale: Loss Weight Adjustment for Multivariate\n  Regression in Deep Learning of Thermochemical Processes","comments":"8 pages. Part of Scientific Computing 2023 Conference Proceedings\n  (ISBN e-Book: 978-3-903318-20-5)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Flamelet models are widely used in computational fluid dynamics to simulate\nthermochemical processes in turbulent combustion. These models typically employ\nmemory-expensive lookup tables that are predetermined and represent the\ncombustion process to be simulated. Artificial neural networks (ANNs) offer a\ndeep learning approach that can store this tabular data using a small number of\nnetwork weights, potentially reducing the memory demands of complex simulations\nby orders of magnitude. However, ANNs with standard training losses often\nstruggle with underrepresented targets in multivariate regression tasks, e.g.,\nwhen learning minor species mass fractions as part of lookup tables. This paper\nseeks to improve the accuracy of an ANN when learning multiple species mass\nfractions of a hydrogen (\\ce{H2}) combustion lookup table. We assess a simple,\nyet effective loss weight adjustment that outperforms the standard mean-squared\nerror optimization and enables accurate learning of all species mass fractions,\neven of minor species where the standard optimization completely fails.\nFurthermore, we find that the loss weight adjustment leads to more balanced\ngradients in the network training, which explains its effectiveness.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:00:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Rohrhofer","Franz M.",""],["Posch","Stefan",""],["G\u00f6\u00dfnitzer","Clemens",""],["Garc\u00eda-Oliver","Jos\u00e9 M.",""],["Geiger","Bernhard C.",""]]}
{"id":"2308.01955","submitter":"Jessica Chellino","authors":"Jessica Chellino, Zachary Slepian","title":"Triple-Spherical Bessel Function Integrals with Exponential and Gaussian\n  Damping: Towards an Analytic N-Point Correlation Function Covariance Model","comments":"29 pages","journal-ref":null,"doi":"10.1098/rspa.2023.0138","report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spherical Bessel functions appear commonly in many areas of physics wherein\nthere is both translation and rotation invariance, and often integrals over\nproducts of several arise. Thus, analytic evaluation of such integrals with\ndifferent weighting functions (which appear as toy models of a given physical\nobservable, such as the galaxy power spectrum) is useful. Here we present a\ngeneralization of a recursion-based method for evaluating such integrals. It\ngives relatively simple closed-form results in terms of Legendre functions (for\nthe exponentially-damped case) and Gamma, incomplete Gamma functions, and\nhypergeometric functions (for the Gaussian-damped case). We also present a new,\nnon-recursive method to evaluate integrals of products of spherical Bessel\nfunctions with Gaussian damping in terms of incomplete Gamma functions and\nhypergeometric functions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:12:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chellino","Jessica",""],["Slepian","Zachary",""]]}
{"id":"2308.01956","submitter":"Haoyu Guo","authors":"Haoyu Guo, Subir Sachdev, and Aavishkar A. Patel","title":"Large $N$ theory of critical Fermi surfaces III: Cyclotron Resonance and\n  Quantum Oscillation","comments":"42 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Kohn's theorem places strong constraints on the cyclotron response of Fermi\nliquids. Recent observations of a doping dependence in the cyclotron mass of\nLa$_{2-x}$Sr$_x$CuO$_4$ (Legros et al., Phys. Rev. B 106, 195110 (2022)) are\ntherefore surprising because the cyclotron mass can only be renormalized by\nlarge momentum umklapp interactions which are not expected to vary\nsignificantly with doping. We show that a version of Kohn's theorem continues\nto apply to disorder-free non-Fermi liquids with a critical boson near zero\nmomentum. However, marginal Fermi liquids arising from a spatially random\nYukawa coupling between the electrons and bosons do give rise to significant\ncorrections to the cyclotron mass which we compute. This is the same theory\nwhich yields linear-in-temperature resistivity and other properties of strange\nmetals at zero fields (Patel et al., arXiv:2203.04990).\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:00 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 14:22:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Guo","Haoyu",""],["Sachdev","Subir",""],["Patel","Aavishkar A.",""]]}
{"id":"2308.01957","submitter":"Connor Stone","authors":"Connor Stone, Stephane Courteau, Jean-Charles Cuillandre, Yashar\n  Hezaveh, Laurence Perreault-Levasseur, Nikhil Arora","title":"AutoPhot: Fitting Everything Everywhere All at Once in Astronomical\n  Images","comments":"18 Pages, 9 figures, submitted to MNRAS","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":"  We present AutoPhot, a fast, powerful, and user-friendly Python based\nastronomical image photometry solver. AutoPhot incorporates automatic\ndifferentiation and GPU (or parallel CPU) acceleration, powered by the machine\nlearning library PyTorch. Everything: AutoPhot can fit models for sky, stars,\ngalaxies, PSFs, and more in a principled Chi^2 forward optimization, recovering\nBayesian posterior information and covariance of all parameters. Everywhere:\nAutoPhot can optimize forward models on CPU or GPU; across images that are\nlarge, multi-band, multi-epoch, rotated, dithered, and more. All at once: The\nmodels are optimized together, thus handling overlapping objects and including\nthe covariance between parameters (including PSF and galaxy parameters). A\nnumber of optimization algorithms are available including Levenberg-Marquardt,\nGradient descent, and No-U-Turn MCMC sampling. With an object-oriented user\ninterface, AutoPhot makes it easy to quickly extract detailed information from\ncomplex astronomical data for individual images or large survey programs. This\npaper outlines novel features of the AutoPhot code and compares it to other\npopular astronomical image modeling software. AutoPhot is open-source, fully\nPython based, and freely accessible here:\nhttps://github.com/Autostronomy/AutoPhot\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Stone","Connor",""],["Courteau","Stephane",""],["Cuillandre","Jean-Charles",""],["Hezaveh","Yashar",""],["Perreault-Levasseur","Laurence",""],["Arora","Nikhil",""]]}
{"id":"2308.01958","submitter":"Elliot Davies","authors":"Elliot Y. Davies, Vasily Belokurov, Stephanie Monty and N. Wyn Evans","title":"Disrupted dwarf binary merger as the possible origin of NGC 2419 and\n  Sagittarius stream substructure","comments":"5 pages, 4 figures, 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":"  Using $N$-body simulations, we demonstrate that satellite dwarf galaxy pairs\nwhich undergo significant mixing ($\\sim 6$ Gyr) can have their respective most\nbound particles separated great distances upon subsequently merging with a more\nmassive host. This may provide an explanation as to the origin of the complex\nglobular cluster NGC 2149, which is found within the tail of the Sagittarius\ndwarf spheroidal galaxy, yet separated from its central remnant by over 100\nkpc. Dynamical investigations could support the chemical evidence which already\npoints to the NGC 2419 being a nuclear star cluster. Motivated by the distinct\nnature of NGC 2419, we run a suite of simulations whereby an initial pre-infall\nmerger of two satellites is followed by a post-infall merger of the remnant\ninto a MW-like host potential. We present a striking example from our suite in\nthis work, in which this separation is reproduced by the most bound particles\nof the two pre-infall satellites. Additionally, this double merger scenario can\ninduce unusual on-sky features in the tidal debris of the post-infall merger,\nsuch as clouds, overdensities, and potentially new arms that could resemble the\nbifurcation observed in Sagittarius.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Davies","Elliot Y.",""],["Belokurov","Vasily",""],["Monty","Stephanie",""],["Evans","N. Wyn",""]]}
{"id":"2308.01959","submitter":"Shijun Sun","authors":"Shijun Sun, Arthur P. Ramirez, Sergey Syzranov","title":"Quasispins of vacancy defects in Ising chains with nearest- and\n  next-to-nearest-neighbour interactions","comments":"4+6 pages, 2+2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.dis-nn cond-mat.mes-hall cond-mat.stat-mech cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by frustrated magnets and quasi-one-dimensional magnetic materials,\nwe study the magnetic properties of 1D Ising chains with nearest-neighbour (NN)\nand weaker next-to-nearest neighbour (NNN) interactions in the presence of\nvacancy defects. The effect of a vacancy on the magnetic susceptibility of a\nspin chain is two-fold: it reduces the length of the chain by an effective\n''vacancy size'' and may also act as a free spin, a ''quasispin'', with a\nCurie-type $\\chi_\\text{quasi}=\\langle S^2\\rangle/T$ contribution to the\nsusceptibility. In chains with antiferromagnetic short-range order, the\nsusceptibility of vacancy-free chains is exponentially suppressed at low\ntemperatures, and quasispins dominate the effect of impurities on the chains'\nmagnetic properties. For chains with antiferromagnetic NN interactions, the\nquasispin matches the value $\\langle S^2\\rangle=1$ of the Ising spins in the\nchain for ferromagnetic NNN interactions and vanishes for antiferromagnetic NNN\ninteractions. For chains with ferromagnetic short-range order, quasispin\neffects are insignificant due to exponentially large low-temperature\nsusceptibilities, and the dominant effect of a vacancy is effectively changing\nthe length of the chain.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sun","Shijun",""],["Ramirez","Arthur P.",""],["Syzranov","Sergey",""]]}
{"id":"2308.01960","submitter":"Nirmalya Brahma","authors":"Nirmalya Brahma, Saniya Heeba, Katelin Schutz","title":"Resonant Pseudo-Dirac Dark Matter as a Sub-GeV Thermal Target","comments":"16 pages, 8 figures + 1 secret doodle","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dark matter (DM) could be a pseudo-Dirac thermal relic with a small mass\nsplitting that is coupled off-diagonally to a kinetically mixed dark photon.\nThis model, particularly in the sub-GeV mass range, is a key benchmark for\naccelerator searches and direct detection experiments. Typically, the presence\nof even a tiny fraction of pseudo-Dirac DM in the excited state around the time\nof recombination would be excluded by DM annihilation bounds from the cosmic\nmicrowave background (CMB); thus, viable thermal histories must typically\nfeature an exponential suppression of the excited state. We revisit assumptions\nabout the thermal history in the resonant regime, where the dark photon mass is\nslightly more than twice the DM mass (to within $\\sim10\\%$), leading to an\n$s$-channel resonance in the annihilation cross section. This resonance\nsubstantially reduces the couplings required for achieving the observed relic\nabundance, implying that in much of the parameter space, the DM kinetically\ndecouples from the Standard Model well before the final DM relic abundance is\nachieved. We find that the excited state is not thermally depopulated in this\nregime. In spite of this, we find that the presence of the excited state does\n$\\textit{not}$ violate CMB bounds, even for arbitrarily small mass splittings.\nThe present-day abundance of the excited state opens up the possibility of\nsignatures that are usually not relevant for pseudo-Dirac DM, including\nindirect detection, direct detection, and self-interacting DM signatures.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Brahma","Nirmalya",""],["Heeba","Saniya",""],["Schutz","Katelin",""]]}
{"id":"2308.01961","submitter":"Zhaoyu Han","authors":"Kyung-Su Kim, Zhaoyu Han, and John Sous","title":"Semi-classical theory of bipolaronic superconductivity in a\n  bond-modulated electron-phonon model","comments":"5 pages, 4 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 analyze the transition temperature $T_c$ of bipolaronic superconductivity\nin a bond Peierls, also known as, Su-Schrieffer-Heeger (bond-SSH) model where\nthe electron hoppings are modulated by bond phonons. Using a semi-classical\ninstanton approximation justifiable in the adiabatic limit of slow phonons, we\nfind that the bipolaron mass is only weakly enhanced, in contrast to the\ntypical large mass enhancement found in standard (Holstein) electron-phonon\nmodels. Specifically, in the strong-coupling limit, the bipolarons can freely\nslide within a degenerate manifold rather than become self-trapped. A gas of\nthese bipolarons can undergo a superfluid transition at a critical temperature\nfor which we derive an upper bound. We find that this bound is exponentially\nlarger than that in the Holstein model. Our study may provide an analytical\nunderstanding of the mechanism behind the high-$T_c$ bipolaronic\nsuperconductivity numerically observed in [Phys. Rev. X 13, 011010 (2023)].\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kim","Kyung-Su",""],["Han","Zhaoyu",""],["Sous","John",""]]}
{"id":"2308.01962","submitter":"\\\"Omer Albayrak","authors":"Omer Albayrak, Tanmay Vachaspati","title":"Creating kinks with quantum mediation","comments":"9 pages, 8 figures with subfigures","journal-ref":null,"doi":null,"report-no":"CERN-TH-2023-154","categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the creation of kink-antikink pairs of a scalar field $\\phi$ by\nthe scattering of classical wavepackets of a second scalar field, $\\psi$, when\nthere are no direct interactions between $\\phi$ and $\\psi$. The creation\nbecomes possible only due to a quantum field that interacts with both $\\phi$\nand $\\psi$. We scan parameter space and find it favorable for kink production\nwhen the initial wavepackets have large total energy and wide spatial extent\nbut scatter at low velocities.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Albayrak","Omer",""],["Vachaspati","Tanmay",""]]}
{"id":"2308.01963","submitter":"Jason Dexter","authors":"Jason Dexter and Mitchell C. Begelman","title":"A relativistic outflow model of the X-ray polarization in Cyg X-1","comments":"4 pages, 3 figures, submitted to MNRAS Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose that the polarization of the emission from the X-ray binary Cygnus\nX-1, measured using the Imaging X-ray Polarimetry Explorer (IXPE), is imprinted\nby bulk Comptonization of coronal emission in a mildly relativistic wind or jet\nwith a hollow-cone geometry. Models based on scattering in a static corona\noverlying a thin accretion disc have difficulty reproducing the relatively high\npolarization degree (PD ~4%) concurrently with the low inclination (~30 deg) of\nthe binary orbit. We show that bulk outflow with a Lorentz factor > 1.5 is\nadequate to reproduce the observed PD, with position angle parallel to the\nlarge-scale jet, provided that the scattering occurs in a conical sheath offset\nfrom the jet axis and our line of sight aligns roughly with the opening angle\nof the cone. Physically, this flow geometry could represent the entrainment of\ndense material near the base of an accelerating jet as it passes through the\ndisc corona, or a slow (but still relativistic) sheath around a fast jet. If\nsimilar outflows are present in other X-ray binaries at higher inclination, we\nmight expect to see still higher degrees of linear polarization ~10% with an\norientation perpendicular to the jet direction.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dexter","Jason",""],["Begelman","Mitchell C.",""]]}
{"id":"2308.01964","submitter":"Mrinal Kanti Sarkar","authors":"Mrinal Kanti Sarkar, Saranyo Moitra, and Rajdeep Sensarma","title":"Signature of Criticality in Angular Momentum Resolved Entanglement of\n  Scalar Fields in $d>1$","comments":"4+3 Pages, 2+1 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.other cond-mat.quant-gas hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The scaling of entanglement entropy with subsystem size fails to distinguish\nbetween gapped and gapless ground state of a scalar field theory in $d>1$\ndimensions. We show that the scaling of angular momentum resolved entanglement\nentropy $S_\\ell$ with the subsystem radius $R$ can clearly distinguish between\nthese states. For a massless theory with momentum cut-off $\\Lambda$, $S_\\ell\n\\sim \\ln [\\Lambda R/\\ell]$ for $\\Lambda R \\gg \\ell$, while $S_\\ell \\sim R^0$\nfor the massive theory. In contrast, for a free Fermi gas with Fermi wave\nvector $k_F$, $S_\\ell \\sim \\ln [k_F R]$ for $k_F R \\gg \\ell$. We show how this\nleads to an ``area-log'' scaling of total entanglement entropy of Fermions,\nwhile the extra factor of $\\ell$ leads to a leading area law even for massless\nBosons.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sarkar","Mrinal Kanti",""],["Moitra","Saranyo",""],["Sensarma","Rajdeep",""]]}
{"id":"2308.01965","submitter":"Itai Sfaradi","authors":"Itai Sfaradi, Paz Beniamini, Assaf Horesh, Tsvi Piran, Joe Bright,\n  Lauren Rhodes, David R. A. Willians, Rob Fender, James K. Leung, Tara Murphy,\n  and Dave A. Green","title":"An off-axis relativistic jet seen in the long lasting delayed radio\n  flare of the TDE AT 2018hyz","comments":"8 pages, 6 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":"  The Tidal Disruption Event (TDE) AT 2018hyz exhibited a delayed radio flare\nalmost three years after the stellar disruption. Here we report new radio\nobservations of the TDE AT 2018hyz with the AMI-LA and ATCA spanning from a\nmonth to more than four years after the optical discovery and 200 days since\nthe last reported radio observation. We detected no radio detection from 30-220\ndays after the optical discovery in our observations at 15.5 GHz down to a\n$3\\sigma$ level of < 0.14 mJy. The fast-rising, delayed, radio flare is\nobserved in our radio data set and continues to rise almost ~1580 days after\nthe optical discovery. We find that the delayed radio emission, first detected\n$972$ days after optical discovery, evolves as $t^{4.2 \\pm 0.9}$, at 15.5 GHz.\nHere, we present an off-axis jet model that can explain the full set of radio\nobservations. In the context of this model, we require a powerful narrow jet\nwith an isotropic equivalent kinetic energy $E_{\\rm k,iso} \\sim 10^{55}$ erg,\nan opening angle of $ \\rm \\sim 7^{\\circ}$, and a relatively large viewing angle\nof $ \\rm \\sim 42^{\\circ}$, launched at the time of the stellar disruption.\nWithin our framework, we find that the minimal collimated energy possible for\nan off-axis jet from AT 2018hyz is $E_k \\geq 3 \\times 10^{52}$ erg. Finally, we\nprovide predictions based on our model for the light curve turnover time, and\nfor the proper motion of the radio emitting source.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sfaradi","Itai",""],["Beniamini","Paz",""],["Horesh","Assaf",""],["Piran","Tsvi",""],["Bright","Joe",""],["Rhodes","Lauren",""],["Willians","David R. A.",""],["Fender","Rob",""],["Leung","James K.",""],["Murphy","Tara",""],["Green","Dave A.",""]]}
{"id":"2308.01967","submitter":"Roman Rafikov","authors":"Nicolas P. Cimerman and Roman R. Rafikov","title":"Gravitational torque in circumbinary discs: global radial oscillations","comments":"20 pages, 15 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Circumbinary discs (CBDs) arise in many astrophysical settings, including\nyoung stellar binaries and supermassive black hole binaries. Their structure is\nmediated by gravitational torques exerted on the disc by the central binary.\nThe spatial distribution of the binary torque density (so-called excitation\ntorque density) in CBDs is known to feature global large-amplitude,\nquasi-periodic oscillations, which are often interpreted in terms of the local\nresonant Lindblad torques. Here we investigate the nature of these torque\noscillations using 2D, inviscid hydrodynamic simulations and theoretical\ncalculations. We show that torque oscillations arise due to the gravitational\ncoupling of the binary potential to the density waves launched near the inner\ncavity and freely propagating out in the disc. We provide analytical\npredictions for the radial periodicity of the torque density oscillations and\nverify them with simulations, showing that disc sound speed and the\nmultiplicity of the density wave spiral arms are the key factors setting the\nradial structure of the oscillations. Resonant Lindblad torques play no direct\nrole in determining the radial structure and periodicity of the torque\noscillations and manifest themselves only by driving the density waves in the\ndisc. We also find that vortices forming at the inner edge of the disc can\nprovide a non-trivial contribution to the angular momentum transport in the\nCBD. Our results can be applied to understanding torque behaviour in other\nsettings, e.g. discs in cataclysmic variables and X-ray binaries.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:00:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cimerman","Nicolas P.",""],["Rafikov","Roman R.",""]]}
{"id":"2308.01968","submitter":"Jan Moritz Petschick","authors":"Jan Moritz Petschick","title":"On finitely generated Engel branch groups","comments":"20 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We construct finitely generated Engel branch groups, answering a question of\nFern\\'andez-Alcober, Noce and Tracey on the existence of such objects. In\nparticular, the groups constructed are not nilpotent, yielding the second known\nclass of examples of finitely generated non-nilpotent Engel groups following a\nconstruction by Golod from 1969. To do so, we exhibit groups acting on rooted\ntrees with growing valency on which word lengths of elements are contracting\nvery quickly under section maps. Our methods apply in principle to a wider\nclass of iterated identities, of which the Engel words are only a special case.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:01:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Petschick","Jan Moritz",""]]}
{"id":"2308.01969","submitter":"Pai Peng","authors":"Di Liu, Wenjie Yu, Qiujiao Du, Fengming Liu and Pai Peng","title":"Complete mode conversion for elastic waves reflected by elastic\n  metamaterial slab with double hexapole resonances","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we investigate the phenomenon of mode conversion in elastic\nbulk waves using coupled hexapole resonances. A metamaterial slab is proposed\nenabling the complete conversion between longitudinal and transverse modes.\nEach unit of the elastic metamaterial slab comprises a pair of scatterers, and\ntheir relative direction is oriented at an oblique angle. The interaction\nbetween the coupled hexapoles and the background results in oblique\ndisplacements, which are responsible for the mode conversion. Moreover, this\nconversion exhibits a broader frequency range compared to the quadrupole\nresonance. This innovative design significantly broadens the range of\npossibilities for developing mode-converting metamaterials.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:03:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Di",""],["Yu","Wenjie",""],["Du","Qiujiao",""],["Liu","Fengming",""],["Peng","Pai",""]]}
{"id":"2308.01970","submitter":"Ching Hua Lee","authors":"Deyuan Zou, Tian Chen, Haiyu Meng, Yee Sin Ang, Xiangdong Zhang and\n  Ching Hua Lee","title":"Experimental observation of exceptional bound states in a classical\n  circuit network","comments":"14 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.other cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Exceptional bound (EB) states represent an unique new class of robust bound\nstates protected by the defectiveness of non-Hermitian exceptional points.\nConceptually distinct from the more well-known topological states and\nnon-Hermitian skin states, they were recently discovered as a novel source of\nnegative entanglement entropy in the quantum entanglement context. Yet, EB\nstates have been physically elusive, being originally interpreted as negative\nprobability eigenstates of the propagator of non-Hermitian Fermi gases. In this\nwork, we show that EB states are in fact far more ubiquitous, also arising\nrobustly in broad classes of systems whether classical or quantum. This hinges\ncrucially on a newly-discovered spectral flow that rigorously justifies the EB\nnature of small candidate lattice systems. As a highlight, we present their\nfirst experimental realization through an electrical circuit, where they\nmanifest as prominent stable resonant voltage profiles. Our work brings a\nhitherto elusive but fundamentally distinctive quantum phenomenon into the\nrealm of classical metamaterials, and provides a novel pathway for the\nengineering of robust modes in otherwise sensitive systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:03:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zou","Deyuan",""],["Chen","Tian",""],["Meng","Haiyu",""],["Ang","Yee Sin",""],["Zhang","Xiangdong",""],["Lee","Ching Hua",""]]}
{"id":"2308.01971","submitter":"Saleem Ahmed","authors":"Saleem Ahmed, Pengyu Yan, David Doermann, Srirangaraj Setlur, Venu\n  Govindaraju","title":"SpaDen : Sparse and Dense Keypoint Estimation for Real-World Chart\n  Understanding","comments":"Accepted ORAL at ICDAR 23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a novel bottom-up approach for the extraction of chart data. Our\nmodel utilizes images of charts as inputs and learns to detect keypoints (KP),\nwhich are used to reconstruct the components within the plot area. Our novelty\nlies in detecting a fusion of continuous and discrete KP as predicted heatmaps.\nA combination of sparse and dense per-pixel objectives coupled with a uni-modal\nself-attention-based feature-fusion layer is applied to learn KP embeddings.\nFurther leveraging deep metric learning for unsupervised clustering, allows us\nto segment the chart plot area into various objects. By further matching the\nchart components to the legend, we are able to obtain the data series names. A\npost-processing threshold is applied to the KP embeddings to refine the object\nreconstructions and improve accuracy. Our extensive experiments include an\nevaluation of different modules for KP estimation and the combination of deep\nlayer aggregation and corner pooling approaches. The results of our experiments\nprovide extensive evaluation for the task of real-world chart data extraction.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:03:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ahmed","Saleem",""],["Yan","Pengyu",""],["Doermann","David",""],["Setlur","Srirangaraj",""],["Govindaraju","Venu",""]]}
{"id":"2308.01972","submitter":"Wenrui Xu","authors":"Wenrui Xu, Satoshi Ohashi, Yusuke Aso, and Hauyu Baobab Liu","title":"Gravitational instability, spiral substructure, and modest grain growth\n  in a typical protostellar disk: Modeling multi-wavelength dust continuum\n  observation of TMC1A","comments":"16 pages, 8 figures, accepted for publication in ApJ","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":"  Embedded, Class 0/I protostellar disks represent the initial condition for\nplanet formation. This calls for better understandings of their bulk properties\nand the dust grains within them. We model multi-wavelength dust continuum\nobservations of the disk surrounding the Class I protostar TMC1A to provide\ninsight on these properties. The observations can be well fit by a\ngravitationally self-regulated (i.e., marginally gravitationally unstable and\ninternally heated) disk model, with surface density $\\Sigma \\sim 1720\n(R/10au)^{-1.96} g/cm^2$ and midplane temperature $T_{mid} \\sim 185\n(R/10au)^{-1.27} K$. The observed disk contains a $m=1$ spiral substructure; we\nuse our model to predict the spiral's pitch angle and the prediction is\nconsistent with the observations. This agreement serves as both a test of our\nmodel and strong evidence of the gravitational nature of the spiral. Our model\nestimates a maximum grain size $a_{max}\\sim 196(R/10au)^{-2.45} \\mu m$, which\nis consistent with grain growth being capped by a fragmentation barrier with\nthreshold velocity $\\sim 1 m/s$. We further demonstrate that observational\nproperties of TMC1A are typical among the observed population of Class 0/I\ndisks, which hints that traditional methods of disk data analyses based on\nGaussian fitting and the assumption of the optically thin dust emission could\nhave systematically underestimated disk size and mass and overestimated grain\nsize.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:03:51 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 15:24:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xu","Wenrui",""],["Ohashi","Satoshi",""],["Aso","Yusuke",""],["Liu","Hauyu Baobab",""]]}
{"id":"2308.01973","submitter":"Keller VandeBogert","authors":"Maya Banks and Keller VandeBogert","title":"Differential modules and Deformations of Free Complexes","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify (up to quasi-isomorphism) the free differential modules whose\nhomology is equal to a given module $M$ by developing a theory for deforming an\narbitrary free complex into a differential module. We use an iterative approach\nto parameterize the deformations and obstructions in terms of certain Ext\ngroups, giving an algorithmic realization of a result of Brown-Erman. We apply\nthis theory to study certain rigidity properties of free resolutions and\nrelated rank conjectures.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:04:12 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Banks","Maya",""],["VandeBogert","Keller",""]]}
{"id":"2308.01974","submitter":"Karol Koziol","authors":"Karol Koziol, Stefano Morra","title":"Gelfand-Kirillov dimension for mod $p$ representations of $p$-adic\n  unitary groups of rank 2","comments":"66 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $p$ be a prime number and $F/F^+$ a CM extension of a totally real field\nsuch that every place of $F^+$ above $p$ is unramified and inert in $F$. We fix\na finite place $v$ of $F^+$ above $p$, and let $\\overline{r}:\n\\textrm{Gal}(\\overline{F^+}/F^+) \\longrightarrow\n{}^C\\textrm{U}_{1,1}(\\overline{\\mathbb{F}}_p)$ be a modular $L$-parameter\nvalued in the $C$-group of a rank 2 unitary group associated to $F/F^+$. We\nassume $\\overline{r}$ is semisimple and sufficiently generic at $v$. Using\nrecent results of Breuil--Herzig--Hu--Morra--Schraen along with our previous\nwork, we prove that certain admissible smooth\n$\\overline{\\mathbb{F}}_p$-representations of the $p$-adic unitary group\n$\\textrm{U}_{1,1}(F^+_v)$ associated to $\\overline{r}$ in spaces of mod $p$\nautomorphic forms have Gelfand--Kirillov dimension $[F^+_v:\\mathbb{Q}_p]$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:05:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Koziol","Karol",""],["Morra","Stefano",""]]}
{"id":"2308.01975","submitter":"Rodolfo Sassot","authors":"Ignacio Borsa, David Jorrin, Rodolfo Sassot and Martin Schvellinger","title":"Proton helicity structure function g_1^p from a holographic Pomeron","comments":"34 pages, 3 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 present a detailed analysis of the polarized and the unpolarized deep\ninelastic scattering structure functions of the proton, g_1^p and F_2^p\nrespectively, in the context of a holographic dual description based on type\nIIB superstring theory. We compare this description with experimental data and\nQuantum Chromodynamics estimates computed at leading, next-to-leading and\nnext-to-next-to-leading order in perturbation. We confront the predictions of a\nholographic dual model and those of perturbative QCD for g_1^p at the\nkinematics that will be probed by the forthcoming Electron-Ion Collider. We\nfind that the extrapolation of g_1^p to very small values the Bjorken variable\ncomputed with a Holographic Pomeron model based on actual data at higher\nmomentum fractions is always positive and differs significantly with standard\nprojections based on perturbative QCD.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:08:09 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Borsa","Ignacio",""],["Jorrin","David",""],["Sassot","Rodolfo",""],["Schvellinger","Martin",""]]}
{"id":"2308.01976","submitter":"Laurent Bou\\'e","authors":"Dayananda Ubrangala, Juhi Sharma, Ravi Prasad Kondapalli, Kiran R,\n  Amit Agarwala, Laurent Bou\\'e","title":"Domain specificity and data efficiency in typo tolerant spell checkers:\n  the case of search in online marketplaces","comments":null,"journal-ref":"Microsoft Journal of Applied Research, Volume 19, 2023","doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Typographical errors are a major source of frustration for visitors of online\nmarketplaces. Because of the domain-specific nature of these marketplaces and\nthe very short queries users tend to search for, traditional spell cheking\nsolutions do not perform well in correcting typos. We present a data\naugmentation method to address the lack of annotated typo data and train a\nrecurrent neural network to learn context-limited domain-specific embeddings.\nThose embeddings are deployed in a real-time inferencing API for the Microsoft\nAppSource marketplace to find the closest match between a misspelled user query\nand the available product names. Our data efficient solution shows that\ncontrolled high quality synthetic data may be a powerful tool especially\nconsidering the current climate of large language models which rely on\nprohibitively huge and often uncontrolled datasets.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:11:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ubrangala","Dayananda",""],["Sharma","Juhi",""],["Kondapalli","Ravi Prasad",""],["R","Kiran",""],["Agarwala","Amit",""],["Bou\u00e9","Laurent",""]]}
{"id":"2308.01977","submitter":"Magnus Fries","authors":"Magnus Fries","title":"Relative K-homology of higher-order differential operators","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.KT math.AP math.FA math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the notion of a spectral triple to that of a higher-order relative\nspectral triple, which accommodates several types of hypoelliptic differential\noperators on manifolds with boundary. The bounded transform of a higher-order\nrelative spectral triple gives rise to a relative K-homology cycle. In the case\nof an elliptic differential operator on a compact smooth manifold with\nboundary, we calculate the K-homology boundary map of the constructed relative\nK-homology cycle to obtain a generalization of the Baum-Douglas-Taylor index\ntheorem.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:12:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fries","Magnus",""]]}
{"id":"2308.01978","submitter":"Sohil Lal Shrestha","authors":"Sohil Lal Shrestha and Shafiul Azam Chowdhury and Christoph Csallner","title":"Replicability Study: Corpora For Understanding Simulink Models &\n  Projects","comments":"Changed A4 paper to letter paper size","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Background: Empirical studies on widely used model-based development tools\nsuch as MATLAB/Simulink are limited despite the tools' importance in various\nindustries.\n  Aims: The aim of this paper is to investigate the reproducibility of previous\nempirical studies that used Simulink model corpora and to evaluate the\ngeneralizability of their results to a newer and larger corpus, including a\ncomparison with proprietary models.\n  Method: The study reviews methodologies and data sources employed in prior\nSimulink model studies and replicates the previous analysis using SLNET. In\naddition, we propose a heuristic for determining code-generating Simulink\nmodels and assess the open-source models' similarity to proprietary models.\n  Results: Our analysis of SLNET confirms and contradicts earlier findings and\nhighlights its potential as a valuable resource for model-based development\nresearch. We found that open-source Simulink models follow good modeling\npractices and contain models comparable in size and properties to proprietary\nmodels. We also collected and distribute 208 git repositories with over 9k\ncommits, facilitating studies on model evolution.\n  Conclusions: The replication study offers actionable insights and lessons\nlearned from the reproduction process, including valuable information on the\ngeneralizability of research findings based on earlier open-source corpora to\nthe newer and larger SLNET corpus. The study sheds light on noteworthy\nattributes of SLNET, which is self-contained and redistributable.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:14:54 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:25:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shrestha","Sohil Lal",""],["Chowdhury","Shafiul Azam",""],["Csallner","Christoph",""]]}
{"id":"2308.01979","submitter":"Saleem Ahmed","authors":"Saleem Ahmed, Bhavin Jawade, Shubham Pandey, Srirangaraj Setlur, Venu\n  Govindaraju","title":"RealCQA: Scientific Chart Question Answering as a Test-bed for\n  First-Order Logic","comments":"This a pre-print version. Accepted at ICDAR '23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comprehensive study of chart visual question-answering(QA) task,\nto address the challenges faced in comprehending and extracting data from chart\nvisualizations within documents. Despite efforts to tackle this problem using\nsynthetic charts, solutions are limited by the shortage of annotated real-world\ndata. To fill this gap, we introduce a benchmark and dataset for chart visual\nQA on real-world charts, offering a systematic analysis of the task and a novel\ntaxonomy for template-based chart question creation. Our contribution includes\nthe introduction of a new answer type, 'list', with both ranked and unranked\nvariations. Our study is conducted on a real-world chart dataset from\nscientific literature, showcasing higher visual complexity compared to other\nworks. Our focus is on template-based QA and how it can serve as a standard for\nevaluating the first-order logic capabilities of models. The results of our\nexperiments, conducted on a real-world out-of-distribution dataset, provide a\nrobust evaluation of large-scale pre-trained models and advance the field of\nchart visual QA and formal logic verification for neural networks in general.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:21:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ahmed","Saleem",""],["Jawade","Bhavin",""],["Pandey","Shubham",""],["Setlur","Srirangaraj",""],["Govindaraju","Venu",""]]}
{"id":"2308.01980","submitter":"Amulya Ratnakar","authors":"Kishore Iyer, Amulya Ratnakar, Sumathi Rao and Sourin Das","title":"Can Majorana zero modes in quantum Hall edges survive edge\n  reconstruction?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parafermion zero modes can be trapped in the domain walls of quantum Hall\nedges proximitized by superconductors and ferromagnets. The $\\nu = 1/3$\nfractional quantum Hall side strip arising due to edge reconstruction of a $\\nu\n= 1$ edge doubles the number of topological sectors such that each of them is\n$Z_{2} \\times Z_{2}$ degenerate. The many-body spectrum displays a $4\\pi$\nJosephson periodicity, with the states in each $Z_{2}$ being energetically\ndecoupled. Signatures of the new states appear in the fractional Josephson\ncurrent when the edge velocities are taken to be different.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:22:53 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Iyer","Kishore",""],["Ratnakar","Amulya",""],["Rao","Sumathi",""],["Das","Sourin",""]]}
{"id":"2308.01981","submitter":"Yongcheng Yao","authors":"Yongcheng Yao, Junru Zhong, Liping Zhang, Sheheryar Khan, Weitian Chen","title":"CartiMorph: a framework for automated knee articular cartilage\n  morphometrics","comments":"To be published in Medical Image Analysis","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG physics.med-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce CartiMorph, a framework for automated knee articular cartilage\nmorphometrics. It takes an image as input and generates quantitative metrics\nfor cartilage subregions, including the percentage of full-thickness cartilage\nloss (FCL), mean thickness, surface area, and volume. CartiMorph leverages the\npower of deep learning models for hierarchical image feature representation.\nDeep learning models were trained and validated for tissue segmentation,\ntemplate construction, and template-to-image registration. We established\nmethods for surface-normal-based cartilage thickness mapping, FCL estimation,\nand rule-based cartilage parcellation. Our cartilage thickness map showed less\nerror in thin and peripheral regions. We evaluated the effectiveness of the\nadopted segmentation model by comparing the quantitative metrics obtained from\nmodel segmentation and those from manual segmentation. The root-mean-squared\ndeviation of the FCL measurements was less than 8%, and strong correlations\nwere observed for the mean thickness (Pearson's correlation coefficient $\\rho\n\\in [0.82,0.97]$), surface area ($\\rho \\in [0.82,0.98]$) and volume ($\\rho \\in\n[0.89,0.98]$) measurements. We compared our FCL measurements with those from a\nprevious study and found that our measurements deviated less from the ground\ntruths. We observed superior performance of the proposed rule-based cartilage\nparcellation method compared with the atlas-based approach. CartiMorph has the\npotential to promote imaging biomarkers discovery for knee osteoarthritis.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:28:50 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 17:02:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yao","Yongcheng",""],["Zhong","Junru",""],["Zhang","Liping",""],["Khan","Sheheryar",""],["Chen","Weitian",""]]}
{"id":"2308.01982","submitter":"Amir Hossein Hosseini Akbarnejad","authors":"Amir Akbarnejad, Nilanjan Ray, Penny J. Barnes, Gilbert Bigras","title":"Predicting Ki67, ER, PR, and HER2 Statuses from H&E-stained Breast\n  Cancer Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Despite the advances in machine learning and digital pathology, it is not yet\nclear if machine learning methods can accurately predict molecular information\nmerely from histomorphology. In a quest to answer this question, we built a\nlarge-scale dataset (185538 images) with reliable measurements for Ki67, ER,\nPR, and HER2 statuses. The dataset is composed of mirrored images of H\\&E and\ncorresponding images of immunohistochemistry (IHC) assays (Ki67, ER, PR, and\nHER2. These images are mirrored through registration. To increase reliability,\nindividual pairs were inspected and discarded if artifacts were present (tissue\nfolding, bubbles, etc). Measurements for Ki67, ER and PR were determined by\ncalculating H-Score from image analysis. HER2 measurement is based on binary\nclassification: 0 and 1+ (IHC scores representing a negative subset) vs 3+ (IHC\nscore positive subset). Cases with IHC equivocal score (2+) were excluded. We\nshow that a standard ViT-based pipeline can achieve prediction performances\naround 90% in terms of Area Under the Curve (AUC) when trained with a proper\nlabeling protocol. Finally, we shed light on the ability of the trained\nclassifiers to localize relevant regions, which encourages future work to\nimprove the localizations. Our proposed dataset is publicly available:\nhttps://ihc4bc.github.io/\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:31:18 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Akbarnejad","Amir",""],["Ray","Nilanjan",""],["Barnes","Penny J.",""],["Bigras","Gilbert",""]]}
{"id":"2308.01983","submitter":"Thomas Pasquier","authors":"Soo Yee Lim and Xueyuan Han and Thomas Pasquier","title":"Unleashing Unprivileged eBPF Potential with Dynamic Sandboxing","comments":"8 pages, 5 figures, to appear in the 1st SIGCOMM Workshop on eBPF and\n  Kernel Extensions","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.OS cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For safety reasons, unprivileged users today have only limited ways to\ncustomize the kernel through the extended Berkeley Packet Filter (eBPF). This\nis unfortunate, especially since the eBPF framework itself has seen an increase\nin scope over the years. We propose SandBPF, a software-based kernel isolation\ntechnique that dynamically sandboxes eBPF programs to allow unprivileged users\nto safely extend the kernel, unleashing eBPF's full potential. Our early\nproof-of-concept shows that SandBPF can effectively prevent exploits missed by\neBPF's native safety mechanism (i.e., static verification) while incurring\n0%-10% overhead on web server benchmarks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:33:56 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 04:31:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lim","Soo Yee",""],["Han","Xueyuan",""],["Pasquier","Thomas",""]]}
{"id":"2308.01984","submitter":"Rida Fatima","authors":"Rida Fatima, Hassan Zahid Butt and Xingpeng Li","title":"Optimal Dynamic Reconfiguration of Distribution Networks","comments":"Accepted for 2023 North American Power Symposium (NAPS) conference","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of distribution networks is to meet their local area power demand\nwith maximum reliability. As the electricity consumption tends to increase\nevery year, limited line thermal capacity can lead to network congestion.\nContinuous development and upgradation of the distribution network is thus\nrequired to meet the energy demand, which poses a significant increase in cost.\nThe objective of this research is to analyze distribution network topologies\nand introduce a topology reconfiguration scheme based on the cost and demand of\nelectricity. Traditional electrical distribution networks are static and\ninefficient. To make the network active, an optimal dynamic network topology\nreconfiguration (DNTR) is proposed to control line switching and reconnect some\nloads to different substations such that the cost of electricity can be\nminimized. The proposed DNTR strategy was tested on a synthetic radial\ndistribution network with three substations each connecting to an IEEE 13-bus\nsystem. Simulation results demonstrated significant cost saving in daily\noperations of this distribution system.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:40:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fatima","Rida",""],["Butt","Hassan Zahid",""],["Li","Xingpeng",""]]}
{"id":"2308.01985","submitter":"Gary M. Wysin","authors":"G. M. Wysin","title":"Metastability and dynamics in remanent states of square artificial spin\n  ice with long-range dipole interactions","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":"  After removal of an applied magnetic field, artificial square spin ice can be\nleft in a metastable remanent state, with nonzero residual magnetization and\nexcess energy above the ground state. Using a model of magnetic islands with\ndipoles of fixed magnitude and local anisotropies, the remanent states are\nprecisely determined here, including all long-range dipole interactions. Small\ndeviations away from remanent states are analyzed and the frequencies of modes\nof oscillation are determined. Some modes reach zero frequency at high symmetry\nwave vectors, such that the stability limits are found, as determined by the\nlocal anisotropy strength relative to the dipolar coupling strength.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:43:05 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wysin","G. M.",""]]}
{"id":"2308.01986","submitter":"Luca Dellantonio","authors":"Lane G. Gunderman, Andrew J. Jena, Luca Dellantonio","title":"Occam's razor for quantum simulations","comments":"5+5 pages main text and supplemental material; 4 figures. All kinds\n  of feedback welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last years, we have been witnessing a tremendous push to demonstrate\nthat quantum computers can solve classically intractable problems. This effort,\ninitially focused on the hardware, progressively included the simplification of\nthe models to be simulated. This is Occam's razor applied to quantum\nsimulation, which is used in this work to systematically cut all superfluous\nqubits in any given system. Our approach is universally applicable and lowers\nthe complexity by first ensuring that the largest possible portion of the\nHilbert space becomes irrelevant, and then by finding and exploiting all\nconserved charges of the system. Remarkably, both processes are classically\nefficient and optimal. To showcase our algorithm, we simplify chemical\nmolecules, lattice gauge theories, the Hubbard and the Kitaev models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:47:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gunderman","Lane G.",""],["Jena","Andrew J.",""],["Dellantonio","Luca",""]]}
{"id":"2308.01987","submitter":"Md. Tanvir Rouf Shawon","authors":"G. M. Shahariar, Md. Tanvir Rouf Shawon, Faisal Muhammad Shah,\n  Mohammad Shafiul Alam and Md. Shahriar Mahbub","title":"Bengali Fake Reviews: A Benchmark Dataset and Detection System","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 proliferation of fake reviews on various online platforms has created a\nmajor concern for both consumers and businesses. Such reviews can deceive\ncustomers and cause damage to the reputation of products or services, making it\ncrucial to identify them. Although the detection of fake reviews has been\nextensively studied in English language, detecting fake reviews in non-English\nlanguages such as Bengali is still a relatively unexplored research area. This\npaper introduces the Bengali Fake Review Detection (BFRD) dataset, the first\npublicly available dataset for identifying fake reviews in Bengali. The dataset\nconsists of 7710 non-fake and 1339 fake food-related reviews collected from\nsocial media posts. To convert non-Bengali words in a review, a unique pipeline\nhas been proposed that translates English words to their corresponding Bengali\nmeaning and also back transliterates Romanized Bengali to Bengali. We have\nconducted rigorous experimentation using multiple deep learning and pre-trained\ntransformer language models to develop a reliable detection system. Finally, we\npropose a weighted ensemble model that combines four pre-trained transformers:\nBanglaBERT, BanglaBERT Base, BanglaBERT Large, and BanglaBERT Generator .\nAccording to the experiment results, the proposed ensemble model obtained a\nweighted F1-score of 0.9843 on 13390 reviews, including 1339 actual fake\nreviews and 5356 augmented fake reviews generated with the nlpaug library. The\nremaining 6695 reviews were randomly selected from the 7710 non-fake instances.\nThe model achieved a 0.9558 weighted F1-score when the fake reviews were\naugmented using the bnaug library.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:49:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shahariar","G. M.",""],["Shawon","Md. Tanvir Rouf",""],["Shah","Faisal Muhammad",""],["Alam","Mohammad Shafiul",""],["Mahbub","Md. Shahriar",""]]}
{"id":"2308.01988","submitter":"Pablo Aguirre","authors":"Sof\\'ia Guarello, Pablo Aguirre, Isabel Flores","title":"Quantifying the spread of communicable diseases with immigration of\n  infectious individuals","comments":"33 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a set of new epidemiological thresholds to address the general\nproblem of spreading and containment of a disease with influx of infected\nindividuals when the classic $\\mathcal R_0$ is no longer meaningful. We provide\nanalytical properties of these indices and illustrate their usefulness in a\ncompartmental model of COVID-19 with data taken from Chile showing a good\npredictive potential when contrasted with the recorded disease behaviour. This\napproach and the associated analytical and numerical results allow us to\nquantify the severity of an immigration of infectious individuals into a\ncommunity, and identification of the key parameters that are capable of\nchanging or reversing the spread of an infectious disease in specific models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:52:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Guarello","Sof\u00eda",""],["Aguirre","Pablo",""],["Flores","Isabel",""]]}
{"id":"2308.01989","submitter":"Kyle Scheuer","authors":"K. G. Scheuer, F. B. Romero, and R.G. DeCorby","title":"Observation of the thermal acoustic breathing modes of a bubble","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report experimental observations of the volume acoustic modes of air\nbubbles in water, including both the fundamental Minnaert breathing mode and a\nfamily of higher-order modes extending into the megahertz frequency range.\nBubbles were placed on or near optomechanical sensors having a noise floor\nsubstantially determined by ambient medium fluctuations, and thus able to\ndetect thermal Brownian motions of proximate objects. Bubble motions could be\ncoupled to the sensor through both air (i.e., with the sensor inside the\nbubble) and water, verifying that sound is radiated by the high-order modes. In\nsome cases, we also observed hybridization between the mechanical modes of the\nsensor and those of nearby bubbles. Finally, and more speculatively, we found\nevidence for Purcell-effect modification of the sensor vibrational spectrum\nwhen encapsulated by a bubble.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:59:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Scheuer","K. G.",""],["Romero","F. B.",""],["DeCorby","R. G.",""]]}
{"id":"2308.01990","submitter":"Daniel Castro","authors":"Rodrigo Pedro, Daniel Castro, Paulo Carreira, Nuno Santos","title":"From Prompt Injections to SQL Injection Attacks: How Protected is Your\n  LLM-Integrated Web Application?","comments":"12 pages, 3 figures, 3 tables, 5 listings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have found widespread applications in various\ndomains, including web applications, where they facilitate human interaction\nvia chatbots with natural language interfaces. Internally, aided by an\nLLM-integration middleware such as Langchain, user prompts are translated into\nSQL queries used by the LLM to provide meaningful responses to users. However,\nunsanitized user prompts can lead to SQL injection attacks, potentially\ncompromising the security of the database. Despite the growing interest in\nprompt injection vulnerabilities targeting LLMs, the specific risks of\ngenerating SQL injection attacks through prompt injections have not been\nextensively studied. In this paper, we present a comprehensive examination of\nprompt-to-SQL (P$_2$SQL) injections targeting web applications based on the\nLangchain framework. Using Langchain as our case study, we characterize\nP$_2$SQL injections, exploring their variants and impact on application\nsecurity through multiple concrete examples. Furthermore, we evaluate 7\nstate-of-the-art LLMs, demonstrating the pervasiveness of P$_2$SQL attacks\nacross language models. Our findings indicate that LLM-integrated applications\nbased on Langchain are highly susceptible to P$_2$SQL injection attacks,\nwarranting the adoption of robust defenses. To counter these attacks, we\npropose four effective defense techniques that can be integrated as extensions\nto the Langchain framework. We validate the defenses through an experimental\nevaluation with a real-world use case application.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:03:18 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 06:31:44 GMT"},{"version":"v3","created":"Tue, 15 Aug 2023 18:38:07 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pedro","Rodrigo",""],["Castro","Daniel",""],["Carreira","Paulo",""],["Santos","Nuno",""]]}
{"id":"2308.01991","submitter":"Hyogo Shibahara","authors":"Hyogo Shibahara","title":"A $C^m$ Whitney Extension Theorem for Horizontal Curves in Free Step $2$\n  Carnot Groups","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish a $C^m$ Whitney extension theorem for horizontal curves in free\nstep~$2$ Carnot groups $\\mathbb{G}_r$ for an arbitrary number of generators $r\n\\geq 2$. This extends existing results in the Heisenberg group. New techniques\ninclude a quantitative linear dependence structure on jets on the horizontal\nlayer, a discretization process to correct vertical areas, and studying the\neffect of unrelated vertical areas.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:05:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shibahara","Hyogo",""]]}
{"id":"2308.01992","submitter":"C\\'esar Victoria","authors":"C\\'esar Ivan Victoria-Ceballos, Omaira Gonz\\'alez-Mart\\'in, Josefa\n  Masegosa, Anna Lia Longinotti, Donaji Esparza-Arredondo, Natalia\n  Osorio-Clavijo","title":"Testing physical scenarios for the reflection features of type-1 AGN\n  using XMM-Newton and NuSTAR simultaneous observations","comments":null,"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":"  Above $\\sim$3 keV, the X-ray spectrum of the active galactic nuclei (AGN) is\ncharacterized by the intrinsic continuum and compton reflection features. For\ntype-1 AGN, several regions could contribute to the reflection. In order to\ninvestigate the nature of the reflecting medium, we perform a systematic\nanalysis of the reflector using XMM-Newton and NuSTAR observations of a sample\nof 22 type-1 AGN. We create a baseline model which includes Galactic absorption\nand an intrinsically absorbed power-law plus a reflection model. We test a set\nof nine reflection models in a sub-sample of five objects. Based on these\nresults, we select three models to be tested on the entire sample, accounting\nfor distinct physical scenarios: neutral/distant reflection,\nionized/relativistic reflection, and neutral/distant+ionized/relativistic\nreflection, namely hybrid model. We find that 18 sources require the reflection\ncomponent to fit their spectra. Among them, 67$\\%$ prefer the hybrid model.\nNeutral and ionized models are equally preferred by three sources. We conclude\nthat both the neutral/distant reflector most probably associated with the inner\nedges of the torus and the ionized/relativistic reflector associated with the\naccretion disk are required to describe the reflection in type-1 AGN.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:09:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Victoria-Ceballos","C\u00e9sar Ivan",""],["Gonz\u00e1lez-Mart\u00edn","Omaira",""],["Masegosa","Josefa",""],["Longinotti","Anna Lia",""],["Esparza-Arredondo","Donaji",""],["Osorio-Clavijo","Natalia",""]]}
{"id":"2308.01993","submitter":"Kevin Ryczko","authors":"Amit Kadan, Kevin Ryczko, Andrew Wildman, Rodrigo Wang, Adrian\n  Roitberg, Takeshi Yamazaki","title":"Accelerated Organic Crystal Structure Prediction with Genetic Algorithms\n  and Machine Learning","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":"  We present a high-throughput, end-to-end pipeline for organic crystal\nstructure prediction (CSP) -- the problem of identifying the stable crystal\nstructures that will form from a given molecule based only on its molecular\ncomposition. Our tool uses Neural Network Potentials (NNPs) to allow for\nefficient screening and structural relaxations of generated crystal candidates.\nOur pipeline consists of two distinct stages -- random search, whereby crystal\ncandidates are randomly generated and screened, and optimization, where a\ngenetic algorithm (GA) optimizes this screened population. We assess the\nperformance of each stage of our pipeline on 21 targets taken from the\nCambridge Crystallographic Data Centre's CSP blind tests. We show that random\nsearch alone yields matches for $\\approx50\\%$ of candidates. We then validate\nthe potential of our full pipeline, making use of the GA to optimize the\nRoot-Mean-Square Distance (RMSD) between crystal candidates and the\nexperimentally derived structure. With this approach, we are able to find\nmatches for $\\approx80\\%$ of candidates with 10-100 times smaller initial\npopulation sizes than when using random search. Lastly, we run our full\npipeline with an ANI model that is trained on a small dataset of molecules\nextracted from crystal structures in the Cambridge Structural Database,\ngenerating $\\approx60\\%$ of targets. By leveraging ML models trained to predict\nenergies at the DFT level, our pipeline has the potential to approach the\naccuracy of $\\textit{ab initio}$ methods, while being as efficient as solutions\nbased on empirical force-fields.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:12:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kadan","Amit",""],["Ryczko","Kevin",""],["Wildman","Andrew",""],["Wang","Rodrigo",""],["Roitberg","Adrian",""],["Yamazaki","Takeshi",""]]}
{"id":"2308.01994","submitter":"Giorgos Papanastasiou","authors":"Chengjia Wang, Giorgos Papanastasiou","title":"Explainable unsupervised multi-modal image registration using deep\n  networks","comments":null,"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":"  Clinical decision making from magnetic resonance imaging (MRI) combines\ncomplementary information from multiple MRI sequences (defined as\n'modalities'). MRI image registration aims to geometrically 'pair' diagnoses\nfrom different modalities, time points and slices. Both intra- and\ninter-modality MRI registration are essential components in clinical MRI\nsettings. Further, an MRI image processing pipeline that can address both afine\nand non-rigid registration is critical, as both types of deformations may be\noccuring in real MRI data scenarios. Unlike image classification,\nexplainability is not commonly addressed in image registration deep learning\n(DL) methods, as it is challenging to interpet model-data behaviours against\ntransformation fields. To properly address this, we incorporate Grad-CAM-based\nexplainability frameworks in each major component of our unsupervised\nmulti-modal and multi-organ image registration DL methodology. We previously\ndemonstrated that we were able to reach superior performance (against the\ncurrent standard Syn method). In this work, we show that our DL model becomes\nfully explainable, setting the framework to generalise our approach on further\nmedical imaging data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:13:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Chengjia",""],["Papanastasiou","Giorgos",""]]}
{"id":"2308.01995","submitter":"Roberto Capecelatro","authors":"Roberto Capecelatro, Valentina Brosco, Gabriele Campagnano and Procolo\n  Lucignano","title":"Andreev spin-noise detector","comments":"Review. 14 pages. 3 appendices. 14 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":"  We investigate the possibility to employ magnetic Josephson junctions as\nmagnetic-noise detectors. To illustrate our idea, we consider a system\nconsisting of a quantum dot coupled to superconducting leads in the presence of\nan external magnetic field. Under appropriate assumptions, we relate the noise\nin the Josephson current to magnetization noise. At the magnetic field driven\n$0-\\pi$ transition the junction sensitivity as magnetic noise detector is\nstrongly enhanced and it diverges in the zero temperature limit. Moreover, we\ndemonstrate that, if also dot energy is affected by fluctuations, only the\nmagnetic noise channel contributes to Josephson current noise response when the\nquantum dot is tuned in resonance with superconducting leads.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:15:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Capecelatro","Roberto",""],["Brosco","Valentina",""],["Campagnano","Gabriele",""],["Lucignano","Procolo",""]]}
{"id":"2308.01996","submitter":"Mainak Das","authors":"Mainak Das, Chunli Huang","title":"Unconventional Metallic Magnetism: Non-analyticity and Sign-changing\n  Behavior of Orbital Magnetization in ABC Trilayer Graphene","comments":"4+8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study an unique form of metallic ferromagnetism in which orbital moments\nsurpasses the role of spin moments in shaping the overall magnetization. This\nsystem emerges naturally upon doping a topologically non-trivial Chern band in\nthe recently identified quarter metal phase of rhombohedral trilayer graphene.\nOur comprehensive scan of the density-interlayer potential parameter space\nreveals an unexpected landscape of orbital magnetization marked by two sign\nchanges and a line of singularities. The sign change originates from an intense\nBerry curvature concentrated close to the band-edge, and the singularity arises\nfrom a topological Lifshitz transition that transform a simply connected Fermi\nsea into an annular Fermi sea. Importantly, these variations occur while the\ngroundstate order-parameter (i.e. valley and spin polarization) remains\nunchanged. This unconventional relationship between the order parameter and\nmagnetization markedly contrasts traditional spin ferromagnets, where spin\nmagnetization is simply proportional to the groundstate spin polarization via\nthe gyromagnetic ratio. We compute energy and magnetization curves as functions\nof collective valley rotation to shed light on magnetization dynamics and to\nexpand the Stoner-Wohlfarth magnetization reversal model. We provide\npredictions on the magnetic coercive field that can be readily tested in\nexperiments. Our results challenge established perceptions of magnetism,\nemphasising the important role of orbital moments in two-dimensional materials\nsuch as graphene and transition metal dichalcogenides, and in turn, expand our\nunderstanding and potential manipulation of magnetic behaviors in these\nsystems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:15:24 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 03:11:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Das","Mainak",""],["Huang","Chunli",""]]}
{"id":"2308.01997","submitter":"Miguel S\\'anchez S\\'anchez","authors":"Miguel S\\'anchez S\\'anchez and Tobias Stauber","title":"The correlated insulators of magic angle twisted bilayer graphene at\n  zero and one quantum of magnetic flux: a tight-binding study","comments":"14+11 pages, 13+6 figures. Figure 6 is visible is the new version","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magic angle twisted bilayer graphene (MATBG) has become one of the prominent\ntopics in Condensed Matter during the last few years, however, fully atomistic\nstudies of the interacting physics are missing. In this work, we study the\ncorrelated insulator states of MATBG in the setting of a tight-binding model,\nunder a perpendicular magnetic field of $0$ and $26.5$ T, corresponding to zero\nand one quantum of magnetic flux per unit cell. At zero field and for dopings\nof two holes ($\\nu=-2$) or two electrons ($\\nu=+2$) per unit cell, the Kramers\nintervalley coherent (KIVC) order is the ground state at the Hartree-Fock\nlevel, although it is stabilized by a different mechanism to that in continuum\nmodel. At charge neutrality, the spin polarized state is competitive with the\nKIVC due to the on-site Hubbard energy. We obtain a strongly electron-hole\nasymmetric phase diagram with robust insulators for electron filling and metals\nfor negative filling. In the presence of magnetic flux, we predict an insulator\nwith Chern number $-2$ for $\\nu=-2$, a spin polarized state at charge\nneutrality and competing insulators with Chern numbers $+2$ and $0$ at\n$\\nu=+2$. The stability of the $\\nu=+2$ insulators is determined by the\nscreening environment, allowing for the possibility of observing a topological\nphase transition.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:18:01 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 16:35:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["S\u00e1nchez","Miguel S\u00e1nchez",""],["Stauber","Tobias",""]]}
{"id":"2308.01998","submitter":"Lucas M. Stolerman","authors":"Haridas K. Das and Lucas M. Stolerman","title":"Epidemic thresholds and disease dynamics in metapopulations: the role of\n  network geometry and human mobility","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculate epidemic thresholds and investigate the dynamics of a disease in\na networked metapopulation model. To study the specific role of mobility levels\nand network geometry, we utilize the SIR-Network model and consider a range of\ngeometric structures. For \\emph{star-shaped} networks where all nodes only\nconnect to a center, we obtain the same epidemic threshold formula as\npreviously found for fully connected networks in the case where all nodes have\nthe same infection rate except one. Next, we analyze \\emph{cycle-shaped}\nnetworks that yield different epidemic thresholds than star-shaped ones. We\nthen analyze more general classes of networks by combining the star, cycle, and\nother structures, obtaining classes of networks with the same epidemic\nthreshold formulas. We present some conjectures on even more flexible networks\nand complete our analysis by presenting simulations to explore the epidemic\ndynamics for the different geometries.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:26:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Das","Haridas K.",""],["Stolerman","Lucas M.",""]]}
{"id":"2308.01999","submitter":"Azzam Haidar","authors":"Harun Bayraktar, Ali Charara, David Clark, Saul Cohen, Timothy Costa,\n  Yao-Lung L. Fang, Yang Gao, Jack Guan, John Gunnels, Azzam Haidar, Andreas\n  Hehn, Markus Hohnerbach, Matthew Jones, Tom Lubowe, Dmitry Lyakh, Shinya\n  Morino, Paul Springer, Sam Stanwyck, Igor Terentyev, Satya Varadhan, Jonathan\n  Wong, Takuma Yamaguchi","title":"cuQuantum SDK: A High-Performance Library for Accelerating Quantum\n  Science","comments":"paper accepted at QCE 2023, journal reference will be updated\n  whenever available","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.PF cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the NVIDIA cuQuantum SDK, a state-of-the-art library of composable\nprimitives for GPU-accelerated quantum circuit simulations. As the size of\nquantum devices continues to increase, making their classical simulation\nprogressively more difficult, the availability of fast and scalable quantum\ncircuit simulators becomes vital for quantum algorithm developers, as well as\nquantum hardware engineers focused on the validation and optimization of\nquantum devices. The cuQuantum SDK was created to accelerate and scale up\nquantum circuit simulators developed by the quantum information science\ncommunity by enabling them to utilize efficient scalable software building\nblocks optimized for NVIDIA GPU platforms. The functional building blocks\nprovided cover the needs of both state vector- and tensor network- based\nsimulators, including approximate tensor network simulation methods based on\nmatrix product state, projected entangled pair state, and other factorized\ntensor representations. By leveraging the enormous computing power of the\nlatest NVIDIA GPU architectures, quantum circuit simulators that have adopted\nthe cuQuantum SDK demonstrate significant acceleration, compared to CPU-only\nexecution, for both the state vector and tensor network simulation methods.\nFurthermore, by utilizing the parallel primitives available in the cuQuantum\nSDK, one can easily transition to distributed GPU-accelerated platforms,\nincluding those furnished by cloud service providers and high-performance\ncomputing systems deployed by supercomputing centers, extending the scale of\npossible quantum circuit simulations. The rich capabilities provided by the SDK\nare conveniently made available via both Python and C application programming\ninterfaces, where the former is directly targeting a broad Python quantum\ncommunity and the latter allows tight integration with simulators written in\nany programming language.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:28:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bayraktar","Harun",""],["Charara","Ali",""],["Clark","David",""],["Cohen","Saul",""],["Costa","Timothy",""],["Fang","Yao-Lung L.",""],["Gao","Yang",""],["Guan","Jack",""],["Gunnels","John",""],["Haidar","Azzam",""],["Hehn","Andreas",""],["Hohnerbach","Markus",""],["Jones","Matthew",""],["Lubowe","Tom",""],["Lyakh","Dmitry",""],["Morino","Shinya",""],["Springer","Paul",""],["Stanwyck","Sam",""],["Terentyev","Igor",""],["Varadhan","Satya",""],["Wong","Jonathan",""],["Yamaguchi","Takuma",""]]}
{"id":"2308.02000","submitter":"Junyan Cheng","authors":"Junyan Cheng and Peter Chin","title":"On the Transition from Neural Representation to Symbolic Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bridging the huge disparity between neural and symbolic representation can\npotentially enable the incorporation of symbolic thinking into neural networks\nfrom essence. Motivated by how human gradually builds complex symbolic\nrepresentation from the prototype symbols that are learned through perception\nand environmental interactions. We propose a Neural-Symbolic Transitional\nDictionary Learning (TDL) framework that employs an EM algorithm to learn a\ntransitional representation of data that compresses high-dimension information\nof visual parts of an input into a set of tensors as neural variables and\ndiscover the implicit predicate structure in a self-supervised way. We\nimplement the framework with a diffusion model by regarding the decomposition\nof input as a cooperative game, then learn predicates by prototype clustering.\nWe additionally use RL enabled by the Markovian of diffusion models to further\ntune the learned prototypes by incorporating subjective factors. Extensive\nexperiments on 3 abstract compositional visual objects datasets that require\nthe model to segment parts without any visual features like texture, color, or\nshadows apart from shape and 3 neural/symbolic downstream tasks demonstrate the\nlearned representation enables interpretable decomposition of visual input and\nsmooth adaption to downstream tasks which are not available by existing\nmethods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:29:35 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cheng","Junyan",""],["Chin","Peter",""]]}
{"id":"2308.02001","submitter":"Liam Madden","authors":"Liam Madden and Christos Thrampoulidis","title":"Memory capacity of two layer neural networks with smooth activations","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Determining the memory capacity of two-layer neural networks with m hidden\nneurons and input dimension d (i.e., md+m total trainable parameters), which\nrefers to the largest size of general data the network can memorize, is a\nfundamental machine-learning question. For non-polynomial real analytic\nactivation functions, such as sigmoids and smoothed rectified linear units\n(smoothed ReLUs), we establish a lower bound of md/2 and optimality up to a\nfactor of approximately 2. Analogous prior results were limited to Heaviside\nand ReLU activations, with results for smooth activations suffering from\nlogarithmic factors and requiring random data. To analyze the memory capacity,\nwe examine the rank of the network's Jacobian by computing the rank of matrices\ninvolving both Hadamard powers and the Khati-Rao product. Our computation\nextends classical linear algebraic facts about the rank of Hadamard powers.\nOverall, our approach differs from previous works on memory capacity and holds\npromise for extending to deeper models and other architectures.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:31:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Madden","Liam",""],["Thrampoulidis","Christos",""]]}
{"id":"2308.02002","submitter":"Michael Zhang","authors":"Michael Zhang, Fei Dai, Jacob L. Bean, Heather A. Knutson, Federica\n  Rescigno","title":"Outflowing helium from a mature mini-Neptune","comments":"Accepted by ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We announce the detection of escaping helium from TOI 2134b, a mini-Neptune a\nfew Gyr old. The average in-transit absorption spectrum shows a peak of 0.37 +-\n0.05% and an equivalent width of $W_{\\rm avg}=3.3 \\pm 0.3$ m$\\r{A}$. Among all\nplanets with helium detections, TOI 2134b is the only mature mini-Neptune, has\nthe smallest helium signal, and experiences the lowest XUV flux. Putting TOI\n2134b in the context of all other helium detections, we report the detection of\na strong (p=3.0e-5) and theoretically expected correlation between $F_{\\rm\nXUV}/\\rho_{\\rm XUV}$ (proportional to the energy-limited mass loss rate) and\n$R_* W_{\\rm avg}$ (roughly proportional to the observationally inferred mass\nloss rate). Here, $W_{\\rm avg}$ is the equivalent width of the helium\nabsorption and $\\rho_{\\rm XUV}$ is the density of the planet within the XUV\nphotosphere, but the correlation is similarly strong if we use the optical\nphotosphere. TOI 2134b anchors the relation, having the lowest value on both\naxes. We encourage further observations to fill in missing regions of this\nparameter space and improve estimates of $F_{\\rm XUV}$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:34:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Michael",""],["Dai","Fei",""],["Bean","Jacob L.",""],["Knutson","Heather A.",""],["Rescigno","Federica",""]]}
{"id":"2308.02003","submitter":"Alexandru Maries","authors":"Jing Li, Alexandru Maries and Chandralekha Singh","title":"Helping students apply superposition principle in problems involving\n  spherical, cylindrical and planar charge distributions","comments":"6 pages, 1 figure for article; 10 pages, 8 figures for supplement","journal-ref":null,"doi":"10.1119/5.0127127","report-no":"J. Li, A. Maries, and C. Singh, Helping students apply superposition\n  principle in problems involving spherical, cylindrical and planar charge\n  distributions, Am. J. Phys. 91, 613-616 (2023)","categories":"physics.ed-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe student difficulties in applying the superposition principle in\ncombination with Gauss's law. We addressed these difficulties by developing a\ntutorial that uses guided inquiry. Students who used this tutorial following\nlecture-based instruction performed significantly better on these topics than\nthose who did not. Instructors can assign the tutorial as classwork or\nhomework.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:37:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Jing",""],["Maries","Alexandru",""],["Singh","Chandralekha",""]]}
{"id":"2308.02004","submitter":"Paolo Salucci","authors":"Fabrizio Nesti, Paolo Salucci and Nicola Turini","title":"The Quest for the Nature of the Dark Matter: The Need of a New Paradigm","comments":"15 pages. 9 figures","journal-ref":"Astronomy, 2023, 2, 90-104","doi":"10.3390/astronomy2020007","report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The phenomenon of the Dark matter baffles the researchers: the underlying\ndark particle has escaped so far the detection and its astrophysical role\nappears complex and entangled with that of the standard luminous particles. We\npropose that, in order to act efficiently, alongside with abandoning the\ncurrent $\\Lambda CDM$ scenario, we need also to shift the Paradigm from which\nit emerged.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:39:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Nesti","Fabrizio",""],["Salucci","Paolo",""],["Turini","Nicola",""]]}
{"id":"2308.02005","submitter":"Siyu Heng","authors":"Jianan Zhu, Siyu Heng","title":"Bias Correction for Randomization-Based Estimation in Inexactly Matched\n  Observational Studies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Matching has been widely used to mimic a randomized experiment with\nobservational data. Ideally, treated subjects are exactly matched with controls\nfor the covariates, and randomization-based estimation can then be conducted as\nin a randomized experiment (assuming no unobserved covariates). However, when\nthere exists continuous covariates or many covariates, matching typically\nshould be inexact. Previous studies have routinely ignored inexact matching in\nthe downstream randomization-based estimation as long as some covariate balance\ncriteria are satisfied, which can cause severe estimation bias. Built on the\ncovariate-adaptive randomization inference framework, in this research note, we\npropose two new classes of bias-corrected randomization-based estimators to\nreduce estimation bias due to inexact matching: the bias-corrected maximum\n$p$-value estimator for the constant treatment effect and the bias-corrected\ndifference-in-means estimator for the average treatment effect. Our simulation\nresults show that the proposed bias-corrected estimators can effectively reduce\nestimation bias due to inexact matching.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:48:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhu","Jianan",""],["Heng","Siyu",""]]}
{"id":"2308.02007","submitter":"Egor Kosov","authors":"Egor Kosov and Anastasia Zhukova","title":"Improved bounds for the total variation distance between stochastic\n  polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The paper studies upper bounds for the total variation distance between two\npolynomials of a special form in random vectors satisfying the Doeblin-type\ncondition. Our approach is based on the recent results concerning\nNikolskii--Besov-type smoothness of distribution densities of polynomials in\nlogarithmically concave random vectors. The main results of the paper improve\npreviously obtained estimates of Nourdin--Poly and Bally--Caramellino.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:53:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kosov","Egor",""],["Zhukova","Anastasia",""]]}
{"id":"2308.02008","submitter":"Th\\'eophile Chaumont-Frelet","authors":"T. Chaumont-Frelet","title":"An equilibrated estimator for mixed finite element discretizations of\n  the curl-curl 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 propose a new a posteriori error estimator for mixed finite element\ndiscretizations of the curl-curl problem. This estimator relies on a\nPrager--Synge inequality, and therefore leads to fully guaranteed constant-free\nupper bounds on the error. The estimator is also locally efficient and\npolynomial-degree-robust. The construction is based on patch-wise\ndivergence-constrained minimization problems, leading to a cheap embarrassingly\nparallel algorithm. Crucially, the estimator operates without any assumption on\nthe topology of the domain, and unconventional arguments are required to\nestablish the reliability estimate. Numerical examples illustrate the key\ntheoretical results, and suggest that the estimator is suited for mesh\nadaptivity purposes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:54:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chaumont-Frelet","T.",""]]}
{"id":"2308.02009","submitter":"Isaac Neri Gomez-Sarmiento","authors":"Isaac Neri Gomez-Sarmiento, Daline Tho, Christopher D\\\"urrbeck, Wim de\n  Jager, Denis Laurendeau, Luc Beaulieu","title":"Image registration of an electromagnetic tracking enabled afterloader\n  and CT using a phantom for the quality control of implant reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electromagnetic tracking (EMT) shows great potential for automating implant\nreconstruction in brachytherapy. One of the challenges of this technology is\nthat it does not intrinsically share the same reference frame as the patient's\nmedical imaging. The purpose of this work is to register the reference frames\nof an EMT-enabled afterloader and a CT scan image of a rigid phantom for\nquality control of EMT-based implant reconstruction. The geometry of twelve 6F\ncatheters and a tandem and ring gynecological applicator were reconstructed\nusing an EMT sensor attached to an afterloader's check cable. All EMT\nreconstructions were done in three different environments: disturbance free,\nCT-on-rails brachytherapy suite and MRI brachytherapy suite. Implants were\nreconstructed using two acquisition methods: step-and-record and continuous\nmotion. A CT scan of the phantom was obtained and manually reconstructed in the\ntreatment planning system, with the help of the solid model of the applicator.\nRigid registration algorithms were used to register EMT and CT scan reference\nframes using corresponding points from the EMT and CT based reconstructions of\nthe phantom, following three approaches: one gynecological applicator, four\ncatheters inside four calibration plates having and S-shaped path, and four\nceramic marbles within the calibration plates. The absolute median deviation\nfrom the expected value for EMT measurements in all three environments\nsignificantly lie below the sensor's expected accuracy of 0.70 mm (p < 0.001),\nsuggesting that the environment did not have a significant impact on the\nmeasurements, given that care is taken in the immediate surroundings. In all\nthree environments, the two acquisition and three registration approaches have\na mean and median registration errors (perpendicular distance) that lie at or\nbelow 1 mm, which is lower than the clinical acceptable threshold of 2 mm.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:58:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gomez-Sarmiento","Isaac Neri",""],["Tho","Daline",""],["D\u00fcrrbeck","Christopher",""],["de Jager","Wim",""],["Laurendeau","Denis",""],["Beaulieu","Luc",""]]}
{"id":"2308.02010","submitter":"Meng Xu","authors":"Meng Xu and Joachim Ankerhold","title":"About the performance of perturbative treatments of the spin-boson\n  dynamics within the hierarchical equations of motion approach","comments":"16 pages, 4 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":"  The hierarchical equations of motion (HEOM) provide a numerically exact\napproach for simulating the dynamics of open quantum systems coupled to a\nharmonic bath. However, its applicability has traditionally been limited to\nspecific spectral forms and relatively high temperatures. Recently, an extended\nversion called Free-Pole HEOM (FP-HEOM) has been developed to overcome these\nlimitations. In this study, we demonstrate that the FP-HEOM method can be\nsystematically employed to investigate higher-order master equations by\ntruncating the FP-HEOM hierarchy at a desired tier. We focus on the challenging\nscenario of the spin-boson problem with a sub-Ohmic spectral distribution at\nzero temperature and analyze the performance of the corresponding master\nequations. Furthermore, we compare the memory kernel for population dynamics\nobtained from the exact FP-HEOM dynamics with that of the approximate NIBA\n(Non-Interacting-Blip Approximation).\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:01:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xu","Meng",""],["Ankerhold","Joachim",""]]}
{"id":"2308.02011","submitter":"Mansooreh Karami","authors":"Mansooreh Karami, David Mosallanezhad, Paras Sheth, Huan Liu","title":"Silence Speaks Volumes: Re-weighting Techniques for Under-Represented\n  Users in Fake News Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Social media platforms provide a rich environment for analyzing user\nbehavior. Recently, deep learning-based methods have been a mainstream approach\nfor social media analysis models involving complex patterns. However, these\nmethods are susceptible to biases in the training data, such as participation\ninequality. Basically, a mere 1% of users generate the majority of the content\non social networking sites, while the remaining users, though engaged to\nvarying degrees, tend to be less active in content creation and largely silent.\nThese silent users consume and listen to information that is propagated on the\nplatform. However, their voice, attitude, and interests are not reflected in\nthe online content, making the decision of the current methods predisposed\ntowards the opinion of the active users. So models can mistake the loudest\nusers for the majority. We propose to leverage re-weighting techniques to make\nthe silent majority heard, and in turn, investigate whether the cues from these\nusers can improve the performance of the current models for the downstream task\nof fake news detection.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:04:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Karami","Mansooreh",""],["Mosallanezhad","David",""],["Sheth","Paras",""],["Liu","Huan",""]]}
{"id":"2308.02012","submitter":"Anasua Chatterjee","authors":"Fabrizio Berritta, Torbj{\\o}rn Rasmussen, Jan A. Krzywda, Joost van\n  der Heijden, Federico Fedele, Saeed Fallahi, Geoffrey C. Gardner, Michael J.\n  Manfra, Evert van Nieuwenburg, Jeroen Danon, Anasua Chatterjee and Ferdinand\n  Kuemmeth","title":"Real-time two-axis control of a spin qubit","comments":null,"journal-ref":null,"doi":null,"report-no":"NBI QDev 2023","categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Optimal control of qubits requires the ability to adapt continuously to their\never-changing environment. We demonstrate a real-time control protocol for a\ntwo-electron singlet-triplet qubit with two fluctuating Hamiltonian parameters.\nOur approach leverages single-shot readout classification and dynamic waveform\ngeneration, allowing full Hamiltonian estimation to dynamically stabilize and\noptimize the qubit performance. Powered by a field-programmable gate array\n(FPGA), the quantum control electronics estimates the Overhauser field gradient\nbetween the two electrons in real time, enabling controlled Overhauser-driven\nspin rotations and thus bypassing the need for micromagnets or nuclear\npolarization protocols. It also estimates the exchange interaction between the\ntwo electrons and adjusts their detuning, resulting in extended coherence of\nHadamard rotations when correcting for fluctuations of both qubit axes. Our\nstudy emphasizes the critical role of feedback in enhancing the performance and\nstability of quantum devices affected by quasistatic noise. Feedback will play\nan essential role in improving performance in various qubit implementations\nthat go beyond spin qubits, helping realize the full potential of quantum\ndevices for quantum technology applications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:07:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Berritta","Fabrizio",""],["Rasmussen","Torbj\u00f8rn",""],["Krzywda","Jan A.",""],["van der Heijden","Joost",""],["Fedele","Federico",""],["Fallahi","Saeed",""],["Gardner","Geoffrey C.",""],["Manfra","Michael J.",""],["van Nieuwenburg","Evert",""],["Danon","Jeroen",""],["Chatterjee","Anasua",""],["Kuemmeth","Ferdinand",""]]}
{"id":"2308.02013","submitter":"Gopinath Chennupati","authors":"Guruprasad V Ramesh, Gopinath Chennupati, Milind Rao, Anit Kumar Sahu,\n  Ariya Rastrow, Jasha Droppo","title":"Federated Representation Learning for Automatic Speech Recognition","comments":"Accepted at ISCA SPSC Symposium 3rd Symposium on Security and Privacy\n  in Speech Communication, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) is a privacy-preserving paradigm, allowing edge\ndevices to learn collaboratively without sharing data. Edge devices like Alexa\nand Siri are prospective sources of unlabeled audio data that can be tapped to\nlearn robust audio representations. In this work, we bring Self-supervised\nLearning (SSL) and FL together to learn representations for Automatic Speech\nRecognition respecting data privacy constraints. We use the speaker and chapter\ninformation in the unlabeled speech dataset, Libri-Light, to simulate non-IID\nspeaker-siloed data distributions and pre-train an LSTM encoder with the\nContrastive Predictive Coding framework with FedSGD. We show that the\npre-trained ASR encoder in FL performs as well as a centrally pre-trained model\nand produces an improvement of 12-15% (WER) compared to no pre-training. We\nfurther adapt the federated pre-trained models to a new language, French, and\nshow a 20% (WER) improvement over no pre-training.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:08:23 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 21:34:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ramesh","Guruprasad V",""],["Chennupati","Gopinath",""],["Rao","Milind",""],["Sahu","Anit Kumar",""],["Rastrow","Ariya",""],["Droppo","Jasha",""]]}
{"id":"2308.02014","submitter":"Valdin\\^es Leite de Sousa J\\'unior","authors":"Valdines Leite de Sousa Junior, Lucas Vidal de Meireles, Samara Costa\n  Lima, Gilson do Nascimento Silva","title":"Local convergence of an inexact proximal algorithm for weakly convex\n  functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since introduced by Martinet and Rockafellar, the proximal point algorithm\nwas generalized in many fruitful directions. More recently, in 2002, Pennanen\nstudied the proximal point algorithm without monotonicity. A year later, Iusem\nand Svaiter joined Pennanen to present inexact variants of the method, again\nwithout monotonicity. Building on the foundation laid by these two prior works,\nwe propose a variant of the proximal point algorithm designed specifically for\nweakly convex functions. Our motivation for introducing this inexact algorithm\nis to increase its versatility and applicability in a broader range of\nscenarios in optimization and introduce a more adaptable version of the method\nfor typical generalizations. Our study relies heavily on the Moreau envelope, a\nwell-known mathematical tool used to analyze the behavior of the proximal\noperator. By leveraging the properties of the Moreau envelope, we are able to\nprove that the proximal algorithm converges in local contexts. Moreover, we\npresent a complexity result to determine the practical feasibility of the\nproximal algorithm.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:09:56 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Junior","Valdines Leite de Sousa",""],["de Meireles","Lucas Vidal",""],["Lima","Samara Costa",""],["Silva","Gilson do Nascimento",""]]}
{"id":"2308.02015","submitter":"Matthias Gohlke","authors":"Matthias Gohlke, Atsushi Iwaki, Chisa Hotta","title":"Thermal pure matrix product state in two dimensions: tracking thermal\n  equilibrium from paramagnet down to the Kitaev honeycomb spin liquid state","comments":"13 pages, 4 figures, submission to SciPost","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the matrix product state (MPS) provides a thermal quantum pure\nstate (TPQ) representation in equilibrium in two spatial dimensions over the\nwhole temperature range. We use the Kitaev honeycomb model as a prominent\nexample hosting a quantum spin liquid (QSL) ground state to target the two\nspecific-heat peaks previously solved nearly exactly using the free Majorana\nfermionic description. Starting from the high-temperature random state, our\nTPQ-MPS wrapping the cylinder precisely reproduces these peaks, showing that\nthe quantum many-body description based on spins can still capture the emergent\nitinerant Majorana fermions in a ${\\mathbb Z}_2$ gauge field. The truncation\nprocess efficiently discards the high-energy states, eventually reaching the\nlong-range entangled topological state.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:11:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gohlke","Matthias",""],["Iwaki","Atsushi",""],["Hotta","Chisa",""]]}
{"id":"2308.02016","submitter":"Kimberly Moreland","authors":"Kimberly Moreland, Maher Dayeh, Gang Li, Ashraf Farahat, Rob Ebert,\n  Mihir Desai","title":"Variability of interplanetary shock and associated energetic particle\n  properties as a function of the time window around the shock","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the effect of sampling windows on derived shock and associated\nenergetic storm particle (ESP) properties in 296 fast-forward interplanetary\nshocks using ACE measurements at 1 au between 02/1998 - 08/2013. We vary the\ntime windows from 2-mins to 20-mins for the shock properties and from 2-mins to\n540-mins for ESP properties. Variability is quantified by the median absolute\ndeviation (MAD) statistic. We find that the magnetic, density, and temperature\ncompression ratios vary from their median values by 17.03%, 20.05%, 25.91%,\nrespectively; shock speed by 16.26%, speed jump by 45.46%, Alfvenic Mach number\nby 31.53%, and shock obliquity by 24.25%. Spectral indices in the 2-min to\n540-min windows downstream of the shock vary from the median value of 1.79 by\n26.05%, and by 30.53% from the 1.70 median value upstream of the shock.\nSimilarity of ESP spectral indices upstream and downstream of the shock suggest\nthat these ESP populations are likely locally accelerated at the shock.\nFurthermore, we find that for a moving sampling window around the shock, values\nfor the density ratio hold for ~10-mins; the magnetic ratio and shock speed\njump hold for ~30-mins, and ~60-mins, respectively. Fixing the upstream window\nto 2-mins and moving only in the downstream direction, then the density ratio\nholds for ~60-mins downstream, magnetic ratio for ~30-mins, and the shock speed\njump holds for ~110-mins. Beyond these time windows, derived shock properties\nno longer representative of shock properties. These results provide constraints\nfor modeling and forecasting efforts of shock and ESP-associated properties.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:14:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Moreland","Kimberly",""],["Dayeh","Maher",""],["Li","Gang",""],["Farahat","Ashraf",""],["Ebert","Rob",""],["Desai","Mihir",""]]}
{"id":"2308.02017","submitter":"Daniel Bedau","authors":"Mohamad Moner Al Chawa, Daniel Bedau, Ahmet S. Demirkol, James W.\n  Reiner, Derek A. Stewart, Michael K. Grobis, Ronald Tetzlaff","title":"A Compact Model of Threshold Switching Devices for Efficient Circuit\n  Simulations","comments":"IEEE Transactions on Circuits and Systems I","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall eess.SP physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a new compact model of threshold switching devices\nwhich is suitable for efficient circuit-level simulations. First, a macro\nmodel, based on a compact transistor based circuit, was implemented in LTSPICE.\nThen, a descriptive model was extracted and implemented in MATLAB, which is\nbased on the macro model. This macro model was extended to develop a physical\nmodel that describes the processes that occur during the threshold switching.\nThe physical model derived comprises a delay structure with few electrical\ncomponents adjacent to the second junction. The delay model incorporates an\ninternal state variable, which is crucial to transform the descriptive model\ninto a compact model and to parameterize it in terms of electrical parameters\nthat represent the component's behavior. Finally, we applied our model by\nfitting measured i-v data of an OTS device manufactured by Western Digital\nResearch.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:19:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chawa","Mohamad Moner Al",""],["Bedau","Daniel",""],["Demirkol","Ahmet S.",""],["Reiner","James W.",""],["Stewart","Derek A.",""],["Grobis","Michael K.",""],["Tetzlaff","Ronald",""]]}
{"id":"2308.02018","submitter":"Damian Arquez","authors":"Damian Arquez, Mat\\'ias Toro, \\'Eric Tanter","title":"Gradual Sensitivity Typing","comments":"Journal Submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reasoning about the sensitivity of functions with respect to their inputs has\ninteresting applications in various areas, such as differential privacy. In\norder to check and enforce sensitivity, several approaches have been developed,\nnotably sensitivity type systems. In these systems, sensitivity can be seen as\nan effect in the sense of type-and-effects systems as originally proposed by\nGifford and Lucassen. Because type-and-effect systems can make certain useful\nprogramming patterns tedious or overly conservative, there is value in bringing\nthe benefits of gradual typing to these disciplines in order to ease their\nadoption. In this work, we motivate, formalize, and prototype gradual\nsensitivity typing. The language GSoul supports both the unrestricted unknown\nsensitivity and bounded imprecision in the form of intervals. Gradual\nsensitivity typing allows programmers to smoothly evolve typed programs without\nany static sensitivity information towards hardened programs with a mix of\nstatic and dynamic sensitivity checking. In particular, we show that gradual\nsensitivity supports recursive functions for which fully static checking would\nbe overly conservative, seamlessly enabling exact runtime sensitivity checks.\nGSoul satisfies both the gradual guarantees and sensitivity type soundness,\nknown as metric preservation. We establish that, in general, gradual metric\npreservation is termination insensitive, and that one can achieve\ntermination-sensitive gradual metric preservation by hardening specifications\nto bounded imprecision. We implement a prototype that provides an interactive\ntest bed for gradual sensitivity typing. This work opens the door to\ngradualizing other typing disciplines that rely on function sensitivity such as\ndifferential privacy, as well as other quantitative type-based reasoning\ntechniques.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:19:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Arquez","Damian",""],["Toro","Mat\u00edas",""],["Tanter","\u00c9ric",""]]}
{"id":"2308.02019","submitter":"Jean-Loup Tastet","authors":"Inar Timiryasov and Jean-Loup Tastet","title":"Baby Llama: knowledge distillation from an ensemble of teachers trained\n  on a small dataset with no performance penalty","comments":"11 pages, 4 figures, 4 tables, submitted to the BabyLM Challenge\n  (CoNLL--CMCL 2023 Shared Task)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present our proposed solution to the BabyLM challenge [arXiv:2301.11796],\nwhose goal was to improve the sample efficiency of language models. We trained\nan ensemble consisting of a GPT-2 and small LLaMA models on the\ndevelopmentally-plausible, 10M-word BabyLM dataset, then distilled it into a\nsmall, 58M-parameter LLaMA model, which exceeds in performance both of its\nteachers as well as a similar model trained without distillation. This suggests\nthat distillation can not only retain the full performance of the teacher model\nwhen the latter is trained on a sufficiently small dataset; it can exceed it,\nand lead to significantly better performance than direct training.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:20:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Timiryasov","Inar",""],["Tastet","Jean-Loup",""]]}
{"id":"2308.02020","submitter":"Joachim Gwinner","authors":"Joachim Gwinner","title":"A Note on Duality in Reverse Convex Optimization","comments":"10 pages, submitted to Optimization","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this note we explore duality in reverse convex optimization with reverse\nconvex inequality constraints. While we are examining the special case of a\nfinite index set of the inequality constraints, we are primarily interested in\nthe general case of an arbitrary infinite index set with neither extra\ntopological structure nor extra measure structure.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:24:13 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gwinner","Joachim",""]]}
{"id":"2308.02021","submitter":"Bo-Qiang Ma","authors":"Ping He, Bo-Qiang Ma","title":"Comprehensive analysis on photon-electron Lorentz-violation parameter\n  plane","comments":"10 pages,3 figures, version for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large High Altitude Air Shower Observatory~(LHAASO) opens the window of\nultra-high-energy~(UHE) photon detection, broadens the path of testing basic\nphysical concept such as Lorentz symmetry, and brings possibility of potential\nhigh-energy physical phenomenon research such as photon decay and electron\ndecay. Currently, the UHE photons from LHAASO observation set strict\nconstraints on photon and electron Lorentz symmetry violation~(LV) effects. To\nobtain a global impression of the photon-electron LV parameter plane, we make a\ndetailed analysis for photon decay and electron decay. Our discussion gives the\ncorresponding decay thresholds and energy-momentum distributions in different\nLV parameter configurations. We get corresponding constraints on photon LV\nparameter, electron LV parameter and the photon-electron LV parameter plane\nfrom LHAASO observation. For the space allowed for LV effect, that is beyond\nrelativity, we also provide corresponding boundaries from LHAASO observation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:25:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["He","Ping",""],["Ma","Bo-Qiang",""]]}
{"id":"2308.02022","submitter":"Mahammed Kamruzzaman","authors":"Mahammed Kamruzzaman and Gene Louis Kim","title":"Efficient Sentiment Analysis: A Resource-Aware Evaluation of Feature\n  Extraction Techniques, Ensembling, and Deep Learning Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While reaching for NLP systems that maximize accuracy, other important\nmetrics of system performance are often overlooked. Prior models are easily\nforgotten despite their possible suitability in settings where large computing\nresources are unavailable or relatively more costly. In this paper, we perform\na broad comparative evaluation of document-level sentiment analysis models with\na focus on resource costs that are important for the feasibility of model\ndeployment and general climate consciousness. Our experiments consider\ndifferent feature extraction techniques, the effect of ensembling,\ntask-specific deep learning modeling, and domain-independent large language\nmodels (LLMs). We find that while a fine-tuned LLM achieves the best accuracy,\nsome alternate configurations provide huge (up to 24, 283 *) resource savings\nfor a marginal (<1%) loss in accuracy. Furthermore, we find that for smaller\ndatasets, the differences in accuracy shrink while the difference in resource\nconsumption grows further.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:29:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kamruzzaman","Mahammed",""],["Kim","Gene Louis",""]]}
{"id":"2308.02023","submitter":"Michael Hedges","authors":"Belle II Collaboration: I. Adachi, K. Adamczyk, L. Aggarwal, H.\n  Aihara, N. Akopov, A. Aloisio, N. Anh Ky, D. M. Asner, H. Atmacan, T. Aushev,\n  V. Aushev, M. Aversano, V. Babu, H. Bae, S. Bahinipati, P. Bambade, Sw.\n  Banerjee, M. Barrett, J. Baudot, M. Bauer, A. Baur, A. Beaubien, F. Becherer,\n  J. Becker, P. K. Behera, J. V. Bennett, F. U. Bernlochner, V. Bertacchi, M.\n  Bertemes, E. Bertholet, M. Bessner, S. Bettarini, B. Bhuyan, F. Bianchi, T.\n  Bilka, D. Biswas, A. Bobrov, D. Bodrov, A. Bolz, A. Bondar, J. Borah, A.\n  Bozek, M. Bra\\v{c}ko, P. Branchini, R. A. Briere, T. E. Browder, A. Budano,\n  S. Bussino, M. Campajola, L. Cao, G. Casarosa, C. Cecchi, J. Cerasoli, M.-C.\n  Chang, P. Chang, R. Cheaib, P. Cheema, V. Chekelian, B. G. Cheon, K.\n  Chilikin, K. Chirapatpimol, H.-E. Cho, K. Cho, S.-K. Choi, S. Choudhury, J.\n  Cochran, L. Corona, L. M. Cremaldi, S. Das, F. Dattola, E. De La Cruz-Burelo,\n  S. A. De La Motte, G. De Nardo, M. De Nuccio, G. De Pietro, R. de Sangro, M.\n  Destefanis, S. Dey, R. Dhamija, A. Di Canto, F. Di Capua, J. Dingfelder, Z.\n  Dole\\v{z}al, I. Dom\\'inguez Jim\\'enez, T. V. Dong, M. Dorigo, K. Dort, D.\n  Dossett, S. Dreyer, S. Dubey, G. Dujany, P. Ecker, M. Eliachevitch, D.\n  Epifanov, P. Feichtinger, T. Ferber, D. Ferlewicz, T. Fillinger, C. Finck, G.\n  Finocchiaro, A. Fodor, F. Forti, A. Frey, B. G. Fulsom, A. Gabrielli, E.\n  Ganiev, M. Garcia-Hernandez, R. Garg, A. Garmash, G. Gaudino, V. Gaur, A.\n  Gaz, A. Gellrich, G. Ghevondyan, D. Ghosh, H. Ghumaryan, G. Giakoustidis, R.\n  Giordano, A. Giri, B. Gobbo, R. Godang, O. Gogota, P. Goldenzweig, W. Gradl,\n  S. Granderath, E. Graziani, D. Greenwald, Z. Gruberov\\'a, T. Gu, Y. Guan, K.\n  Gudkova, S. Halder, Y. Han, T. Hara, K. Hayasaka, H. Hayashii, S. Hazra, C.\n  Hearty, M. T. Hedges, A. Heidelbach, I. Heredia de la Cruz, M. Hern\\'andez\n  Villanueva, A. Hershenhorn, T. Higuchi, E. C. Hill, M. Hoek, M. Hohmann, P.\n  Horak, C.-L. Hsu, T. Iijima, K. Inami, G. Inguglia, N. Ipsita, A. Ishikawa,\n  S. Ito, R. Itoh, M. Iwasaki, P. Jackson, W. W. Jacobs, E.-J. Jang, Q. P. Ji,\n  S. Jia, Y. Jin, A. Johnson, H. Junkerkalefeld, A. B. Kaliyar, J. Kandra, K.\n  H. Kang, G. Karyan, T. Kawasaki, F. Keil, C. Ketter, C. Kiesling, C.-H. Kim,\n  D. Y. Kim, K.-H. Kim, Y.-K. Kim, H. Kindo, K. Kinoshita, P. Kody\\v{s}, T.\n  Koga, S. Kohani, K. Kojima, T. Konno, A. Korobov, S. Korpar, E. Kovalenko, R.\n  Kowalewski, T. M. G. Kraetzschmar, P. Kri\\v{z}an, P. Krokovny, T. Kuhr, J.\n  Kumar, M. Kumar, K. Kumara, T. Kunigo, A. Kuzmin, Y.-J. Kwon, S. Lacaprara,\n  Y.-T. Lai, T. Lam, L. Lanceri, J. S. Lange, M. Laurenza, R. Leboucher, F. R.\n  Le Diberder, P. Leitl, D. Levit, P. M. Lewis, C. Li, L. K. Li, Y. Li, J.\n  Libby, Q. Y. Liu, Z. Q. Liu, D. Liventsev, S. Longo, T. Lueck, T. Luo, C.\n  Lyu, Y. Ma, M. Maggiora, S. P. Maharana, R. Maiti, S. Maity, G. Mancinelli,\n  R. Manfredi, E. Manoni, A. C. Manthei, M. Mantovano, D. Marcantonio, S.\n  Marcello, C. Marinas, L. Martel, C. Martellini, A. Martini, T. Martinov, L.\n  Massaccesi, M. Masuda, T. Matsuda, D. Matvienko, S. K. Maurya, J. A. McKenna,\n  R. Mehta, F. Meier, M. Merola, F. Metzner, M. Milesi, C. Miller, M. Mirra, K.\n  Miyabayashi, G. B. Mohanty, N. Molina-Gonzalez, S. Mondal, S. Moneta, H.-G.\n  Moser, M. Mrvar, R. Mussa, I. Nakamura, Y. Nakazawa, A. Narimani Charan, M.\n  Naruki, Z. Natkaniec, A. Natochii, L. Nayak, G. Nazaryan, N. K. Nisar, S.\n  Nishida, S. Ogawa, H. Ono, P. Oskin, F. Otani, P. Pakhlov, G. Pakhlova, A.\n  Paladino, A. Panta, E. Paoloni, S. Pardi, K. Parham, S.-H. Park, B. Paschen,\n  A. Passeri, S. Patra, S. Paul, T. K. Pedlar, I. Peruzzi, R. Peschke, R.\n  Pestotnik, F. Pham, M. Piccolo, L. E. Piilonen, P. L. M. Podesta-Lerma, T.\n  Podobnik, S. Pokharel, C. Praz, S. Prell, E. Prencipe, M. T. Prim, H. Purwar,\n  N. Rad, P. Rados, G. Raeuber, S. Raiz, M. Reif, S. Reiter, M. Remnev, I.\n  Ripp-Baudot, G. Rizzo, S. H. Robertson, M. Roehrken, J. M. Roney, A.\n  Rostomyan, N. Rout, G. Russo, D. Sahoo, S. Sandilya, A. Sangal, L. Santelj,\n  Y. Sato, V. Savinov, B. Scavino, C. Schmitt, M. Schnepf, C. Schwanda, Y.\n  Seino, A. Selce, K. Senyo, J. Serrano, M. E. Sevior, C. Sfienti, W. Shan, C.\n  Sharma, C. P. Shen, X. D. Shi, T. Shillington, J.-G. Shiu, D. Shtol, B.\n  Shwartz, A. Sibidanov, F. Simon, J. B. Singh, J. Skorupa, R. J. Sobie, M.\n  Sobotzik, A. Soffer, A. Sokolov, E. Solovieva, S. Spataro, B. Spruck, M.\n  Stari\\v{c}, P. Stavroulakis, S. Stefkova, Z. S. Stottler, R. Stroili, J.\n  Strube, M. Sumihama, K. Sumisawa, W. Sutcliffe, H. Svidras, M. Takahashi, M.\n  Takizawa, U. Tamponi, K. Tanida, F. Tenchini, A. Thaller, O. Tittel, R.\n  Tiwary, D. Tonelli, E. Torassa, N. Toutounji, K. Trabelsi, I. Tsaklidis, M.\n  Uchida, I. Ueda, Y. Uematsu, T. Uglov, K. Unger, Y. Unno, K. Uno, S. Uno, P.\n  Urquijo, Y. Ushiroda, S. E. Vahsen, R. van Tonder, G. S. Varner, K. E.\n  Varvell, M. Veronesi, V. S. Vismaya, L. Vitale, V. Vobbilisetti, R. Volpe, B.\n  Wach, E. Waheed, M. Wakai, S. Wallner, E. Wang, M.-Z. Wang, Z. Wang, A.\n  Warburton, M. Watanabe, S. Watanuki, M. Welsch, C. Wessel, X. P. Xu, B. D.\n  Yabsley, S. Yamada, W. Yan, S. B. Yang, J. H. Yin, K. Yoshihara, C. Z. Yuan,\n  L. Zani, Y. Zhang, V. Zhilich, J. S. Zhou, Q. D. Zhou, V. I. Zhukova, R.\n  \\v{Z}leb\\v{c}\\'ik","title":"Tests of light-lepton universality in angular asymmetries of $B^0 \\to\n  D^{*-} \\ell \\nu$ decays","comments":null,"journal-ref":null,"doi":null,"report-no":"Belle II Preprint 2023-013, KEK Preprint 2023-18","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first comprehensive tests of light-lepton universality in the\nangular distributions of semileptonic $B^0$-meson decays to charged spin-1\ncharmed mesons. We measure five angular-asymmetry observables as functions of\nthe decay recoil that are sensitive to lepton-universality-violating\ncontributions. We use events where one neutral \\B is fully reconstructed in\n$\\Upsilon\\left(4S\\right)\\to{}B \\overline{B}$ decays in data corresponding to\n$189~\\mathrm{fb}^{-1}$ integrated luminosity from electron-positron collisions\ncollected with the Belle II detector. We find no significant deviation from the\nstandard model expectations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:29:58 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 16:35:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Belle II Collaboration","",""],["Adachi","I.",""],["Adamczyk","K.",""],["Aggarwal","L.",""],["Aihara","H.",""],["Akopov","N.",""],["Aloisio","A.",""],["Ky","N. Anh",""],["Asner","D. M.",""],["Atmacan","H.",""],["Aushev","T.",""],["Aushev","V.",""],["Aversano","M.",""],["Babu","V.",""],["Bae","H.",""],["Bahinipati","S.",""],["Bambade","P.",""],["Banerjee","Sw.",""],["Barrett","M.",""],["Baudot","J.",""],["Bauer","M.",""],["Baur","A.",""],["Beaubien","A.",""],["Becherer","F.",""],["Becker","J.",""],["Behera","P. K.",""],["Bennett","J. V.",""],["Bernlochner","F. U.",""],["Bertacchi","V.",""],["Bertemes","M.",""],["Bertholet","E.",""],["Bessner","M.",""],["Bettarini","S.",""],["Bhuyan","B.",""],["Bianchi","F.",""],["Bilka","T.",""],["Biswas","D.",""],["Bobrov","A.",""],["Bodrov","D.",""],["Bolz","A.",""],["Bondar","A.",""],["Borah","J.",""],["Bozek","A.",""],["Bra\u010dko","M.",""],["Branchini","P.",""],["Briere","R. A.",""],["Browder","T. E.",""],["Budano","A.",""],["Bussino","S.",""],["Campajola","M.",""],["Cao","L.",""],["Casarosa","G.",""],["Cecchi","C.",""],["Cerasoli","J.",""],["Chang","M. -C.",""],["Chang","P.",""],["Cheaib","R.",""],["Cheema","P.",""],["Chekelian","V.",""],["Cheon","B. G.",""],["Chilikin","K.",""],["Chirapatpimol","K.",""],["Cho","H. -E.",""],["Cho","K.",""],["Choi","S. -K.",""],["Choudhury","S.",""],["Cochran","J.",""],["Corona","L.",""],["Cremaldi","L. M.",""],["Das","S.",""],["Dattola","F.",""],["De La Cruz-Burelo","E.",""],["De La Motte","S. A.",""],["De Nardo","G.",""],["De Nuccio","M.",""],["De Pietro","G.",""],["de Sangro","R.",""],["Destefanis","M.",""],["Dey","S.",""],["Dhamija","R.",""],["Di Canto","A.",""],["Di Capua","F.",""],["Dingfelder","J.",""],["Dole\u017eal","Z.",""],["Jim\u00e9nez","I. Dom\u00ednguez",""],["Dong","T. V.",""],["Dorigo","M.",""],["Dort","K.",""],["Dossett","D.",""],["Dreyer","S.",""],["Dubey","S.",""],["Dujany","G.",""],["Ecker","P.",""],["Eliachevitch","M.",""],["Epifanov","D.",""],["Feichtinger","P.",""],["Ferber","T.",""],["Ferlewicz","D.",""],["Fillinger","T.",""],["Finck","C.",""],["Finocchiaro","G.",""],["Fodor","A.",""],["Forti","F.",""],["Frey","A.",""],["Fulsom","B. G.",""],["Gabrielli","A.",""],["Ganiev","E.",""],["Garcia-Hernandez","M.",""],["Garg","R.",""],["Garmash","A.",""],["Gaudino","G.",""],["Gaur","V.",""],["Gaz","A.",""],["Gellrich","A.",""],["Ghevondyan","G.",""],["Ghosh","D.",""],["Ghumaryan","H.",""],["Giakoustidis","G.",""],["Giordano","R.",""],["Giri","A.",""],["Gobbo","B.",""],["Godang","R.",""],["Gogota","O.",""],["Goldenzweig","P.",""],["Gradl","W.",""],["Granderath","S.",""],["Graziani","E.",""],["Greenwald","D.",""],["Gruberov\u00e1","Z.",""],["Gu","T.",""],["Guan","Y.",""],["Gudkova","K.",""],["Halder","S.",""],["Han","Y.",""],["Hara","T.",""],["Hayasaka","K.",""],["Hayashii","H.",""],["Hazra","S.",""],["Hearty","C.",""],["Hedges","M. T.",""],["Heidelbach","A.",""],["de la Cruz","I. Heredia",""],["Villanueva","M. Hern\u00e1ndez",""],["Hershenhorn","A.",""],["Higuchi","T.",""],["Hill","E. C.",""],["Hoek","M.",""],["Hohmann","M.",""],["Horak","P.",""],["Hsu","C. -L.",""],["Iijima","T.",""],["Inami","K.",""],["Inguglia","G.",""],["Ipsita","N.",""],["Ishikawa","A.",""],["Ito","S.",""],["Itoh","R.",""],["Iwasaki","M.",""],["Jackson","P.",""],["Jacobs","W. W.",""],["Jang","E. -J.",""],["Ji","Q. P.",""],["Jia","S.",""],["Jin","Y.",""],["Johnson","A.",""],["Junkerkalefeld","H.",""],["Kaliyar","A. B.",""],["Kandra","J.",""],["Kang","K. H.",""],["Karyan","G.",""],["Kawasaki","T.",""],["Keil","F.",""],["Ketter","C.",""],["Kiesling","C.",""],["Kim","C. -H.",""],["Kim","D. Y.",""],["Kim","K. -H.",""],["Kim","Y. -K.",""],["Kindo","H.",""],["Kinoshita","K.",""],["Kody\u0161","P.",""],["Koga","T.",""],["Kohani","S.",""],["Kojima","K.",""],["Konno","T.",""],["Korobov","A.",""],["Korpar","S.",""],["Kovalenko","E.",""],["Kowalewski","R.",""],["Kraetzschmar","T. M. G.",""],["Kri\u017ean","P.",""],["Krokovny","P.",""],["Kuhr","T.",""],["Kumar","J.",""],["Kumar","M.",""],["Kumara","K.",""],["Kunigo","T.",""],["Kuzmin","A.",""],["Kwon","Y. -J.",""],["Lacaprara","S.",""],["Lai","Y. -T.",""],["Lam","T.",""],["Lanceri","L.",""],["Lange","J. S.",""],["Laurenza","M.",""],["Leboucher","R.",""],["Diberder","F. R. Le",""],["Leitl","P.",""],["Levit","D.",""],["Lewis","P. M.",""],["Li","C.",""],["Li","L. K.",""],["Li","Y.",""],["Libby","J.",""],["Liu","Q. Y.",""],["Liu","Z. Q.",""],["Liventsev","D.",""],["Longo","S.",""],["Lueck","T.",""],["Luo","T.",""],["Lyu","C.",""],["Ma","Y.",""],["Maggiora","M.",""],["Maharana","S. P.",""],["Maiti","R.",""],["Maity","S.",""],["Mancinelli","G.",""],["Manfredi","R.",""],["Manoni","E.",""],["Manthei","A. C.",""],["Mantovano","M.",""],["Marcantonio","D.",""],["Marcello","S.",""],["Marinas","C.",""],["Martel","L.",""],["Martellini","C.",""],["Martini","A.",""],["Martinov","T.",""],["Massaccesi","L.",""],["Masuda","M.",""],["Matsuda","T.",""],["Matvienko","D.",""],["Maurya","S. K.",""],["McKenna","J. A.",""],["Mehta","R.",""],["Meier","F.",""],["Merola","M.",""],["Metzner","F.",""],["Milesi","M.",""],["Miller","C.",""],["Mirra","M.",""],["Miyabayashi","K.",""],["Mohanty","G. B.",""],["Molina-Gonzalez","N.",""],["Mondal","S.",""],["Moneta","S.",""],["Moser","H. -G.",""],["Mrvar","M.",""],["Mussa","R.",""],["Nakamura","I.",""],["Nakazawa","Y.",""],["Charan","A. Narimani",""],["Naruki","M.",""],["Natkaniec","Z.",""],["Natochii","A.",""],["Nayak","L.",""],["Nazaryan","G.",""],["Nisar","N. K.",""],["Nishida","S.",""],["Ogawa","S.",""],["Ono","H.",""],["Oskin","P.",""],["Otani","F.",""],["Pakhlov","P.",""],["Pakhlova","G.",""],["Paladino","A.",""],["Panta","A.",""],["Paoloni","E.",""],["Pardi","S.",""],["Parham","K.",""],["Park","S. -H.",""],["Paschen","B.",""],["Passeri","A.",""],["Patra","S.",""],["Paul","S.",""],["Pedlar","T. K.",""],["Peruzzi","I.",""],["Peschke","R.",""],["Pestotnik","R.",""],["Pham","F.",""],["Piccolo","M.",""],["Piilonen","L. E.",""],["Podesta-Lerma","P. L. M.",""],["Podobnik","T.",""],["Pokharel","S.",""],["Praz","C.",""],["Prell","S.",""],["Prencipe","E.",""],["Prim","M. T.",""],["Purwar","H.",""],["Rad","N.",""],["Rados","P.",""],["Raeuber","G.",""],["Raiz","S.",""],["Reif","M.",""],["Reiter","S.",""],["Remnev","M.",""],["Ripp-Baudot","I.",""],["Rizzo","G.",""],["Robertson","S. H.",""],["Roehrken","M.",""],["Roney","J. M.",""],["Rostomyan","A.",""],["Rout","N.",""],["Russo","G.",""],["Sahoo","D.",""],["Sandilya","S.",""],["Sangal","A.",""],["Santelj","L.",""],["Sato","Y.",""],["Savinov","V.",""],["Scavino","B.",""],["Schmitt","C.",""],["Schnepf","M.",""],["Schwanda","C.",""],["Seino","Y.",""],["Selce","A.",""],["Senyo","K.",""],["Serrano","J.",""],["Sevior","M. E.",""],["Sfienti","C.",""],["Shan","W.",""],["Sharma","C.",""],["Shen","C. P.",""],["Shi","X. D.",""],["Shillington","T.",""],["Shiu","J. -G.",""],["Shtol","D.",""],["Shwartz","B.",""],["Sibidanov","A.",""],["Simon","F.",""],["Singh","J. B.",""],["Skorupa","J.",""],["Sobie","R. J.",""],["Sobotzik","M.",""],["Soffer","A.",""],["Sokolov","A.",""],["Solovieva","E.",""],["Spataro","S.",""],["Spruck","B.",""],["Stari\u010d","M.",""],["Stavroulakis","P.",""],["Stefkova","S.",""],["Stottler","Z. S.",""],["Stroili","R.",""],["Strube","J.",""],["Sumihama","M.",""],["Sumisawa","K.",""],["Sutcliffe","W.",""],["Svidras","H.",""],["Takahashi","M.",""],["Takizawa","M.",""],["Tamponi","U.",""],["Tanida","K.",""],["Tenchini","F.",""],["Thaller","A.",""],["Tittel","O.",""],["Tiwary","R.",""],["Tonelli","D.",""],["Torassa","E.",""],["Toutounji","N.",""],["Trabelsi","K.",""],["Tsaklidis","I.",""],["Uchida","M.",""],["Ueda","I.",""],["Uematsu","Y.",""],["Uglov","T.",""],["Unger","K.",""],["Unno","Y.",""],["Uno","K.",""],["Uno","S.",""],["Urquijo","P.",""],["Ushiroda","Y.",""],["Vahsen","S. E.",""],["van Tonder","R.",""],["Varner","G. S.",""],["Varvell","K. E.",""],["Veronesi","M.",""],["Vismaya","V. S.",""],["Vitale","L.",""],["Vobbilisetti","V.",""],["Volpe","R.",""],["Wach","B.",""],["Waheed","E.",""],["Wakai","M.",""],["Wallner","S.",""],["Wang","E.",""],["Wang","M. -Z.",""],["Wang","Z.",""],["Warburton","A.",""],["Watanabe","M.",""],["Watanuki","S.",""],["Welsch","M.",""],["Wessel","C.",""],["Xu","X. P.",""],["Yabsley","B. D.",""],["Yamada","S.",""],["Yan","W.",""],["Yang","S. B.",""],["Yin","J. H.",""],["Yoshihara","K.",""],["Yuan","C. Z.",""],["Zani","L.",""],["Zhang","Y.",""],["Zhilich","V.",""],["Zhou","J. S.",""],["Zhou","Q. D.",""],["Zhukova","V. I.",""],["\u017dleb\u010d\u00edk","R.",""]]}
{"id":"2308.02024","submitter":"Cheng Wang","authors":"Sourjya Roy, Cheng Wang, and Anand Raghunathan","title":"Evaluation of STT-MRAM as a Scratchpad for Training in ML Accelerators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Progress in artificial intelligence and machine learning over the past decade\nhas been driven by the ability to train larger deep neural networks (DNNs),\nleading to a compute demand that far exceeds the growth in hardware performance\nafforded by Moore's law. Training DNNs is an extremely memory-intensive\nprocess, requiring not just the model weights but also activations and\ngradients for an entire minibatch to be stored. The need to provide\nhigh-density and low-leakage on-chip memory motivates the exploration of\nemerging non-volatile memory for training accelerators. Spin-Transfer-Torque\nMRAM (STT-MRAM) offers several desirable properties for training accelerators,\nincluding 3-4x higher density than SRAM, significantly reduced leakage power,\nhigh endurance and reasonable access time. On the one hand, MRAM write\noperations require high write energy and latency due to the need to ensure\nreliable switching.\n  In this study, we perform a comprehensive device-to-system evaluation and\nco-optimization of STT-MRAM for efficient ML training accelerator design. We\ndevised a cross-layer simulation framework to evaluate the effectiveness of\nSTT-MRAM as a scratchpad replacing SRAM in a systolic-array-based DNN\naccelerator. To address the inefficiency of writes in STT-MRAM, we propose to\nreduce write voltage and duration. To evaluate the ensuing accuracy-efficiency\ntrade-off, we conduct a thorough analysis of the error tolerance of input\nactivations, weights, and errors during the training. We propose heterogeneous\nmemory configurations that enable training convergence with good accuracy. We\nshow that MRAM provide up to 15-22x improvement in system level energy across a\nsuite of DNN benchmarks under iso-capacity and iso-area scenarios. Further\noptimizing STT-MRAM write operations can provide over 2x improvement in write\nenergy for minimal degradation in application-level training accuracy.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:36:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Roy","Sourjya",""],["Wang","Cheng",""],["Raghunathan","Anand",""]]}
{"id":"2308.02026","submitter":"Zahra Mosleh","authors":"Zahra Mosleh, Mojtaba Alaei","title":"A Benchmark of Density Functional Theory on the Prediction of\n  Antiferromagnetic Transition Temperature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study investigates the predictive capabilities of common DFT methods\n(GGA, GGA+$U$, and GGA+$U$+$V$) for determining the transition temperature of\nantiferromagnetic insulators. We utilize a dataset of 29 compounds and derive\nHeisenberg exchanges based on DFT total energies of different magnetic\nconfigurations. To obtain exchange parameters within a supercell, we have\ndevised an innovative method that utilizes null space analysis to identify and\naddress the limitations imposed by the supercell on these exchange parameters.\nWith obtained exchanges, we construct Heisenberg Hamiltonian to compute\nTransition temperatures using classical Monte Carlo simulations. To refine the\ncalculations, we apply linear response theory to compute on-site ($U$) and\nintersite ($V$) corrections through a self-consistent process. Our findings\nreveal that GGA significantly overestimates the transition temperature (by\n~113%), while GGA+$U$ underestimates it (by ~53%). To improve GGA+$U$ results,\nwe propose adjusting the DFT results with the $(S+1)/S$ coefficient to\ncompensate for quantum effects in Monte Carlo simulation, resulting in a\nreduced error of 44%. Additionally, we discover a high Pearson correlation\ncoefficient of approximately 0.92 between the transition temperatures\ncalculated using the GGA+$U$ method and the experimentally determined\ntransition temperatures. Furthermore, we explore the impact of geometry\noptimization on a subset of samples. Using consistent structures with GGA+U and\nGGA+U+V theories reduced the error.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:40:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mosleh","Zahra",""],["Alaei","Mojtaba",""]]}
{"id":"2308.02027","submitter":"Mohsen Gholami","authors":"Mohsen Gholami, Mohammad Akbari, Xinglu Wang, Behnam Kamranian, Yong\n  Zhang","title":"ETran: Energy-Based Transferability Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the problem of ranking pre-trained models for object\ndetection and image classification. Selecting the best pre-trained model by\nfine-tuning is an expensive and time-consuming task. Previous works have\nproposed transferability estimation based on features extracted by the\npre-trained models. We argue that quantifying whether the target dataset is\nin-distribution (IND) or out-of-distribution (OOD) for the pre-trained model is\nan important factor in the transferability estimation. To this end, we propose\nETran, an energy-based transferability assessment metric, which includes three\nscores: 1) energy score, 2) classification score, and 3) regression score. We\nuse energy-based models to determine whether the target dataset is OOD or IND\nfor the pre-trained model. In contrast to the prior works, ETran is applicable\nto a wide range of tasks including classification, regression, and object\ndetection (classification+regression). This is the first work that proposes\ntransferability estimation for object detection task. Our extensive experiments\non four benchmarks and two tasks show that ETran outperforms previous works on\nobject detection and classification benchmarks by an average of 21% and 12%,\nrespectively, and achieves SOTA in transferability assessment.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:41:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gholami","Mohsen",""],["Akbari","Mohammad",""],["Wang","Xinglu",""],["Kamranian","Behnam",""],["Zhang","Yong",""]]}
{"id":"2308.02028","submitter":"John Wu","authors":"Phani Datta Velicheti, John F. Wu, Andreea Petric","title":"Quantifying Roman WFI Dark Images with the Wavelet Scattering Transform","comments":"14 pages, 4 figures, accepted to PASP","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Nancy Grace Roman Space Telescope will survey a large area of the sky at\nnear-infrared wavelengths with its Wide Field Instrument (WFI). The performance\nof the 18 WFI H4RG-10 detectors will need to be well-characterized and\nregularly monitored in order for Roman to meet its science objectives. Weak\nlensing science goals are particularly sensitive to instrumental distortions\nand patterns that might masquerade as astronomical signals. We apply the\nwavelet scattering transform in order to analyze localized signals in Roman WFI\nimages that have been taken as part of a dark image test suite. The scattering\ntransform quantifies shapes and clustering information by reducing images into\nnon-linear combinations of wavelet modes on multiple size scales. We show that\nthese interpretable scattering statistics can separate rare correlated patterns\nfrom typical noise signals, and we discuss the results in context of power\nspectrum analyses and other computer vision methods.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:44:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Velicheti","Phani Datta",""],["Wu","John F.",""],["Petric","Andreea",""]]}
{"id":"2308.02029","submitter":"Hemn Abdalla","authors":"Hemn Barzan Abdalla, Awder Ahmed, Guoquan Li, Nasser Mustafa, Abdur\n  Rashid Sangi","title":"Deep Maxout Network-based Feature Fusion and Political Tangent Search\n  Optimizer enabled Transfer Learning for Thalassemia Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thalassemia is a heritable blood disorder which is the outcome of a genetic\ndefect causing lack of production of hemoglobin polypeptide chains. However,\nthere is less understanding of the precise frequency as well as sharing in\nthese areas. Knowing about the frequency of thalassemia occurrence and\ndependable mutations is thus a significant step in preventing, controlling, and\ntreatment planning. Here, Political Tangent Search Optimizer based Transfer\nLearning (PTSO_TL) is introduced for thalassemia detection. Initially, input\ndata obtained from a particular dataset is normalized in the data normalization\nstage. Quantile normalization is utilized in the data normalization stage, and\nthe data are then passed to the feature fusion phase, in which Weighted\nEuclidean Distance with Deep Maxout Network (DMN) is utilized. Thereafter, data\naugmentation is performed using the oversampling method to increase data\ndimensionality. Lastly, thalassemia detection is carried out by TL, wherein a\nconvolutional neural network (CNN) is utilized with hyperparameters from a\ntrained model such as Xception. TL is tuned by PTSO, and the training algorithm\nPTSO is presented by merging of Political Optimizer (PO) and Tangent Search\nAlgorithm (TSA). Furthermore, PTSO_TL obtained maximal precision, recall, and\nf-measure values of about 94.3%, 96.1%, and 95.2%, respectively.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:45:11 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 16:36:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Abdalla","Hemn Barzan",""],["Ahmed","Awder",""],["Li","Guoquan",""],["Mustafa","Nasser",""],["Sangi","Abdur Rashid",""]]}
{"id":"2308.02036","submitter":"Daniel Verscharen","authors":"Xingyu Zhu (PKU, UCL/MSSL) and Daniel Verscharen (UCL/MSSL) and\n  Jiansen He (PKU) and Bennett A. Maruca (U Delaware) and Christopher J. Owen\n  (UCL/MSSL)","title":"Regulation of Proton-$\\alpha$ Differential Flow by Compressive\n  Fluctuations and Ion-scale Instabilities in the Solar Wind","comments":"13 pages, 9 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph astro-ph.SR physics.geo-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale compressive slow-mode-like fluctuations can cause variations in\nthe density, temperature, and magnetic-field magnitude in the solar wind. In\naddition, they also lead to fluctuations in the differential flow $U_{\\rm\np\\alpha}$ between $\\alpha$-particles and protons ($p$), which is a common\nsource of free energy for the driving of ion-scale instabilities. If the\namplitude of the compressive fluctuations is sufficiently large, the\nfluctuating $U_{\\rm p\\alpha}$ intermittently drives the plasma across the\ninstability threshold, leading to the excitation of ion-scale instabilities and\nthus the growth of corresponding ion-scale waves. The unstable waves scatter\nparticles and reduce the average value of $U_{\\rm p\\alpha}$. We propose that\nthis \"fluctuating-beam effect\" maintains the average value of $U_{\\rm p\\alpha}$\nwell below the marginal instability threshold. We model the large-scale\ncompressive fluctuations in the solar wind as long-wavelength slow-mode waves\nusing a multi-fluid model. We numerically quantify the fluctuating-beam effect\nfor the Alfv\\'en/ion-cyclotron (A/IC) and fast-magnetosonic/whistler (FM/W)\ninstabilities. We show that measurements of the proton-$\\alpha$ differential\nflow and compressive fluctuations from the {\\it Wind} spacecraft are consistent\nwith our predictions for the fluctuating-beam effect. This effect creates a new\nchannel for a direct cross-scale energy transfer from large-scale compressions\nto ion-scale fluctuations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:49:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhu","Xingyu","","PKU, UCL/MSSL"],["Verscharen","Daniel","","UCL/MSSL"],["He","Jiansen","","PKU"],["Maruca","Bennett A.","","U Delaware"],["Owen","Christopher J.","","UCL/MSSL"]]}
{"id":"2308.02040","submitter":"Ngo Nghi Truyen Huynh","authors":"Ngo Nghi Truyen Huynh (INRAE), Pierre-Andr\\'e Garambois (INRAE),\n  Fran\\c{c}ois Colleoni (INRAE), Benjamin Renard (INRAE), H\\'el\\`ene Roux\n  (IMFT), Julie Demargne (HYDRIS), Pierre Javelle (INRAE)","title":"Learning Regionalization within a Differentiable High-Resolution\n  Hydrological Model using Accurate Spatial Cost Gradients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Estimating spatially distributed hydrological parameters in ungauged\ncatchments poses a challenging regionalization problem and requires imposing\nspatial constraints given the sparsity of discharge data. A possible approach\nis to search for a transfer function that quantitatively relates physical\ndescriptors to conceptual model parameters. This paper introduces a Hybrid Data\nAssimilation and Parameter Regionalization (HDA-PR) approach incorporating\nlearnable regionalization mappings, based on either multivariate regressions or\nneural networks, into a differentiable hydrological model. It enables the\nexploitation of heterogeneous datasets across extensive spatio-temporal\ncomputational domains within a high-dimensional regionalization context, using\naccurate adjoint-based gradients. The inverse problem is tackled with a\nmulti-gauge calibration cost function accounting for information from multiple\nobservation sites. HDA-PR was tested on high-resolution, hourly and kilometric\nregional modeling of two flash-flood-prone areas located in the South of\nFrance. In both study areas, the median Nash-Sutcliffe efficiency (NSE) scores\nranged from 0.52 to 0.78 at pseudo-ungauged sites over calibration and\nvalidation periods. These results highlight a strong regionalization\nperformance of HDA-PR, improving NSE by up to 0.57 compared to the baseline\nmodel calibrated with lumped parameters, and achieving a performance comparable\nto the reference solution obtained with local uniform calibration (median NSE\nfrom 0.59 to 0.79). Multiple evaluation metrics based on flood-oriented\nhydrological signatures are also employed to assess the accuracy and robustness\nof the approach. The regionalization method is amenable to state-parameter\ncorrection from multi-source data over a range of time scales needed for\noperational data assimilation, and it is adaptable to other differentiable\ngeophysical models.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:23:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Huynh","Ngo Nghi Truyen","","INRAE"],["Garambois","Pierre-Andr\u00e9","","INRAE"],["Colleoni","Fran\u00e7ois","","INRAE"],["Renard","Benjamin","","INRAE"],["Roux","H\u00e9l\u00e8ne","","IMFT"],["Demargne","Julie","","HYDRIS"],["Javelle","Pierre","","INRAE"]]}
{"id":"2308.02043","submitter":"Zulqarnain Rashid Dr","authors":"Zulqarnain Rashid, Amos A Folarin, Yatharth Ranjan, Pauline Conde,\n  Heet Sankesara, Yuezhou Zhang, Shaoxiong Sun, Callum Stewart, Petroula Laiou,\n  Richard JB Dobson","title":"Disease Insight through Digital Biomarkers Developed by Remotely\n  Collected Wearables and Smartphone Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Digital Biomarkers and remote patient monitoring can provide valuable and\ntimely insights into how a patient is coping with their condition (disease\nprogression, treatment response, etc.), complementing treatment in traditional\nhealthcare settings.Smartphones with embedded and connected sensors have\nimmense potential for improving healthcare through various apps and mHealth\n(mobile health) platforms. This capability could enable the development of\nreliable digital biomarkers from long-term longitudinal data collected remotely\nfrom patients. We built an open-source platform, RADAR-base, to support\nlarge-scale data collection in remote monitoring studies. RADAR-base is a\nmodern remote data collection platform built around Confluent's Apache Kafka,\nto support scalability, extensibility, security, privacy and quality of data.\nIt provides support for study design and set-up, active (eg PROMs) and passive\n(eg. phone sensors, wearable devices and IoT) remote data collection\ncapabilities with feature generation (eg. behavioural, environmental and\nphysiological markers). The backend enables secure data transmission, and\nscalable solutions for data storage, management and data access. The platform\nhas successfully collected longitudinal data for various cohorts in a number of\ndisease areas including Multiple Sclerosis, Depression, Epilepsy, ADHD,\nAlzheimer, Autism and Lung diseases. Digital biomarkers developed through\ncollected data are providing useful insights into different diseases.\nRADAR-base provides a modern open-source, community-driven solution for remote\nmonitoring, data collection, and digital phenotyping of physical and mental\nhealth diseases. Clinicians can use digital biomarkers to augment their\ndecision making for the prevention, personalisation and early intervention of\ndisease.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:44:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Rashid","Zulqarnain",""],["Folarin","Amos A",""],["Ranjan","Yatharth",""],["Conde","Pauline",""],["Sankesara","Heet",""],["Zhang","Yuezhou",""],["Sun","Shaoxiong",""],["Stewart","Callum",""],["Laiou","Petroula",""],["Dobson","Richard JB",""]]}
{"id":"2308.02046","submitter":"Alexey Nekrasov","authors":"Alexey Nekrasov, Alexander Hermans, Lars Kuhnert, Bastian Leibe","title":"UGainS: Uncertainty Guided Anomaly Instance Segmentation","comments":"Accepted for publication at GCPR 2023; Project page at\n  https://vision.rwth-aachen.de/ugains","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A single unexpected object on the road can cause an accident or may lead to\ninjuries. To prevent this, we need a reliable mechanism for finding anomalous\nobjects on the road. This task, called anomaly segmentation, can be a stepping\nstone to safe and reliable autonomous driving. Current approaches tackle\nanomaly segmentation by assigning an anomaly score to each pixel and by\ngrouping anomalous regions using simple heuristics. However, pixel grouping is\na limiting factor when it comes to evaluating the segmentation performance of\nindividual anomalous objects. To address the issue of grouping multiple anomaly\ninstances into one, we propose an approach that produces accurate anomaly\ninstance masks. Our approach centers on an out-of-distribution segmentation\nmodel for identifying uncertain regions and a strong generalist segmentation\nmodel for anomaly instances segmentation. We investigate ways to use uncertain\nregions to guide such a segmentation model to perform segmentation of anomalous\ninstances. By incorporating strong object priors from a generalist model we\nadditionally improve the per-pixel anomaly segmentation performance. Our\napproach outperforms current pixel-level anomaly segmentation methods,\nachieving an AP of 80.08% and 88.98% on the Fishyscapes Lost and Found and the\nRoadAnomaly validation sets respectively. Project page:\nhttps://vision.rwth-aachen.de/ugains\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:55:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Nekrasov","Alexey",""],["Hermans","Alexander",""],["Kuhnert","Lars",""],["Leibe","Bastian",""]]}
{"id":"2308.02048","submitter":"Sergey Cherkis","authors":"Sergey A. Cherkis, Andr\\'es Larra\\'in-Hubach, Mark Stern","title":"Instantons on multi-Taub-NUT Spaces III: Down Transform, Completeness,\n  and Isometry","comments":"51 page, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG hep-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The index bundle of a family of Dirac operators associated to an instanton on\na multi-Taub-NUT space forms a bow representation. We prove that the gauge\nequivalence classes of solutions of this bow representation are in one-to-one\ncorrespondence with the instantons.\n  We also prove that this correspondence establishes an isometry of the bow and\ninstanton moduli spaces.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:00:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cherkis","Sergey A.",""],["Larra\u00edn-Hubach","Andr\u00e9s",""],["Stern","Mark",""]]}
{"id":"2308.02049","submitter":"Ralf Wunderlich","authors":"Abdelali Gabih and Ralf Wunderlich","title":"Portfolio Optimization in a Market with Hidden Gaussian Drift and\n  Randomly Arriving Expert Opinions: Modeling and Theoretical Results","comments":"29 pages. arXiv admin note: text overlap with arXiv:2301.06847","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates the optimal selection of portfolios for power utility\nmaximizing investors in a financial market where stock returns depend on a\nhidden Gaussian mean reverting drift process. Information on the drift is\nobtained from returns and expert opinions in the form of noisy signals about\nthe current state of the drift arriving randomly over time. The arrival dates\nare modeled as the jump times of a homogeneous Poisson process. Applying Kalman\nfilter techniques we derive estimates of the hidden drift which are described\nby the conditional mean and covariance of the drift given the observations. The\nutility maximization problem is solved with dynamic programming methods. We\nderive the associated dynamic programming equation and study regularization\narguments for a rigorous mathematical justification.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:01:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gabih","Abdelali",""],["Wunderlich","Ralf",""]]}
{"id":"2308.02050","submitter":"Morteza Fayazi","authors":"Morteza Fayazi, Morteza Tavakoli Taba, Amirata Tabatabavakili, Ehsan\n  Afshari, Ronald Dreslinski","title":"FuNToM: Functional Modeling of RF Circuits Using a Neural Network\n  Assisted Two-Port Analysis Method","comments":"8 pages, 13 figures, 8 tables, accepted on International Conference\n  on Computer-Aided Design (ICCAD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic synthesis of analog and Radio Frequency (RF) circuits is a trending\napproach that requires an efficient circuit modeling method. This is due to the\nexpensive cost of running a large number of simulations at each synthesis\ncycle. Artificial intelligence methods are promising approaches for circuit\nmodeling due to their speed and relative accuracy. However, existing approaches\nrequire a large amount of training data, which is still collected using\nsimulation runs. In addition, such approaches collect a whole separate dataset\nfor each circuit topology even if a single element is added or removed. These\nmatters are only exacerbated by the need for post-layout modeling simulations,\nwhich take even longer. To alleviate these drawbacks, in this paper, we present\nFuNToM, a functional modeling method for RF circuits. FuNToM leverages the\ntwo-port analysis method for modeling multiple topologies using a single main\ndataset and multiple small datasets. It also leverages neural networks which\nhave shown promising results in predicting the behavior of circuits. Our\nresults show that for multiple RF circuits, in comparison to the\nstate-of-the-art works, while maintaining the same accuracy, the required\ntraining data is reduced by 2.8x - 10.9x. In addition, FuNToM needs 176.8x -\n188.6x less time for collecting the training set in post-layout modeling.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:08:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fayazi","Morteza",""],["Taba","Morteza Tavakoli",""],["Tabatabavakili","Amirata",""],["Afshari","Ehsan",""],["Dreslinski","Ronald",""]]}
{"id":"2308.02051","submitter":"Jilin Wang","authors":"Jilin Wang, Michael Krumdick, Baojia Tong, Hamima Halim, Maxim\n  Sokolov, Vadym Barda, Delphine Vendryes, and Chris Tanner","title":"A Graphical Approach to Document Layout Analysis","comments":"ICDAR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Document layout analysis (DLA) is the task of detecting the distinct,\nsemantic content within a document and correctly classifying these items into\nan appropriate category (e.g., text, title, figure). DLA pipelines enable users\nto convert documents into structured machine-readable formats that can then be\nused for many useful downstream tasks. Most existing state-of-the-art (SOTA)\nDLA models represent documents as images, discarding the rich metadata\navailable in electronically generated PDFs. Directly leveraging this metadata,\nwe represent each PDF page as a structured graph and frame the DLA problem as a\ngraph segmentation and classification problem. We introduce the Graph-based\nLayout Analysis Model (GLAM), a lightweight graph neural network competitive\nwith SOTA models on two challenging DLA datasets - while being an order of\nmagnitude smaller than existing models. In particular, the 4-million parameter\nGLAM model outperforms the leading 140M+ parameter computer vision-based model\non 5 of the 11 classes on the DocLayNet dataset. A simple ensemble of these two\nmodels achieves a new state-of-the-art on DocLayNet, increasing mAP from 76.8\nto 80.8. Overall, GLAM is over 5 times more efficient than SOTA models, making\nGLAM a favorable engineering choice for DLA tasks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:09:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Jilin",""],["Krumdick","Michael",""],["Tong","Baojia",""],["Halim","Hamima",""],["Sokolov","Maxim",""],["Barda","Vadym",""],["Vendryes","Delphine",""],["Tanner","Chris",""]]}
{"id":"2308.02052","submitter":"Zachary D'Aquino","authors":"Zachary D'Aquino, Sylwester Arabas, Jeffrey Curtis, Akshunna Vaishnav,\n  Nicole Riemer, and Matthew West","title":"PyPartMC: A Pythonic interface to a particle-resolved, Monte Carlo\n  aerosol simulation framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  PyPartMC is a Pythonic interface to PartMC, a stochastic, particle-resolved\naerosol model implemented in Fortran. Both PyPartMC and PartMC are free, libre,\nand open-source. PyPartMC reduces the number of steps and mitigates the effort\nnecessary to install and utilize the resources of PartMC. Without PyPartMC,\nsetting up PartMC requires: working with UNIX shell, providing Fortran and C\nlibraries, and performing standard Fortran and C source code configuration,\ncompilation and linking. This can be challenging for those less experienced\nwith computational research or those intending to use PartMC in environments\nwhere provision of UNIX tools is less straightforward (e.g., on Windows).\nPyPartMC offers a single-step installation/upgrade process of PartMC and all\ndependencies through the pip Python package manager on Linux, macOS, and\nWindows. This allows streamlined access to the unmodified and versioned Fortran\ninternals of the PartMC codebase from both Python and other interoperable\nenvironments (e.g., Julia through PyCall). Consequently, users of PyPartMC can\nsetup, run, process and visualize output of PartMC simulations using a single\ngeneral-purpose programming language.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:10:44 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 21:01:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["D'Aquino","Zachary",""],["Arabas","Sylwester",""],["Curtis","Jeffrey",""],["Vaishnav","Akshunna",""],["Riemer","Nicole",""],["West","Matthew",""]]}
{"id":"2308.02053","submitter":"Abel Salinas","authors":"Abel Salinas, Parth Vipul Shah, Yuzhong Huang, Robert McCormack, Fred\n  Morstatter","title":"The Unequal Opportunities of Large Language Models: Revealing\n  Demographic Bias through Job Recommendations","comments":"Accepted to EAAMO 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have seen widespread deployment in various\nreal-world applications. Understanding these biases is crucial to comprehend\nthe potential downstream consequences when using LLMs to make decisions,\nparticularly for historically disadvantaged groups. In this work, we propose a\nsimple method for analyzing and comparing demographic bias in LLMs, through the\nlens of job recommendations. We demonstrate the effectiveness of our method by\nmeasuring intersectional biases within ChatGPT and LLaMA, two cutting-edge\nLLMs. Our experiments primarily focus on uncovering gender identity and\nnationality bias; however, our method can be extended to examine biases\nassociated with any intersection of demographic identities. We identify\ndistinct biases in both models toward various demographic identities, such as\nboth models consistently suggesting low-paying jobs for Mexican workers or\npreferring to recommend secretarial roles to women. Our study highlights the\nimportance of measuring the bias of LLMs in downstream applications to\nunderstand the potential for harm and inequitable outcomes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:12:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Salinas","Abel",""],["Shah","Parth Vipul",""],["Huang","Yuzhong",""],["McCormack","Robert",""],["Morstatter","Fred",""]]}
{"id":"2308.02054","submitter":"Bal\\'azs Csan\\'ad Cs\\'aji","authors":"Ambrus Tam\\'as, D\\'aniel \\'Agoston B\\'alint, Bal\\'azs Csan\\'ad Cs\\'aji","title":"Robust Independence Tests with Finite Sample Guarantees for Synchronous\n  Stochastic Linear Systems","comments":null,"journal-ref":"IEEE Control Systems Letters, Volume 7, 2023, pp. 2701-2706","doi":"10.1109/LCSYS.2023.3287797","report-no":null,"categories":"stat.ML cs.LG math.DS stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The paper introduces robust independence tests with non-asymptotically\nguaranteed significance levels for stochastic linear time-invariant systems,\nassuming that the observed outputs are synchronous, which means that the\nsystems are driven by jointly i.i.d. noises. Our method provides bounds for the\ntype I error probabilities that are distribution-free, i.e., the innovations\ncan have arbitrary distributions. The algorithm combines confidence region\nestimates with permutation tests and general dependence measures, such as the\nHilbert-Schmidt independence criterion and the distance covariance, to detect\nany nonlinear dependence between the observed systems. We also prove the\nconsistency of our hypothesis tests under mild assumptions and demonstrate the\nideas through the example of autoregressive systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:13:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tam\u00e1s","Ambrus",""],["B\u00e1lint","D\u00e1niel \u00c1goston",""],["Cs\u00e1ji","Bal\u00e1zs Csan\u00e1d",""]]}
{"id":"2308.02055","submitter":"Prateek Verma","authors":"Prateek Verma, Shan Zhong, Xiaoyu Liu and Adithya Rajan","title":"Seasonality Based Reranking of E-commerce Autocomplete Using Natural\n  Language Queries","comments":"Accepted at The 6th Workshop on e-Commerce and NLP (ECNLP 6), KDD'23,\n  Long Beach, CA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Query autocomplete (QAC) also known as typeahead, suggests list of complete\nqueries as user types prefix in the search box. It is one of the key features\nof modern search engines specially in e-commerce. One of the goals of typeahead\nis to suggest relevant queries to users which are seasonally important. In this\npaper we propose a neural network based natural language processing (NLP)\nalgorithm to incorporate seasonality as a signal and present end to end\nevaluation of the QAC ranking model. Incorporating seasonality into\nautocomplete ranking model can improve autocomplete relevance and business\nmetric.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:14:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Verma","Prateek",""],["Zhong","Shan",""],["Liu","Xiaoyu",""],["Rajan","Adithya",""]]}
{"id":"2308.02056","submitter":"Matthew Bohman","authors":"Matthew A. Bohman, Sergey G. Porsev, David B. Hume, David R.\n  Leibrandt, Marianna S. Safronova","title":"Enhancing Divalent Optical Atomic Clocks with the\n  $^{1}\\mathrm{S}_0$$\\leftrightarrow$$^{3}\\mathrm{P}_{2}$ Transition","comments":"14 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Divalent atoms and ions with a singlet $S$ ground state and triplet $P$\nexcited state form the basis of many high-precision optical atomic clocks.\nAlong with the metastable $^{3}\\mathrm{P}_{0}$ clock state, these atomic\nsystems also have a nearby metastable $^{3}\\mathrm{P}_{2}$ state. We\ninvestigate the properties of the electric quadrupole\n$^{1}\\mathrm{S}_0$$\\leftrightarrow$$^{3}\\mathrm{P}_{2}$ transition with a focus\non enhancing already existing optical atomic clocks. In particular, we\ninvestigate the $^{1}\\mathrm{S}_0$$\\leftrightarrow$$^{3}\\mathrm{P}_{2}$\ntransition in $^{27}\\mathrm{Al}^{+}$ and calculate the differential\npolarizability, hyperfine effects, and other relevant atomic properties. We\nalso discuss potential applications of this transition, notably that it\nprovides two transitions with different sensitivities to systematic effects in\nthe same species. In addition, we describe how the\n$^{1}\\mathrm{S}_0$$\\leftrightarrow$$^{3}\\mathrm{P}_{2}$ transition can be used\nto search for physics beyond the Standard Model and motivate investigation of\nthis transition in other existing optical atomic clocks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:31:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bohman","Matthew A.",""],["Porsev","Sergey G.",""],["Hume","David B.",""],["Leibrandt","David R.",""],["Safronova","Marianna S.",""]]}
{"id":"2308.02057","submitter":"Joshua M. Sabloff","authors":"Joshua M. Sabloff, David Shea Vela-Vick, C.-M. Michael Wong, Angela Wu","title":"Lagrangian Zigzag Cobordisms","comments":"32 pages, 13 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate an equivalence relation on Legendrian knots in the standard\ncontact three-space defined by the existence of an interpolating zigzag of\nLagrangian cobordisms. We compare this relation, restricted to genus-$0$\nsurfaces, to smooth concordance and Lagrangian concordance. We then study the\nmetric monoid formed by the set of Lagrangian zigzag concordance classes, which\nparallels the metric group formed by the set of smooth concordance classes,\nproving structural results on torsion and satellite operators. Finally, we\ndiscuss the relation of Lagrangian zigzag cobordism to non-classical invariants\nof Legendrian knots.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:33:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sabloff","Joshua M.",""],["Vela-Vick","David Shea",""],["Wong","C. -M. Michael",""],["Wu","Angela",""]]}
{"id":"2308.02058","submitter":"\\'Angel Gonz\\'alez-Prieto Dr.","authors":"Diego P\\'erez-L\\'opez, Fernando Ortega, \\'Angel Gonz\\'alez-Prieto,\n  Jorge Due\\~nas-Ler\\'in","title":"Incorporating Recklessness to Collaborative Filtering based Recommender\n  Systems","comments":"15 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender systems that include some reliability measure of their\npredictions tend to be more conservative in forecasting, due to their\nconstraint to preserve reliability. This leads to a significant drop in the\ncoverage and novelty that these systems can provide. In this paper, we propose\nthe inclusion of a new term in the learning process of matrix\nfactorization-based recommender systems, called recklessness, which enables the\ncontrol of the risk level desired when making decisions about the reliability\nof a prediction. Experimental results demonstrate that recklessness not only\nallows for risk regulation but also improves the quantity and quality of\npredictions provided by the recommender system.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:34:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["P\u00e9rez-L\u00f3pez","Diego",""],["Ortega","Fernando",""],["Gonz\u00e1lez-Prieto","\u00c1ngel",""],["Due\u00f1as-Ler\u00edn","Jorge",""]]}
{"id":"2308.02059","submitter":"Rigoberto Florez","authors":"Rigoberto Fl\\'orez, Jos\\'e L. Ram\\'irez, Fabio A. Velandia, and Diego\n  Villamizar","title":"Some Connections Between Restricted Dyck Paths, Polyominoes, and\n  Non-Crossing Partitions","comments":"This paper has been accepter for publication in Proceedings of the\n  52nd Southeastern International Conference on Combinatorics, Graph Theory,\n  and Computing","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A \\emph{Dyck path} is a lattice path in the first quadrant of the $xy$-plane\nthat starts at the origin, ends on the $x$-axis, and consists of the same\nnumber of North-East steps $U$ and South-East steps $D$. A \\emph{valley} is a\nsubpath of the form $DU$. A Dyck path is called \\emph{restricted $d$-Dyck} if\nthe difference between any two consecutive valleys is at least $d$ (right-hand\nside minus left-hand side) or if it has at most one valley. In this paper we\ngive some connections between restricted $d$-Dyck paths and both, the\nnon-crossing partitions of $[n]$ and some subfamilies of polyominoes. We also\ngive generating functions to count several aspects of these combinatorial\nobjects.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:46:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fl\u00f3rez","Rigoberto",""],["Ram\u00edrez","Jos\u00e9 L.",""],["Velandia","Fabio A.",""],["Villamizar","Diego",""]]}
{"id":"2308.02060","submitter":"Eugenia Iofinova","authors":"Denis Kuznedelev, Eldar Kurtic, Eugenia Iofinova, Elias Frantar,\n  Alexandra Peste, Dan Alistarh","title":"Accurate Neural Network Pruning Requires Rethinking Sparse Optimization","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":"  Obtaining versions of deep neural networks that are both highly-accurate and\nhighly-sparse is one of the main challenges in the area of model compression,\nand several high-performance pruning techniques have been investigated by the\ncommunity. Yet, much less is known about the interaction between sparsity and\nthe standard stochastic optimization techniques used for training sparse\nnetworks, and most existing work uses standard dense schedules and\nhyperparameters for training sparse networks. In this work, we examine the\nimpact of high sparsity on model training using the standard computer vision\nand natural language processing sparsity benchmarks. We begin by showing that\nusing standard dense training recipes for sparse training is suboptimal, and\nresults in under-training. We provide new approaches for mitigating this issue\nfor both sparse pre-training of vision models (e.g. ResNet50/ImageNet) and\nsparse fine-tuning of language models (e.g. BERT/GLUE), achieving\nstate-of-the-art results in both settings in the high-sparsity regime, and\nproviding detailed analyses for the difficulty of sparse training in both\nscenarios. Our work sets a new threshold in terms of the accuracies that can be\nachieved under high sparsity, and should inspire further research into\nimproving sparse model training, to reach higher accuracies under high\nsparsity, but also to do so efficiently.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:49:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kuznedelev","Denis",""],["Kurtic","Eldar",""],["Iofinova","Eugenia",""],["Frantar","Elias",""],["Peste","Alexandra",""],["Alistarh","Dan",""]]}
{"id":"2308.02061","submitter":"Ayush Khaitan","authors":"Ayush Khaitan","title":"The weighted ambient metric and the singular Ricci flow","comments":"41 pages. arXiv admin note: text overlap with arXiv:0710.0919 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the existence and uniqueness of a weighted analogue of the\nFefferman-Graham ambient metric for manifolds with density. We then show that\nthis ambient metric forms the natural geometric framework for the singular\nRicci flow: given a singular gradient Ricci flow spacetime in the Kleiner-Lott\nsense, we construct a unique global ambient half-space from it. We also prove\nthe converse, that every global ambient space contains a singular gradient\nRicci flow spacetime, thereby completing the correspondence. Our main\napplication is the construction of infinite families of fully non-linear\nanalogues of Perelman's $\\mathcal{F}$ and $\\mathcal{W}$ functionals. We extend\nPerelman's monotonicity result to these two families of functionals under\nseveral conditions, including for shrinking solitons and Einstein manifolds. We\ndo so by constructing a \"Ricci flow vector field\" in the ambient space, which\nmay be of independent research interest. We also prove that the weighted GJMS\noperators associated with the weighted ambient metric are formally\nself-adjoint, and that the associated weighted renormalized volume coefficients\nare variational.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:52:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Khaitan","Ayush",""]]}
{"id":"2308.02062","submitter":"Alessandro Fontanella","authors":"Alessandro Fontanella, Grant Mair, Joanna Wardlaw, Emanuele Trucco,\n  Amos Storkey","title":"Diffusion Models for Counterfactual Generation and Anomaly Detection in\n  Brain Images","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Segmentation masks of pathological areas are useful in many medical\napplications, such as brain tumour and stroke management. Moreover, healthy\ncounterfactuals of diseased images can be used to enhance radiologists'\ntraining files and to improve the interpretability of segmentation models. In\nthis work, we present a weakly supervised method to generate a healthy version\nof a diseased image and then use it to obtain a pixel-wise anomaly map. To do\nso, we start by considering a saliency map that approximately covers the\npathological areas, obtained with ACAT. Then, we propose a technique that\nallows to perform targeted modifications to these regions, while preserving the\nrest of the image. In particular, we employ a diffusion model trained on\nhealthy samples and combine Denoising Diffusion Probabilistic Model (DDPM) and\nDenoising Diffusion Implicit Model (DDIM) at each step of the sampling process.\nDDPM is used to modify the areas affected by a lesion within the saliency map,\nwhile DDIM guarantees reconstruction of the normal anatomy outside of it. The\ntwo parts are also fused at each timestep, to guarantee the generation of a\nsample with a coherent appearance and a seamless transition between edited and\nunedited parts. We verify that when our method is applied to healthy samples,\nthe input images are reconstructed without significant modifications. We\ncompare our approach with alternative weakly supervised methods on IST-3 for\nstroke lesion segmentation and on BraTS2021 for brain tumour segmentation,\nwhere we improve the DICE score of the best competing method from $0.6534$ to\n$0.7056$.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:56:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fontanella","Alessandro",""],["Mair","Grant",""],["Wardlaw","Joanna",""],["Trucco","Emanuele",""],["Storkey","Amos",""]]}
{"id":"2308.02063","submitter":"Daniel Davis","authors":"Daniel G. Davis","title":"A continuous $p$-adic action on the $K(2)$-local algebraic $K$-theory of\n  $p$-adic complex $K$-theory","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $p$ be a prime, let $KU_p$ be $p$-complete complex $K$-theory, and let\n$\\mathbb{Z}_p^\\times$ denote the group of units in the $p$-adic integers. The\n$p$-adic Adams operations induce an action of the profinite group\n$\\mathbb{Z}_p^\\times$ on $KU_p$, and hence, on the algebraic $K$-theory\nspectrum $K(KU_p)$. For $p \\geq 5$, we give an elementary construction of the\ncontinuous homotopy fixed point spectrum $(L_{K(2)}K(KU_p))^{hG}$, where $K(2)$\nis the second Morava $K$-theory and $G$ is any closed subgroup of\n$\\mathbb{Z}_p^\\times$. Also, for each $G$, we show that there is an associated\nstrongly convergent homotopy fixed point spectral sequence whose $E_2$-term is\ngiven by Jannsen's continuous group cohomology, with $E_2^{s,\\ast} = 0$, for\nall $s > 2$. This work is related to a conjecture of Ausoni and Rognes.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:03:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Davis","Daniel G.",""]]}
{"id":"2308.02064","submitter":"Pei-Lun Tseng","authors":"James A. Mingo (Queen's University) and Pei-Lun Tseng (New York\n  University Abu Dhabi)","title":"Infinitesimal Operators and the Distribution of Anticommutators and\n  Commutators","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In an infinitesimal probability space we consider operators which are\ninfinitesimally free and one of which is infinitesimal, in that all its moments\nvanish. Many previously analysed random matrix models are captured by this\nframework. We show that there is a simple way of finding non-commutative\ndistributions involving infinitesimal operators and apply this to the\ncommutator and anticommutator. We show the joint infinitesimal distribution of\nan operator and an infinitesimal idempotent gives us the Boolean cumulants of\nthe given operator. We also show that Boolean cumulants can be expressed as\ninfinitesimal moments thus giving matrix models which exhibit asymptotic\nBoolean independence and monotone independence.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:11:53 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 03:50:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mingo","James A.","","Queen's University"],["Tseng","Pei-Lun","","New York\n  University Abu Dhabi"]]}
{"id":"2308.02065","submitter":"Vishnu Naresh Boddeti","authors":"Vishnu Naresh Boddeti and Gautam Sreekumar and Arun Ross","title":"On the Biometric Capacity of Generative Face Models","comments":"IJCB 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":"  There has been tremendous progress in generating realistic faces with high\nfidelity over the past few years. Despite this progress, a crucial question\nremains unanswered: \"Given a generative face model, how many unique identities\ncan it generate?\" In other words, what is the biometric capacity of the\ngenerative face model? A scientific basis for answering this question will\nbenefit evaluating and comparing different generative face models and establish\nan upper bound on their scalability. This paper proposes a statistical approach\nto estimate the biometric capacity of generated face images in a hyperspherical\nfeature space. We employ our approach on multiple generative models, including\nunconditional generators like StyleGAN, Latent Diffusion Model, and \"Generated\nPhotos,\" as well as DCFace, a class-conditional generator. We also estimate\ncapacity w.r.t. demographic attributes such as gender and age. Our capacity\nestimates indicate that (a) under ArcFace representation at a false acceptance\nrate (FAR) of 0.1%, StyleGAN3 and DCFace have a capacity upper bound of\n$1.43\\times10^6$ and $1.190\\times10^4$, respectively; (b) the capacity reduces\ndrastically as we lower the desired FAR with an estimate of $1.796\\times10^4$\nand $562$ at FAR of 1% and 10%, respectively, for StyleGAN3; (c) there is no\ndiscernible disparity in the capacity w.r.t gender; and (d) for some generative\nmodels, there is an appreciable disparity in the capacity w.r.t age. Code is\navailable at https://github.com/human-analysis/capacity-generative-face-models.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:21:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Boddeti","Vishnu Naresh",""],["Sreekumar","Gautam",""],["Ross","Arun",""]]}
{"id":"2308.02066","submitter":"Vishnu Naresh Boddeti","authors":"Chuntao Ding, Zhichao Lu, Shangguang Wang, Ran Cheng and Vishnu Naresh\n  Boddeti","title":"Mitigating Task Interference in Multi-Task Learning via Explicit Task\n  Routing with Non-Learnable Primitives","comments":"CVPR 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":"  Multi-task learning (MTL) seeks to learn a single model to accomplish\nmultiple tasks by leveraging shared information among the tasks. Existing MTL\nmodels, however, have been known to suffer from negative interference among\ntasks. Efforts to mitigate task interference have focused on either\nloss/gradient balancing or implicit parameter partitioning with partial\noverlaps among the tasks. In this paper, we propose ETR-NLP to mitigate task\ninterference through a synergistic combination of non-learnable primitives\n(NLPs) and explicit task routing (ETR). Our key idea is to employ non-learnable\nprimitives to extract a diverse set of task-agnostic features and recombine\nthem into a shared branch common to all tasks and explicit task-specific\nbranches reserved for each task. The non-learnable primitives and the explicit\ndecoupling of learnable parameters into shared and task-specific ones afford\nthe flexibility needed for minimizing task interference. We evaluate the\nefficacy of ETR-NLP networks for both image-level classification and\npixel-level dense prediction MTL problems. Experimental results indicate that\nETR-NLP significantly outperforms state-of-the-art baselines with fewer\nlearnable parameters and similar FLOPs across all datasets. Code is available\nat this \\href{https://github.com/zhichao-lu/etr-nlp-mtl}.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:34:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ding","Chuntao",""],["Lu","Zhichao",""],["Wang","Shangguang",""],["Cheng","Ran",""],["Boddeti","Vishnu Naresh",""]]}
{"id":"2308.02067","submitter":"Keegan Korthauer","authors":"Giuliano N.F. Cruz and Keegan Korthauer","title":"Bayesian Decision Curve Analysis with bayesDCA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Clinical decisions are often guided by clinical prediction models or\ndiagnostic tests. Decision curve analysis (DCA) combines classical assessment\nof predictive performance with the consequences of using these strategies for\nclinical decision-making. In DCA, the best decision strategy is the one that\nmaximizes the so-called net benefit: the net number of true positives (or\nnegatives) provided by a given strategy. In this decision-analytic approach,\noften only point estimates are published. If uncertainty is reported, a\nrisk-neutral interpretation is recommended: it motivates further research\nwithout changing the conclusions based on currently-available data. However,\nwhen it comes to new decision strategies, replacing the current Standard of\nCare must be carefully considered -- prematurely implementing a suboptimal\nstrategy poses potentially irrecoverable costs. In this risk-averse setting,\nquantifying uncertainty may also inform whether the available data provides\nenough evidence to change current clinical practice. Here, we employ Bayesian\napproaches to DCA addressing four fundamental concerns when evaluating clinical\ndecision strategies: (i) which strategies are clinically useful, (ii) what is\nthe best available decision strategy, (iii) pairwise comparisons between\nstrategies, and (iv) the expected net benefit loss associated with the current\nlevel of uncertainty. While often consistent with frequentist point estimates,\nfully Bayesian DCA allows for an intuitive probabilistic interpretation\nframework and the incorporation of prior evidence. We evaluate the methods\nusing simulation and provide a comprehensive case study. Software\nimplementation is available in the bayesDCA R package. Ultimately, the Bayesian\nDCA workflow may help clinicians and health policymakers adopt better-informed\ndecisions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:36:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cruz","Giuliano N. F.",""],["Korthauer","Keegan",""]]}
{"id":"2308.02068","submitter":"Hans Hanley","authors":"Hans W. A. Hanley, Deepak Kumar, Zakir Durumeric","title":"Specious Sites: Tracking the Spread and Sway of Spurious News Stories at\n  Scale","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":"  Misinformation, propaganda, and outright lies proliferate on the web, with\nsome narratives having dangerous real-world consequences on public health,\nelections, and individual safety. However, despite the impact of\nmisinformation, the research community largely lacks automated and programmatic\napproaches for tracking news narratives across online platforms. In this work,\nutilizing daily scrapes of 1,404 unreliable news websites, the large-language\nmodel MPNet, and DP-Means clustering, we introduce a system to automatically\nisolate and analyze the narratives spread within online ecosystems. Identifying\n55,301 narratives on these 1,404 websites, we describe the most prevalent\nnarratives spread in 2022 and identify the most influential websites that\noriginate and magnify narratives. Finally, we show how our system can be\nutilized to detect new narratives originating from unreliable news websites and\naid fact-checkers like Politifact, Reuters, and AP News in more quickly\naddressing misinformation stories.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:42:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hanley","Hans W. A.",""],["Kumar","Deepak",""],["Durumeric","Zakir",""]]}
{"id":"2308.02069","submitter":"Paul Tangney","authors":"Paul Tangney","title":"Classical derivation of Bose-Einstein statistics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Without invoking quantum mechanics I prove that, at thermal equilibrium, the\nobserved distribution of energy among any set of non-interacting harmonic\noscillators is a Bose-Einstein distribution, albeit with an unknown constant,\n${h_?}$, in place of Planck's constant, $h$. I identify characteristics of the\nclassical independent-oscillator Hamiltonian that make my derivation of the\nBose-Einstein distribution possible, and I point out that other classical\nphysical systems, such as an ideal gas, have Hamiltonians that can be\ntransformed canonically into forms with these characteristics. If ${h_?=h}$,\namong the implications of this work are that (i) there is no discrepancy\nbetween the experimentally-observed spectrum of a blackbody and what should be\nexpected if light was a mechanical wave in a bounded medium; (ii) there is no\ndiscrepancy between the experimentally-observed temperature dependence of a\ncrystal's heat capacity and what should be expected of classical lattice waves;\nand (iii) when a cluster of massive particles is cold enough, the classical\nexpectation should be that almost all of its vibrational energy is possessed by\nits lowest-frequency normal mode. Therefore, below a certain temperature, all\nbut one of its degrees of freedom are almost inactive and it is a Bose-Einstein\ncondensate.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:46:11 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 17:54:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tangney","Paul",""]]}
{"id":"2308.02070","submitter":"Gokul Gopan Nair","authors":"Timothy J. Healey and Gokul G. Nair","title":"Nonlinearly Elastic Maps: Energy Minimizing Configurations of Membranes\n  on Prescribed Surfaces","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a model for nonlinearly elastic membranes and consider\ndeformations confined to a regular frictionless surface in $\\mathbb{R}^3$. This\nis a physically correct model of the sometimes crudely stated motivation for\nharmonic maps between manifolds. The membrane energy function is convex in the\nstrain pair comprising the deformation gradient and the local area ratio. If\nthe target surface is a plane, the problem reduces to 2-dimensional, polyconvex\nnonlinear elasticity. On the other hand, the energy density is not rank-one\nconvex for unconstrained deformations into $\\mathbb{R}^3$. We show that the\nproblem admits an energy-minimizing configuration when constrained to lie on\nthe given surface. For a class of Dirichlet-placement problems, we demonstrate\nthat the minimizing deformation is a homeomorphism onto its image and establish\nthe weak Eulerian form of the equilibrium equations.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:53:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Healey","Timothy J.",""],["Nair","Gokul G.",""]]}
{"id":"2308.02071","submitter":"Zsolt Regaly","authors":"Zs. Regaly, V. Frohlich, and P. Berczik","title":"Mitigating potentially hazardous asteroid impacts revisited","comments":"Accepted for publication in A&A Letters (some refs. update)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context: Potentially hazardous asteroids (PHA) in Earth-crossing orbits pose\na constant threat to life on Earth. Several mitigation methods have been\nproposed, and the most feasible technique appears to be the disintegration of\nthe impactor and the generation of a fragment cloud by explosive penetrators at\ninterception. However, mitigation analyses tend to neglect the effect of\norbital dynamics on the trajectory of fragments.\n  Aims: We aim to study the effect of orbital dynamics of the impactor's cloud\non the number of fragments that hit the Earth, assuming different interception\ndates. We investigate the effect of self-gravitational cohesion and the axial\nrotation of the impactor.\n  Methods: We computed the orbits of 10^5 fragments with a high-precision\ndirect N-body integrator of the eighth order, running on GPUs. We considered\norbital perturbations from all large bodies in the Solar System and the\nself-gravity of the cloud fragments.\n  Results: Using a series of numerical experiments, we show that orbital shear\ncauses the fragment cloud to adopt the shape of a triaxial ellipsoid. The shape\nand alignment of the triaxial ellipsoid are strongly modulated by the cloud's\norbital trajectory and, hence, the impact cross-section of the cloud with\nrespect to the Earth. Therefore, the number of fragments hitting the Earth is\nstrongly influenced by the orbit of the impactor and the time of interception.\nA minimum number of impacts occur for a well-defined orientation of the\nimpactor rotational axis, depending on the date of interception.\n  Conclusions: To minimise the lethal consequences of an PHA's impact, a\nwell-constrained interception timing is necessary. A too-early interception may\nnot be ideal for PHAs in the Apollo or Aten groups. Thus, we find that the best\ntime to intercept PHA is when it is at the pericentre of its orbit.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:56:31 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 14:09:26 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 12:23:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Regaly","Zs.",""],["Frohlich","V.",""],["Berczik","P.",""]]}
{"id":"2308.02072","submitter":"Xiaolei Zhang","authors":"Xiaolei Zhang","title":"A note on Matlis localizations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $R$ be a commutative ring and $S$ a multiplicative subset of $R$. A ring\n$R$ is called an $S$-Matlis ring if $pd_RR_S\\leq 1$. In this note, we give some\nnew characterizations of $S$-Matlis rings in terms of $S$-strongly flat\nmodules, $S$-weakly cotorsion modules and $S$-$h$-divisible modules.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:56:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Xiaolei",""]]}
{"id":"2308.02073","submitter":"Haitam Laarabi","authors":"Haitam Laarabi, Zachary Needell, Rashid Waraich, Cristian Poliziani,\n  Tom Wenzel","title":"BEAM: The Modeling Framework for Behavior, Energy, Autonomy & Mobility","comments":"47 pages, 12 figures, 6 tables, \"under review\" for publication as a\n  Lawrence Berkeley National Laboratory Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report outlines the concepts, mechanisms and inner dynamics of the BEAM\n(Behavior, Energy, Autonomy, and Mobility) modeling framework. BEAM is an\nopen-source large-scale high-resolution transportation model that harnesses the\nprinciples of the actor model of computation to build a powerful and efficient\nagent-based model of travel behavior. It allows a detailed microscopic view of\nhow people make travel choices and interact with the transportation system,\nenabling more accurate simulations of human mobility and urban transport\nnetworks. It also allows the analysis of numerous spatially defined but\ninteracting layers, and integrates them into a cohesive representation of a\nregional transportation system. This integrated picture provides invaluable\ninsights to policy makers and other stakeholders about how changes to the\ntransportation system result in changes to traffic congestion, mode share,\nenergy use, and emissions throughout a modeled region. These capabilities are\ndemonstrated with a case study of New York City that showcase BEAM's\napplication in a very large and intricate urban transportation system, without\nrelying on existing travel demand models. The unique ability of BEAM to\nsimulate individual behaviors, integrate with other models, and adapt to\ndifferent real-world scenarios underscores its importance in the rapidly\nevolving field of transportation and emphasizes its potential as a valuable\nproof-of-concept tool to contribute to more informed and effective policy and\nplanning decisions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:59:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Laarabi","Haitam",""],["Needell","Zachary",""],["Waraich","Rashid",""],["Poliziani","Cristian",""],["Wenzel","Tom",""]]}
{"id":"2308.02074","submitter":"Alexey Sharapov","authors":"Alexey Sharapov and David Shcherbatov","title":"On auxiliary fields and Lagrangians for relativistic wave equations","comments":"17 pages, v2 - minor corrections, references added","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 address the problem of the existence of a Lagrangian for a given system of\nlinear PDEs with constant coefficients. As a subtask, this involves bringing\nthe system into a pre-Lagrangian form, wherein the number of equations matches\nthe number of unknowns. We introduce a class of overdetermined systems, called\nco-flat, and show that they always admit a pre-Lagrangian form, which can be\nexplicitly constructed using auxiliary variables. Moreover, we argue that such\nsystems enjoy pre-Lagrangian formulations without auxiliary variables at all.\nAs an application of our method, we construct new pre-Lagrangian and Lagrangian\nformulations for free massive fields of arbitrary integer spin. In contrast to\nthe well-known models of Singh and Hagen, our Lagrangians involve much fewer\nauxiliary fields.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:02:57 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 23:32:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sharapov","Alexey",""],["Shcherbatov","David",""]]}
{"id":"2308.02075","submitter":"Youngtak Sohn","authors":"Evan Chang, Neel Kolhe, Youngtak Sohn","title":"Upper bounds on the $2$-colorability threshold of random $d$-regular\n  $k$-uniform hypergraphs for $k\\geq 3$","comments":"23 pages, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM math-ph math.MP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a large class of random constraint satisfaction problems (CSP), deep but\nnon-rigorous theory from statistical physics predict the location of the sharp\nsatisfiability transition. The works of Ding, Sly, Sun (2014, 2016) and\nCoja-Oghlan, Panagiotou (2014) established the satisfiability threshold for\nrandom regular $k$-NAE-SAT, random $k$-SAT, and random regular $k$-SAT for\nlarge enough $k\\geq k_0$ where $k_0$ is a large non-explicit constant.\nEstablishing the same for small values of $k\\geq 3$ remains an important open\nproblem in the study of random CSPs.\n  In this work, we study two closely related models of random CSPs, namely the\n$2$-coloring on random $d$-regular $k$-uniform hypergraphs and the random\n$d$-regular $k$-NAE-SAT model. For every $k\\geq 3$, we prove that there is an\nexplicit $d_{\\ast}(k)$ which gives a satisfiability upper bound for both of the\nmodels. Our upper bound $d_{\\ast}(k)$ for $k\\geq 3$ matches the prediction from\nstatistical physics for the hypergraph $2$-coloring by Dall'Asta, Ramezanpour,\nZecchina (2008), thus conjectured to be sharp. Moreover, $d_{\\ast}(k)$\ncoincides with the satisfiability threshold of random regular $k$-NAE-SAT for\nlarge enough $k\\geq k_0$ by Ding, Sly, Sun (2014).\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:04:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chang","Evan",""],["Kolhe","Neel",""],["Sohn","Youngtak",""]]}
{"id":"2308.02076","submitter":"Kawon Han","authors":"Kawon Han, SeongHyeon Kang, and Songcheol Hong","title":"Sub-Nyquist Sampling OFDM Radar","comments":"12 pages, 13 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":"  In this paper, we propose a sub-Nyquist sampling (SNS) orthogonal\nfrequency-division multiplexing (OFDM) radar system capable of reducing the\nanalog-to-digital converter (ADC) sampling rate in OFDM radar without any\nadditional manipulations of its hardware and waveform. To this end, the\nproposed system utilizes the ADC sampling rate of B/L to sample the received\nbaseband signal with a bandwidth of B, where L is a positive proper divisor of\nthe number of subcarriers. This divides the baseband signal into L sub-bands,\nfolding into a sub-Nyquist frequency band due to aliasing. By leveraging known\nmodulation symbols of the transmitted signal, the folded signal can be unfolded\nto the full-band signal. This allows an estimation of target ranges with the\nrange resolution of the full signal bandwidth B without the degradation of the\nmaximum unambiguous range. During the signal-unfolding process, the signals\nfrom other sub-bands remain as symbol-mismatch noise (SMN), which significantly\ndegrades the signal-to-noise ratio (SNR) of the detected targets. It also\ncauses weaker targets to be submerged under the noise in range profiles. To\nresolve this, a symbol-mismatch noise cancellation (SMNC) technique is also\nproposed, which reconstructs the interfering signals from the other sub-bands\nusing the detected targets and subtracts them from the unfolded signal. As a\nresult, the proposed sub-Nyquist sampling OFDM radar and corresponding signal\nprocessing technique enable a reduction in the ADC sampling rate by the ratio\nof L while incurring only a 10 log10 L increase in the noise due to noise\nfolding. This is validated through simulations and measurements with various\nsub-sampling ratios.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:13:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Han","Kawon",""],["Kang","SeongHyeon",""],["Hong","Songcheol",""]]}
{"id":"2308.02077","submitter":"Yuji Ito","authors":"Yuji Ito, Kenji Fujimoto, Yukihiro Tadokoro","title":"Weighted Stochastic Riccati Equations for Generalization of Linear\n  Optimal Control","comments":"This paper is submitted to a journal for possible publication. The\n  copyright of this paper may be transferred without notice, after which this\n  version may no longer be accessible","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 presents weighted stochastic Riccati (WSR) equations for designing\nmultiple types of optimal controllers for linear stochastic systems. The\nstochastic system matrices are independent and identically distributed (i.i.d.)\nto represent uncertainty and noise in the systems. However, it is difficult to\ndesign multiple types of controllers for systems with i.i.d. matrices while the\nstochasticity can invoke unpredictable control results. A critical limitation\nof such i.i.d. systems is that Riccati-like algebraic equations cannot be\napplied to complex controller design. To overcome this limitation, the proposed\nWSR equations employ a weighted expectation of stochastic algebraic equations.\nThe weighted expectation is calculated using a weight function designed to\nhandle statistical properties of the control policy. Solutions to the WSR\nequations provide multiple policies depending on the weight function, which\ncontain the deterministic optimal, stochastic optimal, and risk-sensitive\nlinear (RSL) control. This study presents two approaches to solve the WSR\nequations efficiently: calculating WSR difference equations iteratively and\nemploying Newton's method. Moreover, designing the weight function yields a\nnovel controller termed the robust RSL controller that has both a\nrisk-sensitive policy and robustness to randomness occurring in stochastic\ncontrol design.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:16:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ito","Yuji",""],["Fujimoto","Kenji",""],["Tadokoro","Yukihiro",""]]}
{"id":"2308.02078","submitter":"Robert Fulsche","authors":"Robert Fulsche, Niklas Galke","title":"Quantum Harmonic Analysis on locally compact abelian groups","comments":"Added Proposition 2.16, minor improvements","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the notions of quantum harmonic analysis, as introduced in [48], to\nabelian phase spaces, by which we mean a locally compact abelian group endowed\nwith a Heisenberg multiplier. In this way, we obtain a joint harmonic analysis\nof functions and operators for each such phase space. For all this, we spend\nsignificant extra effort to include also phase spaces which are not second\ncountable. We obtain most results from [48] for these general phase spaces, up\nto Wiener's approximation theorem for operators. As an addition, we extend\ncertain of those results (most notably Wiener's approximation theorem) to\noperators acting on certain coorbit spaces affiliated with the phase space.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:21:23 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 11:05:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Fulsche","Robert",""],["Galke","Niklas",""]]}
{"id":"2308.02079","submitter":"Andreas Bengtsson","authors":"Andreas Bengtsson, Alex Opremcak, Mostafa Khezri, Daniel Sank,\n  Alexandre Bourassa, Kevin J. Satzinger, Sabrina Hong, Catherine Erickson,\n  Brian J. Lester, Kevin C. Miao, Alexander N. Korotkov, Julian Kelly, Zijun\n  Chen, Paul V. Klimov","title":"Model-based Optimization of Superconducting Qubit Readout","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measurement is an essential component of quantum algorithms, and for\nsuperconducting qubits it is often the most error prone. Here, we demonstrate\nmodel-based readout optimization achieving low measurement errors while\navoiding detrimental side-effects. For simultaneous and mid-circuit\nmeasurements across 17 qubits, we observe 1.5% error per qubit with a 500ns\nend-to-end duration and minimal excess reset error from residual resonator\nphotons. We also suppress measurement-induced state transitions achieving a\nleakage rate limited by natural heating. This technique can scale to hundreds\nof qubits and be used to enhance the performance of error-correcting codes and\nnear-term applications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:30:56 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bengtsson","Andreas",""],["Opremcak","Alex",""],["Khezri","Mostafa",""],["Sank","Daniel",""],["Bourassa","Alexandre",""],["Satzinger","Kevin J.",""],["Hong","Sabrina",""],["Erickson","Catherine",""],["Lester","Brian J.",""],["Miao","Kevin C.",""],["Korotkov","Alexander N.",""],["Kelly","Julian",""],["Chen","Zijun",""],["Klimov","Paul V.",""]]}
{"id":"2308.02080","submitter":"Paras Sheth","authors":"Paras Sheth, Tharindu Kumarage, Raha Moraffah, Aman Chadha, Huan Liu","title":"Causality Guided Disentanglement for Cross-Platform Hate Speech\n  Detection","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":"  Social media platforms, despite their value in promoting open discourse, are\noften exploited to spread harmful content. Current deep learning and natural\nlanguage processing models used for detecting this harmful content overly rely\non domain-specific terms affecting their capabilities to adapt to generalizable\nhate speech detection. This is because they tend to focus too narrowly on\nparticular linguistic signals or the use of certain categories of words.\nAnother significant challenge arises when platforms lack high-quality annotated\ndata for training, leading to a need for cross-platform models that can adapt\nto different distribution shifts. Our research introduces a cross-platform hate\nspeech detection model capable of being trained on one platform's data and\ngeneralizing to multiple unseen platforms. To achieve good generalizability\nacross platforms, one way is to disentangle the input representations into\ninvariant and platform-dependent features. We also argue that learning causal\nrelationships, which remain constant across diverse environments, can\nsignificantly aid in understanding invariant representations in hate speech. By\ndisentangling input into platform-dependent features (useful for predicting\nhate targets) and platform-independent features (used to predict the presence\nof hate), we learn invariant representations resistant to distribution shifts.\nThese features are then used to predict hate speech across unseen platforms.\nOur extensive experiments across four platforms highlight our model's enhanced\nefficacy compared to existing state-of-the-art methods in detecting generalized\nhate speech.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:39:03 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 18:32:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sheth","Paras",""],["Kumarage","Tharindu",""],["Moraffah","Raha",""],["Chadha","Aman",""],["Liu","Huan",""]]}
{"id":"2308.02081","submitter":"Eran Tal","authors":"Eran Tal","title":"Target specification bias, counterfactual prediction, and algorithmic\n  fairness in healthcare","comments":"Proceedings of the 2023 AAAI/ACM Conference on AI, Ethics, and\n  Society (AIES23)","journal-ref":null,"doi":"10.1145/3600211.3604678","report-no":null,"categories":"cs.LG cs.CY stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bias in applications of machine learning (ML) to healthcare is usually\nattributed to unrepresentative or incomplete data, or to underlying health\ndisparities. This article identifies a more pervasive source of bias that\naffects the clinical utility of ML-enabled prediction tools: target\nspecification bias. Target specification bias arises when the\noperationalization of the target variable does not match its definition by\ndecision makers. The mismatch is often subtle, and stems from the fact that\ndecision makers are typically interested in predicting the outcomes of\ncounterfactual, rather than actual, healthcare scenarios. Target specification\nbias persists independently of data limitations and health disparities. When\nleft uncorrected, it gives rise to an overestimation of predictive accuracy, to\ninefficient utilization of medical resources, and to suboptimal decisions that\ncan harm patients. Recent work in metrology - the science of measurement -\nsuggests ways of counteracting target specification bias and avoiding its\nharmful consequences.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:43:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tal","Eran",""]]}
{"id":"2308.02082","submitter":"Anthony Sanchez","authors":"Xun Gong, Anthony Sanchez","title":"An arithmetic Kontsevich--Zorich monodromy of a symmetric origami in\n  genus 4","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.GR math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate the existence of a certain genus four origami whose\nKontsevich--Zorich monodromy is arithmetic in the sense of Sarnak. The surface\nis interesting because its Veech group is as large as possible and given by\n$\\mathrm{SL}(2,\\mathbb Z)$. When compared to other surfaces with Veech group\n$\\mathrm{SL}(2,\\mathbb Z)$ such as the Eierlegendre Wollmichsau and the\nOrnithorynque, an arithmetic Kontsevich--Zorich monodromy is surprising and\nindicates that there is little relationship between the Veech group and\nmonodromy group of origamis. Additionally, we record the index and congruence\nlevel in the ambient symplectic group which gives data on what can appear in\ngenus 4.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:46:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gong","Xun",""],["Sanchez","Anthony",""]]}
{"id":"2308.02083","submitter":"Jacob Goeree","authors":"Jacob K Goeree and Bernardo Garcia-Pola","title":"A Non-Parametric Test of Risk Aversion","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":"  In economics, risk aversion is modeled via a concave Bernoulli utility within\nthe expected-utility paradigm. We propose a simple test of expected utility and\nconcavity. We find little support for either: only 30 percent of the choices\nare consistent with a concave utility, only two out of 72 subjects are\nconsistent with expected utility, and only one of them fits the economic model\nof risk aversion. Our findings contrast with the preponderance of seemingly\n\"risk-averse\" choices that have been elicited using the popular multiple-price\nlist methodology, a result we replicate in this paper. We demonstrate that this\nmethodology is unfit to measure risk aversion, and that the high prevalence of\nrisk aversion it produces is due to parametric misspecification.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:51:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Goeree","Jacob K",""],["Garcia-Pola","Bernardo",""]]}
{"id":"2308.02084","submitter":"Zachary Daniels","authors":"Zachary A. Daniels, Jun Hu, Michael Lomnitz, Phil Miller, Aswin\n  Raghavan, Joe Zhang, Michael Piacentino, David Zhang","title":"Efficient Model Adaptation for Continual Learning at the Edge","comments":"Under Review w/ IEEE Transactions on Artificial Intelligence","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Most machine learning (ML) systems assume stationary and matching data\ndistributions during training and deployment. This is often a false assumption.\nWhen ML models are deployed on real devices, data distributions often shift\nover time due to changes in environmental factors, sensor characteristics, and\ntask-of-interest. While it is possible to have a human-in-the-loop to monitor\nfor distribution shifts and engineer new architectures in response to these\nshifts, such a setup is not cost-effective. Instead, non-stationary automated\nML (AutoML) models are needed. This paper presents the\nEncoder-Adaptor-Reconfigurator (EAR) framework for efficient continual learning\nunder domain shifts. The EAR framework uses a fixed deep neural network (DNN)\nfeature encoder and trains shallow networks on top of the encoder to handle\nnovel data. The EAR framework is capable of 1) detecting when new data is\nout-of-distribution (OOD) by combining DNNs with hyperdimensional computing\n(HDC), 2) identifying low-parameter neural adaptors to adapt the model to the\nOOD data using zero-shot neural architecture search (ZS-NAS), and 3) minimizing\ncatastrophic forgetting on previous tasks by progressively growing the neural\narchitecture as needed and dynamically routing data through the appropriate\nadaptors and reconfigurators for handling domain-incremental and\nclass-incremental continual learning. We systematically evaluate our approach\non several benchmark datasets for domain adaptation and demonstrate strong\nperformance compared to state-of-the-art algorithms for OOD detection and\nfew-/zero-shot NAS.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:55:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Daniels","Zachary A.",""],["Hu","Jun",""],["Lomnitz","Michael",""],["Miller","Phil",""],["Raghavan","Aswin",""],["Zhang","Joe",""],["Piacentino","Michael",""],["Zhang","David",""]]}
{"id":"2308.02085","submitter":"Arnab Saha","authors":"Soham Dutta, Arnab Saha","title":"Microscopic Gyration with Dissipative Coupling","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Microscopic gyrators, including Brownian gyrators (BGs), require anisotropic\nfluctuations to perform gyration. It produces a finite current, driving the\nsystem out of equilibrium. In a typical BG set-up with an isotropic colloidal\nparticle, the anisotropy sets in by the coupling among space dimensions via an\nexternally applied anisotropic potential confining the particle and the\ndifference between the temperatures along various space dimensions. The\ncoupling is conservative. Here, contrary to a typical BG, first we consider an\nover-damped, anisotropic colloidal particle (a Brownian ellipsoid), trapped in\nan isotropic harmonic potential in two dimensions (2D). The space dimensions\nare coupled by the difference between the longitudinal and transverse\nfrictional drags experienced by the ellipsoid, together with a finite tilt in\nits orientation due to its chirality. The coupling is dissipative. They are\nintrinsic properties of the particle. We have shown that this dissipative\ncoupling can generate enough anisotropic fluctuations to perform a steady-state\ngyration in the Brownian scale. Next, going beyond BG, we have considered an\ninertial, granular, chiral ellipsoid in 2D, subjected to athermal, anisotropic\nfluctuations. There is no trapping force confining the granular ellipsoid.\nHowever, the coupling between the velocity components of the granular ellipsoid\nis still dissipative. We have shown that being assisted by the dissipative\ncoupling and the anisotropic fluctuations, the inertial, granular ellipsoid can\nalso perform gyration in 2D. We have also shown that the dominant contribution\ntowards the gyrating frequency can be attributed to the Coriolis force acting\non the granular ellipsoid. Hence, the gyrator in the granular scale is also a\ntiny autonomous machine that generates a directed motion (gyration) from\nfluctuations. Although there are fundamental differences between the two.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 23:57:43 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dutta","Soham",""],["Saha","Arnab",""]]}
{"id":"2308.02086","submitter":"Holger F. Hofmann","authors":"Holger F. Hofmann","title":"Sequential propagation of a single photon through five measurement\n  contexts in a three-path interferometer","comments":"11 pages, including 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum contextuality indicates that the outcomes of measurements must in\nsome ways depend on the measurement context. Here, I introduce a three-path\ninterferometer in which all five contexts needed for the demonstration of\ncontextuality are realized in sequence. It is then possible to observe a\nparadoxical situation where the paths connecting input ports to their\ncorresponding output ports appear to be blocked by destructive interference. It\nis shown that the conditional currents observed in weak measurements provide a\nconsistent explanation of the paradox, indicating that weak values might help\nto bridge the gap between wavelike propagation effects and local particle\ndetection.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:01:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hofmann","Holger F.",""]]}
{"id":"2308.02087","submitter":"Joao Streibel","authors":"Pawel Klimas and Jo\\~ao Saldanha Streibel","title":"The Signum-Gordon shock waves in 2+1 and 3+1 dimensions","comments":"23 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate shock wave solutions in the Signum-Gordon model with field\ndiscontinuity at the light cone. The exact solutions to this problem in the\ndimensions $2+1$ and $3+1$ are given. We show that the volume of the disk/ball\nwith radius $t$ multiplied by the value of the field discontinuity on the\nsurface of the light cone equals the energy of the solution inside the light\ncone at time $t$. In contrast to shock waves in one spatial dimension, the\nnon-homogeneous signum-Gordon equation with the Dirac's delta force supports\nsolutions in higher dimensions. We examine the degradation of the shock wave\nafter turning off the delta-force.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:02:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Klimas","Pawel",""],["Streibel","Jo\u00e3o Saldanha",""]]}
{"id":"2308.02088","submitter":"Syed Murtaza Arshad","authors":"Syed M. Arshad, Lee C. Potter, Chong Chen, Yingmin Liu, Preethi\n  Chandrasekaran, Christopher Crabtree, Yuchi Han, Rizwan Ahmad","title":"Motion-robust free-running cardiovascular MRI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  PURPOSE: To present and validate an outlier rejection method that makes\nfree-running cardiovascular MRI (CMR) more motion robust.\n  METHODS: The proposed method, called compressive recovery with outlier\nrejection (CORe), models outliers as an auxiliary variable that is added to the\nmeasured data. We enforce MR physics-guided group-sparsity on the auxiliary\nvariable and jointly estimate it along with the image using an iterative\nalgorithm. For validation, CORe is first compared to traditional compressed\nsensing (CS), robust regression (RR), and another outlier rejection method\nusing two simulation studies. Then, CORe is compared to CS using five 3D cine\nand ten rest and stress 4D flow imaging datasets.\n  RESULTS: Our simulation studies show that CORe outperforms CS, RR, and the\noutlier rejection method in terms of normalized mean squared error (NMSE) and\nstructural similarity index (SSIM) across 50 different realizations. The expert\nreader evaluation of 3D cine images demonstrates that CORe is more effective in\nsuppressing artifacts while maintaining or improving image sharpness. The flow\nconsistency evaluation in 4D flow images show that CORe yields more consistent\nflow measurements, especially under exercise stress.\n  CONCLUSION: An outlier rejection method is presented and validated using\nsimulated and measured data. This method can help suppress motion artifacts in\na wide range of free-running CMR applications.\n  CODE: MATLAB implementation code is available on GitHub at\nhttps://github.com/syedmurtazaarshad/motion-robust-CMR\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:07:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Arshad","Syed M.",""],["Potter","Lee C.",""],["Chen","Chong",""],["Liu","Yingmin",""],["Chandrasekaran","Preethi",""],["Crabtree","Christopher",""],["Han","Yuchi",""],["Ahmad","Rizwan",""]]}
{"id":"2308.02089","submitter":"Ziv Ran","authors":"Ziv Ran","title":"Polarized interpolation and normal postulation for curves on Fano\n  hypersurfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A general hypersurface $X$ of degree $\\leq n$ in projective space contains\ncurves $C$ of any genus $g\\geq 0$ and sufficiently large degree depnding on $g$\nwhose normal and conormal bundles have good postulation or natural cohomology\nin the sense that each twist has either $H^0=0$ or $H^1=0$. This implies a\npolarized version of the interpolation property for $C$ on $X$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:11:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ran","Ziv",""]]}
{"id":"2308.02090","submitter":"Nicolai Pankov Dr.","authors":"N. S. Pankov (1,2), A. S. Pozanenko (2), P. Yu. Minaev (2,3), S. O.\n  Belkin (1,2), A. A. Volnova (2), I. V. Reva (4), A. V. Serebryanskiy (4), M.\n  A. Krugov (4), S. A. Naroenkov (5), A. O. Novichonok (6), A. A. Zhornichenko\n  (6), V. V. Rumyantsev (7), K. A. Antonyuk (7), Sh. A. Egamberdiev (8), O. A.\n  Burkhonov (8), E. V. Klunko (9), A. S. Moskvitin (10), I. E. Molotov (11), R.\n  Ya. Inasaridze (12) ((1), National Research Institute \"Higher School of\n  Economics\", Moscow, Russia, (2) Space Research Institute, Russian Academy of\n  Sciences, Moscow, Russia, (3) Lebedev Physical Institute, Russian Academy of\n  Sciences, Moscow, Russia, (4) Fesenkov Astrophysical Institute, Almaty,\n  Kazakhstan, (5) Institute of Astronomy, Moscow, Russia, (6) Petrozavodsk\n  State University, Petrozavodsk, Russia, (7) Crimean Astrophysical\n  Observatory, Nauchny, Crimea, (8) Mirzo Ulug'bek nomidagi Astronomiya\n  instituti, Toshkent, O`zbekiston, (9) Institute of Solar-Terrestrial Physics,\n  Russian Academy of Sciences, Siberian Branch, Irkutsk, Russia, (10) Special\n  Astrophysical Observatory, Russian Academy of Sciences, Nizhnii Arkhyz,\n  Russia, (11) Keldysh Institute of Applied Mathematics, Moscow, Russia, (12)\n  Evgeni Kharadze Georgian National Astrophysical Observatory, Abastumani,\n  Georgia)","title":"Chromatic Afterglow of GRB 200829A","comments":"18 pages, 14 figures","journal-ref":"Astron. Lett. 49 (2023)","doi":"10.1134/S1063773723030052","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the results of our analysis of multiwavelength observations for\nthe long gamma-ray burst GRB 200829A. The burst redshift $z \\approx 1.29 \\pm\n0.04$ has been determined photometrically at the afterglow phase. In gamma rays\nthe event is one of the brightest (in isotropic equivalent), $E_{iso} \\gtrsim\n10^{54}$ erg. The multicolor light curve of the GRB 200829A afterglow is\ncharacterized by chromatic behavior and the presence of a plateau gradually\ntransitioning into a power-law decay that can also be interpreted as a\nquasi-synchronous inhomogeneity (flare). We assume that the presence of a\nchromatic inhomogeneity in the early afterglow is consistent with the model of\na structured jet.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:14:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Pankov","N. S.",""],["Pozanenko","A. S.",""],["Minaev","P. Yu.",""],["Belkin","S. O.",""],["Volnova","A. A.",""],["Reva","I. V.",""],["Serebryanskiy","A. V.",""],["Krugov","M. A.",""],["Naroenkov","S. A.",""],["Novichonok","A. O.",""],["Zhornichenko","A. A.",""],["Rumyantsev","V. V.",""],["Antonyuk","K. A.",""],["Egamberdiev","Sh. A.",""],["Burkhonov","O. A.",""],["Klunko","E. V.",""],["Moskvitin","A. S.",""],["Molotov","I. E.",""],["Inasaridze","R. Ya.",""]]}
{"id":"2308.02091","submitter":"Leonhard Grill","authors":"Donato Civita, Jutta Schwarz, Stefan Hecht, and Leonhard Grill","title":"Bond dissociation dynamics of single molecules on Ag(111)","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The breaking of a chemical bond is fundamental in most chemical reactions. To\nunderstand chemical processes in heterogeneous catalysis or on-surface\npolymerization the study of bond dissociation in molecules adsorbed on\ncrystalline surfaces is advantageous. Single molecule studies of bond breaking\ncan give details of the dissociation dynamics, which are challenging to obtain\nin mole-scale ensemble experiments. Bond breaking in single adsorbed molecules\ncan be triggered using the energy of the tunnelling electrons in a scanning\ntunnelling microscope (STM) at selected positions to investigate the\ndissociation dynamics. Single bond dissociation dynamics has been deeply\ninvestigated only in small molecules, but not in larger molecules that exhibit\ndistinct rotational degrees of freedom. Here, we use low temperature (7 K) STM\nto dissociate a single bromine atom from an elongated molecule\n(dibromo-terfluorene) adsorbed on a Ag(111) surface. This rod-like molecule\nallows to clearly identify not only displacement of the reaction fragments, but\nalso their rotation. The results show that the molecular fragment binds to the\nnearest silver atom and only further rotation is allowed. Moreover, the\nexcitation responsible for the bond breaking can propagate through the\nmolecular backbone to dissociate a bromine atom that is not located at the\npulse position. These results show the important role of the metal substrate in\nconditioning the bond dissociation dynamics. Our results might allow to improve\nthe control of the synthesis of 2D materials and targeted engineering of\nmolecular architectures.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:22:22 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Civita","Donato",""],["Schwarz","Jutta",""],["Hecht","Stefan",""],["Grill","Leonhard",""]]}
{"id":"2308.02092","submitter":"Wang Yau Li","authors":"Wang Yau Li, Shreekantha Nadig, Karol Chang, Zafarullah Mahmood,\n  Riqiang Wang, Simon Vandieken, Jonas Robertson, Fred Mailhot","title":"N-gram Boosting: Improving Contextual Biasing with Normalized N-gram\n  Targets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accurate transcription of proper names and technical terms is particularly\nimportant in speech-to-text applications for business conversations. These\nwords, which are essential to understanding the conversation, are often rare\nand therefore likely to be under-represented in text and audio training data,\ncreating a significant challenge in this domain. We present a two-step keyword\nboosting mechanism that successfully works on normalized unigrams and n-grams\nrather than just single tokens, which eliminates missing hits issues with\nboosting raw targets. In addition, we show how adjusting the boosting weight\nlogic avoids over-boosting multi-token keywords. This improves our keyword\nrecognition rate by 26% relative on our proprietary in-domain dataset and 2% on\nLibriSpeech. This method is particularly useful on targets that involve\nnon-alphabetic characters or have non-standard pronunciations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:23:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Wang Yau",""],["Nadig","Shreekantha",""],["Chang","Karol",""],["Mahmood","Zafarullah",""],["Wang","Riqiang",""],["Vandieken","Simon",""],["Robertson","Jonas",""],["Mailhot","Fred",""]]}
{"id":"2308.02093","submitter":"Genaro Su\\'arez","authors":"Genaro Suarez, Johanna M. Vos, Stanimir Metchev, Jacqueline K.\n  Faherty, Kelle Cruz","title":"Ultracool Dwarfs Observed with the Spitzer Infrared Spectrograph:\n  Equatorial Latitudes in L Dwarf Atmospheres are Cloudier","comments":"Accepted for publication in ApJL","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 report direct observational evidence for a latitudinal dependence of dust\ncloud opacity in ultracool dwarfs, indicating that equatorial latitudes are\ncloudier than polar latitudes. These results are based on a strong positive\ncorrelation between the viewing geometry and the mid-infrared silicate\nabsorption strength in mid-L dwarfs using mid-infrared spectra from the Spitzer\nSpace Telescope and spin axis inclination measurements from available\ninformation in the literature. We confirmed that the infrared color anomalies\nof L dwarfs positively correlate with dust cloud opacity and viewing geometry,\nwhere redder objects are inclined equator-on and exhibit more opaque dust\nclouds while dwarfs viewed at higher latitudes and with more transparent clouds\nare bluer. These results show the relevance of viewing geometry to explain the\nappearance of brown dwarfs and provide insight into the spectral diversity\nobserved in substellar and planetary atmospheres. We also find a hint that dust\nclouds at similar latitudes may have higher opacity in low-surface gravity\ndwarfs than in higher-gravity objects.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:25:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Suarez","Genaro",""],["Vos","Johanna M.",""],["Metchev","Stanimir",""],["Faherty","Jacqueline K.",""],["Cruz","Kelle",""]]}
{"id":"2308.02094","submitter":"Jean-Baptiste Vienney","authors":"Jean-Baptiste Vienney","title":"String diagrams for symmetric powers I: In symmetric monoidal\n  $\\mathbb{Q}_{\\ge 0}$-linear categories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Symmetric powers are an important notion in mathematics, computer science and\nphysics. In mathematics, they are used to build symmetric algebras, in computer\nscience, to build free exponential modalities of linear logic and in physics,\nFock spaces. We study symmetric powers through the lens of category theory. We\nfocus here on the simpler case where nonnegative rational scalars are available\nie. we study symmetric powers in symmetric monoidal $\\mathbb{Q}_{\\ge 0}$-linear\ncategories. Among the developments, a main point is the introduction of the\nnotion of binomial graded bimonoid and the associated string diagrams which\ncharacterize symmetric powers in this setting.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:27:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Vienney","Jean-Baptiste",""]]}
{"id":"2308.02095","submitter":"Mauricio Junca","authors":"Mauricio Junca and Harold Moreno-Franco and Jose Luis Perez","title":"An optimal multibarrier strategy for a singular stochastic control\n  problem with a state-dependent reward","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a singular control problem where the reward function depends on\nthe state of the process. The main objective of this paper is to establish\nsufficient conditions for determining the optimality of the one-barrier and\n$(2n+1)$-barrier strategies in two distinct scenarios. Firstly, when the\nuncontrolled process $X$ follows a spectrally negative L\\'evy process with a\nL\\'evy measure defined by a completely monotone density. Secondly, when $X$ is\na Brownian motion with a drift. Additionally, we provide an algorithm to\ncompute the barrier values in the latter case.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:43:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Junca","Mauricio",""],["Moreno-Franco","Harold",""],["Perez","Jose Luis",""]]}
{"id":"2308.02096","submitter":"Eric D. Feigelson","authors":"Eric D. Feigelson and Massimiliano Bonamente","title":"iid2022: A Workshop on Statistical Methods for Event Data in Astronomy","comments":"7 pages","journal-ref":"Frontiers in Astronomy and Space Sciences, 10:1228508, 2023","doi":"10.3389/fspas.2023.1228508","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We review the iid2022 workshop on statistical methods for X-ray and\n$\\gamma$-ray astronomy and high--energy astrophysics event data in astronomy,\nheld in Guntersville, AL, on Nov. 15-18 2022. New methods for faint source\ndetection, spatial point processes, variability and spectral analysis, and\nmachine learning are discussed. Ideas for future developments of advanced\nmethodology are shared.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 00:53:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Feigelson","Eric D.",""],["Bonamente","Massimiliano",""]]}
{"id":"2308.02097","submitter":"Risheng Liu","authors":"Jinyuan Liu, Zhu Liu, Guanyao Wu, Long Ma, Risheng Liu, Wei Zhong,\n  Zhongxuan Luo, Xin Fan","title":"Multi-interactive Feature Learning and a Full-time Multi-modality\n  Benchmark for Image Fusion and Segmentation","comments":"Accepted by ICCV 2023. The source code and benchmark are available at\n  https://github.com/JinyuanLiu-CV/SegMiF","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modality image fusion and segmentation play a vital role in autonomous\ndriving and robotic operation. Early efforts focus on boosting the performance\nfor only one task, \\emph{e.g.,} fusion or segmentation, making it hard to\nreach~`Best of Both Worlds'. To overcome this issue, in this paper, we propose\na \\textbf{M}ulti-\\textbf{i}nteractive \\textbf{F}eature learning architecture\nfor image fusion and \\textbf{Seg}mentation, namely SegMiF, and exploit\ndual-task correlation to promote the performance of both tasks. The SegMiF is\nof a cascade structure, containing a fusion sub-network and a commonly used\nsegmentation sub-network. By slickly bridging intermediate features between two\ncomponents, the knowledge learned from the segmentation task can effectively\nassist the fusion task. Also, the benefited fusion network supports the\nsegmentation one to perform more pretentiously. Besides, a hierarchical\ninteractive attention block is established to ensure fine-grained mapping of\nall the vital information between two tasks, so that the modality/semantic\nfeatures can be fully mutual-interactive. In addition, a dynamic weight factor\nis introduced to automatically adjust the corresponding weights of each task,\nwhich can balance the interactive feature correspondence and break through the\nlimitation of laborious tuning. Furthermore, we construct a smart multi-wave\nbinocular imaging system and collect a full-time multi-modality benchmark with\n15 annotated pixel-level categories for image fusion and segmentation.\nExtensive experiments on several public datasets and our benchmark demonstrate\nthat the proposed method outputs visually appealing fused images and perform\naveragely $7.66\\%$ higher segmentation mIoU in the real-world scene than the\nstate-of-the-art approaches. The source code and benchmark are available at\n\\url{https://github.com/JinyuanLiu-CV/SegMiF}.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:03:58 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Jinyuan",""],["Liu","Zhu",""],["Wu","Guanyao",""],["Ma","Long",""],["Liu","Risheng",""],["Zhong","Wei",""],["Luo","Zhongxuan",""],["Fan","Xin",""]]}
{"id":"2308.02098","submitter":"Thomas Barthelm\\'e","authors":"Thomas Barthelm\\'e, Sergio Fenley, Kathryn Mann","title":"Anosov flows with the same periodic orbits","comments":"24 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In [Orbit equivalences of pseudo-Anosov flows, arXiv:2211.10505], it was\nproved that transitive pseudo-Anosov flows on any closed 3-manifold are\ndetermined up to orbit equivalence by the set of free homotopy classes\nrepresented by periodic orbits, provided their orbit space does not contain a\nfeature called a ``tree of scalloped regions.\" In this article we describe what\nhappens in these exceptional cases: we show what topological features in the\nmanifold correspond to trees of scalloped regions, completely classify the\nflows which do have the same free homotopy data, and construct explicit\nexamples of flows with the same free homotopy data that are not orbit\nequivalent.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:06:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Barthelm\u00e9","Thomas",""],["Fenley","Sergio",""],["Mann","Kathryn",""]]}
{"id":"2308.02099","submitter":"Jian Li","authors":"Duo Chen, Jian Li and Rui Guo","title":"The evolution of the chiral symmetry in cesium isotopes","comments":"10 pages, 8 figures. arXiv admin note: text overlap with\n  arXiv:1706.06127 by other authors","journal-ref":"Eur. Phys. J. A (2023) 59:142","doi":"10.1140/epja/s10050-023-01059-8","report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Following the reports of candidate chiral doublet bands observed in cesium\nisotopes, the possible chiral candidates and the evolution of three-dimensional\nrotation in $^{120-134}{\\textrm{Cs}}$ are investigated within the microscopic\nthree-dimensional tilted axis cranking covariant density functional theory\n(3DTAC-CDFT). By investigating the evolution of the polar angle $\\theta$ and\nazimuth angle $\\varphi$ as a function of rotational frequency $\\hbar\\omega$,\nthe transition from the planar rotation to the chiral rotation has been found\nin $^{121-133}{\\textrm{Cs}}$. The corresponding critical rotational frequency\n$\\omega_{\\textrm{crit}}$ of the appearance of chiral aplanar rotation decreases\nas neutron number increases, which can be attributed to the neutrons in $(gd)$\nand $(sd)$ shells having smaller angular momentum components along both the\nshort and long axes, and larger components along medium axis, respectively. In\ncomparison, only planar rotation has been obtained in\n$^{120,134}{\\textrm{Cs}}$. With these interpretations, the obtained\n$I\\sim\\hbar\\omega$ and energy spectra as well as $B(M1)/B(E2)$ values show\nreasonable agreement with the available experimental data. In addition, the\nevolution of quadrupole deformation $\\beta$ and triaxial deformation $\\gamma$\nare also discussed.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:08:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Duo",""],["Li","Jian",""],["Guo","Rui",""]]}
{"id":"2308.02100","submitter":"Yiran Sun","authors":"Yiran Sun, Tucker Netherton, Laurence Court, Ashok Veeraraghavan, Guha\n  Balakrishnan","title":"CT Reconstruction from Few Planar X-rays with Application towards\n  Low-resource Radiotherapy","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CT scans are the standard-of-care for many clinical ailments, and are needed\nfor treatments like external beam radiotherapy. Unfortunately, CT scanners are\nrare in low and mid-resource settings due to their costs. Planar X-ray\nradiography units, in comparison, are far more prevalent, but can only provide\nlimited 2D observations of the 3D anatomy. In this work, we propose a method to\ngenerate CT volumes from few (<5) planar X-ray observations using a prior data\ndistribution, and perform the first evaluation of such a reconstruction\nalgorithm for a clinical application: radiotherapy planning. We propose a deep\ngenerative model, building on advances in neural implicit representations to\nsynthesize volumetric CT scans from few input planar X-ray images at different\nangles. To focus the generation task on clinically-relevant features, our model\ncan also leverage anatomical guidance during training (via segmentation masks).\nWe generated 2-field opposed, palliative radiotherapy plans on thoracic CTs\nreconstructed by our method, and found that isocenter radiation dose on\nreconstructed scans have <1% error with respect to the dose calculated on\nclinically acquired CTs using <=4 X-ray views. In addition, our method is\nbetter than recent sparse CT reconstruction baselines in terms of standard\npixel and structure-level metrics (PSNR, SSIM, Dice score) on the public LIDC\nlung CT dataset. Code is available at: https://github.com/wanderinrain/Xray2CT.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:17:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sun","Yiran",""],["Netherton","Tucker",""],["Court","Laurence",""],["Veeraraghavan","Ashok",""],["Balakrishnan","Guha",""]]}
{"id":"2308.02101","submitter":"Bryar Shareef","authors":"Bryar Shareef, Min Xian, Aleksandar Vakanski, Haotian Wang","title":"Breast Ultrasound Tumor Classification Using a Hybrid Multitask\n  CNN-Transformer Network","comments":"10 pages, 3 figures, 3 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":"  Capturing global contextual information plays a critical role in breast\nultrasound (BUS) image classification. Although convolutional neural networks\n(CNNs) have demonstrated reliable performance in tumor classification, they\nhave inherent limitations for modeling global and long-range dependencies due\nto the localized nature of convolution operations. Vision Transformers have an\nimproved capability of capturing global contextual information but may distort\nthe local image patterns due to the tokenization operations. In this study, we\nproposed a hybrid multitask deep neural network called Hybrid-MT-ESTAN,\ndesigned to perform BUS tumor classification and segmentation using a hybrid\narchitecture composed of CNNs and Swin Transformer components. The proposed\napproach was compared to nine BUS classification methods and evaluated using\nseven quantitative metrics on a dataset of 3,320 BUS images. The results\nindicate that Hybrid-MT-ESTAN achieved the highest accuracy, sensitivity, and\nF1 score of 82.7%, 86.4%, and 86.0%, respectively.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:19:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shareef","Bryar",""],["Xian","Min",""],["Vakanski","Aleksandar",""],["Wang","Haotian",""]]}
{"id":"2308.02102","submitter":"Min Zhuang","authors":"Min Zhuang, Sijie Chen, Jiahao Huang, and Chaohong Lee","title":"Quantum Vector DC Magnetometry via Selective Phase Accumulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precision measurement of magnetic fields is an important goal for fundamental\nscience and practical sensing technology. Sensitive detection of a vector\nmagnetic field is a crucial issue in quantum magnetometry, it remains a\nchallenge to estimate a vector DC magnetic field with high efficiency and high\nprecision. Here, we propose a general protocol for quantum vector DC\nmagnetometry via selective phase accumulation of both non-entangled and\nentangled quantum probes. Based upon the Ramsey interferometry, our protocol\nmay achieve selective phase accumulation of only one magnetic field component\nby inserting well-designed pulse sequence. In the parallel scheme, three\nparallel quantum interferometries are utilized to estimate three magnetic field\ncomponents independently.In the sequential scheme, by applying a pulse sequence\nalong different directions, three magnetic field components can be estimated\nsimultaneously via only one quantum interferometry. In particular, if the input\nstate is an entangled state such as the Greenberger-Horne-Zeilinger state, the\nmeasurement precisions of all three components may approach the Heisenberg\nlimit. Our study not only develops a general protocol for measuring vector\nmagnetic fields via quantum probes, but also provides a feasible way to achieve\nHeisenberg-limited multi-parameter estimation via many-body quantum\nentanglement.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:29:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhuang","Min",""],["Chen","Sijie",""],["Huang","Jiahao",""],["Lee","Chaohong",""]]}
{"id":"2308.02103","submitter":"Shiyao Cui","authors":"Shiyao Cui, Xin Cong, Jiawei Sheng, Xuebin Wang, Tingwen Liu, Jinqiao\n  Shi","title":"Prompt2Gaussia: Uncertain Prompt-learning for Script Event Prediction","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Script Event Prediction (SEP) aims to predict the subsequent event for a\ngiven event chain from a candidate list. Prior research has achieved great\nsuccess by integrating external knowledge to enhance the semantics, but it is\nlaborious to acquisite the appropriate knowledge resources and retrieve the\nscript-related knowledge. In this paper, we regard public pre-trained language\nmodels as knowledge bases and automatically mine the script-related knowledge\nvia prompt-learning. Still, the scenario-diversity and label-ambiguity in\nscripts make it uncertain to construct the most functional prompt and label\ntoken in prompt learning, i.e., prompt-uncertainty and verbalizer-uncertainty.\nConsidering the innate ability of Gaussian distribution to express uncertainty,\nwe deploy the prompt tokens and label tokens as random variables following\nGaussian distributions, where a prompt estimator and a verbalizer estimator are\nproposed to estimate their probabilistic representations instead of\ndeterministic representations. We take the lead to explore prompt-learning in\nSEP and provide a fresh perspective to enrich the script semantics. Our method\nis evaluated on the most widely used benchmark and a newly proposed large-scale\none. Experiments show that our method, which benefits from knowledge evoked\nfrom pre-trained language models, outperforms prior baselines by 1.46\\% and\n1.05\\% on two benchmarks, respectively.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:34:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cui","Shiyao",""],["Cong","Xin",""],["Sheng","Jiawei",""],["Wang","Xuebin",""],["Liu","Tingwen",""],["Shi","Jinqiao",""]]}
{"id":"2308.02104","submitter":"Prakitr Srisuma","authors":"Prakitr Srisuma, George Barbastathis, Richard D. Braatz","title":"Mechanistic Modeling and Analysis of Thermal Radiation in Conventional,\n  Microwave-assisted, and Hybrid Freeze Drying for Biopharmaceutical\n  Manufacturing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In freeze drying, thermal radiation has a significant effect on the drying\nprocess of vials located near the corner and edge of the trays, resulting in\nnon-uniformity of the products. Understanding and being able to predict the\nimpact of thermal radiation are therefore critical to accurate determination of\nthe drying process endpoint given the variation in heat transfer of each vial.\nThis article presents a new mechanistic model that describes complex thermal\nradiation during primary drying in conventional, microwave-assisted, and hybrid\nfreeze drying. Modeling of thermal radiation employs the diffuse gray surface\nmodel and radiation network approach, which systematically and accurately\nincorporates simultaneous radiation exchange between every surface including\nthe chamber wall and vials, allowing the framework to be seamlessly applied for\nanalyzing various freeze-dryer designs. Model validation with data from the\nliterature shows accurate prediction of the drying times for all vials,\nincluding inner, edge, and corner vials. The validated model is demonstrated\nfor thermal radiation analysis and parametric studies to guide the design and\noptimization of freeze dryers.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:53:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Srisuma","Prakitr",""],["Barbastathis","George",""],["Braatz","Richard D.",""]]}
{"id":"2308.02105","submitter":"Iv\\'an Le\\'on","authors":"Iv\\'an Le\\'on and Hiroya Nakao","title":"Analytical Phase Reduction for Weakly Nonlinear Oscillators","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Phase reduction is a dimensionality reduction scheme to describe the dynamics\nof nonlinear oscillators with a single phase variable. While it is crucial in\nsynchronization analysis of coupled oscillators, analytical results are limited\nto few systems. In this letter, we analytically perform phase reduction for a\nwide class of oscillators by extending the Poincar\\'e-Lindstedt perturbation\ntheory. We exemplify the utility of our approach by analyzing an ensemble of\nVan der Pol oscillators, where the derived phase model provides analytical\npredictions of their collective synchronization dynamics\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:59:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Le\u00f3n","Iv\u00e1n",""],["Nakao","Hiroya",""]]}
{"id":"2308.02106","submitter":"Yufeng Wu","authors":"Mingrui Xu, Yufeng Wu, Wei Dai, and Hong X. Tang","title":"Radiatively-cooled quantum microwave amplifiers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Superconducting microwave amplifiers are essential for sensitive signal\nreadout in superconducting quantum processors. Typically based on Josephson\nJunctions, these amplifiers require operation at milli-Kelvin temperatures to\nachieve quantum-limited performance. Here we demonstrate a quantum microwave\namplifier that employs radiative cooling to operate at elevated temperatures.\nThis kinetic-inductance-based parametric amplifier, patterned from a single\nlayer of high-$T_\\mathrm{c}$ NbN thin film\\cmt{in the form of a nanobridge},\nmaintains a high gain and meanwhile enables low added noise of 1.3 quanta when\noperated at 1.5 Kelvin. Remarkably, this represents only a 0.2 quanta increase\ncompared to the performance at a base temperature of 0.1 Kelvin. By uplifting\nthe parametric amplifiers from the mixing chamber without compromising readout\nefficiency, this work represents an important step for realizing scalable\nmicrowave quantum technologies.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:01:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xu","Mingrui",""],["Wu","Yufeng",""],["Dai","Wei",""],["Tang","Hong X.",""]]}
{"id":"2308.02107","submitter":"In-Jee Jeong","authors":"Dongho Chae, In-Jee Jeong, Jungkyoung Na, Sung-Jin Oh","title":"Well-posedness for Ohkitani model and long-time existence for surface\n  quasi-geostrophic equations","comments":"21 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 consider the Cauchy problem for the logarithmically singular surface\nquasi-geostrophic (SQG) equation, introduced by Ohkitani, $$\\partial_t \\theta -\n\\nabla^\\perp \\log(10+(-\\Delta)^{\\frac12})\\theta \\cdot \\nabla \\theta = 0 ,$$ and\nestablish local existence and uniqueness of smooth solutions in the scale of\nSobolev spaces with exponent decreasing with time. Such a decrease of the\nSobolev exponent is necessary, as we have shown in the companion paper that the\nproblem is strongly ill-posed in any fixed Sobolev spaces. The time dependence\nof the Sobolev exponent can be removed when there is a dissipation term\nstrictly stronger than log. These results improve wellposedness statements by\nChae, Constantin, C\\'{o}rdoba, Gancedo, and Wu in \\cite{CCCGW}.\n  This well-posedness result can be applied to describe the long-time dynamics\nof the $\\delta$-SQG equations, defined by $$\\partial_t \\theta + \\nabla^\\perp\n(10+(-\\Delta)^{\\frac12})^{-\\delta}\\theta \\cdot \\nabla \\theta = 0,$$ for all\nsufficiently small $\\delta>0$ depending on the size of the initial data. For\nthe same range of $\\delta$, we establish global well-posedness of smooth\nsolutions to the logarithmically dissipative counterpart: $$\\partial_t \\theta +\n\\nabla^\\perp (10+(-\\Delta)^{\\frac12})^{-\\delta}\\theta \\cdot \\nabla \\theta +\n\\log(10+(-\\Delta)^{\\frac12})\\theta = 0.$$\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:05:29 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chae","Dongho",""],["Jeong","In-Jee",""],["Na","Jungkyoung",""],["Oh","Sung-Jin",""]]}
{"id":"2308.02108","submitter":"Xiaoji Zhou","authors":"Hongmian Shui, Chi-Kin Lai, Zhongcheng Yu, Jinyuan Tian, Chengyang Wu,\n  Xuzong Chen, Xiaoji Zhou","title":"Optimal lattice depth on lifetime of D-band ultracold atoms in a\n  triangular optical lattice","comments":"11 pages, 7 figures, 2 tables","journal-ref":"Opt. Express 31, 26599-26609 (2023)","doi":"10.1364/OE.489823","report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultracold atoms in optical lattices are a flexible and effective platform for\nquantum precision measurement, and the lifetime of high-band atoms is an\nessential parameter for the performance of quantum sensors. In this work, we\ninvestigate the relationship between the lattice depth and the lifetime of\nD-band atoms in a triangular optical lattice and show that there is an optimal\nlattice depth for the maximum lifetime. After loading the Bose Einstein\ncondensate into D-band of optical lattice by shortcut method, we observe the\natomic distribution in quasi-momentum space for the different evolution time,\nand measure the atomic lifetime at D-band with different lattice depths. The\nlifetime is maximized at an optimal lattice depth, where the overlaps between\nthe wave function of D-band and other bands (mainly S-band) are minimized.\nAdditionally, we discuss the influence of atomic temperature on lifetime. These\nexperimental results are in agreement with our numerical simulations. This work\npaves the way to improve coherence properties of optical lattices, and\ncontributes to the implications for the development of quantum precision\nmeasurement, quantum communication, and quantum computing.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:08:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shui","Hongmian",""],["Lai","Chi-Kin",""],["Yu","Zhongcheng",""],["Tian","Jinyuan",""],["Wu","Chengyang",""],["Chen","Xuzong",""],["Zhou","Xiaoji",""]]}
{"id":"2308.02109","submitter":"Yufeng Wu","authors":"Yufeng Wu, Mingrui Xu, and Hong X. Tang","title":"Junction-free microwave two-mode radiation from a kinetic inductance\n  nanowire","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Parametric down-conversion is a widely exploited technique in optics to\nproduce entangled states of photons for quantum information processing and\nquantum sensing. In the microwave domain, devices based on Josephson junctions,\nsuch as Josephson parametric amplifiers (JPAs) and voltage-biased Josephson\njunctions, have been successfully utilized to generate such states. However,\ntheir high susceptibility to magnetic fields has posed challenges in many\napplications. Here we demonstrate the generation of two-mode squeezed states\nvia four-wave-mixing in a superconducting nanowire resonator patterned from\nNbN. The NbN nanowire exhibits a strong Kerr nonlinearity, resulting in the\nemission of a signal-idler pair with a cross-correlation of $g^{(2)}(0) =\n11.9$. Owing to the magnetic resilience and high critical temperature ($T_c$)\nof NbN, our microwave parametric sources based on kinetic inductance promise an\nexpanded range of potential applications.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:10:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wu","Yufeng",""],["Xu","Mingrui",""],["Tang","Hong X.",""]]}
{"id":"2308.02110","submitter":"Yuanping Cui","authors":"Yuanping Cui, Xiaoyue Li","title":"Strong convergence of multiscale truncated Euler-Maruyama method for\n  super-linear slow-fast stochastic differential equations","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 focuses on solving super-linear stochastic differential equations\n(SDEs) involving different time scales numerically. Taking advantages of being\nexplicit and easily implementable, a multiscale truncated Euler-Maruyama scheme\nis proposed for slow-fast SDEs with local Lipschitz coefficients. By virtue of\nthe averaging principle, the strong convergence of its numerical solutions to\nthe exact ones in pth moment is obtained. Furthermore, under mild conditions on\nthe coefficients, the corresponding strong error estimate is also provided.\nFinally, two examples and some numerical simulations are given to verify the\ntheoretical results.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:11:22 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cui","Yuanping",""],["Li","Xiaoyue",""]]}
{"id":"2308.02111","submitter":"Jonathan Yue Huang Mr","authors":"Jonathan Y. Huang, Rocky Y. Su, Wee Han Lim, MengKe Feng, Barnaby van\n  Straaten, Brandon Severin, Will Gilbert, Nard Dumoulin Stuyck, Tuomo Tanttu,\n  Santiago Serrano, Jesus D. Cifuentes, Ingvild Hansen, Amanda E. Seedhouse,\n  Ensar Vahapoglu, Nikolay V. Abrosimov, Hans-Joachim Pohl, Michael L. W.\n  Thewalt, Fay E. Hudson, Christopher C. Escott, Natalia Ares, Stephen D.\n  Bartlett, Andrea Morello, Andre Saraiva, Arne Laucht, Andrew S. Dzurak, and\n  Chih Hwan Yang","title":"High-fidelity operation and algorithmic initialisation of spin qubits\n  above one kelvin","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The encoding of qubits in semiconductor spin carriers has been recognised as\na promising approach to a commercial quantum computer that can be\nlithographically produced and integrated at scale. However, the operation of\nthe large number of qubits required for advantageous quantum applications will\nproduce a thermal load exceeding the available cooling power of cryostats at\nmillikelvin temperatures. As the scale-up accelerates, it becomes imperative to\nestablish fault-tolerant operation above 1 kelvin, where the cooling power is\norders of magnitude higher. Here, we tune up and operate spin qubits in silicon\nabove 1 kelvin, with fidelities in the range required for fault-tolerant\noperation at such temperatures. We design an algorithmic initialisation\nprotocol to prepare a pure two-qubit state even when the thermal energy is\nsubstantially above the qubit energies, and incorporate radio-frequency readout\nto achieve fidelities up to 99.34 per cent for both readout and initialisation.\nImportantly, we demonstrate a single-qubit Clifford gate fidelity of 99.85 per\ncent, and a two-qubit gate fidelity of 98.92 per cent. These advances overcome\nthe fundamental limitation that the thermal energy must be well below the qubit\nenergies for high-fidelity operation to be possible, surmounting a major\nobstacle in the pathway to scalable and fault-tolerant quantum computation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:14:55 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 04:51:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Jonathan Y.",""],["Su","Rocky Y.",""],["Lim","Wee Han",""],["Feng","MengKe",""],["van Straaten","Barnaby",""],["Severin","Brandon",""],["Gilbert","Will",""],["Stuyck","Nard Dumoulin",""],["Tanttu","Tuomo",""],["Serrano","Santiago",""],["Cifuentes","Jesus D.",""],["Hansen","Ingvild",""],["Seedhouse","Amanda E.",""],["Vahapoglu","Ensar",""],["Abrosimov","Nikolay V.",""],["Pohl","Hans-Joachim",""],["Thewalt","Michael L. W.",""],["Hudson","Fay E.",""],["Escott","Christopher C.",""],["Ares","Natalia",""],["Bartlett","Stephen D.",""],["Morello","Andrea",""],["Saraiva","Andre",""],["Laucht","Arne",""],["Dzurak","Andrew S.",""],["Yang","Chih Hwan",""]]}
{"id":"2308.02112","submitter":"Jinkui Wan Ms","authors":"Jie Du, Haixia Gu, Zhenhua Li, Jinkui Wan","title":"Some multiplication formulas in queer $q$-Schur superalgebras","comments":"This is the updated and finalized version of the first five sections\n  of the preliminary article arXiv:2208.13212 and it has 39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building on the work [18], where some standard basis for the queer $q$-Schur\nsuperalgebra $\\mathcal{Q}_q(n,r;R)$ is defined by a labelling set of matrices\nand their associated double coset representatives, we investigate the matrix\nrepresentation of the regular module of $\\mathcal{Q}_q(n,r;R)$ with respect to\nthis basis. More precisely, we derive explicitly (resp., partial explicitly)\nthe multiplication formulas of the basis elements by certain even (resp., odd)\ngenerators of a queer $q$-Schur superalgebra.\n  These multiplication formulas are highly technical to derive, especially in\nthe odd case. It requires to discover many multiplication (or commutation)\nformulas in the Hecke--Clifford algebra $\\mathcal{H}_{r,R}^c$ associated with\nthe labelling matrices. For example, for a given such a labelling matrix\n$A^{\\!\\star}$, there are several matrices $w(A)$, $\\sigma(A), \\widetilde A$,\nand $\\widehat A$ associated with the base matrix $A$ of $A^{\\!\\star}$, where\n$w(A)$ is used to compute a reduced expression of the distinguished double\ncoset representatives $d_A$, and the other matrices are used to describe the\npermutation $d_A$ and the SDP (commutation) condition between $T_{d_A}$ and\ngenerators of the Clifford subsuperalgebra.\n  With these multiplication formulas, we will construct a new realisation of\nthe quantum queer supergroup in a forthcoming paper [13], and to give new\napplications to the integral Schur--Olshanski duality and its associated\nrepresentation theory at roots of unity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:17:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Du","Jie",""],["Gu","Haixia",""],["Li","Zhenhua",""],["Wan","Jinkui",""]]}
{"id":"2308.02113","submitter":"Qi Chen","authors":"Qi Chen, Dexi Liu","title":"Chinese Financial Text Emotion Mining: GCGTS -- A Character\n  Relationship-based Approach for Simultaneous Aspect-Opinion Pair Extraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aspect-Opinion Pair Extraction (AOPE) from Chinese financial texts is a\nspecialized task in fine-grained text sentiment analysis. The main objective is\nto extract aspect terms and opinion terms simultaneously from a diverse range\nof financial texts. Previous studies have mainly focused on developing grid\nannotation schemes within grid-based models to facilitate this extraction\nprocess. However, these methods often rely on character-level (token-level)\nfeature encoding, which may overlook the logical relationships between Chinese\ncharacters within words. To address this limitation, we propose a novel method\ncalled Graph-based Character-level Grid Tagging Scheme (GCGTS). The GCGTS\nmethod explicitly incorporates syntactic structure using Graph Convolutional\nNetworks (GCN) and unifies the encoding of characters within the same syntactic\nsemantic unit (Chinese word level). Additionally, we introduce an image\nconvolutional structure into the grid model to better capture the local\nrelationships between characters within evaluation units. This innovative\nstructure reduces the excessive reliance on pre-trained language models and\nemphasizes the modeling of structure and local relationships, thereby improving\nthe performance of the model on Chinese financial texts. Through comparative\nexperiments with advanced models such as Synchronous Double-channel Recurrent\nNetwork (SDRN) and Grid Tagging Scheme (GTS), the proposed GCGTS model\ndemonstrates significant improvements in performance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:20:56 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Qi",""],["Liu","Dexi",""]]}
{"id":"2308.02114","submitter":"Jun-Xian Li","authors":"Jun-Xian Li, Jing-Yi Zhang","title":"Corrections to the thermodynamic quantities of Bose system by the\n  generalized uncertainty principle","comments":null,"journal-ref":"EPL 139 69003 (2022)","doi":"10.1209/0295-5075/ac8f6a","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigated the Bose system in a spherical shell close to the\nblack hole horizon. Several thermodynamic quantities of the Bose system are\nderived, which are different from those in the flat spacetime, by introducing\nthe generalized uncertainty principle (GUP) into the grand partition function\nof statistical mechanics. The internal energy and the pressure of the Bose\nsystem appear to have a correction term of $T^6$, while the entropy has a $T^5$\ncorrection term where both the coefficients are functions of the spacetime\ncomponent $g_{00}$ and the brick-wall model parameter $\\epsilon$. Taking the\nSchwarzschild black hole as an example, the physical quantities of the shell\nsuch as temperature, pressure and entropy are calculated for the final stage of\nblack hole radiation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:35:05 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Jun-Xian",""],["Zhang","Jing-Yi",""]]}
{"id":"2308.02115","submitter":"Junpei Harada","authors":"Junpei Harada","title":"Gravity at cosmological distances: Explaining the accelerating expansion\n  without dark energy","comments":"7 pages, 1 figure; accepted for publication in Phys.Rev.D, v2:\n  published version","journal-ref":"Phys. Rev. D 108, 044031 (2023)","doi":"10.1103/PhysRevD.108.044031","report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Three theoretical criteria for gravitational theories beyond general\nrelativity are considered: obtaining the cosmological constant as an\nintegration constant, deriving the energy conservation law as a consequence of\nthe field equations, rather than assuming it, and not necessarily considering\nconformally flat metrics as vacuum solutions. Existing theories, including\ngeneral relativity, do not simultaneously fulfill all three criteria. To\naddress this, a new gravitational field equation is proposed that satisfies\nthese criteria. From this equation, a spherically symmetric exact solution is\nderived, which is a generalization of the Schwarzschild solution. It\nincorporates three terms: the Schwarzschild term, the de Sitter term, and a\nnewly discovered term, which is proportional to $r^4$ in a radial coordinate,\nthat becomes significant only at large distances. The equation is further\napplied to cosmology, deriving an equation for the scale factor. It then\npresents a solution that describes the transition from decelerating to\naccelerating expansion in a matter-dominated universe. This is achieved without\nthe need for negative pressure as dark energy or the positive cosmological\nconstant. This provides a novel explanation for the current accelerating\nexpansion of the universe.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:44:23 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 04:28:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Harada","Junpei",""]]}
{"id":"2308.02116","submitter":"Jiawei Chen","authors":"Jiawei Chen, Xiao Yang, Heng Yin, Mingzhi Ma, Bihui Chen, Jianteng\n  Peng, Yandong Guo, Zhaoxia Yin, Hang Su","title":"AdvFAS: A robust face anti-spoofing framework against adversarial\n  examples","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ensuring the reliability of face recognition systems against presentation\nattacks necessitates the deployment of face anti-spoofing techniques. Despite\nconsiderable advancements in this domain, the ability of even the most\nstate-of-the-art methods to defend against adversarial examples remains\nelusive. While several adversarial defense strategies have been proposed, they\ntypically suffer from constrained practicability due to inevitable trade-offs\nbetween universality, effectiveness, and efficiency. To overcome these\nchallenges, we thoroughly delve into the coupled relationship between\nadversarial detection and face anti-spoofing. Based on this, we propose a\nrobust face anti-spoofing framework, namely AdvFAS, that leverages two coupled\nscores to accurately distinguish between correctly detected and wrongly\ndetected face images. Extensive experiments demonstrate the effectiveness of\nour framework in a variety of settings, including different attacks, datasets,\nand backbones, meanwhile enjoying high accuracy on clean examples. Moreover, we\nsuccessfully apply the proposed method to detect real-world adversarial\nexamples.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:47:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Jiawei",""],["Yang","Xiao",""],["Yin","Heng",""],["Ma","Mingzhi",""],["Chen","Bihui",""],["Peng","Jianteng",""],["Guo","Yandong",""],["Yin","Zhaoxia",""],["Su","Hang",""]]}
{"id":"2308.02117","submitter":"Ling Yang","authors":"Ling Yang, Ye Tian, Minkai Xu, Zhongyi Liu, Shenda Hong, Wei Qu,\n  Wentao Zhang, Bin Cui, Muhan Zhang, Jure Leskovec","title":"VQGraph: Graph Vector-Quantization for Bridging GNNs and MLPs","comments":"arXiv admin note: text overlap with arXiv:1906.00446 by other authors","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":"  Graph Neural Networks (GNNs) conduct message passing which aggregates local\nneighbors to update node representations. Such message passing leads to\nscalability issues in practical latency-constrained applications. To address\nthis issue, recent methods adopt knowledge distillation (KD) to learn\ncomputationally-efficient multi-layer perceptron (MLP) by mimicking the output\nof GNN. However, the existing GNN representation space may not be expressive\nenough for representing diverse local structures of the underlying graph, which\nlimits the knowledge transfer from GNN to MLP. Here we present a novel\nframework VQGraph to learn a powerful graph representation space for bridging\nGNNs and MLPs. We adopt the encoder of a variant of a vector-quantized\nvariational autoencoder (VQ-VAE) as a structure-aware graph tokenizer, which\nexplicitly represents the nodes of diverse local structures as numerous\ndiscrete tokens and constitutes a meaningful codebook. Equipped with the\nlearned codebook, we propose a new token-based distillation objective based on\nsoft token assignments to sufficiently transfer the structural knowledge from\nGNN to MLP. Extensive experiments and analyses demonstrate the strong\nperformance of VQGraph, where we achieve new state-of-the-art performance on\nGNN-MLP distillation in both transductive and inductive settings across seven\ngraph datasets. We show that VQGraph with better performance infers faster than\nGNNs by 828x, and also achieves accuracy improvement over GNNs and stand-alone\nMLPs by 3.90% and 28.05% on average, respectively. Code:\nhttps://github.com/YangLing0818/VQGraph.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 02:58:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yang","Ling",""],["Tian","Ye",""],["Xu","Minkai",""],["Liu","Zhongyi",""],["Hong","Shenda",""],["Qu","Wei",""],["Zhang","Wentao",""],["Cui","Bin",""],["Zhang","Muhan",""],["Leskovec","Jure",""]]}
{"id":"2308.02118","submitter":"Hangcheng Dong","authors":"Hang-Cheng Dong, Yuhao Jiang, Yingyan Huang, Jingxiao Liao, Bingguo\n  Liu, Dong Ye, Guodong Liu","title":"Rethinking Class Activation Maps for Segmentation: Revealing Semantic\n  Information in Shallow Layers by Reducing Noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Class activation maps are widely used for explaining deep neural networks.\nDue to its ability to highlight regions of interest, it has evolved in recent\nyears as a key step in weakly supervised learning. A major limitation to the\nperformance of the class activation maps is the small spatial resolution of the\nfeature maps in the last layer of the convolutional neural network. Therefore,\nwe expect to generate high-resolution feature maps that result in high-quality\nsemantic information. In this paper, we rethink the properties of semantic\ninformation in shallow feature maps. We find that the shallow feature maps\nstill have fine-grained non-discriminative features while mixing considerable\nnon-target noise. Furthermore, we propose a simple gradient-based denoising\nmethod to filter the noise by truncating the positive gradient. Our proposed\nscheme can be easily deployed in other CAM-related methods, facilitating these\nmethods to obtain higher-quality class activation maps. We evaluate the\nproposed approach through a weakly-supervised semantic segmentation task, and a\nlarge number of experiments demonstrate the effectiveness of our approach.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:04:09 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dong","Hang-Cheng",""],["Jiang","Yuhao",""],["Huang","Yingyan",""],["Liao","Jingxiao",""],["Liu","Bingguo",""],["Ye","Dong",""],["Liu","Guodong",""]]}
{"id":"2308.02119","submitter":"Mingzhe Hu","authors":"Mingzhe Hu, Xiaofeng Yang","title":"Attention-Driven Lightweight Model for Pigmented Skin Lesion Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study presents a lightweight pipeline for skin lesion detection,\naddressing the challenges posed by imbalanced class distribution and subtle or\natypical appearances of some lesions. The pipeline is built around a\nlightweight model that leverages ghosted features and the DFC attention\nmechanism to reduce computational complexity while maintaining high\nperformance. The model was trained on the HAM10000 dataset, which includes\nvarious types of skin lesions. To address the class imbalance in the dataset,\nthe synthetic minority over-sampling technique and various image augmentation\ntechniques were used. The model also incorporates a knowledge-based loss\nweighting technique, which assigns different weights to the loss function at\nthe class level and the instance level, helping the model focus on minority\nclasses and challenging samples. This technique involves assigning different\nweights to the loss function on two levels - the class level and the instance\nlevel. By applying appropriate loss weights, the model pays more attention to\nthe minority classes and challenging samples, thus improving its ability to\ncorrectly detect and classify different skin lesions. The model achieved an\naccuracy of 92.4%, a precision of 84.2%, a recall of 86.9%, a f1-score of 85.4%\nwith particularly strong performance in identifying Benign Keratosis-like\nlesions (BKL) and Nevus (NV). Despite its superior performance, the model's\ncomputational cost is considerably lower than some models with less accuracy,\nmaking it an optimal solution for real-world applications where both accuracy\nand efficiency are essential.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:18:18 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hu","Mingzhe",""],["Yang","Xiaofeng",""]]}
{"id":"2308.02120","submitter":"In-Jee Jeong","authors":"Dongho Chae, In-Jee Jeong, Sung-Jin Oh","title":"Illposedness via degenerate dispersion for generalized surface\n  quasi-geostrophic equations with singular velocities","comments":"74 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove strong nonlinear illposedness results for the generalized SQG\nequation $$\\partial_t \\theta + \\nabla^\\perp \\Gamma[\\theta] \\cdot \\nabla \\theta\n= 0 $$ in any sufficiently regular Sobolev spaces, when $\\Gamma$ is a singular\nin the sense that its symbol satisfies $|\\Gamma(\\xi)|\\to\\infty$ as\n$|\\xi|\\to\\infty$ with some mild regularity assumptions. The key mechanism is\ndegenerate dispersion, i.e., the rapid growth of frequencies of solutions\naround certain shear states, and the robustness of our method allows one to\nextend linear and nonlinear illposedness to fractionally dissipative systems,\nas long as the order of dissipation is lower than that of $\\Gamma$. Our\nillposedness results are completely sharp in view of various existing\nwellposedness statements as well as those from our companion paper. Key to our\nproofs is a novel construction of degenerating wave packets for the class of\nlinear equations $$\\partial_t \\phi + ip(t,X,D)\\phi = 0$$ where $p(t,X,D)$ is a\npseudo-differential operator which is self-adjoint in $L^2$, degenerate, and\ndispersive. Degenerating wave packets are approximate solutions to the above\nlinear equation with spatial and frequency support localized at\n$(X(t),\\Xi(t))$, which are solutions to the bicharacteristic ODE system\nassociated with $p(t,x,\\xi)$. These wave packets explicitly show degeneration\nas $X(t)$ approaches a point where $p$ vanishes, which in particular allows us\nto prove illposedness in topologies finer than $L^2$. While the equation for\nthe wave packet can be formally obtained from a Taylor expansion of the symbol\nnear $\\xi=\\Xi(t)$, the difficult part is to rigorously control the error in\nsufficiently long timescales, which is obtained by sharp estimates for not only\ndegenerating wave packets but also for oscillatory integrals which naturally\nappear in the error estimate.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:30:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chae","Dongho",""],["Jeong","In-Jee",""],["Oh","Sung-Jin",""]]}
{"id":"2308.02121","submitter":"Xin Mu","authors":"Xin Mu, Yu Wang, Yehong Zhang, Jiaqi Zhang, Hui Wang, Yang Xiang, Yue\n  Yu","title":"Model Provenance via Model DNA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the life cycle of the machine learning (ML) model is an\nintriguing area of research (e.g., understanding where the model comes from,\nhow it is trained, and how it is used). This paper focuses on a novel problem\nwithin this field, namely Model Provenance (MP), which concerns the\nrelationship between a target model and its pre-training model and aims to\ndetermine whether a source model serves as the provenance for a target model.\nThis is an important problem that has significant implications for ensuring the\nsecurity and intellectual property of machine learning models but has not\nreceived much attention in the literature. To fill in this gap, we introduce a\nnovel concept of Model DNA which represents the unique characteristics of a\nmachine learning model. We utilize a data-driven and model-driven\nrepresentation learning method to encode the model's training data and\ninput-output information as a compact and comprehensive representation (i.e.,\nDNA) of the model. Using this model DNA, we develop an efficient framework for\nmodel provenance identification, which enables us to identify whether a source\nmodel is a pre-training model of a target model. We conduct evaluations on both\ncomputer vision and natural language processing tasks using various models,\ndatasets, and scenarios to demonstrate the effectiveness of our approach in\naccurately identifying model provenance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:46:41 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mu","Xin",""],["Wang","Yu",""],["Zhang","Yehong",""],["Zhang","Jiaqi",""],["Wang","Hui",""],["Xiang","Yang",""],["Yu","Yue",""]]}
{"id":"2308.02122","submitter":"Lu Yan","authors":"Lu Yan, Zhuo Zhang, Guanhong Tao, Kaiyuan Zhang, Xuan Chen, Guangyu\n  Shen, Xiangyu Zhang","title":"ParaFuzz: An Interpretability-Driven Technique for Detecting Poisoned\n  Samples in NLP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Backdoor attacks have emerged as a prominent threat to natural language\nprocessing (NLP) models, where the presence of specific triggers in the input\ncan lead poisoned models to misclassify these inputs to predetermined target\nclasses. Current detection mechanisms are limited by their inability to address\nmore covert backdoor strategies, such as style-based attacks. In this work, we\npropose an innovative test-time poisoned sample detection framework that hinges\non the interpretability of model predictions, grounded in the semantic meaning\nof inputs. We contend that triggers (e.g., infrequent words) are not supposed\nto fundamentally alter the underlying semantic meanings of poisoned samples as\nthey want to stay stealthy. Based on this observation, we hypothesize that\nwhile the model's predictions for paraphrased clean samples should remain\nstable, predictions for poisoned samples should revert to their true labels\nupon the mutations applied to triggers during the paraphrasing process. We\nemploy ChatGPT, a state-of-the-art large language model, as our paraphraser and\nformulate the trigger-removal task as a prompt engineering problem. We adopt\nfuzzing, a technique commonly used for unearthing software vulnerabilities, to\ndiscover optimal paraphrase prompts that can effectively eliminate triggers\nwhile concurrently maintaining input semantics. Experiments on 4 types of\nbackdoor attacks, including the subtle style backdoors, and 4 distinct datasets\ndemonstrate that our approach surpasses baseline methods, including STRIP, RAP,\nand ONION, in precision and recall.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:48:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yan","Lu",""],["Zhang","Zhuo",""],["Tao","Guanhong",""],["Zhang","Kaiyuan",""],["Chen","Xuan",""],["Shen","Guangyu",""],["Zhang","Xiangyu",""]]}
{"id":"2308.02123","submitter":"Lin Zhang","authors":"Lin Zhang, Shaohuai Shi, Bo Li","title":"Eva: A General Vectorized Approximation Framework for Second-order\n  Optimization","comments":"Extension of ICLR2022 Practical second-order optimization with\n  Kronecker-vectorized approximation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Second-order optimization algorithms exhibit excellent convergence properties\nfor training deep learning models, but often incur significant computation and\nmemory overheads. This can result in lower training efficiency than the\nfirst-order counterparts such as stochastic gradient descent (SGD). In this\nwork, we present a memory- and time-efficient second-order algorithm named Eva\nwith two novel techniques: 1) we construct the second-order information with\nthe Kronecker factorization of small stochastic vectors over a mini-batch of\ntraining data to reduce memory consumption, and 2) we derive an efficient\nupdate formula without explicitly computing the inverse of matrices using the\nSherman-Morrison formula. We further extend Eva to a general vectorized\napproximation framework to improve the compute and memory efficiency of two\nexisting second-order algorithms (FOOF and Shampoo) without affecting their\nconvergence performance. Extensive experimental results on different models and\ndatasets show that Eva reduces the end-to-end training time up to 2.05x and\n2.42x compared to first-order SGD and second-order algorithms (K-FAC and\nShampoo), respectively.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:51:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Lin",""],["Shi","Shaohuai",""],["Li","Bo",""]]}
{"id":"2308.02124","submitter":"Yuzuru Mitsui","authors":"Yuzuru Mitsui and Hiroshi Kori","title":"Waveform Proportionality and Taylor's Law Induced by Synchronization of\n  Periodic and Chaotic Oscillators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Taylor's law (TL) represents the scaling relationship between the mean and\nvariance derived from population ecology. Recently, it has been observed in\nvarious other fields, including biophysics and network dynamics. However, the\nreasons underlying the frequent appearance of TL, why the exponents of TL are\noften close to 2, and the relationship between temporal and spatial TLs are not\nfully understood. Therefore, in this study, using coupled oscillator models, we\ndemonstrated that synchronization can induce TL. In particular, we analytically\nshowed that strong oscillator synchronization leads to waveform\nproportionality, and thus, temporal and spatial TLs with exponent 2 are\nderived. Numerical simulations demonstrated excellent agreement with the\nderived analytical expression. Our study could help to infer the existence of\nsynchronization solely from the relationship between the mean and variance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:56:36 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mitsui","Yuzuru",""],["Kori","Hiroshi",""]]}
{"id":"2308.02125","submitter":"Sebastian Mizera","authors":"Simon Caron-Huot, Mathieu Giroux, Holmfridur S. Hannesdottir,\n  Sebastian Mizera","title":"What can be measured asymptotically?","comments":"66 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider asymptotic observables in quantum field theories in which the\nS-matrix makes sense. We argue that in addition to scattering amplitudes, a\nwhole compendium of inclusive observables exists where the time-ordering is\nrelaxed. These include expectation values of electromagnetic or gravitational\nradiation fields as well as out-of-time-order amplitudes. We explain how to\ncalculate them in two ways: by relating them to amplitudes and products of\namplitudes, and by using a generalization of the LSZ reduction formula. As an\napplication, we discuss one-loop master integrals contributing to gravitational\nradiation in the post-Minkowski expansion, emphasizing the role of classical\ncut contributions and highlighting the different infrared physics of in-in\nobservables.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:57:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Caron-Huot","Simon",""],["Giroux","Mathieu",""],["Hannesdottir","Holmfridur S.",""],["Mizera","Sebastian",""]]}
{"id":"2308.02126","submitter":"Jongoh Jeong","authors":"Hwan-Soo Choi, Jongoh Jeong, Young Hoo Cho, Kuk-Jin Yoon, and\n  Jong-Hwan Kim","title":"Semantics-guided Transformer-based Sensor Fusion for Improved Waypoint\n  Prediction","comments":"7 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sensor fusion approaches for intelligent self-driving agents remain key to\ndriving scene understanding given visual global contexts acquired from input\nsensors. Specifically, for the local waypoint prediction task, single-modality\nnetworks are still limited by strong dependency on the sensitivity of the input\nsensor, and thus recent works promote the use of multiple sensors in fusion in\nfeature level. While it is well known that multiple data modalities promote\nmutual contextual exchange, deployment to practical driving scenarios requires\nglobal 3D scene understanding in real-time with minimal computations, thus\nplacing greater significance on training strategies given a limited number of\npractically usable sensors. In this light, we exploit carefully selected\nauxiliary tasks that are highly correlated with the target task of interest\n(e.g., traffic light recognition and semantic segmentation) by fusing auxiliary\ntask features and also using auxiliary heads for waypoint prediction based on\nimitation learning. Our multi-task feature fusion augments and improves the\nbase network, TransFuser, by significant margins for safer and more complete\nroad navigation in CARLA simulator as validated on the Town05 Benchmark through\nextensive experiments.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:59:10 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Choi","Hwan-Soo",""],["Jeong","Jongoh",""],["Cho","Young Hoo",""],["Yoon","Kuk-Jin",""],["Kim","Jong-Hwan",""]]}
{"id":"2308.02127","submitter":"Michele Torielli","authors":"Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato and Michele\n  Torielli","title":"Total outer-connected domination number of middle graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the total outer-connected domination number of the\nmiddle graph of a simple graph and we obtain tight bounds for this number in\nterms of the order of the middle graph. We also compute the total\nouter-connected domination number of some families of graphs, explicitly.\nMoreover, some Nordhaus-Gaddum-like relations are presented for the total\nouter-connected domination number of middle graphs.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:59:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kazemnejad","Farshad",""],["Pahlavsay","Behnaz",""],["Palezzato","Elisa",""],["Torielli","Michele",""]]}
{"id":"2308.02128","submitter":"Shiv Singh","authors":"Shiv J. Singh, Ryszard Diduszko, Przemys{\\l}aw Iwanowski, Tomasz\n  Cetner, Andrzej Wisniewski, Andrzej Morawski","title":"Effect of Pb addition on microstructure, transport properties and the\n  critical current density in a polycrystalline FeSe0.5Te0.5","comments":null,"journal-ref":"Appl. Phys. A 128, 476 (2022)","doi":"10.1007/s00339-022-05588-9","report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have investigated the effects of lead (Pb) additions (x) up to 40 wt.% (x\n= 0-0.4) on the structure, electrical properties, and magnetic properties of\nFeSe0.5Te0.5 superconductor. The samples were prepared by the solid-state\nreaction method and characterized by various techniques. The parent compound (x\n= 0) showed the onset temperature Tc onset of 15 K, and zero-resistance\ntemperature, Tc offset of 12 K. The addition of Pb enhances the metallic\ncharacteristics of FeSe0.5Te0.5, but both Tc onset and Tc offset are decreased\nto the lower temperature with the broadened transition width. The Tc onset is\nnearly the same (10.3 K) at higher additions, such as x = 0.3 and 0.4, but zero\nresistivity is not observed up to 7 K. Microstructural analysis and transport\nstudies suggest that for x > 0.05, Pb additions weakened the coupling between\ngrains and suppressed the superconducting percolation, leading to a broad\ntransition. More importantly, the inclusion of a relatively small amount of Pb\n(x = 0.05) increased the critical current density, Jc, in the entire magnetic\nfield, which might be attributable to better phase uniformity as well as good\ngrain connectivity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:04:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Singh","Shiv J.",""],["Diduszko","Ryszard",""],["Iwanowski","Przemys\u0142aw",""],["Cetner","Tomasz",""],["Wisniewski","Andrzej",""],["Morawski","Andrzej",""]]}
{"id":"2308.02129","submitter":"Mohit Singhal","authors":"Mohit Singhal, Javier Pacheco, Tanushree Debi, Seyyed Mohammad Sadegh\n  Moosavi Khorzooghi, Abolfazl Asudeh, Gautam Das, Shirin Nilizadeh","title":"Auditing Yelp's Business Ranking and Review Recommendation Through the\n  Lens of Fairness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Web 2.0 recommendation systems, such as Yelp, connect users and businesses so\nthat users can identify new businesses and simultaneously express their\nexperiences in the form of reviews. Yelp recommendation software moderates\nuser-provided content by categorizing them into recommended and not-recommended\nsections. Due to Yelp's substantial popularity and its high impact on local\nbusinesses' success, understanding the fairness of its algorithms is crucial.\nHowever, with no access to the training data and the algorithms used by such\nblack-box systems, studying their fairness is not trivial, requiring a\ntremendous effort to minimize bias in data collection and consider the\nconfounding factors in the analysis.\n  This large-scale data-driven study, for the first time, investigates Yelp's\nbusiness ranking and review recommendation system through the lens of fairness.\nWe define and examine 4 hypotheses to examine if Yelp's recommendation software\nshows bias and if Yelp's business ranking algorithm shows bias against\nrestaurants located in specific neighborhoods. Our findings show that reviews\nof female and less-established users are disproportionately categorized as\nrecommended. We also find a positive association between restaurants being\nlocated in hotspot regions and their average exposure. Furthermore, we observed\nsome cases of severe disparity bias in cities where the hotspots are in\nneighborhoods with less demographic diversity or areas with higher affluence\nand education levels. Indeed, biases introduced by data-driven systems,\nincluding our findings in this paper, are (almost) always implicit and through\nproxy attributes. Still, the authors believe such implicit biases should be\ndetected and resolved as those can create cycles of discrimination that keep\nincreasing the social gaps between different groups even further.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:12:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Singhal","Mohit",""],["Pacheco","Javier",""],["Debi","Tanushree",""],["Khorzooghi","Seyyed Mohammad Sadegh Moosavi",""],["Asudeh","Abolfazl",""],["Das","Gautam",""],["Nilizadeh","Shirin",""]]}
{"id":"2308.02130","submitter":"David Ruiz-Tijerina","authors":"David A. Ruiz-Tijerina, Jes\\'us Arturo S\\'anchez-S\\'anchez, Ramon\n  Carrillo-Bastos, Santiago Galv\\'an y Garc\\'ia and Francisco Mireles","title":"Spin-valley locking in Kekul\\'e-distorted graphene with Dirac-Rashba\n  interactions","comments":"14 pages, including 8 figures and 4 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The joint effects of Kekul\\'e lattice distortions and Rashba-type spin-orbit\ncoupling on the electronic properties of graphene are explored. We modeled the\nposition dependence of the Rashba energy term in a manner that allows its\nseamless integration into the scheme introduced by Gamayun et al.[New J. Phys.\n20, 023016 (2018)] to describe graphene with Kekul\\'e lattice distortion.\nParticularly for the Kekul\\'e-Y texture, the effective low energy Dirac\nHamiltonian contains a new spin-valley locking term, in addition to the\nwell-known Rashba-induced momentum-pseudospin and spin-pseudospin couplings,\nand the Kekul\\'e-induced momentum-valley coupling term. We report on the\nlow-energy band structure and Landau level spectra of Rashba-spin-orbit-coupled\nKek-Y graphene, and propose an experimental scheme to discern between the\npresence of Rashba spin-orbit coupling, Kek-Y lattice distortion, and both,\nbased on doping-dependent magnetotransport measurements.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:18:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ruiz-Tijerina","David A.",""],["S\u00e1nchez-S\u00e1nchez","Jes\u00fas Arturo",""],["Carrillo-Bastos","Ramon",""],["Garc\u00eda","Santiago Galv\u00e1n y",""],["Mireles","Francisco",""]]}
{"id":"2308.02131","submitter":"Yi Chen","authors":"Yi Chen, Zheng Shi, Hong Wang, Yaru Fu, Guanghua Yang, Shaodan Ma, and\n  Haichuan Ding","title":"Graph Convolutional Network Enabled Power-Constrained HARQ Strategy for\n  URLLC","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":"  In this paper, a power-constrained hybrid automatic repeat request (HARQ)\ntransmission strategy is developed to support ultra-reliable low-latency\ncommunications (URLLC). In particular, we aim to minimize the delivery latency\nof HARQ schemes over time-correlated fading channels, meanwhile ensuring the\nhigh reliability and limited power consumption. To ease the optimization, the\nsimple asymptotic outage expressions of HARQ schemes are adopted. Furthermore,\nby noticing the non-convexity of the latency minimization problem and the\nintricate connection between different HARQ rounds, the graph convolutional\nnetwork (GCN) is invoked for the optimal power solution owing to its powerful\nability of handling the graph data. The primal-dual learning method is then\nleveraged to train the GCN weights. Consequently, the numerical results are\npresented for verification together with the comparisons among three HARQ\nschemes in terms of the latency and the reliability, where the three HARQ\nschemes include Type-I HARQ, HARQ with chase combining (HARQ-CC), and HARQ with\nincremental redundancy (HARQ-IR). To recapitulate, it is revealed that HARQ-IR\noffers the lowest latency while guaranteeing the demanded reliability target\nunder a stringent power constraint, albeit at the price of high coding\ncomplexity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:18:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Yi",""],["Shi","Zheng",""],["Wang","Hong",""],["Fu","Yaru",""],["Yang","Guanghua",""],["Ma","Shaodan",""],["Ding","Haichuan",""]]}
{"id":"2308.02132","submitter":"Ivan Maksymov","authors":"Ivan S. Maksymov and Ganna Pogrebna","title":"Quantum-mechanical model of the backfire effect: Capturing the asymmetry\n  of opinion radicalization due to exposure to opposing views","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a quantum-mechanical model that represents a human system of\nbeliefs as quantized energy levels of a physical system. This model underscores\na novel perspective on opinion dynamics, recreating a broad range of\nexperimental and real-world data that exhibit an asymmetry of opinion\nradicalization. In particular, the model demonstrates the phenomena of\npronounced conservatism versus mild liberalism when individuals are exposed to\nopposing views, mirroring recent findings on opinion polarization via social\nmedia exposure. Advancing this model, we establish a solid framework that\nintegrates elements from physics, psychology, and philosophy, and also\nemphasize the inherent advantages of the quantum approach over traditional\nclassical models. Our findings enhance ongoing efforts to elucidate\npsychological, behavioral, and decision-making phenomena using the laws of\nquantum mechanics. These results also lend additional support to the quantum\nmind hypothesis, suggesting that the most radicalized opinions may not\nnecessarily mirror the most firmly held beliefs but are driven by strongly held\nopinions and exposure to dissenting views.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:23:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Maksymov","Ivan S.",""],["Pogrebna","Ganna",""]]}
{"id":"2308.02133","submitter":"Woo-Seok Choi","authors":"Hanseok Kim, Jae Hyung Ju, Hyun Seok Choi, Hyeri Roh, Woo-Seok Choi","title":"NeuralEQ: Neural-Network-Based Equalizer for High-Speed Wireline\n  Communication","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the growing demand for high-bandwidth applications like video streaming\nand cloud services, the data transfer rates required for wireline communication\nkeeps increasing, making the channel loss a major obstacle in achieving low bit\nerror rate (BER). Equalization techniques such as feed-forward equalizer (FFE)\nand decision feedback equalizer (DFE) are commonly used to compensate for\nchannel loss in wireline communication, but they have limitations in terms of\nnoise boosting and timing constraints. On the other hand, the forward-backward\nalgorithm can achieve better BER performance, but its high complexity makes it\nimpractical for wireline communication. In this work, we propose a novel neural\nnetwork, NeuralEQ, that effectively mimics the forward-backward algorithm and\nperforms better than FFE and DFE while reducing complexity of the\nforward-backward algorithm. Performance of NeuralEQ is verified through\nsimulations using real channels.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:24:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kim","Hanseok",""],["Ju","Jae Hyung",""],["Choi","Hyun Seok",""],["Roh","Hyeri",""],["Choi","Woo-Seok",""]]}
{"id":"2308.02134","submitter":"Ryan Liu","authors":"Ryan Liu, Ladan Tahvildari","title":"Using POMDP-based Approach to Address Uncertainty-Aware Adaptation for\n  Self-Protecting Software","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The threats posed by evolving cyberattacks have led to increased research\nrelated to software systems that can self-protect. One topic in this domain is\nMoving Target Defense (MTD), which changes software characteristics in the\nprotected system to make it harder for attackers to exploit vulnerabilities.\nHowever, MTD implementation and deployment are often impacted by run-time\nuncertainties, and existing MTD decision-making solutions have neglected\nuncertainty in model parameters and lack self-adaptation. This paper aims to\naddress this gap by proposing an approach for an uncertainty-aware and\nself-adaptive MTD decision engine based on Partially Observable Markov Decision\nProcess and Bayesian Learning techniques. The proposed approach considers\nuncertainty in both state and model parameters; thus, it has the potential to\nbetter capture environmental variability and improve defense strategies. A\npreliminary study is presented to highlight the potential effectiveness and\nchallenges of the proposed approach.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:44:47 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:34:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Ryan",""],["Tahvildari","Ladan",""]]}
{"id":"2308.02135","submitter":"Qing Xue","authors":"Qing Xue, Chengwang Ji, Shaodan Ma, Jiajia Guo, Yongjun Xu, Qianbin\n  Chen, and Wei Zhang","title":"A Survey of Beam Management for mmWave and THz Communications Towards 6G","comments":"36 pages, 11 figures, 7 tables","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":"  Communication in millimeter wave (mmWave) and even terahertz (THz) frequency\nbands is ushering in a new era of wireless communications. Beam management,\nnamely initial access and beam tracking, has been recognized as an essential\ntechnique to ensure robust mmWave/THz communications, especially for mobile\nscenarios. However, narrow beams at higher carrier frequency lead to huge beam\nmeasurement overhead, which has a negative impact on beam acquisition and\ntracking. In addition, the beam management process is further complicated by\nthe fluctuation of mmWave/THz channels, the random movement patterns of users,\nand the dynamic changes in the environment. For mmWave and THz communications\ntoward 6G, we have witnessed a substantial increase in research and industrial\nattention on artificial intelligence (AI), reconfigurable intelligent surface\n(RIS), and integrated sensing and communications (ISAC). The introduction of\nthese enabling technologies presents both open opportunities and unique\nchallenges for beam management. In this paper, we present a comprehensive\nsurvey on mmWave and THz beam management. Further, we give some insights on\ntechnical challenges and future research directions in this promising area.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:55:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xue","Qing",""],["Ji","Chengwang",""],["Ma","Shaodan",""],["Guo","Jiajia",""],["Xu","Yongjun",""],["Chen","Qianbin",""],["Zhang","Wei",""]]}
{"id":"2308.02136","submitter":"Yusuke Kato","authors":"Yusuke Kato, Ryo Okumura, Tadahiro Taniguchi","title":"World-Model-Based Control for Industrial box-packing of Multiple Objects\n  using NewtonianVAE","comments":"7 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The process of industrial box-packing, which involves the accurate placement\nof multiple objects, requires high-accuracy positioning and sequential actions.\nWhen a robot is tasked with placing an object at a specific location with high\naccuracy, it is important not only to have information about the location of\nthe object to be placed, but also the posture of the object grasped by the\nrobotic hand. Often, industrial box-packing requires the sequential placement\nof identically shaped objects into a single box. The robot's action should be\ndetermined by the same learned model. In factories, new kinds of products often\nappear and there is a need for a model that can easily adapt to them.\nTherefore, it should be easy to collect data to train the model. In this study,\nwe designed a robotic system to automate real-world industrial tasks, employing\na vision-based learning control model. We propose in-hand-view-sensitive\nNewtonian variational autoencoder (ihVS-NVAE), which employs an RGB camera to\nobtain in-hand postures of objects. We demonstrate that our model, trained for\na single object-placement task, can handle sequential tasks without additional\ntraining. To evaluate efficacy of the proposed model, we employed a real robot\nto perform sequential industrial box-packing of multiple objects. Results\nshowed that the proposed model achieved a 100% success rate in industrial\nbox-packing tasks, thereby outperforming the state-of-the-art and conventional\napproaches, underscoring its superior effectiveness and potential in industrial\ntasks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:58:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kato","Yusuke",""],["Okumura","Ryo",""],["Taniguchi","Tadahiro",""]]}
{"id":"2308.02137","submitter":"Viktor Grimm","authors":"Viktor Grimm, Alexander Heinlein, Axel Klawonn","title":"Learning the solution operator of two-dimensional incompressible\n  Navier-Stokes equations using physics-aware convolutional neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.CE cs.LG cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, the concept of introducing physics to machine learning has\nbecome widely popular. Most physics-inclusive ML-techniques however are still\nlimited to a single geometry or a set of parametrizable geometries. Thus, there\nremains the need to train a new model for a new geometry, even if it is only\nslightly modified. With this work we introduce a technique with which it is\npossible to learn approximate solutions to the steady-state Navier--Stokes\nequations in varying geometries without the need of parametrization. This\ntechnique is based on a combination of a U-Net-like CNN and well established\ndiscretization methods from the field of the finite difference method.The\nresults of our physics-aware CNN are compared to a state-of-the-art data-based\napproach. Additionally, it is also shown how our approach performs when\ncombined with the data-based approach.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:09:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Grimm","Viktor",""],["Heinlein","Alexander",""],["Klawonn","Axel",""]]}
{"id":"2308.02138","submitter":"Nat Mathews","authors":"Nat H. Mathews, Barbara J. Thompson","title":"The Plasma-prescribed Active Region Static Extrapolation (PARSE)\n  Dataset: A Machine-Learning-Ready Collection of Magnetohydrostatic Coronal\n  Active Regions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As Physics-Informed Neural Networks and other methods for full-vector-field\nconstruction or analysis become more prominent, a need has developed for a\nlarge set of simulated active regions for training, validation and testing\npurposes. We use a state-of-the-art magnetohydrostatic extrapolation method to\ndevelop a public dataset of over five thousand data cubes based on the\nSpaceweather HMI Active Region Patch (SHARP) library of active region\nmagnetogram images. Each cube resolves the magnetic field vector and plasma\nforcing at approximately 100,000 scattered points that are adaptively clustered\nnear the high-flux regions of the domain. This paper describes the methodology\nof construction of the Plasma-prescribed Active Region Static Extrapolation\n(PARSE) dataset, as well as its structure and how to access it.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:13:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mathews","Nat H.",""],["Thompson","Barbara J.",""]]}
{"id":"2308.02139","submitter":"Alexandre Berthault","authors":"Alexandre Berthault, Takuma Kato and Akihiko Shirai","title":"Avatar Fusion Karaoke: Research and development on multi-user music play\n  VR experience in the metaverse","comments":"Accepted in the conference IEEE MetaCom 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper contributes to building a standard process of research and\ndevelopment (R&D) for new user experiences (UX) in metaverse services. We\ntested this R&D process on a new UX proof of concept (PoC) for Meta Quest\nhead-mounted display (HMDs) consisting of a school-life karaoke experience with\nthe hypothesis that it is possible to design the avatars with only the\nnecessary functions and rendering costs. The school life metaverse is a\nrelevant subject for discovering issues and problems in this type of\nsimultaneous connection. To qualitatively evaluate the potential of a\nmulti-person metaverse experience, this study investigated subjects where each\navatar requires expressive skills. While avatar play experiences feature\nartistic expressions, such as dancing, playing musical instruments, and\ndrawing, and these can be used to evaluate their operability and expressive\ncapabilities qualitatively, the Quest's tracking capabilities are insufficient\nfor full-body performance and graphical art expression. Considering such\nhardware limitations, this study evaluated the Quest, focusing primarily on UX\nsimplicity using AI Fusion techniques and expressiveness in instrumental scenes\nplayed by approximately four avatars. This research reported methods for\nmultiuser metaverse communication and its supporting technologies, such as\nhead-mounted devices and their graphics performance, special interaction\ntechniques, and complementary tools and the importance of PoC development, its\nevaluation, and its iterations. The result is remarkable for further research;\nthese expressive technologies in a multi-user context are directly related to\nthe quality of communication within the metaverse and the value of the\nuser-generated content (UGC) produced there.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:20:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Berthault","Alexandre",""],["Kato","Takuma",""],["Shirai","Akihiko",""]]}
{"id":"2308.02140","submitter":"Da Wu","authors":"Da Wu, Jiahui Feng, Zheng Shi, Hongjiang Lei, Guanghua Yang, and\n  Shaodan Ma","title":"Deep Reinforcement Learning Empowered Rate Selection of XP-HARQ","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 complex transmission mechanism of cross-packet hybrid automatic repeat\nrequest (XP-HARQ) hinders its optimal system design. To overcome this\ndifficulty, this letter attempts to use the deep reinforcement learning (DRL)\nto solve the rate selection problem of XP-HARQ over correlated fading channels.\nIn particular, the long term average throughput (LTAT) is maximized by properly\nchoosing the incremental information rate for each HARQ round on the basis of\nthe outdated channel state information (CSI) available at the transmitter. The\nrate selection problem is first converted into a Markov decision process (MDP),\nwhich is then solved by capitalizing on the algorithm of deep deterministic\npolicy gradient (DDPG) with prioritized experience replay. The simulation\nresults finally corroborate the superiority of the proposed XP-HARQ scheme over\nthe conventional HARQ with incremental redundancy (HARQ-IR) and the XP-HARQ\nwith only statistical CSI.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:21:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wu","Da",""],["Feng","Jiahui",""],["Shi","Zheng",""],["Lei","Hongjiang",""],["Yang","Guanghua",""],["Ma","Shaodan",""]]}
{"id":"2308.02141","submitter":"Kausik S Das Dr.","authors":"Habilou Ouro-Koura, Ayobami Ogunmolasuyi, Othman Suleiman and Kausik S\n  Das","title":"Inexpensive Benchtop Soft Photolithography Technique for Microfluidics\n  and Other Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.app-ph physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Microfluidics have emerged as a vital tool in various scientific and\nengineering applications, ranging from biomedical diagnostics to chemical\nanalysis. However, conventional fabrication methods often necessitate costly\nequipment and limiting accessibility, thereby hindering widespread adoption. In\nresponse, this note presents a cost-effective approach for fabricating\nmicrofluidic channels using photolithographic methods, which circumvents the\nneed for expensive instruments. The procedure commences with the preparation of\na suitable substrate, followed by the application of a photoresist layer. A\nphotomask, containing the desired microfluidic pattern, is then used to define\nthe layout on the photoresist-coated substrate. Upon exposure to ultraviolet\n(UV) light, the photoresist undergoes a chemical transformation, allowing for\nselective removal of either exposed or unexposed regions. Consequently, the\npatterned microfluidic channels are unveiled on the substrate. The versatility\nof this photolithographic method allows for the fabrication of intricate and\ncustomizable microchannels with relative ease and precision. Further processing\nsteps, such as etching or surface treatment, optimize the substrate's\nproperties for specific applications. This low cost approach not only empowers\nresearchers and engineers to develop microfluidic devices at a fraction of the\ncost but also fosters broader access to photolithography related research and\ndevelopment. The enhanced accessibility opens doors to a myriad of\napplications, ranging from advanced diagnostics and drug delivery systems to\nportable point-of-care devices. Overall, this paper showcases a promising\navenue for expanding the reach of microfluidics, fostering innovation, and\ndriving impactful advancements in diverse scientific disciplines.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:22:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ouro-Koura","Habilou",""],["Ogunmolasuyi","Ayobami",""],["Suleiman","Othman",""],["Das","Kausik S",""]]}
{"id":"2308.02142","submitter":"Jose Camacho-Collados","authors":"Daniel Loureiro and Kiamehr Rezaee and Talayeh Riahi and Francesco\n  Barbieri and Leonardo Neves and Luis Espinosa Anke and Jose Camacho-Collados","title":"Tweet Insights: A Visualization Platform to Extract Temporal Insights\n  from Twitter","comments":"Demo paper. Visualization platform available at\n  https://tweetnlp.org/insights","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a large collection of time series data derived from\nTwitter, postprocessed using word embedding techniques, as well as specialized\nfine-tuned language models. This data comprises the past five years and\ncaptures changes in n-gram frequency, similarity, sentiment and topic\ndistribution. The interface built on top of this data enables temporal analysis\nfor detecting and characterizing shifts in meaning, including complementary\ninformation to trending metrics, such as sentiment and topic association over\ntime. We release an online demo for easy experimentation, and we share code and\nthe underlying aggregated data for future work. In this paper, we also discuss\nthree case studies unlocked thanks to our platform, showcasing its potential\nfor temporal linguistic analysis.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:39:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Loureiro","Daniel",""],["Rezaee","Kiamehr",""],["Riahi","Talayeh",""],["Barbieri","Francesco",""],["Neves","Leonardo",""],["Anke","Luis Espinosa",""],["Camacho-Collados","Jose",""]]}
{"id":"2308.02143","submitter":"Yukio Kaneko","authors":"Yukio Kaneko and Tatsuhiko N. Ikeda","title":"Floquet systems with continuous dynamical symmetries: characterization,\n  time-dependent Noether charge, and integrability","comments":"7+2 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.quant-gas cond-mat.stat-mech physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study quantum Floquet (periodically-driven) systems having continuous\ndynamical symmetry (CDS) consisting of a time translation and a unitary\ntransformation on the Hilbert space. Unlike the discrete ones, the CDS strongly\nconstrains the possible Hamiltonians $H(t)$ and allows us to obtain all the\nFloquet states by solving a finite-dimensional eigenvalue problem. Besides,\nNoether's theorem leads to a time-dependent conservation charge, whose\nexpectation value is time-independent throughout evolution. We exemplify these\nconsequences of CDS in the seminal Rabi model, an effective model of a\nnitrogen-vacancy center in diamonds without strain terms, and Heisenberg spin\nmodels in rotating fields. Our results provide a systematic way of solving for\nFloquet states and explain how they avoid hybridization in quasienergy\ndiagrams.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:42:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kaneko","Yukio",""],["Ikeda","Tatsuhiko N.",""]]}
{"id":"2308.02144","submitter":"Alice-Agnes Gabriel","authors":"Alice-Agnes Gabriel, Thomas Ulrich, Mathilde Marchandon, James\n  Biemiller, John Rekoske","title":"Rapid 3D dynamic rupture modeling of the February 6, 2023,\n  Kahramanmara\\c{s}, Turkey, $M_W$7.8 and $M_W$7.7 earthquake doublet","comments":"This version has been removed by arXiv administrators because the\n  submitter did not have the authority to grant the license at the time of\n  submission","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The 2023 Turkey Earthquake sequence involved unexpected ruptures across\nnumerous fault segments, challenging data interpretation efforts. We present\nrapid, 3D dynamic rupture simulations to illuminate the complexities of the\n$M_W$7.8 and $M_W$7.7 earthquake doublet. Constrained by observations available\nwithin days of the sequence, our models deliver timely, mechanically consistent\nexplanations for the unforeseen rupture paths, diverse rupture speeds, multiple\nslip episodes, locally strong shaking, and fault system interactions. We\nreconcile regional seismo-tectonics, rupture dynamics, and ground motions of a\nfault system represented by ten curved dipping segments and a heterogeneous\nstress field. Our simulations link both events matching geodetic and seismic\nobservations. The $M_W$7.8 earthquake features delayed backward branching from\na steeply intersecting splay fault, not requiring supershear speeds. The\nasymmetrical dynamics of the distinct, bilateral $M_W$7.7 event is explained by\nheterogeneous fault strength, prestress orientation, fracture energy, and\nstatic stress changes from the previous event. Our models explain the northward\ndeviation of its western rupture and the minimal slip observed on the S\\\"urg\\\"u\nfault. Rapidly developed 3D dynamic rupture scenarios can elucidate unexpected\nobservations shortly after major earthquakes, providing timely insights for\ndata-driven analysis and hazard assessment toward a comprehensive, physically\nconsistent understanding of the mechanics of multi-fault systems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:51:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gabriel","Alice-Agnes",""],["Ulrich","Thomas",""],["Marchandon","Mathilde",""],["Biemiller","James",""],["Rekoske","John",""]]}
{"id":"2308.02145","submitter":"Geelon So","authors":"Abhishek Roy, Geelon So, Yi-An Ma","title":"Optimization on Pareto sets: On a theory of multi-objective optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In multi-objective optimization, a single decision vector must balance the\ntrade-offs between many objectives. Solutions achieving an optimal trade-off\nare said to be Pareto optimal: these are decision vectors for which improving\nany one objective must come at a cost to another. But as the set of Pareto\noptimal vectors can be very large, we further consider a more practically\nsignificant Pareto-constrained optimization problem, where the goal is to\noptimize a preference function constrained to the Pareto set.\n  We investigate local methods for solving this constrained optimization\nproblem, which poses significant challenges because the constraint set is (i)\nimplicitly defined, and (ii) generally non-convex and non-smooth, even when the\nobjectives are. We define notions of optimality and stationarity, and provide\nan algorithm with a last-iterate convergence rate of $O(K^{-1/2})$ to\nstationarity when the objectives are strongly convex and Lipschitz smooth.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:55:52 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Roy","Abhishek",""],["So","Geelon",""],["Ma","Yi-An",""]]}
{"id":"2308.02146","submitter":"Ren Tsuda","authors":"Ren Tsuda, Ryotaku Suzuki, and Shinya Tomizawa","title":"Existence conditions of nonsingular dyonic black holes in nonlinear\n  electrodynamics","comments":"6 pages","journal-ref":null,"doi":null,"report-no":"TTI-MATHPHYS-22","categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  General relativity coupled to nonlinear electrodynamics is known to have\nnonsingular black hole solutions. We investigate the existence conditions for\nsuch solutions in two-parameter Lagrangian ${\\cal L} \\left( {\\cal F} , {\\cal G}\n\\right)$. In particular, we obtain a criterion on the Lagrangian for the\nexistence of nonsingular black hole with a dyonic charge. In addition, we\npresent a simple example of two-parameter Lagrangian satisfying the criterion,\nin which the existence of the dyonic solution is actually confirmed.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:02:05 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tsuda","Ren",""],["Suzuki","Ryotaku",""],["Tomizawa","Shinya",""]]}
{"id":"2308.02147","submitter":"Sayyed Mehrab Ramezani","authors":"Sayyed Mehrab Ramezani","title":"Bi g-frame and characterizations of bi g-frame and Riesz basis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we define the concept of the bi g-frame and then show some\nproperties of the bi g-frame\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:07:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ramezani","Sayyed Mehrab",""]]}
{"id":"2308.02148","submitter":"John Stachurski","authors":"Thomas J. Sargent and John Stachurski","title":"Completely Abstract Dynamic Programming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a completely abstract dynamic programming framework in which\ndynamic programs are sets of policy operators acting on a partially ordered\nspace. We provide an optimality theory based on high-level assumptions. We then\nstudy symmetric and asymmetric relationships between dynamic programs, and show\nhow these relationships transmit optimality properties. Our formulation\nincludes and extends applications of dynamic programming across many fields.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:09:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sargent","Thomas J.",""],["Stachurski","John",""]]}
{"id":"2308.02149","submitter":"Ahmadreza Montazerolghaem","authors":"Ahmed Hazim Alhilali, Ahmadreza Montazerolghaem","title":"Artificial intelligence based load balancing in SDN: A comprehensive\n  survey","comments":null,"journal-ref":null,"doi":null,"report-no":"21a","categories":"cs.NI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the future, it is anticipated that software-defined networking (SDN) will\nbecome the preferred platform for deploying diverse networks. Compared to\ntraditional networks, SDN separates the control and data planes for efficient\ndomain-wide traffic routing and management. The controllers in the control\nplane are responsible for programming data plane forwarding devices, while the\ntop layer, the application plane, enforces policies and programs the network.\nThe different levels of the SDN use interfaces for communication. However, SDN\nfaces challenges with traffic distribution, such as load imbalance, which can\nnegatively affect the network performance. Consequently, developers have\ndeveloped various SDN load-balancing solutions to enhance SDN effectiveness. In\naddition, researchers are considering the potential of implementing some\nartificial intelligence (AI) approaches into SDN to improve network resource\nusage and overall performance due to the fast growth of the AI field. This\nsurvey focuses on the following: Firstly, analyzing the SDN architecture and\ninvestigating the problem of load balancing in SDN. Secondly, categorizing\nAI-based load balancing methods and thoroughly assessing these mechanisms from\nvarious perspectives, such as the algorithm/technique employed, the tackled\nproblem, and their strengths and weaknesses. Thirdly, summarizing the metrics\nutilized to measure the effectiveness of these techniques. Finally, identifying\nthe trends and challenges of AI-based load balancing for future research.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:13:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Alhilali","Ahmed Hazim",""],["Montazerolghaem","Ahmadreza",""]]}
{"id":"2308.02150","submitter":"Takumi Hachimine","authors":"Takumi Hachimine, Jun Morimoto, and Takamitsu Matsubara","title":"Learning to Shape by Grinding: Cutting-surface-aware Model-based\n  Reinforcement Learning","comments":"8 pages, Accepted by 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":"  Object shaping by grinding is a crucial industrial process in which a\nrotating grinding belt removes material. Object-shape transition models are\nessential to achieving automation by robots; however, learning such a complex\nmodel that depends on process conditions is challenging because it requires a\nsignificant amount of data, and the irreversible nature of the removal process\nmakes data collection expensive. This paper proposes a cutting-surface-aware\nModel-Based Reinforcement Learning (MBRL) method for robotic grinding. Our\nmethod employs a cutting-surface-aware model as the object's shape transition\nmodel, which in turn is composed of a geometric cutting model and a\ncutting-surface-deviation model, based on the assumption that the robot action\ncan specify the cutting surface made by the tool. Furthermore, according to the\ngrinding resistance theory, the cutting-surface-deviation model does not\nrequire raw shape information, making the model's dimensions smaller and easier\nto learn than a naive shape transition model directly mapping the shapes.\nThrough evaluation and comparison by simulation and real robot experiments, we\nconfirm that our MBRL method can achieve high data efficiency for learning\nobject shaping by grinding and also provide generalization capability for\ninitial and target shapes that differ from the training data.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:14:13 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hachimine","Takumi",""],["Morimoto","Jun",""],["Matsubara","Takamitsu",""]]}
{"id":"2308.02151","submitter":"Weiran Yao","authors":"Weiran Yao, Shelby Heinecke, Juan Carlos Niebles, Zhiwei Liu, Yihao\n  Feng, Le Xue, Rithesh Murthy, Zeyuan Chen, Jianguo Zhang, Devansh Arpit, Ran\n  Xu, Phil Mui, Huan Wang, Caiming Xiong, Silvio Savarese","title":"Retroformer: Retrospective Large Language Agents with Policy Gradient\n  Optimization","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 months have seen the emergence of a powerful new trend in which large\nlanguage models (LLMs) are augmented to become autonomous language agents\ncapable of performing objective oriented multi-step tasks on their own, rather\nthan merely responding to queries from human users. Most existing language\nagents, however, are not optimized using environment-specific rewards. Although\nsome agents enable iterative refinement through verbal feedback, they do not\nreason and plan in ways that are compatible with gradient-based learning from\nrewards. This paper introduces a principled framework for reinforcing large\nlanguage agents by learning a retrospective model, which automatically tunes\nthe language agent prompts from environment feedback through policy gradient.\nSpecifically, our proposed agent architecture learns from rewards across\nmultiple environments and tasks, for fine-tuning a pre-trained language model\nwhich refines the language agent prompt by summarizing the root cause of prior\nfailed attempts and proposing action plans. Experimental results on various\ntasks demonstrate that the language agents improve over time and that our\napproach considerably outperforms baselines that do not properly leverage\ngradients from the environment. This demonstrates that using policy gradient\noptimization to improve language agents, for which we believe our work is one\nof the first, seems promising and can be applied to optimize other models in\nthe agent architecture to enhance agent performances over time.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:14:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yao","Weiran",""],["Heinecke","Shelby",""],["Niebles","Juan Carlos",""],["Liu","Zhiwei",""],["Feng","Yihao",""],["Xue","Le",""],["Murthy","Rithesh",""],["Chen","Zeyuan",""],["Zhang","Jianguo",""],["Arpit","Devansh",""],["Xu","Ran",""],["Mui","Phil",""],["Wang","Huan",""],["Xiong","Caiming",""],["Savarese","Silvio",""]]}
{"id":"2308.02152","submitter":"V\\'ictor Mayoral Vilches","authors":"V\\'ictor Mayoral-Vilches, Gelei Deng, Yi Liu, Martin Pinzger and\n  Stefan Rass","title":"ExploitFlow, cyber security exploitation routes for Game Theory and AI\n  research in robotics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This paper addresses the prevalent lack of tools to facilitate and empower\nGame Theory and Artificial Intelligence (AI) research in cybersecurity. The\nprimary contribution is the introduction of ExploitFlow (EF), an AI and Game\nTheory-driven modular library designed for cyber security exploitation. EF aims\nto automate attacks, combining exploits from various sources, and capturing\nsystem states post-action to reason about them and understand potential attack\ntrees. The motivation behind EF is to bolster Game Theory and AI research in\ncybersecurity, with robotics as the initial focus. Results indicate that EF is\neffective for exploring machine learning in robot cybersecurity. An artificial\nagent powered by EF, using Reinforcement Learning, outperformed both\nbrute-force and human expert approaches, laying the path for using ExploitFlow\nfor further research. Nonetheless, we identified several limitations in\nEF-driven agents, including a propensity to overfit, the scarcity and\nproduction cost of datasets for generalization, and challenges in interpreting\nnetworking states across varied security settings. To leverage the strengths of\nExploitFlow while addressing identified shortcomings, we present Malism, our\nvision for a comprehensive automated penetration testing framework with\nExploitFlow at its core.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:16:41 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mayoral-Vilches","V\u00edctor",""],["Deng","Gelei",""],["Liu","Yi",""],["Pinzger","Martin",""],["Rass","Stefan",""]]}
{"id":"2308.02153","submitter":"Takayuki Kanai","authors":"Takayuki Kanai, Igor Vasiljevic, Vitor Guizilini, Adrien Gaidon, and\n  Rares Ambrus","title":"Robust Self-Supervised Extrinsic Self-Calibration","comments":"Project page: https://sites.google.com/view/tri-sesc","journal-ref":"The IEEE/RSJ International Conference on Intelligent Robots and\n  Systems (IROS), 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous vehicles and robots need to operate over a wide variety of\nscenarios in order to complete tasks efficiently and safely. Multi-camera\nself-supervised monocular depth estimation from videos is a promising way to\nreason about the environment, as it generates metrically scaled geometric\npredictions from visual data without requiring additional sensors. However,\nmost works assume well-calibrated extrinsics to fully leverage this\nmulti-camera setup, even though accurate and efficient calibration is still a\nchallenging problem. In this work, we introduce a novel method for extrinsic\ncalibration that builds upon the principles of self-supervised monocular depth\nand ego-motion learning. Our proposed curriculum learning strategy uses\nmonocular depth and pose estimators with velocity supervision to estimate\nextrinsics, and then jointly learns extrinsic calibration along with depth and\npose for a set of overlapping cameras rigidly attached to a moving vehicle.\nExperiments on a benchmark multi-camera dataset (DDAD) demonstrate that our\nmethod enables self-calibration in various scenes robustly and efficiently\ncompared to a traditional vision-based pose estimation pipeline. Furthermore,\nwe demonstrate the benefits of extrinsics self-calibration as a way to improve\ndepth prediction via joint optimization.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:20:20 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 02:33:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kanai","Takayuki",""],["Vasiljevic","Igor",""],["Guizilini","Vitor",""],["Gaidon","Adrien",""],["Ambrus","Rares",""]]}
{"id":"2308.02154","submitter":"Shikun Sun","authors":"Shikun Sun, Longhui Wei, Junliang Xing, Jia Jia, Qi Tian","title":"SDDM: Score-Decomposed Diffusion Models on Manifolds for Unpaired\n  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":"  Recent score-based diffusion models (SBDMs) show promising results in\nunpaired image-to-image translation (I2I). However, existing methods, either\nenergy-based or statistically-based, provide no explicit form of the interfered\nintermediate generative distributions. This work presents a new\nscore-decomposed diffusion model (SDDM) on manifolds to explicitly optimize the\ntangled distributions during image generation. SDDM derives manifolds to make\nthe distributions of adjacent time steps separable and decompose the score\nfunction or energy guidance into an image ``denoising\" part and a content\n``refinement\" part. To refine the image in the same noise level, we equalize\nthe refinement parts of the score function and energy guidance, which permits\nmulti-objective optimization on the manifold. We also leverage the block\nadaptive instance normalization module to construct manifolds with lower\ndimensions but still concentrated with the perturbed reference image. SDDM\noutperforms existing SBDM-based methods with much fewer diffusion steps on\nseveral I2I benchmarks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:21:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sun","Shikun",""],["Wei","Longhui",""],["Xing","Junliang",""],["Jia","Jia",""],["Tian","Qi",""]]}
{"id":"2308.02155","submitter":"Frederic Rochon","authors":"Ronan J. Conlon and Fr\\'ed\\'eric Rochon","title":"Warped quasi-asymptotically conical Calabi-Yau metrics","comments":"52 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AG math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct many new examples of complete Calabi-Yau metrics of maximal\nvolume growth on certain smoothings of Cartesian products of Calabi-Yau cones\nwith smooth cross-sections. A detailed description of the geometry at infinity\nof these metrics is given in terms of a compactification by a manifold with\ncorners obtained through the notion of weighted blow-up for manifolds with\ncorners. A key analytical step in the construction of these Calabi-Yau metrics\nis to derive good mapping properties of the Laplacian on some suitable weighted\nH\\\"older spaces.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:27:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Conlon","Ronan J.",""],["Rochon","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.02156","submitter":"Shu Wang","authors":"Ling Li, Shu Wang, Xiaodian Chen, and Qingquan Jiang","title":"The Ultraviolet to Mid-infrared Extinction Law of the Taurus Molecular\n  Cloud Based on the Gaia DR3, GALEX, APASS, Pan-STARRS1, 2MASS, and WISE\n  Surveys","comments":"26 pages, 11 figures, 2 tables, Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interstellar dust extinction law is essential for interpreting observations.\nIn this work, we investigate the ultraviolet (UV)--mid-infrared (IR) extinction\nlaw of the Taurus molecular cloud and its possible variations. We select\n504,988 dwarf stars (4200 K < Teff < 8000 K) and 4,757 giant stars (4200 K <\nTeff < 5200 K) based on the stellar parameters of Gaia DR3 as tracers. We\nestablish the Teff--intrinsic color relations and determine the intrinsic color\nindices and color excesses for different types of stars. In the determination\nof color excess ratios (CERs), we analyze and correct the curvature of CERs and\nderive the UV--mid-IR CERs of 16 bands. We consider different effective\nwavelengths for different types of stars when converting CERs to relative\nextinction, and obtain the extinction law with a better wavelength resolution.\nIn addition, we analyze the possible regional variation of extinction law and\nderive the average extinction law of Rv=3.13+-0.32 for the Taurus molecular\ncloud. Only 0.9% of subregions have deviations >3sigma, indicating limited\nregional variation in the extinction law. We also discuss the effect of Gaia\nTeff overestimation on the determination of the Taurus extinction law and find\nthat the effect is negligible.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:27:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Ling",""],["Wang","Shu",""],["Chen","Xiaodian",""],["Jiang","Qingquan",""]]}
{"id":"2308.02157","submitter":"Qinsheng Zhang","authors":"Qinsheng Zhang and Jiaming Song and Yongxin Chen","title":"Improved Order Analysis and Design of Exponential Integrator for\n  Diffusion Models Sampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Efficient differential equation solvers have significantly reduced the\nsampling time of diffusion models (DMs) while retaining high sampling quality.\nAmong these solvers, exponential integrators (EI) have gained prominence by\ndemonstrating state-of-the-art performance. However, existing high-order\nEI-based sampling algorithms rely on degenerate EI solvers, resulting in\ninferior error bounds and reduced accuracy in contrast to the theoretically\nanticipated results under optimal settings. This situation makes the sampling\nquality extremely vulnerable to seemingly innocuous design choices such as\ntimestep schedules. For example, an inefficient timestep scheduler might\nnecessitate twice the number of steps to achieve a quality comparable to that\nobtained through carefully optimized timesteps. To address this issue, we\nreevaluate the design of high-order differential solvers for DMs. Through a\nthorough order analysis, we reveal that the degeneration of existing high-order\nEI solvers can be attributed to the absence of essential order conditions. By\nreformulating the differential equations in DMs and capitalizing on the theory\nof exponential integrators, we propose refined EI solvers that fulfill all the\norder conditions, which we designate as Refined Exponential Solver (RES).\nUtilizing these improved solvers, RES exhibits more favorable error bounds\ntheoretically and achieves superior sampling efficiency and stability in\npractical applications. For instance, a simple switch from the single-step\nDPM-Solver++ to our order-satisfied RES solver when Number of Function\nEvaluations (NFE) $=9$, results in a reduction of numerical defects by $25.2\\%$\nand FID improvement of $25.4\\%$ (16.77 vs 12.51) on a pre-trained ImageNet\ndiffusion model.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:30:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Qinsheng",""],["Song","Jiaming",""],["Chen","Yongxin",""]]}
{"id":"2308.02158","submitter":"Jiaxin Chen","authors":"Xin Liao and Siliang Chen and Jiaxin Chen and Tianyi Wang and Xiehua\n  Li","title":"CTP-Net: Character Texture Perception Network for Document Image Forgery\n  Localization","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 progression of information technology in recent years, document\nimages have been widely disseminated on social networks. With the help of\npowerful image editing tools, document images are easily forged without leaving\nvisible manipulation traces, which leads to severe issues if significant\ninformation is falsified for malicious use. Therefore, the research of document\nimage forensics is worth further exploring. In this paper, we propose a\nCharacter Texture Perception Network (CTP-Net) to localize the forged regions\nin document images. Specifically, considering the characters with semantics in\na document image are highly vulnerable, capturing the forgery traces is the key\nto localize the forged regions. We design a Character Texture Stream (CTS)\nbased on optical character recognition to capture features of text areas that\nare essential components of a document image. Meanwhile, texture features of\nthe whole document image are exploited by an Image Texture Stream (ITS).\nCombining the features extracted from the CTS and the ITS, the CTP-Net can\nreveal more subtle forgery traces from document images. Moreover, to overcome\nthe challenge caused by the lack of fake document images, we design a data\ngeneration strategy that is utilized to construct a Fake Chinese Trademark\ndataset (FCTM). Experimental results on different datasets demonstrate that the\nproposed CTP-Net is able to localize multi-scale forged areas in document\nimages, and outperform the state-of-the-art forgery localization methods, even\nthough post-processing operations are applied.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:37:28 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 03:45:50 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liao","Xin",""],["Chen","Siliang",""],["Chen","Jiaxin",""],["Wang","Tianyi",""],["Li","Xiehua",""]]}
{"id":"2308.02159","submitter":"Naritaka Oshita","authors":"Naritaka Oshita, Yutaro Shoji, Masahide Yamaguchi","title":"Is the Coleman de Luccia action minimum?: AdS/CFT approach","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"YITP-23-99, RIKEN-iTHEMS-Report-23","categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the anti-de Sitter/conformal field theory (AdS/CFT) correspondence to\nfind the least bounce action in an AdS false vacuum state, i.e., the most\nprobable decay process of the metastable AdS vacuum within the Euclidean\nformalism by Callan and Coleman. It was shown that the $O(4)$ symmetric bounce\nsolution leads to the action minimum in the absence of gravity, but it is\nnon-trivial in the presence of gravity. The AdS/CFT duality is used to evade\nthe difficulties particular to a metastable gravitational system, such as the\nproblems of negative modes and unbounded action. To this end, we show that the\nFubini bounce solution in CFT, corresponding to the Coleman de Luccia bounce in\nAdS, gives the least action among all finite bounce solutions in a conformal\nscalar field theory. Thus, we prove that the Coleman de Luccia action is the\nleast action when (i) the background is AdS, (ii) the AdS radii, $L_+$ and\n$L_-$, in the false and true vacua, respectively, satisfy $L_+ / L_- \\simeq 1$,\nand (iii) a metastable potential gives a thin-wall bounce much larger than the\nAdS radii.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:37:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Oshita","Naritaka",""],["Shoji","Yutaro",""],["Yamaguchi","Masahide",""]]}
{"id":"2308.02160","submitter":"Yogesh Virkar","authors":"Yogesh Virkar, Brian Thompson, Rohit Paturi, Sundararajan Srinivasan,\n  Marcello Federico","title":"Speaker Diarization of Scripted Audiovisual Content","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The media localization industry usually requires a verbatim script of the\nfinal film or TV production in order to create subtitles or dubbing scripts in\na foreign language. In particular, the verbatim script (i.e. as-broadcast\nscript) must be structured into a sequence of dialogue lines each including\ntime codes, speaker name and transcript. Current speech recognition technology\nalleviates the transcription step. However, state-of-the-art speaker\ndiarization models still fall short on TV shows for two main reasons: (i) their\ninability to track a large number of speakers, (ii) their low accuracy in\ndetecting frequent speaker changes. To mitigate this problem, we present a\nnovel approach to leverage production scripts used during the shooting process,\nto extract pseudo-labeled data for the speaker diarization task. We propose a\nnovel semi-supervised approach and demonstrate improvements of 51.7% relative\nto two unsupervised baseline models on our metrics on a 66 show test set.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:37:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Virkar","Yogesh",""],["Thompson","Brian",""],["Paturi","Rohit",""],["Srinivasan","Sundararajan",""],["Federico","Marcello",""]]}
{"id":"2308.02161","submitter":"Jiyong Moon","authors":"Jiyong Moon, Junseok Lee, Yunju Lee, and Seongsik Park","title":"M2Former: Multi-Scale Patch Selection for Fine-Grained Visual\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":"  Recently, vision Transformers (ViTs) have been actively applied to\nfine-grained visual recognition (FGVR). ViT can effectively model the\ninterdependencies between patch-divided object regions through an inherent\nself-attention mechanism. In addition, patch selection is used with ViT to\nremove redundant patch information and highlight the most discriminative object\npatches. However, existing ViT-based FGVR models are limited to single-scale\nprocessing, and their fixed receptive fields hinder representational richness\nand exacerbate vulnerability to scale variability. Therefore, we propose\nmulti-scale patch selection (MSPS) to improve the multi-scale capabilities of\nexisting ViT-based models. Specifically, MSPS selects salient patches of\ndifferent scales at different stages of a multi-scale vision Transformer\n(MS-ViT). In addition, we introduce class token transfer (CTT) and multi-scale\ncross-attention (MSCA) to model cross-scale interactions between selected\nmulti-scale patches and fully reflect them in model decisions. Compared to\nprevious single-scale patch selection (SSPS), our proposed MSPS encourages\nricher object representations based on feature hierarchy and consistently\nimproves performance from small-sized to large-sized objects. As a result, we\npropose M2Former, which outperforms CNN-/ViT-based models on several widely\nused FGVR benchmarks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:41:35 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Moon","Jiyong",""],["Lee","Junseok",""],["Lee","Yunju",""],["Park","Seongsik",""]]}
{"id":"2308.02162","submitter":"Wangbo Zhao","authors":"Wangbo Zhao, Kepan Nan, Songyang Zhang, Kai Chen, Dahua Lin, Yang You","title":"Learning Referring Video Object Segmentation from Weak Annotation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Referring video object segmentation (RVOS) is a task that aims to segment the\ntarget object in all video frames based on a sentence describing the object.\nPrevious RVOS methods have achieved significant performance with\ndensely-annotated datasets, whose construction is expensive and time-consuming.\nTo relieve the burden of data annotation while maintaining sufficient\nsupervision for segmentation, we propose a new annotation scheme, in which we\nlabel the frame where the object first appears with a mask and use bounding\nboxes for the subsequent frames. Based on this scheme, we propose a method to\nlearn from this weak annotation. Specifically, we design a cross frame\nsegmentation method, which uses the language-guided dynamic filters to\nthoroughly leverage the valuable mask annotation and bounding boxes. We further\ndevelop a bi-level contrastive learning method to encourage the model to learn\ndiscriminative representation at the pixel level. Extensive experiments and\nablative analyses show that our method is able to achieve competitive\nperformance without the demand of dense mask annotation. The code will be\navailable at https://github.com/wangbo-zhao/WRVOS/.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:50:52 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhao","Wangbo",""],["Nan","Kepan",""],["Zhang","Songyang",""],["Chen","Kai",""],["Lin","Dahua",""],["You","Yang",""]]}
{"id":"2308.02163","submitter":"Daniel Reijsbergen","authors":"Anwitaman Datta, Dani\\\"el Reijsbergen, Jingchi Zhang, and Suman\n  Majumder","title":"BlockChain I/O: Enabling Cross-Chain Commerce","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By enabling users to safely transfer digital tokens without trusted\nintermediaries, blockchains have fueled the rise of Decentralized Finance\n(DeFi). However, the current DeFi ecosystem consists of multiple independent\nblockchains, and cross-chain token trading is a challenge because the desirable\nproperties of individual blockchains do not always generalize to a multi-chain\nsetting. Recently, advances have been made in the generalization of these\nproperties, but there is still a lack of an overarching framework that provides\nthe full set of properties required for practical cross-chain commerce:\ntransaction atomicity, stablecoin support, privacy-preserving digital\nidentities, and general applicability.\n  In this paper, we present BlockChain I/O to provide such a framework.\nBlockChain I/O uses entities called cross-chain services to relay information\nbetween different chains. Cross-chain services cannot violate transaction\natomicity, and are disincentivized from other types of misbehavior -- i.e.,\ncausing delays or misrepresenting information -- through an audit system.\nBlockChain I/O uses stablecoins to mitigate price fluctuations, and a Digital\nID system to allow users to prove aspects of their identity without violating\nprivacy. After presenting the core architecture of BlockChain I/O, we\ndemonstrate how to use it to implement a cross-chain marketplace. Finally, we\nuse an experimental evaluation to demonstrate BlockChain I/O's practical\nperformance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:51:50 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 02:04:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Datta","Anwitaman",""],["Reijsbergen","Dani\u00ebl",""],["Zhang","Jingchi",""],["Majumder","Suman",""]]}
{"id":"2308.02164","submitter":"Dongkai Pan","authors":"Dongkai Pan, Xiao Wan, Zhicheng Zong, Yangjun Qin, Nuo Yang","title":"Using Targeted Phonon Excitation to Modulate Thermal Conductivity of\n  Boron Nitride","comments":"12 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":"  Modulation of thermal conductivity has become a hotspot in the field of heat\nconduction. A novel strategy based on targeted phonon excitation has been\nrecently proposed for efficient and reversible modulation of thermal\nconductivity. In this article, the effectiveness of that strategy is further\nevaluated on hexagonal boron nitride through ab initio methods. Results\nindicate that thermal conductivity can be increased from 885 W m-1 K-1 to 1151\nW m-1 K-1 or decreased to 356 W m-1 K-1, thereby broadening the scope of\napplicability of this strategy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:53:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Pan","Dongkai",""],["Wan","Xiao",""],["Zong","Zhicheng",""],["Qin","Yangjun",""],["Yang","Nuo",""]]}
{"id":"2308.02165","submitter":"Thiparat Chotibut","authors":"Teerachote Pakornchote, Natthaphon Choomphon-anomakhun, Sorrjit\n  Arrerut, Chayanon Atthapak, Sakarn Khamkaeo, Thiparat Chotibut, Thiti\n  Bovornratanaraks","title":"Diffusion probabilistic models enhance variational autoencoder for\n  crystal structure generative modeling","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cond-mat.mtrl-sci cond-mat.stat-mech physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The crystal diffusion variational autoencoder (CDVAE) is a machine learning\nmodel that leverages score matching to generate realistic crystal structures\nthat preserve crystal symmetry. In this study, we leverage novel diffusion\nprobabilistic (DP) models to denoise atomic coordinates rather than adopting\nthe standard score matching approach in CDVAE. Our proposed DP-CDVAE model can\nreconstruct and generate crystal structures whose qualities are statistically\ncomparable to those of the original CDVAE. Furthermore, notably, when comparing\nthe carbon structures generated by the DP-CDVAE model with relaxed structures\nobtained from density functional theory calculations, we find that the DP-CDVAE\ngenerated structures are remarkably closer to their respective ground states.\nThe energy differences between these structures and the true ground states are,\non average, 68.1 meV/atom lower than those generated by the original CDVAE.\nThis significant improvement in the energy accuracy highlights the\neffectiveness of the DP-CDVAE model in generating crystal structures that\nbetter represent their ground-state configurations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:53:22 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Pakornchote","Teerachote",""],["Choomphon-anomakhun","Natthaphon",""],["Arrerut","Sorrjit",""],["Atthapak","Chayanon",""],["Khamkaeo","Sakarn",""],["Chotibut","Thiparat",""],["Bovornratanaraks","Thiti",""]]}
{"id":"2308.02166","submitter":"Han Chen","authors":"Han Chen, Yang Yu, Pengtao Li","title":"Transformer-Based Denoising of Mechanical Vibration Signals","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mechanical vibration signal denoising is a pivotal task in various industrial\napplications, including system health monitoring and failure prediction. This\npaper introduces a novel deep learning transformer-based architecture\nspecifically tailored for denoising mechanical vibration signals. The model\nleverages a Multi-Head Attention layer with 8 heads, processing input sequences\nof length 128, embedded into a 64-dimensional space. The architecture also\nincorporates Feed-Forward Neural Networks, Layer Normalization, and Residual\nConnections, resulting in enhanced recognition and extraction of essential\nfeatures. Through a training process guided by the Mean Squared Error loss\nfunction and optimized using the Adam optimizer, the model demonstrates\nremarkable effectiveness in filtering out noise while preserving critical\ninformation related to mechanical vibrations. The specific design and choice of\nparameters offer a robust method adaptable to the complex nature of mechanical\nsystems, with promising applications in industrial monitoring and maintenance.\nThis work lays the groundwork for future exploration and optimization in the\nfield of mechanical signal analysis and presents a significant step towards\nadvanced and intelligent mechanical system diagnostics.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:55:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Han",""],["Yu","Yang",""],["Li","Pengtao",""]]}
{"id":"2308.02167","submitter":"Ruirong Chen","authors":"Ruirong Chen, Gaoning He","title":"IntLearner: AI-enabled Interference Mitigation for Wireless Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The future Six-Generation (6G) envisions massive access of wireless devices\nin the network, leading to more serious interference from concurrent\ntransmissions between wireless devices in the same frequency band. Existing\ninterference mitigation approaches takes the interference signals as Gaussian\nwhite noise, which cannot precisely estimate the non-Gaussian interference\nsignals from other devices. In this paper, we present IntLearner, a new\ninterference mitigation technique that estimates and mitigates the impact of\ninterference signals with only physical-layer (PHY) information available in\nbase-station (BS) and user-equipment (UE), including channel estimator and\nconstellations. More specifically, IntLearner utilizes the power of AI to\nestimate the features in interference signals, and removes the interference\nfrom the interfered received signal with neural network (NN). IntLearner's NN\nadopts a modular NN design, which takes the domain knowledge of BS and UE PHY\nas the guidance to NN design for minimizing training confusion and NN\ncomplexity. Simulation results show IntLearner increases Uplink (UL) channel\nestimation accuracy up to 7.4x, and reduces the Downlink (DL) Signal to\nInterference Ratio plus Noise Ratio (SINR) requirement to achieve the same\nBlock Error Rate (BLER) by 1.5dB in a conventional multi-cell scenario.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:01:35 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Ruirong",""],["He","Gaoning",""]]}
{"id":"2308.02168","submitter":"Yuhang Wang","authors":"Yuhang Wang, Yuxiang Zhang, Dongyuan Lu and Jitao Sang","title":"You talk what you read: Understanding News Comment Behavior by\n  Dispositional and Situational Attribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many news comment mining studies are based on the assumption that comment is\nexplicitly linked to the corresponding news. In this paper, we observed that\nusers' comments are also heavily influenced by their individual characteristics\nembodied by the interaction history. Therefore, we position to understand news\ncomment behavior by considering both the dispositional factors from news\ninteraction history, and the situational factors from corresponding news. A\nthree-part encoder-decoder framework is proposed to model the generative\nprocess of news comment. The resultant dispositional and situational\nattribution contributes to understanding user focus and opinions, which are\nvalidated in applications of reader-aware news summarization and news\naspect-opinion forecasting.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:10:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Yuhang",""],["Zhang","Yuxiang",""],["Lu","Dongyuan",""],["Sang","Jitao",""]]}
{"id":"2308.02169","submitter":"Shu Wang","authors":"Shu Wang, Xiaodian Chen, Jianxing Zhang, and Licai Deng","title":"Double-mode RR Lyrae star -- robust distance and metallicity indicators","comments":"6 pages, 2 figures, to appear on the Proceedings of IAU Symposium\n  376, At the cross-roads of astrophysics and cosmology: Period-luminosity\n  relations in the 2020s","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  RR Lyrae (RR Lyr) stars are a well-known and useful distance indicator for\nold stellar populations such as globular clusters and dwarf galaxies.\nFundamental-mode RR Lyr (RRab) stars are commonly used to measure distances,\nand the accuracy of the determined distance is strongly constrained by\nmetallicity. Here, we investigate the metallicity dependence in the\nperiod-luminosity (PL) relation of double-mode RR Lyr (RRd) stars. We find and\nestablish a linear relation between metallicity and period or period ratio for\nRRd stars. This relation can predict the metallicity as accurately as the\nlow-resolution spectra. Based on this relation, we establish a\nmetallicity-independent PL relation for RRd stars. Combining the distance of\nthe Large Magellanic Cloud and Gaia parallaxes, we calibrate the zero point of\nthe derived PL relation to an error of 0.022 mag. Using RRd stars, we measure\nthe distances of globular clusters and dwarf galaxies with an accuracy of 2-3%\nand 1-2%, respectively. In the future, RRd stars could anchor galaxy distances\nto an accuracy of 1.0% and become an independent distance ladder in the Local\nGroup.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:12:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Shu",""],["Chen","Xiaodian",""],["Zhang","Jianxing",""],["Deng","Licai",""]]}
{"id":"2308.02170","submitter":"Wu-Long Xu","authors":"Wenyu Wang, Wu-Long Xu, Jin Min Yang, Bin Zhu, Rui Zhu","title":"Sommerfeld enhancement for puffy self-interacting dark matter","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the Sommerfeld enhancement effect for the puffy self-interacting\ndark matter. We find out two new parameters to classify the self-scattering\ncross section into the Born, the resonance and the classical regimes for the\npuffy dark matter. Then we observe that the resonance peaks for the puffy dark\nmatter self-scattering and for the Sommerfeld enhancement effect have the same\nlocations. Further, we find that for a large ratio between $R_{\\chi}$ (radius\nof a puffy dark matter particle) and $1/m_{\\phi}$ (force range), the Sommerfeld\nenhancement factor approaches to 1 (no enhancement). Finally, for the puffy\nSIDM scenario to solve the small-scale problems, the values of the Sommerfeld\nenhancement factor are displayed in the allowed parameter regions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:16:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Wenyu",""],["Xu","Wu-Long",""],["Yang","Jin Min",""],["Zhu","Bin",""],["Zhu","Rui",""]]}
{"id":"2308.02171","submitter":"Mitsuharu Uemoto","authors":"Hayato Adachi, Ryuusuke Endo, Hikari Shinya, Hiroshi Naganuma, and\n  Mitsuharu Uemoto","title":"First-principle study of spin transport property in\n  $L1_0$-FePd(001)/graphene heterojunction","comments":"18 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 our previous work, we synthesized a metal/2D material heterointerface\nconsisting of $L1_0$-ordered iron-palladium (FePd) and graphene (Gr) called\nFePd(001)/Gr. This system has been explored by both experimental measurements\nand theoretical calculations. In this study, we focus on a heterojunction\ncomposed of FePd and multilayer graphene referred to as\nFePd(001)/$m$-Gr/FePd(001), where $m$ represents the number of graphene layers.\nWe perform first-principles calculations to predict their spin-dependent\ntransport properties. The quantitative calculations of spin-resolved\nconductance and magnetoresistance (MR) ratio (150-200%) suggest that the\nproposed structure can function as a magnetic tunnel junction in spintronics\napplications. We also find that an increase in $m$ not only reduces conductance\nbut also changes transport properties from the tunneling behavior to the\ngraphite $\\pi$-band-like behavior. Furthermore, we examine the impact of\nlateral displacements (sliding) at the interface and find that the spin\ntransport properties remain robust despite these changes; this is the advantage\nof two-dimensional material hetero-interfaces over traditional insulating\nbarrier layers such as MgO.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:16:20 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:35:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Adachi","Hayato",""],["Endo","Ryuusuke",""],["Shinya","Hikari",""],["Naganuma","Hiroshi",""],["Uemoto","Mitsuharu",""]]}
{"id":"2308.02172","submitter":"Haotian Zhang","authors":"Haotian Zhang, Huifeng Zhao, Xujun Zhang, Qun Su, Hongyan Du, Chao\n  Shen, Zhe Wang, Dan Li, Peichen Pan, Guangyong Chen, Yu Kang, Chang-yu Hsieh,\n  Tingjun Hou","title":"Delete: Deep Lead Optimization Enveloped in Protein Pocket through\n  Unified Deleting Strategies and a Structure-aware Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Drug discovery is a highly complicated process, and it is unfeasible to fully\ncommit it to the recently developed molecular generation methods. Deep\nlearning-based lead optimization takes expert knowledge as a starting point,\nlearning from numerous historical cases about how to modify the structure for\nbetter drug-forming properties. However, compared with the more established de\nnovo generation schemes, lead optimization is still an area that requires\nfurther exploration. Previously developed models are often limited to resolving\none (or few) certain subtask(s) of lead optimization, and most of them can only\ngenerate the two-dimensional structures of molecules while disregarding the\nvital protein-ligand interactions based on the three-dimensional binding poses.\nTo address these challenges, we present a novel tool for lead optimization,\nnamed Delete (Deep lead optimization enveloped in protein pocket). Our model\ncan handle all subtasks of lead optimization involving fragment growing,\nlinking, and replacement through a unified deleting (masking) strategy, and is\naware of the intricate pocket-ligand interactions through the geometric design\nof networks. Statistical evaluations and case studies conducted on individual\nsubtasks demonstrate that Delete has a significant ability to produce molecules\nwith superior binding affinities to protein targets and reasonable\ndrug-likeness from given fragments or atoms. This feature may assist medicinal\nchemists in developing not only me-too/me-better products from existing drugs\nbut also hit-to-lead for first-in-class drugs in a highly efficient manner.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:18:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Haotian",""],["Zhao","Huifeng",""],["Zhang","Xujun",""],["Su","Qun",""],["Du","Hongyan",""],["Shen","Chao",""],["Wang","Zhe",""],["Li","Dan",""],["Pan","Peichen",""],["Chen","Guangyong",""],["Kang","Yu",""],["Hsieh","Chang-yu",""],["Hou","Tingjun",""]]}
{"id":"2308.02173","submitter":"Ravikiran Parameshwara","authors":"Ravikiran Parameshwara, Ibrahim Radwan, Akshay Asthana, Iman\n  Abbasnejad, Ramanathan Subramanian and Roland Goecke","title":"Efficient Labelling of Affective Video Datasets via Few-Shot &\n  Multi-Task Contrastive Learning","comments":"10 pages, 6 figures, to be published in Proceedings of the 31st ACM\n  International Conference on Multimedia (MM '23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Whilst deep learning techniques have achieved excellent emotion prediction,\nthey still require large amounts of labelled training data, which are (a)\nonerous and tedious to compile, and (b) prone to errors and biases. We propose\nMulti-Task Contrastive Learning for Affect Representation (\\textbf{MT-CLAR})\nfor few-shot affect inference. MT-CLAR combines multi-task learning with a\nSiamese network trained via contrastive learning to infer from a pair of\nexpressive facial images (a) the (dis)similarity between the facial\nexpressions, and (b) the difference in valence and arousal levels of the two\nfaces. We further extend the image-based MT-CLAR framework for automated video\nlabelling where, given one or a few labelled video frames (termed\n\\textit{support-set}), MT-CLAR labels the remainder of the video for valence\nand arousal. Experiments are performed on the AFEW-VA dataset with multiple\nsupport-set configurations; moreover, supervised learning on representations\nlearnt via MT-CLAR are used for valence, arousal and categorical emotion\nprediction on the AffectNet and AFEW-VA datasets. The results show that valence\nand arousal predictions via MT-CLAR are very comparable to the state-of-the-art\n(SOTA), and we significantly outperform SOTA with a support-set $\\approx$6\\%\nthe size of the video dataset.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:19:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Parameshwara","Ravikiran",""],["Radwan","Ibrahim",""],["Asthana","Akshay",""],["Abbasnejad","Iman",""],["Subramanian","Ramanathan",""],["Goecke","Roland",""]]}
{"id":"2308.02174","submitter":"Shu Takamatsu","authors":"Shu Takamatsu","title":"Improvement of the general theory for one dimensional nonlinear wave\n  equations related to the combined effect","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We focus on the general theory to the Cauchy problem for one dimensional\nnonlinear wave equations with small initial data. In the general theory, we aim\nto obtain the lower bound estimate of the lifespan of classical solution. In\nthis paper, we improve it in some case related to the combined effect, which\nwas expected complete more than 30 years ago.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:30:09 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Takamatsu","Shu",""]]}
{"id":"2308.02175","submitter":"P\\'eter Koltai","authors":"P\\'eter Koltai and Philipp Kunde","title":"A Koopman-Takens theorem: Linear least squares prediction of nonlinear\n  time series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The least squares linear filter, also called the Wiener filter, is a popular\ntool to predict the next element(s) of time series by linear combination of\ntime-delayed observations. We consider observation sequences of deterministic\ndynamics, and ask: Which pairs of observation function and dynamics are\npredictable? If one allows for nonlinear mappings of time-delayed observations,\nthen Takens' well-known theorem implies that a set of pairs, large in a\nspecific topological sense, exists for which an exact prediction is possible.\nWe show that a similar statement applies for the linear least squares filter in\nthe infinite-delay limit, by considering the forecast problem for invertible\nmeasure-preserving maps and the Koopman operator on square-integrable\nfunctions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:34:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Koltai","P\u00e9ter",""],["Kunde","Philipp",""]]}
{"id":"2308.02176","submitter":"Oskars Teikmanis","authors":"Oskars Teikmanis, Aleksandrs Levinskis, Andris Ivars Mackus, Artis\n  Ru\\v{s}i\\c{n}\\v{s}, Amr Elkenawy, Marta Tropa, Modris Greitans","title":"Automated Vehicle Platform with Connected Driving Capabilities","comments":"8 pages, 8 figures. Accepted to the 2023 IEEE International\n  Conference on Intelligent Transportation Systems (ITSC)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Augmenting automated vehicles to wirelessly detect and respond to external\nevents before they are detectable by onboard sensors is crucial for developing\ncontext-aware driving strategies. To this end, we present an automated vehicle\nplatform, designed with connectivity, ease of use and modularity in mind, both\nin hardware and software. It is based on the Kia Soul EV with a modified\nversion of the Open-Source Car Control (OSCC) drive-by-wire module, uses the\nopen-source Robot Operating System (ROS and ROS 2) in its software\narchitecture, and provides a straightforward solution for transitioning from\nsimulations to real-world tests. We demonstrate the effectiveness of the\nplatform through a synchronised driving test, where sensor data is exchanged\nwirelessly, and a model-predictive controller is used to actuate the automated\nvehicle.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:34:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Teikmanis","Oskars",""],["Levinskis","Aleksandrs",""],["Mackus","Andris Ivars",""],["Ru\u0161i\u0146\u0161","Artis",""],["Elkenawy","Amr",""],["Tropa","Marta",""],["Greitans","Modris",""]]}
{"id":"2308.02177","submitter":"Jieteng Yao","authors":"Jieteng Yao, Junjie Chen, Li Niu, Bin Sheng","title":"Scene-aware Human Pose Generation using Transformer","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Affordance learning considers the interaction opportunities for an actor in\nthe scene and thus has wide application in scene understanding and intelligent\nrobotics. In this paper, we focus on contextual affordance learning, i.e.,\nusing affordance as context to generate a reasonable human pose in a scene.\nExisting scene-aware human pose generation methods could be divided into two\ncategories depending on whether using pose templates. Our proposed method\nbelongs to the template-based category, which benefits from the representative\npose templates. Moreover, inspired by recent transformer-based methods, we\nassociate each query embedding with a pose template, and use the interaction\nbetween query embeddings and scene feature map to effectively predict the scale\nand offsets for each pose template. In addition, we employ knowledge\ndistillation to facilitate the offset learning given the predicted scale.\nComprehensive experiments on Sitcom dataset demonstrate the effectiveness of\nour method.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:39:09 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yao","Jieteng",""],["Chen","Junjie",""],["Niu","Li",""],["Sheng","Bin",""]]}
{"id":"2308.02178","submitter":"Manil T Mohan","authors":"Jai Tushar, Arbaz Khan and Manil T. Mohan","title":"Optimal Control of Stationary Doubly Diffusive Flows on Two and Three\n  Dimensional Bounded Lipschitz Domains: A Theoretical Study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this work, a theoretical framework is developed to study the control\nconstrained distributed optimal control of a stationary double diffusion model\npresented in [Burger, Mendez, Ruiz-Baier, SINUM (2019), 57:1318-1343]. For the\ncontrol problem, as the source term belongs to a weaker space, a new\nsolvability analysis of the governing equation is presented using Faedo-\nGalerkin approximation techniques. Some new minimal regularity results for the\ngoverning equation are established on two and three-dimensional bounded\nLipschitz domains and are of independent interest. Moreover, we show the\nexistence of an optimal control with quadratic type cost functional, study the\nFrechet differentiability properties of the control-to-state map and establish\nthe first-order necessary optimality conditions corresponding to the optimal\ncontrol problem.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:48:41 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tushar","Jai",""],["Khan","Arbaz",""],["Mohan","Manil T.",""]]}
{"id":"2308.02179","submitter":"Xu Han","authors":"Xu Han","title":"Strong Rigidity of Closed Minimal Hypersurfaces in Euclidean Spheres","comments":null,"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 embedded minimal hypersurface in a Euclidean sphere of\ndimension n+1, we prove that it is strongly rigid. As applications we confirm\nthe conjecture proposed by Choi and Schoen in [3] and the Chern conjecture for\nn less than 7.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:49:08 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 01:51:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Han","Xu",""]]}
{"id":"2308.02180","submitter":"Cliff Wong","authors":"Cliff Wong, Sheng Zhang, Yu Gu, Christine Moung, Jacob Abel, Naoto\n  Usuyama, Roshanthi Weerasinghe, Brian Piening, Tristan Naumann, Carlo\n  Bifulco, Hoifung Poon","title":"Scaling Clinical Trial Matching Using Large Language Models: A Case\n  Study in Oncology","comments":"24 pages, 5 figures, accepted at Machine Learning for Healthcare\n  (MLHC) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Clinical trial matching is a key process in health delivery and discovery. In\npractice, it is plagued by overwhelming unstructured data and unscalable manual\nprocessing. In this paper, we conduct a systematic study on scaling clinical\ntrial matching using large language models (LLMs), with oncology as the focus\narea. Our study is grounded in a clinical trial matching system currently in\ntest deployment at a large U.S. health network. Initial findings are promising:\nout of box, cutting-edge LLMs, such as GPT-4, can already structure elaborate\neligibility criteria of clinical trials and extract complex matching logic\n(e.g., nested AND/OR/NOT). While still far from perfect, LLMs substantially\noutperform prior strong baselines and may serve as a preliminary solution to\nhelp triage patient-trial candidates with humans in the loop. Our study also\nreveals a few significant growth areas for applying LLMs to end-to-end clinical\ntrial matching, such as context limitation and accuracy, especially in\nstructuring patient information from longitudinal medical records.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:51:15 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 02:53:06 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 20:05:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wong","Cliff",""],["Zhang","Sheng",""],["Gu","Yu",""],["Moung","Christine",""],["Abel","Jacob",""],["Usuyama","Naoto",""],["Weerasinghe","Roshanthi",""],["Piening","Brian",""],["Naumann","Tristan",""],["Bifulco","Carlo",""],["Poon","Hoifung",""]]}
{"id":"2308.02181","submitter":"Masashi Tsuge","authors":"Masashi Tsuge, Germ\\'an Molpeceres, Yuri Aikawa, and Naoki Watanabe","title":"Surface Diffusion of Carbon Atoms as a Driver of Interstellar Organic\n  Chemistry","comments":"33 pages (main + SI), 14 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many interstellar complex organic molecules (COMs) are believed to be\nproduced on the surfaces of icy grains at low temperatures. Atomic carbon is\nconsidered responsible for the skeletal evolution processes, such as C-C bond\nformation, via insertion or addition reactions. Before reactions, C atoms must\ndiffuse on the surface to encounter reaction partners; therefore, information\non their diffusion process is critically important for evaluating the role of C\natoms in the formation of COMs. In situ detection of C atoms on ice was\nachieved by a combination of photostimulated desorption and resonance enhanced\nmultiphoton ionization methods. We found that C atoms weakly bound to the ice\nsurface diffused approximately above 30 K and produced C2 molecules. The\nactivation energy for C-atom surface diffusion was experimentally determined to\nbe 88 meV (1,020 K), indicating that the diffusive reaction of C atoms is\nactivated at approximately 22 K on interstellar ice. The facile diffusion of C\nat T > 22 K atoms on interstellar ice opens a previously overlooked chemical\nregime where the increase in complexity of COMs as driven by C atoms. Carbon\naddition chemistry can be an alternative source of chemical complexity in\ntranslucent clouds and protoplanetary disks with crucial implications in our\ncurrent understanding on the origin and evolution of organic chemistry in our\nUniverse.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:54:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tsuge","Masashi",""],["Molpeceres","Germ\u00e1n",""],["Aikawa","Yuri",""],["Watanabe","Naoki",""]]}
{"id":"2308.02182","submitter":"Navid Malekghaini","authors":"Navid Malekghaini, Elham Akbari, Mohammad A. Salahuddin, Noura Limam,\n  Raouf Boutaba, Bertrand Mathieu, Stephanie Moteau, Stephane Tuffin","title":"AutoML4ETC: Automated Neural Architecture Search for Real-World\n  Encrypted Traffic Classification","comments":"A slightly different version is under review for possible publication\n  in IEEE TNSM journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning (DL) has been successfully applied to encrypted network traffic\nclassification in experimental settings. However, in production use, it has\nbeen shown that a DL classifier's performance inevitably decays over time.\nRe-training the model on newer datasets has been shown to only partially\nimprove its performance. Manually re-tuning the model architecture to meet the\nperformance expectations on newer datasets is time-consuming and requires\ndomain expertise. We propose AutoML4ETC, a novel tool to automatically design\nefficient and high-performing neural architectures for encrypted traffic\nclassification. We define a novel, powerful search space tailored specifically\nfor the near real-time classification of encrypted traffic using packet header\nbytes. We show that with different search strategies over our search space,\nAutoML4ETC generates neural architectures that outperform the state-of-the-art\nencrypted traffic classifiers on several datasets, including public benchmark\ndatasets and real-world TLS and QUIC traffic collected from the Orange mobile\nnetwork. In addition to being more accurate, AutoML4ETC's architectures are\nsignificantly more efficient and lighter in terms of the number of parameters.\nFinally, we make AutoML4ETC publicly available for future research.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:54:45 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 05:50:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Malekghaini","Navid",""],["Akbari","Elham",""],["Salahuddin","Mohammad A.",""],["Limam","Noura",""],["Boutaba","Raouf",""],["Mathieu","Bertrand",""],["Moteau","Stephanie",""],["Tuffin","Stephane",""]]}
{"id":"2308.02183","submitter":"Yi Xuan","authors":"Yao-Lan Tian, Yi Xuan","title":"Boundary Extensions for mappings between metric spaces","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider boundary extensions of two classes of mappings\nbetween metric measure spaces. These two mapping classes extend in particular\nthe well-studied geometric mappings such as quasiregular mappings with\nintegrable Jacobian determinant and mappings of exponentially integrable\ndistortion with integrable Jacobian determinant. Our main results extend the\ncorresponding results of \\\"Akkinen and Guo [Ann. Mat. Pure. Appl. 2017] to the\nsetting of metric measure spaces.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:55:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tian","Yao-Lan",""],["Xuan","Yi",""]]}
{"id":"2308.02184","submitter":"Gorka Velez Ph.D.","authors":"Martin Bikandi, Gorka Velez, Naiara Aginako and Itziar Irigoien","title":"Synthetic outlier generation for anomaly detection in autonomous driving","comments":"Accepted in the 26th IEEE International Conference on Intelligent\n  Transportation Systems (ITSC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Anomaly detection, or outlier detection, is a crucial task in various domains\nto identify instances that significantly deviate from established patterns or\nthe majority of data. In the context of autonomous driving, the identification\nof anomalies is particularly important to prevent safety-critical incidents, as\ndeep learning models often exhibit overconfidence in anomalous or outlier\nsamples. In this study, we explore different strategies for training an image\nsemantic segmentation model with an anomaly detection module. By introducing\nmodifications to the training stage of the state-of-the-art DenseHybrid model,\nwe achieve significant performance improvements in anomaly detection. Moreover,\nwe propose a simplified detector that achieves comparable results to our\nmodified DenseHybrid approach, while also surpassing the performance of the\noriginal DenseHybrid model. These findings demonstrate the efficacy of our\nproposed strategies for enhancing anomaly detection in the context of\nautonomous driving.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:55:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bikandi","Martin",""],["Velez","Gorka",""],["Aginako","Naiara",""],["Irigoien","Itziar",""]]}
{"id":"2308.02185","submitter":"R\\u{a}zvan-Alexandru Sm\\u{a}du","authors":"R\\u{a}zvan-Alexandru Sm\\u{a}du, Sebastian-Vasile Echim,\n  Dumitru-Clementin Cercel, Iuliana Marin, Florin Pop","title":"From Fake to Hyperpartisan News Detection Using Domain Adaptation","comments":"15 pages, 3 figures, Accepted by RANLP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Unsupervised Domain Adaptation (UDA) is a popular technique that aims to\nreduce the domain shift between two data distributions. It was successfully\napplied in computer vision and natural language processing. In the current\nwork, we explore the effects of various unsupervised domain adaptation\ntechniques between two text classification tasks: fake and hyperpartisan news\ndetection. We investigate the knowledge transfer from fake to hyperpartisan\nnews detection without involving target labels during training. Thus, we\nevaluate UDA, cluster alignment with a teacher, and cross-domain contrastive\nlearning. Extensive experiments show that these techniques improve performance,\nwhile including data augmentation further enhances the results. In addition, we\ncombine clustering and topic modeling algorithms with UDA, resulting in\nimproved performances compared to the initial UDA setup.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:58:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sm\u0103du","R\u0103zvan-Alexandru",""],["Echim","Sebastian-Vasile",""],["Cercel","Dumitru-Clementin",""],["Marin","Iuliana",""],["Pop","Florin",""]]}
{"id":"2308.02186","submitter":"Roberta Flenghi","authors":"Roberta Flenghi and Benjamin Jourdain","title":"Central limit theorem for the stratified resampling mechanism","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The stratified resampling mechanism is one of the resampling schemes commonly\nused in the resampling steps of particle filters. In the present paper, we\nprove a central limit theorem for this mechanism under the assumption that the\ninitial positions are independent and identically distributed and the weights\nproportional to a positive function of the positions such that the image of\ntheir common distribution by this function has a non zero component absolutely\ncontinuous with respect to the Lebesgue measure. This result relies on the\nconvergence in distribution of the fractional part of partial sums of the\nnormalized weights to some random variable uniformly distributed on $[0,1]$,\nwhich is established in the companion paper \\cite{CLTfract} by overcoming the\ndifficulty raised by the coupling through the normalization. Under the\nconjecture that a similar convergence in distribution remains valid at the next\nsteps of a particle filter which alternates selections according to the\nstratified resampling mechanism and mutations according to Markov kernels, we\nprovide an inductive formula for the asymptotic variance of the resampled\npopulation after $n$ steps. We perform numerical experiments which support the\nvalidity of this formula.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:01:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Flenghi","Roberta",""],["Jourdain","Benjamin",""]]}
{"id":"2308.02187","submitter":"Xuesong Wang","authors":"Dongsheng Zhang, Xuesong Wang, Tingting Zhang","title":"Influence of control parameters on electromechanical coupling\n  characteristics of feed systems and its decoupling method","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":"  When developing high-speed and high-precision CNC machine tools, subsystem\ncoupling effects must be considered while designing the feed system to maximize\nits dynamic performance. Currently, the influence of changes in control\nparameters on the matching characteristics of each subsystem was not yet\nconsidered when studying the coupling relationship between subsystems.\nTherefore, it is difficult to define the law of action between subsystems under\nthe interference of control parameters. Hence, a new method was proposed in\nthis paper aiming to isolate the disturbance of control parameters and to\nhighlight the actions between electromechanical subsystems. This was achieved\nby optimizing the servo control parameters for each configuration of\nelectromechanical parameters, ensuring that the feed system performance is\noptimal for the observed configuration. This approach eliminated the influence\nof the control subsystem on the electromechanical coupling relationship. The\napproach effectiveness was verified via the integrated model of the feed\nsystem. As such, this paper provides a reliable method to further study the\ncoupling mechanism of subsystems, revealing the mechanism behind the dynamic\ndesign of feed systems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:04:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Dongsheng",""],["Wang","Xuesong",""],["Zhang","Tingting",""]]}
{"id":"2308.02188","submitter":"Meirav Zehavi","authors":"Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi","title":"Kernelization of Counting Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a new framework for the analysis of preprocessing routines for\nparameterized counting problems. Existing frameworks that encapsulate\nparameterized counting problems permit the usage of exponential (rather than\npolynomial) time either explicitly or by implicitly reducing the counting\nproblems to enumeration problems. Thus, our framework is the only one in the\nspirit of classic kernelization (as well as lossy kernelization). Specifically,\nwe define a compression of a counting problem $P$ into a counting problem $Q$\nas a pair of polynomial-time procedures: $\\mathsf{reduce}$ and $\\mathsf{lift}$.\nGiven an instance of $P$, $\\mathsf{reduce}$ outputs an instance of $Q$ whose\nsize is bounded by a function $f$ of the parameter, and given the number of\nsolutions to the instance of $Q$, $\\mathsf{lift}$ outputs the number of\nsolutions to the instance of $P$. When $P=Q$, compression is termed\nkernelization, and when $f$ is polynomial, compression is termed polynomial\ncompression. Our technical (and other conceptual) contributions concern both\nupper bounds and lower bounds.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:11:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lokshtanov","Daniel",""],["Misra","Pranabendu",""],["Saurabh","Saket",""],["Zehavi","Meirav",""]]}
{"id":"2308.02189","submitter":"Xiao-Tian Zhang","authors":"Xiao-Tian Zhang, Yuya Ominato, Long Zhang and Mamoru Matsuo","title":"Spin pumping effect in non-Fermi liquid metals","comments":"5 pages, 3 figures with supplementary materials(11 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":"  We propose that the spin pumping effect is a valuable probe to non-Fermi\nliquid (NFL) metals in correlated electron systems. In a bilayer structure\ncomposed of a NFL metal and a ferromagnetic insulator subjected to ac magnetic\nfield, the precessing spins in the FI inject spin current into the NFL metal,\nwhich modulates the ferromagnetic resonance (FMR) as a backaction. For NFL\nmetals in the vicinity of a quantum critical point, the FMR modulation shows\npower-law scaling with the frequency and the temperature, which is closely\nrelated to the quantum critical behavior and reflects the non-quasiparticle\nnature of spin relaxation in NFL metals.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:12:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Xiao-Tian",""],["Ominato","Yuya",""],["Zhang","Long",""],["Matsuo","Mamoru",""]]}
{"id":"2308.02190","submitter":"Jiaxin Ye","authors":"Jiaxin Ye and Yujie Wei and Xin-Cheng Wen and Chenglong Ma and\n  Zhizhong Huang and Kunhong Liu and Hongming Shan","title":"Emo-DNA: Emotion Decoupling and Alignment Learning for Cross-Corpus\n  Speech Emotion Recognition","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3611704","report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-corpus speech emotion recognition (SER) seeks to generalize the ability\nof inferring speech emotion from a well-labeled corpus to an unlabeled one,\nwhich is a rather challenging task due to the significant discrepancy between\ntwo corpora. Existing methods, typically based on unsupervised domain\nadaptation (UDA), struggle to learn corpus-invariant features by global\ndistribution alignment, but unfortunately, the resulting features are mixed\nwith corpus-specific features or not class-discriminative. To tackle these\nchallenges, we propose a novel Emotion Decoupling aNd Alignment learning\nframework (EMO-DNA) for cross-corpus SER, a novel UDA method to learn\nemotion-relevant corpus-invariant features. The novelties of EMO-DNA are\ntwo-fold: contrastive emotion decoupling and dual-level emotion alignment. On\none hand, our contrastive emotion decoupling achieves decoupling learning via a\ncontrastive decoupling loss to strengthen the separability of emotion-relevant\nfeatures from corpus-specific ones. On the other hand, our dual-level emotion\nalignment introduces an adaptive threshold pseudo-labeling to select confident\ntarget samples for class-level alignment, and performs corpus-level alignment\nto jointly guide model for learning class-discriminative corpus-invariant\nfeatures across corpora. Extensive experimental results demonstrate the\nsuperior performance of EMO-DNA over the state-of-the-art methods in several\ncross-corpus scenarios. Source code is available at\nhttps://github.com/Jiaxin-Ye/Emo-DNA.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:15:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ye","Jiaxin",""],["Wei","Yujie",""],["Wen","Xin-Cheng",""],["Ma","Chenglong",""],["Huang","Zhizhong",""],["Liu","Kunhong",""],["Shan","Hongming",""]]}
{"id":"2308.02191","submitter":"Qiang Zhou","authors":"Qiang Zhou, Chaohui Yu, Jingliang Li, Yuang Liu, Jing Wang, Zhibin\n  Wang","title":"ES-MVSNet: Efficient Framework for End-to-end Self-supervised Multi-View\n  Stereo","comments":"arXiv admin note: text overlap with arXiv:2203.03949 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Compared to the multi-stage self-supervised multi-view stereo (MVS) method,\nthe end-to-end (E2E) approach has received more attention due to its concise\nand efficient training pipeline. Recent E2E self-supervised MVS approaches have\nintegrated third-party models (such as optical flow models, semantic\nsegmentation models, NeRF models, etc.) to provide additional consistency\nconstraints, which grows GPU memory consumption and complicates the model's\nstructure and training pipeline. In this work, we propose an efficient\nframework for end-to-end self-supervised MVS, dubbed ES-MVSNet. To alleviate\nthe high memory consumption of current E2E self-supervised MVS frameworks, we\npresent a memory-efficient architecture that reduces memory usage by 43%\nwithout compromising model performance. Furthermore, with the novel design of\nasymmetric view selection policy and region-aware depth consistency, we achieve\nstate-of-the-art performance among E2E self-supervised MVS methods, without\nrelying on third-party models for additional consistency signals. Extensive\nexperiments on DTU and Tanks&Temples benchmarks demonstrate that the proposed\nES-MVSNet approach achieves state-of-the-art performance among E2E\nself-supervised MVS methods and competitive performance to many supervised and\nmulti-stage self-supervised methods.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:16:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhou","Qiang",""],["Yu","Chaohui",""],["Li","Jingliang",""],["Liu","Yuang",""],["Wang","Jing",""],["Wang","Zhibin",""]]}
{"id":"2308.02192","submitter":"BIngxin Li","authors":"Yuanfeng Ding, Bingxin Li, Chen Li, Yan-Bin Chen, Hong Lu and Yan-Feng\n  Chen","title":"Transport evidence of the three-dimensional Dirac semimetal phase in\n  doped $\\alpha$-Sn grown by molecular beam epitaxy","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":"  We report the quantum transport properties of the $\\alpha$-Sn films grown on\nCdTe (001) substrates by molecular beam epitaxy. The $\\alpha$-Sn films are\ndoped with phosphorus to tune the Fermi level and access the bulk state. Clear\nShubnikov-de Haas oscillations can be observed below 30 K and a nontrivial\nBerry phase has been confirmed. A nearly spherical Fermi surface has been\ndemonstrated by angle-dependent oscillation frequencies. In addition, the sign\nof negative magnetoresistance which is attributed to the chiral anomaly has\nalso been observed. These results provide strong evidence of the\nthree-dimensional Dirac semimetal phase in $\\alpha$-Sn.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:17:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ding","Yuanfeng",""],["Li","Bingxin",""],["Li","Chen",""],["Chen","Yan-Bin",""],["Lu","Hong",""],["Chen","Yan-Feng",""]]}
{"id":"2308.02193","submitter":"Lars Kl\\\"oser","authors":"Lars Kl\\\"oser, Andre B\\\"usgen, Philipp Kohl, Bodo Kraft, Albert\n  Z\\\"undorf","title":"Explaining Relation Classification Models with Semantic Extents","comments":"Accepted at DeLTA 2023: Deep Learning Theory and Applications\n  conference","journal-ref":null,"doi":"10.1007/978-3-031-39059-3_13","report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In recent years, the development of large pretrained language models, such as\nBERT and GPT, significantly improved information extraction systems on various\ntasks, including relation classification. State-of-the-art systems are highly\naccurate on scientific benchmarks. A lack of explainability is currently a\ncomplicating factor in many real-world applications. Comprehensible systems are\nnecessary to prevent biased, counterintuitive, or harmful decisions.\n  We introduce semantic extents, a concept to analyze decision patterns for the\nrelation classification task. Semantic extents are the most influential parts\nof texts concerning classification decisions. Our definition allows similar\nprocedures to determine semantic extents for humans and models. We provide an\nannotation tool and a software framework to determine semantic extents for\nhumans and models conveniently and reproducibly. Comparing both reveals that\nmodels tend to learn shortcut patterns from data. These patterns are hard to\ndetect with current interpretability methods, such as input reductions. Our\napproach can help detect and eliminate spurious decision patterns during model\ndevelopment. Semantic extents can increase the reliability and security of\nnatural language processing systems. Semantic extents are an essential step in\nenabling applications in critical areas like healthcare or finance. Moreover,\nour work opens new research directions for developing methods to explain deep\nlearning models.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:17:52 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kl\u00f6ser","Lars",""],["B\u00fcsgen","Andre",""],["Kohl","Philipp",""],["Kraft","Bodo",""],["Z\u00fcndorf","Albert",""]]}
{"id":"2308.02194","submitter":"Ioan Marius Bilasco PhD","authors":"Gaspard Goupy, Pierre Tirilly, Ioan Marius Bilasco","title":"Paired Competing Neurons Improving STDP Supervised Local Learning In\n  Spiking Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Direct training of Spiking Neural Networks (SNNs) on neuromorphic hardware\nhas the potential to significantly reduce the high energy consumption of\nArtificial Neural Networks (ANNs) training on modern computers. The biological\nplausibility of SNNs allows them to benefit from bio-inspired plasticity rules,\nsuch as Spike Timing-Dependent Plasticity (STDP). STDP offers gradient-free and\nunsupervised local learning, which can be easily implemented on neuromorphic\nhardware. However, relying solely on unsupervised STDP to perform\nclassification tasks is not enough. In this paper, we propose Stabilized\nSupervised STDP (S2-STDP), a supervised STDP learning rule to train the\nclassification layer of an SNN equipped with unsupervised STDP. S2-STDP\nintegrates error-modulated weight updates that align neuron spikes with desired\ntimestamps derived from the average firing time within the layer. Then, we\nintroduce a training architecture called Paired Competing Neurons (PCN) to\nfurther enhance the learning capabilities of our classification layer trained\nwith S2-STDP. PCN associates each class with paired neurons and encourages\nneuron specialization through intra-class competition. We evaluated our\nproposed methods on image recognition datasets, including MNIST, Fashion-MNIST,\nand CIFAR-10. Results showed that our methods outperform current supervised\nSTDP-based state of the art, for comparable architectures and numbers of\nneurons. Also, the use of PCN enhances the performance of S2-STDP, regardless\nof the configuration, and without introducing any hyperparameters.Further\nanalysis demonstrated that our methods exhibited improved hyperparameter\nrobustness, which reduces the need for tuning.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:20:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Goupy","Gaspard",""],["Tirilly","Pierre",""],["Bilasco","Ioan Marius",""]]}
{"id":"2308.02195","submitter":"Guangjun Shen","authors":"Guangjun Shen, Jie Xiang and Jiang-Lun Wu","title":"Stochastic averaging principle and stability for multi-valued\n  McKean-Vlasov stochastic differential equations with jumps","comments":"31 pages. arXiv admin note: text overlap with arXiv:2106.12080 by\n  other authors","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 consider the stochastic averaging principle and stability\nfor multi-valued McKean-Vlasov stochastic differential equations with jumps.\nFirst, under certain averaging conditions, we are able to show that the\nsolutions of the equations concerned can be approximated by solutions of the\nassociated averaged multi-valued McKean-Vlasov stochastic differential\nequations with jumps in the sense of the mean square convergence. Second, we\nextend the classical It\\^{o}'s formula from stochastic differential equations\nto multi-valued McKean-Vlasov stochastic differential equations with jumps.\nLast, as application of It\\^{o}'s formula, we present the exponential stability\nof second moments, the exponentially 2-ultimate boundedness and the almost\nsurely asymptotic stability for their solutions in terms of a Lyapunov\nfunction.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:25:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shen","Guangjun",""],["Xiang","Jie",""],["Wu","Jiang-Lun",""]]}
{"id":"2308.02196","submitter":"Michail Zampetakis","authors":"Michail Zampetakis, Fanouria Antoniou, Hannes Bartosik and Yannis\n  Papaphilippou","title":"Interplay of Space Charge, Intra-Beam Scattering and Synchrotron\n  Radiation in the CLIC Damping Rings","comments":"15 pages, 27 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Future ultra-low emittance rings for electron/positron colliders requiring\nextremely high beam brightness can be limited by collective effects. In this\npaper, the interplay of effects such as synchrotron radiation, intra-beam\nscattering (IBS) and space charge in the vicinity of excited betatron\nresonances is assessed. In this respect, two algorithms were developed to\nsimulate IBS and synchrotron radiation effects and integrated in the pyORBIT\ntracking code, to be combined with its widely used space charge module. The\nimpact of these effects on the achievable beam parameters of the Compact Linear\nCollider (CLIC) Damping Rings was studied, showing that synchrotron radiation\ndamping mitigates the adverse effects of IBS and space charge induced resonance\ncrossing. The studies include also a full dynamic simulation of the CLIC\ndamping ring cycle starting from the injection beam parameters. It is\ndemonstrated that a careful working point choice is necessary, in order to\naccommodate the transition from a non-linear lattice induced detuning to a\nspace-charge dominated one and thereby avoid excessive losses and emittance\ngrowth generated in the vicinity of strong resonances.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:28:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zampetakis","Michail",""],["Antoniou","Fanouria",""],["Bartosik","Hannes",""],["Papaphilippou","Yannis",""]]}
{"id":"2308.02197","submitter":"Gorka Velez Ph.D.","authors":"Mikel Garc\\'ia, Gorka Velez, Josu P\\'erez, \\'Angel Mart\\'in, Zaloa\n  Fern\\'andez and Naiara Aginako","title":"Edge Dynamic Map architecture for C-ITS applications","comments":"Accepted in the 26th IEEE International Conference on Intelligent\n  Transportation Systems (ITSC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.DB","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cooperative Intelligent Transport Systems (C-ITS) create, share and process\nmassive amounts of data which needs to be real-time managed to enable new\ncooperative and autonomous driving applications. Vehicle-to-Everything (V2X)\ncommunications facilitate information exchange among vehicles and\ninfrastructures using various protocols. By providing computer power, data\nstorage, and low latency capabilities, Multi-access Edge Computing (MEC) has\nbecome a key enabling technology in the transport industry. The Local Dynamic\nMap (LDM) concept has consequently been extended to its utilisation in MECs,\ninto an efficient, collaborative, and centralised Edge Dynamic Map (EDM) for\nC-ITS applications. This research presents an EDM architecture for V2X\ncommunications and implements a real-time proof-of-concept using a Time-Series\nDatabase (TSDB) engine to store vehicular message information. The performance\nevaluation includes data insertion and querying, assessing the system's\ncapacity and scale for low-latency Cooperative Awareness Message (CAM)\napplications. Traffic simulations using SUMO have been employed to generate\nvirtual routes for thousands of vehicles, demonstrating the transmission of\nvirtual CAM messages to the EDM.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:28:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Garc\u00eda","Mikel",""],["Velez","Gorka",""],["P\u00e9rez","Josu",""],["Mart\u00edn","\u00c1ngel",""],["Fern\u00e1ndez","Zaloa",""],["Aginako","Naiara",""]]}
{"id":"2308.02198","submitter":"Andrea Franceschini","authors":"Andrea Franceschini, Claudia Zoccarato, Selena Baldan, Matteo Frigo,\n  Massimiliano Ferronato, Carlo Janna, Giovanni Isotton, Pietro Teatini","title":"Unexpected fault activation in underground gas storage. Part I:\n  Mathematical model and mechanisms","comments":"22 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":"  Underground gas storage (UGS) is a worldwide well-established technology that\nis becoming even more important to cope with seasonal peaks of gas consumption\ndue to the growing uncertainties of the energy market. Safety issues concerning\nthe reactivation of pre-existing faults might arise if the target reservoir is\nlocated in a faulted basin, where human activities can trigger\n(micro-)seismicity events. In the Netherlands, it has been observed that fault\nactivation can occur somehow \"unexpectedly\" after the primary production (PP),\ni.e., during cushion gas injection (CGI) and UGS cycles, when the stress regime\nshould be in the unloading/reloading path. To understand the physical\nmechanisms responsible for such occurrences, a 3D mathematical model coupling\nfrictional contact mechanics in faulted porous rocks with fluid flow is\ndeveloped, implemented and tested. The final aim of this two-part work is to\ndefine a safe operational bandwidth for the pore pressure range for UGS\nactivities in the faulted reservoirs of the Rotliegend formation. Part I of\nthis work concerns the development of the mathematical and numerical model of\nfrictional contact mechanics and flow in faulted porous rocks. A mixed\ndiscretization of the governing PDEs under frictional contact constraints along\nthe faults is used. A slip-weakening constitutive law governing the fault\nmacroscopic behavior is also presented. The model is tested in the setting of\nan ideal reservoir located in the Rotliegend formation. The analyses point out\nhow fault reactivation during PP can lead to a stress redistribution, giving\nrise to a new equilibrium configuration. When the fault is reloaded in the\nopposite direction during the CGI and/or UGS stages, further activation events\ncan occur even if the stress range does not exceed either the undisturbed\ninitial value or the maximum strength ever experienced by the formation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:31:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Franceschini","Andrea",""],["Zoccarato","Claudia",""],["Baldan","Selena",""],["Frigo","Matteo",""],["Ferronato","Massimiliano",""],["Janna","Carlo",""],["Isotton","Giovanni",""],["Teatini","Pietro",""]]}
{"id":"2308.02199","submitter":"Guillem Garc\\'ia Subies","authors":"Guillem Garc\\'ia Subies, \\'Alvaro Barbero Jim\\'enez, Paloma Mart\\'inez\n  Fern\\'andez","title":"A Survey of Spanish Clinical Language Models","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":"  This survey focuses in encoder Language Models for solving tasks in the\nclinical domain in the Spanish language. We review the contributions of 17\ncorpora focused mainly in clinical tasks, then list the most relevant Spanish\nLanguage Models and Spanish Clinical Language models. We perform a thorough\ncomparison of these models by benchmarking them over a curated subset of the\navailable corpora, in order to find the best-performing ones; in total more\nthan 3000 models were fine-tuned for this study. All the tested corpora and the\nbest models are made publically available in an accessible way, so that the\nresults can be reproduced by independent teams or challenged in the future when\nnew Spanish Clinical Language models are created.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:33:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Subies","Guillem Garc\u00eda",""],["Jim\u00e9nez","\u00c1lvaro Barbero",""],["Fern\u00e1ndez","Paloma Mart\u00ednez",""]]}
{"id":"2308.02200","submitter":"Ashay Wakode","authors":"Ashay Wakode, Arpita Sinha","title":"Online Obstacle evasion with Space-Filling Curves","comments":"6 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper presents a strategy for robotic exploration problems using\nSpace-Filling curves (SFC). The region of interest is first tessellated, and\nthe tiles/cells are connected using some SFC. A robot follows the SFC to\nexplore the entire area. However, there could be obstacles that block the\nsystematic movement of the robot. We overcome this problem by providing an\nevading technique that avoids the blocked tiles while ensuring all the free\nones are visited at least once. The proposed strategy is online, implying that\nprior knowledge of the obstacles is not mandatory. It works for all SFCs, but\nfor the sake of demonstration, we use Hilbert curve. We present the\ncompleteness of the algorithm and discuss its desirable properties with\nexamples. We also address the non-uniform coverage problem using our strategy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:34:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wakode","Ashay",""],["Sinha","Arpita",""]]}
{"id":"2308.02201","submitter":"Bruno Schuler","authors":"Feifei Xiang, Lysander Huberich, Preston A. Vargas, Riccardo Torsi,\n  Jonas Allerbeck, Anne Marie Z. Tan, Chengye Dong, Pascal Ruffieux, Roman\n  Fasel, Oliver Gr\\\"oning, Yu-Chuan Lin, Richard G. Hennig, Joshua A. Robinson,\n  Bruno Schuler","title":"Charge State-Dependent Symmetry Breaking of Atomic Defects in Transition\n  Metal Dichalcogenides","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/4.0/","abstract":"  The functionality of atomic quantum emitters is intrinsically linked to their\nhost lattice coordination. Structural distortions that spontaneously break the\nlattice symmetry strongly impact their optical emission properties and\nspin-photon interface. Here we report on the direct imaging of charge\nstate-dependent symmetry breaking of two prototypical atomic quantum emitters\nin mono- and bilayer MoS$_2$ by scanning tunneling microscopy (STM) and\nnon-contact atomic force microscopy (nc-AFM). By substrate chemical gating\ndifferent charge states of sulfur vacancies (Vac$_\\text{S}$) and substitutional\nrhenium dopants (Re$_\\text{Mo}$) can be stabilized. Vac$_\\text{S}^{-1}$ as well\nas Re$_\\text{Mo}^{0}$ and Re$_\\text{Mo}^{-1}$ exhibit local lattice distortions\nand symmetry-broken defect orbitals attributed to a Jahn-Teller effect (JTE)\nand pseudo-JTE, respectively. By mapping the electronic and geometric structure\nof single point defects, we disentangle the effects of spatial averaging,\ncharge multistability, configurational dynamics, and external perturbations\nthat often mask the presence of local symmetry breaking.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:34:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xiang","Feifei",""],["Huberich","Lysander",""],["Vargas","Preston A.",""],["Torsi","Riccardo",""],["Allerbeck","Jonas",""],["Tan","Anne Marie Z.",""],["Dong","Chengye",""],["Ruffieux","Pascal",""],["Fasel","Roman",""],["Gr\u00f6ning","Oliver",""],["Lin","Yu-Chuan",""],["Hennig","Richard G.",""],["Robinson","Joshua A.",""],["Schuler","Bruno",""]]}
{"id":"2308.02202","submitter":"Sulagna Mukherjee","authors":"S.Mukherjee, S.Ravi, P.Schmitt, B.Raghavan","title":"SoK: The Ghost Trilemma","comments":"22 pages with 1 figure and 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Trolls, bots, and sybils distort online discourse and compromise the security\nof networked platforms. User identity is central to the vectors of attack and\nmanipulation employed in these contexts. However it has long seemed that, try\nas it might, the security community has been unable to stem the rising tide of\nsuch problems. We posit the Ghost Trilemma, that there are three key properties\nof identity -- sentience, location, and uniqueness -- that cannot be\nsimultaneously verified in a fully-decentralized setting. Many\nfully-decentralized systems -- whether for communication or social coordination\n-- grapple with this trilemma in some way, perhaps unknowingly. In this\nSystematization of Knowledge (SoK) paper, we examine the design space, use\ncases, problems with prior approaches, and possible paths forward. We sketch a\nproof of this trilemma and outline options for practical, incrementally\ndeployable schemes to achieve an acceptable tradeoff of trust in centralized\ntrust anchors, decentralized operation, and an ability to withstand a range of\nattacks, while protecting user privacy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:36:43 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 21:56:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mukherjee","S.",""],["Ravi","S.",""],["Schmitt","P.",""],["Raghavan","B.",""]]}
{"id":"2308.02203","submitter":"Stefano Radrizzani","authors":"Stefano Radrizzani and Giulio Panzani and Luca Trezza and Solomon\n  Pizzocaro and Sergio M. Savaresi","title":"An Add-on Model Predictive Control Strategy for the Energy Management of\n  Hybrid Electric Tractors","comments":"Submitted to IEEE Transactions on Vehicular Technology","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The hybridization process has recently touched also the world of agricultural\nvehicles. Within this context, we develop an Energy Management Strategy (EMS)\naiming at optimizing fuel consumption, while maintaining the battery state of\ncharge. A typical feature of agricultural machines is that their internal\ncombustion engine is speed controlled, tracking the reference requested by the\ndriver. In view of avoiding any modification on this original control loop, an\nadd-on EMS strategy is proposed. In particular, we employ a multi-objective\nModel Predictive Control (MPC), taking into account the fuel consumption\nminimization and the speed tracking requirement, including the engine speed\ncontroller in the predictive model. The proposed MPC is tested in an\nexperimentally-validated simulation environment, representative of an orchard\nvineyard tractor.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:36:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Radrizzani","Stefano",""],["Panzani","Giulio",""],["Trezza","Luca",""],["Pizzocaro","Solomon",""],["Savaresi","Sergio M.",""]]}
{"id":"2308.02204","submitter":"Liangliang Su","authors":"Liangliang Su, Lei Wu, and Bin Zhu","title":"An Improved Bound on Accelerated Light Dark Matter","comments":"14 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":"  Light (sub-GeV) dark matter is of growing interest in direct detection.\nAccelerated dark matter presents itself as a promising candidate capable of\ngenerating detectable nuclear recoil energy within the sub-GeV range. Due to\nthe large kinetic energy, its interactions with the nucleus are predominantly\ngoverned by inelastic scattering, including quasi-elastic and deep inelastic\nscattering. In this work, we calculate the inelastic effects in the dark\nmatter-Earth scattering mediated by a vector particle. Our analysis reveals\nthat the impact of the inelastic scattering relies on the mediator mass and the\nkinetic energy spectrum of dark matter. The results exhibit a significant\ndisparity, with the upper bounds of the exclusion limit for the\nspin-independent cross section between accelerated dark matter and nuclei via a\nheavy mediator differing by several tens of times when inelastic scattering is\ntaken into account.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:40:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Su","Liangliang",""],["Wu","Lei",""],["Zhu","Bin",""]]}
{"id":"2308.02205","submitter":"Yuanhe Guo","authors":"Yuanhe Guo, Haoming Liu, Hongyi Wen","title":"Towards Personalized Prompt-Model Retrieval for Generative\n  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":"  Recommender Systems are built to retrieve relevant items to satisfy users'\ninformation needs. The candidate corpus usually consists of a finite set of\nitems that are ready to be served, such as videos, products, or articles. With\nrecent advances in Generative AI such as GPT and Diffusion models, a new form\nof recommendation task is yet to be explored where items are to be created by\ngenerative models with personalized prompts. Taking image generation as an\nexample, with a single prompt from the user and access to a generative model,\nit is possible to generate hundreds of new images in a few minutes. How shall\nwe attain personalization in the presence of \"infinite\" items? In this\npreliminary study, we propose a two-stage framework, namely Prompt-Model\nRetrieval and Generated Item Ranking, to approach this new task formulation. We\nrelease GEMRec-18K, a prompt-model interaction dataset with 18K images\ngenerated by 200 publicly-available generative models paired with a diverse set\nof 90 textual prompts. Our findings demonstrate the promise of generative model\nrecommendation as a novel personalization problem and the limitations of\nexisting evaluation metrics. We highlight future directions for the RecSys\ncommunity to advance towards generative recommender systems. Our code and\ndataset are available at https://github.com/MAPS-research/GEMRec.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:45:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Guo","Yuanhe",""],["Liu","Haoming",""],["Wen","Hongyi",""]]}
{"id":"2308.02206","submitter":"Yassine Tahraoui","authors":"Yassine Tahraoui","title":"Large deviations for an obstacle problem with T-monotone operator and\n  multiplicative noise","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the large deviation principle (LDP) for obstacle\nproblems governed by a T-monotone operator and small multiplicative stochastic\nreaction. Our approach relies on a combination of new sufficient condition to\nprove LDP by Matoussi, Sabbagh and Zhang [\\textit{Appl. Math. Optim.} 83:\n849-879, 2021] and Lewy-Stampacchia inequalities to manage the\nLagrange-multiplier associated with the obstacle.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:47:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tahraoui","Yassine",""]]}
{"id":"2308.02207","submitter":"Dino Novko","authors":"Nina Girotto, Fabio Caruso, Dino Novko","title":"Ultrafast nonadiabatic phonon renormalization in photoexcited\n  single-layer MoS$_2$","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Comprehending nonequilibrium electron-phonon dynamics at the microscopic\nlevel and at the short time scales is one of the main goals in condensed matter\nphysics. Effective temperature models and time-dependent Boltzmann equations\nare standard techniques for exploring and understanding nonequilibrium state\nand the corresponding scattering channels. However, these methods consider only\nthe time evolution of carrier occupation function, while the self-consistent\nphonon dressing in each time instant coming from the nonequilibrium population\nis ignored, which makes them less suitable for studying ultrafast phenomena\nwhere softening of the phonon modes plays an active role. Here, we combine\nab-initio time-dependent Boltzmann equations and many-body phonon self-energy\ncalculations to investigate the full momentum- and mode-resolved nonadiabatic\nphonon renormalization picture in the MoS$_2$ monolayer under nonequilibrium\nconditions. Our results show that the nonequilibrium state of photoexcited\nMoS$_2$ is governed by multi-valley topology of valence and conduction bands\nthat brings about characteristic anisotropic electron-phonon thermalization\npaths and the corresponding phonon renormalization of strongly-coupled modes\naround high-symmetry points of the Brillouin zone. As the carrier population is\nthermalized towards its equilibrium state, we track in time the evolution of\nthe remarkable phonon anomalies induced by nonequilibrium and the overall\nenhancement of the phonon relaxation rates. This work shows potential\nguidelines to tailor the electron-phonon relaxation channels and control the\nphonon dynamics under extreme photoexcited conditions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:48:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Girotto","Nina",""],["Caruso","Fabio",""],["Novko","Dino",""]]}
{"id":"2308.02208","submitter":"Giorgia Azzurra Marson","authors":"Elina van Kempen and Qifei Li and Giorgia Azzurra Marson and Claudio\n  Soriente","title":"LISA: LIghtweight single-server Secure Aggregation with a public source\n  of randomness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Secure Aggregation (SA) is a key component of privacy-friendly federated\nlearning applications, where the server learns the sum of many user-supplied\ngradients, while individual gradients are kept private. State-of-the-art SA\nprotocols protect individual inputs with zero-sum random shares that are\ndistributed across users, have a per-user overhead that is logarithmic in the\nnumber of users, and take more than 5 rounds of interaction. In this paper, we\nintroduce LISA, an SA protocol that leverages a source of public randomness to\nminimize per-user overhead and the number of rounds. In particular, LISA\nrequires only two rounds and has a communication overhead that is\nasymptotically equal to that of a non-private protocol -- one where inputs are\nprovided to the server in the clear -- for most of the users. In a nutshell,\nLISA uses public randomness to select a subset of the users -- a committee --\nthat aid the server to recover the aggregated input. Users blind their\nindividual contributions with randomness shared with each of the committee\nmembers; each committee member provides the server with an aggregate of the\nrandomness shared with each user. Hence, as long as one committee member is\nhonest, the server cannot learn individual inputs but only the sum of\nthreshold-many inputs. We compare LISA with state-of-the-art SA protocols both\ntheoretically and by means of simulations and present results of our\nexperiments. We also integrate LISA in a Federated Learning pipeline and\ncompare its performance with a non-private protocol.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:50:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["van Kempen","Elina",""],["Li","Qifei",""],["Marson","Giorgia Azzurra",""],["Soriente","Claudio",""]]}
{"id":"2308.02209","submitter":"Cristina Acciarri","authors":"Cristina Acciarri and Pavel Shumyatsky","title":"Varieties of groups and the problem on conciseness of words","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A group-word $w$ is concise in a class of groups $\\mathcal X$ if and only if\nthe verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many\nvalues in a group $G\\in \\mathcal X$. It is a long-standing open problem whether\nevery word is concise in residually finite groups. In this paper we observe\nthat the conciseness of a word $w$ in residually finite groups is equivalent to\nthat in the class of virtually pro-$p$ groups.\n  This is used to show that if $q,n$ are positive integers and $w$ is a\nmultilinear commutator word, then the words $w^q$ and $[w^q,_{n} y]$ are\nconcise in residually finite groups. Earlier this was known only in the case\nwhere $q$ is a prime power.\n  In the course of the proof we establish that certain classes of groups\nsatisfying the law $w^q\\equiv1$, or $[\\delta_k^q,{}_n\\, y]\\equiv1$, are\nvarieties.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:51:18 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Acciarri","Cristina",""],["Shumyatsky","Pavel",""]]}
{"id":"2308.02210","submitter":"Brian White","authors":"David Hoffman, Francisco Mart\\'in, Brian White","title":"Translating Annuli for Mean Curvature Flow","comments":"83 pages, 9 figures. Revised version (Aug 26, 2023) includes a\n  slightly expanded introduction, and additional citations","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a family of complete, properly embedded, annular translators $M$\nsuch that $M$ lies in a slab and is invariant under reflections in the vertical\ncoordinate planes. Each translator in the family is asymptotic as $z\\to\n-\\infty$ to four vertical planes $\\{y= \\pm b\\}$ and $\\{y= \\pm B\\}$, where $0<b\n\\le B < \\infty$. We call $b$ and $B$ the inner width and the (outer) width of\nthe translator. We show that for each $b \\ge \\pi/2$ and each $s>0$, there is a\ntranslator in the family with inner width $b$ and with necksize $s$. (We also\nshow that there are no translators with inner width $<\\pi/2$ having the\nproperties of the examples we construct.)\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:52:44 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 15:33:14 GMT"},{"version":"v3","created":"Sun, 27 Aug 2023 00:09:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hoffman","David",""],["Mart\u00edn","Francisco",""],["White","Brian",""]]}
{"id":"2308.02211","submitter":"Yasuhiro Asano","authors":"Takumi Sato, Shingo Kobayashi, and Yasuhiro Asano","title":"Discontinuous Transition to Superconducting Phase","comments":"5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss the instability of uniform superconducting states that contain the\npairing correlations belonging to the odd-frequency symmetry class. The\ninstability originates from the paramagnetic response of odd-frequency Cooper\npairs and is considerable at finite temperatures. As a result, the pair\npotential varies discontinuously at the transition temperature when the\namplitude of the odd-frequency pairing correlation functions is sufficiently\nlarge. The discontinuous transition to the superconducting phase is a general\nfeature of superconductors that include odd-frequency Cooper pairs.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:03:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sato","Takumi",""],["Kobayashi","Shingo",""],["Asano","Yasuhiro",""]]}
{"id":"2308.02212","submitter":"Ly Dinh","authors":"Ly Dinh, William C. Barley, Lauren Johnson, Brian F. Allan","title":"Hyperauthored papers disproportionately amplify important egocentric\n  network metrics","comments":"36 pages, 8 figures, 3 tables, journal preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Hyperauthorship, a phenomenon whereby there are a disproportionately large\nnumber of authors on a single paper, is increasingly common in several\nscientific disciplines, but with unknown consequences for network metrics used\nto study scientific collaboration. The validity of co-authorship as a proxy for\nscientific collaboration is affected by this. Using bibliometric data from\npublications in the field of genomics, we examine the impact of hyperauthorship\non metrics of scientific collaboration, and propose a method to determine a\nsuitable cutoff threshold for hyperauthored papers and compare co-authorship\nnetworks with and without hyperauthored works. Our analysis reveals that\nincluding hyperauthored papers dramatically impacts the structural positioning\nof central authors and the topological characteristics of the network, while\nproducing small influences on whole-network cohesion measures. We present two\nsolutions to minimize the impact of hyperauthorship: using a mathematically\ngrounded and reproducible calculation of threshold cutoff to exclude\nhyperauthored papers or fractional counting to weight network results. Our\nfindings affirm the structural influences of hyperauthored papers and suggest\nthat scholars should be mindful when using co-authorship networks to study\nscientific collaboration.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:06:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dinh","Ly",""],["Barley","William C.",""],["Johnson","Lauren",""],["Allan","Brian F.",""]]}
{"id":"2308.02213","submitter":"Tianhao Qi","authors":"Tianhao Qi, Hongtao Xie, Pandeng Li, Jiannan Ge, Yongdong Zhang","title":"Balanced Classification: A Unified Framework for Long-Tailed Object\n  Detection","comments":"Accepted by IEEE Transactions on Multimedia, to be published; Code:\n  https://github.com/Tianhao-Qi/BACL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conventional detectors suffer from performance degradation when dealing with\nlong-tailed data due to a classification bias towards the majority head\ncategories. In this paper, we contend that the learning bias originates from\ntwo factors: 1) the unequal competition arising from the imbalanced\ndistribution of foreground categories, and 2) the lack of sample diversity in\ntail categories. To tackle these issues, we introduce a unified framework\ncalled BAlanced CLassification (BACL), which enables adaptive rectification of\ninequalities caused by disparities in category distribution and dynamic\nintensification of sample diversities in a synchronized manner. Specifically, a\nnovel foreground classification balance loss (FCBL) is developed to ameliorate\nthe domination of head categories and shift attention to\ndifficult-to-differentiate categories by introducing pairwise class-aware\nmargins and auto-adjusted weight terms, respectively. This loss prevents the\nover-suppression of tail categories in the context of unequal competition.\nMoreover, we propose a dynamic feature hallucination module (FHM), which\nenhances the representation of tail categories in the feature space by\nsynthesizing hallucinated samples to introduce additional data variances. In\nthis divide-and-conquer approach, BACL sets a new state-of-the-art on the\nchallenging LVIS benchmark with a decoupled training pipeline, surpassing\nvanilla Faster R-CNN with ResNet-50-FPN by 5.8% AP and 16.1% AP for overall and\ntail categories. Extensive experiments demonstrate that BACL consistently\nachieves performance improvements across various datasets with different\nbackbones and architectures. Code and models are available at\nhttps://github.com/Tianhao-Qi/BACL.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:11:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Qi","Tianhao",""],["Xie","Hongtao",""],["Li","Pandeng",""],["Ge","Jiannan",""],["Zhang","Yongdong",""]]}
{"id":"2308.02214","submitter":"Fei Liu","authors":"Fei Liu","title":"Semi-Markov Processes in Open Quantum Systems. II. Counting Statistics\n  with Resetting","comments":"4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A semi-Markov process method for obtaining general counting statistics for\nopen quantum systems is extended to the scenario of resetting. The simultaneous\npresence of random resets and wave function collapses means that the quantum\njump trajectories are no longer semi-Markov. However, focusing on trajectories\nand using simple probability formulas, general counting statistics can still be\nconstructed from reset-free statistics. An exact tilted matrix equation is also\nobtained. The inputs of these methods are the survival distributions and\nwaiting-time density distributions instead of quantum operators. In addition, a\ncontinuous-time cloning algorithm is introduced to simulate the large-deviation\nproperties of open quantum systems. Several quantum optics systems are used to\ndemonstrate these results.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:16:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Fei",""]]}
{"id":"2308.02215","submitter":"Luoqin Liu","authors":"Luoqin Liu and Srinidhi N. Gadde and Richard J. A. M. Stevens","title":"The mean wind and potential temperature flux profiles in convective\n  boundary layers","comments":"12 pages, 6 figures","journal-ref":"J. Atmos. Sci., 2023, 80, 1893-1903","doi":"10.1175/JAS-D-22-0159.1","report-no":null,"categories":"physics.flu-dyn physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop innovative analytical expressions for the mean wind and potential\ntemperature flux profiles in convective boundary layers (CBLs). CBLs are\nfrequently observed during daytime as the Earth's surface is warmed by solar\nradiation. Therefore, their modeling is relevant for weather forecasting,\nclimate modeling, and wind energy applications. For CBLs in the convective-roll\ndominated regime, the mean velocity and potential temperature in the bulk\nregion of the mixed layer are approximately uniform. We propose an analytical\nexpression for the normalized potential temperature flux profile as a function\nof height, using a perturbation method approach in which we employ the\nhorizontally homogeneous and quasi-stationary characteristics of the surface\nand inversion layers. The velocity profile in the mixed layer and the\nentrainment zone is constructed based on insights obtained from the proposed\npotential temperature flux profile and the convective logarithmic friction law.\nCombining this with the well-known Monin-Obukhov similarity theory allows us to\ncapture the velocity profile over the entire boundary layer height. The\nproposed profiles agree excellently with large-eddy simulation results over the\nrange of $-L/z_0 \\in [3.6\\times10^2, 0.7 \\times 10^5]$, where $L$ is the\nObukhov length and $z_0$ is the roughness length.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:16:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Luoqin",""],["Gadde","Srinidhi N.",""],["Stevens","Richard J. A. M.",""]]}
{"id":"2308.02216","submitter":"Pawe{\\l} Jagodzi\\'nski","authors":"P. Jagodzi\\'nski (1), D. Bana\\'s (1), M. Pajek (1), A. Kubala-Kuku\\'s\n  (1), {\\L}. Jab{\\l}o\\'nski (1), I. Stabrawa (1), K. Szary (1), D. Sobota (1),\n  A. Warczak (2), A. Gumberidze (3), H.F. Beyer (3), M. Lestinsky (3), G. Weber\n  (3), Th. St\\\"ohlker (3 and 4) and M. Trassinelli (5) ((1) Institute of\n  Physics, Jan Kochanowski University, Kielce, Poland, (2) Institute of\n  Physics, Jagiellonian University, Krak\\'ow, Poland, (3) GSI Helmholtzzentrum\n  f\\\"u Schwerionenforschung, Darmstadt, Germany, (4) GSI Helmholtz-Institut,\n  Jena, Germany, (5) Institut des NanoSciences de Paris (INSP), CNRS, Paris,\n  France)","title":"A high-resolution asymmetric von Hamos spectrometer for low-energy X-ray\n  spectroscopy at the CRYRING@ESR electron cooler","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present research program and project for high-resolution\nwavelength-dispersive spectrometer dedicated to low-energy X-ray spectroscopy\nat the electron cooler of the CRYRING@ESR storage ring, which is a~part of the\ninternational Facility for Antiproton and Ion Research (FAIR) currently being\nbuilt in Darmstadt. Due to the unique shape of the electorn-ion recombination\nX-ray source, resulting from the overlapping of the electron and ion beams in\nthe electron cooler, the spectrometer can work in the specific asymmetric von\nHamos (AvH) geometry. In order to completely eliminate the influence of Doppler\neffect on the measured X-ray energies, two asymmetric von Hamos spectrometers\nwill be installed next to the dipole magnets on both sides of the electron\ncooler to detect blue/red (0$^{\\circ}$/180$^{\\circ}$) shifted X-rays, e.g.\nemitted in the radiative recombination (RR) process. The X-ray-tracing\nMonte-Carlo simulations show that the proposed AvH spectrometer will allow to\ndetermine with sub-meV precision, the low-energy X-rays (5-10~keV) emitted from\nstored bare or few-electron heavy ions interacting with cooling electrons. This\nexperimental precision will enable accurate studies of the quantum\nelectrodynamics (QED) effects in mid-Z H- and He-like ions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:18:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jagodzi\u0144ski","P.","","3 and 4"],["Bana\u015b","D.","","3 and 4"],["Pajek","M.","","3 and 4"],["Kubala-Kuku\u015b","A.","","3 and 4"],["Jab\u0142o\u0144ski","\u0141.","","3 and 4"],["Stabrawa","I.","","3 and 4"],["Szary","K.","","3 and 4"],["Sobota","D.","","3 and 4"],["Warczak","A.","","3 and 4"],["Gumberidze","A.","","3 and 4"],["Beyer","H. F.","","3 and 4"],["Lestinsky","M.","","3 and 4"],["Weber","G.","","3 and 4"],["St\u00f6hlker","Th.","","3 and 4"],["Trassinelli","M.",""]]}
{"id":"2308.02217","submitter":"Andrew Hillier","authors":"Andrew Hillier, I\\~nigo Arregui and Takeshi Matsumoto","title":"Nonlinear wave damping by Kelvin-Helmholtz instability induced\n  turbulence","comments":"19 pages, 14 figures, submitted to ApJ, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetohydrodynamic kink waves naturally form as a consequence of\nperturbations to a structured medium, for example transverse oscillations of\ncoronal loops. Linear theory has provided many insights in the evolution of\nlinear oscillations, and results from these models are often applied to infer\ninformation about the solar corona from observed wave periods and damping\ntimes. However, simulations show that nonlinear kink waves can host the\nKelvin-Helmholtz instability (KHi) which subsequently creates turbulence in the\nloop, dynamics which are beyond linear models. In this paper we investigate the\nevolution of KHi-induced turbulence on the surface of a flux tube where a\nnon-linear fundamental kink-mode has been excited. We control our numerical\nexperiment so that we induce the KHi without exciting resonant absorption. We\nfind two stages in the KHi turbulence dynamics. In the first stage, we show\nthat the classic model of a KHi turbulent layer growing $\\propto t$is\napplicable. We adapt this model to make accurate predictions for damping of the\noscillation and turbulent heating as a consequence of the KHi dynamics. In the\nsecond stage, the now dominant turbulent motions are undergoing decay. We find\nthat the classic model of energy decay proportional to $t^{-2}$ approximately\nholds and provides an accurate prediction of the heating in this phase. Our\nresults show that we can develop simple models for the turbulent evolution of a\nnon-linear kink wave, but the damping profiles produced are distinct from those\nof linear theory that are commonly used to confront theory and observations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:20:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hillier","Andrew",""],["Arregui","I\u00f1igo",""],["Matsumoto","Takeshi",""]]}
{"id":"2308.02218","submitter":"Leila Shahkarami","authors":"Leila Shahkarami and Farid Charmchi","title":"Long-term Oscillations and Universal Behavior in Pulsed Electric Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We thoroughly analyze the response of the zero-temperature N=2 super\nYang-Mills theory to time-dependent electric field quenches via holography. We\nspecially focus on transient pulse-like configurations for the electric field,\ncharacterized by some model parameters, such as the maximum value of the\nelectric field $E_0$ and the ramping time $\\delta_t$ which determines the time\ninterval for switching the electric field on and off. We also compare some of\nthe results with those of tanh-like quenches. The term tanh-like quench is used\nfor a quench that rises from zero to a final finite value during a finite\namount of time. Our numerical solutions demonstrate that when the system is\nsubjected to pulse-like electric field quenches, the emerged electric current\nas a response goes through three stages as time passes. After excitation and\nrapidly-damping oscillatory stages, it experiences a long-lasting periodic\noscillatory region. In fact the effect of the electric pulse remains in the\nsystem much longer than the duration of the presence of the electric field\nitself. It is extremely interesting that, as confirmed by power spectrum\ndiagrams, these oscillations have a unique obvious frequency which is\nindependent of the details of the electric pulse function and its parameters.\nMoreover, we observe a universal behavior in the adiabatic limit, when the\nramping time tends to infinity. In this limit, the early and late time dynamics\nof the response electric current does not depend on the time dependence of the\nelectric field. In particular, we see that for both pulse-like and tanh-like\nquenches, the maximum value at the first peak of the oscillations approaches\nthe static value of the current induced by the presence of a static electric\nfield $E_0$. However, the fast quench behavior differs extremely for different\nkinds of quench functions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:21:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shahkarami","Leila",""],["Charmchi","Farid",""]]}
{"id":"2308.02219","submitter":"Joaquin Delgado Fernandez","authors":"Joaquin Delgado Fernandez, Martin Brennecke, Tom Barbereau, Alexander\n  Rieger, Gilbert Fridgen","title":"Federated Learning: Organizational Opportunities, Challenges, and\n  Adoption Strategies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Restrictive rules for data sharing in many industries have led to the\ndevelopment of \\ac{FL}. \\ac{FL} is a \\ac{ML} technique that allows distributed\nclients to train models collaboratively without the need to share their\nrespective training data with others. In this article, we first explore the\ntechnical basics of FL and its potential applications. Second, we present a\nconceptual framework for the adoption of \\ac{FL}, mapping organizations along\nthe lines of their \\ac{AI} capabilities and environment. We then discuss why\nexemplary organizations in different industries, including industry consortia,\nestablished banks, public authorities, and data-intensive SMEs might consider\ndifferent approaches to \\ac{FL}. To conclude, we argue that \\ac{FL} presents an\ninstitutional shift with ample interdisciplinary research opportunities for the\nbusiness and information systems engineering community.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:23:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fernandez","Joaquin Delgado",""],["Brennecke","Martin",""],["Barbereau","Tom",""],["Rieger","Alexander",""],["Fridgen","Gilbert",""]]}
{"id":"2308.02220","submitter":"Nik Stopar","authors":"Damjana Kokol Bukov\\v{s}ek, Bla\\v{z} Moj\\v{s}kerc and Nik Stopar","title":"Exact upper bound for copulas with a given diagonal section","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We answer a 15-year-old open question about the exact upper bound for\nbivariate copulas with a given diagonal section by giving an explicit formula\nfor this bound. As an application, we determine the maximal asymmetry of\nbivariate copulas with a given diagonal section and construct a copula that\nattains it.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:25:43 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bukov\u0161ek","Damjana Kokol",""],["Moj\u0161kerc","Bla\u017e",""],["Stopar","Nik",""]]}
{"id":"2308.02221","submitter":"Laurens Sluijterman","authors":"Laurens Sluijterman, Eric Cator, Tom Heskes","title":"Likelihood-ratio-based confidence intervals for neural networks","comments":"28 pages, 9 figures","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 introduces a first implementation of a novel\nlikelihood-ratio-based approach for constructing confidence intervals for\nneural networks. Our method, called DeepLR, offers several qualitative\nadvantages: most notably, the ability to construct asymmetric intervals that\nexpand in regions with a limited amount of data, and the inherent incorporation\nof factors such as the amount of training time, network architecture, and\nregularization techniques. While acknowledging that the current implementation\nof the method is prohibitively expensive for many deep-learning applications,\nthe high cost may already be justified in specific fields like medical\npredictions or astrophysics, where a reliable uncertainty estimate for a single\nprediction is essential. This work highlights the significant potential of a\nlikelihood-ratio-based uncertainty estimate and establishes a promising avenue\nfor future research.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:34:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sluijterman","Laurens",""],["Cator","Eric",""],["Heskes","Tom",""]]}
{"id":"2308.02222","submitter":"Jie Li","authors":"Hang Qian, Xuan Zuo, Zhi-Yuan Fan, Jiong Cheng, Jie Li","title":"Strong squeezing of microwave output fields via reservoir-engineered\n  cavity magnomechanics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall physics.optics","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We show how to achieve strong squeezing of a microwave output field by\nreservoir engineering a cavity magnomechanical system, consisting of a\nmicrowave cavity, a magnon mode, and a mechanical vibration mode. The magnon\nmode is simultaneously driven by two microwave fields at the blue and red\nsidebands associated with the vibration mode. The two-tone drive induces a\nsqueezed magnonic reservoir for the intracavity field, leading to a squeezed\ncavity mode due to the cavity-magnon state swapping, which further yields a\nsqueezed cavity output field. The squeezing of the output field is stationary\nand substantial using currently available parameters in cavity magnomechanics.\nThe work indicates the potential of the cavity magnomechanical system in\npreparing squeezed microwave fields, and may find promising applications in\nquantum information science and quantum metrology.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:35:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Qian","Hang",""],["Zuo","Xuan",""],["Fan","Zhi-Yuan",""],["Cheng","Jiong",""],["Li","Jie",""]]}
{"id":"2308.02223","submitter":"Chenglong Wang","authors":"Chenglong Wang, Hang Zhou, Yimin Hu, Yifu Huo, Bei Li, Tongran Liu,\n  Tong Xiao, Jingbo Zhu","title":"ESRL: Efficient Sampling-based Reinforcement Learning for Sequence\n  Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Applying Reinforcement Learning (RL) to sequence generation models enables\nthe direct optimization of long-term rewards (\\textit{e.g.,} BLEU and human\nfeedback), but typically requires large-scale sampling over a space of action\nsequences. This is a computational challenge as presented by the practice of\nsequence generation problems, such as machine translation, where we often deal\nwith a large action space (\\textit{e.g.,} a vocabulary) and a long action\nsequence (\\textit{e.g.,} a translation). In this work, we introduce two-stage\nsampling and dynamic sampling approaches to improve the sampling efficiency\nduring training sequence generation models via RL. We experiment with our\napproaches on the traditional sequence generation tasks, including machine\ntranslation and abstractive summarization. Furthermore, we evaluate our\napproaches in RL from human feedback (RLHF) through training a large language\nmodel using the reward model. Experimental results show that the efficient\nsampling-based RL, referred to as ESRL, can outperform all baselines in terms\nof both training efficiency and memory consumption. Notably, ESRL yields\nconsistent performance gains over the strong REINFORCE, minimum risk training,\nand proximal policy optimization methods.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:35:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Chenglong",""],["Zhou","Hang",""],["Hu","Yimin",""],["Huo","Yifu",""],["Li","Bei",""],["Liu","Tongran",""],["Xiao","Tong",""],["Zhu","Jingbo",""]]}
{"id":"2308.02224","submitter":"Jianwei Zhao","authors":"J.W. Zhao, D. Amanbayev, T. Dickel, I. Miskun, W. R. Plass, N.\n  Tortorelli, S. Ayet San Andres, Soenke Beck, J. Bergmann, Z. Brencic, P.\n  Constantin, H. Geissel, F. Greiner, L. Groef, C. Hornung, N. Kuzminzuk, G.\n  Kripko-Koncz, I. Mardor, I. Pohjalainen, C. Scheidenberger, P. G. Thirolf, S.\n  Bagchi, E. Haettner, E. Kazantseva, D. Kostyleva, A. Oberstedt, S. Pietri, M.\n  P. Reiter, Y. K. Tanaka, M. Wada, D. L. Balabanski, D. Benyaming, M. N.\n  Harakeh, N. Hubbard, N. Kalantar-Nayestanaki, A. Mollaebrahimi, I. Mukhab, M.\n  Narang, T. Niwasel, Z. Patyk, S. Purushothaman, A. Rotaru, A. Spataruf, G.\n  Stanico, M. Vencelje, H. Weickb, J. Yu, the Super-FRS Experiment\n  Collaboration","title":"Increasing the rate capability for the cryogenic stopping cell of the\n  FRS Ion Catcher","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  At the FRS Ion Catcher (FRS-IC), projectile and fission fragments are\nproduced at relativistic energies, separated in-flight, energy-bunched, slowed\ndown, and thermalized in the ultra-pure helium gas-filled cryogenic stopping\ncell (CSC). Thermalized nuclei are extracted from the CSC using a combination\nof DC and RF electric fields and gas flow. This CSC also serves as the\nprototype CSC for the Super-FRS, where exotic nuclei will be produced at\nunprecedented rates making it possible to go towards the extremes of the\nnuclear chart. Therefore, it is essential to efficiently extract thermalized\nexotic nuclei from the CSC under high beam rate conditions, in order to use the\nrare exotic nuclei which come as cocktail beams. The extraction efficiency\ndependence on the intensity of the impinging beam into the CSC was studied with\na primary beam of 238U and its fragments. Tests were done with two different\nversions of the DC electrode structure inside the cryogenic chamber, the\nstandard 1 m long and a short 0.5 m long DC electrode. In contrast to the rate\ncapability of 10^4 ions/s with the long DC electrode, results show no\nextraction efficiency loss up to the rate of 2x10^5 ions/s with the new short\nDC electrode. This order of magnitude increase of the rate capability paves the\nway for new experiments at the FRS-IC, including exotic nuclei studies with\nin-cell multi-nucleon transfer reactions. The results further validate the\ndesign concept of the CSC for the Super-FRS, which was developed to effectively\nmanage beams of even higher intensities.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:41:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhao","J. W.",""],["Amanbayev","D.",""],["Dickel","T.",""],["Miskun","I.",""],["Plass","W. R.",""],["Tortorelli","N.",""],["Andres","S. Ayet San",""],["Beck","Soenke",""],["Bergmann","J.",""],["Brencic","Z.",""],["Constantin","P.",""],["Geissel","H.",""],["Greiner","F.",""],["Groef","L.",""],["Hornung","C.",""],["Kuzminzuk","N.",""],["Kripko-Koncz","G.",""],["Mardor","I.",""],["Pohjalainen","I.",""],["Scheidenberger","C.",""],["Thirolf","P. G.",""],["Bagchi","S.",""],["Haettner","E.",""],["Kazantseva","E.",""],["Kostyleva","D.",""],["Oberstedt","A.",""],["Pietri","S.",""],["Reiter","M. P.",""],["Tanaka","Y. K.",""],["Wada","M.",""],["Balabanski","D. L.",""],["Benyaming","D.",""],["Harakeh","M. N.",""],["Hubbard","N.",""],["Kalantar-Nayestanaki","N.",""],["Mollaebrahimi","A.",""],["Mukhab","I.",""],["Narang","M.",""],["Niwasel","T.",""],["Patyk","Z.",""],["Purushothaman","S.",""],["Rotaru","A.",""],["Spataruf","A.",""],["Stanico","G.",""],["Vencelje","M.",""],["Weickb","H.",""],["Yu","J.",""],["Collaboration","the Super-FRS Experiment",""]]}
{"id":"2308.02225","submitter":"Yi Wang","authors":"Yi Wang, Chenying Liu, Arti Tiwari, Micha Silver, Arnon Karnieli, Xiao\n  Xiang Zhu, Conrad M Albrecht","title":"Deep Semantic Model Fusion for Ancient Agricultural Terrace Detection","comments":"IEEE Big Data 2022 workshop on Digital Twins for Accelerated\n  Discovery of Climate & Sustainability Solutions (ADoCS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Discovering ancient agricultural terraces in desert regions is important for\nthe monitoring of long-term climate changes on the Earth's surface. However,\ntraditional ground surveys are both costly and limited in scale. With the\nincreasing accessibility of aerial and satellite data, machine learning\ntechniques bear large potential for the automatic detection and recognition of\narchaeological landscapes. In this paper, we propose a deep semantic model\nfusion method for ancient agricultural terrace detection. The input data\nincludes aerial images and LiDAR generated terrain features in the Negev\ndesert. Two deep semantic segmentation models, namely DeepLabv3+ and UNet, with\nEfficientNet backbone, are trained and fused to provide segmentation maps of\nancient terraces and walls. The proposed method won the first prize in the\nInternational AI Archaeology Challenge. Codes are available at\nhttps://github.com/wangyi111/international-archaeology-ai-challenge.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:42:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Yi",""],["Liu","Chenying",""],["Tiwari","Arti",""],["Silver","Micha",""],["Karnieli","Arnon",""],["Zhu","Xiao Xiang",""],["Albrecht","Conrad M",""]]}
{"id":"2308.02226","submitter":"Alison Chi","authors":"Alison Chi, Li-Kuang Chen, Yi-Chen Chang, Shu-Hui Lee, Jason S. Chang","title":"Learning to Paraphrase Sentences to Different Complexity Levels","comments":"This arXiv version is a pre-MIT Press publication version, this paper\n  has been accepted by TACL. 22 pages, 3 figures, 13 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While sentence simplification is an active research topic in NLP, its\nadjacent tasks of sentence complexification and same-level paraphrasing are\nnot. To train models on all three tasks, we present two new unsupervised\ndatasets. We compare these datasets, one labeled by a weak classifier and the\nother by a rule-based approach, with a single supervised dataset. Using these\nthree datasets for training, we perform extensive experiments on both\nmultitasking and prompting strategies. Compared to other systems trained on\nunsupervised parallel data, models trained on our weak classifier labeled\ndataset achieve state-of-the-art performance on the ASSET simplification\nbenchmark. Our models also outperform previous work on sentence level\ntargeting. Finally, we establish how a handful of Large Language Models perform\non these tasks under a zero-shot setting.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:43:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chi","Alison",""],["Chen","Li-Kuang",""],["Chang","Yi-Chen",""],["Lee","Shu-Hui",""],["Chang","Jason S.",""]]}
{"id":"2308.02227","submitter":"Tatsuya Chuman","authors":"Tatsuya Chuman and Nobutaka Ono and Hitoshi Kiya","title":"Security Evaluation of Compressible and Learnable Image Encryption\n  Against Jigsaw Puzzle Solver Attacks","comments":"To be appeared in 2023 IEEE 12th Global Conference on Consumer\n  Electronics (GCCE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Several learnable image encryption schemes have been developed for\nprivacy-preserving image classification. This paper focuses on the security\nblock-based image encryption methods that are learnable and JPEG-friendly.\nPermuting divided blocks in an image is known to enhance robustness against\nciphertext-only attacks (COAs), but recently jigsaw puzzle solver attacks have\nbeen demonstrated to be able to restore visual information on the encrypted\nimages. In contrast, it has never been confirmed whether encrypted images\nincluding noise caused by JPEG-compression are robust. Accordingly, the aim of\nthis paper is to evaluate the security of compressible and learnable encrypted\nimages against jigsaw puzzle solver attacks. In experiments, the security\nevaluation was carried out on the CIFAR-10 and STL-10 datasets under\nJPEG-compression.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:44:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chuman","Tatsuya",""],["Ono","Nobutaka",""],["Kiya","Hitoshi",""]]}
{"id":"2308.02228","submitter":"Lingxiao Lu","authors":"Lingxiao Lu, Jiangtong Li, Junyan Cao, Li Niu, and Liqing Zhang","title":"Painterly Image Harmonization using Diffusion Model","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":"10.1145/3581783.3612451","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Painterly image harmonization aims to insert photographic objects into\npaintings and obtain artistically coherent composite images. Previous methods\nfor this task mainly rely on inference optimization or generative adversarial\nnetwork, but they are either very time-consuming or struggling at fine control\nof the foreground objects (e.g., texture and content details). To address these\nissues, we propose a novel Painterly Harmonization stable Diffusion model\n(PHDiffusion), which includes a lightweight adaptive encoder and a Dual Encoder\nFusion (DEF) module. Specifically, the adaptive encoder and the DEF module\nfirst stylize foreground features within each encoder. Then, the stylized\nforeground features from both encoders are combined to guide the harmonization\nprocess. During training, besides the noise loss in diffusion model, we\nadditionally employ content loss and two style losses, i.e., AdaIN style loss\nand contrastive style loss, aiming to balance the trade-off between style\nmigration and content preservation. Compared with the state-of-the-art models\nfrom related fields, our PHDiffusion can stylize the foreground more\nsufficiently and simultaneously retain finer content. Our code and model are\navailable at https://github.com/bcmi/PHDiffusion-Painterly-Image-Harmonization.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:51:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lu","Lingxiao",""],["Li","Jiangtong",""],["Cao","Junyan",""],["Niu","Li",""],["Zhang","Liqing",""]]}
{"id":"2308.02229","submitter":"Yugao Ouyang","authors":"Yugao Ouyang, Meiqing Xu, Ran Zhuo","title":"A priori estimates for higher-order fractional Laplace 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 establish a priori estimates for the positive solutions to\na higher-order fractional Laplace equation on a bounded domain by a blowing-up\nand rescaling argument. To overcome the technical difficulty due to the\nhigh-order and fractional order mixed operators, we divide the high-order\nfractional Laplacian equation into a system, and provide uniform estimates for\neach equation in the system. Finding a proper scaling parameter for the domain\nis the crux of rescaling argument to the above system, and the new idea is\nintroduced in the rescaling proof, which may hopefully be applied to many other\nsystem problems. In order to derive a contradiction in the blowing-up proof,\ncombining the moving planes method and suitable Kelvin transform, we prove a\nkey Liouville-type theorem under a weaker regularity assumption in a half\nspace.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:56:29 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ouyang","Yugao",""],["Xu","Meiqing",""],["Zhuo","Ran",""]]}
{"id":"2308.02230","submitter":"Carlo Scali","authors":"David A. Croydon, Daniel Kious, Carlo Scali","title":"Aging and sub-aging for one-dimensional random walks amongst random\n  conductances","comments":"55 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 consider random walks amongst random conductances in the cases where the\nconductances can be arbitrarily small, with a heavy-tailed distribution at 0,\nand where the conductances may or may not have a heavy-tailed distribution at\ninfinity. We study the long time behaviour of these processes and prove aging\nstatements. When the heavy tail is only at 0, we prove that aging can be\nobserved for the maximum of the process, i.e.~the same maximal value is\nattained repeatedly over long time-scales. When there are also heavy tails at\ninfinity, we prove a classical aging result for the position of the walker, as\nwell as a sub-aging result that occurs on a shorter time-scale.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:06:05 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Croydon","David A.",""],["Kious","Daniel",""],["Scali","Carlo",""]]}
{"id":"2308.02231","submitter":"Jens Foerderer","authors":"Jens Foerderer","title":"Should we trust web-scraped data?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN cs.AI q-fin.EC stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing adoption of econometric and machine-learning approaches by\nempirical researchers has led to a widespread use of one data collection\nmethod: web scraping. Web scraping refers to the use of automated computer\nprograms to access websites and download their content. The key argument of\nthis paper is that na\\\"ive web scraping procedures can lead to sampling bias in\nthe collected data. This article describes three sources of sampling bias in\nweb-scraped data. More specifically, sampling bias emerges from web content\nbeing volatile (i.e., being subject to change), personalized (i.e., presented\nin response to request characteristics), and unindexed (i.e., abundance of a\npopulation register). In a series of examples, I illustrate the prevalence and\nmagnitude of sampling bias. To support researchers and reviewers, this paper\nprovides recommendations on anticipating, detecting, and overcoming sampling\nbias in web-scraped data.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:07:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Foerderer","Jens",""]]}
{"id":"2308.02232","submitter":"Yue Xu","authors":"Yue Xu and Xiuwu Zhu","title":"Asymptotic rates of convergence for compact reversible Markov chains","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we establish the main term governing the rate at which a\ncompact reversible Markov chain converges to stationarity. As an application,\nwe obtain the sharpest estimates for the corank distributions of uniform, skew\ncentrosymmetric, symmetric, skew-symmetric, and Hermitian matrices.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:16:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xu","Yue",""],["Zhu","Xiuwu",""]]}
{"id":"2308.02233","submitter":"Agastya Raj","authors":"Agastya Raj, Zehao Wang, Frank Slyne, Tingjun Chen, Dan Kilper, Marco\n  Ruffini","title":"Self-Normalizing Neural Network, Enabling One Shot Transfer Learning for\n  Modeling EDFA Wavelength Dependent Gain","comments":"This paper was accepted for the European Conference on Optical\n  Communications (ECOC) 2023, this version is a pre-print","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel ML framework for modeling the wavelength-dependent gain of\nmultiple EDFAs, based on semi-supervised, self-normalizing neural networks,\nenabling one-shot transfer learning. Our experiments on 22 EDFAs in Open\nIreland and COSMOS testbeds show high-accuracy transfer-learning even when\noperated across different amplifier types.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:17:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Raj","Agastya",""],["Wang","Zehao",""],["Slyne","Frank",""],["Chen","Tingjun",""],["Kilper","Dan",""],["Ruffini","Marco",""]]}
{"id":"2308.02234","submitter":"Kasun Wickramasinghe","authors":"Kasun Wickramasinghe, Nisansa de Silva","title":"Sinhala-English Parallel Word Dictionary Dataset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Parallel datasets are vital for performing and evaluating any kind of\nmultilingual task. However, in the cases where one of the considered language\npairs is a low-resource language, the existing top-down parallel data such as\ncorpora are lacking in both tally and quality due to the dearth of human\nannotation. Therefore, for low-resource languages, it is more feasible to move\nin the bottom-up direction where finer granular pairs such as dictionary\ndatasets are developed first. They may then be used for mid-level tasks such as\nsupervised multilingual word embedding alignment. These in turn can later guide\nhigher-level tasks in the order of aligning sentence or paragraph text corpora\nused for Machine Translation (MT). Even though more approachable than\ngenerating and aligning a massive corpus for a low-resource language, for the\nsame reason of apathy from larger research entities, even these finer granular\ndata sets are lacking for some low-resource languages. We have observed that\nthere is no free and open dictionary data set for the low-resource language,\nSinhala. Thus, in this work, we introduce three parallel English-Sinhala word\ndictionaries (En-Si-dict-large, En-Si-dict-filtered, En-Si-dict-FastText) which\nhelp in multilingual Natural Language Processing (NLP) tasks related to English\nand Sinhala languages. In this paper, we explain the dataset creation pipeline\nas well as the experimental results of the tests we have carried out to verify\nthe quality of the data sets. The data sets and the related scripts are\navailable at https://github.com/kasunw22/sinhala-para-dict.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:21:35 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wickramasinghe","Kasun",""],["de Silva","Nisansa",""]]}
{"id":"2308.02235","submitter":"Yipeng Li","authors":"Yipeng Li, Qiao Chen, Xiangmin Jiao","title":"Robust Discontinuity Indicators for High-Order Reconstruction of\n  Piecewise Smooth Functions","comments":"37 pages, 37 figures, submitted to Computational and Applied\n  Mathematics (COAM)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In many applications, piecewise continuous functions are commonly\ninterpolated over meshes. However, accurate high-order manipulations of such\nfunctions can be challenging due to potential spurious oscillations known as\nthe Gibbs phenomena. To address this challenge, we propose a novel approach,\nRobust Discontinuity Indicators (RDI), which can efficiently and reliably\ndetect both C^{0} and C^{1} discontinuities for node-based and cell-averaged\nvalues. We present a detailed analysis focusing on its derivation and the\ndual-thresholding strategy. A key advantage of RDI is its ability to handle\npotential inaccuracies associated with detecting discontinuities on non-uniform\nmeshes, thanks to its innovative discontinuity indicators. We also extend the\napplicability of RDI to handle general surfaces with boundaries, features, and\nridge points, thereby enhancing its versatility and usefulness in various\nscenarios. To demonstrate the robustness of RDI, we conduct a series of\nexperiments on non-uniform meshes and general surfaces, and compare its\nperformance with some alternative methods. By addressing the challenges posed\nby the Gibbs phenomena and providing reliable detection of discontinuities, RDI\nopens up possibilities for improved approximation and analysis of piecewise\ncontinuous functions, such as in data remap.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:25:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Yipeng",""],["Chen","Qiao",""],["Jiao","Xiangmin",""]]}
{"id":"2308.02236","submitter":"Li Zhiqi","authors":"Zhiqi Li, Zhiding Yu, Wenhai Wang, Anima Anandkumar, Tong Lu, Jose M.\n  Alvarez","title":"FB-BEV: BEV Representation from Forward-Backward View Transformations","comments":"Accept to ICCV 2023, camera-ready version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  View Transformation Module (VTM), where transformations happen between\nmulti-view image features and Bird-Eye-View (BEV) representation, is a crucial\nstep in camera-based BEV perception systems. Currently, the two most prominent\nVTM paradigms are forward projection and backward projection. Forward\nprojection, represented by Lift-Splat-Shoot, leads to sparsely projected BEV\nfeatures without post-processing. Backward projection, with BEVFormer being an\nexample, tends to generate false-positive BEV features from incorrect\nprojections due to the lack of utilization on depth. To address the above\nlimitations, we propose a novel forward-backward view transformation module.\nOur approach compensates for the deficiencies in both existing methods,\nallowing them to enhance each other to obtain higher quality BEV\nrepresentations mutually. We instantiate the proposed module with FB-BEV, which\nachieves a new state-of-the-art result of 62.4% NDS on the nuScenes test set.\nCode and models are available at https://github.com/NVlabs/FB-BEV.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:26:55 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 09:07:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Zhiqi",""],["Yu","Zhiding",""],["Wang","Wenhai",""],["Anandkumar","Anima",""],["Lu","Tong",""],["Alvarez","Jose M.",""]]}
{"id":"2308.02237","submitter":"Haoyi Xiu","authors":"Haoyi Xiu, Xin Liu, Weimin Wang, Kyoung-Sook Kim, Masashi Matsuoka","title":"MSECNet: Accurate and Robust Normal Estimation for 3D Point Clouds by\n  Multi-Scale Edge Conditioning","comments":"Accepted for ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Estimating surface normals from 3D point clouds is critical for various\napplications, including surface reconstruction and rendering. While existing\nmethods for normal estimation perform well in regions where normals change\nslowly, they tend to fail where normals vary rapidly. To address this issue, we\npropose a novel approach called MSECNet, which improves estimation in normal\nvarying regions by treating normal variation modeling as an edge detection\nproblem. MSECNet consists of a backbone network and a multi-scale edge\nconditioning (MSEC) stream. The MSEC stream achieves robust edge detection\nthrough multi-scale feature fusion and adaptive edge detection. The detected\nedges are then combined with the output of the backbone network using the edge\nconditioning module to produce edge-aware representations. Extensive\nexperiments show that MSECNet outperforms existing methods on both synthetic\n(PCPNet) and real-world (SceneNN) datasets while running significantly faster.\nWe also conduct various analyses to investigate the contribution of each\ncomponent in the MSEC stream. Finally, we demonstrate the effectiveness of our\napproach in surface reconstruction.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:26:59 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 04:40:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xiu","Haoyi",""],["Liu","Xin",""],["Wang","Weimin",""],["Kim","Kyoung-Sook",""],["Matsuoka","Masashi",""]]}
{"id":"2308.02238","submitter":"Joseph Dolphin","authors":"Joseph A. Dolphin, Taofiq K. Paraiso, Han Du, Robert I. Woodward,\n  Davide G. Marangon and Andrew J. Shields","title":"A Hybrid Integrated Quantum Key Distribution Transceiver Chip","comments":"13 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum photonic technologies, such as quantum key distribution, are already\nbenefiting greatly from the rise of integrated photonics. However, the\nflexibility in design of these systems is often restricted by the properties of\nthe integration material platforms. Here, we overcome this choice by using\nhybrid integration of ultra-low-loss silicon nitride waveguides with indium\nphosphide electro-optic modulators to produce high-performance quantum key\ndistribution transceiver chips. Access to the best properties of both materials\nallows us to achieve active encoding and decoding of photonic qubits on-chip at\nGHz speeds and with sub-1% quantum bit error rates over long fibre distances.\nWe demonstrate bidirectional secure bit rates of 1.82 Mbps over 10 dB channel\nattenuation and positive secure key rates out to 250 km of fibre. The results\nsupport the imminent utility of hybrid integration for quantum photonic\ncircuits and the wider field of photonics.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:28:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dolphin","Joseph A.",""],["Paraiso","Taofiq K.",""],["Du","Han",""],["Woodward","Robert I.",""],["Marangon","Davide G.",""],["Shields","Andrew J.",""]]}
{"id":"2308.02239","submitter":"Zhengping Che","authors":"Haowen Wang, Zhipeng Fan, Zhen Zhao, Zhengping Che, Zhiyuan Xu, Dong\n  Liu, Feifei Feng, Yakun Huang, Xiuquan Qiao, Jian Tang","title":"DTF-Net: Category-Level Pose Estimation and Shape Reconstruction via\n  Deformable Template Field","comments":"The first two authors are with equal contributions. Paper accepted by\n  ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612142","report-no":null,"categories":"cs.CV cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Estimating 6D poses and reconstructing 3D shapes of objects in open-world\nscenes from RGB-depth image pairs is challenging. Many existing methods rely on\nlearning geometric features that correspond to specific templates while\ndisregarding shape variations and pose differences among objects in the same\ncategory. As a result, these methods underperform when handling unseen object\ninstances in complex environments. In contrast, other approaches aim to achieve\ncategory-level estimation and reconstruction by leveraging normalized geometric\nstructure priors, but the static prior-based reconstruction struggles with\nsubstantial intra-class variations. To solve these problems, we propose the\nDTF-Net, a novel framework for pose estimation and shape reconstruction based\non implicit neural fields of object categories. In DTF-Net, we design a\ndeformable template field to represent the general category-wise shape latent\nfeatures and intra-category geometric deformation features. The field\nestablishes continuous shape correspondences, deforming the category template\ninto arbitrary observed instances to accomplish shape reconstruction. We\nintroduce a pose regression module that shares the deformation features and\ntemplate codes from the fields to estimate the accurate 6D pose of each object\nin the scene. We integrate a multi-modal representation extraction module to\nextract object features and semantic masks, enabling end-to-end inference.\nMoreover, during training, we implement a shape-invariant training strategy and\na viewpoint sampling method to further enhance the model's capability to\nextract object pose features. Extensive experiments on the REAL275 and CAMERA25\ndatasets demonstrate the superiority of DTF-Net in both synthetic and real\nscenes. Furthermore, we show that DTF-Net effectively supports grasping tasks\nwith a real robot arm.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:35:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Haowen",""],["Fan","Zhipeng",""],["Zhao","Zhen",""],["Che","Zhengping",""],["Xu","Zhiyuan",""],["Liu","Dong",""],["Feng","Feifei",""],["Huang","Yakun",""],["Qiao","Xiuquan",""],["Tang","Jian",""]]}
{"id":"2308.02240","submitter":"Alexey Drutskoy","authors":"E. Antonov, A. Drutskoy, M. Dubinin","title":"A possible search for Majorana neutrinos at future lepton colliders","comments":"8 pages, 5 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss the process $\\ell^+\\ell^- \\to N W^{\\pm} \\ell^{\\mp}$, where $N$ is\na heavy Majorana neutrino and $\\ell = e, \\mu$. Large cross sections are\nexpected for these processes at high center-of-mass energies, which can be\nreached at future lepton-lepton colliders. The Monte Carlo simulation of the\nstudied processes is produced within the framework of the seesaw type-I model,\nwhere the Majorana neutrinos (or heavy neutral leptons, HNL), are introduced in\nthe standard leptonic sector. Recently the possibility to search for the direct\nHNL production was studied in the $\\ell^+\\ell^- \\to N \\nu_{\\ell}$ process with\nthe subsequent decay $N \\to W^{\\pm} \\ell^{\\mp}$. In this paper we investigate\nan alternative process $\\ell^+\\ell^- \\to N W^{\\pm} \\ell^{\\mp} \\to\nW^{\\pm}W^{\\pm}\\,\\ell^{\\mp}\\,\\ell^{\\mp}$ with the lepton number violation by two\nunits. The similar processes appear in collisions with the same-sign beams,\n$e^-e^- \\to N W^-\\,e^- \\to W^-\\,W^-\\,e^+\\,e^-$ or $\\mu^+\\mu^+ \\to N W^+\\,\\mu^+\n\\to W^+\\,W^+\\,\\mu^+\\,\\mu^-$. The cross sections of the processes under\nconsideration are enhanced by the soft photon exchange in the $t$-channel. We\ncalculate the cross sections for the signals and potential Standard Model\nbackgrounds for the $e^+e^-$ beam collisions at the 1 TeV center-of-mass energy\nand the $\\mu^+\\mu^-$ collisions at 3 TeV and 10 TeV. Due to the diagrams with\nsoft $t$-channel photons and respective interference the promptly emitted\nleptons are produced in the direction close to the corresponding beam. These\nleptons will be lost in the beam pipe or badly measured by forward detectors.\nHowever, the signal events can be well separated from backgrounds using the\nrest of the event containing the $WW\\ell$ particles. Finally, the expected\nupper limits on the mixing parameters $|V_{\\ell N}|^2$ as a function of M($N$)\nare calculated.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:39:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Antonov","E.",""],["Drutskoy","A.",""],["Dubinin","M.",""]]}
{"id":"2308.02241","submitter":"Shijie Xu","authors":"Paul Kr\\\"uhner and Shijie Xu","title":"Explicit Local density bounds for It\\^o-processes with irregular drift","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We find explicit upper bounds for the density of marginals of continuous\ndiffusions where we assume that the diffusion coefficient is constant and the\ndrift is solely assumed to be progressively measurable and locally bounded. In\none dimension we extend our result to the case that the diffusion coefficient\nis a locally Lipschitz-continuous function of the state. Our approach is based\non a comparison to a suitable doubly reflected Brownian motion whose density is\nknown in a series representation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:39:36 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kr\u00fchner","Paul",""],["Xu","Shijie",""]]}
{"id":"2308.02242","submitter":"Nam Chu","authors":"Nam H. Chu, Nguyen Van Huynh, Diep N. Nguyen, Dinh Thai Hoang, Shimin\n  Gong, Tao Shu, Eryk Dutkiewicz, and Khoa T. Phan","title":"Countering Eavesdroppers with Meta-learning-based Cooperative Ambient\n  Backscatter Communications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article introduces a novel lightweight framework using ambient\nbackscattering communications to counter eavesdroppers. In particular, our\nframework divides an original message into two parts: (i) the active-transmit\nmessage transmitted by the transmitter using conventional RF signals and (ii)\nthe backscatter message transmitted by an ambient backscatter tag that\nbackscatters upon the active signals emitted by the transmitter. Notably, the\nbackscatter tag does not generate its own signal, making it difficult for an\neavesdropper to detect the backscattered signals unless they have prior\nknowledge of the system. Here, we assume that without decoding/knowing the\nbackscatter message, the eavesdropper is unable to decode the original message.\nEven in scenarios where the eavesdropper can capture both messages,\nreconstructing the original message is a complex task without understanding the\nintricacies of the message-splitting mechanism. A challenge in our proposed\nframework is to effectively decode the backscattered signals at the receiver,\noften accomplished using the maximum likelihood (MLK) approach. However, such a\nmethod may require a complex mathematical model together with perfect channel\nstate information (CSI). To address this issue, we develop a novel deep\nmeta-learning-based signal detector that can not only effectively decode the\nweak backscattered signals without requiring perfect CSI but also quickly adapt\nto a new wireless environment with very little knowledge. Simulation results\nshow that our proposed learning approach, without requiring perfect CSI and\ncomplex mathematical model, can achieve a bit error ratio close to that of the\nMLK-based approach. They also clearly show the efficiency of the proposed\napproach in dealing with eavesdropping attacks and the lack of training data\nfor deep learning models in practical scenarios.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:43:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chu","Nam H.",""],["Van Huynh","Nguyen",""],["Nguyen","Diep N.",""],["Hoang","Dinh Thai",""],["Gong","Shimin",""],["Shu","Tao",""],["Dutkiewicz","Eryk",""],["Phan","Khoa T.",""]]}
{"id":"2308.02243","submitter":"Iryna Timchenko","authors":"I.S. Timchenko, O.S. Deiev, S.M. Olejnik, S.M. Potin, V.A. Kushnir,\n  V.V. Mytrochenko, S.A. Perezhogin, V.A. Bocharov","title":"Isomeric pair ${^{95\\rm m,g}\\rm{Nb}}$ in photonuclear reactions on\n  $^{\\rm nat}$Mo at end-point bremsstrahlung energy of 35-95 MeV","comments":"9 pages, 9 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ${^{\\rm nat}\\rm{Mo}}(\\gamma,x\\rm np)^{95\\rm m,g}$Nb photonuclear reaction\nwas studied using the electron beam from the NSC KIPT linear accelerator\nLUE-40. Experiment was performed using the activation and off-line $\\gamma$-ray\nspectrometric technique. The experimental isomeric yield ratio $d(E_{\\rm{\\gamma\nmax}}) = Y_{\\rm m}(E_{\\rm{\\gamma max}}) / Y_{\\rm g}(E_{\\rm{\\gamma max}})$ was\ndetermined for the reaction products $^{95\\rm m,g}\\rm{Nb}$ at the end-point\nbremsstrahlung energy $E_{\\rm{\\gamma max}}$ range of 35-95 MeV. The obtained\nvalues of $d(E_{\\rm{\\gamma max}})$ are in satisfactory agreement with the\nresults of other authors and extend the range of previously known data. The\ntheoretical values of the yields $Y_{\\rm m,g}(E_{\\rm{\\gamma max}})$ and the\nisomeric yield ratio $d(E_{\\rm{\\gamma max}})$ for the isomeric pair $^{95\\rm\nm,g}\\rm{Nb}$ from the ${^{\\rm nat}\\rm{Mo}}(\\gamma,x\\rm np)$ reaction were\ncalculated using the partial cross-sections $\\sigma(E)$ from the TALYS1.95 code\nfor six different level density models $LD$. The comparison showed a noticeable\nexcess (more than 3.85 times) of the experimental isomeric yield ratio over all\ntheoretical estimates. At the investigated range of $E_{\\rm{\\gamma max}}$ the\ntheoretical dependence of $d(E_{\\rm{\\gamma max}})$ on energy was confirmed -\nthe isomeric yield ratio smoothly decreases with increasing energy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:44:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Timchenko","I. S.",""],["Deiev","O. S.",""],["Olejnik","S. M.",""],["Potin","S. M.",""],["Kushnir","V. A.",""],["Mytrochenko","V. V.",""],["Perezhogin","S. A.",""],["Bocharov","V. A.",""]]}
{"id":"2308.02244","submitter":"Bogdan Matioc","authors":"Daniel B\\\"ohme, Bogdan-Vasile Matioc","title":"Recovery of traveling water waves with smooth vorticity from the\n  horizontal velocity on a line of symmetry for various wave regimes","comments":"14 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the general context of rotational water waves with a smooth vorticity it\nis shown that the wave profile can be recovered from the horizontal component\nof the velocity field on a line of symmetry. The method, which applies to waves\nof finite and infinite depth, uses only the values of the horizontal velocity\nof particles located on the line of symmetry that are close to the wave\nsurface. In fact, together with the wave surface we recover also the velocity\nfield in a suitable surface layer. The explicit recovery formula is valid under\nthe assumption that there are no stagnation points in the fluid for both\nperiodic and solitary waves in each of the three regimes of gravity,\ncapillary-gravity, and capillary waves. The efficiency of this method is\nillustrated in the context of the explicit solutions provided by Crapper for\nperiodic capillary waves and Gerstner for periodic gravity waves.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:45:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["B\u00f6hme","Daniel",""],["Matioc","Bogdan-Vasile",""]]}
{"id":"2308.02245","submitter":"Shaodong Wang","authors":"Chenkai Liu, Shaodong Wang, Ran Zhuo","title":"A priori estimates for anti-symmetric solutions to a fractional\n  Laplacian equation in a bounded domain","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 obtain a priori estimates for the set of anti-symmetric\nsolutions to a fractional Laplacian equation in a bounded domain using a\nblowing-up and rescaling argument. In order to establish a contradiction to\npossible blow-ups, we apply a certain variation of the moving planes method in\norder to prove a monotonicity result for the limit equation after rescaling.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:47:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Chenkai",""],["Wang","Shaodong",""],["Zhuo","Ran",""]]}
{"id":"2308.02246","submitter":"Shijie Xu","authors":"Paul Kr\\\"uhner and Shijie Xu","title":"Statistically consistent term structures have affine geometry","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with finite dimensional models for the entire term\nstructure for energy futures. As soon as a finite dimensional set of possible\nyield curves is chosen, one likes to estimate the dynamic behaviour of the\nyield curve evolution from data. The estimated model should be free of\narbitrage which is known to result in some drift condition. If the yield curve\nevolution is modelled by a diffusion, then this leaves the diffusion\ncoefficient open for estimation. From a practical perspective, this requires\nthat the chosen set of possible yield curves is compatible with any obtained\ndiffusion coefficient. In this paper, we show that this compatibility enforces\nan affine geometry of the set of possible yield curves.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:53:13 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kr\u00fchner","Paul",""],["Xu","Shijie",""]]}
{"id":"2308.02247","submitter":"Christophe Labbez Dr","authors":"Christophe Labbez, Lina Bouzouaid, Alexander E.S. Van Driessche, Wai\n  Li Ling, Juan Carlos Martinez, Barbara Lothenbach, Alejandro\n  Fernandez-Martinez","title":"Mechanisms and kinetics of C-S-H nucleation approaching the spinodal\n  line: Insights into the role of organics additives","comments":"Accepted in Cement and Concrete Research. 30 pages plus supplementary\n  materials. arXiv admin note: substantial text overlap with arXiv:2111.02743","journal-ref":"Cement and Concrete Research, 173, 2023, 107299","doi":"10.1016/j.cemconres.2023.107299","report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wet chemistry C-S-H precipitation experiments were performed under controlled\nconditions of solution supersaturation in the presence and absence of gluconate\nand three hexitol molecules. Characterization of the precipitates with SAXS and\ncryo-TEM experiments confirmed the presence of a multi-step nucleation pathway.\nInduction times for the formation of the amorphous C-S-H spheroids were\ndetermined from light transmittance. Analysis of those data with the classical\nnucleation theory revealed a significant increase of the kinetic prefactor in\nthe same order as the complexation constants of calcium and silicate with each\nof the organics. Finally, two distinct precipitation regimes of the C-S-H\namorphous precursor were identified: i) a nucleation regime at low saturation\nindexes (SI) and ii) a spinodal nucleation regime at high SI where the free\nenergy barrier to the phase transition is found to be of the order of the\nkinetic energy or less.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:59:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Labbez","Christophe",""],["Bouzouaid","Lina",""],["Van Driessche","Alexander E. S.",""],["Ling","Wai Li",""],["Martinez","Juan Carlos",""],["Lothenbach","Barbara",""],["Fernandez-Martinez","Alejandro",""]]}
{"id":"2308.02248","submitter":"Mariella Dreissig","authors":"Mariella Dreissig, Florian Piewak, Joschka Boedecker","title":"On the Calibration of Uncertainty Estimation in LiDAR-based Semantic\n  Segmentation","comments":"accepted at IEEE ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The confidence calibration of deep learning-based perception models plays a\ncrucial role in their reliability. Especially in the context of autonomous\ndriving, downstream tasks like prediction and planning depend on accurate\nconfidence estimates. In point-wise multiclass classification tasks like\nsematic segmentation the model has to deal with heavy class imbalances. Due to\ntheir underrepresentation, the confidence calibration of classes with smaller\ninstances is challenging but essential, not only for safety reasons. We propose\na metric to measure the confidence calibration quality of a semantic\nsegmentation model with respect to individual classes. It is calculated by\ncomputing sparsification curves for each class based on the uncertainty\nestimates. We use the classification calibration metric to evaluate uncertainty\nestimation methods with respect to their confidence calibration of\nunderrepresented classes. We furthermore suggest a double use for the method to\nautomatically find label problems to improve the quality of hand- or\nauto-annotated datasets.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:59:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dreissig","Mariella",""],["Piewak","Florian",""],["Boedecker","Joschka",""]]}
{"id":"2308.02249","submitter":"Dasaem Jeong PhD","authors":"Danbinaerin Han, Rafael Caro Repetto, Dasaem Jeong","title":"Finding Tori: Self-supervised Learning for Analyzing Korean Folk Song","comments":"Accepted at 24th International Society for Music Information\n  Retrieval Conference (ISMIR 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.IR cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce a computational analysis of the field recording\ndataset of approximately 700 hours of Korean folk songs, which were recorded\naround 1980-90s. Because most of the songs were sung by non-expert musicians\nwithout accompaniment, the dataset provides several challenges. To address this\nchallenge, we utilized self-supervised learning with convolutional neural\nnetwork based on pitch contour, then analyzed how the musical concept of tori,\na classification system defined by a specific scale, ornamental notes, and an\nidiomatic melodic contour, is captured by the model. The experimental result\nshows that our approach can better capture the characteristics of tori compared\nto traditional pitch histograms. Using our approaches, we have examined how\nmusical discussions proposed in existing academia manifest in the actual field\nrecordings of Korean folk songs.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:13:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Han","Danbinaerin",""],["Repetto","Rafael Caro",""],["Jeong","Dasaem",""]]}
{"id":"2308.02250","submitter":"Lavinia Heisenberg","authors":"Fabio D'Ambrosio, Lavinia Heisenberg and Stefan Zentarra","title":"Hamiltonian Analysis of $f(Q)$ Gravity and the Failure of the\n  Dirac-Bergmann Algorithm for Teleparallel Theories of Gravity","comments":"45 pages, 3 figues, Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, $f(Q)$ gravity has enjoyed considerable attention in the\nliterature and important results have been obtained. However, the question of\nhow many physical degrees of freedom the theory propagates -- and how this\nnumber may depend on the form of the function $f$ -- has not been answered\nsatisfactorily. In this article we show that a Hamiltonian analysis based on\nthe Dirac-Bergmann algorithm -- one of the standard methods to address this\ntype of question -- fails. We isolate the source of the failure, show that\nother commonly considered teleparallel theories of gravity are affected by the\nsame problem, and we point out that the number of degrees of freedom obtained\nin Phys. Rev. D 106 no. 4, (2022) by K. Hu, T. Katsuragawa, and T. Qui (namely\neight), based on the Dirac-Bergmann algorithm, is wrong. Using a different\napproach, we show that the upper bound on the degrees of freedom is seven.\nFinally, we propose a more promising strategy for settling this important\nquestion.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:15:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["D'Ambrosio","Fabio",""],["Heisenberg","Lavinia",""],["Zentarra","Stefan",""]]}
{"id":"2308.02251","submitter":"Margarita Khokhlova","authors":"V. A. Birulia, M. A. Khokhlova, and V. V. Strelkov","title":"Macroscopic effects in generation of attosecond XUV pulses via\n  high-order frequency mixing in gases and plasma","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the generation of attosecond XUV pulses via high-order frequency\nmixing (HFM) of two intense generating fields, and compare this process with\nthe more common high-order harmonic generation (HHG) process. We calculate the\nmacroscopic XUV signal by numerically integrating the 1D propagation equation\ncoupled with the 3D time-dependent Schr\\\"odinger equation. We analytically find\nthe length scales which limit the quadratic growth of the HFM macroscopic\nsignal with propagation length. Compared to HHG these length scales are much\nlonger for a group of HFM components, with orders defined by the frequencies of\nthe generating fields. This results in a higher HFM macroscopic signal despite\nthe microscopic response being lower than for HHG. In our numerical\nsimulations, the intensity of the HFM signal is several times higher than that\nfor HHG in a gas, and it is up to three orders of magnitude higher for\ngeneration in plasma; it is also higher for longer generating pulses. The HFM\nprovides very narrow XUV lines ($\\delta \\omega / \\omega = 4.6 \\times 10^{-4}$)\nwith well-defined frequencies, thus allowing for a simple extension of optical\nfrequency standards to the XUV range. Finally, we show that the group of HFM\ncomponents effectively generated due to macroscopic effects provides a train of\nattosecond pulses such that the carrier-envelope phase of an individual\nattosecond pulse can be easily controlled by tuning the phase of one of the\ngenerating fields.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:16:05 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Birulia","V. A.",""],["Khokhlova","M. A.",""],["Strelkov","V. V.",""]]}
{"id":"2308.02252","submitter":"Huan-Yu Ku","authors":"Huan-Yu Ku, Chung-Yun Hsieh, and Costantino Budroni","title":"Measurement incompatibility cannot be stochastically distilled","comments":"12 pages, 1 figure, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We show that the incompatibility of a set of measurements cannot be increased\nby subjecting them to a filter, namely, by combining them with a device that\npost-selects the incoming states on a fixed outcome of a stochastic\ntransformation. This result holds for several measures of incompatibility, such\nas those based on robustness and convex weight. Expanding these ideas to\nEinstein-Podolsky-Rosen steering experiments, we are able to solve the problem\nof the maximum steerability obtained with respect to the most general local\nfilters in a way that allows for an explicit calculation of the filter\noperation. Moreover, our results generalize to nonphysical maps, i.e., positive\nbut not completely positive linear maps.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:18:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ku","Huan-Yu",""],["Hsieh","Chung-Yun",""],["Budroni","Costantino",""]]}
{"id":"2308.02253","submitter":"Amaury Triaud","authors":"Amaury H. M. J. Triaud, Georgina Dransfield, Taiki Kagetani, Mathilde\n  Timmermans, Norio Narita, Khalid Barkaoui, Teruyuki Hirano, Benjamin V.\n  Rackham, Mayuko Mori, Thomas Baycroft, Zouhair Benkhaldoun, Adam J.\n  Burgasser, Douglas A. Caldwell, Karen A. Collins, Yasmin T. Davis, Laetitia\n  Delrez, Brice-Oliver Demory, Elsa Ducrot, Akihiko Fukui, Cl\\`audia Jano\n  Mu\\~noz, Emmanu\\\"el Jehin, Lionel J. Garc\\'ia, Mourad Ghachoui, Micha\\\"el\n  Gillon, Yilen G\\'omez Maqueo Chew, Matthew J. Hooton, Masahiro Ikoma, Kiyoe\n  Kawauchi, Takayuki Kotani, Alan M. Levine, Enric Pall\\'e, Peter P. Pedersen,\n  Francisco J. Pozuelos, Didier Queloz, Owen J. Scutt, Sara Seager, Daniel\n  Sebastian, Motohide Tamura, Samantha Thompson, Noriharu Watanabe, Julien de\n  Wit, Joshua N. Winn and Sebasti\\'an Z\\'u\\~niga-Fern\\'andez","title":"An M dwarf accompanied by a close-in giant orbiter with SPECULOOS","comments":"Accepted for publication in MNRAS Letters","journal-ref":null,"doi":"10.1093/mnrasl/slad097","report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last decade, a dozen close-in giant planets have been discovered\norbiting stars with spectral types ranging from M0 to M4, a mystery since known\nformation pathways do not predict the existence of such systems. Here, we\nconfirm TOI-4860 b, a Jupiter-sized planet orbiting an M4.5 host, a star at the\ntransition between fully and partially convective interiors. First identified\nwith TESS data, we validate the transiting companion's planetary nature through\nmulticolour photometry from the TRAPPIST-South/North, SPECULOOS, and MuSCAT3\nfacilities. Our analysis yields a radius of $0.76 \\pm 0.02~ \\rm R_{Jup}$ for\nthe planet, a mass of $0.34~\\rm M_\\odot$ for the star, and an orbital period of\n1.52 d. Using the newly commissioned SPIRIT InGaAs camera at the\nSPECULOOS-South Observatory, we collect infrared photometry in zYJ that spans\nthe time of secondary eclipse. These observations do not detect a secondary\neclipse, placing an upper limit on the brightness of the companion. The\nplanetary nature of the companion is further confirmed through high-resolution\nspectroscopy obtained with the IRD spectrograph at Subaru Telescope, from which\nwe measure a mass of $0.67 \\pm 0.14~\\rm M_{Jup}$ . Based on its overall\ndensity, TOI-4860 b appears to be rich in heavy elements, like its host star.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:12:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Triaud","Amaury H. M. J.",""],["Dransfield","Georgina",""],["Kagetani","Taiki",""],["Timmermans","Mathilde",""],["Narita","Norio",""],["Barkaoui","Khalid",""],["Hirano","Teruyuki",""],["Rackham","Benjamin V.",""],["Mori","Mayuko",""],["Baycroft","Thomas",""],["Benkhaldoun","Zouhair",""],["Burgasser","Adam J.",""],["Caldwell","Douglas A.",""],["Collins","Karen A.",""],["Davis","Yasmin T.",""],["Delrez","Laetitia",""],["Demory","Brice-Oliver",""],["Ducrot","Elsa",""],["Fukui","Akihiko",""],["Mu\u00f1oz","Cl\u00e0udia Jano",""],["Jehin","Emmanu\u00ebl",""],["Garc\u00eda","Lionel J.",""],["Ghachoui","Mourad",""],["Gillon","Micha\u00ebl",""],["Chew","Yilen G\u00f3mez Maqueo",""],["Hooton","Matthew J.",""],["Ikoma","Masahiro",""],["Kawauchi","Kiyoe",""],["Kotani","Takayuki",""],["Levine","Alan M.",""],["Pall\u00e9","Enric",""],["Pedersen","Peter P.",""],["Pozuelos","Francisco J.",""],["Queloz","Didier",""],["Scutt","Owen J.",""],["Seager","Sara",""],["Sebastian","Daniel",""],["Tamura","Motohide",""],["Thompson","Samantha",""],["Watanabe","Noriharu",""],["de Wit","Julien",""],["Winn","Joshua N.",""],["Z\u00fa\u00f1iga-Fern\u00e1ndez","Sebasti\u00e1n",""]]}
{"id":"2308.02254","submitter":"Xing Rong","authors":"Diguang Wu, Hang Liang, Man Jiao, Yi-Fu Cai, Chang-Kui Duan, Ya Wang,\n  Xing Rong, Jiangfeng Du","title":"Improved Limits on an Exotic Spin- and Velocity-Dependent Interaction at\n  the Micrometer Scale with an Ensemble-NV-Diamond Magnetometer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Searching for exotic interactions provides a path for exploring new particles\nbeyond the standard model. Here, we used an ensemble-NV-diamond magnetometer to\nsearch for an exotic spin- and velocity-dependent interaction between polarized\nelectron spins and unpolarized nucleons at the micrometer scale. A thin layer\nof nitrogen-vacancy electronic spin ensemble in diamond is utilized as both the\nsolid-state spin quantum sensor and the polarized electron source, and a\nvibrating lead sphere serves as the moving unpolarized nucleon source. The\nexotic interaction is searched by detecting the possible effective magnetic\nfield induced by the moving unpolarized nucleon source using the\nensemble-NV-diamond magnetometer. Our result establishes new bounds for the\ncoupling parameter $f_\\perp$ within the force range from 5 to 400 $\\rm \\mu$m.\nThe upper limit of the coupling parameter at 100 $\\rm \\mu$m is $\\lvert f_\\perp\n\\rvert \\leq 1.1\\times 10^{-11}$, which is 3 orders of magnitude more stringent\nthan the previous constraint. This result shows that NV ensemble can be a\npromising platform to search for hypothetical particles beyond the standard\nmodel.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:21:41 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wu","Diguang",""],["Liang","Hang",""],["Jiao","Man",""],["Cai","Yi-Fu",""],["Duan","Chang-Kui",""],["Wang","Ya",""],["Rong","Xing",""],["Du","Jiangfeng",""]]}
{"id":"2308.02255","submitter":"Iago Mamede Iago N. Mamede","authors":"Iago N. Mamede, Karel Proesmans and Carlos E. Fiore","title":"Thermodynamics of interacting systems: the role of the topology and\n  collective effects","comments":"11 pages, 12 figures (comments are welcome)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.mes-hall cond-mat.other cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We will study a class of system composed of interacting quantum dots (QDs)\nplaced in contact with a hot and cold thermal baths subjected to a\nnon-conservative driving worksource. Despite their simplicity, these models\nshowcase an intricate array of phenomena, including pump and heat engine\nregimes as well as a discontinuous phase transition. We will look at three\ndistinctive topologies: a minimal and beyond minimal (homogeneous and\nheterogeneous interaction structures). The former case is represented by stark\ndifferent networks (\"all-to-all\" interactions and only a central interacting to\nits neighbors) and present exact solutions, whereas homogeneous and\nheterogeneous structures have been analyzed by numerical simulations. We find\nthat the topology plays a major role on the thermodynamic performance if the\nindividual energies of the quantum dots are small, in part due to the presence\nof first-order phase-transitions. If the individual energies are large, the\ntopology is not important and results are well-described by a system with\nall-to-all interactions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:27:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mamede","Iago N.",""],["Proesmans","Karel",""],["Fiore","Carlos E.",""]]}
{"id":"2308.02256","submitter":"Zhenhua Qiao","authors":"Yedi Shen, Zeyu Li, Qian Niu, and Zhenhua Qiao","title":"Disorder-Induced Phase Transitions in Three-Dimensional Chiral\n  Second-Order Topological Insulator","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":"  Topological insulators have been extended to higher-order versions that\npossess topological hinge or corner states in lower dimensions. However, their\nrobustness against disorder is still unclear. Here, we theoretically\ninvestigate the phase transitions of three-dimensional (3D) chiral second-order\ntopological insulator (SOTI) in the presence of disorders. Our results show\nthat, by increasing disorder strength, the nonzero densities of states of side\nsurface and bulk emerge at critical disorder strengths of $W_{S}$ and $W_{B}$,\nrespectively. The spectral function indicates that the bulk gap is only closed\nat one of the $R_{4z}\\mathcal{T}$-invariant points, i.e., $\\Gamma_{3}$. The\nclosing of side surface gap or bulk gap is ascribed to the significant decrease\nof the elastic mean free time of quasi-particles. Because of the localization\nof side surface states, we find that the 3D chiral SOTI is robust at an\naveraged quantized conductance of $2e^{2}/h$ with disorder strength up to\n$W_{B}$. When the disorder strength is beyond $W_{B}$, the 3D chiral SOTI is\nthen successively driven into two phases, i.e., diffusive metallic phase and\nAnderson insulating phase. Furthermore, an averaged conductance plateau of\n$e^{2}/h$ emerges in the diffusive metallic phase.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:31:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shen","Yedi",""],["Li","Zeyu",""],["Niu","Qian",""],["Qiao","Zhenhua",""]]}
{"id":"2308.02257","submitter":"Jun Guo","authors":"Xingkun Niu, Feng Gao, Shaojie Hou, Shihao Liu, Xinmin Zhao, Jun Guo,\n  Liping Wang, Feng Zhang","title":"Enhancing Cell Proliferation and Migration by MIR-Carbonyl Vibrational\n  Coupling: Insights from Transcriptome Profiling","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cell proliferation and migration highly relate to normal tissue self-healing,\ntherefore it is highly significant for artificial controlling. Recently,\nvibrational strong coupling between biomolecules and Mid-infrared (MIR) light\nphotons has been successfully used to modify in vitro bioreactions, neuronal\nsignaling and even animal behavior. However, the synergistic effects from\nmolecules to cells remains unclear, and the regulation of MIR on cells needs to\nbe explained from the molecular level. Herein, the proliferation rate and\nmigration capacity of fibroblasts were increased by 156% and 162.5%,\nrespectively, by vibratory coupling of 5.6 micrometers photons with carbonyl\ngroups in biomolecules. Through transcriptome sequencing analysis, the\nregulatory mechanism of infrared light in 5.6 micrometers was explained from\nthe level of signal pathway and cell components. 5.6 micrometers optical high\npower lasers can regulate cell function through vibrational strong coupling\nwhile minimizing photothermal damage. This work not only sheds light on the\nnon-thermal effect on MIR light-based on wound healing, but also provides new\nevidence to future frequency medicine.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:45:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Niu","Xingkun",""],["Gao","Feng",""],["Hou","Shaojie",""],["Liu","Shihao",""],["Zhao","Xinmin",""],["Guo","Jun",""],["Wang","Liping",""],["Zhang","Feng",""]]}
{"id":"2308.02258","submitter":"Suman Majumder","authors":"Shubham Thwal and Suman Majumder","title":"Segregation disrupts the Arrhenius behavior of an isomerization reaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Co-existence of phase segregation and \\emph{interconversion} or\n\\emph{isomerization} reaction among molecular species leads to fascinating\nstructure formation in biological and chemical world. Using Monte Carlo\nsimulations of the prototype Ising model, we explore the chemical kinetics of\nsuch a system consisting of a binary mixture of \\emph{isomers}. Our results\nreveal that even though the two concerned processes are individually Arrhenius\nin nature, the Arrhenius behavior of the \\emph{isomerization} reaction gets\nsignificantly disrupted due to an interplay of the nonconserved dynamics of the\nreaction and the conserved diffusive dynamics of phase segregation. The\napproach used here can be potentially adapted to understand reaction kinetics\nof more complex reactions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:34:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Thwal","Shubham",""],["Majumder","Suman",""]]}
{"id":"2308.02259","submitter":"Anna Ziegler","authors":"Max Kappesser, Anna Ziegler, Sebastian Sch\\\"ops","title":"Reduced Basis Approximation for Maxwell's Eigenvalue Problem and\n  Parameter-Dependent Domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In many high-frequency simulation workflows, eigenvalue tracking along a\nparameter variation is necessary. This can become computationally prohibitive\nwhen repeated time-consuming eigenvalue problems must be solved. Therefore, we\nemploy a reduced basis approximation to bring down the computational costs. It\nis based on the greedy strategy from Horger et al. 2017 which considers\nmultiple eigenvalues for elliptic eigenvalue problems. We extend this algorithm\nto deal with parameter-dependent domains and the Maxwell eigenvalue problem. In\nthis setting, the reduced basis may contain spurious eigenmodes, which require\nspecial treatment. We demonstrate our algorithm in an eigenvalue tracking\napplication for an eigenmode classification.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:35:10 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kappesser","Max",""],["Ziegler","Anna",""],["Sch\u00f6ps","Sebastian",""]]}
{"id":"2308.02260","submitter":"Andrew McCormack","authors":"Andrew McCormack and Peter Hoff","title":"Information Geometry and Asymptotics for Kronecker Covariances","comments":"42 total pages, 21 pages of main text, 4 tables, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the information geometry and asymptotic behaviour of estimators\nfor Kronecker-structured covariances, in both growing-$n$ and growing-$p$\nscenarios, with a focus towards examining the quadratic form or partial trace\nestimator proposed by Linton and Tang. It is shown that the partial trace\nestimator is asymptotically inefficient An explanation for this inefficiency is\nthat the partial trace estimator does not scale sub-blocks of the sample\ncovariance matrix optimally. To correct for this, an asymptotically efficient,\nrescaled partial trace estimator is proposed. Motivated by this rescaling, we\nintroduce an orthogonal parameterization for the set of Kronecker covariances.\nHigh-dimensional consistency results using the partial trace estimator are\nobtained that demonstrate a blessing of dimensionality. In settings where an\narray has at least order three, it is shown that as the array dimensions\njointly increase, it is possible to consistently estimate the Kronecker\ncovariance matrix, even when the sample size is one.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:35:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["McCormack","Andrew",""],["Hoff","Peter",""]]}
{"id":"2308.02261","submitter":"Yura Malitsky","authors":"Yura Malitsky, Konstantin Mishchenko","title":"Adaptive Proximal Gradient Method for Convex Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG cs.NA math.NA stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we explore two fundamental first-order algorithms in convex\noptimization, namely, gradient descent (GD) and proximal gradient method\n(ProxGD). Our focus is on making these algorithms entirely adaptive by\nleveraging local curvature information of smooth functions. We propose adaptive\nversions of GD and ProxGD that are based on observed gradient differences and,\nthus, have no added computational costs. Moreover, we prove convergence of our\nmethods assuming only local Lipschitzness of the gradient. In addition, the\nproposed versions allow for even larger stepsizes than those initially\nsuggested in [MM20].\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:37:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Malitsky","Yura",""],["Mishchenko","Konstantin",""]]}
{"id":"2308.02262","submitter":"Zhou Rui","authors":"Zhou Rui, Jia-Ming Li, Chao-Qi Zhang","title":"Estimates of the isospin-violating $\\Lambda_b\\rightarrow \\Sigma^0 \\phi,\n  \\Sigma^0 J/\\psi$ decays and the $\\Sigma-\\Lambda$ mixing","comments":"23 pages, 1 figure, 10 tables;","journal-ref":"Phys. Rev. D 108, 033004 (2023)","doi":"10.1103/PhysRevD.108.033004","report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyse the two purely isospin-violating decays $\\Lambda_b\\rightarrow\n\\Sigma^0 \\phi$ and $\\Lambda_b\\rightarrow \\Sigma^0 J/\\psi$, proceed merely via\nthe exchange topologies, in the framework of perturbative QCD approach.\nAssuming $\\Sigma^0$ baryon belongs to the idealized isospin triplet with quark\ncomponents of $usd$, the branching ratios of the two decay modes are predicted\nto be tiny, of the order $10^{-8}-10^{-9}$, leading to a difficulty in\nobserving them. We then extend our study to include the $\\Sigma-\\Lambda$\nmixing.It is found that the mixing has significant effect on the\n$\\Lambda_b\\rightarrow \\Sigma$ decays, especially it can greatly increase the\nrate of the $J/\\psi$ process, by as much as two orders of magnitude, yield\n$10^{-7}$, which should be searchable in the future. We also estimate a set of\nasymmetry observables with and without the mixing effect, which will be tested\nin coming experiments.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:38:07 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:28:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rui","Zhou",""],["Li","Jia-Ming",""],["Zhang","Chao-Qi",""]]}
{"id":"2308.02263","submitter":"Jinyu Long","authors":"Jinyu Long and Jetic G\\=u and Binhao Bai and Zhibo Yang and Ping Wei\n  and Junli Li","title":"Efficient Monaural Speech Enhancement using Spectrum Attention Fusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Speech enhancement is a demanding task in automated speech processing\npipelines, focusing on separating clean speech from noisy channels. Transformer\nbased models have recently bested RNN and CNN models in speech enhancement,\nhowever at the same time they are much more computationally expensive and\nrequire much more high quality training data, which is always hard to come by.\nIn this paper, we present an improvement for speech enhancement models that\nmaintains the expressiveness of self-attention while significantly reducing\nmodel complexity, which we have termed Spectrum Attention Fusion. We carefully\nconstruct a convolutional module to replace several self-attention layers in a\nspeech Transformer, allowing the model to more efficiently fuse spectral\nfeatures. Our proposed model is able to achieve comparable or better results\nagainst SOTA models but with significantly smaller parameters (0.58M) on the\nVoice Bank + DEMAND dataset.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:39:29 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Long","Jinyu",""],["G\u016b","Jetic",""],["Bai","Binhao",""],["Yang","Zhibo",""],["Wei","Ping",""],["Li","Junli",""]]}
{"id":"2308.02264","submitter":"Torsten Lin{\\ss}","authors":"Torsten Lin\\ss, Goran Radojev","title":"Maximum-norm a posteriori error bounds for an extrapolated upwind scheme\n  applied to a singularly perturbed convection-diffusion problem","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":"  Richardson extrapolation is applied to a simple first-order upwind difference\nscheme for the approximation of solutions of singularly perturbed\nconvection-diffusion problems in one dimension. Robust a posteriori error\nbounds are derived for the proposed method on arbitrary meshes. It is shown\nthat the resulting error estimator can be used to stear an adaptive mesh\nalgorithm that generates meshes resolving layers and singularities. Numerical\nresults are presented that illustrate the theoretical findings.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:42:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lin\u00df","Torsten",""],["Radojev","Goran",""]]}
{"id":"2308.02265","submitter":"Raffaele De Rose Dr.","authors":"M. Vatalaro, H. Neill, F. Gity, P. Magnone, V. Maccaronio, C.\n  M\\'arquez, J.C. Galdon, F. Gamiz, F. Crupi, P. Hurley, R. De Rose","title":"Experimental analysis of variability in WS$_2$-based devices for\n  hardware security","comments":null,"journal-ref":"Solid-State Electronics 2023","doi":"10.1016/j.sse.2023.108701","report-no":null,"categories":"cs.ET","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This work investigates the variability of tungsten disulfide (WS$_2$)-based\ndevices by experimental characterization in view of possible application in the\nfield of hardware security. To this aim, a preliminary analysis was performed\nby measurements across voltages and temperatures on a set of seven\nSi/SiO$_2$/WS$_2$ back-gated devices, also considering the effect of different\nstabilization conditions on their conductivity. Obtained results show\nappreciable variability in the conductivity, while also revealing similar\ndependence on bias and temperature across tested devices. Overall, our analysis\ndemonstrates that WS$_2$-based devices can be potentially exploited to ensure\nadequate randomness and robustness against environmental variations and then\nused as building blocks for hardware security primitives.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:43:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Vatalaro","M.",""],["Neill","H.",""],["Gity","F.",""],["Magnone","P.",""],["Maccaronio","V.",""],["M\u00e1rquez","C.",""],["Galdon","J. C.",""],["Gamiz","F.",""],["Crupi","F.",""],["Hurley","P.",""],["De Rose","R.",""]]}
{"id":"2308.02266","submitter":"Ken Mori","authors":"Kai Storms, Ken Mori, Steven Peters","title":"SURE-Val: Safe Urban Relevance Extension and Validation","comments":"Accepted at Uni-DAS e.V. Workshop Fahrerassistenz und automatisiertes\n  Fahren","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To evaluate perception components of an automated driving system, it is\nnecessary to define the relevant objects. While the urban domain is popular\namong perception datasets, relevance is insufficiently specified for this\ndomain. Therefore, this work adopts an existing method to define relevance in\nthe highway domain and expands it to the urban domain. While different\nconceptualizations and definitions of relevance are present in literature,\nthere is a lack of methods to validate these definitions. Therefore, this work\npresents a novel relevance validation method leveraging a motion prediction\ncomponent. The validation leverages the idea that removing irrelevant objects\nshould not influence a prediction component which reflects human driving\nbehavior. The influence on the prediction is quantified by considering the\nstatistical distribution of prediction performance across a large-scale\ndataset. The validation procedure is verified using criteria specifically\ndesigned to exclude relevant objects. The validation method is successfully\napplied to the relevance criteria from this work, thus supporting their\nvalidity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:44:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Storms","Kai",""],["Mori","Ken",""],["Peters","Steven",""]]}
{"id":"2308.02267","submitter":"Salvatore Floccari","authors":"Salvatore Floccari","title":"The Hodge and Tate conjectures for hyper-K\\\"{a}hler sixfolds of\n  generalized Kummer type","comments":"31 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove the conjectures of Hodge and Tate for any six-dimensional\nhyper-K\\\"ahler variety that is deformation equivalent to a generalized Kummer\nvariety.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:45:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Floccari","Salvatore",""]]}
{"id":"2308.02268","submitter":"Sergey Sushkov V","authors":"Valeria A. Ishkaeva, Sergey V. Sushkov","title":"Image of an accreting general Ellis-Bronnikov wormhole","comments":"11 pages, 6 figures, new references was added","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gravitational lensing properties of supermassive astrophysical objects, such\nas black holes and wormholes, provide the realistic way for their discovering\nand investigating. Various lensing effects in a wormhole spacetime have been\nwidely studied in the literature. One of the most popular object for\ninvestigation is the Ellis wormhole which represents the simplest wormhole\ngeometry. The Ellis solution represents only the particular case of a general\nwormhole solution found independently by Ellis and Bronnikov. Surprisingly but\ngravitational lensing properties of general Ellis-Bronnikov wormholes are\npractically not investigated. In this paper we explore in details the\npropagation of light, forming a shadow and silhouette, and forming an image of\naccretion disk in the spacetime of the Ellis-Bronnikov wormhole. As well we\ncompare characteristics of images obtained for the Ellis-Bronnikov wormhole\nwith those for the Schwarzschild black hole. This comparison could be useful\nfor future observations of supermassive astrophysical objects.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:46:07 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 15:02:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ishkaeva","Valeria A.",""],["Sushkov","Sergey V.",""]]}
{"id":"2308.02269","submitter":"Hiroki Arimura","authors":"Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima,\n  Mizuki Sue","title":"Optimally Computing Compressed Indexing Arrays Based on the Compact\n  Directed Acyclic Word Graph","comments":"The short version of this paper will appear in SPIRE 2023, Pisa,\n  Italy, September 26-28, 2023, Lecture Notes in Computer Science, Springer","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.FL cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present the first study of the computational complexity of\nconverting an automata-based text index structure, called the Compact Directed\nAcyclic Word Graph (CDAWG), of size $e$ for a text $T$ of length $n$ into other\ntext indexing structures for the same text, suitable for highly repetitive\ntexts: the run-length BWT of size $r$, the irreducible PLCP array of size $r$,\nand the quasi-irreducible LPF array of size $e$, as well as the lex-parse of\nsize $O(r)$ and the LZ77-parse of size $z$, where $r, z \\le e$. As main\nresults, we showed that the above structures can be optimally computed from\neither the CDAWG for $T$ stored in read-only memory or its self-index version\nof size $e$ without a text in $O(e)$ worst-case time and words of working\nspace. To obtain the above results, we devised techniques for enumerating a\nparticular subset of suffixes in the lexicographic and text orders using the\nforward and backward search on the CDAWG by extending the results by\nBelazzougui et al. in 2015.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:46:12 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Arimura","Hiroki",""],["Inenaga","Shunsuke",""],["Kobayashi","Yasuaki",""],["Nakashima","Yuto",""],["Sue","Mizuki",""]]}
{"id":"2308.02270","submitter":"Mousumi Akter","authors":"Mousumi Akter, Shubhra Kanti Karmaker Santu","title":"Redundancy Aware Multi-Reference Based Gainwise Evaluation of Extractive\n  Summarization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  While very popular for evaluating extractive summarization task, the ROUGE\nmetric has long been criticized for its lack of semantic awareness and its\nignorance about the ranking quality of the summarizer. Thanks to previous\nresearch that has addressed these issues by proposing a gain-based automated\nmetric called Sem-nCG, which is both rank and semantic aware. However, Sem-nCG\ndoes not consider the amount of redundancy present in a model-generated summary\nand currently does not support evaluation with multiple reference summaries.\nUnfortunately, addressing both these limitations simultaneously is not trivial.\nTherefore, in this paper, we propose a redundancy-aware Sem-nCG metric and\ndemonstrate how this new metric can be used to evaluate model summaries against\nmultiple references. We also explore different ways of incorporating redundancy\ninto the original metric through extensive experiments. Experimental results\ndemonstrate that the new redundancy-aware metric exhibits a higher correlation\nwith human judgments than the original Sem-nCG metric for both single and\nmultiple reference scenarios.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:47:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Akter","Mousumi",""],["Santu","Shubhra Kanti Karmaker",""]]}
{"id":"2308.02271","submitter":"Chao Zheng","authors":"Xu Xu, Chao Zheng","title":"Combinatorial curvature flows with surgery for inversive distance circle\n  packings on surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inversive distance circle packings introduced by Bowers-Stephenson are\nnatural generalizations of Thurston's circle packings on surfaces. To find\npiecewise Euclidean metrics on surfaces with prescribed combinatorial\ncurvatures, we introduce the combinatorial Calabi flow, the fractional\ncombinatorial Calabi flow and the combinatorial $p$-th Calabi flow for the\nEuclidean inversive distance circle packings. Due to the singularities possibly\ndeveloped by these combinatorial curvature flows, the longtime existence and\nconvergence of these combinatorial curvature flows have been a difficult\nproblem for a long time. To handle the potential singularities along these\ncombinatorial curvature flows, we do surgery along these flows by edge flipping\nunder the weighted Delaunay condition. Using the discrete conformal theory\nrecently established by Bobenko-Lutz for decorated piecewise Euclidean metrics\non surfaces, we prove the longtime existence and global convergence for the\nsolutions of these combinatorial curvature flows with surgery. This provides\neffective algorithms for finding piecewise Euclidean metrics on surfaces with\nprescribed combinatorial curvatures.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:53:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xu","Xu",""],["Zheng","Chao",""]]}
{"id":"2308.02272","submitter":"Immanuel Kunz","authors":"Immanuel Kunz, Angelika Schneider, Christian Banse, Konrad Weiss,\n  Andreas Binder","title":"Poster: Patient Community -- A Test Bed For Privacy Threat Analysis","comments":"3 pages, 1 figure","journal-ref":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and\n  Communications Security. 2022. S. 3383-3385","doi":"10.1145/3548606.3564253","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Research and development of privacy analysis tools currently suffers from a\nlack of test beds for evaluation and comparison of such tools. In this work, we\npropose a benchmark application that implements an extensive list of privacy\nweaknesses based on the LINDDUN methodology. It represents a social network for\npatients whose architecture has first been described in an example analysis\nconducted by one of the LINDDUN authors. We have implemented this architecture\nand extended it with more privacy threats to build a test bed that enables\ncomprehensive and independent testing of analysis tools.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:57:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kunz","Immanuel",""],["Schneider","Angelika",""],["Banse","Christian",""],["Weiss","Konrad",""],["Binder","Andreas",""]]}
{"id":"2308.02273","submitter":"Lukas Birkemeyer","authors":"Lukas Birkemeyer, Christian King, Ina Schaefer","title":"Is Scenario Generation Ready for SOTIF? A Systematic Literature Review","comments":"accepted at IEEE ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scenario-based testing is considered state-of-the-art to verify and validate\nAdvanced Driver Assistance Systems or Automated Driving Systems. Due to the\nofficial launch of the SOTIF-standard (ISO 21448), scenario-based testing\nbecomes more and more relevant for releasing those Highly Automated Driving\nSystems. However, an essential missing detail prevent the practical application\nof the SOTIF-standard: How to practically generate scenarios for scenario-based\ntesting? In this paper, we perform a Systematic Literature Review to identify\ntechniques that generate scenarios complying with requirements of the\nSOTIF-standard. We classify existing scenario generation techniques and\nevaluate the characteristics of generated scenarios wrt. SOTIF requirements. We\ninvestigate which details of the real-world are covered by generated scenarios,\nwhether scenarios are specific for a system under test or generic, and whether\nscenarios are designed to minimize the set of unknown and hazardous scenarios.\nWe conclude that scenarios generated with existing techniques do not comply\nwith requirements implied by the SOTIF-standard; hence, we propose directions\nfor future research.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:59:21 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 09:35:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Birkemeyer","Lukas",""],["King","Christian",""],["Schaefer","Ina",""]]}
{"id":"2308.02274","submitter":"Robert Gilles","authors":"Robert P. Gilles and Lina Mallozzi","title":"Game theoretic foundations of the Gately power measure for directed\n  networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.SI econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new network centrality measure founded on the Gately value for\ncooperative games with transferable utilities. A directed network is\ninterpreted as representing control or authority relations between\nplayers--constituting a hierarchical network. The power distribution of a\nhierarchical network can be represented through a TU-game. We investigate the\nproperties of this TU-representation and investigate the Gately value of the\nTU-representation resulting in the Gately power measure. We establish when the\nGately measure is a Core power gauge, investigate the relationship of the\nGately with the $\\beta$-measure, and construct an axiomatisation of the Gately\nmeasure.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:00:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gilles","Robert P.",""],["Mallozzi","Lina",""]]}
{"id":"2308.02275","submitter":"Livio Liechti","authors":"Joshua Evan Greene, Livio Liechti","title":"On the signature of a positive braid","comments":"14 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the signature of a positive braid link is bounded from below by\na quarter of its first Betti number.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:00:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Greene","Joshua Evan",""],["Liechti","Livio",""]]}
{"id":"2308.02276","submitter":"Ali Devin Sezer Dr.","authors":"Mervan Aksu, Alexandre Popier and Ali Devin Sezer","title":"Optimal Liquidation with Conditions on Minimum Price","comments":"56 pages, 12 figures, supported by TUBITAK Grant no 118F163","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The classical optimal trading problem is the closure of a position in an\nasset over a time interval; the trader maximizes an expected utility under the\nconstraint that the position be fully closed by terminal time. Since the asset\nprice is stochastic, the liquidation constraint may be too restrictive; the\ntrader may want to relax it or slow down/stop trading depending on price\nbehavior. We consider two additional parameters that serve these purposes\nwithin the Almgren-Chriss framework: a binary valued process $I$ that\nprescribes when trading takes place and a measurable set $S$ that prescribes\nwhen full liquidation is required. We give four examples for $S$ and $I$ which\nare defined in terms of a lower bound for the price process. The terminal cost\nof the control problem is $\\infty$ over $S$ representing the liquidation\nconstraint. The permanent price impact parameter enters the problem as the\nnegative part of the terminal cost over $S^c$. $I$ modifies the running cost. A\nterminal cost that can take negative values implies 1) the backward stochastic\ndifferential equation (BSDE) associated with the value function of the control\nproblem can explode to $-\\infty$ backward in time and 2) existence results on\nminimal supersolutions of BSDE with singular terminal values and monotone\ndrivers are not directly applicable. A key part of the solution is an\nassumption that balances market volume and the permanent price impact parameter\nand a lower bound on the BSDE based on this assumption. When liquidation costs\nare quadratic, the problem is convex and, under a general filtration, the\nminimal supersolution of the BSDE gives the value function and the optimal\ncontrol. For the non-quadratic case, we assume a stochastic volatility model\nand focus on choices of $I$ and $S$ that are Markovian or can be broken into\nMarkovian pieces. These give PDE/PDE-system representations for the value\nfunctions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:00:53 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Aksu","Mervan",""],["Popier","Alexandre",""],["Sezer","Ali Devin",""]]}
{"id":"2308.02277","submitter":"Francesco Campaioli","authors":"Francesco Campaioli, Stefano Gherardini, James Q. Quach, Marco Polini\n  and Gian Marcello Andolina","title":"Colloquium: Quantum Batteries","comments":"36 pages, 12 figures, 311 references. Review and perspective article\n  on quantum batteries. Commissioned for Reviews of Modern Physics. Comments\n  and feedback are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.stat-mech physics.atm-clus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent years have witnessed an explosion of interest in quantum devices for\nthe production, storage, and transfer of energy. In this Colloquium, we\nconcentrate on the field of quantum energy storage by reviewing recent\ntheoretical and experimental progress in quantum batteries. We first provide a\ntheoretical background discussing the advantages that quantum batteries offer\nwith respect to their classical analogues. We then review the existing quantum\nmany-body battery models and present a thorough discussion of important issues\nrelated to their open nature. We finally conclude by discussing promising\nexperimental implementations, preliminary results available in the literature,\nand perspectives.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:04:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Campaioli","Francesco",""],["Gherardini","Stefano",""],["Quach","James Q.",""],["Polini","Marco",""],["Andolina","Gian Marcello",""]]}
{"id":"2308.02278","submitter":"Jiayu Zhang","authors":"Mingyu Lei, Jiayu Zhang, Yinyu Ye","title":"Blessing of High-Order Dimensionality: from Non-Convex to Convex\n  Optimization for Sensor Network Localization","comments":"25 pages, 9 figures. References in arxiv. arXiv:1801.06146,\n  arXiv:1810.04805, arXiv preprint arXiv:1906.05474, arXiv preprint\n  arXiv:1801.06146","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the Sensor Network Localization (SNL) problem, which\nseeks to determine sensor locations based on known anchor locations and\npartially given anchors-sensors and sensors-sensors distances. Two primary\nmethods for solving the SNL problem are analyzed: the low-dimensional method\nthat directly minimizes a loss function, and the high-dimensional semi-definite\nrelaxation (SDR) method that reformulates the SNL problem as an SDP\n(semi-definite programming) problem. The paper primarily focuses on the\nintrinsic non-convexity of the loss function of the low-dimensional method,\nwhich is shown in our main theorem. The SDR method, via second-order dimension\naugmentation, is discussed in the context of its ability to transform\nnon-convex problems into convex ones; while the first-order direct dimension\naugmentation fails. Additionally, we will show that more edges don't\nnecessarily contribute to the better convexity of the loss function. Moreover,\nwe provide an explanation for the success of the SDR+GD (gradient descent)\nmethod which uses the SDR solution as a warm-start of the minimization of the\nloss function by gradient descent. The paper also explores the parallels among\nSNL, max-cut, and neural networks in terms of the blessing of high-order\ndimension augmentation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:08:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lei","Mingyu",""],["Zhang","Jiayu",""],["Ye","Yinyu",""]]}
{"id":"2308.02279","submitter":"Juan Casado","authors":"Juan Casado and Yasser Hendy","title":"Open superclusters I: The most populated primordial groups of open\n  clusters in the third quadrant of the Galactic disc","comments":"29 pages, 12 tables, 11 figures","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":"  An open supercluster (OSC) is defined as a cluster of at least six open\nclusters (OCs) born from the same giant molecular cloud (GMC). We survey the\nrecent catalogs of OCs based on Gaia data and relevant literature to find 17\nOSCs of the third galactic quadrant, along with 190 likely members of them.\nOSCs are frequent enough to be considered an extra class of objects in the\nhierarchy of star formation. Some of these supersystems are new and most of\nthem contain more members than previously thought. The detailed study of some\nOSCs has leaded to the discovery of four new young clusters that are members of\nthem, named Casado-Hendy 2 to 5. In certain instances, subgroups with distinct\nPMs or 3D positions have been found within an OSC, suggesting the presence of\nmultiple generations of stars formed from several bursts of star formation\nwithin the same GMC. OSCs are typically unbound and tend to disintegrate on\ntimescales of 0.1 Gyr. The present results support the Primordial Group\nhypothesis (Casado 2022) and suggest that globular clusters are not formed from\nthe accretion of open superclusters, at least in the local Universe at late\ntimes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:21:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Casado","Juan",""],["Hendy","Yasser",""]]}
{"id":"2308.02280","submitter":"Guo-Li Wang","authors":"Wei Li, Su-Yan Pei, Tianhong Wang, Tai-Fu Feng, Guo-Li Wang","title":"The decay property of the $X(3842)$ as the $\\psi_{_3}(1^3D_{_3})$ state","comments":"17 pages, 3 figures, 3 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, the new particle $X(3842)$ discovered by the LHCb\nCollaboration is identified to be the $\\psi_{_3}(1^3D_{_3})$ state. We study\nits strong decays with the combination of the Bethe-Salpeter method and the\n$^3P_{_0}$ model. Its electromagnetic (EM) decay is also calculated by the\nBethe-Salpeter method within Mandelstam formalism. The strong decay widths are\n{$\\Gamma[X(3842)\\rightarrow D^{0}\\bar{D}^{0}]=1.28$ MeV},\n$\\Gamma[X(3823)\\rightarrow D^{+}D^{-}]=1.08$ MeV, and the ratio ${\\cal\nB}[X(3842)\\rightarrow D^{+}D^{-}]/{\\cal B}[X(3823)\\rightarrow\nD^{0}\\bar{D}^{0}]=0.84$. The EM decay width is\n$\\Gamma[X(3842)\\rightarrow\\chi_{_{c2}}\\gamma]=0.29$ MeV. We also estimate the\ntotal width to be 2.87 MeV, which is in good agreement with the experimental\ndata $2.79^{+0.86}_{-0.86}$ MeV. Since the used relativistic wave functions\ninclude different partial waves, we also study the contributions of different\npartial waves in electromagnetic decay.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:22:16 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Wei",""],["Pei","Su-Yan",""],["Wang","Tianhong",""],["Feng","Tai-Fu",""],["Wang","Guo-Li",""]]}
{"id":"2308.02281","submitter":"Rachel Gray","authors":"Rachel Gray, Freija Beirnaert, Christos Karathanasis, Beno\\^it Revenu,\n  Cezary Turski, Anson Chen, Tessa Baker, Sergio Vallejo, Antonio Enea Romano,\n  Tathagata Ghosh, Archisman Ghosh, Konstantin Leyde, Simone Mastrogiovanni,\n  Surhud More","title":"Joint cosmological and gravitational-wave population inference using\n  dark sirens and galaxy catalogues","comments":"30 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the absence of numerous gravitational-wave detections with confirmed\nelectromagnetic counterparts, the \"dark siren\" method has emerged as a leading\ntechnique of gravitational-wave cosmology. The method allows redshift\ninformation of such events to be inferred statistically from a catalogue of\npotential host galaxies. Due to selection effects, dark siren analyses\nnecessarily depend on the mass distribution of compact objects and the\nevolution of their merger rate with redshift. Informative priors on these\nquantities will impact the inferred posterior constraints on the Hubble\nconstant ($H_0$). It is thus crucial to vary these unknown distributions during\nan $H_0$ inference. This was not possible in earlier analyses due to the high\ncomputational cost, restricting them to either excluding galaxy catalogue\ninformation, or fixing the gravitational-wave population mass distribution and\nrisking introducing bias to the $H_0$ measurement. This paper introduces a\nsignificantly enhanced version of the Python package GWCOSMO, which allows\njoint estimation of cosmological and compact binary population parameters. This\nthereby ensures the analysis is now robust to a major source of potential bias.\nThe gravitational-wave events from the Third Gravitational-Wave Transient\nCatalogue are reanalysed with the GLADE+ galaxy catalogue, and an updated, more\nreliable measurement of $H_0=69^{+12}_{-7}$ km s$^{-1}$ Mpc$^{-1}$ is found\n(maximum a posteriori probability and 68% highest density interval). This\nimproved method will enable cosmological analyses with future\ngravitational-wave detections to make full use of the information available\n(both from galaxy catalogues and the compact binary population itself), leading\nto promising new independent bounds on the Hubble constant.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:24:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gray","Rachel",""],["Beirnaert","Freija",""],["Karathanasis","Christos",""],["Revenu","Beno\u00eet",""],["Turski","Cezary",""],["Chen","Anson",""],["Baker","Tessa",""],["Vallejo","Sergio",""],["Romano","Antonio Enea",""],["Ghosh","Tathagata",""],["Ghosh","Archisman",""],["Leyde","Konstantin",""],["Mastrogiovanni","Simone",""],["More","Surhud",""]]}
{"id":"2308.02282","submitter":"Jindong Wang","authors":"Wang Lu, Jindong Wang, Xinwei Sun, Yiqiang Chen, Xiangyang Ji, Qiang\n  Yang, Xing Xie","title":"DIVERSIFY: A General Framework for Time Series Out-of-distribution\n  Detection and Generalization","comments":"Journal version of arXiv:2209.07027; 17 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":"  Time series remains one of the most challenging modalities in machine\nlearning research. The out-of-distribution (OOD) detection and generalization\non time series tend to suffer due to its non-stationary property, i.e., the\ndistribution changes over time. The dynamic distributions inside time series\npose great challenges to existing algorithms to identify invariant\ndistributions since they mainly focus on the scenario where the domain\ninformation is given as prior knowledge. In this paper, we attempt to exploit\nsubdomains within a whole dataset to counteract issues induced by\nnon-stationary for generalized representation learning. We propose DIVERSIFY, a\ngeneral framework, for OOD detection and generalization on dynamic\ndistributions of time series. DIVERSIFY takes an iterative process: it first\nobtains the \"worst-case\" latent distribution scenario via adversarial training,\nthen reduces the gap between these latent distributions. We implement DIVERSIFY\nvia combining existing OOD detection methods according to either extracted\nfeatures or outputs of models for detection while we also directly utilize\noutputs for classification. In addition, theoretical insights illustrate that\nDIVERSIFY is theoretically supported. Extensive experiments are conducted on\nseven datasets with different OOD settings across gesture recognition, speech\ncommands recognition, wearable stress and affect detection, and sensor-based\nhuman activity recognition. Qualitative and quantitative results demonstrate\nthat DIVERSIFY learns more generalized features and significantly outperforms\nother baselines.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:27:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lu","Wang",""],["Wang","Jindong",""],["Sun","Xinwei",""],["Chen","Yiqiang",""],["Ji","Xiangyang",""],["Yang","Qiang",""],["Xie","Xing",""]]}
{"id":"2308.02283","submitter":"Jiaqi Li","authors":"Jiaqi Li, Yiran Wang, Zihao Huang, Jinghong Zheng, Ke Xian, Zhiguo\n  Cao, Jianming Zhang","title":"Diffusion-Augmented Depth Prediction with Sparse Annotations","comments":"Accepted by ACM MM'2023","journal-ref":null,"doi":"10.1145/3581783.3611807","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Depth estimation aims to predict dense depth maps. In autonomous driving\nscenes, sparsity of annotations makes the task challenging. Supervised models\nproduce concave objects due to insufficient structural information. They\noverfit to valid pixels and fail to restore spatial structures. Self-supervised\nmethods are proposed for the problem. Their robustness is limited by pose\nestimation, leading to erroneous results in natural scenes. In this paper, we\npropose a supervised framework termed Diffusion-Augmented Depth Prediction\n(DADP). We leverage the structural characteristics of diffusion model to\nenforce depth structures of depth models in a plug-and-play manner. An\nobject-guided integrality loss is also proposed to further enhance regional\nstructure integrality by fetching objective information. We evaluate DADP on\nthree driving benchmarks and achieve significant improvements in depth\nstructures and robustness. Our work provides a new perspective on depth\nestimation with sparse annotations in autonomous driving scenes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:29:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Jiaqi",""],["Wang","Yiran",""],["Huang","Zihao",""],["Zheng","Jinghong",""],["Xian","Ke",""],["Cao","Zhiguo",""],["Zhang","Jianming",""]]}
{"id":"2308.02284","submitter":"Manlin Wang","authors":"Manlin Wang, Yao Yao, Bin Xia, Zhiyong Chen and Jiangzhou Wang","title":"Covert and Reliable Short-Packet Communications against A Proactive\n  Warder","comments":"6 pages, 4 figures; to appear in 12th IEEE/CIC lnternational\n  Conference on Communications in China (ICCC 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":"  Wireless short-packet communications pose challenges to the security and\nreliability of the transmission. Besides, the proactive warder compounds these\nchallenges, who detects and interferes with the potential transmission. An\nextra jamming channel is introduced by the proactive warder compared with the\npassive one, resulting in the inapplicability of analytical methods and results\nin exsiting works. Thus, effective system design schemes are required for\nshort-packet communications against the proactive warder. To address this\nissue, we consider the analysis and design of covert and reliable transmissions\nfor above systems. Specifically, to investigate the reliable and covert\nperformance of the system, detection error probability at the warder and\ndecoding error probability at the receiver are derived, which is affected by\nboth the transmit power and the jamming power. Furthermore, to maximize the\neffective throughput, an optimization framework is proposed under reliability\nand covertness constraints. Numerical results verify the accuracy of analytical\nresults and the feasibility of the optimization framework. It is shown that the\ntradeoff between transmission reliability and covertness is changed by the\nproactive warder compared with the passive one. Besides, it is shown that\nlonger blocklength is always beneficial to improve the throughput for systems\nwith optimized transmission rates. But when transmission rates are fixed, the\nblocklength should be carefully designed since the maximum one is not optimal\nin this case.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:32:43 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Manlin",""],["Yao","Yao",""],["Xia","Bin",""],["Chen","Zhiyong",""],["Wang","Jiangzhou",""]]}
{"id":"2308.02285","submitter":"The CMS Collaboration","authors":"CMS Collaboration","title":"Measurement of the production cross section for a W boson in association\n  with a charm quark in proton-proton collisions at $\\sqrt{s}$ = 13 TeV","comments":"Submitted to the European Physical Journal C. All figures and tables\n  can be found at\n  http://cms-results.web.cern.ch/cms-results/public-results/publications/SMP-21-005\n  (CMS Public Pages)","journal-ref":null,"doi":null,"report-no":"CMS-SMP-21-005, CERN-EP-2023-105","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The strange quark content of the proton is probed through the measurement of\nthe production cross section for a W boson and a charm (c) quark in\nproton-proton collisions at a center-of-mass energy of 13 TeV. The analysis\nuses a data sample corresponding to a total integrated luminosity of 138\nfb$^{-1}$ collected with the CMS detector at the LHC. The W bosons are\nidentified through their leptonic decays to an electron or a muon, and a\nneutrino. Charm jets are tagged using the presence of a muon or a secondary\nvertex inside the jet. The W+c production cross section and the cross section\nratio $R^\\pm_\\text{c}$ =\n$\\sigma$(W$^+$+$\\bar{\\text{c}}$)/$\\sigma$(W$^-$+$\\text{c}$) are measured\ninclusively and differentially as functions of the transverse momentum and the\npseudorapidity of the lepton originating from the W boson decay. The precision\nof the measurements is improved with respect to previous studies, reaching 1%\nin $R^\\pm_\\text{c}$. The measurements are compared with theoretical predictions\nup to next-to-next-to-leading order in perturbative quantum chromodynamics.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:37:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["CMS Collaboration","",""]]}
{"id":"2308.02286","submitter":"Alberto Rech","authors":"Alberto Rech, Stefano Tomasin, Lorenzo Vangelista, Cristina Costa","title":"Minimum-Latency Scheduling For Partial-Information Multiple Access\n  Schemes","comments":"Conference paper, 6 pages, 4 figures","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":"  Partial-information multiple access (PIMA) is an orthogonal multiple access\n(OMA) uplink scheme where time is divided into frames, each composed of two\nparts. The first part is used to count the number of users with packets to\ntransmit, while the second has a variable number of allocated slots, each\nassigned to multiple users to uplink data transmission. We investigate the case\nof correlated user activations, wherein the correlation is due to the\nretransmissions of the collided packets, modeling PIMA as a partially\nobservable-Markov decision process. The assignment of users to slots is\noptimized based on the knowledge of both the number of active users and past\nsuccessful transmissions and collisions. The scheduling turns out to be a mixed\ninteger nonlinear programming problem, with a complexity exponentially growing\nwith the number of users. Thus, sub-optimal greedy solutions are proposed and\nevaluated. Our solutions show substantial performance improvements with respect\nto both traditional OMA schemes and conventional PIMA.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:42:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Rech","Alberto",""],["Tomasin","Stefano",""],["Vangelista","Lorenzo",""],["Costa","Cristina",""]]}
{"id":"2308.02287","submitter":"Jindong Wang","authors":"Juncheng Wang, Jindong Wang, Xixu Hu, Shujun Wang, Xing Xie","title":"Frustratingly Easy Model Generalization by Dummy Risk Minimization","comments":"Technical report; 22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Empirical risk minimization (ERM) is a fundamental machine learning paradigm.\nHowever, its generalization ability is limited in various tasks. In this paper,\nwe devise Dummy Risk Minimization (DuRM), a frustratingly easy and general\ntechnique to improve the generalization of ERM. DuRM is extremely simple to\nimplement: just enlarging the dimension of the output logits and then\noptimizing using standard gradient descent. Moreover, we validate the efficacy\nof DuRM on both theoretical and empirical analysis. Theoretically, we show that\nDuRM derives greater variance of the gradient, which facilitates model\ngeneralization by observing better flat local minima. Empirically, we conduct\nevaluations of DuRM across different datasets, modalities, and network\narchitectures on diverse tasks, including conventional classification, semantic\nsegmentation, out-of-distribution generalization, adverserial training, and\nlong-tailed recognition. Results demonstrate that DuRM could consistently\nimprove the performance under all tasks with an almost free lunch manner.\nFurthermore, we show that DuRM is compatible with existing generalization\ntechniques and we discuss possible limitations. We hope that DuRM could trigger\nnew interest in the fundamental research on risk minimization.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:43:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Juncheng",""],["Wang","Jindong",""],["Hu","Xixu",""],["Wang","Shujun",""],["Xie","Xing",""]]}
{"id":"2308.02288","submitter":"Martijn Kool","authors":"D. van Bree, A. Gholampour, Y. Jiang, and M. Kool","title":"A virtual $\\mathrm{PGL}_r$-$\\mathrm{SL}_r$ correspondence for projective\n  surfaces","comments":"47 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG hep-th math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a smooth projective surface $X$ satisfying $H_1(X,\\mathbb{Z}) = 0$ and $w\n\\in H^2(X,\\mu_r)$, we study deformation invariants of the pair $(X,w)$.\nChoosing a Brauer-Severi variety $Y$ (or, equivalently, Azumaya algebra\n$\\mathcal{A}$) over $X$ with Stiefel-Whitney class $w$, the invariants are\ndefined as virtual intersection numbers on suitable moduli spaces of stable\ntwisted sheaves on $Y$ constructed by Yoshioka (or, equivalently, moduli spaces\nof $\\mathcal{A}$-modules of Hoffmann-Stuhler).\n  We show that the invariants do not depend on the choice of $Y$. Using a\nresult of de Jong, we observe that they are deformation invariants of the pair\n$(X,w)$. For surfaces with $h^{2,0}(X) > 0$, we show that the invariants can\noften be expressed as virtual intersection numbers on Gieseker-Maruyama-Simpson\nmoduli spaces of stable sheaves on $X$. This can be seen as a\n$\\mathrm{PGL}_r$-$\\mathrm{SL}_r$ correspondence.\n  As an application, we express $\\mathrm{SU}(r) / \\mu_r$ Vafa-Witten invariants\nof $X$ in terms of $\\mathrm{SU}(r)$ Vafa-Witten invariants of $X$. We also show\nhow formulae from Donaldson theory can be used to obtain upper bounds for the\nminimal second Chern class of Azumaya algebras on $X$ with given division\nalgebra at the generic point.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:43:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["van Bree","D.",""],["Gholampour","A.",""],["Jiang","Y.",""],["Kool","M.",""]]}
{"id":"2308.02289","submitter":"J.K. Chen","authors":"Jiao-Kai Chen, Xia Feng, Jia-Qi Xie","title":"Regge trajectories for the heavy-light diquarks","comments":"9 pages, 3 figures, 6 tables. arXiv admin note: text overlap with\n  arXiv:2305.15705","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We attempt to apply the Regge trajectory approach to the heavy-light diquarks\ncomposed of one heavy quark and one light quark. However, we find that the\ndirect application of the usual Regge trajectory formula for the heavy-light\nmesons and baryons fails. In order to correctly estimate the masses of the\nheavy-light diquarks, it is needed to consider the light quark mass correction\nand the parameter $C$ in the Cornell potential $-\\alpha/r+{\\sigma}r+C$ within\nthe Regge trajectory formula. By using the modified Regge trajectory formulas,\nwe are able to estimate the masses of the heavy-light diquarks $(cu)$, $(cs)$,\n$(bu)$ and $(bs)$, which agree with other theoretical results. It is\nillustrated that the heavy-light diquarks satisfy the universal descriptions\nirrespective of heavy quark flavors, similar to other heavy-light systems such\nas the heavy-light mesons, the heavy-light baryons composed of one heavy quark\n(diquark) and one light diquark (quark), and the heavy-light tetraquarks\ncomposed of one heavy diquark (antidiquark) and one light antidiquark\n(diquark). The diquark Regge trajectory provides a new and very simple approach\nfor estimating the spectra of the heavy-light diquarks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:45:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Jiao-Kai",""],["Feng","Xia",""],["Xie","Jia-Qi",""]]}
{"id":"2308.02290","submitter":"Liam Burke Mr.","authors":"Liam Burke and Stefan G\\\"uttel","title":"Krylov Subspace Recycling With Randomized Sketching For Matrix Functions","comments":"19 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Krylov subspace recycling method for the efficient evaluation of a sequence\nof matrix functions acting on a set of vectors is developed. The method\nimproves over the recycling methods presented in [Burke et al.,\narXiv:2209.14163, 2022] in that it uses a closed-form expression for the\naugmented FOM approximants and hence circumvents the use of numerical\nquadrature. We further extend our method to use randomized sketching in order\nto avoid the arithmetic cost of orthogonalizing a full Krylov basis, offering\nan attractive solution to the fact that recycling algorithms built from shifted\naugmented FOM cannot easily be restarted. The efficacy of the proposed\nalgorithms is demonstrated with numerical experiments.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:51:13 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:29:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Burke","Liam",""],["G\u00fcttel","Stefan",""]]}
{"id":"2308.02291","submitter":"Dimiter Prodanov","authors":"Dimiter Prodanov","title":"Algorithmic computation of multivector inverses and characteristic\n  polynomials in non-degenerate Clifford algebras","comments":"11 pages. arXiv admin note: text overlap with arXiv:1904.00084","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA cs.SC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The power of Clifford or, geometric, algebra lies in its ability to represent\ngeometric operations in a concise and elegant manner. Clifford algebras provide\nthe natural generalizations of complex, dual numbers and quaternions into\nnon-commutative multivectors. The paper demonstrates an algorithm for the\ncomputation of inverses of such numbers in a non-degenerate Clifford algebra of\nan arbitrary dimension. The algorithm is a variation of the\nFaddeev-LeVerrier-Souriau algorithm and is implemented in the open-source\nComputer Algebra System Maxima. Symbolic and numerical examples in different\nClifford algebras are presented.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:51:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Prodanov","Dimiter",""]]}
{"id":"2308.02292","submitter":"Marcin Wysokinski","authors":"Krystian Jab{\\l}onowski and Jan Skolimowski and Krzysztof Byczuk and\n  Marcin M. Wysoki\\'nski","title":"Topological Mott insulator in odd-integer filled Anderson lattice model\n  with Hatsugai-Kohmoto interactions","comments":"7 pages, 4 figs","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, quantum anomalous Hall state at odd integer filling in moir\\'e\nstacked MoTe$_2$/WSe$_2$ has been convincingly interpreted as a topological\nMott insulator state appearing due to strong interactions in {\\it band} basis\n[arXiv:2210.11486]. In this work, we aim to analyze the formation of a\ntopological Mott insulator due to interactions in {\\it orbital} basis instead,\nbeing more natural for systems where interactions originate from the character\nof $f$ or $d$ orbitals rather than band flatness. For that reason, we study an\nodd-integer filled Anderson lattice model incorporating odd-parity\nhybridization between orbitals with different degrees of correlations\nintroduced in the Hatsugai-Kohmoto spirit. We demonstrate that a topological\nMott insulating state can be realized in a considered model only when weak\nintra- and inter-orbital correlations involving dispersive states are taken\ninto account. Interestingly, we find that all topological transitions between\ntrivial and $\\mathbb{Z}_2$ topological Mott insulating phases are not\naccompanied by a spectral gap closing, consistently with a phenomenon called\n{\\it first-order topological transition}. Instead, they are signaled by a kink\ndeveloped in spectral function at one of the time reversal invariant momenta.\nWe believe that our approach can provide insightful phenomenology of\ntopological Mott insulators in spin-orbit coupled $f$ or $d$ electron systems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:52:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jab\u0142onowski","Krystian",""],["Skolimowski","Jan",""],["Byczuk","Krzysztof",""],["Wysoki\u0144ski","Marcin M.",""]]}
{"id":"2308.02293","submitter":"Akifumi Okuno","authors":"Akifumi Okuno","title":"A stochastic optimization approach to train non-linear neural networks\n  with a higher-order variation regularization","comments":"13 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.AI cs.LG stat.CO stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While highly expressive parametric models including deep neural networks have\nan advantage to model complicated concepts, training such highly non-linear\nmodels is known to yield a high risk of notorious overfitting. To address this\nissue, this study considers a $(k,q)$th order variation regularization\n($(k,q)$-VR), which is defined as the $q$th-powered integral of the absolute\n$k$th order derivative of the parametric models to be trained; penalizing the\n$(k,q)$-VR is expected to yield a smoother function, which is expected to avoid\noverfitting. Particularly, $(k,q)$-VR encompasses the conventional\n(general-order) total variation with $q=1$. While the $(k,q)$-VR terms applied\nto general parametric models are computationally intractable due to the\nintegration, this study provides a stochastic optimization algorithm, that can\nefficiently train general models with the $(k,q)$-VR without conducting\nexplicit numerical integration. The proposed approach can be applied to the\ntraining of even deep neural networks whose structure is arbitrary, as it can\nbe implemented by only a simple stochastic gradient descent algorithm and\nautomatic differentiation. Our numerical experiments demonstrate that the\nneural networks trained with the $(k,q)$-VR terms are more ``resilient'' than\nthose with the conventional parameter regularization. The proposed algorithm\nalso can be extended to the physics-informed training of neural networks\n(PINNs).\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:57:13 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 05:06:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Okuno","Akifumi",""]]}
{"id":"2308.02294","submitter":"Munazza Zaib Ms.","authors":"Munazza Zaib and Wei Emma Zhang and Quan Z. Sheng and Subhash Sagar\n  and Adnan Mahmood and Yang Zhang","title":"Learning to Select the Relevant History Turns in Conversational Question\n  Answering","comments":null,"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 increasing demand for the web-based digital assistants has given a rapid\nrise in the interest of the Information Retrieval (IR) community towards the\nfield of conversational question answering (ConvQA). However, one of the\ncritical aspects of ConvQA is the effective selection of conversational history\nturns to answer the question at hand. The dependency between relevant history\nselection and correct answer prediction is an intriguing but under-explored\narea. The selected relevant context can better guide the system so as to where\nexactly in the passage to look for an answer. Irrelevant context, on the other\nhand, brings noise to the system, thereby resulting in a decline in the model's\nperformance. In this paper, we propose a framework, DHS-ConvQA (Dynamic History\nSelection in Conversational Question Answering), that first generates the\ncontext and question entities for all the history turns, which are then pruned\non the basis of similarity they share in common with the question at hand. We\nalso propose an attention-based mechanism to re-rank the pruned terms based on\ntheir calculated weights of how useful they are in answering the question. In\nthe end, we further aid the model by highlighting the terms in the re-ranked\nconversational history using a binary classification task and keeping the\nuseful terms (predicted as 1) and ignoring the irrelevant terms (predicted as\n0). We demonstrate the efficacy of our proposed framework with extensive\nexperimental results on CANARD and QuAC -- the two popularly utilized datasets\nin ConvQA. We demonstrate that selecting relevant turns works better than\nrewriting the original question. We also investigate how adding the irrelevant\nhistory turns negatively impacts the model's performance and discuss the\nresearch challenges that demand more attention from the IR community.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:59:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zaib","Munazza",""],["Zhang","Wei Emma",""],["Sheng","Quan Z.",""],["Sagar","Subhash",""],["Mahmood","Adnan",""],["Zhang","Yang",""]]}
{"id":"2308.02295","submitter":"Manlin Wang","authors":"Manlin Wang, Bin Xia, Yao Yao, Zhiyong Chen and Jiangzhou Wang","title":"IRS-Enabled Covert and Reliable Communications: How Many Reflection\n  Elements are Required?","comments":"6 pages, 4 figures; to appear in 2023 IEEE Global Communications\n  Conference (GLOBECOM)","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":"  Short-packet communications are applied to various scenarios where\ntransmission covertness and reliability are crucial due to the open wireless\nmedium and finite blocklength. Although intelligent reflection surface (IRS)\nhas been widely utilized to enhance transmission covertness and reliability,\nthe question of how many reflection elements at IRS are required remains\nunanswered, which is vital to system design and practical deployment. The\ninherent strong coupling exists between the transmission covertness and\nreliability by IRS, leading to the question of intractability. To address this\nissue, the detection error probability at the warder and its approximation are\nderived first to reveal the relation between covertness performance and the\nnumber of reflection elements. Besides, to evaluate the reliability performance\nof the system, the decoding error probability at the receiver is also derived.\nSubsequently, the asymptotic reliability performance in high covertness regimes\nis investigated, which provides theoretical predictions about the number of\nreflection elements at IRS required to achieve a decoding error probability\nclose to 0 with given covertness requirements. Furthermore, Monte-Carlo\nsimulations verify the accuracy of the derived results for detection (decoding)\nerror probabilities and the validity of the theoretical predictions for\nreflection elements. Moreover, results show that more reflection elements are\nrequired to achieve high reliability with tighter covertness requirements,\nlonger blocklength and higher transmission rates.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:59:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Manlin",""],["Xia","Bin",""],["Yao","Yao",""],["Chen","Zhiyong",""],["Wang","Jiangzhou",""]]}
{"id":"2308.02296","submitter":"Alex Pepper","authors":"Alex Pepper, Travis. J. Baker, Yuanlong Wang, Qiu-Cheng Song, Lynden.\n  K. Shalm, Varun. B. Varma, Sae Woo Nam, Nora Tischler, Sergei Slussarenko,\n  Howard. M. Wiseman, Geoff. J. Pryde","title":"Scalable multiparty steering based on a single pair of entangled qubits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The distribution and verification of quantum nonlocality across a network of\nusers is essential for future quantum information science and technology\napplications. However, beyond simple point-to-point protocols, existing methods\nstruggle with increasingly complex state preparation for a growing number of\nparties. Here, we show that, surprisingly, multiparty loophole-free quantum\nsteering, where one party simultaneously steers arbitrarily many spatially\nseparate parties, is achievable by constructing a quantum network from a set of\nqubits of which only one pair is entangled. Using these insights, we\nexperimentally demonstrate this type of steering between three parties with the\ndetection loophole closed. With its modest and fixed entanglement requirements,\nthis work introduces a scalable approach to rigorously verify quantum\nnonlocality across multiple parties, thus providing a practical tool towards\ndeveloping the future quantum internet.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:01:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Pepper","Alex",""],["Baker","Travis. J.",""],["Wang","Yuanlong",""],["Song","Qiu-Cheng",""],["Shalm","Lynden. K.",""],["Varma","Varun. B.",""],["Nam","Sae Woo",""],["Tischler","Nora",""],["Slussarenko","Sergei",""],["Wiseman","Howard. M.",""],["Pryde","Geoff. J.",""]]}
{"id":"2308.02297","submitter":"Giao Ky Duong","authors":"Giao Ky Duong, Nejla Nouaili, and Hatem Zaag","title":"Flat blow-up solutions for the complex Ginzburg Landau equation","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 complex Ginzburg Landau equation\n  $$ \\partial_t u = (1 + i \\beta ) \\Delta u + (1 + i \\delta) |u|^{p-1}u -\n\\alpha u \\text{ where } \\beta, \\delta, \\alpha \\in \\mathbb R. $$\n  The study aims to investigate the finite time blowup phenomenon. In\nparticular, for fixed $ \\beta\\in \\mathbb R$, the existence of finite time\nblowup solutions for an arbitrary large $|\\delta|$ is still unknown.\nEspecially, Popp, Stiller, Kuznetsov, and Kramer formally conjectured in 1998\nthat there is no blowup (collapse) in such a case. In this work, considered as\na breakthrough, we give a counter example to this conjecture. We show the\nexistence of blowup solutions in one dimension with $\\delta $ arbitrarily given\nand $\\beta =0$. The novelty is based on two main contributions: an\ninvestigation of a new blowup scaling (flat blowup regime) and a suitable\nmodulation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:02:30 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 13:55:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Duong","Giao Ky",""],["Nouaili","Nejla",""],["Zaag","Hatem",""]]}
{"id":"2308.02298","submitter":"Jia Zhu","authors":"Jia Zhu, Yifeng Xiong, Junsheng Mu, Ronghui Zhang, Xiaojun Jing","title":"Efficient Spectrum Sharing Between Coexisting OFDM Radar and Downlink\n  Multiuser Communication Systems","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.SY eess.SY math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the problem of joint subcarrier and power allocation\nin the coexistence of radar and multi-user communication systems. Specifically,\nin our research scenario, the base station (BS) provides information\ntransmission services for multiple users while ensuring that its interference\nto a separate radar system will not affect the radar's normal function. To this\nend, we propose a subcarrier and power allocation scheme based on orthogonal\nfrequency division multiple access (OFDM). The original problem consisting\ninvolving multivariate fractional programming and binary variables is highly\nnon-convex. Due to its complexity, we relax the binary constraint by\nintroducing a penalty term, provided that the optimal solution is not affected.\nThen, by integrating multiple power variables into one matrix, the original\nproblem is reformulated as a multi-ratio fractional programming (FP) problem,\nand finally a quadratic transform is employed to make the non-convex problem a\nsequence of convex problems. The numerical results indicate the performance\ntrade-off between the multi-user communication system and the radar system, and\nnotably that the performance of the communication system is not improved with\npower increase in the presence of radar interference beyond a certain\nthreshold. This provides a useful insight for the energy-efficient design of\nthe system.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:03:52 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:49:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhu","Jia",""],["Xiong","Yifeng",""],["Mu","Junsheng",""],["Zhang","Ronghui",""],["Jing","Xiaojun",""]]}
{"id":"2308.02299","submitter":"Qiang Zhou","authors":"Qiang Zhou, Chaohui Yu, Shaofeng Zhang, Sitong Wu, Zhibing Wang, Fan\n  Wang","title":"RegionBLIP: A Unified Multi-modal Pre-training Framework for Holistic\n  and Regional Comprehension","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 investigate extending the comprehension of Multi-modal Large\nLanguage Models (MLLMs) to regional objects. To this end, we propose to extract\nfeatures corresponding to regional objects as soft prompts for LLM, which\nprovides a straightforward and scalable approach and eliminates the need for\nLLM fine-tuning. To effectively extract regional features from regular image\nfeatures and irregular point cloud features, we present a novel and unified\nposition-assisted feature extraction module. Furthermore, training an MLLM from\nscratch is highly time-consuming. Thus, we propose incrementally extending\nexisting pre-trained MLLMs to comprehend more modalities and the regional\nobjects of those modalities. Specifically, we freeze the Q-Former from BLIP-2,\nan impressive MLLM, and optimize the modality-specific Lora parameters in\nQ-Former and LLM for each newly introduced modality. The freezing of the\nQ-Former eliminates the need for extensive pre-training on massive image-text\ndata. The freezed Q-Former pre-trained from massive image-text data is also\nbeneficial for the pre-training on image-region-text data. We name our\nframework RegionBLIP. We pre-train RegionBLIP on image-region-text,\npoint-cloud-text, and point-cloud-region-text data. Experimental results verify\nthat \\Ours{} can preserve the image comprehension capability of BILP-2 and\nfurther gain a comprehension of the newly introduced point cloud modality and\nregional objects. The Data, Code, and Pre-trained models will be available at\nhttps://github.com/mightyzau/RegionBLIP.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:17:22 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhou","Qiang",""],["Yu","Chaohui",""],["Zhang","Shaofeng",""],["Wu","Sitong",""],["Wang","Zhibing",""],["Wang","Fan",""]]}
{"id":"2308.02300","submitter":"Mustafa Polat","authors":"Mustafa Polat, Hazan \\\"Ozkan, and H\\^aldun Sevin\\c{c}li","title":"Quantum transport regimes in quartic dispersion materials with Anderson\n  disorder","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mexican-hat-shaped quartic dispersion manifests itself in certain families of\nsingle-layer twodimensional hexagonal crystals such as compounds of groups\nIII-VI and groups IV-V as well as elemental crystals of group V. Quartic band\nforms the valence band edge in various of these structures, and some of the\nexperimentally confirmed structures are GaS, GaSe, InSe, SnSb and blue\nphosphorene. Here, we numerically investigate strictly-one-dimensional (1D) and\nquasi-one dimensional (Q1D) nanoribbons with quartic dispersion and\nsystematically study the effects of Anderson disorder on their transport\nproperties with the help of a minimal tight-binding model and Landauer\nformalism. We compare the analytical expression for the scaling function with\nsimulation data to deduce about the domains of diffusion and localization\nregimes. In 1D, it is shown that conductance drops dramatically at the quartic\nband edge compared to a quadratic band. As for the Q1D nanoribbons, a set of\nsingularities emerge close to the band edge, which suppress conductance and\nlead to short mean-free-paths and localization lengths. Interestingly, wider\nnanoribbons can have shorter mean-free-paths because of denser singularities.\nHowever, the localization lengths do not necessarily follow the same trend. The\nresults display the peculiar effects of quartic dispersion on transport in\ndisordered systems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:06:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Polat","Mustafa",""],["\u00d6zkan","Hazan",""],["Sevin\u00e7li","H\u00e2ldun",""]]}
{"id":"2308.02301","submitter":"Yurii Averboukh","authors":"Yurii Averboukh","title":"Approximation of deterministic mean field type control 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":"  The paper is concerned with the approximation of the deterministic the mean\nfield type control system by a mean field Markov chain. It turns out that the\ndynamics of the distribution in the approximating system is described by a\nsystem of ordinary differential equations. Given a strategy for the Markov\nchain, we explicitly construct a control in the deterministic mean field type\ncontrol system. Our method is a realization of the model predictive approach.\nThe converse construction is also presented. These results lead to an estimate\nof the Hausdorff distance between the bundles of motions in the deterministic\nmean field type control system and the mean field Markov chain. Especially, we\npay the attention to the case when one can approximate the bundle of motions in\nthe mean field type system by solutions of a finite systems of ODEs.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:06:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Averboukh","Yurii",""]]}
{"id":"2308.02302","submitter":"Joseph E. Bonin","authors":"Joseph E. Bonin and Kevin Long","title":"Connectivity gaps among matroids with the same enumerative invariants","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many important enumerative invariants of a matroid can be obtained from its\nTutte polynomial, and many more are determined by two stronger invariants, the\n$\\mathcal{G}$-invariant and the configuration of the matroid. We show that the\nsame is not true of the most basic connectivity invariants. Specifically, we\nshow that for any positive integer $n$, there are pairs of matroids that have\nthe same configuration (and so the same $\\mathcal{G}$-invariant and the same\nTutte polynomial) but the difference between their Tutte connectivities exceeds\n$n$, and likewise for vertical connectivity and branch-width. The examples that\nwe use to show this, which we construct using an operation that we introduce,\nare transversal matroids that are also positroids.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:07:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bonin","Joseph E.",""],["Long","Kevin",""]]}
{"id":"2308.02303","submitter":"Shekhar Chandra Pandey","authors":"Shekhar Chandra Pandey, Shilpam Sharma, Ashish Khandelwal, M. K.\n  Chattopadhyay","title":"Ambient Temperature Growth and Superconducting Properties of Ti-V Alloy\n  Thin Films","comments":"4 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A study on the optimization of ambient temperature growth and superconducting\nproperties of Ti-V alloy thin films grown on SiO2-coated Si substrate is\nreported here. These films have been synthesized by co-sputtering of Ti and V\ntargets, and films having different Ti concentrations were deposited to get the\noptimized critical temperature (TC) of thin films close to the bulk value. The\nmaximum TC of 5.2 K has been obtained in the Ti40V60 composition, which is\nfurther increased to 6.2 K when a 10 nm thick Ti underlayer is added below the\nTi-V film. GIXRD measurements confirm the formation of Ti-V alloys in the\ndesired crystal structure. The upper critical field (HC2) of the thin films has\nbeen estimated with the help of magnetotransport measurements. The utility of\nTi-V alloy thin films in superconducting radiation detection applications is\nascertained.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:10:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Pandey","Shekhar Chandra",""],["Sharma","Shilpam",""],["Khandelwal","Ashish",""],["Chattopadhyay","M. K.",""]]}
{"id":"2308.02304","submitter":"Yifei Wu","authors":"Yifei Wu, Dongfang Xu, Derrick Wing Kwan Ng, Wolfgang Gerstacker, and\n  Robert Schober","title":"Movable Antenna-Enhanced Multiuser Communication: Optimal Discrete\n  Antenna Positioning and Beamforming","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":"  Movable antennas (MAs) are a promising paradigm to enhance the spatial\ndegrees of freedom of conventional multi-antenna systems by flexibly adapting\nthe positions of the antenna elements within a given transmit area. In this\npaper, we model the motion of the MA elements as discrete movements and study\nthe corresponding resource allocation problem for MA-enabled multiuser\nmultiple-input single-output (MISO) communication systems. Specifically, we\njointly optimize the beamforming and the MA positions at the base station (BS)\nfor the minimization of the total transmit power while guaranteeing the minimum\nrequired signal-to-interference-plus-noise ratio (SINR) of each individual\nuser. To obtain the globally optimal solution to the formulated resource\nallocation problem, we develop an iterative algorithm capitalizing on the\ngeneralized Bender's decomposition with guaranteed convergence. Our numerical\nresults demonstrate that the proposed MA-enabled communication system can\nsignificantly reduce the BS transmit power and the number of antenna elements\nneeded to achieve a desired performance compared to state-of-the-art\ntechniques, such as antenna selection. Furthermore, we observe that refining\nthe step size of the MA motion driver improves performance at the expense of a\nhigher computational complexity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:15:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wu","Yifei",""],["Xu","Dongfang",""],["Ng","Derrick Wing Kwan",""],["Gerstacker","Wolfgang",""],["Schober","Robert",""]]}
{"id":"2308.02305","submitter":"Nicolas Pavloff","authors":"Thibault Congy, Pierre Azam, Robin Kaiser, Nicolas Pavloff","title":"Topological constraints on the dynamics of vortex formation in a\n  bi-dimensional quantum fluid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.quant-gas nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present experimental and theoretical results on formation of quantum\nvortices in a laser beam propagating in a nonlinear medium. Topological\nconstrains richer that the mere conservation of vorticity impose an elaborate\ndynamical behavior to the formation and annihilation of vortex/anti-vortex\npairs. We identify two such mechanisms, both described by the same fold-Hopf\nbifurcation. One of them is particularly efficient although it is not observed\nin the context of liquid helium films or stationary linear systems because it\nrelies on the finite compressibility and on the non-stationnarity of the fluid\nof light we consider.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:15:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Congy","Thibault",""],["Azam","Pierre",""],["Kaiser","Robin",""],["Pavloff","Nicolas",""]]}
{"id":"2308.02306","submitter":"Bradley Sturt","authors":"Braden L. Crimmins, J. Alex Halderman, Bradley Sturt","title":"Improving the Security of United States Elections with Robust\n  Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For more than a century, election officials across the United States have\ninspected voting machines before elections using a procedure called Logic and\nAccuracy Testing (LAT). This procedure consists of election officials casting a\ntest deck of ballots into each voting machine and confirming the machine\nproduces the expected vote total for each candidate. We bring a scientific\nperspective to LAT by introducing the first formal approach to designing test\ndecks with rigorous security guarantees. Specifically, our approach employs\nrobust optimization to find test decks that are guaranteed to detect any voting\nmachine misconfiguration that would cause votes to be swapped across\ncandidates. Out of all the test decks with this security guarantee, our robust\noptimization problem yields the test deck with the minimum number of ballots,\nthereby minimizing implementation costs for election officials. To facilitate\ndeployment at scale, we develop a practically efficient exact algorithm for\nsolving our robust optimization problems based on the cutting plane method. In\npartnership with the Michigan Bureau of Elections, we retrospectively applied\nour approach to all 6928 ballot styles from Michigan's November 2022 general\nelection; this retrospective study reveals that the test decks with rigorous\nsecurity guarantees obtained by our approach require, on average, only 1.2%\nmore ballots than current practice. Our approach has since been piloted in\nreal-world elections by the Michigan Bureau of Elections as a low-cost way to\nimprove election security and increase public trust in democratic institutions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:17:53 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Crimmins","Braden L.",""],["Halderman","J. Alex",""],["Sturt","Bradley",""]]}
{"id":"2308.02307","submitter":"Ma Wen-Long","authors":"Wen-Long Ma","title":"Unified theory of classical and quantum signal sensing with a qubit","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum sensing protocols typically uses a quantum sensor to sense classical\nsignals with the standard Ramsey inteferometry measurements. The classical\nsignals are often real numbers determining the sensor Hamiltonian. However, for\na senor embedded in a quantum environment, the signal to detect may be a\nquantum operator on a target quantum system. There is still no systematic\nmethod to detect such a quantum signal. Here we provide a general framework to\nsense static quantum signals with a qubit sensor by the Ramsey interferometry\nmeasurements, with the static classical signal sensing incorporated as a\nspecial case. This framework is based on a novel approach to simultaneously\nestimating the eigenvalues of the quantum signal operator with sequential\nprojective measurements of the sensor, which can extract useful information\nabout the target quantum system. The scheme can also be extended to sense ac\nquantum signals with dynamical decoupling control of the sensor. As an example,\nwe show that a qubit sensor can simultaneously detect the individual coupling\nstrengths with multiple target qubits in a spin-star model.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:18:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ma","Wen-Long",""]]}
{"id":"2308.02309","submitter":"Jian Li","authors":"Huihui Xie and Jian Li","title":"Impact of Intrinsic Electromagnetic Structure on Nuclear Charge Radius\n  in Relativistic continuum Hartree-Bogoliubov Theory","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we explore the effects of the nucleon's intrinsic\nelectromagnetic (EM) structure on the nuclear charge radius within the\nframework of relativistic continuum Hartree-Bogoliubov (RCHB) theory. By\nconsidering both the EM structure contributions and pairing correlation\neffects, we conduct comprehensive calculations, focusing on the plumbum\nisotopic chain as an illustrative example. Incorporating both the intrinsic EM\nstructure corrections and pairing correlation effects leads to a notable\nenhancement in the descriptions of mean-square charge radii for even-even Pb\nisotopes, as predicted by the RCHB calculations. Furthermore, we identify that\nthe improvement in charge radii can be primarily attributed to the intrinsic\nneutron and neutron spin-orbit terms of the EM structure. On the other hand,\nthe pairing correlation exerts a more pronounced influence on the isotope\nshift, evident in the differential mean-square charge radii. Specifically,\namong the EM structure corrections, the pairing correlation predominantly\naffects the neutron spin-orbit contribution. In addition to the charge radii\nresults, we also discuss the nuclear charge densities of Pb isotopes, exploring\ntheir isotopic evolution as captured by the RCHB calculations. This\ncomprehensive investigation sheds light on the interplay between intrinsic EM\nstructure and pairing correlations, providing valuable insights into the\nnuclear charge distribution and its evolution along the plumbum isotopic chain.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:21:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xie","Huihui",""],["Li","Jian",""]]}
{"id":"2308.02310","submitter":"Amit Seal Ami","authors":"Amit Seal Ami, Syed Yusuf Ahmed, Radowan Mahmud Redoy, Nathan Cooper,\n  Kaushal Kafle, Kevin Moran, Denys Poshyvanyk, Adwait Nadkarni","title":"MASC: A Tool for Mutation-Based Evaluation of Static Crypto-API Misuse\n  Detectors","comments":"To be published in Proceedings of the 31st ACM Joint European\n  Software Engineering Conference and Symposium on the Foundations of Software\n  Engineering","journal-ref":null,"doi":"10.1145/3611643.3613099","report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  While software engineers are optimistically adopting crypto-API misuse\ndetectors (or crypto-detectors) in their software development cycles, this\nmomentum must be accompanied by a rigorous understanding of crypto-detectors'\neffectiveness at finding crypto-API misuses in practice. This demo paper\npresents the technical details and usage scenarios of our tool, namely Mutation\nAnalysis for evaluating Static Crypto-API misuse detectors (MASC). We developed\n$12$ generalizable, usage based mutation operators and three mutation scopes,\nnamely Main Scope, Similarity Scope, and Exhaustive Scope, which can be used to\nexpressively instantiate compilable variants of the crypto-API misuse cases.\nUsing MASC, we evaluated nine major crypto-detectors, and discovered $19$\nunique, undocumented flaws. We designed MASC to be configurable and\nuser-friendly; a user can configure the parameters to change the nature of\ngenerated mutations. Furthermore, MASC comes with both Command Line Interface\nand Web-based front-end, making it practical for users of different levels of\nexpertise.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:22:22 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 06:28:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ami","Amit Seal",""],["Ahmed","Syed Yusuf",""],["Redoy","Radowan Mahmud",""],["Cooper","Nathan",""],["Kafle","Kaushal",""],["Moran","Kevin",""],["Poshyvanyk","Denys",""],["Nadkarni","Adwait",""]]}
{"id":"2308.02311","submitter":"Simone Secchi","authors":"Federico Bernini and Sergio Rolando and Simone Secchi","title":"Compact embeddings for weighted fractional Sobolev spaces and\n  applications to Nonlinear Schr\\\"odinger Equations","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 this work is to prove a compact embedding for a weighted\nfractional Sobolev spaces. As an application, we use this embedding to prove,\nvia variational methods, the existence of solutions for the following\nSchr\\\"odinger equation $$\n  (-\\Delta)^su + V(|x|)u = K(|x|)f(u), \\quad \\text{ in } \\mathbb{R}^N, $$ where\nthe two measurable functions $K > 0$ and $V \\geq 0$ could vanish at infinity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:23:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bernini","Federico",""],["Rolando","Sergio",""],["Secchi","Simone",""]]}
{"id":"2308.02312","submitter":"Samia Kabir","authors":"Samia Kabir, David N. Udo-Imeh, Bonan Kou, Tianyi Zhang","title":"Who Answers It Better? An In-Depth Analysis of ChatGPT and Stack\n  Overflow Answers to Software Engineering Questions","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":"  Over the last decade, Q&A platforms have played a crucial role in how\nprogrammers seek help online. The emergence of ChatGPT, however, is causing a\nshift in this pattern. Despite ChatGPT's popularity, there hasn't been a\nthorough investigation into the quality and usability of its responses to\nsoftware engineering queries. To address this gap, we undertook a comprehensive\nanalysis of ChatGPT's replies to 517 questions from Stack Overflow (SO). We\nassessed the correctness, consistency, comprehensiveness, and conciseness of\nthese responses. Additionally, we conducted an extensive linguistic analysis\nand a user study to gain insights into the linguistic and human aspects of\nChatGPT's answers. Our examination revealed that 52% of ChatGPT's answers\ncontain inaccuracies and 77% are verbose. Nevertheless, users still prefer\nChatGPT's responses 39.34% of the time due to their comprehensiveness and\narticulate language style. These findings underscore the need for meticulous\nerror correction in ChatGPT while also raising awareness among users about the\npotential risks associated with seemingly accurate answers.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:23:20 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 02:17:18 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 16:21:29 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kabir","Samia",""],["Udo-Imeh","David N.",""],["Kou","Bonan",""],["Zhang","Tianyi",""]]}
{"id":"2308.02313","submitter":"Anna Tamai","authors":"A. Hunter, S. Beck, E. Cappelli, F. Margot, M. Straub, Y. Alexanian,\n  G. Gatti, M.D. Watson, T. K. Kim, C. Cacho, N.C. Plumb, M. Shi, M. Radovi\\'c,\n  D. A. Sokolov, A. P. Mackenzie, M. Zingl, J. Mravlje, A. Georges, F.\n  Baumberger, and A. Tamai","title":"The fate of quasiparticles at high-temperature","comments":"Supplemental Material available upon request","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":"  We study the temperature evolution of quasiparticles in the correlated metal\nSr$_2$RuO$_4$. Our angle resolved photoemission data show that quasiparticles\npersist up to temperatures above 200~K, far beyond the Fermi liquid regime.\nExtracting the quasiparticle self-energy we demonstrate that the quasiparticle\nresidue $Z$ increases with increasing temperature. Quasiparticles eventually\ndisappear on approaching the bad metal state of Sr$_2$RuO$_4$ not by losing\nweight but via excessive broadening from super-Planckian scattering. We further\nshow that the Fermi surface of Sr$_2$RuO$_4$ - defined as the loci where the\nspectral function peaks - deflates with increasing temperature. These findings\nare in semi-quantitative agreement with dynamical mean field theory\ncalculations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:23:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hunter","A.",""],["Beck","S.",""],["Cappelli","E.",""],["Margot","F.",""],["Straub","M.",""],["Alexanian","Y.",""],["Gatti","G.",""],["Watson","M. D.",""],["Kim","T. K.",""],["Cacho","C.",""],["Plumb","N. C.",""],["Shi","M.",""],["Radovi\u0107","M.",""],["Sokolov","D. A.",""],["Mackenzie","A. P.",""],["Zingl","M.",""],["Mravlje","J.",""],["Georges","A.",""],["Baumberger","F.",""],["Tamai","A.",""]]}
{"id":"2308.02314","submitter":"Michael Bonitz","authors":"A.V. Filinov and M. Bonitz","title":"The equation of state of partially ionized hydrogen and deuterium plasma\n  revisited","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":"  We present novel first-principle fermionic path integral Monte Carlo (PIMC)\nsimulation results for a dense partially ionized hydrogen (deuterium) plasma,\nfor temperatures in the range $15,000$K $\\leq T \\leq 400,000$K and densities $7\n\\cdot 10^{-7}$g/cm$^{3}\\leq \\rho_H \\leq 0.085$ g/cm$^{3}$ ($1.4 \\cdot\n10^{-6}$g/cm$^{3}\\leq \\rho_D \\leq 0.17$ g/cm$^{3}$), corresponding to $100\\geq\nr_s\\geq 2$, where $r_s=\\bar r/a_B$ is the ratio of the mean interparticle\ndistance to the Bohr radius. These simulations are based on the fermionic\npropagator PIMC (FP-PIMC) approach in the grand canonical ensemble [A. Filinov\n\\textit{et al.}, Contrib. Plasma Phys. \\textbf{61}, e202100112 (2021)] and\nfully account for correlation and quantum degeneracy and spin effects. For the\napplication to hydrogen and deuterium, we develop a combination of the\nfourth-order factorization and the pair product ansatz for the density matrix.\nMoreover, we avoid the fixed node approximation that may lead to uncontrolled\nerrors in restricted PIMC (RPIMC). Our results allow us to critically\nre-evaluate the accuracy of the RPIMC simulations for hydrogen by Hu \\textit{et\nal.} [Phys. Rev. B \\textbf{84}, 224109 (2011)] and of various chemical models.\nThe deviations are generally found to be small, but for the lowest temperature,\n$T=15,640$~K they reach several percent. We present detailed tables with our\nfirst principles results for the pressure and energy isotherms.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:24:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Filinov","A. V.",""],["Bonitz","M.",""]]}
{"id":"2308.02315","submitter":"Kelsey Snapp","authors":"Kelsey L. Snapp, Benjamin Verdier, Aldair Gongora, Samuel Silverman,\n  Adedire D. Adesiji, Elise F. Morgan, Timothy J. Lawton, Emily Whiting, and\n  Keith A. Brown","title":"Autonomous Discovery of Tough Structures","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":"  A key feature of mechanical structures ranging from crumple zones in cars to\npadding in packaging is their ability to provide protection by absorbing\nmechanical energy. Designing structures to efficiently meet these needs has\nprofound implications on safety, weight, efficiency, and cost. Despite the wide\nvarieties of systems that must be protected, a unifying design principle is\nthat protective structures should exhibit a high energy-absorbing efficiency,\nor that they should absorb as much energy as possible without mechanical\nstresses rising to levels that damage the system. However, progress in\nincreasing the efficiency of such structures has been slow due to the need to\ntest using tedious and manual physical experiments. Here, we overcome this\nbottleneck through the use of a self-driving lab to perform >25,000 machine\nlearning-guided experiments in a parameter space with at minimum trillions of\npossible designs. Through these experiments, we realized the highest mechanical\nenergy absorbing efficiency recorded to date. Furthermore, these experiments\nuncover principles that can guide design for both elastic and plastic classes\nof materials by incorporating both geometry and material into a single model.\nThis work shows the potential for sustained operation of self-driving labs with\na strong human-machine collaboration.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:24:29 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Snapp","Kelsey L.",""],["Verdier","Benjamin",""],["Gongora","Aldair",""],["Silverman","Samuel",""],["Adesiji","Adedire D.",""],["Morgan","Elise F.",""],["Lawton","Timothy J.",""],["Whiting","Emily",""],["Brown","Keith A.",""]]}
{"id":"2308.02316","submitter":"Liang Liu","authors":"Rui Wang and Zhaorui Wang and Liang Liu and Shuowen Zhang and Shi Jin","title":"A Quantize-then-Estimate Protocol for CSI Acquisition in IRS-Aided\n  Downlink Communication","comments":"accepted by IEEE Globecom 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For intelligent reflecting surface (IRS) aided downlink communication in\nfrequency division duplex (FDD) systems, the overhead for the base station (BS)\nto acquire channel state information (CSI) is extremely high under the\nconventional ``estimate-then-quantize'' scheme, where the users first estimate\nand then feed back their channels to the BS. Recently, [1] revealed a strong\ncorrelation in different users' cascaded channels stemming from their common\nBS-IRS channel component, and leveraged such a correlation to significantly\nreduce the pilot transmission overhead in IRS-aided uplink communication. In\nthis paper, we aim to exploit the above channel property for reducing the\noverhead of both pilot transmission and feedback transmission in IRS-aided\ndownlink communication. Different from the uplink counterpart where the BS\npossesses the pilot signals containing the CSI of all the users, in downlink\ncommunication, the distributed users merely receive the pilot signals\ncontaining their own CSI and cannot leverage the correlation in different\nusers' channels revealed in [1]. To tackle this challenge, this paper proposes\na novel ``quantize-then-estimate'' protocol in FDD IRS-aided downlink\ncommunication. Specifically, the users first quantize their received pilot\nsignals, instead of the channels estimated from the pilot signals, and then\ntransmit the quantization bits to the BS. After de-quantizing the pilot signals\nreceived by all the users, the BS estimates all the cascaded channels by\nleveraging the correlation embedded in them, similar to the uplink scenario.\nFurthermore, we manage to show both analytically and numerically the great\noverhead reduction in terms of pilot transmission and feedback transmission\narising from our proposed ``quantize-then-estimate'' protocol.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:34:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Rui",""],["Wang","Zhaorui",""],["Liu","Liang",""],["Zhang","Shuowen",""],["Jin","Shi",""]]}
{"id":"2308.02317","submitter":"Rohan Agarwal","authors":"Rohan Agarwal, Zhiyu Lin, Mark Riedl","title":"A Controllable Co-Creative Agent for Game System Design","comments":"Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Many advancements have been made in procedural content generation for games,\nand with mixed-initiative co-creativity, have the potential for great benefits\nto human designers. However, co-creative systems for game generation are\ntypically limited to specific genres, rules, or games, limiting the creativity\nof the designer. We seek to model games abstractly enough to apply to any\ngenre, focusing on designing game systems and mechanics, and create a\ncontrollable, co-creative agent that can collaborate on these designs. We\npresent a model of games using state-machine-like components and resource\nflows, a set of controllable metrics, a design evaluator simulating\nplaythroughs with these metrics, and an evolutionary design balancer and\ngenerator. We find this system to be both able to express a wide range of games\nand able to be human-controllable for future co-creative applications.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:34:51 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Agarwal","Rohan",""],["Lin","Zhiyu",""],["Riedl","Mark",""]]}
{"id":"2308.02318","submitter":"Marco Barbieri","authors":"Andrea Chiuri, Federico Angelini, Simone Santoro, Marco Barbieri, and\n  Ilaria Gianani","title":"A Quantum Ghost Imaging Spectrometer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a device that exploits spatial and spectral correlations in\nparametric downconversion at once. By using a ghost imaging arrangement, we\nhave been able to reconstruct remotely the frequency profile of a composite\nsystem. The presence of distinct spectral regions is corroborated by a\nmodel-independent statistical analysis that constitutes an intriguing\npossibility also in the low count regime.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:36:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chiuri","Andrea",""],["Angelini","Federico",""],["Santoro","Simone",""],["Barbieri","Marco",""],["Gianani","Ilaria",""]]}
{"id":"2308.02319","submitter":"Walter Bridges","authors":"Walter Bridges, Kathrin Bringmann and Johann Franke","title":"On the number of irreducible representations of $\\mathfrak{su}(3)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note, we use a variant of the hyperbola method to prove an asymptotic\nexpansion for the summatory function of the number of irreducible\n$\\mathfrak{su}(3)$-representations of dimension $n$. This is a natural\ncompanion result to work of Romik, who proved an asymptotic formula for the\nnumber of unrestricted $\\mathfrak{su}(3)$-representations of dimension $n$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:37:13 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bridges","Walter",""],["Bringmann","Kathrin",""],["Franke","Johann",""]]}
{"id":"2308.02320","submitter":"Marco Barbieri","authors":"Marco Barbieri, Iole Venditti, Chiara Battocchio, Vincenzo Berardi,\n  Fabio Bruni, and Ilaria Gianani","title":"Observing thermal lensing with quantum light","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.chem-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The introduction of quantum methods in spectroscopy can provide enhanced\nperformance and technical advantages in the management of noise. We investigate\nthe application of quantum illumination in a pump and probe experiment. Thermal\nlensing in a suspension of gold nanorods is explored using a classical beam as\nthe pump and the emission from parametric downconversion as the probe. We\nobtain an insightful description of the behaviour of the suspension under\npumping with a method known to provide good noise rejection. Our findings are a\nfurther step towards investigating effects of quantum light in complex\nplasmonic media.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:39:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Barbieri","Marco",""],["Venditti","Iole",""],["Battocchio","Chiara",""],["Berardi","Vincenzo",""],["Bruni","Fabio",""],["Gianani","Ilaria",""]]}
{"id":"2308.02321","submitter":"Paul Klimov","authors":"Paul V. Klimov, Andreas Bengtsson, Chris Quintana, Alexandre Bourassa,\n  Sabrina Hong, Andrew Dunsworth, Kevin J. Satzinger, William P. Livingston,\n  Volodymyr Sivak, Murphy Y. Niu, Trond I. Andersen, Yaxing Zhang, Desmond\n  Chik, Zijun Chen, Charles Neill, Catherine Erickson, Alejandro Grajales Dau,\n  Anthony Megrant, Pedram Roushan, Alexander N. Korotkov, Julian Kelly, Vadim\n  Smelyanskiy, Yu Chen, Hartmut Neven","title":"Optimizing quantum gates towards the scale of logical qubits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A foundational assumption of quantum error correction theory is that quantum\ngates can be scaled to large processors without exceeding the error-threshold\nfor fault tolerance. Two major challenges that could become fundamental\nroadblocks are manufacturing high performance quantum hardware and engineering\na control system that can reach its performance limits. The control challenge\nof scaling quantum gates from small to large processors without degrading\nperformance often maps to non-convex, high-constraint, and time-dependent\ncontrol optimization over an exponentially expanding configuration space. Here\nwe report on a control optimization strategy that can scalably overcome the\ncomplexity of such problems. We demonstrate it by choreographing the frequency\ntrajectories of 68 frequency-tunable superconducting qubits to execute single-\nand two-qubit gates while mitigating computational errors. When combined with a\ncomprehensive model of physical errors across our processor, the strategy\nsuppresses physical error rates by $\\sim3.7\\times$ compared with the case of no\noptimization. Furthermore, it is projected to achieve a similar performance\nadvantage on a distance-23 surface code logical qubit with 1057 physical\nqubits. Our control optimization strategy solves a generic scaling challenge in\na way that can be adapted to a variety of quantum operations, algorithms, and\ncomputing architectures.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:39:46 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 12:26:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Klimov","Paul V.",""],["Bengtsson","Andreas",""],["Quintana","Chris",""],["Bourassa","Alexandre",""],["Hong","Sabrina",""],["Dunsworth","Andrew",""],["Satzinger","Kevin J.",""],["Livingston","William P.",""],["Sivak","Volodymyr",""],["Niu","Murphy Y.",""],["Andersen","Trond I.",""],["Zhang","Yaxing",""],["Chik","Desmond",""],["Chen","Zijun",""],["Neill","Charles",""],["Erickson","Catherine",""],["Dau","Alejandro Grajales",""],["Megrant","Anthony",""],["Roushan","Pedram",""],["Korotkov","Alexander N.",""],["Kelly","Julian",""],["Smelyanskiy","Vadim",""],["Chen","Yu",""],["Neven","Hartmut",""]]}
{"id":"2308.02322","submitter":"Aliakbar Moradi Marjaneh","authors":"Danial Saadatmand, Aliakbar Moradi Marjaneh, Alidad Askari and Herbert\n  Weigel","title":"Phonons scattering off discrete asymmetric solitons in the absence of a\n  Peierls-Nabarro potential","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We analyze the interaction of lattice vibrations (phonon wave-packets) with\nan asymmetric kink soliton initially at rest. We employ the $\\phi^6$ model in\none space and one time dimensions for various lattice spacings and consider two\ndifferent discretization prescriptions for the field potential that do not\ngenerate Peierls-Nabarro potentials, i.e. the kink can be placed anywhere along\nthe lattice beyond discrete translational invariance. Since the $\\phi^6$ model\nkink is neither symmetric nor anti-symmetric under spatial reflections we\nsimulate the cases where the wave-packet approaches the kink from negative or\npositive spatial infinity. We extract the energy transmission and reflection\ncoefficients as functions of the central frequency of the phonon wave-packet\nfor the different lattice spacings. For large lattice spacings the wave-packet\nis always fully reflected while for smaller spacing the amount of reflection\nand transmission depends on the central frequency. We also identify scenarios\nin which the target kink acquires a non-zero velocity from its interaction with\nthe wave-packet.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:40:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Saadatmand","Danial",""],["Marjaneh","Aliakbar Moradi",""],["Askari","Alidad",""],["Weigel","Herbert",""]]}
{"id":"2308.02323","submitter":"Joram Meron","authors":"Joram Meron, Victor Guimar\\~aes","title":"Dataflow Dialogue Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate task-oriented dialogue generation within the dataflow dialogue\nparadigm. We show an example of agenda driven dialogue generation for the\nMultiWOZ domain, and an example of generation without an agenda for the\nSMCalFlow domain, where we show an improvement in the accuracy of the\ntranslation of user requests to dataflow expressions when the generated\ndialogues are used to augment the translation training dataset.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:40:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Meron","Joram",""],["Guimar\u00e3es","Victor",""]]}
{"id":"2308.02324","submitter":"Lorenzo Miretti","authors":"Lorenzo Miretti, Giuseppe Caire, S{\\l}awomir Sta\\'nczak","title":"Robust cell-free mmWave/sub-THz access using minimal coordination and\n  coarse synchronization","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":"  This study investigates simpler alternatives to coherent joint transmission\nfor supporting robust connectivity against signal blockage in mmWave/sub-THz\naccess networks. By taking an information-theoretic viewpoint, we demonstrate\nanalytically that with a careful design, full macrodiversity gains and\nsignificant SNR gains can be achieved through canonical receivers and minimal\ncoordination and synchronization requirements at the infrastructure side. Our\nproposed scheme extends non-coherent joint transmission by employing a special\nform of diversity to counteract artificially induced deep fades that would\notherwise make this technique often compare unfavorably against standard\ntransmitter selection schemes. Additionally, the inclusion of an Alamouti-like\nspace-time coding layer is shown to recover a significant fraction of the\noptimal performance. Our conclusions are based on an insightful multi-point\nintermittent block fading channel model that enables rigorous ergodic and\noutage rate analysis, while also considering timing offsets due to imperfect\ndelay compensation. Although simplified, our approach captures the essential\nfeatures of modern mmWave/sub-THz communications, thereby providing practical\ndesign guidelines for realistic systems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:40:56 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Miretti","Lorenzo",""],["Caire","Giuseppe",""],["Sta\u0144czak","S\u0142awomir",""]]}
{"id":"2308.02325","submitter":"Gianluca Guidi","authors":"Gianluca Guidi, Rossana Mastrandrea, Angelo Facchini, Tiziano\n  Squartini, Christopher Kennedy","title":"Tracing two decades of carbon emissions using a network approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Carbon emissions are currently attributed to producers although a\nconsumption-aware accounting is advocated. After constructing the Carbon Trade\nNetwork, we trace the flow of emissions over the past two decades. Our analysis\nreveals the presence of an unexpected, positive feedback: despite individual\nexchanges have become less carbon-intensive, the increase in trading activity\nhas ultimately risen the amount of emissions directed from `net exporters'\ntowards `net importers'. Adopting a consumption-aware accounting would\nre-distribute responsibility between the two groups, possibly reducing\ndisparities.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:42:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Guidi","Gianluca",""],["Mastrandrea","Rossana",""],["Facchini","Angelo",""],["Squartini","Tiziano",""],["Kennedy","Christopher",""]]}
{"id":"2308.02326","submitter":"Ye-Chao Liu","authors":"Yixuan Hu, Ye-Chao Liu, Jiangwei Shang","title":"Algorithm for evaluating distance-based entanglement measures","comments":"7 pages, 4 figures; close to the published version","journal-ref":"Chin. Phys. B 32, 080307 (2023)","doi":"10.1088/1674-1056/acd5c5","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantifying entanglement in quantum systems is an important yet challenging\ntask due to its NP-hard nature. In this work, we propose an efficient algorithm\nfor evaluating distance-based entanglement measures. Our approach builds on\nGilbert's algorithm for convex optimization, providing a reliable upper bound\non the entanglement of a given arbitrary state. We demonstrate the\neffectiveness of our algorithm by applying it to various examples, such as\ncalculating the squared Bures metric of entanglement as well as the relative\nentropy of entanglement for GHZ states, $W$ states, Horodecki states, and\nchessboard states. These results demonstrate that our algorithm is a versatile\nand accurate tool that can quickly provide reliable upper bounds for\nentanglement measures.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:42:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hu","Yixuan",""],["Liu","Ye-Chao",""],["Shang","Jiangwei",""]]}
{"id":"2308.02327","submitter":"Badri Vishal Pandey","authors":"Kathrin Bringmann and Badri Vishal Pandey","title":"Biases among classes of rank-crank partitions$\\pmod{11}$","comments":"17 pages, comments welcome","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 inequalities for ranks, cranks, and partitions among\ndifferent classes modulo 11. These were conjectured by Borozenets.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:45:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bringmann","Kathrin",""],["Pandey","Badri Vishal",""]]}
{"id":"2308.02328","submitter":"Gustavo Madeira Dr","authors":"S.M. Giuliatti Winter, G. Madeira, T. Ribeiro, O.C. Winter, G.O.\n  Barbosa and G. Borderes-Motta","title":"On the stability around Chariklo and the confinement of its rings","comments":"Accepted for publication in Astronomy & Astrophysics","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":"  Chariklo has two narrow and dense rings, C1R and C2R, located at 391 km and\n405 km, respectively. In the light of new stellar occultation data, we study\nthe stability around Chariklo. We also analyse three confinement mechanisms, to\nprevent the spreading of the rings, based on shepherd satellites in resonance\nwith the edges of the rings. This study is made through a set of numerical\nsimulations and the Poincar\\'e surface of section technique. From the numerical\nsimulation results we verify that, from the current parameters referring to the\nshape of Chariklo, the inner edge of the stable region is much closer to\nChariklo than the rings. The Poincar\\'e surface of sections allow us to\nidentify the first kind periodic and quasi-periodic orbits, and also the\nresonant islands corresponding to the 1:2, 2:5, and 1:3 resonances. We\nconstruct a map of a versus e space which gives the location and width of the\nstable region and the 1:2, 2:5, and 1:3 resonances. We found that the first\nkind periodic orbits family can be responsible for a stable region whose\nlocation and size meet that of C1R, for specific values of the ring particles'\neccentricities. However, C2R is located in an unstable region if the width of\nthe ring is assumed to be about 120 m. After analysing different systems we\npropose that the best confinement mechanism is composed of three satellites,\ntwo of them shepherding the inner edge of C1R and the outer edge of C2R, while\nthe third satellite would be trapped in the 1:3 resonance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:48:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Winter","S. M. Giuliatti",""],["Madeira","G.",""],["Ribeiro","T.",""],["Winter","O. C.",""],["Barbosa","G. O.",""],["Borderes-Motta","G.",""]]}
{"id":"2308.02329","submitter":"Marcello Calvanese Strinati","authors":"Marcello Calvanese Strinati, Claudio Conti","title":"Hyperscaling in the coherent hyperspin machine","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classical or quantum physical systems can simulate the Ising Hamiltonian for\nlarge-scale optimization and machine learning. However, devices such as quantum\nannealers and coherent Ising machines suffer an exponential drop in the\nprobability of success in finite-size scaling. We show that by exploiting high\ndimensional embedding of the Ising Hamiltonian and subsequent dimensional\nannealing, the drop is counteracted by an exponential improvement in the\nperformance. Our analysis relies on extensive statistics of the convergence\ndynamics by high-performance computing. We propose a realistic experimental\nimplementation of the new annealing device by off-the-shelf coherent Ising\nmachine technology. The hyperscaling heuristics can also be applied to other\nquantum or classical Ising machines by engineering nonlinear gain, loss, and\nnon-local couplings.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:51:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Strinati","Marcello Calvanese",""],["Conti","Claudio",""]]}
{"id":"2308.02330","submitter":"Andreas Schrank","authors":"Andreas Schrank, Fabian Walocha, Stefan Brandenburg, and Michael Oehl","title":"Human-Centered Design and Evaluation of a Workplace for the Remote\n  Assistance of Highly Automated Vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Remotely operating vehicles utilizes the benefits of vehicle automation when\nfully automated driving is not yet possible. A human operator ensures safety\nand availability from afar and supports the vehicle automation when its\ncapabilities are exceeded. The remote operator thus fulfills the legal\nrequirements in Germany as a Technical Supervisor to operate highly automated\nvehicles at SAE 4. To integrate the remote operator into the automated driving\nsystem, a novel user-centered human-machine interface (HMI) for remote\nassistance workplaces was developed and initially evaluated. The insights\ngained in this process were incorporated into the design of a workplace\nprototype for remote assistance. This prototype was now tested in the study\nreported here by 34 participants meeting the professional background criteria\nfor the role of Technical Supervisor according to the German law by using\ntypical remote assistance scenarios created in a simulation environment. Even\nunder elevated cognitive load induced by simultaneously engaging in a secondary\ntask, participants were able to obtain sufficient situation awareness and\nquickly resolve the scenarios. The HMI also yielded favorable usability and\nacceptance ratings. The results of the study inform the iterative workplace\ndevelopment and further research on the remote assistance of highly automated\nvehicles.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:51:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Schrank","Andreas",""],["Walocha","Fabian",""],["Brandenburg","Stefan",""],["Oehl","Michael",""]]}
{"id":"2308.02331","submitter":"Frank McNally","authors":"Frank McNally, Rasha Abbasi, Paolo Desiati, Juan Carlos D\\'iaz\n  V\\'elez, Christina Cochling, Katherine Gruchot, William Hayes, Andrew Moy,\n  Emily Schmidt, and Andrew Thorpe (for the IceCube Collaboration)","title":"Cosmic Ray Anisotropy with 11 Years of IceCube 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-360","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube Observatory provides our highest-statistics picture of the\ncosmic-ray arrival directions in the Southern Hemisphere, with over 700 billion\ncosmic-ray-induced muon events collected between May 2011 and May 2022. Using\nthe larger data volume, we find an improved significance of the PeV cosmic ray\nanisotropy down to scales of $6^\\circ$. In addition, we observe a variation in\nthe angular power spectrum as a function of energy, hinting at a relative\ndecrease in large-scale features above 100 TeV. The data-taking period covers a\ncomplete solar cycle, providing new insight into the time variability of the\nsignal. We present preliminary results using this up-to-date event sample.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:53:26 GMT"}],"update_date":"2023-08-07","authors_parsed":[["McNally","Frank","","for the IceCube Collaboration"],["Abbasi","Rasha","","for the IceCube Collaboration"],["Desiati","Paolo","","for the IceCube Collaboration"],["V\u00e9lez","Juan Carlos D\u00edaz","","for the IceCube Collaboration"],["Cochling","Christina","","for the IceCube Collaboration"],["Gruchot","Katherine","","for the IceCube Collaboration"],["Hayes","William","","for the IceCube Collaboration"],["Moy","Andrew","","for the IceCube Collaboration"],["Schmidt","Emily","","for the IceCube Collaboration"],["Thorpe","Andrew","","for the IceCube Collaboration"]]}
{"id":"2308.02332","submitter":"Rui Ding","authors":"Rui Ding, Fuhui Zhou, Yuben Qu, Chao Dong, Qihui Wu, and Tony Q. S.\n  Quek","title":"Novel Online-Offline MA2C-DDPG for Efficient Spectrum Allocation and\n  Trajectory Optimization in Dynamic Spectrum Sharing UAV Networks","comments":"Some technical errors occured in the manuscript","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unmanned aerial vehicle (UAV) communication is of crucial importance for\ndiverse practical applications. However, it is susceptible to the severe\nspectrum scarcity problem and interference since it operates in the unlicensed\nspectrum band. In order to tackle those issues, a dynamic spectrum sharing\nnetwork is considered with the anti-jamming technique. Moreover, an intelligent\nspectrum allocation and trajectory optimization scheme is proposed to adapt to\ndiverse jamming models by exploiting our designed novel online-offline\nmulti-agent actor-critic and deep deterministic policy-gradient framework.\nSimulation results demonstrate the high efficiency of our proposed framework.\nIt is also shown that our proposed scheme achieves the largest transmission\nrate among all benchmark schemes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:56:22 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 07:54:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ding","Rui",""],["Zhou","Fuhui",""],["Qu","Yuben",""],["Dong","Chao",""],["Wu","Qihui",""],["Quek","Tony Q. S.",""]]}
{"id":"2308.02333","submitter":"Madison Brady","authors":"Madison Brady, Virginie Faramaz-Gorka, Geoffrey Bryden, Steve Ertel","title":"Long-term Evolution of Warps in Debris Disks -- Application to the\n  Gyr-old system HD 202628","comments":"13 pages, 5 figures. Accepted in ApJ","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 present the results of N-body simulations meant to reproduce the long-term\neffects of mutually inclined exoplanets on debris disks, using the HD 202628\nsystem as a proxy. HD 202628 is a Gyr-old solar-type star that possesses a\ndirectly observable, narrow debris ring with a clearly defined inner edge and\nnon-zero eccentricity, hinting at the existence of a sculpting exoplanet. The\neccentric nature of the disk leads us to examine the effect on it over Gyr\ntimescales from an eccentric and inclined planet, placed on its orbit through\nscattering processes. We find that, in systems with dynamical timescales akin\nto that of HD 202628, a planetary companion is capable of completely tilting\nthe debris disk. This tilt is preserved over the Gyr age of the system.\nSimulated observations of our models show that an exoplanet around HD 202628\nwith an inclination misalignment $\\gtrsim\\,10$ degrees would cause the disk to\nbe observably diffuse and broad, which is inconsistent with ALMA observations.\nWith these observations, we conclude that if there is an exoplanet shaping this\ndisk, it likely had a mutual inclination of less than 5 degrees with the\nprimordial disk. Conclusions of this work can be either applied to debris disks\nappearing as narrow rings (e.g., Fomalhaut, HR 4796), or to disks that are\nvertically thick at ALMA wavelengths (e.g., HD 110058).\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:00:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Brady","Madison",""],["Faramaz-Gorka","Virginie",""],["Bryden","Geoffrey",""],["Ertel","Steve",""]]}
{"id":"2308.02334","submitter":"Tomoya Kemmochi","authors":"Tomoya Kemmochi","title":"Higher order discrete gradient method by the discontinuous Galerkin\n  time-stepping method","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many differential equations with physical backgrounds are described as\ngradient systems, which are evolution equations driven by the gradient of some\nfunctionals, and such problems have energy conservation or dissipation\nproperties. For numerical computation of gradient systems, numerical schemes\nthat inherit the energy structure of the equation play important roles, which\nare called structure-preserving. The discrete gradient method is one of the\nmost classical framework of structure-preserving methods, which is at most\nsecond order accurate. In this paper, we develop a higher-order\nstructure-preserving numerical method for gradient systems, which includes the\ndiscrete gradient method. We reformulate the gradient system as a coupled\nsystem and then apply the discontinuous Galerkin time-stepping method.\nNumerical examples suggests that the order of accuracy of our scheme is $(k+1)$\nin general and $(2k+1)$ at nodal times, where $k$ is the degree of polynomials.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:05:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kemmochi","Tomoya",""]]}
{"id":"2308.02335","submitter":"Zhengyang Mao","authors":"Zhengyang Mao, Wei Ju, Yifang Qin, Xiao Luo, and Ming Zhang","title":"RAHNet: Retrieval Augmented Hybrid Network for Long-tailed Graph\n  Classification","comments":"Accepted by the ACM International Conference on Multimedia (MM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV cs.IR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph classification is a crucial task in many real-world multimedia\napplications, where graphs can represent various multimedia data types such as\nimages, videos, and social networks. Previous efforts have applied graph neural\nnetworks (GNNs) in balanced situations where the class distribution is\nbalanced. However, real-world data typically exhibit long-tailed class\ndistributions, resulting in a bias towards the head classes when using GNNs and\nlimited generalization ability over the tail classes. Recent approaches mainly\nfocus on re-balancing different classes during model training, which fails to\nexplicitly introduce new knowledge and sacrifices the performance of the head\nclasses. To address these drawbacks, we propose a novel framework called\nRetrieval Augmented Hybrid Network (RAHNet) to jointly learn a robust feature\nextractor and an unbiased classifier in a decoupled manner. In the feature\nextractor training stage, we develop a graph retrieval module to search for\nrelevant graphs that directly enrich the intra-class diversity for the tail\nclasses. Moreover, we innovatively optimize a category-centered supervised\ncontrastive loss to obtain discriminative representations, which is more\nsuitable for long-tailed scenarios. In the classifier fine-tuning stage, we\nbalance the classifier weights with two weight regularization techniques, i.e.,\nMax-norm and weight decay. Experiments on various popular benchmarks verify the\nsuperiority of the proposed method against state-of-the-art approaches.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:06:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mao","Zhengyang",""],["Ju","Wei",""],["Qin","Yifang",""],["Luo","Xiao",""],["Zhang","Ming",""]]}
{"id":"2308.02336","submitter":"Guanxiong Qu Dr.","authors":"Guanxiong Qu, Masamitsu Hayashi, Masao Ogata, and Junji Fujimoto","title":"Anisotropy of the spin Hall effect in a Dirac ferromagnet","comments":"12 pages, 5 figure","journal-ref":null,"doi":"10.1103/PhysRevB.108.064404","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the intrinsic spin Hall effect of a Dirac Hamiltonian system with\nferromagnetic exchange coupling, a minimal model combining relativistic\nspin-orbit interaction and ferromagnetism. The energy bands of the Dirac\nHamiltonian are split after introducing a Stoner-type ferromagnetic ordering\nwhich breaks the spherical symmetry of pristine Dirac model. The totally\nantisymmetric spin Hall conductivity (SHC) tensor becomes axially anisotropic\nalong the direction of external electric field. Interestingly, the anisotropy\ndoes not vanish in the asymptotic limit of zero magnetization. We show that the\nferromagnetic ordering breaks the spin degeneracy of the eigenfunctions and\nmodifies the selection rules of the interband transitions for the intrinsic\nspin Hall effect. The difference in the selection rule between the pristine and\nthe ferromagnetic Dirac phases causes the anisotropy of the SHC, resulting in a\ndiscontinuity of the SHC as the magnetization, directed orthogonal to the\nelectric field, is reduced to zero in the ferromagnetic Dirac phase and enters\nthe pristine Dirac phase.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:07:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Qu","Guanxiong",""],["Hayashi","Masamitsu",""],["Ogata","Masao",""],["Fujimoto","Junji",""]]}
{"id":"2308.02337","submitter":"Pablo Spiga","authors":"Giovanni Mecenero and Pablo Spiga","title":"A formula for the base size of the symmetric group in its action on\n  subsets","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given two positive integers $n$ and $k$, we obtain a formula for the base\nsize of the symmetric group of degree $n$ in its action on $k$-subsets. Then,\nwe use this formula to compute explicitly the base size for each $n$ and for\neach $k\\le 14$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:07:54 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 08:31:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mecenero","Giovanni",""],["Spiga","Pablo",""]]}
{"id":"2308.02339","submitter":"Jingyi Wang","authors":"Jingyi Wang, Can Zhang, Jinfa Huang, Botao Ren, Zhidong Deng","title":"Improving Scene Graph Generation with Superpixel-Based Interaction\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in Scene Graph Generation (SGG) typically model the\nrelationships among entities utilizing box-level features from pre-defined\ndetectors. We argue that an overlooked problem in SGG is the coarse-grained\ninteractions between boxes, which inadequately capture contextual semantics for\nrelationship modeling, practically limiting the development of the field. In\nthis paper, we take the initiative to explore and propose a generic paradigm\ntermed Superpixel-based Interaction Learning (SIL) to remedy coarse-grained\ninteractions at the box level. It allows us to model fine-grained interactions\nat the superpixel level in SGG. Specifically, (i) we treat a scene as a set of\npoints and cluster them into superpixels representing sub-regions of the scene.\n(ii) We explore intra-entity and cross-entity interactions among the\nsuperpixels to enrich fine-grained interactions between entities at an earlier\nstage. Extensive experiments on two challenging benchmarks (Visual Genome and\nOpen Image V6) prove that our SIL enables fine-grained interaction at the\nsuperpixel level above previous box-level methods, and significantly\noutperforms previous state-of-the-art methods across all metrics. More\nencouragingly, the proposed method can be applied to boost the performance of\nexisting box-level approaches in a plug-and-play fashion. In particular, SIL\nbrings an average improvement of 2.0% mR (even up to 3.4%) of baselines for the\nPredCls task on Visual Genome, which facilitates its integration into any\nexisting box-level method.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:12:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Jingyi",""],["Zhang","Can",""],["Huang","Jinfa",""],["Ren","Botao",""],["Deng","Zhidong",""]]}
{"id":"2308.02340","submitter":"Guanxiong Luo","authors":"Guanxiong Luo and Xiaoqing Wang and Mortiz Blumenthal and Martin\n  Schilling and Erik Hans Ulrich Rauf and Raviteja Kotikalapudi and Niels Focke\n  and Martin Uecker","title":"Generative Image Priors for MRI Reconstruction Trained from\n  Magnitude-Only Images","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":"  Purpose: In this work, we present a workflow to construct generic and robust\ngenerative image priors from magnitude-only images. The priors can then be used\nfor regularization in reconstruction to improve image quality. Methods: The\nworkflow begins with the preparation of training datasets from magnitude-only\nMR images. This dataset is then augmented with phase information and used to\ntrain generative priors of complex images. Finally, trained priors are\nevaluated using both linear and nonlinear reconstruction for compressed sensing\nparallel imaging with various undersampling schemes. Results: The results of\nour experiments demonstrate that priors trained on complex images outperform\npriors trained only on magnitude images. Additionally, a prior trained on a\nlarger dataset exhibits higher robustness. Finally, we show that the generative\npriors are superior to L1 -wavelet regularization for compressed sensing\nparallel imaging with high undersampling. Conclusion: These findings stress the\nimportance of incorporating phase information and leveraging large datasets to\nraise the performance and reliability of the generative priors for MRI\nreconstruction. Phase augmentation makes it possible to use existing image\ndatabases for training.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:12:33 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Luo","Guanxiong",""],["Wang","Xiaoqing",""],["Blumenthal","Mortiz",""],["Schilling","Martin",""],["Rauf","Erik Hans Ulrich",""],["Kotikalapudi","Raviteja",""],["Focke","Niels",""],["Uecker","Martin",""]]}
{"id":"2308.02341","submitter":"Patrik Lundstr\\\"om","authors":"Patrik Lundstr\\\"om","title":"Hom-associative magmas with applications to Hom-associative magma\n  algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be a magma, that is a set equipped with a binary operation, and\nconsider a function $\\alpha : X \\to X$. We that $X$ is Hom-associative if for\nall $x,y,z \\in X$, the equality $\\alpha(x)(yz) = (xy) \\alpha(z)$ holds. For\nevery isomorphism class of magmas of order two, we determine all functions\n$\\alpha$ making $X$ Hom-associative. Furthermore, we find all such $\\alpha$\nthat are endomorphisms of $X$. We also consider versions of these results where\nthe binary operation on $X$ as well as the function $\\alpha$ may be only\npartially defined. We use our findings to construct examples of Hom-associative\nand multiplicative magma algebras.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:16:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lundstr\u00f6m","Patrik",""]]}
{"id":"2308.02342","submitter":"Ruslan Shaydulin","authors":"Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, Matthew DeCross,\n  Dylan Herman, Niraj Kumar, Jeffrey Larson, Danylo Lykov, Pierre Minssen, Yue\n  Sun, Yuri Alexeev, Joan M. Dreiling, John P. Gaebler, Thomas M. Gatterman,\n  Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst,\n  Shaohan Hu, Jacob Johansen, Mitchell Matheny, Tanner Mengle, Michael Mills,\n  Steven A. Moses, Brian Neyenhuis, Peter Siegfried, Romina Yalovetzky, Marco\n  Pistoia","title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization\n  Algorithm on a Classically Intractable Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quantum approximate optimization algorithm (QAOA) is a leading candidate\nalgorithm for solving optimization problems on quantum computers. However, the\npotential of QAOA to tackle classically intractable problems remains unclear.\nIn this paper, we perform an extensive numerical investigation of QAOA on the\nLow Autocorrelation Binary Sequences (LABS) problem. The rapid growth of the\nproblem's complexity with the number of spins $N$ makes it classically\nintractable even for moderately sized instances, with the best-known heuristics\nobserved to fail to find a good solution for problems with $N \\gtrapprox 200$.\nWe perform noiseless simulations with up to 40 qubits and observe that out to\nthis system size, the runtime of QAOA with fixed parameters and a constant\nnumber of layers scales better than branch-and-bound solvers, which are the\nstate-of-the-art exact solvers for LABS. The combination of QAOA with quantum\nminimum-finding on an idealized quantum computer gives the best empirical\nscaling of any algorithm for the LABS problem. We demonstrate experimental\nprogress in compiling and executing QAOA for the LABS problem using an\nalgorithm-specific error detection scheme on Quantinuum trapped-ion processors.\nOur results provide evidence for the utility of QAOA as an algorithmic\ncomponent when executed on an idealized quantum computer.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:17:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Shaydulin","Ruslan",""],["Li","Changhao",""],["Chakrabarti","Shouvanik",""],["DeCross","Matthew",""],["Herman","Dylan",""],["Kumar","Niraj",""],["Larson","Jeffrey",""],["Lykov","Danylo",""],["Minssen","Pierre",""],["Sun","Yue",""],["Alexeev","Yuri",""],["Dreiling","Joan M.",""],["Gaebler","John P.",""],["Gatterman","Thomas M.",""],["Gerber","Justin A.",""],["Gilmore","Kevin",""],["Gresh","Dan",""],["Hewitt","Nathan",""],["Horst","Chandler V.",""],["Hu","Shaohan",""],["Johansen","Jacob",""],["Matheny","Mitchell",""],["Mengle","Tanner",""],["Mills","Michael",""],["Moses","Steven A.",""],["Neyenhuis","Brian",""],["Siegfried","Peter",""],["Yalovetzky","Romina",""],["Pistoia","Marco",""]]}
{"id":"2308.02343","submitter":"Fabian Kronowetter","authors":"F. Kronowetter, M. W\\\"urth, W. Utschick, R. Gross, K. G. Fedorov","title":"Imperfect photon detection in quantum illumination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In quantum illumination, various detection schemes have been proposed for\nharnessing remaining quantum correlations of the entanglement-based resource\nstate. To this date, the only successful implementation in the microwave domain\nrelies on a specific mixing operation of the respective return and idler modes,\nfollowed by single-photon counting in one of the two mixer outputs. We\ninvestigate the performance of this scheme for realistic detection parameters\nin terms of detection efficiency, dark count probability, and photon number\nresolution. Furthermore, we take into account the second mixer output and\ninvestigate the advantage of correlated photon counting (CPC) for a varying\nthermal background and optimum post-processing weighting in CPC. We find that\nthe requirements for photon number resolution in the two mixer outputs are\nhighly asymmetric due to different associated photon number expectation values.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:18:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kronowetter","F.",""],["W\u00fcrth","M.",""],["Utschick","W.",""],["Gross","R.",""],["Fedorov","K. G.",""]]}
{"id":"2308.02344","submitter":"Hoang-Son Tran","authors":"Subhro Ghosh, Soumendu Sundar Mukherjee, Hoang-Son Tran, Ujan\n  Gangopadhyay","title":"Learning Networks from Gaussian Graphical Models and Gaussian Free\n  Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST cs.LG stat.CO stat.ME stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the problem of estimating the structure of a weighted network\nfrom repeated measurements of a Gaussian Graphical Model (GGM) on the network.\nIn this vein, we consider GGMs whose covariance structures align with the\ngeometry of the weighted network on which they are based. Such GGMs have been\nof longstanding interest in statistical physics, and are referred to as the\nGaussian Free Field (GFF). In recent years, they have attracted considerable\ninterest in the machine learning and theoretical computer science. In this\nwork, we propose a novel estimator for the weighted network (equivalently, its\nLaplacian) from repeated measurements of a GFF on the network, based on the\nFourier analytic properties of the Gaussian distribution. In this pursuit, our\napproach exploits complex-valued statistics constructed from observed data,\nthat are of interest on their own right. We demonstrate the effectiveness of\nour estimator with concrete recovery guarantees and bounds on the required\nsample complexity. In particular, we show that the proposed statistic achieves\nthe parametric rate of estimation for fixed network size. In the setting of\nnetworks growing with sample size, our results show that for Erdos-Renyi random\ngraphs $G(d,p)$ above the connectivity threshold, we demonstrate that network\nrecovery takes place with high probability as soon as the sample size $n$\nsatisfies $n \\gg d^4 \\log d \\cdot p^{-2}$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:18:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ghosh","Subhro",""],["Mukherjee","Soumendu Sundar",""],["Tran","Hoang-Son",""],["Gangopadhyay","Ujan",""]]}
{"id":"2308.02345","submitter":"Dong Chen","authors":"Dong Chen, Kaixiang Zhang, Yongqiang Wang, Xunyuan Yin, Zhaojian Li","title":"Communication-Efficient Decentralized Multi-Agent Reinforcement Learning\n  for Cooperative Adaptive Cruise Control","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Connected and autonomous vehicles (CAVs) promise next-gen transportation\nsystems with enhanced safety, energy efficiency, and sustainability. One\ntypical control strategy for CAVs is the so-called cooperative adaptive cruise\ncontrol (CACC) where vehicles drive in platoons and cooperate to achieve safe\nand efficient transportation. In this study, we formulate CACC as a multi-agent\nreinforcement learning (MARL) problem. Diverging from existing MARL methods\nthat use centralized training and decentralized execution which require not\nonly a centralized communication mechanism but also dense inter-agent\ncommunication, we propose a fully-decentralized MARL framework for enhanced\nefficiency and scalability. In addition, a quantization-based communication\nscheme is proposed to reduce the communication overhead without significantly\ndegrading the control performance. This is achieved by employing randomized\nrounding numbers to quantize each piece of communicated information and only\ncommunicating non-zero components after quantization. Extensive experimentation\nin two distinct CACC settings reveals that the proposed MARL framework\nconsistently achieves superior performance over several contemporary benchmarks\nin terms of both communication efficiency and control efficacy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:19:36 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:19:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Dong",""],["Zhang","Kaixiang",""],["Wang","Yongqiang",""],["Yin","Xunyuan",""],["Li","Zhaojian",""]]}
{"id":"2308.02346","submitter":"Wenzhuo Liu","authors":"Wenzhuo Liu, Xinjian Wu, Fei Zhu, Mingming Yu, Chuang Wang, Cheng-Lin\n  Liu","title":"Class Incremental Learning with Self-Supervised Pre-Training and\n  Prototype Learning","comments":"This paper has been under review by a journal since 19-Apr-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Neural Network (DNN) has achieved great success on datasets of closed\nclass set. However, new classes, like new categories of social media topics,\nare continuously added to the real world, making it necessary to incrementally\nlearn. This is hard for DNN because it tends to focus on fitting to new classes\nwhile ignoring old classes, a phenomenon known as catastrophic forgetting.\nState-of-the-art methods rely on knowledge distillation and data replay\ntechniques but still have limitations. In this work, we analyze the causes of\ncatastrophic forgetting in class incremental learning, which owes to three\nfactors: representation drift, representation confusion, and classifier\ndistortion. Based on this view, we propose a two-stage learning framework with\na fixed encoder and an incrementally updated prototype classifier. The encoder\nis trained with self-supervised learning to generate a feature space with high\nintrinsic dimensionality, thus improving its transferability and generality.\nThe classifier incrementally learns new prototypes while retaining the\nprototypes of previously learned data, which is crucial in preserving the\ndecision boundary.Our method does not rely on preserved samples of old classes,\nis thus a non-exemplar based CIL method. Experiments on public datasets show\nthat our method can significantly outperform state-of-the-art exemplar-based\nmethods when they reserved 5 examplers per class, under the incremental setting\nof 10 phases, by 18.24% on CIFAR-100 and 9.37% on ImageNet100.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:20:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Wenzhuo",""],["Wu","Xinjian",""],["Zhu","Fei",""],["Yu","Mingming",""],["Wang","Chuang",""],["Liu","Cheng-Lin",""]]}
{"id":"2308.02347","submitter":"Hanrui Wu","authors":"Michael Ng and Hanrui Wu and Andy Yip","title":"Stability and Generalization of Hypergraph Collaborative Networks","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 have been shown to be very effective in utilizing\npairwise relationships across samples. Recently, there have been several\nsuccessful proposals to generalize graph neural networks to hypergraph neural\nnetworks to exploit more complex relationships. In particular, the hypergraph\ncollaborative networks yield superior results compared to other hypergraph\nneural networks for various semi-supervised learning tasks. The collaborative\nnetwork can provide high quality vertex embeddings and hyperedge embeddings\ntogether by formulating them as a joint optimization problem and by using their\nconsistency in reconstructing the given hypergraph. In this paper, we aim to\nestablish the algorithmic stability of the core layer of the collaborative\nnetwork and provide generalization guarantees. The analysis sheds light on the\ndesign of hypergraph filters in collaborative networks, for instance, how the\ndata and hypergraph filters should be scaled to achieve uniform stability of\nthe learning process. Some experimental results on real-world datasets are\npresented to illustrate the theory.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:21:02 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ng","Michael",""],["Wu","Hanrui",""],["Yip","Andy",""]]}
{"id":"2308.02348","submitter":"Jeffrey Doser","authors":"Jeffrey W. Doser, Andrew O. Finley, Sarah P. Saunders, Marc Kery,\n  Aaron S. Weed, Elise F. Zipkin","title":"Modeling complex species-environment relationships through\n  spatially-varying coefficient occupancy models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Occupancy models are frequently used by ecologists to quantify spatial\nvariation in species distributions while accounting for observational biases in\nthe collection of detection-nondetection data. However, the common assumption\nthat a single set of regression coefficients can adequately explain\nspecies-environment relationships is often unrealistic, especially across large\nspatial domains. Here we develop single-species (i.e., univariate) and\nmulti-species (i.e., multivariate) spatially-varying coefficient (SVC)\noccupancy models to account for spatially-varying species-environment\nrelationships. We employ Nearest Neighbor Gaussian Processes and Polya-Gamma\ndata augmentation in a hierarchical Bayesian framework to yield computationally\nefficient Gibbs samplers, which we implement in the spOccupancy R package. For\nmulti-species models, we use spatial factor dimension reduction to efficiently\nmodel datasets with large numbers of species (e.g., > 10). The hierarchical\nBayesian framework readily enables generation of posterior predictive maps of\nthe SVCs, with fully propagated uncertainty. We apply our SVC models to\nquantify spatial variability in the relationships between maximum breeding\nseason temperature and occurrence probability of 21 grassland bird species\nacross the U.S. Jointly modeling species generally outperformed single-species\nmodels, which all revealed substantial spatial variability in species\noccurrence relationships with maximum temperatures. Our models are particularly\nrelevant for quantifying species-environment relationships using\ndetection-nondetection data from large-scale monitoring programs, which are\nbecoming increasingly prevalent for answering macroscale ecological questions\nregarding wildlife responses to global change.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:21:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Doser","Jeffrey W.",""],["Finley","Andrew O.",""],["Saunders","Sarah P.",""],["Kery","Marc",""],["Weed","Aaron S.",""],["Zipkin","Elise F.",""]]}
{"id":"2308.02350","submitter":"Yisong Xiao","authors":"Yisong Xiao, Aishan Liu, Tianyuan Zhang, Haotong Qin, Jinyang Guo,\n  Xianglong Liu","title":"RobustMQ: Benchmarking Robustness of Quantized Models","comments":"15 pages, 7 figures","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":"  Quantization has emerged as an essential technique for deploying deep neural\nnetworks (DNNs) on devices with limited resources. However, quantized models\nexhibit vulnerabilities when exposed to various noises in real-world\napplications. Despite the importance of evaluating the impact of quantization\non robustness, existing research on this topic is limited and often disregards\nestablished principles of robustness evaluation, resulting in incomplete and\ninconclusive findings. To address this gap, we thoroughly evaluated the\nrobustness of quantized models against various noises (adversarial attacks,\nnatural corruptions, and systematic noises) on ImageNet. The comprehensive\nevaluation results empirically provide valuable insights into the robustness of\nquantized models in various scenarios, for example: (1) quantized models\nexhibit higher adversarial robustness than their floating-point counterparts,\nbut are more vulnerable to natural corruptions and systematic noises; (2) in\ngeneral, increasing the quantization bit-width results in a decrease in\nadversarial robustness, an increase in natural robustness, and an increase in\nsystematic robustness; (3) among corruption methods, \\textit{impulse noise} and\n\\textit{glass blur} are the most harmful to quantized models, while\n\\textit{brightness} has the least impact; (4) among systematic noises, the\n\\textit{nearest neighbor interpolation} has the highest impact, while bilinear\ninterpolation, cubic interpolation, and area interpolation are the three least\nharmful. Our research contributes to advancing the robust quantization of\nmodels and their deployment in real-world scenarios.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:37:12 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Xiao","Yisong",""],["Liu","Aishan",""],["Zhang","Tianyuan",""],["Qin","Haotong",""],["Guo","Jinyang",""],["Liu","Xianglong",""]]}
{"id":"2308.02351","submitter":"Connor Lane","authors":"Connor Lane, Gregory Kiar","title":"A Parameter-efficient Multi-subject Model for Predicting fMRI Activity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is the Algonauts 2023 submission report for team \"BlobGPT\". Our model\nconsists of a multi-subject linear encoding head attached to a pretrained trunk\nmodel. The multi-subject head consists of three components: (1) a shared\nmulti-layer feature projection, (2) shared plus subject-specific low-dimension\nlinear transformations, and (3) a shared PCA fMRI embedding. In this report, we\nexplain these components in more detail and present some experimental results.\nOur code is available at https://github.com/cmi-dair/algonauts23.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:39:05 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lane","Connor",""],["Kiar","Gregory",""]]}
{"id":"2308.02352","submitter":"Hong-Bo Sun Prof.","authors":"Zhen-Ze Li, Hua Fan, Lei Wang, Xu Zhang, Xin-Jing Zhao, Yan-Hao Yu,\n  Yi-Shi Xu, Yi Wang, Xiao-Jie Wang, Saulius Juodkazis, Qi-Dai Chen and Hong-Bo\n  Sun","title":"Super stealth dicing of transparent solids with nanometric precision","comments":"29 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Laser cutting of semiconductor wafers and transparent dielectrics has become\na dominant process in manufacturing industries, encompassing a wide range of\napplications from flat display panels to microelectronic chips. Limited by\nHeisenberg's uncertainty principle imposed on the beam width and its\nlongitudinal extend of laser focus, a trade-off must be made between cutting\naccuracy and aspect ratio in conventional laser processing, with accuracy\ntypically approaching a micron and the aspect ratio on the order of $10^2$.\nHerein, we propose a method to circumvent this limitation. It is based on the\nlaser modification induced by a back-scattering interference crawling\nmechanism, which creates a positive feedback for homogenizing longitudinal\nenergy deposition and lateral sub-wavelength light confinement during\nlaser-matter interaction. Consequently, cutting width on the scale of tens of\nnanometers and aspect ratio $\\sim 10^4$ were simultaneously achieved. We refer\nto this technique as ``super stealth dicing'', which is based on an analytical\nmodel and validated through numerical simulations, ensuring its broad\napplicability. It can be applied to various transparent functional solids, such\nas glass, laser crystal, ferroelectric, and semiconductor, and is elevating the\nprecision of future advanced laser dicing, patterning, and drilling into the\nnanometric era.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:39:13 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 13:58:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Zhen-Ze",""],["Fan","Hua",""],["Wang","Lei",""],["Zhang","Xu",""],["Zhao","Xin-Jing",""],["Yu","Yan-Hao",""],["Xu","Yi-Shi",""],["Wang","Yi",""],["Wang","Xiao-Jie",""],["Juodkazis","Saulius",""],["Chen","Qi-Dai",""],["Sun","Hong-Bo",""]]}
{"id":"2308.02353","submitter":"Bardh Prenkaj","authors":"Bardh Prenkaj, Mario Villaizan-Vallelado, Tobias Leemann, Gjergji\n  Kasneci","title":"Adapting to Change: Robust Counterfactual Explanations in Dynamic Data\n  Landscapes","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 introduce a novel semi-supervised Graph Counterfactual Explainer (GCE)\nmethodology, Dynamic GRAph Counterfactual Explainer (DyGRACE). It leverages\ninitial knowledge about the data distribution to search for valid\ncounterfactuals while avoiding using information from potentially outdated\ndecision functions in subsequent time steps. Employing two graph autoencoders\n(GAEs), DyGRACE learns the representation of each class in a binary\nclassification scenario. The GAEs minimise the reconstruction error between the\noriginal graph and its learned representation during training. The method\ninvolves (i) optimising a parametric density function (implemented as a\nlogistic regression function) to identify counterfactuals by maximising the\nfactual autoencoder's reconstruction error, (ii) minimising the counterfactual\nautoencoder's error, and (iii) maximising the similarity between the factual\nand counterfactual graphs. This semi-supervised approach is independent of an\nunderlying black-box oracle. A logistic regression model is trained on a set of\ngraph pairs to learn weights that aid in finding counterfactuals. At inference,\nfor each unseen graph, the logistic regressor identifies the best\ncounterfactual candidate using these learned weights, while the GAEs can be\niteratively updated to represent the continual adaptation of the learned graph\nrepresentation over iterations. DyGRACE is quite effective and can act as a\ndrift detector, identifying distributional drift based on differences in\nreconstruction errors between iterations. It avoids reliance on the oracle's\npredictions in successive iterations, thereby increasing the efficiency of\ncounterfactual discovery. DyGRACE, with its capacity for contrastive learning\nand drift detection, will offer new avenues for semi-supervised learning and\nexplanation generation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:41:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Prenkaj","Bardh",""],["Villaizan-Vallelado","Mario",""],["Leemann","Tobias",""],["Kasneci","Gjergji",""]]}
{"id":"2308.02354","submitter":"Yiqiu Zhao","authors":"Yiqiu Zhao, Haitao Hu, Yulu Huang, Hanqing Liu, Caishan Yan, Chang Xu,\n  Rui Zhang, Yifan Wang, and Qin Xu","title":"Elasticity-Controlled Jamming Criticality in Soft Composite Solids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.stat-mech physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Soft composite solids are made of dispersed inclusions within soft matrices.\nThey are ubiquitous in nature and form the basis of many biological tissues. In\nthe field of materials science, synthetic soft composites are promising\ncandidates for constructing various engineering devices due to their highly\nprogrammable features. However, when the volume fraction of inclusions\nincreases, predicting the mechanical properties of these materials poses a\nsignificant challenge for the classical theories in composite mechanics. The\ndifficulty arises from the inherently disordered, multi-scale interactions\nbetween the inclusions and matrix. To address this challenge, we conducted\nsystematic investigations on the mechanics of densely-filled soft elastomers\ncontaining stiff microspheres. We experimentally demonstrated how the\nstrain-stiffening response of the soft composites is governed by the critical\nscalings in the vicinity of a continuous phase transition, which depend on both\nthe elasticity of the elastomer matrix and the particles. The critical points\nsignify a shear-jamming transition of the included particles in the absence of\nmatrix elasticity. The proposed criticality framework quantitatively predicts\ndiverse mechanical responses observed in experiments across a wide range of\nmaterial parameters. The findings uncover a novel design paradigm of composite\nmechanics that relies on engineering the jamming-criticality of the embedded\ninclusions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:41:36 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhao","Yiqiu",""],["Hu","Haitao",""],["Huang","Yulu",""],["Liu","Hanqing",""],["Yan","Caishan",""],["Xu","Chang",""],["Zhang","Rui",""],["Wang","Yifan",""],["Xu","Qin",""]]}
{"id":"2308.02355","submitter":"Emrys Evans","authors":"Hwan-Hee Cho, Sebastian Gorgon, Giacomo Londi, Samuele Giannini,\n  Changsoon Cho, Pratyush Ghosh, Claire Tonnel\\'e, David Casanova, Yoann\n  Olivier, Feng Li, David Beljonne, Neil C. Greenham, Richard H. Friend, Emrys\n  W. Evans","title":"Efficient near-infrared organic light-emitting diodes with emission from\n  spin doublet excitons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The development of luminescent organic radicals has resulted in materials\nwith excellent optical properties for near-infrared (NIR) emission.\nApplications of light generation in this range span from bioimaging to\nsurveillance. Whilst the unpaired electron arrangements of radicals enable\nefficient radiative transitions within the doublet-spin manifold in organic\nlight-emitting diodes (OLEDs), their performance is limited by non-radiative\npathways introduced in electroluminescence. Here, we present a host:guest\ndesign for OLEDs that exploits energy transfer with demonstration of up to 9.6%\nexternal quantum efficiency (EQE) for 800 nm emission. The\ntris(2,4,6-trichlorophenyl)methyl-triphenylamine (TTM-TPA) radical guest is\nenergy-matched to the triplet state in a charge-transporting\nanthracene-derivative host. We show from optical spectroscopy and\nquantum-chemical modelling that reversible host-guest triplet-doublet energy\ntransfer allows efficient harvesting of host triplet excitons.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:42:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cho","Hwan-Hee",""],["Gorgon","Sebastian",""],["Londi","Giacomo",""],["Giannini","Samuele",""],["Cho","Changsoon",""],["Ghosh","Pratyush",""],["Tonnel\u00e9","Claire",""],["Casanova","David",""],["Olivier","Yoann",""],["Li","Feng",""],["Beljonne","David",""],["Greenham","Neil C.",""],["Friend","Richard H.",""],["Evans","Emrys W.",""]]}
{"id":"2308.02356","submitter":"Huan Zhong","authors":"Huan Zhong and Chen Wu","title":"T-UNet: Triplet UNet for Change Detection in High-Resolution Remote\n  Sensing Images","comments":"21 pages, 11 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Remote sensing image change detection aims to identify the differences\nbetween images acquired at different times in the same area. It is widely used\nin land management, environmental monitoring, disaster assessment and other\nfields. Currently, most change detection methods are based on Siamese network\nstructure or early fusion structure. Siamese structure focuses on extracting\nobject features at different times but lacks attention to change information,\nwhich leads to false alarms and missed detections. Early fusion (EF) structure\nfocuses on extracting features after the fusion of images of different phases\nbut ignores the significance of object features at different times for\ndetecting change details, making it difficult to accurately discern the edges\nof changed objects. To address these issues and obtain more accurate results,\nwe propose a novel network, Triplet UNet(T-UNet), based on a three-branch\nencoder, which is capable to simultaneously extract the object features and the\nchange features between the pre- and post-time-phase images through triplet\nencoder. To effectively interact and fuse the features extracted from the three\nbranches of triplet encoder, we propose a multi-branch spatial-spectral\ncross-attention module (MBSSCA). In the decoder stage, we introduce the channel\nattention mechanism (CAM) and spatial attention mechanism (SAM) to fully mine\nand integrate detailed textures information at the shallow layer and semantic\nlocalization information at the deep layer.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:44:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhong","Huan",""],["Wu","Chen",""]]}
{"id":"2308.02357","submitter":"Sanju Tiwari Dr","authors":"Nandana Mihindukulasooriya, Sanju Tiwari, Carlos F. Enguix, Kusum Lata","title":"Text2KGBench: A Benchmark for Ontology-Driven Knowledge Graph Generation\n  from Text","comments":"15 pages, 3 figures, 4 tables. Accepted at ISWC 2023 (Resources\n  Track)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent advances in large language models (LLM) and foundation models with\nemergent capabilities have been shown to improve the performance of many NLP\ntasks. LLMs and Knowledge Graphs (KG) can complement each other such that LLMs\ncan be used for KG construction or completion while existing KGs can be used\nfor different tasks such as making LLM outputs explainable or fact-checking in\nNeuro-Symbolic manner. In this paper, we present Text2KGBench, a benchmark to\nevaluate the capabilities of language models to generate KGs from natural\nlanguage text guided by an ontology. Given an input ontology and a set of\nsentences, the task is to extract facts from the text while complying with the\ngiven ontology (concepts, relations, domain/range constraints) and being\nfaithful to the input sentences. We provide two datasets (i) Wikidata-TekGen\nwith 10 ontologies and 13,474 sentences and (ii) DBpedia-WebNLG with 19\nontologies and 4,860 sentences. We define seven evaluation metrics to measure\nfact extraction performance, ontology conformance, and hallucinations by LLMs.\nFurthermore, we provide results for two baseline models, Vicuna-13B and\nAlpaca-LoRA-13B using automatic prompt generation from test cases. The baseline\nresults show that there is room for improvement using both Semantic Web and\nNatural Language Processing techniques.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:47:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mihindukulasooriya","Nandana",""],["Tiwari","Sanju",""],["Enguix","Carlos F.",""],["Lata","Kusum",""]]}
{"id":"2308.02358","submitter":"Faisal Haque Bappy","authors":"Faisal Haque Bappy, Tariqul Islam, Tarannum Shaila Zaman, Raiful\n  Hasan, Carlos Caicedo","title":"A Deep Dive into the Google Cluster Workload Traces: Analyzing the\n  Application Failure Characteristics and User Behaviors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale cloud data centers have gained popularity due to their high\navailability, rapid elasticity, scalability, and low cost. However, current\ndata centers continue to have high failure rates due to the lack of proper\nresource utilization and early failure detection. To maximize resource\nefficiency and reduce failure rates in large-scale cloud data centers, it is\ncrucial to understand the workload and failure characteristics. In this paper,\nwe perform a deep analysis of the 2019 Google Cluster Trace Dataset, which\ncontains 2.4TiB of workload traces from eight different clusters around the\nworld. We explore the characteristics of failed and killed jobs in Google's\nproduction cloud and attempt to correlate them with key attributes such as\nresource usage, job priority, scheduling class, job duration, and the number of\ntask resubmissions. Our analysis reveals several important characteristics of\nfailed jobs that contribute to job failure and hence, could be used for\ndeveloping an early failure prediction system. Also, we present a novel usage\nanalysis to identify heterogeneity in jobs and tasks submitted by users. We are\nable to identify specific users who control more than half of all collection\nevents on a single cluster. We contend that these characteristics could be\nuseful in developing an early job failure prediction system that could be\nutilized for dynamic rescheduling of the job scheduler and thus improving\nresource utilization in large-scale cloud data centers while reducing failure\nrates.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:47:48 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bappy","Faisal Haque",""],["Islam","Tariqul",""],["Zaman","Tarannum Shaila",""],["Hasan","Raiful",""],["Caicedo","Carlos",""]]}
{"id":"2308.02359","submitter":"Yuanpu Xiong","authors":"Bo-Yong Chen, Yuanpu Xiong, Liyou Zhang","title":"Equality between the Bergman metric and Carath\\'{e}odory metric","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an equality between the Bergman metric and Carath\\'{e}odry metric.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:52:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chen","Bo-Yong",""],["Xiong","Yuanpu",""],["Zhang","Liyou",""]]}
{"id":"2308.02360","submitter":"Sishun Liu","authors":"Sishun Liu, Ke Deng, Xiuzhen Zhang, Yongli Ren","title":"Intensity-free Integral-based Learning of Marked Temporal Point\n  Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In the marked temporal point processes (MTPP), a core problem is to\nparameterize the conditional joint PDF (probability distribution function)\n$p^*(m,t)$ for inter-event time $t$ and mark $m$, conditioned on the history.\nThe majority of existing studies predefine intensity functions. Their utility\nis challenged by specifying the intensity function's proper form, which is\ncritical to balance expressiveness and processing efficiency. Recently, there\nare studies moving away from predefining the intensity function -- one models\n$p^*(t)$ and $p^*(m)$ separately, while the other focuses on temporal point\nprocesses (TPPs), which do not consider marks. This study aims to develop\nhigh-fidelity $p^*(m,t)$ for discrete events where the event marks are either\ncategorical or numeric in a multi-dimensional continuous space. We propose a\nsolution framework IFIB (\\underline{I}ntensity-\\underline{f}ree\n\\underline{I}ntegral-\\underline{b}ased process) that models conditional joint\nPDF $p^*(m,t)$ directly without intensity functions. It remarkably simplifies\nthe process to compel the essential mathematical restrictions. We show the\ndesired properties of IFIB and the superior experimental results of IFIB on\nreal-world and synthetic datasets. The code is available at\n\\url{https://github.com/StepinSilence/IFIB}.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:52:22 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 04:32:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Sishun",""],["Deng","Ke",""],["Zhang","Xiuzhen",""],["Ren","Yongli",""]]}
{"id":"2308.02361","submitter":"Panos Christakoglou","authors":"Panos Christakoglou","title":"Probing the magnetic field strength dependence of the Chiral Magnetic\n  Effect","comments":"submitted to EPJC","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The article presents a study aimed at probing the dependence of the Chiral\nMagnetic Effect (CME) on the magnetic field strength using the Anomalous\nViscous Fluid Dynamics (AVFD) model in Pb--Pb at LHC energies. The results\ndemonstrate the quadratic dependence of the correlators used for the study of\nthe CME in heavy ion collisions on the number of spectators, a proxy of the\nmagnitude of the magnetic field. The article also presents the extension of\nthis approach to a two dimensional space, formed by both the aforementioned\nproxy of the magnetic field strength but also a proxy of the final state\nellipticity, a key ingredient of the background in these measurements, for each\ncentrality interval. This provides an exciting possibility to experiments to\nisolate the background contributions from the potential CME signal.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:52:36 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Christakoglou","Panos",""]]}
{"id":"2308.02363","submitter":"Fang-Cheng Yeh","authors":"Fang-Cheng Yeh","title":"Brain MRI Segmentation using Template-Based Training and Visual\n  Perception Augmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning models usually require sufficient training data to achieve high\naccuracy, but obtaining labeled data can be time-consuming and labor-intensive.\nHere we introduce a template-based training method to train a 3D U-Net model\nfrom scratch using only one population-averaged brain MRI template and its\nassociated segmentation label. The process incorporated visual perception\naugmentation to enhance the model's robustness in handling diverse image inputs\nand mitigating overfitting. Leveraging this approach, we trained 3D U-Net\nmodels for mouse, rat, marmoset, rhesus, and human brain MRI to achieve\nsegmentation tasks such as skull-stripping, brain segmentation, and tissue\nprobability mapping. This tool effectively addresses the limited availability\nof training data and holds significant potential for expanding deep learning\napplications in image analysis, providing researchers with a unified solution\nto train deep neural networks with only one image sample.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:53:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yeh","Fang-Cheng",""]]}
{"id":"2308.02364","submitter":"Jungjun Choi","authors":"Jungjun Choi, Ming Yuan","title":"Matrix Completion When Missing Is Not at Random and Its Applications in\n  Causal Panel Data Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper develops an inferential framework for matrix completion when\nmissing is not at random and without the requirement of strong signals. Our\ndevelopment is based on the observation that if the number of missing entries\nis small enough compared to the panel size, then they can be estimated well\neven when missing is not at random. Taking advantage of this fact, we divide\nthe missing entries into smaller groups and estimate each group via nuclear\nnorm regularization. In addition, we show that with appropriate debiasing, our\nproposed estimate is asymptotically normal even for fairly weak signals. Our\nwork is motivated by recent research on the Tick Size Pilot Program, an\nexperiment conducted by the Security and Exchange Commission (SEC) to evaluate\nthe impact of widening the tick size on the market quality of stocks from 2016\nto 2018. While previous studies were based on traditional regression or\ndifference-in-difference methods by assuming that the treatment effect is\ninvariant with respect to time and unit, our analyses suggest significant\nheterogeneity across units and intriguing dynamics over time during the pilot\nprogram.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:54:29 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Choi","Jungjun",""],["Yuan","Ming",""]]}
{"id":"2308.02365","submitter":"Markus Wiesinger","authors":"Markus Wiesinger, Florian Stuhlmann, Matthew A. Bohman, Peter Micke,\n  Christian Will, H\\\"useyin Yildiz, Fatma Abbass, Bela P. Arndt, Jack A.\n  Devlin, Stefan Erlewein, Markus Fleck, Julia I. J\\\"ager, Barbara M. Latacz,\n  Daniel Schweitzer, Gilbertas Umbrazunas, Elise Wursten, Klaus Blaum, Yasuyuki\n  Matsuda, Andreas Mooser, Wolfgang Quint, Anna Soter, Jochen Walz, Christian\n  Smorra and Stefan Ulmer","title":"Trap-integrated fluorescence detection based on silicon photomultipliers\n  in a cryogenic Penning trap","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a fluorescence-detection system for laser-cooled 9Be+ ions based\non silicon photomultipliers (SiPM) operated at 4 K and integrated into our\ncryogenic 1.9 T multi-Penning-trap system. Our approach enables fluorescence\ndetection in a hermetically-sealed cryogenic Penning-trap chamber with limited\noptical access, where state-of-the-art detection using a telescope and\nphotomultipliers at room temperature would be extremely difficult. We\ncharacterize the properties of the SiPM in a cryocooler at 4 K, where we\nmeasure a dark count rate below 1/s and a detection efficiency of 2.5(3) %. We\nfurther discuss the design of our cryogenic fluorescence-detection trap, and\nanalyze the performance of our detection system by fluorescence spectroscopy of\n9Be+ ion clouds during several runs of our experiment.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:54:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wiesinger","Markus",""],["Stuhlmann","Florian",""],["Bohman","Matthew A.",""],["Micke","Peter",""],["Will","Christian",""],["Yildiz","H\u00fcseyin",""],["Abbass","Fatma",""],["Arndt","Bela P.",""],["Devlin","Jack A.",""],["Erlewein","Stefan",""],["Fleck","Markus",""],["J\u00e4ger","Julia I.",""],["Latacz","Barbara M.",""],["Schweitzer","Daniel",""],["Umbrazunas","Gilbertas",""],["Wursten","Elise",""],["Blaum","Klaus",""],["Matsuda","Yasuyuki",""],["Mooser","Andreas",""],["Quint","Wolfgang",""],["Soter","Anna",""],["Walz","Jochen",""],["Smorra","Christian",""],["Ulmer","Stefan",""]]}
{"id":"2308.02366","submitter":"Enci Wang","authors":"Enci Wang, Simon J. Lilly","title":"The Formation of Star-forming Disks in the TNG50 Simulation","comments":"24 pages, 14 figures, accepted in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the disk formation process in the TNG50 simulation, examining\nthe profiles of SFR surface density ($\\Sigma_{\\rm SFR}$), gas inflow and\noutflow, and the evolution of the angular momentum of inflowing gas particles.\nThe TNG50 galaxies tend to have larger star-forming disks, and also show larger\ndeviations from exponential profiles in $\\Sigma_{\\rm SFR}$ when compared to\nreal galaxies in the MaNGA (Mapping Nearby Galaxies at APO) survey. The stellar\nsurface density of TNG50 galaxies show good exponential profiles, which is\nfound to be the result of strong radial migration of stars over time. However,\nthis strong radial migration of stars in the simulation produces flatter age\nprofiles in TNG50 disks compared to observed galaxies. The star formation in\nthe simulated galaxies is sustained by a net gas inflow and this gas inflow is\nthe primary driver for the cosmic evolution of star formation, as expected from\nsimple gas-regulator models of galaxies. There is no evidence for any\nsignificant loss of angular momentum for the gas particles after they are\naccreted on to the galaxy, which may account for the large disk sizes in the\nTNG50 simulation. Adding viscous processes to the disks, such as the magnetic\nstresses from magneto-rotational instability proposed by Wang & Lilly 2022,\nwill likely reduce the sizes of the simulated disks and the tension with the\nsizes of real galaxies, and may produce more realistic exponential profiles.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:57:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Enci",""],["Lilly","Simon J.",""]]}
{"id":"2308.02367","submitter":"Fran\\c{c}ois Monard","authors":"Fran\\c{c}ois Monard","title":"Non-standard Sobolev scales and the mapping properties of the X-ray\n  transform on manifolds with strictly convex boundary","comments":"42 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article surveys recent results aiming at obtaining refined mapping\nestimates for the X-ray transform on a Riemannian manifold with boundary, which\nleverage the condition that the boundary be strictly geodesically convex. These\nquestions are motivated by classical inverse problems questions (e.g. range\ncharacterization, stability estimates, mapping properties on Hilbert scales),\nand more recently by uncertainty quantification and operator learning\nquestions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:59:39 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Monard","Fran\u00e7ois",""]]}
{"id":"2308.02368","submitter":"Yael Naze","authors":"Yael Naze, Nikolay Britavskiy, Gregor Rauw (ULiege), Jonathan\n  Labadie-Bartz (Obs. Paris), S. Simon-Diaz (IAC+Univ. La Laguna)","title":"Extreme mass ratios and fast rotation in three massive binaries","comments":"accepted for publication by MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2280","report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The origin of rapid rotation in massive stars remains debated, although\nbinary interactions are now often advocated as a cause. However, the broad and\nshallow lines in the spectra of fast rotators make direct detection of binarity\ndifficult. In this paper, we report on the discovery and analysis of\nmultiplicity for three fast-rotating massive stars: HD25631 (B3V), HD191495\n(B0V), and HD46485 (O7V). They display strikingly similar TESS light curves,\nwith two narrow eclipses superimposed on a sinusoidal variation due to\nreflection effects. We complement these photometric data by spectroscopy from\nvarious instruments (X-Shooter, Espadons, FUSE...), to further constrain the\nnature of these systems. The detailed analyses of these data demonstrates that\nthe companions of the massive OB stars have low masses (~1Msol) with rather\nlarge radii (2-4 Rsol) and low temperatures (<15 kK). These companions display\nno UV signature, which would exclude a hot subdwarf nature, but disentangling\nof the large set of X-Shooter spectra of HD25631 revealed the typical signature\nof chromospheric activity in the companion's spectrum. In addition, despite the\nshort orbital periods (P=3-7d), the fast-rotating OB-stars still display\nnon-synchronized rotation and all systems appear young (<20Myr). This suggests\nthat, as in a few other cases, these massive stars are paired in those systems\nwith non-degenerate, low-mass PMS companions, implying that fast rotation would\nnot be a consequence of a past binary interactions in their case.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:06:39 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 08:49:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Naze","Yael","","ULiege"],["Britavskiy","Nikolay","","ULiege"],["Rauw","Gregor","","ULiege"],["Labadie-Bartz","Jonathan","","Obs. Paris"],["Simon-Diaz","S.","","IAC+Univ. La Laguna"]]}
{"id":"2308.02369","submitter":"Diqun Yan","authors":"JiaCheng Deng, Li Dong, Jiahao Chen, Diqun Yan, Rangding Wang, Dengpan\n  Ye, Lingchen Zhao, and Jinyu Tian","title":"Universal Defensive Underpainting Patch: Making Your Text Invisible to\n  Optical Character Recognition","comments":null,"journal-ref":null,"doi":"10.1145/3581783.3613768","report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical Character Recognition (OCR) enables automatic text extraction from\nscanned or digitized text images, but it also makes it easy to pirate valuable\nor sensitive text from these images. Previous methods to prevent OCR piracy by\ndistorting characters in text images are impractical in real-world scenarios,\nas pirates can capture arbitrary portions of the text images, rendering the\ndefenses ineffective. In this work, we propose a novel and effective defense\nmechanism termed the Universal Defensive Underpainting Patch (UDUP) that\nmodifies the underpainting of text images instead of the characters. UDUP is\ncreated through an iterative optimization process to craft a small, fixed-size\ndefensive patch that can generate non-overlapping underpainting for text images\nof any size. Experimental results show that UDUP effectively defends against\nunauthorized OCR under the setting of any screenshot range or complex image\nbackground. It is agnostic to the content, size, colors, and languages of\ncharacters, and is robust to typical image operations such as scaling and\ncompressing. In addition, the transferability of UDUP is demonstrated by\nevading several off-the-shelf OCRs. The code is available at\nhttps://github.com/QRICKDD/UDUP.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:07:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Deng","JiaCheng",""],["Dong","Li",""],["Chen","Jiahao",""],["Yan","Diqun",""],["Wang","Rangding",""],["Ye","Dengpan",""],["Zhao","Lingchen",""],["Tian","Jinyu",""]]}
{"id":"2308.02370","submitter":"Juliette Ugirumurera","authors":"Juliette Ugirumurera, Joseph Severino, Erik A. Bensen, Qichao Wang,\n  and Jane Macfarlane","title":"A Machine Learning Method for Predicting Traffic Signal Timing from\n  Probe Vehicle Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traffic signals play an important role in transportation by enabling traffic\nflow management, and ensuring safety at intersections. In addition, knowing the\ntraffic signal phase and timing data can allow optimal vehicle routing for time\nand energy efficiency, eco-driving, and the accurate simulation of signalized\nroad networks. In this paper, we present a machine learning (ML) method for\nestimating traffic signal timing information from vehicle probe data. To the\nauthors best knowledge, very few works have presented ML techniques for\ndetermining traffic signal timing parameters from vehicle probe data. In this\nwork, we develop an Extreme Gradient Boosting (XGBoost) model to estimate\nsignal cycle lengths and a neural network model to determine the corresponding\nred times per phase from probe data. The green times are then be derived from\nthe cycle length and red times. Our results show an error of less than 0.56 sec\nfor cycle length, and red times predictions within 7.2 sec error on average.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:10:07 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ugirumurera","Juliette",""],["Severino","Joseph",""],["Bensen","Erik A.",""],["Wang","Qichao",""],["Macfarlane","Jane",""]]}
{"id":"2308.02371","submitter":"Xiaogang Liu","authors":"Jing Wang, Ligong Wang, Xiaogang Liu","title":"Fractional revival on semi-Cayley graphs over abelian groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the existence of fractional revival on\nsemi-Cayley graphs over finite abelian groups. We give some necessary and\nsufficient conditions for semi-Cayley graphs over finite abelian groups\nadmitting fractional revival. We also show that integrality is necessary for\nsome semi-Cayley graphs admitting fractional revival. Moreover, we characterize\nthe minimum time when semi-Cayley graphs admit fractional revival. As\napplications, we give examples of certain Cayley graphs over the generalized\ndihedral groups and generalized dicyclic groups admitting fractional revival.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:10:09 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Jing",""],["Wang","Ligong",""],["Liu","Xiaogang",""]]}
{"id":"2308.02372","submitter":"Maximilian \\\"Unzelmann","authors":"B. Geldiyev, M. \\\"Unzelmann, P. Eck, T. Ki{\\ss}linger, J. Schusser, T.\n  Figgemeier, P. Kagerer, N. Tezak, M. Krivenkov, A. Varykhalov, A. Fedorov, L.\n  Nicola\\\"i, J. Min\\'ar, K. Miyamoto, T. Okuda, K. Shimada, D. Di Sante, G.\n  Sangiovanni, L. Hammer, M. A. Schneider, H. Bentmann, and F. Reinert","title":"Strongly Anisotropic Spin and Orbital Rashba Effect at a Tellurium -\n  Noble Metal Interface","comments":"7 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":"  We study the interplay of lattice, spin and orbital degrees of freedom in a\ntwo-dimensional model system: a flat square lattice of Te atoms on a Au(100)\nsurface. The atomic structure of the Te monolayer is determined by scanning\ntunneling microscopy (STM) and quantitative low-energy electron diffraction\n(LEED-IV). Using spin- and angle-resolved photoelectron spectroscopy (ARPES)\nand density functional theory (DFT), we observe a Te-Au interface state with\nhighly anisotropic Rashba-type spin-orbit splitting at the X point of the\nBrillouin zone. Based on a profound symmetry and tight-binding analysis, we\nshow how in-plane square lattice symmetry and broken inversion symmetry at the\nTe-Au interface together enforce a remarkably anisotropic orbital Rashba effect\nwhich strongly modulates the spin splitting.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:13:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Geldiyev","B.",""],["\u00dcnzelmann","M.",""],["Eck","P.",""],["Ki\u00dflinger","T.",""],["Schusser","J.",""],["Figgemeier","T.",""],["Kagerer","P.",""],["Tezak","N.",""],["Krivenkov","M.",""],["Varykhalov","A.",""],["Fedorov","A.",""],["Nicola\u00ef","L.",""],["Min\u00e1r","J.",""],["Miyamoto","K.",""],["Okuda","T.",""],["Shimada","K.",""],["Di Sante","D.",""],["Sangiovanni","G.",""],["Hammer","L.",""],["Schneider","M. A.",""],["Bentmann","H.",""],["Reinert","F.",""]]}
{"id":"2308.02373","submitter":"Didier Pilod","authors":"Felipe Linares, Argenis Mendez and Didier Pilod","title":"Well-posedness for the extended Schr\\\"odinger-Benjamin-Ono system","comments":"22 pages, to appear in Vietnam Journal of Mathematics","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work we prove that the initial value problem associated to the\nSchr\\\"odinger-Benjamin-Ono type system \\begin{equation*} \\left\\{\n\\begin{array}{ll}\n  \\mathrm{i}\\partial_{t}u+ \\partial_{x}^{2} u= uv+ \\beta u|u|^{2},\n  \\partial_{t}v-\\mathcal{H}_{x}\\partial_{x}^{2}v+ \\rho\nv\\partial_{x}v=\\partial_{x}\\left(|u|^{2}\\right)\n  u(x,0)=u_{0}(x), \\quad v(x,0)=v_{0}(x),\n  \\end{array} \\right. \\end{equation*} with $\\beta,\\rho \\in \\mathbb{R}$ is\nlocally well-posed for initial data $(u_{0},v_{0})\\in\nH^{s+\\frac12}(\\mathbb{R})\\times H^{s}(\\mathbb{R})$ for $s>\\frac54$.\n  Our method of proof relies on energy methods and compactness arguments.\nHowever, due to the lack of symmetry of the nonlinearity, the usual energy has\nto be modified to cancel out some bad terms appearing in the estimates.\nFinally, in order to lower the regularity below the Sobolev threshold\n$s=\\frac32$, we employ a refined Strichartz estimate introduced in the\nBenjamin-Ono setting by Koch and Tzvetkov, and further developed by Kenig and\nKoenig.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:13:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Linares","Felipe",""],["Mendez","Argenis",""],["Pilod","Didier",""]]}
{"id":"2308.02374","submitter":"Ann Mary Toms","authors":"Ann Mary Toms, Xingpeng Li, and Kaushik Rajashekara","title":"Optimal Sizing of On-site Renewable Resources for Offshore Microgrids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The offshore oil and natural gas platforms, mostly powered by diesel or gas\ngenerators, consume approximately 16TWh of electricity worldwide per year,\nwhich emits large amount of CO2. To limit their contribution to climate change,\na proposed solution is to replace the traditional fossil fuel based energy\nresources with offshore clean energy. One of the main challenges in designing\nsuch a system is to ensure that energy demand is met while minimizing cost and\nreducing environmental impact. To address this challenge, several strategies\nincluding microgrid systems consisting of offshore wind turbines, wave energy\nconverters, tidal energy converters, floating photovoltaic systems and battery\nenergy storage systems are being proposed. In this paper, cost optimization for\nsizing these renewable energy sources is investigated. A cost optimization\nrenewable sizing (CORS) model is proposed to optimize the sizes of the\ngeneration and storage resources. The proposed CORS model considers the\nvariability of the power outputs of various renewable energy sources and load,\nas well as the cost of different generation technologies and the energy storage\nsystem. Simulations conducted on three test systems show the proposed resource\nsizing method significantly reduces the total lifetime cost of energy while\nmaintaining a high level of reliability and sustainability.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:14:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Toms","Ann Mary",""],["Li","Xingpeng",""],["Rajashekara","Kaushik",""]]}
{"id":"2308.02375","submitter":"Polina Dyadina","authors":"P.I. Dyadina, N.A. Avdeev","title":"Thin accretion disk signatures in hybrid metric-Palatini f(R)-gravity","comments":"27 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present work, accretion onto a spherically symmetric black hole in the\nhybrid metric-Palatini f(R)-gravity is considered. The Novikov-Thorne model for\na relativistic thin accretion disk is used. The energy flux, temperature\ndistribution, emission spectrum and energy conversion efficiency of accretion\ndisks around such black holes are numerically calculated. A comparison with the\nresults for a Schwarzschild black hole is made and conclusions about the\nviability of the model are drawn. As a result, it is obtained that the\naccretion disks around black holes in hybrid metric-Palatini f(R)-gravity are\ncolder and less luminous than in general relativity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:15:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dyadina","P. I.",""],["Avdeev","N. A.",""]]}
{"id":"2308.02376","submitter":"V\\'ictor Zapatero","authors":"V\\'ictor Zapatero and Marcos Curty","title":"Finite-key security of passive quantum key distribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The passive approach to quantum key distribution (QKD) consists of\neliminating all optical modulators and random number generators from QKD\nsystems, in so reaching an enhanced simplicity, immunity to modulator side\nchannels, and potentially higher repetition rates. In this work, we provide\nfinite-key security bounds for a fully passive decoy-state BB84 protocol,\nconsidering a passive QKD source recently presented. With our analysis, the\nattainable secret key rate is comparable to that of the perfect parameter\nestimation limit, in fact differing from the key rate of the active approach by\nless than one order of magnitude. This demonstrates the practicality of fully\npassive QKD solutions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:18:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zapatero","V\u00edctor",""],["Curty","Marcos",""]]}
{"id":"2308.02377","submitter":"Amelia Hassoun","authors":"Amelia Hassoun, Gabrielle Borenstein, Beth Goldberg, Jacob McAuliffe,\n  Katy Osborn","title":"Sowing 'Seeds of Doubt': Cottage Industries of Election and Medical\n  Misinformation in Brazil and the United States","comments":"30 pages, 13 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We conducted ethnographic research with 31 misinformation creators and\nconsumers in Brazil and the US before, during, and after a major election to\nunderstand the consumption and production of election and medical\nmisinformation. This study contributes to research on misinformation ecosystems\nby focusing on poorly understood small players, or \"micro-influencers\", who\ncreate misinformation in peer-to-peer networks. We detail four key tactics that\nmicro-influencers use. First, they typically disseminate misleading \"gray area\"\ncontent rather than falsifiable claims, using subtle aesthetic and rhetorical\ntactics to evade moderation. Second, they post in small, closed groups where\nmembers feel safe and predisposed to trust content. Third, they explicitly\ntarget misinformation consumers' emotional and social needs. Finally, they post\na high volume of short, repetitive content to plant seeds of doubt and build\ntrust in influencers as unofficial experts. We discuss the implications these\nmicro-influencers have for misinformation interventions and platforms' efforts\nto moderate misinformation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:18:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hassoun","Amelia",""],["Borenstein","Gabrielle",""],["Goldberg","Beth",""],["McAuliffe","Jacob",""],["Osborn","Katy",""]]}
{"id":"2308.02378","submitter":"Zsolt Langi Dr.","authors":"Bushra Basit and Zsolt L\\'angi","title":"On a Dowker-type problem for convex disks with almost constant curvature","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944)\nstates that for any plane convex body $K$, the areas of the maximum (resp.\nminimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a\nconcave (resp. convex) sequence. It is known that this theorem remains true if\nwe replace area by perimeter, or convex $n$-gons by disk-$n$-gons, obtained as\nthe intersection of $n$ closed Euclidean unit disks. It has been proved\nrecently that if $C$ is the unit disk of a normed plane, then the same\nproperties hold for the area of $C$-$n$-gons circumscribed about a $C$-convex\ndisk $K$ and for the perimeters of $C$-$n$-gons inscribed or circumscribed\nabout a $C$-convex disk $K$, but for a typical origin-symmetric convex disk $C$\nwith respect to Hausdorff distance, there is a $C$-convex disk $K$ such that\nthe sequence of the areas of the maximum area $C$-$n$-gons inscribed in $K$ is\nnot concave. The aim of this paper is to investigate this question if we\nreplace the topology induced by Hausdorff distance with a topology induced by\nthe surface area measure of the boundary of $C$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:22:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Basit","Bushra",""],["L\u00e1ngi","Zsolt",""]]}
{"id":"2308.02379","submitter":"Michael Dettweiler","authors":"Meirav Amram, Michael Dettweiler and Stefan Reiter","title":"Monodromy of the Radon transform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We algorithmically determine the monodromy of the local system on the smooth\npart of the Radon transformation of a generic simple perverse sheaf on the\nprojective plane.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:23:17 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Amram","Meirav",""],["Dettweiler","Michael",""],["Reiter","Stefan",""]]}
{"id":"2308.02380","submitter":"Shashaank Khanna","authors":"Shashaank Khanna, Marina Maciel Ansanelli, Matthew F. Pusey, and Elie\n  Wolfe","title":"Classifying Causal Structures: Ascertaining when Classical Correlations\n  are Constrained by Inequalities","comments":"37+12 pages, 13 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.ST stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The classical causal relations between a set of variables, some observed and\nsome latent, can induce both equality constraints (typically conditional\nindependences) as well as inequality constraints (Instrumental and Bell\ninequalities being prototypical examples) on their compatible distribution over\nthe observed variables. Enumerating a causal structure's implied inequality\nconstraints is generally far more difficult than enumerating its equalities.\nFurthermore, only inequality constraints ever admit violation by quantum\ncorrelations. For both those reasons, it is important to classify causal\nscenarios into those which impose inequality constraints versus those which do\nnot. Here we develop methods for detecting such scenarios by appealing to\nd-separation, e-separation, and incompatible supports. Many (perhaps all?)\nscenarios with exclusively equality constraints can be detected via a condition\narticulated by Henson, Lal and Pusey (HLP). Considering all scenarios with up\nto 4 observed variables, which number in the thousands, we are able to resolve\nall but three causal scenarios, providing evidence that the HLP condition is,\nin fact, exhaustive.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:23:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Khanna","Shashaank",""],["Ansanelli","Marina Maciel",""],["Pusey","Matthew F.",""],["Wolfe","Elie",""]]}
{"id":"2308.02381","submitter":"Sai Vinjanampathy","authors":"Abhisek Panda, Felix C. Binder and Sai Vinjanampathy","title":"Non-Ideal Measurement Heat Engines","comments":"6 pages, 2 figures, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss the role of non-ideal measurements within the context of\nmeasurement engines by contrasting examples of measurement engines which have\nthe same work output but with varying amounts of entanglement. Accounting for\nthe cost of resetting, correlating the engine to a pointer state and also the\ncost of cooling the pointer state, we show that for a given work output,\nthermally correlated engines can outperform corresponding entanglement engines.\nWe also show that the optimal efficiency of the thermally correlated\nmeasurement engine is achieved with a higher temperature pointer than the\npointer temperature of the optimal entanglement engine.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:24:19 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Panda","Abhisek",""],["Binder","Felix C.",""],["Vinjanampathy","Sai",""]]}
{"id":"2308.02382","submitter":"Alberto Archetti","authors":"Alberto Archetti, Francesca Ieva, Matteo Matteucci","title":"Scaling Survival Analysis in Healthcare with Federated Survival Forests:\n  A Comparative Study on Heart Failure and Breast Cancer Genomics","comments":null,"journal-ref":null,"doi":"10.1016/j.future.2023.07.036","report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Survival analysis is a fundamental tool in medicine, modeling the time until\nan event of interest occurs in a population. However, in real-world\napplications, survival data are often incomplete, censored, distributed, and\nconfidential, especially in healthcare settings where privacy is critical. The\nscarcity of data can severely limit the scalability of survival models to\ndistributed applications that rely on large data pools. Federated learning is a\npromising technique that enables machine learning models to be trained on\nmultiple datasets without compromising user privacy, making it particularly\nwell-suited for addressing the challenges of survival data and large-scale\nsurvival applications. Despite significant developments in federated learning\nfor classification and regression, many directions remain unexplored in the\ncontext of survival analysis. In this work, we propose an extension of the\nFederated Survival Forest algorithm, called FedSurF++. This federated ensemble\nmethod constructs random survival forests in heterogeneous federations.\nSpecifically, we investigate several new tree sampling methods from client\nforests and compare the results with state-of-the-art survival models based on\nneural networks. The key advantage of FedSurF++ is its ability to achieve\ncomparable performance to existing methods while requiring only a single\ncommunication round to complete. The extensive empirical investigation results\nin a significant improvement from the algorithmic and privacy preservation\nperspectives, making the original FedSurF algorithm more efficient, robust, and\nprivate. We also present results on two real-world datasets demonstrating the\nsuccess of FedSurF++ in real-world healthcare studies. Our results underscore\nthe potential of FedSurF++ to improve the scalability and effectiveness of\nsurvival analysis in distributed settings while preserving user privacy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:25:56 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Archetti","Alberto",""],["Ieva","Francesca",""],["Matteucci","Matteo",""]]}
{"id":"2308.02383","submitter":"Christian Leibel","authors":"Christian Leibel and Lutz Bornmann","title":"What do we know about the disruption indicator in scientometrics? An\n  overview of the literature","comments":"48 pages, 12 tables, 10 figures. Submitted to \"Scientometrics\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this paper is to provide a review of the literature on the\noriginal disruption indicator (DI1) and its variants in scientometrics. The DI1\nhas received much media attention and prompted a public debate about science\npolicy implications, since a study published in Nature found that papers in all\ndisciplines and patents are becoming less disruptive over time. This review\nexplains in the first part the DI1 and its variants in detail by examining\ntheir technical and theoretical properties. The remaining parts of the review\nare devoted to studies that examine the validity and the limitations of the\nindicators. Particular focus is placed on (1) the time-sensitivity of\ndisruption scores, (2) the convergent validity of disruption scores with expert\njudgments, and (3) the comparative performance of the DI1 and its variants. The\nreview shows that, while the literature on convergent validity is not entirely\nconclusive, it is clear that some modified indicator variants, in particular\nDI5, show higher degrees of convergent validity than DI1. Limitations of the\nDI1 and its variants are summarized, and best practice guidelines are provided.\nThe review encourages users of the indicator to inform about the variety of DI1\nvariants and to apply the most appropriate variant. More research on the\nconvergent validity of the DI1 and its variants as well as on the\ntime-sensitivity of disruption scores is needed before the indicators can be\nused in the research evaluation practice.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:26:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Leibel","Christian",""],["Bornmann","Lutz",""]]}
{"id":"2308.02384","submitter":"Samadrita Mukherjee","authors":"Manimala Chakraborti, Dipankar Das, Nivedita Ghosh, Samadrita\n  Mukherjee, Ipsita Saha","title":"New physics implications of VBF searches exemplified through the\n  Georgi-Machacek model","comments":"17 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":"  LHC searches for nonstandard scalars in vector boson fusion (VBF) production\nprocesses can be particularly efficient in probing scalars belonging to triplet\nor higher multiplet representations of the Standard Model $SU(2)_L$ gauge\ngroup. They can be especially relevant for models where the additional scalars\ndo not have any tree-level couplings to the Standard Model fermions, rendering\nVBF as their primary production mode at the LHC. In this work, we employ the\nlatest LHC data from VBF resonance searches to constrain the properties of\nnonstandard scalars, taking the Georgi-Machacek model as a prototypical\nexample. We take into account the theoretical constraints on the potential from\nunitarity and boundedness-from-below as well as indirect constraints coming\nfrom the signal strength measurements of the 125 GeV Higgs boson at the LHC. To\nfacilitate the phenomenological analysis we advocate a convenient\nreparametrization of the trilinear couplings in the scalar potential. We derive\nsimple correlations among the model parameters corresponding to the decoupling\nlimit of the model. We explicitly demonstrate how a combination of theoretical\nand phenomenological constraints can push the GM model towards the decoupling\nlimit. Our analysis suggests that the VBF searches can provide key insights\ninto the composition of the electroweak vacuum expectation value.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:27:20 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Chakraborti","Manimala",""],["Das","Dipankar",""],["Ghosh","Nivedita",""],["Mukherjee","Samadrita",""],["Saha","Ipsita",""]]}
{"id":"2308.02385","submitter":"Michael O'Boyle","authors":"Michael F. O'Boyle, Charalampos Markakis","title":"Discontinuous collocation and symmetric integration methods for\n  distributionally-sourced hyperboloidal partial differential equations","comments":"29 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA astro-ph.HE cs.NA gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work outlines a time-domain numerical integration technique for linear\nhyperbolic partial differential equations sourced by distributions (Dirac\n$\\delta$-functions and their derivatives). Such problems arise when studying\nbinary black hole systems in the extreme mass ratio limit. We demonstrate that\nsuch source terms may be converted to effective domain-wide sources when\ndiscretized, and we introduce a class of time-steppers that directly account\nfor these discontinuities in time integration. Moreover, our time-steppers are\nconstructed to respect time reversal symmetry, a property that has been\nconnected to conservation of physical quantities like energy and momentum in\nnumerical simulations. To illustrate the utility of our method, we numerically\nstudy a distributionally-sourced wave equation that shares many features with\nthe equations governing linear perturbations to black holes sourced by a point\nmass.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:28:31 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 14:14:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["O'Boyle","Michael F.",""],["Markakis","Charalampos",""]]}
{"id":"2308.02386","submitter":"Ghulam Destgeer","authors":"Mehmet Akif Sahin, Muhammad Shehzad, Ghulam Destgeer","title":"Stopping microfluidic flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a cross-comparison of three stop-flow configurations--such as\nlow-pressure (LSF), high-pressure open-circuit (OC-HSF), and high-pressure\nshort-circuit (SC-HSF) stop-flow--to rapidly bring a high flow velocity within\na microchannel to a standstill. The average velocities inside the microchannels\nwere reduced from > 1 m/s to < 10 um/s within 2s of initiating the stop-flow.\nThe performance of the three stop-flow configurations was assessed by measuring\nthe residual flow velocities within microchannels having three\norders-of-magnitude different flow resistances. The LSF configuration\noutperformed the OC-HSF and SC-HSF configurations within the high flow\nresistance microchannel, and resulted in a residual velocity of < 10 um/s. The\nOC-HSF configuration resulted in a residual velocity of < 150 um/s within a low\nflow resistance microchannel. The SC-HSF configuration resulted in a residual\nvelocity of < 200 um/s across the three orders-of-magnitude different flow\nresistance microchannels, and < 100 um/s for the low flow resistance channel.\nWe hypothesized that the residual velocity resulted from the compliance in the\nfluidic circuit, which was further investigated by varying the elasticity of\nthe microchannel walls and the connecting tubing. A numerical model was\ndeveloped to estimate the expanded volumes of the compliant microchannel and\nconnecting tubings under a pressure gradient and to calculate the distance\ntraveled by the sample fluid. A comparison of the numerically and\nexperimentally obtained traveling distances confirmed our hypothesis that the\nresidual velocities were an outcome of the compliance in the fluidic circuit.\nTherefore, a configuration with minimal fluidic circuit compliance resulted in\nthe least residual velocity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:29:26 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 09:26:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sahin","Mehmet Akif",""],["Shehzad","Muhammad",""],["Destgeer","Ghulam",""]]}
{"id":"2308.02387","submitter":"Armin Rahmani","authors":"Sutapa Samanta, Derek S. Wang, Armin Rahmani, Aditi Mitra","title":"Isolated Majorana mode in a quantum computer from a duality twist","comments":"6 pages, 5 figures, 2 pages of supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.str-el hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Experimental investigation of the interplay of dualities, generalized\nsymmetries, and topological defects is an important challenge in condensed\nmatter physics and quantum materials. A simple model exhibiting this physics is\nthe transverse-field Ising model, which can host a noninvertible topological\ndefect that performs the Kramers-Wannier duality transformation. When acting on\none point in space, this duality defect imposes the duality twisted boundary\ncondition and binds a single Majorana zero mode. This Majorana zero mode is\nunusual as it lacks localized partners and has an infinite lifetime, even in\nfinite systems. Using Floquet driving of a closed Ising chain with a duality\ndefect, we generate this Majorana zero mode in a digital quantum computer. We\ndetect the mode by measuring its associated persistent autocorrelation function\nusing an efficient sampling protocol and a compound strategy for error\nmitigation. We also show that the Majorana zero mode resides at the domain wall\nbetween two regions related by a Kramers-Wannier duality. Finally, we highlight\nthe robustness of the isolated Majorana zero mode to integrability and\nsymmetry-breaking perturbations. Our findings offer an approach to\ninvestigating exotic topological defects in digitized quantum devices.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:31:07 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 20:49:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Samanta","Sutapa",""],["Wang","Derek S.",""],["Rahmani","Armin",""],["Mitra","Aditi",""]]}
{"id":"2308.02388","submitter":"Adolf R Mirotin","authors":"A. R. Mirotin","title":"On a general concept of a Hausdorff-type operator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A unified approach to the concept of a Hausdorff operator is proposed in such\na way that a number of classical and new operators feet into the given\ndefinition. Conditions are given for the boundedness of the operators under\nconsideration in $L^p$ and in the atomic Hardy space $H^1$, and their\nregularity property is investigated.\n  Examples are considered. The author hopes that this approach will allow one\nto unify the study of a lot of extensions and analogs of the classical\nHausdorff operator.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:31:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mirotin","A. R.",""]]}
{"id":"2308.02389","submitter":"Simon Gandorfer","authors":"S. Gandorfer, M. Renger, W. K. Yam, F. Fesquet, A. Marx, R. Gross and\n  K. G. Fedorov","title":"Two-Dimensional Planck Spectroscopy","comments":"9 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 state tomography of weak microwave signals is an important part of\nmany protocols in the field of quantum information processing with\nsuperconducting circuits. This step typically relies on an accurate\n$\\textit{in-situ}$ estimation of signal losses in the experimental set-up and\nrequires a careful photon number calibration. Here, we present an improved\nmethod for the microwave loss estimation inside of a closed cryogenic system.\nOur approach is based on Planck's law and makes use of independent temperature\nsweeps of individual parts of the cryogenic set-up. Using this technique, we\ncan experimentally resolve changes in microwave losses of less than 0.1 dB in\nthe cryogenic environment. We discuss potential applications of this approach\nfor precise characterization of quantum-limited superconducting amplifiers and\nin other prominent experimental settings.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:33:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Gandorfer","S.",""],["Renger","M.",""],["Yam","W. K.",""],["Fesquet","F.",""],["Marx","A.",""],["Gross","R.",""],["Fedorov","K. G.",""]]}
{"id":"2308.02390","submitter":"Abhijit Mathad","authors":"Abhijit Mathad (on behalf of the LHCb collaboration)","title":"Recent highlights from the LHCb experiment","comments":"6 pages, 6 figures, Proceedings of XXV DAE-BRNS High Energy Physics\n  Symposium","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Large Hadron Collider beauty (LHCb) detector is a single-arm forward\nspectrometer at the LHC, designed for the study of heavy flavour physics. In\nthis proceedings, an overview of the detector performance and a few recent\nresults in the field of beauty and charm physics are presented. The LHCb\nexperiment has also undergone a major upgrade in preparation for Run 3 and Run\n4 of LHC, the proceedings will briefly highlight the current activities\nundertaken during this period. This proceedings is based on the plenary talk\npresented at the XXV DAE-BRNS High Energy Physics Symposium held from 12-16\nDecember 2022 at IISER Mohali, India.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:34:13 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mathad","Abhijit","","on behalf of the LHCb collaboration"]]}
{"id":"2308.02391","submitter":"Louis-S\\'ebastien Rebuffi","authors":"Jonatha Anselmi, Bruno Gaujal, Louis-S\\'ebastien Rebuffi","title":"Learning Optimal Admission Control in Partially Observable Queueing\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an efficient reinforcement learning algorithm that learns the\noptimal admission control policy in a partially observable queueing network.\nSpecifically, only the arrival and departure times from the network are\nobservable, and optimality refers to the average holding/rejection cost in\ninfinite horizon.\n  While reinforcement learning in Partially Observable Markov Decision\nProcesses (POMDP) is prohibitively expensive in general, we show that our\nalgorithm has a regret that only depends sub-linearly on the maximal number of\njobs in the network, $S$. In particular, in contrast with existing regret\nanalyses, our regret bound does not depend on the diameter of the underlying\nMarkov Decision Process (MDP), which in most queueing systems is at least\nexponential in $S$.\n  The novelty of our approach is to leverage Norton's equivalent theorem for\nclosed product-form queueing networks and an efficient reinforcement learning\nalgorithm for MDPs with the structure of birth-and-death processes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:40:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Anselmi","Jonatha",""],["Gaujal","Bruno",""],["Rebuffi","Louis-S\u00e9bastien",""]]}
{"id":"2308.02392","submitter":"Dmitrii Trunin","authors":"Dmitrii A. Trunin","title":"Refined quantum Lyapunov exponents from replica out-of-time-order\n  correlators","comments":"46 pages, 12 figures. v2: references updated","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech nlin.CD quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We suggest a new indicator of quantum chaos based on the logarithmic\nout-of-time-order correlator. On the one hand, this indicator correctly\nreproduces the average classical Lyapunov exponent in the semiclassical limit\nand directly links the definitions of quantum chaos and classical K-system. On\nthe other hand, it can be analytically calculated using the replica trick and\nthe Schwinger-Keldysh diagram technique on a $2n$-fold Keldysh contour. To\nillustrate this approach, we consider several one-dimensional systems,\nincluding the quantum cat map, and three paradigmatic large-$N$ models,\nincluding the Sachdev-Ye-Kitaev model. Furthermore, we find that correlations\nbetween replicas can reduce the magnitude of the Lyapunov exponent compared to\nestimates based on conventional out-of-time-order correlators.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:45:03 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 09:35:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Trunin","Dmitrii A.",""]]}
{"id":"2308.02393","submitter":"Yanyan Li","authors":"Yanyan Li, Ke Chen, Chong Chen, Jianping Zhang","title":"A Bi-variant Variational Model for Diffeomorphic Image Registration with\n  Relaxed Jacobian Determinant Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffeomorphic registration has become a powerful approach for seeking a\nsmooth and invertible spatial transformation between two coordinate systems\nwhich have been measured via the template and reference images. While the\npointwise volume-preserving constraint is effective for some problems, it is\ntoo stringent for many other problems especially when the local deformations\nare relatively large, because it may lead to a poor large-deformation for\nenforcing local matching.In this paper, we propose a novel bi-variant\ndiffeomorphic image registration model with the soft constraint of Jacobian\nequation, which allows local deformations to shrink and grow in a flexible\nrange.The Jacobian determinant of the transformation is explicitly controlled\nby optimizing the relaxation function. To prevent deformation folding and\nenhance the smoothness of deformation, we not only impose a positivity\nconstraint in optimizing the relaxation function, but also employ a regularizer\nto ensure the smoothness of the relaxation function.Furthermore, the positivity\nconstraint ensures that is as close to one as possible, which helps to obtain a\nvolume-preserving transformation on average.We further analyze the existence of\nthe minimizer for the variational model and propose a penalty splitting method\nwith a multilevel strategy to solve this model. Numerical experiments show that\nthe proposed algorithm is convergent, and the positivity constraint can control\nthe range of relative volume and not compromise registration accuracy.\nMoreover, the proposed model produces diffeomorphic maps for large deformation,\nand achieves better performance compared to the several existing registration\nmodels.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:47:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Li","Yanyan",""],["Chen","Ke",""],["Chen","Chong",""],["Zhang","Jianping",""]]}
{"id":"2308.02394","submitter":"Pascal Giard","authors":"Pascal Giard and Syed Aizaz Ali Shah and Alexios Balatsoukas-Stimming\n  and Maximilian Stark and Gerhard Bauch","title":"Unrolled and Pipelined Decoders based on Look-Up Tables for Polar Codes","comments":"Accepted to the International Symposium on Topics in Coding (ISTC)\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.AR math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unrolling a decoding algorithm allows to achieve extremely high throughput at\nthe cost of increased area. Look-up tables (LUTs) can be used to replace\nfunctions otherwise implemented as circuits. In this work, we show the impact\nof replacing blocks of logic by carefully crafted LUTs in unrolled decoders for\npolar codes. We show that using LUTs to improve key performance metrics (e.g.,\narea, throughput, latency) may turn out more challenging than expected. We\npresent three variants of LUT-based decoders and describe their inner workings\nas well as circuits in detail. The LUT-based decoders are compared against a\nregular unrolled decoder, employing fixed-point representations for numbers,\nwith a comparable error-correction performance. A short systematic polar code\nis used as an illustration. All resulting unrolled decoders are shown to be\ncapable of an information throughput of little under 10 Gbps in a 28 nm FD-SOI\ntechnology clocked in the vicinity of 1.4 GHz to 1.5 GHz. The best variant of\nour LUT-based decoders is shown to reduce the area requirements by 23% compared\nto the regular unrolled decoder while retaining a comparable error-correction\nperformance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:47:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Giard","Pascal",""],["Shah","Syed Aizaz Ali",""],["Balatsoukas-Stimming","Alexios",""],["Stark","Maximilian",""],["Bauch","Gerhard",""]]}
{"id":"2308.02398","submitter":"Marie-Sophie Hartig","authors":"M Armano, H Audley, J Baird, P Binetruy, M Born, D Bortoluzzi, E\n  Castelli, A Cavalleri, A Cesarini, A M Cruise, K Danzmann, M de Deus Silva, I\n  Diepholz, G Dixon, R Dolesi, L Ferraioli, V Ferroni, E D Fitzsimons, M\n  Freschi, L Gesa, D Giardini, F Gibert, R Giusteri, C Grimani, J Grzymisch, I\n  Harrison, M-S Hartig, G Heinzel, M Hewitson, D Hollington, D Hoyland, M\n  Hueller, H Inchausp\\'e, O Jennrich, P Jetzer, U Johann, B Johlander, N\n  Karnesis, B Kaune, C J Killow, N Korsakova, J A Lobo, J P L\\'opez-Zaragoza, R\n  Maarschalkerweerd, D Mance, V Mart\\'in, L Martin-Polo, F Martin-Porqueras, J\n  Martino, P W McNamara, J Mendes, L Mendes, N Meshksar, M Nofrarias, S\n  Paczkowski, M Perreur-Lloyd, A Petiteau, E Plagnol, J Ramos-Castro, J Reiche,\n  F Rivas, D I Robertson, G Russano, J Sanjuan, J Slutsky, C F Sopuerta, T\n  Sumner, L Tevlin, D Texier, J I Thorpe, D Vetrugno, S Vitale, G Wanner, H\n  Ward, P J Wass, W J Weber, L Wissel, A Wittchen, and P Zweifel","title":"Tilt-to-length coupling in LISA Pathfinder: a data analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a study of the tilt-to-length coupling noise during the LISA\nPathfinder mission and how it depended on the system's alignment.\nTilt-to-length coupling noise is the unwanted coupling of angular and lateral\nspacecraft or test mass motion into the primary interferometric displacement\nreadout. It was one of the major noise sources in the LISA Pathfinder mission\nand is likewise expected to be a primary noise source in LISA. We demonstrate\nhere that a recently derived and published analytical model describes the\ndependency of the LISA Pathfinder tilt-to-length coupling noise on the\nalignment of the two freely falling test masses. This was verified with the\ndata taken before and after the realignments performed in March (engineering\ndays) and June 2016, and during a two-day experiment in February 2017 (long\ncross-talk experiment). The latter was performed with the explicit goal of\ntesting the tilt-to-length coupling noise dependency on the test mass\nalignment. Using the analytical model, we show that all realignments performed\nduring the mission were only partially successful and explain the reasons why.\nIn addition to the analytical model, we computed another physical\ntilt-to-length coupling model via a minimising routine making use of the long\ncross-talk experiment data. A similar approach could prove useful for the LISA\nmission.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:49:31 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Armano","M",""],["Audley","H",""],["Baird","J",""],["Binetruy","P",""],["Born","M",""],["Bortoluzzi","D",""],["Castelli","E",""],["Cavalleri","A",""],["Cesarini","A",""],["Cruise","A M",""],["Danzmann","K",""],["Silva","M de Deus",""],["Diepholz","I",""],["Dixon","G",""],["Dolesi","R",""],["Ferraioli","L",""],["Ferroni","V",""],["Fitzsimons","E D",""],["Freschi","M",""],["Gesa","L",""],["Giardini","D",""],["Gibert","F",""],["Giusteri","R",""],["Grimani","C",""],["Grzymisch","J",""],["Harrison","I",""],["Hartig","M-S",""],["Heinzel","G",""],["Hewitson","M",""],["Hollington","D",""],["Hoyland","D",""],["Hueller","M",""],["Inchausp\u00e9","H",""],["Jennrich","O",""],["Jetzer","P",""],["Johann","U",""],["Johlander","B",""],["Karnesis","N",""],["Kaune","B",""],["Killow","C J",""],["Korsakova","N",""],["Lobo","J A",""],["L\u00f3pez-Zaragoza","J P",""],["Maarschalkerweerd","R",""],["Mance","D",""],["Mart\u00edn","V",""],["Martin-Polo","L",""],["Martin-Porqueras","F",""],["Martino","J",""],["McNamara","P W",""],["Mendes","J",""],["Mendes","L",""],["Meshksar","N",""],["Nofrarias","M",""],["Paczkowski","S",""],["Perreur-Lloyd","M",""],["Petiteau","A",""],["Plagnol","E",""],["Ramos-Castro","J",""],["Reiche","J",""],["Rivas","F",""],["Robertson","D I",""],["Russano","G",""],["Sanjuan","J",""],["Slutsky","J",""],["Sopuerta","C F",""],["Sumner","T",""],["Tevlin","L",""],["Texier","D",""],["Thorpe","J I",""],["Vetrugno","D",""],["Vitale","S",""],["Wanner","G",""],["Ward","H",""],["Wass","P J",""],["Weber","W J",""],["Wissel","L",""],["Wittchen","A",""],["Zweifel","P",""]]}
{"id":"2308.02400","submitter":"Felix Staudigl","authors":"Felix Staudigl, Mohammed Hossein, Tobias Ziegler, Hazem Al Indari,\n  Rebecca Pelke, Sebastian Siegel, Dirk J. Wouters, Dominik Sisejkovic, Jan\n  Moritz Joseph, and Rainer Leupers","title":"Work-in-Progress: A Universal Instrumentation Platform for Non-Volatile\n  Memories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emerging non-volatile memories (NVMs) represent a disruptive technology that\nallows a paradigm shift from the conventional von Neumann architecture towards\nmore efficient computing-in-memory (CIM) architectures. Several instrumentation\nplatforms have been proposed to interface NVMs allowing the characterization of\nsingle cells and crossbar structures. However, these platforms suffer from low\nflexibility and are not capable of performing CIM operations on NVMs.\nTherefore, we recently designed and built the NeuroBreakoutBoard, a highly\nversatile instrumentation platform capable of executing CIM on NVMs. We present\nour preliminary results demonstrating a relative error < 5% in the range of 1\nk$\\Omega$ to 1 M$\\Omega$ and showcase the switching behavior of a\nHfO$_2$/Ti-based memristive cell.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:24:57 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Staudigl","Felix",""],["Hossein","Mohammed",""],["Ziegler","Tobias",""],["Indari","Hazem Al",""],["Pelke","Rebecca",""],["Siegel","Sebastian",""],["Wouters","Dirk J.",""],["Sisejkovic","Dominik",""],["Joseph","Jan Moritz",""],["Leupers","Rainer",""]]}
{"id":"2308.02401","submitter":"A. Marin","authors":"A. Marin (for the ALICE Collaboration)","title":"Measurements of direct-photon production in Pb-Pb collisions at\n  $\\sqrt{\\rm s_{NN}}=5.02$ TeV and $\\sqrt{\\rm s_{NN}}=2.76$ TeV with the ALICE\n  experiment","comments":"Proceedings of Hard Probes 2023 Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent results on direct-photon measurements in Pb-Pb collisions at \\fivenn\nfrom central to peripheral collisions, as well as in 0-10% central and 20-40%\nsemicentral Pb-Pb collisions at \\sqrt{ s_{NN}}=2.76 TeV with improved\nsignificance are presented. A significant direct-photon signal is measured for\np_T \\gtrapprox 2 GeV/c from central to peripheral Pb-Pb collisions at\n\\sqrt{s_{NN}}=5.02 TeV which is in agreement with model calculations containing\npre-equilibrium photons in the intermediate p_T range and prompt photons at\nhigh p_T. No significant direct-photon signal is measured in the low p_T\ninterval which is also in agreement with the small thermal-photon signal\npredicted by state-of-the art models. On the other hand, a direct-photon signal\nis measured for p_T > 1 GeV/c with a significance of 3.1 ($1.0 < p_{\\rm T} <\n1.8$ GeV/c) and 3.4 (1.0 < p_T < 2.3 GeV/c) in 0-10% and 20-40% central Pb-Pb\ncollisions at \\sqrt{s_{NN}}=2.76 TeV, respectively. The inverse slope\nparameters of non-prompt photon spectra in the low p_T range, 1.1 < p_T < 2.1\nGeV/c, are T_ eff = 343 \\pm 32 (stat)\\pm 68(sys) MeV and T_eff = 339 \\pm 32\n(stat)\\pm 68(sys) MeV for central and semicentral collisions. In the\nintermediate p_T} range, 2.1 < p_T < 4.0 GeV/c, the effective temperatures are\nT_{eff} = 406 \\pm 19 (stat)\\pm 36(sys) MeV and T_eff = 458 \\pm 25 (stat)\\pm\n40(sys) MeV, respectively. The effective temperatures T_eff in the intermediate\np_T range are systematically larger compared to those obtained at low p_T\n(although consistent within uncertainties) which may indicate an earlier photon\nemission, and thus sensitivity to pre-equilibrium photon production. Direct\nphotons at both energies are in agreement with state-of-the-art theory\ncalculations over the complete p_T range and measured centralities.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:50:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Marin","A.","","for the ALICE Collaboration"]]}
{"id":"2308.02402","submitter":"Andrey Groshev G","authors":"A.G. Groshev and A.K. Arzhnikov","title":"Effect of thermal fuctuations on the nontrivial topology of the d+id\n  superconducting phase","comments":"7 pages, 4 figures, sent for publication in Phys. Rev. B )","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The behavior of the topological index, characterizing the properties of\nsuperconducting phases of quasi-two-dimensional systems with nontrivial\ntopology, is investigated depending on the temperature and parameters of the\neffective non-Hermitian Hamiltonian. For this purpose, a method of calculating\nthe topological index, based on a self-consistent functional-integral theory,\nis proposed. The method makes it possible to take into account thermal\nfluctuations and study the behavior of the topological index as a function of\ntemperature and Hamiltonian parameters. The chiral d+id superconducting phase\nof a quasi-two-dimensional model with effective attraction between the\nelectrons located at the nearest sites of a triangular lattice is considered.\nIt is shown that the characteristic features in the energy dependence of the\nself-energy part, which arise when thermal fluctuations are taken into account,\nhave a structure that does not lead to a change in the topological properties\nof the system. It is found that thermal fluctuations, as well as an increase in\neffective attraction in this system, contribute to the expansion of the\ntemperature region, in which the value of the topological index is close to the\ninteger C1=-2.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:09:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Groshev","A. G.",""],["Arzhnikov","A. K.",""]]}
{"id":"2308.02403","submitter":"Dmitrii Trunin","authors":"Dmitrii A. Trunin","title":"Quantum chaos without false positives","comments":"7 pages, 5 figures. v2: minor corrections","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech nlin.CD quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Out-of-time-order correlators are widely used as an indicator of quantum\nchaos, but give false-positive quantum Lyapunov exponents for integrable\nsystems with isolated saddle points. We propose an alternative indicator that\nfixes this drawback and retains all advantages of out-of-time-order\ncorrelators. In particular, the new indicator correctly predicts the average\nLyapunov exponent and the Ehrenfest time in the semiclassical limit, can be\ncalculated analytically using the replica trick, and satisfies the bound on\nchaos.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:52:44 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 09:42:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Trunin","Dmitrii A.",""]]}
{"id":"2308.02406","submitter":"Corentin D\\'eprez","authors":"Floor van Riggelen-Doelman, Chien-An Wang, Sander L. de Snoo, William\n  I. L. Lawrie, Nico W. Hendrickx, Maximilian Rimbach-Russ, Amir Sammak,\n  Giordano Scappucci, Corentin D\\'eprez, and Menno Veldhorst","title":"Coherent spin qubit shuttling through germanium quantum dots","comments":"Main text: 9 pages, 4 figures Supplementary material: 10 pages, 8\n  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":"  Quantum links can interconnect qubit registers and are therefore essential in\nnetworked quantum computing. Semiconductor quantum dot qubits have seen\nsignificant progress in the high-fidelity operation of small qubit registers\nbut establishing a compelling quantum link remains a challenge. Here, we show\nthat a spin qubit can be shuttled through multiple quantum dots while\npreserving its quantum information. Remarkably, we achieve these results using\nhole spin qubits in germanium, despite the presence of strong spin-orbit\ninteraction. We accomplish the shuttling of spin basis states over effective\nlengths beyond 300 $\\mu$m and demonstrate the coherent shuttling of\nsuperposition states over effective lengths corresponding to 9 $\\mu$m, which we\ncan extend to 49 $\\mu$m by incorporating dynamical decoupling. These findings\nindicate qubit shuttling as an effective approach to route qubits within\nregisters and to establish quantum links between registers.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:57:25 GMT"}],"update_date":"2023-08-07","authors_parsed":[["van Riggelen-Doelman","Floor",""],["Wang","Chien-An",""],["de Snoo","Sander L.",""],["Lawrie","William I. L.",""],["Hendrickx","Nico W.",""],["Rimbach-Russ","Maximilian",""],["Sammak","Amir",""],["Scappucci","Giordano",""],["D\u00e9prez","Corentin",""],["Veldhorst","Menno",""]]}
{"id":"2308.02414","submitter":"Lorenzo Rimella","authors":"Samuel Duffield, Samuel Power, Lorenzo Rimella","title":"A State-Space Perspective on Modelling and Inference for Online Skill\n  Rating","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper offers a comprehensive review of the main methodologies used for\nskill rating in competitive sports. We advocate for a state-space model\nperspective, wherein players' skills are represented as time-varying, and match\nresults serve as the sole observed quantities. The state-space model\nperspective facilitates the decoupling of modeling and inference, enabling a\nmore focused approach highlighting model assumptions, while also fostering the\ndevelopment of general-purpose inference tools. We explore the essential steps\ninvolved in constructing a state-space model for skill rating before turning to\na discussion on the three stages of inference: filtering, smoothing and\nparameter estimation. Throughout, we examine the computational challenges of\nscaling up to high-dimensional scenarios involving numerous players and\nmatches, highlighting approximations and reductions used to address these\nchallenges effectively. We provide concise summaries of popular methods\ndocumented in the literature, along with their inferential paradigms and\nintroduce new approaches to skill rating inference based on sequential Monte\nCarlo and finite state-spaces. We close with numerical experiments\ndemonstrating a practical workflow on real data across different sports.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:03:50 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Duffield","Samuel",""],["Power","Samuel",""],["Rimella","Lorenzo",""]]}
{"id":"2308.02416","submitter":"Yun Kwan Kim","authors":"Yun Kwan Kim, Minji Lee, Kunwook Jo, Hee Seok Song, and Seong-Whan Lee","title":"Local-Global Temporal Fusion Network with an Attention Mechanism for\n  Multiple and Multiclass Arrhythmia Classification","comments":"14 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Clinical decision support systems (CDSSs) have been widely utilized to\nsupport the decisions made by cardiologists when detecting and classifying\narrhythmia from electrocardiograms (ECGs). However, forming a CDSS for the\narrhythmia classification task is challenging due to the varying lengths of\narrhythmias. Although the onset time of arrhythmia varies, previously developed\nmethods have not considered such conditions. Thus, we propose a framework that\nconsists of (i) local temporal information extraction, (ii) global pattern\nextraction, and (iii) local-global information fusion with attention to perform\narrhythmia detection and classification with a constrained input length. The\n10-class and 4-class performances of our approach were assessed by detecting\nthe onset and offset of arrhythmia as an episode and the duration of arrhythmia\nbased on the MIT-BIH arrhythmia database (MITDB) and MIT-BIH atrial\nfibrillation database (AFDB), respectively. The results were statistically\nsuperior to those achieved by the comparison models. To check the\ngeneralization ability of the proposed method, an AFDB-trained model was tested\non the MITDB, and superior performance was attained compared with that of a\nstate-of-the-art model. The proposed method can capture local-global\ninformation and dynamics without incurring information losses. Therefore,\narrhythmias can be recognized more accurately, and their occurrence times can\nbe calculated; thus, the clinical field can create more accurate treatment\nplans by using the proposed method.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:07:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Kim","Yun Kwan",""],["Lee","Minji",""],["Jo","Kunwook",""],["Song","Hee Seok",""],["Lee","Seong-Whan",""]]}
{"id":"2308.02417","submitter":"Jakub Wo\\'znicki","authors":"Miroslav Bul\\'i\\v{c}ek and Jakub Wo\\'znicki","title":"Parabolic equations with non-standard growth and measure or integrable\n  data","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 a parabolic partial differential equation with Dirichlet boundary\nconditions and measure or $L^1$ data. The key difficulty consists in a presence\nof a monotone operator~$A$ subjected to a non-standard growth condition,\ncontrolled by the exponent $p$ depending on the time and the spatial variable.\nWe show the existence of a weak and an entropy solution to our system, as well\nas the uniqueness of an entropy solution, under the assumption of boundedness\nand log-H\\\"{o}lder continuity of the variable exponent~$p$ with respect to the\nspatial variable. On the other hand, we do not assume any smoothness of~$p$\nwith respect to the time variable.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:05:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bul\u00ed\u010dek","Miroslav",""],["Wo\u017anicki","Jakub",""]]}
{"id":"2308.02419","submitter":"Ferdian Jovan","authors":"Ferdian Jovan, Catherine Morgan, Ryan McConville, Emma L. Tonkin, Ian\n  Craddock, Alan Whone","title":"Multimodal Indoor Localisation in Parkinson's Disease for Detecting\n  Medication Use: Observational Pilot Study in a Free-Living Setting","comments":"11 pages, 4 figures, 4 tables","journal-ref":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge\n  Discovery and Data Mining (KDD 2023)","doi":"10.1145/3580305.3599872","report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parkinson's disease (PD) is a slowly progressive, debilitating\nneurodegenerative disease which causes motor symptoms including gait\ndysfunction. Motor fluctuations are alterations between periods with a positive\nresponse to levodopa therapy (\"on\") and periods marked by re-emergency of PD\nsymptoms (\"off\") as the response to medication wears off. These fluctuations\noften affect gait speed and they increase in their disabling impact as PD\nprogresses. To improve the effectiveness of current indoor localisation\nmethods, a transformer-based approach utilising dual modalities which provide\ncomplementary views of movement, Received Signal Strength Indicator (RSSI) and\naccelerometer data from wearable devices, is proposed. A sub-objective aims to\nevaluate whether indoor localisation, including its in-home gait speed features\n(i.e. the time taken to walk between rooms), could be used to evaluate motor\nfluctuations by detecting whether the person with PD is taking levodopa\nmedications or withholding them. To properly evaluate our proposed method, we\nuse a free-living dataset where the movements and mobility are greatly varied\nand unstructured as expected in real-world conditions. 24 participants lived in\npairs (consisting of one person with PD, one control) for five days in a smart\nhome with various sensors. Our evaluation on the resulting dataset demonstrates\nthat our proposed network outperforms other methods for indoor localisation.\nThe sub-objective evaluation shows that precise room-level localisation\npredictions, transformed into in-home gait speed features, produce accurate\npredictions on whether the PD participant is taking or withholding their\nmedications.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:55:21 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jovan","Ferdian",""],["Morgan","Catherine",""],["McConville","Ryan",""],["Tonkin","Emma L.",""],["Craddock","Ian",""],["Whone","Alan",""]]}
{"id":"2308.02422","submitter":"Gonzalo Carvacho","authors":"Mauro Valeri, Paolo Barigelli, Beatrice Polacchi, Giovanni Rodari,\n  Gianluca De Santis, Taira Giordani, Gonzalo Carvacho, Nicol\\`o Spagnolo and\n  Fabio Sciarrino","title":"Generation and characterization of polarization-entangled states using\n  quantum dot single-photon sources","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single-photon sources based on semiconductor quantum dots find several\napplications in quantum information processing due to their high single-photon\nindistinguishability, on-demand generation, and low multiphoton emission. In\nthis context, the generation of entangled photons represents a challenging task\nwith a possible solution relying on the interference in probabilistic gates of\nidentical photons emitted at different pulses from the same source. In this\nwork, we implement this approach via a simple and compact design that generates\nentangled photon pairs in the polarization degree of freedom. We operate the\nproposed platform with single photons produced through two different pumping\nschemes, the resonant excited one and the longitudinal-acoustic phonon-assisted\nconfiguration. We then characterize the produced entangled two-photon states by\ndeveloping a complete model taking into account relevant experimental\nparameters, such as the second-order correlation function and the\nHong-Ou-Mandel visibility. Our source shows long-term stability and high\nquality of the generated entangled states, thus constituting a reliable\nbuilding block for optical quantum technologies.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:07:12 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Valeri","Mauro",""],["Barigelli","Paolo",""],["Polacchi","Beatrice",""],["Rodari","Giovanni",""],["De Santis","Gianluca",""],["Giordani","Taira",""],["Carvacho","Gonzalo",""],["Spagnolo","Nicol\u00f2",""],["Sciarrino","Fabio",""]]}
{"id":"2308.02423","submitter":"Prin Sawasdipol","authors":"Prin Sawasdipol, Jingle B. Magallanes, Chakrit Pongkitivanichkul,\n  Daris Samart","title":"Effects of odderon spin on helicity amplitudes in $pp$ elastic\n  scattering","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, the discovery of the odderon, a colorless $C$-odd gluonic\ncompound, has been confirmed in the TOTEM and D0 collaborations. However, the\nspin quantum number of the odderon remains unidentified. In this work, we aim\nto attribute a spin of $J=3$ to the odderon in $pp$ elastic scattering by\ncalculating the helicity amplitudes and the corresponding complex parameter\n$r_5$, the ratio of helicity's single-flip to non-flip amplitudes, for the\nspin-3 tensor odderon with the standard spin-2 tensor pomeron exchanges. Then,\nwe apply these results to the constraints obtained from the STAR experiment at\nRHIC. By comparing to the contributions of the spin-1 vector odderon and spin-2\ntensor pomeron, we demonstrate that the spin-3 tensor odderon, i.e. $J=3$,\nprovides a better explanation for the observable in $pp$ elastic scattering.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:07:14 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sawasdipol","Prin",""],["Magallanes","Jingle B.",""],["Pongkitivanichkul","Chakrit",""],["Samart","Daris",""]]}
{"id":"2308.02426","submitter":"Will Trojak","authors":"Will Trojak, Tarik Dzanic","title":"Positivity-preserving discontinuous spectral element methods for\n  compressible multi-species flows","comments":"Submitted for review","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":"  We introduce a novel positivity-preserving, parameter-free numerical\nstabilisation approach for high-order discontinuous spectral element\napproximations of compressible multi-species flows. The underlying\nstabilisation method is the adaptive entropy filtering approach (Dzanic and\nWitherden, J. Comput. Phys., 468, 2022), which is extended to the conservative\nformulation of the multi-species flow equations. We show that the\nstraightforward enforcement of entropy constraints in the filter yields poor\nresults around species interfaces and propose an adaptive, parameter-free\nswitch for the entropy bounds based on the convergence properties of the\npressure field which drastically improves its performance for multi-species\nflows. The proposed approach is shown in a variety of numerical experiments\napplied to the multi-species Euler and Navier--Stokes equations computed on\nunstructured grids, ranging from shock-fluid interaction problems to\nthree-dimensional viscous flow instabilities. We demonstrate that the approach\ncan retain the high-order accuracy of the underlying numerical scheme even at\nsmooth extrema, ensure the positivity of the species density and pressure in\nthe vicinity of shocks and contact discontinuities, and accurately predict\nsmall-scale flow features with minimal numerical dissipation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:07:43 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Trojak","Will",""],["Dzanic","Tarik",""]]}
{"id":"2308.02427","submitter":"Yanis Bahroun","authors":"Yanis Bahroun, Shagesh Sridharan, Atithi Acharya, Dmitri B.\n  Chklovskii, Anirvan M. Sengupta","title":"Unlocking the Potential of Similarity Matching: Scalability, Supervision\n  and Pre-training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.AI cs.LG q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While effective, the backpropagation (BP) algorithm exhibits limitations in\nterms of biological plausibility, computational cost, and suitability for\nonline learning. As a result, there has been a growing interest in developing\nalternative biologically plausible learning approaches that rely on local\nlearning rules. This study focuses on the primarily unsupervised similarity\nmatching (SM) framework, which aligns with observed mechanisms in biological\nsystems and offers online, localized, and biologically plausible algorithms. i)\nTo scale SM to large datasets, we propose an implementation of Convolutional\nNonnegative SM using PyTorch. ii) We introduce a localized supervised SM\nobjective reminiscent of canonical correlation analysis, facilitating stacking\nSM layers. iii) We leverage the PyTorch implementation for pre-training\narchitectures such as LeNet and compare the evaluation of features against\nBP-trained models. This work combines biologically plausible algorithms with\ncomputational efficiency opening multiple avenues for further explorations.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:34:55 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Bahroun","Yanis",""],["Sridharan","Shagesh",""],["Acharya","Atithi",""],["Chklovskii","Dmitri B.",""],["Sengupta","Anirvan M.",""]]}
{"id":"2308.02428","submitter":"Gabriel Lopez","authors":"Gabriel L\\'opez Garza","title":"Applications of Laguerre transform to solve Schr\\\"{o}dinger-type\n  equations and Differential Equations of order four","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The finite Laguerre transform is applied to solve Differential Equations\nProblems of order higher than two and a one-dimensional steady-state\nSchr\\\"{o}dinger equation, by using elementary Linear Algebra methods.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:08:29 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Garza","Gabriel L\u00f3pez",""]]}
{"id":"2308.02429","submitter":"Shengfu Cheng","authors":"Shengfu Cheng, Xuyu Zhang, Tianting Zhong, Huanhao Li, Haoran Li, Lei\n  Gong, Honglin Liu, Puxiang Lai","title":"Nonconvex optimization for optimum retrieval of the transmission matrix\n  of a multimode fiber","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Transmission matrix (TM) allows light control through complex media such as\nmultimode fibers (MMFs), gaining great attention in areas like biophotonics\nover the past decade. The measurement of a complex-valued TM is highly desired\nas it supports full modulation of the light field, yet demanding as the\nholographic setup is usually entailed. Efforts have been taken to retrieve a TM\ndirectly from intensity measurements with several representative phase\nretrieval algorithms, which still see limitations like slow or suboptimum\nrecovery, especially under noisy environment. Here, a modified non-convex\noptimization approach is proposed. Through numerical evaluations, it shows that\nthe nonconvex method offers an optimum efficiency of focusing with less running\ntime or sampling rate. The comparative test under different signal-to-noise\nlevels further indicates its improved robustness for TM retrieval.\nExperimentally, the optimum retrieval of the TM of a MMF is collectively\nvalidated by multiple groups of single-spot and multi-spot focusing\ndemonstrations. Focus scanning on the working plane of the MMF is also\nconducted where our method achieves 93.6% efficiency of the gold standard\nholography method when the sampling rate is 8. Based on the recovered TM, image\ntransmission through the MMF with high fidelity can be realized via another\nphase retrieval. Thanks to parallel operation and GPU acceleration, the\nnonconvex approach can retrieve an 8685$\\times$1024 TM (sampling rate=8) with\n42.3 s on a regular computer. In brief, the proposed method provides optimum\nefficiency and fast implementation for TM retrieval, which will facilitate wide\napplications in deep-tissue optical imaging, manipulation and treatment.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:26:03 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Cheng","Shengfu",""],["Zhang","Xuyu",""],["Zhong","Tianting",""],["Li","Huanhao",""],["Li","Haoran",""],["Gong","Lei",""],["Liu","Honglin",""],["Lai","Puxiang",""]]}
{"id":"2308.02430","submitter":"Scott Haselschwardt","authors":"S. J. Haselschwardt, R. Gibbons, H. Chen, S. Kravitz, A. Manalaysay,\n  Q. Xia, P. Sorensen, W. H. Lippincott","title":"First measurement of discrimination between helium and electron recoils\n  in liquid xenon for low-mass dark matter searches","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the first measurement of discrimination between low-energy helium\nrecoils and electron recoils in liquid xenon. This result is relevant to\nproposed low-mass dark matter searches which seek to dissolve light target\nnuclei in the active volume of liquid-xenon time projection chambers.\nLow-energy helium recoils were produced by degrading $\\alpha$ particles from\n$^{210}$Po with a gold foil situated on the cathode of a liquid xenon\ntime-projection chamber. The resulting population of helium recoil events is\nwell separated from electron recoils and is also offset from the expected\nposition of xenon nuclear recoil events.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:09:41 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Haselschwardt","S. J.",""],["Gibbons","R.",""],["Chen","H.",""],["Kravitz","S.",""],["Manalaysay","A.",""],["Xia","Q.",""],["Sorensen","P.",""],["Lippincott","W. H.",""]]}
{"id":"2308.02434","submitter":"Daniel Precioso","authors":"Daniel Precioso, Robert Milson, Louis Bu, Yvonne Menchions, David\n  G\\'omez-Ullate","title":"Hybrid Search method for Zermelo's navigation problem","comments":"25 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a novel algorithm called the Hybrid Search\nalgorithm that integrates the Zermelo's Navigation Initial Value Problem with\nthe Ferraro-Mart\\'in de Diego-Almagro algorithm to find the optimal route for a\nvessel to reach its destination. Our algorithm is designed to work in both\nEuclidean and spherical spaces and utilizes a heuristic that allows the vessel\nto move forward while remaining within a predetermined search cone centred\naround the destination. This approach not only improves efficiency but also\nincludes obstacle avoidance, making it well-suited for real-world applications.\nWe evaluate the performance of the Hybrid Search algorithm on synthetic vector\nfields and real ocean currents data, demonstrating its effectiveness and\nperformance.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:11:59 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Precioso","Daniel",""],["Milson","Robert",""],["Bu","Louis",""],["Menchions","Yvonne",""],["G\u00f3mez-Ullate","David",""]]}
{"id":"2308.02436","submitter":"Jacob Seifert","authors":"Jacob Seifert, Yifeng Shao, Rens van Dam, Dorian Bouchet, Tristan van\n  Leeuwen, Allard P. Mosk","title":"Maximum-likelihood estimation in ptychography in the presence of\n  Poisson-Gaussian noise statistics","comments":"Contains main and supplementary documents","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.comp-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical measurements often exhibit mixed Poisson-Gaussian noise statistics,\nwhich hampers image quality, particularly under low signal-to-noise ratio (SNR)\nconditions. Computational imaging falls short in such situations when solely\nPoissonian noise statistics are assumed. In response to this challenge, we\ndefine a loss function that explicitly incorporates this mixed noise nature. By\nusing maximum-likelihood estimation, we devise a practical method to account\nfor camera readout noise in gradient-based ptychography optimization. Our\nresults, based on both experimental and numerical data, demonstrate that this\napproach outperforms the conventional one, enabling enhanced image\nreconstruction quality under challenging noise conditions through a\nstraightforward methodological adjustment.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 14:03:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Seifert","Jacob",""],["Shao","Yifeng",""],["van Dam","Rens",""],["Bouchet","Dorian",""],["van Leeuwen","Tristan",""],["Mosk","Allard P.",""]]}
{"id":"2308.02438","submitter":"Jonah Stalknecht","authors":"Livia Ferro, Ross Glew, Tomasz Lukowski and Jonah Stalknecht","title":"Prescriptive Unitarity from Positive Geometries","comments":"41 pages, 23 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 define the momentum amplituhedron in the four-dimensional\nsplit-signature space of dual momenta. It encodes scattering amplitudes at tree\nlevel and loop integrands for N=4 super Yang-Mills in the planar sector. In\nthis description, every point in the tree-level geometry is specified by a null\npolygon. Using the null structure of this kinematic space, we find a geometry\nwhose canonical differential form produces loop-amplitude integrands.\nRemarkably, at one loop it is a curvy version of a simple polytope, whose\nvertices are specified by maximal cuts of the amplitude. This construction\nallows us to find novel formulae for the one-loop integrands for amplitudes\nwith any multiplicity and helicity. The formulae obtained in this way agree\nwith the ones derived via prescriptive unitarity. It makes prescriptive\nunitarity naturally emerge from this geometric description.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:14:04 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ferro","Livia",""],["Glew","Ross",""],["Lukowski","Tomasz",""],["Stalknecht","Jonah",""]]}
{"id":"2308.02440","submitter":"Leo Wing Hong Fung","authors":"Leo W.H. Fung, Tom Broadhurst, George F. Smoot","title":"Pure Gravitational Wave Estimation of Hubble's Constant using Neutron\n  Star-Black Hole Mergers","comments":"13 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Here we show how $H_0$ can be derived purely from the gravitational waves\n(GW) of neutron star-black hole (NSBH) mergers. This new method provides an\nestimate of $H_0$ spanning the redshift range, $z<0.25$ with current GW\nsensitivity and without the need for any afterglow detection. We utilise the\ninherently tight neutron star mass function together with the NSBH waveform\namplitude and frequency to estimate distance and redshift respectively, thereby\nobtaining $H_0$ statistically. Our first estimate is $H_0 = 86^{+55}_{-46}$ km\ns$^{-1}$ Mpc$^{-1}$ for the secure NSBH events GW190426 and GW200115. We\nforecast that soon, with 10 more such NSBH events we can reach competitive\nprecision of $\\delta H_0/H_0 \\lesssim 20\\%$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:14:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fung","Leo W. H.",""],["Broadhurst","Tom",""],["Smoot","George F.",""]]}
{"id":"2308.02442","submitter":"Shaojie Min","authors":"Shaojie Min, Ji Liu","title":"Adaptive Preferential Attached kNN Graph with Distribution-Awareness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph-based kNN algorithms have garnered widespread popularity for machine\nlearning tasks due to their simplicity and effectiveness. However, as factual\ndata often inherit complex distributions, the conventional kNN graph's reliance\non a unified k-value can hinder its performance. A crucial factor behind this\nchallenge is the presence of ambiguous samples along decision boundaries that\nare inevitably more prone to incorrect classifications. To address the\nsituation, we propose the Preferential Attached k-Nearest Neighbors Graph\n(paNNG), which adopts distribution-aware adaptive-k into graph construction. By\nincorporating distribution information as a cohesive entity, paNNG can\nsignificantly improve performance on ambiguous samples by \"pulling\" them\ntowards their original classes and hence enhance overall generalization\ncapability. Through rigorous evaluations on diverse datasets, paNNG outperforms\nstate-of-the-art algorithms, showcasing its adaptability and efficacy across\nvarious real-world scenarios.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:14:43 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 03:11:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Min","Shaojie",""],["Liu","Ji",""]]}
{"id":"2308.02444","submitter":"Cameron Stewart","authors":"C.L.Stewart","title":"On sequences of integers with small prime factors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the difference between consecutive terms in sequences of\nintegers whose greatest prime factor grows slowly tends to infinity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:15:40 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Stewart","C. L.",""]]}
{"id":"2308.02445","submitter":"Srijit Bhattacharjee","authors":"Divyesh N. Solanki, Srijit Bhattacharjee","title":"Soft Theorems and Memory Effects at Finite Temperatures","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the soft theorems for photons and gravitons at finite temperatures\nusing the thermofield dynamics approach. The soft factors lose universality at\nfinite temperatures as the soft amplitudes depend on the nature (or spin) of\nthe particles participating in the scattering processes. However, at low\ntemperatures, a universal behavior is observed in the cross-section of the soft\nprocesses. Further, we obtain the thermal contribution to the electromagnetic\nand gravitational memory effects and show that they are related to the soft\nfactors consistently. The expected zero temperature results are obtained from\nthe soft factors and memories. The thermal effects in soft theorems and\nmemories seem to be sensitive to the spin of the particles involved in\nscattering.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:55:24 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Solanki","Divyesh N.",""],["Bhattacharjee","Srijit",""]]}
{"id":"2308.02446","submitter":"Matthias Aschenbrenner","authors":"Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven","title":"Filling gaps in Hardy fields","comments":"57 pp","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CA math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show how to fill \"countable\" gaps in Hardy fields. We use this to prove\nthat any two maximal Hardy fields are back-and-forth equivalent.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:15:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Aschenbrenner","Matthias",""],["Dries","Lou van den",""],["van der Hoeven","Joris",""]]}
{"id":"2308.02447","submitter":"Bin Zhang","authors":"Bin Zhang and Zhigang Shuai","title":"Quantum Dynamical Approach to Predicting the Optical Pumping Threshold\n  for Lasing in Organic Materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a quantum dynamic study on organic lasing phenomena, which is a\nchallenging issue in organic optoelectronics. Previously, phenomenological\nmethod has achieved success in describing experimental observation. However, it\ncannot directly bridge the laser threshold with molecular electronic structure\nparameters and cavity parameters. Quantum dynamics method for describing\norganic lasing and obtaining laser threshold is highly expected. In this\nLetter, we first propose a microscopic model suitable for describing the lasing\ndynamics of organic molecular system and we apply the time-dependent\nwave-packet diffusion (TDWPD) to reveal the microscopic quantum dynamical\nprocess for the optical pumped lasing behavior. Lasing threshold is obtained\nfrom the onset of output as a function of optical input pumping. We predict\nthat the lasing threshold has an optimal value as function of the cavity volume\nand depends linearly on the intracavity photon leakage rate. The\nstructure-property relationships between molecular electronic structure\nparameters (including the energy of molecular excited state, the transition\ndipole and the organization energy) and the laser threshold obtained through\nnumerical calculations are in qualitative agreement the experimental results,\nwhich also confirms the reliability of our approach. This work is beneficial to\nunderstanding the mechanism of organic laser and optimizing the design of\norganic laser materials. TOC\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:17:53 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Zhang","Bin",""],["Shuai","Zhigang",""]]}
{"id":"2308.02448","submitter":"Yanshan Wang","authors":"David Oniani, Jordan Hilsman, Yifan Peng, COL (Ret.) Ronald K.\n  Poropatich, COL Jeremy C. Pamplin, LTC Gary L. Legault, Yanshan Wang","title":"From Military to Healthcare: Adopting and Expanding Ethical Principles\n  for Generative Artificial Intelligence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2020, the U.S. Department of Defense officially disclosed a set of ethical\nprinciples to guide the use of Artificial Intelligence (AI) technologies on\nfuture battlefields. Despite stark differences, there are core similarities\nbetween the military and medical service. Warriors on battlefields often face\nlife-altering circumstances that require quick decision-making. Medical\nproviders experience similar challenges in a rapidly changing healthcare\nenvironment, such as in the emergency department or during surgery treating a\nlife-threatening condition. Generative AI, an emerging technology designed to\nefficiently generate valuable information, holds great promise. As computing\npower becomes more accessible and the abundance of health data, such as\nelectronic health records, electrocardiograms, and medical images, increases,\nit is inevitable that healthcare will be revolutionized by this technology.\nRecently, generative AI has captivated the research community, leading to\ndebates about its application in healthcare, mainly due to concerns about\ntransparency and related issues. Meanwhile, concerns about the potential\nexacerbation of health disparities due to modeling biases have raised notable\nethical concerns regarding the use of this technology in healthcare. However,\nthe ethical principles for generative AI in healthcare have been understudied,\nand decision-makers often fail to consider the significance of generative AI.\nIn this paper, we propose GREAT PLEA ethical principles, encompassing\ngovernance, reliability, equity, accountability, traceability, privacy,\nlawfulness, empathy, and autonomy, for generative AI in healthcare. We aim to\nproactively address the ethical dilemmas and challenges posed by the\nintegration of generative AI in healthcare.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:22:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Oniani","David","","Ret."],["Hilsman","Jordan","","Ret."],["Peng","Yifan","","Ret."],["COL","","","Ret."],["Poropatich","Ronald K.",""],["Pamplin","COL Jeremy C.",""],["Legault","LTC Gary L.",""],["Wang","Yanshan",""]]}
{"id":"2308.02449","submitter":"Pieter Taels","authors":"Pieter Taels","title":"Forward production of a Drell-Yan pair and a jet at small $x$ at\n  next-to-leading order","comments":"101 plus 17 pages (main text plus appendices and bibliography), 11\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform the analytical next-to-leading order calculation of the process\n$p+A\\to \\gamma^{*}+\\mathrm{jet}+X$, at forward rapidities and low $x$. These\nkinematics justify a hybrid approach, where a quark from the \\textquoteleft\nprojectile' proton scatters off the gluon distribution of the \\textquoteleft\ntarget', which can be a nucleus or a highly boosted proton. By using the Color\nGlass Condensate effective theory approach, this gluon distribution is allowed\nto be so dense that the quark undergoes multiple scattering. Moreover, large\nhigh-energy logarithms in the ratio of the hard scale and the center-of-mass\nenergy are resummed by the Balitsky, Kovchegov, Jalilian-Marian, Iancu,\nMcLerran, Weigert, Leonidov, Kovner or BK-JIMWLK evolution equations. We\ndemonstrate that all ultraviolet divergences encountered in the calculation\ncancel, while the high-energy divergences are absorbed into BK-JIMWLK. The\nremaining singularities are collinear in nature and can be either absorbed into\nthe Dokshitzer-Gribov-Lipatov-Altarelli-Parisi evolution of the incoming quark,\nwhen they stem from initial-state radiation, or else can be treated by\nintroduction of a jet function in case they are caused by final-state\nemissions. The resulting cross section is completely finite and expressed in\nfunction of only a small set of color operators.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:29:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Taels","Pieter",""]]}
{"id":"2308.02450","submitter":"Xiao Huang","authors":"Xiao Huang","title":"Composite Quantile Factor Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper introduces the method of composite quantile factor model for\nfactor analysis in high-dimensional panel data. We propose to estimate the\nfactors and factor loadings across different quantiles of the data, allowing\nthe estimates to better adapt to features of the data at different quantiles\nwhile still modeling the mean of the data. We develop the limiting distribution\nof the estimated factors and factor loadings, and an information criterion for\nconsistent factor number selection is also discussed. Simulations show that the\nproposed estimator and the information criterion have good finite sample\nproperties for several non-normal distributions under consideration. We also\nconsider an empirical study on the factor analysis for 246 quarterly\nmacroeconomic variables. A companion R package cqrfactor is developed.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:32:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Huang","Xiao",""]]}
{"id":"2308.02451","submitter":"Sunil Mathew","authors":"Sunil Mathew, Daniel B. Rowe","title":"Pruning a neural network using Bayesian inference","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":"  Neural network pruning is a highly effective technique aimed at reducing the\ncomputational and memory demands of large neural networks. In this research\npaper, we present a novel approach to pruning neural networks utilizing\nBayesian inference, which can seamlessly integrate into the training procedure.\nOur proposed method leverages the posterior probabilities of the neural network\nprior to and following pruning, enabling the calculation of Bayes factors. The\ncalculated Bayes factors guide the iterative pruning. Through comprehensive\nevaluations conducted on multiple benchmarks, we demonstrate that our method\nachieves desired levels of sparsity while maintaining competitive accuracy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:34:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mathew","Sunil",""],["Rowe","Daniel B.",""]]}
{"id":"2308.02452","submitter":"William F. Turner","authors":"Andra\\v{z} Jelin\\v{c}i\\v{c}, Jiajie Tao, William F. Turner, Thomas\n  Cass, James Foster, Hao Ni","title":"Generative Modelling of L\\'{e}vy Area for High Order SDE Simulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG cs.NA math.NA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is well known that, when numerically simulating solutions to SDEs,\nachieving a strong convergence rate better than O(\\sqrt{h}) (where h is the\nstep size) requires the use of certain iterated integrals of Brownian motion,\ncommonly referred to as its \"L\\'{e}vy areas\". However, these stochastic\nintegrals are difficult to simulate due to their non-Gaussian nature and for a\nd-dimensional Brownian motion with d > 2, no fast almost-exact sampling\nalgorithm is known.\n  In this paper, we propose L\\'{e}vyGAN, a deep-learning-based model for\ngenerating approximate samples of L\\'{e}vy area conditional on a Brownian\nincrement. Due to our \"Bridge-flipping\" operation, the output samples match all\njoint and conditional odd moments exactly. Our generator employs a tailored\nGNN-inspired architecture, which enforces the correct dependency structure\nbetween the output distribution and the conditioning variable. Furthermore, we\nincorporate a mathematically principled characteristic-function based\ndiscriminator. Lastly, we introduce a novel training mechanism termed\n\"Chen-training\", which circumvents the need for expensive-to-generate training\ndata-sets. This new training procedure is underpinned by our two main\ntheoretical results.\n  For 4-dimensional Brownian motion, we show that L\\'{e}vyGAN exhibits\nstate-of-the-art performance across several metrics which measure both the\njoint and marginal distributions. We conclude with a numerical experiment on\nthe log-Heston model, a popular SDE in mathematical finance, demonstrating that\nhigh-quality synthetic L\\'{e}vy area can lead to high order weak convergence\nand variance reduction when using multilevel Monte Carlo (MLMC).\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:38:37 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jelin\u010di\u010d","Andra\u017e",""],["Tao","Jiajie",""],["Turner","William F.",""],["Cass","Thomas",""],["Foster","James",""],["Ni","Hao",""]]}
{"id":"2308.02453","submitter":"Yasunori Toshimitsu","authors":"Yasunori Toshimitsu, Benedek Forrai, Barnabas Gavin Cangan, Ulrich\n  Steger, Manuel Knecht, Stefan Weirich, Robert K. Katzschmann","title":"Getting the Ball Rolling: Learning a Dexterous Policy for a Biomimetic\n  Tendon-Driven Hand with Rolling Contact Joints","comments":"for project website, see https://srl-ethz.github.io/get-ball-rolling/\n  . for video, see https://youtu.be/YahsMhqNU8o . Submitted to the 2023\n  IEEE-RAS International Conference on Humanoid Robots","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biomimetic, dexterous robotic hands have the potential to replicate much of\nthe tasks that a human can do, and to achieve status as a general manipulation\nplatform. Recent advances in reinforcement learning (RL) frameworks have\nachieved remarkable performance in quadrupedal locomotion and dexterous\nmanipulation tasks. Combined with GPU-based highly parallelized simulations\ncapable of simulating thousands of robots in parallel, RL-based controllers\nhave become more scalable and approachable. However, in order to bring\nRL-trained policies to the real world, we require training frameworks that\noutput policies that can work with physical actuators and sensors as well as a\nhardware platform that can be manufactured with accessible materials yet is\nrobust enough to run interactive policies. This work introduces the biomimetic\ntendon-driven Faive Hand and its system architecture, which uses tendon-driven\nrolling contact joints to achieve a 3D printable, robust high-DoF hand design.\nWe model each element of the hand and integrate it into a GPU simulation\nenvironment to train a policy with RL, and achieve zero-shot transfer of a\ndexterous in-hand sphere rotation skill to the physical robot hand.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:39:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Toshimitsu","Yasunori",""],["Forrai","Benedek",""],["Cangan","Barnabas Gavin",""],["Steger","Ulrich",""],["Knecht","Manuel",""],["Weirich","Stefan",""],["Katzschmann","Robert K.",""]]}
{"id":"2308.02454","submitter":"Tobias M\\\"uller","authors":"Tobias M\\\"uller, Maximilian St\\\"abler, Hugo Gasc\\'on, Frank K\\\"oster,\n  and Florian Matthes","title":"SoK: Assessing the State of Applied Federated Machine Learning","comments":"9 pages, 6 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning (ML) has shown significant potential in various\napplications; however, its adoption in privacy-critical domains has been\nlimited due to concerns about data privacy. A promising solution to this issue\nis Federated Machine Learning (FedML), a model-to-data approach that\nprioritizes data privacy. By enabling ML algorithms to be applied directly to\ndistributed data sources without sharing raw data, FedML offers enhanced\nprivacy protections, making it suitable for privacy-critical environments.\nDespite its theoretical benefits, FedML has not seen widespread practical\nimplementation. This study aims to explore the current state of applied FedML\nand identify the challenges hindering its practical adoption. Through a\ncomprehensive systematic literature review, we assess 74 relevant papers to\nanalyze the real-world applicability of FedML. Our analysis focuses on the\ncharacteristics and emerging trends of FedML implementations, as well as the\nmotivational drivers and application domains. We also discuss the encountered\nchallenges in integrating FedML into real-life settings. By shedding light on\nthe existing landscape and potential obstacles, this research contributes to\nthe further development and implementation of FedML in privacy-critical\nscenarios.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:28:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["M\u00fcller","Tobias",""],["St\u00e4bler","Maximilian",""],["Gasc\u00f3n","Hugo",""],["K\u00f6ster","Frank",""],["Matthes","Florian",""]]}
{"id":"2308.02455","submitter":"Marco Vogel","authors":"Marco Vogel","title":"Asymptotics of Robin eigenvalues for non-isotropic peaks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Omega\\subset \\mathbb{R}^3$ be an open set such that \\begin{align*}\n&\\Omega \\cap (-\\delta,\\delta)^3=\\left\\{(x_1,x_2,x_3)\\in\n\\mathbb{R}^2\\times(0,\\delta): \\,\n\\left(\\frac{x_1}{x_3^p},\\frac{x_2}{x_3^q}\\right)\\in(-1,1)^2\\right\\}\\subset\\mathbb{R}^{3},\n\\\\ &\\Omega \\setminus [-\\delta,\\delta]^3 \\text{ is a bounded Lipschitz domain},\n\\end{align*} for some $\\delta>0$ and $1<p<q<2$. If a set satisfies the first\ncondition one says that it has a non-isotropic peak at $0$. Now consider the\noperator $Q_\\Omega^\\alpha$ acting as the Laplacian $u\\mapsto-\\Delta u$ on\n$\\Omega$ with the Robin boundary condition $\\partial_\\nu u=\\alpha u$ on\n$\\partial\\Omega$, where $\\partial_\\nu$ is the outward normal derivative. We are\ninterested in the strong coupling asymptotics of $Q_\\Omega^\\alpha$. We prove\nthat for large $\\alpha$ the $j$th eigenvalue $E_j(Q_\\Omega^\\alpha)$ behaves as\n$E_j(Q_\\Omega^\\alpha)\\approx \\mathcal{A}_j\\alpha^{\\frac{2}{2-q}}$, where the\nconstants $\\mathcal{A}_j<0$ are eigenvalues of a one dimensional Schr\\\"odinger\noperator which depends on $p$ and $q$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:44:35 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Vogel","Marco",""]]}
{"id":"2308.02456","submitter":"Marcos Mazari-Armida","authors":"Marcos Mazari-Armida and Jiri Rosicky","title":"Relative injective modules, superstability and noetherian categories","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study classes of modules closed under direct sums,\n$\\mathcal{M}$-submodules and $\\mathcal{M}$-epimorphic images where\n$\\mathcal{M}$ is either the class of embeddings, $RD$-embeddings or pure\nembeddings.\n  We show that the $\\mathcal{M}$-injective modules of theses classes satisfy a\nBaer-like criterion. In particular, injective modules, $RD$-injective modules,\npure injective modules, flat cotorsion modules and $\\mathfrak{s}$-torsion pure\ninjective modules satisfy this criterion. The argument presented is a model\ntheoretic one. We use in an essential way stable independence relations which\ngeneralize Shelah's non-forking to abstract elementary classes.\n  We show that the classical model theoretic notion of superstability is\nequivalent to the algebraic notion of a noetherian category for these classes.\nWe use this equivalence to characterize noetherian rings, pure semisimple\nrings, perfect rings and finite products of finite rings and artinian valuation\nrings via superstability.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:44:51 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 17:37:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mazari-Armida","Marcos",""],["Rosicky","Jiri",""]]}
{"id":"2308.02457","submitter":"Jiapu Wang","authors":"Jiapu Wang, Boyue Wang, Meikang Qiu, Shirui Pan, Bo Xiong, Heng Liu,\n  Linhao Luo, Tengfei Liu, Yongli Hu, Baocai Yin, Wen Gao","title":"A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and\n  Prospects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Temporal characteristics are prominently evident in a substantial volume of\nknowledge, which underscores the pivotal role of Temporal Knowledge Graphs\n(TKGs) in both academia and industry. However, TKGs often suffer from\nincompleteness for three main reasons: the continuous emergence of new\nknowledge, the weakness of the algorithm for extracting structured information\nfrom unstructured data, and the lack of information in the source dataset.\nThus, the task of Temporal Knowledge Graph Completion (TKGC) has attracted\nincreasing attention, aiming to predict missing items based on the available\ninformation. In this paper, we provide a comprehensive review of TKGC methods\nand their details. Specifically, this paper mainly consists of three\ncomponents, namely, 1)Background, which covers the preliminaries of TKGC\nmethods, loss functions required for training, as well as the dataset and\nevaluation protocol; 2)Interpolation, that estimates and predicts the missing\nelements or set of elements through the relevant available information. It\nfurther categorizes related TKGC methods based on how to process temporal\ninformation; 3)Extrapolation, which typically focuses on continuous TKGs and\npredicts future events, and then classifies all extrapolation methods based on\nthe algorithms they utilize. We further pinpoint the challenges and discuss\nfuture research directions of TKGC.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:49:54 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Wang","Jiapu",""],["Wang","Boyue",""],["Qiu","Meikang",""],["Pan","Shirui",""],["Xiong","Bo",""],["Liu","Heng",""],["Luo","Linhao",""],["Liu","Tengfei",""],["Hu","Yongli",""],["Yin","Baocai",""],["Gao","Wen",""]]}
{"id":"2308.02458","submitter":"Andreas Mihatsch","authors":"Nuno Hultberg, Andreas Mihatsch","title":"A linear AFL for quaternion algebras","comments":"19 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove new fundamental lemma and arithmetic fundamental lemma identities\nfor general linear groups over quaternion division algebras. In particular, we\nverify the transfer conjeture and the arithmetic transfer conjecture from\narXiv:2307.11716 in cases of Hasse invariant 1/2.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:51:30 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hultberg","Nuno",""],["Mihatsch","Andreas",""]]}
{"id":"2308.02459","submitter":"Juan Del Aguila Ferrandis","authors":"Juan Del Aguila Ferrandis, Jo\\~ao Moura, Sethu Vijayakumar","title":"Nonprehensile Planar Manipulation through Reinforcement Learning with\n  Multimodal Categorical Exploration","comments":null,"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":"  Developing robot controllers capable of achieving dexterous nonprehensile\nmanipulation, such as pushing an object on a table, is challenging. The\nunderactuated and hybrid-dynamics nature of the problem, further complicated by\nthe uncertainty resulting from the frictional interactions, requires\nsophisticated control behaviors. Reinforcement Learning (RL) is a powerful\nframework for developing such robot controllers. However, previous RL\nliterature addressing the nonprehensile pushing task achieves low accuracy,\nnon-smooth trajectories, and only simple motions, i.e. without rotation of the\nmanipulated object. We conjecture that previously used unimodal exploration\nstrategies fail to capture the inherent hybrid-dynamics of the task, arising\nfrom the different possible contact interaction modes between the robot and the\nobject, such as sticking, sliding, and separation. In this work, we propose a\nmultimodal exploration approach through categorical distributions, which\nenables us to train planar pushing RL policies for arbitrary starting and\ntarget object poses, i.e. positions and orientations, and with improved\naccuracy. We show that the learned policies are robust to external disturbances\nand observation noise, and scale to tasks with multiple pushers. Furthermore,\nwe validate the transferability of the learned policies, trained entirely in\nsimulation, to a physical robot hardware using the KUKA iiwa robot arm. See our\nsupplemental video: https://youtu.be/vTdva1mgrk4.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:55:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Ferrandis","Juan Del Aguila",""],["Moura","Jo\u00e3o",""],["Vijayakumar","Sethu",""]]}
{"id":"2308.02460","submitter":"Saumya Sinha","authors":"Saumya Sinha, John Fasullo, R. Steven Nerem, Claire Monteleoni","title":"Sea level Projections with Machine Learning using Altimetry and Climate\n  Model ensembles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Satellite altimeter observations retrieved since 1993 show that the global\nmean sea level is rising at an unprecedented rate (3.4mm/year). With almost\nthree decades of observations, we can now investigate the contributions of\nanthropogenic climate-change signals such as greenhouse gases, aerosols, and\nbiomass burning in this rising sea level. We use machine learning (ML) to\ninvestigate future patterns of sea level change. To understand the extent of\ncontributions from the climate-change signals, and to help in forecasting sea\nlevel change in the future, we turn to climate model simulations. This work\npresents a machine learning framework that exploits both satellite observations\nand climate model simulations to generate sea level rise projections at a\n2-degree resolution spatial grid, 30 years into the future. We train fully\nconnected neural networks (FCNNs) to predict altimeter values through a\nnon-linear fusion of the climate model hindcasts (for 1993-2019). The learned\nFCNNs are then applied to future climate model projections to predict future\nsea level patterns. We propose segmenting our spatial dataset into meaningful\nclusters and show that clustering helps to improve predictions of our ML model.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:18:38 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Sinha","Saumya",""],["Fasullo","John",""],["Nerem","R. Steven",""],["Monteleoni","Claire",""]]}
{"id":"2308.02461","submitter":"Antonio Jim\\'enez Vargas","authors":"A. Jim\\'enez-Vargas and D. Ruiz-Casternado","title":"Compact Bloch mappings on the complex unit disc","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The known duality of the space of Bloch complex-valued functions on the open\ncomplex unit disc $\\mathbb{D}$ is addressed under a new approach with the\nintroduction of the concepts of Bloch molecules and Bloch-free Banach space of\n$\\mathbb{D}$. We introduce the notion of compact Bloch mapping from\n$\\mathbb{D}$ to a complex Banach space and establish its main properties:\ninvariance by M\\\"obius transformations, linearization from the Bloch-free\nBanach space of $\\mathbb{D}$, factorization of their derivatives, inclusion\nproperties, Banach ideal property and transposition on the Bloch function\nspace. We state Bloch versions of the classical theorems of Schauder,\nGantmacher and Davis-Figiel-Johnson-Pelczy\\'nski.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:56:49 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jim\u00e9nez-Vargas","A.",""],["Ruiz-Casternado","D.",""]]}
{"id":"2308.02462","submitter":"Xu Wu","authors":"Mahmoud Yaseen, Dewen Yushu, Peter German, Xu Wu","title":"Fast and Accurate Reduced-Order Modeling of a MOOSE-based Additive\n  Manufacturing Model with Operator Learning","comments":"28 pages, 18 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One predominant challenge in additive manufacturing (AM) is to achieve\nspecific material properties by manipulating manufacturing process parameters\nduring the runtime. Such manipulation tends to increase the computational load\nimposed on existing simulation tools employed in AM. The goal of the present\nwork is to construct a fast and accurate reduced-order model (ROM) for an AM\nmodel developed within the Multiphysics Object-Oriented Simulation Environment\n(MOOSE) framework, ultimately reducing the time/cost of AM control and\noptimization processes. Our adoption of the operator learning (OL) approach\nenabled us to learn a family of differential equations produced by altering\nprocess variables in the laser's Gaussian point heat source. More specifically,\nwe used the Fourier neural operator (FNO) and deep operator network (DeepONet)\nto develop ROMs for time-dependent responses. Furthermore, we benchmarked the\nperformance of these OL methods against a conventional deep neural network\n(DNN)-based ROM. Ultimately, we found that OL methods offer comparable\nperformance and, in terms of accuracy and generalizability, even outperform DNN\nat predicting scalar model responses. The DNN-based ROM afforded the fastest\ntraining time. Furthermore, all the ROMs were faster than the original MOOSE\nmodel yet still provided accurate predictions. FNO had a smaller mean\nprediction error than DeepONet, with a larger variance for time-dependent\nresponses. Unlike DNN, both FNO and DeepONet were able to simulate time series\ndata without the need for dimensionality reduction techniques. The present work\ncan help facilitate the AM optimization process by enabling faster execution of\nsimulation tools while still preserving evaluation accuracy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:00:34 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yaseen","Mahmoud",""],["Yushu","Dewen",""],["German","Peter",""],["Wu","Xu",""]]}
{"id":"2308.02463","submitter":"Chaoyi Wu","authors":"Chaoyi Wu, Xiaoman Zhang, Ya Zhang, Yanfeng Wang and Weidi Xie","title":"Towards Generalist Foundation Model for Radiology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we aim to initiate the development of Radiology Foundation\nModel, termed as RadFM.We consider the construction of foundational models from\nthe perspectives of data, model design, and evaluation thoroughly. Our\ncontribution can be concluded as follows: (i), we construct a large-scale\nMedical Multi-modal Dataset, MedMD, consisting of 16M 2D and 3D medical scans.\nTo the best of our knowledge, this is the first multi-modal dataset containing\n3D medical scans. (ii), We propose an architecture that enables visually\nconditioned generative pre-training, allowing for the integration of text input\ninterleaved with 2D or 3D medical scans to generate response for diverse\nradiologic tasks. The model was initially pre-trained on MedMD and subsequently\ndomain-specific fine-tuned on RadMD, a radiologic cleaned version of MedMD,\ncontaining 3M radiologic visual-language pairs. (iii), we propose a new\nevaluation benchmark that comprises five tasks, aiming to comprehensively\nassess the capability of foundation models in handling practical clinical\nproblems. Our experimental results confirm that RadFM significantly outperforms\nexisting multi-modal foundation models. The codes, data, and model checkpoint\nwill all be made publicly available to promote further research and development\nin the field.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:00:38 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 02:19:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wu","Chaoyi",""],["Zhang","Xiaoman",""],["Zhang","Ya",""],["Wang","Yanfeng",""],["Xie","Weidi",""]]}
{"id":"2308.02464","submitter":"Shashank Jere","authors":"Shashank Jere, Lizhong Zheng, Karim Said and Lingjia Liu","title":"Universal Approximation of Linear Time-Invariant (LTI) Systems through\n  RNNs: Power of Randomness in Reservoir Computing","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.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recurrent neural networks (RNNs) are known to be universal approximators of\ndynamic systems under fairly mild and general assumptions, making them good\ntools to process temporal information. However, RNNs usually suffer from the\nissues of vanishing and exploding gradients in the standard RNN training.\nReservoir computing (RC), a special RNN where the recurrent weights are\nrandomized and left untrained, has been introduced to overcome these issues and\nhas demonstrated superior empirical performance in fields as diverse as natural\nlanguage processing and wireless communications especially in scenarios where\ntraining samples are extremely limited. On the contrary, the theoretical\ngrounding to support this observed performance has not been fully developed at\nthe same pace. In this work, we show that RNNs can provide universal\napproximation of linear time-invariant (LTI) systems. Specifically, we show\nthat RC can universally approximate a general LTI system. We present a clear\nsignal processing interpretation of RC and utilize this understanding in the\nproblem of simulating a generic LTI system through RC. Under this setup, we\nanalytically characterize the optimal probability distribution function for\ngenerating the recurrent weights of the underlying RNN of the RC. We provide\nextensive numerical evaluations to validate the optimality of the derived\noptimum distribution of the recurrent weights of the RC for the LTI system\nsimulation problem. Our work results in clear signal processing-based model\ninterpretability of RC and provides theoretical explanation for the power of\nrandomness in setting instead of training RC's recurrent weights. It further\nprovides a complete optimum analytical characterization for the untrained\nrecurrent weights, marking an important step towards explainable machine\nlearning (XML) which is extremely important for applications where training\nsamples are limited.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:04:13 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jere","Shashank",""],["Zheng","Lizhong",""],["Said","Karim",""],["Liu","Lingjia",""]]}
{"id":"2308.02465","submitter":"Marco Arazzi","authors":"Marco Arazzi, Mauro Conti, Stefanos Koffas, Marina Krcek, Antonino\n  Nocera, Stjepan Picek and Jing Xu","title":"BlindSage: Label Inference Attacks against Node-level Vertical Federated\n  Graph Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated learning enables collaborative training of machine learning models\nby keeping the raw data of the involved workers private. One of its main\nobjectives is to improve the models' privacy, security, and scalability.\nVertical Federated Learning (VFL) offers an efficient cross-silo setting where\na few parties collaboratively train a model without sharing the same features.\nIn such a scenario, classification labels are commonly considered sensitive\ninformation held exclusively by one (active) party, while other (passive)\nparties use only their local information. Recent works have uncovered important\nflaws of VFL, leading to possible label inference attacks under the assumption\nthat the attacker has some, even limited, background knowledge on the relation\nbetween labels and data. In this work, we are the first (to the best of our\nknowledge) to investigate label inference attacks on VFL using a\nzero-background knowledge strategy. To concretely formulate our proposal, we\nfocus on Graph Neural Networks (GNNs) as a target model for the underlying VFL.\nIn particular, we refer to node classification tasks, which are widely studied,\nand GNNs have shown promising results. Our proposed attack, BlindSage, provides\nimpressive results in the experiments, achieving nearly 100% accuracy in most\ncases. Even when the attacker has no information about the used architecture or\nthe number of classes, the accuracy remained above 85% in most instances.\nFinally, we observe that well-known defenses cannot mitigate our attack without\naffecting the model's performance on the main classification task.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:04:58 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Arazzi","Marco",""],["Conti","Mauro",""],["Koffas","Stefanos",""],["Krcek","Marina",""],["Nocera","Antonino",""],["Picek","Stjepan",""],["Xu","Jing",""]]}
{"id":"2308.02466","submitter":"Jeck Lim","authors":"David Conlon, Jeck Lim","title":"Everywhere unbalanced configurations","comments":"27 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An old problem in discrete geometry, originating with Kupitz, asks whether\nthere is a fixed natural number $k$ such that every finite set of points in the\nplane has a line through at least two of its points where the number of points\non either side of this line differ by at most $k$. We give a negative answer to\na natural variant of this problem, showing that for every natural number $k$\nthere exists a finite set of points in the plane together with a pseudoline\narrangement such that each pseudoline contains at least two points and there is\na pseudoline through any pair of points where the number of points on either\nside of each pseudoline differ by at least $k$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:06:27 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Conlon","David",""],["Lim","Jeck",""]]}
{"id":"2308.02467","submitter":"Shukai Du","authors":"Shukai Du, Samuel N. Stechmann","title":"Element learning: a systematic approach of accelerating finite\n  element-type methods via machine learning, with applications to radiative\n  transfer","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 paper, we propose a systematic approach for accelerating finite\nelement-type methods by machine learning for the numerical solution of partial\ndifferential equations (PDEs). The main idea is to use a neural network to\nlearn the solution map of the PDEs and to do so in an element-wise fashion.\nThis map takes input of the element geometry and the PDEs' parameters on that\nelement, and gives output of two operators -- (1) the in2out operator for\ninter-element communication, and (2) the in2sol operator (Green's function) for\nelement-wise solution recovery. A significant advantage of this approach is\nthat, once trained, this network can be used for the numerical solution of the\nPDE for any domain geometry and any parameter distribution without retraining.\nAlso, the training is significantly simpler since it is done on the element\nlevel instead on the entire domain. We call this approach element learning.\nThis method is closely related to hybridizbale discontinuous Galerkin (HDG)\nmethods in the sense that the local solvers of HDG are replaced by machine\nlearning approaches. Numerical tests are presented for an example PDE, the\nradiative transfer equation, in a variety of scenarios with idealized or\nrealistic cloud fields, with smooth or sharp gradient in the cloud boundary\ntransition. Under a fixed accuracy level of $10^{-3}$ in the relative $L^2$\nerror, and polynomial degree $p=6$ in each element, we observe an approximately\n5 to 10 times speed-up by element learning compared to a classical finite\nelement-type method.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:06:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Du","Shukai",""],["Stechmann","Samuel N.",""]]}
{"id":"2308.02468","submitter":"Jie Qing","authors":"Huajie Liu, Shiguang Ma, Jie Qing, and Shuhui Zhong","title":"p-Laplace equations in conformal geometry","comments":"19 page","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we introduce the p-Laplace equations for the intermediate\nSchouten curvature in conformal geometry. These p-Laplace equations provide\nmore tools for the study of geometry and topology of manifolds. First, the\npositivity of the intermediate Schouten curvature yields the vanishing of Betti\nnumbers on locally conformally flat manifolds as consequences of the\nB\\\"{o}chner formula as in the works of Nayatani and Guan-Lin-Wang. Secondly and\nmore interestingly, when the intermediate Schouten curvature is nonnegative,\nthese p-Laplace equations facilitate the geometric applications of\np-superharmonic functions and the nonlinear potential theory. This leads to the\nestimates on Hausdorff dimension of singular sets and vanishing of homotopy\ngroups that is inspired by and extends the work of Schoen-Yau. In the\nforthcoming paper we will present our results on the asymptotic behavior of\np-superharmonic functions at singularities.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:10:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Huajie",""],["Ma","Shiguang",""],["Qing","Jie",""],["Zhong","Shuhui",""]]}
{"id":"2308.02469","submitter":"Hanbit Oh","authors":"Hanbit Oh, Ya-Hui Zhang","title":"S-wave pairing in a two-orbital t-J model on triangular lattice:\n  possible application to Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently room temperature superconductor was claimed in\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O (also known as LK-99) with $x\\in (0.9,1.1)$.\nDensity functional theory (DFT) calculations suggest that the conduction\nelectrons are from the doped Cu atoms with valence close to $d^{9}$. Motivated\nby this picture, we build a two-orbital Hubbard model on a triangular lattice\nformed by the $d_{xz}$ and $d_{yz}$ orbitals with total hole density (summed\nover spin and orbital) $n=1-p$. When $p=0$, the system is in a Mott insulator\nwithin this model. When $p>0$, we derive a $t-J$ model and perform a\nself-consistent slave boson mean field calculation. Interestingly we find a\ns-wave pairing in contrast to the one-orbital t-J model which favors $d+id$\npairing. S wave pairing should be more robust to disorder and may lead to high\nTc superconductor with sufficiently large values of $t$ and $J$. However, the\nDFT calculations predict a very small value of $t$ and then the $T_c$ is\nexpected to be small. If LK99 is really a high Tc superconductor, ingredients\nbeyond the current model are needed. We conjecture that the doped Cu atoms may\ndistort the original lattice and form local clusters with smaller Cu -Cu\ndistance and thus larger values of $t$ and $J$. Within these clusters, we may\nlocally apply our t-J model calculation and expect high Tc s-wave\nsuperconductor. Then the superconducting islands couple together, which may\neventually become a global superconductor, an insulator or even an anomalous\nmetal depending on sample details.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:15:45 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Oh","Hanbit",""],["Zhang","Ya-Hui",""]]}
{"id":"2308.02470","submitter":"Genly Le\\'on","authors":"Genly Leon (Catolica del Norte U. and DUT, Durban), Alan Coley\n  (Dalhousie U.), Andronikos Paliathanasis (DUT, Durban and Catolica del Norte\n  U.), Jonathan Tot (Dalhousie U.), and Balkar Yildirim (Dalhousie U.)","title":"Global dynamics of two models for Quintom\n  Friedman-Lema\\^itre-Robertson-Walker Universes","comments":"71 pages, 18 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":"  We comprehensively analyze the dynamics for the gravitational field equations\nfor the Chiral-Quintom theory in a Friedman-Lema\\^itre-Robertson-Walker\ncosmology with an additional matter source. We consider a new set of\ndimensionless variables and write the field equations in the equivalent form of\nan algebraic-differential system. Specifically, we consider two families of\nquintom models where the two scalar fields interact in the kinetic sector. We\nmathematically focus on the dynamical effect of spatial curvature. Physically,\nwe find two periods of inflation related to the Universe's early and late-time\nacceleration phases.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:20:00 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Leon","Genly","","Catolica del Norte U. and DUT, Durban"],["Coley","Alan","","Dalhousie U."],["Paliathanasis","Andronikos","","DUT, Durban and Catolica del Norte\n  U."],["Tot","Jonathan","","Dalhousie U."],["Yildirim","Balkar","","Dalhousie U."]]}
{"id":"2308.02471","submitter":"Weizhong Fu","authors":"Weizhong Fu, Weiluo Ren, Ji Chen","title":"Variance extrapolation method for neural-network variational Monte Carlo","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Constructing more expressive ansatz has been a primary focus for quantum\nMonte Carlo, aimed at more accurate \\textit{ab initio} calculations. However,\nwith more powerful ansatz, e.g. various recent developed models based on\nneural-network architectures, the training becomes more difficult and\nexpensive, which may have a counterproductive effect on the accuracy of\ncalculation. In this work, we propose to make use of the training data to\nperform variance extrapolation when using neural-network ansatz in variational\nMonte Carlo. We show that this approach can speed up the convergence and\nsurpass the ansatz limitation to obtain an improved estimation of the energy.\nMoreover, variance extrapolation greatly enhances the error cancellation\ncapability, resulting in significantly improved relative energy outcomes, which\nare the keys to chemistry and physics problems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:20:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fu","Weizhong",""],["Ren","Weiluo",""],["Chen","Ji",""]]}
{"id":"2308.02472","submitter":"Manaswi Paraashar","authors":"Nikhil S. Mande, Manaswi Paraashar and Nitin Saurabh","title":"Randomized and quantum query complexities of finding a king in a\n  tournament","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC cs.DS quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A tournament is a complete directed graph. It is well known that every\ntournament contains at least one vertex v such that every other vertex is\nreachable from v by a path of length at most 2. All such vertices v are called\n*kings* of the underlying tournament. Despite active recent research in the\narea, the best-known upper and lower bounds on the deterministic query\ncomplexity (with query access to directions of edges) of finding a king in a\ntournament on n vertices are from over 20 years ago, and the bounds do not\nmatch: the best-known lower bound is Omega(n^{4/3}) and the best-known upper\nbound is O(n^{3/2}) [Shen, Sheng, Wu, SICOMP'03]. Our contribution is to show\nessentially *tight* bounds (up to logarithmic factors) of Theta(n) and\nTheta(sqrt{n}) in the *randomized* and *quantum* query models, respectively. We\nalso study the randomized and quantum query complexities of finding a maximum\nout-degree vertex in a tournament.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:21:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Mande","Nikhil S.",""],["Paraashar","Manaswi",""],["Saurabh","Nitin",""]]}
{"id":"2308.02473","submitter":"Xin Liu","authors":"Xin Liu, Xingchen Liu, Goldy Kumar, Paul Witherell","title":"Scalabale Path Level Thermal History Simulation of PBF process validated\n  by Melt Pool Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we outline the development of a scalable PBF thermal history\nsimulation built on CAPL and based on melt pool physics and dynamics. The new\napproach inherits linear scalability from CAPL and has three novel ingredients.\nFirstly, to simulate the laser scanning on a solid surface, we discretize the\nentire simulation domain instead of only the manufacturing toolpath by\nappending fictitious paths to the manufacturing toolpath. Secondly, to simulate\nthe scanning on overlapping toolpaths, the path-scale simulations are\ninitialized by a Voronoi diagram for line segments discretized from the\nmanufacturing toolpath. Lastly, we propose a modified conduction model that\nconsiders the high thermal gradient around the melt pool. We validate the\nsimulation against melt pool images captured with the co-axial melt pool\nmonitoring (MPM) system on the NIST Additive Manufacturing Metrology Testbed\n(AMMT). Excellent agreements in the length and width of melt pools are found\nbetween simulations and experiments conducted on a custom-controlled laser\npowder bed fusion (LPBF) testbed on a nickel-alloy (IN625) solid surface. To\nthe authors' best knowledge, this paper is the first to validate a full\npath-scale thermal history with experimentally acquired melt pool images.\nComparing the simulation results and the experimental data, we discuss the\ninfluence of laser power on the melt pool length on the path-scale level. We\nalso identify the possible ways to further improve the accuracy of the CAPL\nsimulation without sacrificing efficiency.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:23:06 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Liu","Xin",""],["Liu","Xingchen",""],["Kumar","Goldy",""],["Witherell","Paul",""]]}
{"id":"2308.02474","submitter":"Wendy L. Freedman","authors":"Wendy L. Freedman and Barry F. Madore","title":"The Cepheid Extragalactic Distance Scale: Past, Present and Future","comments":"12 pages, 9 figures, Invited Review for IAU Symposium 376, Richard de\n  Grijs, Patricia Whitelock and Marcio Catelan, eds","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cepheids have been the cornerstone of the extragalactic distance scale for a\ncentury. With high-quality data, these luminous supergiants exhibit a small\ndispersion in their Leavitt (period-luminosity) relation, particularly at\nlonger wavelengths, and few methods rival the precision possible with Cepheid\ndistances. In these proceedings, we present an overview of major observational\nprograms pertaining to the Cepheid extragalactic distance scale, its progress\nand remaining challenges. In addition, we present preliminary new results on\nCepheids from the James Webb Space Telescope (JWST). The launch of JWST has\nopened a new chapter in the measurement of extragalactic distances and the\nHubble constant. JWST offers a resolution three times that of the Hubble Space\nTelescope (HST) with nearly 10 times the sensitivity. It has been suggested\nthat the discrepancy in the value of the Hubble constant based on Cepheids\ncompared to that inferred from measurements of the cosmic microwave background\nrequires new and additional physics beyond the standard cosmological model.\nJWST observations will be critical in reducing remaining systematics in the\nCepheid measurements and for confirming if new physics is indeed required.\nEarly JWST data for the galaxy, NGC 7250 show a decrease in scatter in the\nCepheid Leavitt law by a factor of two relative to existing HST data and\ndemonstrate that crowding/blending effects are a significant issue in a galaxy\nas close as 20 Mpc.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:23:36 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Freedman","Wendy L.",""],["Madore","Barry F.",""]]}
{"id":"2308.02475","submitter":"Roemer Hinlopen","authors":"R. D. H. Hinlopen, Owen Moulding, Will Broad, Jonathan Buhot, Femke\n  Bangma, Alix McCollam, Jake Ayres, Charles Sayers, Enrico Da Como, Felix\n  Flicker, Jasper van Wezel, Sven Friedemann","title":"Lifshitz transition enabling superconducting dome around the quantum\n  critical point in TiSe$_2$","comments":"21 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superconductivity often emerges as a dome around a quantum critical point\n(QCP) where long-range order is suppressed to zero temperature. So far, this\nhas been mostly studied in magnetically ordered materials. By contrast, the\ninterplay between charge order and superconductivity at a QCP is not fully\nunderstood. Here, we present resistance measurements proving that a dome of\nsuperconductivity surrounds the charge-density-wave (CDW) QCP in pristine\nsamples of 1$T$-TiSe$_2$ tuned with hydrostatic pressure. Furthermore, we use\nquantum oscillation measurements to show that the superconductivity sets in at\na Lifshitz transition in the electronic band structure. We use density\nfunctional theory to identify the Fermi pockets enabling superconductivity:\nlarge electron and hole pockets connected by the CDW wave vector $\\vec{Q}$\nwhich emerge upon partial suppression of the zero-pressure CDW gap. Hence, we\nconclude that superconductivity is of interband type enabled by the presence of\nhole and electron bands connected by the CDW $\\vec{Q}$ vector. Earlier\ncalculations show that interband interactions are repulsive, which suggests\nthat unconventional s$_{\\pm}$ superconductivity is realised in TiSe$_2$ -\nsimilar to the iron pnictides. These results highlight the importance of\nLifshitz transitions in realising unconventional superconductivity and help\nunderstand its interaction with CDW order in numerous materials.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:26:11 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Hinlopen","R. D. H.",""],["Moulding","Owen",""],["Broad","Will",""],["Buhot","Jonathan",""],["Bangma","Femke",""],["McCollam","Alix",""],["Ayres","Jake",""],["Sayers","Charles",""],["Da Como","Enrico",""],["Flicker","Felix",""],["van Wezel","Jasper",""],["Friedemann","Sven",""]]}
{"id":"2308.02476","submitter":"Jack Sankey","authors":"Vincent Dumont, Jiaxing Ma, Eamon Eagan, and Jack C. Sankey","title":"High-Power Quantum-Limited Photodiode and Classical Laser Noise\n  Squashing","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To benefit high-power interferometry and the creation of low-noise light\nsources, we develop a simple lead-compensated photodetector enabling\nquantum-limited readout from 0.3 mW to 10 mW and 10 k$\\Omega$ transimpedance\ngain from 85 Hz - 35 MHz. Feeding the detector output back to an intensity\nmodulator, we squash the classical amplitude noise of a commercial 1550 nm\nfiber laser to the shot noise limit over a bandwidth of 700 Hz - 200 kHz,\nobserving no degradation to its (nominally ~100 Hz) linewidth.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:36:15 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Dumont","Vincent",""],["Ma","Jiaxing",""],["Eagan","Eamon",""],["Sankey","Jack C.",""]]}
{"id":"2308.02477","submitter":"Anastasiia Kucherenko","authors":"Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafael\n  Pinot, Sasha Voitovych","title":"On the Inherent Anonymity of Gossiping","comments":"Full version of DISC2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting the source of a gossip is a critical issue, related to identifying\npatient zero in an epidemic, or the origin of a rumor in a social network.\nAlthough it is widely acknowledged that random and local gossip communications\nmake source identification difficult, there exists no general quantification of\nthe level of anonymity provided to the source. This paper presents a principled\nmethod based on $\\varepsilon$-differential privacy to analyze the inherent\nsource anonymity of gossiping for a large class of graphs. First, we quantify\nthe fundamental limit of source anonymity any gossip protocol can guarantee in\nan arbitrary communication graph. In particular, our result indicates that when\nthe graph has poor connectivity, no gossip protocol can guarantee any\nmeaningful level of differential privacy. This prompted us to further analyze\ngraphs with controlled connectivity. We prove on these graphs that a large\nclass of gossip protocols, namely cobra walks, offers tangible differential\nprivacy guarantees to the source. In doing so, we introduce an original proof\ntechnique based on the reduction of a gossip protocol to what we call a random\nwalk with probabilistic die out. This proof technique is of independent\ninterest to the gossip community and readily extends to other protocols\ninherited from the security community, such as the Dandelion protocol.\nInterestingly, our tight analysis precisely captures the trade-off between\ndissemination time of a gossip protocol and its source anonymity.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:39:42 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Guerraoui","Rachid",""],["Kermarrec","Anne-Marie",""],["Kucherenko","Anastasiia",""],["Pinot","Rafael",""],["Voitovych","Sasha",""]]}
{"id":"2308.02478","submitter":"Nikolai Miklin","authors":"Prabhav Jain, Mariami Gachechiladze, Nikolai Miklin","title":"Information causality as a tool for bounding the set of quantum\n  correlations","comments":"4 pages + Appendix, 2 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Information causality was initially proposed as a physical principle aimed at\nderiving the predictions of quantum mechanics on the type of correlations\nobserved in the Bell experiment. In the same work, information causality was\nfamously shown to imply the Uffink inequality that approximates the set of\nquantum correlations and rederives Tsirelson's bound of the\nClauser-Horne-Shimony-Holt inequality. This result found limited\ngeneralizations due to the difficulty of deducing implications of the\ninformation causality principle on the set of nonlocal correlations. In this\npaper, we present a simple technique for obtaining polynomial inequalities from\ninformation causality, bounding the set of physical correlations in any Bell\nscenario. To demonstrate our method, we derive a family of inequalities which\nnon-trivially constrains the set of nonlocal correlations in Bell scenarios\nwith binary outcomes and equal number of measurement settings. Finally, we\npropose an improved statement of the information causality principle, obtain\ntighter constraints for the simplest Bell scenario that goes beyond the Uffink\ninequality, and recovers a part of the boundary of the quantum set.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:40:53 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Jain","Prabhav",""],["Gachechiladze","Mariami",""],["Miklin","Nikolai",""]]}
{"id":"2308.02479","submitter":"Hamidreza Fereidouni","authors":"Hamidreza Fereidouni, Olga Fadeitcheva and Mehdi Zalai","title":"IoT and Man-in-the-Middle Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper provides an overview of the Internet of Things (IoT) and its\nsignificance. It discusses the concept of Man-in-the-Middle (MitM) attacks in\ndetail, including their causes, potential solutions, and challenges in\ndetecting and preventing such attacks. The paper also addresses the current\nissues related to IoT security and explores future methods and facilities for\nimproving detection and prevention mechanisms against MitM.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:42:44 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Fereidouni","Hamidreza",""],["Fadeitcheva","Olga",""],["Zalai","Mehdi",""]]}
{"id":"2308.02480","submitter":"Joshua Agterberg","authors":"Joshua Agterberg","title":"Distributional Theory and Statistical Inference for Linear Functions of\n  Eigenvectors with Small Eigengaps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectral methods have myriad applications in high-dimensional statistics and\ndata science, and while previous works have primarily focused on $\\ell_2$ or\n$\\ell_{2,\\infty}$ eigenvector and singular vector perturbation theory, in many\nsettings these analyses fall short of providing the fine-grained guarantees\nrequired for various inferential tasks. In this paper we study statistical\ninference for linear functions of eigenvectors and principal components with a\nparticular emphasis on the setting where gaps between eigenvalues may be\nextremely small relative to the corresponding spiked eigenvalue, a regime which\nhas been oft-neglected in the literature. It has been previously established\nthat linear functions of eigenvectors and principal components incur a\nnon-negligible bias, so in this work we provide Berry-Esseen bounds for\nempirical linear forms and their debiased counterparts respectively in the\nmatrix denoising model and the spiked principal component analysis model, both\nunder Gaussian noise. Next, we propose data-driven estimators for the\nappropriate bias and variance quantities resulting in approximately valid\nconfidence intervals, and we demonstrate our theoretical results through\nnumerical simulations. We further apply our results to obtain distributional\ntheory and confidence intervals for eigenvector entries, for which debiasing is\nnot necessary. Crucially, our proposed confidence intervals and bias-correction\nprocedures can all be computed directly from data without sample-splitting and\nare asymptotically valid under minimal assumptions on the eigengap and signal\nstrength. Furthermore, our Berry-Esseen bounds clearly reflect the effects of\nboth signal strength and eigenvalue closeness on the estimation and inference\ntasks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:48:10 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Agterberg","Joshua",""]]}
{"id":"2308.02481","submitter":"Michael Swift","authors":"Michael W. Swift and John L. Lyons","title":"Lone-Pair Stereochemistry Induces Ferroelectric Distortion and the\n  Rashba Effect in Inorganic Halide Perovskites","comments":"21 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/4.0/","abstract":"  The lone-pair s states of germanium, tin, and lead underlie many of the\nunconventional properties of the inorganic metal halide perovskites. Dynamic\nstereochemical expression of the lone pairs is well established for perovskites\nbased on all three metals, but previously only the germanium perovskites were\nthought to express the lone pair crystallographically. In this work, we use\nadvanced first-principles calculations with a hybrid functional and spin-orbit\ncoupling to predict stable monoclinic polar phases of $\\mathrm{CsSnI}_3$ and\n$\\mathrm{CsSnBr}_3$, which exhibit a ferroelectric distortion driven by\nstereochemical expression of the tin lone pair. We also predict similar\nmetastable ferroelectric phases of $\\mathrm{CsPbI}_3$ and $\\mathrm{CsPbBr}_3$.\nIn addition to ferroelectricity, these phases exhibit the Rashba effect. Spin\nsplitting in both the conduction and valence bands suggests that nanostructures\nbased on these phases could host bright ground-state excitons. Finally, we\ndiscuss paths toward experimental realization of these phases via electric\nfields and tensile strain.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:51:10 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Swift","Michael W.",""],["Lyons","John L.",""]]}
{"id":"2308.02482","submitter":"Lucy Skidmore","authors":"Lucy Skidmore and Roger K. Moore","title":"Adapting the NICT-JLE Corpus for Disfluency Detection 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 detection of disfluencies such as hesitations, repetitions and false\nstarts commonly found in speech is a widely studied area of research. With a\nstandardised process for evaluation using the Switchboard Corpus, model\nperformance can be easily compared across approaches. This is not the case for\ndisfluency detection research on learner speech, however, where such datasets\nhave restricted access policies, making comparison and subsequent development\nof improved models more challenging. To address this issue, this paper\ndescribes the adaptation of the NICT-JLE corpus, containing approximately 300\nhours of English learners' oral proficiency tests, to a format that is suitable\nfor disfluency detection model training and evaluation. Points of difference\nbetween the NICT-JLE and Switchboard corpora are explored, followed by a\ndetailed overview of adaptations to the tag set and meta-features of the\nNICT-JLE corpus. The result of this work provides a standardised train, heldout\nand test set for use in future research on disfluency detection for learner\nspeech.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:54:52 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Skidmore","Lucy",""],["Moore","Roger K.",""]]}
{"id":"2308.02483","submitter":"James Davies","authors":"James Davies, Rose McCarty, Micha{\\l} Pilipczuk","title":"Prime and polynomial distances in colourings of the plane","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give two extensions of the recent theorem of the first author that the odd\ndistance graph has unbounded chromatic number. The first is that for any\nnon-constant polynomial $f$ with integer coefficients and positive leading\ncoefficient, every finite colouring of the plane contains a monochromatic pair\nof distinct points whose distance is equal to $f(n)$ for some integer $n$. The\nsecond is that for every finite colouring of the plane, there is a\nmonochromatic pair of points whose distance is a prime number.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:55:08 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Davies","James",""],["McCarty","Rose",""],["Pilipczuk","Micha\u0142",""]]}
{"id":"2308.02484","submitter":"Gang Tao","authors":"Gang Tao","title":"Discrete-Time Adaptive State Tracking Control Schemes Using Gradient\n  Algorithms","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 conducts a comprehensive study of a classical adaptive control\nproblem: adaptive control of a state-space plant model: $\\dot{x}(t) = A x(t) +\nB u(t)$ in continuous time, or $x(t+1) = A x(t) + B u(t)$ in discrete time, for\nstate tracking of a chosen stable reference model system: $\\dot{x}_m(t) = A_m\nx_m(t) + B_m r(t)$ in continuous time, or $x_m(t+1) = A_m x_m(t) + B_m r(t)$ in\ndiscrete time. Adaptive state tracking control schemes for continuous-time\nsystems have been reported in the literature, using a Lyapunov design and\nanalysis method which has not been successfully applied to discrete-time\nsystems, so that the discrete-time adaptive state tracking problem has remained\nto be open. In this paper, new adaptive state tracking control schemes are\ndeveloped for discrete-time systems, using a gradient method for the design of\nadaptive laws for updating the controller parameters. Both direct and indirect\nadaptive designs are presented, which have the standard and desired adaptive\nlaw properties. Such a new gradient algorithm based framework is also developed\nfor adaptive state tracking control of continuous-time systems, as compared\nwith the Lyapunov method based framework.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:56:32 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Tao","Gang",""]]}
{"id":"2308.02485","submitter":"Ryota Akiyama","authors":"Ibuki Taniuchi, Ryota Akiyama, Rei Hobara, and Shuji Hasegawa","title":"Surface Circular Photogalvanic Effect in Tl-Pb Monolayer Alloys on\n  Si(111) with Giant Rashba Splitting","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":"  We have found that surface superstructures made of \"monolayer alloys\" of Tl\nand Pb on Si(111), having giant Rashba effect, produce non-reciprocal\nspin-polarized photocurrent via circular photogalvanic effect (CPGE) by\nobliquely shining circularly polarized near-infrared (IR) light. CPGE is here\ncaused by injection of in-plane spin into spin-split surface-state bands, which\nis observed only on Tl-Pb alloy layers, but not on single-element Tl nor Pb\nlayers. In the Tl-Pb monolayer alloys, despite their monatomic thickness, the\nmagnitude of CPGE is comparable to or even larger than the cases of many other\nspin-split thin-film materials. The data analysis has provided the relative\npermittivity $\\epsilon^{\\ast}$ of the monolayer alloys to be $\\sim$ 1.0, which\nis because the monolayer exists at a transition region between the vacuum and\nthe substrate. The present result opens the possibility that we can optically\nmanipulate spins of electrons even on monolayer materials.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:57:28 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Taniuchi","Ibuki",""],["Akiyama","Ryota",""],["Hobara","Rei",""],["Hasegawa","Shuji",""]]}
{"id":"2308.02486","submitter":"Kellen Lawson","authors":"Kellen Lawson, Joshua E. Schlieder, Jarron M. Leisenring, Ell Bogat,\n  Charles A. Beichman, Geoffrey Bryden, Andr\\'as G\\'asp\\'ar, Tyler D. Groff,\n  Michael W. McElwain, Michael R. Meyer, Thomas Barclay, Per Calissendorff,\n  Matthew De Furio, Marie Ygouf, Anthony Boccaletti, Thomas P. Greene, John\n  Krist, Peter Plavchan, Marcia J. Rieke, Thomas L. Roellig, John Stansberry,\n  John P. Wisniewski, Erick T. Young","title":"JWST/NIRCam Coronagraphy of the Young Planet-hosting Debris Disk AU\n  Microscopii","comments":"27 pages, 14 figures","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":"  High-contrast imaging of debris disk systems permits us to assess the\ncomposition and size distribution of circumstellar dust, to probe recent\ndynamical histories, and to directly detect and characterize embedded\nexoplanets. Observations of these systems in the infrared beyond 2--3 $\\mu$m\npromise access to both extremely favorable planet contrasts and numerous\nscattered-light spectral features -- but have typically been inhibited by the\nbrightness of the sky at these wavelengths. We present coronagraphy of the AU\nMicroscopii (AU Mic) system using JWST's Near Infrared Camera (NIRCam) in two\nfilters spanning 3--5 $\\mu$m. These data provide the first images of the\nsystem's famous debris disk at these wavelengths and permit additional\nconstraints on its properties and morphology. Conducting a deep search for\ncompanions in these data, we do not identify any compelling candidates.\nHowever, with sensitivity sufficient to recover planets as small as $\\sim 0.1$\nJupiter masses beyond $\\sim 2^{\\prime\\prime}$ ($\\sim 20$ au) with $5\\sigma$\nconfidence, these data place significant constraints on any massive companions\nthat might still remain at large separations and provide additional context for\nthe compact, multi-planet system orbiting very close-in. The observations\npresented here highlight NIRCam's unique capabilities for probing similar disks\nin this largely unexplored wavelength range, and provide the deepest direct\nimaging constraints on wide-orbit giant planets in this very well studied\nbenchmark system.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:58:46 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Lawson","Kellen",""],["Schlieder","Joshua E.",""],["Leisenring","Jarron M.",""],["Bogat","Ell",""],["Beichman","Charles A.",""],["Bryden","Geoffrey",""],["G\u00e1sp\u00e1r","Andr\u00e1s",""],["Groff","Tyler D.",""],["McElwain","Michael W.",""],["Meyer","Michael R.",""],["Barclay","Thomas",""],["Calissendorff","Per",""],["De Furio","Matthew",""],["Ygouf","Marie",""],["Boccaletti","Anthony",""],["Greene","Thomas P.",""],["Krist","John",""],["Plavchan","Peter",""],["Rieke","Marcia J.",""],["Roellig","Thomas L.",""],["Stansberry","John",""],["Wisniewski","John P.",""],["Young","Erick T.",""]]}
{"id":"2308.02487","submitter":"Qihang Yu","authors":"Qihang Yu, Ju He, Xueqing Deng, Xiaohui Shen, Liang-Chieh Chen","title":"Convolutions Die Hard: Open-Vocabulary Segmentation with Single Frozen\n  Convolutional CLIP","comments":"code and model available at https://github.com/bytedance/fc-clip","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open-vocabulary segmentation is a challenging task requiring segmenting and\nrecognizing objects from an open set of categories. One way to address this\nchallenge is to leverage multi-modal models, such as CLIP, to provide image and\ntext features in a shared embedding space, which bridges the gap between\nclosed-vocabulary and open-vocabulary recognition. Hence, existing methods\noften adopt a two-stage framework to tackle the problem, where the inputs first\ngo through a mask generator and then through the CLIP model along with the\npredicted masks. This process involves extracting features from images multiple\ntimes, which can be ineffective and inefficient. By contrast, we propose to\nbuild everything into a single-stage framework using a shared Frozen\nConvolutional CLIP backbone, which not only significantly simplifies the\ncurrent two-stage pipeline, but also remarkably yields a better accuracy-cost\ntrade-off. The proposed FC-CLIP, benefits from the following observations: the\nfrozen CLIP backbone maintains the ability of open-vocabulary classification\nand can also serve as a strong mask generator, and the convolutional CLIP\ngeneralizes well to a larger input resolution than the one used during\ncontrastive image-text pretraining. When training on COCO panoptic data only\nand testing in a zero-shot manner, FC-CLIP achieve 26.8 PQ, 16.8 AP, and 34.1\nmIoU on ADE20K, 18.2 PQ, 27.9 mIoU on Mapillary Vistas, 44.0 PQ, 26.8 AP, 56.2\nmIoU on Cityscapes, outperforming the prior art by +4.2 PQ, +2.4 AP, +4.2 mIoU\non ADE20K, +4.0 PQ on Mapillary Vistas and +20.1 PQ on Cityscapes,\nrespectively. Additionally, the training and testing time of FC-CLIP is 7.5x\nand 6.6x significantly faster than the same prior art, while using 5.9x fewer\nparameters. FC-CLIP also sets a new state-of-the-art performance across various\nopen-vocabulary semantic segmentation datasets. Code at\nhttps://github.com/bytedance/fc-clip\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:59:01 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yu","Qihang",""],["He","Ju",""],["Deng","Xueqing",""],["Shen","Xiaohui",""],["Chen","Liang-Chieh",""]]}
{"id":"2308.02488","submitter":"Bryan Foo","authors":"Bryan C. Foo, Derek B. Schaeffer, Peter V. Heuer","title":"Recovering non-Maxwellian particle velocity distribution functions from\n  collective Thomson-scattered spectra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Collective optical Thomson scattering (TS) is a diagnostic commonly used to\ncharacterize plasma parameters. These parameters are typically extracted by a\nfitting algorithm that minimizes the difference between a measured scattered\nspectrum and an analytic spectrum calculated from the velocity distribution\nfunction (VDF) of the plasma. However, most existing TS analysis algorithms\nassume the VDFs are Maxwellian, and applying an algorithm which makes this\nassumption does not accurately extract the plasma parameters of a\nnon-Maxwellian plasma due to the effect of non-Maxwellian deviations on the TS\nspectra. We present new open-source numerical tools for forward modeling\nanalytic spectra from arbitrary VDFs, and show that these tools are able to\nmore accurately extract plasma parameters from synthetic TS spectra generated\nby non-Maxwellian VDFs compared to standard TS algorithms. Estimated posterior\nprobability distributions of fits to synthetic spectra for a variety of example\nnon-Maxwellian VDFs are used to determine uncertainties in the extracted plasma\nparameters, and show that correlations between parameters can significantly\naffect the accuracy of fits in plasmas with non-Maxwellian VDFs.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:59:23 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Foo","Bryan C.",""],["Schaeffer","Derek B.",""],["Heuer","Peter V.",""]]}
{"id":"2308.02489","submitter":"Andrew King","authors":"Andrew King","title":"Why are Quasiperiodic Eruptions only Found in Low-Mass Galaxies?","comments":"Accepted for MNRAS Letters","journal-ref":null,"doi":"10.1093/mnrasl/slad113","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  I consider the current sample of galaxy nuclei producing quasiperiodic\neruptions (QPEs). If the quasiperiod results from the orbital motion of a star\naround the central black hole, the dearth of associated black hole masses\n$\\gtrsim 10^6\\msun$ places tight constraints on models. It disfavours those\nassuming wide orbits and small eccentricities, because there is ample volume\nwithin pericentre to allow significantly more massive holes in QPE systems than\nare currently observed. If instead the orbiting star is assumed to pass close\nto the black hole, the same lack of large black hole masses strongly suggests\nthat the stellar orbits must be significantly eccentric, with $1 - e \\lesssim\n{\\rm few}\\times 10^{-2}$. This favours a tidal disruption near-miss picture\nwhere QPEs result from repeated accretion from an orbiting star (in practice a\nwhite dwarf) losing orbital angular momentum to gravitational radiation, even\nthough this is not assumed in deriving the eccentricity constraint. Given the\ntight constraints resulting from the current small observed sample, attempts to\nfind QPE systems in more massive galaxies are clearly important.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:59:38 GMT"},{"version":"v2","created":"Mon, 7 Aug 2023 13:27:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["King","Andrew",""]]}
{"id":"2308.02490","submitter":"Weihao Yu","authors":"Weihao Yu, Zhengyuan Yang, Linjie Li, Jianfeng Wang, Kevin Lin,\n  Zicheng Liu, Xinchao Wang, Lijuan Wang","title":"MM-Vet: Evaluating Large Multimodal Models for Integrated Capabilities","comments":"Code and data: https://github.com/yuweihao/MM-Vet","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose MM-Vet, an evaluation benchmark that examines large multimodal\nmodels (LMMs) on complicated multimodal tasks. Recent LMMs have shown various\nintriguing abilities, such as solving math problems written on the blackboard,\nreasoning about events and celebrities in news images, and explaining visual\njokes. Rapid model advancements pose challenges to evaluation benchmark\ndevelopment. Problems include: (1) How to systematically structure and evaluate\nthe complicated multimodal tasks; (2) How to design evaluation metrics that\nwork well across question and answer types; and (3) How to give model insights\nbeyond a simple performance ranking. To this end, we present MM-Vet, designed\nbased on the insight that the intriguing ability to solve complicated tasks is\noften achieved by a generalist model being able to integrate different core\nvision-language (VL) capabilities. MM-Vet defines 6 core VL capabilities and\nexamines the 16 integrations of interest derived from the capability\ncombination. For evaluation metrics, we propose an LLM-based evaluator for\nopen-ended outputs. The evaluator enables the evaluation across different\nquestion types and answer styles, resulting in a unified scoring metric. We\nevaluate representative LMMs on MM-Vet, providing insights into the\ncapabilities of different LMM system paradigms and models. Code and data are\navailable at https://github.com/yuweihao/MM-Vet.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:59:47 GMT"}],"update_date":"2023-08-07","authors_parsed":[["Yu","Weihao",""],["Yang","Zhengyuan",""],["Li","Linjie",""],["Wang","Jianfeng",""],["Lin","Kevin",""],["Liu","Zicheng",""],["Wang","Xinchao",""],["Wang","Lijuan",""]]}
{"id":"2308.02530","submitter":"Jianwu Fang","authors":"Tianci Zhao, Xue Bai, Jianwu Fang, and Jianru Xue","title":"Gated Driver Attention Predictor","comments":"Accepted by ITSC2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Driver attention prediction implies the intention understanding of where the\ndriver intends to go and what object the driver concerned about, which commonly\nprovides a driving task-guided traffic scene understanding. Some recent works\nexplore driver attention prediction in critical or accident scenarios and find\na positive role in helping accident prediction, while the promotion ability is\nconstrained by the prediction accuracy of driver attention maps. In this work,\nwe explore the network connection gating mechanism for driver attention\nprediction (Gate-DAP). Gate-DAP aims to learn the importance of different\nspatial, temporal, and modality information in driving scenarios with various\nroad types, occasions, and light and weather conditions. The network connection\ngating in Gate-DAP consists of a spatial encoding network gating,\nlong-short-term memory network gating, and information type gating modules.\nEach connection gating operation is plug-and-play and can be flexibly\nassembled, which makes the architecture of Gate-DAP transparent for evaluating\ndifferent spatial, temporal, and information types for driver attention\nprediction. Evaluations on DADA-2000 and BDDA datasets verify the superiority\nof the proposed method with the comparison with state-of-the-art approaches.\nThe code is available on https://github.com/JWFangit/Gate-DAP.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 03:59:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Tianci",""],["Bai","Xue",""],["Fang","Jianwu",""],["Xue","Jianru",""]]}
{"id":"2308.02531","submitter":"Jiuyang Zhou","authors":"Jiuyang Zhou, Hong Zhu, Xingping Wang","title":"Choir Transformer: Generating Polyphonic Music with Relative Attention\n  on Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.AI cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Polyphonic music generation is still a challenge direction due to its correct\nbetween generating melody and harmony. Most of the previous studies used\nRNN-based models. However, the RNN-based models are hard to establish the\nrelationship between long-distance notes. In this paper, we propose a\npolyphonic music generation neural network named Choir Transformer[\nhttps://github.com/Zjy0401/choir-transformer], with relative positional\nattention to better model the structure of music. We also proposed a music\nrepresentation suitable for polyphonic music generation. The performance of\nChoir Transformer surpasses the previous state-of-the-art accuracy of 4.06%. We\nalso measures the harmony metrics of polyphonic music. Experiments show that\nthe harmony metrics are close to the music of Bach. In practical application,\nthe generated melody and rhythm can be adjusted according to the specified\ninput, with different styles of music like folk music or pop music and so on.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:44:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Jiuyang",""],["Zhu","Hong",""],["Wang","Xingping",""]]}
{"id":"2308.02532","submitter":"Kaiyuan Chen","authors":"Kaiyuan Chen, Longkun Fan, Zhicheng Hu, Yixin Xu","title":"Dual-phase-lag heat conduction analysis of a three-dimensional finite\n  medium heated by a moving laser beam with circular or annular cross-section","comments":"19 pages, 30 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We analyze the non-Fourier dual-phase-lag heat conduction process in a\nthree-dimensional medium heated by a moving circular or annular laser beam,\nwhich is modeled by a set of point heat sources in the cross-section. In order\nto solve the model, Green's function approach is first used to obtain an\nanalytical solution for the temperature distribution over the medium subjected\nto a single point heat source. Then the temperature distribution on the medium\nsubjected to the laser beam can be obtained by the superposition method.\nAccording to this solution, the dependence between the heat conduction process\nand the cross-section of the heat source is investigated. Based on the\ncomparison of the temperature distribution of the medium under Fourier's law\nand non-Fourier's law, the effect of the phase lag parameter is revealed. In\naddition, the effects of laser spot size and laser moving speed on the\ntemperature distribution are also analyzed. The discovered properties provide\ntheoretical support for the application of moving laser heat sources in various\nfields under the dual-phase-lag model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 06:55:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Kaiyuan",""],["Fan","Longkun",""],["Hu","Zhicheng",""],["Xu","Yixin",""]]}
{"id":"2308.02533","submitter":"Jindong Wang","authors":"Kaijie Zhu, Jindong Wang, Xixu Hu, Xing Xie, Ge Yang","title":"Improving Generalization of Adversarial Training via Robust Critical\n  Fine-Tuning","comments":"Accepted by International Conference on Computer Vision (ICCV) 2023;\n  code is at https://github.com/microsoft/robustlearn","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks are susceptible to adversarial examples, posing a\nsignificant security risk in critical applications. Adversarial Training (AT)\nis a well-established technique to enhance adversarial robustness, but it often\ncomes at the cost of decreased generalization ability. This paper proposes\nRobustness Critical Fine-Tuning (RiFT), a novel approach to enhance\ngeneralization without compromising adversarial robustness. The core idea of\nRiFT is to exploit the redundant capacity for robustness by fine-tuning the\nadversarially trained model on its non-robust-critical module. To do so, we\nintroduce module robust criticality (MRC), a measure that evaluates the\nsignificance of a given module to model robustness under worst-case weight\nperturbations. Using this measure, we identify the module with the lowest MRC\nvalue as the non-robust-critical module and fine-tune its weights to obtain\nfine-tuned weights. Subsequently, we linearly interpolate between the\nadversarially trained weights and fine-tuned weights to derive the optimal\nfine-tuned model weights. We demonstrate the efficacy of RiFT on ResNet18,\nResNet34, and WideResNet34-10 models trained on CIFAR10, CIFAR100, and\nTiny-ImageNet datasets. Our experiments show that \\method can significantly\nimprove both generalization and out-of-distribution robustness by around 1.5%\nwhile maintaining or even slightly enhancing adversarial robustness. Code is\navailable at https://github.com/microsoft/robustlearn.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:02:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhu","Kaijie",""],["Wang","Jindong",""],["Hu","Xixu",""],["Xie","Xing",""],["Yang","Ge",""]]}
{"id":"2308.02534","submitter":"Pablo Agustin Martin Torres","authors":"Lucia Urcelay, Daniel Hinjos, Pablo A. Martin-Torres, Marta Gonzalez,\n  Marta Mendez, Salva C\\'ivico, Sergio \\'Alvarez-Napagao and Dario\n  Garcia-Gasulla","title":"Exploring the Role of Explainability in AI-Assisted Embryo Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In Vitro Fertilization is among the most widespread treatments for\ninfertility. One of its main challenges is the evaluation and selection of\nembryo for implantation, a process with large inter- and intra-clinician\nvariability. Deep learning based methods are gaining attention, but their\nopaque nature compromises their acceptance in the clinical context, where\ntransparency in the decision making is key. In this paper we analyze the\ncurrent work in the explainability of AI-assisted embryo analysis models,\nidentifying the limitations. We also discuss how these models could be\nintegrated in the clinical context as decision support systems, considering the\nneeds of clinicians and patients. Finally, we propose guidelines for the sake\nof increasing interpretability and trustworthiness, pushing this technology\nforward towards established clinical practice.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:46:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Urcelay","Lucia",""],["Hinjos","Daniel",""],["Martin-Torres","Pablo A.",""],["Gonzalez","Marta",""],["Mendez","Marta",""],["C\u00edvico","Salva",""],["\u00c1lvarez-Napagao","Sergio",""],["Garcia-Gasulla","Dario",""]]}
{"id":"2308.02535","submitter":"Olivier Laurent","authors":"Marwane Hariat, Olivier Laurent, R\\'emi Kazmierczak, Shihao Zhang,\n  Andrei Bursuc, Angela Yao and Gianni Franchi","title":"Learning to Generate Training Datasets for Robust Semantic Segmentation","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":"  Semantic segmentation techniques have shown significant progress in recent\nyears, but their robustness to real-world perturbations and data samples not\nseen during training remains a challenge, particularly in safety-critical\napplications. In this paper, we propose a novel approach to improve the\nrobustness of semantic segmentation techniques by leveraging the synergy\nbetween label-to-image generators and image-to-label segmentation models.\nSpecifically, we design and train Robusta, a novel robust conditional\ngenerative adversarial network to generate realistic and plausible perturbed or\noutlier images that can be used to train reliable segmentation models. We\nconduct in-depth studies of the proposed generative model, assess the\nperformance and robustness of the downstream segmentation network, and\ndemonstrate that our approach can significantly enhance the robustness of\nsemantic segmentation techniques in the face of real-world perturbations,\ndistribution shifts, and out-of-distribution samples. Our results suggest that\nthis approach could be valuable in safety-critical applications, where the\nreliability of semantic segmentation techniques is of utmost importance and\ncomes with a limited computational budget in inference. We will release our\ncode shortly.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:02:26 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 14:42:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hariat","Marwane",""],["Laurent","Olivier",""],["Kazmierczak","R\u00e9mi",""],["Zhang","Shihao",""],["Bursuc","Andrei",""],["Yao","Angela",""],["Franchi","Gianni",""]]}
{"id":"2308.02536","submitter":"Sebastian Feld","authors":"Stan van der Linde, Willem de Kok, Tariq Bontekoe, Sebastian Feld","title":"qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compiling a quantum circuit for specific quantum hardware is a challenging\ntask. Moreover, current quantum computers have severe hardware limitations. To\nmake the most use of the limited resources, the compilation process should be\noptimized. To improve currents methods, Reinforcement Learning (RL), a\ntechnique in which an agent interacts with an environment to learn complex\npolicies to attain a specific goal, can be used. In this work, we present qgym,\na software framework derived from the OpenAI gym, together with environments\nthat are specifically tailored towards quantum compilation. The goal of qgym is\nto connect the research fields of Artificial Intelligence (AI) with quantum\ncompilation by abstracting parts of the process that are irrelevant to either\ndomain. It can be used to train and benchmark RL agents and algorithms in\nhighly customizable environments.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:07:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["van der Linde","Stan",""],["de Kok","Willem",""],["Bontekoe","Tariq",""],["Feld","Sebastian",""]]}
{"id":"2308.02537","submitter":"Philipp Kohl","authors":"Philipp Kohl and Nils Freyer and Yoka Kr\\\"amer and Henri Werth and\n  Steffen Wolf and Bodo Kraft and Matthias Meinecke and Albert Z\\\"undorf","title":"ALE: A Simulation-Based Active Learning Evaluation Framework for the\n  Parameter-Driven Comparison of Query Strategies for NLP","comments":"The Version of Record of this contribution is published in Deep\n  Learning Theory and Applications 4th International Conference, DeLTA 2023\n  Proceedings, and is available online at\n  https://doi.org/10.1007/978-3-031-39059-3_16","journal-ref":"Conte, D., Fred, A., Gusikhin, O., Sansone, C. (eds) Deep Learning\n  Theory and Applications. DeLTA 2023. Communications in Computer and\n  Information Science, vol 1875. Springer, Cham","doi":"10.1007/978-3-031-39059-3_16","report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Supervised machine learning and deep learning require a large amount of\nlabeled data, which data scientists obtain in a manual, and time-consuming\nannotation process. To mitigate this challenge, Active Learning (AL) proposes\npromising data points to annotators they annotate next instead of a subsequent\nor random sample. This method is supposed to save annotation effort while\nmaintaining model performance. However, practitioners face many AL strategies\nfor different tasks and need an empirical basis to choose between them. Surveys\ncategorize AL strategies into taxonomies without performance indications.\nPresentations of novel AL strategies compare the performance to a small subset\nof strategies. Our contribution addresses the empirical basis by introducing a\nreproducible active learning evaluation (ALE) framework for the comparative\nevaluation of AL strategies in NLP. The framework allows the implementation of\nAL strategies with low effort and a fair data-driven comparison through\ndefining and tracking experiment parameters (e.g., initial dataset size, number\nof data points per query step, and the budget). ALE helps practitioners to make\nmore informed decisions, and researchers can focus on developing new, effective\nAL strategies and deriving best practices for specific use cases. With best\npractices, practitioners can lower their annotation costs. We present a case\nstudy to illustrate how to use the framework.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:42:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kohl","Philipp",""],["Freyer","Nils",""],["Kr\u00e4mer","Yoka",""],["Werth","Henri",""],["Wolf","Steffen",""],["Kraft","Bodo",""],["Meinecke","Matthias",""],["Z\u00fcndorf","Albert",""]]}
{"id":"2308.02538","submitter":"Navdeep Singh Dhindsa","authors":"Navdeep Singh Dhindsa, Anosh Joseph, Abhishek Samlodia, David Schaich","title":"Deconfinement Phase Transition in Bosonic BMN Model at General Coupling","comments":"5 pages, 2 figures. Contribution to the proceedings of the XXV\n  DAE-BRNS HEP Symposium 2022, 12-16 December 2022, IISER Mohali, India","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present our analysis of the deconfinement phase transition in the bosonic\nBMN matrix model. The model is investigated using a non-perturbative lattice\nframework. We used the Polyakov loop as the order parameter to monitor the\nphase transition, and the results were verified using the separatrix ratio. The\ncalculations are performed using a large number of colors and a broad range of\ntemperatures for all couplings. Our results indicate a first-order phase\ntransition in this theory for all the coupling values that connect the\nperturbative and non-perturbative regimes of the theory.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:14:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dhindsa","Navdeep Singh",""],["Joseph","Anosh",""],["Samlodia","Abhishek",""],["Schaich","David",""]]}
{"id":"2308.02539","submitter":"C. Maria Keet","authors":"Kutz Arrieta and Pablo R. Fillottrani and C. Maria Keet","title":"CoSMo: A constructor specification language for Abstract Wikipedia's\n  content selection process","comments":"32 pages, 8 figures, 7 tables, extended technical report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Representing snippets of information abstractly is a task that needs to be\nperformed for various purposes, such as database view specification and the\nfirst stage in the natural language generation pipeline for generative AI from\nstructured input, i.e., the content selection stage to determine what needs to\nbe verbalised. For the Abstract Wikipedia project, requirements analysis\nrevealed that such an abstract representation requires multilingual modelling,\ncontent selection covering declarative content and functions, and both classes\nand instances. There is no modelling language that meets either of the three\nfeatures, let alone a combination. Following a rigorous language design process\ninclusive of broad stakeholder consultation, we created CoSMo, a novel {\\sc\nCo}ntent {\\sc S}election {\\sc Mo}deling language that meets these and other\nrequirements so that it may be useful both in Abstract Wikipedia as well as\nother contexts. We describe the design process, rationale and choices, the\nspecification, and preliminary evaluation of the language.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 13:57:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Arrieta","Kutz",""],["Fillottrani","Pablo R.",""],["Keet","C. Maria",""]]}
{"id":"2308.02540","submitter":"Craig Larson","authors":"C. E. Larson and N. Van Cleemput","title":"Top-down Automated Theorem Proving (Notes for Sir Timothy)","comments":"Cross list with cs.AI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We describe a \"top down\" approach for automated theorem proving (ATP).\nResearchers might usefully investigate the forms of the theorems mathematicians\nuse in practice, carefully examine how they differ and are proved in practice,\nand code all relevant domain concepts. These concepts encode a large portion of\nthe knowledge in any domain. Furthermore, researchers should write programs\nthat produce proofs of the kind that human mathematicians write (and publish);\nthis means proofs that might sometimes have mistakes; and this means making\ninferences that are sometimes invalid.\n  This approach is meant to contrast with the historically dominant \"bottom up\"\napproach: coding fundamental types (typically sets), axioms and rules for\n(valid) inference, and building up from this foundation to the theorems of\nmathematical practice and to their outstanding questions. It is an important\nfact that the actual proofs that mathematicians publish in math journals do not\nlook like the formalized proofs of Russell & Whitehead's Principia Mathematica\n(or modern computer systems like Lean that automate some of this\nformalization). We believe some \"lack of rigor\" (in mathematical practice) is\nhuman-like, and can and should be leveraged for ATP.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:03:40 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 08:17:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Larson","C. E.",""],["Van Cleemput","N.",""]]}
{"id":"2308.02541","submitter":"Nicolo' Brandizzi","authors":"Nicolo' Brandizzi","title":"Towards More Human-like AI Communication: A Review of Emergent\n  Communication Research","comments":"25 pages, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.HC cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the recent shift towards human-centric AI, the need for machines to\naccurately use natural language has become increasingly important. While a\ncommon approach to achieve this is to train large language models, this method\npresents a form of learning misalignment where the model may not capture the\nunderlying structure and reasoning humans employ in using natural language,\npotentially leading to unexpected or unreliable behavior. Emergent\ncommunication (Emecom) is a field of research that has seen a growing number of\npublications in recent years, aiming to develop artificial agents capable of\nusing natural language in a way that goes beyond simple discriminative tasks\nand can effectively communicate and learn new concepts. In this review, we\npresent Emecom under two aspects. Firstly, we delineate all the common\nproprieties we find across the literature and how they relate to human\ninteractions. Secondly, we identify two subcategories and highlight their\ncharacteristics and open challenges. We encourage researchers to work together\nby demonstrating that different methods can be viewed as diverse solutions to a\ncommon problem and emphasize the importance of including diverse perspectives\nand expertise in the field. We believe a deeper understanding of human\ncommunication is crucial to developing machines that can accurately use natural\nlanguage in human-machine interactions.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 14:43:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Brandizzi","Nicolo'",""]]}
{"id":"2308.02542","submitter":"Marc Serramia","authors":"Marc Serramia, Natalia Criado, Michael Luck","title":"Collaborative filtering to capture AI user's preferences as norms","comments":"Accepted manuscript at the 24th International Conference on\n  Principles and Practice of Multi-Agent Systems (PRIMA 2022)","journal-ref":null,"doi":"10.1007/978-3-031-21203-1_45","report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Customising AI technologies to each user's preferences is fundamental to them\nfunctioning well. Unfortunately, current methods require too much user\ninvolvement and fail to capture their true preferences. In fact, to avoid the\nnuisance of manually setting preferences, users usually accept the default\nsettings even if these do not conform to their true preferences. Norms can be\nuseful to regulate behaviour and ensure it adheres to user preferences but,\nwhile the literature has thoroughly studied norms, most proposals take a formal\nperspective. Indeed, while there has been some research on constructing norms\nto capture a user's privacy preferences, these methods rely on domain knowledge\nwhich, in the case of AI technologies, is difficult to obtain and maintain. We\nargue that a new perspective is required when constructing norms, which is to\nexploit the large amount of preference information readily available from whole\nsystems of users. Inspired by recommender systems, we believe that\ncollaborative filtering can offer a suitable approach to identifying a user's\nnorm preferences without excessive user involvement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:14:23 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 20:55:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Serramia","Marc",""],["Criado","Natalia",""],["Luck","Michael",""]]}
{"id":"2308.02543","submitter":"Jaime Hoefken Zink","authors":"Asli M. Abdullahi, Jaime Hoefken Zink, Matheus Hostert, Daniele\n  Massaro, Silvia Pascoli","title":"A panorama of new-physics explanations to the MiniBooNE excess","comments":"35 pages, 21 figures","journal-ref":null,"doi":null,"report-no":"IRMP-CP3-23-41","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The MiniBooNE low-energy excess stands as an unexplained anomaly in\nshort-baseline neutrino oscillation experiments. It has been shown that it can\nbe explained in the context of dark sector models. Here, we provide an overview\nof the possible new-physics solutions based on electron, photon, and dilepton\nfinal states. We systematically discuss the various production mechanisms for\ndark particles in neutrino-nucleus scattering. Our main result is a\ncomprehensive fit to the MiniBooNE energy spectrum in the parameter space of\ndark neutrino models, where short-lived heavy neutral leptons are produced in\nneutrino interactions and decay to $e^+e^-$ pairs inside the detector. For the\nfirst time, other experiments will be able to directly confirm or rule out dark\nneutrino interpretations of the MiniBooNE low-energy excess.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:32:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Abdullahi","Asli M.",""],["Zink","Jaime Hoefken",""],["Hostert","Matheus",""],["Massaro","Daniele",""],["Pascoli","Silvia",""]]}
{"id":"2308.02544","submitter":"Ralph Kenna","authors":"Ralph Kenna, Chris Thompson, Isolde \\'O Brolch\\'ain Carmody, Benjamin\n  Dwyer, Daniel Curley, Mike McCarthy, Nicola Bowes, P\\'adraig MacCarron,\n  Thierry Platini and Joseph Yose","title":"The extraordinary story of Sinann -- the inspirational figure who gave\n  her name to Ireland longest river -- and how she arose Ireland's resilient\n  female icons","comments":"This outreach paper is aimed at a general readership. Its\n  network-science basis is in an appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When local authorities recently selected a neoclassical male \"river god head\"\nof colonial origin to represent Ireland's longest river, it was welcomed as\n\"harking back to Irish mythology\". The council, local historians and townsfolk\nwere unaware that in Irish mythology the figure associated with the river is a\nwoman -- not a man. Her name is Sinann, and she had been written out of\nIreland's national iconography after centuries of colonial destruction of\nGaelic heritage. When mathematical investigation into Irish mythology brought\nSinann's story to the people via local media, reaction was immediate. Street\nperformances in support of Sinann were backed by letters in newspapers and a\npetition signed by hundreds of people demanding education about their heritage\n- and respect for women. How did this happen and what is the story behind\nSinann, her diminution, and her rising? Here we recount how modern-day\nmathematics exposed the colonial imposter as stemming from the Ossianic\ncontroversy 250 years ago. We also discuss how a Victorian-era translation of\nher story from the original Irish turned what was an inspirational creation\nmyth into a tale of a disobedient girl seeking knowledge to which she had no\nentitlement. This flawed narrative entered the public domain -- in\nencyclopaedias, on websites, and even in academic literature. Here we cast off\ncolonial baggage to present a new, more accurate translation of Sinann's story\nalongside a new interpretation -- more amenable to a receptive public seeking\nenlightenment. Inspired by Sinann's rising, we also use artistic measures to\ninvoke other Irish resilient female icons to rise up and take their rightful\nplace in Irish iconography.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:15:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kenna","Ralph",""],["Thompson","Chris",""],["Carmody","Isolde \u00d3 Brolch\u00e1in",""],["Dwyer","Benjamin",""],["Curley","Daniel",""],["McCarthy","Mike",""],["Bowes","Nicola",""],["MacCarron","P\u00e1draig",""],["Platini","Thierry",""],["Yose","Joseph",""]]}
{"id":"2308.02545","submitter":"Matteo Fisicaro","authors":"M. Fisicaro, M.J. Rost, M. Witlox, H. van der Meer, W. L\\\"offler","title":"Open-access microcavities: high stability without dedicated mechanical\n  low-pass filter in closed-cycle cryostats","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.app-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open-access optical microcavities are Fabry-Perot type cavities consisting of\ntwo micrometer-size mirrors, separated by an air (or vacuum) gap typically of a\nfew micrometers. Compared to integrated microcavities, this configuration is\nmore flexible as the relative position of the two mirrors can be tuned,\nallowing to change on demand parameters such as cavity length and mode volume,\nand to select specific transverse cavity modes. These advantages come at the\nexpense of mechanical stability of the cavity itself, which is particularly\nrelevant in noisy closed-cycle cryostats. Here we show an open-access optical\nmicrocavity based on scanning-probe microscope design principles. When operated\nat 4 K in a tabletop optical closed-cycle cryostat without any dedicated\nlow-pass filter, we obtain stabilities of 5.7 and 10.6 pm rms in the quiet and\nfull period of the cryocooler cycle, respectively. Our device has free-space\noptical access, essential for instance for full polarization control.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 16:41:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fisicaro","M.",""],["Rost","M. J.",""],["Witlox","M.",""],["van der Meer","H.",""],["L\u00f6ffler","W.",""]]}
{"id":"2308.02546","submitter":"Katherine Moore","authors":"Katherine E. Moore","title":"Mathematical Foundations of Data Cohesion","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data cohesion, a recently introduced measure inspired by social interactions,\nuses distance comparisons to assess relative proximity. In this work, we\nprovide a collection of results which can guide the development of\ncohesion-based methods in exploratory data analysis and human-aided\ncomputation. Here, we observe the important role of highly clustered\n\"point-like\" sets and the ways in which cohesion allows such sets to take on\nqualities of a single weighted point. In doing so, we see how cohesion\ncomplements metric-adjacent measures of dissimilarity and responds to local\ndensity. We conclude by proving that cohesion is the unique function with (i)\naverage value equal to one-half and (ii) the property that the influence of an\noutlier is proportional to its mass. Properties of cohesion are illustrated\nwith examples throughout.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 17:53:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moore","Katherine E.",""]]}
{"id":"2308.02547","submitter":"Marcel Franz","authors":"Hrishikesh Patel, Vedangi Pathak, Oguzhan Can, Andrew C. Potter,\n  Marcel Franz","title":"$d$-mon: transmon with strong anharmonicity","comments":"4 pages main text + 6 pages SM; V2: corrected typos and updated\n  references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel qubit architecture based on a planar $c$-axis Josephson\njunction between a thin flake $d$-wave superconductor ($d$SC), such as a\nhigh-$T_c$ cuprate Bi$_2$Sr$_2$CaCu$_2$O$_{8+x}$, and a conventional $s$-wave\nsuperconductor. When operated in the transmon regime the device -- that we call\n\"$d$-mon\" -- becomes insensitive to offset charge fluctuations and,\nimportantly, exhibits at the same time energy level spectrum with strong\nanharmonicity that is widely tunable through the device geometry and applied\nmagnetic flux. Crucially, unlike previous qubit designs based on $d$-wave\nsuperconductors the proposed device operates in a regime where quasiparticles\nare fully gapped and can be therefore expected to achieve long coherence times.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:00:04 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 20:33:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Patel","Hrishikesh",""],["Pathak","Vedangi",""],["Can","Oguzhan",""],["Potter","Andrew C.",""],["Franz","Marcel",""]]}
{"id":"2308.02548","submitter":"Mohammed Alaydaa","authors":"Mohammed Saad M Alaydaa, Jun Li, Karl Jinkins","title":"Aspect based sentimental analysis for travellers' reviews","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Airport service quality evaluation is commonly found on social media,\nincluding Google Maps. This valuable for airport management in order to enhance\nthe quality of services provided. However; prior studies either provide general\nreview for topics discussed by travellers or provide sentimental value to tag\nthe entire review without specifically mentioning the airport service that is\nbehind such value. Accordingly, this work proposes using aspect based\nsentimental analysis in order to provide more detailed analysis for travellers\nreviews. This works applied aspect based sentimental analysis on data collected\nfrom Google Map about Dubai and Doha airports. The results provide tangible\nreasons to use aspect based sentimental analysis in order to understand more\nthe travellers and spot airport services that are in need for improvement.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 21:23:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Alaydaa","Mohammed Saad M",""],["Li","Jun",""],["Jinkins","Karl",""]]}
{"id":"2308.02549","submitter":"James Sinclair","authors":"James A. Sinclair and Robert West and John M. Barbara and Chihiro Tao\n  and Glenn S. Orton and Thomas K. Greathouse and Rohini S. Giles and Denis\n  Grodent and Leigh N. Fletcher and Patrick G. J. Irwin","title":"Long term variability of Jupiter's northern auroral 8-micron CH4\n  emissions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present a study of the long term variability of Jupiter's mid-infrared\nauroral CH4 emissions. 7.7 - 7.9 micron images of Jupiter recorded by\nEarth-based telescopes over the last three decades were collated in order to\nquantify the magnitude and timescales over which the northern auroral hotspot's\nCH4 emissions varies. We find that the ratio of the radiance of the poleward\nnorthern auroral emissions to a lower-latitude zonal mean, henceforth 'Relative\nPoleward Radiance' or RPR, exhibits a 37% variability over a range of\ntimescales. We searched for patterns of variability in order to test whether\nseasonally-varying solar insolation, the 11-year solar cycle, or short-term\nsolar wind variability at Jupiter's magnetopause could explain the observed\nevolution. The variability of the RPR exhibits a weak (r < 0.2) correlation\nwith the solar insolation received at Jupiter's high-northern latitudes. This\nrules out the hypothesis suggested in previous work (e.g. Sinclair et al.,\n2017a) that shortwave solar heating of aurorally-produced haze particles is the\ndominant heating mechanism in the lower stratosphere. We also find the\nvariability exhibits negligible (r < 0.18) correlation with the monthly-mean\nsunspot number, which rules out variability associated with the solar cycle. On\nshorter timescales, we find moderate correlations of the RPR with solar wind\nconditions at Jupiter in the preceding days before images were recorded. For\nexample, we find correlations of r = 0.45 and r = 0.51 of the RPR with the mean\nand standard deviation on the solar wind dynamical pressure in the preceding 7\ndays. The moderate correlation suggests that either: 1) only a subset of solar\nwind compressions lead to brighter, poleward, CH4 emissions and/or 2) a subset\nof CH4 emission brightening events are driven by internal magnetospheric and\nindependent of the solar wind.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:15:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sinclair","James A.",""],["West","Robert",""],["Barbara","John M.",""],["Tao","Chihiro",""],["Orton","Glenn S.",""],["Greathouse","Thomas K.",""],["Giles","Rohini S.",""],["Grodent","Denis",""],["Fletcher","Leigh N.",""],["Irwin","Patrick G. J.",""]]}
{"id":"2308.02550","submitter":"C. E. Powell","authors":"C.E. Powell, Christopher S. Ruf, Scott Gleason, Scot C.R. Rafkin","title":"Sampled Together: Assessing the Value of Simultaneous Co-located\n  Measurements","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph physics.geo-ph physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work applies a quantitative metric well-known to the data assimilation\ncommunity to a new context in order to capture the relative representativeness\nof non-simultaneous or non-co-located observations and quantify how these\nobservations decorrelate in both space and time. This methodology allows for\nthe effective determination of thresholding decisions for representative\nmatchup conditions, and is especially useful for informing future network\ndesigns and architectures. Future weather and climate satellite missions must\nconsider a range of architectural trades to meet observing requirements.\nFrequently, fundamental decisions such as the number of observatories, the\ninstruments manifested, and orbit parameters are determined based upon\nassumptions about the characteristic temporal and spatial scales of variability\nof the target observation. With the introduced methodology, representativity\nerrors due to separations in space and time can be quantified without prior\nknowledge of instrument performance, and errors driven by constellation design\ncan be estimated without model ingest or analysis.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 23:43:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Powell","C. E.",""],["Ruf","Christopher S.",""],["Gleason","Scott",""],["Rafkin","Scot C. R.",""]]}
{"id":"2308.02551","submitter":"Dr Ravi Dwivedi","authors":"Ravi Dwivedi","title":"On the matrix $q$-Kummer equation and its solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the present paper, a general theory for the second-order matrix difference\nequation of bilateral type is discussed. We introduced the matrix $q$-Kummer\nequation of bilateral type and presented the $q$-Kummer matrix function as a\nseries solution. Later, we obtain the integral solutions of this Kummer\nequation and solution at $\\infty$. We also give a brief idea about the matrix\nGauss difference equation of bilateral type and its solutions.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:27:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dwivedi","Ravi",""]]}
{"id":"2308.02552","submitter":"Zixuan Ni","authors":"Zixuan Ni, Longhui Wei, Jiacheng Li, Siliang Tang, Yueting Zhuang, Qi\n  Tian","title":"Degeneration-Tuning: Using Scrambled Grid shield Unwanted Concepts from\n  Stable Diffusion","comments":null,"journal-ref":"ACM MM 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Owing to the unrestricted nature of the content in the training data, large\ntext-to-image diffusion models, such as Stable Diffusion (SD), are capable of\ngenerating images with potentially copyrighted or dangerous content based on\ncorresponding textual concepts information. This includes specific intellectual\nproperty (IP), human faces, and various artistic styles. However, Negative\nPrompt, a widely used method for content removal, frequently fails to conceal\nthis content due to inherent limitations in its inference logic. In this work,\nwe propose a novel strategy named \\textbf{Degeneration-Tuning (DT)} to shield\ncontents of unwanted concepts from SD weights. By utilizing Scrambled Grid to\nreconstruct the correlation between undesired concepts and their corresponding\nimage domain, we guide SD to generate meaningless content when such textual\nconcepts are provided as input. As this adaptation occurs at the level of the\nmodel's weights, the SD, after DT, can be grafted onto other conditional\ndiffusion frameworks like ControlNet to shield unwanted concepts. In addition\nto qualitatively showcasing the effectiveness of our DT method in protecting\nvarious types of concepts, a quantitative comparison of the SD before and after\nDT indicates that the DT method does not significantly impact the generative\nquality of other contents. The FID and IS scores of the model on COCO-30K\nexhibit only minor changes after DT, shifting from 12.61 and 39.20 to 13.04 and\n38.25, respectively, which clearly outperforms the previous methods.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:34:44 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:30:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ni","Zixuan",""],["Wei","Longhui",""],["Li","Jiacheng",""],["Tang","Siliang",""],["Zhuang","Yueting",""],["Tian","Qi",""]]}
{"id":"2308.02553","submitter":"Ishmeet Kaur","authors":"Ishmeet Kaur and Adwaita Janardhan Jadhav","title":"Survey on Computer Vision Techniques for Internet-of-Things Devices","comments":"Accepted and presented at THE IEEE INTERNATIONAL CONFERENCE ON\n  INDUSTRY 4.0, ARTIFICIAL INTELLIGENCE, AND COMMUNICATIONS TECHNOLOGY","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks (DNNs) are state-of-the-art techniques for solving most\ncomputer vision problems. DNNs require billions of parameters and operations to\nachieve state-of-the-art results. This requirement makes DNNs extremely\ncompute, memory, and energy-hungry, and consequently difficult to deploy on\nsmall battery-powered Internet-of-Things (IoT) devices with limited computing\nresources. Deployment of DNNs on Internet-of-Things devices, such as traffic\ncameras, can improve public safety by enabling applications such as automatic\naccident detection and emergency response.Through this paper, we survey the\nrecent advances in low-power and energy-efficient DNN implementations that\nimprove the deployability of DNNs without significantly sacrificing accuracy.\nIn general, these techniques either reduce the memory requirements, the number\nof arithmetic operations, or both. The techniques can be divided into three\nmajor categories: neural network compression, network architecture search and\ndesign, and compiler and graph optimizations. In this paper, we survey both\nlow-power techniques for both convolutional and transformer DNNs, and summarize\nthe advantages, disadvantages, and open research problems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 03:41:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kaur","Ishmeet",""],["Jadhav","Adwaita Janardhan",""]]}
{"id":"2308.02554","submitter":"Khaza Anuarul Hoque","authors":"Ernest Bonnah, Luan Viet Nguyen, Khaza Anuarul Hoque","title":"Model Checking Time Window Temporal Logic for Hyperproperties","comments":"Accepted for publication in MEMOCODE 2023","journal-ref":null,"doi":"10.1145/3610579.3611077","report-no":null,"categories":"cs.LO cs.FL cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Hyperproperties extend trace properties to express properties of sets of\ntraces, and they are increasingly popular in specifying various security and\nperformance-related properties in domains such as cyber-physical systems, smart\ngrids, and automotive. This paper introduces a model checking algorithm for a\nnew formalism, HyperTWTL, which extends Time Window Temporal Logic (TWTL) -- a\ndomain-specific formal specification language for robotics, by allowing\nexplicit and simultaneous quantification over multiple execution traces. We\npresent HyperTWTL with both \\emph{synchronous} and \\emph{asynchronous}\nsemantics, based on the alignment of the timestamps in the traces.\nConsequently, we demonstrate the application of HyperTWTL in formalizing\nimportant information-flow security policies and concurrency for robotics\napplications. Finally, we propose a model checking algorithm for verifying\nfragments of HyperTWTL by reducing the problem to a TWTL model checking\nproblem.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 05:54:41 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 16:00:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bonnah","Ernest",""],["Nguyen","Luan Viet",""],["Hoque","Khaza Anuarul",""]]}
{"id":"2308.02555","submitter":"Wei Zhang","authors":"Quanxiu Wang, Xinlei Cao, Jianyong Wang, Wei Zhang","title":"Knowledge-aware Collaborative Filtering with Pre-trained Language Model\n  for Personalized Review-based Rating Prediction","comments":"13 pages, accepted by IEEE TKDE","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Personalized review-based rating prediction aims at leveraging existing\nreviews to model user interests and item characteristics for rating prediction.\nMost of the existing studies mainly encounter two issues. First, the rich\nknowledge contained in the fine-grained aspects of each review and the\nknowledge graph is rarely considered to complement the pure text for better\nmodeling user-item interactions. Second, the power of pre-trained language\nmodels is not carefully studied for personalized review-based rating\nprediction. To address these issues, we propose an approach named\nKnowledge-aware Collaborative Filtering with Pre-trained Language Model\n(KCF-PLM). For the first issue, to utilize rich knowledge, KCF-PLM develops a\ntransformer network to model the interactions of the extracted aspects w.r.t. a\nuser-item pair. For the second issue, to better represent users and items,\nKCF-PLM takes all the historical reviews of a user or an item as input to\npre-trained language models. Moreover, KCF-PLM integrates the transformer\nnetwork and the pre-trained language models through representation propagation\non the knowledge graph and user-item guided attention of the aspect\nrepresentations. Thus KCF-PLM combines review text, aspect, knowledge graph,\nand pre-trained language models together for review-based rating prediction. We\nconduct comprehensive experiments on several public datasets, demonstrating the\neffectiveness of KCF-PLM.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 07:28:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Quanxiu",""],["Cao","Xinlei",""],["Wang","Jianyong",""],["Zhang","Wei",""]]}
{"id":"2308.02556","submitter":"Susan Leavy Dr","authors":"Susan Leavy, Emilie Pine and Mark T Keane","title":"Industrial Memories: Exploring the Findings of Government Inquiries with\n  Neural Word Embedding and Machine Learning","comments":"Machine Learning and Knowledge Discovery in Databases. ECML PKDD\n  2018. Lecture Notes in Computer Science","journal-ref":"ECML PKDD 2018. Lecture Notes in Computer Science(), vol 11053.\n  Springer, Cham","doi":"10.1007/978-3-030-10997-4_52","report-no":null,"categories":"cs.CL cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a text mining system to support the exploration of large volumes\nof text detailing the findings of government inquiries. Despite their\nhistorical significance and potential societal impact, key findings of\ninquiries are often hidden within lengthy documents and remain inaccessible to\nthe general public. We transform the findings of the Irish government's inquiry\ninto industrial schools and through the use of word embedding, text\nclassification and visualisation, present an interactive web-based platform\nthat enables the exploration of the text to uncover new historical insights.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:39:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Leavy","Susan",""],["Pine","Emilie",""],["Keane","Mark T",""]]}
{"id":"2308.02557","submitter":"Duzhen Zhang","authors":"Qingyu Wang, Duzhen Zhang, Tielin Zhang, Bo Xu","title":"Attention-free Spikformer: Mixing Spike Sequences with Simple Linear\n  Transforms","comments":"Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By integrating the self-attention capability and the biological properties of\nSpiking Neural Networks (SNNs), Spikformer applies the flourishing Transformer\narchitecture to SNNs design. It introduces a Spiking Self-Attention (SSA)\nmodule to mix sparse visual features using spike-form Query, Key, and Value,\nresulting in the State-Of-The-Art (SOTA) performance on numerous datasets\ncompared to previous SNN-like frameworks. In this paper, we demonstrate that\nthe Spikformer architecture can be accelerated by replacing the SSA with an\nunparameterized Linear Transform (LT) such as Fourier and Wavelet transforms.\nThese transforms are utilized to mix spike sequences, reducing the quadratic\ntime complexity to log-linear time complexity. They alternate between the\nfrequency and time domains to extract sparse visual features, showcasing\npowerful performance and efficiency. We conduct extensive experiments on image\nclassification using both neuromorphic and static datasets. The results\nindicate that compared to the SOTA Spikformer with SSA, Spikformer with LT\nachieves higher Top-1 accuracy on neuromorphic datasets (i.e., CIFAR10-DVS and\nDVS128 Gesture) and comparable Top-1 accuracy on static datasets (i.e.,\nCIFAR-10 and CIFAR-100). Furthermore, Spikformer with LT achieves approximately\n29-51% improvement in training speed, 61-70% improvement in inference speed,\nand reduces memory usage by 4-26% due to not requiring learnable parameters.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:41:54 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 06:12:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Qingyu",""],["Zhang","Duzhen",""],["Zhang","Tielin",""],["Xu","Bo",""]]}
{"id":"2308.02558","submitter":"Vasant Dhar","authors":"Vasant Dhar","title":"The Paradigm Shifts in Artificial Intelligence","comments":"14 pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kuhn's framework of scientific progress (Kuhn, 1962) provides a useful\nframing of the paradigm shifts that have occurred in Artificial Intelligence\nover the last 60 years. The framework is also useful in understanding what is\narguably a new paradigm shift in AI, signaled by the emergence of large\npre-trained systems such as GPT-3, on which conversational agents such as\nChatGPT are based. Such systems make intelligence a commoditized general\npurpose technology that is configurable to applications. In this paper, I\nsummarize the forces that led to the rise and fall of each paradigm, and\ndiscuss the pressing issues and risks associated with the current paradigm\nshift in AI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 19:38:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dhar","Vasant",""]]}
{"id":"2308.02559","submitter":"Eric Roberts","authors":"Eric J Roberts, Tanny Chavez, Alexander Hexemer, Petrus H. Zwart","title":"DLSIA: Deep Learning for Scientific Image Analysis","comments":"10 pages, two column, 9 figures, 1 Supplementary section","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce DLSIA (Deep Learning for Scientific Image Analysis), a\nPython-based machine learning library that empowers scientists and researchers\nacross diverse scientific domains with a range of customizable convolutional\nneural network (CNN) architectures for a wide variety of tasks in image\nanalysis to be used in downstream data processing, or for\nexperiment-in-the-loop computing scenarios. DLSIA features easy-to-use\narchitectures such as autoencoders, tunable U-Nets, and parameter-lean\nmixed-scale dense networks (MSDNets). Additionally, we introduce sparse\nmixed-scale networks (SMSNets), generated using random graphs and sparse\nconnections. As experimental data continues to grow in scale and complexity,\nDLSIA provides accessible CNN construction and abstracts CNN complexities,\nallowing scientists to tailor their machine learning approaches, accelerate\ndiscoveries, foster interdisciplinary collaboration, and advance research in\nscientific image analysis.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 21:32:41 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 18:03:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Roberts","Eric J",""],["Chavez","Tanny",""],["Hexemer","Alexander",""],["Zwart","Petrus H.",""]]}
{"id":"2308.02560","submitter":"Robin San Roman","authors":"Robin San Roman and Yossi Adi and Antoine Deleforge and Romain Serizel\n  and Gabriel Synnaeve and Alexandre D\\'efossez","title":"From Discrete Tokens to High-Fidelity Audio Using Multi-Band Diffusion","comments":"10 pages","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":"  Deep generative models can generate high-fidelity audio conditioned on\nvarious types of representations (e.g., mel-spectrograms, Mel-frequency\nCepstral Coefficients (MFCC)). Recently, such models have been used to\nsynthesize audio waveforms conditioned on highly compressed representations.\nAlthough such methods produce impressive results, they are prone to generate\naudible artifacts when the conditioning is flawed or imperfect. An alternative\nmodeling approach is to use diffusion models. However, these have mainly been\nused as speech vocoders (i.e., conditioned on mel-spectrograms) or generating\nrelatively low sampling rate signals. In this work, we propose a high-fidelity\nmulti-band diffusion-based framework that generates any type of audio modality\n(e.g., speech, music, environmental sounds) from low-bitrate discrete\nrepresentations. At equal bit rate, the proposed approach outperforms\nstate-of-the-art generative techniques in terms of perceptual quality. Training\nand, evaluation code, along with audio samples, are available on the\nfacebookresearch/audiocraft Github page.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:14:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Roman","Robin San",""],["Adi","Yossi",""],["Deleforge","Antoine",""],["Serizel","Romain",""],["Synnaeve","Gabriel",""],["D\u00e9fossez","Alexandre",""]]}
{"id":"2308.02561","submitter":"Qi Wang","authors":"Qi Wang, Yanghe Feng, Jincai Huang, Yiqin Lv, Zheng Xie, Xiaoshan Gao","title":"Large-scale Generative Simulation Artificial Intelligence: the Next\n  Hotspot in Generative AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The concept of GenAI has been developed for decades. Until recently, it has\nimpressed us with substantial breakthroughs in natural language processing and\ncomputer vision, actively engaging in industrial scenarios. Noticing the\npractical challenges, e.g., limited learning resources, and overly dependencies\non scientific discovery empiricism, we nominate large-scale generative\nsimulation artificial intelligence (LS-GenAI) as the next hotspot for GenAI to\nconnect.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 02:04:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Qi",""],["Feng","Yanghe",""],["Huang","Jincai",""],["Lv","Yiqin",""],["Xie","Zheng",""],["Gao","Xiaoshan",""]]}
{"id":"2308.02562","submitter":"Prateek Mittal","authors":"Prateek Mittal, Puneet Goyal, Joohi Chauhan","title":"Food Classification using Joint Representation of Visual and Textual\n  Data","comments":"Updated results and discussions to be posted and some sections needed\n  to be expanded","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CY cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Food classification is an important task in health care. In this work, we\npropose a multimodal classification framework that uses the modified version of\nEfficientNet with the Mish activation function for image classification, and\nthe traditional BERT transformer-based network is used for text classification.\nThe proposed network and the other state-of-the-art methods are evaluated on a\nlarge open-source dataset, UPMC Food-101. The experimental results show that\nthe proposed network outperforms the other methods, a significant difference of\n11.57% and 6.34% in accuracy is observed for image and text classification,\nrespectively, when compared with the second-best performing method. We also\ncompared the performance in terms of accuracy, precision, and recall for text\nclassification using both machine learning and deep learning-based models. The\ncomparative analysis from the prediction results of both images and text\ndemonstrated the efficiency and robustness of the proposed approach.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:03:46 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 11:47:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mittal","Prateek",""],["Goyal","Puneet",""],["Chauhan","Joohi",""]]}
{"id":"2308.02563","submitter":"Yudai Shigekawa Dr.","authors":"Yudai Shigekawa, Xiaojie Yin, Akihiro Nambu, Yang Wang, Hiromitsu Haba","title":"Production and chemical separation of $^{229}$Pa toward observation of\n  ${\\gamma}$ rays of $^{229\\rm{m}}$Th","comments":null,"journal-ref":"J. Radioanal. Nucl. Chem. (2023). 10.1007/s10967-023-09069-y","doi":"10.1007/s10967-023-09069-y","report-no":null,"categories":"physics.ins-det nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To observe the ${\\gamma}$ rays emitted from the low-lying isomeric state of\n$^{229}$Th ($^{229\\rm{m}}$Th), we aim to dope fluoride crystals with its\nprecursor $^{229}$Pa. In this study, we produced $^{229}$Pa by a 30-MeV proton\nbombardment on $^{232}$Th and developed a chemical separation method. The\nchemical yield of Pa was 93(4)%, and the physical production yield of\n$^{229}$Pa for the proton energy range of 29.0${-}$30.1 MeV was measured to be\n9.4(8) MBq/${\\rm{\\mu}}$Ah, which was more than 10 times higher than those of\n$^{232,230,228,233}$Pa. These high chemical and production yields will allow us\nto prepare fluoride crystals having a sufficient amount of $^{229}$Pa for the\nobservation of the ${\\gamma}$ rays of $^{229\\rm{m}}$Th.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 04:57:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shigekawa","Yudai",""],["Yin","Xiaojie",""],["Nambu","Akihiro",""],["Wang","Yang",""],["Haba","Hiromitsu",""]]}
{"id":"2308.02564","submitter":"Omar Rosario Cayetano","authors":"Ludwin A. Hern\\'andez, Jes\\'us Lea\\~nos, Omar Rosario, Jos\\'e M.\n  Sigarreta","title":"The differential on Graph Operator R(G)","comments":"arXiv admin note: text overlap with arXiv:2106.09829 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G=(V(G), E(G))$ be a simple graph with vertex set $V(G)$ and edge set\n$E(G)$. Let $S$ be a subset of $V(G)$, and let $B(S)$ be the set of neighbours\nof $S$ in $V(G) \\setminus S$. The differential $\\partial(S)$ of $S$ is the\nnumber $|B(S)|-|S|$. The maximum value of $\\partial(S)$ taken over all subsets\n$S\\subseteq V(G)$ is the differential $\\partial(G)$ of $G$. The graph $R{G}$ is\ndefined as the graph obtained from $G$ by adding a new vertex $v_e$ for each\n$e\\in E(G)$, and by joining $v_e$ to the end vertices of $e$. In this paper we\nstudy the relationship between $\\partial(G)$ and $\\partial(R(G))$, and give\ntight asymptotic bounds for $\\partial(R(G))$. We also exhibit some\nrelationships between certain vertex sets of $G$ and $R(G)$ which involve well\nknown graph theoretical parameters.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:39:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hern\u00e1ndez","Ludwin A.",""],["Lea\u00f1os","Jes\u00fas",""],["Rosario","Omar",""],["Sigarreta","Jos\u00e9 M.",""]]}
{"id":"2308.02565","submitter":"Keyu Duan","authors":"Keyu Duan, Qian Liu, Tat-Seng Chua, Shuicheng Yan, Wei Tsang Ooi,\n  Qizhe Xie, Junxian He","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Textual graphs (TGs) are graphs whose nodes correspond to text (sentences or\ndocuments), which are widely prevalent. The representation learning of TGs\ninvolves two stages: (i) unsupervised feature extraction and (ii) supervised\ngraph representation learning. In recent years, extensive efforts have been\ndevoted to the latter stage, where Graph Neural Networks (GNNs) have dominated.\nHowever, the former stage for most existing graph benchmarks still relies on\ntraditional feature engineering techniques. More recently, with the rapid\ndevelopment of language models (LMs), researchers have focused on leveraging\nLMs to facilitate the learning of TGs, either by jointly training them in a\ncomputationally intensive framework (merging the two stages), or designing\ncomplex self-supervised training tasks for feature extraction (enhancing the\nfirst stage). In this work, we present SimTeG, a frustratingly Simple approach\nfor Textual Graph learning that does not innovate in frameworks, models, and\ntasks. Instead, we first perform supervised parameter-efficient fine-tuning\n(PEFT) on a pre-trained LM on the downstream task, such as node classification.\nWe then generate node embeddings using the last hidden states of finetuned LM.\nThese derived features can be further utilized by any GNN for training on the\nsame task. We evaluate our approach on two fundamental graph representation\nlearning tasks: node classification and link prediction. Through extensive\nexperiments, we show that our approach significantly improves the performance\nof various GNNs on multiple graph benchmarks.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:00:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Duan","Keyu",""],["Liu","Qian",""],["Chua","Tat-Seng",""],["Yan","Shuicheng",""],["Ooi","Wei Tsang",""],["Xie","Qizhe",""],["He","Junxian",""]]}
{"id":"2308.02566","submitter":"Zeeshan Gul","authors":"M. Sharif and M. Zeeshan Gul","title":"Stellar Structures admitting Noether Symmetries in\n  $f(\\mathcal{R},\\mathcal{T})$ Gravity","comments":"22 pages, 10 figures","journal-ref":"Mod. Phys. Lett. A 36(2021)2150214","doi":"10.1142/S021773232150214X","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates the geometry of compact stellar objects via Noether\nsymmetry strategy in the framework of curvature-matter coupled gravity. For\nthis purpose, we assume the specific model of this theory to evaluate Noether\nequations, symmetry generators and corresponding conserved parameters. We use\nconserved parameters to examine some fascinating attributes of the compact\nobjects for suitable values of the model parameters. It is analyzed that\ncompact objects in this theory depend on the conserved quantities and model\nparameters. We find that the obtained solutions provide the viability of this\nprocess as they are compatible with the astrophysical data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:12:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sharif","M.",""],["Gul","M. Zeeshan",""]]}
{"id":"2308.02567","submitter":"Ofir David","authors":"Ofir David","title":"Introduction to polynomial continued fractions","comments":"arXiv admin note: substantial text overlap with arXiv:2303.09318","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The simple continued fraction expansion is a basic and powerful tool in\nnumber theory. However, finding the actual coefficients in the expansion is\nusually quite hard, since we need to compute each coefficient one after the\nother using the generalized Euclidean division algorithm. In this note we\nintroduce the polynomial continued fraction expansion, which while lacks some\nof the interesting properties the simple continued fraction expansions have, in\nreturn we gain much simpler formulas and easier computation which lead by\nthemselves to other interesting results.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 07:47:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["David","Ofir",""]]}
{"id":"2308.02568","submitter":"Juan Manuel Rodriguez","authors":"Juan Manuel Rodriguez and Antonela Tommasel","title":"Weighted Multi-Level Feature Factorization for App ads CTR and\n  installation prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper provides an overview of the approach we used as team ISISTANITOS\nfor the ACM RecSys Challenge 2023. The competition was organized by ShareChat,\nand involved predicting the probability of a user clicking an app ad and/or\ninstalling an app, to improve deep funnel optimization and a special focus on\nuser privacy. Our proposed method inferring the probabilities of clicking and\ninstalling as two different, but related tasks. Hence, the model engineers a\nspecific set of features for each task and a set of shared features. Our model\nis called Weighted Multi-Level Feature Factorization because it considers the\ninteraction of different order features, where the order is associated to the\ndepth in a neural network. The prediction for a given task is generated by\ncombining the task specific and shared features on the different levels. Our\nsubmission achieved the 11 rank and overall score of 55 in the competition\nacademia-track final results. We release our source code at:\nhttps://github.com/knife982000/RecSys2023Challenge\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 08:56:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rodriguez","Juan Manuel",""],["Tommasel","Antonela",""]]}
{"id":"2308.02569","submitter":"Mohammad Dehghani","authors":"Mohammad Dehghani, Behrouz Bokharaeian, Zahra Yazdanparast","title":"BioBERT Based SNP-traits Associations Extraction from Biomedical\n  Literature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Scientific literature contains a considerable amount of information that\nprovides an excellent opportunity for developing text mining methods to extract\nbiomedical relationships. An important type of information is the relationship\nbetween singular nucleotide polymorphisms (SNP) and traits. In this paper, we\npresent a BioBERT-GRU method to identify SNP- traits associations. Based on the\nevaluation of our method on the SNPPhenA dataset, it is concluded that this new\nmethod performs better than previous machine learning and deep learning based\nmethods. BioBERT-GRU achieved the result a precision of 0.883, recall of 0.882\nand F1-score of 0.881.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 09:40:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dehghani","Mohammad",""],["Bokharaeian","Behrouz",""],["Yazdanparast","Zahra",""]]}
{"id":"2308.02570","submitter":"Feng Chen","authors":"Feng Chen, Jiajia Liu, Kaixiang Ji, Wang Ren, Jian Wang, Jingdong Wang","title":"Learning Implicit Entity-object Relations by Bidirectional Generative\n  Alignment for Multimodal NER","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The challenge posed by multimodal named entity recognition (MNER) is mainly\ntwo-fold: (1) bridging the semantic gap between text and image and (2) matching\nthe entity with its associated object in image. Existing methods fail to\ncapture the implicit entity-object relations, due to the lack of corresponding\nannotation. In this paper, we propose a bidirectional generative alignment\nmethod named BGA-MNER to tackle these issues. Our BGA-MNER consists of\n\\texttt{image2text} and \\texttt{text2image} generation with respect to\nentity-salient content in two modalities. It jointly optimizes the\nbidirectional reconstruction objectives, leading to aligning the implicit\nentity-object relations under such direct and powerful constraints.\nFurthermore, image-text pairs usually contain unmatched components which are\nnoisy for generation. A stage-refined context sampler is proposed to extract\nthe matched cross-modal content for generation. Extensive experiments on two\nbenchmarks demonstrate that our method achieves state-of-the-art performance\nwithout image input during inference.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 10:37:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Feng",""],["Liu","Jiajia",""],["Ji","Kaixiang",""],["Ren","Wang",""],["Wang","Jian",""],["Wang","Jingdong",""]]}
{"id":"2308.02571","submitter":"Haoxuan Li","authors":"Haoxuan Li, Taojun Hu, Zetong Xiong, Chunyuan Zheng, Fuli Feng,\n  Xiangnan He, Xiao-Hua Zhou","title":"ADRNet: A Generalized Collaborative Filtering Framework Combining\n  Clinical and Non-Clinical Data for Adverse Drug Reaction Prediction","comments":"RecSys '23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Adverse drug reaction (ADR) prediction plays a crucial role in both health\ncare and drug discovery for reducing patient mortality and enhancing drug\nsafety. Recently, many studies have been devoted to effectively predict the\ndrug-ADRs incidence rates. However, these methods either did not effectively\nutilize non-clinical data, i.e., physical, chemical, and biological information\nabout the drug, or did little to establish a link between content-based and\npure collaborative filtering during the training phase. In this paper, we first\nformulate the prediction of multi-label ADRs as a drug-ADR collaborative\nfiltering problem, and to the best of our knowledge, this is the first work to\nprovide extensive benchmark results of previous collaborative filtering methods\non two large publicly available clinical datasets. Then, by exploiting the easy\naccessible drug characteristics from non-clinical data, we propose ADRNet, a\ngeneralized collaborative filtering framework combining clinical and\nnon-clinical data for drug-ADR prediction. Specifically, ADRNet has a shallow\ncollaborative filtering module and a deep drug representation module, which can\nexploit the high-dimensional drug descriptors to further guide the learning of\nlow-dimensional ADR latent embeddings, which incorporates both the benefits of\ncollaborative filtering and representation learning. Extensive experiments are\nconducted on two publicly available real-world drug-ADR clinical datasets and\ntwo non-clinical datasets to demonstrate the accuracy and efficiency of the\nproposed ADRNet. The code is available at\nhttps://github.com/haoxuanli-pku/ADRnet.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:28:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Haoxuan",""],["Hu","Taojun",""],["Xiong","Zetong",""],["Zheng","Chunyuan",""],["Feng","Fuli",""],["He","Xiangnan",""],["Zhou","Xiao-Hua",""]]}
{"id":"2308.02572","submitter":"Stefan Engels","authors":"Stefan Engels, Tom Peham, Judith Przigoda, Nils Przigoda, and Robert\n  Wille","title":"Design Tasks and Their Complexity for Hybrid Level 3 of the European\n  Train Control System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SY cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Railway networks have become increasingly important in recent times,\nespecially to move freight and public transportation from road traffic and\nplanes to more environmentally friendly trains. Since expanding the global\nrailway network is time and resource consuming, maximizing the rail capacity on\nthe existing infrastructure is desirable. However, simply running more trains\nis infeasible as certain constraints enforced by the train control system must\nbe satisfied. The capacity of a network depends (amongst others) on the\ndistance between trains allowed by this safety system. While most signaling\nsystems rely on fixed blocks defined by costly hardware, new specifications\nprovided by the ETCS Hybrid Level 3 (since recently also known as ETCS Level 2\nwith Hybrid Train Detection) allow the usage of virtual subsections. This\nadditional degree of freedom allows for shorter train following times and,\nthus, more trains on existing railway tracks. On the other hand, new design\ntasks arise on which automated methods might be helpful for designers of modern\nrailway networks. However, although first approaches exist that solve design\nproblems arising within ETCS Hybrid Level 3, neither formal descriptions nor\nresults on the computational complexity of the corresponding design tasks\nexist. In this paper, we fill this gap by providing a formal description of\ndesign tasks for the Hybrid Level 3 of the European Train Control System and\nproofs that these tasks are NP-complete or NP-hard, respectively. By that, we\nare providing a solid basis for the future development of methods to solve\nthose tasks, which will be integrated into the Munich Train Control Toolkit\navailable at https://github.com/cda-tum/mtct.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:44:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Engels","Stefan",""],["Peham","Tom",""],["Przigoda","Judith",""],["Przigoda","Nils",""],["Wille","Robert",""]]}
{"id":"2308.02573","submitter":"Marco Cremonini","authors":"Marco Cremonini","title":"A Critical Take on Privacy in a Datafied Society","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Privacy is an increasingly feeble constituent of the present datafied world\nand apparently the reason for that is clear: powerful actors worked to invade\neveryone's privacy for commercial and surveillance purposes. The existence of\nthose actors and their agendas is undeniable, but the explanation is overly\nsimplistic and contributed to create a narrative that tends to preserve the\nstatus quo. In this essay, I analyze several facets of the lack of online\nprivacy and idiosyncrasies exhibited by privacy advocates, together with\ncharacteristics of the industry mostly responsible for the datafication process\nand why its asserted high effectiveness should be openly inquired. Then I\ndiscuss of possible effects of datafication on human behavior, the prevalent\nmarket-oriented assumption at the base of online privacy, and some emerging\nadaptation strategies. In the last part, the regulatory approach to online\nprivacy is considered. The EU's GDPR is praised as the reference case of modern\nprivacy regulations, but the same success hinders critical aspects that also\nemerged, from the quirks of the institutional decision process, to the flaws of\nthe informed consent principle. A glimpse on the likely problematic future is\nprovided with a discussion on privacy related aspects of EU, UK, and China's\nproposed generative AI policies.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:45:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cremonini","Marco",""]]}
{"id":"2308.02574","submitter":"Riccardo Maggiore","authors":"Riccardo Maggiore, Artemiy Dmitriev, Andreas Freise and Mischa Sall\\'e","title":"Tuning of resonant doublets in coupled optical cavities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics astro-ph.IM physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The mode profile of a coupled optical cavity often exhibits a resonant\ndoublet, which arises from the strong coupling between its sub-cavities.\nTraditional readout methods rely on setting fields of different frequencies to\nbe resonant in either sub-cavity, which is challenging in the case of strong\ncoupling. In this regime, the coupled cavity behaves as a single resonator, and\na field must be resonant in all its parts. Consequently, specialized sensing\nschemes are necessary to control strongly coupled cavities. To address this\nissue, we propose a novel technique for the relative measurement of the degrees\nof freedom of a strongly coupled cavity. Our approach enables simultaneous\nfrequency stabilization and fine-tuning of frequency splitting in the resonant\ndoublet. Overall, our proposed technique offers a promising solution to control\nthe properties of coupled cavities, facilitating advanced applications in the\nfields of gravitational-wave detection, quantum cavity optomechanics, and other\nrelated areas.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:26:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Maggiore","Riccardo",""],["Dmitriev","Artemiy",""],["Freise","Andreas",""],["Sall\u00e9","Mischa",""]]}
{"id":"2308.02575","submitter":"Veronika Hackl","authors":"Veronika Hackl, Alexandra Elena M\\\"uller, Michael Granitzer,\n  Maximilian Sailer","title":"Is GPT-4 a reliable rater? Evaluating Consistency in GPT-4 Text Ratings","comments":"14 pages, 7 tables, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigates the consistency of feedback ratings generated by\nOpenAI's GPT-4, a state-of-the-art artificial intelligence language model,\nacross multiple iterations, time spans and stylistic variations. The model\nrated responses to tasks within the Higher Education (HE) subject domain of\nmacroeconomics in terms of their content and style. Statistical analysis was\nconducted in order to learn more about the interrater reliability, consistency\nof the ratings across iterations and the correlation between ratings in terms\nof content and style. The results revealed a high interrater reliability with\nICC scores ranging between 0.94 and 0.99 for different timespans, suggesting\nthat GPT-4 is capable of generating consistent ratings across repetitions with\na clear prompt. Style and content ratings show a high correlation of 0.87. When\napplying a non-adequate style the average content ratings remained constant,\nwhile style ratings decreased, which indicates that the large language model\n(LLM) effectively distinguishes between these two criteria during evaluation.\nThe prompt used in this study is furthermore presented and explained. Further\nresearch is necessary to assess the robustness and reliability of AI models in\nvarious use cases.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 12:47:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hackl","Veronika",""],["M\u00fcller","Alexandra Elena",""],["Granitzer","Michael",""],["Sailer","Maximilian",""]]}
{"id":"2308.02576","submitter":"Andrei T. Patrascu","authors":"Andrei T. Patrascu","title":"Spacetime vacuum as a correlated quantum channel, dual to gravitational\n  memory","comments":"accepted for publication in current format in International Journal\n  of Theoretical Physics","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 I will argue that the spacetime vacuum of any gauge theory plays\nthe role of a correlated quantum channel and that the concept of a correlated\nquantum channel is dual to gravitational memory. The existence of memory in the\ncase of other gauge theories is discussed and a similar duality is identified\nsuggesting that the vacuum of any theory could play such a role. This can play\na role in the resolution of the black hole information paradox.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:06:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Patrascu","Andrei T.",""]]}
{"id":"2308.02577","submitter":"Daniel Sewell","authors":"Elliot Burghardt, Daniel Sewell, Joseph Cavanaugh","title":"Identification of Parkinson's Disease Subtypes with Divisive\n  Hierarchical Bayesian Clustering for Longitudinal and Time-to-Event Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In heterogeneous disorders like Parkinson's disease (PD), differentiating the\naffected population into subgroups plays a key role in future research.\nDiscovering subgroups can lead to improved treatments through more powerful\nenrichment of clinical trials, elucidating pathogenic mechanisms, and\nidentifying biomarkers of progression and prognosis. Cluster analysis is a\ncommonly used method to identify subgroups; however, cluster analysis methods\nare typically restricted to static data or temporal data of a single variable.\nProgression of a complex disease process may be more appropriately represented\nby several longitudinal and/or time-to-event variables. Clustering with\nlongitudinal and time-to-event data presents challenges, such as correlations\nbetween clustering variables, temporal dependencies, missing data, and\ncensoring. To address these challenges, we present Divisive Hierarchical\nBayesian Clustering methods featuring models for multivariate longitudinal\ntrajectories and semi-parametric models for survival data to identify subgroups\nin idiopathic PD with differing progression patterns from the Parkinson's\nProgression Markers Initiative (PPMI) database.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:42:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Burghardt","Elliot",""],["Sewell","Daniel",""],["Cavanaugh","Joseph",""]]}
{"id":"2308.02578","submitter":"Semyon Litvinov","authors":"Semyon Litvinov","title":"Notes on noncommutative ergodic theorems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a semifinite von Neumann algebra $\\mathcal M$ equipped with a faithful\nnormal semifinite trace $\\tau$, we prove that the spaces $L^0(\\mathcal M,\\tau)$\nand $\\mathcal R_\\tau$ are complete with respect to pointwise, almost uniform\nand bilaterally almost uniform, convergences in $L^0(\\mathcal M,\\tau)$. Then we\nshow that the pointwise Cauchy property for a special class of nets of linear\noperators in the space $L^1(\\mathcal M,\\tau)$ can be extended to pointwise\nconvergence of such nets in any fully symmetric space $E\\subset\\mathcal\nR_\\tau$, in particular, in any space $L^p(\\mathcal M,\\tau)$, $1\\leq p<\\infty$.\nSome applications of these results in the noncommutative ergodic theory are\ndiscussed.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:43:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Litvinov","Semyon",""]]}
{"id":"2308.02579","submitter":"D. N. Basu","authors":"Vinay Singh, Debasis Bhowmick, D. N. Basu","title":"Radiative neutron capture reaction rates for stellar nucleosynthesis","comments":"7 pages including 5 figures and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a high demand for nuclear data in multidisciplinary subject like\nnuclear astrophysics. The two areas of nuclear physics which are most clearly\nrelated to one another are stellar evolution and nucleosynthesis. The necessity\nfor nuclear data for astrophysical applications puts experimental methods as\nwell as reliability and predicative ability of current nuclear models to the\ntest. Despite recent, considerable advances, there are still significant issues\nand mysteries. Only a few characteristics of nuclear astrophysics are covered\nin the current work which include $^{20}$Ne(n,$\\gamma$)$^{21}$Ne,\n$^{52}$Fe(n,$\\gamma$)$^{53}$Fe, $^{53}$Fe(n,$\\gamma$)$^{54}$Fe,\n$^{54}$Fe(n,$\\gamma$)$^{55}$Fe and $^{55}$Fe(n,$\\gamma$)$^{56}$Fe reactions\nwhich are important in stellar nucleosynthesis. The reaction rates are\ncalculated using nuclear statistical model. These rates are subsequently fitted\nto polynomials of temperature T$_9$ in order to facilitate calculations for\nstellar nucleosynthesis.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:46:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Singh","Vinay",""],["Bhowmick","Debasis",""],["Basu","D. N.",""]]}
{"id":"2308.02580","submitter":"Zilianng Wang","authors":"Ziliang Wang, Xiaohong Zhang, Sheng Huang, Wei Zhang, Dan Yang and\n  Meng Yan","title":"Probabilistic Deep Supervision Network: A Noise-Resilient Approach for\n  QoS Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.DC cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quality of Service (QoS) prediction is an essential task in recommendation\nsystems, where accurately predicting unknown QoS values can improve user\nsatisfaction. However, existing QoS prediction techniques may perform poorly in\nthe presence of noise data, such as fake location information or virtual\ngateways. In this paper, we propose the Probabilistic Deep Supervision Network\n(PDS-Net), a novel framework for QoS prediction that addresses this issue.\nPDS-Net utilizes a Gaussian-based probabilistic space to supervise intermediate\nlayers and learns probability spaces for both known features and true labels.\nMoreover, PDS-Net employs a condition-based multitasking loss function to\nidentify objects with noise data and applies supervision directly to deep\nfeatures sampled from the probability space by optimizing the Kullback-Leibler\ndistance between the probability space of these objects and the real-label\nprobability space. Thus, PDS-Net effectively reduces errors resulting from the\npropagation of corrupted data, leading to more accurate QoS predictions.\nExperimental evaluations on two real-world QoS datasets demonstrate that the\nproposed PDS-Net outperforms state-of-the-art baselines, validating the\neffectiveness of our approach.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:13:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Ziliang",""],["Zhang","Xiaohong",""],["Huang","Sheng",""],["Zhang","Wei",""],["Yang","Dan",""],["Yan","Meng",""]]}
{"id":"2308.02581","submitter":"Daniel Menasche","authors":"Felipe Moreno-Vera, Mateus Nogueira, Cain\\~a Figueiredo, Daniel Sadoc\n  Menasch\\'e, Miguel Bicudo, Ashton Woiwood, Enrico Lovat, Anton Kocheturov,\n  Leandro Pfleger de Aguiar","title":"Cream Skimming the Underground: Identifying Relevant Information Points\n  from Online Forums","comments":"2023 IEEE International Conference on Cyber Security and Resilience\n  (IEEE CSR)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a machine learning-based approach for detecting the\nexploitation of vulnerabilities in the wild by monitoring underground hacking\nforums. The increasing volume of posts discussing exploitation in the wild\ncalls for an automatic approach to process threads and posts that will\neventually trigger alarms depending on their content. To illustrate the\nproposed system, we use the CrimeBB dataset, which contains data scraped from\nmultiple underground forums, and develop a supervised machine learning model\nthat can filter threads citing CVEs and label them as Proof-of-Concept,\nWeaponization, or Exploitation. Leveraging random forests, we indicate that\naccuracy, precision and recall above 0.99 are attainable for the classification\ntask. Additionally, we provide insights into the difference in nature between\nweaponization and exploitation, e.g., interpreting the output of a decision\ntree, and analyze the profits and other aspects related to the hacking\ncommunities. Overall, our work sheds insight into the exploitation of\nvulnerabilities in the wild and can be used to provide additional ground truth\nto models such as EPSS and Expected Exploitability.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 16:52:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moreno-Vera","Felipe",""],["Nogueira","Mateus",""],["Figueiredo","Cain\u00e3",""],["Menasch\u00e9","Daniel Sadoc",""],["Bicudo","Miguel",""],["Woiwood","Ashton",""],["Lovat","Enrico",""],["Kocheturov","Anton",""],["de Aguiar","Leandro Pfleger",""]]}
{"id":"2308.02582","submitter":"Shabbirhussain Bhaisaheb","authors":"Aseem Arora, Shabbirhussain Bhaisaheb, Harshit Nigam, Manasi\n  Patwardhan, Lovekesh Vig, Gautam Shroff","title":"Adapt and Decompose: Efficient Generalization of Text-to-SQL via Domain\n  Adapted Least-To-Most Prompting","comments":"22 Pages","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":"  Cross-domain and cross-compositional generalization of Text-to-SQL semantic\nparsing is a challenging task. Existing Large Language Model (LLM) based\nsolutions rely on inference-time retrieval of few-shot exemplars from the\ntraining set to synthesize a run-time prompt for each Natural Language (NL)\ntest query. In contrast, we devise an algorithm which performs offline sampling\nof a minimal set-of few-shots from the training data, with complete coverage of\nSQL clauses, operators and functions, and maximal domain coverage within the\nallowed token length. This allows for synthesis of a fixed Generic Prompt (GP),\nwith a diverse set-of exemplars common across NL test queries, avoiding\nexpensive test time exemplar retrieval. We further auto-adapt the GP to the\ntarget database domain (DA-GP), to better handle cross-domain generalization;\nfollowed by a decomposed Least-To-Most-Prompting (LTMP-DA-GP) to handle\ncross-compositional generalization. The synthesis of LTMP-DA-GP is an offline\ntask, to be performed one-time per new database with minimal human\nintervention. Our approach demonstrates superior performance on the KaggleDBQA\ndataset, designed to evaluate generalizability for the Text-to-SQL task. We\nfurther showcase consistent performance improvement of LTMP-DA-GP over GP,\nacross LLMs and databases of KaggleDBQA, highlighting the efficacy and model\nagnostic benefits of our prompt based adapt and decompose approach.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:31:36 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 08:57:20 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 09:03:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Arora","Aseem",""],["Bhaisaheb","Shabbirhussain",""],["Nigam","Harshit",""],["Patwardhan","Manasi",""],["Vig","Lovekesh",""],["Shroff","Gautam",""]]}
{"id":"2308.02583","submitter":"Kaiyuan Ji","authors":"Kaiyuan Ji, Bartosz Regula, and Mark M. Wilde","title":"Postselected communication over quantum channels","comments":"33 pages, 5 figures, submitted to International Journal of Quantum\n  Information (IJQI) as part of a special issue dedicated to Alexander S.\n  Holevo on the occasion of his 80th birthday","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.IT hep-th math-ph math.IT math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The single-letter characterization of the entanglement-assisted capacity of a\nquantum channel is one of the seminal results of quantum information theory. In\nthis paper, we consider a modified communication scenario in which the receiver\nis allowed an additional, `inconclusive' measurement outcome, and we employ an\nerror metric given by the error probability in decoding the transmitted message\nconditioned on a conclusive measurement result. We call this setting\npostselected communication and the ensuing highest achievable rates the\npostselected capacities. Here, we provide a precise single-letter\ncharacterisation of postselected capacities in the setting of entanglement\nassistance as well as the more general non-signalling assistance, establishing\nthat they are both equal to the channel's projective mutual information -- a\nvariant of mutual information based on the Hilbert projective metric. We do so\nby establishing bounds on the one-shot postselected capacities, with a lower\nbound that makes use of a postselected teleportation protocol and an upper\nbound in terms of the postselected hypothesis testing relative entropy. As\nsuch, we obtain fundamental limits on a channel's ability to communicate even\nwhen this strong resource of postselection is allowed, implying limitations on\ncommunication even when the receiver has access to postselected closed timelike\ncurves.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:17:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ji","Kaiyuan",""],["Regula","Bartosz",""],["Wilde","Mark M.",""]]}
{"id":"2308.02584","submitter":"Alfredo Torrico","authors":"Ignacio Rios and Alfredo Torrico","title":"Platform Design in Matching Markets: A Two-Sided Assortment Optimization\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Motivated by online dating apps, we consider the assortment optimization\nproblem faced by a two-sided matching platform. Users on each side observe an\nassortment of profiles and decide which of them to like. A match occurs if and\nonly if two users mutually like each other, potentially in different periods.\nWe study how platforms should make assortment decisions to maximize the\nexpected number of matches under different platform designs, varying (i) how\nusers interact with each other, i.e., whether one or both sides of the market\ncan initiate an interaction, and (ii) the timing of matches, i.e., either\nsequentially or also simultaneously. We show that the problem is NP-hard and\nthat common approaches perform arbitrarily badly. Given the complexity of the\nproblem and industry practices, we focus on the case with two periods and\nprovide algorithms and performance guarantees for different platform designs.\nWe establish that, when interactions are one-directional and matches only take\nplace sequentially, there is an approximation guarantee of $1-1/e$, which\nbecomes arbitrarily close to $1/2$ if we allow for two-directional\ninteractions. Moreover, when we enable matches to happen sequentially and\nsimultaneously in the first period, we provide an approximation guarantee close\nto $1/2$, which becomes approximately $1/3$ when we allow two-directional\ninteractions. Finally, we discuss some model extensions and use data from our\nindustry partner to numerically show that the loss for not considering\nsimultaneous matches is negligible. Our results suggest that platforms should\nfocus on simple sequential adaptive policies to make assortment decisions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:47:44 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 18:36:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rios","Ignacio",""],["Torrico","Alfredo",""]]}
{"id":"2308.02585","submitter":"Amrit Singh Bedi","authors":"Souradip Chakraborty, Amrit Singh Bedi, Alec Koppel, Dinesh Manocha,\n  Huazheng Wang, Furong Huang, and Mengdi Wang","title":"Aligning Agent Policy with Externalities: Reward Design via Bilevel RL","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In reinforcement learning (RL), a reward function is often assumed at the\noutset of a policy optimization procedure. Learning in such a fixed reward\nparadigm in RL can neglect important policy optimization considerations, such\nas state space coverage and safety. Moreover, it can fail to encompass broader\nimpacts in terms of social welfare, sustainability, or market stability,\npotentially leading to undesirable emergent behavior and potentially misaligned\npolicy. To mathematically encapsulate the problem of aligning RL policy\noptimization with such externalities, we consider a bilevel optimization\nproblem and connect it to a principal-agent framework, where the principal\nspecifies the broader goals and constraints of the system at the upper level\nand the agent solves a Markov Decision Process (MDP) at the lower level. The\nupper-level deals with learning a suitable reward parametrization corresponding\nto the broader goals and the lower-level deals with learning the policy for the\nagent. We propose Principal driven Policy Alignment via Bilevel RL (PPA-BRL),\nwhich efficiently aligns the policy of the agent with the principal's goals. We\nexplicitly analyzed the dependence of the principal's trajectory on the\nlower-level policy, prove the convergence of PPA-BRL to the stationary point of\nthe problem. We illuminate the merits of this framework in view of alignment\nwith several examples spanning energy-efficient manipulation tasks, social\nwelfare-based tax design, and cost-effective robotic navigation.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:03:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chakraborty","Souradip",""],["Bedi","Amrit Singh",""],["Koppel","Alec",""],["Manocha","Dinesh",""],["Wang","Huazheng",""],["Huang","Furong",""],["Wang","Mengdi",""]]}
{"id":"2308.02586","submitter":"Albert Herrero Parareda","authors":"Albert Herrero-Parareda and Filippo Capolino","title":"The Azimuthally-Radially Polarized Beam: Helicity and Momentum\n  Densities, Generation and Optimal Chiral Light","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the optical properties of the azimuthally-radially polarized\nbeam (ARPB), a superposition of an azimuthally polarized beam and a radially\npolarized beam, which can be tuned to exhibit maximum chirality at a given\nenergy density. This condition is called \"optimal chiral light\" (OCL) since it\nrepresents the maximum local chirality at a given energy density. The\ntransverse fields of an ARPB dominate in the transverse plane but vanish on the\nbeam axis, where the magnetic and electric fields are purely longitudinal. This\nspatial separation between transverse and longitudinal components leads to\nvanishing linear and angular momentum densities on the axis, where only the\nenergy and helicity densities associated with the longitudinal fields persist.\nThe ARPB does not have a phase variation around the beam axis and nonetheless\nexhibits a power flow around the beam axis that causes a longitudinal orbital\nmomentum density. We introduce a concise notation for the ARPB and provide\nfield quantities, especially for the optimally chiral configuration. The ARPB\nshows promise for precise one-dimensional chirality probing and\nenantioseparation of chiral particles along the beam axis. We propose a setup\nto generate ARPBs with controlled chirality and orbital angular momentum.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:05:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Herrero-Parareda","Albert",""],["Capolino","Filippo",""]]}
{"id":"2308.02587","submitter":"Yannik Frisch","authors":"Yannik Frisch, Moritz Fuchs, Antoine Sanner, Felix Anton Ucar, Marius\n  Frenzel, Joana Wasielica-Poslednik, Adrian Gericke, Felix Mathias Wagner,\n  Thomas Dratsch, Anirban Mukhopadhyay","title":"Synthesising Rare Cataract Surgery Samples with Guided Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Cataract surgery is a frequently performed procedure that demands automation\nand advanced assistance systems. However, gathering and annotating data for\ntraining such systems is resource intensive. The publicly available data also\ncomprises severe imbalances inherent to the surgical process. Motivated by\nthis, we analyse cataract surgery video data for the worst-performing phases of\na pre-trained downstream tool classifier. The analysis demonstrates that\nimbalances deteriorate the classifier's performance on underrepresented cases.\nTo address this challenge, we utilise a conditional generative model based on\nDenoising Diffusion Implicit Models (DDIM) and Classifier-Free Guidance (CFG).\nOur model can synthesise diverse, high-quality examples based on complex\nmulti-class multi-label conditions, such as surgical phases and combinations of\nsurgical tools. We affirm that the synthesised samples display tools that the\nclassifier recognises. These samples are hard to differentiate from real\nimages, even for clinical experts with more than five years of experience.\nFurther, our synthetically extended data can improve the data sparsity problem\nfor the downstream task of tool classification. The evaluations demonstrate\nthat the model can generate valuable unseen examples, allowing the tool\nclassifier to improve by up to 10% for rare cases. Overall, our approach can\nfacilitate the development of automated assistance systems for cataract surgery\nby providing a reliable source of realistic synthetic data, which we make\navailable for everyone.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:09:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Frisch","Yannik",""],["Fuchs","Moritz",""],["Sanner","Antoine",""],["Ucar","Felix Anton",""],["Frenzel","Marius",""],["Wasielica-Poslednik","Joana",""],["Gericke","Adrian",""],["Wagner","Felix Mathias",""],["Dratsch","Thomas",""],["Mukhopadhyay","Anirban",""]]}
{"id":"2308.02588","submitter":"Md Saiful Islam","authors":"Tariq Adnan, Md Saiful Islam, Wasifur Rahman, Sangwu Lee, Sutapa Dey\n  Tithi, Kazi Noshin, Imran Sarker, M Saifur Rahman, Ehsan Hoque","title":"Unmasking Parkinson's Disease with Smile: An AI-enabled Screening\n  Framework","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":"  Parkinson's disease (PD) diagnosis remains challenging due to lacking a\nreliable biomarker and limited access to clinical care. In this study, we\npresent an analysis of the largest video dataset containing micro-expressions\nto screen for PD. We collected 3,871 videos from 1,059 unique participants,\nincluding 256 self-reported PD patients. The recordings are from diverse\nsources encompassing participants' homes across multiple countries, a clinic,\nand a PD care facility in the US. Leveraging facial landmarks and action units,\nwe extracted features relevant to Hypomimia, a prominent symptom of PD\ncharacterized by reduced facial expressions. An ensemble of AI models trained\non these features achieved an accuracy of 89.7% and an Area Under the Receiver\nOperating Characteristic (AUROC) of 89.3% while being free from detectable bias\nacross population subgroups based on sex and ethnicity on held-out data.\nFurther analysis reveals that features from the smiling videos alone lead to\ncomparable performance, even on two external test sets the model has never seen\nduring training, suggesting the potential for PD risk assessment from smiling\nselfie videos.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:23:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Adnan","Tariq",""],["Islam","Md Saiful",""],["Rahman","Wasifur",""],["Lee","Sangwu",""],["Tithi","Sutapa Dey",""],["Noshin","Kazi",""],["Sarker","Imran",""],["Rahman","M Saifur",""],["Hoque","Ehsan",""]]}
{"id":"2308.02589","submitter":"Dan Gorbonos","authors":"Dan Gorbonos, Felix Oberhauser, Luke L. Costello, Yannick G\\\"unzel,\n  Einat Couzin-Fuchs, Benjamin Koger, Iain D. Couzin","title":"An Effective Hydrodynamic Description of Marching Locusts","comments":"21 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cond-mat.stat-mech physics.bio-ph physics.flu-dyn q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A fundamental question in complex systems is how to relate interactions\nbetween individual components (\"microscopic description\") to the global\nproperties of the system (\"macroscopic description\"). Another fundamental\nquestion is whether such a macroscopic description exists at all and how well\nit describes the large-scale properties. Here, we address these questions using\nas a canonical example of a self-organizing complex system - the collective\nmotion of desert locusts. One of the world's most devastating insect plagues\nbegins when flightless juvenile locusts form \"marching bands\". Moving through\nsemiarid habitats in the search for food, these bands display remarkable\ncoordinated motion. We investigated how well physical models can describe the\nflow of locusts within a band. For this, we filmed locusts within marching\nbands during an outbreak in Kenya and automatically tracked all individuals\npassing through the camera frame. We first analysed the spatial topology of\nnearest neighbors and found individuals to be isotropically distributed.\nDespite this apparent randomness, a local order was observed in regions of high\ndensity with a clear second neighbor peak in the radial distribution function,\nakin to an ordered fluid. Furthermore, reconstructing individual locust\ntrajectories revealed a highly-aligned movement, consistent with the\none-dimensional version of the Toner-Tu equations, which are a generalization\nof the Navier-Stokes equations for fluids, used to describe the equivalent\nmacroscopic fluid properties of active particles. Using this effective Toner-Tu\nequation, which relates the gradient of the pressure to the acceleration, we\nshow that the effective \"pressure\" of locusts increases as a linear function of\ndensity in segments with highest polarization. Our study thus demonstrates an\neffective hydrodynamic description of flow dynamics in plague locust swarms.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 18:56:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gorbonos","Dan",""],["Oberhauser","Felix",""],["Costello","Luke L.",""],["G\u00fcnzel","Yannick",""],["Couzin-Fuchs","Einat",""],["Koger","Benjamin",""],["Couzin","Iain D.",""]]}
{"id":"2308.02590","submitter":"Tim Vogel","authors":"Tim Vogel, Samira Mansourzadeh, Uttam Nandi, Justin Norman, Sascha\n  Preu, Clara J. Saraceno","title":"Photoconductive receivers at 1030 nm for high average power pulsed THz\n  detection","comments":"14 pages, 7 figures plus biography","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In the last few years, many advances have been made in the demonstration of\nhigh-average power pulsed THz sources; however, little effort has been made to\nstudy compatible sensitive field-resolved detectors. Here, we investigate\nErAs:InAlGaAs photoconductive receivers optimized for a probe wavelength of\n1030 nm and thus suitable for the new class of high-power ultrafast\nYtterbium-based laser sources for THz generation and detection. The performance\nof the receiver is tested with a few-cycle THz source with high average power\nup to 20 mW and the dynamic range and saturation behavior of the receiver is\nthoroughly characterized. Under optimized settings, a dynamic range of more\nthan 115 dB is reached in a 120 s measurement time with 20 mW of THz average\npower, which is among the highest reported values to date. By reviewing the\nstate-of-the art in TDS measurement and post-processing technology, we identify\ncurrent limitations and guidelines for further increasing the dynamic range\ntowards 150 dB in short measurement times using high average power THz systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:02:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vogel","Tim",""],["Mansourzadeh","Samira",""],["Nandi","Uttam",""],["Norman","Justin",""],["Preu","Sascha",""],["Saraceno","Clara J.",""]]}
{"id":"2308.02591","submitter":"Kashif Ishaq","authors":"Kashif Ishaq and Samra Bibi","title":"IoT Based Smart Attendance System Using Rfid: A Systematic Literature\n  Review","comments":"26 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.OH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The use of Radio Frequency Identification (RFID) technology is ubiquitous in\na number of businesses and sectors, including retail sales, smart cities,\nagriculture, and transportation. Additionally, educational institutions have\nstarted using RFID to track student attendance, combining this technology with\nGoogle Sheets and the Internet of Things (IoT) to build a real-time attendance\ntracking system. For a thorough examination of the creation of a student\nattendance system, this paper includes a systematic literature evaluation of 21\nmajor research published on IoT based attendance systems employing RFID. This\nRFID-based attendance system enables automation, eliminating several problems\nconnected with the manual process, such as time wasting, proxies, and the\npossibility of losing the attendance sheet, in contrast to the traditional\nattendance system, which depends on manual signatures. By creating a system\nthat automatically registers students' attendance by merely flashing their\nstudent cards at the RFID reader, all the aforementioned difficulties may be\nsuccessfully addressed. This automated method guarantees attendance monitoring\naccuracy and dependability while also saving time. This paper's conclusion\nhighlights the significant advantages of implementing an IoT-based attendance\nsystem based on RFID technology. The suggested solution provides a trustworthy,\nefficient, and secure alternative to manual attendance techniques, successfully\naddressing their shortcomings. This paper offers helpful insights for\ninstitutions looking to create a cutting-edge attendance system that increases\nstudent involvement and academic achievement by looking at guiding principles,\nbest practices, and the successful resolution of difficulties.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:03:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ishaq","Kashif",""],["Bibi","Samra",""]]}
{"id":"2308.02592","submitter":"Dan Ferenc","authors":"Ivan Ferenc \\v{S}egedin, Marija \\v{S}egedin Ferenc, Daniel Ferenc","title":"Tandem-ABALONETM Photosensors with $2\\times2\\pi$ Acceptance for Neutrino\n  Astronomy","comments":"Submitted to NIMA; 7 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det astro-ph.IM hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The primary goal of the novel photosensor technology called ABALONETM (U.S.\nPat. 9,064,678) has been to enable the next-generation of astroparticle physics\nexperiments to open new windows on the universe with large-area detectors of\nunprecedented performance, radio-purity, robustness, and integration\nflexibility. This foundational technology provides the means for modern,\nscalable and cost-effective production. The wide range of possible\napplication-specific detector configurations can also make a difference in\nhomeland security and medical imaging. Thus far, we have reduced to practice\ntwo such detector configurations: (i) the composite sandwich Panel assembly\nthat hosts matrices of closely packed ABALONE units (U.S. Pat. 10,823,861),\nand, quite differently, the Tandem Detector Modules that host two back-to-back\noriented ABALONE photosensors. This article for the first time presents the\nlatter configuration, specifically designed to provide $2\\times2\\pi$ angular\nacceptance for neutrino astronomy and other large-area radiation detectors.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:47:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["\u0160egedin","Ivan Ferenc",""],["Ferenc","Marija \u0160egedin",""],["Ferenc","Daniel",""]]}
{"id":"2308.02593","submitter":"Cynthia J. Olson Reichhardt","authors":"A. Libal, S. Stepanov, C. Reichhardt, and C.J.O. Reichhardt","title":"Dynamic Phases and Combing Effects for Elongated Particles Moving Over\n  Quenched Disorder","comments":"6 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a two-dimensional system of elongated particles driven over a\nrandom quenched disorder landscape. For varied pinning site density, external\ndrive magnitude, and particle elongation, we find a wide variety of dynamic\nphases, including random structures, stripe or combed phases with nematic\norder, and clogged states. The different regimes can be identified by examining\nnematic ordering, cluster size, number of pinned particles, and transverse\ndiffusion. In some regimes we find that the pinning can enhance the particle\nalignment, producing a nonmonotonic signature in the nematic ordering with a\nmaximum at a particular combination of pinning density and drive. The optimal\nnematic occurs when a sufficient number of particles can be pinned, generating\na local shear and leading to what we call a combing effect. At high drives, the\ncombing effect is reduced when the number of pinned particles decreases. For\nstronger pinning, the particles form a heterogeneous clustered or clogged state\nthat depins into a fluctuating state with high diffusion.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 20:54:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Libal","A.",""],["Stepanov","S.",""],["Reichhardt","C.",""],["Reichhardt","C. J. O.",""]]}
{"id":"2308.02594","submitter":"Amirhossein Zolfagharian","authors":"Amirhossein Zolfagharian, Manel Abdellatif, Lionel C. Briand, and\n  Ramesh S","title":"SMARLA: A Safety Monitoring Approach for Deep Reinforcement Learning\n  Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep reinforcement learning algorithms (DRL) are increasingly being used in\nsafety-critical systems. Ensuring the safety of DRL agents is a critical\nconcern in such contexts. However, relying solely on testing is not sufficient\nto ensure safety as it does not offer guarantees. Building safety monitors is\none solution to alleviate this challenge. This paper proposes SMARLA, a machine\nlearning-based safety monitoring approach designed for DRL agents. For\npractical reasons, SMARLA is designed to be black-box (as it does not require\naccess to the internals of the agent) and leverages state abstraction to reduce\nthe state space and thus facilitate the learning of safety violation prediction\nmodels from agent's states. We validated SMARLA on two well-known RL case\nstudies. Empirical analysis reveals that SMARLA achieves accurate violation\nprediction with a low false positive rate, and can predict safety violations at\nan early stage, approximately halfway through the agent's execution before\nviolations occur.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 21:08:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zolfagharian","Amirhossein",""],["Abdellatif","Manel",""],["Briand","Lionel C.",""],["S","Ramesh",""]]}
{"id":"2308.02595","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Search for single vector-like $B$ quark production and decay via\n  $B\\rightarrow bH(b\\bar{b})$ in $pp$ collisions at $\\sqrt{s} = 13$ TeV with\n  the ATLAS detector","comments":"52 pages in total, 11 figures, 4 tables, author list starts on page\n  35, to be submitted to JHEP. All figures can be found at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/EXOT-2019-04/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-091","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A search is presented for single production of a vector-like $B$ quark\ndecaying into a Standard Model $b$-quark and a Standard Model Higgs boson,\nwhich decays into a $b\\bar{b}$ pair. The search is carried out in 139 fb$^{-1}$\nof $\\sqrt{s} = 13$ TeV proton-proton collision data collected by the ATLAS\ndetector at the LHC between 2015 and 2018. No significant deviation from the\nStandard Model background prediction is observed, and mass-dependent exclusion\nlimits at the 95% confidence level are set on the resonance production\ncross-section in several theoretical scenarios determined by the couplings\n$c_W$, $c_Z$ and $c_H$ between the $B$ quark and the Standard Model $W$, $Z$\nand Higgs bosons, respectively. For a vector-like $B$ occurring as an isospin\nsinglet, the search excludes values of $c_W$ greater than 0.45 for a $B$\nresonance mass ($m_B$) between 1.0 and 1.2 TeV. For 1.2 TeV < $m_B$ < 2.0 TeV,\n$c_W$ values larger than 0.50-0.65 are excluded. If the $B$ occurs as part of a\n$(B,Y)$ doublet, the smallest excluded $c_Z$ coupling values range between 0.3\nand 0.5 across the investigated resonance mass range 1.0 TeV < $m_B$ < 2.0 TeV.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:57:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.02596","submitter":"Sang Hoon Lee","authors":"Seora Son, Eun Ji Choi, Sang Hoon Lee","title":"Revisiting small-world network models: Exploring technical realizations\n  and the equivalence of the Newman-Watts and Harary models","comments":"11 pages, 5 figures, 1 table, to appear in J. Korean Phys. Soc","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.dis-nn cs.DM stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the relatively less known facts on the equivalence and technical\nrealizations surrounding two network models showing the \"small-world\" property,\nnamely the Newman-Watts and the Harary models. We provide the most accurate (in\nterms of faithfulness to the original literature) versions of these models to\nclarify the deviation from them existing in their variants adopted in one of\nthe most popular network analysis packages. The difference in technical\nrealizations of those models could be conceived as minor details, but we\ndiscover significantly notable changes caused by the possibly inadvertent\nmodification. For the Harary model, the stochasticity in the original\nformulation allows a much wider range of the clustering coefficient and the\naverage shortest path length. For the Newman-Watts model, due to the\ndrastically different degree distributions, the clustering coefficient can also\nbe affected, which is verified by our higher-order analytic derivation. During\nthe process, we discover the equivalence of the Newman-Watts (better known in\nthe network science or physics community) and the Harary (better known in the\ngraph theory or mathematics community) models under a specific condition of\nrestricted parity in variables, which would bridge the two relatively\nindependently developed models in different fields. Our result highlights the\nimportance of each detailed step in constructing network models and the\npossibility of deeply related models, even if they might initially appear\ndistinct in terms of the time period or the academic disciplines from which\nthey emerged.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:08:55 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 02:58:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Son","Seora",""],["Choi","Eun Ji",""],["Lee","Sang Hoon",""]]}
{"id":"2308.02597","submitter":"Dayong Wang","authors":"William Gao, Dayong Wang and Yi Huang","title":"Designing a Deep Learning-Driven Resource-Efficient Diagnostic System\n  for Metastatic Breast Cancer: Reducing Long Delays of Clinical Diagnosis and\n  Improving Patient Survival in Developing Countries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Breast cancer is one of the leading causes of cancer mortality. Breast cancer\npatients in developing countries, especially sub-Saharan Africa, South Asia,\nand South America, suffer from the highest mortality rate in the world. One\ncrucial factor contributing to the global disparity in mortality rate is long\ndelay of diagnosis due to a severe shortage of trained pathologists, which\nconsequently has led to a large proportion of late-stage presentation at\ndiagnosis. The delay between the initial development of symptoms and the\nreceipt of a diagnosis could stretch upwards 15 months. To tackle this critical\nhealthcare disparity, this research has developed a deep learning-based\ndiagnosis system for metastatic breast cancer that can achieve high diagnostic\naccuracy as well as computational efficiency. Based on our evaluation, the\nMobileNetV2-based diagnostic model outperformed the more complex VGG16,\nResNet50 and ResNet101 models in diagnostic accuracy, model generalization, and\nmodel training efficiency. The visual comparisons between the model prediction\nand ground truth have demonstrated that the MobileNetV2 diagnostic models can\nidentify very small cancerous nodes embedded in a large area of normal cells\nwhich is challenging for manual image analysis. Equally Important, the light\nweighted MobleNetV2 models were computationally efficient and ready for mobile\ndevices or devices of low computational power. These advances empower the\ndevelopment of a resource-efficient and high performing AI-based metastatic\nbreast cancer diagnostic system that can adapt to under-resourced healthcare\nfacilities in developing countries. This research provides an innovative\ntechnological solution to address the long delays in metastatic breast cancer\ndiagnosis and the consequent disparity in patient survival outcome in\ndeveloping countries.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:09:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gao","William",""],["Wang","Dayong",""],["Huang","Yi",""]]}
{"id":"2308.02598","submitter":"Arnab Bhattacharyya PhD","authors":"Abhay K. Rajak, Ritambhara Dash, Ashwini Kumari, A.S. Bhattacharyya","title":"Sensitivity in Nanomechanical Pedestal MEMS Cantilever","comments":"16 pages, 6 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det cond-mat.mtrl-sci physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nanomechanical resonator-based sensing devices are used in medical\ndiagnostics based on their high-frequency dynamic behavior. Cantilevers fall\ninto the category of Nanomechanical resonators. It also resembles a resonator\nwhose shape is like that of a nanowire clamped at one end. As the\nsurface-to-volume ratio of a nanowire resonator increases due to scaling down,\nsurface stress plays a crucial role in the mechanical behavior of a resonator.\nPiezoresistive MEMS cantilevers are used for vapor phase analysis of volatile\ncompounds and gas. Studies were done to address the mass sensitivity issues and\nfractures associated with bioceramic and nanocomposite coatings-based\ncantilever resonators. The studies show how the sensing performance can be\ndetermined or tuned. Nanomechanical studies of thin films of SiCN on silicon\nwere performed. The sharpness of the tip was found to have an influence on the\ntip-sample conduction mechanism useful for MEMS applications\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:01:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rajak","Abhay K.",""],["Dash","Ritambhara",""],["Kumari","Ashwini",""],["Bhattacharyya","A. S.",""]]}
{"id":"2308.02599","submitter":"Matteo Salvador","authors":"Matteo Salvador, Alison Lesley Marsden","title":"Branched Latent Neural Operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA eess.SP math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce Branched Latent Neural Operators (BLNOs) to learn input-output\nmaps encoding complex physical processes. A BLNO is defined by a simple and\ncompact feedforward partially-connected neural network that structurally\ndisentangles inputs with different intrinsic roles, such as the time variable\nfrom model parameters of a differential equation, while transferring them into\na generic field of interest. BLNOs leverage interpretable latent outputs to\nenhance the learned dynamics and break the curse of dimensionality by showing\nexcellent generalization properties with small training datasets and short\ntraining times on a single processor. Indeed, their generalization error\nremains comparable regardless of the adopted discretization during the testing\nphase. Moreover, the partial connections, in place of a fully-connected\nstructure, significantly reduce the number of tunable parameters. We show the\ncapabilities of BLNOs in a challenging test case involving biophysically\ndetailed electrophysiology simulations in a biventricular cardiac model of a\npediatric patient with hypoplastic left heart syndrome. The model includes a\npurkinje network for fast conduction and a heart-torso geometry. Specifically,\nwe trained BLNOs on 150 in silico generated 12-lead electrocardiograms (ECGs)\nwhile spanning 7 model parameters, covering cell-scale, organ-level and\nelectrical dyssynchrony. Although the 12-lead ECGs manifest very fast dynamics\nwith sharp gradients, after automatic hyperparameter tuning the optimal BLNO,\ntrained in less than 3 hours on a single CPU, retains just 7 hidden layers and\n19 neurons per layer. The mean square error is on the order of $10^{-4}$ on an\nindependent test dataset comprised of 50 additional electrophysiology\nsimulations. This paper provides a novel computational tool to build reliable\nand efficient reduced-order models for digital twinning in engineering\napplications.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:04:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Salvador","Matteo",""],["Marsden","Alison Lesley",""]]}
{"id":"2308.02600","submitter":"Yury S Tsyganov","authors":"Yu.S.Tsyganov, D.Ibadullayev","title":"On the sharing signals measured with DSSD detector","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we report on the reasonable nature of sharing signals measured\nwith large area DSSD detectors. This detector manufactured by Micron\nSemiconductor (UK) and in use at the DGFRS-2 setup installed at DC-280 ultra\nintense cyclotron of FLNR, JINR. Some results from other setups are presented.\nWe believe that pitch value as well as threshold value play dominant role in\nthe charge sharing process. Some other parameters influenced by that process\nare considered in brief too, but sometimes in semi-quantity form.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:58:09 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 07:29:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tsyganov","Yu. S.",""],["Ibadullayev","D.",""]]}
{"id":"2308.02601","submitter":"Zhongxiang Wang","authors":"Dong Zheng, Zhongxiang Wang (Yunnan University)","title":"Two Candidate Pulsar TeV Halos Identified from Property-Similarity\n  Studies","comments":"8 pages, 4 figures, 3 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":"  TeV halos have been suggested as a common phenomenon associated with\nmiddle-aged pulsars. Based on our recent work on PSR~J0631+1036, we select 3\ncandidate TeV halos from the first Large High Altitude Air Shower Observatory\n(LHAASO) catalog of gamma-ray sources. The corresponding pulsars, given by the\npositional coincidences and property similarities, are PSR J1958+2846, PSR\nJ2028+3332, and PSR J1849$-$0001. We analyze the GeV $\\gamma$-ray data obtained\nwith the Large Area Telescope (LAT) onboard {\\it the Fermi Gamma-ray Space\nTelescope} for the first two pulsars, as the last is gamma-ray quiet. We remove\nthe pulsed emissions of the pulsars from the source regions from timing\nanalysis, and determine that there are no residual GeV emissions in the regions\nas any possible counterparts to the TeV sources. Considering the previous\nobservational results for the source regions and comparing the two pulsars to\nGeminga (and Monogem), the LHAASO-detected TeV sources are likely the pulsars'\nrespective TeV halos. We find that the candidate and identified TeV halos,\nincluding that of PSR~J1849$-$0001, have luminosites (at 50\\,TeV) approximately\nproportional to the spin-down energy $\\dot{E}$ of the pulsars, and the ratios\nof the former to the latter are $\\sim 6\\times 10^{-4}$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:18:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zheng","Dong","","Yunnan University"],["Wang","Zhongxiang","","Yunnan University"]]}
{"id":"2308.02602","submitter":"Yongcheol Choi","authors":"Hyeongeun Yun, Yongcheol Choi, Youngjae Kim, and Seongwon Kang","title":"On stable wrapper-based parameter selection method for efficient\n  ANN-based data-driven modeling of turbulent flows","comments":"24 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.AI physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To model complex turbulent flow and heat transfer phenomena, this study aims\nto analyze and develop a reduced modeling approach based on artificial neural\nnetwork (ANN) and wrapper methods. This approach has an advantage over other\nmethods such as the correlation-based filter method in terms of removing\nredundant or irrelevant parameters even under non-linearity among them. As a\ndownside, the overfitting and randomness of ANN training may produce\ninconsistent subsets over selection trials especially in a higher physical\ndimension. This study analyzes a few existing ANN-based wrapper methods and\ndevelops a revised one based on the gradient-based subset selection indices to\nminimize the loss in the total derivative or the directional consistency at\neach elimination step. To examine parameter reduction performance and\nconsistency-over-trials, we apply these methods to a manufactured subset\nselection problem, modeling of the bubble size in a turbulent bubbly flow, and\nmodeling of the spatially varying turbulent Prandtl number in a duct flow. It\nis found that the gradient-based subset selection to minimize the total\nderivative loss results in improved consistency-over-trials compared to the\nother ANN-based wrapper methods, while removing unnecessary parameters\nsuccessfully. For the reduced turbulent Prandtl number model, the\ngradient-based subset selection improves the prediction in the validation case\nover the other methods. Also, the reduced parameter subsets show a slight\nincrease in the training speed compared to the others.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:26:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yun","Hyeongeun",""],["Choi","Yongcheol",""],["Kim","Youngjae",""],["Kang","Seongwon",""]]}
{"id":"2308.02603","submitter":"Xiao Yang","authors":"Ruijin Sun, Xiao Yang, Nan Cheng, Xiucheng Wang, Changle Li","title":"Knowledge-Driven Multi-Agent Reinforcement Learning for Computation\n  Offloading in Cybertwin-Enabled Internet of Vehicles","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":"  By offloading computation-intensive tasks of vehicles to roadside units\n(RSUs), mobile edge computing (MEC) in the Internet of Vehicles (IoV) can\nrelieve the onboard computation burden. However, existing model-based task\noffloading methods suffer from heavy computational complexity with the increase\nof vehicles and data-driven methods lack interpretability. To address these\nchallenges, in this paper, we propose a knowledge-driven multi-agent\nreinforcement learning (KMARL) approach to reduce the latency of task\noffloading in cybertwin-enabled IoV. Specifically, in the considered scenario,\nthe cybertwin serves as a communication agent for each vehicle to exchange\ninformation and make offloading decisions in the virtual space. To reduce the\nlatency of task offloading, a KMARL approach is proposed to select the optimal\noffloading option for each vehicle, where graph neural networks are employed by\nleveraging domain knowledge concerning graph-structure communication topology\nand permutation invariance into neural networks. Numerical results show that\nour proposed KMARL yields higher rewards and demonstrates improved scalability\ncompared with other methods, benefitting from the integration of domain\nknowledge.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:11:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sun","Ruijin",""],["Yang","Xiao",""],["Cheng","Nan",""],["Wang","Xiucheng",""],["Li","Changle",""]]}
{"id":"2308.02604","submitter":"Maxim Polyakov","authors":"Maxim Polyakov","title":"Computational modeling to determine the physical characteristics of\n  biological tissues for medical diagnosis","comments":null,"journal-ref":null,"doi":"10.1504/IJESMS.2020.111276","report-no":null,"categories":"physics.med-ph cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Timely diagnosis of breast cancer is an important task. This type of breast\ncancer is one of the most common diseases. The method of microwave\nradiothermometry is a promising direction for solving this problem. The method\nis based on measuring internal temperature of biological tissues in microwave\nfrequency range. Computer simulations are used to improve the quality of\ndiagnostics. Computer models make it possible to evaluate the effect of heat\nrelease in a malignant tumor on the thermal dynamics inside the mammary gland.\nIt is necessary to build personalized models, taking into account the\nindividual nature of the internal structure of the mammary gland in each\npatient. One of the problems is the determination of biophysical\ncharacteristics of biological components. Methods for determining these\ncharacteristics using computer simulations are proposed. The coefficient of\nthermal conductivity and specific heat of biological tissues are determined\nfrom known temperature distributions. Finding the physical parameters for a\nquasihomogeneous biological tissue is the first approximation for solving this\nproblem. The least squares method is used as a solution method. The results\nobtained are in good agreement with previously known exact solutions, which\nindicates the applicability of this method for solving this class of problems.\nThe efficiency of using parallel technologies in solving the inverse problem is\ninvestigated and the applicability of Open MP technology is demonstrated.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:41:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Polyakov","Maxim",""]]}
{"id":"2308.02605","submitter":"Toshiki Hanyu","authors":"Toshiki Hanyu","title":"Revision of Sabine's reverberation theory by following a different\n  approach to Eyring's theory","comments":"This version was added detailed explanation of the theory and some\n  new results. 7 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The room acoustic theory was established based on Sabine's reverberation\ntheory. However, in Sabine's theory, the reverberation time does not reach\nzero, even if the absolute absorption condition is satisfied. This is a\ncontradiction of Sabine's theory, and Eyring revised the reverberation theory\nto resolve this contradiction. In this paper, a theoretical framework for the\nconsistent reverberation theory is presented. Using this framework, it was\ndemonstrated that Eyring's theory has a contradiction between the sound energy\ndensity in the steady state and energy decay from the steady state, which is\nabsent in Sabine's theory. Based on the proposed theoretical framework,\nSabine's reverberation theory was revised using an approach that is different\nfrom that of Eyring. The reverberation time obtained using the revised theory\nwas shorter than that obtained using Sabine's theory and longer than that\nobtained using Eyring's theory. Results of sound ray tracing simulations were\nin better agreement with the values calculated using the revised theory rather\nthan those calculated using Sabine's and Eyring's theories.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:14:25 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 08:35:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hanyu","Toshiki",""]]}
{"id":"2308.02606","submitter":"Shuman Fang","authors":"Shuman Fang, Shuai Liu, Jie Li, Guannan Jiang, Xianming Lin, Rongrong\n  Ji","title":"Improving Human-Object Interaction Detection via Virtual Image Learning","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":"  Human-Object Interaction (HOI) detection aims to understand the interactions\nbetween humans and objects, which plays a curtail role in high-level semantic\nunderstanding tasks. However, most works pursue designing better architectures\nto learn overall features more efficiently, while ignoring the long-tail nature\nof interaction-object pair categories. In this paper, we propose to alleviate\nthe impact of such an unbalanced distribution via Virtual Image Leaning (VIL).\nFirstly, a novel label-to-image approach, Multiple Steps Image Creation\n(MUSIC), is proposed to create a high-quality dataset that has a consistent\ndistribution with real images. In this stage, virtual images are generated\nbased on prompts with specific characterizations and selected by\nmulti-filtering processes. Secondly, we use both virtual and real images to\ntrain the model with the teacher-student framework. Considering the initial\nlabels of some virtual images are inaccurate and inadequate, we devise an\nAdaptive Matching-and-Filtering (AMF) module to construct pseudo-labels. Our\nmethod is independent of the internal structure of HOI detectors, so it can be\ncombined with off-the-shelf methods by training merely 10 additional epochs.\nWith the assistance of our method, multiple methods obtain significant\nimprovements, and new state-of-the-art results are achieved on two benchmarks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:28:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fang","Shuman",""],["Liu","Shuai",""],["Li","Jie",""],["Jiang","Guannan",""],["Lin","Xianming",""],["Ji","Rongrong",""]]}
{"id":"2308.02607","submitter":"Mohsen Sadr","authors":"Mohsen Sadr, Nicolas G. Hadjiconstantinou, M. Hossein Gorji","title":"Wasserstein-penalized Entropy closure: A use case for stochastic\n  particle methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce a framework for generating samples of a distribution given a\nfinite number of its moments, targeted to particle-based solutions of kinetic\nequations and rarefied gas flow simulations. Our model, referred to as the\nWasserstein-Entropy distribution (WE), couples a physically-motivated\nWasserstein penalty term to the traditional maximum-entropy distribution (MED)\nfunctions, which serves to regularize the latter. The penalty term becomes\nnegligible near the local equilibrium, reducing the proposed model to the MED,\nknown to reproduce the hydrodynamic limit. However, in contrast to the standard\nMED, the proposed WE closure can cover the entire physically realizable moment\nspace, including the so-called Junk line. We also propose an efficient Monte\nCarlo algorithm for generating samples of the unknown distribution which is\nexpected to outperform traditional non-linear optimization approaches used to\nsolve the MED problem. Numerical tests demonstrate that, given moments up to\nthe heat flux -- that is equivalent to the information contained in the\nChapman-Enskog distribution -- the proposed methodology provides a reliable\nclosure in the collision-dominated and early transition regime. Applications to\nlarger rarefaction demand information from higher-order moments, which can be\nincorporated within the proposed closure.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:44:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sadr","Mohsen",""],["Hadjiconstantinou","Nicolas G.",""],["Gorji","M. Hossein",""]]}
{"id":"2308.02608","submitter":"Ibrahim Habli","authors":"Zoe Porter, Joanna Al-Qaddoumi, Philippa Ryan Conmy, Phillip Morgan,\n  John McDermid, Ibrahim Habli","title":"Unravelling Responsibility for AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To reason about where responsibility does and should lie in complex\nsituations involving AI-enabled systems, we first need a sufficiently clear and\ndetailed cross-disciplinary vocabulary for talking about responsibility.\nResponsibility is a triadic relation involving an actor, an occurrence, and a\nway of being responsible. As part of a conscious effort towards 'unravelling'\nthe concept of responsibility to support practical reasoning about\nresponsibility for AI, this paper takes the three-part formulation, 'Actor A is\nresponsible for Occurrence O' and identifies valid combinations of\nsubcategories of A, is responsible for, and O. These valid combinations - which\nwe term \"responsibility strings\" - are grouped into four senses of\nresponsibility: role-responsibility; causal responsibility; legal\nliability-responsibility; and moral responsibility. They are illustrated with\ntwo running examples, one involving a healthcare AI-based system and another\nthe fatal collision of an AV with a pedestrian in Tempe, Arizona in 2018. The\noutput of the paper is 81 responsibility strings. The aim is that these strings\nprovide the vocabulary for people across disciplines to be clear and specific\nabout the different ways that different actors are responsible for different\noccurrences within a complex event for which responsibility is sought, allowing\nfor precise and targeted interdisciplinary normative deliberations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:12:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Porter","Zoe",""],["Al-Qaddoumi","Joanna",""],["Conmy","Philippa Ryan",""],["Morgan","Phillip",""],["McDermid","John",""],["Habli","Ibrahim",""]]}
{"id":"2308.02609","submitter":"Roman Smirnov","authors":"Roman G. Smirnov and Kunpeng Wang","title":"Bowley's Law Revisited Again","comments":"16 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Bowley's Law, also known as the law of the constant wage share, is a\nsignificant empirical observation in economics, indicating that the wage share\nof a country tends to remain relatively constant over time. The wage share\nrepresents the proportion of a country's economic output that is distributed to\nemployees as compensation for their labor, usually in the form of wages. This\nprinciple is attributed to Sir Arthur Bowley, an English economist,\nmathematician, and statistician.\n  In this paper, we present a mathematical model that utilizes symmetry\nmethods, particularly those developed by Peter Olver, to explain the validity\nof Bowley's law. By employing these advanced mathematical techniques, we aim to\nshed light on the factors that contribute to the stability of the wage share\nover time. Through our analysis, we hope to provide valuable insights into the\nunderlying mechanisms that underpin Bowley's law and its implications for\nunderstanding income distribution patterns in economies.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:16:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Smirnov","Roman G.",""],["Wang","Kunpeng",""]]}
{"id":"2308.02610","submitter":"Martin Kreuzer","authors":"Martin Kreuzer and Florian Walsh","title":"Efficient Algorithms for Finite $\\mathbb{Z}$-Algebras","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.RA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For a finite $\\mathbb{Z}$-algebra $R$, i.e., for a $\\mathbb{Z}$-algebra which\nis a finitely generated $\\mathbb{Z}$-module, we assume that $R$ is explicitly\ngiven by a system of $\\mathbb{Z}$-module generators $G$, its relation module\n${\\rm Syz}(G)$, and the structure constants of the multiplication in $R$. In\nthis setting we develop and analyze efficient algorithms for computing\nessential information about $R$. First we provide polynomial time algorithms\nfor solving linear systems of equations over $R$ and for basic ideal-theoretic\noperations in $R$. Then we develop ZPP (zero-error probabilitic polynomial\ntime) algorithms to compute the nilradical and the maximal ideals of\n0-dimensional affine algebras $K[x_1,\\dots,x_n]/I$ with $K=\\mathbb{Q}$ or\n$K=\\mathbb{F}_p$. The task of finding the associated primes of a finite\n$\\mathbb{Z}$-algebra $R$ is reduced to these cases and solved in ZPPIF (ZPP\nplus one integer factorization). With the same complexity, we calculate the\nconnected components of the set of associated primes ${\\rm Ass}(R)$ and then\nthe primitive idempotents of $R$. Finally, we prove that knowing an explicit\nrepresentation of $R$ is polynomial time equivalent to knowing a strong\nGr\\\"obner basis of an ideal $I$ such that $R = \\mathbb{Z}[x_1,\\dots,x_n]/I$.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:42:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kreuzer","Martin",""],["Walsh","Florian",""]]}
{"id":"2308.02611","submitter":"Mikhail Tamm","authors":"Alexey V. Gulyaev, Mikhail V. Tamm","title":"Maximal entropy random walks on tree-like graphs with a single entropic\n  trap: critical behavior and finite size effects","comments":"13 pager, 7 figures","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":"  It is known that maximal entropy random walks on graphs tend to get localized\nin the vicinity of nodes with a large degree. Here we revisit the simplest toy\nmodel of such a localization - a regular tree of degree $p$ with one special\nnode (\"root\") which has a degree different from all others. We present an\nin-depth study of the behavior of maximal entropy random walk at exactly at the\nlocalization transition. We study walks starting from the root on both infinite\ntrees and finite locally-tree-like regular random graphs (RRG). For the\ninfinite tree we prove that the probability distribution function of the walker\nis a step function with the position of the shock moving away from the root\nwith constant velocity $v=(p-2)/p$ and find the width and asymptotic shape of\nthe distribution in the vicinity of the shock. For a finite RRG we show that\ncritical slowdown takes place and the time (trajectory length) needed to reach\nthe equilibrium distribution is of order $\\sqrt{N}$ instead of $\\log_{p-1}N$\naway from the transition. We calculate the exact value of equilibrium\ndistribution and relaxation time, as well as the shape of slowly relaxing\nmodes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:54:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gulyaev","Alexey V.",""],["Tamm","Mikhail V.",""]]}
{"id":"2308.02612","submitter":"Sergei Baranovskii","authors":"A. V. Nenashev, S. D. Baranovskii, F. Gebhard","title":"A pedestrian approach to Einstein's formula $E=mc^2$ with an application\n  to photon dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph gr-qc physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There are several ways to derive Einstein's celebrated formula for the energy\nof a massive particle at rest, $E=mc^2$. Noether's theorem applied to the\nrelativistic Lagrange function provides an unambiguous and straightforward\naccess to energy and momentum conservation laws but those tools were not\navailable at the beginning of the twentieth century and are not at hand for\nnewcomers even nowadays. In a pedestrian approach, we start from relativistic\nkinematics and analyze elastic and inelastic scattering processes in different\nreference frames to derive the relativistic energy-mass relation. We extend the\nanalysis to Compton scattering between a massive particle and a photon, and a\nmassive particle emitting two photons. Using the Doppler formula, it follows\nthat $E=\\hbar \\omega$ for photons at angular frequency $\\omega$ where $\\hbar$\nis the reduced Planck constant. We relate our work to other derivations of\nEinstein's formula in the literature.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:57:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nenashev","A. V.",""],["Baranovskii","S. D.",""],["Gebhard","F.",""]]}
{"id":"2308.02613","submitter":"Pavitra Chauhan","authors":"Pavitra Chauhan, Mohsen Gamal Saad Askar, Bj{\\o}rn Fjukstad, Lars Ailo\n  Bongo, Edvard Pedersen","title":"Interoperable synthetic health data with SyntHIR to enable the\n  development of CDSS tools","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a great opportunity to use high-quality patient journals and health\nregisters to develop machine learning-based Clinical Decision Support Systems\n(CDSS). To implement a CDSS tool in a clinical workflow, there is a need to\nintegrate, validate and test this tool on the Electronic Health Record (EHR)\nsystems used to store and manage patient data. However, it is often not\npossible to get the necessary access to an EHR system due to legal compliance.\nWe propose an architecture for generating and using synthetic EHR data for CDSS\ntool development. The architecture is implemented in a system called SyntHIR.\nThe SyntHIR system uses the Fast Healthcare Interoperability Resources (FHIR)\nstandards for data interoperability, the Gretel framework for generating\nsynthetic data, the Microsoft Azure FHIR server as the FHIR-based EHR system\nand SMART on FHIR framework for tool transportability. We demonstrate the\nusefulness of SyntHIR by developing a machine learning-based CDSS tool using\ndata from the Norwegian Patient Register (NPR) and Norwegian Patient\nPrescriptions (NorPD). We demonstrate the development of the tool on the\nSyntHIR system and then lift it to the Open DIPS environment. In conclusion,\nSyntHIR provides a generic architecture for CDSS tool development using\nsynthetic FHIR data and a testing environment before implementing it in a\nclinical setting. However, there is scope for improvement in terms of the\nquality of the synthetic data generated. The code is open source and available\nat https://github.com/potter-coder89/SyntHIR.git.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:02:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chauhan","Pavitra",""],["Askar","Mohsen Gamal Saad",""],["Fjukstad","Bj\u00f8rn",""],["Bongo","Lars Ailo",""],["Pedersen","Edvard",""]]}
{"id":"2308.02614","submitter":"Badr Ben Elallid","authors":"Badr Ben Elallid, Amine Abouaomar, Nabil Benamar, and Abdellatif\n  Kobbane","title":"Vehicles Control: Collision Avoidance using Federated Deep Reinforcement\n  Learning","comments":"Accepted for publication in IEEE Global Communications Conference\n  (GLOBECOM 2023)","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 face of growing urban populations and the escalating number of\nvehicles on the roads, managing transportation efficiently and ensuring safety\nhave become critical challenges. To tackle these issues, the development of\nintelligent control systems for vehicles is paramount. This paper presents a\ncomprehensive study on vehicle control for collision avoidance, leveraging the\npower of Federated Deep Reinforcement Learning (FDRL) techniques. Our main goal\nis to minimize travel delays and enhance the average speed of vehicles while\nprioritizing safety and preserving data privacy. To accomplish this, we\nconducted a comparative analysis between the local model, Deep Deterministic\nPolicy Gradient (DDPG), and the global model, Federated Deep Deterministic\nPolicy Gradient (FDDPG), to determine their effectiveness in optimizing vehicle\ncontrol for collision avoidance. The results obtained indicate that the FDDPG\nalgorithm outperforms DDPG in terms of effectively controlling vehicles and\npreventing collisions. Significantly, the FDDPG-based algorithm demonstrates\nsubstantial reductions in travel delays and notable improvements in average\nspeed compared to the DDPG algorithm.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:26:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Elallid","Badr Ben",""],["Abouaomar","Amine",""],["Benamar","Nabil",""],["Kobbane","Abdellatif",""]]}
{"id":"2308.02615","submitter":"Abigail Hickok","authors":"Abigail Hickok and Andrew J. Blumberg","title":"An Intrinsic Approach to Scalar-Curvature Estimation for Point Clouds","comments":"37 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce an intrinsic estimator for the scalar curvature of a data set\npresented as a finite metric space. Our estimator depends only on the metric\nstructure of the data and not on an embedding in $\\mathbb{R}^n$. We show that\nthe estimator is consistent in the sense that for points sampled from a\nprobability measure on a compact Riemannian manifold, the estimator converges\nto the scalar curvature as the number of points increases. To justify its use\nin applications, we show that the estimator is stable with respect to\nperturbations of the metric structure, e.g., noise in the sample or error\nestimating the intrinsic metric. We validate our estimator experimentally on\nsynthetic data that is sampled from manifolds with specified curvature.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:29:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hickok","Abigail",""],["Blumberg","Andrew J.",""]]}
{"id":"2308.02616","submitter":"Lukas Flohr","authors":"Lukas A. Flohr, Martina Schu{\\ss}, Dieter P. Wallach, Antonio\n  Kr\\\"uger, Andreas Riener","title":"Designing for Passengers' Information Needs on Fellow Travelers: A\n  Comparison of Day and Night Rides in Shared Automated Vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Shared automated mobility-on-demand promises efficient, sustainable, and\nflexible transportation. Nevertheless, security concerns, resilience, and their\nmutual influence - especially at night - will likely be the most critical\nbarriers to public adoption since passengers have to share rides with strangers\nwithout a human driver on board. As related work points out that information\nabout fellow travelers might mitigate passengers' concerns, we designed two\nuser interface variants to investigate the role of this information in an\nexploratory within-subjects user study (N = 24). Participants experienced four\nautomated day and night rides with varying personal information about\nco-passengers in a simulated environment. The results of the mixed-method study\nindicate that having information about other passengers (e.g., photo, gender,\nand name) positively affects user experience at night. In contrast, it is less\nnecessary during the day. Considering participants' simultaneously raised\nprivacy demands poses a substantial challenge for resilient system design.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:39:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Flohr","Lukas A.",""],["Schu\u00df","Martina",""],["Wallach","Dieter P.",""],["Kr\u00fcger","Antonio",""],["Riener","Andreas",""]]}
{"id":"2308.02617","submitter":"Nobuo Hinohara","authors":"Nobuo Hinohara, Tomohiro Oishi, Kenichi Yoshida","title":"Triplet-odd pairing in finite nuclear systems (I): Even-even\n  singly-closed nuclei","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Background: The appearance of the pairing condensate is an essential feature\nof many-fermion systems. There are two possible types of pairing: spin-singlet\nand spin-triplet. However, an open question remains as to whether the\nspin-triplet pairing condensate emerges in finite nuclei. Purpose: The aim of\nthis work is to examine the coexistence of the spin-singlet and spin-triplet\nlike-particle pairing condensates in nuclei. We also discuss the dependence on\nthe type of pairing functional. Method: The Hartree-Fock-Bogoliubov\ncalculations with a Skyrme $+$ local-pair energy-density functional (EDF) are\nperformed to investigate the pairing condensate in the spherical ground states\nof Ca and Sn isotopes. Results: The spin-singlet pair EDF induces not only the\nspin-singlet but also the spin-triplet pairing condensates due to a strong\nspin-orbit splitting. By discarding the spin-orbit EDF, only the spin-singlet\npairing condensate appears. The spin-triplet pair EDF, however, induces the\nspin-orbit splitting and accordingly the spin-singlet pairing condensate.\nConclusions: The spin-orbit splitting plays an essential role in the\ncoexistence of the spin-singlet and spin-triplet pairing condensates in nuclei.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:45:38 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 16:16:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hinohara","Nobuo",""],["Oishi","Tomohiro",""],["Yoshida","Kenichi",""]]}
{"id":"2308.02618","submitter":"Saipraneeth Devunuri","authors":"Saipraneeth Devunuri, Shirin Qiam, Lewis Lehe","title":"ChatGPT for GTFS: From Words to Information","comments":"18 pages, 7 figures, 1 table, Transportation Research Board","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The General Transit Feed Specification (GTFS) standard for publishing transit\ndata is ubiquitous. GTFS being tabular data, with information spread across\ndifferent files, necessitates specialized tools or packages to retrieve\ninformation. Concurrently, the use of Large Language Models for text and\ninformation retrieval is growing. The idea of this research is to see if the\ncurrent widely adopted LLMs (ChatGPT) are able to retrieve information from\nGTFS using natural language instructions. We first test whether ChatGPT\n(GPT-3.5) understands the GTFS specification. GPT-3.5 answers 77% of our\nmultiple-choice questions (MCQ) correctly. Next, we task the LLM with\ninformation extractions from a filtered GTFS feed with 4 routes. For\ninformation retrieval, we compare zero-shot and program synthesis. Program\nsynthesis works better, achieving ~90% accuracy on simple questions and ~40%\naccuracy on complex questions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:50:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Devunuri","Saipraneeth",""],["Qiam","Shirin",""],["Lehe","Lewis",""]]}
{"id":"2308.02619","submitter":"Sankar V","authors":"Vineeth P, Guru Nanma P, V Sankar, B Sachin Kumar","title":"Bald Eagle Search Algorithm for High Precision Inverse Kinematics of\n  Hyper-Redundant 9-DOF Robot","comments":"22 pages, 6 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robots in 3D spaces with more than six degrees of freedom are redundant. A\nredundant robot allows multiple configurations of the robot for the given\ntarget point in the dexterous workspace. The presence of multiple solutions\nhelps in resolving constraints in workspace such as object avoidance and energy\nminimization during trajectory planning. Inverse kinematics solutions of such\nredundant robotics are intricate. The present study involves comparison of\ndifferent metaheuristic optimization algorithms (MOA), which have a positional\nerror, and identify a MOA for high precision of positioning of the end effector\nof the robot. This study applies recent MOA for the inverse kinematics of hyper\nredundant nine degrees of freedom (DOF) robot arm by using forward kinematics\nof the Denavit-Hartenberg (DH) parameters and compares the performance of these\nalgorithms. The comparative study shows Bald Eagle Search (BES) algorithm has\nbetter performance over other metaheuristic algorithms. BES algorithm\noutperforms the other MOA in achieving the desired position with very high\nprecision and least positional error for a 9-DOF robot arm.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:55:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["P","Vineeth",""],["P","Guru Nanma",""],["Sankar","V",""],["Kumar","B Sachin",""]]}
{"id":"2308.02620","submitter":"Ali Zafari","authors":"Ali Zafari, Atefeh Khoshkhahtinat, Piyush Mehta, Mohammad Saeed\n  Ebrahimi Saadabadi, Mohammad Akyash, Nasser M. Nasrabadi","title":"Frequency Disentangled Features in Neural Image Compression","comments":"Accepted to 30$^{th}$ IEEE International Conference on Image\n  Processing (ICIP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The design of a neural image compression network is governed by how well the\nentropy model matches the true distribution of the latent code. Apart from the\nmodel capacity, this ability is indirectly under the effect of how close the\nrelaxed quantization is to the actual hard quantization. Optimizing the\nparameters of a rate-distortion variational autoencoder (R-D VAE) is ruled by\nthis approximated quantization scheme. In this paper, we propose a\nfeature-level frequency disentanglement to help the relaxed scalar quantization\nachieve lower bit rates by guiding the high entropy latent features to include\nmost of the low-frequency texture of the image. In addition, to strengthen the\nde-correlating power of the transformer-based analysis/synthesis transform, an\naugmented self-attention score calculation based on the Hadamard product is\nutilized during both encoding and decoding. Channel-wise autoregressive entropy\nmodeling takes advantage of the proposed frequency separation as it inherently\ndirects high-informational low-frequency channels to the first chunks and\nconditions the future chunks on it. The proposed network not only outperforms\nhand-engineered codecs, but also neural network-based codecs built on\ncomputation-heavy spatially autoregressive entropy models.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:55:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zafari","Ali",""],["Khoshkhahtinat","Atefeh",""],["Mehta","Piyush",""],["Saadabadi","Mohammad Saeed Ebrahimi",""],["Akyash","Mohammad",""],["Nasrabadi","Nasser M.",""]]}
{"id":"2308.02621","submitter":"Liang Liao","authors":"Liang Liao, Zhuang Guo, Qi Gao, Yan Wang, Fajun Yu, Qifeng Zhao,\n  Stephen Johh Maybank","title":"Color Image Recovery Using Generalized Matrix Completion over\n  Higher-Order Finite Dimensional Algebra","comments":"24 pages; 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To improve the accuracy of color image completion with missing entries, we\npresent a recovery method based on generalized higher-order scalars. We extend\nthe traditional second-order matrix model to a more comprehensive higher-order\nmatrix equivalent, called the \"t-matrix\" model, which incorporates a pixel\nneighborhood expansion strategy to characterize the local pixel constraints.\nThis \"t-matrix\" model is then used to extend some commonly used matrix and\ntensor completion algorithms to their higher-order versions. We perform\nextensive experiments on various algorithms using simulated data and algorithms\non simulated data and publicly available images and compare their performance.\nThe results show that our generalized matrix completion model and the\ncorresponding algorithm compare favorably with their lower-order tensor and\nconventional matrix counterparts.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:06:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liao","Liang",""],["Guo","Zhuang",""],["Gao","Qi",""],["Wang","Yan",""],["Yu","Fajun",""],["Zhao","Qifeng",""],["Maybank","Stephen Johh",""]]}
{"id":"2308.02622","submitter":"Daniel Daza","authors":"Qingzhi Hu, Daniel Daza, Laurens Swinkels, Kristina \\=Usait\\.e,\n  Robbert-Jan 't Hoen, Paul Groth","title":"Harnessing the Web and Knowledge Graphs for Automated Impact Investing\n  Scoring","comments":"Presented at the KDD 2023 Workshop - Fragile Earth: AI for Climate\n  Sustainability","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.IR cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Sustainable Development Goals (SDGs) were introduced by the United\nNations in order to encourage policies and activities that help guarantee human\nprosperity and sustainability. SDG frameworks produced in the finance industry\nare designed to provide scores that indicate how well a company aligns with\neach of the 17 SDGs. This scoring enables a consistent assessment of\ninvestments that have the potential of building an inclusive and sustainable\neconomy. As a result of the high quality and reliability required by such\nframeworks, the process of creating and maintaining them is time-consuming and\nrequires extensive domain expertise. In this work, we describe a data-driven\nsystem that seeks to automate the process of creating an SDG framework. First,\nwe propose a novel method for collecting and filtering a dataset of texts from\ndifferent web sources and a knowledge graph relevant to a set of companies. We\nthen implement and deploy classifiers trained with this data for predicting\nscores of alignment with SDGs for a given company. Our results indicate that\nour best performing model can accurately predict SDG scores with a micro\naverage F1 score of 0.89, demonstrating the effectiveness of the proposed\nsolution. We further describe how the integration of the models for its use by\nhumans can be facilitated by providing explanations in the form of data\nrelevant to a predicted score. We find that our proposed solution enables\naccess to a large amount of information that analysts would normally not be\nable to process, resulting in an accurate prediction of SDG scores at a\nfraction of the cost.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:14:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hu","Qingzhi",""],["Daza","Daniel",""],["Swinkels","Laurens",""],["\u016asait\u0117","Kristina",""],["Hoen","Robbert-Jan 't",""],["Groth","Paul",""]]}
{"id":"2308.02623","submitter":"Shu Xincheng","authors":"Zegang Huang, Xincheng Shu, Qi Xuan, Zhongyuan Ruan","title":"Epidemic spreading under game-based self-quarantine behaviors guided by\n  local and global infection information","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During the outbreak of an epidemic, individuals may modify their behaviors in\nresponse to external (including local and global) infection-related\ninformation. However, the difference between local and global information in\ninfluencing the spread of diseases remains inadequately explored. Here we study\na simple epidemic model that incorporates the game-based self-quarantine\nbehavior of individuals, taking into account the influence of local infection\nstatus, global disease prevalence and node heterogeneity (i.e., non-uniform\nnode degrees). Our findings reveal that local information can effectively\ncontain an epidemic, even with only a small proportion of individuals opting\nfor self-quarantine. On the other hand, global information can induce\noscillations in infection evolution curves during the declining phase of an\nepidemic, owing to the synchronous release of nodes with the same degree from\nthe quarantined state. In contrast, the releasing pattern under the local\ninformation appears to be more random. This oscillation phenomenon can be\nobserved in various types of networks associated with different\ncharacteristics. Significantly, our model is essentially different from\nconventional epidemic models in that the network heterogeneity plays a negative\nrole in the spread of epidemics, which is contrary to the previous findings.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:17:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Zegang",""],["Shu","Xincheng",""],["Xuan","Qi",""],["Ruan","Zhongyuan",""]]}
{"id":"2308.02624","submitter":"Morgan Frank","authors":"Morgan Frank, Yong-Yeol Ahn, Esteban Moro","title":"AI exposure predicts unemployment risk","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Is artificial intelligence (AI) disrupting jobs and creating unemployment?\nDespite many attempts to quantify occupations' exposure to AI, inconsistent\nvalidation obfuscates the relative benefits of each approach. A lack of\ndisaggregated labor outcome data, including unemployment data, further\nexacerbates the issue. Here, we assess which models of AI exposure predict job\nseparations and unemployment risk using new occupation-level unemployment data\nby occupation from each US state's unemployment insurance office spanning 2010\nthrough 2020. Although these AI exposure scores have been used by governments\nand industry, we find that individual AI exposure models are not predictive of\nunemployment rates, unemployment risk, or job separation rates. However, an\nensemble of those models exhibits substantial predictive power suggesting that\ncompeting models may capture different aspects of AI exposure that collectively\naccount for AI's variable impact across occupations, regions, and time. Our\nresults also call for dynamic, context-aware, and validated methods for\nassessing AI exposure. Interactive visualizations for this study are available\nat https://sites.pitt.edu/~mrfrank/uiRiskDemo/.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:21:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Frank","Morgan",""],["Ahn","Yong-Yeol",""],["Moro","Esteban",""]]}
{"id":"2308.02625","submitter":"S\\\"uleyman Yildiz","authors":"S\\\"uleyman Yildiz, Pawan Goyal and Peter Benner","title":"Linearly Implicit Global Energy Preserving Reduced-order Models for\n  Cubic Hamiltonian Systems","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 work discusses the model reduction problem for large-scale\nmulti-symplectic PDEs with cubic invariants. For this, we present a linearly\nimplicit global energy-preserving method to construct reduced-order models.\nThis allows to construct reduced-order models in the form of Hamiltonian\nsystems suitable for long-time integration. Furthermore, We prove that the\nconstructed reduced-order models preserve global energy, and the spatially\ndiscrete equations also preserve the spatially-discrete local energy\nconversation law. We illustrate the efficiency of the proposed method using\nthree numerical examples, namely a linear wave equation, the Korteweg-de Vries\nequation, and the Camassa-Holm equation, and present a comparison with the\nclassical POD-Galerkin method.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:47:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yildiz","S\u00fcleyman",""],["Goyal","Pawan",""],["Benner","Peter",""]]}
{"id":"2308.02626","submitter":"Jesus Ildefonso D\\'iaz","authors":"Jes\\'us Ildefonso D\\'iaz and Jes\\'us Hern\\'andez","title":"Beyond the classical strong maximum principle: forcing changing sign\n  near the boundary and flat solutions","comments":"20 pages 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the classical strong maximum principle, concerning positive\nsupersolutions of linear elliptic equations vanishing on the boundary of the\ndomain $\\Omega $ can be extended, under suitable conditions, to the case in\nwhich the forcing term $f(x)$ is changing sign. In addition, in the case of\nsolutions, the normal derivative on the boundary may also vanish on the\nboundary (definition of flat solutions). This leads to examples in which the\nunique continuation property fails. As a first application, we show the\nexistence of positive solutions for a sublinear semilinear elliptic problem of\nindefinite sign. A second application, concerning the positivity of solutions\nof the linear heat equation, for some large values of time, with forcing and/or\ninitial datum changing sign is also given.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:56:56 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 06:07:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["D\u00edaz","Jes\u00fas Ildefonso",""],["Hern\u00e1ndez","Jes\u00fas",""]]}
{"id":"2308.02627","submitter":"Daniel Sevcovic","authors":"Daniel Sevcovic, Cyril Izuchukwu Udeani","title":"Hamilton-Jacobi-Bellman Equation Arising from Optimal Portfolio\n  Selection Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Hamilton-Jacobi-Bellman equation arising from the optimal portfolio\nselection problem is studied by means of the maximal monotone operator method.\nThe existence and uniqueness of a solution to the Cauchy problem for the\nnonlinear parabolic partial integral differential equation in an abstract\nsetting are investigated by using the Banach fixed-point theorem, the Fourier\ntransform, and the monotone operators technique.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:07:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sevcovic","Daniel",""],["Udeani","Cyril Izuchukwu",""]]}
{"id":"2308.02628","submitter":"Jerrold Franklin","authors":"Jerrold Franklin","title":"Radiation reaction on an accelerating point charge","comments":"6 pages","journal-ref":"International Journal of Modern Physics A Vol. 38, No. 01, 2350005\n  (2023)","doi":"10.1142/S0217751X23500057","report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A point charge accelerating under the influence of an external force emits\nelectromagnetic radiation that reduces the increase in its mechanical energy.\nThis causes a reduction in the particle's acceleration. We derive the decrease\nin acceleration due to radiation reaction for a particle accelerating parallel\nto its velocity, and show that it has a negligible effect.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:11:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Franklin","Jerrold",""]]}
{"id":"2308.02629","submitter":"Andrew K. Gillespie","authors":"Andrew K. Gillespie (Texas Tech University), Cuikun Lin (Texas Tech\n  University), R. V. Duncan (Texas Tech University)","title":"Photoneutron Yield for an Electron Beam on Tantalum and Erbium Deuteride","comments":"15 pages, 9 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An electron beam may be used to generate bremsstrahlung photons that go on to\ncreate photoneutrons within metals. This serves as a low-energy neutron source\nfor irradiation experiments [1-3]. In this article, we present simulation\nresults for optimizing photoneutron yield for a 10-MeV electron beam on\ntantalum foil and erbium deuteride (ErD$_3$). The thickness of the metal layers\nwas varied. A tantalum foil thickness of 1.5 mm resulted in the most photons\nreaching the second metal layer. When a second metal layer of ErD$_3$ was\nincluded, the photoneutron yield increased with the thickness of the secondary\nlayer. When the electron beam was directly incident upon a layer of ErD$_3$,\nthe photoneutron yield did not differ significantly from the yield when a layer\nof tantalum was included. The directional photoneutron yield reached a maximum\nlevel when the thickness of the ErD$_3$ layer was around 12 cm. About 1 neutron\nwas generated per $10^4$ source electrons. When using a 2-mA beam current, it\nis possible to generate up to $10^{ 12}$ neutrons per second, making this\ncombination a relatively-inexpensive neutron generator.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:12:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gillespie","Andrew K.","","Texas Tech University"],["Lin","Cuikun","","Texas Tech\n  University"],["Duncan","R. V.","","Texas Tech University"]]}
{"id":"2308.02630","submitter":"Ali Rezakhani","authors":"Alireza Tavanfar, S. Alipour, A. T. Rezakhani","title":"Does Quantum Mechanics Breed Larger, More Intricate Quantum Theories?\n  The Case for Experience-Centric Quantum Theory and the Interactome of Quantum\n  Theories","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We pose and address the radical question that whether quantum mechanics,\nknown for its firm internal structure and enormous empirical success, carries\nin itself the genome of larger quantum theories which have higher internal\nintricacies and phenomenological versatilities. That is, on the basic level of\nclosed quantum systems and regardless of interpretational aspects, whether\nstandard quantum theory (SQT) harbors quantum theories with context-based\ndeformed principles or structures, having definite predictive power within much\nbroader scopes. We answer the question in affirmative following complementary\nevidence and reasoning arising from quantum-computation-based quantum\nsimulation and fundamental, general, abstract rationales in the frameworks of\ninformation theory, fundamental or functional emergence, and participatory\nagency. In this light, as we show, one is led to the recently proposed\nexperience-centric quantum theory (ECQT), which is a larger and richer theory\nof quantum behaviors with drastically generalized quantum dynamics. ECQT allows\nthe quantum information of the closed quantum system's developed state history\nto serve as the building blocks of the instantaneous Hamiltonians and internal\ninteractions of the system. Hence the unitary evolutions are continually\nimpacted and become guidable by the agent-system's experience. The intrinsic\ninterplay of unitarity and non-Markovianity in ECQT brings about a host of\ndiverse behavioral phases, which concurrently infuse closed and open quantum\nsystem characteristics and even surpasses the theory of open systems in SQT. In\nthe broader perspective, an upshot of our investigation is the existence of the\nquantum interactome -- the interactive landscape of all coexisting, independent\ncontext-based quantum theories which emerge from inferential participatory\nagencies -- and its predictive phenomenological utility.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:33:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tavanfar","Alireza",""],["Alipour","S.",""],["Rezakhani","A. T.",""]]}
{"id":"2308.02631","submitter":"Paul Fischer","authors":"Paul Fischer, Thomas K\\\"ustner, Christian F. Baumgartner","title":"Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction","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":"  MRI reconstruction techniques based on deep learning have led to\nunprecedented reconstruction quality especially in highly accelerated settings.\nHowever, deep learning techniques are also known to fail unexpectedly and\nhallucinate structures. This is particularly problematic if reconstructions are\ndirectly used for downstream tasks such as real-time treatment guidance or\nautomated extraction of clinical paramters (e.g. via segmentation).\nWell-calibrated uncertainty quantification will be a key ingredient for safe\nuse of this technology in clinical practice. In this paper we propose a novel\nprobabilistic reconstruction technique (PHiRec) building on the idea of\nconditional hierarchical variational autoencoders. We demonstrate that our\nproposed method produces high-quality reconstructions as well as uncertainty\nquantification that is substantially better calibrated than several strong\nbaselines. We furthermore demonstrate how uncertainties arising in the MR\neconstruction can be propagated to a downstream segmentation task, and show\nthat PHiRec also allows well-calibrated estimation of segmentation\nuncertainties that originated in the MR reconstruction process.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:41:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fischer","Paul",""],["K\u00fcstner","Thomas",""],["Baumgartner","Christian F.",""]]}
{"id":"2308.02632","submitter":"Fabio Reway","authors":"Eduardo C. Fidelis and Fabio Reway and Herick Y. S. Ribeiro and Pietro\n  L. Campos and Werner Huber and Christian Icking and Lester A. Faria and\n  Torsten Sch\\\"on","title":"Generation of Realistic Synthetic Raw Radar Data for Automated Driving\n  Applications using Generative Adversarial Networks","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":"  The main approaches for simulating FMCW radar are based on ray tracing, which\nis usually computationally intensive and do not account for background noise.\nThis work proposes a faster method for FMCW radar simulation capable of\ngenerating synthetic raw radar data using generative adversarial networks\n(GAN). The code and pre-trained weights are open-source and available on\nGitHub. This method generates 16 simultaneous chirps, which allows the\ngenerated data to be used for the further development of algorithms for\nprocessing radar data (filtering and clustering). This can increase the\npotential for data augmentation, e.g., by generating data in non-existent or\nsafety-critical scenarios that are not reproducible in real life. In this work,\nthe GAN was trained with radar measurements of a motorcycle and used to\ngenerate synthetic raw radar data of a motorcycle traveling in a straight line.\nFor generating this data, the distance of the motorcycle and Gaussian noise are\nused as input to the neural network. The synthetic generated radar chirps were\nevaluated using the Frechet Inception Distance (FID). Then, the Range-Azimuth\n(RA) map is calculated twice: first, based on synthetic data using this GAN\nand, second, based on real data. Based on these RA maps, an algorithm with\nadaptive threshold and edge detection is used for object detection. The results\nhave shown that the data is realistic in terms of coherent radar reflections of\nthe motorcycle and background noise based on the comparison of chirps, the RA\nmaps and the object detection results. Thus, the proposed method in this work\nhas shown to minimize the simulation-to-reality gap for the generation of radar\ndata.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 17:44:27 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 09:21:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fidelis","Eduardo C.",""],["Reway","Fabio",""],["Ribeiro","Herick Y. S.",""],["Campos","Pietro L.",""],["Huber","Werner",""],["Icking","Christian",""],["Faria","Lester A.",""],["Sch\u00f6n","Torsten",""]]}
{"id":"2308.02633","submitter":"Matthew Forslund","authors":"Matthew Forslund and Patrick Meade","title":"Precision Higgs Width and Couplings with a High Energy Muon Collider","comments":"28 pages plus appendices, minor changes","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The interpretation of Higgs data is typically based on different assumptions\nabout whether there can be additional decay modes of the Higgs or if any\ncouplings can be bounded by theoretical arguments. Going beyond these\nassumptions requires either a precision measurement of the Higgs width or an\nabsolute measurement of a coupling to eliminate a flat direction in precision\nfits that occurs when $|g_{hVV}/g_{hVV}^{SM}|>1$. In this paper we explore how\nwell a high energy muon collider can test Higgs physics without having to make\nassumptions on the total width of the Higgs. In particular, we investigate\noff-shell methods for Higgs production used at the LHC and searches for\ninvisible decays of the Higgs to see how powerful they are at a muon collider.\nWe then investigate the theoretical requirements on a model which can exist in\nsuch a flat direction. Combining expected Higgs precision with other\nconstraints, the most dangerous flat direction is described by generalized\nGeorgi-Machacek models. We find that by combining direct searches with Higgs\nprecision, a high energy muon collider can robustly test single Higgs precision\ndown to the $\\mathcal{O}(.1\\%)$ level without having to assume SM Higgs decays.\nFurthermore, it allows one to bound new contributions to the width at the\nsub-percent level as well. Finally, we comment on how even in this difficult\nflat direction for Higgs precision, a muon collider can robustly test or\ndiscover new physics in multiple ways. Expanding beyond simple coupling\nmodifiers/EFTs, there is a large region of parameter space that muon colliders\ncan explore for EWSB that is not probed with only standard Higgs precision\nobservables.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:00 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 13:02:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Forslund","Matthew",""],["Meade","Patrick",""]]}
{"id":"2308.02634","submitter":"Yikun Wang","authors":"Yufeng Du, Clara Murgui, Kris Pardo, Yikun Wang, Kathryn M. Zurek","title":"Contrast Loss from Astrophysical Backgrounds in Space-Based Matter-Wave\n  Interferometers","comments":"30 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"CALT-TH/2023-030","categories":"quant-ph astro-ph.CO hep-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Atom and matter interferometers are precise quantum sensing experiments that\ncan probe differential forces along separated spacetime paths. Various atom and\nmatter interferometer experiments have been proposed to study dark matter,\ngravitational waves, and exotic new physics. Increasingly, these experimental\nconcepts have proposed space-based designs to maximize interrogation times and\nbaselines. However, decoherence and phase shifts caused by astrophysical\nbackgrounds could largely undermine or destroy the target sensitivity of the\nexperiments. We calculate the decoherence effects induced by solar photons, the\nsolar wind, cosmic rays, solar neutrinos and zodiacal dust on space-based atom\nand matter interferometers. We find that, in future space-based atom and matter\ninterferometers, the solar wind generically produces decoherence beyond the\nquantum noise limit, without proper shielding. In addition, solar photons are\nalso an important background for matter interferometers.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Du","Yufeng",""],["Murgui","Clara",""],["Pardo","Kris",""],["Wang","Yikun",""],["Zurek","Kathryn M.",""]]}
{"id":"2308.02635","submitter":"Fabio Rosario Ditrani","authors":"F. R. Ditrani, M. Longhetti, F. La Barbera, A. Iovino, L. Costantin,\n  S. Zibetti, A. Gallazzi, M. Fossati, J. Angthopo, Y. Ascasibar, B. Poggianti,\n  P. S\\'anchez-Bl\\'azquez, M. Balcells, M. Bianconi, M. Bolzonella, L. P.\n  Cassar\\`a, O. Cucciati, G. Dalton, A. Ferr\\'e-Mateu, R. Garc\\'ia-Benito, B.\n  Granett, M. Gullieuszik, A. Ikhsanova, S. Jin, J. H. Knapen, S. McGee, A.\n  Mercurio, L. Morelli, A. Moretti, D. Murphy, A. Pizzella, L. Pozzetti, C.\n  Spiniello, C. Tortora, S. C. Trager, A. Vazdekis, D. Vergani, and B. Vulcani","title":"Stellar metallicity from optical and UV spectral indices: Test case for\n  WEAVE-StePS","comments":"16 pages, 14 figures. Submitted 31/03/2023, Accepted 20/07/2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The upcoming generation of optical spectrographs on four meter-class\ntelescopes, with their huge multiplexing capabilities, excellent spectral\nresolution, and unprecedented wavelength coverage, will provide high-quality\nspectra for thousands of galaxies. These data will allow us to examine of the\nstellar population properties at intermediate redshift, an epoch that remains\nunexplored by large and deep surveys. We assess our capability to retrieve the\nmean stellar metallicity in galaxies at different redshifts and S/N, while\nsimultaneously exploiting the UV and optical rest-frame wavelength coverage.\nThe work is based on a comprehensive library of spectral templates of stellar\npopulations, covering a wide range of age and metallicity values and built\nassuming various SFHs. We simulated realistic observations of a large sample of\ngalaxies carried out with WEAVE at the WHT at different redshifts and S/N\nvalues. We measured all the reliable indices on the simulated spectra and on\nthe comparison library. We then adopted a Bayesian approach to obtain the\nprobability distribution of stellar metallicity. The analysis of the spectral\nindices has shown how some mid-UV indices can provide reliable constraints on\nstellar metallicity, along with optical indicators. The analysis of the mock\nobservations has shown that even at S/N=10, the metallicity can be derived\nwithin 0.3 dex, in particular, for stellar populations older than 2 Gyr. Our\nresults are in good agreement with other theoretical and observational works in\nthe literature and show how the UV indicators can be advantageous in\nconstraining metallicities. This is very promising for the upcoming surveys\ncarried out with new, highly multiplexed, large-field spectrographs, such as\nStePS at the WEAVE and 4MOST, which will provide spectra of thousands of\ngalaxies covering large spectral ranges at relatively high S/N.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ditrani","F. R.",""],["Longhetti","M.",""],["La Barbera","F.",""],["Iovino","A.",""],["Costantin","L.",""],["Zibetti","S.",""],["Gallazzi","A.",""],["Fossati","M.",""],["Angthopo","J.",""],["Ascasibar","Y.",""],["Poggianti","B.",""],["S\u00e1nchez-Bl\u00e1zquez","P.",""],["Balcells","M.",""],["Bianconi","M.",""],["Bolzonella","M.",""],["Cassar\u00e0","L. P.",""],["Cucciati","O.",""],["Dalton","G.",""],["Ferr\u00e9-Mateu","A.",""],["Garc\u00eda-Benito","R.",""],["Granett","B.",""],["Gullieuszik","M.",""],["Ikhsanova","A.",""],["Jin","S.",""],["Knapen","J. H.",""],["McGee","S.",""],["Mercurio","A.",""],["Morelli","L.",""],["Moretti","A.",""],["Murphy","D.",""],["Pizzella","A.",""],["Pozzetti","L.",""],["Spiniello","C.",""],["Tortora","C.",""],["Trager","S. C.",""],["Vazdekis","A.",""],["Vergani","D.",""],["Vulcani","B.",""]]}
{"id":"2308.02636","submitter":"Jacky H. T. Yip","authors":"Jacky H. T. Yip, Adam Rouhiainen, Gary Shiu","title":"Learning from Topology: Cosmological Parameter Estimation from the\n  Large-scale Structure","comments":"7 pages, 4 figures. Accepted to the Synergy of Scientific and Machine\n  Learning Modeling Workshop (ICML 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO cs.LG math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The topology of the large-scale structure of the universe contains valuable\ninformation on the underlying cosmological parameters. While persistent\nhomology can extract this topological information, the optimal method for\nparameter estimation from the tool remains an open question. To address this,\nwe propose a neural network model to map persistence images to cosmological\nparameters. Through a parameter recovery test, we demonstrate that our model\nmakes accurate and precise estimates, considerably outperforming conventional\nBayesian inference approaches.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yip","Jacky H. T.",""],["Rouhiainen","Adam",""],["Shiu","Gary",""]]}
{"id":"2308.02637","submitter":"Cooper Jacobus","authors":"Cooper Jacobus, Peter Harrington, Zarija Luki\\'c","title":"Reconstructing Lyman-$\\alpha$ Fields from Low-Resolution Hydrodynamical\n  Simulations with Deep Learning","comments":"13 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrodynamical cosmological simulations are a powerful tool for accurately\npredicting the properties of the intergalactic medium (IGM) and for producing\nmock skies that can be compared against observational data. However, the need\nto resolve density fluctuation in the IGM puts a stringent requirement on the\nresolution of such simulations which in turn limits the volumes which can be\nmodelled, even on most powerful supercomputers. In this work, we present a\nnovel modeling method which combines physics-driven simulations with\ndata-driven generative neural networks to produce outputs that are\nqualitatively and statistically close to the outputs of hydrodynamical\nsimulations employing 8 times higher resolution. We show that the Ly-$\\alpha$\nflux field, as well as the underlying hydrodynamic fields, have greatly\nimproved statistical fidelity over a low-resolution simulation. Importantly,\nthe design of our neural network allows for sampling multiple realizations from\na given input, enabling us to quantify the model uncertainty. Using test data,\nwe demonstrate that this model uncertainty correlates well with the true error\nof the Ly-$\\alpha$ flux prediction. Ultimately, our approach allows for\ntraining on small simulation volumes and applying it to much larger ones,\nopening the door to producing accurate Ly-$\\alpha$ mock skies in volumes of\nHubble size, as will be probed with DESI and future spectroscopic sky surveys.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jacobus","Cooper",""],["Harrington","Peter",""],["Luki\u0107","Zarija",""]]}
{"id":"2308.02638","submitter":"Daniele Guerci","authors":"Daniele Guerci, Yuncheng Mao and Christophe Mora","title":"Nature of even and odd magic angles in helical twisted trilayer graphene","comments":"14 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Helical twisted trilayer graphene exhibits zero-energy flat bands with large\ndegeneracy in the chiral limit. The flat bands emerge at a discrete set of\nmagic twist angles and feature properties intrinsically distinct from those\nrealized in twisted bilayer graphene. Their degeneracy and the associated band\nChern numbers depend on the parity of the magic angles. Two degenerate flat\nbands with Chern numbers $C_A=2$ and $C_B=-1$ arise at odd magic angles,\nwhereas even magic angles display four flat bands, with Chern number\n$C_{A/B}=\\pm1$, together with a Dirac cone crossing at zero energy. All bands\nare sublattice polarized. We demonstrate the structure behind these flat bands\nand obtain analytical expressions for the wavefunctions in all cases. Each\nmagic angle is identified with the vanishing of a zero-mode wavefunction at\nhigh-symmetry position and momentum. The whole analytical structure results\nfrom whether the vanishing is linear or quadratic for the, respectively, odd\nand even magic angle. The $C_{3z}$ and $C_{2y}T$ symmetries are shown to play a\nkey role in establishing the flat bands. In contrast, the particle-hole\nsymmetry is not essential, except from gapping out the crossing Dirac cone at\neven magic angles.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guerci","Daniele",""],["Mao","Yuncheng",""],["Mora","Christophe",""]]}
{"id":"2308.02639","submitter":"Richard Balka","authors":"Rich\\'ard Balka, Tam\\'as Keleti","title":"Lipschitz images and dimensions","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the question which compact metric spaces can be obtained as a\nLipschitz image of the middle third Cantor set, or more generally, as a\nLipschitz image of a subset of a given compact metric space.\n  In the general case we prove that if $A$ and $B$ are compact metric spaces\nand the Hausdorff dimension of $A$ is bigger than the upper box dimension of\n$B$, then there exist a compact set $A'\\subset A$ and a Lipschitz onto map\n$f\\colon A'\\to B$.\n  As a corollary we prove that any `natural' dimension in $\\mathbb{R}^n$ must\nbe between the Hausdorff and upper box dimensions.\n  We show that if $A$ and $B$ are self-similar sets with the strong separation\ncondition with equal Hausdorff dimension and $A$ is homogeneous, then $A$ can\nbe mapped onto $B$ by a Lipschitz map if and only if $A$ and $B$ are\nbilipschitz equivalent.\n  For given $\\alpha>0$ we also give a characterization of those compact metric\nspaces that can be obtained as an $\\alpha$-H\\\"older image of a compact subset\nof $\\mathbb{R}$. The quantity we introduce for this turns out to be closely\nrelated to the upper box dimension.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Balka","Rich\u00e1rd",""],["Keleti","Tam\u00e1s",""]]}
{"id":"2308.02640","submitter":"Ahmed Sabbah","authors":"Ahmed Sabbah, Mohammed Kharma, Mustafa Jarrar","title":"Creating Android Malware Knowledge Graph Based on a Malware Ontology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  As mobile and smart connectivity continue to grow, malware presents a\npermanently evolving threat to different types of critical domains such as\nhealth, logistics, banking, and community segments. Different types of malware\nhave dynamic behaviors and complicated characteristics that are shared among\nmembers of the same malware family. Malware threat intelligence reports play a\ncrucial role in describing and documenting the detected malware, providing a\nwealth of information regarding its attributes, patterns, and behaviors. There\nis a large amount of intelligent threat information regarding malware. The\nontology allows the systematic organization and categorization of this\ninformation to ensure consistency in representing concepts and entities across\nvarious sources. In this study, we reviewed and extended an existing malware\nontology to cover Android malware. Our extended ontology is called AndMalOnt.\nIt consisted of 13 new classes, 16 object properties, and 31 data properties.\nSecond, we created an Android malware knowledge graph by extracting reports\nfrom the MalwareBazaar repository and representing them in AndMalOnt. This\ninvolved generating a knowledge graph that encompasses over 2600 malware\nsamples. Our ontology, knowledge graph, and source code are all open-source and\naccessible via GitHub\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sabbah","Ahmed",""],["Kharma","Mohammed",""],["Jarrar","Mustafa",""]]}
{"id":"2308.02641","submitter":"Evgeny Pchelintsev","authors":"S.B. Kologrivova, E.A. Pchelintsev","title":"Improved parameter estimation for a family of exponential distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider the problem of parameter estimating for a family\nof exponential distributions. We develop the improved estimation method, which\ngeneralized the James--Stein approach for a wide class of distributions. The\nproposed estimator dominates the classical maximum likelihood estimator under\nthe quadratic risk. The estimating procedure is applied to special cases of\ndistributions. The numerical simulations results are given.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:00:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kologrivova","S. B.",""],["Pchelintsev","E. A.",""]]}
{"id":"2308.02642","submitter":"Nikita Zemlevskiy","authors":"Nikita A. Zemlevskiy, Henry F. Froland, Stephan Caspar","title":"Optimization of Algorithmic Errors in Analog Quantum Simulations","comments":"18 pages, 8 figures, comments welcome","journal-ref":null,"doi":null,"report-no":"IQuS@UW-21-059","categories":"quant-ph cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analog quantum simulation is emerging as a powerful tool for uncovering\nclassically unreachable physics such as many-body real-time dynamics. We study\na class of errors for approximate time evolution algorithms in Heisenberg-type\nsystems on analog quantum devices described by the Ising Hamiltonian. A general\nframework for quantifying these errors is introduced and applied to several\nproposed time evolution methods, including Trotter-like methods and\nFloquet-engineered constant-field approaches. This analysis explains the\ninterplay of different error sources arising from approximations to the\npropagator of a physical theory. The limitations placed on the accuracy of time\nevolution methods by current devices are discussed. Characterization of the\nerror scaling provides a way to extend the presented Hamiltonian engineering\nmethods to take advantage of forthcoming device capabilities.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:01:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zemlevskiy","Nikita A.",""],["Froland","Henry F.",""],["Caspar","Stephan",""]]}
{"id":"2308.02643","submitter":"Fabio Sciarrino","authors":"Valeria Cimini, Mauro Valeri, Simone Piacentini, Francesco Ceccarelli,\n  Giacomo Corrielli, Roberto Osellame, Nicol\\`o Spagnolo, and Fabio Sciarrino","title":"Variational quantum algorithm for experimental photonic multiparameter\n  estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Variational quantum metrology represents a powerful tool for optimizing\ngeneric estimation strategies, combining the principles of variational\noptimization with the techniques of quantum metrology. Such optimization\nprocedures result particularly effective for multiparameter estimation\nproblems, where traditional approaches, requiring prior knowledge of the system\nbehavior, often suffer from limitations due to the curse of dimensionality and\ncomputational complexity. To overcome these challenges, we develop a\nvariational approach able to efficiently optimize a multiparameter quantum\nphase sensor operating in a noisy environment. By exploiting the high\nreconfigurability of an integrated photonic device, we implement a hybrid\nquantum-classical feedback loop able to enhance the estimation performances,\ncombining classical optimization techniques with quantum circuit evaluations.\nThe latter allows us to compute the system partial derivatives with respect to\nthe variational parameters by applying the parameter-shift rule, and thus\nreconstruct experimentally the Fisher information matrix. This in turn is\nadopted as the cost function of a derivative-free classical learning algorithm\nrun to optimize the measurement settings. Our experimental results reveal\nsignificant improvements in terms of estimation accuracy and noise robustness,\nhighlighting the potential of the implementation of variational techniques for\npractical applications in quantum sensing and more generally for quantum\ninformation processing with photonic circuits.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:01:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cimini","Valeria",""],["Valeri","Mauro",""],["Piacentini","Simone",""],["Ceccarelli","Francesco",""],["Corrielli","Giacomo",""],["Osellame","Roberto",""],["Spagnolo","Nicol\u00f2",""],["Sciarrino","Fabio",""]]}
{"id":"2308.02644","submitter":"Javad Mirzaei Mr.","authors":"Javad Mirzaei, Ibrahim Abualhaol, and Gwenael Poitau","title":"Network Digital Twin for Open RAN: The Key Enablers, Standardization,\n  and Use Cases","comments":"7 Pages, 4 Figures, 3 Tabels","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The open radio access network (O-RAN), with its disaggregated and open\narchitecture, is poised to meet the demands of the next generation of wireless\ncommunication. However, to unlock the full potentials of O-RAN, real-time\nnetwork modeling and optimization are essential. A promising solution for such\nrequirement is the use of network digital twin (NDT). NDT provides a\ncomprehensive view of a network, covering both physical and logical components,\nincluding infrastructure, protocols, and algorithms. NDT, as a real-time\nvirtual representation of O-RAN facilitates a variety of operations, such as\nemulations, test, optimization, monitoring, and analysis of a new configuration\nin a risk-free environment, without requiring them to be implemented in real\nnetwork. Such capability enables the vendors and network operators for a faster\nadoption of new solutions with frequent updates, while ensuring the resiliency\nof the existing services via planning ahead under various \"what-if\" scenarios.\nIn this paper, we first describe what exactly NDT means in the context of\nO-RAN, as well as its key enablers. We then describe the NDT application within\nthe O-RAN in both prior and post-deployment. Finally, we provide two practical\nuses cases, namely network energy efficiency and traffic steering, where the\nNDT can be leveraged effectively.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:06:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mirzaei","Javad",""],["Abualhaol","Ibrahim",""],["Poitau","Gwenael",""]]}
{"id":"2308.02645","submitter":"Francesca Fornasini","authors":"Francesca M. Fornasini, Vallia Antoniou and Guillaume Dubus","title":"High-mass X-ray Binaries","comments":"Invited chapter for Handbook of X-ray and Gamma-ray Astrophysics, 44\n  pages of text, 11 pages of references, 18 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Binary systems in which a neutron star or black hole accretes material from a\nhigh-mass star are known as high-mass X-ray binaries (HMXBs). This chapter\nprovides a brief introduction to the physics of wind accretion and an\nobservational view of HMXBs, including their classification, X-ray spectra,\nX-ray variability, orbital and compact object properties, as well as studies of\nGalactic and Magellanic HMXB populations. Two classes of X-ray sources whose\npossible connections to HMXBs have been debated, ultraluminous X-ray sources\nand gamma-ray binaries, are also discussed. Approximately 300 HMXBs residing\neither in the Milky Way or the Magellanic Clouds have been discovered. The\nmajority of these HMXBs host wind-accreting neutron stars. Their X-ray\nproperties depend both on the interaction of the accreting material with the\nneutron star's strong magnetic field and the properties of the donor star's\nwind. Most HMXBs are classified as either supergiant XBs or Be XBs based on the\nspectral type of the donor star; these classes exhibit different patterns of\nX-ray variability and occupy different phase space in diagrams of neutron star\nspin versus orbital period. While studies of HMXBs in the Milky Way and\nMagellanic Clouds find that their luminosity functions have similar shapes, an\noverabundance of Be XBs in the Small Magellanic Cloud points to important\nvariations of the HMXB population with metallicity and age.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:06:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fornasini","Francesca M.",""],["Antoniou","Vallia",""],["Dubus","Guillaume",""]]}
{"id":"2308.02646","submitter":"Stefan Ilic","authors":"Stefan Ilic, Julia S. Meyer, and Manuel Houzet","title":"Spectral properties of disordered Ising superconductors with singlet and\n  triplet pairing in in-plane magnetic fields","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the spectral properties of disordered superconductors with Ising\nspin-orbit coupling (ISOC) subjected to in-plane magnetic fields. In addition\nto the conventional singlet pairing, we also consider the recently proposed\nequal-spin triplet pairing, which couples to the singlet at finite in-plane\nmagnetic fields. While both singlet and triplet order parameters are immune to\nintravalley scattering, they are significantly affected by intervalley\nscattering. In the realistic regime of strong ISOC, we find that the properties\nof the superconductor are well described by a simple formula reminiscent of the\nwell-known Abrikosov-Gor'kov theory, but with a modified self-consistency\ncondition. Our results enable straightforward self-consistent calculation of\nsinglet and triplet order parameters and the density of states of disordered\nIsing superconductors, which can be particularly useful for interpreting recent\ntunneling spectroscopy experiments in these systems. We also investigate the\nhigh-energy features in the density of states, the so-called mirage gaps, and\ndiscuss how they are modified by triplet pairing.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:06:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ilic","Stefan",""],["Meyer","Julia S.",""],["Houzet","Manuel",""]]}
{"id":"2308.02647","submitter":"M. Schuyler Moss","authors":"M. Schuyler Moss, Sepehr Ebadi, Tout T. Wang, Giulia Semeghini,\n  Annabelle Bohrdt, Mikhail D. Lukin, and Roger G. Melko","title":"Enhancing variational Monte Carlo using a programmable quantum simulator","comments":"15 pages, 9 figures","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":"  Programmable quantum simulators based on Rydberg atom arrays are a\nfast-emerging quantum platform, bringing together long coherence times,\nhigh-fidelity operations, and large numbers of interacting qubits\ndeterministically arranged in flexible geometries. Today's Rydberg array\ndevices are demonstrating their utility as quantum simulators for studying\nphases and phase transitions in quantum matter. In this paper, we show that\nunprocessed and imperfect experimental projective measurement data can be used\nto enhance in silico simulations of quantum matter, by improving the\nperformance of variational Monte Carlo simulations. As an example, we focus on\ndata spanning the disordered-to-checkerboard transition in a $16 \\times 16$\nsquare lattice array [S. Ebadi et al. Nature 595, 227 (2021)] and employ\ndata-enhanced variational Monte Carlo to train powerful autoregressive\nwavefunction ans\\\"atze based on recurrent neural networks (RNNs). We observe\nuniversal improvements in the convergence times of our simulations with this\nhybrid training scheme. Notably, we also find that pre-training with\nexperimental data enables relatively simple RNN ans\\\"atze to accurately capture\nphases of matter that are not learned with a purely variational training\napproach. Our work highlights the promise of hybrid quantum--classical\napproaches for large-scale simulation of quantum many-body systems, combining\nautoregressive language models with experimental data from existing quantum\ndevices.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:08:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moss","M. Schuyler",""],["Ebadi","Sepehr",""],["Wang","Tout T.",""],["Semeghini","Giulia",""],["Bohrdt","Annabelle",""],["Lukin","Mikhail D.",""],["Melko","Roger G.",""]]}
{"id":"2308.02648","submitter":"Haoran Geng","authors":"Haoran Geng, Jianqiao Mo, Dayane Reis, Jonathan Takeshita, Taeho Jung,\n  Brandon Reagen, Michael Niemier, Xiaobo Sharon Hu","title":"Privacy Preserving In-memory Computing Engine","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Privacy has rapidly become a major concern/design consideration. Homomorphic\nEncryption (HE) and Garbled Circuits (GC) are privacy-preserving techniques\nthat support computations on encrypted data. HE and GC can complement each\nother, as HE is more efficient for linear operations, while GC is more\neffective for non-linear operations. Together, they enable complex computing\ntasks, such as machine learning, to be performed exactly on ciphertexts.\nHowever, HE and GC introduce two major bottlenecks: an elevated computational\noverhead and high data transfer costs. This paper presents PPIMCE, an in-memory\ncomputing (IMC) fabric designed to mitigate both computational overhead and\ndata transfer issues. Through the use of multiple IMC cores for high\nparallelism, and by leveraging in-SRAM IMC for data management, PPIMCE offers a\ncompact, energy-efficient solution for accelerating HE and GC. PPIMCE achieves\na 107X speedup against a CPU implementation of GC. Additionally, PPIMCE\nachieves a 1,500X and 800X speedup compared to CPU and GPU implementations of\nCKKS-based HE multiplications. For privacy-preserving machine learning\ninference, PPIMCE attains a 1,000X speedup compared to CPU and a 12X speedup\nagainst CraterLake, the state-of-art privacy preserving computation\naccelerator.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:10:17 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 16:35:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Geng","Haoran",""],["Mo","Jianqiao",""],["Reis","Dayane",""],["Takeshita","Jonathan",""],["Jung","Taeho",""],["Reagen","Brandon",""],["Niemier","Michael",""],["Hu","Xiaobo Sharon",""]]}
{"id":"2308.02649","submitter":"Christopher Williams","authors":"Daniel Barrera Salazar, Andrew Graham, Chris Williams","title":"On $p$-refined Friedberg-Jacquet integrals and the classical symplectic\n  locus in the $\\mathrm{GL}_{2n}$ eigenvariety","comments":"39 pages; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Friedberg--Jacquet proved that if $\\pi$ is a cuspidal automorphic\nrepresentation of $\\mathrm{GL}_{2n}(\\mathbb{A})$, $\\pi$ is a functorial\ntransfer from $\\mathrm{GSpin}_{2n+1}$ if and only if a global zeta integral\n$Z_H$ over $H = \\mathrm{GL}_n \\times \\mathrm{GL}_n$ is non-vanishing on $\\pi$.\nWe conjecture a $p$-refined analogue: that any $P$-parahoric $p$-refinement\n$\\tilde\\pi^P$ is a functorial transfer from $\\mathrm{GSpin}_{2n+1}$ if and only\nif a $P$-twisted version of $Z_H$ is non-vanishing on the\n$\\tilde\\pi^P$-eigenspace in $\\pi$. This twisted $Z_H$ appears in all\nconstructions of $p$-adic $L$-functions via Shalika models.\n  We prove various results towards the conjecture by connecting it to the study\nof classical symplectic families in the $\\mathrm{GL}_{2n}$ eigenvariety. If\n$\\pi$ is spherical at $p$, there are $(2n)!$ attached $p$-refinements to\nIwahori level; we conjecture the dimensions of such families through each of\nthese, prove the upper bound unconditionally, and (by constructing the\nfamilies) prove the lower bound under a non-critical slope assumption. For\nexample, for $\\mathrm{GL}_4$, we conjecture that (modulo 1-dimensional trivial\nvariation) 8 refinements vary in 2-dimensional symplectic families, 8 in\n1-dimensional symplectic families, and prove 8 do not vary in any symplectic\nfamily.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:11:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Salazar","Daniel Barrera",""],["Graham","Andrew",""],["Williams","Chris",""]]}
{"id":"2308.02650","submitter":"Abhijit Majumder","authors":"Abhijit Majumder, Aaron Angerami, Ritu Arora, Steffen Bass, Shanshan\n  Cao, Yi Chen, Raymond Ehlers, Hannah Elfner, Wenkai Fan, Rainer J. Fries,\n  Charles Gale, Yayun He, Ulrich Heinz, Barbara Jacak, Peter Jacobs, Sangyong\n  Jeon, Yi Ji, Lauren Kasper, Michael Kordell II, Amit Kumar, Joseph Latessa,\n  Yen-Jie Lee, Roy Lemmon, Dananjaya Liyanage, Arthur Lopez, Matt Luzum, Simon\n  Mak, Andi Mankolli, Christal Martin, Haydar Mehryar, Tanner Mengel, James\n  Mulligan, Christine Nattrass, Jaime Norman, Jean-Francois Paquet, Cameron\n  Parker, Joern H. Putschke, Gunther Roland, Bjoern Schenke, Loren Schwiebert,\n  Arjun Sengupta, Chun Shen, Chathuranga Sirimanna, Ron A. Soltz, Ismail Soudi,\n  Michael Strickland, Yasuki Tachibana, Julia Velkovska, Gojko Vujanovic,\n  Xin-Nian Wang, Wenbin Zhao","title":"A multistage framework for studying the evolution of jets and high-$p_T$\n  probes in small collision systems","comments":"6 pages, 6 figures, Proceedings of Hard Probes 2023, 26-31 March 2023\n  Aschaffenburg, Germany","journal-ref":"Proceedings of Science (Hard Probes 2023) 2023","doi":null,"report-no":null,"categories":"hep-ph nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the modification of jets and high-$p_T$ probes in small systems\nrequires the integration of soft and hard physics. We present recent\ndevelopments in extending the JETSCAPE framework to build an event generator,\nwhich includes correlations between soft and hard partons, to study jet\nobservables in small systems. The multi-scale physics of the collision is\nseparated into different stages. Hard scatterings are first sampled at binary\ncollision positions provided by the Glauber geometry. They are then propagated\nbackward in space-time following an initial-state shower to obtain the\ninitiating partons' energies and momenta before the collision. These energies\nand momenta are then subtracted from the incoming colliding nucleons for\nsoft-particle production, modeled by the 3D-Glauber + hydrodynamics + hadronic\ntransport framework. This new hybrid approach (X-SCAPE) includes non-trivial\ncorrelations between jet and soft particle productions in small systems. We\ncalibrate this framework with the final state hadrons' $p_T$-spectra from low\nto high $p_T$ in $p$-$p$, and and then compare with the spectra in $p$-$Pb$\ncollisions from the LHC. We also present results for additional observables\nsuch as the distributions of event activity as a function of the hardest jet\n$p_T$ in forward and mid-rapidity for both $p$-$p$ and $p$-$Pb$ collisions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:11:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Majumder","Abhijit",""],["Angerami","Aaron",""],["Arora","Ritu",""],["Bass","Steffen",""],["Cao","Shanshan",""],["Chen","Yi",""],["Ehlers","Raymond",""],["Elfner","Hannah",""],["Fan","Wenkai",""],["Fries","Rainer J.",""],["Gale","Charles",""],["He","Yayun",""],["Heinz","Ulrich",""],["Jacak","Barbara",""],["Jacobs","Peter",""],["Jeon","Sangyong",""],["Ji","Yi",""],["Kasper","Lauren",""],["Kordell","Michael","II"],["Kumar","Amit",""],["Latessa","Joseph",""],["Lee","Yen-Jie",""],["Lemmon","Roy",""],["Liyanage","Dananjaya",""],["Lopez","Arthur",""],["Luzum","Matt",""],["Mak","Simon",""],["Mankolli","Andi",""],["Martin","Christal",""],["Mehryar","Haydar",""],["Mengel","Tanner",""],["Mulligan","James",""],["Nattrass","Christine",""],["Norman","Jaime",""],["Paquet","Jean-Francois",""],["Parker","Cameron",""],["Putschke","Joern H.",""],["Roland","Gunther",""],["Schenke","Bjoern",""],["Schwiebert","Loren",""],["Sengupta","Arjun",""],["Shen","Chun",""],["Sirimanna","Chathuranga",""],["Soltz","Ron A.",""],["Soudi","Ismail",""],["Strickland","Michael",""],["Tachibana","Yasuki",""],["Velkovska","Julia",""],["Vujanovic","Gojko",""],["Wang","Xin-Nian",""],["Zhao","Wenbin",""]]}
{"id":"2308.02651","submitter":"Rico Zenklusen","authors":"Vera Traub and Laura Vargas Koch and Rico Zenklusen","title":"Single-Source Unsplittable Flows in Planar Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The single-source unsplittable flow (SSUF) problem asks to send flow from a\ncommon source to different terminals with unrelated demands, each terminal\nbeing served through a single path. One of the most heavily studied SSUF\nobjectives is to minimize the violation of some given arc capacities. A seminal\nresult of Dinitz, Garg, and Goemans showed that, whenever a fractional flow\nexists respecting the capacities, then there is an unsplittable one violating\nthe capacities by at most the maximum demand. Goemans conjectured a very\nnatural cost version of the same result, where the unsplittable flow is\nrequired to be no more expensive than the fractional one. This intriguing\nconjecture remains open. More so, there are arguably no non-trivial graph\nclasses for which it is known to hold.\n  We show that a slight weakening of it (with at most twice as large\nviolations) holds for planar graphs. Our result is based on a connection to a\nhighly structured discrepancy problem, whose repeated resolution allows us to\nsuccessively reduce the number of paths used for each terminal, until we obtain\nan unsplittable flow. Moreover, our techniques also extend to simultaneous\nupper and lower bounds on the flow values. This also affirmatively answers a\nconjecture of Morell and Skutella for planar SSUF.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:11:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Traub","Vera",""],["Koch","Laura Vargas",""],["Zenklusen","Rico",""]]}
{"id":"2308.02652","submitter":"Ullrich K\\\"othe","authors":"Ullrich K\\\"othe","title":"A Review of Change of Variable Formulas for Generative Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Change-of-variables (CoV) formulas allow to reduce complicated probability\ndensities to simpler ones by a learned transformation with tractable Jacobian\ndeterminant. They are thus powerful tools for maximum-likelihood learning,\nBayesian inference, outlier detection, model selection, etc. CoV formulas have\nbeen derived for a large variety of model types, but this information is\nscattered over many separate works. We present a systematic treatment from the\nunifying perspective of encoder/decoder architectures, which collects 28 CoV\nformulas in a single place, reveals interesting relationships between seemingly\ndiverse methods, emphasizes important distinctions that are not always clear in\nthe literature, and identifies surprising gaps for future research.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:12:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["K\u00f6the","Ullrich",""]]}
{"id":"2308.02653","submitter":"Shantanu Rane","authors":"Jonathan Bachman, Sujit Chakravorti, Shantanu Rane and Krishnan\n  Thyagarajan","title":"Incentivizing Gigaton-Scale Carbon Dioxide Removal via a\n  Climate-Positive Blockchain","comments":"20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A new crypto token is proposed as an incentive mechanism to remove CO2 from\nthe atmosphere permanently at gigaton scale. The token facilitates CO2 removal\n(CDR) by providing financial incentives to those that are removing CO2 and an\nopportunity to provide additional financial resources for CDR by the public.\nThe new token will be native to a blockchain that uses a Proof-of-Useful-Work\n(PoUW) consensus mechanism. The useful work will be conducted by direct air\ncarbon capture and storage (DACCS) facilities that will compete with each other\nbased on the amount of CO2 captured and permanently stored. In terms of energy\nconsumption, we require that the entire process, comprising DACCS technology\nand all blockchain operations, be climate positive while accounting for life\ncycle analysis of equipment used. We describe the underlying reward mechanism\ncoupled with a verification mechanism for CDR. In addition, we consider\nsecurity features to limit attacks and fraudulent activity. Finally, we outline\na roadmap of features that are necessary to fully implement and deploy such a\nsystem, but are beyond the current scope of this article.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:15:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bachman","Jonathan",""],["Chakravorti","Sujit",""],["Rane","Shantanu",""],["Thyagarajan","Krishnan",""]]}
{"id":"2308.02654","submitter":"Priyamvada Natarajan","authors":"Priyamvada Natarajan (1,2,3), Fabio Pacucci (3,4), Angelo Ricarte\n  (3,4), Akos Bogdan (4), Andy D. Goulding (5) and Nico Cappelluti (6) ((1)\n  Department of Astronomy, Yale University, New Haven, CT 06511, (2) Department\n  of Physics, Yale University, New Haven, CT 06520, (3) Black Hole Initiative,\n  Harvard University, 20 Garden Street, Cambridge, MA 02138, (4) Center for\n  Astrophysics | Harvard and Smithsonian, 60 Garden Street, Cambridge, MA\n  02138, (5) Department of Astrophysical Sciences, Princeton University,\n  Princeton, NJ 08544, (6) Department of Physics, University of Miami, Coral\n  Gables, FL 33124)","title":"First Detection of an Over-Massive Black Hole Galaxy: UHZ1 -- Evidence\n  for Heavy Black Hole Seeds From Direct Collapse?","comments":"10 pages, submitted to ApJ Letters, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent Chandra-JWST discovery of a quasar in the z ~ 10.3 galaxy UHZ1\nreveals that accreting supermassive black holes (SMBHs) were already in place ~\n450 million years after the Big Bang (Bogdan et al. 2023). The Chandra X-ray\nsource detected in UHZ1 is a Compton-thick quasar with a bolometric luminosity\nof $L_{\\rm bol} \\sim 5\\times10^{45}\\ \\rm{erg\\ s^{-1}},$ corresponding to a BH\nmass of $\\sim 4\\times 10^7 \\rm{M_{\\odot}}$ assuming Eddington accretion. JWST\nphotometry yields a stellar mass estimate for UHZ1 comparable to that of the BH\nmass. These characteristics are in excellent agreement with prior theoretical\npredictions for a unique class of transient, high-redshift objects, Outsize\nBlack Hole Galaxies (Natarajan et al. 2017) that harbor a heavy initial black\nhole seed that likely formed from the direct collapse of the gas. We assert\nthat UHZ1 is the first detected OBG candidate, due to the multiple lines of\nconcordant evidence between model predictions and observed properties of UHZ1:\nX-ray detection and the ratio of the X-ray flux to the IR flux as expected for\na heavy initial BH seed; high inferred redshift of z ~ 10.3, as predicted for\nthe transient OBG stage (9 < z < 12); amplitude and shape of the detected JWST\nSpectral Energy Distribution (SED), which is in very good agreement with\nsimulated template OBG SEDs; and the extended JWST morphology of UHZ1\nsuggestive of a recent merger, also as predicted. Therefore, as the first OBG\ncandidate, UHZ1 provides compelling evidence for the formation of heavy initial\nseeds from direct collapse in the early Universe.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:22:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Natarajan","Priyamvada",""],["Pacucci","Fabio",""],["Ricarte","Angelo",""],["Bogdan","Akos",""],["Goulding","Andy D.",""],["Cappelluti","Nico",""]]}
{"id":"2308.02655","submitter":"Theodore Anyika","authors":"Theodore Anyika, Ikjun Hong, Justus Ndukaife","title":"Optically assisted diffusophoretic tweezers using resonant plasmonic\n  bowtie nano-antennas","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":"  Plasmonic antennas, leveraging localized surface plasmon resonance (LSPR),\nhold significant promise for efficiently trapping nanoscale particles at low\npower levels. However, their effectiveness is hindered by photothermal effects\nin metallic nanoparticles, leading to repulsive thermophoretic forces. To\naddress this limitation, we propose a novel hybrid approach that combines\ndepletion attraction and photothermal effects inherent in plasmonic structures,\ncapitalizing on thermally induced concentration gradients. Through the\nthermophoretic depletion of polyethylene glycol (PEG) molecules around\nplasmonic hotspots, we create sharp concentration gradients, enabling precise\nlocalization of nanoscopic particles through a synergistic effect with\ndiffusophoretic forces. In our experiments, we successfully demonstrate the\ntrapping and dynamic 2D manipulation of 100 nm polystyrene beads, showcasing\nthe platform's potential for colloidal assembly at the nanoscale. Remarkably,\nthis method maintains highly stable trapping performance even at an incredibly\nlow 2.5 mW laser power, rendering it particularly appealing for applications\ninvolving biological species. Our study introduces a promising avenue for the\nprecise and efficient manipulation of sub-nanoscale particles, with\nwide-ranging implications in nanotechnology, biophysics, and nanomedicine. This\nresearch opens up new opportunities for advancing nanoscale particle studies\nand applications, ushering in a new era of nanoscale manipulation techniques.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:22:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Anyika","Theodore",""],["Hong","Ikjun",""],["Ndukaife","Justus",""]]}
{"id":"2308.02656","submitter":"Nikolai Krylov A","authors":"Nikolai A. Krylov","title":"Periodicity and Circulant Matrices in the Riordan Array of a Polynomial","comments":"25 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider Riordan arrays $\\bigl(1/(1-t^{d+1}), ~ tp(t)\\bigr)$. These are\ninfinite lower triangular matrices determined by the formal power series\n$1/(1-t^{d+1})$ and a polynomial $p(t)$ of degree $d$. Columns of such matrix\nare eventually periodic sequences with a period of $d + 1$, and circulant\nmatrices are used to describe the long term behavior of such periodicity when\nthe column's index grows indefinitely. We also discuss some combinatorially\ninteresting sequences that appear through the corresponding A - and Z -\nsequences of such Riordan arrays.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:29:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Krylov","Nikolai A.",""]]}
{"id":"2308.02657","submitter":"Heonjoon Park","authors":"Heonjoon Park, Jiaqi Cai, Eric Anderson, Yinong Zhang, Jiayi Zhu,\n  Xiaoyu Liu, Chong Wang, William Holtzmann, Chaowei Hu, Zhaoyu Liu, Takashi\n  Taniguchi, Kenji Watanabe, Jiun-haw Chu, Ting Cao, Liang Fu, Wang Yao, Cui-Zu\n  Chang, David Cobden, Di Xiao, Xiaodong Xu","title":"Observation of Fractionally Quantized Anomalous Hall Effect","comments":"15 pages, 4 figures for main text. 8 extended data figures","journal-ref":"Nature (2023)","doi":"10.1038/s41586-023-06536-0","report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integer quantum anomalous Hall (QAH) effect is a lattice analog of the\nquantum Hall effect at zero magnetic field. This striking transport phenomenon\noccurs in electronic systems with topologically nontrivial bands and\nspontaneous time-reversal symmetry breaking. Discovery of its putative\nfractional counterpart in the presence of strong electron correlations, i.e.,\nthe fractional quantum anomalous Hall (FQAH) effect, would open a new chapter\nin condensed matter physics. Here, we report the direct observation of both\ninteger and fractional QAH effects in electrical measurements on twisted\nbilayer MoTe$_2$. At zero magnetic field, near filling factor $\\nu = -1$ (one\nhole per moir\\'e unit cell) we see an extended integer QAH plateau in the Hall\nresistance $R_\\text{xy}$ that is quantized to $h/e^2 \\pm 0.1 \\%$ while the\nlongitudinal resistance $R_\\text{xx}$ vanishes. Remarkably, at $\\nu=-2/3$ and\n$-3/5$ we see plateau features in $R_\\text{xy}$ at $3h/2e^2 \\pm 1\\%$ and\n$5h/3e^2 \\pm 3\\%$, respectively, while $R_\\text{xx}$ remains small. All these\nfeatures shift linearly in an applied magnetic field with slopes matching the\ncorresponding Chern numbers $-1$, $-2/3$, and $-3/5$, precisely as expected for\ninteger and fractional QAH states. In addition, at zero magnetic field,\n$R_\\text{xy}$ is approximately $2h/e^2$ near half filling ($\\nu = -1/2$) and\nvaries linearly as $\\nu$ is tuned. This behavior resembles that of the\ncomposite Fermi liquid in the half-filled lowest Landau level of a\ntwo-dimensional electron gas at high magnetic field. Direct observation of the\nFQAH and associated effects paves the way for researching charge\nfractionalization and anyonic statistics at zero magnetic field.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:30:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Park","Heonjoon",""],["Cai","Jiaqi",""],["Anderson","Eric",""],["Zhang","Yinong",""],["Zhu","Jiayi",""],["Liu","Xiaoyu",""],["Wang","Chong",""],["Holtzmann","William",""],["Hu","Chaowei",""],["Liu","Zhaoyu",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Chu","Jiun-haw",""],["Cao","Ting",""],["Fu","Liang",""],["Yao","Wang",""],["Chang","Cui-Zu",""],["Cobden","David",""],["Xiao","Di",""],["Xu","Xiaodong",""]]}
{"id":"2308.02658","submitter":"Guram Mikaberidze","authors":"Guram Mikaberidze, Arthur Plaud, Raissa M. D'Souza","title":"Dragon kings in self-organized criticality systems","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spontaneous emergence of scale invariance, called self-organized\ncriticality (SOC), is often attributed to a second-order absorbing-state phase\ntransition (ASPT). Many real-world systems display SOC, yet extreme events are\noften overrepresented, causing significant disruption, and are called dragon\nkings (DK). We show analytically that the tradeoff between driving impulse and\ndissipation rate can create DKs in a second-order ASPT. This establishes that\nDKs exist in SOC systems, reveals a taxonomy of DKs, and shows that larger\ndissipation and smoother driving lower risk of extreme events.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:32:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mikaberidze","Guram",""],["Plaud","Arthur",""],["D'Souza","Raissa M.",""]]}
{"id":"2308.02659","submitter":"Daniele Venturi","authors":"Alec Dektor and Daniele Venturi","title":"Coordinate-adaptive integration of PDEs on tensor manifolds","comments":"14 pages, 6 figures","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":"  We introduce a new tensor integration method for time-dependent PDEs that\ncontrols the tensor rank of the PDE solution via time-dependent diffeomorphic\ncoordinate transformations. Such coordinate transformations are generated by\nminimizing the normal component of the PDE operator relative to the tensor\nmanifold that approximates the PDE solution via a convex functional. The\nproposed method significantly improves upon and may be used in conjunction with\nthe coordinate-adaptive algorithm we recently proposed in JCP (2023) Vol. 491,\n112378, which is based on non-convex relaxations of the rank minimization\nproblem and Riemannian optimization. Numerical applications demonstrating the\neffectiveness of the proposed coordinate-adaptive tensor integration method are\npresented and discussed for prototype Liouville and Fokker-Planck equations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:35:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dektor","Alec",""],["Venturi","Daniele",""]]}
{"id":"2308.02660","submitter":"Javier Carvajal-Rojas","authors":"Javier Carvajal-Rojas and Anne Fayolle","title":"On tame ramification and centers of $F$-purity","comments":"36 pages, comments are very much welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a notion of tame ramification for general finite covers. When\nspecialized to the separable case, it extends to higher dimensions the\nclassical notion of tame ramification for Dedekind domains and curves and sits\nnicely in between other notions of tame ramification in arithmetic geometry.\nHowever, when applied to the Frobenius map, it naturally yields the notion of\ncenter of $F$-purity (aka compatibly $F$-split subvariety). As an application,\nwe describe the behavior of centers of $F$-purity under finite covers -- it all\ncomes down to a transitivity property for tame ramification in towers.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:41:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Carvajal-Rojas","Javier",""],["Fayolle","Anne",""]]}
{"id":"2308.02661","submitter":"Gang Chen","authors":"Gang Chen","title":"On Paradoxical Phenomena During Evaporation and Condensation between Two\n  Parallel Plates","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Kinetic theory has long predicted that temperature inversion may happen in\nthe vapor-phase for evaporation and condensation between two parallel plates,\ni.e., the vapor temperature at the condensation interface is higher than that\nat the evaporation interface. However, past studies have neglected transport in\nthe liquid phases, which usually determine the evaporation and condensation\nrates. This disconnect has limited the acceptance of the kinetic theory in\npractical heat transfer models. In this paper, we combine interfacial\nconditions for mass and heat fluxes with continuum descriptions in the bulk\nregions of the vapor and the liquid phases to obtain a complete picture for the\nclassical problem of evaporation and condensation between two parallel plates.\nThe criterion for temperature inversion is rederived analytically. We also\nprove that the temperature jump at each interface is in the same direction as\nexternally applied temperature difference, i.e., liquid surface is at a higher\ntemperature than its adjacent vapor on the evaporating interface and at a lower\ntemperature than its adjacent vapor on the condensing interface. We explain the\ninterfacial temperature jump and temperature inversion using the interfacial\ncooling and heating processes, and we predict that this process can lead to a\nvapor phase temperature much lower than the lowest wall temperatures and much\nhigher than the highest wall temperature imposed. When the latent heat of\nevaporation is small, we found that evaporation can happen at the low\ntemperature side while condensation occur at the high temperature side,\nopposing the temperature gradient.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:45:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Gang",""]]}
{"id":"2308.02662","submitter":"Chandrima Kayal","authors":"Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy","title":"Linear isomorphism testing of Boolean functions with small approximate\n  spectral norm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two Boolean functions f, g : F_2^{n} \\to {-1, 1} are called linearly\nisomorphic if there exists an invertible matrix M \\in F_2^{n\\times n} such that\nf\\circ M = g. Testing linear isomorphism is a generalization of, now classical\nin the context of property testing, isomorphism testing between Boolean\nfunctions. Linear-invariance of Boolean functions has also been extensively\nstudied in other areas like coding theory and cryptography, and mathematics in\ngeneral. In this paper, we will study the following two variants of this\nproblem:\n  [1] [Communication complexity: ] Assume that Boolean functions f and g on\nF_2^{n} are given to Alice and Bob respectively, and the goal is to test linear\nisomorphism between f and g by exchanging a minimum amount of communication,\nmeasured in bits, between Alice and Bob. Our main result is an efficient\ntwo-party communication protocol for testing linear isomorphism in terms of the\napproximate spectral norm of the functions. We will crucially exploit the\nconnection between approximate spectral norm and sign-approximating\npolynomials.\n  [2] [Query complexity: ] If f: F_2^{n} \\to { -1, 1 } is a known function and\ng : F_2^{n} \\to { -1, 1 } be an unknown function with a query access. We study\nthe query complexity of testing linear isomorphism between f and g in terms of\nthe approximate spectral norm of f. As in the case of communication complexity,\nwe will use properties of the approximate spectral norm.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:46:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ghosh","Arijit",""],["Kayal","Chandrima",""],["Paraashar","Manaswi",""],["Roy","Manmatha",""]]}
{"id":"2308.02663","submitter":"Csaba D. Toth","authors":"Csaba D. T\\'oth","title":"On RAC Drawings of Graphs with Two Bends per Edge","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.DM cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in\nthe plane, where the edges are polylines with two bends per edge and any pair\nof edges can only cross at a right angle, has at most $24n-26$ edges for $n\\geq\n3$. This improves upon the previous upper bound of $74.2n$; this is the first\nimprovement in more than 12 years. A crucial ingredient of the proof is an\nupper bound on the size of plane multigraphs with polyline edges in which the\nfirst and last segments are either parallel or orthogonal.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:50:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["T\u00f3th","Csaba D.",""]]}
{"id":"2308.02664","submitter":"Amartya Hatua","authors":"Siddha Ganju, Amartya Hatua, Peter Jenniskens, Sahyadri Krishna,\n  Chicheng Ren, Surya Ambardar","title":"AI-Enhanced Data Processing and Discovery Crowd Sourcing for Meteor\n  Shower Mapping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cameras for Allsky Meteor Surveillance (CAMS) project, funded by NASA\nstarting in 2010, aims to map our meteor showers by triangulating meteor\ntrajectories detected in low-light video cameras from multiple locations across\n16 countries in both the northern and southern hemispheres. Its mission is to\nvalidate, discover, and predict the upcoming returns of meteor showers. Our\nresearch aimed to streamline the data processing by implementing an automated\ncloud-based AI-enabled pipeline and improve the data visualization to improve\nthe rate of discoveries by involving the public in monitoring the meteor\ndetections. This article describes the process of automating the data\ningestion, processing, and insight generation using an interpretable Active\nLearning and AI pipeline. This work also describes the development of an\ninteractive web portal (the NASA Meteor Shower portal) to facilitate the\nvisualization of meteor radiant maps. To date, CAMS has discovered over 200 new\nmeteor showers and has validated dozens of previously reported showers.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:26:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ganju","Siddha",""],["Hatua","Amartya",""],["Jenniskens","Peter",""],["Krishna","Sahyadri",""],["Ren","Chicheng",""],["Ambardar","Surya",""]]}
{"id":"2308.02665","submitter":"Gabriel Roccabruna","authors":"Michele Yin, Gabriel Roccabruna, Abhinav Azad, Giuseppe Riccardi","title":"Let's Give a Voice to Conversational Agents in Virtual Reality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dialogue experience with conversational agents can be greatly enhanced\nwith multimodal and immersive interactions in virtual reality. In this work, we\npresent an open-source architecture with the goal of simplifying the\ndevelopment of conversational agents operating in virtual environments. The\narchitecture offers the possibility of plugging in conversational agents of\ndifferent domains and adding custom or cloud-based Speech-To-Text and\nText-To-Speech models to make the interaction voice-based. Using this\narchitecture, we present two conversational prototypes operating in the digital\nhealth domain developed in Unity for both non-immersive displays and VR\nheadsets.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:51:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yin","Michele",""],["Roccabruna","Gabriel",""],["Azad","Abhinav",""],["Riccardi","Giuseppe",""]]}
{"id":"2308.02666","submitter":"Justin Stevens","authors":"Justin Stevens, Vadim Bulitko, David Thue","title":"Solving Witness-type Triangle Puzzles Faster with an Automatically\n  Learned Human-Explainable Predicate","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatically solving puzzle instances in the game The Witness can guide\nplayers toward solutions and help puzzle designers generate better puzzles. In\nthe latter case such an Artificial Intelligence puzzle solver can inform a\nhuman puzzle designer and procedural puzzle generator to produce better\ninstances. The puzzles, however, are combinatorially difficult and search-based\nsolvers can require large amounts of time and memory. We accelerate such search\nby automatically learning a human-explainable predicate that predicts whether a\npartial path to a Witness-type puzzle is not completable to a solution path. We\nprove a key property of the learned predicate which allows us to use it for\npruning successor states in search thereby accelerating search by an average of\nsix times while maintaining completeness of the underlying search. Conversely\ngiven a fixed search time budget per puzzle our predicate-accelerated search\ncan solve more puzzle instances of larger sizes than the baseline search.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:52:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Stevens","Justin",""],["Bulitko","Vadim",""],["Thue","David",""]]}
{"id":"2308.02667","submitter":"Tomasz Czyszanowski","authors":"Marek Ekielski, Weronika G{\\l}owadzka, Karolina Bogdanowicz, Micha{\\l}\n  Ryga{\\l}a, Monika Mikulicz, Patrycja \\'Spiewak, Marcin Kowalski, Marcin\n  G\\k{e}bski, Marcin Motyka, Anna Szerling, Tomasz Czyszanowski","title":"Monolithic High Contrast Grating Integrated with Metal: Infrared\n  Electrode with Exceptionally High Conductivity and Transmission","comments":"13 pages, 6 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":"  The design of transparent conductive electrodes (TCEs) for optoelectronic\ndevices requires a trade-off between high conductivity or transmittivity,\nlimiting their efficiency. This paper demonstrates a novel approach to\nfabricating TCEs that effectively alleviates this trade-off: a monolithic GaAs\nhigh contrast grating integrated with metal (metalMHCG). The metalMHCG enables\nhigher electrical conductivity than other TCEs, while providing transmissive\nand antireflective properties. We focus on infrared spectrum TCEs, which are\nessential for sensing, thermal imaging, and automotive applications. However,\ndue to elevated free carrier absorption they are much more demanding than TCEs\nfor the visible spectrum. We demonstrate 75% absolute transmittiance of\nunpolarized light, resulting in 108% transmittance relative to plain GaAs\nsubstrate. We achieved even larger absolute transmittance of polarized light,\nreaching 92% or 133% relative transmittance. Despite record high transmittance,\nthe sheet resistance of the metalMHCG is several times lower than any other\nTCE, ranging from 0.5 to 1 Ohm/Sq.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:56:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ekielski","Marek",""],["G\u0142owadzka","Weronika",""],["Bogdanowicz","Karolina",""],["Ryga\u0142a","Micha\u0142",""],["Mikulicz","Monika",""],["\u015apiewak","Patrycja",""],["Kowalski","Marcin",""],["G\u0119bski","Marcin",""],["Motyka","Marcin",""],["Szerling","Anna",""],["Czyszanowski","Tomasz",""]]}
{"id":"2308.02668","submitter":"Tariq Berrada TariqBerrada","authors":"Tariq Berrada, Camille Couprie, Karteek Alahari, Jakob Verbeek","title":"Guided Distillation for Semi-Supervised Instance Segmentation","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":"  Although instance segmentation methods have improved considerably, the\ndominant paradigm is to rely on fully-annotated training images, which are\ntedious to obtain. To alleviate this reliance, and boost results,\nsemi-supervised approaches leverage unlabeled data as an additional training\nsignal that limits overfitting to the labeled samples. In this context, we\npresent novel design choices to significantly improve teacher-student\ndistillation models. In particular, we (i) improve the distillation approach by\nintroducing a novel \"guided burn-in\" stage, and (ii) evaluate different\ninstance segmentation architectures, as well as backbone networks and\npre-training strategies. Contrary to previous work which uses only supervised\ndata for the burn-in period of the student model, we also use guidance of the\nteacher model to exploit unlabeled data in the burn-in period. Our improved\ndistillation approach leads to substantial improvements over previous\nstate-of-the-art results. For example, on the Cityscapes dataset we improve\nmask-AP from 23.7 to 33.9 when using labels for 10\\% of images, and on the COCO\ndataset we improve mask-AP from 18.3 to 34.1 when using labels for only 1\\% of\nthe training data.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:25:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Berrada","Tariq",""],["Couprie","Camille",""],["Alahari","Karteek",""],["Verbeek","Jakob",""]]}
{"id":"2308.02669","submitter":"Yuval Alaluf","authors":"Elad Richardson, Kfir Goldberg, Yuval Alaluf, Daniel Cohen-Or","title":"ConceptLab: Creative Generation using Diffusion Prior Constraints","comments":"Project page: https://kfirgoldberg.github.io/ConceptLab/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent text-to-image generative models have enabled us to transform our words\ninto vibrant, captivating imagery. The surge of personalization techniques that\nhas followed has also allowed us to imagine unique concepts in new scenes.\nHowever, an intriguing question remains: How can we generate a new, imaginary\nconcept that has never been seen before? In this paper, we present the task of\ncreative text-to-image generation, where we seek to generate new members of a\nbroad category (e.g., generating a pet that differs from all existing pets). We\nleverage the under-studied Diffusion Prior models and show that the creative\ngeneration problem can be formulated as an optimization process over the output\nspace of the diffusion prior, resulting in a set of \"prior constraints\". To\nkeep our generated concept from converging into existing members, we\nincorporate a question-answering model that adaptively adds new constraints to\nthe optimization problem, encouraging the model to discover increasingly more\nunique creations. Finally, we show that our prior constraints can also serve as\na strong mixing mechanism allowing us to create hybrids between generated\nconcepts, introducing even more flexibility into the creative process.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:04:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Richardson","Elad",""],["Goldberg","Kfir",""],["Alaluf","Yuval",""],["Cohen-Or","Daniel",""]]}
{"id":"2308.02670","submitter":"Weihan Wang","authors":"Weihan Wang, Jiani Li, Yuhang Ming, Philippos Mordohai","title":"EDI: ESKF-based Disjoint Initialization for Visual-Inertial SLAM Systems","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":"  Visual-inertial initialization can be classified into joint and disjoint\napproaches. Joint approaches tackle both the visual and the inertial parameters\ntogether by aligning observations from feature-bearing points based on IMU\nintegration then use a closed-form solution with visual and acceleration\nobservations to find initial velocity and gravity. In contrast, disjoint\napproaches independently solve the Structure from Motion (SFM) problem and\ndetermine inertial parameters from up-to-scale camera poses obtained from pure\nmonocular SLAM. However, previous disjoint methods have limitations, like\nassuming negligible acceleration bias impact or accurate rotation estimation by\npure monocular SLAM. To address these issues, we propose EDI, a novel approach\nfor fast, accurate, and robust visual-inertial initialization. Our method\nincorporates an Error-state Kalman Filter (ESKF) to estimate gyroscope bias and\ncorrect rotation estimates from monocular SLAM, overcoming dependence on pure\nmonocular SLAM for rotation estimation. To estimate the scale factor without\nprior information, we offer a closed-form solution for initial velocity, scale,\ngravity, and acceleration bias estimation. To address gravity and acceleration\nbias coupling, we introduce weights in the linear least-squares equations,\nensuring acceleration bias observability and handling outliers. Extensive\nevaluation on the EuRoC dataset shows that our method achieves an average scale\nerror of 5.8% in less than 3 seconds, outperforming other state-of-the-art\ndisjoint visual-inertial initialization approaches, even in challenging\nenvironments and with artificial noise corruption.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:06:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Weihan",""],["Li","Jiani",""],["Ming","Yuhang",""],["Mordohai","Philippos",""]]}
{"id":"2308.02671","submitter":"Rui Zhang","authors":"Sergei V. Chekanov, Rui Zhang","title":"Boosting sensitivity to new physics with unsupervised anomaly detection\n  in dijet resonance search","comments":"7 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":"ANL-HEP-183852","categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Enhancing dijet resonance searches, crucial for uncovering new physics at\nhadron colliders, poses challenges with increasing luminosities. Traditional\nmethods struggle to capture complex backgrounds accurately. We propose an\ninnovative approach utilizing unsupervised anomaly detection. By filtering out\nbackground-related events, this technique enhances sensitivity to potential\nsignals. Simulations demonstrate improved performance over conventional\nmethods. Our findings open doors for more effective searches for new physics in\nhigh-energy collider experiments.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:08:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chekanov","Sergei V.",""],["Zhang","Rui",""]]}
{"id":"2308.02672","submitter":"Grigori Karagulyan","authors":"Grigori A. Karagulyan","title":"New estimates for bounded oscillation operators","comments":"52 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we consider a generalized version of bounded oscillation\noperators, involving new parameters in the definition, as well as considering\nthe operators on vector-valued function spaces. With this definition we will\ncapture some more operators to the class of Bounded oscillation operators. We\nprove sparse domination and exponential decay estimates, with various\napplications in harmonic analysis operators. We provide a new simplified\napproach, separating certain set theoretic proposition, which become a basic\ntool in the proofs of the main results. For a \"narrowed\" class of bounded\noscillation operators we also obtain new type of sparse estimation, involving\nmean oscillation instead of integral averages in the definition of sparse\noperators. Among with new corollaries we recover also series of results\nobtained in recent years. In particular, we prove the boundedness of maximally\nmodulated Calder\\'on-Zygmund operators on spaces BMO.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:09:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Karagulyan","Grigori A.",""]]}
{"id":"2308.02673","submitter":"Ender Ayanoglu","authors":"Dogan Kutay Pekcan and Ender Ayanoglu","title":"Comments on \"A Linear Time Algorithm for the Optimal Discrete IRS\n  Beamforming\"","comments":"3 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Comments on [1] are provided. Updated necessary and sufficient conditions for\nits Lemma 1 are given. Consequently, an updated Algorithm 1 is provided with\nfull specification. Simulation results with improved performance over the\nimplementation of Algorithm 1 are provided.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:14:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pekcan","Dogan Kutay",""],["Ayanoglu","Ender",""]]}
{"id":"2308.02674","submitter":"Brendon Forsgren","authors":"Brendon Forsgren, Ram Vasudevan, Michael Kaess, Timothy W. McLain,\n  Joshua G. Mangelson","title":"Group-$k$ consistent measurement set maximization via maximum clique\n  over k-Uniform hypergraphs for robust multi-robot map merging","comments":"arXiv admin note: text overlap with arXiv:2209.02658","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":"  This paper unifies the theory of consistent-set maximization for robust\noutlier detection in a simultaneous localization and mapping framework. We\nfirst describe the notion of pairwise consistency before discussing how a\nconsistency graph can be formed by evaluating pairs of measurements for\nconsistency. Finding the largest set of consistent measurements is transformed\ninto an instance of the maximum clique problem and can be solved relatively\nquickly using existing maximum-clique solvers. We then generalize our algorithm\nto check consistency on a group-$k$ basis by using a generalized notion of\nconsistency and using generalized graphs. We also present modified maximum\nclique algorithms that function on generalized graphs to find the set of\nmeasurements that is internally group-$k$ consistent. We address the\nexponential nature of group-$k$ consistency and present methods that can\nsubstantially decrease the number of necessary checks performed when evaluating\nconsistency. We extend our prior work to multi-agent systems in both simulation\nand hardware and provide a comparison with other state-of-the-art methods.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:15:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Forsgren","Brendon",""],["Vasudevan","Ram",""],["Kaess","Michael",""],["McLain","Timothy W.",""],["Mangelson","Joshua G.",""]]}
{"id":"2308.02675","submitter":"Jonathan Elkobi","authors":"Jonathan Elkobi, Bernd Gruner, Tim Sonnekalb, Clemens-Alexander Brust","title":"TIPICAL -- Type Inference for Python In Critical Accuracy Level","comments":"Preprint for the SERA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Type inference methods based on deep learning are becoming increasingly\npopular as they aim to compensate for the drawbacks of static and dynamic\nanalysis approaches, such as high uncertainty. However, their practical\napplication is still debatable due to several intrinsic issues such as code\nfrom different software domains will involve data types that are unknown to the\ntype inference system. In order to overcome these problems and gain\nhigh-confidence predictions, we thus present TIPICAL, a method that combines\ndeep similarity learning with novelty detection. We show that our method can\nbetter predict data types in high confidence by successfully filtering out\nunknown and inaccurate predicted data types and achieving higher F1 scores to\nthe state-of-the-art type inference method Type4Py. Additionally, we\ninvestigate how different software domains and data type frequencies may affect\nthe results of our method.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:16:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Elkobi","Jonathan",""],["Gruner","Bernd",""],["Sonnekalb","Tim",""],["Brust","Clemens-Alexander",""]]}
{"id":"2308.02676","submitter":"Xiaodan Shao","authors":"Xiaodan Shao and Rui Zhang","title":"Target-Mounted Intelligent Reflecting Surface for Secure Wireless\n  Sensing","comments":"13 pages (double column), 12 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 this paper, we consider a challenging secure wireless sensing scenario\nwhere a legitimate radar station (LRS) intends to detect a target at unknown\nlocation in the presence of an unauthorized radar station (URS). We aim to\nenhance the sensing performance of the LRS and in the meanwhile prevent the\ndetection of the same target by the URS. Under this setup, conventional\nstealth-based approaches such as wrapping the target with electromagnetic wave\nabsorbing materials are not applicable, since they will disable the target\ndetection by not only the URS, but the LRS as well. To tackle this challenge,\nwe propose in this paper a new target-mounted IRS approach, where intelligent\nreflecting surface (IRS) is mounted on the outer/echo surface of the target and\nby tuning the IRS reflection, the strength of its reflected radar signal in any\nangle of departure (AoD) can be adjusted based on the signal's angle of arrival\n(AoA), thereby enhancing/suppressing the signal power towards the LRS/URS,\nrespectively. To this end, we propose a practical protocol for the\ntarget-mounted IRS to estimate the LRS/URS channel and waveform parameters\nbased on its sensed signals and control the IRS reflection for/against the\nLRS/URS accordingly. Specifically, we formulate new optimization problems to\ndesign the reflecting phase shifts at IRS for maximizing the received signal\npower at the LRS while keeping that at the URS below a certain level, for both\nthe cases of short-term and long-term IRS operations with different dynamic\nreflection capabilities. To solve these non-convex problems, we apply the\npenalty dual decomposition method to obtain high-quality suboptimal solutions\nfor them efficiently. Finally, simulation results are presented that verify the\neffectiveness of the proposed protocol and algorithms for the target-mounted\nIRS to achieve secure wireless sensing, as compared with various benchmark\nschemes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:22:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shao","Xiaodan",""],["Zhang","Rui",""]]}
{"id":"2308.02678","submitter":"Jianyi Zhang","authors":"Jianyi Zhang, Xu Ji, Zhangchi Zhao, Xiali Hei, Kim-Kwang Raymond Choo","title":"Ethical Considerations and Policy Implications for Large Language\n  Models: Guiding Responsible Development and Deployment","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper examines the ethical considerations and implications of large\nlanguage models (LLMs) in generating content. It highlights the potential for\nboth positive and negative uses of generative AI programs and explores the\nchallenges in assigning responsibility for their outputs. The discussion\nemphasizes the need for proactive ethical frameworks and policy measures to\nguide the responsible development and deployment of LLMs.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 07:21:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Jianyi",""],["Ji","Xu",""],["Zhao","Zhangchi",""],["Hei","Xiali",""],["Choo","Kim-Kwang Raymond",""]]}
{"id":"2308.02679","submitter":"Wei Wei","authors":"Wei Wei, Samuel Huron, Yvonne Jansen","title":"Towards Autocomplete Strategies for Visualization Construction","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Constructive visualization uses physical data units - tokens - to enable\nnon-experts to create personalized visualizations engagingly. However, its\nphysical nature limits efficiency and scalability. One potential solution to\naddress this issue is autocomplete. By providing automated suggestions while\nstill allowing for manual intervention, autocomplete can expedite visualization\nconstruction while maintaining expressivity. We conduct a speculative design\nstudy to examine how people would like to interact with a visualization\nauthoring system that supports autocomplete. Our study identifies three types\nof autocomplete strategies and gains insights for designing future\nvisualization authoring tools with autocomplete functionality. A free copy of\nthis paper and all supplemental materials are available on our online\nrepository https://osf.io/nu4z3/?view_only=594baee54d114a99ab381886fb32a126\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:28:43 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:23:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wei","Wei",""],["Huron","Samuel",""],["Jansen","Yvonne",""]]}
{"id":"2308.02680","submitter":"Savina Dine Kim","authors":"Savina Kim and Stefan Lessmann and Galina Andreeva and Michael\n  Rovatsos","title":"Fair Models in Credit: Intersectional Discrimination and the\n  Amplification of Inequity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing usage of new data sources and machine learning (ML) technology\nin credit modeling raises concerns with regards to potentially unfair\ndecision-making that rely on protected characteristics (e.g., race, sex, age)\nor other socio-economic and demographic data. The authors demonstrate the\nimpact of such algorithmic bias in the microfinance context. Difficulties in\nassessing credit are disproportionately experienced among vulnerable groups,\nhowever, very little is known about inequities in credit allocation between\ngroups defined, not only by single, but by multiple and intersecting social\ncategories. Drawing from the intersectionality paradigm, the study examines\nintersectional horizontal inequities in credit access by gender, age, marital\nstatus, single parent status and number of children. This paper utilizes data\nfrom the Spanish microfinance market as its context to demonstrate how\npluralistic realities and intersectional identities can shape patterns of\ncredit allocation when using automated decision-making systems. With ML\ntechnology being oblivious to societal good or bad, we find that a more\nthorough examination of intersectionality can enhance the algorithmic fairness\nlens to more authentically empower action for equitable outcomes and present a\nfairer path forward. We demonstrate that while on a high-level, fairness may\nexist superficially, unfairness can exacerbate at lower levels given\ncombinatorial effects; in other words, the core fairness problem may be more\ncomplicated than current literature demonstrates. We find that in addition to\nlegally protected characteristics, sensitive attributes such as single parent\nstatus and number of children can result in imbalanced harm. We discuss the\nimplications of these findings for the financial services industry.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:34:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kim","Savina",""],["Lessmann","Stefan",""],["Andreeva","Galina",""],["Rovatsos","Michael",""]]}
{"id":"2308.02681","submitter":"Hongzhao Guan","authors":"Pascal Van Hentenryck, Connor Riley, Anthony Trasatti, Hongzhao Guan,\n  Tejas Santanam, Jorge A. Huertas, Kevin Dalmeijer, Kari Watkins, Juwon Drake,\n  Samson Baskin","title":"MARTA Reach: Piloting an On-Demand Multimodal Transit System in Atlanta","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper reports on the results of the six-month pilot MARTA Reach, which\naimed to demonstrate the potential value of On-Demand Multimodal Transit\nSystems (ODMTS) in the city of Atlanta, Georgia. ODMTS take a transit-centric\nview by integrating on-demand services and traditional fixed routes in order to\naddress the first/last mile problem. ODMTS combine fixed routes and on-demand\nshuttle services by design (not as an after-thought) into a transit system that\noffers a door-to-door multimodal service with fully integrated operations and\nfare structure. The paper fills a knowledge gap, i.e., the understanding of the\nimpact, benefits, and challenges of deploying an ODMTS in a city as complex as\nAtlanta, Georgia. The pilot was deployed in four different zones with limited\ntransit options, and used on-demand shuttles integrated with the overall\ntransit system to address the first/last mile problem. The paper describes the\ndesign and operations of the pilot, and presents the results in terms of\nridership, quality of service, trip purposes, alternative modes of\ntransportation, multimodal nature of trips, challenges encountered, and cost\nestimates. The main findings of the pilot are that Reach offered a highly\nvalued service that performed a large number of trips that would have otherwise\nbeen served by ride-hailing companies, taxis, or personal cars. Moreover, the\nwide majority of Reach trips were multimodal, with connections to rail being\nmost prominent\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:08:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Van Hentenryck","Pascal",""],["Riley","Connor",""],["Trasatti","Anthony",""],["Guan","Hongzhao",""],["Santanam","Tejas",""],["Huertas","Jorge A.",""],["Dalmeijer","Kevin",""],["Watkins","Kari",""],["Drake","Juwon",""],["Baskin","Samson",""]]}
{"id":"2308.02682","submitter":"Chetraj Pandey","authors":"Chetraj Pandey, Rafal A. Angryk, Manolis K. Georgoulis, Berkay Aydin","title":"Explainable Deep Learning-based Solar Flare Prediction with post hoc\n  Attention for Operational Forecasting","comments":"15 pages, 5 figures. This is a preprint accepted at the 26th\n  International Conference on Discovery Science (DS2023). arXiv admin note:\n  text overlap with arXiv:2307.15878","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a post hoc analysis of a deep learning-based full-disk\nsolar flare prediction model. We used hourly full-disk line-of-sight\nmagnetogram images and selected binary prediction mode to predict the\noccurrence of $\\geq$M1.0-class flares within 24 hours. We leveraged custom data\naugmentation and sample weighting to counter the inherent class-imbalance\nproblem and used true skill statistic and Heidke skill score as evaluation\nmetrics. Recent advancements in gradient-based attention methods allow us to\ninterpret models by sending gradient signals to assign the burden of the\ndecision on the input features. We interpret our model using three post hoc\nattention methods: (i) Guided Gradient-weighted Class Activation Mapping, (ii)\nDeep Shapley Additive Explanations, and (iii) Integrated Gradients. Our\nanalysis shows that full-disk predictions of solar flares align with\ncharacteristics related to the active regions. The key findings of this study\nare: (1) We demonstrate that our full disk model can tangibly locate and\npredict near-limb solar flares, which is a critical feature for operational\nflare forecasting, (2) Our candidate model achieves an average\nTSS=0.51$\\pm$0.05 and HSS=0.38$\\pm$0.08, and (3) Our evaluation suggests that\nthese models can learn conspicuous features corresponding to active regions\nfrom full-disk magnetograms.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:33:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pandey","Chetraj",""],["Angryk","Rafal A.",""],["Georgoulis","Manolis K.",""],["Aydin","Berkay",""]]}
{"id":"2308.02683","submitter":"Molly Bradley","authors":"Avalon Blaser, Molly Bradley, Daniel Vargas, and Kathy Xing","title":"Sato-Tate Type Distributions for Matrix Points on Elliptic Curves and\n  Some $K3$ Surfaces","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":"  Generalizing the problem of counting rational points on curves and surfaces\nover finite fields, we consider the setting of $n \\times n$ matrix points with\nfinite field entries. We obtain exact formulas for matrix point counts on\nelliptic curves and certain $K3$ surfaces for \"supersingular\" primes. These\nexact formulas, which involve partitions of integers up to $n$, essentially\ncoincide with the expected value for the number of such points. Therefore, in\nanalogy with the Sato-Tate conjecture, it is natural to study the distribution\nof the deviation from the expected values for all primes. We determine the\nlimiting distributions for elliptic curves and a family of $K3$ surfaces. For\nnon-CM elliptic curves with square-free conductor, our results are explicit.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:35:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Blaser","Avalon",""],["Bradley","Molly",""],["Vargas","Daniel",""],["Xing","Kathy",""]]}
{"id":"2308.02684","submitter":"Sergio Fernandez De Soto","authors":"Sergio Fernandez de soto Guerrero","title":"The odd Hummer principle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Hummer Principle was born from the mind of Bob Hummer in 1946, which\nconsists of performing card shuffles with an even number of cards while leaving\nsome properties of the deck intact. In this document, we will present a\ngeneralization of this principle for an odd number of cards, along with ideas\nfor applying and adapting magic tricks that use the Hummer Principle to a more\ngeneral setting. Finally, we will discuss future work in this area.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 17:45:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guerrero","Sergio Fernandez de soto",""]]}
{"id":"2308.02685","submitter":"Rodrigo Turcati","authors":"I. Soares, R. Turcati, and S. B. Duarte","title":"Nonlinear wave propagation in large extra spatial dimensions and the\n  blackbody thermal laws","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.HE astro-ph.SR cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nonlinear wave propagation in large extra spatial dimensions (on and\nabove $d=2$) is investigated in the context of nonlinear electrodynamics\ntheories that depends exclusively on the invariant $\\mathcal{F}$. In this vein,\nwe consider propagating waves under the influence of external uniform electric\nand magnetic fields. Features related to the blackbody radiation in the\npresence of a background constant electric field such as the generalization of\nthe spectral energy density distribution and the Stefan-Boltzmann law are\nobtained. Interestingly enough, anisotropic contributions to the frequency\nspectrum appear in connection to the nonlinearity of the electromagnetic field.\nIn addition, the long wavelength regime and the Wien's displacement law in this\nsituation are studied. The corresponding thermodynamics quantities at thermal\nequilibrium, such as energy, pressure, entropy and heat capacity densities are\ncontemplated as well.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:40:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Soares","I.",""],["Turcati","R.",""],["Duarte","S. B.",""]]}
{"id":"2308.02686","submitter":"Walter Boscheri Prof.","authors":"Michele Giuliano Carlino and Walter Boscheri","title":"Arbitrary-Lagrangian-Eulerian finite volume IMEX schemes for the\n  incompressible Navier-Stokes equations on evolving Chimera meshes","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 article we design a finite volume semi-implicit IMEX scheme for the\nincompressible Navier-Stokes equations on evolving Chimera meshes. We employ a\ntime discretization technique that separates explicit and implicit terms which\nencompass both slow and fast scales. The finite volume approach for both\nexplicit and implicit terms allows to encode into the nonlinear flux the\nvelocity of displacement of the Chimera mesh via integration on moving cells.\nTo attain second-order time accuracy, we employ semi-implicit IMEX Runge-Kutta\nschemes. These novel schemes are combined with a fractional-step method, thus\nthe governing equations are eventually solved using a projection method to\nsatisfy the divergence-free constraint of the velocity field. The implicit\ndiscretization of the viscous terms allows the CFL-type stability condition for\nthe maximum admissible time step to be only defined by the relative fluid\nvelocity referred to the movement of the frame and not depending also on the\nviscous eigenvalues. Communication between different grid blocks is enabled\nthrough compact exchange of information from the fringe cells of one mesh block\nto the field cells of the other block. Taking advantage of the continuity of\nthe solution and the definition of a minimal compact stencil, the numerical\nsolution of any system of differential equations is characterized by continuous\ndata extrapolation. Free-stream preservation property, i.e. compliance with the\nGeometric Conservation Law (GCL), is respected. The accuracy and capabilities\nof the new numerical schemes is proved through an extensive range of test\ncases, demonstrating ability to solve relevant benchmarks in the field of\nincompressible fluids.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:45:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Carlino","Michele Giuliano",""],["Boscheri","Walter",""]]}
{"id":"2308.02687","submitter":"Juan-Alberto Estrada-Garcia","authors":"Juan-Alberto Estrada-Garcia and Mingjie Bi and Dawn M. Tilbury and\n  Kira Barton and Siqian Shen","title":"A Multi-objective Mixed-integer Programming Approach for Supply Chain\n  Disruption Response with Lead-Time Awareness","comments":null,"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":"  Supply chain (SC) risk management is influenced by both spatial and temporal\nattributes of different entities (suppliers, retailers, and customers). Each\nentity has given capacity and lead time for processing and transporting\nproducts to downstream entities. Under disruptive events, lead time and\ncapacities may vary, which affects the overall SC performance. There have been\nmany studies on SC disruption mitigation, but often without considering lead\ntime and the magnitude of lateness. In this paper, we formulate a mixed-integer\nprogramming (MIP) model to optimize SC operations via a routing and scheduling\napproach, to model the delivery time of products at different entities as they\nflow throughout the SC network. We minimize a weighted sum of multiple\nobjectives involving costs related to transportation, shortage, and delivery\nlateness. We also develop a discrete-event simulation framework to evaluate the\nperformance of solutions to the MIP model under lead time uncertainty. Via\nextensive numerical studies, we show how the attributes of SC entities affect\nthe performance, so that we can improve SC design and operations under various\nuncertainties.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:51:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Estrada-Garcia","Juan-Alberto",""],["Bi","Mingjie",""],["Tilbury","Dawn M.",""],["Barton","Kira",""],["Shen","Siqian",""]]}
{"id":"2308.02688","submitter":"Yuan Chen","authors":"Y. Chen, M. L. van Gelder, P. Nazari, C. L. Brogan, E. F. van\n  Dishoeck, H. Linnartz, J. K. J{\\o}rgensen, T. R. Hunter, O. H. Wilkins, G. A.\n  Blake, P. Caselli, K.-J. Chuang, C. Codella, I. Cooke, M. N. Drozdovskaya, R.\n  T. Garrod, S. Ioppolo, M. Jin, B. M. Kulterer, N. F. W. Ligterink, A.\n  Lipnicky, R. Loomis, M. G. Rachid, S. Spezzano, B. A. McGuire","title":"CoCCoA: Complex Chemistry in hot Cores with ALMA. Selected\n  oxygen-bearing species","comments":"Accepted for publication in Astronomy & Astrophysics. 17 pages and 7\n  figures in the main body, 15 pages and 8 figures in the appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Complex organic molecules (COMs) have been observed to be abundant in the gas\nphase toward protostars. Deep line surveys have been carried out only for a\nlimited number of well-known high-mass star forming regions using the Atacama\nLarge Millimeter/submillimeter Array (ALMA), which has unprecedented resolution\nand sensitivity. Statistical studies on oxygen-bearing COMs (O-COMs) in\nhigh-mass protostars using ALMA are still lacking. With the recent CoCCoA\nsurvey, we are able to determine the column density ratios of six O-COMs with\nrespect to methanol (CH$_3$OH) in a sample of 14 high-mass protostellar sources\nto investigate their origin through ice and/or gas-phase chemistry. The\nselected species are: acetaldehyde (CH$_3$CHO), ethanol (C$_2$H$_5$OH),\ndimethyl ether (DME, CH$_3$OCH$_3$), methyl formate (MF, CH$_3$OCHO),\nglycolaldehyde (GA, CH$_2$OHCHO), and ethylene glycol (EG, (CH$_2$OH)$_2$). DME\nand MF have the highest and most constant ratios within one order of magnitude,\nwhile the other four species have lower ratios and exhibit larger scatter by\n1-2 orders of magnitude. We compare the O-COM ratios of high-mass CoCCoA\nsources with those of 5 low-mass protostars available from the literature,\nalong with the results from experiments and simulations. We find that the O-COM\nratios with respect to methanol are on the same level in both the high- and\nlow-mass samples, which suggests that these species are mainly formed in\nsimilar environments during star formation, probably in ice mantles on dust\ngrains during early pre-stellar stages. Current simulations and experiments can\nreproduce most observational trends with a few exceptions, and hypotheses exist\nto explain the differences between observations and simulations/experiments,\nsuch as the involvement of gas-phase chemistry and different emitting areas of\nmolecules.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 19:56:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Y.",""],["van Gelder","M. L.",""],["Nazari","P.",""],["Brogan","C. L.",""],["van Dishoeck","E. F.",""],["Linnartz","H.",""],["J\u00f8rgensen","J. K.",""],["Hunter","T. R.",""],["Wilkins","O. H.",""],["Blake","G. A.",""],["Caselli","P.",""],["Chuang","K. -J.",""],["Codella","C.",""],["Cooke","I.",""],["Drozdovskaya","M. N.",""],["Garrod","R. T.",""],["Ioppolo","S.",""],["Jin","M.",""],["Kulterer","B. M.",""],["Ligterink","N. F. W.",""],["Lipnicky","A.",""],["Loomis","R.",""],["Rachid","M. G.",""],["Spezzano","S.",""],["McGuire","B. A.",""]]}
{"id":"2308.02689","submitter":"Jason Gombas","authors":"Jason Gombas, Reinhard Schwienhorst, Jarrett Fein, Sara Sawford","title":"Future Top Quark Pole Mass Improvements from PDF Updates","comments":"DIS2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dependence of the top-quark mass measurement in top-quark pair production\non the parton distribution functions (PDF) is explored through differential\nmass distributions in $t\\bar{t}$ and $t\\bar{t}j$ production at the LHC and a\nfuture 100 TeV proton-proton collider. The top-quark mass uncertainty is\nobtained from chi-squared fits to invariant mass distributions from simulations\nassuming different top pole masses around the nominal value of 172.5 GeV. The\nPDF uncertainties of the differential distributions are used in the chi-square\nevaluation and reduced through a fit to differential distributions in\n$t\\bar{t}$ and $t\\bar{t}j$ production.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:01:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gombas","Jason",""],["Schwienhorst","Reinhard",""],["Fein","Jarrett",""],["Sawford","Sara",""]]}
{"id":"2308.02690","submitter":"James Martin","authors":"J. D. D. Martin","title":"Thermal physics in the data age -- students judge the applicability of\n  the equipartition theorem","comments":"6 pages, 4 figures; accepted for publication in the American Journal\n  of Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Providing students of introductory thermal physics with a plot of the heat\ncapacities of many low density gases as a function of temperature allows them\nto look for systematic trends. Specifically, large amounts of heat capacity\ndata allow students to discover the equipartition theorem, but also point to\nits limited applicability. Computer code to download and plot the\ntemperature-dependent heat capacity data is provided.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:01:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Martin","J. D. D.",""]]}
{"id":"2308.02691","submitter":"Afshin Moradi","authors":"Afshin Moradi and Nurhan Turker Tokan","title":"Screened plasmons of graphene near a perfect electric conductor","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Screened plasmon properties of graphene near a perfect electric conductor are\ninvestigated using classical electrodynamics and a linearized hydrodynamic\nmodel that includes Fermi correction. A general expression for the dispersion\nrelation of the mentioned screened plasmonic waves is given and illustrated\ngraphically. The result indicates that for realistic wavenumbers, the\ndispersion relation of plasmonic waves of isolated graphene is almost\nunaffected by the Fermi correction, while this correction is an important\nfactor for the screened plasmons of graphene near a perfect electric conductor,\nwhere it increases the frequency of surface waves. The results show that near\nthe graphene neutrality point, the surface wave has a linear dispersion with a\nuniversal speed close to $v_{\\mathrm{F}}/\\sqrt{2}$. Such linear dispersion for\nsurface waves (also known as energy waves) appears to be a common occurrence\nwhen a splitting of plasma frequencies occurs, e.g. in the electron-hole plasma\nof graphene [W. Zhao \\textit{et al}., Nature \\textbf{614}, 688 (2023)].\nFurthermore, analytical expressions for the energy parameters (the power flow,\nenergy density, and energy velocity) of screened plasmons of the system are\nderived. Also, the analytical expressions are derived and analyzed for the\ndamping function and surface plasmon and electromagnetic field strength\nfunctions of surface waves of the system with small intrinsic damping.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:03:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moradi","Afshin",""],["Tokan","Nurhan Turker",""]]}
{"id":"2308.02692","submitter":"Chris H Greene","authors":"Chris H. Greene and Matthew T. Eiles","title":"Green's function treatment of Rydberg molecules with spins","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The determination of ultra-long-range molecular potential curves has been\nreformulated using the Coulomb Greens function to give a solution in terms of\nthe roots of an analytical determinantal equation. For a system consisting of\none Rydberg atom with fine structure and a neutral perturbing ground state atom\nwith hyperfine structure, the solution yields potential energy curves and\nwavefunctions in terms of the quantum defects of the Rydberg atom and the\nelectron-perturber scattering phaseshifts and hyperfine splittings. This method\nprovides a promising alternative to the standard currently utilized method of\ndiagonalization, which suffers from problematic convergence issues and\nnonuniqueness, and can potentially yield a more quantitative relationship\nbetween Rydberg molecule spectroscopy and electron-atom scattering phaseshifts.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:05:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Greene","Chris H.",""],["Eiles","Matthew T.",""]]}
{"id":"2308.02693","submitter":"Friedrich G\\\"otze","authors":"S.G. Bobkov, G.P. Chistyakov and F. G\\\"otze","title":"Asymptotic Expansions and two-sided Bounds in Randomized Central Limit\n  Theorems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lower and upper bounds are explored for the uniform (Kolmogorov) and\n$L^2$-distances between the distributions of weighted sums of dependent\nsummands and the normal law. The results are illustrated for several classes of\nrandom variables whose joint distributions are supported on Euclidean spheres.\nWe also survey several results on improved rates of normal approximation in\nrandomized central limit theorems.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:06:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bobkov","S. G.",""],["Chistyakov","G. P.",""],["G\u00f6tze","F.",""]]}
{"id":"2308.02694","submitter":"Lennart Reimann","authors":"Lennart M. Reimann, Jonathan Wiesner, Dominik Sisejkovic, Farhad\n  Merchant and Rainer Leupers","title":"SoftFlow: Automated HW-SW Confidentiality Verification for Embedded\n  Processors","comments":"6 pages, accepted at 31st IFIP/IEEE Conference on Very Large Scale\n  Integration (VLSI-SoC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite its ever-increasing impact, security is not considered as a design\nobjective in commercial electronic design automation (EDA) tools. This results\nin vulnerabilities being overlooked during the software-hardware design\nprocess. Specifically, vulnerabilities that allow leakage of sensitive data\nmight stay unnoticed by standard testing, as the leakage itself might not\nresult in evident functional changes. Therefore, EDA tools are needed to\nelaborate the confidentiality of sensitive data during the design process.\nHowever, state-of-the-art implementations either solely consider the hardware\nor restrict the expressiveness of the security properties that must be proven.\nConsequently, more proficient tools are required to assist in the software and\nhardware design. To address this issue, we propose SoftFlow, an EDA tool that\nallows determining whether a given software exploits existing leakage paths in\nhardware. Based on our analysis, the leakage paths can be retained if proven\nnot to be exploited by software. This is desirable if the removal significantly\nimpacts the design's performance or functionality, or if the path cannot be\nremoved as the chip is already manufactured. We demonstrate the feasibility of\nSoftFlow by identifying vulnerabilities in OpenSSL cryptographic C programs,\nand redesigning them to avoid leakage of cryptographic keys in a RISC-V\narchitecture.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:11:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Reimann","Lennart M.",""],["Wiesner","Jonathan",""],["Sisejkovic","Dominik",""],["Merchant","Farhad",""],["Leupers","Rainer",""]]}
{"id":"2308.02695","submitter":"Justin Tittelfitz","authors":"Justin Tittelfitz","title":"FPR Estimation for Fraud Detection in the Presence of Class-Conditional\n  Label Noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of estimating the false-/ true-positive-rate\n(FPR/TPR) for a binary classification model when there are incorrect labels\n(label noise) in the validation set. Our motivating application is fraud\nprevention where accurate estimates of FPR are critical to preserving the\nexperience for good customers, and where label noise is highly asymmetric.\nExisting methods seek to minimize the total error in the cleaning process - to\navoid cleaning examples that are not noise, and to ensure cleaning of examples\nthat are. This is an important measure of accuracy but insufficient to\nguarantee good estimates of the true FPR or TPR for a model, and we show that\nusing the model to directly clean its own validation data leads to\nunderestimates even if total error is low. This indicates a need for\nresearchers to pursue methods that not only reduce total error but also seek to\nde-correlate cleaning error with model scores.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:14:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tittelfitz","Justin",""]]}
{"id":"2308.02696","submitter":"Mohammad Soleymani","authors":"Mohammad Soleymani, Ignacio Santamaria, and Eduard Jorswieck","title":"NOMA-based Improper Signaling for MIMO STAR-RIS-assisted Broadcast\n  Channels with Hardware Impairments","comments":"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":"  This paper proposes schemes to improve the spectral efficiency of a\nmultiple-input multiple-output (MIMO) broadcast channel (BC) with I/Q imbalance\n(IQI) at transceivers by employing a combination of improper Gaussian signaling\n(IGS), non-orthogonal multiple access (NOMA) and simultaneously transmit and\nreflect (STAR) reconfigurable intelligent surface (RIS). When there exists IQI,\nthe output RF signal is a widely linear transformation of the input signal,\nwhich may make the output signal improper. To compensate for IQI, we employ\nIGS, thus generating a transmit improper signal. We show that IGS alongside\nwith NOMA can highly increase the minimum rate of the users. Moreover, we\npropose schemes for different operational modes of STAR-RIS and show that\nSTAR-RIS can significantly improve the system performance. Additionally, we\nshow that IQI can highly degrade the performance especially if it is overlooked\nin the design.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:21:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Soleymani","Mohammad",""],["Santamaria","Ignacio",""],["Jorswieck","Eduard",""]]}
{"id":"2308.02697","submitter":"Subhadeep Sarkar","authors":"Arghya Choudhury, Arpita Mondal, Subhadeep Mondal and Subhadeep Sarkar","title":"Improving sensitivity of trilinear RPV SUSY searches using machine\n  learning at the LHC","comments":"37 pages, 10 figures, 13 tables","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 have explored the sensitivity of multilepton final states in\nprobing the gaugino sector of R-parity violating supersymmetric scenario with\nspecific lepton number violating trilinear couplings ($\\lambda_{ijk}$) being\nnon-zero. The gaugino spectrum is such that the charged leptons in the final\nstate can arise from the R-parity violating decays of the lightest\nsupersymmetric particle (LSP) as well as R-parity conserving decays of the\nnext-to-LSP (NLSP). Apart from a detailed cut-based analysis, we have also\nperformed a machine learning-based analysis using boosted decision tree\nalgorithm which provides much better sensitivity. In the scenarios with\nnon-zero $\\lambda_{121}$ and/or $\\lambda_{122}$ couplings, the LSP pair in the\nfinal states decays to $4l~(l = e, \\mu) + \\rm E{\\!\\!\\!/}_T$ final states with\n$100\\%$ branching ratio. We have shown that under this circumstance, a final\nstate with $\\ge 4l$ has the highest sensitivity in probing the gaugino masses.\nWe also discuss how the sensitivity can change in the presence of $\\tau$\nlepton(s) in the final state due to other choices of trilinear couplings. We\npresent our results through the estimation of the discovery and exclusion\ncontours in the gaugino mass plane for both the HL-LHC and the HE-LHC. For\n$\\lambda_{121}$ and/or $\\lambda_{122}$ nonzero scenario, the projected\n2$\\sigma$ exclusion limit on NLSP masses reaches upto 2.37 TeV and 4 TeV for\nthe HL-LHC and the HE-LHC respectively by using a machine learning based\nalgorithm. We obtain an enhancement of $\\sim$ 380 (190) GeV in the projected\n2$\\sigma$ exclusion limit on the NLSP masses at the 27 (14) TeV LHC.\nConsidering the same final state ($N_l \\geq 4$) for $\\lambda_{133}$ and/or\n$\\lambda_{233}$ non-zero scenario, we find that the corresponding 2$\\sigma$\nprojected limits are $\\sim$ 1.97 TeV and $\\sim$ 3.25 TeV for the HL-LHC and\nHE-LHC respectively.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:23:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Choudhury","Arghya",""],["Mondal","Arpita",""],["Mondal","Subhadeep",""],["Sarkar","Subhadeep",""]]}
{"id":"2308.02698","submitter":"Yoonchang Sung","authors":"Yoonchang Sung, Jnaneshwar Das, Pratap Tokekar","title":"Decision-Theoretic Approaches for Robotic Environmental Monitoring -- A\n  Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robotics has dramatically increased our ability to gather data about our\nenvironments. This is an opportune time for the robotics and algorithms\ncommunity to come together to contribute novel solutions to pressing\nenvironmental monitoring problems. In order to do so, it is useful to consider\na taxonomy of problems and methods in this realm. We present the first\ncomprehensive summary of decision theoretic approaches that are enabling\nefficient sampling of various kinds of environmental processes. Representations\nfor different kinds of environments are explored, followed by a discussion of\ntasks of interest such as learning, localization, or monitoring. Finally,\nvarious algorithms to carry out these tasks are presented, along with a few\nillustrative prior results from the community.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:31:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sung","Yoonchang",""],["Das","Jnaneshwar",""],["Tokekar","Pratap",""]]}
{"id":"2308.02699","submitter":"Vladimir Annenkov","authors":"Vladimir Annenkov, Evgeniia Volchok, Igor Timofeev","title":"Electromagnetic emission from plasma with counter-streaming electron\n  beams in the regime of oblique instability dominance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of electromagnetic emission generation in plasma with electron\nbeams is relevant both for practical applications and for interpretation of\nradio emission processes in astrophysical systems. In this work, we consider\nthe case of counter-propagating electron beams injection into plasma. Such\nsystems may occur in cosmic plasma in the case of closely spaced particle\nacceleration regions, and they can also be implemented in laboratory\nfacilities. Using particle-in-cell numerical simulations, we have shown that\nhigh beam-to-radiation conversion efficiency can be achieved in the case when\nbeams excite small scale oblique plasma oscillations. In this case, the\nradiation is generated in the vicinity of the second harmonic of the plasma\nfrequency. For such waves the surrounding plasma is transparent. It has been\nfound that the efficiency and spectrum of the radiation are not dependent on\nthe thickness of the beams. It has been also shown that parameters of the\nsystem necessary for efficient radiation generation by the discussed mechanism\ncan be found using the exact linear theory of beam-plasma instability.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:32:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Annenkov","Vladimir",""],["Volchok","Evgeniia",""],["Timofeev","Igor",""]]}
{"id":"2308.02700","submitter":"James Hague","authors":"James P. Hague","title":"Simultaneous self-organization of arterial and venous networks driven by\n  the physics of global power optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding of vascular organization is a long-standing problem in\nquantitative biology and biophysics and is essential for the growth of large\ncultured tissues. Approaches are needed that (1) make predictions of optimal\narteriovenous networks in order to understand the natural vasculatures that\noriginate from evolution (2) can design vasculature for 3D printing of cultured\ntissues, meats, organoids and organs. I present a method for determining the\nglobally optimal structure of interlocking arterial and venous (arteriovenous)\nnetworks. The core physics is comprised of the minimization of total power\nassociated with the whole vascular network, with penalties to stop arterial and\nvenous segments from intersecting. Specifically, the power needed for\nPoiseuille flow through vessels and the metabolic power cost for blood\nmaintenance are optimized. Simultaneous determination of both arterial and\nvenous vasculatures is essential to avoid intersections between vessels that\nwould bypass the capillary network. As proof-of-concept, I examine the optimal\nvascular structure for supplying square- and disk-like tissue shapes that would\nbe suitable for bioprinting in multi-well plates. Features in the trees are\ndriven by the bifurcation exponent and metabolic constant which affect whether\narteries and veins follow the same or different routes through the tissue. They\nalso affect the level of tortuosity in the vessels. The method could be used to\nunderstand the distribution of blood vessels within organs, to form the core of\nsimulations, and combined with 3D printing to generate vasculatures for\narbitrary volumes of cultured tissue and cultured meat.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:35:59 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 20:01:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hague","James P.",""]]}
{"id":"2308.02701","submitter":"Paola Boito","authors":"Paola Boito and Yuli Eidelman","title":"Computation of quasiseparable representations of Green matrices","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 well-known Asplund theorem states that the inverse of a (possibly\none-sided) band matrix $A$ is a Green matrix. In accordance with quasiseparable\ntheory, such a matrix admits a quasiseparable representation in its\nrank-structured part. Based on this idea, we derive algorithms that compute a\nquasiseparable representation of $A^{-1}$ with linear complexity. Many\ninversion algorithms for band matrices exist in the literature. However,\nalgorithms based on a computation of the rank structure performed theoretically\nvia the Asplund theorem appear for the first time in this paper. Numerical\nexperiments confirm complexity estimates and offer insight into stability\nproperties.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:37:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Boito","Paola",""],["Eidelman","Yuli",""]]}
{"id":"2308.02702","submitter":"Chen Li","authors":"Chen Li, Feifei Qian","title":"Swift progress for robots over complex terrain","comments":"4 pages, 1 figure","journal-ref":"2023 Nature News & Reviews, 616 (7956), 252-253","doi":"10.1038/d41586-023-00710-0","report-no":null,"categories":"cs.RO cs.SY eess.SY physics.bio-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A four-legged robot has learned to run on sand at faster pace than humans jog\non solid ground. With low energy use and few failures, this rapid robot shows\nthe value of combining data-driven learning with accurate yet simple models.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:39:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Chen",""],["Qian","Feifei",""]]}
{"id":"2308.02703","submitter":"Richard Barnard","authors":"Richard C. Barnard, Mohammad Daneshvar, Cory Hauck, Ilya Timofeyev","title":"Modeling Information Flow with a Multi-Stage Queuing Mode","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce a nonlinear stochastic model to describe the\npropagation of information inside a computer processor. In this model, a\ncomputational task is divided into stages, and information can flow from one\nstage to another. The model is formulated as a spatially-extended,\ncontinuous-time Markov chain where space represents different stages. This\nmodel is equivalent to a spatially-extended version of the M/M/s queue. The\nmain modeling feature is the throttling function which describes the processor\nslowdown when the amount of information falls below a certain threshold. We\nderive the stationary distribution for this stochastic model and develop a\nclosure for a deterministic ODE system that approximates the evolution of the\nmean and variance of the stochastic model. We demonstrate the validity of the\nclosure with numerical simulations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:41:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Barnard","Richard C.",""],["Daneshvar","Mohammad",""],["Hauck","Cory",""],["Timofeyev","Ilya",""]]}
{"id":"2308.02704","submitter":"Taha Alper Yo\\u{g}urt Ph.D. candidate","authors":"T.A. Yo\\u{g}urt, U. Tanyeri, A. Kele\\c{s}, M.\\\"O. Oktel","title":"Vortex Lattices in Strongly Confined Quantum Droplets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Bose mixture quantum droplets display a fascinating stability that relies on\nquantum fluctuations to prevent collapse driven by mean-field effects. Most\ndroplet research focuses on untrapped or weakly trapped scenarios, where the\ndroplets exhibit a liquid-like flat density profile. When weakly trapped\ndroplets rotate, they usually respond through center-of-mass motion or\nsplitting instability. Here, we study rapidly rotating droplets in the strong\nexternal confinement limit where the external potential prevents splitting and\nthe center-of-mass excitation. We find that quantum droplets form a triangular\nvortex lattice as in single-component repulsive Bose-Einstein condensates\n(BEC), but the overall density follows the analytical Thomas-Fermi profile\nobtained from a cubic equation. We observe three significant differences\nbetween rapidly rotating droplets and repulsive BECs. First, the vortex core\nsize changes markedly at finite density, visible in numerically obtained\ndensity profiles. We analytically estimate the vortex core sizes from the\ndroplets' coherence length and find good agreement with the numerical results.\nSecond, the change in the density profile gives a slight but observable\ndistortion to the lattice, which agrees with the distortion expected due to\nnonuniform superfluid density. Lastly, unlike a repulsive BEC, which expands\nsubstantially as the rotation frequency approaches the trapping frequency,\nrapidly rotating droplets show only a fractional change in their size. We argue\nthat this last point can be used to create clouds with lower filling factors,\nwhich may facilitate reaching the elusive strongly correlated regime.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:41:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yo\u011furt","T. A.",""],["Tanyeri","U.",""],["Kele\u015f","A.",""],["Oktel","M. \u00d6.",""]]}
{"id":"2308.02705","submitter":"Adam Larios","authors":"Adam Larios, Mark R. Petersen, Collin Victor","title":"Application of Continuous Data Assimilation in High-Resolution Ocean\n  Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP physics.ao-ph physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate a formulation of the Azouani-Olson-Titi (AOT) algorithm in the\nMPAS-Ocean implementation of the primitive equations of the ocean, presenting\nglobal ocean simulations with realistic coastlines and bathymetry. We observe\nan exponentially fast decay in the error before reaching a certain error level,\nwhich depends on the terms involved and whether the AOT feedback control term\nwas handled implicitly or explicitly. A wide range of errors was observed for\nboth schemes, with the implicit scheme typically exhibiting lower error levels,\ndepending on the specific physical terms included in the model. Several factors\nseem to be contributing to this wide range, but the vertical mixing term is\ndemonstrated to be an especially problematic term. This study provides insight\ninto the promises and challenges of adapting the AOT algorithm to the setting\nof high-resolution, realistic ocean models.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:43:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Larios","Adam",""],["Petersen","Mark R.",""],["Victor","Collin",""]]}
{"id":"2308.02706","submitter":"Terence Bl\\'esin","authors":"Terence Bl\\'esin, Wil Kao, Anat Siddharth, Rui N. Wang, Alaina\n  Attanasio, Hao Tian, Sunil A. Bhave, Tobias J. Kippenberg","title":"Bidirectional microwave-optical transduction based on integration of\n  high-overtone bulk acoustic resonators and photonic circuits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Coherent interconversion between microwave and optical frequencies can serve\nas both classical and quantum interfaces for computing, communication, and\nsensing. Here, we present a compact microwave-optical transducer based on\nmonolithic integration of piezoelectric actuators atop silicon nitride photonic\ncircuits. Such an actuator directly couples microwave signals to a\nhigh-overtone bulk acoustic resonator defined by the suspended silica cladding\nof the optical waveguide core, which leads to enhanced electromechanical and\noptomechanical couplings. At room temperature, this triply resonant\npiezo-optomechanical transducer achieves an off-chip photon number conversion\nefficiency of -48 dB over a bandwidth of 25 MHz at an input pump power of 21\ndBm. The approach is scalable in manufacturing and, unlike existing\nelectro-optic transducers, does not rely on superconducting resonators. As the\ntransduction process is bidirectional, we further demonstrate synthesis of\nmicrowave pulses from a purely optical input. Combined with the capability of\nleveraging multiple acoustic modes for transduction, the present platform\noffers prospects for building frequency-multiplexed qubit interconnects and for\nmicrowave photonics at large.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:47:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bl\u00e9sin","Terence",""],["Kao","Wil",""],["Siddharth","Anat",""],["Wang","Rui N.",""],["Attanasio","Alaina",""],["Tian","Hao",""],["Bhave","Sunil A.",""],["Kippenberg","Tobias J.",""]]}
{"id":"2308.02707","submitter":"Scott Davidson Geraedts","authors":"Scott Geraedts, Erica Brand, Thomas R. Dean, Sebastian Eastham, Carl\n  Elkin, Zebediah Engberg, Ulrike Hager, Ian Langmore, Kevin McCloskey, Joe\n  Yue-Hei Ng, John C. Platt, Tharun Sankar, Aaron Sarna, Marc Shapiro, Nita\n  Goyal","title":"A scalable system to measure contrail formation on a per-flight basis","comments":"25 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Persistent contrails make up a large fraction of aviation's contribution to\nglobal warming. We describe a scalable, automated detection and matching (ADM)\nsystem to determine from satellite data whether a flight has made a persistent\ncontrail. The ADM system compares flight segments to contrails detected by a\ncomputer vision algorithm running on images from the GOES-16 Advanced Baseline\nImager. We develop a 'flight matching' algorithm and use it to label each\nflight segment as a 'match' or 'non-match'. We perform this analysis on 1.6\nmillion flight segments. The result is an analysis of which flights make\npersistent contrails several orders of magnitude larger than any previous work.\nWe assess the agreement between our labels and available prediction models\nbased on weather forecasts. Shifting air traffic to avoid regions of contrail\nformation has been proposed as a possible mitigation with the potential for\nvery low cost/ton-CO2e. Our findings suggest that imperfections in these\nprediction models increase this cost/ton by about an order of magnitude.\nContrail avoidance is a cost-effective climate change mitigation even with this\nfactor taken into account, but our results quantify the need for more accurate\ncontrail prediction methods and establish a benchmark for future development.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:52:01 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 13:53:39 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 13:10:47 GMT"},{"version":"v4","created":"Mon, 14 Aug 2023 19:03:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Geraedts","Scott",""],["Brand","Erica",""],["Dean","Thomas R.",""],["Eastham","Sebastian",""],["Elkin","Carl",""],["Engberg","Zebediah",""],["Hager","Ulrike",""],["Langmore","Ian",""],["McCloskey","Kevin",""],["Ng","Joe Yue-Hei",""],["Platt","John C.",""],["Sankar","Tharun",""],["Sarna","Aaron",""],["Shapiro","Marc",""],["Goyal","Nita",""]]}
{"id":"2308.02708","submitter":"Xiaoyu Huang","authors":"Xiaoyu Huang","title":"On deformation rings of residual Galois representations with three\n  Jordan-Holder factors and modularity","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 paper, we study Fontaine-Laffaille, self-dual deformations of a mod p\nnon-semisimple Galois representation of dimension n with its Jordan-Holder\nfactors being three mutually non-isomorphic absolutely irreducible\nrepresentations. We show that under some conditions regarding the orders of\ncertain Selmer groups, the universal deformation ring is a discrete valuation\nring. Given enough information on the Hecke algebra, we also prove an R = T\ntheorem in the general context. We then apply our results to abelian surfaces\nwith cyclic rational isogenies and certain 6-dimensional representations\narising from automorphic forms congruent to Ikeda lifts. Assuming the\nBloch-Kato conjecture, our result identifies special L-value conditions for the\nexistence of a unique abelian surface isogeny class and an R = T theorem for\ncertain 6-dimensional Galois representations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:56:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Xiaoyu",""]]}
{"id":"2308.02709","submitter":"Madhumitha Shridharan","authors":"Madhumitha Shridharan and Garud Iyengar","title":"Scalable Computation of Causal Bounds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of computing bounds for causal queries on causal\ngraphs with unobserved confounders and discrete valued observed variables,\nwhere identifiability does not hold. Existing non-parametric approaches for\ncomputing such bounds use linear programming (LP) formulations that quickly\nbecome intractable for existing solvers because the size of the LP grows\nexponentially in the number of edges in the causal graph. We show that this LP\ncan be significantly pruned, allowing us to compute bounds for significantly\nlarger causal inference problems compared to existing techniques. This pruning\nprocedure allows us to compute bounds in closed form for a special class of\nproblems, including a well-studied family of problems where multiple confounded\ntreatments influence an outcome. We extend our pruning methodology to\nfractional LPs which compute bounds for causal queries which incorporate\nadditional observations about the unit. We show that our methods provide\nsignificant runtime improvement compared to benchmarks in experiments and\nextend our results to the finite data setting. For causal inference without\nadditional observations, we propose an efficient greedy heuristic that produces\nhigh quality bounds, and scales to problems that are several orders of\nmagnitude larger than those for which the pruned LP can be solved.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:00:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shridharan","Madhumitha",""],["Iyengar","Garud",""]]}
{"id":"2308.02710","submitter":"Fergal Stapleton","authors":"Edgar Galv\\'an and Fergal Stapleton","title":"Evolutionary Multi-objective Optimisation in Neurotrajectory Prediction","comments":"38 pages, 6 Figure, 10 Tables","journal-ref":"Applied Soft Computing (2023)","doi":"10.1016/j.asoc.2023.110693","report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning has rapidly evolved during the last decade, achieving expert\nhuman performance on notoriously challenging problems such as image\nclassification. This success is partly due to the re-emergence of bio-inspired\nmodern artificial neural networks (ANNs) along with the availability of\ncomputation power, vast labelled data and ingenious human-based expert\nknowledge as well as optimisation approaches that can find the correct\nconfiguration (and weights) for these networks. Neuroevolution is a term used\nfor the latter when employing evolutionary algorithms. Most of the works in\nneuroevolution have focused their attention in a single type of ANNs, named\nConvolutional Neural Networks (CNNs). Moreover, most of these works have used a\nsingle optimisation approach. This work makes a progressive step forward in\nneuroevolution for vehicle trajectory prediction, referred to as\nneurotrajectory prediction, where multiple objectives must be considered. To\nthis end, rich ANNs composed of CNNs and Long-short Term Memory Network are\nadopted. Two well-known and robust Evolutionary Multi-objective Optimisation\n(EMO) algorithms, NSGA-II and MOEA/D are also adopted. The completely different\nunderlying mechanism of each of these algorithms sheds light on the\nimplications of using one over the other EMO approach in neurotrajectory\nprediction. In particular, the importance of considering objective scaling is\nhighlighted, finding that MOEA/D can be more adept at focusing on specific\nobjectives whereas, NSGA-II tends to be more invariant to objective scaling.\nAdditionally, certain objectives are shown to be either beneficial or\ndetrimental to finding valid models, for instance, inclusion of a distance\nfeedback objective was considerably detrimental to finding valid models, while\na lateral velocity objective was more beneficial.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:06:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Galv\u00e1n","Edgar",""],["Stapleton","Fergal",""]]}
{"id":"2308.02711","submitter":"Opeyemi Ajibuwa","authors":"Opeyemi Emmanuel Ajibuwa, Samson Damilola Fabiyi, Gbenga Emmanuel Dada","title":"Resilient and Privacy-Preserving Threshold Vehicular Public Key\n  Infrastructure (VPKI)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vehicular Public Key Infrastructure (VPKI) plays a vital role in ensuring\nsecure and privacy-preserving communication in vehicular ad hoc networks\n(VANETs). However, current VPKI architectures face significant challenges in\nterms of scalability, resilience, and privacy preservation. This paper proposes\na novel threshold-based VPKI architecture to overcome these limitations.\nLeveraging a Schnorr threshold signature scheme based on elliptic curve\ncryptography, the proposed architecture eliminates the reliance on individual\ncertificate authorities (CAs) and distributes trust among multiple CAs in a\nthreshold certificate signing approach. This enhances resilience and mitigates\nthe single point-of-failure vulnerability. The architecture also addresses\nsybil-based misbehaviors through a time-restrictive pseudonym design that\neliminates multiple simultaneous use of pseudonyms. Furthermore, the scheme\nreduces the size and latency of Certificate Revocation List (CRL) distribution\nby clustering multiple CAs in a threshold setting and adopting a\nregion-specific CRL. The paper presents detailed analysis of the security,\nprivacy and performance benefits of the proposed architecture. Results from the\nperformance evaluation shows the improved resiliency, reduced handover rates,\nand better scalability potential of the proposed threshold-based VPKI\narchitecture compared to existing techniques. The proposed threshold-based VPKI\nholds great promise in ensuring secure and privacy-preserving communication in\nVANETs, paving the way for safer and more efficient vehicular networks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:11:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ajibuwa","Opeyemi Emmanuel",""],["Fabiyi","Samson Damilola",""],["Dada","Gbenga Emmanuel",""]]}
{"id":"2308.02712","submitter":"Jean-Luc Margot","authors":"Jean-Luc Margot, Megan G. Li, Pavlo Pinchuk, Nathan Myhrvold, Lea E.\n  Alcantara, Megan T. Andrakin, Jeth Arunseangroj, Damien S. Baclet, Madison H.\n  Belk, Zerxes R. Bhadha, Nicholas W. Brandis, Robert E. Carey, Harrison P.\n  Cassar, Sai S. Chava, Calvin Chen, James Chen, Kellen T. Cheng, Alessia\n  Cimbri, Benjamin Cloutier, Jordan A. Combitsis, Kelly L. Couvrette, Brandon\n  P. Coy, Kyle W. Davis, Antoine F. Delcayre, Michelle R. Du, Sarah E. Feil,\n  Danning Fu, Travis J. Gilmore, Emery Grahill-Bland, Laura M. Iglesias, Zoe\n  Juneau, Anthony G. Karapetian, George Karfakis, Christopher T. Lambert, Eric\n  A. Lazbin, Jian H. Li, Zhuofu (Chester) Li, Darren J. Lu, Detao Ma, Vedant\n  Mathur, Mary H. Minasyan, Mark T. Nasielski, Janice T. Nguyen, Lorraine M.\n  Nicholson, Divij Ohri, Atharva U. Padhye, Supreethi V. Penmetcha, Yugantar\n  Prakash, Xinyi (Cindy) Qi, Vedant Sahu, Joshua A. Scally, Zefyr Scott, Trevor\n  J. Seddon, Lara-Lynn V. Shohet, Anchal Sinha, Anthony E. Sinigiani, Jiuxu\n  Song, Spencer M. Stice, Andria Uplisashvili, Krishna Vanga, Amaury G.\n  Vazquez, George Vetushko, Valeria Villa, Maria Vincent, Ian J. Waasdorp, Ian\n  B. Wagaman, Amanda Wang, Jade C. Wight, Ella Wong, Natsuko Yamaguchi, Zijin\n  Zhang, Junyang Zhao, Ryan S. Lynch","title":"A Search for Technosignatures Around 11,680 Stars with the Green Bank\n  Telescope at 1.15-1.73 GHz","comments":"17 pages, 8 figures, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We conducted a search for narrowband radio signals over four observing\nsessions in 2020-2023 with the L-band receiver (1.15-1.73 GHz) of the 100 m\ndiameter Green Bank Telescope. We pointed the telescope in the directions of 62\nTESS Objects of Interest, capturing radio emissions from a total of ~11,860\nstars and planetary systems in the ~9 arcminute beam of the telescope. All\ndetections were either automatically rejected or visually inspected and\nconfirmed to be of anthropogenic nature. In this work, we also quantified the\nend-to-end efficiency of radio SETI pipelines with a signal injection and\nrecovery analysis. The UCLA SETI pipeline recovers 94.0% of the injected\nsignals over the usable frequency range of the receiver and 98.7% of the\ninjections when regions of dense RFI are excluded. In another pipeline that\nuses incoherent sums of 51 consecutive spectra, the recovery rate is ~15 times\nsmaller at ~6%. The pipeline efficiency affects SETI search volume calculations\nas well as calculations of upper bounds on the number of transmitting\ncivilizations. We developed an improved Drake Figure of Merit for SETI search\nvolume calculations that includes the pipeline efficiency and frequency drift\nrate coverage. Based on our observations, we found that there is a high\nprobability (94.0-98.7%) that fewer than ~0.014% of stars earlier than M8\nwithin 100 pc host a transmitter that is detectable in our search (EIRP > 10e12\nW). Finally, we showed that the UCLA SETI pipeline natively detects the signals\ndetected with AI techniques by Ma et al., 2023.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:17:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Margot","Jean-Luc","","Chester"],["Li","Megan G.","","Chester"],["Pinchuk","Pavlo","","Chester"],["Myhrvold","Nathan","","Chester"],["Alcantara","Lea E.","","Chester"],["Andrakin","Megan T.","","Chester"],["Arunseangroj","Jeth","","Chester"],["Baclet","Damien S.","","Chester"],["Belk","Madison H.","","Chester"],["Bhadha","Zerxes R.","","Chester"],["Brandis","Nicholas W.","","Chester"],["Carey","Robert E.","","Chester"],["Cassar","Harrison P.","","Chester"],["Chava","Sai S.","","Chester"],["Chen","Calvin","","Chester"],["Chen","James","","Chester"],["Cheng","Kellen T.","","Chester"],["Cimbri","Alessia","","Chester"],["Cloutier","Benjamin","","Chester"],["Combitsis","Jordan A.","","Chester"],["Couvrette","Kelly L.","","Chester"],["Coy","Brandon P.","","Chester"],["Davis","Kyle W.","","Chester"],["Delcayre","Antoine F.","","Chester"],["Du","Michelle R.","","Chester"],["Feil","Sarah E.","","Chester"],["Fu","Danning","","Chester"],["Gilmore","Travis J.","","Chester"],["Grahill-Bland","Emery","","Chester"],["Iglesias","Laura M.","","Chester"],["Juneau","Zoe","","Chester"],["Karapetian","Anthony G.","","Chester"],["Karfakis","George","","Chester"],["Lambert","Christopher T.","","Chester"],["Lazbin","Eric A.","","Chester"],["Li","Jian H.","","Chester"],["Zhuofu","","","Chester"],["Li","","","Cindy"],["Lu","Darren J.","","Cindy"],["Ma","Detao","","Cindy"],["Mathur","Vedant","","Cindy"],["Minasyan","Mary H.","","Cindy"],["Nasielski","Mark T.","","Cindy"],["Nguyen","Janice T.","","Cindy"],["Nicholson","Lorraine M.","","Cindy"],["Ohri","Divij","","Cindy"],["Padhye","Atharva U.","","Cindy"],["Penmetcha","Supreethi V.","","Cindy"],["Prakash","Yugantar","","Cindy"],["Xinyi","","","Cindy"],["Qi","",""],["Sahu","Vedant",""],["Scally","Joshua A.",""],["Scott","Zefyr",""],["Seddon","Trevor J.",""],["Shohet","Lara-Lynn V.",""],["Sinha","Anchal",""],["Sinigiani","Anthony E.",""],["Song","Jiuxu",""],["Stice","Spencer M.",""],["Uplisashvili","Andria",""],["Vanga","Krishna",""],["Vazquez","Amaury G.",""],["Vetushko","George",""],["Villa","Valeria",""],["Vincent","Maria",""],["Waasdorp","Ian J.",""],["Wagaman","Ian B.",""],["Wang","Amanda",""],["Wight","Jade C.",""],["Wong","Ella",""],["Yamaguchi","Natsuko",""],["Zhang","Zijin",""],["Zhao","Junyang",""],["Lynch","Ryan S.",""]]}
{"id":"2308.02713","submitter":"Sagnik Bhadury","authors":"Sagnik Bhadury, Riten Mitra and Jeremy T. Gaskins","title":"Fast Bayesian High-Dimensional Gaussian Graphical Model Estimation","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":"  Graphical models describe associations between variables through the notion\nof conditional independence. Gaussian graphical models are a widely used class\nof such models where the relationships are formalized by non-null entries of\nthe precision matrix. However, in high dimensional cases, standard covariance\nestimates are typically unstable. Moreover, it is natural to expect only a few\nsignificant associations to be present in many realistic applications. This\nnecessitates the injection of sparsity techniques into the estimation.\nClassical frequentist methods use penalization for this purpose; in contrast,\nfully Bayesian methods are computationally slow, typically requiring iterative\nsampling over a quadratic number of parameters in a space constrained by\npositive definiteness. We propose a Bayesian graph estimation method based on\nan ensemble of Bayesian neighborhood regressions. An attractive feature of our\nmethods is the ability for easy parallelization across separate graphical\nneighborhoods, invoking computational efficiency greater than most existing\nmethods. Our strategy induces sparsity with a Horseshoe shrinkage prior and\nincludes a novel variable selection step based on the marginal likelihood from\nthe predictors ranks. Our method appropriately combines the estimated\nregression coefficients to produce a graph estimate and a matrix of partial\ncorrelation estimates for inference. Performance of various methods are\nassessed using measures like FDR and TPR. Competitive performance across a\nvariety of cases is demonstrated through extensive simulations. Lastly, we\napply these methods to investigate the dependence structure across genetic\nexpressions for women with triple negative breast cancer.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:17:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bhadury","Sagnik",""],["Mitra","Riten",""],["Gaskins","Jeremy T.",""]]}
{"id":"2308.02714","submitter":"Antonio Castro","authors":"Antonio Castro","title":"Exploring the Effect of Sparse Recovery on the Quality of Image\n  Superresolution","comments":null,"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":"  Dictionary learning can be used for image superresolution by learning a pair\nof coupled dictionaries of image patches from high-resolution and\nlow-resolution image pairs such that the corresponding pairs share the same\nsparse vector when represented by the coupled dictionaries. These dictionaries\nthen can be used to to reconstruct the corresponding high-resolution patches\nfrom low-resolution input images based on sparse recovery. The idea is to\nrecover the shared sparse vector using the low-resolution dictionary and then\nmultiply it by the high-resolution dictionary to recover the corresponding\nhigh-resolution image patch. In this work, we study the effect of the sparse\nrecovery algorithm that we use on the quality of the reconstructed images. We\noffer empirical experiments to search for the best sparse recovery algorithm\nthat can be used for this purpose.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:18:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Castro","Antonio",""]]}
{"id":"2308.02715","submitter":"Jong Hoon Park","authors":"Jong Hoon Park, Gauri Pramod Dalwankar, Alison Bartsch, Abraham\n  George, Amir Barati Farimani","title":"Fluid Property Prediction Leveraging AI and Robotics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Inferring liquid properties from vision is a challenging task due to the\ncomplex nature of fluids, both in behavior and detection. Nevertheless, the\nability to infer their properties directly from visual information is highly\nvaluable for autonomous fluid handling systems, as cameras are readily\navailable. Moreover, predicting fluid properties purely from vision can\naccelerate the process of fluid characterization saving considerable time and\neffort in various experimental environments. In this work, we present a purely\nvision-based approach to estimate viscosity, leveraging the fact that the\nbehavior of the fluid oscillations is directly related to the viscosity.\nSpecifically, we utilize a 3D convolutional autoencoder to learn latent\nrepresentations of different fluid-oscillating patterns present in videos. We\nleverage this latent representation to visually infer the category of fluid or\nthe dynamics viscosity of fluid from video.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:23:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Park","Jong Hoon",""],["Dalwankar","Gauri Pramod",""],["Bartsch","Alison",""],["George","Abraham",""],["Farimani","Amir Barati",""]]}
{"id":"2308.02716","submitter":"Yangke Li","authors":"Yangke Li","title":"EndoDepthL: Lightweight Endoscopic Monocular Depth Estimation with\n  CNN-Transformer","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 study, we address the key challenges concerning the accuracy and\neffectiveness of depth estimation for endoscopic imaging, with a particular\nemphasis on real-time inference and the impact of light reflections. We propose\na novel lightweight solution named EndoDepthL that integrates Convolutional\nNeural Networks (CNN) and Transformers to predict multi-scale depth maps. Our\napproach includes optimizing the network architecture, incorporating\nmulti-scale dilated convolution, and a multi-channel attention mechanism. We\nalso introduce a statistical confidence boundary mask to minimize the impact of\nreflective areas. To better evaluate the performance of monocular depth\nestimation in endoscopic imaging, we propose a novel complexity evaluation\nmetric that considers network parameter size, floating-point operations, and\ninference frames per second. We comprehensively evaluate our proposed method\nand compare it with existing baseline solutions. The results demonstrate that\nEndoDepthL ensures depth estimation accuracy with a lightweight structure.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:38:29 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 17:39:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Yangke",""]]}
{"id":"2308.02717","submitter":"Robert Ralowski","authors":"Micha{\\l} Morayne, Robert Ra{\\l}owski","title":"Fixed point theorems for topological contractions and the Hutchinson\n  operator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a topological space $X$ a topological contraction on $X$ is a closed\nmapping $f:X\\to X$ such that for every open cover of $X$ there is a positive\ninteger $n$ such that the image of the space $X$ via the $n$th iteration of $f$\nis a subset of some element of the cover. Every topological contraction in a\ncompact $T_1$ space has a unique fixed point. As in the case of metric spaces\nand the classical Banach fixed point theorem, this analogue of Banach's theorem\nis true not only in compact but also in complete (here in the sense of\n\\v{C}ech) $T_1$ spaces. We introduce a notion of weak topological contraction\nand in Hausdorff spaces we prove the existence of a unique fixed point for such\ncontinuous and closed mappings without assuming completeness or compactness of\nthe space considered. These theorems are applied to prove existence of fixed\npoints for mappings on compact subsets of linear spaces with weak topologies\nand for compact monoids. We also prove some fixed point results for $T_1$\nlocally Hausdorff spaces and, introduced here, peripherally Hausdorff spaces.\nAn iterated function system on a topological space, IFS, is a finite family of\nclosed mappings from the space into itself. It is contractive if for every open\ncover of $X$ for some positive integer $n$ the image of $X$ via a composition\nof $n$ mappings from the IFS is contained in an element of the cover. We show\nthat in $T_1$ compact topological spaces the Hutchinson operator of a\ncontractive IFS may not be closed as the mapping in the hyperspace of closed\nsubsets of the space. Nevertheless, the Hutchinson operator of a contractive\nIFS has always a unique fixed point.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:39:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Morayne","Micha\u0142",""],["Ra\u0142owski","Robert",""]]}
{"id":"2308.02718","submitter":"Carlos Florentino","authors":"Indranil Biswas, Carlos Florentino and Azizeh Nozad","title":"Topology of the moduli spaces of Higgs bundles over abelian varieties","comments":"Dedicated to Peter E. Newstead","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.DG math.RT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Abstract. Let G be a complex reductive group and A be an Abelian variety of\ndimension d over $\\mathbb{C}$. We determine the Poincar\\'e polynomials and also\nthe mixed Hodge polynomials of the moduli space $\\mathcal{M}_{A}^{H}(G)$ of\nG-Higgs bundles over A. We show that these are normal varieties with symplectic\nsingularities, when G is a classical semisimple group. For\n$G=GL_{n}(\\mathbb{C})$, we also compute Poincar\\'e polynomials of natural\ndesingularizations of $\\mathcal{M}_{A}^{H}(G)$ and of G-character varieties of\nfree abelian groups, in some cases. In particular, explicit formulas are\nobtained when dim A=d=1, and also for rank 2 and 3 Higgs bundles, for arbitrary\nd>1.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:42:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Biswas","Indranil",""],["Florentino","Carlos",""],["Nozad","Azizeh",""]]}
{"id":"2308.02719","submitter":"Ian Lizarraga","authors":"Bronwyn H Bradshaw-Hajek, Ian Lizarraga, Robert Marangell, and Martin\n  Wechselberger","title":"A geometric singular perturbation analysis of generalised shock\n  selection rules in reaction-nonlinear diffusion models","comments":"43 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reaction-nonlinear diffusion (RND) partial differential equations are a\nfruitful playground to model the formation of sharp travelling fronts, a\nfundamental pattern in nature. In this work, we demonstrate the utility and\nscope of regularisation as a technique to investigate shock-fronted solutions\nof RND PDEs, using geometric singular perturbation theory (GSPT) as the\nmathematical framework. In particular, we show that composite regularisations\ncan be used to construct families of monotone shock-fronted travelling waves\nsweeping out distinct generalised area rules, which interpolate between the\nequal area and extremal area (i.e. algebraic decay) rules that are well-known\nin the shockwave literature. We further demonstrate that our RND PDE supports\nother kinds of shock-fronted solutions, namely, nonmonotone shockwaves as well\nas shockwaves containing slow tails in the aggregation (negative diffusion)\nregime. Our analysis blends Melnikov methods -- in both smooth and\npiecewise-smooth settings -- with GSPT techniques applied to the PDE over\ndistinct spatiotemporal scales.\n  We also consider the spectral stability of these new interpolated shockwaves.\nUsing techniques from geometric spectral stability theory, we determine that\nour RND PDE admits spectrally stable shock-fronted travelling waves. The\nmultiple-scale nature of the regularised RND PDE continues to play an important\nrole in the analysis of the spatial eigenvalue problem.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:45:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bradshaw-Hajek","Bronwyn H",""],["Lizarraga","Ian",""],["Marangell","Robert",""],["Wechselberger","Martin",""]]}
{"id":"2308.02720","submitter":"Abigail Azari","authors":"A. R. Azari, E. Abrahams, F. Sapienza, D. L. Mitchell, J. Biersteker,\n  S. Xu, C. Bowers, F. P\\'erez, G. A. DiBraccio, Y. Dong","title":"Magnetic Field Draping in Induced Magnetospheres: Evidence from the\n  MAVEN Mission to Mars","comments":"Under review in Journal of Geophysical Research: Space Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph astro-ph.EP stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Mars Atmosphere and Volatile EvolutioN (MAVEN) mission has been orbiting\nMars since 2014 and now has tens of thousands of orbits which we use to\ncharacterize Mars' dynamic space environment. Through global field line tracing\nwith MAVEN magnetic field data we find an altitude dependent draping morphology\nthat differs from expectations of induced magnetospheres in the vertical ($\\hat\nZ$ Mars Sun-state, MSO) direction. We quantify this difference from the\nclassical picture of induced magnetospheres with a Bayesian multiple linear\nregression model to predict the draped field as a function of the upstream\ninterplanetary magnetic field (IMF), remanent crustal fields, and a previously\nunderestimated induced effect. From our model we conclude that unexpected\ntwists in high altitude dayside draping ($>$800 km) are a result of the IMF\nangle in the X, Y MSO plane. We propose that this is a natural outcome of\ncurrent theories of induced magnetospheres but has been underestimated due to\napproximations of the IMF as solely $\\pm \\hat Y$ directed. We additionally\nestimate that distortions in low altitude ($<$800 km) dayside draping along\n$\\hat Z$ are directly related to remanent crustal fields. We show dayside\ndraping propagates down tail and previously reported inner magnetotail twists\nare likely caused by the crustal field of Mars, while the outer tail morphology\nis governed by an induced response to the IMF direction. We conclude with an\nupdated understanding of induced magnetospheres which details dayside draping\nfor multiple directions of the incoming IMF and discuss the repercussions of\nthis draping for magnetotail morphology.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:50:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Azari","A. R.",""],["Abrahams","E.",""],["Sapienza","F.",""],["Mitchell","D. L.",""],["Biersteker","J.",""],["Xu","S.",""],["Bowers","C.",""],["P\u00e9rez","F.",""],["DiBraccio","G. A.",""],["Dong","Y.",""]]}
{"id":"2308.02721","submitter":"Nicolas Vizarim","authors":"J. C. Bellizotti Souza, N. P. Vizarim, C. J. O. Reichhardt, C.\n  Reichhardt and P. A. Venegas","title":"Soliton motion induced along ferromagnetic skyrmion chains in chiral\n  thin nanotracks","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using atomistic magnetic simulations we investigate the soliton motion along\na pinned skyrmion chain containing an interstitial skyrmion. We find that the\nsoliton can exhibit stable motion along the chain without a skyrmion Hall\neffect for an extended range of drives. Under a constant drive the solitons\nhave a constant velocity. We also measure the skyrmion velocity-current curves\nand identify the signatures of different phases including a pinned phase,\nstable soliton motion, and quasi-free motion at higher drives where all of the\nskyrmions depin from the pinning centers and move along the rigid wall. In the\nquasi-free motion regime, the velocity is oscillatory due to the motion of the\nskyrmions over the pinning sites. For increasing pinning strength, the onset of\nsoliton motion shifts to higher values of current density. We also find that\nfor stronger pinning, the characteristic velocity-current shape is affected by\nthe annihilation of single or multiple skyrmions in the drive interval over\nwhich the soliton motion occurs. Our results indicate that stable skyrmion\nsoliton motion is possible and could be useful for technological applications.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:57:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Souza","J. C. Bellizotti",""],["Vizarim","N. P.",""],["Reichhardt","C. J. O.",""],["Reichhardt","C.",""],["Venegas","P. A.",""]]}
{"id":"2308.02722","submitter":"Takasumi Maruyama","authors":"D.H.Lee, S.Ajimura, M.K.Cheoun, J.H.Choi, J.Y.Choi, T.Dodo, J.Goh,\n  K.Haga, M.Harada, S.Hasegawa, T.Hiraiwa, W.Hwang, H.I.Jang, J.S.Jang, H.Jeon,\n  S.Jeon, K.K.Joo, D.E.Jung, S.K.Kang, Y.Kasugai, T.Kawasaki, E.J.Kim, J.Y.Kim,\n  S.B.Kim, W.Kim, H.Kinoshita, T.Konno, I.T.Lim, C.Little, E.Marzec,\n  T.Maruyama, S.Masuda, S.Meigom, S.Monjushiro, D.H.Moon, T.Nakano, M.Niiyama,\n  K.Nishikawa, M.Y.Pac, H.W.Park, J.S.Park, R.G.Park, S.J.M.Peeters, C.Rott,\n  K.Sakai, S.Sakamoto, T.Shima, C.D.Shin, J.Spitz, F.Suekane, Y.Sugaya,\n  K.Suzuya, M.Taira, Y.Yamaguchi, M.Yeh, I.S.Yeo, C.Yoo, I.Yu","title":"Study on the accidental background of the JSNS$^2$ experiment","comments":"arXiv admin note: substantial text overlap with arXiv:2111.07482","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  JSNS$^2$ (J-PARC Sterile Neutrino Search at J-PARC Spallation Neutron Source)\nis an experiment which searches for sterile neutrinos via the observation of\n$\\bar{\\nu}_{\\mu} \\to \\bar{\\nu}_{e}$ appearance oscillations using muon\ndecay-at-rest neutrinos. The data taking of JSNS$^2$ have been performed from\n2021. In this manuscript, a study of the accidental background is presented.\nThe rate of the accidental background is (9.29$\\pm 0.39) \\times 10^{-8}$ /\nspill with 0.75 MW beam power and comparable to the number of searching\nsignals.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:58:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lee","D. H.",""],["Ajimura","S.",""],["Cheoun","M. K.",""],["Choi","J. H.",""],["Choi","J. Y.",""],["Dodo","T.",""],["Goh","J.",""],["Haga","K.",""],["Harada","M.",""],["Hasegawa","S.",""],["Hiraiwa","T.",""],["Hwang","W.",""],["Jang","H. I.",""],["Jang","J. S.",""],["Jeon","H.",""],["Jeon","S.",""],["Joo","K. K.",""],["Jung","D. E.",""],["Kang","S. K.",""],["Kasugai","Y.",""],["Kawasaki","T.",""],["Kim","E. J.",""],["Kim","J. Y.",""],["Kim","S. B.",""],["Kim","W.",""],["Kinoshita","H.",""],["Konno","T.",""],["Lim","I. T.",""],["Little","C.",""],["Marzec","E.",""],["Maruyama","T.",""],["Masuda","S.",""],["Meigom","S.",""],["Monjushiro","S.",""],["Moon","D. H.",""],["Nakano","T.",""],["Niiyama","M.",""],["Nishikawa","K.",""],["Pac","M. Y.",""],["Park","H. W.",""],["Park","J. S.",""],["Park","R. G.",""],["Peeters","S. J. M.",""],["Rott","C.",""],["Sakai","K.",""],["Sakamoto","S.",""],["Shima","T.",""],["Shin","C. D.",""],["Spitz","J.",""],["Suekane","F.",""],["Sugaya","Y.",""],["Suzuya","K.",""],["Taira","M.",""],["Yamaguchi","Y.",""],["Yeh","M.",""],["Yeo","I. S.",""],["Yoo","C.",""],["Yu","I.",""]]}
{"id":"2308.02723","submitter":"Ke Chen","authors":"Keren Shao, Ke Chen, Taylor Berg-Kirkpatrick, Shlomo Dubnov","title":"Towards Improving Harmonic Sensitivity and Prediction Stability for\n  Singing Melody Extraction","comments":"7 pages, 4 figures, 2 tables, Proceedings of the 24th International\n  Society for Music Information Retrieval Conference, ISMIR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.LG cs.MM eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In deep learning research, many melody extraction models rely on redesigning\nneural network architectures to improve performance. In this paper, we propose\nan input feature modification and a training objective modification based on\ntwo assumptions. First, harmonics in the spectrograms of audio data decay\nrapidly along the frequency axis. To enhance the model's sensitivity on the\ntrailing harmonics, we modify the Combined Frequency and Periodicity (CFP)\nrepresentation using discrete z-transform. Second, the vocal and non-vocal\nsegments with extremely short duration are uncommon. To ensure a more stable\nmelody contour, we design a differentiable loss function that prevents the\nmodel from predicting such segments. We apply these modifications to several\nmodels, including MSNet, FTANet, and a newly introduced model, PianoNet,\nmodified from a piano transcription network. Our experimental results\ndemonstrate that the proposed modifications are empirically effective for\nsinging melody extraction.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:59:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shao","Keren",""],["Chen","Ke",""],["Berg-Kirkpatrick","Taylor",""],["Dubnov","Shlomo",""]]}
{"id":"2308.02724","submitter":"Alexis Leconte Mr","authors":"Alexis Leconte, Jonathan Por\\'ee, Brice Rauby, Alice Wu, Nin Ghigo,\n  Paul Xing, Chlo\\'e Bourquin, Gerardo Ramos-Palacios, Abbas F. Sadikot and\n  Jean Provost","title":"A Tracking prior to Localization workflow for Ultrasound Localization\n  Microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultrasound Localization Microscopy (ULM) has proven effective in resolving\nmicrovascular structures and local mean velocities at sub-diffraction-limited\nscales, offering high-resolution imaging capabilities. Dynamic ULM (DULM)\nenables the creation of angiography or velocity movies throughout cardiac\ncycles. Currently, these techniques rely on a Localization-and-Tracking (LAT)\nworkflow consisting in detecting microbubbles (MB) in the frames before pairing\nthem to generate tracks. While conventional LAT methods perform well at low\nconcentrations, they suffer from longer acquisition times and degraded\nlocalization and tracking accuracy at higher concentrations, leading to biased\nangiogram reconstruction and velocity estimation. In this study, we propose a\nnovel approach to address these challenges by reversing the current workflow.\nThe proposed method, Tracking-and-Localization (TAL), relies on first tracking\nthe MB and then performing localization. Through comprehensive benchmarking\nusing both in silico and in vivo experiments and employing various metrics to\nquantify ULM angiography and velocity maps, we demonstrate that the TAL method\nconsistently outperforms the reference LAT workflow. Moreover, when applied to\nDULM, TAL successfully extracts velocity variations along the cardiac cycle\nwith improved repeatability. The findings of this work highlight the\neffectiveness of the TAL approach in overcoming the limitations of conventional\nLAT methods, providing enhanced ULM angiography and velocity imaging.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:01:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Leconte","Alexis",""],["Por\u00e9e","Jonathan",""],["Rauby","Brice",""],["Wu","Alice",""],["Ghigo","Nin",""],["Xing","Paul",""],["Bourquin","Chlo\u00e9",""],["Ramos-Palacios","Gerardo",""],["Sadikot","Abbas F.",""],["Provost","Jean",""]]}
{"id":"2308.02725","submitter":"Zinab Jadidi","authors":"Zinab Jadidi, Tina Chen, Luis Barroso-Luque, Gerbrand Ceder","title":"Kinetics of Li transport in vanadium-based disordered rocksalt\n  structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Disordered rocksalt Li-excess (DRX) compounds have emerged as promising new\ncathode materials for lithium-ion batteries, as they can consist solely of\nresource-abundant metals and eliminate the need for cobalt or nickel. A deeper\nunderstanding of the lithium-ion transport kinetics in DRX compounds is\nessential for enhancing their rate performance. This study employs\nfirst-principles calculations, cluster expansion techniques, and kinetic Monte\nCarlo simulations to investigate the Li+ transport properties in DRX Li2-xVO3,\nwhere 0 <= x <= 1. Our findings underscore (i) the necessity of accounting for\nboth tetrahedral and octahedral Li occupancy when predicting the transport\nproperties in DRX materials, (ii) the factors influencing the variation in the\ndiffusion coefficients with Li content in Li2-xVO3, and (iii) the impact of Li+\ncorrelated motion on the kinetics of Li+ transport. We reveal that the relative\nstability of tetrahedral and octahedral Li determines the number of active\nsites within the percolation network, subsequently affecting the Li+ transport\nproperties. Furthermore, we demonstrate that the wide site-energy distribution\ncauses correlated motion in Li2-xVO3, which hinders Li+ transport. Although our\nstudy focuses on Li2-xVO3 as a model system, the insights gained apply to all\nDRX materials, given their inherently broader site-energy distributions.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:08:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jadidi","Zinab",""],["Chen","Tina",""],["Barroso-Luque","Luis",""],["Ceder","Gerbrand",""]]}
{"id":"2308.02726","submitter":"Kirill Boguslavski","authors":"Kirill Boguslavski","title":"Early time dynamics and constraints on medium evolution","comments":"10 pages, 4 figures, Proceedings of the Hard Probes 2023 conference,\n  26-31 March 2023, Aschaffenburg, Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In relativistic heavy-ion collisions, a quark-gluon plasma (QGP) is created\nwhose pre-equilibrium evolution includes a rich variety of exciting phenomena\nof Quantum Chromodynamics. In these Proceedings, we provide a short overview of\nour current understanding of the pre-equilibrium dynamics of the QGP from a\nweak-coupling perspective and highlight recent developments. Focusing on new\nstudies, we then discuss how initial stages of the QGP medium may impact hard\nprobes including direct photons, dileptons, jets, and heavy quarks. This\nintroduces promising opportunities to obtain experimental signatures of the\npre-equilibrium QGP.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:12:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Boguslavski","Kirill",""]]}
{"id":"2308.02727","submitter":"Matthew Iceland","authors":"Matthew Iceland","title":"How Good Are SOTA Fake News Detectors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic fake news detection with machine learning can prevent the\ndissemination of false statements before they gain many views. Several datasets\nlabeling statements as legitimate or false have been created since the 2016\nUnited States presidential election for the prospect of training machine\nlearning models. We evaluate the robustness of both traditional and deep\nstate-of-the-art models to gauge how well they may perform in the real world.\nWe find that traditional models tend to generalize better to data outside the\ndistribution it was trained on compared to more recently-developed large\nlanguage models, though the best model to use may depend on the specific task\nat hand.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:14:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Iceland","Matthew",""]]}
{"id":"2308.02728","submitter":"Adrian Culver","authors":"Xu Liu, Adrian B. Culver, Fenner Harper, Rahul Roy","title":"Classification of Unitary Operators by Local Generatability","comments":"14+7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.quant-gas cond-mat.str-el quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Periodically driven (Floquet) systems can exhibit new possibilities beyond\nwhat can be obtained in equilibrium. Both in Floquet systems and in the related\nproblems of discrete-time quantum walks and quantum cellular automata, a basic\ndistinction arises among unitary time evolution operators: while all physical\noperators are local, not all are locally generated (i.e., generated by some\nlocal Hamiltonian). In this paper, we define the notion of equivalence up to a\nlocally generated unitary in all Altland-Zirnbauer symmetry classes. We then\nclassify non-interacting unitaries in all dimensions on this basis by showing\nthat equivalence up to a locally generated unitary is identical to homotopy\nequivalence.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:16:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Xu",""],["Culver","Adrian B.",""],["Harper","Fenner",""],["Roy","Rahul",""]]}
{"id":"2308.02729","submitter":"Levi Lelis","authors":"Spyros Orfanos and Levi H. S. Lelis","title":"Synthesizing Programmatic Policies with Actor-Critic Algorithms and ReLU\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Programmatically Interpretable Reinforcement Learning (PIRL) encodes policies\nin human-readable computer programs. Novel algorithms were recently introduced\nwith the goal of handling the lack of gradient signal to guide the search in\nthe space of programmatic policies. Most of such PIRL algorithms first train a\nneural policy that is used as an oracle to guide the search in the programmatic\nspace. In this paper, we show that such PIRL-specific algorithms are not\nneeded, depending on the language used to encode the programmatic policies.\nThis is because one can use actor-critic algorithms to directly obtain a\nprogrammatic policy. We use a connection between ReLU neural networks and\noblique decision trees to translate the policy learned with actor-critic\nalgorithms into programmatic policies. This translation from ReLU networks\nallows us to synthesize policies encoded in programs with if-then-else\nstructures, linear transformations of the input values, and PID operations.\nEmpirical results on several control problems show that this translation\napproach is capable of learning short and effective policies. Moreover, the\ntranslated policies are at least competitive and often far superior to the\npolicies PIRL algorithms synthesize.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:17:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Orfanos","Spyros",""],["Lelis","Levi H. S.",""]]}
{"id":"2308.02730","submitter":"Mucahit Cevik","authors":"Mucahit Cevik, Can Kavaklioglu, Fahad Razak, Amol Verma, Ayse Basar","title":"Assessing the impact of emergency department short stay units using\n  length-of-stay prediction and discrete event simulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately predicting hospital length-of-stay at the time a patient is\nadmitted to hospital may help guide clinical decision making and resource\nallocation. In this study we aim to build a decision support system that\npredicts hospital length-of-stay for patients admitted to general internal\nmedicine from the emergency department. We conduct an exploratory data analysis\nand employ feature selection methods to identify the attributes that result in\nthe best predictive performance. We also develop a discrete-event simulation\nmodel to assess the performances of the prediction models in a practical\nsetting. Our results show that the recommendation performances of the proposed\napproaches are generally acceptable and do not benefit from the feature\nselection. Further, the results indicate that hospital length-of-stay could be\npredicted with reasonable accuracy (e.g., AUC value for classifying short and\nlong stay patients is 0.69) using patient admission demographics, laboratory\ntest results, diagnostic imaging, vital signs and clinical documentation.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:26:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cevik","Mucahit",""],["Kavaklioglu","Can",""],["Razak","Fahad",""],["Verma","Amol",""],["Basar","Ayse",""]]}
{"id":"2308.02731","submitter":"Tanvir Islam","authors":"Tanvir Islam, Peter Washington","title":"Personalization of Stress Mobile Sensing using Self-Supervised Learning","comments":null,"journal-ref":"BMC Medical Informatics and Decision Making. 2023","doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Stress is widely recognized as a major contributor to a variety of health\nissues. Stress prediction using biosignal data recorded by wearables is a key\narea of study in mobile sensing research because real-time stress prediction\ncan enable digital interventions to immediately react at the onset of stress,\nhelping to avoid many psychological and physiological symptoms such as heart\nrhythm irregularities. Electrodermal activity (EDA) is often used to measure\nstress. However, major challenges with the prediction of stress using machine\nlearning include the subjectivity and sparseness of the labels, a large feature\nspace, relatively few labels, and a complex nonlinear and subjective\nrelationship between the features and outcomes. To tackle these issues, we\nexamine the use of model personalization: training a separate stress prediction\nmodel for each user. To allow the neural network to learn the temporal dynamics\nof each individual's baseline biosignal patterns, thus enabling personalization\nwith very few labels, we pre-train a 1-dimensional convolutional neural network\n(CNN) using self-supervised learning (SSL). We evaluate our method using the\nWearable Stress and Affect prediction (WESAD) dataset. We fine-tune the\npre-trained networks to the stress prediction task and compare against\nequivalent models without any self-supervised pre-training. We discover that\nembeddings learned using our pre-training method outperform supervised\nbaselines with significantly fewer labeled data points: the models trained with\nSSL require less than 30% of the labels to reach equivalent performance without\npersonalized SSL. This personalized learning method can enable precision health\nsystems which are tailored to each subject and require few annotations by the\nend user, thus allowing for the mobile sensing of increasingly complex,\nheterogeneous, and subjective outcomes such as stress.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:26:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Islam","Tanvir",""],["Washington","Peter",""]]}
{"id":"2308.02732","submitter":"Ben McCarty","authors":"Scott Baldridge, Louis H. Kauffman, Ben McCarty","title":"A state sum for the total face color polynomial","comments":"19 pages, numerous figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The total face color polynomial is based upon the Poincar\\'{e} polynomials of\na family of filtered $n$-color homologies. It counts the number of $n$-face\ncolorings of ribbon graphs for each positive integer $n$. As such, it may be\nseen as a successor of the Penrose polynomial, which at $n=3$ counts $3$-edge\ncolorings (and consequently $4$-face colorings) of planar trivalent graphs. In\nthis paper we describe a state sum formula for the polynomial. This formula\nunites two different perspectives about graph coloring: one based upon\ntopological quantum field theory and the other on diagrammatic tensors.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:35:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Baldridge","Scott",""],["Kauffman","Louis H.",""],["McCarty","Ben",""]]}
{"id":"2308.02733","submitter":"Joshua Burby","authors":"J. W. Burby","title":"Variable-moment fluid closures with Hamiltonian structure","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Based on ideas due to Scovel-Weinstein, I present a general framework for\nconstructing fluid moment closures of the Vlasov-Poisson system that exactly\npreserve that system's Hamiltonian structure. Notably, the technique applies in\nany space dimension and produces closures involving arbitrarily-large finite\ncollections of moments. After selecting a desired collection of moments, the\nPoisson bracket for the closure is uniquely determined. Therefore data-driven\nfluid closures can be constructed by adjusting the closure Hamiltonian for\ncompatibility with kinetic simulations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:43:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Burby","J. W.",""]]}
{"id":"2308.02734","submitter":"Quang Minh Nguyen","authors":"Quang Minh Nguyen, Eytan Modiano","title":"Learning to Schedule in Non-Stationary Wireless Networks With Unknown\n  Statistics","comments":"Accepted to ACM MobiHoc '23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The emergence of large-scale wireless networks with partially-observable and\ntime-varying dynamics has imposed new challenges on the design of optimal\ncontrol policies. This paper studies efficient scheduling algorithms for\nwireless networks subject to generalized interference constraint, where mean\narrival and mean service rates are unknown and non-stationary. This model\nexemplifies realistic edge devices' characteristics of wireless communication\nin modern networks. We propose a novel algorithm termed MW-UCB for generalized\nwireless network scheduling, which is based on the Max-Weight policy and\nleverages the Sliding-Window Upper-Confidence Bound to learn the channels'\nstatistics under non-stationarity. MW-UCB is provably throughput-optimal under\nmild assumptions on the variability of mean service rates. Specifically, as\nlong as the total variation in mean service rates over any time period grows\nsub-linearly in time, we show that MW-UCB can achieve the stability region\narbitrarily close to the stability region of the class of policies with full\nknowledge of the channel statistics. Extensive simulations validate our\ntheoretical results and demonstrate the favorable performance of MW-UCB.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 22:51:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nguyen","Quang Minh",""],["Modiano","Eytan",""]]}
{"id":"2308.02735","submitter":"Jan Cameron","authors":"Jon Bannon, Jan Cameron, Ionut Chifan, Kunal Mukherjee, Roger Smith,\n  Alan Wiggins","title":"Quasinormalizers in crossed products of von Neumann algebras","comments":"56 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the relationship between the dynamics of the action $\\alpha$ of a\ndiscrete group $G$ on a von Neumann algebra $M$, and structural properties of\nthe associated crossed product inclusion $L(G) \\subseteq M \\rtimes_\\alpha G$,\nand its intermediate subalgebras. This continues a thread of research\noriginating in classical structural results for ergodic actions of discrete,\nabelian groups on probability spaces. A key tool in the setting of a\nnoncommutative dynamical system is the set of quasinormalizers for an inclusion\nof von Neumann algebras. We show that the von Neumann algebra generated by the\nquasinormalizers captures analytical properties of the inclusion $L(G)\n\\subseteq M \\rtimes_\\alpha G$ such as the Haagerup Approximation Property, and\nis essential to capturing ``almost periodic\" behavior in the underlying\ndynamical system. Our von Neumann algebraic point of view yields a new\ndescription of the Furstenberg-Zimmer distal tower for an ergodic action on a\nprobability space, and we establish new versions of the Furstenberg-Zimmer\nstructure theorems for general, tracial $W^*$-dynamical systems. We present a\nnumber of examples contrasting the noncommutative and classical settings which\nalso build on previous work concerning singular inclusions of finite von\nNeumann algebras.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:02:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bannon","Jon",""],["Cameron","Jan",""],["Chifan","Ionut",""],["Mukherjee","Kunal",""],["Smith","Roger",""],["Wiggins","Alan",""]]}
{"id":"2308.02736","submitter":"J. Wu","authors":"J. Wu, Y. Chang","title":"Characterization of boundedness of some commutators of fractional\n  maximal functions in terms of $p$-adic vector spaces","comments":"25 pages. arXiv admin note: substantial text overlap with\n  arXiv:2306.10470","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper gives some characterizations of the boundedness of the maximal or\nnonlinear commutator of the $p$-adic fractional maximal operator $\n\\mathcal{M}_{\\alpha}^{p}$ with the symbols belong to the $p$-adic BMO spaces on\n(variable) Lebesgue spaces and Morrey spaces over $p$-adic field, by which some\nnew characterizations of BMO functions are obtained in the $p$-adic field\ncontext. Meanwhile, Some equivalent relations between the $p$-adic BMO norm and\nthe $p$-adic (variable) Lebesgue or Morrey norm are given.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:05:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","J.",""],["Chang","Y.",""]]}
{"id":"2308.02737","submitter":"Sergio Bravo","authors":"Sergio Bravo, P.A. Orellana and L. Rosales","title":"The role of Coulomb interaction on the electronic properties of\n  monolayer NiX$_2$ (X = S, Se): A DFT+U+V study","comments":"9 pages, 4 figures + Supplementary Material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The electronic structure of Nickel dichalcogenides, NiS$_2$ and NiSe$_2$, in\nmonolayer form, is studied employing first-principles methods. We assess the\nimportance of band ordering, covalency and Coulomb interactions in the ground\nstate of these systems. Hybrid functional results are compared with standard\nfunctionals and also with Hubbard-corrected functionals to systematically\naddress the role of electronic interactions and localization. We found that\nmean-field correlation realized by intersite Hubbard interactions are directly\nlinked to the magnitude of the energy band gap, giving compelling evidence for\nthe presence of a charge transfer insulating phase in these materials.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:08:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bravo","Sergio",""],["Orellana","P. A.",""],["Rosales","L.",""]]}
{"id":"2308.02738","submitter":"Yehansen Chen","authors":"Yin Lin, Cong Liu, Yehansen Chen, Jinshui Hu, Bing Yin, Baocai Yin,\n  Zengfu Wang","title":"Exploring Part-Informed Visual-Language Learning for Person\n  Re-Identification","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, visual-language learning has shown great potential in enhancing\nvisual-based person re-identification (ReID). Existing visual-language\nlearning-based ReID methods often focus on whole-body scale image-text feature\nalignment, while neglecting supervisions on fine-grained part features. This\nchoice simplifies the learning process but cannot guarantee within-part feature\nsemantic consistency thus hindering the final performance. Therefore, we\npropose to enhance fine-grained visual features with part-informed language\nsupervision for ReID tasks. The proposed method, named Part-Informed\nVisual-language Learning ($\\pi$-VL), suggests that (i) a human parsing-guided\nprompt tuning strategy and (ii) a hierarchical fusion-based visual-language\nalignment paradigm play essential roles in ensuring within-part feature\nsemantic consistency. Specifically, we combine both identity labels and parsing\nmaps to constitute pixel-level text prompts and fuse multi-stage visual\nfeatures with a light-weight auxiliary head to perform fine-grained image-text\nalignment. As a plug-and-play and inference-free solution, our $\\pi$-VL\nachieves substantial improvements over previous state-of-the-arts on four\ncommon-used ReID benchmarks, especially reporting 90.3% Rank-1 and 76.5% mAP\nfor the most challenging MSMT17 database without bells and whistles.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:13:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lin","Yin",""],["Liu","Cong",""],["Chen","Yehansen",""],["Hu","Jinshui",""],["Yin","Bing",""],["Yin","Baocai",""],["Wang","Zengfu",""]]}
{"id":"2308.02739","submitter":"Akhil Rao","authors":"Raphaelle G. Coulombe, Akhil Rao","title":"Fires and Local Labor Markets","comments":"Paper and appendices. JEL codes: R11, Q54, E24, H84. Keywords: fires,\n  employment, economic activity, natural disasters","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We study the dynamic effects of fires on county labor markets in the US using\na novel geophysical measure of fire exposure based on satellite imagery. We\nfind increased fire exposure causes lower employment growth in the short and\nmedium run, with medium-run effects being linked to migration. We also document\nheterogeneous effects across counties by education and industrial concentration\nlevels, states of the business cycle, and fire size. By overcoming challenges\nin measuring fire impacts, we identify vulnerable places and economic states,\noffering guidance on tailoring relief efforts and contributing to a broader\nunderstanding of natural disasters' economic impacts.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:19:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Coulombe","Raphaelle G.",""],["Rao","Akhil",""]]}
{"id":"2308.02740","submitter":"Lili Wen","authors":"Lili Wen and Engui Fan","title":"The Painlev\\'{e}-type asymptotics of defocusing complex mKdV equation\n  with finite density initial data","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":"  The aim of this present work is to obtain a Painlev\\'e-type aymptotics to the\nCauchy problem for the defocusing complex mKdV equation with a finite density\ninitial data. In the transition region $ -C< (\\xi+\\frac{3}{2}) t^{2/3}<0$, we\nrecover the long-time asymptotics of the solution which is associated to the\nPainlev\\'{e}-II transcendents via the $\\bar\\partial$-generation of the\nnonlinear steepest descent approach.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:28:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wen","Lili",""],["Fan","Engui",""]]}
{"id":"2308.02741","submitter":"Yashwanth Kumar Nakka","authors":"Xichen Shi and Yashwanth Kumar Nakka","title":"Nonlinear Controller Design for a Quadrotor with Inverted Pendulum","comments":"This work was done as part of a course project for CDS 233 at Caltech","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.SY eess.SY math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The quadrotor is a $6$ degrees-of-freedom (DoF) system with underactuation.\nAdding a spherical pendulum on top of a quadrotor further complicates the task\nof achieving any output tracking while stabilizing the rest. In this report, we\npresent different types of controllers for the nonlinear dynamical system of\nquadrotor and pendulum combination, utilizing feedback-linearization and\ncontrol Lyapunov function with quadratic programming (CLF-QP) approaches. We\ndemonstrated trajectory tracking for quadrotor-only case as well as\nquadrotor-pendulum-combined case.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:33:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shi","Xichen",""],["Nakka","Yashwanth Kumar",""]]}
{"id":"2308.02742","submitter":"Jose I. Liberati","authors":"Jose I. Liberati","title":"Pell equation: A generalization of chakravala algorithm using the\n  LLL-algorithm","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a generalization of chakravala and continued fraction algorithms\nto solve the Pell equation, using the LLL-algorithm for rank 2 lattices.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:35:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liberati","Jose I.",""]]}
{"id":"2308.02743","submitter":"David Van Wijk","authors":"David van Wijk, Kyle Dunlap, Manoranjan Majji, Kerianne L. Hobbs","title":"Deep Reinforcement Learning for Autonomous Spacecraft Inspection using\n  Illumination","comments":"17 pages, 10 figures, to appear at 2023 AAS/AIAA Astrodynamics\n  Specialist 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":"  This paper investigates the problem of on-orbit spacecraft inspection using a\nsingle free-flying deputy spacecraft, equipped with an optical sensor, whose\ncontroller is a neural network control system trained with Reinforcement\nLearning (RL). This work considers the illumination of the inspected spacecraft\n(chief) by the Sun in order to incentivize acquisition of well-illuminated\noptical data. The agent's performance is evaluated through statistically\nefficient metrics. Results demonstrate that the RL agent is able to inspect all\npoints on the chief successfully, while maximizing illumination on inspected\npoints in a simulated environment, using only low-level actions. Due to the\nstochastic nature of RL, 10 policies were trained using 10 random seeds to\nobtain a more holistic measure of agent performance. Over these 10 seeds, the\ninterquartile mean (IQM) percentage of inspected points for the finalized model\nwas 98.82%.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:43:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["van Wijk","David",""],["Dunlap","Kyle",""],["Majji","Manoranjan",""],["Hobbs","Kerianne L.",""]]}
{"id":"2308.02744","submitter":"Rosario Paredes","authors":"M.I. Morales-Amador, V. Romero-Rochin and R. Paredes","title":"Critical exponents and fluctuations at BEC in a 2D harmonically trapped\n  ideal gas","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The critical properties displayed by an ideal 2D Bose gas trapped in a\nharmonic potential are determined and characterized in an exact numerical\nfashion. Beyond thermodynamics, addressed in terms of the global pressure and\nvolume which are the appropriate variables of a fluid confined in a non-uniform\nharmonic potential, the density-density correlation function is also calculated\nand the corresponding correlation length is found. Evaluation of all these\nquantities as Bose-Einstein condensation (BEC) is approached manifest its\ncritical continuous phase transition character. The divergence of the\ncorrelation length as the critical temperature is reached, unveils the expected\nspatial scale invariance proper of a critical transition. The logarithmic\nsingularities of this transition are traced back to the non-analytic behavior\nof the thermodynamic variables at vanishing chemical potential, which is the\nonset of BEC. The critical exponents associated with the ideal BEC transition\nin the 2D inhomogeneous fluid reveals its own universality class.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:47:30 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 16:24:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Morales-Amador","M. I.",""],["Romero-Rochin","V.",""],["Paredes","R.",""]]}
{"id":"2308.02745","submitter":"Francesca Sammarruca","authors":"Francesca Sammarruca","title":"Neutron matter: The unitary limit and its far-reaching impact","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore low-density neutron matter and its behavior in proximity to the\nunitary limit. To that end, we construct unitary nucleon-nucleon potentials\nwith infinite 1S0 neutron-neutron scattering lengths. We discuss the Berstch\nparameter in relation to results from ultra-cold atomic gases. Unitarity as a\nconstraint for neutron matter and the symmetry energy has been discussed in the\nliterature. We revisit some of those arguments and emphasize the relevance of\nkeeping a firm link with low-energy nuclear physics for robust predictions of\nneutron-rich systems. Our predictions are obtained from realistic few-nucleon\nforces based on chiral effective field theory at N3LO.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:47:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sammarruca","Francesca",""]]}
{"id":"2308.02746","submitter":"Menglong Lu","authors":"Menglong Lu, Zhen Huang, Zhiliang Tian, Yunxiang Zhao, Xuanyu Fei and\n  Dongsheng Li","title":"Meta-Tsallis-Entropy Minimization: A New Self-Training Approach for\n  Domain Adaptation on Text Classification","comments":"This paper was accepted by IJCAI 2023, and the uploaded file includes\n  9 pages of main contents(including two pages of reference) plus 10 pages of\n  appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Text classification is a fundamental task for natural language processing,\nand adapting text classification models across domains has broad applications.\nSelf-training generates pseudo-examples from the model's predictions and\niteratively trains on the pseudo-examples, i.e., minimizes the loss on the\nsource domain and the Gibbs entropy on the target domain. However, Gibbs\nentropy is sensitive to prediction errors, and thus, self-training tends to\nfail when the domain shift is large. In this paper, we propose Meta-Tsallis\nEntropy minimization (MTEM), which applies a meta-learning algorithm to\noptimize the instance adaptive Tsallis entropy on the target domain. To reduce\nthe computation cost of MTEM, we propose an approximation technique to\napproximate the Second-order derivation involved in the meta-learning. To\nefficiently generate pseudo labels, we propose an annealing sampling mechanism\nfor exploring the model's prediction probability. Theoretically, we prove the\nconvergence of the meta-learning algorithm in MTEM and analyze the\neffectiveness of MTEM in achieving domain adaptation. Experimentally, MTEM\nimproves the adaptation performance of BERT with an average of 4 percent on the\nbenchmark dataset.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:50:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lu","Menglong",""],["Huang","Zhen",""],["Tian","Zhiliang",""],["Zhao","Yunxiang",""],["Fei","Xuanyu",""],["Li","Dongsheng",""]]}
{"id":"2308.02747","submitter":"Nasimeh Heydaribeni","authors":"Nasimeh Heydaribeni, Ruisi Zhang, Tara Javidi, Cristina Nita-Rotaru,\n  Farinaz Koushanfar","title":"SABRE: Robust Bayesian Peer-to-Peer Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce SABRE, a novel framework for robust variational Bayesian\npeer-to-peer federated learning. We analyze the robustness of the known\nvariational Bayesian peer-to-peer federated learning framework (BayP2PFL)\nagainst poisoning attacks and subsequently show that BayP2PFL is not robust\nagainst those attacks. The new SABRE aggregation methodology is then devised to\novercome the limitations of the existing frameworks. SABRE works well in\nnon-IID settings, does not require the majority of the benign nodes over the\ncompromised ones, and even outperforms the baseline algorithm in benign\nsettings. We theoretically prove the robustness of our algorithm against data /\nmodel poisoning attacks in a decentralized linear regression setting.\nProof-of-Concept evaluations on benchmark data from image classification\ndemonstrate the superiority of SABRE over the existing frameworks under various\npoisoning attacks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:51:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Heydaribeni","Nasimeh",""],["Zhang","Ruisi",""],["Javidi","Tara",""],["Nita-Rotaru","Cristina",""],["Koushanfar","Farinaz",""]]}
{"id":"2308.02748","submitter":"Syed Hasib Akhter Faruqui","authors":"Stanford Martinez, Carolina Ramirez-Tamayo, Syed Hasib Akhter Faruqui,\n  Kal L. Clark, Adel Alaeddini, Nicholas Czarnek, Aarushi Aggarwal, Sahra\n  Emamzadeh, Jeffrey R. Mock, Edward J. Golob","title":"Discrimination of Radiologists Utilizing Eye-Tracking Technology and\n  Machine Learning: A Case Study","comments":"Submitting for Review in \"IEEE Journal of Biomedical and Health\n  Informatics\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Perception-related errors comprise most diagnostic mistakes in radiology. To\nmitigate this problem, radiologists employ personalized and high-dimensional\nvisual search strategies, otherwise known as search patterns. Qualitative\ndescriptions of these search patterns, which involve the physician verbalizing\nor annotating the order he/she analyzes the image, can be unreliable due to\ndiscrepancies in what is reported versus the actual visual patterns. This\ndiscrepancy can interfere with quality improvement interventions and negatively\nimpact patient care. This study presents a novel discretized feature encoding\nbased on spatiotemporal binning of fixation data for efficient geometric\nalignment and temporal ordering of eye movement when reading chest X-rays. The\nencoded features of the eye-fixation data are employed by machine learning\nclassifiers to discriminate between faculty and trainee radiologists. We\ninclude a clinical trial case study utilizing the Area Under the Curve (AUC),\nAccuracy, F1, Sensitivity, and Specificity metrics for class separability to\nevaluate the discriminability between the two subjects in regard to their level\nof experience. We then compare the classification performance to\nstate-of-the-art methodologies. A repeatability experiment using a separate\ndataset, experimental protocol, and eye tracker was also performed using eight\nsubjects to evaluate the robustness of the proposed approach. The numerical\nresults from both experiments demonstrate that classifiers employing the\nproposed feature encoding methods outperform the current state-of-the-art in\ndifferentiating between radiologists in terms of experience level. This\nsignifies the potential impact of the proposed method for identifying\nradiologists' level of expertise and those who would benefit from additional\ntraining.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:51:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Martinez","Stanford",""],["Ramirez-Tamayo","Carolina",""],["Faruqui","Syed Hasib Akhter",""],["Clark","Kal L.",""],["Alaeddini","Adel",""],["Czarnek","Nicholas",""],["Aggarwal","Aarushi",""],["Emamzadeh","Sahra",""],["Mock","Jeffrey R.",""],["Golob","Edward J.",""]]}
{"id":"2308.02749","submitter":"Sasindu Wijeratne","authors":"Paul Chen, Pavan Manjunath, Sasindu Wijeratne, Bingyi Zhang, Viktor\n  Prasanna","title":"Exploiting On-chip Heterogeneity of Versal Architecture for GNN\n  Inference Acceleration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.DC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph Neural Networks (GNNs) have revolutionized many Machine Learning (ML)\napplications, such as social network analysis, bioinformatics, etc. GNN\ninference can be accelerated by exploiting data sparsity in the input graph,\nvertex features, and intermediate data in GNN computations. For dynamic\nsparsity exploitation, we leverage the heterogeneous computing capabilities of\nAMD Versal ACAP architecture to accelerate GNN inference. We develop a custom\nhardware module that executes the sparse primitives of the computation kernel\non the Programmable Logic (PL) and efficiently computes the dense primitives\nusing the AI Engine (AIE). To exploit data sparsity during inference, we devise\na runtime kernel mapping strategy that dynamically assigns computation tasks to\nthe PL and AIE based on data sparsity. Our implementation on the VCK5000 ACAP\nplatform leads to superior performance compared with the state-of-the-art\nimplementations on CPU, GPU, ACAP, and other custom GNN accelerators. Compared\nwith these implementations, we achieve significant average runtime speedup\nacross various models and datasets of 162.42x, 17.01x, 9.90x, and 27.23x,\nrespectively. Furthermore, for Graph Convolutional Network (GCN) inference, our\napproach leads to a speedup of 3.9-96.7x compared to designs using PL only on\nthe same ACAP device.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:57:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Paul",""],["Manjunath","Pavan",""],["Wijeratne","Sasindu",""],["Zhang","Bingyi",""],["Prasanna","Viktor",""]]}
{"id":"2308.02750","submitter":"Andy Goulding","authors":"Andy D. Goulding, Jenny E. Greene, David J. Setton, Ivo Labbe, Rachel\n  Bezanson, Tim B. Miller, Hakim Atek, Akos Bogdan, Gabriel Brammer, Iryna\n  Chemerynska, Sam E. Cutler, Pratika Dayal, Yoshinobu Fudamoto, Seiji\n  Fujimoto, Lukas J. Furtak, Vasily Kokorev, Gourav Khullar, Joel Leja, Danilo\n  Marchesini, Priyamvada Natarajan, Erica Nelson, Pascal A. Oesch, Richard Pan,\n  Casey Papovich, Sedona H. Price, Pieter van Dokkum, Bingjie Wang, John R.\n  Weaver, Katherine E. Whitaker and Adi Zitrin","title":"UNCOVER: The growth of the first massive black holes from JWST/NIRSpec\n  -- spectroscopic confirmation of an X-ray luminous AGN at z=10.1","comments":"9 pages, 4 figures, submitted to ApJL. Minor text corrections","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":"  The James Webb Space Telescope is now detecting early black holes (BHs) as\nthey transition from \"seeds\" to supermassive BHs. Recently Bogdan et al. (2023)\nreported the detection of an X-ray luminous supermassive BH, UHZ-1, with a\nphotometric redshift at $z > 10$. Such an extreme source at this very high\nredshift provides new insights on seeding and growth models for BHs given the\nshort time available for formation and growth. Harnessing the exquisite\nsensitivity of JWST/NIRSpec, here we report the spectroscopic confirmation of\nUHZ-1 at $z = 10.073 \\pm 0.002$. We find that the NIRSpec/Prism spectrum is\ntypical of recently discovered z~10 galaxies, characterized primarily by\nstar-formation features. We see no clear evidence of the powerful X-ray source\nin the rest-frame UV/optical spectrum, which may suggest heavy obscuration of\nthe central BH, in line with the Compton-thick column density measured in the\nX-rays. We perform a stellar population fit simultaneously to the new NIRSpec\nspectroscopy and previously available photometry. The fit yields a stellar mass\nestimate for the host galaxy that is significantly better constrained than\nprior photometric estimates ($M_*\\sim 1.4^{+0.3}_{-0.4} \\times 10^8 M_\\odot$).\nGiven the predicted BH mass ($M_{\\rm BH}\\sim10^7-10^8 M_\\odot$), the resulting\nratio of $M_{\\rm BH}/M_*$ remains two to three orders of magnitude higher than\nlocal values, thus lending support to the heavy seeding channel for the\nformation of supermassive BHs within the first billion years of cosmic\nevolution.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:05:44 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 15:44:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Goulding","Andy D.",""],["Greene","Jenny E.",""],["Setton","David J.",""],["Labbe","Ivo",""],["Bezanson","Rachel",""],["Miller","Tim B.",""],["Atek","Hakim",""],["Bogdan","Akos",""],["Brammer","Gabriel",""],["Chemerynska","Iryna",""],["Cutler","Sam E.",""],["Dayal","Pratika",""],["Fudamoto","Yoshinobu",""],["Fujimoto","Seiji",""],["Furtak","Lukas J.",""],["Kokorev","Vasily",""],["Khullar","Gourav",""],["Leja","Joel",""],["Marchesini","Danilo",""],["Natarajan","Priyamvada",""],["Nelson","Erica",""],["Oesch","Pascal A.",""],["Pan","Richard",""],["Papovich","Casey",""],["Price","Sedona H.",""],["van Dokkum","Pieter",""],["Wang","Bingjie",""],["Weaver","John R.",""],["Whitaker","Katherine E.",""],["Zitrin","Adi",""]]}
{"id":"2308.02751","submitter":"Ravi Ramamoorthi","authors":"Ravi Ramamoorthi","title":"NeRFs: The Search for the Best 3D Representation","comments":"Updated based on feedback in-person and via e-mail at SIGGRAPH 2023.\n  In particular, I have added references and discussion of seminal SIGGRAPH\n  image-based rendering papers, and better put the recent Kerbl et al. work in\n  context, with more references","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR cs.LG cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Neural Radiance Fields or NeRFs have become the representation of choice for\nproblems in view synthesis or image-based rendering, as well as in many other\napplications across computer graphics and vision, and beyond. At their core,\nNeRFs describe a new representation of 3D scenes or 3D geometry. Instead of\nmeshes, disparity maps, multiplane images or even voxel grids, they represent\nthe scene as a continuous volume, with volumetric parameters like\nview-dependent radiance and volume density obtained by querying a neural\nnetwork. The NeRF representation has now been widely used, with thousands of\npapers extending or building on it every year, multiple authors and websites\nproviding overviews and surveys, and numerous industrial applications and\nstartup companies. In this article, we briefly review the NeRF representation,\nand describe the three decades-long quest to find the best 3D representation\nfor view synthesis and related problems, culminating in the NeRF papers. We\nthen describe new developments in terms of NeRF representations and make some\nobservations and insights regarding the future of 3D representations.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:10:32 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 18:57:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ramamoorthi","Ravi",""]]}
{"id":"2308.02752","submitter":"Dmitry Baranchuk","authors":"Dmitry Baranchuk, Matthijs Douze, Yash Upadhyay, I. Zeki Yalniz","title":"DeDrift: Robust Similarity Search under Content Drift","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The statistical distribution of content uploaded and searched on media\nsharing sites changes over time due to seasonal, sociological and technical\nfactors. We investigate the impact of this \"content drift\" for large-scale\nsimilarity search tools, based on nearest neighbor search in embedding space.\nUnless a costly index reconstruction is performed frequently, content drift\ndegrades the search accuracy and efficiency. The degradation is especially\nsevere since, in general, both the query and database distributions change.\n  We introduce and analyze real-world image and video datasets for which\ntemporal information is available over a long time period. Based on the\nlearnings, we devise DeDrift, a method that updates embedding quantizers to\ncontinuously adapt large-scale indexing structures on-the-fly. DeDrift almost\neliminates the accuracy degradation due to the query and database content drift\nwhile being up to 100x faster than a full index reconstruction.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:12:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Baranchuk","Dmitry",""],["Douze","Matthijs",""],["Upadhyay","Yash",""],["Yalniz","I. Zeki",""]]}
{"id":"2308.02753","submitter":"Menglong Lu","authors":"Menglong Lu, Zhen Huang, Yunxiang Zhao, Zhiliang Tian, Yang Liu and\n  Dongsheng Li","title":"DaMSTF: Domain Adversarial Learning Enhanced Meta Self-Training for\n  Domain Adaptation","comments":"This paper was accepted by ACL 2023. The uploaded file includes 17\n  pages, composed by 11 pages of main contents(2 pages of references) and 6\n  pages of appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Self-training emerges as an important research line on domain adaptation. By\ntaking the model's prediction as the pseudo labels of the unlabeled data,\nself-training bootstraps the model with pseudo instances in the target domain.\nHowever, the prediction errors of pseudo labels (label noise) challenge the\nperformance of self-training. To address this problem, previous approaches only\nuse reliable pseudo instances, i.e., pseudo instances with high prediction\nconfidence, to retrain the model. Although these strategies effectively reduce\nthe label noise, they are prone to miss the hard examples. In this paper, we\npropose a new self-training framework for domain adaptation, namely Domain\nadversarial learning enhanced Self-Training Framework (DaMSTF). Firstly, DaMSTF\ninvolves meta-learning to estimate the importance of each pseudo instance, so\nas to simultaneously reduce the label noise and preserve hard examples.\nSecondly, we design a meta constructor for constructing the meta-validation\nset, which guarantees the effectiveness of the meta-learning module by\nimproving the quality of the meta-validation set. Thirdly, we find that the\nmeta-learning module suffers from the training guidance vanishment and tends to\nconverge to an inferior optimal. To this end, we employ domain adversarial\nlearning as a heuristic neural network initialization method, which can help\nthe meta-learning module converge to a better optimal. Theoretically and\nexperimentally, we demonstrate the effectiveness of the proposed DaMSTF. On the\ncross-domain sentiment classification task, DaMSTF improves the performance of\nBERT with an average of nearly 4%.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:14:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lu","Menglong",""],["Huang","Zhen",""],["Zhao","Yunxiang",""],["Tian","Zhiliang",""],["Liu","Yang",""],["Li","Dongsheng",""]]}
{"id":"2308.02754","submitter":"Juan Guti\\'errez Alva","authors":"F\\'abio Botler, Cristina G. Fernandes, Juan Guti\\'errez","title":"Independent dominating sets in planar triangulations","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 1996, Matheson and Tarjan proved that every near planar triangulation on\n$n$ vertices contains a dominating set of size at most $n/3$, and conjectured\nthat this upper bound can be reduced to $n/4$ for planar triangulations when\n$n$ is sufficiently large. In this paper, we consider the analogous problem for\nindependent dominating sets: What is the minimum $\\epsilon$ for which every\nnear planar triangulation on $n$ vertices contains an independent dominating\nset of size at most $\\epsilon n$? We prove that $2/7 \\leq \\epsilon \\leq 5/12$.\nMoreover, this upper bound can be improved to $3/8$ for planar triangulations,\nand to $1/3$ for planar triangulations with minimum degree 5.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:39:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Botler","F\u00e1bio",""],["Fernandes","Cristina G.",""],["Guti\u00e9rrez","Juan",""]]}
{"id":"2308.02755","submitter":"Anastasia Bizyaeva","authors":"Anastasia Bizyaeva, Alessio Franci, Naomi Ehrich Leonard","title":"Multi-topic belief formation through bifurcations over signed social\n  networks","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.MA cs.SI math.DS math.OC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We propose and analyze a nonlinear dynamic model of continuous-time\nmulti-dimensional belief formation over signed social networks. Our model\naccounts for the effects of a structured belief system, self-appraisal,\ninternal biases, and various sources of cognitive dissonance posited by recent\ntheories in social psychology. We prove that strong beliefs emerge on the\nnetwork as a consequence of a bifurcation. We analyze how the balance of social\nnetwork effects in the model controls the nature of the bifurcation and,\ntherefore, the belief-forming limit-set solutions. Our analysis provides\nconstructive conditions on how multi-stable network belief equilibria and\nbelief oscillations emerging at a belief-forming bifurcation depend on the\ncommunication network graph and belief system network graph. Our model and\nanalysis provide new theoretical insights on the dynamics of social systems and\na new principled framework for designing decentralized decision-making on\nengineered networks in the presence of structured relationships among\nalternatives.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:42:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bizyaeva","Anastasia",""],["Franci","Alessio",""],["Leonard","Naomi Ehrich",""]]}
{"id":"2308.02756","submitter":"Jitesh Joshi","authors":"Jitesh Joshi, Katherine Wang, Youngjun Cho","title":"PhysioKit: Open-source, Low-cost Physiological Computing Toolkit for\n  Single and Multi-user Studies","comments":"22 pages, 8 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The proliferation of physiological sensors opens new opportunities to explore\ninteractions, conduct experiments and evaluate the user experience with\ncontinuous monitoring of bodily functions. Commercial devices, however, can be\ncostly or limit access to raw waveform data, while low-cost sensors are\nefforts-intensive to setup. To address these challenges, we introduce\nPhysioKit, an open-source, low-cost physiological computing toolkit. PhysioKit\nconsists of (i) a sensor and hardware layer that can be configured in a modular\nmanner per research needs, (ii) a software application layer that enables data\nacquisition, real-time visualization and machine learning (ML)-enabled signal\nquality assessment. This also supports basic visual biofeedback configurations\nand synchronized acquisition for co-located or remote multi-user settings. In a\nvalidation study for photo-plethysmography (PPG) sensor with 15 participants,\nPhysioKit shows strong agreement with research-grade PPG sensors. Furthermore,\nwe report usability survey results from 10 micro-project teams (44 individual\nmembers in total) who use PhysioKit for 4-6 weeks, providing insights into its\nuse cases and research benefits. We conclude by discussing extensibility and\npotential impact of the toolkit on the research community.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:54:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Joshi","Jitesh",""],["Wang","Katherine",""],["Cho","Youngjun",""]]}
{"id":"2308.02757","submitter":"Erin Connelly","authors":"Erin Connelly, Rekha R. Thomas, Cynthia Vinzant","title":"Lines, Quadrics, and Cremona Transformations in Two-View Geometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given $7 \\leq k \\leq 9$ points $(x_i,y_i) \\in \\mathbb{P}^2 \\times\n\\mathbb{P}^2$, we characterize rank deficiency of the $k \\times 9$ matrix $Z_k$\nwith rows $x_i^\\top \\otimes y_i^\\top$, in terms of the geometry of the point\nsets $\\{x_i\\}$ and $\\{y_i\\}$. This problem arises in the conditioning of\ncertain well-known reconstruction algorithms in computer vision, but has\nsurprising connections to classical algebraic geometry via the interplay of\nquadric surfaces, cubic curves and Cremona transformations. The\ncharacterization of rank deficiency of $Z_k$, when $k \\leq 6$, was completed in\narXiv:2301.09826.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:06:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Connelly","Erin",""],["Thomas","Rekha R.",""],["Vinzant","Cynthia",""]]}
{"id":"2308.02758","submitter":"Zihao Zhang","authors":"Shangkun Weng, Zihao Zhang","title":"Subsonic flows with a contact discontinuity in a finitely long\n  axisymmetric cylinder","comments":"arXiv admin note: text overlap with arXiv:2303.15096","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 structural stability of subsonic flows with a contact\ndiscontinuity in a finitely long axisymmetric cylinder. We establish the\nexistence and uniqueness of axisymmetric subsonic flows with a contact\ndiscontinuity by prescribing the horizontal mass flux distribution, the swirl\nvelocity, the entropy and the Bernoulli's quantity at the entrance and the\nradial velocity at the exit. It can be formulated as a free boundary problem\nwith the contact discontinuity to be determined simultaneously with the flows.\nCompared with the two-dimensional case, a new difficulty arises due to the\nsingularity near the axis. One of the key points in the analysis is the\nintroduction of an invertible modified Lagrangian transformation which can\novercome this difficulty and straighten the contact discontinuity. Another one\nis to utilize the deformation-curl decomposition for the steady Euler system\nintroduced in \\cite{WX19} to effectively decouple the hyperbolic and elliptic\nmodes. Finally, the contact discontinuity will be located by using the implicit\nfunction theorem.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:09:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Weng","Shangkun",""],["Zhang","Zihao",""]]}
{"id":"2308.02759","submitter":"Mohammad Jobayer Hossain","authors":"Mohammad Jobayer Hossain, Mengdi Sun, Kristopher O. Davis","title":"Photon Management in Silicon Photovoltaic Cells: A Critical Review","comments":"4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the practical efficiency of the silicon photovoltaic (PV) cell\napproaching its theoretical limit, pushing conversion efficiencies even higher\nnow relies on reducing every type of power loss that can occur within the\ndevice. Limiting optical losses is therefore critical and requires effective\nmanagement of incident photons in terms of how they interact with the device.\nUltimately, photon management within a PV cell means engineering the device and\nconstituent materials to maximize photon absorption within the active\nsemiconductor and therefore reduce the number of photons lost through other\nmeans, most notably reflection and parasitic absorption. There have been great\nadvancements in the front and the rear side photon management techniques in\nrecent years. This review aims to discuss these advancements and compare the\nvarious approaches, not only in terms of increases in photogenerated current,\nbut also their compatibility with different PV cell architectures and potential\ntrade-offs, like increased surface recombination or scalability for high-volume\nmanufacturing. In this review, a comprehensive discussion of a wide variety of\nthe front and the rear side photon management structures are presented with\nsuggestions to improve the already achieved performance further. This review is\nunique because it not only presents the recent development in photon management\ntechniques, but also offer through analysis of these techniques and pathways to\nimprove further.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:16:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hossain","Mohammad Jobayer",""],["Sun","Mengdi",""],["Davis","Kristopher O.",""]]}
{"id":"2308.02760","submitter":"Liam Parker","authors":"Liam Parker, Emre Onal, Anton Stengel, Jake Intrater","title":"Neural Collapse in the Intermediate Hidden Layers of Classification\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural Collapse (NC) gives a precise description of the representations of\nclasses in the final hidden layer of classification neural networks. This\ndescription provides insights into how these networks learn features and\ngeneralize well when trained past zero training error. However, to date, (NC)\nhas only been studied in the final layer of these networks. In the present\npaper, we provide the first comprehensive empirical analysis of the emergence\nof (NC) in the intermediate hidden layers of these classifiers. We examine a\nvariety of network architectures, activations, and datasets, and demonstrate\nthat some degree of (NC) emerges in most of the intermediate hidden layers of\nthe network, where the degree of collapse in any given layer is typically\npositively correlated with the depth of that layer in the neural network.\nMoreover, we remark that: (1) almost all of the reduction in intra-class\nvariance in the samples occurs in the shallower layers of the networks, (2) the\nangular separation between class means increases consistently with hidden layer\ndepth, and (3) simple datasets require only the shallower layers of the\nnetworks to fully learn them, whereas more difficult ones require the entire\nnetwork. Ultimately, these results provide granular insights into the\nstructural propagation of features through classification neural networks.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:19:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Parker","Liam",""],["Onal","Emre",""],["Stengel","Anton",""],["Intrater","Jake",""]]}
{"id":"2308.02761","submitter":"Mark McClure","authors":"Mark McClure","title":"Thermoelastic fracturing and buoyancy-driven convection: Surprising\n  sources of longevity for EGS circulation","comments":"Originally posted as a ResFrac Blog post on July 24 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To maximize value from an EGS system, engineers need to optimize flow rate,\nwell spacing, and well configuration. Numerical simulations yield interesting\nand surprising results regarding the effect of coupled processes on long term\nthermal performance. Thermoelastic fracture opening and propagation can have a\nsignificant negative effect on the uniformity of flow. On the other hand,\ninteractions between fracture opening and buoyancy driven fluid circulation\ncause downward fracture propagation during long-term circulation that greatly\nimproves the thermal longevity of the system. Passive inflow control design can\nsignificantly mitigate the negative effect of thermoelastic fracture opening on\nflow uniformity, while maintaining the positive effects of thermoelastic\nfracture opening and propagation on flow rate and thermal longevity. Overall,\nsimulations suggest that an EGS doublet with 8000 ft laterals at 475' F, using\ninflow control at the production well, could sustain electricity generation\nrates of 8 to 10 MWe for more than 30 years. Without inflow control, 6 to 8 MWe\nover 30 years is possible; however, there is greater risk of uncontrolled\nthermal breakthrough.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:41:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["McClure","Mark",""]]}
{"id":"2308.02762","submitter":"David Brewster","authors":"David A. Brewster, Martin A. Nowak, Josef Tkadlec","title":"Fixation times on directed graphs","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computing the rate of evolution in spatially structured populations can be\ndifficult. A key quantity that describes evolutionary dynamics is the fixation\ntime of a single mutant with relative reproduction rate $r\\ge 1$ who invades a\npopulation of residents. We say that the fixation time is \"fast\" if it is at\nmost polynomial in terms of the population size $N$. In this work, we study\nfixation times of advantageous mutants ($r>1$) and neutral mutants ($r=1$) on\ndirected graphs, which are defined as those graphs that have at least some\none-way connections. We obtain three main results. First, we prove that for any\ndirected graph the fixation time is fast, provided that $r$ is sufficiently\nlarge. Second, we devise an efficient algorithm that gives an upper bound for\nthe fixation time for any graph and any $r\\ge 1$. Third, we identify a broad\nclass of directed graphs with fast fixation times for any $r\\ge 1$. This class\nincludes previously studied amplifiers of selection, such as Superstars and\nMetafunnels. We also show that on some graphs fixation time is not a\nmonotonically declining function of $r$; in particular, neutral fixation can\noccur faster than fixation for small selective advantages. Our results have\nimportant algorithmic consequences and enable efficient computational\nexploration of various properties of directed graphs.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:44:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Brewster","David A.",""],["Nowak","Martin A.",""],["Tkadlec","Josef",""]]}
{"id":"2308.02763","submitter":"Charles Koll","authors":"Charles Koll, Anik Momtaz, Borzoo Bonakdarpour, Houssam Abbas","title":"Decentralized Predicate Detection over Partially Synchronous\n  Continuous-Time Signals","comments":"23 pages, 6 figures, accepted to conference Runtime Verification 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the first decentralized algorithm for detecting predicates over\ncontinuous-time signals under partial synchrony. A distributed cyber-physical\nsystem (CPS) consists of a network of agents, each of which measures (or\ncomputes) a continuous-time signal. Examples include distributed industrial\ncontrollers connected over wireless networks and connected vehicles in traffic.\nThe safety requirements of such CPS, expressed as logical predicates, must be\nmonitored at runtime. This monitoring faces three challenges: first, every\nagent only knows its own signal, whereas the safety requirement is global and\ncarries over multiple signals. Second, the agents' local clocks drift from each\nother, so they do not even agree on the time. Thus, it is not clear which\nsignal values are actually synchronous to evaluate the safety predicate. Third,\nCPS signals are continuous-time so there are potentially uncountably many\nsafety violations to be reported. In this paper, we present the first\ndecentralized algorithm for detecting conjunctive predicates in this setup. Our\nalgorithm returns all possible violations of the predicate, which is important\nfor eliminating bugs from distributed systems regardless of actual clock drift.\nWe prove that this detection algorithm is in the same complexity class as the\ndetector for discrete systems. We implement our detector and validate it\nexperimentally.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:45:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Koll","Charles",""],["Momtaz","Anik",""],["Bonakdarpour","Borzoo",""],["Abbas","Houssam",""]]}
{"id":"2308.02764","submitter":"Md Naimul Hoque","authors":"Md Naimul Hoque and Niklas Elmqvist","title":"Dataopsy: Scalable and Fluid Visual Exploration using Aggregate Query\n  Sculpting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present aggregate query sculpting (AQS), a faceted visual query technique\nfor large-scale multidimensional data. As a \"born scalable\" query technique,\nAQS starts visualization with a single visual mark representing an aggregation\nof the entire dataset. The user can then progressively explore the dataset\nthrough a sequence of operations abbreviated as P6: pivot (facet an aggregate\nbased on an attribute), partition (lay out a facet in space), peek (see inside\na subset using an aggregate visual representation), pile (merge two or more\nsubsets), project (extracting a subset into a new substrate), and prune\n(discard an aggregate not currently of interest). We validate AQS with\nDataopsy, a prototype implementation of AQS that has been designed for fluid\ninteraction on desktop and touch-based mobile devices. We demonstrate AQS and\nDataopsy using two case studies and three application examples.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:51:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hoque","Md Naimul",""],["Elmqvist","Niklas",""]]}
{"id":"2308.02765","submitter":"Runze Lin","authors":"Runze Lin, Yangyang Luo, Xialai Wu, Junghui Chen, Biao Huang, Lei Xie,\n  Hongye Su","title":"Surrogate Empowered Sim2Real Transfer of Deep Reinforcement Learning for\n  ORC Superheat Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.AI cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Organic Rankine Cycle (ORC) is widely used in industrial waste heat\nrecovery due to its simple structure and easy maintenance. However, in the\ncontext of smart manufacturing in the process industry, traditional model-based\noptimization control methods are unable to adapt to the varying operating\nconditions of the ORC system or sudden changes in operating modes. Deep\nreinforcement learning (DRL) has significant advantages in situations with\nuncertainty as it directly achieves control objectives by interacting with the\nenvironment without requiring an explicit model of the controlled plant.\nNevertheless, direct application of DRL to physical ORC systems presents\nunacceptable safety risks, and its generalization performance under model-plant\nmismatch is insufficient to support ORC control requirements. Therefore, this\npaper proposes a Sim2Real transfer learning-based DRL control method for ORC\nsuperheat control, which aims to provide a new simple, feasible, and\nuser-friendly solution for energy system optimization control. Experimental\nresults show that the proposed method greatly improves the training speed of\nDRL in ORC control problems and solves the generalization performance issue of\nthe agent under multiple operating conditions through Sim2Real transfer.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 01:59:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lin","Runze",""],["Luo","Yangyang",""],["Wu","Xialai",""],["Chen","Junghui",""],["Huang","Biao",""],["Xie","Lei",""],["Su","Hongye",""]]}
{"id":"2308.02766","submitter":"Antonio Rojas","authors":"Leonardo Esparza-Arellano, Antonio Rojas and Genaro Toledo","title":"Sizing the double pole resonant enhancement in $e^{+}e^{-} \\to \\pi^{0}\n  \\pi^{0} \\gamma$ cross section and $\\tau^{-} \\to \\pi^{-}\\pi^{0}\n  \\nu_{\\tau}\\gamma$ decay","comments":"23 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The enhancement mechanism due to the resonant properties of the $\\rho$ and\n$\\omega$ mesons, which are close in mass, are analysed when such resonances\ncarry different momenta. Considerations from the particular process where they\nappear to the individual resonant features are at play for the appearance of\nthe global resonant manifestation. In this work, we first consider the $e^+e^-\n\\to \\pi^0 \\pi^0 \\gamma$ process. We use the differential cross section at a\ngiven angle of emission of one of the pions, to tune the individual features of\nthe two resonances and exhibit how both resonances combine to produce the\nenhancement. Then, we incorporate the $\\rho^\\prime$ using the information\nobtained from the $ e^+e^- \\to \\pi^0 \\pi^0 \\gamma$ total scattering process and\nshow that, it becomes important thanks to the same enhancement mechanism\nbetween the $\\rho$ and the $\\omega$. In a second step, we use a similar\napproach to describe a model dependent contribution to the $\\tau^- \\to\n\\pi^-\\pi^0\\nu_\\tau\\gamma$ decay, the so-called $\\omega$ channel. We show that\nthe dipion invariant mass distribution at particular angles is sensitive to the\nindividual resonant states. We compute the interference of this channel with\nthe known dominant model independent contribution, and show how a better\nknowledge of the $e^+e^- \\to \\pi^0 \\pi^0 \\gamma$ process can help to properly\naccount for such model dependent effects. The implication on the isospin\nsymmetry breaking correction to tau-based estimates of the muon magnetic dipole\nmoment is assessed.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:00:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Esparza-Arellano","Leonardo",""],["Rojas","Antonio",""],["Toledo","Genaro",""]]}
{"id":"2308.02767","submitter":"Alex James Dr","authors":"Rajalekshmi TR, Rinku Rani Das, Chithra R, Alex James","title":"Graphene-based RRAM devices for neural computing","comments":"Last revision - 04 Jul 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Resistive random access memory (RRAM) is very well known for its potential\napplication in in-memory and neural computing. However, they often have\ndifferent types of device-to-device and cycle-to-cycle variability. This makes\nit harder to build highly accurate crossbar arrays.Traditional RRAM designs\nmake use of various filament-based oxide materials for creating a channel which\nis sandwiched between two electrodes to form a two-terminal structure. They are\noften subjected to mechanical and electrical stress over repeated\nread-and-write cycles. The behavior of these devices often varies in practice\nacross wafer arrays over these stress when fabricated. The use of emerging 2D\nmaterials is explored to improve electrical endurance, long retention In review\ntime, high switching speed, and fewer power losses. This study provides an\nin-depth exploration of neuro-memristive computing and its potential\napplications, focusing specifically on the utilization of graphene and 2D\nmaterials in resistive random-access memory (RRAM) for neural computing. The\npaper presents a comprehensive analysis of the structural and design aspects of\ngraphene-based RRAM, along with a thorough examination of commercially\navailable RRAM models and their fabrication techniques. Furthermore, the study\ninvestigates the diverse range of applications that can benefit from\ngraphene-based RRAM devices.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:10:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["TR","Rajalekshmi",""],["Das","Rinku Rani",""],["R","Chithra",""],["James","Alex",""]]}
{"id":"2308.02768","submitter":"Yuhui Hao","authors":"Yuhui Hao and Bo Yu and Qiang Liu and Shao-Shan Liu","title":"FGLQR: Factor Graph Accelerator of LQR Control for Autonomous Machines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Factor graph represents the factorization of a probability distribution\nfunction and serves as an effective abstraction in various autonomous machine\ncomputing tasks. Control is one of the core applications in autonomous machine\ncomputing stacks. Among all control algorithms, Linear Quadratic Regulator\n(LQR) offers one of the best trade-offs between efficiency and accuracy.\nHowever, due to the inherent iterative process and extensive computation, it is\na challenging task for the autonomous systems with real-time limits and energy\nconstrained.\n  In this paper, we present FGLQR, an accelerator of LQR control for autonomous\nmachines using the abstraction of a factor graph. By transforming the dynamic\nequation constraints into least squares constraints, the factor graph solving\nprocess is more hardware friendly and accelerated with almost no loss in\naccuracy. With a domain specific parallel solving pattern, FGLQR achieves 10.2x\nspeed up and 32.9x energy reduction compared to the software implementation on\nan advanced Intel CPU.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:19:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hao","Yuhui",""],["Yu","Bo",""],["Liu","Qiang",""],["Liu","Shao-Shan",""]]}
{"id":"2308.02769","submitter":"Avimita Chatterjee","authors":"Avimita Chatterjee, Subrata Das and Swaroop Ghosh","title":"Demystifying Noise Resilience of Quantum Error Correction: Insights for\n  Code Optimization","comments":"11 pages; 14 figures; 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Quantum error correction codes (QECCs) are critical for realizing reliable\nquantum computing by protecting fragile quantum states against noise and\nerrors. However, limited research has analyzed the noise resilience of QECCs to\nhelp select optimal codes. This paper conducts a comprehensive study analyzing\ntwo QECCs - repetition codes and surface codes - under different error types\nand noise models using simulations. Surface codes emerge robust to both bit and\nphase flip errors. Among them, rotated surface codes perform best with higher\nthresholds attributed to simplicity and lower qubit overhead. The noise\nthreshold, or the point at which QECCs become ineffective, surpasses the error\nrate found in contemporary quantum processors. When confronting quantum\nhardware where a specific error or noise model is dominant, a discernible\nhierarchy emerges for surface code implementation in terms of resource demand.\nThis ordering is consistently observed across repetition, unrotated, and\nrotated surface codes. Our noise model analysis ranks the code-capacity model\nas the most pessimistic and circuit-level model as the most realistic. The\nstudy maps error thresholds, revealing surface code's advantage over modern\nquantum processors. It also shows higher code distances and rounds consistently\nimprove performance. However, excessive distances needlessly increase qubit\noverhead. By matching target logical error rates and feasible number of qubits\nto optimal surface code parameters, our study demonstrates the necessity of\ntailoring these codes to balance reliability and qubit resources.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:24:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chatterjee","Avimita",""],["Das","Subrata",""],["Ghosh","Swaroop",""]]}
{"id":"2308.02770","submitter":"Hang Guo","authors":"Hang Guo, Tao Dai, Mingyan Zhu, Guanghao Meng, Bin Chen, Zhi Wang,\n  Shu-Tao Xia","title":"One-stage Low-resolution Text Recognition with High-resolution Knowledge\n  Transfer","comments":"Accepted as the ACM MM 2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recognizing characters from low-resolution (LR) text images poses a\nsignificant challenge due to the information deficiency as well as the noise\nand blur in low-quality images. Current solutions for low-resolution text\nrecognition (LTR) typically rely on a two-stage pipeline that involves\nsuper-resolution as the first stage followed by the second-stage recognition.\nAlthough this pipeline is straightforward and intuitive, it has to use an\nadditional super-resolution network, which causes inefficiencies during\ntraining and testing. Moreover, the recognition accuracy of the second stage\nheavily depends on the reconstruction quality of the first stage, causing\nineffectiveness. In this work, we attempt to address these challenges from a\nnovel perspective: adapting the recognizer to low-resolution inputs by\ntransferring the knowledge from the high-resolution. Guided by this idea, we\npropose an efficient and effective knowledge distillation framework to achieve\nmulti-level knowledge transfer. Specifically, the visual focus loss is proposed\nto extract the character position knowledge with resolution gap reduction and\ncharacter region focus, the semantic contrastive loss is employed to exploit\nthe contextual semantic knowledge with contrastive learning, and the soft\nlogits loss facilitates both local word-level and global sequence-level\nlearning from the soft teacher label. Extensive experiments show that the\nproposed one-stage pipeline significantly outperforms super-resolution based\ntwo-stage frameworks in terms of effectiveness and efficiency, accompanied by\nfavorable robustness. Code is available at https://github.com/csguoh/KD-LTR.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:33:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guo","Hang",""],["Dai","Tao",""],["Zhu","Mingyan",""],["Meng","Guanghao",""],["Chen","Bin",""],["Wang","Zhi",""],["Xia","Shu-Tao",""]]}
{"id":"2308.02771","submitter":"Sean Griffin","authors":"Sean Griffin (for the IceCube-Gen2 Collaboration)","title":"Electronics Design of the IceCube-Gen2 Optical Module Prototype","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-1039","categories":"astro-ph.IM physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  IceCube-Gen2 is a planned extension to the existing IceCube Neutrino\nObservatory and will provide an order of magnitude increase in the detection\nrate of cosmic neutrinos by deploying ~10,000 sensors in a volume of ~8 cubic\nkilometers. As part of the upcoming IceCube Upgrade, we are developing\nprototype IceCube-Gen2 sensors to test all components in-situ in preparation\nfor mass production required for IceCube-Gen2. The novel IceCube-Gen2 module\nwill contain up to eighteen 4-inch photomultiplier tubes (PMTs). The signals\nfor each PMT are digitized with a 2-channel, 12-bit ADC (low- and high-gain) at\na rate of 60 MSps. In addition, each module contains LED flashers for in-ice\ncalibration, an FPGA for performing in-module local coincidence of PMT signals,\nand onboard $\\mu$SD flash memory for buffering data before it is sent to the\nsurface. In this contribution, we discuss the electronics and data acquisition\nsystem design.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:36:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Griffin","Sean","","for the IceCube-Gen2 Collaboration"]]}
{"id":"2308.02772","submitter":"Doron Azoury","authors":"Doron Azoury, Edoardo Baldini, Aravind Devarakonda, Jiarui Li, Shiang\n  Fang, Pheona Williams, Riccardo Comin, Joseph Checkelsky and Nuh Gedik","title":"Probing charge order of monolayer NbSe$_2$ within a bulk crystal","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":"  Atomically thin transition metal dichalcogenides can exhibit markedly\ndifferent electronic properties compared to their bulk counterparts. In the\ncase of NbSe$_2$, the question of whether its charge density wave (CDW) phase\nis enhanced in the monolayer limit has been the subject of intense debate,\nprimarily due to the difficulty of decoupling this order from its environment.\nHere, we address this challenge by using a misfit crystal that comprises\nNbSe$_2$ monolayers separated by SnSe rock-salt spacers, a structure that\nallows us to investigate a monolayer crystal embedded in a bulk matrix. We\nestablish an effective monolayer electronic behavior of the misfit crystal by\nstudying its transport properties and visualizing its electronic structure by\nangle-resolved photoemission measurements. We then investigate the emergence of\nthe CDW by tracking the temperature dependence of its collective modes. Our\nfindings reveal a nearly sixfold enhancement in the CDW transition temperature,\nproviding compelling evidence for the profound impact of dimensionality on\ncharge order formation in NbSe$_2$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:51:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Azoury","Doron",""],["Baldini","Edoardo",""],["Devarakonda","Aravind",""],["Li","Jiarui",""],["Fang","Shiang",""],["Williams","Pheona",""],["Comin","Riccardo",""],["Checkelsky","Joseph",""],["Gedik","Nuh",""]]}
{"id":"2308.02773","submitter":"Jie Zhou","authors":"Yuhao Dan, Zhikai Lei, Yiyang Gu, Yong Li, Jianghao Yin, Jiaju Lin,\n  Linhao Ye, Zhiyan Tie, Yougen Zhou, Yilei Wang, Aimin Zhou, Ze Zhou, Qin\n  Chen, Jie Zhou, Liang He, Xipeng Qiu","title":"EduChat: A Large-Scale Language Model-based Chatbot System for\n  Intelligent Education","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  EduChat (https://www.educhat.top/) is a large-scale language model\n(LLM)-based chatbot system in the education domain. Its goal is to support\npersonalized, fair, and compassionate intelligent education, serving teachers,\nstudents, and parents. Guided by theories from psychology and education, it\nfurther strengthens educational functions such as open question answering,\nessay assessment, Socratic teaching, and emotional support based on the\nexisting basic LLMs. Particularly, we learn domain-specific knowledge by\npre-training on the educational corpus and stimulate various skills with tool\nuse by fine-tuning on designed system prompts and instructions. Currently,\nEduChat is available online as an open-source project, with its code, data, and\nmodel parameters available on platforms (e.g., GitHub\nhttps://github.com/icalk-nlp/EduChat, Hugging Face\nhttps://huggingface.co/ecnu-icalk ). We also prepare a demonstration of its\ncapabilities online (https://vimeo.com/851004454). This initiative aims to\npromote research and applications of LLMs for intelligent education.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:55:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dan","Yuhao",""],["Lei","Zhikai",""],["Gu","Yiyang",""],["Li","Yong",""],["Yin","Jianghao",""],["Lin","Jiaju",""],["Ye","Linhao",""],["Tie","Zhiyan",""],["Zhou","Yougen",""],["Wang","Yilei",""],["Zhou","Aimin",""],["Zhou","Ze",""],["Chen","Qin",""],["Zhou","Jie",""],["He","Liang",""],["Qiu","Xipeng",""]]}
{"id":"2308.02774","submitter":"Yafeng Chen","authors":"Yafeng Chen, Siqi Zheng, Qian Chen","title":"Self-Distillation Network with Ensemble Prototypes: Learning Robust\n  Speaker Representations without Supervision","comments":"arXiv admin note: text overlap with arXiv:2211.04168","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Training speaker-discriminative and robust speaker verification systems\nwithout speaker labels is still challenging and worthwhile to explore. Previous\nstudies have noted a substantial performance disparity between self-supervised\nand fully supervised approaches. In this paper, we propose an effective\nSelf-Distillation network with Ensemble Prototypes (SDEP) to facilitate\nself-supervised speaker representation learning. A range of experiments\nconducted on the VoxCeleb datasets demonstrate the superiority of the SDEP\nframework in speaker verification. SDEP achieves a new SOTA on Voxceleb1\nspeaker verification evaluation benchmark ( i.e., equal error rate 1.94\\%,\n1.99\\%, and 3.77\\% for trial Vox1-O, Vox1-E and Vox1-H , respectively),\ndiscarding any speaker labels in the training phase. Code will be publicly\navailable at https://github.com/alibaba-damo-academy/3D-Speaker.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:59:40 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 03:00:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Yafeng",""],["Zheng","Siqi",""],["Chen","Qian",""]]}
{"id":"2308.02775","submitter":"Kevin Keating","authors":"G. Griffith Elder and Kevin Keating","title":"Galois scaffolds for $p$-extensions in characteristic $p$","comments":"23 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 a local field of characteristic $p>0$ with perfect residue field\nand let $G$ be a finite $p$-group. In this paper we use Saltman's construction\nof a generic $G$-extension of rings of characteristic $p$ to construct totally\nramified $G$-extensions $L/K$ that have Galois scaffolds. We specialize this\nconstruction to produce $G$-extensions $L/K$ such that the ring of integers\n$O_L$ is free of rank 1 over its associated order $A_0$, and extensions such\nthat $A_0$ is a Hopf order in the group ring $K[G]$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:06:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Elder","G. Griffith",""],["Keating","Kevin",""]]}
{"id":"2308.02776","submitter":"Huake Wang","authors":"Huake Wang, Xingsong Hou, Xiaoyang Yan","title":"Dual Degradation-Inspired Deep Unfolding Network for Low-Light Image\n  Enhancement","comments":"12 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although low-light image enhancement has achieved great stride based on deep\nenhancement models, most of them mainly stress on enhancement performance via\nan elaborated black-box network and rarely explore the physical significance of\nenhancement models. Towards this issue, we propose a Dual degrAdation-inSpired\ndeep Unfolding network, termed DASUNet, for low-light image enhancement.\nSpecifically, we construct a dual degradation model (DDM) to explicitly\nsimulate the deterioration mechanism of low-light images. It learns two\ndistinct image priors via considering degradation specificity between luminance\nand chrominance spaces. To make the proposed scheme tractable, we design an\nalternating optimization solution to solve the proposed DDM. Further, the\ndesigned solution is unfolded into a specified deep network, imitating the\niteration updating rules, to form DASUNet. Local and long-range information are\nobtained by prior modeling module (PMM), inheriting the advantages of\nconvolution and Transformer, to enhance the representation capability of dual\ndegradation priors. Additionally, a space aggregation module (SAM) is presented\nto boost the interaction of two degradation models. Extensive experiments on\nmultiple popular low-light image datasets validate the effectiveness of DASUNet\ncompared to canonical state-of-the-art low-light image enhancement methods. Our\nsource code and pretrained model will be publicly available.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:07:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Huake",""],["Hou","Xingsong",""],["Yan","Xiaoyang",""]]}
{"id":"2308.02777","submitter":"Shihong Zhang","authors":"Yiyan Xu and Shihong Zhang","title":"On some rigidity theorems of Q-curvature","comments":"23 pages, accepted by manuscripta mathematica","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 investigate the rigidity of Q-curvature. Specifically, we\nconsider a closed, oriented $n$-dimensional ($n\\geq6$) Riemannian manifold\n$(M,g)$ and prove the following results under the condition $\\int_{M} \\nabla\nR\\cdot\\nabla \\mathrm{Q}\\mathrm{d} V_g\\leq0$. (1) If $(M,g)$ is locally\nconformally flat with nonnegative Ricci curvature, then $(M,g)$ is isometric to\na quotient of $\\mathbb{R}^n$, $\\mathbb{S}^n$, or\n$\\mathbb{R}\\times\\mathbb{S}^{n-1}$. (2) If $(M,g)$ has $\\delta^2 W=0$ with\nnonnegative sectional curvature, then $(M,g)$ is isometric to a quotient of the\nproduct of Einstein manifolds. Additionally, we investigate some rigidity\ntheorems involving Q-curvature about hypersurfaces in simply-connected space\nforms. We also show the uniqueness of metrics with constant scalar curvature\nand constant Q-curvature in a fixed conformal class.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:10:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Yiyan",""],["Zhang","Shihong",""]]}
{"id":"2308.02779","submitter":"Yanru Chen","authors":"Yanru Chen, Bo Fu, Jinrong Xu, Qinwei Shi, Ping Cui and Zhenyu Zhang","title":"Quasiparticle and Transport Properties of Disordered Bilayer Graphene","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent experimental and theoretical studies of graphene, disorder\nscattering processes have been suggested to play an important role in its\nelectronic and transport properties. In the preceding paper, it has been shown\nthat the nonperturbative momentum-space Lanczos method is able to accurately\ndescribe all the multiple impurity scattering events and account for the\nquasiparticle and transport properties of disordered monolayer graphene. In the\npresent study, we expand the range of applicability of this recursive method by\nnumerically investigating the quasiparticle and transport properties of\nBernal-stacked bilayer graphene in the presence of scalar Anderson disorder.\nThe results are further compared with the findings of the same system using a\nself-consistent Born approximation, as well as the central findings in the\npreceding paper for monolayer graphene. It is found that in both systems,\nproper inclusions of all the scattering events are needed in order to reliably\ncapture the role of disorder via multiple impurity scattering. In particular,\nthe quasiparticle residue is shown to decrease sharply near the charge\nneutrality point, suggesting that the system is either a marginal Fermi liquid\nor a non-Fermi liquid. Furthermore, we reveal the dependences of the transport\nproperties of disordered bilayer graphene on the carrier density and\ntemperature, and explore the role of interlayer scattering at varying\nstrengths. Our findings help to provide some new angles into the quasiparticle\nand transport properties of disordered bilayer graphene.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:17:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Yanru",""],["Fu","Bo",""],["Xu","Jinrong",""],["Shi","Qinwei",""],["Cui","Ping",""],["Zhang","Zhenyu",""]]}
{"id":"2308.02780","submitter":"Jin L.C. Guo","authors":"Saskia Gilmer, Avinash Bhat, Shuvam Shah, Kevin Cherry, Jinghui Cheng,\n  Jin L.C. Guo","title":"SUMMIT: Scaffolding OSS Issue Discussion Through Summarization","comments":"To be published in CSCW2023","journal-ref":null,"doi":"10.1145/3610088","report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For Open Source Software (OSS) projects, discussions in Issue Tracking\nSystems (ITS) serve as a crucial collaboration mechanism for diverse\nstakeholders. However, these discussions can become lengthy and entangled,\nmaking it hard to find relevant information and make further contributions. In\nthis work, we study the use of summarization to aid users in collaboratively\nmaking sense of OSS issue discussion threads. We reveal a complex picture of\nhow summarization is used by issue users in practice as a strategy to help\ndevelop and manage their discussions. Grounded on the different objectives\nserved by the summaries and the outcome of our formative study with OSS\nstakeholders, we identified a set of guidelines to inform the design of\ncollaborative summarization tools for OSS issue discussions. We then developed\nSUMMIT, a tool that allows issue users to collectively construct summaries of\ndifferent types of information discussed, as well as a set of comments\nrepresenting continuous conversations within the thread. To alleviate the\nmanual effort involved, SUMMIT uses techniques that automatically detect\ninformation types and summarize texts to facilitate the generation of these\nsummaries. A lab user study indicates that, as the users of SUMMIT, OSS\nstakeholders adopted different strategies to acquire information on issue\nthreads. Furthermore, different features of SUMMIT effectively lowered the\nperceived difficulty of locating information from issue threads and enabled the\nusers to prioritize their effort. Overall, our findings demonstrated the\npotential of SUMMIT, and the corresponding design guidelines, in supporting\nusers to acquire information from lengthy discussions in ITSs. Our work sheds\nlight on key design considerations and features when exploring crowd-based and\nmachine-learning-enabled instruments for asynchronous collaboration on complex\ntasks such as OSS development.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:20:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gilmer","Saskia",""],["Bhat","Avinash",""],["Shah","Shuvam",""],["Cherry","Kevin",""],["Cheng","Jinghui",""],["Guo","Jin L. C.",""]]}
{"id":"2308.02781","submitter":"Qian Huang","authors":"Linyi Qian, Qian Huang, Yulin Chen, Junzhou Chen","title":"A Voting-Stacking Ensemble of Inception Networks for Cervical Cytology\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cervical cancer is one of the most severe diseases threatening women's\nhealth. Early detection and diagnosis can significantly reduce cancer risk, in\nwhich cervical cytology classification is indispensable. Researchers have\nrecently designed many networks for automated cervical cancer diagnosis, but\nthe limited accuracy and bulky size of these individual models cannot meet\npractical application needs. To address this issue, we propose a\nVoting-Stacking ensemble strategy, which employs three Inception networks as\nbase learners and integrates their outputs through a voting ensemble. The\nsamples misclassified by the ensemble model generate a new training set on\nwhich a linear classification model is trained as the meta-learner and performs\nthe final predictions. In addition, a multi-level Stacking ensemble framework\nis designed to improve performance further. The method is evaluated on the\nSIPakMed, Herlev, and Mendeley datasets, achieving accuracies of 100%, 100%,\nand 100%, respectively. The experimental results outperform the current\nstate-of-the-art (SOTA) methods, demonstrating its potential for reducing\nscreening workload and helping pathologists detect cervical cancer.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:21:12 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 14:54:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Qian","Linyi",""],["Huang","Qian",""],["Chen","Yulin",""],["Chen","Junzhou",""]]}
{"id":"2308.02782","submitter":"Rui Chen","authors":"Duolan Huang, Quan Chen, Zhun Wei, Rui Chen","title":"Non-line-of-sight reconstruction via structure sparsity regularization","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-line-of-sight (NLOS) imaging allows for the imaging of objects around a\ncorner, which enables potential applications in various fields such as\nautonomous driving, robotic vision, medical imaging, security monitoring, etc.\nHowever, the quality of reconstruction is challenged by low signal-noise-ratio\n(SNR) measurements. In this study, we present a regularization method, referred\nto as structure sparsity (SS) regularization, for denoising in NLOS\nreconstruction. By exploiting the prior knowledge of structure sparseness, we\nincorporate nuclear norm penalization into the cost function of directional\nlight-cone transform (DLCT) model for NLOS imaging system. This incorporation\neffectively integrates the neighborhood information associated with the\ndirectional albedo, thereby facilitating the denoising process. Subsequently,\nthe reconstruction is achieved by optimizing a directional albedo model with SS\nregularization using fast iterative shrinkage-thresholding algorithm. Notably,\nthe robust reconstruction of occluded objects is observed. Through\ncomprehensive evaluations conducted on both synthetic and experimental\ndatasets, we demonstrate that the proposed approach yields high-quality\nreconstructions, surpassing the state-of-the-art reconstruction algorithms,\nespecially in scenarios involving short exposure and low SNR measurements.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:32:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Duolan",""],["Chen","Quan",""],["Wei","Zhun",""],["Chen","Rui",""]]}
{"id":"2308.02783","submitter":"Kirti Chandra Sahu Prof.","authors":"Akash Paul, Bahni Ray, Kirti Chandra Sahu, Gautam Biswas","title":"An investigation on the impact of two vertically aligned drops on a\n  liquid surface","comments":"36 pages, 14 figures, Accepted in International Journal of Multiphase\n  Flow","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dynamics of two vertically coalescing drops and a pool of the same liquid\nhave been investigated using a Coupled Level Set and Volume of Fluid (CLSVOF)\nmethod. Such a configuration enables us to study the dynamic interaction of an\narbitrary-shaped liquid conglomerate, formed owing to drop-drop coalescence,\nwith a pool. Similar to drop-pool and drop-drop interactions, partial\ncoalescence is observed when a conglomerate interacts with a pool. The presence\nof the pool below the father drop is found to influence the coalescence\ncharacteristic of the two drops. At the same time, the movement of the\ncapillary waves resulting from the interaction of two drops governs the\ncoalescence dynamics of the conglomerate with the pool. As liquid interfaces\ninteract and generate capillary waves at multiple locations, complex\ntrajectories of capillary waves are observed, which play a crucial role in\ndetermining the pinch-off characteristics of the satellite during\nconglomerate-pool interaction. We examine the effect of the ratio of the\ndiameters of the lower/father drop to the upper/mother drop (D_r) on the\ncoalescence dynamics while maintaining the size of the mother drop constant.\nThe variation in the coalescence dynamics due to change in $D_r$ is quantified\nin terms of the residence time (tau_r), pinch-off time (tau_p) and the\nsatellite diameter to conglomerate diameter ratio (Ds/Dc). The coalescence\ndynamics of the conglomerate is then compared with that of an equivalent\nspherical drop of the same volume and also with that of a drop initialized with\nthe same shape as that of the conglomerate. Finally, the regions of complete\nand partial coalescence for the conglomerate-pool interactions are demarcated\non the Weber number - diameter ratio (We-Dr) space.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:11:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Paul","Akash",""],["Ray","Bahni",""],["Sahu","Kirti Chandra",""],["Biswas","Gautam",""]]}
{"id":"2308.02784","submitter":"Akshansh Gupta","authors":"Somsukla Maiti, Akshansh Gupta","title":"Semi-supervised Contrastive Regression for Estimation of Eye Gaze","comments":"Accepted for International Conference on Pattern Recognition and\n  Machine Intelligence 2023 (PReMI 2023)","journal-ref":null,"doi":null,"report-no":"Paper 057,\n  https://www.isical.ac.in/~premi23/List_of_Accepted_Papers.pdf","categories":"cs.CV cs.AI cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the escalated demand of human-machine interfaces for intelligent\nsystems, development of gaze controlled system have become a necessity. Gaze,\nbeing the non-intrusive form of human interaction, is one of the best suited\napproach. Appearance based deep learning models are the most widely used for\ngaze estimation. But the performance of these models is entirely influenced by\nthe size of labeled gaze dataset and in effect affects generalization in\nperformance. This paper aims to develop a semi-supervised contrastive learning\nframework for estimation of gaze direction. With a small labeled gaze dataset,\nthe framework is able to find a generalized solution even for unseen face\nimages. In this paper, we have proposed a new contrastive loss paradigm that\nmaximizes the similarity agreement between similar images and at the same time\nreduces the redundancy in embedding representations. Our contrastive regression\nframework shows good performance in comparison to several state of the art\ncontrastive learning techniques used for gaze estimation.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:11:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Maiti","Somsukla",""],["Gupta","Akshansh",""]]}
{"id":"2308.02785","submitter":"Zhengping Luo Dr.","authors":"Zhengping Jay Luo, Ruowen Liu, Aarav Mehta","title":"Understanding the RSA algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the emerging importance of cybersecurity, it will be beneficial for a\nwide community to understand some of the fundamental security mechanisms. The\nRSA algorithm is one of the essential algorithms used in public-key\ncryptosystems. Understanding the RSA algorithm requires knowledge regarding\nnumber theory, modular arithmetic, etc., which is often beyond the knowledge\npool of many beginners in cybersecurity. In this work, we provide an intuitive\nand onion-peeling style introduction to the RSA algorithm, in which we assume\nthat readers will only have a basic background in mathematics and\ncybersecurity. Started from three essential goals of public-key cryptosystems,\nwe explained step-by-step how the RSA algorithm achieved these goals. We also\nused a toy example to further help readers to understand the algorithm from a\npractical perspective.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:20:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Luo","Zhengping Jay",""],["Liu","Ruowen",""],["Mehta","Aarav",""]]}
{"id":"2308.02786","submitter":"Graciela Boente Prof.","authors":"Graciela Boente and Marina Valdora","title":"Robust estimation for functional logistic regression 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 paper addresses the problem of providing robust estimators under a\nfunctional logistic regression model. Logistic regression is a popular tool in\nclassification problems with two populations. As in functional linear\nregression, regularization tools are needed to compute estimators for the\nfunctional slope. The traditional methods are based on dimension reduction or\npenalization combined with maximum likelihood or quasi--likelihood techniques\nand for that reason, they may be affected by misclassified points especially if\nthey are associated to functional covariates with atypical behaviour. The\nproposal given in this paper adapts some of the best practices used when the\ncovariates are finite--dimensional to provide reliable estimations. Under\nregularity conditions, consistency of the resulting estimators and rates of\nconvergence for the predictions are derived. A numerical study illustrates the\nfinite sample performance of the proposed method and reveals its stability\nunder different contamination scenarios. A real data example is also presented.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:22:40 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 13:15:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Boente","Graciela",""],["Valdora","Marina",""]]}
{"id":"2308.02787","submitter":"Eneko Osaba","authors":"Sebasti\\'an V. Romero, Eneko Osaba, Esther Villar-Rodriguez and\n  Ant\\'on Asla","title":"Solving Logistic-Oriented Bin Packing Problems Through a Hybrid\n  Quantum-Classical Approach","comments":"7 pages, 7 figures, paper accepted for being presented in the\n  upcoming 26th IEEE International Conference on Intelligent Transportation\n  Systems - ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Bin Packing Problem is a classic problem with wide industrial\napplicability. In fact, the efficient packing of items into bins is one of the\ntoughest challenges in many logistic corporations and is a critical issue for\nreducing storage costs or improving vehicle space allocation. In this work, we\nresort to our previously published quantum-classical framework known as\nQ4RealBPP, and elaborate on the solving of real-world oriented instances of the\nBin Packing Problem. With this purpose, this paper gravitates on the following\ncharacteristics: i) the existence of heterogeneous bins, ii) the extension of\nthe framework to solve not only three-dimensional, but also one- and\ntwo-dimensional instances of the problem, iii) requirements for item-bin\nassociations, and iv) delivery priorities. All these features have been tested\nin this paper, as well as the ability of Q4RealBPP to solve real-world oriented\ninstances.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:36:33 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:30:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Romero","Sebasti\u00e1n V.",""],["Osaba","Eneko",""],["Villar-Rodriguez","Esther",""],["Asla","Ant\u00f3n",""]]}
{"id":"2308.02788","submitter":"Chenyue Lv","authors":"Chenyue Lv, Baole Lu, Jintao Bai","title":"Pulse formation mechanisms switching in hybrid mode-locked fiber laser","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hybrid mode-locking has been widely used in enhancing pulse quality, however\nhow the hybrid two mode-locking techniques work remains unclear. In this paper,\nwe experimentally investigate three pulse formation mechanisms in saturable\nabsorbers (SA) and nonlinear polarization evolution (NPE) passively hybrid\nmode-locked fiber laser, which are SA-dominated, NPE-dominated, and SA-NPE\nco-domination switching. Clarified the exists dynamic competition and\ncooperation among the mode-locking techniques. For the first time, the method\nof simulating filtered gain spectrum with customized filtering is proposed, and\nthe switching of pulse formation mechanisms is numerically investigated using\nthe coupled Ginzburg-Landau equations. Our results deepen the understanding of\nhybrid mode-locked fiber lasers and provided a foundation for multi-wavelength\nmode-locked lasers with different mode-locking techniques in a single cavity.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:53:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lv","Chenyue",""],["Lu","Baole",""],["Bai","Jintao",""]]}
{"id":"2308.02789","submitter":"Haohan Chen","authors":"Haohan Chen, Qianbin Feng, Jiepeng Wu, Yanlin Zhu, Hao Wang, Qiang Li\n  and Lijun Wu","title":"Polarization-insensitive dual-wavelength dispersion tunable metalens\n  achieved by global modulation method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  SF$_6$ is widely used as a gas-insulator in high-voltage power electrical\nsystem. Detecting SF$_6$ leaks using unmanned aerial vehicle (UAV)-based\nthermal cameras allows efficient large-scale inspections during routine\nmaintenance. The emergence of lightweight metalenses can increase the endurance\nof UAVs. Simultaneously controlling dispersion and polarization properties in\nmetalens is significant for thermal camera applications. However, via a\npropagation phase modulation method in which the phase is tuned locally, it is\ndifficult and time-consuming to obtain enough different nanostructures to\ncontrol multiwavelength independently while maintain the\npolarization-insensitive property. To this end, by using a global modulation\nmethod, a polarization-insensitive dual-wavelength achromatic and\nsuper-chromatic metalens are designed respectively. The working wavelength is\nset at 10.6 and 12 $\\rm\\mu$m to match the absorption peaks of SF$_6$ and one of\nits decompositions (SO$_2$F$_2$), respectively. According to the operating\nwavelengths, only the geometric parameters of two nanofins are required to be\noptimized (through genetic algorithm). Then they are superimposed on each other\nto form cross-shaped meta-atoms. In order to control the influence between the\ntwo crossed nanofins, an additional term $\\Delta f$ is introduced into the\nphase equation to modify the shape of the wavefront, whereby the phase\ndispersion can be easily engineered. Compared with local modulation, the number\nof unique nanostructures that need to be optimized can be reduced to two\n(operating at dual wavelengths) by the Pancharatnam-Berry (PB) phase based\nglobal modulation method. Therefore, the proposed design strategy is expected\nto circumvent difficulties in the local design approaches and can find\nwidespread applications in multiwavelength imaging and spectroscopy.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:04:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Haohan",""],["Feng","Qianbin",""],["Wu","Jiepeng",""],["Zhu","Yanlin",""],["Wang","Hao",""],["Li","Qiang",""],["Wu","Lijun",""]]}
{"id":"2308.02790","submitter":"Chengjia Jiang","authors":"Chengjia Jiang, Tao Wang, Sien Li, Jinyang Wang, Shirui Wang, Antonios\n  Antoniou","title":"Few-shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and\n  Knowledge Distillation","comments":"Paper accepted by 4th International Conference on Information\n  Science, Parallel and Distributed Systems (ISPDS 2023)","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 learning new classes for semantic segmentation\nmodels from few examples, which is challenging because of the following two\nreasons. Firstly, it is difficult to learn from limited novel data to capture\nthe underlying class distribution. Secondly, it is challenging to retain\nknowledge for existing classes and to avoid catastrophic forgetting. For\nlearning from limited data, we propose a pseudo-labeling strategy to augment\nthe few-shot training annotations in order to learn novel classes more\neffectively. Given only one or a few images labeled with the novel classes and\na much larger set of unlabeled images, we transfer the knowledge from labeled\nimages to unlabeled images with a coarse-to-fine pseudo-labeling approach in\ntwo steps. Specifically, we first match each labeled image to its nearest\nneighbors in the unlabeled image set at the scene level, in order to obtain\nimages with a similar scene layout. This is followed by obtaining pseudo-labels\nwithin this neighborhood by applying classifiers learned on the few-shot\nannotations. In addition, we use knowledge distillation on both labeled and\nunlabeled data to retain knowledge on existing classes. We integrate the above\nsteps into a single convolutional neural network with a unified learning\nobjective. Extensive experiments on the Cityscapes and KITTI datasets validate\nthe efficacy of the proposed approach in the self-driving domain. Code is\navailable from https://github.com/ChasonJiang/FSCILSS.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:05:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jiang","Chengjia",""],["Wang","Tao",""],["Li","Sien",""],["Wang","Jinyang",""],["Wang","Shirui",""],["Antoniou","Antonios",""]]}
{"id":"2308.02791","submitter":"Dancheng Lu","authors":"Dancheng Lu, Hao Zhou","title":"Monomial ideals with regular quotients and some edge rings","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and study monomial ideals with regular quotients, which can be\nseen as an extension of monomial ideals with linear quotients. Based on these\ninvestigations, we are able to calculate the Betti numbers of toric ideals\nbelonging to various classes of edge rings.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:10:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lu","Dancheng",""],["Zhou","Hao",""]]}
{"id":"2308.02792","submitter":"Sudipta Paria","authors":"Sudipta Paria and Swarup Bhunia","title":"DiSPEL: Distributed Security Policy Enforcement for Bus-based SoC","comments":"14 Pages, 9 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current zero trust model adopted in System-on-Chip (SoC) design is\nvulnerable to various malicious entities, and modern SoC designs must\nincorporate various security policies to protect sensitive assets from\nunauthorized access. These policies involve complex interactions between\nmultiple IP blocks, which poses challenges for SoC designers and security\nexperts when implementing these policies and for system validators when\nensuring compliance. Difficulties arise when upgrading policies, reusing IPs\nfor systems targeting different security requirements, and the subsequent\nincrease in design time and time-to-market. This paper proposes a generic and\nflexible framework, called DiSPEL, for enforcing security policies defined by\nthe user represented in a formal way for any bus-based SoC design. It employs a\ndistributed deployment strategy while ensuring trusted bus operations despite\nthe presence of untrusted IPs. It relies on incorporating a dedicated,\ncentralized module capable of implementing diverse security policies involving\nbus-level interactions while generating the necessary logic and appending in\nthe bus-level wrapper for IP-level policies. The proposed architecture is\ngeneric and independent of specific security policy types supporting both\nsynthesizable and non-synthesizable solutions. The experimental results\ndemonstrate its effectiveness and correctness in enforcing the security\nrequirements and viability due to low overhead in terms of area, delay, and\npower consumption tested on open-source standard SoC benchmarks.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:15:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Paria","Sudipta",""],["Bhunia","Swarup",""]]}
{"id":"2308.02793","submitter":"Hui Li","authors":"Zequan Xu, Qihang Sun, Shaofeng Hu, Jieming Shi, Hui Li","title":"Crowdsourcing Fraud Detection over Heterogeneous Temporal MMMA Graph","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":"  The rise of the click farm business using Multi-purpose Messaging Mobile Apps\n(MMMAs) tempts cybercriminals to perpetrate crowdsourcing frauds that cause\nfinancial losses to click farm workers. In this paper, we propose a novel\ncontrastive multi-view learning method named CMT for crowdsourcing fraud\ndetection over the heterogeneous temporal graph (HTG) of MMMA. CMT captures\nboth heterogeneity and dynamics of HTG and generates high-quality\nrepresentations for crowdsourcing fraud detection in a self-supervised manner.\nWe deploy CMT to detect crowdsourcing frauds on an industry-size HTG of a\nrepresentative MMMA WeChat and it significantly outperforms other methods. CMT\nalso shows promising results for fraud detection on a large-scale public\nfinancial HTG, indicating that it can be applied in other graph anomaly\ndetection tasks.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:35:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Zequan",""],["Sun","Qihang",""],["Hu","Shaofeng",""],["Shi","Jieming",""],["Li","Hui",""]]}
{"id":"2308.02794","submitter":"Yong Liu","authors":"Yong Liu, Hang Dong, Boyang Liang, Songwei Liu, Qingji Dong, Kai Chen,\n  Fangmin Chen, Lean Fu, and Fei Wang","title":"Unfolding Once is Enough: A Deployment-Friendly Transformer Unit for\n  Super-Resolution","comments":"Accepted by the 31st ACM International Conference on Multimedia","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent years have witnessed a few attempts of vision transformers for single\nimage super-resolution (SISR). Since the high resolution of intermediate\nfeatures in SISR models increases memory and computational requirements,\nefficient SISR transformers are more favored. Based on some popular transformer\nbackbone, many methods have explored reasonable schemes to reduce the\ncomputational complexity of the self-attention module while achieving\nimpressive performance. However, these methods only focus on the performance on\nthe training platform (e.g., Pytorch/Tensorflow) without further optimization\nfor the deployment platform (e.g., TensorRT). Therefore, they inevitably\ncontain some redundant operators, posing challenges for subsequent deployment\nin real-world applications. In this paper, we propose a deployment-friendly\ntransformer unit, namely UFONE (i.e., UnFolding ONce is Enough), to alleviate\nthese problems. In each UFONE, we introduce an Inner-patch Transformer Layer\n(ITL) to efficiently reconstruct the local structural information from patches\nand a Spatial-Aware Layer (SAL) to exploit the long-range dependencies between\npatches. Based on UFONE, we propose a Deployment-friendly Inner-patch\nTransformer Network (DITN) for the SISR task, which can achieve favorable\nperformance with low latency and memory usage on both training and deployment\nplatforms. Furthermore, to further boost the deployment efficiency of the\nproposed DITN on TensorRT, we also provide an efficient substitution for layer\nnormalization and propose a fusion optimization strategy for specific\noperators. Extensive experiments show that our models can achieve competitive\nresults in terms of qualitative and quantitative performance with high\ndeployment efficiency. Code is available at\n\\url{https://github.com/yongliuy/DITN}.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:42:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Yong",""],["Dong","Hang",""],["Liang","Boyang",""],["Liu","Songwei",""],["Dong","Qingji",""],["Chen","Kai",""],["Chen","Fangmin",""],["Fu","Lean",""],["Wang","Fei",""]]}
{"id":"2308.02795","submitter":"Md Amjad Hossain","authors":"Md Amjad Hossain, Javed I. Khan","title":"ZePoP: A Distributed Leader Election Protocol using the Delay-based\n  Closeness Centrality for Peer-to-Peer Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents ZePoP, a leader election protocol for distributed\nsystems, optimizing a delay-based closeness centrality. We design the protocol\nspecifically for the Peer to Peer(P2P) applications, where the leader peer\n(node) is responsible for collecting, processing, and redistributing data or\ncontrol signals satisfying some timing constraints. The protocol elects an\noptimal leader node in the dynamically changing network and constructs a Data\nCollection and Distribution Tree (DCDT) rooted at the leader node. The elected\noptimal leader is closest to all nodes in the system compared to other nodes.\nWe validate the proposed protocol through theoretical proofs as well as\nexperimental results.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 05:55:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hossain","Md Amjad",""],["Khan","Javed I.",""]]}
{"id":"2308.02796","submitter":"Mrinmoy Roy","authors":"Mrinmoy Roy, Srabonti Das, Anica Tasnim Protity","title":"OBESEYE: Interpretable Diet Recommender for Obesity Management using\n  Machine Learning and Explainable AI","comments":null,"journal-ref":null,"doi":null,"report-no":"Roy, M.(2023).OBESEYE: Interpretable Diet Recommender for Obesity\n  Management using Machine Learning and Explainable AI.IJRAMT, 4(6), 1-7.\n  https://journal.ijramt.com/ijramt/article/view/2733","categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Obesity, the leading cause of many non-communicable diseases, occurs mainly\nfor eating more than our body requirements and lack of proper activity. So,\nbeing healthy requires heathy diet plans, especially for patients with\ncomorbidities. But it is difficult to figure out the exact quantity of each\nnutrient because nutrients requirement varies based on physical and disease\nconditions. In our study we proposed a novel machine learning based system to\npredict the amount of nutrients one individual requires for being healthy. We\napplied different machine learning algorithms: linear regression, support\nvector machine (SVM), decision tree, random forest, XGBoost, LightGBM on fluid\nand 3 other major micronutrients: carbohydrate, protein, fat consumption\nprediction. We achieved high accuracy with low root mean square error (RMSE) by\nusing linear regression in fluid prediction, random forest in carbohydrate\nprediction and LightGBM in protein and fat prediction. We believe our diet\nrecommender system, OBESEYE, is the only of its kind which recommends diet with\nthe consideration of comorbidities and physical conditions and promote\nencouragement to get rid of obesity.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:02:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Roy","Mrinmoy",""],["Das","Srabonti",""],["Protity","Anica Tasnim",""]]}
{"id":"2308.02797","submitter":"Jipeng Sun Mr.","authors":"Praneeth Chakravarthula, Jipeng Sun, Xiao Li, Chenyang Lei, Gene Chou,\n  Mario Bijelic, Johannes Froesch, Arka Majumdar, Felix Heide","title":"Thin On-Sensor Nanophotonic Array Cameras","comments":"18 pages, 12 figures, to be published in ACM Transactions on Graphics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Today's commodity camera systems rely on compound optics to map light\noriginating from the scene to positions on the sensor where it gets recorded as\nan image. To record images without optical aberrations, i.e., deviations from\nGauss' linear model of optics, typical lens systems introduce increasingly\ncomplex stacks of optical elements which are responsible for the height of\nexisting commodity cameras. In this work, we investigate flat nanophotonic\ncomputational cameras as an alternative that employs an array of skewed\nlenslets and a learned reconstruction approach. The optical array is embedded\non a metasurface that, at 700~nm height, is flat and sits on the sensor cover\nglass at 2.5~mm focal distance from the sensor. To tackle the highly chromatic\nresponse of a metasurface and design the array over the entire sensor, we\npropose a differentiable optimization method that continuously samples over the\nvisible spectrum and factorizes the optical modulation for different incident\nfields into individual lenses. We reconstruct a megapixel image from our flat\nimager with a learned probabilistic reconstruction method that employs a\ngenerative diffusion model to sample an implicit prior. To tackle\nscene-dependent aberrations in broadband, we propose a method for acquiring\npaired captured training data in varying illumination conditions. We assess the\nproposed flat camera design in simulation and with an experimental prototype,\nvalidating that the method is capable of recovering images from diverse scenes\nin broadband with a single nanophotonic layer.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:04:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chakravarthula","Praneeth",""],["Sun","Jipeng",""],["Li","Xiao",""],["Lei","Chenyang",""],["Chou","Gene",""],["Bijelic","Mario",""],["Froesch","Johannes",""],["Majumdar","Arka",""],["Heide","Felix",""]]}
{"id":"2308.02798","submitter":"Xiao Luo","authors":"Xiao Luo, Yoshinobu Kuramashi","title":"Entanglement and R\\'enyi entropies of (1+1)-dimensional O(3) nonlinear\n  sigma model with tensor renormalization group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-lat quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the entanglement and R\\'enyi entropies for the\n(1+1)-dimensional O(3) nonlinear sigma model using the tensor renormalization\ngroup method. The central charge is determined from the asymptotic scaling\nproperties of both entropies. We also examine the consistency between the\nentanglement entropy and the $n$th-order R\\'enyi entropy with $n\\rightarrow 1$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:04:10 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 03:02:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Luo","Xiao",""],["Kuramashi","Yoshinobu",""]]}
{"id":"2308.02799","submitter":"Yifei Yuan","authors":"Yifei Yuan, Chang Wu, Yuan You, Xiaotong Kong, Ying Zhang, Qiyan Li","title":"VoxelMap++: Mergeable Voxel Mapping Method for Online LiDAR(-inertial)\n  Odometry","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 presents VoxelMap++: a voxel mapping method with plane merging\nwhich can effectively improve the accuracy and efficiency of LiDAR(-inertial)\nbased simultaneous localization and mapping (SLAM). This map is a collection of\nvoxels that contains one plane feature with 3DOF representation and\ncorresponding covariance estimation. Considering total map will contain a large\nnumber of coplanar features (kid planes), these kid planes' 3DOF estimation can\nbe regarded as the measurements with covariance of a larger plane (father\nplane). Thus, we design a plane merging module based on union-find which can\nsave resources and further improve the accuracy of plane fitting. This module\ncan distinguish the kid planes in different voxels and merge these kid planes\nto estimate the father plane. After merging, the father plane 3DOF\nrepresentation will be more accurate than the kids plane and the uncertainty\nwill decrease significantly which can further improve the performance of\nLiDAR(-inertial) odometry. Experiments on challenging environments such as\ncorridors and forests demonstrate the high accuracy and efficiency of our\nmethod compared to other state-of-the-art methods (see our attached video). By\nthe way, our implementation VoxelMap++ is open-sourced on GitHub which is\napplicable for both non-repetitive scanning LiDARs and traditional scanning\nLiDAR.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:07:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yuan","Yifei",""],["Wu","Chang",""],["You","Yuan",""],["Kong","Xiaotong",""],["Zhang","Ying",""],["Li","Qiyan",""]]}
{"id":"2308.02800","submitter":"Evan Smith","authors":"J. Beare, E. M. Smith, J. Dudemaine, R. Sch\\\"afer, M. R. Rutherford,\n  S. Sharma, A. Fitterman, C. A. Marjerrison, T. J. Williams, A. A. Aczel, S.\n  R. Dunsiger, A. D. Bianchi, B. D. Gaulin, and G. M. Luke","title":"$\\mu$SR Study of the Dipole-Octupole Quantum Spin Ice Candidate\n  Ce$_2$Zr$_2$O$_7$","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":"  The Ce$^{3+}$ pseudospin-1/2 degrees of freedom in Ce$_2$Zr$_2$O$_7$ possess\nboth dipolar and octupolar character which enables the possibility of novel\nquantum spin liquid ground states in this material. Here we report new muon\nspin relaxation and rotation ($\\mu$SR) measurements on single crystal samples\nof Ce$_2$Zr$_2$O$_7$ in zero magnetic field and in magnetic fields directed\nalong the $[1,\\bar{1},0]$ and $[1,1,1]$ crystallographic directions, and for\nmagnetic fields directed both longitudinal and transverse to the direction of\nmuon polarization. Our zero-field results show no signs of magnetic ordering or\nspin freezing, consistent with earlier zero-field $\\mu$SR measurements on a\npowder sample of Ce$_2$Zr$_2$O$_7$, and also with the expectations for a\nquantum spin ice. However, we measure a more gentle relaxation rate for\nCe$_2$Zr$_2$O$_7$ in zero-field at low temperatures than was previously\nreported. This difference in relaxation rate is likely due to the low\noxidation, and correspondingly, the high stoichiometry of our single crystal\nsamples. Longitudinal field measurements confirm that the magnetic dipole\nmoments in Ce$_2$Zr$_2$O$_7$ remain dynamic at $T = 0.1$ $\\mathrm{K}$. For both\n$[1,\\bar{1},0]$ and $[1,1,1]$ magnetic fields, our $\\mu$SR Knight shift\nmeasurements show a field-induced leveling off of the magnetic susceptibility\nat low temperature which is qualitatively consistent with corresponding\ncalculations using the numerical-linked-cluster method in combination with\nrecent estimates for the nearest-neighbour exchange parameters of\nCe$_2$Zr$_2$O$_7$\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:12:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Beare","J.",""],["Smith","E. M.",""],["Dudemaine","J.",""],["Sch\u00e4fer","R.",""],["Rutherford","M. R.",""],["Sharma","S.",""],["Fitterman","A.",""],["Marjerrison","C. A.",""],["Williams","T. J.",""],["Aczel","A. A.",""],["Dunsiger","S. R.",""],["Bianchi","A. D.",""],["Gaulin","B. D.",""],["Luke","G. M.",""]]}
{"id":"2308.02801","submitter":"Mahmood Ahmadi","authors":"Arman Mahmoudi, Mahmood Ahmadi","title":"DiCuPIT: Distributed Cuckoo Filter-based Pending Interest Table","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Named data networking is one of the recommended {\\color{red}architectures}\nfor the future of the Internet. In this communication architecture, the content\nname is used instead of the IP address. To achieve this purpose, a new data\nstructure is added to the nodes of named data networking which is called\nPending Interest Table (PIT). Scalability, memory consumption, and integration\nare the significant challenges in PIT design {\\color{red} as} it needs to be\nupdated for each packet, and it saves the name of the packet. This paper\nintroduces a new data structure for PIT called DiCuPIT. DiCuPIT is a\ndistributed data structure for the PIT table, {\\color{red} that works} based on\nthe Cuckoo filter and can cover the three features as above-mentioned.\n{\\color{red} By} implementing this PIT, {\\color{red} the lookup} time shows\n{\\color{red} a 36\\% reduction} compared to the methods based on the Bloom\nfilter and 40\\% based on hash tables. Moreover, the memory consumption is\nreduced by 68\\% compared to the hash tables-based mechanisms and 31\\% compared\nto the methods based on the Bloom filter.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:19:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mahmoudi","Arman",""],["Ahmadi","Mahmood",""]]}
{"id":"2308.02802","submitter":"Rudy Geelen","authors":"Rudy Geelen, Laura Balzano, Stephen Wright, Karen Willcox","title":"Learning physics-based reduced-order models from data using nonlinear\n  manifolds","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 method for learning reduced-order models of dynamical\nsystems using nonlinear manifolds. First, we learn the manifold by identifying\nnonlinear structure in the data through a general representation learning\nproblem. The proposed approach is driven by embeddings of low-order polynomial\nform. A projection onto the nonlinear manifold reveals the algebraic structure\nof the reduced-space system that governs the problem of interest. The matrix\noperators of the reduced-order model are then inferred from the data using\noperator inference. Numerical experiments on a number of nonlinear problems\ndemonstrate the generalizability of the methodology and the increase in\naccuracy that can be obtained over reduced-order modeling methods that employ a\nlinear subspace approximation.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:22:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Geelen","Rudy",""],["Balzano","Laura",""],["Wright","Stephen",""],["Willcox","Karen",""]]}
{"id":"2308.02803","submitter":"Fagui Li","authors":"Fagui Li and Junrong Yan","title":"A first eigenvalue estimate for embedded hypersurfaces in positive Ricci\n  curvature manifolds","comments":"10 pages, any comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Sigma^n$ be a compact, embedded, oriented hypersurface in a compact\noriented Riemannian manifold $N^{n+1}$ with the second fundamental form $h$.\nLet $H={\\rm tr}_{g_{\\Sigma}} h$ and $S=|h|^2$ be the mean curvature and squared\nlength of the second fundamental form $h$ of $\\Sigma$, respectively. If the\nRicci curvature of $N^{}$ is bounded from below by a positive constant $k>0$\nand the sectional curvature of $N^{}$ is bounded from above by a positive\nconstant $K>0$, then the first nonzero eigenvalue of the Laplacian on $\\Sigma$\nhas a lower bound\n  $$\\lambda_1(\\Sigma)\\geq\n  \\frac {k}{2}-\n  \\frac{H_{\\Sigma}}{2}\n  \\left(\n  nK+\\frac{2\\sqrt{S_{\\Sigma}K}}{\\arctan(\\sqrt{K})}+2n\\sqrt{S_{\\Sigma}}\n+\\frac{n}{n+1}H_{\\Sigma}\n  \\right).$$ where $H_{\\Sigma}=\\max_{\\Sigma}|H|$ and\n$S_{\\Sigma}=\\max_{\\Sigma}S$. It extends the result of Choi and Wang [J. Diff.\nGeom. \\textbf{18} (1983), 559--562.] to non-minimal case.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:28:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Fagui",""],["Yan","Junrong",""]]}
{"id":"2308.02804","submitter":"Wen Liang","authors":"Wen Liang, Youzhi Liang, Jianguo Jia","title":"MiAMix: Enhancing Image Classification through a Multi-stage Augmented\n  Mixed Sample Data Augmentation Method","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":"  Despite substantial progress in the field of deep learning, overfitting\npersists as a critical challenge, and data augmentation has emerged as a\nparticularly promising approach due to its capacity to enhance model\ngeneralization in various computer vision tasks. While various strategies have\nbeen proposed, Mixed Sample Data Augmentation (MSDA) has shown great potential\nfor enhancing model performance and generalization. We introduce a novel mixup\nmethod called MiAMix, which stands for Multi-stage Augmented Mixup. MiAMix\nintegrates image augmentation into the mixup framework, utilizes multiple\ndiversified mixing methods concurrently, and improves the mixing method by\nrandomly selecting mixing mask augmentation methods. Recent methods utilize\nsaliency information and the MiAMix is designed for computational efficiency as\nwell, reducing additional overhead and offering easy integration into existing\ntraining pipelines. We comprehensively evaluate MiaMix using four image\nbenchmarks and pitting it against current state-of-the-art mixed sample data\naugmentation techniques to demonstrate that MIAMix improves performance without\nheavy computational overhead.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:29:46 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 04:29:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liang","Wen",""],["Liang","Youzhi",""],["Jia","Jianguo",""]]}
{"id":"2308.02805","submitter":"Abdu Saif","authors":"Ziadoon K. Maseer, Robiah Yusof, Baidaa Al-Bander, Abdu Saif, Qusay\n  Kanaan Kadhim","title":"Meta-Analysis and Systematic Review for Anomaly Network Intrusion\n  Detection Systems: Detection Methods, Dataset, Validation Methodology, and\n  Challenges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Intrusion detection systems (IDSs) built on artificial intelligence (AI) are\npresented as latent mechanisms for actively detecting fresh attacks over a\ncomplex network. Although review papers are used the systematic review or\nsimple methods to analyse and criticize the anomaly NIDS works, the current\nreview uses a traditional way as a quantitative description to find current\ngaps by synthesizing and summarizing the data comparison without considering\nalgorithms performance. This paper presents a systematic and meta-analysis\nstudy of AI for network intrusion detection systems (NIDS) focusing on deep\nlearning (DL) and machine learning (ML) approaches in network security. Deep\nlearning algorithms are explained in their structure, and data intrusion\nnetwork is justified based on an infrastructure of networks and attack types.\nBy conducting a meta-analysis and debating the validation of the DL and ML\napproach by effectiveness, used dataset, detected attacks, classification task,\nand time complexity, we offer a thorough benchmarking assessment of the current\nNIDS-based publications-based systematic approach. The proposed method is\nconsidered reviewing works for the anomaly-based network intrusion detection\nsystem (anomaly-NIDS) models. Furthermore, the effectiveness of proposed\nalgorithms and selected datasets are discussed for the recent direction and\nimprovements of ML and DL to the NIDS. The future trends for improving an\nanomaly-IDS for continuing detection in the evolution of cyberattacks are\nhighlighted in several research studies.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:30:25 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 11:02:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Maseer","Ziadoon K.",""],["Yusof","Robiah",""],["Al-Bander","Baidaa",""],["Saif","Abdu",""],["Kadhim","Qusay Kanaan",""]]}
{"id":"2308.02806","submitter":"Irina Markina","authors":"Kenro Furutani and Irina Markina","title":"Invariant integral structures in pseudo $H$-type Lie algebras:\n  construction and classification","comments":"42 pages, 17 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pseudo $H$-type Lie algebras are a special class of 2-step nilpotent metric\nLie algebras, intimately related to Clifford algebras $\\Cl_{r,s}$. In this work\nwe propose the classification method for integral orthonormal structures of\npseudo $H$-type Lie algebras. We apply this method for the full classification\nof these structures for $r\\in\\{1,\\ldots,16\\}$, $s\\in \\{0,1\\}$ and irreducible\nClifford modules. The latter cases form the basis for the further extensions by\nmaking use of the Atiyah-Bott periodicity. The existence of integral structures\ngives rise to the integral discrete uniform subgroups of the pseudo $H$-type\nLie groups.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:34:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Furutani","Kenro",""],["Markina","Irina",""]]}
{"id":"2308.02807","submitter":"Sayan Goswami","authors":"Sayan Goswami, Sourav Kanti Patra, and Lorenzo Luperi Baglini","title":"Monochromatic exponential patterns in Ramsey theory","comments":"This is the first draft. We welcome all of your comments","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article we will study exponential Schur theorem and its extensions.\nWe obtained many new monochromatic mixed exponential structures. We will\nextensively study newly introduced exponential ultrafilters. We found that\nlarge class of ultrafilters are not exponential idempotent, which shows that\nexponentiation of Ellis theorem may not be possible\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:41:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Goswami","Sayan",""],["Patra","Sourav Kanti",""],["Baglini","Lorenzo Luperi",""]]}
{"id":"2308.02808","submitter":"Yu Seon Jeong","authors":"Yu Seon Jeong, Weidong Bai, Milind Diwan, Maria Vittoria Garzelli,\n  Karan Kumar and Mary Hall Reno","title":"Forward production of prompt neutrinos in the atmosphere and at\n  high-energy colliders","comments":"8 pages, 4 figures, a proceeding for 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":"  The atmospheric neutrino flux at very high energies is dominated by prompt\nneutrinos, mostly contributed by the decays of charmed hadrons produced in the\nforward direction by cosmic ray interactions with air nuclei. Theoretical\npredictions of the prompt atmospheric neutrino flux have large uncertainties\nmainly related to charm hadron production. Prompt neutrinos can also be studied\nthrough high-energy colliders. In particular, two ongoing forward experiments\nand the proposed Forward Physics Facility at the LHC can detect forward prompt\nneutrinos. We will present the kinematic regions relevant to the prompt\natmospheric neutrino flux in terms of collider kinematic variables, the\ncollision energy $\\sqrt{s}$ and the center-of-mass rapidity of charm hadrons\n$y$, and discuss implications of the forward experiments at the LHC on the\ntheoretical predictions of the prompt atmospheric neutrino flux.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:47:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jeong","Yu Seon",""],["Bai","Weidong",""],["Diwan","Milind",""],["Garzelli","Maria Vittoria",""],["Kumar","Karan",""],["Reno","Mary Hall",""]]}
{"id":"2308.02809","submitter":"Weichen Kong","authors":"Weichen Kong, Yanwei Dai, Yinghua Liu","title":"3D front tip fields in creeping solids under constraint effects: a\n  higher-order asymptotic solution","comments":"56 pages, 25 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As one of the most important topics studied in creep fracture mechanics,\nmechanics fields at three-dimensional (3D) sharp V-notches and crack tip have\ndrawn tremendous attentions. With many years efforts on constraint theory\ndeveloped in creeping solids, there still seems dense fog on how in-plane and\nout-of-plane constraint effects are interacted for 3D sharp V-notch and crack\nin creeping solids. To shed lights on this topic, a 3D higher-order termed\nsolution for sharp V-notches in creeping materials subjected to mode 1 loading\nis established by introducing the out-of-plane factor, which is the\nout-of-plane stress divided by the sum of in-plane normal stress. The solution\ncan naturally be degenerated to a 3D crack. Based on the 3D higher-order term\nsolution, a new fracture parameter is proposed and combined with to\ncharacterize 3D constraint effect. It is found that the stress exponents and\nangular distribution of higher-order term for 3D notches and cracks are highly\nrelated to . The proposed higher order termed solutions show better agreement\nwith the FEA results than the 3D leading-term and 2D two-term solutions,\nespecially for smaller notch angles and ligament width. Moreover, the presented\n3D constraint theory shows that effects of and are highly interlinked rather\nthan simply separated. It implies that the 3D constraint level may be\nsignificantly influenced by . The 3D mathematical solutions discussed in this\npaper could enhance the understanding of the 3D effect and has the potential to\nexplain the 3D constraint effect on the notches and cracks under creep\nconditions.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:54:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kong","Weichen",""],["Dai","Yanwei",""],["Liu","Yinghua",""]]}
{"id":"2308.02810","submitter":"Sibo Cheng","authors":"Sibo Cheng and Yike Guo and Rossella Arcucci","title":"A generative model for surrogates of spatial-temporal wildfire\n  nowcasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recent increase in wildfires worldwide has led to the need for real-time fire\nnowcasting. Physics-driven models, such as cellular automata and computational\nfluid dynamics can provide high-fidelity fire spread simulations but they are\ncomputationally expensive and time-consuming. Much effort has been put into\ndeveloping machine learning models for fire prediction. However, these models\nare often region-specific and require a substantial quantity of simulation data\nfor training purpose. This results in a significant amount of computational\neffort for different ecoregions. In this work, a generative model is proposed\nusing a three-dimensional Vector-Quantized Variational Autoencoders to generate\nspatial-temporal sequences of unseen wildfire burned areas in a given\necoregion. The model is tested in the ecoregion of a recent massive wildfire\nevent in California, known as the Chimney fire. Numerical results show that the\nmodel succeed in generating coherent and structured fire scenarios, taking into\naccount the impact from geophysical variables, such as vegetation and slope.\nGenerated data are also used to train a surrogate model for predicting wildfire\ndissemination, which has been tested on both simulation data and the real\nChimney fire event.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:54:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cheng","Sibo",""],["Guo","Yike",""],["Arcucci","Rossella",""]]}
{"id":"2308.02811","submitter":"Alessandro Pizzo","authors":"Simone Del Vecchio, J\\\"urg Fr\\\"ohlich, Alessandro Pizzo, Alessio\n  Ranallo","title":"Boundary effects and the stability of the low energy spectrum of the\n  AKLT model","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":"  By means of the local, iterative Lie Schwinger block-diagonalization method,\nin this paper we study the low-lying spectrum of the AKLT model perturbed by\nsmall, finite-range potentials and with open boundary conditions imposed at the\nedges of the chain. Our method allows us to control small interaction terms\nlocalized near the boundary of the chain that are responsible for the possible\nsplitting of the ground-state energy of the AKLT Hamiltonian into energy levels\nseparated by small gaps. This improves earlier results restricted to the\npersistence of the so called bulk gap.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 06:58:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Del Vecchio","Simone",""],["Fr\u00f6hlich","J\u00fcrg",""],["Pizzo","Alessandro",""],["Ranallo","Alessio",""]]}
{"id":"2308.02812","submitter":"Oliver Keszocze","authors":"Max Bartunik, Jens Kirchner, Oliver Keszocze","title":"Artificial Intelligence for Molecular Communication","comments":"The abstract was slightly altered compared to the journal version in\n  order to meet arXiv's requirements","journal-ref":null,"doi":"10.1515/itit-2023-0029","report-no":null,"categories":"cs.ET cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Molecular communication is a novel approach for data transmission between\nminiaturized devices, especially in contexts where electrical signals are to be\navoided. The communication is based on sending molecules (or other particles)\nat nano scale through channel instead sending electrons over a wire. Molecular\ncommunication devices have a large potential in medical applications as they\noffer an alternative to antenna-based transmission systems that may not be\napplicable due to size, temperature, or radiation constraints. The\ncommunication is achieved by transforming a digital signal into concentrations\nof molecules. These molecules are then detected at the other end of the\ncommunication channel and transformed back into a digital signal. Accurately\nmodeling the transmission channel is often not possible which may be due to a\nlack of data or time-varying parameters of the channel (e. g., the movements of\na person wearing a medical device). This makes demodulation of the signal very\ndifficult. Many approaches for demodulation have been discussed with one\nparticular approach having tremendous success: artificial neural networks.\nThese networks imitate the decision process in the human brain and are capable\nof reliably classifying noisy input data. Training such a network relies on a\nlarge set of training data. As molecular communication as a technology is still\nin its early development phase, this data is not always readily available. We\ndiscuss neural network-based demodulation approaches relying on synthetic data\nbased on theoretical channel models as well as works using actual measurements\nproduced by a prototype test bed. In this work, we give a general overview over\nthe field molecular communication, discuss the challenges in the demodulations\nprocess of transmitted signals, and present approaches to these challenges that\nare based on artificial neural networks.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 07:07:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bartunik","Max",""],["Kirchner","Jens",""],["Keszocze","Oliver",""]]}
{"id":"2308.02813","submitter":"Linfeng Tan","authors":"Linfeng Tan, Jiangtong Li, Li Niu and Liqing Zhang","title":"Deep Image Harmonization in Dual Color Spaces","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":"10.1145/3581783.3612404","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image harmonization is an essential step in image composition that adjusts\nthe appearance of composite foreground to address the inconsistency between\nforeground and background. Existing methods primarily operate in correlated\n$RGB$ color space, leading to entangled features and limited representation\nability. In contrast, decorrelated color space (e.g., $Lab$) has decorrelated\nchannels that provide disentangled color and illumination statistics. In this\npaper, we explore image harmonization in dual color spaces, which supplements\nentangled $RGB$ features with disentangled $L$, $a$, $b$ features to alleviate\nthe workload in harmonization process. The network comprises a $RGB$\nharmonization backbone, an $Lab$ encoding module, and an $Lab$ control module.\nThe backbone is a U-Net network translating composite image to harmonized\nimage. Three encoders in $Lab$ encoding module extract three control codes\nindependently from $L$, $a$, $b$ channels, which are used to manipulate the\ndecoder features in harmonization backbone via $Lab$ control module. Our code\nand model are available at\n\\href{https://github.com/bcmi/DucoNet-Image-Harmonization}{https://github.com/bcmi/DucoNet-Image-Harmonization}.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 07:21:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tan","Linfeng",""],["Li","Jiangtong",""],["Niu","Li",""],["Zhang","Liqing",""]]}
{"id":"2308.02814","submitter":"Robert Jacumet","authors":"Robert Jacumet, Christian Rathgeber, Vladislav Nenchev","title":"Analytical Safety Bounds for Trajectory Following Controllers in\n  Autonomous Vehicles","comments":"This work has been accepted to the 2023 9th International Conference\n  on Control, Decision and Information Technologies (CoDIT)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A major challenge in autonomous driving is designing control architectures\nthat guarantee safety in all relevant driving scenarios. Given a safe desired\nreference trajectory for the vehicle, a trajectory following controller has to\nensure that the trajectory is followed with a maximally allowed deviation, even\nin the presence of external disturbances, such as wind gusts or inclined roads.\nIn this paper, a method for computing upper bounds for linear, time invariant\nsingle-input-multiple-output systems with state feedback controllers and\nadditive bounded disturbances is proposed. The bounds for the offset between\nstates and the reference are derived analytically based on worst case\ndisturbance sequences. For systems with two states the bounds are strict, while\nfor higher order systems they are conservative. The method is applied to obtain\nposition bounds for lateral trajectory following controllers, and to analyze\nhow different choices of feedback parameters affect safety margins.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 07:27:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jacumet","Robert",""],["Rathgeber","Christian",""],["Nenchev","Vladislav",""]]}
{"id":"2308.02815","submitter":"Linmi Tao Prof","authors":"Linmi Tao, Ruiyang Liu, Yuanbiao Wang, Yuezhi Zhou, Li Huo, Guilan Hu,\n  Xiangsong Zhang, Zuo-Xiang He","title":"The changing rule of human bone density with aging based on a novel\n  definition and mensuration of bone density with computed tomography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Osteoporosis and fragility fractures have emerged as major public health\nconcerns in an aging population. However, measuring age-related changes in bone\ndensity using dual-energy X-ray absorptiometry has limited personalized risk\nassessment due to susceptibility to interference from various factors. In this\nstudy, we propose an innovative statistical model of bone pixel distribution in\nfine-segmented computed tomography (CT) images, along with a novel approach to\nmeasuring bone density based on CT values of bone pixels. Our findings indicate\nthat bone density exhibits a linear decline with age during adulthood between\nthe ages of 39 and 80, with the rate of decline being approximately 1.6 times\nfaster in women than in men. This contradicts the widely accepted notion that\nbone density starts declining in women at menopause and in men at around 50\nyears of age. The linearity of age-related changes provides further insights\ninto the dynamics of the aging human body. Consequently, our findings suggest\nthat the definition of osteoporosis by the World Health Organization should be\nrevised to the standard deviation of age-based bone density. Furthermore, these\nresults open up new avenues for research in bone health care and clinical\ninvestigation of osteoporosis.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:11:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tao","Linmi",""],["Liu","Ruiyang",""],["Wang","Yuanbiao",""],["Zhou","Yuezhi",""],["Huo","Li",""],["Hu","Guilan",""],["Zhang","Xiangsong",""],["He","Zuo-Xiang",""]]}
{"id":"2308.02816","submitter":"Hongwei Yao","authors":"Hongwei Yao, Jian Lou, Kui Ren and Zhan Qin","title":"PromptCARE: Prompt Copyright Protection by Watermark Injection and\n  Verification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) have witnessed a meteoric rise in popularity\namong the general public users over the past few months, facilitating diverse\ndownstream tasks with human-level accuracy and proficiency. Prompts play an\nessential role in this success, which efficiently adapt pre-trained LLMs to\ntask-specific applications by simply prepending a sequence of tokens to the\nquery texts. However, designing and selecting an optimal prompt can be both\nexpensive and demanding, leading to the emergence of Prompt-as-a-Service\nproviders who profit by providing well-designed prompts for authorized use.\nWith the growing popularity of prompts and their indispensable role in\nLLM-based services, there is an urgent need to protect the copyright of prompts\nagainst unauthorized use.\n  In this paper, we propose PromptCARE, the first framework for prompt\ncopyright protection through watermark injection and verification. Prompt\nwatermarking presents unique challenges that render existing watermarking\ntechniques developed for model and dataset copyright verification ineffective.\nPromptCARE overcomes these hurdles by proposing watermark injection and\nverification schemes tailor-made for prompts and NLP characteristics. Extensive\nexperiments on six well-known benchmark datasets, using three prevalent\npre-trained LLMs (BERT, RoBERTa, and Facebook OPT-1.3b), demonstrate the\neffectiveness, harmlessness, robustness, and stealthiness of PromptCARE.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:12:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yao","Hongwei",""],["Lou","Jian",""],["Ren","Kui",""],["Qin","Zhan",""]]}
{"id":"2308.02817","submitter":"Klas Markstr\\\"om","authors":"Alexander Karpov, Klas Markstr\\\"om, S{\\o}ren Riis, Bei Zhou","title":"Set-alternating schemes: A new class of large Condorcet domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce set-alternating schemes to construct Condorcet\ndomains. These schemes lead to domains which are copious, connected, and\npeak-pit. The resulting family of domains includes some of Arrow's\nsingle-peaked domains of size $2^{n-1}$, which we prove to be the smallest\npossible domains. Still, schemes of this type lead to domains larger than the\ndomains of Fishburn's alternating scheme. Thanks to the concise form of our\nschemes, we can analyze the growth of our fastest-growing domains. We show that\nthe domain size for sufficiently high $n$ exceeds $2.1973^n$, improving the\nprevious record $2.1890^n$ from \\cite{karpov2023constructing}. To perform this\nanalysis, a bijection between suborders and Dyck words, counted by the Catalan\nnumbers, is developed.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:21:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Karpov","Alexander",""],["Markstr\u00f6m","Klas",""],["Riis","S\u00f8ren",""],["Zhou","Bei",""]]}
{"id":"2308.02818","submitter":"Ze Liu","authors":"Weidong Yan, Xiang Gao, Wengen Ouyang, Ze Liu, Oded Hod, Michael\n  Urbakh","title":"Shape-dependent friction scaling laws in twisted layered material\n  interfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Static friction induced by moir\\'e superstructure in twisted incommensurate\nfinite layered material interfaces reveals unique double periodicity and lack\nof scaling with contact size. The underlying mechanism involves compensation of\nincomplete moir\\'e tiles at the rim of rigid polygonal graphene flakes sliding\natop fixed graphene or h-BN substrates. The scaling of friction (or lack\nthereof) with contact size is found to strongly depend on the shape of the\nslider and the relative orientation between its edges and the emerging\nsuperstructure, partially rationalizing scattered experimental data. With\ncareful consideration of the flake edge orientation, twist angle, and sliding\ndirection along the substrate, one should therefore be able to achieve\nlarge-scale superlubricity via shape tailoring.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:23:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yan","Weidong",""],["Gao","Xiang",""],["Ouyang","Wengen",""],["Liu","Ze",""],["Hod","Oded",""],["Urbakh","Michael",""]]}
{"id":"2308.02819","submitter":"Guo Chuan Thiang","authors":"Matthias Ludewig, Guo Chuan Thiang","title":"Quantization of conductance and the coarse cohomology of partitions","comments":"31 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.mes-hall math.KT math.MP math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate how integer quantization of Hall conductance arises from the\nlarge-scale geometry of the sample. Specifically, the Hall conductance is a\nhigher-trace pairing of the Fermi projection with a coarse cohomology class\ncoming from a partition of the geometric sample, whose integrality is proved.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:32:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ludewig","Matthias",""],["Thiang","Guo Chuan",""]]}
{"id":"2308.02820","submitter":"Chenyin Gong","authors":"Xianhua Peng, Chenyin Gong, Xue Dong He","title":"Reinforcement Learning for Financial Index Tracking","comments":"75 pages,15 figures, and 13 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose the first discrete-time infinite-horizon dynamic formulation of\nthe financial index tracking problem under both return-based tracking error and\nvalue-based tracking error. The formulation overcomes the limitations of\nexisting models by incorporating the intertemporal dynamics of market\ninformation variables not limited to prices, allowing exact calculation of\ntransaction costs, accounting for the tradeoff between overall tracking error\nand transaction costs, allowing effective use of data in a long time period,\netc. The formulation also allows novel decision variables of cash injection or\nwithdraw. We propose to solve the portfolio rebalancing equation using a Banach\nfixed point iteration, which allows to accurately calculate the transaction\ncosts specified as nonlinear functions of trading volumes in practice. We\npropose an extension of deep reinforcement learning (RL) method to solve the\ndynamic formulation. Our RL method resolves the issue of data limitation\nresulting from the availability of a single sample path of financial data by a\nnovel training scheme. A comprehensive empirical study based on a 17-year-long\ntesting set demonstrates that the proposed method outperforms a benchmark\nmethod in terms of tracking accuracy and has the potential for earning extra\nprofit through cash withdraw strategy.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:34:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Peng","Xianhua",""],["Gong","Chenyin",""],["He","Xue Dong",""]]}
{"id":"2308.02821","submitter":"Zheng Han","authors":"Siwen Zhao, Jinqiang Huang, Valentin Cr\\'epel, Xingguang Wu, Tongyao\n  Zhang, Hanwen Wang, Xiangyan Han, Zhengyu Li, Chuanying Xi, Senyang Pan,\n  Zhaosheng Wang, Kenji Watanabe, Takashi Taniguchi, Benjamin Sac\\'ep\\'e, Jing\n  Zhang, Ning Wang, Jianming Lu, Nicolas Regnault, Zheng Vitto Han","title":"Fractional quantum Hall effect in valley-layer locked Landau levels in\n  bilayer MoS$_{2}$","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semiconducting transition-metal dichalcogenides (TMDs) exhibit high mobility,\nstrong spin-orbit coupling, and large effective masses, which simultaneously\nleads to a rich wealth of Landau quantizations and inherently strong electronic\ninteractions. However, in spite of their extensively explored Landau levels\n(LL) structure, probing electron correlations in the fractionally filled LL\nregime has not been possible due to the difficulty of reaching the quantum\nlimit. Here, we report evidence for fractional quantum Hall (FQH) states at\nfilling fractions 4/5 and 2/5 in the lowest LL of bilayer MoS$_{2}$, manifested\nin fractionally quantized transverse conductance plateaus accompanied by\nlongitudinal resistance minima. We further show that the observed FQH states\nresult from and sensitively depend on the dielectric and gate screening of the\nCoulomb interactions. Our findings establish a new FQH experimental platform\nwhich are a scarce resource: it is tunable by Coulomb-screening engineering and\nas such, is the missing link between atomically thin graphene and\nsemiconducting quantum wells.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:44:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Siwen",""],["Huang","Jinqiang",""],["Cr\u00e9pel","Valentin",""],["Wu","Xingguang",""],["Zhang","Tongyao",""],["Wang","Hanwen",""],["Han","Xiangyan",""],["Li","Zhengyu",""],["Xi","Chuanying",""],["Pan","Senyang",""],["Wang","Zhaosheng",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Sac\u00e9p\u00e9","Benjamin",""],["Zhang","Jing",""],["Wang","Ning",""],["Lu","Jianming",""],["Regnault","Nicolas",""],["Han","Zheng Vitto",""]]}
{"id":"2308.02822","submitter":"Yaohui Xue","authors":"Rencai Lu, Yaohui Xue","title":"Classification of simple Harish-Chandra modules over the generalized\n  Witt algebras","comments":null,"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 classify simple Harish-Chandra modules over simple\ngeneralized Witt algebras.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:49:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lu","Rencai",""],["Xue","Yaohui",""]]}
{"id":"2308.02823","submitter":"Maizhen Ning","authors":"Maizhen Ning, Qiu-Feng Wang, Kaizhu Huang, Xiaowei Huang","title":"A Symbolic Character-Aware Model for Solving Geometry Problems","comments":"ACM MM 2023 Accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  AI has made significant progress in solving math problems, but geometry\nproblems remain challenging due to their reliance on both text and diagrams. In\nthe text description, symbolic characters such as \"$\\triangle$ABC\" often serve\nas a bridge to connect the corresponding diagram. However, by simply tokenizing\nsymbolic characters into individual letters (e.g., 'A', 'B' and 'C'), existing\nworks fail to study them explicitly and thus lose the semantic relationship\nwith the diagram. In this paper, we develop a symbolic character-aware model to\nfully explore the role of these characters in both text and diagram\nunderstanding and optimize the model under a multi-modal reasoning framework.\nIn the text encoder, we propose merging individual symbolic characters to form\none semantic unit along with geometric information from the corresponding\ndiagram. For the diagram encoder, we pre-train it under a multi-label\nclassification framework with the symbolic characters as labels. In addition,\nwe enhance the geometry diagram understanding ability via a self-supervised\nlearning method under the masked image modeling auxiliary task. By integrating\nthe proposed model into a general encoder-decoder pipeline for solving geometry\nproblems, we demonstrate its superiority on two benchmark datasets, including\nGeoQA and Geometry3K, with extensive experiments. Specifically, on GeoQA, the\nquestion-solving accuracy is increased from 60.0\\% to 64.1\\%, achieving a new\nstate-of-the-art accuracy; on Geometry3K, we reduce the question average\nsolving steps from 6.9 down to 6.0 with marginally higher solving accuracy.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:56:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ning","Maizhen",""],["Wang","Qiu-Feng",""],["Huang","Kaizhu",""],["Huang","Xiaowei",""]]}
{"id":"2308.02824","submitter":"Yao Meng","authors":"Yao Meng, Sean P. Cornelius, Yang-Yu Liu, Aming Li","title":"Doubly heterogeneous networks facilitate the emergence of collective\n  cooperation","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There is growing recognition that the network structures arising from\ninteractions between different entities in physical, social and biological\nsystems fundamentally alter the evolutionary outcomes. Previous paradigm\nexploring evolutionary game dynamics has assumed that individuals update their\nstrategies at an identical rate, reporting that structurally heterogeneous\nnetworks -- despite their ubiquity in real systems -- generally hinder the\nemergence of collective cooperation compared to their homogeneous counterparts.\nHere we solve this paradox by creating a new paradigm where individuals on\narbitrary networks are allowed to update strategies at arbitrary, personalized\nrates, and provide the precise condition under which universal collective\ncooperation is favored. We find that when individuals' update rates vary\ninversely with their number of connections, heterogeneous networks actually\noutperform homogeneous ones in promoting cooperation. This surprising property\nof such \"doubly heterogeneous\" networks cautions against the conventional\nwisdom that heterogeneous networks are antagonistic to cooperation. We further\ndevelop an efficient protocol for optimizing the promotion of cooperation by\ntuning individuals' update rates in any structure. Our findings highlight that\npersonalized interaction dynamics, beyond structure, in complex networks are\nfundamental to understanding and promoting collective cooperation.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:59:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Meng","Yao",""],["Cornelius","Sean P.",""],["Liu","Yang-Yu",""],["Li","Aming",""]]}
{"id":"2308.02825","submitter":"Sanchita Paul","authors":"Sandip Das, Sk Samim Islam, Ritam M Mitra and Sanchita Paul","title":"Burning a binary tree and its generalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph burning is a graph process that models the spread of social contagion.\nInitially, all the vertices of a graph G are unburnt. At each step, an unburnt\nvertex is put on fire and the fire from burnt vertices of the previous step\nspreads to their adjacent unburnt vertices. This process continues till all\nvertices are burnt. The burning number $b(G)$ of the graph $G$ is the minimum\nnumber of steps required to burn all the vertices in the graph. The burning\nnumber conjecture by Bonato et al. states that for a connected graph G of order\nn, its burning number $b(G) \\leq \\lceil \\sqrt{n} \\rceil$. It is easy to observe\nthat in order to burn a graph it is enough to burn its spanning tree. Hence it\nsuffices to prove that for any tree T of order n, its burning number $b(T) \\leq\n\\lceil \\sqrt{n} \\rceil$ where $T$ is the spanning tree of $G$. It was proved in\n2018 that $b(T) \\leq \\lceil \\sqrt{n + n_2 + 1/4} +1/2 \\rceil$ for a tree $T$\nwhere $n_2$ is the number of degree $2$ vertices in $T$. In this article, we\ngive an algorithm to burn a tree and we improve the existing bound using this\nalgorithm. We prove that $b(T)\\leq \\lceil \\sqrt{n + n_2 + 8}\\rceil -1$ which is\nan improved bound. Also, under certain restriction of degree $2$ vertices, we\nhave improved upon the result of Bonato et al.(in 2021). We also provide an\nalgorithm to burn a binary tree and prove the burning number conjecture for the\nsame.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:05:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Das","Sandip",""],["Islam","Sk Samim",""],["Mitra","Ritam M",""],["Paul","Sanchita",""]]}
{"id":"2308.02826","submitter":"Eugene M. Chudnovsky","authors":"Eugene M. Chudnovsky","title":"Dynamics of Skyrmion Contraction and Expansion in a Magnetic Film","comments":"Six pages, two figures, to appear in the journal of Low Temperature\n  Physics published by the B. Verkin Institute for Low Temperature Physics and\n  Engineering of the National Academy of Sciences of Ukraine","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Contraction and expansion of skyrmions in ferromagnetic films are\ninvestigated. In centrosymmetric systems, the dynamics of a collapsing skyrmion\nis driven by dissipation. The collapse time has a minimum on the damping\nconstant. In systems with broken inversion symmetry, the evolution of skyrmions\ntoward equilibrium size is driven by the Dzyaloshinskii-Moriya interaction.\nExpressions describing the time dependence of the skyrmion size are derived and\ntheir implications for skyrmion-based information processing are discussed.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:05:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chudnovsky","Eugene M.",""]]}
{"id":"2308.02827","submitter":"Tianxing Li","authors":"Tianxing Li, Rui Shi, Qing Zhu, Takashi Kanai","title":"SwinGar: Spectrum-Inspired Neural Dynamic Deformation for Free-Swinging\n  Garments","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":"  Our work presents a novel spectrum-inspired learning-based approach for\ngenerating clothing deformations with dynamic effects and personalized details.\nExisting methods in the field of clothing animation are limited to either\nstatic behavior or specific network models for individual garments, which\nhinders their applicability in real-world scenarios where diverse animated\ngarments are required. Our proposed method overcomes these limitations by\nproviding a unified framework that predicts dynamic behavior for different\ngarments with arbitrary topology and looseness, resulting in versatile and\nrealistic deformations. First, we observe that the problem of bias towards low\nfrequency always hampers supervised learning and leads to overly smooth\ndeformations. To address this issue, we introduce a frequency-control strategy\nfrom a spectral perspective that enhances the generation of high-frequency\ndetails of the deformation. In addition, to make the network highly\ngeneralizable and able to learn various clothing deformations effectively, we\npropose a spectral descriptor to achieve a generalized description of the\nglobal shape information. Building on the above strategies, we develop a\ndynamic clothing deformation estimator that integrates frequency-controllable\nattention mechanisms with long short-term memory. The estimator takes as input\nexpressive features from garments and human bodies, allowing it to\nautomatically output continuous deformations for diverse clothing types,\nindependent of mesh topology or vertex count. Finally, we present a neural\ncollision handling method to further enhance the realism of garments. Our\nexperimental results demonstrate the effectiveness of our approach on a variety\nof free-swinging garments and its superiority over state-of-the-art methods.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:09:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Tianxing",""],["Shi","Rui",""],["Zhu","Qing",""],["Kanai","Takashi",""]]}
{"id":"2308.02828","submitter":"Shuyin Ouyang","authors":"Shuyin Ouyang, Jie M. Zhang, Mark Harman, Meng Wang","title":"LLM is Like a Box of Chocolates: the Non-determinism of ChatGPT in Code\n  Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  There has been a recent explosion of research on Large Language Models (LLMs)\nfor software engineering tasks, in particular code generation. However, results\nfrom LLMs can be highly unstable; nondeterministically returning very different\ncodes for the same prompt. Non-determinism is a potential menace to scientific\nconclusion validity. When non-determinism is high, scientific conclusions\nsimply cannot be relied upon unless researchers change their behaviour to\ncontrol for it in their empirical analyses. This paper conducts an empirical\nstudy to demonstrate that non-determinism is, indeed, high, thereby underlining\nthe need for this behavioural change. We choose to study ChatGPT because it is\nalready highly prevalent in the code generation research literature. We report\nresults from a study of 829 code generation problems from three code generation\nbenchmarks (i.e., CodeContests, APPS, and HumanEval). Our results reveal high\ndegrees of non-determinism: the ratio of coding tasks with zero equal test\noutput across different requests is 72.73%, 60.40%, and 65.85% for\nCodeContests, APPS, and HumanEval, respectively. In addition, we find that\nsetting the temperature to 0 does not guarantee determinism in code generation,\nalthough it indeed brings less non-determinism than the default configuration\n(temperature=1). These results confirm that there is, currently, a significant\nthreat to scientific conclusion validity. In order to put LLM-based research on\nfirmer scientific foundations, researchers need to take into account\nnon-determinism in drawing their conclusions.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:30:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ouyang","Shuyin",""],["Zhang","Jie M.",""],["Harman","Mark",""],["Wang","Meng",""]]}
{"id":"2308.02829","submitter":"David Parker","authors":"David Parker","title":"Multi-Agent Verification and Control with Probabilistic Model Checking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Probabilistic model checking is a technique for formal automated reasoning\nabout software or hardware systems that operate in the context of uncertainty\nor stochasticity. It builds upon ideas and techniques from a diverse range of\nfields, from logic, automata and graph theory, to optimisation, numerical\nmethods and control. In recent years, probabilistic model checking has also\nbeen extended to integrate ideas from game theory, notably using models such as\nstochastic games and solution concepts such as equilibria, to formally verify\nthe interaction of multiple rational agents with distinct objectives. This\nprovides a means to reason flexibly about agents acting in either an\nadversarial or a collaborative fashion, and opens up opportunities to tackle\nnew problems within, for example, artificial intelligence, robotics and\nautonomous systems. In this paper, we summarise some of the advances in this\narea, and highlight applications for which they have already been used. We\ndiscuss how the strengths of probabilistic model checking apply, or have the\npotential to apply, to the multi-agent setting and outline some of the key\nchallenges required to make further progress in this field.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:31:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Parker","David",""]]}
{"id":"2308.02830","submitter":"Carsten Rott","authors":"Carsten Rott, Segev BenZvi, Mike DuVernois, Kenneth Golden, Benjamin\n  Jones, Christoph Toennis","title":"DISCO: An optical instrument to calibrate neutrino detection in complex\n  media","comments":"8 pages, 3 figures, Presented at the 38th International Cosmic Ray\n  Conference (ICRC2023)","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1139","categories":"astro-ph.IM hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a conceptual design of a high-performance camera system with\napplications to neutrino detectors, deep sea exploration, and glaciology. The\ndesign combines ultra-sensitive cameras with a number of well-calibrated light\nsources enclosed in a pressure vessel. The instrument will be capable of\nwithstanding extreme environments such as those encountered in Antarctica or\nthe deep ocean, and be deployable as a standalone system that can be retrieved\nfor deep-sea exploration or glaciology. The camera system is designed to be\nreplicated and deployed in multiple detectors, requiring only modest\nmodifications from one detector to another. The instrument combines a number of\ncapabilities essential for neutrino detector calibrations, including\ncharacterization of the scattering and absorption properties of the optical\nmedium, measurement of geometries via photogrammetry, and detector\nsurveillance. The ability to deploy the instrument at different detector sites\nalso offers opportunities for cross-calibration efforts. We present the\nconceptual design of the instrument and describe plans to produce a prototype.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:32:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rott","Carsten",""],["BenZvi","Segev",""],["DuVernois","Mike",""],["Golden","Kenneth",""],["Jones","Benjamin",""],["Toennis","Christoph",""]]}
{"id":"2308.02831","submitter":"Xingyu Lan","authors":"Xingyu Lan, Yanqiu Wu, Nan Cao","title":"Affective Visualization Design: Leveraging the Emotional Impact of Data","comments":"to appear at IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, more and more researchers have reflected on the\nundervaluation of emotion in data visualization and highlighted the importance\nof considering human emotion in visualization design. Meanwhile, an increasing\nnumber of studies have been conducted to explore emotion-related factors.\nHowever, so far, this research area is still in its early stages and faces a\nset of challenges, such as the unclear definition of key concepts, the\ninsufficient justification of why emotion is important in visualization design,\nand the lack of characterization of the design space of affective visualization\ndesign. To address these challenges, first, we conducted a literature review\nand identified three research lines that examined both emotion and data\nvisualization. We clarified the differences between these research lines and\nkept 109 papers that studied or discussed how data visualization communicates\nand influences emotion. Then, we coded the 109 papers in terms of how they\njustified the legitimacy of considering emotion in visualization design (i.e.,\nwhy emotion is important) and identified five argumentative perspectives. Based\non these papers, we also identified 61 projects that practiced affective\nvisualization design. We coded these design projects in three dimensions,\nincluding design fields (where), design tasks (what), and design methods (how),\nto explore the design space of affective visualization design.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:33:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lan","Xingyu",""],["Wu","Yanqiu",""],["Cao","Nan",""]]}
{"id":"2308.02832","submitter":"Wentao Cao","authors":"Wentao Cao, Qing Han, Feimin Huang, and Dehua Wang","title":"The isometric immersion of surfaces with finite total curvature","comments":"53 pages, 1 figure","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 study the smooth isometric immersion of a complete simply\nconnected surface with a negative Gauss curvature in the three-dimensional\nEuclidean space. For a surface with a finite total Gauss curvature and\nappropriate oscillations of the Gauss curvature, we prove the global existence\nof a smooth solution to the Gauss-Codazzi system and thus establish a global\nsmooth isometric immersion of the surface into the three-dimensional Euclidean\nspace. Based on a crucial observation that some linear combinations of the\nRiemann invariants decay faster than others, we reformulate the Gauss-Codazzi\nsystem as a symmetric hyperbolic system with a partial damping. Such a damping\neffect and an energy approach permit us to derive global decay estimates and\nmeanwhile control the non-integrable coefficients of nonlinear terms.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 09:54:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cao","Wentao",""],["Han","Qing",""],["Huang","Feimin",""],["Wang","Dehua",""]]}
{"id":"2308.02833","submitter":"Sai Suprabhanu Nallapaneni","authors":"Sai Suprabhanu Nallapaneni, Subrahmanyam Konakanchi","title":"A Comprehensive Analysis of Real-World Image Captioning and Scene\n  Identification","comments":"17 pages, 12 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Image captioning is a computer vision task that involves generating natural\nlanguage descriptions for images. This method has numerous applications in\nvarious domains, including image retrieval systems, medicine, and various\nindustries. However, while there has been significant research in image\ncaptioning, most studies have focused on high quality images or controlled\nenvironments, without exploring the challenges of real-world image captioning.\nReal-world image captioning involves complex and dynamic environments with\nnumerous points of attention, with images which are often very poor in quality,\nmaking it a challenging task, even for humans. This paper evaluates the\nperformance of various models that are built on top of different encoding\nmechanisms, language decoders and training procedures using a newly created\nreal-world dataset that consists of over 800+ images of over 65 different scene\nclasses, built using MIT Indoor scenes dataset. This dataset is captioned using\nthe IC3 approach that generates more descriptive captions by summarizing the\ndetails that are covered by standard image captioning models from unique\nview-points of the image.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:06:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nallapaneni","Sai Suprabhanu",""],["Konakanchi","Subrahmanyam",""]]}
{"id":"2308.02834","submitter":"Mohammad Goudarzi","authors":"Wuji Zhu, Mohammad Goudarzi, Rajkumar Buyya","title":"FLight: A Lightweight Federated Learning Framework in Edge and Fog\n  Computing","comments":"arXiv admin note: substantial text overlap with arXiv:2211.07238","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The number of Internet of Things (IoT) applications, especially\nlatency-sensitive ones, have been significantly increased. So, Cloud computing,\nas one of the main enablers of the IoT that offers centralized services, cannot\nsolely satisfy the requirements of IoT applications. Edge/Fog computing, as a\ndistributed computing paradigm, processes, and stores IoT data at the edge of\nthe network, offering low latency, reduced network traffic, and higher\nbandwidth. The Edge/Fog resources are often less powerful compared to Cloud,\nand IoT data is dispersed among many geo-distributed servers. Hence, Federated\nLearning (FL), which is a machine learning approach that enables multiple\ndistributed servers to collaborate on building models without exchanging the\nraw data, is well-suited to Edge/Fog computing environments, where data privacy\nis of paramount importance. Besides, to manage different FL tasks on Edge/Fog\ncomputing environments, a lightweight resource management framework is required\nto manage different incoming FL tasks while does not incur significant overhead\non the system. Accordingly, in this paper, we propose a lightweight FL\nframework, called FLight, to be deployed on a diverse range of devices, ranging\nfrom resource limited Edge/Fog devices to powerful Cloud servers. FLight is\nimplemented based on the FogBus2 framework, which is a containerized\ndistributed resource management framework. Moreover, FLight integrates both\nsynchronous and asynchronous models of FL. Besides, we propose a lightweight\nheuristic-based worker selection algorithm to select a suitable set of\navailable workers to participate in the training step to obtain higher training\ntime efficiency. The obtained results demonstrate the efficiency of the FLight.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:07:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhu","Wuji",""],["Goudarzi","Mohammad",""],["Buyya","Rajkumar",""]]}
{"id":"2308.02835","submitter":"Chathura Gamage","authors":"Chathura Gamage, Vimukthini Pinto, Matthew Stephenson, Jochen Renz","title":"Physics-Based Task Generation through Causal Sequence of Physical\n  Interactions","comments":"The 19th AAAI Conference on Artificial Intelligence and Interactive\n  Digital Entertainment (AIIDE-23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Performing tasks in a physical environment is a crucial yet challenging\nproblem for AI systems operating in the real world. Physics simulation-based\ntasks are often employed to facilitate research that addresses this challenge.\nIn this paper, first, we present a systematic approach for defining a physical\nscenario using a causal sequence of physical interactions between objects.\nThen, we propose a methodology for generating tasks in a physics-simulating\nenvironment using these defined scenarios as inputs. Our approach enables a\nbetter understanding of the granular mechanics required for solving\nphysics-based tasks, thereby facilitating accurate evaluation of AI systems'\nphysical reasoning capabilities. We demonstrate our proposed task generation\nmethodology using the physics-based puzzle game Angry Birds and evaluate the\ngenerated tasks using a range of metrics, including physical stability,\nsolvability using intended physical interactions, and accidental solvability\nusing unintended solutions. We believe that the tasks generated using our\nproposed methodology can facilitate a nuanced evaluation of physical reasoning\nagents, thus paving the way for the development of agents for more\nsophisticated real-world applications.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:15:18 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 16:51:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gamage","Chathura",""],["Pinto","Vimukthini",""],["Stephenson","Matthew",""],["Renz","Jochen",""]]}
{"id":"2308.02836","submitter":"Stefan Bamberger","authors":"Stefan Bamberger, Reinhard Heckel, Felix Krahmer","title":"Approximating Positive Homogeneous Functions with Scale Invariant Neural\n  Networks","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate to what extent it is possible to solve linear inverse problems\nwith $ReLu$ networks. Due to the scaling invariance arising from the linearity,\nan optimal reconstruction function $f$ for such a problem is positive\nhomogeneous, i.e., satisfies $f(\\lambda x) = \\lambda f(x)$ for all non-negative\n$\\lambda$. In a $ReLu$ network, this condition translates to considering\nnetworks without bias terms. We first consider recovery of sparse vectors from\nfew linear measurements. We prove that $ReLu$- networks with only one hidden\nlayer cannot even recover $1$-sparse vectors, not even approximately, and\nregardless of the width of the network. However, with two hidden layers,\napproximate recovery with arbitrary precision and arbitrary sparsity level $s$\nis possible in a stable way. We then extend our results to a wider class of\nrecovery problems including low-rank matrix recovery and phase retrieval.\nFurthermore, we also consider the approximation of general positive homogeneous\nfunctions with neural networks. Extending previous work, we establish new\nresults explaining under which conditions such functions can be approximated\nwith neural networks. Our results also shed some light on the seeming\ncontradiction between previous works showing that neural networks for inverse\nproblems typically have very large Lipschitz constants, but still perform very\nwell also for adversarial noise. Namely, the error bounds in our expressivity\nresults include a combination of a small constant term and a term that is\nlinear in the noise level, indicating that robustness issues may occur only for\nvery small noise levels.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:17:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bamberger","Stefan",""],["Heckel","Reinhard",""],["Krahmer","Felix",""]]}
{"id":"2308.02837","submitter":"Jes\\'us Casado-Pascual","authors":"Mar\\'ia Laura Olivera-Atencio, Lucas Lamata, and Jes\\'us\n  Casado-Pascual","title":"Benefits of Open Quantum Systems for Quantum Machine Learning","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum machine learning is a discipline that holds the promise of\nrevolutionizing data processing and problem-solving. However, dissipation and\nnoise arising from the coupling with the environment are commonly perceived as\nmajor obstacles to its practical exploitation, as they impact the coherence and\nperformance of the utilized quantum devices. Significant efforts have been\ndedicated to mitigate and control their negative effects on these devices. This\nPerspective takes a different approach, aiming to harness the potential of\nnoise and dissipation instead of combatting them. Surprisingly, it is shown\nthat these seemingly detrimental factors can provide substantial advantages in\nthe operation of quantum machine learning algorithms under certain\ncircumstances. Exploring and understanding the implications of adapting quantum\nmachine learning algorithms to open quantum systems opens up pathways for\ndevising strategies that effectively leverage noise and dissipation. The recent\nworks analyzed in this Perspective represent only initial steps towards\nuncovering other potential hidden benefits that dissipation and noise may\noffer. As exploration in this field continues, significant discoveries are\nanticipated that could reshape the future of quantum computing.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:18:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Olivera-Atencio","Mar\u00eda Laura",""],["Lamata","Lucas",""],["Casado-Pascual","Jes\u00fas",""]]}
{"id":"2308.02838","submitter":"Nihir Vedd","authors":"Nihir Vedd and Paul Riga","title":"feather -- a Python SDK to share and deploy models","comments":"Accepted to ICML 2023 Workshop AI&HCI. 8 pages, 3 figures and 1\n  figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At its core, feather was a tool that allowed model developers to build\nshareable user interfaces for their models in under 20 lines of code. Using the\nPython SDK, developers specified visual components that users would interact\nwith. (e.g. a FileUpload component to allow users to upload a file). Our\nservice then provided 1) a URL that allowed others to access and use the model\nvisually via a user interface; 2) an API endpoint to allow programmatic\nrequests to a model. In this paper, we discuss feather's motivations and the\nvalue we intended to offer AI researchers and developers. For example, the SDK\ncan support multi-step models and can be extended to run automatic evaluation\nagainst held out datasets. We additionally provide comprehensive technical and\nimplementation details.\n  N.B. feather is presently a dormant project. We have open sourced our code\nfor research purposes: https://github.com/feather-ai/\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:27:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vedd","Nihir",""],["Riga","Paul",""]]}
{"id":"2308.02839","submitter":"Volodymyr Mazorchuk","authors":"Volodymyr Mazorchuk","title":"The tale of Kostant's problem","comments":"Survey paper written for a conference proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a survey paper presenting the history and both old and new results\nrelated to Kostant's problem. This problem asks for which modules over a\nsemi-simple finite dimensional complex Lie algebra, the universal enveloping\nalgebra surjects onto the algebra of adjointly locally finite linear\nendomorphism.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:37:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mazorchuk","Volodymyr",""]]}
{"id":"2308.02840","submitter":"Yuxin Wang","authors":"Yuxin Wang, Wayne Wu, Dan Xu","title":"Learning Unified Decompositional and Compositional NeRF for Editable\n  Novel View Synthesis","comments":"ICCV2023, Project Page: https://w-ted.github.io/publications/udc-nerf","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Implicit neural representations have shown powerful capacity in modeling\nreal-world 3D scenes, offering superior performance in novel view synthesis. In\nthis paper, we target a more challenging scenario, i.e., joint scene novel view\nsynthesis and editing based on implicit neural scene representations.\nState-of-the-art methods in this direction typically consider building separate\nnetworks for these two tasks (i.e., view synthesis and editing). Thus, the\nmodeling of interactions and correlations between these two tasks is very\nlimited, which, however, is critical for learning high-quality scene\nrepresentations. To tackle this problem, in this paper, we propose a unified\nNeural Radiance Field (NeRF) framework to effectively perform joint scene\ndecomposition and composition for modeling real-world scenes. The decomposition\naims at learning disentangled 3D representations of different objects and the\nbackground, allowing for scene editing, while scene composition models an\nentire scene representation for novel view synthesis. Specifically, with a\ntwo-stage NeRF framework, we learn a coarse stage for predicting a global\nradiance field as guidance for point sampling, and in the second fine-grained\nstage, we perform scene decomposition by a novel one-hot object radiance field\nregularization module and a pseudo supervision via inpainting to handle\nambiguous background regions occluded by objects. The decomposed object-level\nradiance fields are further composed by using activations from the\ndecomposition module. Extensive quantitative and qualitative results show the\neffectiveness of our method for scene decomposition and composition,\noutperforming state-of-the-art methods for both novel-view synthesis and\nediting tasks.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:42:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Yuxin",""],["Wu","Wayne",""],["Xu","Dan",""]]}
{"id":"2308.02841","submitter":"Boris Kruglikov","authors":"Boris Kruglikov, Andrea Santi","title":"On 3-nondegenerate CR manifolds in dimension 7 (II): the intransitive\n  case","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.DG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate 3-nondegenerate CR structures in the lowest possible dimension\n7 and show that 8 is the maximal dimension for the Lie algebra of symmetries of\nsuch structures. The next possible symmetry dimension is 6, and for the\nautomorphism groups the dimension 7 is also realizable. This part (II) is\ndevoted to the case where the symmetry algebra acts intransitively. We use\nvarious methods to bound its dimension and demonstrate the existence of\ninfinitely many non-equivalent submaximally symmetric models. Summarizing, we\nget a stronger form of Beloshapka's conjecture on the symmetry dimension of\nhypersurfaces in $\\mathbb{C}^4$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:56:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kruglikov","Boris",""],["Santi","Andrea",""]]}
{"id":"2308.02842","submitter":"Woosik Kang","authors":"Woosik Kang and Carsten Rott (for the IceCube Collaboration)","title":"Search for the rare interactions of neutrinos from distant point sources\n  with IceCube Neutrino Telescope","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions","journal-ref":"PoS ICRC2023 (2023) 1380","doi":"10.22323/1.444.1380","report-no":"PoS-ICRC2023-1380","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent discovery and evidence of neutrino signals from distant sources,\nTXS 0506+056 and NGC 1068 respectively, provide opportunities to search for\nrare interactions of neutrinos that they might encounter on their paths. One\npotential scenario of interest is the interaction between neutrinos and dark\nmatter, which is invisible and expected to be abundantly spread over the\nUniverse. Various astrophysical observations have implied the existence of dark\nmatter. When high-energy neutrinos from extragalactic sources interact with\ndark matter during their propagation, their spectra might show suppressions at\nspecific energy ranges, where such interactions occur. These attenuation\nsignatures from the interaction might be measurable on Earth with large\nneutrino telescopes such as the IceCube Neutrino Observatory. This analysis is\nfocused on the search for rare interactions of high-energy neutrinos from the\nIceCube-identified astrophysical neutrino sources with dark matter in sub-GeV\nmasses and several benchmark mediator cases using the upgoing track-like\nevents. In this poster, sensitivity studies about the interaction of neutrinos\nand dark matter are presented.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 10:58:57 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 05:06:36 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kang","Woosik","","for the IceCube Collaboration"],["Rott","Carsten","","for the IceCube Collaboration"]]}
{"id":"2308.02843","submitter":"Valentina Lenarduzzi Ph.D.","authors":"Dario Amoroso d'Aragona and Xiaoxhou Li and Tomas Cerny and Andrea\n  Janes and Valentina Lenarduzzi and Davide Taibi","title":"One Microservice per Developer: Is This the Trend in OSS?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When developing and managing microservice systems, practitioners suggest that\neach microservice should be owned by a particular team. In effect, there is\nonly one team with the responsibility to manage a given service. Consequently,\none developer should belong to only one team. This practice of\n\"one-microservice-per-developer\" is especially prevalent in large projects with\nan extensive development team. Based on the bazaar-style software development\nmodel of Open Source Projects, in which different programmers, like vendors at\na bazaar, offer to help out developing different parts of the system, this\narticle investigates whether we can observe the\n\"one-microservice-per-developer\" behavior, a strategy we assume anticipated\nwithin microservice based Open Source Projects. We conducted an empirical study\namong 38 microservice-based OS projects. Our findings indicate that the\nstrategy is rarely respected by open-source developers except for projects that\nhave dedicated DevOps teams.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:08:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["d'Aragona","Dario Amoroso",""],["Li","Xiaoxhou",""],["Cerny","Tomas",""],["Janes","Andrea",""],["Lenarduzzi","Valentina",""],["Taibi","Davide",""]]}
{"id":"2308.02844","submitter":"Ying Zhang","authors":"Xinping Zhao, Ying Zhang, Qiang Xiao, Yuming Ren, Yingchun Yang","title":"Bootstrapping Contrastive Learning Enhanced Music Cold-Start Matching","comments":"Accepted by WWW'2023","journal-ref":"Companion Proceedings of the ACM Web Conference 2023, April 2023,\n  Pages 351-355","doi":"10.1145/3543873.3584626","report-no":null,"categories":"cs.IR cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a particular matching task we call Music Cold-Start Matching. In\nshort, given a cold-start song request, we expect to retrieve songs with\nsimilar audiences and then fastly push the cold-start song to the audiences of\nthe retrieved songs to warm up it. However, there are hardly any studies done\non this task. Therefore, in this paper, we will formalize the problem of Music\nCold-Start Matching detailedly and give a scheme. During the offline training,\nwe attempt to learn high-quality song representations based on song content\nfeatures. But, we find supervision signals typically follow power-law\ndistribution causing skewed representation learning. To address this issue, we\npropose a novel contrastive learning paradigm named Bootstrapping Contrastive\nLearning (BCL) to enhance the quality of learned representations by exerting\ncontrastive regularization. During the online serving, to locate the target\naudiences more accurately, we propose Clustering-based Audience Targeting (CAT)\nthat clusters audience representations to acquire a few cluster centroids and\nthen locate the target audiences by measuring the relevance between the\naudience representations and the cluster centroids. Extensive experiments on\nthe offline dataset and online system demonstrate the effectiveness and\nefficiency of our method. Currently, we have deployed it on NetEase Cloud\nMusic, affecting millions of users. Code will be released in the future.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:13:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Xinping",""],["Zhang","Ying",""],["Xiao","Qiang",""],["Ren","Yuming",""],["Yang","Yingchun",""]]}
{"id":"2308.02845","submitter":"Tianhang Liu","authors":"Tianhang Liu, Hechen Li, Long Bai, Yanan Wu, An Wang, Mobarakol Islam,\n  Hongliang Ren","title":"Landmark Detection using Transformer Toward Robot-assisted Nasal Airway\n  Intubation","comments":"ICBIR 2023 (Best Student Paper Award). Code availability:\n  https://github.com/ConorLTH/airway_intubation_landmarks_detection","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robot-assisted airway intubation application needs high accuracy in locating\ntargets and organs. Two vital landmarks, nostrils and glottis, can be detected\nduring the intubation to accommodate the stages of nasal intubation. Automated\nlandmark detection can provide accurate localization and quantitative\nevaluation. The Detection Transformer (DeTR) leads object detectors to a new\nparadigm with long-range dependence. However, current DeTR requires long\niterations to converge, and does not perform well in detecting small objects.\nThis paper proposes a transformer-based landmark detection solution with\ndeformable DeTR and the semantic-aligned-matching module for detecting\nlandmarks in robot-assisted intubation. The semantics aligner can effectively\nalign the semantics of object queries and image features in the same embedding\nspace using the most discriminative features. To evaluate the performance of\nour solution, we utilize a publicly accessible glottis dataset and\nautomatically annotate a nostril detection dataset. The experimental results\ndemonstrate our competitive performance in detection accuracy. Our code is\npublicly accessible.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:14:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Tianhang",""],["Li","Hechen",""],["Bai","Long",""],["Wu","Yanan",""],["Wang","An",""],["Islam","Mobarakol",""],["Ren","Hongliang",""]]}
{"id":"2308.02846","submitter":"Kaustav Chatterjee","authors":"Kaustav Chatterjee, Hariom Sharma, and Shailesh Kumar Tiwari","title":"A primitive normal pair in a finite field with prescribed traces and\n  norms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given ${\\mathbb{F}_{p^t}}$, a field with $p^t$ elements, where $p$ is a prime\npower, $t$ is a positive integer. Let $f(x)$ be a polynomial over\n$\\mathbb{F}_{p^t}$ of degree $m$ with some restrictions. In this paper, we\nconstruct a sufficient condition on $(p,t)$ which guarantees the existence of a\nprimitive normal pair $(\\epsilon,f(\\epsilon))$ such that\n$Tr_{\\mathbb{F}_{p^t}/\\mathbb{F}_p}(\\epsilon)=a$,\n$Tr_{\\mathbb{F}_{p^t}/\\mathbb{F}_p}(f(\\epsilon))=b$ and\n$N_{\\mathbb{F}_{p^t}/\\mathbb{F}_p}(\\epsilon)=c$,\n$N_{\\mathbb{F}_{p^t}/\\mathbb{F}_p}(f(\\epsilon))=d$ where $c,d\\in\\mathbb{F}_{p}$\nare primitive elements and $a,b\\in\\mathbb{F}_{p}^*$. Furthermore, we\ndemonstrate that, for $p=11^k;$ $k\\geq1,$ $m=8$ and $t\\geq 15$, there are only\n$4$ possible exceptions where such pairs may not exist.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:14:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chatterjee","Kaustav",""],["Sharma","Hariom",""],["Tiwari","Shailesh Kumar",""]]}
{"id":"2308.02847","submitter":"Guillaume Bossard","authors":"Guillaume Bossard and Adrien Loty","title":"Saturating unitarity bounds at U-duality symmetric points","comments":"50 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"CPHT-RR053.082023","categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has recently been shown that the leading Wilson coefficient in type II\nstring theory can take (almost) all values allowed by unitarity, crossing\nsymmetry and maximal supersymmetry in D=10 and D=9 dimensions. This suggests\nthat string theory might define the unique consistent quantum theory of gravity\nwith maximal supersymmetry. We study the minima of the leading Wilson\ncoefficient in D=6, 7 and 8 dimensions and find the global minimum at the point\nin moduli space with maximal symmetry. The minimum value turns out to always be\nnegative for D<8.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:19:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bossard","Guillaume",""],["Loty","Adrien",""]]}
{"id":"2308.02848","submitter":"Yunrong Luo","authors":"Xin Xie, Jiaxi Cui, Zhida Luo, Yuqiong Xie, Wenjuan Li, Wenhua Hai,\n  and Yunrong Luo","title":"Analytical results for a spin-orbit coupled atom held in a non-Hermitian\n  double well under synchronous combined modulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a simple method of synchronous combined modulations to generate\nthe exact analytic solutions for a spin-orbit (SO) coupled ultracold atom held\nin a non-Hermitian double-well potential. Based on the obtained analytical\nsolutions, we mainly study the parity-time ($\\mathcal{PT}$) symmetry of this\nsystem and the system stability for both balanced and unbalanced gain-loss\nbetween two wells. Under balanced gain and loss, the effect of the proportional\nconstants between synchronous combined modulations and the SO-coupling strength\non the $\\mathcal{PT}$-symmetry breaking is revealed analytically. Surprisingly,\nwe find when the Zeeman field is present, the stable spin-flipping tunneling\nbetween two wells can not occur in the non-Hermitian SO-coupled ultracold\natomic system, but the stable spin-conserving tunneling can be performed. Under\nunbalanced gain and loss, the unique set of parameter conditions that can cause\nthe system to stabilize is found. The results may provide a possibility for the\nexact control of $\\mathcal{PT}$-symmetry breaking and quantum spin dynamics in\na non-Hermitian SO-coupled system.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:23:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xie","Xin",""],["Cui","Jiaxi",""],["Luo","Zhida",""],["Xie","Yuqiong",""],["Li","Wenjuan",""],["Hai","Wenhua",""],["Luo","Yunrong",""]]}
{"id":"2308.02849","submitter":"Fernando Cruz S\\'aenz De Miera","authors":"F. Cruz-S\\'aenz de Miera, \\'A. K\\'osp\\'al, P. \\'Abrah\\'am, R. A. B.\n  Claes, C. F. Manara, J. Wendeborn, E. Fiorellino, T. Giannini, B. Nisini, A.\n  Sicilia-Aguilar, J. Campbell-White, J. M. Alcal\\'a, A. Banzatti, Zs. M.\n  Szab\\'o, F. Lykou, S. Antoniucci, J. Varga, M. Siwak, S. Park, Zs. Nagy, M.\n  Kun","title":"Brightness and mass accretion rate evolution during the 2022 burst of\n  EX~Lupi","comments":"18 pages, 12 figures, 4 tables. Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  EX Lupi is the prototype by which EXor-type outbursts were defined. It has\nexperienced multiple accretion-related bursts and outbursts throughout the last\ndecades, whose study have greatly extended our knowledge about the effects of\nthese types of events. This star experienced a new burst in 2022. We used\nmulti-band photometry to create color-color and color-magnitude diagrams to\nexclude the possibility that the brightening could be explained by a decrease\nin extinction. We obtained VLT/X-shooter spectra to determine the Lacc and Macc\nduring the peak of the burst and after its return to quiescence using 2\nmethods: empirical relationships between line luminosity and Lacc, and a slab\nmodel of the whole spectrum. We examined the 130 year light curve of EX Lupi to\nprovide statistics on the number of outbursts experienced during this period of\ntime. Our analysis of the data taken during the 2022 burst confirmed that a\nchange in extinction is not responsible for the brightening. Our two approaches\nin calculating the Macc were in agreement, and resulted in values that are 2\norders of magnitude above what had previously been estimated, thus suggesting\nthat EX Lupi is a strong accretor even when in quiescence. We determined that\nin 2022 March the Macc increased by a factor of 7 with respect to the quiescent\nlevel. We also found hints that even though the Macc had returned to almost its\npre-outburst levels, certain physical properties of the gas had not returned to\nthe quiescent values. We found that the mass accreted during this three month\nevent was 0.8 lunar masses, which is approximately half of what is accreted\nduring a year of quiescence. We calculated that if EX Lupi remains as active as\nit has been for the past 130 years, during which it has experienced at least 3\noutbursts and 10 bursts, then it will deplete the mass of its circumstellar\nmaterial in less than 160000 yr.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:34:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["de Miera","F. Cruz-S\u00e1enz",""],["K\u00f3sp\u00e1l","\u00c1.",""],["\u00c1brah\u00e1m","P.",""],["Claes","R. A. B.",""],["Manara","C. F.",""],["Wendeborn","J.",""],["Fiorellino","E.",""],["Giannini","T.",""],["Nisini","B.",""],["Sicilia-Aguilar","A.",""],["Campbell-White","J.",""],["Alcal\u00e1","J. M.",""],["Banzatti","A.",""],["Szab\u00f3","Zs. M.",""],["Lykou","F.",""],["Antoniucci","S.",""],["Varga","J.",""],["Siwak","M.",""],["Park","S.",""],["Nagy","Zs.",""],["Kun","M.",""]]}
{"id":"2308.02850","submitter":"Roman Konoplya","authors":"R. A. Konoplya","title":"Hawking radiation of renormalization group improved regular black holes","comments":"17 pages, 10 captioned 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 consider a renormalization group approach based on the idea that the\nprimary contribution to the Schwarzschild-like black hole spacetime arises from\nthe value of the gravitational coupling. The latter depends on the distance\nfrom the origin and approaches its classical value in the far zone. However, at\nsome stage, this approach introduces an arbitrariness in choosing an\nidentification parameter. There are three approaches to the identification: the\nmodified proper length (the Bonanno-Reuter metric), the Kretschmann scalar (the\nHayward metric), and an iterative, and, in a sense, coordinate-independent\nprocedure (Dymnikova solution). Using the WKB method, we calculated grey-body\nfactors for the Standard Model massless test fields and their corresponding\nenergy emission rates. For all of these solutions, we found that the intensity\nof Hawking radiation of massless fields is significantly suppressed by several\nor more orders once the quantum correction is taken into consideration. This\nindicates that the effect of suppression of the Hawking radiation may be\nappropriate to the quantum corrected black holes in asymptotically safe gravity\nin general and is independent on the particular choice of the identification\nparameter.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:35:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Konoplya","R. A.",""]]}
{"id":"2308.02851","submitter":"Jack Breen","authors":"Jack Breen, Kieran Zucker, Katie Allen, Nishant Ravikumar, Nicolas M.\n  Orsi","title":"Generative Adversarial Networks for Stain Normalisation in\n  Histopathology","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":"  The rapid growth of digital pathology in recent years has provided an ideal\nopportunity for the development of artificial intelligence-based tools to\nimprove the accuracy and efficiency of clinical diagnoses. One of the\nsignificant roadblocks to current research is the high level of visual\nvariability across digital pathology images, causing models to generalise\npoorly to unseen data. Stain normalisation aims to standardise the visual\nprofile of digital pathology images without changing the structural content of\nthe images. In this chapter, we explore different techniques which have been\nused for stain normalisation in digital pathology, with a focus on approaches\nwhich utilise generative adversarial networks (GANs). Typically, GAN-based\nmethods outperform non-generative approaches but at the cost of much greater\ncomputational requirements. However, it is not clear which method is best for\nstain normalisation in general, with different GAN and non-GAN approaches\noutperforming each other in different scenarios and according to different\nperformance metrics. This is an ongoing field of study as researchers aim to\nidentify a method which efficiently and effectively normalises pathology images\nto make AI models more robust and generalisable.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:38:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Breen","Jack",""],["Zucker","Kieran",""],["Allen","Katie",""],["Ravikumar","Nishant",""],["Orsi","Nicolas M.",""]]}
{"id":"2308.02852","submitter":"Pol Jan\\'e-Soneira","authors":"Pol Jan\\'e-Soneira, Albertus J. Malan, Ionela Prodan, S\\\"oren Hohmann","title":"Passivity-based economic ports for optimal operation of networked DC\n  microgrids","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":"  In this paper, we introduce the novel concept of economic ports, allowing\nmodular and distributed optimal operation of networked microgrids. Firstly, we\ndesign a novel price-based controller for optimal operation of a single\nmicrogrid and show asymptotic stability. Secondly, we define novel physical and\neconomic interconnection ports for the microgrid and study the dissipativity\nproperties of these ports. Lastly, we propose an interconnection scheme for\nmicrogrids via the economic ports. This interconnection scheme requires only an\nexchange of the local prices and allows a globally economic optimal operation\nof networked microgrids at steady state, while guaranteeing asymptotic\nstability of the networked microgrids via the passivity properties of economic\nports. The methods are demonstrated through various academic examples.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:44:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jan\u00e9-Soneira","Pol",""],["Malan","Albertus J.",""],["Prodan","Ionela",""],["Hohmann","S\u00f6ren",""]]}
{"id":"2308.02853","submitter":"Noriyuki Matsunaga","authors":"N. Matsunaga, D. Taniguchi, S. S. Elgueta, T. Tsujimoto, J. Baba, A.\n  McWilliam, S. Otsubo, Y. Sarugaku, T. Takeuchi, H. Katoh, S. Hamano, Y.\n  Ikeda, H. Kawakita, C. Hull, R. Albarracin, G. Bono, V. D'Orazi","title":"Metallicities of Classical Cepheids in the Inner Galactic Disk","comments":"Accepted for publication in ApJ. 10 pages, 2 figures, and 2 tables","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":"  Metallicity gradients refer to the sloped radial profile of metallicities of\ngas and stars and are commonly seen in disk galaxies. A well-defined\nmetallicity gradient of the Galactic disk is observed particularly well with\nclassical Cepheids, which are good stellar tracers thanks to their\nperiod-luminosity relation allowing precise distance estimation and other\nadvantages. However, the measurement of the inner-disk gradient has been\nimpeded by the incompleteness of previous samples of Cepheids and limitations\nof optical spectroscopy in observing highly reddened objects. Here we report\nthe metallicities of 16 Cepheids measured with high-resolution spectra in the\nnear-infrared YJ bands. These Cepheids are located at 3-5.6 kpc in the\nGalactocentric distance, R(GC), and reveal the metallicity gradient in this\nrange for the first time. Their metallicities are mostly between 0.1 and 0.3\ndex in [Fe/H] and more or less follow the extrapolation of the metallicity\ngradient found in the outer part, R(GC) larger than 6.5 kpc. The gradient in\nthe inner disk may be shallower or even flat, but the small sample does not\nallow to determine the slope precisely. More extensive spectroscopic\nobservations would also be necessary for studying minor populations, if any,\nwith higher or lower metallicities that were reported in previous literature.\nIn addition, three-dimensional velocities of our inner-disk Cepheids show the\nkinematic pattern that indicates non-circular orbits caused by the Galactic\nbar, which is consistent with the patterns reported in recent studies on\nhigh-mass star-forming regions and red giant branch stars.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:51:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Matsunaga","N.",""],["Taniguchi","D.",""],["Elgueta","S. S.",""],["Tsujimoto","T.",""],["Baba","J.",""],["McWilliam","A.",""],["Otsubo","S.",""],["Sarugaku","Y.",""],["Takeuchi","T.",""],["Katoh","H.",""],["Hamano","S.",""],["Ikeda","Y.",""],["Kawakita","H.",""],["Hull","C.",""],["Albarracin","R.",""],["Bono","G.",""],["D'Orazi","V.",""]]}
{"id":"2308.02854","submitter":"Dominik Beck","authors":"Dominik Beck","title":"Efron's Mean Volume Formula in Higher Dimensions","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 short paper, an older Efron's result is extended to obtain a cutting\nplane integral formula for the mean volume of a random simplex in any d\ndimensions.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:03:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Beck","Dominik",""]]}
{"id":"2308.02855","submitter":"Aravind Raji","authors":"Aravind Raji, Zhengang Dong, Victor Por\\'ee, Alaska Subedi, Xiaoyan\n  Li, Bernat Mundet, Lucia Varbaro, Claribel Dom\\'inguez, Marios Hadjimichael,\n  Bohan Feng, Alessandro Nicolaou, Jean-Pascal Rueff, Danfeng Li, Alexandre\n  Gloter","title":"Emergent electronic landscapes in a novel valence-ordered nickelate with\n  tri-component nickel coordination","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 metal-hydride-based topochemical reduction process has produced novel\nthermodynamically unstable phases across various transition metal oxide series\nwith unusual crystal structures and non-trivial ground states. Here, by such an\noxygen (de-) intercalation method we synthesis a novel samarium nickelate with\nordered nickel valences associated with tri-component coordination\nconfigurations. This structure, with a formula of Sm$_{9}$Ni$_{9}$O$_{22}$ as\nrevealed by four-dimensional scanning transmission electron microscopy, emerges\nfrom the intricate planes of {303}$_{\\text{pc}}$ ordered apical oxygen\nvacancies. X-ray spectroscopy measurements and ab-initio calculations show the\ncoexistence of square-planar, pyramidal and octahedral Ni sites with mono-, bi-\nand tri-valences. It leads to an intense orbital polarization, charge-ordering,\nand a ground state with a strong electron localization marked by the\ndisappearance of ligand-hole configuration at low-temperature. This new\nnickelate compound provides another example of previously inaccessible\nmaterials enabled by topotactic transformations and presents a unique platform\nwhere mixed Ni valence can give rise to exotic phenomena.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:05:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Raji","Aravind",""],["Dong","Zhengang",""],["Por\u00e9e","Victor",""],["Subedi","Alaska",""],["Li","Xiaoyan",""],["Mundet","Bernat",""],["Varbaro","Lucia",""],["Dom\u00ednguez","Claribel",""],["Hadjimichael","Marios",""],["Feng","Bohan",""],["Nicolaou","Alessandro",""],["Rueff","Jean-Pascal",""],["Li","Danfeng",""],["Gloter","Alexandre",""]]}
{"id":"2308.02856","submitter":"Hong Jie Ng","authors":"Hong Jie Ng, Wen Yu Kon, Ignatius William Primaatmaja, Chao Wang,\n  Charles Lim","title":"Sampled sub-block hashing for large input randomness extraction","comments":"15 pages, 8 figures. All comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Randomness extraction is an essential post-processing step in practical\nquantum cryptography systems. When statistical fluctuations are taken into\nconsideration, the requirement of large input data size could heavily penalise\nthe speed and resource consumption of the randomness extraction process,\nthereby limiting the overall system performance. In this work, we propose a\nsampled sub-block hashing approach to circumvent this problem by randomly\ndividing the large input block into multiple sub-blocks and processing them\nindividually. Through simulations and experiments, we demonstrate that our\nmethod achieves an order-of-magnitude improvement in system throughput while\nkeeping the resource utilisation low. Furthermore, our proposed approach is\napplicable to a generic class of quantum cryptographic protocols that satisfy\nthe generalised entropy accumulation framework, presenting a highly promising\nand general solution for high-speed post-processing in quantum cryptographic\napplications such as quantum key distribution and quantum random number\ngeneration.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:09:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ng","Hong Jie",""],["Kon","Wen Yu",""],["Primaatmaja","Ignatius William",""],["Wang","Chao",""],["Lim","Charles",""]]}
{"id":"2308.02857","submitter":"Premashis Kumar","authors":"Premashis Kumar and Gautam Gangopadhyay","title":"Nonequilibrium thermodynamic signatures of collective dynamical states\n  around chimera in a chemical reaction network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech nlin.CD nlin.PS physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Different dynamical states ranging from coherent, incoherent to chimera,\nmultichimera, and related transitions are addressed in a globally coupled\nnonlinear continuum chemical oscillator system by implementing a modified\ncomplex Ginzburg-Landau equation. Besides dynamical identifications of observed\nstates using standard qualitative metrics, we systematically acquire\nnonequilibrium thermodynamic characterizations of these states obtained via\ncoupling parameters. The nonconservative work profiles in collective dynamics\nqualitatively reflect the time-integrated concentration of the activator, and\nthe majority of the nonconservative work contributes to the entropy production\nover the spatial dimension. It is illustrated that the evolution of spatial\nentropy production and semigrand Gibbs free energy profiles associated with\neach state are connected yet completely out of phase, and these thermodynamic\nsignatures are extensively elaborated to shed light on the exclusiveness and\nsimilarities of these states. Moreover, a relationship between the proper\nnonequilibrium thermodynamic potential and the variance of activator\nconcentration is established by exhibiting both quantitative and qualitative\nsimilarities between a Fano factor-like entity, derived from the activator\nconcentration, and the Kullback-Leibler divergence associated with the\ntransition from a nonequilibrium homogeneous state to an inhomogeneous state.\nQuantifying the thermodynamic costs for collective dynamical states would aid\nin efficiently controlling, manipulating, and sustaining such states to explore\nthe real-world relevance and applications of these states.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:16:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kumar","Premashis",""],["Gangopadhyay","Gautam",""]]}
{"id":"2308.02858","submitter":"Daniel Shy","authors":"Daniel Shy, David Goodman, Ryan Parsons, Michael Streicher, Willy\n  Kaye, Lee Mitchell, Zhong He, and Bernard Phlips","title":"Radiation Damage of $2 \\times 2 \\times 1 \\ \\mathrm{cm}^3$ Pixelated\n  CdZnTe Due to High-Energy Protons","comments":null,"journal-ref":null,"doi":"10.1016/j.nima.2023.168622","report-no":null,"categories":"physics.ins-det astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pixelated CdZnTe detectors are a promising imaging-spectrometer for gamma-ray\nastrophysics due to their combination of relatively high energy resolution with\nroom temperature operation negating the need for cryogenic cooling. This\nreduces the size, weight, and power requirements for telescope-based radiation\ndetectors. Nevertheless, operating CdZnTe in orbit will expose it to the harsh\nradiation environment of space. This work, therefore, studies the effects of\n$61 \\ \\mathrm{MeV}$ protons on $2 \\times 2 \\times 1 \\ \\mathrm{cm}^3$ pixelated\nCdZnTe and quantifies proton-induced radiation damage of fluences up to $2.6\n\\times 10^8 \\ \\mathrm{p/cm^2}$. In addition, we studied the effects of\nirradiation on two separate instruments: one was biased and operational during\nirradiation while the other remained unbiased. Following final irradiation, the\n$662 \\ \\mathrm{keV}$ centroid and nominal $1\\%$ resolution of the detectors\nwere degraded to $642.7 \\ \\mathrm{keV}, 4.9 \\% \\ ( \\mathrm{FWHM})$ and $653.8 \\\n\\mathrm{keV}, 1.75 \\% \\ (\\mathrm{FWHM})$ for the biased and unbiased systems\nrespectively. We therefore observe a possible bias dependency on proton-induced\nradiation damage in CdZnTe. This work also reports on the resulting activation\nand recovery of the instrument following room temperature and\n$60^{\\circ}\\mathrm{C}$ annealing.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:19:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shy","Daniel",""],["Goodman","David",""],["Parsons","Ryan",""],["Streicher","Michael",""],["Kaye","Willy",""],["Mitchell","Lee",""],["He","Zhong",""],["Phlips","Bernard",""]]}
{"id":"2308.02859","submitter":"Jaeho Shin","authors":"Jaeho Shin","title":"The Circuit-Cocircuit Intersection Conjecture for Intersection Size\n  $\\le7$","comments":"5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A circuit-cocircuit intersection, or a CCI for short, of a matroid is the\nintersection of a circuit and a cocircuit. Oxley conjectured (1992) that a\nmatroid with a CCI of size $k\\ge4$ has a CCI of size $k-2$. We show that the\nconjecture holds for $k\\le7$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:20:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shin","Jaeho",""]]}
{"id":"2308.02860","submitter":"Jiarui Jin","authors":"Jiarui Jin, Xianyu Chen, Weinan Zhang, Mengyue Yang, Yang Wang, Yali\n  Du, Yong Yu, Jun Wang","title":"Replace Scoring with Arrangement: A Contextual Set-to-Arrangement\n  Framework for Learning-to-Rank","comments":"CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Learning-to-rank is a core technique in the top-N recommendation task, where\nan ideal ranker would be a mapping from an item set to an arrangement (a.k.a.\npermutation). Most existing solutions fall in the paradigm of probabilistic\nranking principle (PRP), i.e., first score each item in the candidate set and\nthen perform a sort operation to generate the top ranking list. However, these\napproaches neglect the contextual dependence among candidate items during\nindividual scoring, and the sort operation is non-differentiable. To bypass the\nabove issues, we propose Set-To-Arrangement Ranking (STARank), a new framework\ndirectly generates the permutations of the candidate items without the need for\nindividually scoring and sort operations; and is end-to-end differentiable. As\na result, STARank can operate when only the ground-truth permutations are\naccessible without requiring access to the ground-truth relevance scores for\nitems. For this purpose, STARank first reads the candidate items in the context\nof the user browsing history, whose representations are fed into a\nPlackett-Luce module to arrange the given items into a list. To effectively\nutilize the given ground-truth permutations for supervising STARank, we\nleverage the internal consistency property of Plackett-Luce models to derive a\ncomputationally efficient list-wise loss. Experimental comparisons against 9\nthe state-of-the-art methods on 2 learning-to-rank benchmark datasets and 3\ntop-N real-world recommendation datasets demonstrate the superiority of STARank\nin terms of conventional ranking metrics. Notice that these ranking metrics do\nnot consider the effects of the contextual dependence among the items in the\nlist, we design a new family of simulation-based ranking metrics, where\nexisting metrics can be regarded as special cases. STARank can consistently\nachieve better performance in terms of PBM and UBM simulation-based metrics.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:22:26 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 07:59:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jin","Jiarui",""],["Chen","Xianyu",""],["Zhang","Weinan",""],["Yang","Mengyue",""],["Wang","Yang",""],["Du","Yali",""],["Yu","Yong",""],["Wang","Jun",""]]}
{"id":"2308.02861","submitter":"Giuseppe Negro","authors":"Giuseppe Negro Massimiliano Semeraro Perter R Cook Davide Marenduzzo","title":"A unified-field theory of genome organization and gene regulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our aim is to predict how often genic and non-genic promoters fire within a\ncell. We first review a parsimonious pan-genomic model for genome organization\nand gene regulation, where transcription rate is determined by proximity in 3D\nspace of promoters to clusters containing appropriate factors and RNA\npolymerases -- structures variously called transcription factories, hubs, and\ncondensates. This model allows reconciliation of conflicting results indicating\nthat regulatory mammalian networks are both simple (as over-expressing just 4\ntranscription factors switches cell state) and complex (as genome-wide\nassociation studies show phenotypes like cell type are determined by thousands\nof loci rarely encoding such factors). It also yields simple explanations of\nhow mysterious motifs like quantitative trait loci, enhancers, and silencers\nwork. We then present 3D polymer simulations, and a proximity formula based on\nour biological model that enables prediction of transcriptional activities of\nall promoters in three human cell types. This simple fitting-free formula\ncontains just one variable (distance on the genetic map to the nearest active\npromoter), and we suggest it can be applied to any organism.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:24:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Marenduzzo","Giuseppe Negro Massimiliano Semeraro Perter R Cook Davide",""]]}
{"id":"2308.02862","submitter":"Hongchen Wei","authors":"Hongchen Wei, Zhenzhong Chen","title":"Improving Generalization of Image Captioning with Unsupervised Prompt\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pretrained visual-language models have demonstrated impressive zero-shot\nabilities in image captioning, when accompanied by hand-crafted prompts.\nMeanwhile, hand-crafted prompts utilize human prior knowledge to guide the\nmodel. However, due to the diversity between different domains, such\nhand-crafted prompt that provide invariant prior knowledge may result in mode\ncollapse for some domains. Some researches attempted to incorporate expert\nknowledge and instruction datasets, but the results were costly and led to\nhallucinations. In this paper, we propose an unsupervised prompt learning\nmethod to improve Generalization of Image Captioning (GeneIC), which learns a\ndomain-specific prompt vector for the target domain without requiring annotated\ndata. GeneIC aligns visual and language modalities with a pre-trained\nContrastive Language-Image Pre-Training (CLIP) model, thus optimizing the\ndomain-specific prompt vector from two aspects: attribute and semantic\nconsistency. Specifically, GeneIC first generates attribute-transferred images\nwith differing attributes, while retaining semantic similarity with original\nimages. Then, GeneIC uses CLIP to measure the similarity between the images and\nthe generated sentences. By exploring the variable and invariant features in\nthe original images and attribute-transferred images, attribute consistency\nconstrains the attribute change direction of both images and sentences to learn\ndomain-specific knowledge. The semantic consistency directly measures the\nsimilarity between the generated sentences and images to ensure the accuracy\nand comprehensiveness of the generated sentences. Consequently, GeneIC only\noptimizes the prompt vectors, which effectively retains the knowledge in the\nlarge model and introduces domain-specific knowledge.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:27:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wei","Hongchen",""],["Chen","Zhenzhong",""]]}
{"id":"2308.02863","submitter":"Sergey Zagorodnyuk","authors":"Sergey M. Zagorodnyuk","title":"On some hypergeometric Sobolev orthogonal polynomials with several\n  continuous parameters","comments":"19 pages","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 study the following hypergeometric polynomials:\n$\\mathcal{P}_n(x) =\n\\mathcal{P}_n(x;\\alpha,\\beta,\\delta_1,\\dots,\\delta_\\rho,\\kappa_1,\\dots,\\kappa_\\rho)\n= {}_{\\rho+2} F_{\\rho+1}\n(-n,n+\\alpha+\\beta+1,\\delta_1+1,\\dots,\\delta_\\rho+1;\\alpha+1,\\kappa_1+\\delta_1+1,\\dots,\\kappa_\\rho+\\delta_\\rho+1;x)$,\nand $\\mathcal{L}_n(x) =\n\\mathcal{L}_n(x;\\alpha,\\delta_1,\\dots,\\delta_\\rho,\\kappa_1,\\dots,\\kappa_\\rho) =\n{}_{\\rho+1} F_{\\rho+1}\n(-n,\\delta_1+1,\\dots,\\delta_\\rho+1;\\alpha+1,\\kappa_1+\\delta_1+1,\\dots,\\kappa_\\rho+\\delta_\\rho+1;x)$,\n$n\\in\\mathbb{Z}_+$, where\n$\\alpha,\\beta,\\delta_1,\\dots,\\delta_\\rho\\in(-1,+\\infty)$, and\n$\\kappa_1,\\dots,\\kappa_\\rho\\in\\mathbb{Z}_+$, are some parameters. The natural\nnumber $\\rho$ of the continuous parameters $\\delta_1,\\dots,\\delta_\\rho$ can be\nchosen arbitrarily large. It is seen that the special case\n$\\kappa_1=\\dots=\\kappa_\\rho=0$ leads to Jacobi and Laguerre orthogonal\npolynomials. In general, it is shown that polynomials $\\mathcal{P}_n(x)$ and\n$\\mathcal{L}_n(x)$ are Sobolev orthogonal polynomials on the real line with\nsome explicit matrix measures. We study integral representations, differential\nequations and generating functions for these polynomials. Recurrence relations\nand properties of their zeros are discussed as well.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:28:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zagorodnyuk","Sergey M.",""]]}
{"id":"2308.02864","submitter":"Vinod Bhardwaj Dr.","authors":"Vinod Kumar Bhardwaj","title":"Observation constraints on scalar field cosmological model in\n  Anisotropic universe","comments":"18 Pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this study, we have explored a scalar field cosmological model in the\naxially symmetric Bianchi type-I universe. In this study, our aim is to\nconstrain the scalar field dark energy model in an anisotropic background. For\nthis purpose, the explicit solution of the developed field equations for the\nmodel is determined and analysed. Constraints on the cosmological model\nparameters are established utilizing Markov Chain Monte Carlo (MCMC) analysis\nand using the latest observational data sets of OHD, BAO, and Pantheon. For the\ncombined dataset (OHD, BAO, and Pantheon), the best-fit values of Hubble and\ndensity parameters are estimated as $ H_{0} = 71.54\\pm 0.28$,\n$\\Omega_{m0}=0.2622\\pm0.0021$ $\\Omega_{\\phi0} = 0.7331\\pm0.0046$, and\n$\\Omega_{\\sigma 0} = 0.000162\\pm0.000063$. The model shows a flipping nature\nand redshift transition occurs at $z_{t} = 0.6964^{+0.0136}_{-0.0006}$, and the\npresent value of decelerated parameter is computed to be $q_{0} =\n-0.6964\\pm0.028$ for the combined dataset. We have explored characteristics\nlike the universe's age, particle horizon, deceleration parameter, and jerk\nparameter. The dynamical properties such as energy density $\\rho_{\\phi}$,\nscalar field pressure $p_{\\phi}$, and equation of state parameter\n$\\omega_{\\phi}$ are analyzed and presented. We have also described the behavior\nof the scalar potential $V(\\phi)$ and scalar fields. Furthermore, the authors\nalso described the behavior of energy conditions in scalar-tensor cosmology.\nThe scenario of the present accelerated expansion of the universe is described\nby the contribution of the scalar field.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:29:36 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:59:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bhardwaj","Vinod Kumar",""]]}
{"id":"2308.02865","submitter":"Alfred Schreiber","authors":"Alfred Schreiber","title":"On the power series of involutory functions","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that the coefficients of any involutory function\n$f~(\\neq\\text{identity})$ represented as a power series can be expressed in\nterms of multivariable Lah polynomials. This result is based on the fact that\nany such $f$ can be regarded as a (compositional) conjugate of negative\nidentity. Moreover, a constructive proof of this statement is given.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:31:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Schreiber","Alfred",""]]}
{"id":"2308.02866","submitter":"Jianfeng Wang","authors":"Jianfeng Wang, Daniela Massiceti, Xiaolin Hu, Vladimir Pavlovic,\n  Thomas Lukasiewicz","title":"NP-SemiSeg: When Neural Processes meet Semi-Supervised Semantic\n  Segmentation","comments":"Appear at ICML2023. Source codes are available at:\n  https://github.com/Jianf-Wang/NP-SemiSeg","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semi-supervised semantic segmentation involves assigning pixel-wise labels to\nunlabeled images at training time. This is useful in a wide range of real-world\napplications where collecting pixel-wise labels is not feasible in time or\ncost. Current approaches to semi-supervised semantic segmentation work by\npredicting pseudo-labels for each pixel from a class-wise probability\ndistribution output by a model. If the predicted probability distribution is\nincorrect, however, this leads to poor segmentation results, which can have\nknock-on consequences in safety critical systems, like medical images or\nself-driving cars. It is, therefore, important to understand what a model does\nnot know, which is mainly achieved by uncertainty quantification. Recently,\nneural processes (NPs) have been explored in semi-supervised image\nclassification, and they have been a computationally efficient and effective\nmethod for uncertainty quantification. In this work, we move one step forward\nby adapting NPs to semi-supervised semantic segmentation, resulting in a new\nmodel called NP-SemiSeg. We experimentally evaluated NP-SemiSeg on the public\nbenchmarks PASCAL VOC 2012 and Cityscapes, with different training settings,\nand the results verify its effectiveness.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:42:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Jianfeng",""],["Massiceti","Daniela",""],["Hu","Xiaolin",""],["Pavlovic","Vladimir",""],["Lukasiewicz","Thomas",""]]}
{"id":"2308.02867","submitter":"Yuning Wu","authors":"Yuning Wu, Yifeng Yu, Jiatong Shi, Tao Qian, Qin Jin","title":"A Systematic Exploration of Joint-training for Singing Voice Synthesis","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":"  There has been a growing interest in using end-to-end acoustic models for\nsinging voice synthesis (SVS). Typically, these models require an additional\nvocoder to transform the generated acoustic features into the final waveform.\nHowever, since the acoustic model and the vocoder are not jointly optimized, a\ngap can exist between the two models, leading to suboptimal performance.\nAlthough a similar problem has been addressed in the TTS systems by\njoint-training or by replacing acoustic features with a latent representation,\nadopting corresponding approaches to SVS is not an easy task. How to improve\nthe joint-training of SVS systems has not been well explored. In this paper, we\nconduct a systematic investigation of how to better perform a joint-training of\nan acoustic model and a vocoder for SVS. We carry out extensive experiments and\ndemonstrate that our joint-training strategy outperforms baselines, achieving\nmore stable performance across different datasets while also increasing the\ninterpretability of the entire framework.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:42:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Yuning",""],["Yu","Yifeng",""],["Shi","Jiatong",""],["Qian","Tao",""],["Jin","Qin",""]]}
{"id":"2308.02868","submitter":"Hui-Huang Chen","authors":"Hui-Huang Chen, Zun-Xian Huang","title":"Dynamics of charge imbalance resolved negativity after a local joining\n  quench","comments":"22 pages,8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider the dynamics of charge imbalance resolved\nnegativity after a local joining quench in the $1+1$ dimensional free complex\nboson CFT. In the first part, we study the local joining quench by applying\nconformal maps, obtaining analytical universal results. We first calculate the\nquench dynamics of charged logarithmic negativity. Then using the Fourier\ntransformation, we obtain the charge imbalance resolved negativity. The total\nnegativity can be recovered from the charged imbalance resolved ones. In the\nsecond part, we test our CFT predictions against the underlying lattice model\nnumerically. Finally, we explain our results based on the quasi-particle\npicture.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:43:51 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 04:35:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Hui-Huang",""],["Huang","Zun-Xian",""]]}
{"id":"2308.02869","submitter":"Yanan Wu","authors":"Hechen Li, Yanan Wu, Long Bai, An Wang, Tong Chen, Hongliang Ren","title":"Semi-supervised Learning for Segmentation of Bleeding Regions in Video\n  Capsule Endoscopy","comments":"ICBIR 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 the realm of modern diagnostic technology, video capsule endoscopy (VCE)\nis a standout for its high efficacy and non-invasive nature in diagnosing\nvarious gastrointestinal (GI) conditions, including obscure bleeding.\nImportantly, for the successful diagnosis and treatment of these conditions,\naccurate recognition of bleeding regions in VCE images is crucial. While deep\nlearning-based methods have emerged as powerful tools for the automated\nanalysis of VCE images, they often demand large training datasets with\ncomprehensive annotations. Acquiring these labeled datasets tends to be\ntime-consuming, costly, and requires significant domain expertise. To mitigate\nthis issue, we have embraced a semi-supervised learning (SSL) approach for the\nbleeding regions segmentation within VCE. By adopting the `Mean Teacher'\nmethod, we construct a student U-Net equipped with an scSE attention block,\nalongside a teacher model of the same architecture. These models' parameters\nare alternately updated throughout the training process. We use the\nKvasir-Capsule dataset for our experiments, which encompasses various GI\nbleeding conditions. Notably, we develop the segmentation annotations for this\ndataset ourselves. The findings from our experiments endorse the efficacy of\nthe SSL-based segmentation strategy, demonstrating its capacity to reduce\nreliance on large volumes of annotations for model training, without\ncompromising on the accuracy of identification.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:46:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Hechen",""],["Wu","Yanan",""],["Bai","Long",""],["Wang","An",""],["Chen","Tong",""],["Ren","Hongliang",""]]}
{"id":"2308.02870","submitter":"Fangyuan Wang","authors":"Fangyuan Wang, Ming Hao, Yuhai Shi, Bo Xu","title":"ApproBiVT: Lead ASR Models to Generalize Better Using Approximated\n  Bias-Variance Tradeoff Guided Early Stopping and Checkpoint Averaging","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 conventional recipe for Automatic Speech Recognition (ASR) models is to\n1) train multiple checkpoints on a training set while relying on a validation\nset to prevent overfitting using early stopping and 2) average several last\ncheckpoints or that of the lowest validation losses to obtain the final model.\nIn this paper, we rethink and update the early stopping and checkpoint\naveraging from the perspective of the bias-variance tradeoff. Theoretically,\nthe bias and variance represent the fitness and variability of a model and the\ntradeoff of them determines the overall generalization error. But, it's\nimpractical to evaluate them precisely. As an alternative, we take the training\nloss and validation loss as proxies of bias and variance and guide the early\nstopping and checkpoint averaging using their tradeoff, namely an Approximated\nBias-Variance Tradeoff (ApproBiVT). When evaluating with advanced ASR models,\nour recipe provides 2.5%-3.7% and 3.1%-4.6% CER reduction on the AISHELL-1 and\nAISHELL-2, respectively.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:50:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Fangyuan",""],["Hao","Ming",""],["Shi","Yuhai",""],["Xu","Bo",""]]}
{"id":"2308.02871","submitter":"Chick Woodward","authors":"D. P. K. Banerjee, C. E. Woodward, V. Joshi, A. Evans, F. M. Walter,\n  G. H. Marion, E. Y. Hsiao, N. M. Ashok, R. D. Gehrz, S. Starrfield","title":"Snowflakes in a furnace: formation of CO and dust in a recurrent nova\n  eruption","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We report the detection of carbon monoxide (CO) and dust, formed under\nhostile conditions, in recurrent nova V745 Sco about 8.7 days after its 2014\noutburst. The formation of molecules or dust has not been recorded previously\nin the ejecta of a recurrent nova. The mass and temperature of the CO and dust\nare estimated to be T(CO) = 2250 +/- 250 K, M(CO) = (1 to 5) E-8 solar masses,\nand T(dust) = 1000 +/- 50 K, M(dust) approximately E-8 to E-9 solar masses\nrespectively. At the time of their detection, the shocked gas was at a high\ntemperature of approximately E+7 K as evidenced by the presence of coronal\nlines. The ejecta were simultaneously irradiated by a large flux of soft X-ray\nradiation from the central white dwarf. Molecules and dust are not expected to\nform and survive in such harsh conditions; they are like snowflakes in a\nfurnace. However, it has been posited in other studies that, as the nova ejecta\nplow through the red giant's wind, a region exists between the forward and\nreverse shocks that is cool, dense and clumpy where the dust and CO could\nlikely form. We speculate that this site may also be a region of particle\nacceleration, thereby contributing to the generation of gamma-rays.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:51:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Banerjee","D. P. K.",""],["Woodward","C. E.",""],["Joshi","V.",""],["Evans","A.",""],["Walter","F. M.",""],["Marion","G. H.",""],["Hsiao","E. Y.",""],["Ashok","N. M.",""],["Gehrz","R. D.",""],["Starrfield","S.",""]]}
{"id":"2308.02872","submitter":"Martin Mojto","authors":"Martin Mojto, Karol Lubu\\v{s}k\\'y, Miroslav Fikar, Radoslav Paulen","title":"Data-Based Design of Multi-Model Inferential Sensors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper deals with the problem of inferential (soft) sensor design. The\nnonlinear character of industrial processes is usually the main limitation to\ndesigning simple linear inferential sensors with sufficient accuracy. In order\nto increase the inferential sensor predictive performance and yet to maintain\nits linear structure, multi-model inferential sensors represent a\nstraightforward option. In this contribution, we propose two novel approaches\nfor the design of multi-model inferential sensors aiming to mitigate some\ndrawbacks of the state-of-the-art approaches. For a demonstration of the\ndeveloped techniques, we design inferential sensors for a Vacuum Gasoil\nHydrogenation unit, which is a real-world petrochemical refinery unit. The\nperformance of the multi-model inferential sensor is compared against various\nsingle-model inferential sensors and the current (referential) inferential\nsensor used in the refinery. The results show substantial improvements over the\nstate-of-the-art design techniques for single-/multi-model inferential sensors.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:55:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mojto","Martin",""],["Lubu\u0161k\u00fd","Karol",""],["Fikar","Miroslav",""],["Paulen","Radoslav",""]]}
{"id":"2308.02873","submitter":"Chunmei Wang","authors":"Chunmei Wang, Xiu Ye, Shangyou Zhang","title":"A Modified weak Galerkin finite element method for the Maxwell equations\n  on polyhedral meshes","comments":"19 pages, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We introduce a new numerical method for solving time-harmonic Maxwell's\nequations via the modified weak Galerkin technique. The inter-element functions\nof the weak Galerkin finite elements are replaced by the average of the two\ndiscontinuous polynomial functions on the two sides of the polygon, in the\nmodified weak Galerkin (MWG) finite element method. With the dependent\ninter-element functions, the weak curl and the weak gradient are defined\ndirectly on totally discontinuous polynomials. Optimal-order convergence of the\nmethod is proved. Numerical examples confirm the theory and show effectiveness\nof the modified weak Galerkin method over the existing methods.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:58:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Chunmei",""],["Ye","Xiu",""],["Zhang","Shangyou",""]]}
{"id":"2308.02874","submitter":"Zijie Wu","authors":"Zijie Wu, Yaonan Wang, Mingtao Feng, He Xie, Ajmal Mian","title":"Sketch and Text Guided Diffusion Model for Colored Point Cloud\n  Generation","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion probabilistic models have achieved remarkable success in text\nguided image generation. However, generating 3D shapes is still challenging due\nto the lack of sufficient data containing 3D models along with their\ndescriptions. Moreover, text based descriptions of 3D shapes are inherently\nambiguous and lack details. In this paper, we propose a sketch and text guided\nprobabilistic diffusion model for colored point cloud generation that\nconditions the denoising process jointly with a hand drawn sketch of the object\nand its textual description. We incrementally diffuse the point coordinates and\ncolor values in a joint diffusion process to reach a Gaussian distribution.\nColored point cloud generation thus amounts to learning the reverse diffusion\nprocess, conditioned by the sketch and text, to iteratively recover the desired\nshape and color. Specifically, to learn effective sketch-text embedding, our\nmodel adaptively aggregates the joint embedding of text prompt and the sketch\nbased on a capsule attention network. Our model uses staged diffusion to\ngenerate the shape and then assign colors to different parts conditioned on the\nappearance prompt while preserving precise shapes from the first stage. This\ngives our model the flexibility to extend to multiple tasks, such as appearance\nre-editing and part segmentation. Experimental results demonstrate that our\nmodel outperforms recent state-of-the-art in point cloud generation.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:10:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Zijie",""],["Wang","Yaonan",""],["Feng","Mingtao",""],["Xie","He",""],["Mian","Ajmal",""]]}
{"id":"2308.02875","submitter":"Gerd Hasslinger","authors":"Gerhard Hasslinger, Mahshid Okhovatzadeh, Konstantinos Ntougias, Frank\n  Hasslinger and Oliver Hohlfeld","title":"An Overview of Analysis Methods and Evaluation Results for Caching\n  Strategies","comments":"25 pages","journal-ref":"Computer Networks Volume 228 Year 2023","doi":"10.1016/j.comnet.2023.109583","report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We survey analytical methods and evaluation results for the performance\nassessment of caching strategies. Knapsack solutions are derived, which provide\nstatic caching bounds for independent requests and general bounds for dynamic\ncaching under arbitrary request pattern. We summarize Markov- and\ntime-to-live-based solutions, which assume specific stochastic processes for\ncapturing web request streams and timing. We compare the performance of caching\nstrategies with different knowledge about the properties of data objects\nregarding a broad set of caching demands. The efficiency of web caching must\nregard benefits for network wide traffic load, energy consumption and\nquality-of-service aspects in a tradeoff with costs for updating and storage\noverheads.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:11:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hasslinger","Gerhard",""],["Okhovatzadeh","Mahshid",""],["Ntougias","Konstantinos",""],["Hasslinger","Frank",""],["Hohlfeld","Oliver",""]]}
{"id":"2308.02876","submitter":"A. Yu. Petrov","authors":"T. Mariz, M. Melo, J. R. Nascimento, A. Yu. Petrov","title":"On perturbative aspects of a nonminimal Lorentz-violating QED with\n  CPT-even dimension-5 terms","comments":"12 pages","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 explicitly calculate the lower CPT-even one-loop quantum\ncorrections in nonminimal Lorentz-violating spinor QED with all possible\nCPT-even dimension-5 operators.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:11:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mariz","T.",""],["Melo","M.",""],["Nascimento","J. R.",""],["Petrov","A. Yu.",""]]}
{"id":"2308.02877","submitter":"Alireza Rafiei","authors":"Alireza Rafiei, Ronald Moore, Sina Jahromi, Farshid Hajati, Rishikesan\n  Kamaleswaran","title":"Meta-learning in healthcare: 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":"  As a subset of machine learning, meta-learning, or learning to learn, aims at\nimproving the model's capabilities by employing prior knowledge and experience.\nA meta-learning paradigm can appropriately tackle the conventional challenges\nof traditional learning approaches, such as insufficient number of samples,\ndomain shifts, and generalization. These unique characteristics position\nmeta-learning as a suitable choice for developing influential solutions in\nvarious healthcare contexts, where the available data is often insufficient,\nand the data collection methodologies are different. This survey discusses\nmeta-learning broad applications in the healthcare domain to provide insight\ninto how and where it can address critical healthcare challenges. We first\ndescribe the theoretical foundations and pivotal methods of meta-learning. We\nthen divide the employed meta-learning approaches in the healthcare domain into\ntwo main categories of multi/single-task learning and many/few-shot learning\nand survey the studies. Finally, we highlight the current challenges in\nmeta-learning research, discuss the potential solutions and provide future\nperspectives on meta-learning in healthcare.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:11:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rafiei","Alireza",""],["Moore","Ronald",""],["Jahromi","Sina",""],["Hajati","Farshid",""],["Kamaleswaran","Rishikesan",""]]}
{"id":"2308.02878","submitter":"Tikaram Sanyashi","authors":"Tikaram Sanyashi, Bernard Menezes","title":"Secure Computation over Encrypted Databases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Sensitive applications running on the cloud often require data to be stored\nin an encrypted domain. To run data mining algorithms on such data, partially\nhomomorphic encryption schemes (allowing certain operations in the ciphertext\ndomain) have been devised. One such line of work yields schemes for secure\n\\textit{k-nearest neighbors} computation that is designed to provide both\n\\textit{Data Privacy} and \\textit{Query Privacy}. Enhancements in this area\nfurther ensure that the data owner approves each query issued by a query user\nbefore the cloud server processes it. In this work, we describe an attack that\ninvalidates the \\textit{key confidentiality} claim, which further invalidates\nthe \\textit{Data Privacy} claim for these schemes. We show that a query user\ncan specially tailor a query to extract information about the secret key used\nto encrypt the data points. Furthermore, the recovered secret information can\nbe used to derive all the plaintext data points breaking \\textit{data privacy}.\nWe then suggest enhanced encryption schemes that make such attacks on\n\\textit{data privacy} impossible while incurring meager additional costs in\nperformance.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:17:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sanyashi","Tikaram",""],["Menezes","Bernard",""]]}
{"id":"2308.02879","submitter":"Or Perlman","authors":"Nikita Vladimirov (1) and Or Perlman (1 and 2) ((1) Department of\n  Biomedical Engineering, Tel Aviv University, Tel Aviv, Israel, (2) Sagol\n  School of Neuroscience, Tel Aviv University, Tel Aviv, Israel)","title":"Molecular MRI-Based Monitoring of Cancer Immunotherapy Treatment\n  Response","comments":"25 pages, 7 figures","journal-ref":"Int. J. Mol. Sci. 2023, 24, 3151","doi":"10.3390/ijms24043151","report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Immunotherapy constitutes a paradigm shift in cancer treatment. Its FDA\napproval for several indications has yielded improved prognosis for cases where\ntraditional therapy has shown limited efficiencey. However, many patients still\nfail to benefit from this treatment modality, and the exact mechanisms\nresponsible for tumor response are unknown. Noninvasive treatment monitoring is\ncrucial for longitudinal tumor characterization and the early detection of\nnon-responders. While various medical imaging techniques can provide a\nmorphological picture of the lesion and its surrounding tissue, a\nmolecular-oriented imaging approach holds the key to unraveling biological\neffects that occur much earlier in the immunotherapy timeline. Magnetic\nresonance imaging (MRI) is a highly versatile imaging modality, where the image\ncontrast can be tailored to emphasize a particular biophysical property of\ninterest using advanced engineering of the imaging pipeline. In this review,\nrecent advances in molecular-MRI based cancer immunotherapy monitoring are\ndescribed. Next, the presentation of the underlying physics, computational, and\nbiological features are complemented by a critical analysis of the results\nobtained in preclinical and clinical studies. Finally, emerging artificial\nintelligence (AI)-based strategies to further distill, quantify, and interpret\nthe image-based molecular MRI information are discussed in terms of\nperspectives for the future.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:20:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vladimirov","Nikita","","1 and 2"],["Perlman","Or","","1 and 2"]]}
{"id":"2308.02880","submitter":"Akaki Mamageishvili","authors":"Akaki Mamageishvili and Edward W. Felten","title":"Incentive Schemes for Rollup Validators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We design and analyze attention games that incentivize validators to check\ncomputation results. We show that no pure strategy Nash equilibrium of the game\nwithout outside parties exists by a simple argument. We then proceed to\ncalculate the security of the system in the mixed Nash equilibrium, as a\nfunction of the number of validators and their stake sizes. Our results provide\nlower and upper bounds on the optimal number of validators. More concretely, a\nminimal feasible number of validators minimizes the probability of failure. The\nframework also allows to calculate optimum stake sizes, depending on the target\nfunction. In the end, we discuss optimal design of rewards by the protocol for\nvalidators.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:32:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mamageishvili","Akaki",""],["Felten","Edward W.",""]]}
{"id":"2308.02881","submitter":"Anbang Zhang","authors":"Anbang Zhang, Shuaishuai Guo, Shuai Liu","title":"Private Federated Learning with Dynamic Power Control via Non-Coherent\n  Over-the-Air Computation","comments":"Accepted by ICML","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To further preserve model weight privacy and improve model performance in\nFederated Learning (FL), FL via Over-the-Air Computation (AirComp) scheme based\non dynamic power control is proposed. The edge devices (EDs) transmit the signs\nof local stochastic gradients by activating two adjacent orthogonal frequency\ndivision multi-plexing (OFDM) subcarriers, and majority votes (MVs) at the edge\nserver (ES) are obtained by exploiting the energy accumulation on the\nsubcarriers. Then, we propose a dynamic power control algorithm to further\noffset the biased aggregation of the MV aggregation values. We show that the\nwhole scheme can mitigate the impact of the time synchronization error, channel\nfading and noise. The theoretical convergence proof of the scheme is\nre-derived.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:46:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Anbang",""],["Guo","Shuaishuai",""],["Liu","Shuai",""]]}
{"id":"2308.02882","submitter":"Rui Santos","authors":"Ricardo Barru\\'e, Patricia Conde-Mu\\'i\\~no, Valerio Dao, Rui Santos","title":"Simulation-based inference in the search for CP violation in leptonic WH\n  production","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sources of CP violation beyond the Standard Model (BSM) are required to\nexplain the baryonic asymmetry of the Universe. In this work, we studied BSM CP\nviolating components in the HWW interaction in WH production, parametrized by\nan effective dimension-6 CP-odd operator. We studied the feasibility of using a\nmachine learning simulation-based inference method, SALLY, that estimates a\ndetector-level optimal observable, and compared its sensitivity to that of\nenergy-dependent and angular observables, also studying various binnings for\nthese observables. We show that, when linear effects in the Wilson coefficients\ndominate, an observable such as SALLY will lead to optimal limits. In the\nregions of phase space where quadratic effects are significant, the best\nsensitivity comes from a 2D combination of an angular observable and an\nenergy-dependent variable with bins in the high-energy region. This works aims\nat testing the current multivariate techniques in view of informing analysis\nstrategies for LHC Run 3.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 13:59:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Barru\u00e9","Ricardo",""],["Conde-Mu\u00ed\u00f1o","Patricia",""],["Dao","Valerio",""],["Santos","Rui",""]]}
{"id":"2308.02883","submitter":"Yiyang Chen","authors":"Yiyang Chen, Shanshan Zhao, Changxing Ding, Liyao Tang, Chaoyue Wang,\n  Dacheng Tao","title":"Cross-modal & Cross-domain Learning for Unsupervised LiDAR Semantic\n  Segmentation","comments":"Accepted by ACM Multimedia 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, cross-modal domain adaptation has been studied on the paired\n2D image and 3D LiDAR data to ease the labeling costs for 3D LiDAR semantic\nsegmentation (3DLSS) in the target domain. However, in such a setting the\npaired 2D and 3D data in the source domain are still collected with additional\neffort. Since the 2D-3D projections can enable the 3D model to learn semantic\ninformation from the 2D counterpart, we ask whether we could further remove the\nneed of source 3D data and only rely on the source 2D images. To answer it,\nthis paper studies a new 3DLSS setting where a 2D dataset (source) with\nsemantic annotations and a paired but unannotated 2D image and 3D LiDAR data\n(target) are available. To achieve 3DLSS in this scenario, we propose\nCross-Modal and Cross-Domain Learning (CoMoDaL). Specifically, our CoMoDaL aims\nat modeling 1) inter-modal cross-domain distillation between the unpaired\nsource 2D image and target 3D LiDAR data, and 2) the intra-domain cross-modal\nguidance between the target 2D image and 3D LiDAR data pair. In CoMoDaL, we\npropose to apply several constraints, such as point-to-pixel and\nprototype-to-pixel alignments, to associate the semantics in different\nmodalities and domains by constructing mixed samples in two modalities. The\nexperimental results on several datasets show that in the proposed setting, the\ndeveloped CoMoDaL can achieve segmentation without the supervision of labeled\nLiDAR data. Ablations are also conducted to provide more analysis. Code will be\navailable publicly.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:00:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Yiyang",""],["Zhao","Shanshan",""],["Ding","Changxing",""],["Tang","Liyao",""],["Wang","Chaoyue",""],["Tao","Dacheng",""]]}
{"id":"2308.02884","submitter":"Randall Feenstra","authors":"Randall M. Feenstra","title":"Path distributions for describing eigenstates of orbital angular\n  momentum","comments":"39 pages (including five Appendices), 11 figures; in v2, a number of\n  typographical corrections are made (to the figure numbers in the Appendices\n  in particular)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The manner in which probability amplitudes of paths sum up to form wave\nfunctions of orbital angular momentum eigenstates is described. Using a\ngeneralization of stationary-phase analysis, distributions are derived that\nprovide a measure of how paths contribute towards any given eigenstate. In the\nlimit of long travel-time, these distributions turn out to be real-valued,\nnon-negative functions of a momentum variable that describes classical travel\nbetween the endpoints of a path (with the paths explicitly including\nnonclassical ones, described in terms of elastica). The distributions are\nfunctions of both this characteristic momentum as well as a polar angle that\nprovides a tilt, relative to the z-axis of the chosen coordinate system, of the\ngeodesic that connects the endpoints. The resulting description provides a\nreplacement for the well-known \"vector model\" for describing orbital angular\nmomentum, and importantly, it includes treatment of the case when the quantum\nnumber $\\ell$ is zero (i.e., s-states).\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:00:56 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 13:43:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Feenstra","Randall M.",""]]}
{"id":"2308.02885","submitter":"Aikata Aikata","authors":"Aikata Aikata, Ahmet Can Mert, Sunmin Kwon, Maxim Deryabin, and Sujoy\n  Sinha Roy","title":"REED: Chiplet-Based Scalable Hardware Accelerator for Fully Homomorphic\n  Encryption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fully Homomorphic Encryption (FHE) has emerged as a promising technology for\nprocessing encrypted data without the need for decryption. Despite its\npotential, its practical implementation has faced challenges due to substantial\ncomputational overhead. To address this issue, we propose the $first$\nchiplet-based FHE accelerator design `REED', which enables scalability and\noffers high throughput, thereby enhancing homomorphic encryption deployment in\nreal-world scenarios. It incorporates well-known wafer yield issues during\nfabrication which significantly impacts production costs. In contrast to\nstate-of-the-art approaches, we also address data exchange overhead by\nproposing a non-blocking inter-chiplet communication strategy. We incorporate\nnovel pipelined Number Theoretic Transform and automorphism techniques,\nleveraging parallelism and providing high throughput.\n  Experimental results demonstrate that REED 2.5D integrated circuit consumes\n177 mm$^2$ chip area, 82.5 W average power in 7nm technology, and achieves an\nimpressive speedup of up to 5,982$\\times$ compared to a CPU (24-core\n2$\\times$Intel X5690), and 2$\\times$ better energy efficiency and 50\\% lower\ndevelopment cost than state-of-the-art ASIC accelerator. To evaluate its\npractical impact, we are the $first$ to benchmark an encrypted deep neural\nnetwork training. Overall, this work successfully enhances the practicality and\ndeployability of fully homomorphic encryption in real-world scenarios.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:04:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aikata","Aikata",""],["Mert","Ahmet Can",""],["Kwon","Sunmin",""],["Deryabin","Maxim",""],["Roy","Sujoy Sinha",""]]}
{"id":"2308.02886","submitter":"Matus Rybak","authors":"M. Rybak, J. van Marrewijk, J. A. Hodge, P. Andreani, G. Calistro\n  Rivera, L. Graziani, J. P. McKean, S. Viti, P. P. van der Werf","title":"PRUSSIC II -- ALMA imaging of dense-gas tracers in SDP.81: Evidence for\n  low mechanical heating and a sub-solar metallicity in a z=3.04 dusty galaxy","comments":"A&A accepted, in press. 10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present deep ALMA Band 3 observations of the HCN, HCO+, and HNC (4-3)\nemission in SDP.81, a well-studied z = 3.042 strongly lensed galaxy. These\nlines trace the high-density gas, which remains almost entirely unexplored in\nz$\\geq$1 galaxies. Additionally, these dense-gas tracers are potentially\npowerful diagnostics of the mechanical heating of the interstellar medium.\nWhile the HCN(4-3) and HNC(4-3) lines are not detected, the HCO+(4-3) emission\nis clearly detected and resolved. This is the third detection of this line in a\nhigh-redshift star-forming galaxy. We find an unusually high HCO+/HCN intensity\nratio of $\\geq$2.2. Based on the photodissociation region modelling, the most\nlikely explanation for the elevated HCO+/HCN ratio is that SDP.81 has low\nmechanical heating - less than 10% of the total energy budget - and a sub-solar\nmetallicity, Z=0.5 Z$_\\odot$. While such conditions might not be representative\nof the general population of high-redshift dusty galaxies, lower-than-solar\nmetallicity might have a significant impact on gas masses inferred from CO\nobservations. In addition, we report the detection of CO(0-1) absorption from\nthe foreground lensing galaxy and CO(1-0) emission from a massive companion to\nthe lensing galaxy, approximately 50 kpc to the southeast.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:07:23 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 09:25:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rybak","M.",""],["van Marrewijk","J.",""],["Hodge","J. A.",""],["Andreani","P.",""],["Rivera","G. Calistro",""],["Graziani","L.",""],["McKean","J. P.",""],["Viti","S.",""],["van der Werf","P. P.",""]]}
{"id":"2308.02887","submitter":"Ali Vardasbi","authors":"Ali Vardasbi, Maarten de Rijke, Fernando Diaz, Mostafa Dehghani","title":"Group Membership Bias","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When learning to rank from user interactions, search and recommendation\nsystems must address biases in user behavior to provide a high-quality ranking.\nOne type of bias that has recently been studied in the ranking literature is\nwhen sensitive attributes, such as gender, have an impact on a user's judgment\nabout an item's utility. For example, in a search for an expertise area, some\nusers may be biased towards clicking on male candidates over female candidates.\nWe call this type of bias group membership bias or group bias for short.\nIncreasingly, we seek rankings that not only have high utility but are also\nfair to individuals and sensitive groups. Merit-based fairness measures rely on\nthe estimated merit or utility of the items. With group bias, the utility of\nthe sensitive groups is under-estimated, hence, without correcting for this\nbias, a supposedly fair ranking is not truly fair. In this paper, first, we\nanalyze the impact of group bias on ranking quality as well as two well-known\nmerit-based fairness metrics and show that group bias can hurt both ranking and\nfairness. Then, we provide a correction method for group bias that is based on\nthe assumption that the utility score of items in different groups comes from\nthe same distribution. This assumption has two potential issues of sparsity and\nequality-instead-of-equity, which we use an amortized approach to solve. We\nshow that our correction method can consistently compensate for the negative\nimpact of group bias on ranking quality and fairness metrics.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:08:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vardasbi","Ali",""],["de Rijke","Maarten",""],["Diaz","Fernando",""],["Dehghani","Mostafa",""]]}
{"id":"2308.02888","submitter":"Cahngyan Di","authors":"Changyan Di, Qingguo Zhou, Jun Shen, Jinqiang Wang, Rui Zhou, Tianyi\n  Wang","title":"The coupling effect between the environment and strategies drives the\n  emergence of group cooperation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph cs.MA physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Introducing environmental feedback into evolutionary game theory has led to\nthe development of eco-evolutionary games, which have gained popularity due to\ntheir ability to capture the intricate interplay between the environment and\ndecision-making processes. However, current researches in this field focus on\nthe study to macroscopic evolutionary dynamics in infinite populations. In this\nstudy, we propose a multi-agent computational model based on reinforcement\nlearning to explore the coupled dynamics between strategies and the environment\nin finite populations from a bottom-up perspective. Our findings indicate that\neven in environments that favor defectors, high levels of group cooperation can\nemerge from self-interested individuals, highlighting the significant role of\nthe coupling effect between the environment and strategies. Over time, the\nhigher payoff of defection can be diluted due to environmental degradation,\nwhile cooperation can become the dominant strategy when positively reinforced\nby the environment. Remarkably, individuals can accurately detect the\ninflection point of the environment solely through rewards, when a reinforcing\npositive feedback loop are triggered, resulting in a rapid increase in agents'\nrewards and facilitating the establishment and maintenance of group\ncooperation. Our research provides a fresh perspective on understanding the\nemergence of group cooperation and sheds light on the underlying mechanisms\ninvolving individuals and the environment.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:09:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Di","Changyan",""],["Zhou","Qingguo",""],["Shen","Jun",""],["Wang","Jinqiang",""],["Zhou","Rui",""],["Wang","Tianyi",""]]}
{"id":"2308.02889","submitter":"Gleb Kalachev","authors":"Gleb Kalachev","title":"High-dimensional Expansion of Product Codes is Stronger than Robust and\n  Agreement Testability","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the coboundary expansion property of product codes called product\nexpansion, which played a key role in all recent constructions of good qLDPC\ncodes. It was shown before that this property is equivalent to robust\ntestability and agreement testability for products of two codes with linear\ndistance. First, we show that robust testability for product of many codes with\nlinear distance is equivalent to agreement testability. Second, we provide an\nexample of product of three codes with linear distance which is robustly\ntestable but not product expanding.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:13:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kalachev","Gleb",""]]}
{"id":"2308.02890","submitter":"Mogeng Li","authors":"Mogeng Li, Charitha M. de Silva, Daniel Chung, Dale I. Pullin, Ivan\n  Marusic and Nicholas Hutchins","title":"Experimental study of a turbulent boundary layer with a rough-to-smooth\n  change in surface conditions at high Reynolds numbers","comments":null,"journal-ref":"Journal of Fluid Mechanics, 923, A18 (2021)","doi":"10.1017/jfm.2021.577","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This study presents an experimental dataset documenting the evolution of a\nturbulent boundary layer downstream of a rough-to-smooth surface transition. To\ninvestigate the effect of upstream flow conditions, two groups of experiments\nare conducted. For the \\emph{Group-Re} cases, a nominally constant\nviscous-scaled equivalent sand grain roughness $k_{s0}^+\\approx160$ is\nmaintained on the rough surface, while the friction Reynolds number $Re_{\\tau\n0}$ ranges from 7100 to 21000. For the \\emph{Group-ks} cases, $Re_{\\tau\n0}\\approx14000$ is maintained while $k_{s0}^+$ ranges from 111 to 228. The\nwall-shear stress on the downstream smooth surface is measured directly using\noil-film interferometry to redress previously reported uncertainties in the\nskin-friction coefficient recovery trends. In the early development following\nthe roughness transition, the flow in the internal layer is not in equilibrium\nwith the wall-shear stress. This conflicts with the common practise of\nmodelling the mean velocity profile as two log laws below and above the\ninternal layer height, as first proposed by Elliott (\\textit{Trans. Am.\nGeophys. Union}, vol. 39, 1958, pp 1048--1054). As a solution to this, the\ncurrent data are used to model the recovering mean velocity semi-empirically by\nblending the corresponding rough-wall and smooth-wall profiles. The\nover-energised large-scale motions leave a strong footprint in the near-wall\nregion of the energy spectrum, the frequency and magnitude of which exhibit\ndependence on $Re_{\\tau 0}$ and $k_{s0}^+$ respectively. The energy\ndistribution in near-wall small scales is mostly unaffected by the presence of\nthe outer flow with rough-wall characteristics, which can be used as a\nsurrogate measure to extract the local friction velocity.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:24:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Mogeng",""],["de Silva","Charitha M.",""],["Chung","Daniel",""],["Pullin","Dale I.",""],["Marusic","Ivan",""],["Hutchins","Nicholas",""]]}
{"id":"2308.02891","submitter":"Hui Cao","authors":"Liam Shaughnessy, Rohin E. McIntosh, Arthur Goetschy, Chia Wei Hsu,\n  Nicholas Bender, Hasan Yilmaz, Alexey Yamilov and Hui Cao","title":"Creating high-contrast patterns in multiple-scattering media via\n  wavefront shaping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wavefront shaping allows focusing light through or inside strongly scattering\nmedia, but the background intensity also increases due to long-range\ncorrelations, reducing the target's contrast. By manipulating non-local\nintensity correlations of scattered waves in a disordered system with input\nwavefront shaping, we create high-contrast patterns behind strongly scattering\nmedia and targeted energy delivery into a diffusive system with minimal change\nin the surrounding intensity. These are achieved by introducing the contrast\noperator and the difference operator, and utilizing their eigenstates to\nmaximize the target-to-background intensity contrast and energy difference.\nThis work opens the door to coherent control of non-local effects in wave\ntransport for practical applications.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:29:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shaughnessy","Liam",""],["McIntosh","Rohin E.",""],["Goetschy","Arthur",""],["Hsu","Chia Wei",""],["Bender","Nicholas",""],["Yilmaz","Hasan",""],["Yamilov","Alexey",""],["Cao","Hui",""]]}
{"id":"2308.02892","submitter":"Mehdi Letafati","authors":"Seyyed Amirhossein Ameli Kalkhoran, Mehdi Letafati, Ecenaz Erdemir,\n  Babak Hossein Khalaj, Hamid Behroozi, and Deniz G\\\"und\\\"uz","title":"Secure Deep-JSCC Against Multiple Eavesdroppers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.LG eess.IV math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, a generalization of deep learning-aided joint source channel\ncoding (Deep-JSCC) approach to secure communications is studied. We propose an\nend-to-end (E2E) learning-based approach for secure communication against\nmultiple eavesdroppers over complex-valued fading channels. Both scenarios of\ncolluding and non-colluding eavesdroppers are studied. For the colluding\nstrategy, eavesdroppers share their logits to collaboratively infer private\nattributes based on ensemble learning method, while for the non-colluding setup\nthey act alone. The goal is to prevent eavesdroppers from inferring private\n(sensitive) information about the transmitted images, while delivering the\nimages to a legitimate receiver with minimum distortion. By generalizing the\nideas of privacy funnel and wiretap channel coding, the trade-off between the\nimage recovery at the legitimate node and the information leakage to the\neavesdroppers is characterized. To solve this secrecy funnel framework, we\nimplement deep neural networks (DNNs) to realize a data-driven secure\ncommunication scheme, without relying on a specific data distribution.\nSimulations over CIFAR-10 dataset verifies the secrecy-utility trade-off.\nAdversarial accuracy of eavesdroppers are also studied over Rayleigh fading,\nNakagami-m, and AWGN channels to verify the generalization of the proposed\nscheme. Our experiments show that employing the proposed secure neural encoding\ncan decrease the adversarial accuracy by 28%.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:40:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kalkhoran","Seyyed Amirhossein Ameli",""],["Letafati","Mehdi",""],["Erdemir","Ecenaz",""],["Khalaj","Babak Hossein",""],["Behroozi","Hamid",""],["G\u00fcnd\u00fcz","Deniz",""]]}
{"id":"2308.02893","submitter":"Michal Kowal","authors":"P. Jachimowicz, M. Kowal, J. Skalski","title":"Candidates for three-quasiparticle $K$-isomers in odd-even Md-Rg nuclei","comments":"Submitted to PRC","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We performed a search for three-quasiparticle high-$K$ isomer candidates in\nodd-even Md - Rg nuclei by considering the lowest lying 1$\\pi$2$\\nu$ and 3$\\pi$\nexcitations. Our approach involves calculating the energies of different\nnuclear configurations using a microscopic-macroscopic model with the\nWoods-Saxon potential. We explore three pairing scenarios: blocking,\nquasi-particle BCS method, and particle number projection formalism. The\noptimal deformations for both ground-states and high-$K$ configurations are\ndetermined through a four-dimensional energy minimization process. By analyzing\nthe obtained excitation energies, we discuss the most promising candidates for\nhigh-$K$ isomers and compare them, where possible, with existing experimental\ndata. We also discuss a possible isomer $\\alpha$-decay hindrance using\ncalculated $Q_{\\alpha}$-hindrances.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:40:41 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 12:50:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jachimowicz","P.",""],["Kowal","M.",""],["Skalski","J.",""]]}
{"id":"2308.02894","submitter":"Gledson Tondo","authors":"Gledson Rodrigo Tondo and Sebastian Rau and Igor Kavrakov and Guido\n  Morgenthal","title":"Physics-informed Gaussian process model for Euler-Bernoulli beam\n  elements","comments":"10 pages, 10 figures, 11 references","journal-ref":"IABSE Symposium: Challenges for Existing and Oncoming Structures,\n  Prague, Czech Republic, 25-27 May 2022","doi":"10.2749/prague.2022.0445","report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A physics-informed machine learning model, in the form of a multi-output\nGaussian process, is formulated using the Euler-Bernoulli beam equation. Given\nappropriate datasets, the model can be used to regress the analytical value of\nthe structure's bending stiffness, interpolate responses, and make\nprobabilistic inferences on latent physical quantities. The developed model is\napplied on a numerically simulated cantilever beam, where the regressed bending\nstiffness is evaluated and the influence measurement noise on the prediction\nquality is investigated. Further, the regressed probabilistic stiffness\ndistribution is used in a structural health monitoring context, where the\nMahalanobis distance is employed to reason about the possible location and\nextent of damage in the structural system. To validate the developed framework,\nan experiment is conducted and measured heterogeneous datasets are used to\nupdate the assumed analytical structural model.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 14:48:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tondo","Gledson Rodrigo",""],["Rau","Sebastian",""],["Kavrakov","Igor",""],["Morgenthal","Guido",""]]}
{"id":"2308.02895","submitter":"Jean-Philippe Bouchaud","authors":"Jean-Philippe Bouchaud","title":"From Statistical Physics to Social Sciences: The Pitfalls of\n  Multi-disciplinarity","comments":"French version published as a book by Fayard (2021)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is the English version of my inaugural lecture at Coll\\`ege de France in\n2021, available at https://www.youtube.com/watch?v=bxktplKMhKU. I reflect on\nthe difficulty of multi-disciplinary research, which often hinges of unexpected\nepistemological and methodological differences, for example about the\nscientific status of models. What is the purpose of a model? What are we\nultimately trying to establish: rigorous theorems or ad-hoc calculation\nrecipes; absolute truth, or heuristic representations of the world? I argue\nthat the main contribution of statistical physics to social and economic\nsciences is to make us realise that unexpected behaviour can emerge at the\naggregate level, that isolated individuals would never experience. Crises,\npanics, opinion reversals, the spread of rumours or beliefs, fashion effects\nand the zeitgeist, but also the existence of money, lasting institutions,\nsocial norms and stable societies, must be understood in terms of collective\nbelief and/or trust, self-sustained by interactions, or on the contrary, the\nrapid collapse of this belief or trust. The Appendix contains my opening\nremarks to the workshop ``More is Different'', as a tribute to Phil Anderson.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:04:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bouchaud","Jean-Philippe",""]]}
{"id":"2308.02896","submitter":"Yueying Li","authors":"Yueying Li, Nikita Lazarev, David Koufaty, Yijun Yin, Andy Anderson,\n  Zhiru Zhang, Edward Suh, Kostis Kaffes, Christina Delimitrou","title":"Towards Fast, Adaptive, and Hardware-Assisted User-Space Scheduling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AR cs.NI cs.OS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern datacenter applications are prone to high tail latencies since their\nrequests typically follow highly-dispersive distributions. Delivering fast\ninterrupts is essential to reducing tail latency. Prior work has proposed both\nOS- and system-level solutions to reduce tail latencies for microsecond-scale\nworkloads through better scheduling. Unfortunately, existing approaches like\ncustomized dataplane OSes, require significant OS changes, experience\nscalability limitations, or do not reach the full performance capabilities\nhardware offers.\n  The emergence of new hardware features like UINTR exposed new opportunities\nto rethink the design paradigms and abstractions of traditional scheduling\nsystems. We propose LibPreemptible, a preemptive user-level threading library\nthat is flexible, lightweight, and adaptive. LibPreemptible was built with a\nset of optimizations like LibUtimer for scalability, and deadline-oriented API\nfor flexible policies, time-quantum controller for adaptiveness. Compared to\nthe prior state-of-the-art scheduling system Shinjuku, our system achieves\nsignificant tail latency and throughput improvements for various workloads\nwithout modifying the kernel. We also demonstrate the flexibility of\nLibPreemptible across scheduling policies for real applications experiencing\nvarying load levels and characteristics.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:09:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yueying",""],["Lazarev","Nikita",""],["Koufaty","David",""],["Yin","Yijun",""],["Anderson","Andy",""],["Zhang","Zhiru",""],["Suh","Edward",""],["Kaffes","Kostis",""],["Delimitrou","Christina",""]]}
{"id":"2308.02897","submitter":"Chen Bin","authors":"Bin Chen, Jia-Li Yin, Shukai Chen, Bo-Hao Chen and Ximeng Liu","title":"An Adaptive Model Ensemble Adversarial Attack for Boosting Adversarial\n  Transferability","comments":"8 pages, 5 figures, 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":"  While the transferability property of adversarial examples allows the\nadversary to perform black-box attacks (i.e., the attacker has no knowledge\nabout the target model), the transfer-based adversarial attacks have gained\ngreat attention. Previous works mostly study gradient variation or image\ntransformations to amplify the distortion on critical parts of inputs. These\nmethods can work on transferring across models with limited differences, i.e.,\nfrom CNNs to CNNs, but always fail in transferring across models with wide\ndifferences, such as from CNNs to ViTs. Alternatively, model ensemble\nadversarial attacks are proposed to fuse outputs from surrogate models with\ndiverse architectures to get an ensemble loss, making the generated adversarial\nexample more likely to transfer to other models as it can fool multiple models\nconcurrently. However, existing ensemble attacks simply fuse the outputs of the\nsurrogate models evenly, thus are not efficacious to capture and amplify the\nintrinsic transfer information of adversarial examples. In this paper, we\npropose an adaptive ensemble attack, dubbed AdaEA, to adaptively control the\nfusion of the outputs from each model, via monitoring the discrepancy ratio of\ntheir contributions towards the adversarial objective. Furthermore, an extra\ndisparity-reduced filter is introduced to further synchronize the update\ndirection. As a result, we achieve considerable improvement over the existing\nensemble attacks on various datasets, and the proposed AdaEA can also boost\nexisting transfer-based attacks, which further demonstrates its efficacy and\nversatility.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:12:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Bin",""],["Yin","Jia-Li",""],["Chen","Shukai",""],["Chen","Bo-Hao",""],["Liu","Ximeng",""]]}
{"id":"2308.02898","submitter":"Xiangming Gu","authors":"Xiangming Gu and Wei Zeng and Ye Wang","title":"Elucidate Gender Fairness in Singing Voice Transcription","comments":"Camera-ready version of ACM MM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is widely known that males and females typically possess different sound\ncharacteristics when singing, such as timbre and pitch, but it has never been\nexplored whether these gender-based characteristics lead to a performance\ndisparity in singing voice transcription (SVT), whose target includes pitch.\nSuch a disparity could cause fairness issues and severely affect the user\nexperience of downstream SVT applications. Motivated by this, we first\ndemonstrate the female superiority of SVT systems, which is observed across\ndifferent models and datasets. We find that different pitch distributions,\nrather than gender data imbalance, contribute to this disparity. To address\nthis issue, we propose using an attribute predictor to predict gender labels\nand adversarially training the SVT system to enforce the gender-invariance of\nacoustic representations. Leveraging the prior knowledge that pitch\ndistributions may contribute to the gender bias, we propose conditionally\naligning acoustic representations between demographic groups by feeding note\nevents to the attribute predictor. Empirical experiments on multiple benchmark\nSVT datasets show that our method significantly reduces gender bias (up to more\nthan 50%) with negligible degradation of overall SVT performance, on both\nin-domain and out-of-domain singing data, thus offering a better\nfairness-utility trade-off.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:15:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gu","Xiangming",""],["Zeng","Wei",""],["Wang","Ye",""]]}
{"id":"2308.02899","submitter":"Brantly Callaway","authors":"Brantly Callaway and Emmanuel Selorm Tsyawo","title":"Treatment Effects in Staggered Adoption Designs with Non-Parallel Trends","comments":"37 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers identifying and estimating causal effect parameters in a\nstaggered treatment adoption setting -- that is, where a researcher has access\nto panel data and treatment timing varies across units. We consider the case\nwhere untreated potential outcomes may follow non-parallel trends over time\nacross groups. This implies that the identifying assumptions of leading\napproaches such as difference-in-differences do not hold. We mainly focus on\nthe case where untreated potential outcomes are generated by an interactive\nfixed effects model and show that variation in treatment timing provides\nadditional moment conditions that can be used to recover a large class of\ntarget causal effect parameters. Our approach exploits the variation in\ntreatment timing without requiring either (i) a large number of time periods or\n(ii) requiring any extra exclusion restrictions. This is in contrast to\nessentially all of the literature on interactive fixed effects models which\nrequires at least one of these extra conditions. Rather, our approach directly\napplies in settings where there is variation in treatment timing. Although our\nmain focus is on a model with interactive fixed effects, our idea of using\nvariation in treatment timing to recover causal effect parameters is quite\ngeneral and could be adapted to other settings with non-parallel trends across\ngroups such as dynamic panel data models.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:17:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Callaway","Brantly",""],["Tsyawo","Emmanuel Selorm",""]]}
{"id":"2308.02900","submitter":"Yi Ren","authors":"Yi Ren, Xu Zhao, Hongyan Tang, Shuai Li","title":"Disentangled Counterfactual Reasoning for Unbiased Sequential\n  Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sequential recommender systems have achieved state-of-the-art recommendation\nperformance by modeling the sequential dynamics of user activities. However, in\nmost recommendation scenarios, the popular items comprise the major part of the\nprevious user actions. Therefore, the learned models are biased towards the\npopular items irrespective of the user's real interests. In this paper, we\npropose a structural causal model-based method to address the popularity bias\nissue for sequential recommendation model learning. For more generalizable\nmodeling, we disentangle the popularity and interest representations at both\nthe item side and user context side. Based on the disentangled representation,\nwe identify a more effective structural causal graph for general recommendation\napplications. Then, we design delicate sequential models to apply the\naforementioned causal graph to the sequential recommendation scenario for\nunbiased prediction with counterfactual reasoning. Furthermore, we conduct\nextensive offline experiments and online A/B tests to verify the proposed\n\\textbf{DCR} (Disentangled Counterfactual Reasoning) method's superior overall\nperformance and understand the effectiveness of the various introduced\ncomponents. Based on our knowledge, this is the first structural causal model\nspecifically designed for the popularity bias correction of sequential\nrecommendation models, which achieves significant performance gains over the\nexisting methods.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:23:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ren","Yi",""],["Zhao","Xu",""],["Tang","Hongyan",""],["Li","Shuai",""]]}
{"id":"2308.02901","submitter":"Zeev Nutov","authors":"Zeev Nutov","title":"A logarithmic approximation algorithm for the activation edge multicover\n  problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the Activation Edge-Multicover problem we are given a multigraph $G=(V,E)$\nwith activation costs $\\{c_{e}^u,c_{e}^v\\}$ for every edge $e=uv \\in E$, and\ndegree requirements $r=\\{r_v:v \\in V\\}$. The goal is to find an edge subset $J\n\\subseteq E$ of minimum activation cost $\\sum_{v \\in V}\\max\\{c_{uv}^v:uv \\in\nJ\\}$,such that every $v \\in V$ has at least $r_v$ neighbors in the graph\n$(V,J)$. Let $k= \\max_{v \\in V} r_v$ be the maximum requirement and let\n$\\theta=\\max_{e=uv \\in E} \\frac{\\max\\{c_e^u,c_e^v\\}}{\\min\\{c_e^u,c_e^v\\}}$ be\nthe maximum quotient between the two costs of an edge. For $\\theta=1$ the\nproblem admits approximation ratio $O(\\log k)$. For $k=1$ it generalizes the\nSet Cover problem (when $\\theta=\\infty$), and admits a tight approximation\nratio $O(\\log n)$. This implies approximation ratio $O(k \\log n)$ for general\n$k$ and $\\theta$, and no better approximation ratio was known. We obtain the\nfirst logarithmic approximation ratio $O(\\log k +\\log\\min\\{\\theta,n\\})$, that\nbridges between the two known ratios -- $O(\\log k)$ for $\\theta=1$ and $O(\\log\nn)$ for $k=1$. This implies approximation ratio $O\\left(\\log k\n+\\log\\min\\{\\theta,n\\}\\right) +\\beta \\cdot (\\theta+1)$ for the Activation\n$k$-Connected Subgraph problem, where $\\beta$ is the best known approximation\nratio for the ordinary min-cost version of the problem.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:38:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nutov","Zeev",""]]}
{"id":"2308.02902","submitter":"Andrea Ceni","authors":"Andrea Ceni, Claudio Gallicchio","title":"Edge of stability echo state networks","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":"  In this paper, we propose a new Reservoir Computing (RC) architecture, called\nthe Edge of Stability Echo State Network (ES$^2$N). The introduced ES$^2$N\nmodel is based on defining the reservoir layer as a convex combination of a\nnonlinear reservoir (as in the standard ESN), and a linear reservoir that\nimplements an orthogonal transformation. We provide a thorough mathematical\nanalysis of the introduced model, proving that the whole eigenspectrum of the\nJacobian of the ES2N map can be contained in an annular neighbourhood of a\ncomplex circle of controllable radius, and exploit this property to demonstrate\nthat the ES$^2$N's forward dynamics evolves close to the edge-of-chaos regime\nby design. Remarkably, our experimental analysis shows that the newly\nintroduced reservoir model is able to reach the theoretical maximum short-term\nmemory capacity. At the same time, in comparison to standard ESN, ES$^2$N is\nshown to offer a favorable trade-off between memory and nonlinearity, as well\nas a significant improvement of performance in autoregressive nonlinear\nmodeling.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:49:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ceni","Andrea",""],["Gallicchio","Claudio",""]]}
{"id":"2308.02903","submitter":"Zhanyu Ma","authors":"Zhanyu Ma and Jian Ye and Shuang Cheng","title":"LaDA: Latent Dialogue Action For Zero-shot Cross-lingual Neural Network\n  Language Modeling","comments":"Accepted In Proceedings of Cognitive Science Society Annual\n  Conference (CogSci) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-lingual adaptation has proven effective in spoken language\nunderstanding (SLU) systems with limited resources. Existing methods are\nfrequently unsatisfactory for intent detection and slot filling, particularly\nfor distant languages that differ significantly from the source language in\nscripts, morphology, and syntax. Latent Dialogue Action (LaDA) layer is\nproposed to optimize decoding strategy in order to address the aforementioned\nissues. The model consists of an additional layer of latent dialogue action. It\nenables our model to improve a system's capability of handling conversations\nwith complex multilingual intent and slot values of distant languages. To the\nbest of our knowledge, this is the first exhaustive investigation of the use of\nlatent variables for optimizing cross-lingual SLU policy during the decode\nstage. LaDA obtains state-of-the-art results on public datasets for both\nzero-shot and few-shot adaptation.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:51:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Zhanyu",""],["Ye","Jian",""],["Cheng","Shuang",""]]}
{"id":"2308.02904","submitter":"Giulia Bertaglia","authors":"Giulia Bertaglia, Lorenzo Pareschi, Russel E. Caflisch","title":"Gradient-based Monte Carlo methods for relaxation approximations of\n  hyperbolic conservation laws","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Particle methods based on evolving the spatial derivatives of the solution\nwere originally introduced to simulate reaction-diffusion processes, inspired\nby vortex methods for the Navier--Stokes equations. Such methods, referred to\nas gradient random walk methods, were extensively studied in the '90s and have\nseveral interesting features, such as being grid free, automatically adapting\nto the solution by concentrating elements where the gradient is large and\nsignificantly reducing the variance of the standard random walk approach. In\nthis work, we revive these ideas by showing how to generalize the approach to a\nlarger class of partial differential equations, including hyperbolic systems of\nconservation laws. To achieve this goal, we first extend the classical Monte\nCarlo method to relaxation approximation of systems of conservation laws, and\nsubsequently consider a novel particle dynamics based on the spatial\nderivatives of the solution. The methodology, combined with\nasymptotic-preserving splitting discretization, yields a way to construct a new\nclass of gradient-based Monte Carlo methods for hyperbolic systems of\nconservation laws. Several results in one spatial dimension for scalar\nequations and systems of conservation laws show that the new methods are very\npromising and yield remarkable improvements compared to standard Monte Carlo\napproaches, either in terms of variance reduction as well as in describing the\nshock structure.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:52:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bertaglia","Giulia",""],["Pareschi","Lorenzo",""],["Caflisch","Russel E.",""]]}
{"id":"2308.02905","submitter":"Alloy Das","authors":"Alloy Das, Prasun Roy, Saumik Bhattacharya, Subhankar Ghosh, Umapada\n  Pal, Michael Blumenstein","title":"FAST: Font-Agnostic Scene Text Editing","comments":"13 pages, in submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Scene Text Editing (STE) is a challenging research problem, and it aims to\nmodify existing texts in an image while preserving the background and the font\nstyle of the original text of the image. Due to its various real-life\napplications, researchers have explored several approaches toward STE in recent\nyears. However, most of the existing STE methods show inferior editing\nperformance because of (1) complex image backgrounds, (2) various font styles,\nand (3) varying word lengths within the text. To address such inferior editing\nperformance issues, in this paper, we propose a novel font-agnostic scene text\nediting framework, named FAST, for simultaneously generating text in arbitrary\nstyles and locations while preserving a natural and realistic appearance\nthrough combined mask generation and style transfer. The proposed approach\ndiffers from the existing methods as they directly modify all image pixels.\nInstead, the proposed method has introduced a filtering mechanism to remove\nbackground distractions, allowing the network to focus solely on the text\nregions where editing is required. Additionally, a text-style transfer module\nhas been designed to mitigate the challenges posed by varying word lengths.\nExtensive experiments and ablations have been conducted, and the results\ndemonstrate that the proposed method outperforms the existing methods both\nqualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:54:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Das","Alloy",""],["Roy","Prasun",""],["Bhattacharya","Saumik",""],["Ghosh","Subhankar",""],["Pal","Umapada",""],["Blumenstein","Michael",""]]}
{"id":"2308.02906","submitter":"Jonathan Sterling","authors":"Frederik Lerbjerg Aagaard, Jonathan Sterling, and Lars Birkedal","title":"A denotationally-based program logic for higher-order store","comments":"To appear in proceedings of MFPS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Separation logic is used to reason locally about stateful programs. State of\nthe art program logics for higher-order store are usually built on top of\nuntyped operational semantics, in part because traditional denotational methods\nhave struggled to simultaneously account for general references and parametric\npolymorphism. The recent discovery of simple denotational semantics for general\nreferences and polymorphism in synthetic guarded domain theory has enabled us\nto develop TULIP, a higher-order separation logic over the typed equational\ntheory of higher-order store for a monadic version of System F{mu,ref}. The\nTulip logic differs from operationally-based program logics in two ways:\npredicates range over the meanings of typed terms rather than over the raw code\nof untyped terms, and they are automatically invariant under the equational\ncongruence of higher-order store, which applies even underneath a binder. As a\nresult, \"pure\" proof steps that conventionally require focusing the Hoare\ntriple on an operational redex are replaced by a simple equational rewrite in\nTulip. We have evaluated Tulip against standard examples involving linked lists\nin the heap, comparing our abstract equational reasoning with more familiar\noperational-style reasoning. Our main result is the soundness of Tulip, which\nwe establish by constructing a BI-hyperdoctrine over the denotational semantics\nof F{mu,ref} in an impredicative version of synthetic guarded domain theory.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:54:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aagaard","Frederik Lerbjerg",""],["Sterling","Jonathan",""],["Birkedal","Lars",""]]}
{"id":"2308.02907","submitter":"Kasra EdalatNejad","authors":"Kasra EdalatNejad, Wouter Lueks, Justinas Sukaitis, Vincent Graf\n  Narbel, Massimo Marelli, Carmela Troncoso","title":"Janus: Safe Biometric Deduplication for Humanitarian Aid Distribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Humanitarian organizations provide aid to people in need. To use their\nlimited budget efficiently, their distribution processes must ensure that\nlegitimate recipients cannot receive more aid than they are entitled to. Thus,\nit is essential that recipients can register at most once per aid program.\nTaking the International Committee of the Red Cross's aid distribution\nregistration process as a use case, we identify the requirements to detect\ndouble registration without creating new risks for aid recipients. We then\ndesign Janus, which combines privacy-enhancing technologies with biometrics to\nprevent double registration in a safe manner. Janus does not create plaintext\nbiometric databases and reveals only one bit of information at registration\ntime (whether the user registering is present in the database or not). We\nimplement and evaluate three instantiations of Janus based on secure multiparty\ncomputation, somewhat homomorphic encryption, and trusted execution\nenvironments. We demonstrate that they support the privacy, accuracy, and\nperformance needs of humanitarian organizations. We compare Janus with existing\nalternatives and show it is the first system that provides the accuracy our\nscenario requires while providing strong protection.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:59:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["EdalatNejad","Kasra",""],["Lueks","Wouter",""],["Sukaitis","Justinas",""],["Narbel","Vincent Graf",""],["Marelli","Massimo",""],["Troncoso","Carmela",""]]}
{"id":"2308.02908","submitter":"Yanqi Bao","authors":"Yanqi Bao, Yuxin Li, Jing Huo, Tianyu Ding, Xinyue Liang, Wenbin Li\n  and Yang Gao","title":"Where and How: Mitigating Confusion in Neural Radiance Fields from\n  Sparse Inputs","comments":"Accepted In Proceedings of the 31st ACM International Conference on\n  Multimedia (MM' 23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural Radiance Fields from Sparse input} (NeRF-S) have shown great potential\nin synthesizing novel views with a limited number of observed viewpoints.\nHowever, due to the inherent limitations of sparse inputs and the gap between\nnon-adjacent views, rendering results often suffer from over-fitting and foggy\nsurfaces, a phenomenon we refer to as \"CONFUSION\" during volume rendering. In\nthis paper, we analyze the root cause of this confusion and attribute it to two\nfundamental questions: \"WHERE\" and \"HOW\". To this end, we present a novel\nlearning framework, WaH-NeRF, which effectively mitigates confusion by tackling\nthe following challenges: (i)\"WHERE\" to Sample? in NeRF-S -- we introduce a\nDeformable Sampling strategy and a Weight-based Mutual Information Loss to\naddress sample-position confusion arising from the limited number of\nviewpoints; and (ii) \"HOW\" to Predict? in NeRF-S -- we propose a\nSemi-Supervised NeRF learning Paradigm based on pose perturbation and a\nPixel-Patch Correspondence Loss to alleviate prediction confusion caused by the\ndisparity between training and testing viewpoints. By integrating our proposed\nmodules and loss functions, WaH-NeRF outperforms previous methods under the\nNeRF-S setting. Code is available https://github.com/bbbbby-99/WaH-NeRF.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:59:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bao","Yanqi",""],["Li","Yuxin",""],["Huo","Jing",""],["Ding","Tianyu",""],["Liang","Xinyue",""],["Li","Wenbin",""],["Gao","Yang",""]]}
{"id":"2308.02909","submitter":"Martin Winter","authors":"Raman Sanyal, Martin Winter","title":"Kalai's $3^{d}$-conjecture for unconditional and locally anti-blocking\n  polytopes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kalai's $3^d$-conjecture states that every centrally symmetric $d$-polytope\nhas at least $3^d$ faces. We give short proofs for two special cases: if $P$ is\nunconditional (that is, invariant w.r.t. reflection in any coordinate\nhyperplane), and more generally, if $P$ is locally anti-blocking (that is,\nlooks like an unconditional polytope in every orthant). In both cases we show\nthat the minimum is attained exactly for the Hanner polytopes.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:00:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sanyal","Raman",""],["Winter","Martin",""]]}
{"id":"2308.02910","submitter":"Kritphon Phanrattanachai","authors":"Therdpong Daengsi, Pakkasit Sriamorntrakul, Surachai Chatchalermpun,\n  Kritphon Phanrattanachai","title":"5G Quality of Service in Bangkok and Metropolitan Areas: Revisiting BTS\n  Skytrain Station Areas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This article compares two of the leading mobile network operators in\nThailand's telecom market in terms of the service quality of Thailand's 5G\nnetworks. The following three factors, download speed, upload speed and\nlatency, which are frequently considered to be indicators of the quality of\nInternet networks, were examined. The researchers employed the test results to\ndetermine an average grade of service that was reached by comparing newly\ncollected data to data that had previously been examined utilizing the same\nformat and application in the middle of May 2021. The typical upload speed\ndropped from 62.6 Mbps in 2021 to 52.0 Mbps in 2023, while the latency\nincreased from 14.9 to 23.3 milliseconds on average. It was established that\nthe results delivered considerably enhanced quality values despite the fact\nthat the test region in this study only comprised BTS stations. Furthermore,\nthis was the case despite the fact that the test area in this study only\nencompassed a small percentage of the total population.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:00:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Daengsi","Therdpong",""],["Sriamorntrakul","Pakkasit",""],["Chatchalermpun","Surachai",""],["Phanrattanachai","Kritphon",""]]}
{"id":"2308.02911","submitter":"Myeong Soo Kang","authors":"Chang Kyun Ha, Eun Mi Kim, Kyoung Jun Moon, and Myeong Soo Kang","title":"Optical vortex harmonic generation facilitated by photonic spin-orbit\n  entanglement","comments":"52 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Photons can undergo spin-orbit coupling, by which the polarization (spin) and\nspatial profile (orbit) of the electromagnetic field interact and mix. Strong\nphotonic spin-orbit coupling may reportedly arise from light propagation\nconfined in a small cross-section, where the optical modes feature spin-orbit\nentanglement. However, while photonic Hamiltonians generally exhibit\nnonlinearity, the role and implication of spin-orbit entanglement in nonlinear\noptics have received little attention and are still elusive. Here, we report\nthe first experimental demonstration of nonlinear optical frequency conversion,\nwhere spin-orbit entanglement facilitates spin-to-orbit transfer among\ndifferent optical frequencies. By pumping a multimode optical nanofiber with a\nspin-polarized Gaussian pump beam, we produce an optical vortex at the third\nharmonic, which has long been regarded as a forbidden process in isotropic\nmedia. Our findings offer a unique and powerful means for efficient optical\nvortex generation that only incorporates a single Gaussian pump beam, in sharp\ncontrast to any other approaches employing structured pump fields or\nsophisticatedly designed media. Our work opens up new possibilities of\nspin-orbit-coupling subwavelength waveguides, inspiring fundamental studies of\nnonlinear optics involving various types of structured light, as well as paving\nthe way for the realization of hybrid quantum systems comprised of telecom\nphotonic networks and long-lived quantum memories.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:01:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ha","Chang Kyun",""],["Kim","Eun Mi",""],["Moon","Kyoung Jun",""],["Kang","Myeong Soo",""]]}
{"id":"2308.02912","submitter":"Cheng Chen","authors":"Cheng Chen","title":"Multiplicity formula for induced representations: Bessel and\n  Fourier-Jacobi models over Archimedean local fields","comments":"70 pages, Appendix coauthor with Rui Chen and Jialiang Zou, all\n  comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article proves a formula relating the multiplicity of an induced\nrepresentation and that of the inducing datum for the Bessel and the\nFourier-Jacobi models over Archimedean local fields by generalizing the\napproach of C. Moeglin and J.-L. Waldspurger in [MW12], which was successful\nfor Bessel models of special orthogonal groups over non-Archimedean local\nfields. As an application, we give a uniform proof of the local\nGan-Gross-Prasad conjecture for all classical groups over Archimedean local\nfields for generic local $L$-parameters based on the tempered basic cases.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:06:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Cheng",""]]}
{"id":"2308.02913","submitter":"Quntao Zhuang","authors":"Anthony J. Brady, Alec Eickbusch, Shraddha Singh, Jing Wu and Quntao\n  Zhuang","title":"Advances in Bosonic Quantum Error Correction with\n  Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications","comments":"77+5 pages, 31 figures. Minor bugs fixed in v2. comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Encoding quantum information into a set of harmonic oscillators is considered\na hardware efficient approach to mitigate noise for reliable quantum\ninformation processing. Various codes have been proposed to encode a qubit into\nan oscillator -- including cat codes, binomial codes and\nGottesman-Kitaev-Preskill (GKP) codes. These bosonic codes are among the first\nto reach a break-even point for quantum error correction. Furthermore, GKP\nstates not only enable close-to-optimal quantum communication rates in bosonic\nchannels, but also allow for error correction of an oscillator into many\noscillators. This review focuses on the basic working mechanism, performance\ncharacterization, and the many applications of GKP codes, with emphasis on\nrecent experimental progress in superconducting circuit architectures and\ntheoretical progress in multimode GKP qubit codes and\noscillators-to-oscillators (O2O) codes. We begin with a preliminary\ncontinuous-variable formalism needed for bosonic codes. We then proceed to the\nquantum engineering involved to physically realize GKP states. We take a deep\ndive into GKP stabilization and preparation in superconducting architectures\nand examine proposals for realizing GKP states in the optical domain (along\nwith a concise review of GKP realization in trapped-ion platforms). Finally, we\npresent multimode GKP qubits and GKP-O2O codes, examine code performance and\ndiscuss applications of GKP codes in quantum information processing tasks such\nas computing, communication, and sensing.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:10:47 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 03:54:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Brady","Anthony J.",""],["Eickbusch","Alec",""],["Singh","Shraddha",""],["Wu","Jing",""],["Zhuang","Quntao",""]]}
{"id":"2308.02914","submitter":"Kleyton da Costa Mr.","authors":"Kleyton da Costa","title":"Anomaly Detection in Global Financial Markets with Graph Neural Networks\n  and Nonextensive Entropy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI q-fin.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Anomaly detection is a challenging task, particularly in systems with many\nvariables. Anomalies are outliers that statistically differ from the analyzed\ndata and can arise from rare events, malfunctions, or system misuse. This study\ninvestigated the ability to detect anomalies in global financial markets\nthrough Graph Neural Networks (GNN) considering an uncertainty scenario\nmeasured by a nonextensive entropy. The main findings show that the complex\nstructure of highly correlated assets decreases in a crisis, and the number of\nanomalies is statistically different for nonextensive entropy parameters\nconsidering before, during, and after crisis.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:12:26 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 02:47:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["da Costa","Kleyton",""]]}
{"id":"2308.02915","submitter":"Le Zhuo","authors":"Qiaosong Qi, Le Zhuo, Aixi Zhang, Yue Liao, Fei Fang, Si Liu,\n  Shuicheng Yan","title":"DiffDance: Cascaded Human Motion Diffusion Model for Dance Generation","comments":"Accepted at ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612307","report-no":null,"categories":"cs.GR cs.CV cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  When hearing music, it is natural for people to dance to its rhythm.\nAutomatic dance generation, however, is a challenging task due to the physical\nconstraints of human motion and rhythmic alignment with target music.\nConventional autoregressive methods introduce compounding errors during\nsampling and struggle to capture the long-term structure of dance sequences. To\naddress these limitations, we present a novel cascaded motion diffusion model,\nDiffDance, designed for high-resolution, long-form dance generation. This model\ncomprises a music-to-dance diffusion model and a sequence super-resolution\ndiffusion model. To bridge the gap between music and motion for conditional\ngeneration, DiffDance employs a pretrained audio representation learning model\nto extract music embeddings and further align its embedding space to motion via\ncontrastive loss. During training our cascaded diffusion model, we also\nincorporate multiple geometric losses to constrain the model outputs to be\nphysically plausible and add a dynamic loss weight that adaptively changes over\ndiffusion timesteps to facilitate sample diversity. Through comprehensive\nexperiments performed on the benchmark dataset AIST++, we demonstrate that\nDiffDance is capable of generating realistic dance sequences that align\neffectively with the input music. These results are comparable to those\nachieved by state-of-the-art autoregressive methods.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:18:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Qi","Qiaosong",""],["Zhuo","Le",""],["Zhang","Aixi",""],["Liao","Yue",""],["Fang","Fei",""],["Liu","Si",""],["Yan","Shuicheng",""]]}
{"id":"2308.02916","submitter":"Yuwen Wang","authors":"Yuwen Wang, Shunyu Liu, Kaixuan Chen, Tongtian Zhu, Ji Qiao, Mengjie\n  Shi, Yuanyu Wan, Mingli Song","title":"Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery\n  Ticket","comments":"17 pages, 10 figures, Accept by ECAI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Lottery Ticket (GLT), a combination of core subgraph and sparse\nsubnetwork, has been proposed to mitigate the computational cost of deep Graph\nNeural Networks (GNNs) on large input graphs while preserving original\nperformance. However, the winning GLTs in exisiting studies are obtained by\napplying iterative magnitude-based pruning (IMP) without re-evaluating and\nre-considering the pruned information, which disregards the dynamic changes in\nthe significance of edges/weights during graph/model structure pruning, and\nthus limits the appeal of the winning tickets. In this paper, we formulate a\nconjecture, i.e., existing overlooked valuable information in the pruned graph\nconnections and model parameters which can be re-grouped into GLT to enhance\nthe final performance. Specifically, we propose an adversarial complementary\nerasing (ACE) framework to explore the valuable information from the pruned\ncomponents, thereby developing a more powerful GLT, referred to as the ACE-GLT.\nThe main idea is to mine valuable information from pruned edges/weights after\neach round of IMP, and employ the ACE technique to refine the GLT processing.\nFinally, experimental results demonstrate that our ACE-GLT outperforms existing\nmethods for searching GLT in diverse tasks. Our code will be made publicly\navailable.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:21:12 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 18:10:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Yuwen",""],["Liu","Shunyu",""],["Chen","Kaixuan",""],["Zhu","Tongtian",""],["Qiao","Ji",""],["Shi","Mengjie",""],["Wan","Yuanyu",""],["Song","Mingli",""]]}
{"id":"2308.02917","submitter":"Florentin Liebmann MSc","authors":"Florentin Liebmann, Marco von Atzigen, Dominik St\\\"utz, Julian Wolf,\n  Lukas Zingg, Daniel Suter, Laura Leoty, Hooman Esfandiari, Jess G. Snedeker,\n  Martin R. Oswald, Marc Pollefeys, Mazda Farshad, Philipp F\\\"urnstahl","title":"Automatic registration with continuous pose updates for marker-less\n  surgical navigation in spine surgery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Established surgical navigation systems for pedicle screw placement have been\nproven to be accurate, but still reveal limitations in registration or surgical\nguidance. Registration of preoperative data to the intraoperative anatomy\nremains a time-consuming, error-prone task that includes exposure to harmful\nradiation. Surgical guidance through conventional displays has well-known\ndrawbacks, as information cannot be presented in-situ and from the surgeon's\nperspective. Consequently, radiation-free and more automatic registration\nmethods with subsequent surgeon-centric navigation feedback are desirable. In\nthis work, we present an approach that automatically solves the registration\nproblem for lumbar spinal fusion surgery in a radiation-free manner. A deep\nneural network was trained to segment the lumbar spine and simultaneously\npredict its orientation, yielding an initial pose for preoperative models,\nwhich then is refined for each vertebra individually and updated in real-time\nwith GPU acceleration while handling surgeon occlusions. An intuitive surgical\nguidance is provided thanks to the integration into an augmented reality based\nnavigation system. The registration method was verified on a public dataset\nwith a mean of 96\\% successful registrations, a target registration error of\n2.73 mm, a screw trajectory error of 1.79{\\deg} and a screw entry point error\nof 2.43 mm. Additionally, the whole pipeline was validated in an ex-vivo\nsurgery, yielding a 100\\% screw accuracy and a registration accuracy of 1.20\nmm. Our results meet clinical demands and emphasize the potential of RGB-D data\nfor fully automatic registration approaches in combination with augmented\nreality guidance.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:26:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liebmann","Florentin",""],["von Atzigen","Marco",""],["St\u00fctz","Dominik",""],["Wolf","Julian",""],["Zingg","Lukas",""],["Suter","Daniel",""],["Leoty","Laura",""],["Esfandiari","Hooman",""],["Snedeker","Jess G.",""],["Oswald","Martin R.",""],["Pollefeys","Marc",""],["Farshad","Mazda",""],["F\u00fcrnstahl","Philipp",""]]}
{"id":"2308.02918","submitter":"Mengxin Yu","authors":"Jianqing Fan, Zhipeng Lou, Weichen Wang, Mengxin Yu","title":"Spectral Ranking Inferences based on General Multiway Comparisons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.IT cs.LG math.IT math.ST stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the performance of the spectral method in the estimation\nand uncertainty quantification of the unobserved preference scores of compared\nentities in a very general and more realistic setup in which the comparison\ngraph consists of hyper-edges of possible heterogeneous sizes and the number of\ncomparisons can be as low as one for a given hyper-edge. Such a setting is\npervasive in real applications, circumventing the need to specify the graph\nrandomness and the restrictive homogeneous sampling assumption imposed in the\ncommonly-used Bradley-Terry-Luce (BTL) or Plackett-Luce (PL) models.\nFurthermore, in the scenarios when the BTL or PL models are appropriate, we\nunravel the relationship between the spectral estimator and the Maximum\nLikelihood Estimator (MLE). We discover that a two-step spectral method, where\nwe apply the optimal weighting estimated from the equal weighting vanilla\nspectral method, can achieve the same asymptotic efficiency as the MLE. Given\nthe asymptotic distributions of the estimated preference scores, we also\nintroduce a comprehensive framework to carry out both one-sample and two-sample\nranking inferences, applicable to both fixed and random graph settings. It is\nnoteworthy that it is the first time effective two-sample rank testing methods\nare proposed. Finally, we substantiate our findings via comprehensive numerical\nsimulations and subsequently apply our developed methodologies to perform\nstatistical inferences on statistics journals and movie rankings.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:31:32 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 13:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fan","Jianqing",""],["Lou","Zhipeng",""],["Wang","Weichen",""],["Yu","Mengxin",""]]}
{"id":"2308.02919","submitter":"Abhijit Chatterjee","authors":"Swati Rana, Dayadeep S. Monder and Abhijit Chatterjee","title":"Thermodynamic calculations using reverse Monte Carlo: A computational\n  workflow for accelerated construction of phase diagrams for metal hydrides","comments":"31 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Metal hydrides are promising candidates for hydrogen storage applications.\nFrom a materials discovery perspective, an accurate, efficient computational\nworkflow is urgently required that can rapidly analyze/predict thermodynamic\nproperties of these materials. The authors have recently introduced a\nthermodynamic property calculation framework based on the lattice reverse Monte\nCarlo (RMC) method. Here the approach is extended to metal hydrides, which\nexhibit significant volume expansion, strong interaction between hydrogen and\nthe host atoms, lattice strain, and a phase transition. We apply the technique\nto the nickel hydride (NiH_x) system by calculating the\npressure-composition-temperature (PCT) isotherm and constructing its phase\ndiagram. An attractive feature of our approach is that the entire phase diagram\ncan be accurately constructed in few minutes by considering <10 configurations.\nIn contrast, a popular technique based on grand canonical Monte Carlo would\nrequire sampling of several million configurations. The computational workflow\npresented paves the way for the approach to be used in future for wider\nmaterials search and discovery.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:42:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rana","Swati",""],["Monder","Dayadeep S.",""],["Chatterjee","Abhijit",""]]}
{"id":"2308.02920","submitter":"Juan Antonio Aguilar S\\'anchez Dr.","authors":"Giovanni Renzi, Juan A. Aguilar (for the IceCube Collaboration)","title":"Search for dark matter annihilations in the center of the Earth with\n  IceCube","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-1393","categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nature of Dark Matter remains one of the most important unresolved\nquestions of fundamental physics. Many models, including the Weakly Interacting\nMassive Particles (WIMPs), assume Dark Matter to be a particle and predict a\nweak coupling with Standard Model matter. If Dark Matter particles can scatter\noff nuclei in the vicinity of a massive object, such as a star or a planet,\nthey may lose kinetic energy and become gravitationally trapped in the center\nof such objects, including Earth. As Dark Matter accumulates in the center of\nthe Earth, self-annihilation of WIMPs into Standard Model particles can result\nin an excess of neutrinos coming from the center of the Earth and detectable at\nthe IceCube Neutrino Observatory, situated at the geographic South Pole. A\nsearch for excess neutrinos from these annihilations has been performed on 10\nyears of IceCube data, and results have been interpreted in the context of a\nnumber of WIMP annihilation channels\n($\\chi\\chi\\rightarrow\\tau^+\\tau^-/W^+W^-/b\\bar{b}$) and masses ranging from 10\nGeV to 10 TeV. We present the results from this analysis and compare the\noutcome with previous searches by other experiments. This analysis yields\ncompetitive and world-leading results for masses $m_\\chi$ > 100 GeV.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:43:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Renzi","Giovanni","","for the IceCube Collaboration"],["Aguilar","Juan A.","","for the IceCube Collaboration"]]}
{"id":"2308.02921","submitter":"Jose Daniel Lara","authors":"Jose Daniel Lara and Rodrigo Henriquez-Auba and Matthew Bossart and\n  Duncan S. Callaway and Clayton Barrows","title":"PowerSimulationsDynamics.jl -- An Open Source Modeling Package for\n  Modern Power Systems with Inverter-Based Resources","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The inclusion of inverter-based resources from renewable energy creates new\nchallenges for the stability and transient behavior of power systems which are\nbest understood by studying their dynamic responses through simulation. In this\npaper, we develop an open source simulation toolbox,\nPowerSimulationDynamics.jl, to study the dynamic response of a balanced system\nwith high penetration of inverter-based resources. PowerSimulationDynamics.jl\nis implemented in the Julia language and features a rich library of synchronous\ngenerator components and inverter models. In addition, it allows the study of\nboth quasi-static phasors that employ an admittance matrix representation for\nthe network and electromagnetic dq models that use a dynamic representation of\nthe network. Case studies and validation exercises show that\nPowerSimulationDynamics.jl results closely match Quasi-Static Phasor (QSP)\ntools like Siemens PSSe, ANDES, and wave-form Electro-magnetic Transient (EMT)\nsimulations like PSCAD\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:54:59 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 17:29:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lara","Jose Daniel",""],["Henriquez-Auba","Rodrigo",""],["Bossart","Matthew",""],["Callaway","Duncan S.",""],["Barrows","Clayton",""]]}
{"id":"2308.02922","submitter":"Waheed Bajwa","authors":"Batoul Taki, Anand D. Sarwate, and Waheed U. Bajwa","title":"Structured Low-Rank Tensors for Generalized Linear Models","comments":"43 pages; published in Transactions on Machine Learning Research\n  (08/2023)","journal-ref":"Transactions on Machine Learning Research, Aug. 2023\n  (https://openreview.net/forum?id=qUxBs3Ln41)","doi":null,"report-no":null,"categories":"stat.ML cs.LG eess.SP math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent works have shown that imposing tensor structures on the coefficient\ntensor in regression problems can lead to more reliable parameter estimation\nand lower sample complexity compared to vector-based methods. This work\ninvestigates a new low-rank tensor model, called Low Separation Rank (LSR), in\nGeneralized Linear Model (GLM) problems. The LSR model -- which generalizes the\nwell-known Tucker and CANDECOMP/PARAFAC (CP) models, and is a special case of\nthe Block Tensor Decomposition (BTD) model -- is imposed onto the coefficient\ntensor in the GLM model. This work proposes a block coordinate descent\nalgorithm for parameter estimation in LSR-structured tensor GLMs. Most\nimportantly, it derives a minimax lower bound on the error threshold on\nestimating the coefficient tensor in LSR tensor GLM problems. The minimax bound\nis proportional to the intrinsic degrees of freedom in the LSR tensor GLM\nproblem, suggesting that its sample complexity may be significantly lower than\nthat of vectorized GLMs. This result can also be specialised to lower bound the\nestimation error in CP and Tucker-structured GLMs. The derived bounds are\ncomparable to tight bounds in the literature for Tucker linear regression, and\nthe tightness of the minimax lower bound is further assessed numerically.\nFinally, numerical experiments on synthetic datasets demonstrate the efficacy\nof the proposed LSR tensor model for three regression types (linear, logistic\nand Poisson). Experiments on a collection of medical imaging datasets\ndemonstrate the usefulness of the LSR model over other tensor models (Tucker\nand CP) on real, imbalanced data with limited available samples.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 17:20:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Taki","Batoul",""],["Sarwate","Anand D.",""],["Bajwa","Waheed U.",""]]}
{"id":"2308.02923","submitter":"Aneeqa Ijaz","authors":"Aneeqa Ijaz, Waseem Raza, Hasan Farooq, Marvin Manalastas, Ali Imran","title":"An AI-Enabled Framework to Defend Ingenious MDT-based Attacks on the\n  Emerging Zero Touch Cellular Networks","comments":"15 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Deep automation provided by self-organizing network (SON) features and their\nemerging variants such as zero touch automation solutions is a key enabler for\nincreasingly dense wireless networks and pervasive Internet of Things (IoT). To\nrealize their objectives, most automation functionalities rely on the\nMinimization of Drive Test (MDT) reports. The MDT reports are used to generate\ninferences about network state and performance, thus dynamically change network\nparameters accordingly. However, the collection of MDT reports from commodity\nuser devices, particularly low cost IoT devices, make them a vulnerable entry\npoint to launch an adversarial attack on emerging deeply automated wireless\nnetworks. This adds a new dimension to the security threats in the IoT and\ncellular networks. Existing literature on IoT, SON, or zero touch automation\ndoes not address this important problem. In this paper, we investigate an\nimpactful, first of its kind adversarial attack that can be launched by\nexploiting the malicious MDT reports from the compromised user equipment (UE).\nWe highlight the detrimental repercussions of this attack on the performance of\ncommon network automation functions. We also propose a novel Malicious MDT\nReports Identification framework (MRIF) as a countermeasure to detect and\neliminate the malicious MDT reports using Machine Learning and verify it\nthrough a use-case. Thus, the defense mechanism can provide the resilience and\nrobustness for zero touch automation SON engines against the adversarial MDT\nattacks\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 17:21:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ijaz","Aneeqa",""],["Raza","Waseem",""],["Farooq","Hasan",""],["Manalastas","Marvin",""],["Imran","Ali",""]]}
{"id":"2308.02924","submitter":"Dominique Vuillaume","authors":"C\\'ecile Huez, Maxime Berthe, Florence Volatron, Jean-Michel Guigner,\n  Dalil Brouri, Lise-Marie Chamoreau, Beno\\^it Baptiste, Anna Proust and\n  Dominique Vuillaume","title":"Highly Conductive Tungsten Suboxide Nanotubes","comments":"Main text and supporting information","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We demonstrate a high electron conductivity (> 10^2 S/cm and up to 10^3 S/cm)\nof tungsten suboxide W18O(52.4-52.9)(or equivalently WO(2.91-2.94)) nanotubes\n(2 to 3 nm in diameter, ca. micrometer long). The conductivity is measured in\nthe temperature range 120 to 300K by a four probe scanning tunneling microscope\nin ultra high vacuum. The nanotubes are synthesized by a low temperature and\nlow cost solvothermal method. They selfassemble in bundles of hundreds of\nnanotubes forming nanowires (ca. micrometer long, few tens nm wide). We observe\na large anisotropy of the conductivity with a ratio (longitudinal\nconductivity/perpendicular conductivity) of ca. 10^5. A large fraction of them\n(ca. 65 to 95%) shows a metallic like, thermal activation less, electron\ntransport behavior. Few of them, with a lower conductivity from 10 to 10^2\nS/cm, display a variable range hopping behavior. In this latter case, a hopping\nbarrier energy of ca. 0.24 eV is inferred in agreement with the calculated\nenergy level of the oxygen vacancy below the conduction band. This result is in\nagreement with a relative average concentration of oxygen vacancies of ca. 3%,\nfor which a semiconductor to metal transition was theoretically predicted.\nThese tungsten suboxide nanostructures are prone to a wide range of\napplications in nanoelectronics.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 17:21:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huez","C\u00e9cile",""],["Berthe","Maxime",""],["Volatron","Florence",""],["Guigner","Jean-Michel",""],["Brouri","Dalil",""],["Chamoreau","Lise-Marie",""],["Baptiste","Beno\u00eet",""],["Proust","Anna",""],["Vuillaume","Dominique",""]]}
{"id":"2308.02925","submitter":"Hao Wang","authors":"Hao Wang, Jianxun Lian, Mingqi Wu, Haoxuan Li, Jiajun Fan, Wanyue Xu,\n  Chaozhuo Li, Xing Xie","title":"ConvFormer: Revisiting Transformer for Sequential User Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.IR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sequential user modeling, a critical task in personalized recommender\nsystems, focuses on predicting the next item a user would prefer, requiring a\ndeep understanding of user behavior sequences. Despite the remarkable success\nof Transformer-based models across various domains, their full potential in\ncomprehending user behavior remains untapped. In this paper, we re-examine\nTransformer-like architectures aiming to advance state-of-the-art performance.\nWe start by revisiting the core building blocks of Transformer-based methods,\nanalyzing the effectiveness of the item-to-item mechanism within the context of\nsequential user modeling. After conducting a thorough experimental analysis, we\nidentify three essential criteria for devising efficient sequential user\nmodels, which we hope will serve as practical guidelines to inspire and shape\nfuture designs. Following this, we introduce ConvFormer, a simple but powerful\nmodification to the Transformer architecture that meets these criteria,\nyielding state-of-the-art results. Additionally, we present an acceleration\ntechnique to minimize the complexity associated with processing extremely long\nsequences. Experiments on four public datasets showcase ConvFormer's\nsuperiority and confirm the validity of our proposed criteria.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 17:33:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Hao",""],["Lian","Jianxun",""],["Wu","Mingqi",""],["Li","Haoxuan",""],["Fan","Jiajun",""],["Xu","Wanyue",""],["Li","Chaozhuo",""],["Xie","Xing",""]]}
{"id":"2308.02926","submitter":"Haoxiang Shi","authors":"Haoxiang Shi, Sumio Fujita and Tetsuya Sakai","title":"Towards Consistency Filtering-Free Unsupervised Learning for Dense\n  Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Domain transfer is a prevalent challenge in modern neural Information\nRetrieval (IR). To overcome this problem, previous research has utilized\ndomain-specific manual annotations and synthetic data produced by consistency\nfiltering to finetune a general ranker and produce a domain-specific ranker.\nHowever, training such consistency filters are computationally expensive, which\nsignificantly reduces the model efficiency. In addition, consistency filtering\noften struggles to identify retrieval intentions and recognize query and corpus\ndistributions in a target domain. In this study, we evaluate a more efficient\nsolution: replacing the consistency filter with either direct pseudo-labeling,\npseudo-relevance feedback, or unsupervised keyword generation methods for\nachieving consistent filtering-free unsupervised dense retrieval. Our extensive\nexperimental evaluations demonstrate that, on average, TextRank-based pseudo\nrelevance feedback outperforms other methods. Furthermore, we analyzed the\ntraining and inference efficiency of the proposed paradigm. The results\nindicate that filtering-free unsupervised learning can continuously improve\ntraining and inference efficiency while maintaining retrieval performance. In\nsome cases, it can even improve performance based on particular datasets.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 17:33:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shi","Haoxiang",""],["Fujita","Sumio",""],["Sakai","Tetsuya",""]]}
{"id":"2308.02927","submitter":"Shir Cohen","authors":"Shir Cohen and Idit Keidar","title":"Subquadratic Multivalued Asynchronous Byzantine Agreement WHP","comments":"arXiv admin note: text overlap with arXiv:2002.06545","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There have been several reductions from multivalued consensus to binary\nconsensus over the past 20 years. To the best of our knowledge, none of them\nsolved it for Byzantine asynchronous settings. In this paper, we close this\ngap. Moreover, we do so in subquadratic communication, using newly developed\nsubquadratic binary Byzantine Agreement techniques.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 17:36:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cohen","Shir",""],["Keidar","Idit",""]]}
{"id":"2308.02928","submitter":"Nick Abboud","authors":"Nick Abboud, Enrico Speranza, Jorge Noronha","title":"Causal and stable first-order chiral hydrodynamics","comments":"21 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive the set of inequalities that is necessary and sufficient for\nnonlinear causality and linear stability of first-order relativistic\nhydrodynamics with either a $U(1)_V$ conserved current or a $U(1)_A$ current\nwith a chiral anomaly or both. Our results apply to generic hydrodynamic frames\nin which no relations among the transport parameters are imposed. Furthermore,\nour analysis yields the first theory of viscous chiral hydrodynamics proven to\nbe causal and stable. We find that causality demands the absence of\nvorticity-induced heat flux, forcing a departure from the thermodynamic frame\nin the chiral case. The inequalities for causality and stability define a\nhypervolume in the space of transport parameters, wherein each point\ncorresponds to a consistent formulation. Notably, causality is determined by\njust three combinations of transport parameters. We present our results in a\nform amenable to numerical hydrodynamic simulations.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:00:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Abboud","Nick",""],["Speranza","Enrico",""],["Noronha","Jorge",""]]}
{"id":"2308.02929","submitter":"Tiju Cherian John","authors":"George Androulakis, Tiju Cherian John","title":"Quantum $f$-divergences via Nussbaum-Szko{\\l}a Distributions and\n  Applications to $f$-divergence Inequalities","comments":"Text overlap with arXiv:2203.01964v2. That article is divided into\n  two different articles. The present article is the first one in this series\n  and contains two new sections including a review section. Accepted for\n  publication at Rev. Math. Phys. 27 pages","journal-ref":null,"doi":"10.1142/S0129055X23600024","report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The main result in this article shows that the quantum $f$-divergence of two\nstates is equal to the classical $f$-divergence of the corresponding\nNussbaum-Szko{\\l}a distributions. This provides a general framework for\nstudying certain properties of quantum entropic quantities using the\ncorresponding classical entities. The usefulness of the main result is\nillustrated by obtaining several quantum $f$-divergence inequalities from their\nclassical counterparts. All results presented here are valid in both finite and\ninfinite dimensions and hence can be applied to continuous variable systems as\nwell. A comprehensive review of the instances in the literature where\nNussbaum-Szko{\\l}a distributions are used, is also provided in this article.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:03:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Androulakis","George",""],["John","Tiju Cherian",""]]}
{"id":"2308.02930","submitter":"Haidar Badawi","authors":"Haidar Badawi and Hawraa Alsayed","title":"Polynomial stability of thermoelastic Timoshenko system with non-global\n  time-delayed Cattaneo's law","comments":"arXiv admin note: substantial text overlap with arXiv:2110.06619,\n  arXiv:2012.08219","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we consider a one dimensional thermoelastic Timoshenko system\nin which the heat flux is given by Cattaneo's law and acts locally on the\nbending moment with a time delay. We prove its well-posedness, strong\nstability, and polynomial stability.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:11:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Badawi","Haidar",""],["Alsayed","Hawraa",""]]}
{"id":"2308.02931","submitter":"Francisco Aparecido Rodrigues","authors":"Aruane M. Pineda, Sandro M. Reia, Colm Connaughton, Jos\\'e F.\n  Fontanari and Francisco A. Rodrigues","title":"Cultural heterogeneity constrains diffusion of innovations","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rogers' diffusion of innovations theory asserts that cultural similarity\namong individuals plays a crucial role in the acceptance of an innovation in a\ncommunity. However, most studies on the diffusion of innovations have relied on\nepidemic-like models where the individuals have no preference on whom they\ninteract with. Here, we use an agent-based model to study the diffusion of\ninnovations in a community of synthetic heterogeneous agents whose interaction\npreferences depend on their cultural similarity. The community heterogeneity\nand the agents' interaction preferences are described by Axelrod's model,\nwhereas the diffusion of innovations is described by a variant of the Daley and\nKendall model of rumour propagation. The interplay between the social dynamics\nand the spreading of the innovation is controlled by the parameter $p \\in\n[0,1]$, which yields the probability that the agent engages in social\ninteraction or attempts to spread the innovation. Our findings support Roger's\nempirical observations that cultural heterogeneity curbs the diffusion of\ninnovations.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:14:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pineda","Aruane M.",""],["Reia","Sandro M.",""],["Connaughton","Colm",""],["Fontanari","Jos\u00e9 F.",""],["Rodrigues","Francisco A.",""]]}
{"id":"2308.02932","submitter":"Daniele Garrisi","authors":"Daniele Garrisi, Vladimir Georgiev","title":"Degeneracy and multiplicity of standing-waves of the one-dimensional\n  non-linear Schr\\\"odinger equation for a class of algebraic non-linearities","comments":"19 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the existence, the stability and the non-degeneracy of normalized\nstanding-waves solutions to a one dimensional non-linear Schr\\\"odinger\nequation. The non-linearity belongs to a class of algebraic functions\nappropriately defined. We can show that for some of these non-linearities one\ncan observe the existence of degenerate minima, and the multiplicity of\npositive, radially symmetric minima having the same mass and the same energy.\nWe also prove the stability of the ground-state and the stability of normalized\nstanding-waves whose profile is a minimum of the energy constrained to the\nmass.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:18:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Garrisi","Daniele",""],["Georgiev","Vladimir",""]]}
{"id":"2308.02933","submitter":"Yifang Wang","authors":"Yifang Wang, Yifan Qian, Xiaoyu Qi, Nan Cao, Dashun Wang","title":"InnovationInsights: A Visual Analytics Approach for Understanding the\n  Dual Frontiers of Science and Technology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Science has long been viewed as a key driver of economic growth and rising\nstandards of living. Knowledge about how scientific advances support\nmarketplace inventions is therefore essential for understanding the role of\nscience in propelling real-world applications and technological progress. The\nincreasing availability of large-scale datasets tracing scientific publications\nand patented inventions and the complex interactions among them offers us new\nopportunities to explore the evolving dual frontiers of science and technology\nat an unprecedented level of scale and detail. However, we lack suitable visual\nanalytics approaches to analyze such complex interactions effectively. Here we\nintroduce InnovationInsights, an interactive visual analysis system for\nresearchers, research institutions, and policymakers to explore the complex\nlinkages between science and technology, and to identify critical innovations,\ninventors, and potential partners. The system first identifies important\nassociations between scientific papers and patented inventions through a set of\nstatistical measures introduced by our experts from the field of the Science of\nScience. A series of visualization views are then used to present these\nassociations in the data context. In particular, we introduce the Interplay\nGraph to visualize patterns and insights derived from the data, helping users\neffectively navigate citation relationships between papers and patents. This\nvisualization thereby helps them identify the origins of technical inventions\nand the impact of scientific research. We evaluate the system through two case\nstudies with experts followed by expert interviews. We further engage a premier\nresearch institution to test-run the system, helping its institution leaders to\nextract new insights for innovation.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:23:06 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 18:00:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Yifang",""],["Qian","Yifan",""],["Qi","Xiaoyu",""],["Cao","Nan",""],["Wang","Dashun",""]]}
{"id":"2308.02934","submitter":"Hyun Kyu Kim","authors":"Hyun Kyu Kim","title":"A trilogy of mapping class group representations from three-dimensional\n  quantum gravity","comments":"32 pages; to appear in the proceedings of the conference in honor of\n  Igor Frenkel's 70th birthday","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math-ph math.MP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a punctured surface $\\mathfrak{S}$, the author and Scarinci have recently\nconstructed a quantization of a moduli space of Lorentzian metrics on the\n3-manifold $\\mathfrak{S} \\times \\mathbb{R}$ of constant sectional curvature\n$\\Lambda \\in \\{-1,0,1\\}$. The invariance of this quantization under the action\nof the mapping class group ${\\rm MCG}(\\mathfrak{S})$ of $\\mathfrak{S}$ yields\nfamilies of unitary representations of ${\\rm MCG}(\\mathfrak{S})$ on a Hilbert\nspace, with key ingredients being three versions of the quantum dilogarithm\nfunctions depending on $\\Lambda$. In this survey article, we review and\nelaborate on this result.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:26:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kim","Hyun Kyu",""]]}
{"id":"2308.02935","submitter":"Zhenpeng Chen","authors":"Xinyue Li and Zhenpeng Chen and Jie M. Zhang and Federica Sarro and\n  Ying Zhang and Xuanzhe Liu","title":"Dark-Skin Individuals Are at More Risk on the Street: Unmasking Fairness\n  Issues of Autonomous Driving Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.CV cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper conducts fairness testing on automated pedestrian detection, a\ncrucial but under-explored issue in autonomous driving systems. We evaluate\neight widely-studied pedestrian detectors across demographic groups on\nlarge-scale real-world datasets. To enable thorough fairness testing, we\nprovide extensive annotations for the datasets, resulting in 8,311 images with\n16,070 gender labels, 20,115 age labels, and 3,513 skin tone labels. Our\nfindings reveal significant fairness issues related to age and skin tone. The\ndetection accuracy for adults is 19.67% higher compared to children, and there\nis a 7.52% accuracy disparity between light-skin and dark-skin individuals.\nGender, however, shows only a 1.1% difference in detection accuracy.\nAdditionally, we investigate common scenarios explored in the literature on\nautonomous driving testing, and find that the bias towards dark-skin\npedestrians increases significantly under scenarios of low contrast and low\nbrightness. We publicly release the code, data, and results to support future\nresearch on fairness in autonomous driving.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:32:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Xinyue",""],["Chen","Zhenpeng",""],["Zhang","Jie M.",""],["Sarro","Federica",""],["Zhang","Ying",""],["Liu","Xuanzhe",""]]}
{"id":"2308.02936","submitter":"Aysha Bibi","authors":"Muhammad Naeem and Aysha Bibi","title":"Correction to the Friedmann equation with Sharma-Mittal entropy: A new\n  perspective on cosmology","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the black hole entropy does not obey the area law on it. The area law,\ngiven by $S\\sim A^\\delta\\text{or}A^R$, where $\\delta$ and $R$ , for\n$0\\leq\\delta\\leq 1$, $0<R\\leq 1$, indicates the amount of quantum gravitational\ndeformation effects. This shows that gravity and thermodynamics are closely\nrelated. Based on this deep connection, we tried to discuss the effects of\nSharma-Mittal entropy on the cosmological equations. We also investigated\nwhether the apparent horizon-enclosed universe was consistence with the\ngeneralized second law of thermodynamics. Finally, using the gravity emergence\nscenario, we derived the modified Friedmann equation and, compared it with that\nderived from the first law of thermodynamics in the presence of Sharma-Mittal\nentropy. It is observed that we can recover the results for standard cosmology\nwhen $R,\\delta=1$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:33:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Naeem","Muhammad",""],["Bibi","Aysha",""]]}
{"id":"2308.02937","submitter":"Jianjun Hu","authors":"Jeffrey Hu, David Liu, Nihang Fu, Rongzhi Dong","title":"Improving realistic material property prediction using domain adaptation\n  based machine learning","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":"  Materials property prediction models are usually evaluated using random\nsplitting of datasets into training and test datasets, which not only leads to\nover-estimated performance due to inherent redundancy, typically existent in\nmaterial datasets, but also deviate away from the common practice of materials\nscientists: they are usually interested in predicting properties for a known\nsubset of related out-of-distribution (OOD) materials rather than a universally\ndistributed samples. Feeding such target material formulas/structures to the\nmachine learning models should improve the prediction performance while most\ncurrent machine learning (ML) models neglect this information. Here we propose\nto use domain adaptation (DA) to enhance current ML models for property\nprediction and evaluate their performance improvements in a set of five\nrealistic application scenarios. Our systematic benchmark studies show that\nthere exist DA models that can significantly improve the OOD test set\nprediction performance while standard ML models and most of the other DAs\ncannot improve or even deteriorate the performance. Our benchmark datasets and\nDA code can be freely accessed at https://github.com/Little-Cheryl/MatDA.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:37:45 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 07:11:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hu","Jeffrey",""],["Liu","David",""],["Fu","Nihang",""],["Dong","Rongzhi",""]]}
{"id":"2308.02938","submitter":"Tien Chih Ph.D.","authors":"Keira Behal, Tien Chih","title":"Fundamental Groups of Hamming Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently there has been growing interest in discrete homotopies and\nhomotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces.\nOne such type of homotopy is $\\times$-homotopy. Recent work by Chih-Scull has\ndeveloped a homotopy category, a fundamental group for graphs under this\nhomotopy, and a way of computing covers of graphs that lift homotopy via this\nfundamental group. In this paper, we compute the fundamental groups of all\nHamming graphs, show that they are direct products of cyclic groups, and use\nthis result to describe some $\\times$-homotopy covers of Hamming graphs.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:46:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Behal","Keira",""],["Chih","Tien",""]]}
{"id":"2308.02939","submitter":"Soumik Aon","authors":"Soumik Aon, Sayani Pal, Subhadip Manna, Chiranjib Mitra, and Partha\n  Mitra","title":"Modulating Spin Current Induced Effective Damping in $\\beta-W/Py$\n  Heterostructures by a Systematic Variation in Resistivity of the Sputtered\n  Deposited $\\beta-W$ films","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Utilizing the spin-induced pumping from a ferromagnet (FM) into a heavy metal\n(HM) under the ferromagnetic resonance (FMR) condition, we report an\nenhancement in effective damping in $\\beta$- W/Py bilayers by systematically\nvarying resistivity ($\\rho_{W}$) of $\\beta$-W films. Different resistivity\nranging from 100 $\\mu\\Omega$-cm to 1400 $\\mu\\Omega$-cm with a thickness of 8 nm\ncan be achieved by varying the argon pressure ($P_{Ar}$) during the growth by\nthe method of sputtering. The coefficient of effective damping $\\alpha_{eff}$\nis observed to increase from 0.010 to 0.025 with $\\rho_{W}$, which can be\nmodulated by $P_{Ar}$. We observe a modest dependence of $\\alpha_{eff}$ on the\nsputtering power ($p_{S}$) while keeping the $P_{Ar}$ constant. $\\alpha_{eff}$\ndependence on both $P_{Ar}$ and $p_{S}$ suggests that there exists a strong\ncorrelation between $\\alpha_{eff}$ and $\\rho_{W}$. It is thus possible to\nutilize $\\rho_{W}$ as a tuning parameter to regulate the $\\alpha_{eff}$, which\ncan be advantageous for faster magnetization dynamics switching. The thickness\ndependence study of Py in the aforementioned bilayers manifests a higher spin\nmixing conductance ($g^{\\uparrow\\downarrow}_{eff}$) which suggests a strong\nspin pumping from Py into the $\\beta$-W layer. The effective spin current\n($J_{S(eff)}$) is also evaluated by considering the spin-back flow in this\nprocess. Intrinsic spin mixing conductance ($g^{\\uparrow\\downarrow}_{W}$) and\nspin diffusion length ($\\lambda_{SD}$) of $\\beta$-W are additionally\ninvestigated using thickness variations in $\\beta$-W. Furthermore, the\nlow-temperature study in $\\beta$-W/Py reveals an intriguing temperature\ndependence in $\\alpha_{eff}$ which is quite different from $\\alpha_{b}$ of\nsingle Py layer and the enhancement in $\\alpha_{eff}$ at low temperature can be\nattributed to the spin-induced pumping from Py layer into $\\beta$-W.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:49:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aon","Soumik",""],["Pal","Sayani",""],["Manna","Subhadip",""],["Mitra","Chiranjib",""],["Mitra","Partha",""]]}
{"id":"2308.02940","submitter":"Sean Kennedy","authors":"Sean Kennedy, Murali Tummala, John McEachen","title":"Topological Estimation of Number of Sources in Linear Monocomponent\n  Mixtures","comments":"5 pages, 2 figures. To be published in the 31st European Signal\n  Processing Conference (EUSIPCO 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Estimation of the number of sources in a linear mixture is a critical\npreprocessing step in the separation and analysis of the sources for many\napplications. Historically, statistical methods, such as the minimum\ndescription length and Akaike information criterion, have been used to estimate\nthe number of sources based on the autocorrelation matrix of the received\nmixture. In this paper, we introduce an alternative, topology-based method to\ncompute the number of source signals present in a linear mixture for the class\nof constant-amplitude, monocomponent source signals. As a proof-of-concept, we\ninclude an example of three such source signals that overlap at multiple points\nin time and frequency, which the method correctly identifies from a set of\neight redundant measurements. These preliminary results are promising and\nencourage further investigation into applications of topological data analysis\nto signal processing problems.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:49:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kennedy","Sean",""],["Tummala","Murali",""],["McEachen","John",""]]}
{"id":"2308.02941","submitter":"Babajide Kolade","authors":"Babajide Kolade","title":"Towards the Development of an Uncertainty Quantification Protocol for\n  the Natural Gas Industry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.data-an physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Simulations using machine learning (ML) models and mechanistic models are\noften run to inform decision-making processes. Uncertainty estimates of\nsimulation results are critical to the decision-making process because\nsimulation results of specific scenarios may have wide, but unspecified,\nconfidence bounds that may impact subsequent analyses and decisions. The\nobjective of this work is to develop a protocol to assess uncertainties in\npredictions of machine learning and mechanistic simulation models. The protocol\nwill outline an uncertainty quantification workflow that may be used to\nestablish credible bounds of predictability on computed quantities of interest\nand to assess model sufficiency. The protocol identifies key sources of\nuncertainties in machine learning and mechanistic modeling, defines applicable\nmethods of uncertainty propagation for these sources, and includes\nstatistically rational estimators for output uncertainties. The work applies\nthe protocol to test cases relevant to the gas distribution industry and\npresents learnings from its application. The paper concludes with a brief\ndiscussion outlining a pathway to the wider adoption of uncertainty\nquantification within the industry\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 18:54:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kolade","Babajide",""]]}
{"id":"2308.02942","submitter":"Chiara Marletto","authors":"Chiara Marletto and Vlatko Vedral","title":"Observing ghost entanglement beyond scattering amplitudes in quantum\n  electrodynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A fully local quantum account of the interactions experienced between charges\nrequires us to use all the four modes of the electromagnetic vector potential,\nin the Lorenz gauge. However, it is frequently stated that only the two\ntransverse modes of the vector potential are ``real\" in that they contain\nphotons that can actually be detected. The photons present in the other two\nmodes, the scalar and the longitudinal, are considered unobservable, and are\nreferred to as ``virtual particles\" or ``ghosts\". Here we argue that this view\nis erroneous and that even these modes can, in fact, be observed. We present an\nexperiment which is designed to measure the entanglement generated between a\ncharge and the scalar modes. This entanglement is a direct function of the\nnumber of photons present in the scalar field. Our conclusion therefore is that\nthe scalar quantum variables are as ``real\" as the transverse ones, where\nreality is defined by their ability to affect the charge. A striking\nconsequence of this is that we cannot detect by local means a superposition of\na charge bigger than that containing 137 electrons.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 19:15:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Marletto","Chiara",""],["Vedral","Vlatko",""]]}
{"id":"2308.02943","submitter":"David Doan","authors":"David Doan, John Kulikowski, X. Wendy Gu","title":"Direct observation of phase transitions in Archimedean trunctated\n  tetrahedrons under quasi-2D confinement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Colloidal crystals are used to understand fundamentals of atomic\nrearrangements in condensed matter and build complex metamaterials with unique\nfunctionalities. Simulations predict a multitude of self-assembled crystal\nstructures from anisotropic colloids, but these shapes have been challenging to\nfabricate. Here, we use two-photon lithography to fabricate Archimedean\ntruncated tetrahedrons and self-assemble them under quasi-2D confinement. Under\na small gravitational potential, these particles self-assemble into a hexatic\nphase, which has not yet been observed or reported for this shape. Under\nadditional gravitational potential, the hexatic phase transitions into a\nquasi-diamond two-unit basis. In-situ imaging reveal this phase transition is\ninitiated by an out-of-plane rotation of a particle at a crystalline defect and\ncauses a chain reaction of neighboring particle rotations. Our results provide\na framework of studying different structures from hard-particle self-assembly\nand demonstrates the ability to use confinement to induce unusual phases.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 19:22:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Doan","David",""],["Kulikowski","John",""],["Gu","X. Wendy",""]]}
{"id":"2308.02944","submitter":"Renato Geh","authors":"Renato Lui Geh, Jonas Gon\\c{c}alves, Igor Cataneo Silveira, Denis\n  Deratani Mau\\'a, Fabio Gagliardi Cozman","title":"dPASP: A Comprehensive Differentiable Probabilistic Answer Set\n  Programming Environment For Neurosymbolic Learning and Reasoning","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.LO cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present dPASP, a novel declarative probabilistic logic programming\nframework for differentiable neuro-symbolic reasoning. The framework allows for\nthe specification of discrete probabilistic models with neural predicates,\nlogic constraints and interval-valued probabilistic choices, thus supporting\nmodels that combine low-level perception (images, texts, etc), common-sense\nreasoning, and (vague) statistical knowledge. To support all such features, we\ndiscuss the several semantics for probabilistic logic programs that can express\nnondeterministic, contradictory, incomplete and/or statistical knowledge. We\nalso discuss how gradient-based learning can be performed with neural\npredicates and probabilistic choices under selected semantics. We then describe\nan implemented package that supports inference and learning in the language,\nalong with several example programs. The package requires minimal user\nknowledge of deep learning system's inner workings, while allowing end-to-end\ntraining of rather sophisticated models and loss functions.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 19:36:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Geh","Renato Lui",""],["Gon\u00e7alves","Jonas",""],["Silveira","Igor Cataneo",""],["Mau\u00e1","Denis Deratani",""],["Cozman","Fabio Gagliardi",""]]}
{"id":"2308.02945","submitter":"Yonghae Kim","authors":"Yonghae Kim, Anurag Kar, Jaewon Lee, Jaekyu Lee, Hyesoon Kim","title":"RV-CURE: A RISC-V Capability Architecture for Full Memory Safety","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite decades of efforts to resolve, memory safety violations are still\npersistent and problematic in modern systems. Various defense mechanisms have\nbeen proposed, but their deployment in real systems remains challenging because\nof performance, security, or compatibility concerns. In this paper, we propose\nRV-CURE, a RISC-V capability architecture that implements full-system support\nfor full memory safety. For capability enforcement, we first propose a compiler\ntechnique, data-pointer tagging (DPT), applicable to protecting all memory\ntypes. It inserts a pointer tag in a pointer address and associates that tag\nwith the pointer's capability metadata. DPT enforces a capability check for\nevery memory access by a tagged pointer and thereby prevents illegitimate\nmemory accesses. Furthermore, we investigate and present lightweight hardware\nextensions for DPT based on the open-source RISC-V BOOM processor. We observe\nthat a capability-execution pipeline can be implemented in parallel with the\nexisting memory-execution pipeline without intrusive modifications. With our\nseamless hardware integration, we achieve low-cost capability checks\ntransparently performed in hardware. Altogether, we prototype RV-CURE as a\nsynthesized RTL processor and conduct full-system evaluations on FPGAs running\nLinux OS. Our evaluations show that RV-CURE achieves strong memory safety at a\n10.8% slowdown across the SPEC 2017 C/C++ workloads.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 19:45:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kim","Yonghae",""],["Kar","Anurag",""],["Lee","Jaewon",""],["Lee","Jaekyu",""],["Kim","Hyesoon",""]]}
{"id":"2308.02946","submitter":"Alan Frieze","authors":"Alan Frieze","title":"On the expected efficiency of branch and bound for the asymmetric TSP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let the costs $C(i,j)$ for an instance of the asymmetric traveling\nsalesperson problem be independent uniform $[0,1]$ random variables. We\nconsider the efficiency of branch and bound algorithms that use the assignment\nrelaxation as a lower bound. We show that w.h.p. the number of steps taken in\nany such branch and bound algorithm is $e^{\\Omega(n^a)}$ for some small\nabsolute constant $a>0$.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:02:20 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 18:02:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Frieze","Alan",""]]}
{"id":"2308.02947","submitter":"Guillermo Carbajal","authors":"Guillermo Carbajal, Patricia Vitoria, Jos\\'e Lezama, and Pablo Mus\\'e","title":"Blind Motion Deblurring with Pixel-Wise Kernel Estimation via Kernel\n  Prediction Networks","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 removal of motion blur in photographs has seen\nimpressive progress in the hands of deep learning-based methods, trained to map\ndirectly from blurry to sharp images. For this reason, approaches that\nexplicitly use a forward degradation model received significantly less\nattention. However, a well-defined specification of the blur genesis, as an\nintermediate step, promotes the generalization and explainability of the\nmethod. Towards this goal, we propose a learning-based motion deblurring method\nbased on dense non-uniform motion blur estimation followed by a non-blind\ndeconvolution approach. Specifically, given a blurry image, a first network\nestimates the dense per-pixel motion blur kernels using a lightweight\nrepresentation composed of a set of image-adaptive basis motion kernels and the\ncorresponding mixing coefficients. Then, a second network trained jointly with\nthe first one, unrolls a non-blind deconvolution method using the motion kernel\nfield estimated by the first network. The model-driven aspect is further\npromoted by training the networks on sharp/blurry pairs synthesized according\nto a convolution-based, non-uniform motion blur degradation model. Qualitative\nand quantitative evaluation shows that the kernel prediction network produces\naccurate motion blur estimates, and that the deblurring pipeline leads to\nrestorations of real blurred images that are competitive or superior to those\nobtained with existing end-to-end deep learning-based methods. Code and trained\nmodels are available at https://github.com/GuillermoCarbajal/J-MKPD/.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:23:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Carbajal","Guillermo",""],["Vitoria","Patricia",""],["Lezama","Jos\u00e9",""],["Mus\u00e9","Pablo",""]]}
{"id":"2308.02948","submitter":"John Pardon","authors":"John Pardon","title":"Universally counting curves in Calabi-Yau threefolds","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that curve enumeration invariants of complex threefolds with nef\nanti-canonical bundle are determined by their values on local curves. This\nstatement and its proof are inspired by the proof of the Gopakumar-Vafa\nintegrality conjecture by Ionel and Parker. The conjecture of Maulik, Nekrasov,\nOkounkov, and Pandharipande relating Gromov-Witten and\nDonaldson-Pandharipande-Thomas invariants is known for local curves by work of\nBryan, Okounkov, and Pandharipande, hence holds for all complex threefolds with\nnef anti-canonical bundle (in particular, all Calabi-Yau threefolds).\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:30:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pardon","John",""]]}
{"id":"2308.02949","submitter":"Zhangxing Bian","authors":"Zhangxing Bian, Shuwen Wei, Yihao Liu, Junyu Chen, Jiachen Zhuo,\n  Fangxu Xing, Jonghye Woo, Aaron Carass, Jerry L. Prince","title":"MomentaMorph: Unsupervised Spatial-Temporal Registration with Momenta,\n  Shooting, and Correction","comments":"Accepted by MICCAI Workshop 2023: Time-Series Data Analytics and\n  Learning (MTSAIL)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tagged magnetic resonance imaging (tMRI) has been employed for decades to\nmeasure the motion of tissue undergoing deformation. However,\nregistration-based motion estimation from tMRI is difficult due to the periodic\npatterns in these images, particularly when the motion is large. With a larger\nmotion the registration approach gets trapped in a local optima, leading to\nmotion estimation errors. We introduce a novel \"momenta, shooting, and\ncorrection\" framework for Lagrangian motion estimation in the presence of\nrepetitive patterns and large motion. This framework, grounded in Lie algebra\nand Lie group principles, accumulates momenta in the tangent vector space and\nemploys exponential mapping in the diffeomorphic space for rapid approximation\ntowards true optima, circumventing local optima. A subsequent correction step\nensures convergence to true optima. The results on a 2D synthetic dataset and a\nreal 3D tMRI dataset demonstrate our method's efficiency in estimating\naccurate, dense, and diffeomorphic 2D/3D motion fields amidst large motion and\nrepetitive patterns.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:32:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bian","Zhangxing",""],["Wei","Shuwen",""],["Liu","Yihao",""],["Chen","Junyu",""],["Zhuo","Jiachen",""],["Xing","Fangxu",""],["Woo","Jonghye",""],["Carass","Aaron",""],["Prince","Jerry L.",""]]}
{"id":"2308.02950","submitter":"Louis Vervoort","authors":"Louis Vervoort, Vitaliy Mizyakov, Anastasia Ugleva","title":"A criterion for Artificial General Intelligence: hypothetic-deductive\n  reasoning, tested on ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We argue that a key reasoning skill that any advanced AI, say GPT-4, should\nmaster in order to qualify as 'thinking machine', or AGI, is\nhypothetic-deductive reasoning. Problem-solving or question-answering can quite\ngenerally be construed as involving two steps: hypothesizing that a certain set\nof hypotheses T applies to the problem or question at hand, and deducing the\nsolution or answer from T - hence the term hypothetic-deductive reasoning. An\nelementary proxy of hypothetic-deductive reasoning is causal reasoning. We\npropose simple tests for both types of reasoning, and apply them to ChatGPT.\nOur study shows that, at present, the chatbot has a limited capacity for either\ntype of reasoning, as soon as the problems considered are somewhat complex.\nHowever, we submit that if an AI would be capable of this type of reasoning in\na sufficiently wide range of contexts, it would be an AGI.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:33:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vervoort","Louis",""],["Mizyakov","Vitaliy",""],["Ugleva","Anastasia",""]]}
{"id":"2308.02951","submitter":"Sebastian Martschat","authors":"Yueling Li, Sebastian Martschat, Simone Paolo Ponzetto","title":"Multi-Source (Pre-)Training for Cross-Domain Measurement, Unit and\n  Context Extraction","comments":"Published as a workshop paper at BioNLP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a cross-domain approach for automated measurement and context\nextraction based on pre-trained language models. We construct a multi-source,\nmulti-domain corpus and train an end-to-end extraction pipeline. We then apply\nmulti-source task-adaptive pre-training and fine-tuning to benchmark the\ncross-domain generalization capability of our model. Further, we conceptualize\nand apply a task-specific error analysis and derive insights for future work.\nOur results suggest that multi-source training leads to the best overall\nresults, while single-source training yields the best results for the\nrespective individual domain. While our setup is successful at extracting\nquantity values and units, more research is needed to improve the extraction of\ncontextual entities. We make the cross-domain corpus used in this work\navailable online.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:33:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yueling",""],["Martschat","Sebastian",""],["Ponzetto","Simone Paolo",""]]}
{"id":"2308.02952","submitter":"Aydogan Ozcan","authors":"Che-Yung Shen, Jingxi Li, Deniz Mengu, Aydogan Ozcan","title":"Multispectral Quantitative Phase Imaging Using a Diffractive Optical\n  Network","comments":"29 Pages, 6 Figures","journal-ref":"Advanced Intelligent Systems (2023)","doi":"10.1002/aisy.202300300","report-no":null,"categories":"physics.optics cs.CV physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a label-free imaging technique, quantitative phase imaging (QPI) provides\noptical path length information of transparent specimens for various\napplications in biology, materials science, and engineering. Multispectral QPI\nmeasures quantitative phase information across multiple spectral bands,\npermitting the examination of wavelength-specific phase and dispersion\ncharacteristics of samples. Here, we present the design of a diffractive\nprocessor that can all-optically perform multispectral quantitative phase\nimaging of transparent phase-only objects in a snapshot. Our design utilizes\nspatially engineered diffractive layers, optimized through deep learning, to\nencode the phase profile of the input object at a predetermined set of\nwavelengths into spatial intensity variations at the output plane, allowing\nmultispectral QPI using a monochrome focal plane array. Through numerical\nsimulations, we demonstrate diffractive multispectral processors to\nsimultaneously perform quantitative phase imaging at 9 and 16 target spectral\nbands in the visible spectrum. These diffractive multispectral processors\nmaintain uniform performance across all the wavelength channels, revealing a\ndecent QPI performance at each target wavelength. The generalization of these\ndiffractive processor designs is validated through numerical tests on unseen\nobjects, including thin Pap smear images. Due to its all-optical processing\ncapability using passive dielectric diffractive materials, this diffractive\nmultispectral QPI processor offers a compact and power-efficient solution for\nhigh-throughput quantitative phase microscopy and spectroscopy. This framework\ncan operate at different parts of the electromagnetic spectrum and be used for\na wide range of phase imaging and sensing applications.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 21:13:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shen","Che-Yung",""],["Li","Jingxi",""],["Mengu","Deniz",""],["Ozcan","Aydogan",""]]}
{"id":"2308.02953","submitter":"Pavel Gevorgyan","authors":"Pavel S. Gevorgyan and Rolando Jimenez","title":"On equivariant fibrations of $G$-CW-complexes","comments":null,"journal-ref":"Sbornik: Mathematics 210:10, 1428--1433 (2019)","doi":"10.1070/SM9133","report-no":null,"categories":"math.AT math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is proved that if $G$ is a compact Lie group, then an equivariant Serre\nfibration of $G$-CW-complexes is an equivariant Hurewicz fibration in the class\nof compactly generated $G$-spaces. In the nonequivariant setting, this result\nis due to Steinberger, West and Cauty. The main theorem is proved using the\nfollowing key result: a $G$-CW-complex can be embedded as an equivariant\nretract in a simplicial $G$-complex. It is also proved that an equivariant map\n$p: E \\to B$ of $G$-CW-complexes is a Hurewicz $G$-fibration if and only if the\n$H$-fixed point map $p^H : E^H \\to B^H$ is a Hurewicz fibration for any closed\nsubgroup $H$ of $G$. This gives a solution to the problem of James and Segal in\nthe case of $G$-CW-complexes.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 21:19:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gevorgyan","Pavel S.",""],["Jimenez","Rolando",""]]}
{"id":"2308.02954","submitter":"Uriel Jacket Tresor Demby's","authors":"Jacket Demby's, Jeffrey Uhlmann and Guilherme N. DeSouza","title":"Choosing the Correct Generalized Inverse for the Numerical Solution of\n  the Inverse Kinematics of Incommensurate Robotic Manipulators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerical methods for Inverse Kinematics (IK) employ iterative, linear\napproximations of the IK until the end-effector is brought from its initial\npose to the desired final pose. These methods require the computation of the\nJacobian of the Forward Kinematics (FK) and its inverse in the linear\napproximation of the IK. Despite all the successful implementations reported in\nthe literature, Jacobian-based IK methods can still fail to preserve certain\nuseful properties if an improper matrix inverse, e.g. Moore-Penrose (MP), is\nemployed for incommensurate robotic systems. In this paper, we propose a\nsystematic, robust and accurate numerical solution for the IK problem using the\nMixed (MX) Generalized Inverse (GI) applied to any type of Jacobians (e.g.,\nanalytical, numerical or geometric) derived for any commensurate and\nincommensurate robot. This approach is robust to whether the system is\nunder-determined (less than 6 DoF) or over-determined (more than 6 DoF). We\ninvestigate six robotics manipulators with various Degrees of Freedom (DoF) to\ndemonstrate that commonly used GI's fail to guarantee the same system behaviors\nwhen the units are varied for incommensurate robotics manipulators. In\naddition, we evaluate the proposed methodology as a global IK solver and\ncompare against well-known IK methods for redundant manipulators. Based on the\nexperimental results, we conclude that the right choice of GI is crucial in\npreserving certain properties of the system (i.e. unit-consistency).\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 21:25:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Demby's","Jacket",""],["Uhlmann","Jeffrey",""],["DeSouza","Guilherme N.",""]]}
{"id":"2308.02955","submitter":"Rabimba Karanjai","authors":"Rabimba Karanjai, Edward Li, Lei Xu, Weidong Shi","title":"An Empirical Study of AI-based Smart Contract Creation","comments":"Updated to address issues","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The introduction of large language models (LLMs) like ChatGPT and Google\nPalm2 for smart contract generation seems to be the first well-established\ninstance of an AI pair programmer. LLMs have access to a large number of\nopen-source smart contracts, enabling them to utilize more extensive code in\nSolidity than other code generation tools. Although the initial and informal\nassessments of LLMs for smart contract generation are promising, a systematic\nevaluation is needed to explore the limits and benefits of these models. The\nmain objective of this study is to assess the quality of generated code\nprovided by LLMs for smart contracts. We also aim to evaluate the impact of the\nquality and variety of input parameters fed to LLMs. To achieve this aim, we\ncreated an experimental setup for evaluating the generated code in terms of\nvalidity, correctness, and efficiency. Our study finds crucial evidence of\nsecurity bugs getting introduced in the generated smart contracts as well as\nthe overall quality and correctness of the code getting impacted. However, we\nalso identified the areas where it can be improved. The paper also proposes\nseveral potential research directions to improve the process, quality and\nsafety of generated smart contract codes.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 21:38:57 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 19:29:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Karanjai","Rabimba",""],["Li","Edward",""],["Xu","Lei",""],["Shi","Weidong",""]]}
{"id":"2308.02956","submitter":"Efren Morales","authors":"Victor A. Aguilar-Arteaga, Rafael Iv\\'an Ayala-Figueroa, Jes\\'us\n  Jer\\'onimo-Castro and Efr\\'en Morales-Amaya","title":"An equichordal characterization of the ellipsoid and the sphere","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $K$ and $L$ be two convex bodies in $\\mathbb R^n$, $n\\geq 3$, with\n$L\\subset \\text{int}\\, K$. In this paper we prove the following result: if\nevery two parallel chords of $K$, supporting $L$ have the same length, then $K$\nand $L$ are homothetic and concentric ellipsoids. We also prove a similar\ntheorem when instead of parallel chords we consider concurrent chords. We may\nalso replace, in both theorems, supporting chords of $L$ by supporting sections\nof constant width. In the last section we also prove similar theorems where we\nconsider projections instead of sections.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 21:52:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aguilar-Arteaga","Victor A.",""],["Ayala-Figueroa","Rafael Iv\u00e1n",""],["Jer\u00f3nimo-Castro","Jes\u00fas",""],["Morales-Amaya","Efr\u00e9n",""]]}
{"id":"2308.02957","submitter":"Preslav Aleksandrov","authors":"Preslav Aleksandrov","title":"Improved convergence of forward and inverse finite element models","comments":"55 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Forward and inverse models are used throughout different engineering fields\nto predict and understand the behaviour of systems and to find parameters from\na set of observations. These models use root-finding and minimisation\ntechniques respectively to achieve their goals. This paper introduces\nimprovements to these mathematical methods to then improve the convergence\nbehaviour of the overarching models when used in highly non-linear systems. The\nperformance of the new techniques is examined in detail and compared to that of\nthe standard methods. The improved techniques are also tested with FEM models\nto show their practical application. Depending on the specific configuration of\nthe problem, the improved models yielded larger convergence basins and/or took\nfewer steps to converge.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 21:58:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aleksandrov","Preslav",""]]}
{"id":"2308.02958","submitter":"Alfredo De Goyeneche","authors":"Frederic Wang, Han Qi, Alfredo De Goyeneche, Reinhard Heckel, Michael\n  Lustig, and Efrat Shimron","title":"K-band: Self-supervised MRI Reconstruction via Stochastic Gradient\n  Descent over K-space Subsets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG eess.SP physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although deep learning (DL) methods are powerful for solving inverse\nproblems, their reliance on high-quality training data is a major hurdle. This\nis significant in high-dimensional (dynamic/volumetric) magnetic resonance\nimaging (MRI), where acquisition of high-resolution fully sampled k-space data\nis impractical. We introduce a novel mathematical framework, dubbed k-band,\nthat enables training DL models using only partial, limited-resolution k-space\ndata. Specifically, we introduce training with stochastic gradient descent\n(SGD) over k-space subsets. In each training iteration, rather than using the\nfully sampled k-space for computing gradients, we use only a small k-space\nportion. This concept is compatible with different sampling strategies; here we\ndemonstrate the method for k-space \"bands\", which have limited resolution in\none dimension and can hence be acquired rapidly. We prove analytically that our\nmethod stochastically approximates the gradients computed in a fully-supervised\nsetup, when two simple conditions are met: (i) the limited-resolution axis is\nchosen randomly-uniformly for every new scan, hence k-space is fully covered\nacross the entire training set, and (ii) the loss function is weighed with a\nmask, derived here analytically, which facilitates accurate reconstruction of\nhigh-resolution details. Numerical experiments with raw MRI data indicate that\nk-band outperforms two other methods trained on limited-resolution data and\nperforms comparably to state-of-the-art (SoTA) methods trained on\nhigh-resolution data. k-band hence obtains SoTA performance, with the advantage\nof training using only limited-resolution data. This work hence introduces a\npractical, easy-to-implement, self-supervised training framework, which\ninvolves fast acquisition and self-supervised reconstruction and offers\ntheoretical guarantees.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:07:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Frederic",""],["Qi","Han",""],["De Goyeneche","Alfredo",""],["Heckel","Reinhard",""],["Lustig","Michael",""],["Shimron","Efrat",""]]}
{"id":"2308.02959","submitter":"Reza Azad","authors":"Afshin Bozorgpour and Yousef Sadegheih and Amirhossein Kazerouni and\n  Reza Azad and Dorit Merhof","title":"DermoSegDiff: A Boundary-aware Segmentation Diffusion Model for Skin\n  Lesion Delineation","comments":"MICCAI workshop PRIME","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Skin lesion segmentation plays a critical role in the early detection and\naccurate diagnosis of dermatological conditions. Denoising Diffusion\nProbabilistic Models (DDPMs) have recently gained attention for their\nexceptional image-generation capabilities. Building on these advancements, we\npropose DermoSegDiff, a novel framework for skin lesion segmentation that\nincorporates boundary information during the learning process. Our approach\nintroduces a novel loss function that prioritizes the boundaries during\ntraining, gradually reducing the significance of other regions. We also\nintroduce a novel U-Net-based denoising network that proficiently integrates\nnoise and semantic information inside the network. Experimental results on\nmultiple skin segmentation datasets demonstrate the superiority of DermoSegDiff\nover existing CNN, transformer, and diffusion-based approaches, showcasing its\neffectiveness and generalization in various scenarios. The implementation is\npublicly accessible on\n\\href{https://github.com/mindflow-institue/dermosegdiff}{GitHub}\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:12:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bozorgpour","Afshin",""],["Sadegheih","Yousef",""],["Kazerouni","Amirhossein",""],["Azad","Reza",""],["Merhof","Dorit",""]]}
{"id":"2308.02960","submitter":"Saad Ahmed Jamal","authors":"Saad Ahmed Jamal, Arioluwa Aribisala","title":"Data Fusion for Multi-Task Learning of Building Extraction and Height\n  Estimation","comments":"5 pages, 5 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":"  In accordance with the urban reconstruction problem proposed by the DFC23\nTrack 2 Contest, this paper attempts a multitask-learning method of building\nextraction and height estimation using both optical and radar satellite\nimagery. Contrary to the initial goal of multitask learning which could\npotentially give a superior solution by reusing features and forming implicit\nconstraints between multiple tasks, this paper reports the individual\nimplementation of the building extraction and height estimation under\nconstraints. The baseline results for the building extraction and the height\nestimation significantly increased after designed experiments.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:16:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jamal","Saad Ahmed",""],["Aribisala","Arioluwa",""]]}
{"id":"2308.02961","submitter":"Bogdan Carbunar","authors":"Yuzhou Feng and Ruyu Zhai and Radu Sion and Bogdan Carbunar","title":"A Study of China's Censorship and Its Evasion Through the Lens of Online\n  Gaming","comments":null,"journal-ref":"Usenix Security 2023","doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For the past 20 years, China has increasingly restricted the access of minors\nto online games using addiction prevention systems (APSes). At the same time,\nand through different means, i.e., the Great Firewall of China (GFW), it also\nrestricts general population access to the international Internet. This paper\nstudies how these restrictions impact young online gamers, and their evasion\nefforts. We present results from surveys (n = 2,415) and semi-structured\ninterviews (n = 35) revealing viable commonly deployed APS evasion techniques\nand APS vulnerabilities. We conclude that the APS does not work as designed,\neven against very young online game players, and can act as a censorship\nevasion training ground for tomorrow's adults, by familiarization with and\nnormalization of general evasion techniques, and desensitization to their\ndangers. Findings from these studies may further inform developers of\ncensorship-resistant systems about the perceptions and evasion strategies of\ntheir prospective users, and help design tools that leverage services and\nplatforms popular among the censored audience.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:16:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Yuzhou",""],["Zhai","Ruyu",""],["Sion","Radu",""],["Carbunar","Bogdan",""]]}
{"id":"2308.02962","submitter":"Thomas Palmeira Ferraz","authors":"Adelmo Eloy, Thomas Palmeira Ferraz, Fellip Silva Alves, Roseli de\n  Deus Lopes","title":"Science and engineering for what? A large-scale analysis of students'\n  projects in science fairs","comments":"Presented at International Conference of the Learning Sciences - ICLS\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL physics.ed-ph stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Science and Engineering fairs offer K-12 students opportunities to engage\nwith authentic STEM practices. Particularly, students are given the chance to\nexperience authentic and open inquiry processes, by defining which themes,\nquestions and approaches will guide their scientific endeavors. In this study,\nwe analyzed data from over 5,000 projects presented at a nationwide science\nfair in Brazil over the past 20 years using topic modeling to identify the main\ntopics that have driven students' inquiry and design. Our analysis identified a\nbroad range of topics being explored, with significant variations over time,\nregion, and school setting. We argue those results and proposed methodology can\nnot only support further research in the context of science fairs, but also\ninform instruction and design of contexts-specific resources to support\nstudents in open inquiry experiences in different settings.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:19:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Eloy","Adelmo",""],["Ferraz","Thomas Palmeira",""],["Alves","Fellip Silva",""],["Lopes","Roseli de Deus",""]]}
{"id":"2308.02963","submitter":"Hanbyel Cho","authors":"Hanbyel Cho, Junmo Kim","title":"Generative Approach for Probabilistic Human Mesh Recovery using\n  Diffusion Models","comments":"Accepted to ICCV 2023 CV4Metaverse Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This work focuses on the problem of reconstructing a 3D human body mesh from\na given 2D image. Despite the inherent ambiguity of the task of human mesh\nrecovery, most existing works have adopted a method of regressing a single\noutput. In contrast, we propose a generative approach framework, called\n\"Diffusion-based Human Mesh Recovery (Diff-HMR)\" that takes advantage of the\ndenoising diffusion process to account for multiple plausible outcomes. During\nthe training phase, the SMPL parameters are diffused from ground-truth\nparameters to random distribution, and Diff-HMR learns the reverse process of\nthis diffusion. In the inference phase, the model progressively refines the\ngiven random SMPL parameters into the corresponding parameters that align with\nthe input image. Diff-HMR, being a generative approach, is capable of\ngenerating diverse results for the same input image as the input noise varies.\nWe conduct validation experiments, and the results demonstrate that the\nproposed framework effectively models the inherent ambiguity of the task of\nhuman mesh recovery in a probabilistic manner. The code is available at\nhttps://github.com/hanbyel0105/Diff-HMR\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:23:04 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 19:31:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cho","Hanbyel",""],["Kim","Junmo",""]]}
{"id":"2308.02964","submitter":"Jacket Demby's","authors":"Jacket Demby's, Jeffrey Uhlmann and Guilherme N. DeSouza","title":"Achieving Unit-Consistent Pseudo-Inverse-based Path-Planning for\n  Redundant Incommensurate Robotic Manipulators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we review and compare several velocity-level and\nacceleration-level Pseudo-Inverse-based Path Planning (PPP) and\nPseudo-Inverse-based Repetitive Motion Planning (PRMP) schemes based on the\nkinematic model of robotic manipulators. We show that without unit consistency\nin the pseudo-inverse computation, path planning of incommensurate robotic\nmanipulators will fail. Also, we investigated the robustness and noise\ntolerance of six PPP and PRMP schemes in the literature against various noise\ntypes (i.e. zero, constant, time-varying and random noises). We compared the\nsimulated results using two redundant robotic manipulators: a 3DoF (2RP), and a\n7DoF (2RP4R). These experimental results demonstrate that the improper\nGeneralized Inverse (GI) with arbitrary selection of unit and/or in the\npresence of noise can lead to unexpected behavior of the robot, while producing\nwrong instantaneous outputs in the task space, which results in distortions\nand/or failures in the execution of the planned path. Finally, we propose and\ndemonstrate the efficacy of the Mixed Inverse (MX) as the proper GI to achieve\nunit-consistency in path planning.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:34:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Demby's","Jacket",""],["Uhlmann","Jeffrey",""],["DeSouza","Guilherme N.",""]]}
{"id":"2308.02965","submitter":"R.  Michael Porter","authors":"Z. Ashtab, J. Morais, R. Michael Porter","title":"Harmonic and monogenic functions on toroidal domains","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A standard technique for producing monogenic functions is to apply the\nadjoint quaternionic Fueter operator to harmonic functions. We will show that\nthis technique does not give a complete system in L2 of a solid torus, where\ntoroidal harmonics appear in a natural way. One reason is that this\nindex-increasing operator fails to produce monogenic functions with zero index.\nAnother reason is that the non-trivial topology of the torus requires taking\ninto account a cohomology coefficient associated with monogenic functions,\napparently not previously identified because it vanishes for simply connected\ndomains. In this paper, we build a reverse-Appell basis of harmonic functions\non the torus expressed in terms of classical toroidal harmonics. This means\nthat the partial derivative of any element of the basis with respect to the\naxial variable is a constant multiple of another basis element with subscript\nincreased by one. This special basis is used to construct respective bases in\nthe real L2-Hilbert spaces of reduced quaternion and quaternion-valued\nmonogenic functions on toroidal domains.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:01:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ashtab","Z.",""],["Morais","J.",""],["Porter","R. Michael",""]]}
{"id":"2308.02966","submitter":"Samuel Stocksieker","authors":"Samuel Stocksieker and Denys Pommeret and Arthur Charpentier","title":"Generalized Oversampling for Learning from Imbalanced datasets and\n  Associated Theory","comments":"This paper focuses specifically on the Imbalanced Regression issues\n  but could be used for Imbalanced classification tasks","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In supervised learning, it is quite frequent to be confronted with real\nimbalanced datasets. This situation leads to a learning difficulty for standard\nalgorithms. Research and solutions in imbalanced learning have mainly focused\non classification tasks. Despite its importance, very few solutions exist for\nimbalanced regression. In this paper, we propose a data augmentation procedure,\nthe GOLIATH algorithm, based on kernel density estimates which can be used in\nclassification and regression. This general approach encompasses two large\nfamilies of synthetic oversampling: those based on perturbations, such as\nGaussian Noise, and those based on interpolations, such as SMOTE. It also\nprovides an explicit form of these machine learning algorithms and an\nexpression of their conditional densities, in particular for SMOTE. New\nsynthetic data generators are deduced. We apply GOLIATH in imbalanced\nregression combining such generator procedures with a wild-bootstrap resampling\ntechnique for the target values. We evaluate the performance of the GOLIATH\nalgorithm in imbalanced regression situations. We empirically evaluate and\ncompare our approach and demonstrate significant improvement over existing\nstate-of-the-art techniques.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:08:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Stocksieker","Samuel",""],["Pommeret","Denys",""],["Charpentier","Arthur",""]]}
{"id":"2308.02967","submitter":"Harikumar Chandrasekharan Mr","authors":"Harikumar K. Chandrasekharan, Krystian L. Wlodarczyk, William N.\n  MacPherson, and M. Mercedes Maroto-Valer","title":"In-situ multicore fibre-based pH mapping through obstacles in integrated\n  microfluidic devices","comments":"12 pages of main draft with 10 figures, 2 pages of supplementary\n  information with 3 figures. Total 14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Microfluidic systems with integrated sensors are ideal platforms to study and\nemulate processes such as complex multiphase flow and reactive transport in\nporous media, numerical modeling of bulk systems in medicine, and in\nengineering. Existing commercial optical fibre sensing systems used in\nintegrated microfluidic devices are based on single-core fibres, limiting the\nspatial resolution in parameter measurements in such application scenarios.\nHere, we propose a multicore fibre-based pH system for in-situ pH mapping with\ntens of micrometer spatial resolution in microfluidic devices. The\ndemonstration uses custom laser-manufactured glass microfluidic devices (called\nfurther micromodels) consisting of two round ports. The micromodels comprise\ntwo lintels for the injection of various pH buffers and an outlet. The two-port\nsystem facilitates the injection of various pH solutions using independent\npressure pumps. The multicore fibre imaging system provides spatial information\nabout the pH environment from the intensity distribution of fluorescence\nemission from the sensor attached to the fibre end facet, making use of the\ncores in the fibre as independent measurement channels. As a proof-of-concept,\nwe performed pH measurements in micromodels through obstacles (glass and rock\nbeads), showing that the particle features can be clearly distinguishable from\nthe intensity distribution from the fibre sensor.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:12:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chandrasekharan","Harikumar K.",""],["Wlodarczyk","Krystian L.",""],["MacPherson","William N.",""],["Maroto-Valer","M. Mercedes",""]]}
{"id":"2308.02968","submitter":"Param Hanji","authors":"Param Hanji and Rafa{\\l} K. Mantiuk","title":"Robust estimation of exposure ratios in multi-exposure image stacks","comments":"11 pages, 11 figures, journal","journal-ref":"Transactions on Computational Imaging, 9, pp.721-731, 2023","doi":"10.1109/TCI.2023.3301338","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Merging multi-exposure image stacks into a high dynamic range (HDR) image\nrequires knowledge of accurate exposure times. When exposure times are\ninaccurate, for example, when they are extracted from a camera's EXIF metadata,\nthe reconstructed HDR images reveal banding artifacts at smooth gradients. To\nremedy this, we propose to estimate exposure ratios directly from the input\nimages. We derive the exposure time estimation as an optimization problem, in\nwhich pixels are selected from pairs of exposures to minimize estimation error\ncaused by camera noise. When pixel values are represented in the logarithmic\ndomain, the problem can be solved efficiently using a linear solver. We\ndemonstrate that the estimation can be easily made robust to pixel misalignment\ncaused by camera or object motion by collecting pixels from multiple spatial\ntiles. The proposed automatic exposure estimation and alignment eliminates\nbanding artifacts in popular datasets and is essential for applications that\nrequire physically accurate reconstructions, such as measuring the modulation\ntransfer function of a display. The code for the method is available.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:42:59 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 10:36:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hanji","Param",""],["Mantiuk","Rafa\u0142 K.",""]]}
{"id":"2308.02969","submitter":"Guillermo Navarro Del Toro","authors":"Guillermo Jose Navarro del Toro","title":"El paradigma del marketing digital en la academia, el emprendimiento\n  universitario y las empresas establecidas","comments":"24 paginas, in Spanish language","journal-ref":null,"doi":"10.23913/ride.v13i25.1321","report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The updating required by students in the marketing area is of utmost\nimportance, since they cannot wait until they are professionals to be updated,\nespecially in entrepreneurship and around digital marketing. The objective of\nthis work was to develop a digital marketing specialty module that allows\nchanging the academic-entrepreneurial-entrepreneurial paradigm of the graduate\nof the Centro Universitario de los Altos (CUAltos) in economic-administrative\nsciences at the undergraduate, graduate and specialty levels. The module aims\nto instruct the student in the latest in digital marketing. As part of this,\ntwo surveys were applied to the teachers of this center to know the viability\nand willingness to participate in this module. Among the results, it was\ndiscovered that marketing research specialists who work as teachers at CUAltos\nare willing to train other teachers and students of the University of\nGuadalajara's system, as well as to advise students in their ventures so that\nthey can apply different components of this field.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:43:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["del Toro","Guillermo Jose Navarro",""]]}
{"id":"2308.02970","submitter":"Minxian Xu","authors":"Yongkang Dang, Minxian Xu, Kejiang Ye","title":"Resource Management for GPT-based Model Deployed on Clouds: Challenges,\n  Solutions, and Future Directions","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The widespread adoption of the large language model (LLM), e.g. Generative\nPre-trained Transformer (GPT), deployed on cloud computing environment (e.g.\nAzure) has led to a huge increased demand for resources. This surge in demand\nposes significant challenges to resource management in clouds. This paper aims\nto highlight these challenges by first identifying the unique characteristics\nof resource management for the GPT-based model. Building upon this\nunderstanding, we analyze the specific challenges faced by resource management\nin the context of GPT-based model deployed on clouds, and propose corresponding\npotential solutions. To facilitate effective resource management, we introduce\na comprehensive resource management framework and present resource scheduling\nalgorithms specifically designed for the GPT-based model. Furthermore, we delve\ninto the future directions for resource management in the GPT-based model,\nhighlighting potential areas for further exploration and improvement. Through\nthis study, we aim to provide valuable insights into resource management for\nGPT-based models deployed in clouds and promote their sustainable development\nfor GPT-based models and applications.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:45:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dang","Yongkang",""],["Xu","Minxian",""],["Ye","Kejiang",""]]}
{"id":"2308.02971","submitter":"Cristiano Germani","authors":"Cristiano Germani and Ravi K. Sheth","title":"The statistics of primordial black holes in a radiation dominated\n  Universe -- a review and new results","comments":"18 pages; 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review the non-linear statistics of Primordial Black Holes that form from\nthe collapse of over-densities in a radiation dominated Universe. We focus on\nthe scenario in which large over-densities are generated by rare and Gaussian\ncurvature perturbations during inflation. As new results, we show that the mass\nspectrum follows a power law determined by the critical exponent of the\nself-similar collapse up to a power spectrum dependent cut-off and, that the\nabundance related to very narrow power spectrums is exponentially suppressed.\nRelated to this, we discuss and explicitly show that the Press-Schechter\napproximation, as well as the statistics of mean profiles, lead to wrong\nconclusions for the abundance and mass spectrum. Finally, we clarify that the\ntransfer function in the statistics of initial conditions for primordial black\nholes formation (the abundance) does not play a significant role.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:45:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Germani","Cristiano",""],["Sheth","Ravi K.",""]]}
{"id":"2308.02972","submitter":"Chuanfei Dong","authors":"Shichen Wei, Yuhong Liu, Haiyang Fu, Chuanfei Dong, Liang Wang","title":"Data-Driven Modeling of Landau Damping by Fourier Neural Operator","comments":"4 pages, 5 figures, to appear in \"International Applied Computational\n  Electromagnetics Society Symposium (ACES)\" by IEEE","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.comp-ph physics.space-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The development of machine learning techniques enables us to construct\nsurrogate models from data of direct numerical simulations, which has important\nimplications for modeling complex physical systems. In this paper, based on the\noutput from 1D Vlasov-Ampere simulations, we adopt the Fourier Neural Operator\n(FNO) to build surrogate models of Landau fluid closure for multi-moment fluid\nequations from kinetic simulation data. The trained FNO is able to obtain the\nheat flux using electron density as input, in agreement with the true value\nfrom kinetic simulations. We compare the physical quantities obtained using the\nFNO and Multilayer Perceptron (MLP) architectures, and found that the results\nof FNO are significantly better than that of MLP.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:49:25 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 18:04:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wei","Shichen",""],["Liu","Yuhong",""],["Fu","Haiyang",""],["Dong","Chuanfei",""],["Wang","Liang",""]]}
{"id":"2308.02973","submitter":"Tarun Kumar Yadav","authors":"Tarun Kumar Yadav and Kent Seamons","title":"A Security and Usability Analysis of Local Attacks Against FIDO2","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The FIDO2 protocol aims to strengthen or replace password authentication\nusing public-key cryptography. FIDO2 has primarily focused on defending against\nattacks from afar by remote attackers that compromise a password or attempt to\nphish the user. In this paper, we explore threats from local attacks on FIDO2\nthat have received less attention -- a browser extension compromise and\nattackers gaining physical access to an HSK. Our systematic analysis of current\nimplementations of FIDO2 reveals four underlying flaws, and we demonstrate the\nfeasibility of seven attacks that exploit those flaws. The flaws include (1)\nLack of confidentiality/integrity of FIDO2 messages accessible to browser\nextensions, (2) Broken clone detection algorithm, (3) Potential for user\nmisunderstanding from social engineering and notification/error messages, and\n(4) Cookie life cycle. We build malicious browser extensions and demonstrate\nthe attacks on ten popular web servers that use FIDO2. We also show that many\nbrowser extensions have sufficient permissions to conduct the attacks if they\nwere compromised. A static and dynamic analysis of current browser extensions\nfinds no evidence of the attacks in the wild. We conducted two user studies\nconfirming that participants do not detect the attacks with current error\nmessages, email notifications, and UX responses to the attacks. We provide an\nimproved clone detection algorithm and recommendations for relying part\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:05:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yadav","Tarun Kumar",""],["Seamons","Kent",""]]}
{"id":"2308.02974","submitter":"Charlotte Mann","authors":"Charlotte Z. Mann, Adam C. Sales, Johann A. Gagnon-Bartsch","title":"Combining observational and experimental data for causal inference\n  considering data privacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Combining observational and experimental data for causal inference can\nimprove treatment effect estimation. However, many observational data sets\ncannot be released due to data privacy considerations, so one researcher may\nnot have access to both experimental and observational data. Nonetheless, a\nsmall amount of risk of disclosing sensitive information might be tolerable to\norganizations that house confidential data. In these cases, organizations can\nemploy data privacy techniques, which decrease disclosure risk, potentially at\nthe expense of data utility. In this paper, we explore disclosure limiting\ntransformations of observational data, which can be combined with experimental\ndata to estimate the sample and population average treatment effects. We\nconsider leveraging observational data to improve generalizability of treatment\neffect estimates when a randomized experiment (RCT) is not representative of\nthe population of interest, and to increase precision of treatment effect\nestimates. Through simulation studies, we illustrate the trade-off between\nprivacy and utility when employing different disclosure limiting\ntransformations. We find that leveraging transformed observational data in\ntreatment effect estimation can still improve estimation over only using data\nfrom an RCT.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:11:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mann","Charlotte Z.",""],["Sales","Adam C.",""],["Gagnon-Bartsch","Johann A.",""]]}
{"id":"2308.02975","submitter":"Joyentanuj Das","authors":"Joyentanuj Das","title":"On the spectral radius of clique trees with a given zero forcing number","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G(n,k)$ be the class of clique trees on $n$ vertices and zero forcing\nnumber $k$, where $\\left \\lfloor \\frac{n}{2} \\right \\rfloor + 1 \\le k \\le n-1$\nand each block is a clique of size at least $3$. In this article, we proved the\nexistence and uniqueness of a clique tree in $G(n,k)$ that attains maximal\nspectral radius among all graphs in $G(n,k)$. We also provide an upper bound\nfor the spectral radius of the extremal graph.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:13:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Das","Joyentanuj",""]]}
{"id":"2308.02976","submitter":"Jos\\'e Ca\\~nete","authors":"Jos\\'e Ca\\~nete, Gabriel Chaperon, Rodrigo Fuentes, Jou-Hui Ho, Hojin\n  Kang and Jorge P\\'erez","title":"Spanish Pre-trained BERT Model and Evaluation Data","comments":"Published as workshop paper at Practical ML for Developing Countries\n  Workshop @ ICLR 2020","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 Spanish language is one of the top 5 spoken languages in the world.\nNevertheless, finding resources to train or evaluate Spanish language models is\nnot an easy task. In this paper we help bridge this gap by presenting a\nBERT-based language model pre-trained exclusively on Spanish data. As a second\ncontribution, we also compiled several tasks specifically for the Spanish\nlanguage in a single repository much in the spirit of the GLUE benchmark. By\nfine-tuning our pre-trained Spanish model, we obtain better results compared to\nother BERT-based models pre-trained on multilingual corpora for most of the\ntasks, even achieving a new state-of-the-art on some of them. We have publicly\nreleased our model, the pre-training data, and the compilation of the Spanish\nbenchmarks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:16:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ca\u00f1ete","Jos\u00e9",""],["Chaperon","Gabriel",""],["Fuentes","Rodrigo",""],["Ho","Jou-Hui",""],["Kang","Hojin",""],["P\u00e9rez","Jorge",""]]}
{"id":"2308.02977","submitter":"Sam Cross","authors":"Sam Cross, Jonathan Buhot, Annabelle Brooks, William Thomas, Annette\n  Kleppe, Oliver Lord, Sven Friedemann","title":"High-temperature superconductivity in A15-type La4H23 below 100 GPa","comments":"18 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-temperature superconductivity has been observed in binary hydrides such\nas LaH10 at pressures above 150 GPa. Hydrogen cage structures have been\nidentified as a common motif beneficial for high critical temperatures Tc.\nEfforts are now focused on finding hydride high-temperature superconductors at\nlower pressures. We present evidence for high-temperature superconductivity in\nbinary La4H23 with A15-type structure featuring hydrogen cages at a pressure of\nP = 95 GPa. We synthesise La4H23 from a lanthanum film capped with a palladium\ncatalyst promoting the dissociation of hydrogen. In resistance measurements, we\nobserve superconductivity with a transition temperature Tc = 90 K. In X-ray\ndiffraction on the same sample, we identify the A15-type cubic body centred\nstructure of the lanthanum sublattice. From comparison with earlier XRD and\nstructure prediction studies, we identify this phase with La4H23. Our study\nreinforces the concept of hydrogen cages for high-temperature\nsuperconductivity.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:23:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cross","Sam",""],["Buhot","Jonathan",""],["Brooks","Annabelle",""],["Thomas","William",""],["Kleppe","Annette",""],["Lord","Oliver",""],["Friedemann","Sven",""]]}
{"id":"2308.02978","submitter":"Patrick Cesarz","authors":"Patrick G. Cesarz, Andrew J. Woldar","title":"On the automorphism group of a putative Conway 99-graph","comments":"19 pages, 10 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Gamma$ be a {Conway 99-graph}, that is, a strongly regular graph with\nparameters $(99,14,1,2)$. In Makhnev and Minakova (On automorphisms of strongly\nregular graphs with parameters $\\lambda =1$, $\\mu= 2$, Discrete Math.\\ Appl.\\\n14 (2) (2004) 201-210), the authors prove that the automorphism group $G$ of\n$\\Gamma$ must have order dividing $2\\cdot 3^3\\cdot 7\\cdot 11$. They further\nshow that if $|G|$ is divisible by $2$ then $|G|$ must divide $42$. In the\npresent paper, we refine these results by proving that divisibility by $7$\nimplies $G \\cong\\mathbb Z_7$. As a consequence, divisibility by $2$ implies\n$|G|$ divides $6$, \\ie $G$ is isomorphic to one of $\\mathbb Z_2, \\mathbb Z_6,\nS_3$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:31:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cesarz","Patrick G.",""],["Woldar","Andrew J.",""]]}
{"id":"2308.02979","submitter":"Jaemin Kim","authors":"Jaemin Kim, Mahmut Selman Sakar, Nikolaos Bouklas","title":"Modeling the distinct dynamics and motion of cells residing on the\n  surface and inside morphing soft tissues","comments":"20 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cellular contractility, migration, and extracellular matrix (ECM) mechanics\nare critical for a wide range of biological processes including embryonic\ndevelopment, wound healing, tissue morphogenesis, and regeneration. Even though\nthe distinct response of cells near the tissue periphery has been previously\nobserved in cell-laden microtissues, including faster kinetics and more\nprominent cell-ECM interactions, there are currently no models that can fully\ncombine coupled surface and bulk mechanics and kinetics to recapitulate the\nmorphogenic response of these constructs. This paper presents a novel continuum\nmechanics framework in a total Lagrangian setting and corresponding finite\nelement implementation for understanding the interplay between cellular\ncontractility, migration, and ECM mechanics in dynamically morphing soft\ntissues accounting for distinct cellular responses in the bulk and the surface\nof tissues. The major novelty of this approach is that it enables modeling the\ndistinct migratory and mechanical response of cells residing on the tissue\nsurface and the bulk, where concurrently the morphing soft tissues undergoes\nlarge deformations. Additionally, the proposed model is validated through\nsimulation results that capture changes in shape and cell concentration for\nwounded and intact microtissues, enabling the interpretation of experimental\ndata. The numerical procedure, that accounts for mechanosensitive stress\ngeneration, large deformations, diffusive migration in the bulk and a distinct\nmechanism for diffusive migration on deforming surfaces is inspired from recent\nwork on bulk and surface poroelasticity of hydrogels, but in this work a\ntwo-field weak form is proposed and is able to alleviate numerical\ninstabilities that were observed in the original method that utilized a\nthree-field formulation.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:39:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kim","Jaemin",""],["Sakar","Mahmut Selman",""],["Bouklas","Nikolaos",""]]}
{"id":"2308.02980","submitter":"Roman Kezerashvili","authors":"Igor Filikhin, Roman Ya. Kezerashvili, and Branislav Vlahovic","title":"The charge and mass symmetry breaking in the $KK\\bar{K}$ system","comments":"13 page, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the framework of the Faddeev equations in configuration space, we\ninvestigate the $K$(1460) meson as a resonant state of the $KK\\bar{K}$ kaonic\nsystem. We perform calculations for the particle configurations\n$K^{0}K^{+}K^{-}$ and $K^{0}K^{+}\\overline{{K}^{0}}$ within two models: the\n$ABC $ model, in which all three particles are distinguishable, and the $AAC$\nmodel when two particles are identical. The models differ in their treatment of\nthe kaon mass difference and the attractive Coulomb force between the\n$K^{+}K^{-}$ pair. We found that the Coulomb shift adds over 1 MeV to the\nthree-body binding energy. The expected correction to the binding energy due to\nmass redistribution from $AA$ to $AB$ is found to be negligible, up to a\nmaximum of 6\\% of the relative mass correction. At the same time, the symmetry\nof the wave function is distorted depending on the mass ratio value. We found\nthat the repulsive $KK$ interaction plays essential role in the binding energy\nof the $KK\\bar K$ system and report the mass of 1461.8 or 1464.1 MeV for the\nneutral $K^{0}$(1460) and 1466.5 or 1468.8 MeV for the charged $K^{+}$(1460)\nresonances, respectively, depending on the parameter sets for $KK$ and\n$K\\bar{K}$ interactions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 00:53:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Filikhin","Igor",""],["Kezerashvili","Roman Ya.",""],["Vlahovic","Branislav",""]]}
{"id":"2308.02981","submitter":"\\'Edouard Bonnet","authors":"\\'Edouard Bonnet, Romain Bourneuf, Colin Geniet, St\\'ephan Thomass\\'e","title":"Factoring Pattern-Free Permutations into Separable ones","comments":"34 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM cs.DS cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that for any permutation $\\pi$ there exists an integer $k_{\\pi}$ such\nthat every permutation avoiding $\\pi$ as a pattern is a product of at most\n$k_{\\pi}$ separable permutations. In other words, every strict class $\\mathcal\nC$ of permutations is contained in a bounded power of the class of separable\npermutations. This factorisation can be computed in linear time, for any fixed\n$\\pi$. The central tool for our result is a notion of width of permutations,\nintroduced by Guillemot and Marx [SODA '14] to efficiently detect patterns, and\nlater generalised to graphs and matrices under the name of twin-width.\nSpecifically, our factorisation is inspired by the decomposition used in the\nrecent result that graphs with bounded twin-width are polynomially\n$\\chi$-bounded. As an application, we show that there is a fixed class\n$\\mathcal C$ of graphs of bounded twin-width such that every class of bounded\ntwin-width is a first-order transduction of $\\mathcal C$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 01:09:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bonnet","\u00c9douard",""],["Bourneuf","Romain",""],["Geniet","Colin",""],["Thomass\u00e9","St\u00e9phan",""]]}
{"id":"2308.02982","submitter":"Haowei Wang","authors":"Haowei Wang, Jiji Tang, Jiayi Ji, Xiaoshuai Sun, Rongsheng Zhang,\n  Yiwei Ma, Minda Zhao, Lincheng Li, zeng zhao, Tangjie Lv, Rongrong Ji","title":"Beyond First Impressions: Integrating Joint Multi-modal Cues for\n  Comprehensive 3D Representation","comments":"ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3611767","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, 3D representation learning has turned to 2D vision-language\npre-trained models to overcome data scarcity challenges. However, existing\nmethods simply transfer 2D alignment strategies, aligning 3D representations\nwith single-view 2D images and coarse-grained parent category text. These\napproaches introduce information degradation and insufficient synergy issues,\nleading to performance loss. Information degradation arises from overlooking\nthe fact that a 3D representation should be equivalent to a series of\nmulti-view images and more fine-grained subcategory text. Insufficient synergy\nneglects the idea that a robust 3D representation should align with the joint\nvision-language space, rather than independently aligning with each modality.\nIn this paper, we propose a multi-view joint modality modeling approach, termed\nJM3D, to obtain a unified representation for point cloud, text, and image.\nSpecifically, a novel Structured Multimodal Organizer (SMO) is proposed to\naddress the information degradation issue, which introduces contiguous\nmulti-view images and hierarchical text to enrich the representation of vision\nand language modalities. A Joint Multi-modal Alignment (JMA) is designed to\ntackle the insufficient synergy problem, which models the joint modality by\nincorporating language knowledge into the visual modality. Extensive\nexperiments on ModelNet40 and ScanObjectNN demonstrate the effectiveness of our\nproposed method, JM3D, which achieves state-of-the-art performance in zero-shot\n3D classification. JM3D outperforms ULIP by approximately 4.3% on PointMLP and\nachieves an improvement of up to 6.5% accuracy on PointNet++ in top-1 accuracy\nfor zero-shot 3D classification on ModelNet40. The source code and trained\nmodels for all our experiments are publicly available at\nhttps://github.com/Mr-Neko/JM3D.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 01:11:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Haowei",""],["Tang","Jiji",""],["Ji","Jiayi",""],["Sun","Xiaoshuai",""],["Zhang","Rongsheng",""],["Ma","Yiwei",""],["Zhao","Minda",""],["Li","Lincheng",""],["zhao","zeng",""],["Lv","Tangjie",""],["Ji","Rongrong",""]]}
{"id":"2308.02983","submitter":"Xincheng Yao","authors":"Xincheng Yao and Ruoqi Li and Zefeng Qian and Yan Luo and Chongyang\n  Zhang","title":"Focus the Discrepancy: Intra- and Inter-Correlation Learning for Image\n  Anomaly 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":"  Humans recognize anomalies through two aspects: larger patch-wise\nrepresentation discrepancies and weaker patch-to-normal-patch correlations.\nHowever, the previous AD methods didn't sufficiently combine the two\ncomplementary aspects to design AD models. To this end, we find that\nTransformer can ideally satisfy the two aspects as its great power in the\nunified modeling of patch-wise representations and patch-to-patch correlations.\nIn this paper, we propose a novel AD framework: FOcus-the-Discrepancy (FOD),\nwhich can simultaneously spot the patch-wise, intra- and inter-discrepancies of\nanomalies. The major characteristic of our method is that we renovate the\nself-attention maps in transformers to Intra-Inter-Correlation (I2Correlation).\nThe I2Correlation contains a two-branch structure to first explicitly establish\nintra- and inter-image correlations, and then fuses the features of two-branch\nto spotlight the abnormal patterns. To learn the intra- and inter-correlations\nadaptively, we propose the RBF-kernel-based target-correlations as learning\ntargets for self-supervised learning. Besides, we introduce an entropy\nconstraint strategy to solve the mode collapse issue in optimization and\nfurther amplify the normal-abnormal distinguishability. Extensive experiments\non three unsupervised real-world AD benchmarks show the superior performance of\nour approach. Code will be available at https://github.com/xcyao00/FOD.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 01:30:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yao","Xincheng",""],["Li","Ruoqi",""],["Qian","Zefeng",""],["Luo","Yan",""],["Zhang","Chongyang",""]]}
{"id":"2308.02984","submitter":"Vasudhan Varma Kandula","authors":"Vasudhan Varma Kandula, Pushpak Bhattacharyya","title":"Decision Knowledge Graphs: Construction of and Usage in Question\n  Answering for Clinical Practice Guidelines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the medical domain, several disease treatment procedures have been\ndocumented properly as a set of instructions known as Clinical Practice\nGuidelines (CPGs). CPGs have been developed over the years on the basis of past\ntreatments, and are updated frequently. A doctor treating a particular patient\ncan use these CPGs to know how past patients with similar conditions were\ntreated successfully and can find the recommended treatment procedure. In this\npaper, we present a Decision Knowledge Graph (DKG) representation to store CPGs\nand to perform question-answering on CPGs. CPGs are very complex and no\nexisting representation is suitable to perform question-answering and searching\ntasks on CPGs. As a result, doctors and practitioners have to manually wade\nthrough the guidelines, which is inefficient. Representation of CPGs is\nchallenging mainly due to frequent updates on CPGs and decision-based\nstructure. Our proposed DKG has a decision dimension added to a Knowledge Graph\n(KG) structure, purported to take care of decision based behavior of CPGs.\nUsing this DKG has shown 40\\% increase in accuracy compared to fine-tuned\nBioBert model in performing question-answering on CPGs. To the best of our\nknowledge, ours is the first attempt at creating DKGs and using them for\nrepresenting CPGs.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 01:38:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kandula","Vasudhan Varma",""],["Bhattacharyya","Pushpak",""]]}
{"id":"2308.02985","submitter":"Abhiroop Chatterjee","authors":"Susmita Ghosh and Abhiroop Chatterjee","title":"Introducing Feature Attention Module on Convolutional Neural Network for\n  Diabetic Retinopathy Detection","comments":"6 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diabetic retinopathy (DR) is a leading cause of blindness among diabetic\npatients. Deep learning models have shown promising results in automating the\ndetection of DR. In the present work, we propose a new methodology that\nintegrates a feature attention module with a pretrained VGG19 convolutional\nneural network (CNN) for more accurate DR detection. Here, the pretrained net\nis fine-tuned with the proposed feature attention block. The proposed module\naims to leverage the complementary information from various regions of fundus\nimages to enhance the discriminative power of the CNN. The said feature\nattention module incorporates an attention mechanism which selectively\nhighlights salient features from images and fuses them with the original input.\nThe simultaneous learning of attention weights for the features and thereupon\nthe combination of attention-modulated features within the feature attention\nblock facilitates the network's ability to focus on relevant information while\nreducing the impact of noisy or irrelevant features. Performance of the\nproposed method has been evaluated on a widely used dataset for diabetic\nretinopathy classification e.g., the APTOS (Asia Pacific Tele-Ophthalmology\nSociety) DR Dataset. Results are compared with/without attention module, as\nwell as with other state-of-the-art approaches. Results confirm that the\nintroduction of the fusion module (fusing of feature attention module with CNN)\nimproves the accuracy of DR detection achieving an accuracy of 95.70%.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 01:52:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ghosh","Susmita",""],["Chatterjee","Abhiroop",""]]}
{"id":"2308.02986","submitter":"Xabier P\\'erez-Couto MSc","authors":"Xabier P\\'erez-Couto, Fabio Falchi and Salvador Bar\\'a","title":"On the Posch ratio for irradiance in coastal waters and the high seas","comments":"14 pages, 5 figures, 1 table","journal-ref":"Journal of Quantitative Spectroscopy and Radiative Transfer,\n  Volume 298, 2023, 108503","doi":"10.1016/j.jqsrt.2023.108503","report-no":null,"categories":"astro-ph.IM physics.ao-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The horizontal irradiance at the sea surface is an informative light\npollution indicator to study Artificial Light at Night (ALAN) effects on marine\nbiodiversity (e.g.: zooplankton diel vertical migration). The Posch ratio (PR)\nfor the horizontal irradiance (that is, the ratio of the horizontal irradiance\nto the zenith radiance) is a useful tool for estimating the irradiance from\neasily available measurements of the zenith night sky brightness. The PR\ndefinition has already been generalized for any pair of linear radiance\nindicators in any pair of arbitrarily chosen photometric bands, and can also be\napplied to estimate e.g. the average sky radiance or the radiance at some\nelevation above the horizon as a function of the radiance in any other\ndirection of the sky. The PR for a single light source depends on the distance\nfrom the source, its angular and spectral emission pattern, and the state of\nthe atmosphere. The PR for any set of sources is a linear combination of the\nindividual PRs that each one would produce separately, with weights that can be\neasily derived from the relative contribution of each source to the zenith\nradiance. Whereas in populated lands the ALAN PR varies relatively fast from\none location to another, due to the particular spatial distribution of lights,\nin coastal waters and the high seas the light pollution PR is a smooth function\nof the distance to the shoreline, due to the progressive lack of neighboring\nsources and the absence of obstacles. In this work we present the fundamental\nequations of the model and an example of application for the waters surrounding\nthe Iberian Peninsula, North Africa and the West Mediterranean islands.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:03:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["P\u00e9rez-Couto","Xabier",""],["Falchi","Fabio",""],["Bar\u00e1","Salvador",""]]}
{"id":"2308.02987","submitter":"Li Wang","authors":"Li Wang, Jiaqun Wei, Haicheng Zhang","title":"Cluster characters for 2-Calabi-Yau Frobenius extriangulated categories","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CT math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define the cluster characters for 2-Calabi-Yau Frobenius extriangulated\ncategories with cluster tilting objects. This provides a unified framework of\ncluster characters in 2-Calabi-Yau triangulated categories and 2-Calabi-Yau\nFrobenius exact categories given by Palu and Fu-Keller, respectively\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:13:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Li",""],["Wei","Jiaqun",""],["Zhang","Haicheng",""]]}
{"id":"2308.02988","submitter":"Yuqian Zhang","authors":"Yuqian Zhang, Changzheng Sun, Bing Xiong, Jian Wang, Zhibiao Hao, Lai\n  Wang, Yanjun Han, Hongtao Li, Yi Luo","title":"Suspended AlGaAs-Integrated Nonlinear Photonics","comments":"12 pages, 8 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":"  AlGaAs is a promising integrated nonlinear photonics material with enormous\noptical nonlinearity and high refractive index. Nevertheless, presently AlGaAs\nmicroring resonators exhibiting high quality factors and tight optical\nconfinement rely predominantly on wafer bonding techniques, which entail an\nintricate fabrication process. Here, we present suspended AlGaAs waveguides and\nresonators as a viable platform for high efficiency integrated nonlinear\nphotonics. The suspended microring resonator formed by combined plasma dry\netching and chemical wet etching exhibits an intrinsic quality factor Q of\n2.1*106, and Kerr comb generation with milliwatt level threshold is recorded.\nOur demonstration opens up a new prospect for employing AlGaAs devices in\nintegrated nonlinear photonics.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:13:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Yuqian",""],["Sun","Changzheng",""],["Xiong","Bing",""],["Wang","Jian",""],["Hao","Zhibiao",""],["Wang","Lai",""],["Han","Yanjun",""],["Li","Hongtao",""],["Luo","Yi",""]]}
{"id":"2308.02989","submitter":"Chuyu Zhang","authors":"Chuyu Zhang, Ruijie Xu, Xuming He","title":"Novel Class Discovery for Long-tailed Recognition","comments":"TMLR2023, Final version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  While the novel class discovery has recently made great progress, existing\nmethods typically focus on improving algorithms on class-balanced benchmarks.\nHowever, in real-world recognition tasks, the class distributions of their\ncorresponding datasets are often imbalanced, which leads to serious performance\ndegeneration of those methods. In this paper, we consider a more realistic\nsetting for novel class discovery where the distributions of novel and known\nclasses are long-tailed. One main challenge of this new problem is to discover\nimbalanced novel classes with the help of long-tailed known classes. To tackle\nthis problem, we propose an adaptive self-labeling strategy based on an\nequiangular prototype representation of classes. Our method infers high-quality\npseudo-labels for the novel classes by solving a relaxed optimal transport\nproblem and effectively mitigates the class biases in learning the known and\nnovel classes. We perform extensive experiments on CIFAR100, ImageNet100,\nHerbarium19 and large-scale iNaturalist18 datasets, and the results demonstrate\nthe superiority of our method. Our code is available at\nhttps://github.com/kleinzcy/NCDLR.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:15:19 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 02:58:53 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 13:57:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Chuyu",""],["Xu","Ruijie",""],["He","Xuming",""]]}
{"id":"2308.02990","submitter":"Alan Coleman","authors":"Alan Coleman (for the IceCube-Gen2 Collaboration)","title":"The Surface Array of IceCube-Gen2","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-205","categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The science goals of IceCube-Gen2 include multi-messenger astronomy,\nastroparticle and particle physics. To this end, the observatory will include\nseveral detection methods, including a surface array and in-ice optical\nsensors. The array will have an approximately 8 km$^2$ surface coverage\nconsisting of elevated scintillator panels and radio antennas to detect air\nshowers in the energy range of several 100 TeV to a few EeV. The observatory's\ndesign is unique in that the measurements using the surface array can be\ncombined with the observations of $\\geq$300 GeV muons, produced in the hadronic\ncascades, using the optical detectors in the ice. This allows for an enhanced\nability to study cosmic-ray and hadronic physics as well as to boost the\nsensitivity for astrophysical neutrinos from the southern sky by reducing the\nprimary background, atmospheric muons. We will present the baseline design of\nthe surface array and highlight the expected scientific capabilities.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:16:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Coleman","Alan","","for the IceCube-Gen2 Collaboration"]]}
{"id":"2308.02991","submitter":"Thiago Cavalheiro","authors":"Thiago Cavalheiro, Alexandre Santana, Jo\\~ao Cossich","title":"Controllability of discrete-time linear systems on lie groups with\n  finite semisimple center","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we stated a condition for the controllability of discrete-time\nlinear systems for the case when the Lie group has finite semisimple center.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:22:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cavalheiro","Thiago",""],["Santana","Alexandre",""],["Cossich","Jo\u00e3o",""]]}
{"id":"2308.02992","submitter":"Zian Liu","authors":"Zian Liu","title":"Binary Code Similarity Detection","comments":"4 pages, conference paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Binary code similarity detection is to detect the similarity of code at\nbinary (assembly) level without source code. Existing works have their\nlimitations when dealing with mutated binary code generated by different\ncompiling options. In this paper, we propose a novel approach to addressing\nthis problem. By inspecting the binary code, we found that generally, within a\nfunction, some instructions aim to calculate (prepare) values for other\ninstructions. The latter instructions are defined by us as key instructions.\nCurrently, we define four categories of key instructions: calling subfunctions,\ncomparing instruction, returning instruction, and memory-store instruction.\nThus if we symbolically execute similar binary codes, symbolic values at these\nkey instructions are expected to be similar. As such, we implement a prototype\ntool, which has three steps. First, it symbolically executes binary code;\nSecond, it extracts symbolic values at defined key instructions into a graph;\nLast, it compares the symbolic graph similarity. In our implementation, we also\naddress some problems, including path explosion and loop handling.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:24:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Zian",""]]}
{"id":"2308.02993","submitter":"Nguyen Xuan Hong","authors":"Nguyen Xuan Hong","title":"Plurifinely open sets and complex Monge-Amp\\`ere measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of the paper is to investigate the structure of plurifinely open\nsets. As an application, we will prove an equality on complex Monge-Amp\\`ere\nmeasures in plurifinely open sets.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:30:30 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:01:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hong","Nguyen Xuan",""]]}
{"id":"2308.02994","submitter":"Wen Luo","authors":"Wenru Fan, Wei Qi, Jingli Zhang, Zongwei Cao, Haoyang Lan, Xinxiang\n  Li, Yi Xu, Yuqiu Gu, Zhigang Deng, Zhimeng Zhang, Changxiang Tan, Wen Luo,\n  Yun Yuan, Weimin Zhou","title":"Efficient production of nuclear isomer $^{93m}$Mo with laser-accelerated\n  proton beam and an astrophysical implication on $^{92m}$Mo production","comments":"21 pages, 9 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex astro-ph.SR nucl-th physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nuclear isomers play a key role in the creation of the elements in the\nuniverse and have a number of fascinating potential applications related to the\ncontrolled release of nuclear energy on demand. Particularly, $^{93m}$Mo isomer\nis a good candidate for studying the depletion of nuclear isomer via nuclear\nexcitation by electron capture. For such purposes, efficient approach for\n$^{93m}$Mo production needs to be explored. In the present work, we demonstrate\nexperimentally an efficient production of $^{93m}$Mo through $^{93}$Nb(p, n)\nreaction induced by intense laser pulse. When a ps-duration, 100-J laser pulse\nis employed, the $^{93m}$Mo isomer at 2425 keV (21/2$^+$, $T_{1/2}$ = 6.85 h)\nare generated with a high yield of $1.8\\times10^6$ particles/shot. The\nresulting peak efficiency is expected to be $10^{17}$ particles/s, which is at\nleast five orders of magnitudes higher than using classical proton accelerator.\nThe effects of production and destruction of $^{93m}$Mo on the controversial\nastrophysical p-isotope $^{92}$Mo are studied. It is found that the\n$^{93}$Nb(p, n)-$^{93m}$Mo reaction is an important production path for\n^{93m}Mo seed nucleus, and the influence of ^{93m}Mo-^{92}Mo reaction flow on\n^{92}Mo production cannot be ignored. In addition, we propose to directly\nmeasure the astrophysical rate of (p, n) reaction using laser-induced proton\nbeam since the latter one fits the Maxwell-Boltzmann distribution well. We\nconclude that laser-induced proton beam opens a new path to produce nuclear\nisomers with high peak efficiency towards the understanding of p-nuclei\nnucleosythesis.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:41:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fan","Wenru",""],["Qi","Wei",""],["Zhang","Jingli",""],["Cao","Zongwei",""],["Lan","Haoyang",""],["Li","Xinxiang",""],["Xu","Yi",""],["Gu","Yuqiu",""],["Deng","Zhigang",""],["Zhang","Zhimeng",""],["Tan","Changxiang",""],["Luo","Wen",""],["Yuan","Yun",""],["Zhou","Weimin",""]]}
{"id":"2308.02995","submitter":"Aaron Ge","authors":"Aaron Ge, Yasmmin, Tongwu Zhang, Kailing Chen, Maria Teresa Landi,\n  Brian Park, Jeya Balasubramanian, Jonas S Almeida","title":"mSigSDK -- private, at scale, computation of mutation signatures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In our previous work, we demonstrated that it is feasible to perform analysis\non mutation signature data without the need for downloads or installations and\nanalyze individual patient data at scale without compromising privacy. Building\non this foundation, we developed a Software Development Kit (SDK) called\nmSigSDK to facilitate the orchestration of distributed data processing\nworkflows and graphic visualization of mutational signature analysis results.\nWe strictly adhered to modern web computing standards, particularly the\nmodularization standards set by the ECMAScript ES6 framework (JavaScript\nmodules). Our approach allows for computation to be entirely performed by\nsecure delegation to the computational resources of the user's own machine\n(in-browser), without any downloads or installations. The mSigSDK was developed\nprimarily as a companion library to the mSig Portal resource of the National\nCancer Institute Division of Cancer Epidemiology and Genetics (NIH/NCI/DCEG),\nwith a focus on its FAIR extensibility as components of other researchers'\ncomputational constructs. Anticipated extensions include the programmatic\noperation of other mutation signature API ecosystems such as SIGNAL and COSMIC,\nadvancing towards a data commons for mutational signature research (Grossman et\nal., 2016).\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:41:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ge","Aaron",""],["Yasmmin","",""],["Zhang","Tongwu",""],["Chen","Kailing",""],["Landi","Maria Teresa",""],["Park","Brian",""],["Balasubramanian","Jeya",""],["Almeida","Jonas S",""]]}
{"id":"2308.02996","submitter":"Hao Xu","authors":"Zihan Zhou, Zihao Li, Xiaoshuai Zhang, Yunqing Sun and Hao Xu","title":"A Review of Gaps between Web 4.0 and Web 3.0 Intelligent Network\n  Infrastructure","comments":"6 pages 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.CY cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  World Wide Web is speeding up its pace into an intelligent and decentralized\necosystem, as seen in the campaign of Web 3.0 and forthcoming Web 4.0. Marked\nby the Europe Commission's latest mention of Web 4.0, a race towards strategic\nWeb 4.0 success has started. Web 4.0 is committed to bringing the next\ntechnological transition with an open, secure, trustworthy fairness and digital\necosystem for individuals and businesses in private and public sectors. Despite\noverlapping scopes and objectives of Web 3.0 and Web 4.0 from academic and\nindustrial perspectives, there are distinct and definitive features and gaps\nfor the next generation of WWW. In this review, a brief introduction to WWW\ndevelopment unravels the entangled but consistent requirement of a more vivid\nweb experience, enhancing human-centric experience in both societal and\ntechnical aspects. Moreover, the review brings a decentralized intelligence\nprospect of view on native AI entities for Web 4.0, envisioning sustainable,\nautonomous and decentralized AI services for the entire Web 4.0 environment,\npowering a self-sustainable Decentralized Physical and Software Infrastructure\nfor Computing Force Network, Semantic Network, Virtual/Mixed Reality, and\nPrivacy-preserving content presumption.\n  The review aims to reveal that Web 4.0 offers native intelligence with\nfocused thinking on utilizing decentralized physical infrastructure, in\naddition to sole requirements on decentralization, bridging the gap between Web\n4.0 and Web 3.0 advances with the latest future-shaping blockchain-enabled\ncomputing and network routing protocols.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:49:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Zihan",""],["Li","Zihao",""],["Zhang","Xiaoshuai",""],["Sun","Yunqing",""],["Xu","Hao",""]]}
{"id":"2308.02997","submitter":"Changzheng Yuan","authors":"Chang-Zheng Yuan","title":"Heavy Flavour Spectroscopy","comments":"6 pages, 3 figures. Talk at the 31st International Symposium on\n  Lepton Photon Interactions at High Energies. arXiv admin note: text overlap\n  with arXiv:2211.07217","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The discovery of hadronic states beyond the conventional two-quark meson and\nthree-quark baryon picture in the last two decades is one of the most amazing\naccomplishments in fundamental physics research. We review the experimental\nprogress on the study of the exotic states (also known as the XYZ particles)\nbeyond the conventional quark model. We give a general review and then focus on\nthe lineshape measurement of the X(3872), observation of new decay modes of the\nY(4230) and new vector charmoniumlike states Y(4500) and Y(4790), evidence for\nthe neutral isospin partners of the charged charmoniumlike $Z_{cs}$ states,\ndiscoveries of the tetraquark state candidates with four different flavours or\ntwo-pairs of charm-anticharm quarks and the pentaquark states.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 02:58:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yuan","Chang-Zheng",""]]}
{"id":"2308.02998","submitter":"Paolo Dolce","authors":"Paolo Dolce","title":"A note on some Diophantine inequalities over adelic curves","comments":"7 pages. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Without assuming the Northcott property we provide an upper bound on the\nnumber of \"big solutions\" of a special system of Diophantine inequalities over\nproper adelic curves. This system is interesting since it is a stronger version\nRoth's inequality for adelic curves.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:03:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dolce","Paolo",""]]}
{"id":"2308.02999","submitter":"Takeshi Yasui","authors":"Yu Tokizane, Shota Okada, Takumi Kikuhara, Hiroki Kishikawa, Yasuhiro\n  Okamura, Yoshihiro Makimoto, Kenji Nishimoto, Takeo Minamikawa, Eiji Hase,\n  Jun-Ichi Fujikata, Masanobu Haraguchi, Atsushi Kanno, Shintaro Hisatake,\n  Naoya Kuse, and Takeshi Yasui","title":"Wireless data transmission in a 560-GHz band using low-phase-noise\n  terahertz wave generated by photomixing of a pair of distributed feedback\n  lasers injection-locking to Kerr micro-resonator soliton comb","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":"  The demand for higher data rates in next-generation mobile wireless\ncommunication systems (6G) has led to significant interest in terahertz (THz)\nwaves as a high-frequency, broad modulation bandwidth carrier wave. In this\nstudy, we propose and demonstrate a wireless data transfer in the 560-GHz band\nusing low-phase-noise THz waves generated by photomixing of a pair of\ndistributed feedback lasers injection-locking to Kerr micro-resonator soliton\ncomb. Experimental results showed near-error-free on-off keying (OOK) data\ntransfer at 1 Gbit/s in the 560-GHz band, with a Q-factor of 6.23, surpassing\nthe error-free limit. Also, modulation formats of binary phase shift keying\n(BPSK) and quadrature phase shift keying (QPSK) were successfully used, showing\nclear constellation diagrams and relatively low root mean squared error vector\nmagnitude (rms EVM) values of 23.9% and 23.6%, respectively. Moreover, data\ntransfer at 0.4 Gbit/s in 16 quadrature amplitude modulation (16QAM)\ndemonstrated clear isolated symbols and achieved a low rms EVM value of 8.1%,\ncomplying with the IEEE 802.15.3d standard amendment. These demonstrations\nhighlight the potential of using injection-locked DFB lasers with the Kerr\nmicro-resonator soliton comb to achieve high-quality, high-speed wireless data\ntransfer in the 560-GHz band. These findings contribute significantly to the\nadvancement of wireless communication technology in the THz frequency range and\npave the way for the realization of 6G wireless communication systems.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:11:33 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 04:33:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tokizane","Yu",""],["Okada","Shota",""],["Kikuhara","Takumi",""],["Kishikawa","Hiroki",""],["Okamura","Yasuhiro",""],["Makimoto","Yoshihiro",""],["Nishimoto","Kenji",""],["Minamikawa","Takeo",""],["Hase","Eiji",""],["Fujikata","Jun-Ichi",""],["Haraguchi","Masanobu",""],["Kanno","Atsushi",""],["Hisatake","Shintaro",""],["Kuse","Naoya",""],["Yasui","Takeshi",""]]}
{"id":"2308.03000","submitter":"Xianyi Liu","authors":"Peiguang Jing, Xianyi Liu, Ji Wang, Yinwei Wei, Liqiang Nie, Yuting Su","title":"StyleEDL: Style-Guided High-order Attention Network for Image Emotion\n  Distribution Learning","comments":"8 pages, 5 figures, conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emotion distribution learning has gained increasing attention with the\ntendency to express emotions through images. As for emotion ambiguity arising\nfrom humans' subjectivity, substantial previous methods generally focused on\nlearning appropriate representations from the holistic or significant part of\nimages. However, they rarely consider establishing connections with the\nstylistic information although it can lead to a better understanding of images.\nIn this paper, we propose a style-guided high-order attention network for image\nemotion distribution learning termed StyleEDL, which interactively learns\nstylistic-aware representations of images by exploring the hierarchical\nstylistic information of visual contents. Specifically, we consider exploring\nthe intra- and inter-layer correlations among GRAM-based stylistic\nrepresentations, and meanwhile exploit an adversary-constrained high-order\nattention mechanism to capture potential interactions between subtle visual\nparts. In addition, we introduce a stylistic graph convolutional network to\ndynamically generate the content-dependent emotion representations to benefit\nthe final emotion distribution learning. Extensive experiments conducted on\nseveral benchmark datasets demonstrate the effectiveness of our proposed\nStyleEDL compared to state-of-the-art methods. The implementation is released\nat: https://github.com/liuxianyi/StyleEDL.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:22:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jing","Peiguang",""],["Liu","Xianyi",""],["Wang","Ji",""],["Wei","Yinwei",""],["Nie","Liqiang",""],["Su","Yuting",""]]}
{"id":"2308.03001","submitter":"Amirhossein Rasoulian","authors":"Amirhossein Rasoulian, Soorena Salari, Yiming Xiao","title":"Weakly supervised segmentation of intracranial aneurysms using a 3D\n  focal modulation UNet","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Accurate identification and quantification of unruptured intracranial\naneurysms (UIAs) are essential for the risk assessment and treatment decisions\nof this cerebrovascular disorder. Current assessment based on 2D manual\nmeasures of aneurysms on 3D magnetic resonance angiography (MRA) is sub-optimal\nand time-consuming. Automatic 3D measures can significantly benefit the\nclinical workflow and treatment outcomes. However, one major issue in medical\nimage segmentation is the need for large well-annotated data, which can be\nexpensive to obtain. Techniques that mitigate the requirement, such as weakly\nsupervised learning with coarse labels are highly desirable. In this paper, we\nleverage coarse labels of UIAs from time-of-flight MRAs to obtain refined UIAs\nsegmentation using a novel 3D focal modulation UNet, called FocalSegNet and\nconditional random field (CRF) postprocessing, with a Dice score of 0.68 and\n95% Hausdorff distance of 0.95 mm. We evaluated the performance of the proposed\nalgorithms against the state-of-the-art 3D UNet and Swin-UNETR, and\ndemonstrated the superiority of the proposed FocalSegNet and the benefit of\nfocal modulation for the task.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:28:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rasoulian","Amirhossein",""],["Salari","Soorena",""],["Xiao","Yiming",""]]}
{"id":"2308.03002","submitter":"Chun-Hua Yuan","authors":"Jie Zeng, Yingxing Ding, Mengyao Zhou, Gao-Feng Jiao, Keye Zhang, L.\n  Q. Chen, Weiping Zhang, and Chun-Hua Yuan","title":"The effect of Quantum Statistics on the sensitivity in an SU(1,1)\n  interferometer","comments":"8 pages, 5 figures. arXiv admin note: text overlap with\n  arXiv:2302.09823","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We theoretically study the effect of quantum statistics of the light field on\nthe quantum enhancement of parameter estimation based on cat state input the\nSU(1,1) interferometer. The phase sensitivity is dependent on the relative\nphase $\\theta$ between two coherent states of Schr\\\"{o}dinger cat states. The\noptimal sensitivity is achieved when the relative phase is $\\pi$% , i.e., odd\ncoherent states input. For a coherent state input into one port, the phase\nsensitivity of the odd coherent state into the second input port is inferior to\nthat of the squeezed vacuum state input. However, in the presence of losses the\nSchr\\\"{o}dinger cat states are more resistant to loss than squeezed vacuum\nstates. As the amplitude of Schr\\\"{o}dinger cat states increases, the quantum\nenhancement of phase sensitivity decreases, which shows that the quantum\nstatistics of Schr\\\"{o}dinger cat states tends towards Poisson statistics from\nsub-Poisson statistics or super-Poisson statistics.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:28:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zeng","Jie",""],["Ding","Yingxing",""],["Zhou","Mengyao",""],["Jiao","Gao-Feng",""],["Zhang","Keye",""],["Chen","L. Q.",""],["Zhang","Weiping",""],["Yuan","Chun-Hua",""]]}
{"id":"2308.03003","submitter":"Zixin Wang","authors":"Zixin Wang, Yadan Luo, Zhi Chen, Sen Wang, Zi Huang","title":"Cal-SFDA: Source-Free Domain-adaptive Semantic Segmentation with\n  Differentiable Expected Calibration Error","comments":"To appear in ACM Multimedia 2023","journal-ref":null,"doi":"10.1145/3581783.3611808","report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The prevalence of domain adaptive semantic segmentation has prompted concerns\nregarding source domain data leakage, where private information from the source\ndomain could inadvertently be exposed in the target domain. To circumvent the\nrequirement for source data, source-free domain adaptation has emerged as a\nviable solution that leverages self-training methods to pseudo-label\nhigh-confidence regions and adapt the model to the target data. However, the\nconfidence scores obtained are often highly biased due to over-confidence and\nclass-imbalance issues, which render both model selection and optimization\nproblematic. In this paper, we propose a novel calibration-guided source-free\ndomain adaptive semantic segmentation (Cal-SFDA) framework. The core idea is to\nestimate the expected calibration error (ECE) from the segmentation\npredictions, serving as a strong indicator of the model's generalization\ncapability to the unlabeled target domain. The estimated ECE scores, in turn,\nassist the model training and fair selection in both source training and target\nadaptation stages. During model pre-training on the source domain, we ensure\nthe differentiability of the ECE objective by leveraging the LogSumExp trick\nand using ECE scores to select the best source checkpoints for adaptation. To\nenable ECE estimation on the target domain without requiring labels, we train a\nvalue net for ECE estimation and apply statistic warm-up on its BatchNorm\nlayers for stability. The estimated ECE scores assist in determining the\nreliability of prediction and enable class-balanced pseudo-labeling by\npositively guiding the adaptation progress and inhibiting potential error\naccumulation. Extensive experiments on two widely-used synthetic-to-real\ntransfer tasks show that the proposed approach surpasses previous\nstate-of-the-art by up to 5.25% of mIoU with fair model selection criteria.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:28:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Zixin",""],["Luo","Yadan",""],["Chen","Zhi",""],["Wang","Sen",""],["Huang","Zi",""]]}
{"id":"2308.03004","submitter":"Namyoon Lee","authors":"Geon Choi and Namyoon Lee","title":"Deep Polar Codes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.LG math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we introduce a novel class of pre-transformed polar codes,\ntermed as deep polar codes. We first present a deep polar encoder that\nharnesses a series of multi-layered polar transformations with varying sizes.\nOur approach to encoding enables a low-complexity implementation while\nsignificantly enhancing the weight distribution of the code. Moreover, our\nencoding method offers flexibility in rate-profiling, embracing a wide range of\ncode rates and blocklengths. Next, we put forth a low-complexity decoding\nalgorithm called successive cancellation list with backpropagation parity\nchecks (SCL-BPC). This decoding algorithm leverages the parity check equations\nin the reverse process of the multi-layered pre-transformed encoding for SCL\ndecoding. Additionally, we present a low-latency decoding algorithm that\nemploys parallel-SCL decoding by treating partially pre-transformed bit\npatterns as additional frozen bits. Through simulations, we demonstrate that\ndeep polar codes outperform existing pre-transformed polar codes in terms of\nblock error rates across various code rates under short block lengths, while\nmaintaining low encoding and decoding complexity. Furthermore, we show that\nconcatenating deep polar codes with cyclic-redundancy-check codes can achieve\nthe meta-converse bound of the finite block length capacity within 0.4 dB in\nsome instances.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:29:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Choi","Geon",""],["Lee","Namyoon",""]]}
{"id":"2308.03005","submitter":"Lian Xu","authors":"Lian Xu, Mohammed Bennamoun, Farid Boussaid, Hamid Laga, Wanli Ouyang,\n  Dan Xu","title":"MCTformer+: Multi-Class Token Transformer for Weakly Supervised Semantic\n  Segmentation","comments":"Journal extension for MCTformer","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 transformer-based framework that aims to enhance\nweakly supervised semantic segmentation (WSSS) by generating accurate\nclass-specific object localization maps as pseudo labels. Building upon the\nobservation that the attended regions of the one-class token in the standard\nvision transformer can contribute to a class-agnostic localization map, we\nexplore the potential of the transformer model to capture class-specific\nattention for class-discriminative object localization by learning multiple\nclass tokens. We introduce a Multi-Class Token transformer, which incorporates\nmultiple class tokens to enable class-aware interactions with the patch tokens.\nTo achieve this, we devise a class-aware training strategy that establishes a\none-to-one correspondence between the output class tokens and the ground-truth\nclass labels. Moreover, a Contrastive-Class-Token (CCT) module is proposed to\nenhance the learning of discriminative class tokens, enabling the model to\nbetter capture the unique characteristics and properties of each class. As a\nresult, class-discriminative object localization maps can be effectively\ngenerated by leveraging the class-to-patch attentions associated with different\nclass tokens. To further refine these localization maps, we propose the\nutilization of patch-level pairwise affinity derived from the patch-to-patch\ntransformer attention. Furthermore, the proposed framework seamlessly\ncomplements the Class Activation Mapping (CAM) method, resulting in\nsignificantly improved WSSS performance on the PASCAL VOC 2012 and MS COCO 2014\ndatasets. These results underline the importance of the class token for WSSS.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:30:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Lian",""],["Bennamoun","Mohammed",""],["Boussaid","Farid",""],["Laga","Hamid",""],["Ouyang","Wanli",""],["Xu","Dan",""]]}
{"id":"2308.03006","submitter":"Xiao Liang","authors":"Kareem Eltouny, Seyedomid Sajedi, and Xiao Liang","title":"High-Resolution Vision Transformers for Pixel-Level Identification of\n  Structural Components and Damage","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":"  Visual inspection is predominantly used to evaluate the state of civil\nstructures, but recent developments in unmanned aerial vehicles (UAVs) and\nartificial intelligence have increased the speed, safety, and reliability of\nthe inspection process. In this study, we develop a semantic segmentation\nnetwork based on vision transformers and Laplacian pyramids scaling networks\nfor efficiently parsing high-resolution visual inspection images. The massive\namounts of collected high-resolution images during inspections can slow down\nthe investigation efforts. And while there have been extensive studies\ndedicated to the use of deep learning models for damage segmentation,\nprocessing high-resolution visual data can pose major computational\ndifficulties. Traditionally, images are either uniformly downsampled or\npartitioned to cope with computational demands. However, the input is at risk\nof losing local fine details, such as thin cracks, or global contextual\ninformation. Inspired by super-resolution architectures, our vision transformer\nmodel learns to resize high-resolution images and masks to retain both the\nvaluable local features and the global semantics without sacrificing\ncomputational efficiency. The proposed framework has been evaluated through\ncomprehensive experiments on a dataset of bridge inspection report images using\nmultiple metrics for pixel-wise materials detection.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:34:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Eltouny","Kareem",""],["Sajedi","Seyedomid",""],["Liang","Xiao",""]]}
{"id":"2308.03007","submitter":"Mateo Reynoso","authors":"Mateo Reynoso, Dmitriy Zhigunov and Roman O. Grigoriev","title":"Self-similarity and the direct (enstrophy) cascade in two-dimensional\n  fluid turbulence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A widely used statistical theory of 2D turbulence developed by Kraichnan,\nLeith, and Batchelor (KLB) predicts a power-law scaling for the energy,\n$E(k)\\propto k^\\alpha$ with an integral exponent $\\alpha={-3}$, in the inertial\nrange associated with the direct cascade. In the presence of large-scale\ncoherent structures, a power-law scaling is observed, but the exponent often\ndiffers substantially from the value predicted by the KLB theory. Here we\npresent a dynamical theory which describes the key physical mechanism behind\nthe direct cascade and sheds new light on the relationship between the\nstructure of the large-scale flow and the scaling of the small-scale structures\nin the inertial range. This theory also goes a step beyond KLB, to predict the\nupper and lower bounds of the inertial range as well as the energy scaling in\nthe dissipation range.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:35:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Reynoso","Mateo",""],["Zhigunov","Dmitriy",""],["Grigoriev","Roman O.",""]]}
{"id":"2308.03008","submitter":"Zongwei Zhou","authors":"Bowen Li, Yu-Cheng Chou, Shuwen Sun, Hualin Qiao, Alan Yuille, Zongwei\n  Zhou","title":"Early Detection and Localization of Pancreatic Cancer by Label-Free\n  Tumor Synthesis","comments":"Big Task Small Data, 1001-AI, MICCAI Workshop, 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":"  Early detection and localization of pancreatic cancer can increase the 5-year\nsurvival rate for patients from 8.5% to 20%. Artificial intelligence (AI) can\npotentially assist radiologists in detecting pancreatic tumors at an early\nstage. Training AI models require a vast number of annotated examples, but the\navailability of CT scans obtaining early-stage tumors is constrained. This is\nbecause early-stage tumors may not cause any symptoms, which can delay\ndetection, and the tumors are relatively small and may be almost invisible to\nhuman eyes on CT scans. To address this issue, we develop a tumor synthesis\nmethod that can synthesize enormous examples of small pancreatic tumors in the\nhealthy pancreas without the need for manual annotation. Our experiments\ndemonstrate that the overall detection rate of pancreatic tumors, measured by\nSensitivity and Specificity, achieved by AI trained on synthetic tumors is\ncomparable to that of real tumors. More importantly, our method shows a much\nhigher detection rate for small tumors. We further investigate the per-voxel\nsegmentation performance of pancreatic tumors if AI is trained on a combination\nof CT scans with synthetic tumors and CT scans with annotated large tumors at\nan advanced stage. Finally, we show that synthetic tumors improve AI\ngeneralizability in tumor detection and localization when processing CT scans\nfrom different hospitals. Overall, our proposed tumor synthesis method has\nimmense potential to improve the early detection of pancreatic cancer, leading\nto better patient outcomes.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:37:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Bowen",""],["Chou","Yu-Cheng",""],["Sun","Shuwen",""],["Qiao","Hualin",""],["Yuille","Alan",""],["Zhou","Zongwei",""]]}
{"id":"2308.03009","submitter":"Wenjun Liu","authors":"Jie Zhang and Wenjun Liu","title":"The horizontal magnetic primitive equations approximation of the\n  anisotropic MHD equations in a thin 3D domain","comments":"39 pages, 0 figures","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":"  In this paper, we give a rigorous justification of the deviation of the\nprimitive equations with only horizontal viscosity and magnetic diffusivity\n(PEHM) as the small aspect ratio limit of the incompressible three-dimensional\nscaled horizontal viscous MHD (SHMHD) equations. Choosing an aspect ratio\nparameter $\\varepsilon \\in(0,\\infty)$, we consider the case that if the\nhorizontal and vertical viscous coefficients are of $\\mu = O(1)$ and $\\nu =\nO({\\varepsilon ^\\alpha })$, and the orders of magnetic diffusion coefficients\n$k$ and $\\sigma$ are $k = O(1)$ and $\\sigma = O({\\varepsilon ^\\alpha })$, with\n$\\alpha > 2$, then the limiting system is the PEHM as $\\varepsilon$ goes to\nzero. For ${H^1}$-initial data, we prove that the global weak solutions of the\nSHMHD equations converge strongly to the local-in-time strong solutions of the\nPEHM, as $\\varepsilon$ tends to zero. For ${H^1}$-initial data with additional\nregularity $({\\partial _z}{\\tilde A_0},{\\partial _z}{\\tilde B_0}) \\in\n{L^p}(\\Omega )(2<p<\\infty)$, we slightly improve the well-posed result in\n\\cite{2017-Cao-Li-Titi-Global} to extend the local-in-time strong convergences\nto the global-in-time one. For ${H^2}$-initial data, we show that the\nlocal-in-time strong solutions of the SHMHD equations converge strongly to the\nglobal-in-time strong solutions of the PEHM, as $\\varepsilon$ goes to zero.\nMoreover, the rate of convergence is of the order $O({\\varepsilon ^{\\gamma\n/2}})$, where $\\gamma = \\min \\{ 2,\\alpha - 2\\}$ with $\\alpha \\in (2,\\infty )$.\nIt should be noted that in contrast to the case $\\alpha > 2$, the case $\\alpha\n=2$ has been investigated by Du and Li in \\cite{2023-Du-Li}, in which they\nconsider the PEM and the rate of global-in-time convergences is of the order\n$O(\\varepsilon)$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:38:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Jie",""],["Liu","Wenjun",""]]}
{"id":"2308.03010","submitter":"Takeshi Yasui","authors":"Takahiko Mizuno, Takuya Tsuda, Eiji Hase, Hirotsugu Yamamoto, Takeo\n  Minamikawa, and Takeshi Yasui","title":"Coherent linking between confocal amplitude image and confocal phase\n  image in dual-comb microscopy","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a coherent linking approach between confocal amplitude\nand confocal phase images acquired using dual-comb microscopy (DCM). DCM\ncombines the advantages of confocal laser microscopy and quantitative phase\nmicroscopy, offering high axial resolution and scan-less imaging capability. By\nexploiting the coherence between confocal amplitude and phase images within the\nsame DCM system, we accurately determine the number of phase unwrapping\niterations, eliminating phase wrapping ambiguity. The method is demonstrated\nwith samples having micrometer-range optical thickness and nanometer-scale\nsurface roughness. The results showcase an expanded axial dynamic range,\nranging from micrometers to millimeters, while maintaining nanometer-level\naxial resolution. This coherently linked DCM imaging technique enables the\nsimultaneous acquisition of absolute phase information, enhancing its potential\nfor high-axial-resolution imaging in a wide range of applications.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:55:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mizuno","Takahiko",""],["Tsuda","Takuya",""],["Hase","Eiji",""],["Yamamoto","Hirotsugu",""],["Minamikawa","Takeo",""],["Yasui","Takeshi",""]]}
{"id":"2308.03011","submitter":"Takeshi Yasui","authors":"Hidenori Koresawa, Hiroki Kitahama, Eiji Hase, Yu Tokizane, Akifumi\n  Asahara, Takeo Minamikawa, Kaoru Minoshima, and Takeshi Yasui","title":"Jones-matrix dual-comb spectroscopic polarimetry","comments":"24 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectroscopic polarimetry (SP) is a powerful tool for evaluation of thin\nfilm, optical materials, and biological samples because it can provide both\npolarimetric and spectroscopic characteristics of objects. However, its\nperformance is often hampered by the mechanical instability and the limited\ndata acquisition speed arising from the mechanical polarization modulation.\nDual-comb spectroscopic polarimetry (DCSP) based on a combination of SP with\ndual-comb spectroscopy can acquire optical spectra of amplitude ratio and phase\ndifference in p- and s-polarization components of the output light from\nsimultaneous measurement of optical spectra of optical amplitude and phase in\np- and s-polarization components without the need for mechanical polarization\nmodulation. In this article, we combine the DCSP with polarization control\npulse sequences (PCPS) with different polarizations and time delays for a more\ndetailed analysis of the sample's polarization response based on Jones matrix.\nWe obtain Jones matrix of a sample as a function of wavelength by measuring\nthose optical spectra while multiplexing the incident light into multiple\npolarizations instead of a single polarization. Such Jones matrix DCSP\n(JM-DCSP) is applied for analysis of optical elements with known polarization\nproperty and its experimental result is in good agreement with theoretical\nvalues, indicating the validity of the proposed method. JM-DCSP will further\nexpand the application scope of SP.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:58:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Koresawa","Hidenori",""],["Kitahama","Hiroki",""],["Hase","Eiji",""],["Tokizane","Yu",""],["Asahara","Akifumi",""],["Minamikawa","Takeo",""],["Minoshima","Kaoru",""],["Yasui","Takeshi",""]]}
{"id":"2308.03012","submitter":"Jonah Haber","authors":"Jonah B. Haber, Diana Y. Qiu, Felipe H. da Jornada, Jeffrey B. Neaton","title":"Maximally-Localized Exciton Wannier Functions for Solids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a maximally-localized Wannier function representation of Bloch\nexcitons, two-particle correlated electron-hole excitations, in crystalline\nsolids, where the excitons are maximally-localized with respect to an average\nelectron-hole coordinate in real space. As a proof-of-concept, we illustrate\nthis representation in the case of low-energy spin-singlet and triplet excitons\nin LiF, computed using the ab initio Bethe-Salpeter equation approach. We\nvisualize the resulting maximally-localized exciton Wannier functions (MLXWFs)\nin real space, detail the convergence of the exciton Wannier spreads, and\ndemonstrate how Wannier-Fourier interpolation can be leveraged to obtain\nexciton energies and states at arbitrary exciton crystal momenta in the\nBrillouin zone. We further introduce an approach to treat the long-range\ndipolar coupling between singlet MLXWFs and discuss it in depth. The MLXWF\nrepresentation sheds light on the fundamental nature of excitons and paves the\nway towards Wannier-based post-processing of excitonic properties, enabling the\nconstruction of ab initio exciton tight-binding models, efficient interpolation\nof the exciton-phonon vertex, the computation of Berry curvature associated\nwith exciton bands, and beyond.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 03:58:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Haber","Jonah B.",""],["Qiu","Diana Y.",""],["da Jornada","Felipe H.",""],["Neaton","Jeffrey B.",""]]}
{"id":"2308.03013","submitter":"Yan Mary He","authors":"Fabrizio Bianchi and Yan Mary He","title":"A Ma\\~n\\'e-Manning formula for expanding measures for endomorphisms of\n  $\\mathbb P^k$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $k \\ge 1$ be an integer and $f$ a holomorphic endomorphism of $\\mathbb\nP^k (\\mathbb C)$ of algebraic degree $d\\geq 2$. We introduce a volume dimension\nfor ergodic $f$-invariant probability measures with strictly positive Lyapunov\nexponents. In particular, this class of measures includes all ergodic measures\nwhose measure-theoretic entropy is strictly larger than $(k-1)\\log d$, a\nnatural generalization of the class of measures of positive measure-theoretic\nentropy in dimension 1. The volume dimension is equivalent to the Hausdorff\ndimension when $k=1$, but depends on the dynamics of $f$ to incorporate the\npossible failure of Koebe's theorem and the non-conformality of holomorphic\nendomorphisms for $k\\geq 2$.\n  If $\\nu$ is an ergodic $f$-invariant probability measure with strictly\npositive Lyapunov exponents, we prove a generalization of the Ma\\~n\\'e-Manning\nformula relating the volume dimension, the measure-theoretic entropy, and the\nsum of the Lyapunov exponents of $\\nu$. As a consequence, we give a\ncharacterization of the first zero of a natural pressure function for such\nexpanding measures in terms of their volume dimensions. For hyperbolic maps,\nsuch zero also coincides with the volume dimension of the Julia set, and with\nthe exponent of a natural (volume-)conformal measure. This generalizes results\nby Denker-Urba\\'nski and McMullen in dimension 1 to any dimension $k\\geq 1$.\n  Our methods mainly rely on a theorem by Berteloot-Dupont-Molino, which gives\na precise control on the distortion of inverse branches of endomorphisms along\ngeneric inverse orbits with respect to measures with strictly positive Lyapunov\nexponents.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:08:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bianchi","Fabrizio",""],["He","Yan Mary",""]]}
{"id":"2308.03014","submitter":"Jinze Wu","authors":"Jinze Wu, Yufei Xue, Chenkun Qi","title":"Learning Multiple Gaits within Latent Space for Quadruped Robots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning multiple gaits is non-trivial for legged robots, especially when\nencountering different terrains and velocity commands. In this work, we present\nan end-to-end training framework for learning multiple gaits for quadruped\nrobots, tailored to the needs of robust locomotion, agile locomotion, and\nuser's commands. A latent space is constructed concurrently by a gait encoder\nand a gait generator, which helps the agent to reuse multiple gait skills to\nachieve adaptive gait behaviors. To learn natural behaviors for multiple gaits,\nwe design gait-dependent rewards that are constructed explicitly from gait\nparameters and implicitly from conditional adversarial motion priors (CAMP). We\ndemonstrate such multiple gaits control on a quadruped robot Go1 with only\nproprioceptive sensors.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:16:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Jinze",""],["Xue","Yufei",""],["Qi","Chenkun",""]]}
{"id":"2308.03015","submitter":"Muhammad Avicenna Naradipa","authors":"Muhammad Avicenna Naradipa, Prayudi Lianto, Gilbert See, Arvind\n  Sundarrajan, Andrivo Rusydi","title":"Unravelling metallic contaminants in complex polyimide heterostructures\n  using deep ultraviolet spectroscopic ellipsometry","comments":"20 pages, 5 figures, accepted in Applied Physics Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Metallic contaminants in complex heterostructures are important topics due to\ntheir significant roles in determining physical properties as well as device\nperformance. Heterostructures of polyimide via on Al pad and Cu redistribution\nlayer (RDL) on polyimide have shown exotic properties and are important for\nadvanced semiconductor packaging systems. One main problem is significant\nleakage current variations, which affect the performance of the devices, yet\nthe origin is far from understood. Furthermore, metal contaminations would\noccur at the buried interfaces and it is particularly challenging to probe\nthem. Until now, the electronic and optical properties of complex polyimide\nheterostructures and the roles of metallic contaminants, especially in the deep\nultraviolet (DUV) have not been studied extensively. Herewith, using\nspectroscopic ellipsometry (SE) in a broad DUV range supported with\nfinite-difference time-domain (FDTD) calculations, we determine optical\nproperties of contaminants with various concentrations and reveal their\ninfluence on device performance of under-bump vias and redistribution layer\n(RDL) architectures. The complex dielectric function shows varying\ncontamination levels and different metals responsible for chip performance.\nMetallic contaminants are found embedded within 50 nm in the polyimide and\ndifferent metals are distinguishable with varying concentrations, in agreement\nwith contact measurements in highly complex structures. Our result shows the\npotency of spectroscopic ellipsometry in the DUV and paves the way for\nnon-destructive, advanced quality control and metrology applications in\nintegrated advanced electronics packaging systems.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:16:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Naradipa","Muhammad Avicenna",""],["Lianto","Prayudi",""],["See","Gilbert",""],["Sundarrajan","Arvind",""],["Rusydi","Andrivo",""]]}
{"id":"2308.03016","submitter":"Chao-Kai Wen","authors":"Chao-Kai Wen, Lung-Sheng Tsai, Arman Shojaeifard, Pei-Kai Liao,\n  Kai-Kit Wong, and Chan-Byoung Chae","title":"Shaping a Smarter Electromagnetic Landscape: An Overview of IAB, NCR,\n  and RIS in 5G Standardization and Beyond","comments":"8 pages, 5 figures, 1 table. This work has been submitted to the IEEE\n  for possible publication. Copyright may be transferred without notice, after\n  which this version may no longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main objective of 5G and beyond networks is to provide an optimal user\nexperience in terms of throughput and reliability, irrespective of location and\ntime. To achieve this, traditional fixed macro base station deployments are\nbeing replaced by more innovative and flexible solutions, such as wireless\nbackhaul and relays. This article focuses on the evolution and standardization\nof these advancements, which are shaping the electromagnetic (EM) landscape.\nSpecifically, we explore Integrated Access and Backhaul (IAB) nodes, offering a\ncost-efficient and agile alternative to fiber backhaul. We also discuss\nNetwork-Controlled Repeaters (NCRs) and the emergence of Reconfigurable\nIntelligent Surfaces (RIS) actively adapting the wireless environment. The\narticle provides an overview of the 5G features and ongoing developments in\n3GPP Release 18 related to these intelligent EM entities, highlighting the\nexpected evolution of future wireless networks in terms of architecture,\noperations, and control signals.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:21:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wen","Chao-Kai",""],["Tsai","Lung-Sheng",""],["Shojaeifard","Arman",""],["Liao","Pei-Kai",""],["Wong","Kai-Kit",""],["Chae","Chan-Byoung",""]]}
{"id":"2308.03017","submitter":"Mauri Valtonen","authors":"Mauri J. Valtonen, Staszek Zola, Achamveedu Gopakumar, Anne\n  L\\\"ahteenm\\\"aki, Merja Tornikoski, Lankeswar Dey, Alok C. Gupta, Tapio\n  Pursimo, Emil Knudstrup, Jose L. Gomez, Rene Hudec, Martin Jel\\'inek, Jan\n  \\v{S}trobl, Andrei V. Berdyugin, Stefano Ciprini, Daniel E. Reichart,\n  Vladimir V. Kouprianov, Katsura Matsumoto, Marek Drozdz, Markus Mugrauer,\n  Alberto Sadun, Michal Zejmo, Aimo Sillanp\\\"a\\\"a, Harry J. Lehto, Kari\n  Nilsson, Ryo Imazawa, Makoto Uemura and James W. Davidson Jr","title":"On the need of an ultramassive black hole in OJ 287","comments":null,"journal-ref":null,"doi":"10.1093/mnras/stad2249","report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The highly variable blazar OJ~287 is commonly discussed as an example of a\nbinary black hole system. The 130 year long optical light curve is well\nexplained by a model where the central body is a massive black hole of\n18.35$\\times$10$^9$ solar mass that supports a thin accretion disc. The\nsecondary black hole of 0.15$\\times$10$^9$ solar mass impacts the disc twice\nduring its 12 year orbit, and causes observable flares. Recently, it has been\nargued that an accretion disc with a typical AGN accretion rate and above\nmentioned central body mass should be at least six magnitudes brighter than\nOJ~287's host galaxy and would therefore be observationally excluded. Based on\nthe observations of OJ~287's radio jet, detailed in Marscher and Jorstad\n(2011), and up-to-date accretion disc models of Azadi et al. (2022), we show\nthat the V-band magnitude of the accretion disc is unlikely to exceed the host\ngalaxy brightness by more than one magnitude, and could well be fainter than\nthe host. This is because accretion power is necessary to launch the jet as\nwell as to create electromagnetic radiation, distributed across many\nwavelengths, and not concentrated especially on the optical V-band. Further, we\nnote that the claimed V-band concentration of accretion power leads to serious\nproblems while interpreting observations of other Active Galactic Nuclei.\nTherefore, we infer that the mass of the primary black hole and its accretion\nrate do not need to be smaller than what is determined in the standard model\nfor OJ~287.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:22:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Valtonen","Mauri J.",""],["Zola","Staszek",""],["Gopakumar","Achamveedu",""],["L\u00e4hteenm\u00e4ki","Anne",""],["Tornikoski","Merja",""],["Dey","Lankeswar",""],["Gupta","Alok C.",""],["Pursimo","Tapio",""],["Knudstrup","Emil",""],["Gomez","Jose L.",""],["Hudec","Rene",""],["Jel\u00ednek","Martin",""],["\u0160trobl","Jan",""],["Berdyugin","Andrei V.",""],["Ciprini","Stefano",""],["Reichart","Daniel E.",""],["Kouprianov","Vladimir V.",""],["Matsumoto","Katsura",""],["Drozdz","Marek",""],["Mugrauer","Markus",""],["Sadun","Alberto",""],["Zejmo","Michal",""],["Sillanp\u00e4\u00e4","Aimo",""],["Lehto","Harry J.",""],["Nilsson","Kari",""],["Imazawa","Ryo",""],["Uemura","Makoto",""],["Davidson","James W.","Jr"]]}
{"id":"2308.03018","submitter":"Lin Zhu","authors":"Lin Zhu, Yunlong Zheng, Mengyue Geng, Lizhi Wang, Hua Huang","title":"Recurrent Spike-based Image Restoration under General Illumination","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spike camera is a new type of bio-inspired vision sensor that records light\nintensity in the form of a spike array with high temporal resolution (20,000\nHz). This new paradigm of vision sensor offers significant advantages for many\nvision tasks such as high speed image reconstruction. However, existing\nspike-based approaches typically assume that the scenes are with sufficient\nlight intensity, which is usually unavailable in many real-world scenarios such\nas rainy days or dusk scenes. To unlock more spike-based application scenarios,\nwe propose a Recurrent Spike-based Image Restoration (RSIR) network, which is\nthe first work towards restoring clear images from spike arrays under general\nillumination. Specifically, to accurately describe the noise distribution under\ndifferent illuminations, we build a physical-based spike noise model according\nto the sampling process of the spike camera. Based on the noise model, we\ndesign our RSIR network which consists of an adaptive spike transformation\nmodule, a recurrent temporal feature fusion module, and a frequency-based spike\ndenoising module. Our RSIR can process the spike array in a recursive manner to\nensure that the spike temporal information is well utilized. In the training\nprocess, we generate the simulated spike data based on our noise model to train\nour network. Extensive experiments on real-world datasets with different\nilluminations demonstrate the effectiveness of the proposed network. The code\nand dataset are released at https://github.com/BIT-Vision/RSIR.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:24:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhu","Lin",""],["Zheng","Yunlong",""],["Geng","Mengyue",""],["Wang","Lizhi",""],["Huang","Hua",""]]}
{"id":"2308.03019","submitter":"Pratapa Redy Lankireddy","authors":"Naveenkumar Vodnala (VNR Vignana Jyothi Institute of Engineering and\n  Technology), Pratap Reddy Lankireddy (Jawaharlal Nehru Technological\n  University Hyderabad), Padmasai Yarlagadda (VNR Vignana Jyothi Institute of\n  Engineering and Technology)","title":"Characterization of cough sounds using statistical analysis","comments":"19 pages, 8 figures, paper submitted to journal Biomedical Signal\n  Processing and Control which is under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Cough is a primary symptom of most respiratory diseases, and changes in cough\ncharacteristics provide valuable information for diagnosing respiratory\ndiseases. The characterization of cough sounds still lacks concrete evidence,\nwhich makes it difficult to accurately distinguish between different types of\ncoughs and other sounds. The objective of this research work is to characterize\ncough sounds with voiced content and cough sounds without voiced content.\nFurther, the cough sound characteristics are compared with the characteristics\nof speech. The proposed method to achieve this goal utilized spectral roll-off,\nspectral entropy, spectral flatness, spectral flux, zero crossing rate,\nspectral centroid, and spectral bandwidth attributes which describe the cough\nsounds related to the respiratory system, glottal information, and voice model.\nThese attributes are then subjected to statistical analysis using the measures\nof minimum, maximum, mean, median, and standard deviation. The experimental\nresults show that the mean and frequency distribution of spectral roll-off,\nspectral centroid, and spectral bandwidth are found to be higher for cough\nsounds than for speech signals. Spectral flatness levels in cough sounds will\nrise to 0.22, whereas spectral flux varies between 0.3 and 0.6. The Zero\nCrossing Rate (ZCR) of most frames of cough sounds is between 0.05 and 0.4.\nThese attributes contribute significant information while characterizing cough\nsounds.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:26:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vodnala","Naveenkumar","","VNR Vignana Jyothi Institute of Engineering and\n  Technology"],["Lankireddy","Pratap Reddy","","Jawaharlal Nehru Technological\n  University Hyderabad"],["Yarlagadda","Padmasai","","VNR Vignana Jyothi Institute of\n  Engineering and Technology"]]}
{"id":"2308.03020","submitter":"Shu Fay Ung","authors":"Shu Fay Ung, Joonho Lee, David R. Reichman","title":"Competing Generalized Wigner Crystal States in Moir\\'e Heterostructures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comprehensive study of Wigner crystals across a broad range of\nfilling factors for system sizes up to 162 holes employing Hartree-Fock theory\nand explicitly correlated wave function approaches. While we find broad\nagreement with the behavior observed in experiments and classical Monte Carlo\nsimulations, we highlight the fact that the Hartree-Fock energy landscape\nappears to be remarkably complex, with many competing states, both ordered and\ndisordered, separated by energies of a fraction of $\\sim$ 1 meV/hole. We\nexplicitly demonstrate that these states are truly metastable by performing a\nstability analysis at the Hartree-Fock level. Correlated wave function methods\nreveal correlation energies that are very small, but are large enough to tip\nthe balance of state ordering found at the Hartree-Fock level.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:45:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ung","Shu Fay",""],["Lee","Joonho",""],["Reichman","David R.",""]]}
{"id":"2308.03021","submitter":"Cheng Zhang","authors":"Cheng Zhang, Yu Zhu, Qingsen Yan, Jinqiu Sun, Yanning Zhang","title":"All-in-one Multi-degradation Image Restoration Network via Hierarchical\n  Degradation Representation","comments":"ACMMM23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The aim of image restoration is to recover high-quality images from distorted\nones. However, current methods usually focus on a single task (\\emph{e.g.},\ndenoising, deblurring or super-resolution) which cannot address the needs of\nreal-world multi-task processing, especially on mobile devices. Thus,\ndeveloping an all-in-one method that can restore images from various unknown\ndistortions is a significant challenge. Previous works have employed\ncontrastive learning to learn the degradation representation from observed\nimages, but this often leads to representation drift caused by deficient\npositive and negative pairs. To address this issue, we propose a novel\nAll-in-one Multi-degradation Image Restoration Network (AMIRNet) that can\neffectively capture and utilize accurate degradation representation for image\nrestoration. AMIRNet learns a degradation representation for unknown degraded\nimages by progressively constructing a tree structure through clustering,\nwithout any prior knowledge of degradation information. This tree-structured\nrepresentation explicitly reflects the consistency and discrepancy of various\ndistortions, providing a specific clue for image restoration. To further\nenhance the performance of the image restoration network and overcome domain\ngaps caused by unknown distortions, we design a feature transform block (FTB)\nthat aligns domains and refines features with the guidance of the degradation\nrepresentation. We conduct extensive experiments on multiple distorted\ndatasets, demonstrating the effectiveness of our method and its advantages over\nstate-of-the-art restoration methods both qualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 04:51:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Cheng",""],["Zhu","Yu",""],["Yan","Qingsen",""],["Sun","Jinqiu",""],["Zhang","Yanning",""]]}
{"id":"2308.03022","submitter":"Masum Hasan","authors":"Masum Hasan, Cengiz Ozel, Sammy Potter and Ehsan Hoque","title":"SAPIEN: Affective Virtual Agents Powered by Large Language Models","comments":null,"journal-ref":"2023 11th International Conference on Affective Computing and\n  Intelligent Interaction Workshops and Demos (ACIIW)","doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this demo paper, we introduce SAPIEN, a platform for high-fidelity virtual\nagents driven by large language models that can hold open domain conversations\nwith users in 13 different languages, and display emotions through facial\nexpressions and voice. The platform allows users to customize their virtual\nagent's personality, background, and conversation premise, thus providing a\nrich, immersive interaction experience. Furthermore, after the virtual meeting,\nthe user can choose to get the conversation analyzed and receive actionable\nfeedback on their communication skills. This paper illustrates an overview of\nthe platform and discusses the various application domains of this technology,\nranging from entertainment to mental health, communication training, language\nlearning, education, healthcare, and beyond. Additionally, we consider the\nethical implications of such realistic virtual agent representations and the\npotential challenges in ensuring responsible use.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:13:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hasan","Masum",""],["Ozel","Cengiz",""],["Potter","Sammy",""],["Hoque","Ehsan",""]]}
{"id":"2308.03023","submitter":"Haiqi Fang","authors":"Haiqi Fang, Philip L.-F. Liu, Lian Tang, Pengzhi Lin","title":"The theory of fifth-order Stokes waves in a linear shear current","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, a new set of fifth-order Stokes wave solutions, incorporating\nthe effects of a linear shear current, is derived by utilizing the perturbation\nmethod originally proposed for pure waves that was recently published. The\npresent solutions are checked against the existing experimental data, the\nthird-order stream function solutions, as well as the numerical results. The\ncomparisons demonstrate that the present solutions are more accurate in\ndescribing the velocity distributions during wave propagation, especially in\nstrong following currents and positive vorticity conditions. Subsequently, the\npresent solutions are used to investigate the fluid particle trajectories for\ndifferent wave-current interaction conditions. The results indicate that the\nbackground vorticity can alter the patterns of fluid particle trajectories and\nthe direction of Stokes drifts.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:14:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fang","Haiqi",""],["Liu","Philip L. -F.",""],["Tang","Lian",""],["Lin","Pengzhi",""]]}
{"id":"2308.03024","submitter":"Anand Mishra","authors":"Onkar Susladkar, Prajwal Gatti, Anand Mishra","title":"Towards Scene-Text to Scene-Text Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL cs.MM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we study the task of ``visually\" translating scene text from a\nsource language (e.g., English) to a target language (e.g., Chinese). Visual\ntranslation involves not just the recognition and translation of scene text but\nalso the generation of the translated image that preserves visual features of\nthe text, such as font, size, and background. There are several challenges\nassociated with this task, such as interpolating font to unseen characters and\npreserving text size and the background. To address these, we introduce VTNet,\na novel conditional diffusion-based method. To train the VTNet, we create a\nsynthetic cross-lingual dataset of 600K samples of scene text images in six\npopular languages, including English, Hindi, Tamil, Chinese, Bengali, and\nGerman. We evaluate the performance of VTnet through extensive experiments and\ncomparisons to related methods. Our model also surpasses the previous\nstate-of-the-art results on the conventional scene-text editing benchmarks.\nFurther, we present rigorous qualitative studies to understand the strengths\nand shortcomings of our model. Results show that our approach generalizes well\nto unseen words and fonts. We firmly believe our work can benefit real-world\napplications, such as text translation using a phone camera and translating\neducational materials. Code and data will be made publicly available.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:23:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Susladkar","Onkar",""],["Gatti","Prajwal",""],["Mishra","Anand",""]]}
{"id":"2308.03025","submitter":"Yidi Wang","authors":"Man Cheung Tsui and Yidi Wang","title":"Cohomology for Picard-Vessiot theory","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a cohomology theory that classifies differential objects that\narise from Picard-Vessiot theory, using the differential Hopf-Galois descent.\nTo do this, we provide an explicit description of Picard-Vessiot theory in\nterms of differential torsors. We then use this cohomology to give a bijective\ncorrespondence between differential objects and differential torsors. As an\napplication, we prove a universal bound for the differential splitting degree\nof differential central simple algebras.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:49:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tsui","Man Cheung",""],["Wang","Yidi",""]]}
{"id":"2308.03026","submitter":"JinYuan Liu","authors":"Jinyuan Liu, Minglei Fu, Wenan Zhang, Bo Chen, Ryhor Prakapovich, and\n  Uladzislau Sychou","title":"CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in\n  2D Continuous Space","comments":"Accepted to The 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS). Additional Info: 8 pages, 3 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Dijkstra algorithm is a classic path planning method, which in a discrete\ngraph space, can start from a specified source node and find the shortest path\nbetween the source node and all other nodes in the graph. However, to the best\nof our knowledge, there is no effective method that achieves a function similar\nto that of the Dijkstra's algorithm in a continuous space. In this study, an\noptimal path planning algorithm called convex dissection topology\n(CDT)-Dijkstra is developed, which can quickly compute the global optimal path\nfrom one point to all other points in a 2D continuous space. CDT-Dijkstra is\nmainly divided into two stages: SetInit and GetGoal. In SetInit, the algorithm\ncan quickly obtain the optimal CDT encoding set of all the cut lines based on\nthe initial point x_{init}. In GetGoal, the algorithm can return the global\noptimal path of any goal point at an extremely high speed. In this study, we\npropose and prove the planning principle of considering only the points on the\ncutlines, thus reducing the state space of the distance optimal path planning\ntask from 2D to 1D. In addition, we propose a fast method to find the optimal\npath in a homogeneous class and theoretically prove the correctness of the\nmethod. Finally, by testing in a series of environments, the experimental\nresults demonstrate that CDT-Dijkstra not only plans the optimal path from all\npoints at once, but also has a significant advantage over advanced algorithms\nconsidering certain complex tasks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:56:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Jinyuan",""],["Fu","Minglei",""],["Zhang","Wenan",""],["Chen","Bo",""],["Prakapovich","Ryhor",""],["Sychou","Uladzislau",""]]}
{"id":"2308.03027","submitter":"Rihao Chang","authors":"Rihao Chang, Yongtao Ma, Weizhi Nie, Jie Nie, An-an Liu","title":"Causal Disentanglement Hidden Markov Model for Fault Diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In modern industries, fault diagnosis has been widely applied with the goal\nof realizing predictive maintenance. The key issue for the fault diagnosis\nsystem is to extract representative characteristics of the fault signal and\nthen accurately predict the fault type. In this paper, we propose a Causal\nDisentanglement Hidden Markov model (CDHM) to learn the causality in the\nbearing fault mechanism and thus, capture their characteristics to achieve a\nmore robust representation. Specifically, we make full use of the time-series\ndata and progressively disentangle the vibration signal into fault-relevant and\nfault-irrelevant factors. The ELBO is reformulated to optimize the learning of\nthe causal disentanglement Markov model. Moreover, to expand the scope of the\napplication, we adopt unsupervised domain adaptation to transfer the learned\ndisentangled representations to other working environments. Experiments were\nconducted on the CWRU dataset and IMS dataset. Relevant results validate the\nsuperiority of the proposed method.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:58:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chang","Rihao",""],["Ma","Yongtao",""],["Nie","Weizhi",""],["Nie","Jie",""],["Liu","An-an",""]]}
{"id":"2308.03028","submitter":"Lei Song","authors":"Lei Song, Chuheng Zhang, Li Zhao, Jiang Bian","title":"Pre-Trained Large Language Models for Industrial Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For industrial control, developing high-performance controllers with few\nsamples and low technical debt is appealing. Foundation models, possessing rich\nprior knowledge obtained from pre-training with Internet-scale corpus, have the\npotential to be a good controller with proper prompts. In this paper, we take\nHVAC (Heating, Ventilation, and Air Conditioning) building control as an\nexample to examine the ability of GPT-4 (one of the first-tier foundation\nmodels) as the controller. To control HVAC, we wrap the task as a language game\nby providing text including a short description for the task, several selected\ndemonstrations, and the current observation to GPT-4 on each step and execute\nthe actions responded by GPT-4. We conduct series of experiments to answer the\nfollowing questions: 1)~How well can GPT-4 control HVAC? 2)~How well can GPT-4\ngeneralize to different scenarios for HVAC control? 3) How different parts of\nthe text context affect the performance? In general, we found GPT-4 achieves\nthe performance comparable to RL methods with few samples and low technical\ndebt, indicating the potential of directly applying foundation models to\nindustrial control tasks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:01:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Song","Lei",""],["Zhang","Chuheng",""],["Zhao","Li",""],["Bian","Jiang",""]]}
{"id":"2308.03029","submitter":"Chenxi Wang","authors":"Chenxi Wang, Zhi Jin","title":"Brighten-and-Colorize: A Decoupled Network for Customized Low-Light\n  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":"  Low-Light Image Enhancement (LLIE) aims to improve the perceptual quality of\nan image captured in low-light conditions. Generally, a low-light image can be\ndivided into lightness and chrominance components. Recent advances in this area\nmainly focus on the refinement of the lightness, while ignoring the role of\nchrominance. It easily leads to chromatic aberration and, to some extent,\nlimits the diverse applications of chrominance in customized LLIE. In this\nwork, a ``brighten-and-colorize'' network (called BCNet), which introduces\nimage colorization to LLIE, is proposed to address the above issues. BCNet can\naccomplish LLIE with accurate color and simultaneously enables customized\nenhancement with varying saturations and color styles based on user\npreferences. Specifically, BCNet regards LLIE as a multi-task learning problem:\nbrightening and colorization. The brightening sub-task aligns with other\nconventional LLIE methods to get a well-lit lightness. The colorization\nsub-task is accomplished by regarding the chrominance of the low-light image as\ncolor guidance like the user-guide image colorization. Upon completion of model\ntraining, the color guidance (i.e., input low-light chrominance) can be simply\nmanipulated by users to acquire customized results. This customized process is\noptional and, due to its decoupled nature, does not compromise the structural\nand detailed information of lightness. Extensive experiments on the commonly\nused LLIE datasets show that the proposed method achieves both State-Of-The-Art\n(SOTA) performance and user-friendly customization.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:04:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Chenxi",""],["Jin","Zhi",""]]}
{"id":"2308.03030","submitter":"Hong-Yi Su","authors":"Hong-Yi Su","title":"Monte Carlo approach to the evaluation of the security of\n  device-independent quantum key distribution","comments":"10 pages, 10 figures, 3 tables; minor changes, close to the submitted\n  manuscript","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a generic study on the information-theoretic security of\nmulti-setting device-independent quantum key distribution protocols, i.e., ones\nthat involve more than two measurements (or inputs) for each party to perform,\nand yield dichotomic results (or outputs). The approach we develop, when\napplied in protocols with either symmetric or asymmetric Bell experiments,\nyields nontrivial estimates of the secure key rates, along with those of the\nminimum detection efficiencies of the measuring devices. The results imply that\nincreasing the number of measurements may lower the minimum efficiency required\nby the security criterion. The improvement, however, depends on (i) the choice\nof multi-setting Bell inequalities chosen to be tested in a protocol, and (ii)\neither a symmetric or asymmetric Bell experiment is considered. Our results\nserve as an advance toward the quest for evaluating security and reducing\nefficiency requirement of applying device-independent quantum key distribution\nin scenarios without heralding.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:07:06 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 12:15:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Su","Hong-Yi",""]]}
{"id":"2308.03031","submitter":"Tsvi Piran","authors":"Tsvi Piran and Dmitry D. Ofengeim","title":"Lorentz Invariance Violation Limits from GRB 221009A","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has been long conjectured that a signature of Quantum Gravity will be\nLorentz Invariance Violation (LIV) that could be observed at energies much\nlower than the Planck scale. One possible signature of LIV is an\nenergy-dependent speed of photons. This can be tested with a distant transient\nsource of very high-energy photons. We explore time-of-flight limits on LIV\nderived from LHAASO's observations of tens of thousands of TeV photons from GRB\n221009A, the brightest gamma-ray burst of all time. For a linear (n=1)\ndependence of the photon velocity on energy, we find a lower limit on the LIV\nscale of 5.9 (6.2) E_pl for subluminal (superluminal) modes. These are\ncomparable to the stringent limits obtained so far. For a quadratic model\n(n=2), the limits, which are currently the best available, are much lower, 5.8\n(4.6) x 10^{-8} E_pl. Our analysis uses the publicly available LHAASO data\nwhich is only in the 0.2-7 TeV range. Higher energy data would enable us to\nimprove these limits by a factor of 3 for $n=1$ and by an order of magnitude\nfor $n=2$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:07:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Piran","Tsvi",""],["Ofengeim","Dmitry D.",""]]}
{"id":"2308.03032","submitter":"Peizheng Wang","authors":"Xilong Fan, Peizheng Wang, Jin Li and Nan Yang","title":"Understanding the predication mechanism of deep learning through error\n  propagation among parameters in strong lensing case","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 error propagation among estimated parameters reflects the correlation\namong the parameters. We study the capability of machine learning of \"learning\"\nthe correlation of estimated parameters. We show that machine learning can\nrecover the relation between the uncertainties of different parameters,\nespecially, as predicted by the error propagation formula. Gravitational\nlensing can be used to probe both astrophysics and cosmology. As a practical\napplication, we show that the machine learning is able to intelligently find\nthe error propagation among the gravitational lens parameters (effective lens\nmass $M_{L}$ and Einstein radius $\\theta_{E}$) in accordance with the\ntheoretical formula for the singular isothermal ellipse (SIE) lens model. The\nrelation of errors of lens mass and Einstein radius, (e.g. the ratio of\nstandard deviations $\\mathcal{F}=\\sigma_{\\hat{ M_{L}}}/\n\\sigma_{\\hat{\\theta_{E}}}$) predicted by the deep convolution neural network\nare consistent with the error propagation formula of SIE lens model. As a\nproof-of-principle test, a toy model of linear relation with Gaussian noise is\npresented. We found that the predictions obtained by machine learning indeed\nindicate the information about the law of error propagation and the\ndistribution of noise. Error propagation plays a crucial role in identifying\nthe physical relation among parameters, rather than a coincidence relation,\ntherefore we anticipate our case study on the error propagation of machine\nlearning predictions could extend to other physical systems on searching the\ncorrelation among parameters.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:11:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fan","Xilong",""],["Wang","Peizheng",""],["Li","Jin",""],["Yang","Nan",""]]}
{"id":"2308.03033","submitter":"Chenxi Wang","authors":"Chenxi Wang, Hongjun Wu, Zhi Jin","title":"FourLLIE: Boosting Low-Light Image Enhancement by Fourier Frequency\n  Information","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":"  Recently, Fourier frequency information has attracted much attention in\nLow-Light Image Enhancement (LLIE). Some researchers noticed that, in the\nFourier space, the lightness degradation mainly exists in the amplitude\ncomponent and the rest exists in the phase component. By incorporating both the\nFourier frequency and the spatial information, these researchers proposed\nremarkable solutions for LLIE. In this work, we further explore the positive\ncorrelation between the magnitude of amplitude and the magnitude of lightness,\nwhich can be effectively leveraged to improve the lightness of low-light images\nin the Fourier space. Moreover, we find that the Fourier transform can extract\nthe global information of the image, and does not introduce massive neural\nnetwork parameters like Multi-Layer Perceptrons (MLPs) or Transformer. To this\nend, a two-stage Fourier-based LLIE network (FourLLIE) is proposed. In the\nfirst stage, we improve the lightness of low-light images by estimating the\namplitude transform map in the Fourier space. In the second stage, we introduce\nthe Signal-to-Noise-Ratio (SNR) map to provide the prior for integrating the\nglobal Fourier frequency and the local spatial information, which recovers\nimage details in the spatial space. With this ingenious design, FourLLIE\noutperforms the existing state-of-the-art (SOTA) LLIE methods on four\nrepresentative datasets while maintaining good model efficiency.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:14:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Chenxi",""],["Wu","Hongjun",""],["Jin","Zhi",""]]}
{"id":"2308.03034","submitter":"Seyed Ali Hosseini","authors":"Seyed Ali Hosseini and Ilya Karlin","title":"Asymptotic freedom in the lattice Boltzmann theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Asymptotic freedom is a feature of quantum chromodynamics that guarantees its\nwell-posedeness. We derive an analog of asymptotic freedom enabling\nunconditional stability of lattice Boltzmann simulation of hydrodynamics. For\nthe lattice Boltzmann models of nearly-incompressible flow, we show that the\nequilibrium based on entropy maximization is uniquely renormalizable. This\nresults in a practical algorithm of constructing unconditionally stable lattice\nBoltzmann models.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:43:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hosseini","Seyed Ali",""],["Karlin","Ilya",""]]}
{"id":"2308.03035","submitter":"Xidong Wu","authors":"Xidong Wu, Zhengmian Hu, Jian Pei, Heng Huang","title":"Serverless Federated AUPRC Optimization for Multi-Party Collaborative\n  Imbalanced Data Mining","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":"  Multi-party collaborative training, such as distributed learning and\nfederated learning, is used to address the big data challenges. However,\ntraditional multi-party collaborative training algorithms were mainly designed\nfor balanced data mining tasks and are intended to optimize accuracy\n(\\emph{e.g.}, cross-entropy). The data distribution in many real-world\napplications is skewed and classifiers, which are trained to improve accuracy,\nperform poorly when applied to imbalanced data tasks since models could be\nsignificantly biased toward the primary class. Therefore, the Area Under\nPrecision-Recall Curve (AUPRC) was introduced as an effective metric. Although\nsingle-machine AUPRC maximization methods have been designed, multi-party\ncollaborative algorithm has never been studied. The change from the\nsingle-machine to the multi-party setting poses critical challenges.\n  To address the above challenge, we study the serverless multi-party\ncollaborative AUPRC maximization problem since serverless multi-party\ncollaborative training can cut down the communications cost by avoiding the\nserver node bottleneck, and reformulate it as a conditional stochastic\noptimization problem in a serverless multi-party collaborative learning setting\nand propose a new ServerLess biAsed sTochastic gradiEnt (SLATE) algorithm to\ndirectly optimize the AUPRC. After that, we use the variance reduction\ntechnique and propose ServerLess biAsed sTochastic gradiEnt with Momentum-based\nvariance reduction (SLATE-M) algorithm to improve the convergence rate, which\nmatches the best theoretical convergence result reached by the single-machine\nonline method. To the best of our knowledge, this is the first work to solve\nthe multi-party collaborative AUPRC maximization problem.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:51:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Xidong",""],["Hu","Zhengmian",""],["Pei","Jian",""],["Huang","Heng",""]]}
{"id":"2308.03036","submitter":"Zhetao Jia","authors":"Zhetao Jia, Wayesh Qarony, Jagang Park, Sean Hooten, Difan Wen, Yertay\n  Zhiyenbayev, Matteo Secl\\`i, Walid Redjem, Scott Dhuey, Adam Schwartzberg,\n  Eli Yablonovitch, and Boubacar Kant\\'e","title":"Interpretable inverse-designed cavity for on-chip nonlinear and quantum\n  optics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inverse design is a powerful tool in wave-physics and in particular in\nphotonics for compact, high-performance devices. To date, applications have\nmostly been limited to linear systems and it has rarely been investigated or\ndemonstrated in the nonlinear regime. In addition, the \"black box\" nature of\ninverse design techniques has hindered the understanding of optimized\ninverse-designed structures. We propose an inverse design method with\ninterpretable results to enhance the efficiency of on-chip photon generation\nrate through nonlinear processes by controlling the effective phase-matching\nconditions. We fabricate and characterize a compact, inverse-designed device\nusing a silicon-on-insulator platform that allows a spontaneous four-wave\nmixing process to generate photon pairs at 1.1MHz with a coincidence to\naccidental ratio of 162. Our design method accounts for fabrication constraints\nand can be used for scalable quantum light sources in large-scale communication\nand computing applications.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:52:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jia","Zhetao",""],["Qarony","Wayesh",""],["Park","Jagang",""],["Hooten","Sean",""],["Wen","Difan",""],["Zhiyenbayev","Yertay",""],["Secl\u00ec","Matteo",""],["Redjem","Walid",""],["Dhuey","Scott",""],["Schwartzberg","Adam",""],["Yablonovitch","Eli",""],["Kant\u00e9","Boubacar",""]]}
{"id":"2308.03037","submitter":"Liu Mutong","authors":"Mutong Liu, Yang Liu, Jiming Liu","title":"Machine Learning for Infectious Disease Risk Prediction: A Survey","comments":"45 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Infectious diseases, either emerging or long-lasting, place numerous people\nat risk and bring heavy public health burdens worldwide. In the process against\ninfectious diseases, predicting the epidemic risk by modeling the disease\ntransmission plays an essential role in assisting with preventing and\ncontrolling disease transmission in a more effective way. In this paper, we\nsystematically describe how machine learning can play an essential role in\nquantitatively characterizing disease transmission patterns and accurately\npredicting infectious disease risks. First, we introduce the background and\nmotivation of using machine learning for infectious disease risk prediction.\nNext, we describe the development and components of various machine learning\nmodels for infectious disease risk prediction. Specifically, existing models\nfall into three categories: Statistical prediction, data-driven machine\nlearning, and epidemiology-inspired machine learning. Subsequently, we discuss\nchallenges encountered when dealing with model inputs, designing task-oriented\nobjectives, and conducting performance evaluation. Finally, we conclude with a\ndiscussion of open questions and future directions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:57:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Mutong",""],["Liu","Yang",""],["Liu","Jiming",""]]}
{"id":"2308.03038","submitter":"Juan Ignacio Climente","authors":"Jose L. Movilla, Josep Planelles, Juan I. Climente","title":"Excitons in layered metal halide perovskites: an effective mass\n  description of polaronic, dielectric and quantum confinement effects","comments":"10 pages, 3 figures, submitted; computational code available upon\n  request","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A theoretical model for excitons confined in layered metal halide perovskites\nis presented. The model accounts for polaronic effects, dielectric and quantum\nconfinement by means of effective mass theory, image charges and Haken\npotentials. We use it to describe the band edge exciton of MAPbI$_3$ structures\nsurrounded by organic ligands. It is shown that the quasi-2D quantum and\ndielectric confinement of layered perovskites squeezes the exciton radius, and\nthis in turn enhances polaronic effects as compared to 3D structures. The\nstrong polaronic effects boost the binding energies and radiative recombination\nprobabilities, which allows one to match experimental data in related systems.\nThe thickness dependence of Coulomb polarization and self-energy potentials is\nin fair agreement with sophisticated atomistic models.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 07:24:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Movilla","Jose L.",""],["Planelles","Josep",""],["Climente","Juan I.",""]]}
{"id":"2308.03039","submitter":"HUnduma Legesse Geleta","authors":"Tewlede G/Egziabher, Hunduma Legesse Geleta, Abdul Hassen","title":"Automorphic Integrals with Rational Period Functions and Arithmetical\n  Identities","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1961, Chandrasekharan and Narasimhan showed that for a large class of\nDirichlet series the functional equation and two types of arithmetical\nidentities are equivalent. In 1992, Hawkins and Knopp proved a Hecke\ncorrespondence theorem for modular integrals with rational period function on\ntheta group. Analogous to Chandrasekharan and Narasimhan, in 2015 Sister Ann M.\nHeath has shown that the functional equation in Hawkins and Knopp context and\ntwo type of arithmetical identities are equivalent. She considered the\nfunctional equation and showed its equivalence to two arithmetical identities\nassociated with entire modular cusp integrals involving rational period\nfunctions for the full modular group. In this paper we extend the results of\nSister Ann M. Heath to entire automorphic integrals involving rational period\nfunctions on discrete Hecke group.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 07:24:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["G/Egziabher","Tewlede",""],["Geleta","Hunduma Legesse",""],["Hassen","Abdul",""]]}
{"id":"2308.03040","submitter":"Rui Li","authors":"Rui Li, Shenglong Zhou, Dong Liu","title":"Learning Fine-Grained Features for Pixel-wise Video Correspondences","comments":"Accepted to ICCV 2023. Code and models are available at\n  https://github.com/qianduoduolr/FGVC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video analysis tasks rely heavily on identifying the pixels from different\nframes that correspond to the same visual target. To tackle this problem,\nrecent studies have advocated feature learning methods that aim to learn\ndistinctive representations to match the pixels, especially in a\nself-supervised fashion. Unfortunately, these methods have difficulties for\ntiny or even single-pixel visual targets. Pixel-wise video correspondences were\ntraditionally related to optical flows, which however lead to deterministic\ncorrespondences and lack robustness on real-world videos. We address the\nproblem of learning features for establishing pixel-wise correspondences.\nMotivated by optical flows as well as the self-supervised feature learning, we\npropose to use not only labeled synthetic videos but also unlabeled real-world\nvideos for learning fine-grained representations in a holistic framework. We\nadopt an adversarial learning scheme to enhance the generalization ability of\nthe learned features. Moreover, we design a coarse-to-fine framework to pursue\nhigh computational efficiency. Our experimental results on a series of\ncorrespondence-based tasks demonstrate that the proposed method outperforms\nstate-of-the-art rivals in both accuracy and efficiency.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 07:27:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Rui",""],["Zhou","Shenglong",""],["Liu","Dong",""]]}
{"id":"2308.03041","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Observation of $W\\gamma\\gamma$ triboson production in proton-proton\n  collisions at $\\sqrt{s} = 13$ TeV with the ATLAS detector","comments":"36 pages in total, author list starting page 19, 3 figures, 2 tables,\n  submitted to PLB. All figures including auxiliary figures are available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/STDM-2018-33/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-037","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This letter reports the observation of $W(\\ell\\nu)\\gamma\\gamma$ production in\nproton-proton collisions. This measurement uses the full Run 2 sample of events\nrecorded at a center of mass energy of $\\sqrt{s} = 13$ TeV by the ATLAS\ndetector at the LHC, corresponding to an integrated luminosity of 140\nfb$^{-1}$. Events with a leptonically-decaying $W$ boson and at least two\nphotons are considered. The background-only hypothesis is rejected with an\nobserved and expected significance of $5.6$ standard deviations, corresponding\nto the observation of this process. The inclusive fiducial production cross\nsection of $W(e\\nu)\\gamma\\gamma$ and $W(\\mu\\nu)\\gamma\\gamma$ events is measured\nto be $\\sigma_{\\mathrm{fid}} = 12.2 \\pm 1.0 (\\mathrm{stat}) \\substack{+1.9 \\\\\n-1.8} (\\mathrm{syst}) \\pm 0.1 (\\mathrm{lumi})$ fb, in agreement with the\nStandard Model prediction.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 07:47:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.03042","submitter":"Fardad Vakilipoor","authors":"Fardad Vakilipoor, Luca Barletta, Stefano Bregni, and Maurizio\n  Magarini","title":"Achievable Information Rate Analysis in Diffusive Channels with Memory\n  and Markov Source","comments":"13 pages, 12 figure. arXiv admin note: text overlap with\n  arXiv:2306.04261","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores the Achievable Information Rate (AIR) of a diffusive\nMolecular Communication (MC) channel featuring a fully absorbing receiver that\ncounts the absorbed particles during symbol time intervals (STIs) and resets\nthe counter at the start of each interval. The MC channel, influenced by memory\neffect, experiences inter-symbol interference (ISI) arising from the molecules'\ndelayed arrival. The channel's memory is quantified as an integer multiple of\nthe STI and a single-sample memoryless detector is employed to mitigate\ncomplexity in computing the mutual information (MI). To maximize MI, the\ndetector threshold is optimized under Gaussian approximation of its input. The\nchannel's MI is calculated, considering the influence of ISI, in the context of\nbinary concentration shift keying modulation. Two distinct scenarios were\nconsidered; independent and correlated source-generated symbols, the latter\nmodeled as a first-order Markov process. For each communication scenario, two\ndegrees of knowledge: ISI-Aware and ISI-Unaware were considered. Remarkably, it\nis demonstrated that employing a correlated source enables the attainment of\nhigher capacity. The results indicate that the capacity-achieving input\ndistribution is not necessarily uniform. Notably, when the STI is small,\ncorresponding to the case of strong ISI, the maximum AIR is not achieved\nthrough equiprobable symbol transmission.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 07:52:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vakilipoor","Fardad",""],["Barletta","Luca",""],["Bregni","Stefano",""],["Magarini","Maurizio",""]]}
{"id":"2308.03043","submitter":"Fatemah Almeman","authors":"Fatemah Almeman, Hadi Sheikhi, Luis Espinosa-Anke","title":"3D-EX : A Unified Dataset of Definitions and Dictionary Examples","comments":"11 pages (including references pages), 9 tables, and 1 figure. This\n  paper is submitted to RANLP2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Definitions are a fundamental building block in lexicography, linguistics and\ncomputational semantics. In NLP, they have been used for retrofitting word\nembeddings or augmenting contextual representations in language models.\nHowever, lexical resources containing definitions exhibit a wide range of\nproperties, which has implications in the behaviour of models trained and\nevaluated on them. In this paper, we introduce 3D- EX , a dataset that aims to\nfill this gap by combining well-known English resources into one centralized\nknowledge repository in the form of <term, definition, example> triples. 3D- EX\nis a unified evaluation framework with carefully pre-computed\ntrain/validation/test splits to prevent memorization. We report experimental\nresults that suggest that this dataset could be effectively leveraged in\ndownstream NLP tasks. Code and data are available at\nhttps://github.com/F-Almeman/3D-EX .\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 07:59:12 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 12:07:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Almeman","Fatemah",""],["Sheikhi","Hadi",""],["Espinosa-Anke","Luis",""]]}
{"id":"2308.03044","submitter":"Jingmin Zhu","authors":"Jing-Min Zhu","title":"Multipartite Bipartite Quantum Correlation and Its Three Types of\n  Measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multipartite Quantum Correlation(MQC) not only explains many novel\nmicroscopic and macroscopic quantum phenomena; but also concerns specific\npotential quantum technologies with superiorities. The MQC organization and\nstructure are extremely rich and complex, hence their descriptions and measures\nhave always been an open topic. We fundamentally reconsider MQC descriptions\nand their practical applications in quantum technologies, propose multipartite\nbipartite QC with intuitive and clear physical image, and specifically give\nthree types of measures: one class based on minimal entropy-like difference of\nlocal measurement fore-and-aft multipartite bipartite density matrix such as\nmultipartite bipartite quantum discord(QD),the other based on minimal\ntrace-like geometric distance such as multipartite bipartite Hilbert-Schmidt\ndistance(HSD), and another based on decoherence such as Multipartite Bipartite\nLocal Measurement-Induced Minimal Decoherence(LMIMD) and Local\nEigen-Measurement-Induced Decoherence(LEMID). Their computations are simple,\nand these facts show that the realization of their specific potential\napplications with superiorities would be easy. Then we usethree types of\nmeasures to explore the organization and structure of some typical well-known\ngenuine MQCs, and analyze their advantages and disadvantages from their\nphysical connotation and mathematical structure.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:05:03 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 00:50:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhu","Jing-Min",""]]}
{"id":"2308.03045","submitter":"Aleksandra Avdeeva","authors":"Aleksandra Avdeeva","title":"Machine learning methods for the search for L&T brown dwarfs in the data\n  of modern sky surveys","comments":"12 pages, 10 figures, Accepted for publication in Astronomy and\n  Computing","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  According to various estimates, brown dwarfs (BD) should account for up to 25\npercent of all objects in the Galaxy. However, few of them are discovered and\nwell-studied, both individually and as a population. Homogeneous and complete\nsamples of brown dwarfs are needed for these kinds of studies. Due to their\nweakness, spectral studies of brown dwarfs are rather laborious. For this\nreason, creating a significant reliable sample of brown dwarfs, confirmed by\nspectroscopic observations, seems unattainable at the moment. Numerous attempts\nhave been made to search for and create a set of brown dwarfs using their\ncolours as a decision rule applied to a vast amount of survey data. In this\nwork, we use machine learning methods such as Random Forest Classifier,\nXGBoost, SVM Classifier and TabNet on PanStarrs DR1, 2MASS and WISE data to\ndistinguish L and T brown dwarfs from objects of other spectral and luminosity\nclasses. The explanation of the models is discussed. We also compare our models\nwith classical decision rules, proving their efficiency and relevance.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:14:35 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 08:22:07 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 07:10:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Avdeeva","Aleksandra",""]]}
{"id":"2308.03046","submitter":"Jitender Singh","authors":"Sanjeev Kumar and Jitender Singh","title":"On a factorization result of \\c{S}tef\\u{a}nescu -- II","comments":"pp5","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT cs.NA math.AC math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  \\c{S}tef\\u{a}nescu proved an elegant factorization result for polynomials\nover discrete valuation domains [CASC'2014, Lecture Notes in Computer Science,\nEd. by V. Gerdt, W. Koepf, W. Mayr, and E. Vorozhtsov, Springer, Berlin, {Vol.\n\\textbf{8660}}, pp. 460--471, 2014.] In this paper, a generalization of\n\\c{S}tef\\u{a}nescu's result is proved to cover a larger class of polynomials\nover discrete valuation domains. Such results are useful in devising algorithms\nfor polynomial factorization.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:14:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kumar","Sanjeev",""],["Singh","Jitender",""]]}
{"id":"2308.03047","submitter":"Long Tian","authors":"Long Tian, Jingyi Feng, Wenchao Chen, Xiaoqiang Chai, Liming Wang,\n  Xiyang Liu, Bo Chen","title":"Prototypes-oriented Transductive Few-shot Learning with Conditional\n  Transport","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":"  Transductive Few-Shot Learning (TFSL) has recently attracted increasing\nattention since it typically outperforms its inductive peer by leveraging\nstatistics of query samples. However, previous TFSL methods usually encode\nuniform prior that all the classes within query samples are equally likely,\nwhich is biased in imbalanced TFSL and causes severe performance degradation.\n  Given this pivotal issue, in this work, we propose a novel Conditional\nTransport (CT) based imbalanced TFSL model called {\\textbf P}rototypes-oriented\n{\\textbf U}nbiased {\\textbf T}ransfer {\\textbf M}odel (PUTM) to fully exploit\nunbiased statistics of imbalanced query samples, which employs forward and\nbackward navigators as transport matrices to balance the prior of query samples\nper class between uniform and adaptive data-driven distributions. For\nefficiently transferring statistics learned by CT, we further derive a closed\nform solution to refine prototypes based on MAP given the learned navigators.\nThe above two steps of discovering and transferring unbiased statistics follow\nan iterative manner, formulating our EM-based solver.\n  Experimental results on four standard benchmarks including miniImageNet,\ntieredImageNet, CUB, and CIFAR-FS demonstrate superiority of our model in\nclass-imbalanced generalization.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:17:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tian","Long",""],["Feng","Jingyi",""],["Chen","Wenchao",""],["Chai","Xiaoqiang",""],["Wang","Liming",""],["Liu","Xiyang",""],["Chen","Bo",""]]}
{"id":"2308.03048","submitter":"Miao Wei","authors":"Wei Miao, Hong Zhao, Tongjia Chen, Wei Huang, Changyan Xiao","title":"Multi-scale Alternated Attention Transformer for Generalized Stereo\n  Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent stereo matching networks achieves dramatic performance by introducing\nepipolar line constraint to limit the matching range of dual-view. However, in\ncomplicated real-world scenarios, the feature information based on\nintra-epipolar line alone is too weak to facilitate stereo matching. In this\npaper, we present a simple but highly effective network called Alternated\nAttention U-shaped Transformer (AAUformer) to balance the impact of epipolar\nline in dual and single view respectively for excellent generalization\nperformance. Compared to other models, our model has several main designs: 1)\nto better liberate the local semantic features of the single-view at pixel\nlevel, we introduce window self-attention to break the limits of intra-row\nself-attention and completely replace the convolutional network for denser\nfeatures before cross-matching; 2) the multi-scale alternated attention\nbackbone network was designed to extract invariant features in order to\nachieves the coarse-to-fine matching process for hard-to-discriminate regions.\nWe performed a series of both comparative studies and ablation studies on\nseveral mainstream stereo matching datasets. The results demonstrate that our\nmodel achieves state-of-the-art on the Scene Flow dataset, and the fine-tuning\nperformance is competitive on the KITTI 2015 dataset. In addition, for cross\ngeneralization experiments on synthetic and real-world datasets, our model\noutperforms several state-of-the-art works.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:22:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Miao","Wei",""],["Zhao","Hong",""],["Chen","Tongjia",""],["Huang","Wei",""],["Xiao","Changyan",""]]}
{"id":"2308.03049","submitter":"Alon Agin","authors":"Alon Agin","title":"Constructing Displacement Vectors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\overrightarrow{v}\\in\\mathbb{R}^2\\setminus\\mathbb{Q}^2$, let\n$\\lVert\\cdot\\lVert$ be an arbitrary norm on $\\mathbb{R}^2$, and let\n$(q_n,\\overrightarrow{p_n})_{n=0}^{\\infty}\n\\subset\\mathbb{N}\\times\\mathbb{Z}^{2}$ be the best approximation vectors\nsequence of $\\overrightarrow{v}$ with respect to $\\lVert\\cdot\\lVert$. We define\nthe nth long displacement vector of $\\overrightarrow{v}$ to be\n$\\overrightarrow{\\beta_n}:=\\sqrt{q_{n+1}}(q_{n}\\overrightarrow{v}-\\overrightarrow{p_n})$\nand prove the existence of long displacement vectors who have non-typical\nproperties, focusing on their length, direction, and congruence class.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:28:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Agin","Alon",""]]}
{"id":"2308.03050","submitter":"Giorgos Kapetanakis","authors":"Giorgos Kapetanakis and Ioannis Rizos","title":"An inductive proof of the Frobenius coin problem of two denominators","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $a,b$ be positive, relatively prime, integers. We prove, using induction,\nthat for every $d > ab-a-b$ there exist $x,y\\in\\mathbb{Z}_{\\geq 0}$, such that\n$d=ax+by$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:28:07 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 05:47:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kapetanakis","Giorgos",""],["Rizos","Ioannis",""]]}
{"id":"2308.03051","submitter":"Md Tawkat Islam Khondaker","authors":"Karima Kadaoui, Samar M. Magdy, Abdul Waheed, Md Tawkat Islam\n  Khondaker, Ahmed Oumar El-Shangiti, El Moatez Billah Nagoudi, Muhammad\n  Abdul-Mageed","title":"TARJAMAT: Evaluation of Bard and ChatGPT on Machine Translation of Ten\n  Arabic Varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) finetuned to follow human instructions have\nrecently emerged as a breakthrough in AI. Models such as Google Bard and OpenAI\nChatGPT, for example, are surprisingly powerful tools for question answering,\ncode debugging, and dialogue generation. Despite the purported multilingual\nproficiency of these models, their linguistic inclusivity remains\ninsufficiently explored. Considering this constraint, we present a thorough\nassessment of Bard and ChatGPT (encompassing both GPT-3.5 and GPT-4) regarding\ntheir machine translation proficiencies across ten varieties of Arabic. Our\nevaluation covers diverse Arabic varieties such as Classical Arabic, Modern\nStandard Arabic, and several nuanced dialectal variants. Furthermore, we\nundertake a human-centric study to scrutinize the efficacy of the most recent\nmodel, Bard, in following human instructions during translation tasks. Our\nexhaustive analysis indicates that LLMs may encounter challenges with certain\nArabic dialects, particularly those for which minimal public data exists, such\nas Algerian and Mauritanian dialects. However, they exhibit satisfactory\nperformance with more prevalent dialects, albeit occasionally trailing behind\nestablished commercial systems like Google Translate. Additionally, our\nanalysis reveals a circumscribed capability of Bard in aligning with human\ninstructions in translation contexts. Collectively, our findings underscore\nthat prevailing LLMs remain far from inclusive, with only limited ability to\ncater for the linguistic and cultural intricacies of diverse communities.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:29:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kadaoui","Karima",""],["Magdy","Samar M.",""],["Waheed","Abdul",""],["Khondaker","Md Tawkat Islam",""],["El-Shangiti","Ahmed Oumar",""],["Nagoudi","El Moatez Billah",""],["Abdul-Mageed","Muhammad",""]]}
{"id":"2308.03052","submitter":"Michael Pitt","authors":"Michael Pitt","title":"Reducing model uncertainties using proton-oxygen collisions with\n  proton/neutron tagging at the LHC","comments":"Proceedings of the 38th International Cosmic Ray Conference\n  (ICRC2023)","journal-ref":null,"doi":"10.22323/1.444.0426","report-no":"PoS-ICRC2023-426","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A short run of proton-oxygen and oxygen-oxygen collisions is planned to take\nplace at the Large Hadron Collider during LHC Run 3. The primary goal of this\nrun is to improve the modeling of Cosmic-Ray interactions and to reduce the\nuncertainties associated with proton-Air cross-sections. While the inelastic\ncross-section will be measured directly, an array of very forward proton and\nneutron detectors introduced by the ATLAS and CMS experiments can allow going\nbeyond the current physics research proposal, providing a unique opportunity to\nstudy elastic and diffractive interactions in pO collisions at the center of\nmass energies above TeV. This article presents the possible impact of proton\nand neutron tagging on the measurement of the elastic and diffractive\ncomponents, as well as discusses the prospects of measuring the decay products\nof oxygen ions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:32:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pitt","Michael",""]]}
{"id":"2308.03053","submitter":"Claudio Di Giulio","authors":"C. Di Giulio, F. Cardelli, S. Pioli, D. Alesini, M. Bellaveglia, S.\n  Bini, B. Buonomo, S. Cantarella, G. Catuscelli, M.Ceccarelli, R. Ceccarelli,\n  M. Cianfrini, R. Clementi, E. Di Pasquale, G. Di Raddo, R. Di Raddo, A.\n  Falone, A. Gallo, G. Latini, A. Liedl, V. Lollo, G. Piermarini, L. Piersanti,\n  S. Quaglia, L. A. Rossi, L. Sabbatini, G. Scarselletta, M. Scampati, S.\n  Tocci, R. Zarlenga","title":"TEX (TEst stand for X-band) at LNF","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":null,"categories":"physics.acc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  TEX facility if commissioned for high power testing to characterize\naccelerating structures and validate them for the operation on future particle\naccelerators for medical, industrial and research applications. At this aim,\nTEX is directly involved in the LNF leading project EuPRAXIA@SPARC_Lab. The\nbrief description of the facility and its status and prospective will be\nprovided.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:32:44 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 04:58:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Di Giulio","C.",""],["Cardelli","F.",""],["Pioli","S.",""],["Alesini","D.",""],["Bellaveglia","M.",""],["Bini","S.",""],["Buonomo","B.",""],["Cantarella","S.",""],["Catuscelli","G.",""],["Ceccarelli","M.",""],["Ceccarelli","R.",""],["Cianfrini","M.",""],["Clementi","R.",""],["Di Pasquale","E.",""],["Di Raddo","G.",""],["Di Raddo","R.",""],["Falone","A.",""],["Gallo","A.",""],["Latini","G.",""],["Liedl","A.",""],["Lollo","V.",""],["Piermarini","G.",""],["Piersanti","L.",""],["Quaglia","S.",""],["Rossi","L. A.",""],["Sabbatini","L.",""],["Scarselletta","G.",""],["Scampati","M.",""],["Tocci","S.",""],["Zarlenga","R.",""]]}
{"id":"2308.03054","submitter":"Ji Zou","authors":"Ji Zou and Stefano Bosco and Daniel Loss","title":"Spatially correlated classical and quantum noise in driven qubits: The\n  good, the bad, and the ugly","comments":"26 pages, 11 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":"  Correlated noise across multiple qubits poses a significant challenge for\nachieving scalable and fault-tolerant quantum processors. Despite recent\nexperimental efforts to quantify this noise in various qubit architectures, a\ncomprehensive understanding of its role in qubit dynamics remains elusive.\nHere, we present an analytical study of the dynamics of driven qubits under\nspatially correlated noise, including both Markovian and non-Markovian noise.\nSurprisingly, we find that, while correlated classical noise only leads to\ncorrelated decoherence without increasing the quantum coherence in the system,\nthe correlated quantum noise can be exploited to generate entanglement. In\nparticular, we reveal that, in the quantum limit, pure dephasing noise induces\na coherent long-range two-qubit Ising interaction that correlates distant\nqubits. In contrast, for purely transverse noise when qubits are subjected to\ncoherent drives, the correlated quantum noise induces both coherent symmetric\nexchange and Dzyaloshinskii-Moriya interaction between the qubits, as well as\ncorrelated relaxation, both of which give rise to significant entanglement.\nRemarkably, in this case, we uncover that the system exhibits distinct\ndynamical phases in different parameter regimes. Finally, we reveal the impact\nof spatio-temporally correlated 1/f noise on the decoherence rate, and how its\ntemporal correlations restore lost entanglement. Our analysis not only offers\ncritical insights into designing effective error mitigation strategies to\nreduce harmful effects of correlated noise, but also enables tailored protocols\nto leverage and harness noise-induced correlations for quantum information\nprocessing.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:34:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zou","Ji",""],["Bosco","Stefano",""],["Loss","Daniel",""]]}
{"id":"2308.03055","submitter":"Nikolaj Glazunov","authors":"Nikolaj Glazunov","title":"On direct and inverse limits of Minkowski's balls, domains, and their\n  critical lattices","comments":"6 pages, Fixed typos","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct direct and inverse systems of Minkowski's balls and domains,\ndirect and inverse systems of their critical lattices and calculate their\ndirect and inverse limits.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:35:37 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 15:27:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Glazunov","Nikolaj",""]]}
{"id":"2308.03056","submitter":"Yue Wu","authors":"Yue Wu, Zhiwu Huang, Dongjun Li, Heng Li, Jun Peng, Daniel Stroe,\n  Ziyou Song","title":"Optimal battery thermal management for electric vehicles with battery\n  degradation minimization","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":"  The control of a battery thermal management system (BTMS) is essential for\nthe thermal safety, energy efficiency, and durability of electric vehicles\n(EVs) in hot weather. To address the battery cooling optimization problem, this\npaper utilizes dynamic programming (DP) to develop an online rule-based control\nstrategy. Firstly, an electrical-thermal-aging model of the $\\rm LiFePO_4$\nbattery pack is established. A control-oriented onboard BTMS model is proposed\nand verified under different speed profiles and temperatures. Then in the DP\nframework, a cost function consisting of battery aging cost and cooling-induced\nelectricity cost is minimized to obtain the optimal compressor power. By\nexacting three rules \"fast cooling, slow cooling, and temperature-maintaining\"\nfrom the DP result, a near-optimal rule-based cooling strategy, which uses as\nmuch regenerative energy as possible to cool the battery pack, is proposed for\nonline execution. Simulation results show that the proposed online strategy can\ndramatically improve the driving economy and reduce battery degradation under\ndiverse operation conditions, achieving less than a 3% difference in battery\nloss compared to the offline DP. Recommendations regarding battery cooling\nunder different real-world cases are finally provided.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:39:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Yue",""],["Huang","Zhiwu",""],["Li","Dongjun",""],["Li","Heng",""],["Peng","Jun",""],["Stroe","Daniel",""],["Song","Ziyou",""]]}
{"id":"2308.03057","submitter":"Luyi Yang","authors":"Haochen Zhang, Zehua Zhai, Zhixuan Bi, Han Gao, Meng Ye, Yong Xu,\n  Hairen Tan, Luyi Yang","title":"Spin coherence and spin relaxation in hybrid organic-inorganic lead- and\n  mixed lead-tin-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":"  Metal halide perovskites are a promising class of materials for semiconductor\nspintronics. Here we report a systematic investigation of coherent spin\nprecession, spin dephasing and spin relaxation of electrons and holes in two\nhybrid organic-inorganic perovskites MA0.3FA0.7PbI3 and MA0.3FA0.7Pb0.5Sn0.5I3\nusing time-resolved Faraday rotation spectroscopy. With applied in-plane\nmagnetic fields, we observe robust Larmor spin precession of electrons and\nholes that persists hundreds of picoseconds. The spin dephasing and relaxation\nprocesses are likely sensitive to the defect levels. Temperature-dependent\nmeasurements give further insights into the spin relaxation channels. The\nextracted electron Land\\'e g-factors (3.75 and 4.36) are the biggest among the\nreported values in inorganic or hybrid perovskites. Both the electron and hole\ng-factors shift dramatically with the temperature, which we propose to\noriginate from thermal lattice vibration effects on the band structure. These\nresults lay the foundation for further design and use of lead- and tin-based\nperovskites for spintronic applications.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:40:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Haochen",""],["Zhai","Zehua",""],["Bi","Zhixuan",""],["Gao","Han",""],["Ye","Meng",""],["Xu","Yong",""],["Tan","Hairen",""],["Yang","Luyi",""]]}
{"id":"2308.03058","submitter":"Claudio Di Giulio","authors":"B. Buonomo, F. Cardelli, C. Di Giulio, D. Di Giovenale, L. G.\n  Foggetta, C. Taruggi","title":"The Frascati Beam Test Facility","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":null,"categories":"physics.acc-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  From 2004 the Frascati Beam Test Facility (BTF) in the DAFNE accelerator\ncomplex provides to the external user up to 1E10 electrons per bunch or up to\n10E9 positrons per bunch to develop their detectors. After an upgrade program\nterminated in 2020 of the beam test facility a description of the status and\navailable beam lines will be done.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:42:51 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 04:57:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Buonomo","B.",""],["Cardelli","F.",""],["Di Giulio","C.",""],["Di Giovenale","D.",""],["Foggetta","L. G.",""],["Taruggi","C.",""]]}
{"id":"2308.03059","submitter":"Zhenwei Wang","authors":"Zhenwei Wang, Nanxuan Zhao, Gerhard Hancke, Rynson W.H. Lau","title":"Language-based Photo Color Adjustment for Graphic Designs","comments":"15 pages, 19 figures. Accepted by SIGGRAPH 2023. Project page:\n  https://zhenwwang.github.io/langrecol","journal-ref":null,"doi":"10.1145/3592111","report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adjusting the photo color to associate with some design elements is an\nessential way for a graphic design to effectively deliver its message and make\nit aesthetically pleasing. However, existing tools and previous works face a\ndilemma between the ease of use and level of expressiveness. To this end, we\nintroduce an interactive language-based approach for photo recoloring, which\nprovides an intuitive system that can assist both experts and novices on\ngraphic design. Given a graphic design containing a photo that needs to be\nrecolored, our model can predict the source colors and the target regions, and\nthen recolor the target regions with the source colors based on the given\nlanguage-based instruction. The multi-granularity of the instruction allows\ndiverse user intentions. The proposed novel task faces several unique\nchallenges, including: 1) color accuracy for recoloring with exactly the same\ncolor from the target design element as specified by the user; 2)\nmulti-granularity instructions for parsing instructions correctly to generate a\nspecific result or multiple plausible ones; and 3) locality for recoloring in\nsemantically meaningful local regions to preserve original image semantics. To\naddress these challenges, we propose a model called LangRecol with two main\ncomponents: the language-based source color prediction module and the\nsemantic-palette-based photo recoloring module. We also introduce an approach\nfor generating a synthetic graphic design dataset with instructions to enable\nmodel training. We evaluate our model via extensive experiments and user\nstudies. We also discuss several practical applications, showing the\neffectiveness and practicality of our approach. Code and data for this paper\nare at: https://zhenwwang.github.io/langrecol.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:53:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Zhenwei",""],["Zhao","Nanxuan",""],["Hancke","Gerhard",""],["Lau","Rynson W. H.",""]]}
{"id":"2308.03060","submitter":"Chaofeng Chen","authors":"Chaofeng Chen, Jiadi Mo, Jingwen Hou, Haoning Wu, Liang Liao, Wenxiu\n  Sun, Qiong Yan, Weisi Lin","title":"TOPIQ: A Top-down Approach from Semantics to Distortions for Image\n  Quality Assessment","comments":"13 pages, 8 figures, 10 tables. In submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Image Quality Assessment (IQA) is a fundamental task in computer vision that\nhas witnessed remarkable progress with deep neural networks. Inspired by the\ncharacteristics of the human visual system, existing methods typically use a\ncombination of global and local representations (\\ie, multi-scale features) to\nachieve superior performance. However, most of them adopt simple linear fusion\nof multi-scale features, and neglect their possibly complex relationship and\ninteraction. In contrast, humans typically first form a global impression to\nlocate important regions and then focus on local details in those regions. We\ntherefore propose a top-down approach that uses high-level semantics to guide\nthe IQA network to focus on semantically important local distortion regions,\nnamed as \\emph{TOPIQ}. Our approach to IQA involves the design of a heuristic\ncoarse-to-fine network (CFANet) that leverages multi-scale features and\nprogressively propagates multi-level semantic information to low-level\nrepresentations in a top-down manner. A key component of our approach is the\nproposed cross-scale attention mechanism, which calculates attention maps for\nlower level features guided by higher level features. This mechanism emphasizes\nactive semantic regions for low-level distortions, thereby improving\nperformance. CFANet can be used for both Full-Reference (FR) and No-Reference\n(NR) IQA. We use ResNet50 as its backbone and demonstrate that CFANet achieves\nbetter or competitive performance on most public FR and NR benchmarks compared\nwith state-of-the-art methods based on vision transformers, while being much\nmore efficient (with only ${\\sim}13\\%$ FLOPS of the current best FR method).\nCodes are released at \\url{https://github.com/chaofengc/IQA-PyTorch}.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:08:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Chaofeng",""],["Mo","Jiadi",""],["Hou","Jingwen",""],["Wu","Haoning",""],["Liao","Liang",""],["Sun","Wenxiu",""],["Yan","Qiong",""],["Lin","Weisi",""]]}
{"id":"2308.03061","submitter":"Yanyan Shao","authors":"Yanyan Shao and Qi Ye and Wenhan Luo and Kaihao Zhang and Jiming Chen","title":"InterTracker: Discovering and Tracking General Objects Interacting with\n  Hands in the Wild","comments":"IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding human interaction with objects is an important research topic\nfor embodied Artificial Intelligence and identifying the objects that humans\nare interacting with is a primary problem for interaction understanding.\nExisting methods rely on frame-based detectors to locate interacting objects.\nHowever, this approach is subjected to heavy occlusions, background clutter,\nand distracting objects. To address the limitations, in this paper, we propose\nto leverage spatio-temporal information of hand-object interaction to track\ninteractive objects under these challenging cases. Without prior knowledge of\nthe general objects to be tracked like object tracking problems, we first\nutilize the spatial relation between hands and objects to adaptively discover\nthe interacting objects from the scene. Second, the consistency and continuity\nof the appearance of objects between successive frames are exploited to track\nthe objects. With this tracking formulation, our method also benefits from\ntraining on large-scale general object-tracking datasets. We further curate a\nvideo-level hand-object interaction dataset for testing and evaluation from\n100DOH. The quantitative results demonstrate that our proposed method\noutperforms the state-of-the-art methods. Specifically, in scenes with\ncontinuous interaction with different objects, we achieve an impressive\nimprovement of about 10% as evaluated using the Average Precision (AP) metric.\nOur qualitative findings also illustrate that our method can produce more\ncontinuous trajectories for interacting objects.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:09:17 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 12:44:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shao","Yanyan",""],["Ye","Qi",""],["Luo","Wenhan",""],["Zhang","Kaihao",""],["Chen","Jiming",""]]}
{"id":"2308.03062","submitter":"Rahil Valani","authors":"Rahil N. Valani","title":"Infinite-memory classical wave-particle entities, attractor-driven\n  active particles and the diffusionless Lorenz equations","comments":"16 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A classical wave-particle entity (WPE) can materialize as a millimeter-sized\ndroplet walking horizontally on the free surface of a vertically vibrating\nliquid bath. This WPE comprises a particle (droplet) that shapes its\nenvironment by locally exciting decaying standing waves, which in turn guides\nthe particle motion. At high amplitude of bath vibrations, the\nparticle-generated waves decay very slowly in time and the particle motion is\ninfluenced by the history of waves along its trajectory. In this high-memory\nregime, WPEs exhibit hydrodynamic quantum analogs where quantum-like statistics\narise from underlying chaotic dynamics. Exploration of WPE dynamics in the very\nhigh-memory regime requires solving an integro-differential equation of motion.\nBy using an idealized one-dimensional WPE model where the particle generates\nsinusoidal waves, we show that in the limit of infinite memory, the system\ndynamics reduce to a $3$D nonlinear system of ordinary differential equations\n(ODEs) known as the diffusionless Lorenz equations (DLEs). We use our\nalgebraically simple ODE system to explore in detail, theoretically and\nnumerically, the rich set of periodic and chaotic dynamical behaviors exhibited\nby the WPE in the parameter space. Specifically, we link the geometry and\ndynamics in phase-space of the DLE system to the dynamical and statistical\nfeatures of WPE motion, paving a way to understand hydrodynamic quantum analogs\nusing phase-space attractors. Our system also provides an alternate\ninterpretation of an attractor-driven particle, i.e.~an active particle driven\nby internal state-space variables of the DLE system. Hence, our results might\nalso provide new insights in modeling active particle locomotion.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:12:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Valani","Rahil N.",""]]}
{"id":"2308.03063","submitter":"Hao Tang","authors":"Hao Tang, Jun Liu, Shuanglin Yan, Rui Yan, Zechao Li, Jinhui Tang","title":"M$^3$Net: Multi-view Encoding, Matching, and Fusion for Few-shot\n  Fine-grained Action Recognition","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the scarcity of manually annotated data required for fine-grained\nvideo understanding, few-shot fine-grained (FS-FG) action recognition has\ngained significant attention, with the aim of classifying novel fine-grained\naction categories with only a few labeled instances. Despite the progress made\nin FS coarse-grained action recognition, current approaches encounter two\nchallenges when dealing with the fine-grained action categories: the inability\nto capture subtle action details and the insufficiency of learning from limited\ndata that exhibit high intra-class variance and inter-class similarity. To\naddress these limitations, we propose M$^3$Net, a matching-based framework for\nFS-FG action recognition, which incorporates \\textit{multi-view encoding},\n\\textit{multi-view matching}, and \\textit{multi-view fusion} to facilitate\nembedding encoding, similarity matching, and decision making across multiple\nviewpoints. \\textit{Multi-view encoding} captures rich contextual details from\nthe intra-frame, intra-video, and intra-episode perspectives, generating\ncustomized higher-order embeddings for fine-grained data. \\textit{Multi-view\nmatching} integrates various matching functions enabling flexible relation\nmodeling within limited samples to handle multi-scale spatio-temporal\nvariations by leveraging the instance-specific, category-specific, and\ntask-specific perspectives. \\textit{Multi-view fusion} consists of\nmatching-predictions fusion and matching-losses fusion over the above views,\nwhere the former promotes mutual complementarity and the latter enhances\nembedding generalizability by employing multi-task collaborative learning.\nExplainable visualizations and experimental results on three challenging\nbenchmarks demonstrate the superiority of M$^3$Net in capturing fine-grained\naction details and achieving state-of-the-art performance for FS-FG action\nrecognition.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:15:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tang","Hao",""],["Liu","Jun",""],["Yan","Shuanglin",""],["Yan","Rui",""],["Li","Zechao",""],["Tang","Jinhui",""]]}
{"id":"2308.03064","submitter":"Alberto Dennunzio","authors":"Alberto Dennunzio and Enrico Formenti and Luciano Margara","title":"An Easily Checkable Algebraic Characterization of Positive Expansivity\n  for Additive Cellular Automata over a Finite Abelian Group","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide an easily checkable algebraic characterization of positive\nexpansivity for Additive Cellular Automata over a finite abelian group. First\nof all, an easily checkable characterization of positive expansivity is\nprovided for the non trivial subclass of Linear Cellular Automata over the\nalphabet $(\\Z/m\\Z)^n$. Then, we show how it can be exploited to decide positive\nexpansivity for the whole class of Additive Cellular Automata over a finite\nabelian group.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:20:12 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 16:18:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dennunzio","Alberto",""],["Formenti","Enrico",""],["Margara","Luciano",""]]}
{"id":"2308.03065","submitter":"Mohamadreza Delbari","authors":"Alejandro Jim\\'enez-S\\'aez, Arash Asadi, Robin Neuder, Mohamadreza\n  Delbari, and Vahid Jamali","title":"Reconfigurable Intelligent Surfaces with Liquid Crystal Technology: A\n  Hardware Design and Communication Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the surge of theoretical work investigating Reconfigurable Intelligent\nSurfaces (RISs) for wireless communication and sensing, there exists an urgent\nneed of hardware solutions for the evaluation of these theoretical results and\nfurther advancing the field. The most common solutions proposed in the\nliterature are based on varactors, Positive Intrinsic-Negative (PIN) diodes,\nand Micro-Electro-Mechanical Systems (MEMS). This paper presents the use of\nLiquid Crystal (LC) technology for the realization of continuously tunable\nextremely large millimeter-wave RISs. We review the basic physical principles\nof LC theory, introduce two different realizations of LC-RISs, namely\nreflect-array and phased-array, and highlight their key properties that have an\nimpact on the system design and RIS reconfiguration strategy. Moreover, the LC\ntechnology is compared with the competing technologies in terms of feasibility,\ncost, power consumption, reconfiguration speed, and bandwidth. Furthermore,\nseveral important open problems for both theoretical and experimental research\non LC-RISs are presented.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:20:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jim\u00e9nez-S\u00e1ez","Alejandro",""],["Asadi","Arash",""],["Neuder","Robin",""],["Delbari","Mohamadreza",""],["Jamali","Vahid",""]]}
{"id":"2308.03066","submitter":"Shixin Wang","authors":"Shixin Wang, Majid Arezoomand, Tao Feng","title":"Algebraic degrees of quasi-abelian semi-Cayley digraphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a digraph $\\Gamma$, if $F$ is the smallest field that contains all roots\nof the characteristic polynomial of the adjacency matrix of $\\Gamma$, then $F$\nis called the splitting field of $\\Gamma$. The extension degree of $F$ over the\nfield of rational numbers $\\mathbb{Q}$ is said to be the algebraic degree of\n$\\Gamma$. A digraph is a semi-Cayley digraph over a group $G$ if it admits $G$\nas a semiregular automorphism group with two orbits of equal size. A\nsemi-Cayley digraph $\\mathrm{SC}(G,T_{11},T_{22},T_{12},T_{21})$ is called\nquasi-abelian if each of $T_{11},T_{22},T_{12}$ and $T_{21}$ is a union of some\nconjugacy classes of $G$. This paper determines the splitting field and the\nalgebraic degree of a quasi-abelian semi-Cayley digraph over any finite group\nin terms of irreducible characters of groups. This work generalizes the\nprevious works on algebraic degrees of Cayley graphs over abelian groups and\nany group having a subgroup of index 2, and semi-Cayley digraphs over abelian\ngroups.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:25:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Shixin",""],["Arezoomand","Majid",""],["Feng","Tao",""]]}
{"id":"2308.03067","submitter":"Li Liang","authors":"Zhenxing Di, Liping Li, Li Liang and Nina Yu","title":"Representations over diagrams of abelian categories II: Abelian model\n  structures","comments":"arXiv admin note: text overlap with arXiv:2210.08558","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is the second one of the serial papers studying representations over\ndiagrams of abelian categories. We show that under certain conditions a\ncompatible family of abelian model categories indexed by a small category can\namalgamate to an abelian model structure on the category of representations.\nOur strategy to realize this goal is to consider classes of morphisms rather\nthan cotorsion pairs of objects. Moreover, we give an explicit description of\ncofibrant objects in this abelian model category. As applications, we construct\nGorenstein injective and Gorenstein flat model structures on the category of\npresheaves of modules for a few special index categories, and give\ncharacterizations of Gorenstein homological objects in this category.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:34:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Di","Zhenxing",""],["Li","Liping",""],["Liang","Li",""],["Yu","Nina",""]]}
{"id":"2308.03068","submitter":"Yan-Gang Miao","authors":"Hao Yang, Chang-Jiang Yu, Yan-Gang Miao","title":"Preliminary analyses on dynamics and thermodynamics of rotating regular\n  black holes","comments":"v1: 33 pages, 2 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 investigate the dynamical and thermodynamic laws governing rotating\nregular black holes. By analyzing dynamical properties, i.e., the interaction\nbetween scalar particles and rotating regular black holes, we establish the\ncriteria that determine whether such black holes satisfy the laws of\nthermodynamics or not. In addition, we provide the general form of conserved\nquantities related to rotating regular black holes, including the relevant\nflows associated with neutral scalar particles. Meanwhile, we reexamine the\nrelationship between the third law of thermodynamics and weak cosmic censorship\nconjecture for rotating regular black holes. In accordance with the criteria\nmentioned above, we discuss the laws of thermodynamics for three models of\nrotating regular black holes: Rotating Hayward black holes, Kerr black-bounce\nsolutions, and loop quantum gravity black holes. Our findings indicate that\nnone of the three models satisfies the first law of thermodynamics. In\nparticular, the first and third models fail to comply with the three laws of\nthermodynamics, while the second model satisfies only the second and third laws\nof thermodynamics. Finally, we attempt to rescue the laws of thermodynamics by\nmodifying entropy or extending phase space. However, the two scenarios are not\nable to ensure the three laws of thermodynamics in the three models, which\nreveals an unusual property of rotating regular black holes.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:39:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Hao",""],["Yu","Chang-Jiang",""],["Miao","Yan-Gang",""]]}
{"id":"2308.03069","submitter":"Amartya Goswami","authors":"Amartya Goswami","title":"On ideals in quantales -- I","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Taking a ring-theoretic perspective as our motivation, the main aim of this\nseries is to establish a comprehensive theory of ideals in commutative\nquantales with an identity element. This particular article focuses on an\nexamination of several key properties related to ideals in quantale, including\nprime, semiprime, radical, primary, irreducible, and strongly irreducible\nideals. Furthermore, we investigate the primary decomposition problem for\nquantale ideals. In conclusion, we present a set of future directions for\nfurther exploration, serving as a natural continuation of this article.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:40:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Goswami","Amartya",""]]}
{"id":"2308.03070","submitter":"Jiaxuan Luo","authors":"Jiaxuan. Luo, Xinbai. Li, Zebo. Tang, Xin. Wu, Wangmei. Zha","title":"The effect of initial nuclear deformation on dielectron photoproduction\n  in hadronic heavy-ion collisions","comments":"8 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Significant excesses of $e^+e^-$ pair production at very low transverse\nmomentum ($p_T <$ 0.15 GeV/c) were observed by the STAR collaboration in\nhadronic heavy-ion collisions. Such enhancement is assumed to be a sign of\nphoton-photon production in heavy-ion collisions with hadronic overlap, based\non comparisons with model calculations for spherical Au + Au collisions.\nHowever, there is a lack of calculations for $e^+e^-$ pair production from\ncoherent photon-photon interactions in hadronic U + U collisions, due to the\ndeformity of Uranium nuclei. In this article, we present calculations for\n$e^+e^-$ pair photoproduction at $\\sqrt{s_{NN}}$ = 193 GeV in both spherical\nand deformed U + U collisions within STAR detector acceptance using the\nequivalent photon approximation (EPA). We conduct event-by-event analysis to\ninvestigate the effects of initial nuclear deformation on pair production. Our\nnumerical results show good agreement with experimental data for the 40%--60%\nand 60%--80% centrality classes in U + U collisions, and the differences\nbetween spherical and deformed configurations are approximately 3\\%. We also\ncalculate the yields of the photoproduced $e^+e^-$ pair in hadronic deformed Ru\n+ Ru and Zr + Zr collisions at $\\sqrt{s_{NN}}$ = 200 GeV. The results reveal\nthat the ratios of the yields of Ru to Zr exhibit very small differences ($<$\n1%) between spherical and deformed cases.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:42:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Luo","Jiaxuan.",""],["Li","Xinbai.",""],["Tang","Zebo.",""],["Wu","Xin.",""],["Zha","Wangmei.",""]]}
{"id":"2308.03071","submitter":"Noy Soffer Aranov","authors":"Noy Soffer Aranov","title":"Geometry of Numbers in Positive Characteristic","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.DS math.MG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we shall discuss topics in geometry of numbers in the positive\ncharacteristic setting, such as covering radii. We find a closed form for\ncovering radii with respect to convex bodies, which will lead to a proof of the\npositive characteristic analogue of Woods' conjecture in this setting. Then, we\nwill prove a positive characteristic analogue of Minkowski's conjecture about\nthe multiplicative covering radius. To do this, we shall prove a positive\ncharacteristic analogue of Solan's result that every diagonal orbit intersects\nthe set of well rounded lattices. This implies that the Gruber-Mordell spectrum\nin positive characteristic is trivial in every dimension.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:44:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aranov","Noy Soffer",""]]}
{"id":"2308.03072","submitter":"Bo Ying Su","authors":"Bo Ying Su, Zhongqi Wei, James McCann, Wenzhen Yuan, Changliu Liu","title":"Customizing Textile and Tactile Skins for Interactive Industrial Robots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tactile skins made from textiles enhance robot-human interaction by\nlocalizing contact points and measuring contact forces. This paper presents a\nsolution for rapidly fabricating, calibrating, and deploying these skins on\nindustrial robot arms. The novel automated skin calibration procedure maps skin\nlocations to robot geometry and calibrates contact force. Through experiments\non a FANUC LR Mate 200id/7L industrial robot, we demonstrate that tactile skins\nmade from textiles can be effectively used for human-robot interaction in\nindustrial environments, and can provide unique opportunities in robot control\nand learning, making them a promising technology for enhancing robot perception\nand interaction.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:48:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Su","Bo Ying",""],["Wei","Zhongqi",""],["McCann","James",""],["Yuan","Wenzhen",""],["Liu","Changliu",""]]}
{"id":"2308.03073","submitter":"Yifan Qi","authors":"Yifan Qi, Gongcheng Yue, Ting Hao, Yang Li","title":"High-speed integrated lithium niobate low-index rib loaded waveguide\n  modulator without direct lithium niobate etching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Integrated thin film lithium niobate (TFLN) modulators are emerging as an\nappealing choice for fiber-optic communications, data centers, and microwave\nphotonics due to their high modulation speed and low driving voltage. The key\nstep in fabricating integrated TFLN modulators is the high-quality etching of\nTFLN, which typically requires long-term fabrication process iteration and\nspecialized equipment. Here we present an integrated TFLN modulator by\nincorporating low-index rib loaded waveguides onto TFLN without direct etching\nof TFLN. Based on our systematic investigation into the theory and design\nmethodology of this design, we experimentally demonstrated a 1.3 cm-long\nMach-Zender modulator, featuring a 3-dB bandwidth of 59 GHz and a half-wave\nvoltage of 1.96 V. Our design significantly simplifies the fabrication process\nof integrated TFLN modulators and in turn opens up new avenues for the mass\nproduction of high-performance TFLN modulators at low cost.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:00:16 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 10:38:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qi","Yifan",""],["Yue","Gongcheng",""],["Hao","Ting",""],["Li","Yang",""]]}
{"id":"2308.03074","submitter":"Xi Luo","authors":"Xi Luo, Long Liang, Yue Yu","title":"Non-Fermi Liquid Behavior of the $t$-$J$ Model in the Strange Metal\n  Phase: $U(1)$ Gauge Theory with Local Constraints","comments":"v1: 20 pages; v2: 21 pages, 8 figures. A few changes and new\n  references added. All comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the Becchi-Rouet-Stora-Tyutin (BRST) method to quantize the $t$-$J$\nmodel in the $U(1)$ gauge slave boson representation. While the temporal\ncomponent of the gauge field plays a role of a Lagrange multiplier to enforce\nthe no double occupancy constraint, the spatial components do that to enforce\nthe zero counterflow constraint of the spinon and holon currents. The BRST\nquantization guarantees the gauge invariance of the theory and removes the\nredundant gauge degrees of freedom by proper gauge fixing conditions while the\nno double occupancy and zero counterflow constraints are exactly retained.\nFurthermore, Fradkin-Vilkovisky gauge fixing conditions endow the gauge field\nwith dynamics. This turns the strongly correlated electron model into a weakly\ncoupled slave boson model, most of whose physical observables can be calculated\nby the conventional quantum many-body perturbation theory. We focus on the\nproperties of the strange metal phase in the $t$-$J$ model. The electron\nmomentum distribution and the spectral function are calculated, and their\nnon-Fermi liquid behavior agrees with the angle resolved photoemission\nspectroscopy measurements for the cuprate materials. We also study the\nresponses of the strange metal state to the external electromagnetic fields.\nThe non-Fermi liquid anomalies observed in cuprates are captured by our\ncalculations. Especially, we find that the Hall resistivity decreases as\ntemperature raises and the sign of the Hall resistivity varies from negative to\npositive when the dopant concentration varies from the optimal doping one to\nunderdoping one when the temperature $T>T^*$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:00:17 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 09:41:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Xi",""],["Liang","Long",""],["Yu","Yue",""]]}
{"id":"2308.03075","submitter":"Karl Bringmann","authors":"Karl Bringmann","title":"Knapsack with Small Items in Near-Quadratic Time","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Bounded Knapsack problem is one of the most fundamental NP-complete\nproblems at the intersection of computer science, optimization, and operations\nresearch. A recent line of research worked towards understanding the complexity\nof pseudopolynomial-time algorithms for Bounded Knapsack parameterized by the\nmaximum item weight $w_{\\mathrm{max}}$ and the number of items $n$. A\nconditional lower bound rules out that Bounded Knapsack can be solved in time\n$O((n+w_{\\mathrm{max}})^{2-\\delta})$ for any $\\delta > 0$ [Cygan, Mucha,\nWegrzycki, Wlodarczyk'17, K\\\"unnemann, Paturi, Schneider'17]. This raised the\nquestion whether Bounded Knapsack can be solved in time $\\tilde\nO((n+w_{\\mathrm{max}})^2)$. The quest of resolving this question lead to\nalgorithms that run in time $\\tilde O(n^3 w_{\\mathrm{max}}^2)$ [Tamir'09],\n$\\tilde O(n^2 w_{\\mathrm{max}}^2)$ and $\\tilde O(n w_{\\mathrm{max}}^3)$\n[Bateni, Hajiaghayi, Seddighin, Stein'18], $O(n^2 w_{\\mathrm{max}}^2)$ and\n$\\tilde O(n w_{\\mathrm{max}}^2)$ [Eisenbrand and Weismantel'18], $O(n +\nw_{\\mathrm{max}}^3)$ [Polak, Rohwedder, Wegrzycki'21], and very recently\n$\\tilde O(n + w_{\\mathrm{max}}^{12/5})$ [Chen, Lian, Mao, Zhang'23].\n  In this paper we resolve this question by designing an algorithm for Bounded\nKnapsack with running time $\\tilde O(n + w_{\\mathrm{max}}^2)$, which is\nconditionally near-optimal.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:07:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bringmann","Karl",""]]}
{"id":"2308.03076","submitter":"Jiuqi Yan","authors":"Jiuqi Yan","title":"Study for Performance of MobileNetV1 and MobileNetV2 Based on Breast\n  Cancer","comments":"5 pages,3 figures,CMLAI 2023","journal-ref":null,"doi":null,"report-no":"CMLAI-101","categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial intelligence is constantly evolving and can provide effective help\nin all aspects of people's lives. The experiment is mainly to study the use of\nartificial intelligence in the field of medicine. The purpose of this\nexperiment was to compare which of MobileNetV1 and MobileNetV2 models was\nbetter at detecting histopathological images of the breast downloaded at\nKaggle. When the doctor looks at the pathological image, there may be errors\nthat lead to errors in judgment, and the observation speed is slow. Rational\nuse of artificial intelligence can effectively reduce the error of doctor\ndiagnosis in breast cancer judgment and speed up doctor diagnosis. The dataset\nwas downloaded from Kaggle and then normalized. The basic principle of the\nexperiment is to let the neural network model learn the downloaded data set.\nThen find the pattern and be able to judge on your own whether breast tissue is\ncancer. In the dataset, benign tumor pictures and malignant tumor pictures have\nbeen classified, of which 198738 are benign tumor pictures and 78, 786 are\nmalignant tumor pictures. After calling MobileNetV1 and MobileNetV2, the\ndataset is trained separately, the training accuracy and validation accuracy\nrate are obtained, and the image is drawn. It can be observed that MobileNetV1\nhas better validation accuracy and overfit during MobileNetV2 training. From\nthe experimental results, it can be seen that in the case of processing this\ndataset, MobileNetV1 is much better than MobileNetV2.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:08:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yan","Jiuqi",""]]}
{"id":"2308.03077","submitter":"Sixiu Liu","authors":"Sixiu Liu, Shijun Cheng, and Tariq Alkhalifah","title":"Gabor-based learnable sparse representation for self-supervised\n  denoising","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditional supervised denoising networks learn network weights through\n\"black box\" (pixel-oriented) training, which requires clean training labels.\nThe uninterpretability nature of such denoising networks in addition to the\nrequirement for clean data as labels limits their applicability in real case\nscenarios. Deep unfolding methods unroll an optimization process into Deep\nNeural Networks (DNNs), improving the interpretability of networks. Also,\nmodifiable filters in DNNs allow us to embed the physics information of the\ndesired signals to be extracted, in order to remove noise in a self-supervised\nmanner. Thus, we propose a Gabor-based learnable sparse representation network\nto suppress different noise types in a self-supervised fashion through\nconstraints/bounds applied to the parameters of the Gabor filters of the\nnetwork during the training stage. The effectiveness of the proposed method was\ndemonstrated on two noise type examples, pseudo-random noise and ground roll,\non synthetic and real data.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:10:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Sixiu",""],["Cheng","Shijun",""],["Alkhalifah","Tariq",""]]}
{"id":"2308.03078","submitter":"Takahiro Orito","authors":"Takahiro Orito and Ken-Ichiro Imura","title":"Entanglement dynamics in the many-body Hatano-Nelson model","comments":"18+3+2 pages, 13+1+0 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 entanglement dynamics in a non-Hermitian quantum system is studied\nnumerically and analyzed from the viewpoint of quasiparticle picture. As a\nconcrete model, we consider a one-dimensional tight-binding model with\nasymmetric hopping (Hatano-Nelson model) under onsite disorder and\nnearest-neighbor interaction. As opposed to an assertion of previous studies,\nthe entanglement dynamics in this non-Hermitian quantum system is very\ndifferent from the one in its Hermitian counterpart, especially in the\ndelocalized regime with weak disorder; there the entanglement entropy $S_{\\rm\nent}(t)$ shows a characteristic non-monotonic time evolution. We have clarified\nand quantified the nature of this behavior in the quasiparticle picture. In the\nasymptotic regime of $t\\rightarrow\\infty$, the entanglement entropy $S_{\\rm\nent}(t)$ in this regime saturates to a much suppressed value, which increases\nonly logarithmically with respect to the size of the subsystem.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:12:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Orito","Takahiro",""],["Imura","Ken-Ichiro",""]]}
{"id":"2308.03079","submitter":"Vartan Choulakian","authors":"V. Choulakian and J. Allard (Universit\\'e de Moncton Canada)","title":"Visualization of Extremely Sparse Contingency Table by Taxicab\n  Correspondence Analysis: A Case Study of Textual Data","comments":"16 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an overview of taxicab correspondence analysis, a robust variant\nof correspondence analysis, for visualization of extremely sparse ontingency\ntables. In particular we visualize an extremely sparse textual data set of size\n590 by 8265 concerning fragments of 8 sacred books recently introduced by Sah\nand Fokou\\'e (2019) and studied quite in detail by (12 + 1) dimension reduction\nmethods (t-SNE, UMAP, PHATE,...) by Ma, Sun and Zou (2022).\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:14:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Choulakian","V.","","Universit\u00e9 de Moncton Canada"],["Allard","J.","","Universit\u00e9 de Moncton Canada"]]}
{"id":"2308.03080","submitter":"Helmut Prodinger","authors":"Helmut Prodinger","title":"Peakless Motzkin paths of bounded height","comments":"Early draft. Comments and suggestions welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There was recent interest in Motzkin paths without peaks (peak: up-step\nfollowed immediately by down-step); additional results\n  about this interesting family is worked out. The new results are the\nenumeration of such paths that live in a strip $[0..\\ell]$, and as\n  consequence the asymptotics of the average height, which is given by $2\\cdot\n5^{-1/4}\\sqrt{\\pi n}$. Methods include the kernel method\n  and singularity analysis of generating functions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:19:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Prodinger","Helmut",""]]}
{"id":"2308.03081","submitter":"Benjamin Miller","authors":"Benjamin A. Miller and Kevin Chan and Tina Eliassi-Rad","title":"Using Overlapping Methods to Counter Adversaries in Community Detection","comments":"28 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When dealing with large graphs, community detection is a useful data triage\ntool that can identify subsets of the network that a data analyst should\ninvestigate. In an adversarial scenario, the graph may be manipulated to avoid\nscrutiny of certain nodes by the analyst. Robustness to such behavior is an\nimportant consideration for data analysts in high-stakes scenarios such as\ncyber defense and counterterrorism. In this paper, we evaluate the use of\noverlapping community detection methods in the presence of adversarial attacks\naimed at lowering the priority of a specific vertex. We formulate the data\nanalyst's choice as a Stackelberg game in which the analyst chooses a community\ndetection method and the attacker chooses an attack strategy in response.\nApplying various attacks from the literature to seven real network datasets, we\nfind that, when the attacker has a sufficient budget, overlapping community\ndetection methods outperform non-overlapping methods, often overwhelmingly so.\nThis is the case when the attacker can only add edges that connect to the\ntarget and when the capability is added to add edges between neighbors of the\ntarget. We also analyze the tradeoff between robustness in the presence of an\nattack and performance when there is no attack. Our extensible analytic\nframework enables network data analysts to take these considerations into\naccount and incorporate new attacks and community detection methods as they are\ndeveloped.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:23:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Miller","Benjamin A.",""],["Chan","Kevin",""],["Eliassi-Rad","Tina",""]]}
{"id":"2308.03082","submitter":"Hai-Jun Liao","authors":"Hai-Jun Liao, Kang Wang, Zong-Sheng Zhou, Pan Zhang and Tao Xiang","title":"Simulation of IBM's kicked Ising experiment with Projected Entangled\n  Pair Operator","comments":"8 pages, 3 figures","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-nc-sa/4.0/","abstract":"  We perform classical simulations of the 127-qubit kicked Ising model, which\nwas recently emulated using a quantum circuit with error mitigation [Nature\n618, 500 (2023)]. Our approach is based on the projected entangled pair\noperator (PEPO) in the Heisenberg picture. Its main feature is the ability to\nautomatically identify the underlying low-rank and low-entanglement structures\nin the quantum circuit involving Clifford and near-Clifford gates.\n  We assess our approach using the quantum circuit with 5+1 trotter steps which\nwas previously considered beyond classical verification. We develop a Clifford\nexpansion theory to compute exact expectation values and use them to evaluate\nalgorithms. The results indicate that PEPO significantly outperforms existing\nmethods, including the tensor network with belief propagation, the matrix\nproduct operator, and the Clifford perturbation theory, in both efficiency and\naccuracy. In particular, PEPO with bond dimension $\\chi=2$ already gives\nsimilar accuracy to the CPT with $K=10$ and MPO with bond dimension\n$\\chi=1024$. And PEPO with $\\chi=184$ provides exact results in $3$ seconds\nusing a single CPU.\n  Furthermore, we apply our method to the circuit with 20 Trotter steps. We\nobserve the monotonic and consistent convergence of the results with $\\chi$,\nallowing us to estimate the outcome with $\\chi\\to\\infty$ through\nextrapolations. We then compare the extrapolated results to those achieved in\nquantum hardware and with existing tensor network methods. Additionally, we\ndiscuss the potential usefulness of our approach in simulating quantum\ncircuits, especially in scenarios involving near-Clifford circuits and quantum\napproximate optimization algorithms. Our approach is the first use of PEPO in\nsolving the time evolution problem, and our results suggest it could be a\npowerful tool for exploring the dynamical properties of quantum many-body\nsystems.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:24:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liao","Hai-Jun",""],["Wang","Kang",""],["Zhou","Zong-Sheng",""],["Zhang","Pan",""],["Xiang","Tao",""]]}
{"id":"2308.03083","submitter":"Hanif Emamgholizadeh","authors":"Hanif Emamgholizadeh, Amra Delic, and Francesco Ricci","title":"Predicting Group Choices from Group Profiles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Group recommender systems (GRS) identify items to recommend to a group by\naggregating group members' individual preferences into a group profile. The\npreference aggregation strategy used to build the group profile can also be\nused for predicting the item that a group may decide to choose, i.e., by\nassuming that the group is applying exactly that strategy. However, predicting\nthe choice of a group is challenging since the RS is not aware of the precise\npreference aggregation strategy that is going to be used by the group. Hence,\nthe aim of this paper is to validate the research hypothesis that, by using a\nmachine learning approach and a data set of observed group choices, it is\npossible to predict a group's final choice, better than by using a standard\npreference aggregation strategy. Inspired by Social Decision Scheme theory,\nwhich first tried to address the group choice prediction problem, we search for\na group profile definition that, in conjunction with a machine learning model,\ncan be used to accurately predict a group choice. Moreover, to cope with the\ndata scarcity problem, we propose two data augmentation methods, which add\nsynthetic group profiles to the training data, and we hypothesise they can\nfurther improve the choice prediction accuracy. We validate our research\nhypotheses by using a data set containing 282 participants organized in 79\ngroups. The experiments indicate that the proposed methods outperform baseline\naggregation strategies when used for group choice prediction. The proposed\nmethod is robust with the presence of missing preference data and achieves a\nperformance superior to what human can achieve on the group choice prediction\ntask. Finally, the proposed data augmentation method can also improve the\nprediction accuracy. Our approach can be exploited in novel GRSs to identify\nthe items that the group is likely to choose and help the group to make a\nbetter choice.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:25:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Emamgholizadeh","Hanif",""],["Delic","Amra",""],["Ricci","Francesco",""]]}
{"id":"2308.03084","submitter":"Sarath Nelleri","authors":"Naseeba.K.M, Sarath Nelleri, Navaneeth Poonthottathil","title":"Testing the dynamical stability and validity of generalized second law\n  within the phantom dynamical dark energy model","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hubble constant($H_0$) tension and tension in the matter fluctuation\namplitude ($s_8$) are fascinating puzzles in cosmology nowadays. Phantom\ndynamical dark energy model (PDDE), also known as little sibling of the big rip\nis an abrupt event that can happen in the far future evolution of the universe.\nRecent analysis of PDDE model based on CMBR data shows that the model is a\npotential candidate to alleviate these tension problems. In this work, we study\nthe background evolution of the universe within the PDDE model. Analysis based\non the SNIa+BAO+OHD data shows that the model is successful in explaining the\nlate phase acceleration of the universe. Also, the values of the cosmological\nparameters predicted by PDDE model are consistent with the values predicted by\nthe $\\Lambda$CDM model. However, most of the phanton dark energy models doesn't\ngive stable solution in the asymptotic future. In this regard, we address the\ndynamical stability of the PDDE model and also test the validity of the\ngeneralized second law (GSL) of thermodynamics. We show that the model is\ndynamically unstable and violates the GSL. The model doesn't satisfy the\nconvexity condition and hence the universe doesn't behave like an ordinary\nmacroscopic system within the PDDE model.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:37:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["M","Naseeba. K.",""],["Nelleri","Sarath",""],["Poonthottathil","Navaneeth",""]]}
{"id":"2308.03085","submitter":"Alvaro Pelayo","authors":"\\'Alvaro Pelayo, Francisco Santos","title":"The structure of monotone blow-ups in symplectic toric geometry and a\n  question of McDuff","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.AG math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Monotone polytopes, also known as smooth reflexive polytopes, are the\npolytopes associated to monotone symplectic toric manifolds and Gorenstein Fano\ntoric varieties. We first show that the only monotone polytopes admitting\nblow-ups at vertices are the simplex and the result of a codimension-two\nblow-up in it (this is the polyhedral version of a result of Bonavero from\n2002). Then we show that the $n$-simplex admits disjoint blow-ups at faces if\nand only if the faces are disjoint and have dimensions adding up to $n-1$ or\n$n-2$. These results answer a question posed by Dusa McDuff in 2011.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:39:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pelayo","\u00c1lvaro",""],["Santos","Francisco",""]]}
{"id":"2308.03086","submitter":"Seyed Mohammad Sadegh Movahed","authors":"M. H. Jalali Kanafi and S. M. S. Movahed","title":"Probing the anisotropy and non-Gaussianity in redshift space through the\n  derivative of excursion set moments","comments":"14 pages and 7 figures;","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA astro-ph.IM physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Focusing on the redshift space observations with plane-parallel approximation\nand relying on the rotational dependency of the general definition of excursion\nsets, we introduce the so-called conditional moments of the first derivative\n($cmd$) measures for the smoothed matter density field in $3$-Dimension. We\nderive the perturbative expansion of $cmd$ for real space and redshift space\nwhere peculiar velocity disturbs the galaxies' observed locations. Our criteria\ncan successfully recognize the contribution of linear Kaiser and Finger of God\neffects. Our results demonstrate that the $cmd$ measure has significant\nsensitivity for pristine constraining the redshift space distortion parameter\n$\\beta=f/b$ and interestingly, the associated normalized quantity in the\nGaussian linear Kaiser limit has only $\\beta$-dependency. Implementation of the\nsynthetic anisotropic Gaussian field approves the consistency between the\ntheoretical and numerical results. Including the first-order contribution of\nnon-Gaussianity perturbatively in the $cmd$ criterion implies that the N-body\nsimulations for the Quijote suite in redshift space has been mildly skewed with\na higher value for the threshold greater than zero. The non-Gaussianity for the\nperpendicular direction to the line of sight in the redshift space for\nsmoothing scales $R\\gtrsim 20$ Mpc/h is almost the same as the real space,\nwhile the non-Gaussianity for along to the line of sight direction in redshift\nspace is magnified.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:50:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kanafi","M. H. Jalali",""],["Movahed","S. M. S.",""]]}
{"id":"2308.03087","submitter":"Fei Wang","authors":"Yunlong Li and Fei Wang","title":"Local Randomized Neural Networks Methods for Interface Problems","comments":"22 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate modeling of complex physical problems, such as fluid-structure\ninteraction, requires multiphysics coupling across the interface, which often\nhas intricate geometry and dynamic boundaries. Conventional numerical methods\nface challenges in handling interface conditions. Deep neural networks offer a\nmesh-free and flexible alternative, but they suffer from drawbacks such as\ntime-consuming optimization and local optima. In this paper, we propose a\nmesh-free approach based on Randomized Neural Networks (RNNs), which avoid\noptimization solvers during training, making them more efficient than\ntraditional deep neural networks. Our approach, called Local Randomized Neural\nNetworks (LRNNs), uses different RNNs to approximate solutions in different\nsubdomains. We discretize the interface problem into a linear system at\nrandomly sampled points across the domain, boundary, and interface using a\nfinite difference scheme, and then solve it by a least-square method. For\ntime-dependent interface problems, we use a space-time approach based on LRNNs.\nWe show the effectiveness and robustness of the LRNNs methods through numerical\nexamples of elliptic and parabolic interface problems. We also demonstrate that\nour approach can handle high-dimension interface problems. Compared to\nconventional numerical methods, our approach achieves higher accuracy with\nfewer degrees of freedom, eliminates the need for complex interface meshing and\nfitting, and significantly reduces training time, outperforming deep neural\nnetworks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 10:55:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yunlong",""],["Wang","Fei",""]]}
{"id":"2308.03088","submitter":"Fei Wang","authors":"Yong Shang and Fei Wang","title":"Randomized Neural Networks with Petrov-Galerkin Methods for Solving\n  Linear Elasticity Problems","comments":"15 pages, 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":"  We develop the Randomized Neural Networks with Petrov-Galerkin Methods\n(RNN-PG methods) to solve linear elasticity problems. RNN-PG methods use\nPetrov-Galerkin variational framework, where the solution is approximated by\nrandomized neural networks and the test functions are piecewise polynomials.\nUnlike conventional neural networks, the parameters of the hidden layers of the\nrandomized neural networks are fixed randomly, while the parameters of the\noutput layer are determined by the least square method, which can effectively\napproximate the solution. We also develop mixed RNN-PG methods for linear\nelasticity problems, which ensure the symmetry of the stress tensor and avoid\nlocking effects. We compare RNN-PG methods with the finite element method, the\nmixed discontinuous Galerkin method, and the physics-informed neural network on\nseveral examples, and the numerical results demonstrate that RNN-PG methods\nachieve higher accuracy and efficiency.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 11:08:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shang","Yong",""],["Wang","Fei",""]]}
{"id":"2308.03089","submitter":"Thibaut Jonckheere","authors":"K. Iyer, T. Martin, J. Rech, T. Jonckheere","title":"Quasiparticle Andreev reflection in the Laughlin fractions of the\n  fractional quantum Hall effect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Andreev reflection occurs in a normal metal-superconductor junction, when an\nelectron on the normal side can only be transmitted as a Cooper pair in the\nsuperconductor, with the reflection of a hole on the normal side. A similar\nphenomenon can occur in strongly correlated systems, in particular in the\nfractional quantum Hall effect (FQHE), as the system quasiparticles have a\ncharge $e/m$ different from the electron charge. We study theoretically a setup\ninvolving two quantum point contacts (QPC) in the FQHE where Andreev reflection\noccurs, as charges $e/m$ impinging on the second QPC can only be transmitted as\ncharges $e$, with the reflection of holes of charge $e (1-m)/m $. Using the\nbosonization formalism, and out-of-equilibrium Keldysh Green function\ntechniques, we provide a full analytical calculation of the current\ncorrelations at the outputs of the QPC, both at zero and finite temperature.\nThe ratio between the auto- and cross-correlations of the output currents is a\ndirect manifestation of Andreev reflection. Our results agree with recent\nexperimental observations, and give precious information on the temperature\ndependence of this ratio.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 11:17:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Iyer","K.",""],["Martin","T.",""],["Rech","J.",""],["Jonckheere","T.",""]]}
{"id":"2308.03090","submitter":"Gleb Smirnov","authors":"Vsevolod Shevchishin, Gleb Smirnov","title":"Anti-self-dual blowups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider a closed oriented four-manifold $X$ that contains an embedded sphere\nof self-intersection number $(-1)$. Suppose that $b_2^+(X) \\leq 3$. A\nRiemannian metric on $X$ is found such that the cohomology class dual to this\nsphere is represented by an anti-self-dual harmonic form. Moreover, such a\nmetric exists even for multiple disjoint embedded $(-1)$-spheres.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 11:21:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shevchishin","Vsevolod",""],["Smirnov","Gleb",""]]}
{"id":"2308.03091","submitter":"Lijing Shao","authors":"Lihang Zhou, Richard Brito, Zhan-Feng Mai, Lijing Shao","title":"Superradiant instabilities of massive bosons around exotic compact\n  objects","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superradiantly unstable ultralight particles around a classical rotating\nblack hole (BH) can form an exponentially growing bosonic cloud, which have\nbeen shown to provide an astrophysical probe to detect ultralight particles and\nconstrain their mass. However, the classical BH picture has been questioned,\nand different theoretical alternatives have been proposed. Exotic compact\nobjects (ECOs) are horizonless alternatives to BHs featuring a reflective\nsurface (with a reflectivity $\\mathcal{K}$) in place of the event horizon. In\nthis work, we study superradiant instabilities around ECOs, particularly\nfocusing on the influence of the boundary reflection. We calculate the growth\nrate of superradiant instabilities around ECOs, and show that the result can be\nrelated to the BH case by a correction factor $g_{\\mathcal{K}}$, for which we\nfind an explicit analytical expression and a clear physical interpretation.\nAdditionally, we consider the time evolution of superradiant instabilities and\nfind that the boundary reflection can either shorten or prolong the growth\ntimescale. As a result, the boundary reflection alters the superradiance\nexclusion region on the Regge plane, potentially affecting constraints on the\nmass of ultralight particles. For a mildly reflective surface\n($|\\mathcal{K}|\\lesssim 0.5$), the exclusion region is not substantially\nchanged, while significant effects from the boundary reflection can occur for\nan extreme reflectivity ($|\\mathcal{K}|\\gtrsim0.9$).\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 11:30:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Lihang",""],["Brito","Richard",""],["Mai","Zhan-Feng",""],["Shao","Lijing",""]]}
{"id":"2308.03092","submitter":"Shaocong Xu","authors":"Shaocong Xu, Xiaoxue Chen, Yuhang Zheng, Guyue Zhou, Yurong Chen,\n  Hongbin Zha and Hao Zhao","title":"ECT: Fine-grained Edge Detection with Learned Cause Tokens","comments":"code available at https://github.com/Daniellli/ECT.git","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 tackle the challenging fine-grained edge detection task,\nwhich refers to predicting specific edges caused by reflectance, illumination,\nnormal, and depth changes, respectively. Prior methods exploit multi-scale\nconvolutional networks, which are limited in three aspects: (1) Convolutions\nare local operators while identifying the cause of edge formation requires\nlooking at far away pixels. (2) Priors specific to edge cause are fixed in\nprediction heads. (3) Using separate networks for generic and fine-grained edge\ndetection, and the constraint between them may be violated. To address these\nthree issues, we propose a two-stage transformer-based network sequentially\npredicting generic edges and fine-grained edges, which has a global receptive\nfield thanks to the attention mechanism. The prior knowledge of edge causes is\nformulated as four learnable cause tokens in a cause-aware decoder design.\nFurthermore, to encourage the consistency between generic edges and\nfine-grained edges, an edge aggregation and alignment loss is exploited. We\nevaluate our method on the public benchmark BSDS-RIND and several newly derived\nbenchmarks, and achieve new state-of-the-art results. Our code, data, and\nmodels are publicly available at https://github.com/Daniellli/ECT.git.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 11:37:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Shaocong",""],["Chen","Xiaoxue",""],["Zheng","Yuhang",""],["Zhou","Guyue",""],["Chen","Yurong",""],["Zha","Hongbin",""],["Zhao","Hao",""]]}
{"id":"2308.03093","submitter":"Yuuki Sugiyama","authors":"Yuuki Sugiyama, Akira Matsumura, and Kazuhiro Yamamoto","title":"Quantum uncertainty of gravitational field and entanglement in\n  superposed massive particles","comments":"15pages, 5 figures","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":"  Investigating the quantum nature of gravity is an important issue in modern\nphysics. Recently, studies pertaining to the quantum superposition of\ngravitational potential have garnered significant interest. Inspired by Mari\n\\textit{et al.} [Sci. Rep. {\\bf 6} 22777 (2016)] and Baym and Ozawa [Proc.\nNatl. Acad. Sci. U.S.A. {\\bf 106}, 3035 (2009)], Belenchia \\textit{et al.}\n[Phys. Rev. D {\\bf 98}, 126009 (2018)] considered a gedanken experiment\ninvolving such a quantum superposition and mentioned that the superposition\nrenders causality and complementarity inconsistent. They resolved this\ninconsistency by considering the quantized dynamical degrees of freedom of\ngravity. This suggests a strong relationship between the quantum superposition\nof the gravitational potential and the quantization of the gravitational field.\nIn our previous study [Phys. Rev. D {\\bf 106}, 125002 (2022)], we have shown\nthat the quantum uncertainty of a field guarantees the consistency between\ncausality and complementarity. In this study, we focus on the entanglement\nbetween two particles' states due to the electromagnetic/gravitational\npotential and investigate its relationship with quantum uncertainty, causality,\nand complementarity. Our numerical analyses show that the quantum uncertainty\nof the electromagnetic/gravitational field results in vacuum fluctuations and\nprohibits the entanglement between two particles' states when causality is\nsatisfied. We further demonstrate that complementarity holds when the particles\ndo not get entangled. The uncertainty relation does not cause the entanglement\nbetween two particles' states, which guarantees complementarity.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 11:45:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sugiyama","Yuuki",""],["Matsumura","Akira",""],["Yamamoto","Kazuhiro",""]]}
{"id":"2308.03094","submitter":"Yibei Wang","authors":"Yibei Wang, Yalan Wang, Hongyi Wang, Xiaotong Liu, Hong Chen, Jin\n  Zhang, Dongyu Li, Dangwei Wang and Anle Wang","title":"A reconfigurable multiple-format coherent-dual-band signal generator\n  based on a single optoelectronic oscillation cavity","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An optoelectronic oscillation method with reconfigurable multiple formats for\nsimultaneous generation of coherent dual-band signals is proposed and\nexperimentally demonstrated. By introducing a compatible filtering mechanism\nbased on stimulated Brillouin scattering (SBS) effect into a typical\nPhase-shifted grating Bragg fiber (PS-FBG) notch filtering cavity, dual\nmode-selection mechanisms which have independent frequency and time tuning\nmechanism can be constructed. By regulating three controllers, the proposed\nscheme can work in different states, named mode 1, mode 2 and mode 3. At mode 1\nstate, a dual single-frequency hopping signals is achieved with 50 ns hopping\nspeed and flexible central frequency and pulse duration ratio. The mode 2 state\nis realized by applying the Fourier domain mode-locked (FDML) technology into\nthe proposed optoelectrical oscillator, in which dual coherent pulsed\nsingle-frequency signal and broadband signal is generated simultaneously. The\nadjustability of the time duration of the single-frequency signal and the\nbandwidth of the broadband signal are shown and discussed. The mode 3 state is\na dual broadband signal generator which is realized by injecting a triangular\nwave into the signal laser. The detection performance of the generated\nbroadband signals has also been evaluated by the pulse compression and the\nphase noise figure. The proposed method may provide a multifunctional radar\nsystem signal generator based on the simply external controllers, which can\nrealize low-phase-noise or multifunctional detection with high resolution\nimaging ability, especially in a complex interference environment.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:05:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Yibei",""],["Wang","Yalan",""],["Wang","Hongyi",""],["Liu","Xiaotong",""],["Chen","Hong",""],["Zhang","Jin",""],["Li","Dongyu",""],["Wang","Dangwei",""],["Wang","Anle",""]]}
{"id":"2308.03095","submitter":"Alberto Racca","authors":"Alberto Racca and Luca Magri","title":"Control-aware echo state networks (Ca-ESN) for the suppression of\n  extreme events","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG nlin.CD physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extreme event are sudden large-amplitude changes in the state or observables\nof chaotic nonlinear systems, which characterize many scientific phenomena.\nBecause of their violent nature, extreme events typically have adverse\nconsequences, which call for methods to prevent the events from happening. In\nthis work, we introduce the control-aware echo state network (Ca-ESN) to\nseamlessly combine ESNs and control strategies, such as\nproportional-integral-derivative and model predictive control, to suppress\nextreme events. The methodology is showcased on a chaotic-turbulent flow, in\nwhich we reduce the occurrence of extreme events with respect to traditional\nmethods by two orders of magnitude. This works opens up new possibilities for\nthe efficient control of nonlinear systems with neural networks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:22:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Racca","Alberto",""],["Magri","Luca",""]]}
{"id":"2308.03096","submitter":"Neophytos Charalambides Mr","authors":"Neophytos Charalambides, Mert Pilanci, Alfred Hero","title":"Gradient Coding through Iterative Block Leverage Score Sampling","comments":"26 pages, 6 figures, 1 table,","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.DC cs.IR cs.LG cs.NA math.IT math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the leverage score sampling sketch for $\\ell_2$-subspace\nembeddings, to accommodate sampling subsets of the transformed data, so that\nthe sketching approach is appropriate for distributed settings. This is then\nused to derive an approximate coded computing approach for first-order methods;\nknown as gradient coding, to accelerate linear regression in the presence of\nfailures in distributed computational networks, \\textit{i.e.} stragglers. We\nreplicate the data across the distributed network, to attain the approximation\nguarantees through the induced sampling distribution. The significance and main\ncontribution of this work, is that it unifies randomized numerical linear\nalgebra with approximate coded computing, while attaining an induced\n$\\ell_2$-subspace embedding through uniform sampling. The transition to uniform\nsampling is done without applying a random projection, as in the case of the\nsubsampled randomized Hadamard transform. Furthermore, by incorporating this\ntechnique to coded computing, our scheme is an iterative sketching approach to\napproximately solving linear regression. We also propose weighting when\nsketching takes place through sampling with replacement, for further\ncompression.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:22:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Charalambides","Neophytos",""],["Pilanci","Mert",""],["Hero","Alfred",""]]}
{"id":"2308.03097","submitter":"Yinsong Xu","authors":"Yinsong Xu, Aidong Men, Yang Liu, Qingchao Chen","title":"Incorporating Pre-training Data Matters in Unsupervised Domain\n  Adaptation","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 adaptation(UDA) and Source-free UDA(SFUDA) methods\nformulate the problem involving two domains: source and target. They typically\nemploy a standard training approach that begins with models pre-trained on\nlarge-scale datasets e.g., ImageNet, while rarely discussing its effect.\nRecognizing this gap, we investigate the following research questions: (1) What\nis the correlation among ImageNet, the source, and the target domain? (2) How\ndoes pre-training on ImageNet influence the target risk? To answer the first\nquestion, we empirically observed an interesting Spontaneous Pulling (SP)\nEffect in fine-tuning where the discrepancies between any two of the three\ndomains (ImageNet, Source, Target) decrease but at the cost of the impaired\nsemantic structure of the pre-train domain. For the second question, we put\nforward a theory to explain SP and quantify that the target risk is bound by\ngradient disparities among the three domains. Our observations reveal a key\nlimitation of existing methods: it hinders the adaptation performance if the\nsemantic cluster structure of the pre-train dataset (i.e.ImageNet) is impaired.\nTo address it, we incorporate ImageNet as the third domain and redefine the\nUDA/SFUDA as a three-player game. Specifically, inspired by the theory and\nempirical findings, we present a novel framework termed TriDA which\nadditionally preserves the semantic structure of the pre-train dataset during\nfine-tuning. Experimental results demonstrate that it achieves state-of-the-art\nperformance across various UDA and SFUDA benchmarks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:23:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Yinsong",""],["Men","Aidong",""],["Liu","Yang",""],["Chen","Qingchao",""]]}
{"id":"2308.03098","submitter":"Ye Liu","authors":"Ye Liu, Stefan Ultes, Wolfgang Minker and Wolfgang Maier","title":"System-Initiated Transitions from Chit-Chat to Task-Oriented Dialogues\n  with Transition Info Extractor and Transition Sentence Generator","comments":"accepted by INLG 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we study dialogue scenarios that start from chit-chat but\neventually switch to task-related services, and investigate how a unified\ndialogue model, which can engage in both chit-chat and task-oriented dialogues,\ntakes the initiative during the dialogue mode transition from chit-chat to\ntask-oriented in a coherent and cooperative manner. We firstly build a\n{transition info extractor} (TIE) that keeps track of the preceding chit-chat\ninteraction and detects the potential user intention to switch to a\ntask-oriented service. Meanwhile, in the unified model, a {transition sentence\ngenerator} (TSG) is extended through efficient Adapter tuning and transition\nprompt learning. When the TIE successfully finds task-related information from\nthe preceding chit-chat, such as a transition domain, then the TSG is activated\nautomatically in the unified model to initiate this transition by generating a\ntransition sentence under the guidance of transition information extracted by\nTIE. The experimental results show promising performance regarding the\nproactive transitions. We achieve an additional large improvement on TIE model\nby utilizing Conditional Random Fields (CRF). The TSG can flexibly generate\ntransition sentences while maintaining the unified capabilities of normal\nchit-chat and task-oriented response generation.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:25:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Ye",""],["Ultes","Stefan",""],["Minker","Wolfgang",""],["Maier","Wolfgang",""]]}
{"id":"2308.03099","submitter":"Yuta Koreeda","authors":"Yuta Koreeda, Terufumi Morishita, Osamu Imaichi, Yasuhiro Sogawa","title":"LARCH: Large Language Model-based Automatic Readme Creation with\n  Heuristics","comments":"This is a pre-print of a paper accepted at CIKM'23 Demo. Refer to the\n  DOI URL for the original publication","journal-ref":"In Proceedings of the 32nd ACM International Conference on\n  Information and Knowledge Management, October 21-25, 2023, Birmingham, United\n  Kingdom. ACM, New York, NY, USA, 5 pages","doi":"10.1145/3583780.3614744","report-no":null,"categories":"cs.CL cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Writing a readme is a crucial aspect of software development as it plays a\nvital role in managing and reusing program code. Though it is a pain point for\nmany developers, automatically creating one remains a challenge even with the\nrecent advancements in large language models (LLMs), because it requires\ngenerating an abstract description from thousands of lines of code. In this\ndemo paper, we show that LLMs are capable of generating a coherent and\nfactually correct readmes if we can identify a code fragment that is\nrepresentative of the repository. Building upon this finding, we developed\nLARCH (LLM-based Automatic Readme Creation with Heuristics) which leverages\nrepresentative code identification with heuristics and weak supervision.\nThrough human and automated evaluations, we illustrate that LARCH can generate\ncoherent and factually correct readmes in the majority of cases, outperforming\na baseline that does not rely on representative code identification. We have\nmade LARCH open-source and provided a cross-platform Visual Studio Code\ninterface and command-line interface, accessible at\nhttps://github.com/hitachi-nlp/larch. A demo video showcasing LARCH's\ncapabilities is available at https://youtu.be/ZUKkh5ED-O4.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:28:24 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 09:48:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Koreeda","Yuta",""],["Morishita","Terufumi",""],["Imaichi","Osamu",""],["Sogawa","Yasuhiro",""]]}
{"id":"2308.03100","submitter":"Fr\\'ed\\'eric Ouimet","authors":"Christian Genest, Fr\\'ed\\'eric Ouimet","title":"Asymptotic comparison of negative multinomial and multivariate normal\n  experiments","comments":"12 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.CO stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This note presents a refined local approximation for the logarithm of the\nratio between the negative multinomial probability mass function and a\nmultivariate normal density, both having the same mean-covariance structure.\nThis approximation, which is derived using Stirling's formula and a meticulous\ntreatment of Taylor expansions, yields an upper bound on the Hellinger distance\nbetween the jittered negative multinomial distribution and the corresponding\nmultivariate normal distribution. Upper bounds on the Le Cam distance between\nnegative multinomial and multivariate normal experiments ensue.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:36:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Genest","Christian",""],["Ouimet","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.03101","submitter":"Miaomiao Ren","authors":"Yanan Wu, Miaomiao Ren, Xianzhong Zhao","title":"The additively idempotent semiring $S_7^0$ is nonfinitely based","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the additively idempotent semiring $S_7^0$ has no finite basis\nfor its equational theory. This answers an open problem posed by Jackson et al.\n(J. Algebra 611 (2022), 211--245).\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:38:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Yanan",""],["Ren","Miaomiao",""],["Zhao","Xianzhong",""]]}
{"id":"2308.03102","submitter":"Maximilian McGuinness Mr","authors":"Max McGuinness","title":"Learning-Rate-Free Learning: Dissecting D-Adaptation and Probabilistic\n  Line Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper explores two recent methods for learning rate optimisation in\nstochastic gradient descent: D-Adaptation (arXiv:2301.07733) and probabilistic\nline search (arXiv:1502.02846). These approaches aim to alleviate the burden of\nselecting an initial learning rate by incorporating distance metrics and\nGaussian process posterior estimates, respectively. In this report, I provide\nan intuitive overview of both methods, discuss their shared design goals, and\ndevise scope for merging the two algorithms.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:40:17 GMT"}],"update_date":"2023-08-08","authors_parsed":[["McGuinness","Max",""]]}
{"id":"2308.03103","submitter":"Aleksander Wawer","authors":"Roman Du\\v{s}ek, Aleksander Wawer, Christopher Galias, Lidia\n  Wojciechowska","title":"Improving Domain-Specific Retrieval by NLI Fine-Tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The aim of this article is to investigate the fine-tuning potential of\nnatural language inference (NLI) data to improve information retrieval and\nranking. We demonstrate this for both English and Polish languages, using data\nfrom one of the largest Polish e-commerce sites and selected open-domain\ndatasets. We employ both monolingual and multilingual sentence encoders\nfine-tuned by a supervised method utilizing contrastive loss and NLI data. Our\nresults point to the fact that NLI fine-tuning increases the performance of the\nmodels in both tasks and both languages, with the potential to improve mono-\nand multilingual models. Finally, we investigate uniformity and alignment of\nthe embeddings to explain the effect of NLI-based fine-tuning for an\nout-of-domain use-case.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 12:40:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Du\u0161ek","Roman",""],["Wawer","Aleksander",""],["Galias","Christopher",""],["Wojciechowska","Lidia",""]]}
{"id":"2308.03104","submitter":"Mohammad Nouri-Zonoz","authors":"H. Sadegh, E. Kiani and M. Nouri-Zonoz","title":"Embedding diagrams in stationary spacetimes","comments":"15 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We find the embedding diagrams in stationary spacetimes including NUT, pure\nNUT and Kerr spacetimes as well as in the Reissner-N\\\"{o}rdstrom spacetime\nwhich is a static two parameter solution. In the case of pure NUT and\nReissner-N\\\"{o}rdstrom spacetimes, the embedding equations are solved in terms\nof the elliptic integrals. In other cases we obtain the embedding diagrams by\nnumerical integration of the corresponding embedding equations. These embedding\ndiagrams are then compared through their Gaussian and mean curvatures, and the\neffect of different parameters on their asymptotic behavior is also discussed.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:05:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sadegh","H.",""],["Kiani","E.",""],["Nouri-Zonoz","M.",""]]}
{"id":"2308.03105","submitter":"Ilia Grishmanovskii","authors":"Ilia Grishmanovskii, Olga Soloveva, Taesoo Song, Carsten Greiner and\n  Elena Bratkovskaya","title":"Inelastic and elastic parton scatterings in the strongly interacting\n  quark-gluon plasma","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate the role of inelastic processes in the strongly interacting\nquark-gluon plasma (sQGP) based on the effective dynamical quasi-particle model\n(DQPM). In the DQPM the non-perturbative properties of the sQGP at finite\ntemperature $T$ and baryon chemical potential $\\mu_B$ are described in terms of\nstrongly interacting off-shell partons (quarks and gluons) with dynamically\ngenerated spectral functions whose properties are adjusted to reproduce the\nlQCD EoS for the QGP in thermodynamic equilibrium. For the first time the\nmassive gluon radiation processes from the off-shell quark-quark ($q+q$) and\nquark-gluon ($q+g$) scatterings are calculated explicitly within leading order\nFeynman diagrams with effective propagators and vertices from the DQPM without\nany further approximations. We present the results for the energy and\ntemperature dependencies of the total and differential radiative cross sections\nand compare them to the corresponding elastic cross sections. We show that our\nresults reproduce the pQCD calculations in the limit of zero masses and widths\nof quasiparticles. Also we study the $\\mu_B$ dependence of the inelastic cross\nsections. Moreover, we present estimates for the transition rate and relaxation\ntime of radiative versus elastic scatterings in the sQGP.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:06:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Grishmanovskii","Ilia",""],["Soloveva","Olga",""],["Song","Taesoo",""],["Greiner","Carsten",""],["Bratkovskaya","Elena",""]]}
{"id":"2308.03106","submitter":"Eugene Vasiliev O","authors":"Evgenii O. Vasiliev, Yuri A. Shchekinov","title":"Dust evolution in a supernova interacting with the ISM","comments":"11 pages, 11 figures, 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":"  Supernovae (SN) explosions are thought to be an important source of dust in\ngalaxies. At the same time strong shocks from SNe are known as an efficient\nmechanism of dust destruction via thermal and kinetic sputtering. A critically\nimportant question of how these two hypotheses of SNe activity control the dust\nbudget in galaxies is still not quite clearly understood. In this paper we\naddress this question within 3D multi-fluid hydrodynamical simulations,\ntreating separately the SNe injected dust and the dust pre-exicted in ambient\ninterstellar gas. We focus primarily on how the injected and pre-existed dust\nare destroyed by shock waves and the hot gas in the SN bubble depending of the\ndensity of ambient gas. Within our model we estimate an upper limit of the\nSN-produced dust mass which can be supplied into interstellar medium. For a SN\nprogenitor mass of 30 $M_\\odot$ and the ejected dust mass $M_d=1~M_\\odot$ we\nconstrain the dust mass that can delivered into the ISM as $\\geq 0.13~M_\\odot$\nprovided the injected dust particles are large $a\\geq 0.1~\\mu$m.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:15:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vasiliev","Evgenii O.",""],["Shchekinov","Yuri A.",""]]}
{"id":"2308.03107","submitter":"Ruoling Peng","authors":"Ruoling Peng, Kang Liu, Po Yang, Zhipeng Yuan, Shunbao Li","title":"Embedding-based Retrieval with LLM for Effective Agriculture Information\n  Extracting from Unstructured Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pest identification is a crucial aspect of pest control in agriculture.\nHowever, most farmers are not capable of accurately identifying pests in the\nfield, and there is a limited number of structured data sources available for\nrapid querying. In this work, we explored using domain-agnostic general\npre-trained large language model(LLM) to extract structured data from\nagricultural documents with minimal or no human intervention. We propose a\nmethodology that involves text retrieval and filtering using embedding-based\nretrieval, followed by LLM question-answering to automatically extract entities\nand attributes from the documents, and transform them into structured data. In\ncomparison to existing methods, our approach achieves consistently better\naccuracy in the benchmark while maintaining efficiency.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:18:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Peng","Ruoling",""],["Liu","Kang",""],["Yang","Po",""],["Yuan","Zhipeng",""],["Li","Shunbao",""]]}
{"id":"2308.03108","submitter":"Amira Guesmi","authors":"Amira Guesmi, Muhammad Abdullah Hanif, Bassem Ouni, Muhammad Shafique","title":"SAAM: Stealthy Adversarial Attack on Monoculor Depth Estimation","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":"  In this paper, we investigate the vulnerability of MDE to adversarial\npatches. We propose a novel \\underline{S}tealthy \\underline{A}dversarial\n\\underline{A}ttacks on \\underline{M}DE (SAAM) that compromises MDE by either\ncorrupting the estimated distance or causing an object to seamlessly blend into\nits surroundings. Our experiments, demonstrate that the designed stealthy patch\nsuccessfully causes a DNN-based MDE to misestimate the depth of objects. In\nfact, our proposed adversarial patch achieves a significant 60\\% depth error\nwith 99\\% ratio of the affected region. Importantly, despite its adversarial\nnature, the patch maintains a naturalistic appearance, making it inconspicuous\nto human observers. We believe that this work sheds light on the threat of\nadversarial attacks in the context of MDE on edge devices. We hope it raises\nawareness within the community about the potential real-life harm of such\nattacks and encourages further research into developing more robust and\nadaptive defense mechanisms.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:29:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guesmi","Amira",""],["Hanif","Muhammad Abdullah",""],["Ouni","Bassem",""],["Shafique","Muhammad",""]]}
{"id":"2308.03109","submitter":"Rangeet Pan","authors":"Rangeet Pan, Ali Reza Ibrahimzada, Rahul Krishna, Divya Sankar,\n  Lambert Pouguem Wassi, Michele Merler, Boris Sobolev, Raju Pavuluri, Saurabh\n  Sinha, Reyhaneh Jabbarvand","title":"Understanding the Effectiveness of Large Language Models in Code\n  Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Code translation aims to convert source code from one programming language\n(PL) to another. Given the promising abilities of large language models (LLMs)\nin code synthesis, researchers are actively exploring their potential to\nautomate code translation, i.e., generating code in target PL from its\nequivalent in another PL. The pre-requisite for advancing the state of\nLLM-based code translation is to understand their limitations. To that end, we\npresent a large-scale empirical study to investigate the ability of LLMs,\nincluding general LLMs and code LLMs, for code translation across pairs of\ndifferent languages, including C, C++, Go, Java, and Python. Our analysis\ninvolves the translation of 1,700 code samples from three distinct benchmarks\nand real-world projects, revealing LLMs are yet to be reliably used to automate\ncode translation -- with incorrect translations ranging from 52.7% to 97.9%\nacross the studied LLMs. Further manual investigation of unsuccessful\ntranslations among all PLs identifies 14 root causes for translation bugs.\nBased on the insights from the empirical study, we propose a prompt-crafting\napproach to provide additional context for LLMs, improving the performance of\nLLM-based code translation by 5.5% on average across different PLs, LLMs, and\nbenchmarks. Our study is the first of its kind, in terms of its scale and\nbreadth, that provides insights into the current limitations of LLMs in code\ntranslation and opportunities for improving them. Our collected extensive\ndataset -- consisting of 1,700 code samples written in five PLs with 10K+\ntests, 43K+ translated code, 1,725 manually labeled bugs, and 1,365 bug-fix\npairs generated using LLMs -- can help drive research in this area.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:33:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pan","Rangeet",""],["Ibrahimzada","Ali Reza",""],["Krishna","Rahul",""],["Sankar","Divya",""],["Wassi","Lambert Pouguem",""],["Merler","Michele",""],["Sobolev","Boris",""],["Pavuluri","Raju",""],["Sinha","Saurabh",""],["Jabbarvand","Reyhaneh",""]]}
{"id":"2308.03110","submitter":"Kaizhen Guo","authors":"Kaizhen Guo, Yuan Li and Shuang Jia","title":"Ferromagnetic half levitation of LK-99-like synthetic samples","comments":"10 pages, 10 figures","journal-ref":"SCIENCE CHINA Physics, Mechanics & Astronomy , Volume 66, Issue\n  10: 107411 (2023)","doi":"10.1007/s11433-023-2201-9","report-no":"SCPMA-2023-0458","categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We successfully synthesized polycrystalline LK-99-like ceramic samples with a\nsolid-state-sintering method. Powder X-ray diffraction shows that the main\ncontents are $\\mathrm{Pb_{10-x}Cu_x(PO_4)_6O}$ and $\\mathrm{Cu_2S}$, consistent\nwith recent reports [arXiv:2307.12037; arXiv:2308.01192]. In some small flaky\nfragments, we successfully observed ``half levitation'' atop a\n$\\mathrm{Nd_2Fe_{14}B}$ magnet. Using magnetization measurements on such small\npieces, as well as on a large piece which does not exhibit the half levitation,\nwe show that the samples ubiquitously contain weak yet definitive soft\nferromagnetic components. We argue that, together with the pronounced shape\nanisotropy of the small fragments, the soft ferromagnetism is sufficient to\nexplain the observed half levitation in strong vertical magnetic fields. Our\nmeasurements do not indicate the presence of the Meissner effect, nor zero\nresistance, in our samples, leading us to believe that our samples do not\nexhibit superconductivity. The precise chemical composition and the physics\nbehind the ferromagnetic component remain outstanding questions to be addressed\nin future research.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:34:28 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 08:12:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Guo","Kaizhen",""],["Li","Yuan",""],["Jia","Shuang",""]]}
{"id":"2308.03111","submitter":"Jia Zhang","authors":"Fanxing Zheng, Jianting Dong, Xinlu Li, Meng Zhu, Ye Zhou, and Jia\n  Zhang","title":"Anatomy of spin Hall effect in ferromagnetic metals","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":"  The spin Hall effect in nonmagnetic materials has been intensively studied\nand became one of the most crucial spin-charge conversion mechanism in\nspintronics. However, the spin Hall effect in ferromagnetic metals has been\nless investigated and remains unclear. In this work, we investigate the spin\nHall effect in representative ferromagnetic alloy by using first-principles\ncalculations. We first clarify the spin Hall effect into three different types\nincluding conventional (CSHE), spin anomalous (SAHE) and magnetic spin Hall\neffect (MSHE) and then calculate the corresponding spin Hall conductivity and\nspin Hall angle for (Fe, Co, Ni)Pt, NiFe and CoFe alloy. We find the above\nthree spin Hall mechanisms do coexist in ferromagnetic metals. Particularly,\nfor Pt-based ferromagnetic alloy, a sizable conventional and magnetic spin Hall\nangles comparable to that of Pt have been predicted. The remarkable\nunconventional spin Hall effect in ferromagnetic metal may enrich the\nspin-charge conversion phenomena. For instance, the spin current generated by\nremarkable MSHE with out-of-plane spin-polarization should be helpful for\nfield-free switching of perpendicular magnetization through spin-orbit torque\neffect. This work may stimulate future studies on the spin Hall effect in\nferromagnetic metals and pave their promising applications for spin-charge\nconversion devices in spintronics.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:34:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zheng","Fanxing",""],["Dong","Jianting",""],["Li","Xinlu",""],["Zhu","Meng",""],["Zhou","Ye",""],["Zhang","Jia",""]]}
{"id":"2308.03112","submitter":"Yiran Wang","authors":"Yiran Wang","title":"A clever neural network in solving inverse problems of Schr\\\"{o}dinger\n  equation","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we solve inverse problems of nonlinear Schr\\\"{o}dinger\nequations that can be formulated as a learning process of a special\nconvolutional neural network. Instead of attempting to approximate functions in\nthe inverse problems, we embed a library as a low dimensional manifold in the\nnetwork such that unknowns can be reduced to some scalars. The nonlinear\nSchr\\\"{o}dinger equation (NLSE) is $i\\frac{\\partial \\psi}{\\partial\nt}-\\beta\\frac{\\partial^2 \\psi}{\\partial x^2}+\\gamma|\\psi|^2\\psi+V(x)\\psi=0,$\nwhere the wave function $\\psi(x,t)$ is the solution to the forward problem and\nthe potential $V(x)$ is the quantity of interest of the inverse problem. The\nmain contributions of this work come from two aspects. First, we construct a\nspecial neural network directly from the Schr\\\"{o}dinger equation, which is\nmotivated by a splitting method. The physics behind the construction enhances\nexplainability of the neural network. The other part is using a library-search\nalgorithm to project the solution space of the inverse problem to a\nlower-dimensional space. The way to seek the solution in a reduced\napproximation space can be traced back to the compressed sensing theory. The\nmotivation of this part is to alleviate the training burden in estimating\nfunctions. Instead, with a well-chosen library, one can greatly simplify the\ntraining process. A brief analysis is given, which focuses on well-possedness\nof some mentioned inverse problems and convergence of the neural network\napproximation. To show the effectiveness of the proposed method, we explore in\nsome representative problems including simple equations and a couple equation.\nThe results can well verify the theory part. In the future, we can further\nexplore manifold learning to enhance the approximation effect of the\nlibrary-search algorithm.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:36:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Yiran",""]]}
{"id":"2308.03113","submitter":"Fan Liu","authors":"Fan Liu, Huilin Chen, Zhiyong Cheng, Liqiang Nie and Mohan Kankanhalli","title":"Semantic-Guided Feature Distillation for Multimodal Recommendation","comments":"ACM Multimedia 2023 Accepted","journal-ref":"In Proceedings of the 31st ACM International Conference on\n  Multimedia (MM '23), 2023","doi":null,"report-no":null,"categories":"cs.IR cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal recommendation exploits the rich multimodal information associated\nwith users or items to enhance the representation learning for better\nperformance. In these methods, end-to-end feature extractors (e.g.,\nshallow/deep neural networks) are often adopted to tailor the generic\nmultimodal features that are extracted from raw data by pre-trained models for\nrecommendation. However, compact extractors, such as shallow neural networks,\nmay find it challenging to extract effective information from complex and\nhigh-dimensional generic modality features. Conversely, DNN-based extractors\nmay encounter the data sparsity problem in recommendation. To address this\nproblem, we propose a novel model-agnostic approach called Semantic-guided\nFeature Distillation (SGFD), which employs a teacher-student framework to\nextract feature for multimodal recommendation. The teacher model first extracts\nrich modality features from the generic modality feature by considering both\nthe semantic information of items and the complementary information of multiple\nmodalities. SGFD then utilizes response-based and feature-based distillation\nloss to effectively transfer the knowledge encoded in the teacher model to the\nstudent model. To evaluate the effectiveness of our SGFD, we integrate SGFD\ninto three backbone multimodal recommendation models. Extensive experiments on\nthree public real-world datasets demonstrate that SGFD-enhanced models can\nachieve substantial improvement over their counterparts.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:39:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Fan",""],["Chen","Huilin",""],["Cheng","Zhiyong",""],["Nie","Liqiang",""],["Kankanhalli","Mohan",""]]}
{"id":"2308.03114","submitter":"Zhi-Qing Zhang","authors":"Zhi-Jie Sun, Si-Yang Wang, Zhi-Qing Zhang, You-Ya Yang and Zi-Yu Zhang","title":"Semileptonic $B_{c}$ meson decays to S-wave charmonia and $X(3872)$\n  within the covariant light-front approach","comments":"23 pages, 4 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 work, we investigate the semileptonic decays of $B_{c}$ meson to\n$\\eta_{c}(1S,2S,3S)$, $\\psi(1S,2S,3S)$ and $X(3872)$ within the framework of\ncovariant light-front quark model (CLFQM). We combine the helicity amplitudes\nvia the corresponding form factors to obtain the branching ratios of the\nsemileptonic decays $B_{c}\\to \\eta_{c}(1S, 2S, 3S)\\ell\\nu_{\\ell}$, $B_{c}\\to\n\\psi(1S, 2S, 3S))\\ell\\nu_{\\ell}$ and $B_{c}\\to X(3872)\\ell\\nu_{\\ell}$ with\n$\\ell=e,\\mu,\\tau$. In view of the $R_{J/\\Psi}$ anomaly released by the LHCb\ncollaboration, it is necessary to calculate the ratios $R_X$ with\n$X=\\psi(1S,2S,3S),\\eta_c(1S,2S,3S),X(3872)$ systematically, which are helpful\nto check the lepton flavor universality (LFU). Furthermore, we also take into\naccount another two physical observables, one is the longitudinal polarization\nfraction $f_{L}$ and the other is the forward-backward asymmetry $A_{FB}$,\nwhich can provide new clues to understand the $R_{J /\\Psi}$ anomaly. Such\ntheoretical predictions are necessary and interesting, which can be tested in\nthe future LHCb experiments.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:42:06 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 09:51:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sun","Zhi-Jie",""],["Wang","Si-Yang",""],["Zhang","Zhi-Qing",""],["Yang","You-Ya",""],["Zhang","Zi-Yu",""]]}
{"id":"2308.03115","submitter":"Zuoqin Wang","authors":"Xiang He, Zuoqin Wang","title":"Riemannian metrics with prescribed volume and finite parts of Dirichlet\n  spectrum","comments":null,"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 study the problem of prescribing Dirichlet eigenvalues on an\narbitrary compact manifold $M$ of dimension $n\\geq 3$ with a non-empty smooth\nboundary $\\partial M$. We show that for any finite increasing sequence of real\nnumbers $0<a_1<a_2 \\leq a_3 \\leq \\cdots \\leq a_N$ and any positive number $V$,\nthere exists a Riemannian metric $g$ on $M$ such that $\\mathrm{Vol}(M,g)=V$ and\n$\\lambda^\\mathcal{D}_k(M,g)=a_k$ for any integer $1 \\leq k \\leq N$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:43:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["He","Xiang",""],["Wang","Zuoqin",""]]}
{"id":"2308.03116","submitter":"Xiao-Dan Cui","authors":"Xiao-Dan Cui and C. L. Liu","title":"Closed expressions for one-qubit states of convex roof coherence\n  measures","comments":"7 pages, 2 figures","journal-ref":"J. Phys. A: Math. Theor. 56, 345301 (2023)","doi":"10.1088/1751-8121/ace749","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the closed expressions of the convex roof coherence measures for\none-qubit states in this paper. We present the analytical expressions for the\nconvex roof coherence measures, $C_f(\\rho)$, of one-qubit states with\n$C_f(\\varphi):=f(\\abs{c_0}^2,\\abs{c_1}^2)$ (where\n$\\ket{\\varphi}=c_0\\ket{0}+c_1\\ket{1}$) being convex with respect to the $l_1$\nnorm of coherence of $\\varphi$ (i.e., $C_{l_1}(\\varphi)$), such coherence\nmeasures including the coherence of formation, the geometric measure of\ncoherence, the coherence concurrence, and the coherence rank. We further\npresent the operational interpretations of these measures. Finally, we present\nthe usefulness of the convex roof coherence measures $C_f(\\varphi)$ being\nnon-convex with respect to $C_{l_1}(\\varphi)$ by giving the necessary and\nsufficient conditions for the transformations\n$p\\varphi_1\\oplus(1-p)\\varphi_2\\to q\\phi_1\\oplus(1-q)\\phi_2$ via incoherent\noperations, where $\\varphi_i$, $\\phi_j$ $(i, j=1, 2)$ are one-qubit pure states\nand $0\\leq p, q\\leq 1$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:51:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cui","Xiao-Dan",""],["Liu","C. L.",""]]}
{"id":"2308.03117","submitter":"Mathieu Ravaut","authors":"Mathieu Ravaut, Hailin Chen, Ruochen Zhao, Chengwei Qin, Shafiq Joty,\n  Nancy Chen","title":"PromptSum: Parameter-Efficient Controllable Abstractive Summarization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Prompt tuning (PT), a parameter-efficient technique that only tunes the\nadditional prompt embeddings while keeping the backbone pre-trained language\nmodel (PLM) frozen, has shown promising results in language understanding\ntasks, especially in low-resource scenarios. However, effective prompt design\nmethods suitable for generation tasks such as summarization are still lacking.\nAt the same time, summarization guided through instructions (discrete prompts)\ncan achieve a desirable double objective of high quality and controllability in\nsummary generation. Towards a goal of strong summarization performance under\nthe triple conditions of parameter-efficiency, data-efficiency, and\ncontrollability, we introduce PromptSum, a method combining PT with a\nmulti-task objective and discrete entity prompts for abstractive summarization.\nOur model achieves competitive ROUGE results on popular abstractive\nsummarization benchmarks coupled with a strong level of controllability through\nentities, all while only tuning several orders of magnitude less parameters.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:54:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ravaut","Mathieu",""],["Chen","Hailin",""],["Zhao","Ruochen",""],["Qin","Chengwei",""],["Joty","Shafiq",""],["Chen","Nancy",""]]}
{"id":"2308.03118","submitter":"Matthew John Sino Cruz","authors":"Matthew John F. Sino Cruz, Kim Eric B. Nanlabi, and Michael Ryan C.\n  Peoro","title":"Level of Awareness of PSU Bayambang Campus Students towards E learning\n  Technologies","comments":"published in International Journal of Computing Sciences Research","journal-ref":"Journal of Computing Sciences Research. 3(2)(2019) 199-220","doi":"10.25147/ijcsr.2017.001.1.33","report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study assesses the awareness of PSU Bayambang Campus students regarding\ne-learning technologies. A Quantitative Research Approach was used, gathering\ndata through a demographic questionnaire and ICT Resources assessment. The\nsurvey measured students' familiarity and knowledge of existing e-learning\ntechnologies. Around 52.50% of respondents were familiar with e learning\nconcepts, but their exposure and utilization levels need consideration.\nTechnology, Support, and Users were identified as key factors influencing\nstudent awareness. Implementation can be improved through policies and resource\nprovision. The researchers recommend integrating e learning policies, providing\nICT Resources and Infrastructure, and offering training for students and\nteachers. This research serves as a guide for policy design, enhancing the\nUniversity's learning process and facilitating better learning and interaction.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:54:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cruz","Matthew John F. Sino",""],["Nanlabi","Kim Eric B.",""],["Peoro","Michael Ryan C.",""]]}
{"id":"2308.03119","submitter":"Piotr Sowinski","authors":"Piotr Sowinski, Ignacio Lacalle, Rafael Vano, Carlos E. Palau","title":"Autonomous Choreography of WebAssembly Workloads in the Federated\n  Cloud-Edge-IoT Continuum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The concept of the federated Cloud-Edge-IoT continuum promises to alleviate\nmany woes of current systems, improving resource use, energy efficiency,\nquality of service, and more. However, this continuum is still far from being\nrealized in practice, with no comprehensive solutions for developing,\ndeploying, and managing continuum-native applications. Breakthrough innovations\nand novel system architectures are needed to cope with the ever-increasing\nheterogeneity and the multi-stakeholder nature of computing resources. This\nwork proposes a novel architecture for choreographing workloads in the\ncontinuum, attempting to address these challenges. The architecture that\ntackles this issue comprehensively, spanning from the workloads themselves,\nthrough networking and data exchange, up to the orchestration and choreography\nmechanisms. The concept emphasizes the use of varied AI techniques, enabling\nautonomous and intelligent management of resources and workloads. Open\nstandards are also a key part of the proposition, making it possible to fully\nengage third parties in multi-stakeholder scenarios. Although the presented\narchitecture is promising, much work is required to realize it in practice. To\nthis end, the key directions for future research are outlined.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:57:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sowinski","Piotr",""],["Lacalle","Ignacio",""],["Vano","Rafael",""],["Palau","Carlos E.",""]]}
{"id":"2308.03120","submitter":"Conrad Sanderson","authors":"Ryan R. Curtin, Marcus Edel, Conrad Sanderson","title":"Bandicoot: C++ Library for GPU Linear Algebra and Scientific Computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report provides an introduction to the Bandicoot C++ library for linear\nalgebra and scientific computing on GPUs, overviewing its user interface and\nperformance characteristics, as well as the technical details of its internal\ndesign. Bandicoot is the GPU-enabled counterpart to the well-known Armadillo\nC++ linear algebra library, aiming to allow users to take advantage of\nGPU-accelerated computation for their existing codebases without significant\nchanges. Adapting the same internal template meta-programming techniques that\nArmadillo uses, Bandicoot is able to provide compile-time optimisation of\nmathematical expressions within user code. The library is ready for production\nuse and is available at https://coot.sourceforge.io. Bandicoot is distributed\nunder the Apache 2.0 License.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:01:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Curtin","Ryan R.",""],["Edel","Marcus",""],["Sanderson","Conrad",""]]}
{"id":"2308.03121","submitter":"Yuan Tong","authors":"Yuan Tong, Mengshun Hu, Zheng Wang","title":"NNVISR: Bring Neural Network Video Interpolation and Super Resolution\n  into Video Processing Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present NNVISR - an open-source filter plugin for the VapourSynth video\nprocessing framework, which facilitates the application of neural networks for\nvarious kinds of video enhancing tasks, including denoising, super resolution,\ninterpolation, and spatio-temporal super-resolution. NNVISR fills the gap\nbetween video enhancement neural networks and video processing pipelines, by\naccepting any network that enhances a group of frames, and handling all other\nnetwork agnostic details during video processing. NNVISR is publicly released\nat https://github.com/tongyuantongyu/vs-NNVISR.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:09:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tong","Yuan",""],["Hu","Mengshun",""],["Wang","Zheng",""]]}
{"id":"2308.03122","submitter":"Prerak Gandhi","authors":"Prerak Gandhi, Vishal Pramanik, Pushpak Bhattacharyya","title":"\"Kurosawa\": A Script Writer's Assistant","comments":"6 pages, 9 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Storytelling is the lifeline of the entertainment industry -- movies, TV\nshows, and stand-up comedies, all need stories. A good and gripping script is\nthe lifeline of storytelling and demands creativity and resource investment.\nGood scriptwriters are rare to find and often work under severe time pressure.\nConsequently, entertainment media are actively looking for automation. In this\npaper, we present an AI-based script-writing workbench called KUROSAWA which\naddresses the tasks of plot generation and script generation. Plot generation\naims to generate a coherent and creative plot (600-800 words) given a prompt\n(15-40 words). Script generation, on the other hand, generates a scene (200-500\nwords) in a screenplay format from a brief description (15-40 words). Kurosawa\nneeds data to train. We use a 4-act structure of storytelling to annotate the\nplot dataset manually. We create a dataset of 1000 manually annotated plots and\ntheir corresponding prompts/storylines and a gold-standard dataset of 1000\nscenes with four main elements -- scene headings, action lines, dialogues, and\ncharacter names -- tagged individually. We fine-tune GPT-3 with the above\ndatasets to generate plots and scenes. These plots and scenes are first\nevaluated and then used by the scriptwriters of a large and famous media\nplatform ErosNow. We release the annotated datasets and the models trained on\nthese datasets as a working benchmark for automatic movie plot and script\ngeneration.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:09:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gandhi","Prerak",""],["Pramanik","Vishal",""],["Bhattacharyya","Pushpak",""]]}
{"id":"2308.03123","submitter":"Shangtong Cao","authors":"Shangtong Cao, Ningyu He, Yao Guo, Haoyu Wang","title":"WASMixer: Binary Obfuscation for WebAssembly","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  WebAssembly (Wasm) is an emerging binary format that draws great attention\nfrom our community. However, Wasm binaries are weakly protected, as they can be\nread, edited, and manipulated by adversaries using either the officially\nprovided readable text format (i.e., wat) or some advanced binary analysis\ntools. Reverse engineering of Wasm binaries is often used for nefarious\nintentions, e.g., identifying and exploiting both classic vulnerabilities and\nWasm specific vulnerabilities exposed in the binaries. However, no\nWasm-specific obfuscator is available in our community to secure the Wasm\nbinaries. To fill the gap, in this paper, we present WASMixer, the first\ngeneral-purpose Wasm binary obfuscator, enforcing data-level (string literals\nand function names) and code-level (control flow and instructions) obfuscation\nfor Wasm binaries. We propose a series of key techniques to overcome challenges\nduring Wasm binary rewriting, including an on-demand decryption method to\nminimize the impact brought by decrypting the data in memory area, and code\nsplitting/reconstructing algorithms to handle structured control flow in Wasm.\nExtensive experiments demonstrate the correctness, effectiveness and efficiency\nof WASMixer. Our research has shed light on the promising direction of Wasm\nbinary research, including Wasm code protection, Wasm binary diversification,\nand the attack-defense arm race of Wasm binaries.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:10:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cao","Shangtong",""],["He","Ningyu",""],["Guo","Yao",""],["Wang","Haoyu",""]]}
{"id":"2308.03124","submitter":"Krishnarjun Banerjee","authors":"Krishnarjun Banerjee, Adityanarayan H. Pandey, Pravin Varade, Ajit R.\n  Kulkarni, Abhijeet L. Sangle, N. Venkataramani","title":"Substrate temperature dependent dielectric and ferroelectric properties\n  of (100) oriented lead-free Na$_{0.4}$K$_{0.1}$Bi$_{0.5}$TiO$_3$ thin films\n  grown by pulsed laser deposition","comments":"16 pages, 4 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":"  Pb-free ferroelectric thin films are gaining attention due to their\napplicability in memory, sensor, actuator, and microelectromechanical system.\nIn this work, Na$_{0.4}$K$_{0.1}$Bi$_{0.5}$TiO$_3$ (NKBT0.1) ferroelectric thin\nfilms were deposited on Pt(111)/Ti/SiO$_2$/Si substrates using the pulsed laser\ndeposition technique at various substrate temperatures (600-750 $^\\circ$C). The\ncomprehensive structural, microstructural, and ferroelectric properties\ncharacterizations depicted that the grain size, dielectric constant, and\nremnant polarization increased with higher deposition temperatures. The\ninfluence of higher substrate temperatures on the control of (100)-preferential\norientations was observed, indicating the importance of deposition conditions.\nSignificantly, films deposited at 700 deg C exhibited reduced dielectric loss\nof 0.08 (at 1kHz), high dielectric constant of 673, and remnant polarization of\n17 microC/cm2 at room temperature. At this deposition temperature, a maximum\neffective piezoelectric coefficient of 76 pm/V was availed. Based on the\nstructural analysis, dielectric properties, and ferroelectric behavior, the\noptimal deposition temperature for the NKBT0.1 thin films was 700 $^\\circ$C.\nThis study contributes to the understanding of the influence of substrate\ntemperature on the structural and ferroelectric properties of Pb-free NKBT0.1\nthin films, providing insights for the development of high-performance\nferroelectric devices.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:14:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Banerjee","Krishnarjun",""],["Pandey","Adityanarayan H.",""],["Varade","Pravin",""],["Kulkarni","Ajit R.",""],["Sangle","Abhijeet L.",""],["Venkataramani","N.",""]]}
{"id":"2308.03125","submitter":"Giuseppe Gagliardi","authors":"Antonio Evangelista, Roberto Frezzotti, Giuseppe Gagliardi, Vittorio\n  Lubicz, Francesco Sanfilippo, Silvano Simula, Nazario Tantalo","title":"Inclusive hadronic decay rate of the $\\tau$ lepton from lattice QCD","comments":"23 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inclusive hadronic decays of the $\\tau$ lepton are very interesting from the\nphenomenological point of view since they give access to the CKM matrix\nelements $V_{ud}$ and $V_{us}$. In this paper, for the first time, by employing\nthe HLT method for hadronic smeared spectral densities we compute on the\nlattice the inclusive decay rate of the processes $\\tau \\to X_{ud}\\, \\nu_\\tau$,\nwhere $X_{ud}$ is a generic hadronic state with $\\bar{u} d$ flavor quantum\nnumbers. Our computation, which avoids any recourse to OPE and/or perturbative\napproximations, is carried out in isospin symmetric $N_{f}=2+1+1$ lattice QCD\nat physical quark masses, using ensembles produced by the ETMC at three lattice\nspacings and two volumes. All uncertainties, except for isospin breaking\neffects, are taken into account and a result with a subpercent error is\nobtained for $|V_{ud}|$, which is nicely consistent with the current world\naverage. These findings validate our approach and also motivate the inclusion\nof isospin breaking corrections and its extension to the inclusive decay $\\tau\n\\to X_{us}\\, \\nu_\\tau$, paving the way towards a high-precision first\nprinciples determination of $|V_{us}|$ and $|V_{ud}|$ from inclusive $\\tau$\ndecay.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:27:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Evangelista","Antonio",""],["Frezzotti","Roberto",""],["Gagliardi","Giuseppe",""],["Lubicz","Vittorio",""],["Sanfilippo","Francesco",""],["Simula","Silvano",""],["Tantalo","Nazario",""]]}
{"id":"2308.03126","submitter":"Andrew Granville","authors":"Andrew Granville","title":"Missing digits, and good approximations","comments":"Write up of my 2023 AMS Current Events Bulletin lecture. Accepted at\n  Bulletin AMS","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  James Maynard has taken the analytic number theory world by storm in the last\ndecade, proving several important and surprising theorems, resolving questions\nthat had seemed far out of reach. He is perhaps best known for his work on\nsmall and large gaps between primes (which were discussed, hot off the press,\nin my 2015 CEB lecture). In this article we will discuss two other Maynard\nbreakthroughs: -- Mersenne numbers take the form $2^n-1$ and so appear as\n$111\\dots 111$ in base 2, having no digit `$0$'. It is a famous conjecture that\nthere are infinitely many such primes. More generally it was, until Maynard's\nwork, an open question as to whether there are infinitely many primes that miss\nany given digit, in any given base. We will discuss Maynard's beautiful ideas\nthat went into partly resolving this question. -- In 1926, Khinchin gave\nremarkable conditions for when real numbers can usually be ``well\napproximated'' by infinitely many rationals. However Khinchin's theorem\nregarded 1/2, 2/4, 3/6 as distinct rationals and so could not be easily\nmodified to cope, say, with approximations by fractions with prime\ndenominators. In 1941 Duffin and Schaefer proposed an appropriate but\nsignificantly more general analogy involving approximation only by reduced\nfractions (which is much more useful). We will discuss its recent resolution by\nMaynard together with Dimitris Koukoulopoulos.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:27:33 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:57:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Granville","Andrew",""]]}
{"id":"2308.03127","submitter":"Zhaoqing Feng","authors":"Zhao-Qing Feng","title":"Effect of cluster transfer on neutron-rich nuclide production around\n  N=126 in multinucleon transfer reactions","comments":"10 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2108.13598","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The cluster transfer in multinucleon transfer reactions near Coulomb barrier\nenergies is implemented into the master equations in dinuclear system model, in\nwhich the deuteron, triton, $^{3}$He and $\\alpha$ are taken into account. The\neffects of cluster transfer and dynamical deformation on the formation of\nprimary and secondary fragments are systematically investigated. It is found\nthat the inclusion of cluster transfer is favorable the fragment formation with\nincreasing the transferring nucleons and leads to a broad mass distribution.\nThe isotopic cross sections of elements W, Os, Rn and Fr in the reaction of\n$^{136}$Xe+$^{208}$Pb at the incident energy of E$_{c.m.}$ = 450 MeV are nicely\nconsistent with the Argonne data. The new neutron-rich isotopes of wolfram and\nosmium are predicted with cross sections above 10 nb. The production mechanism\nof neutron-rich heavy nuclei around N = 126 in the reactions of $^{58,64,72}$Ni\n+ $^{198}$Pt is investigated thoroughly. The cross sections for producing the\nneutron-rich isotopes of platinum, iridium, osmium and rhenium in the\nmultinucleon transfer reactions of $^{64}$Ni + $^{198}$Pt and $^{72}$Ni +\n$^{198}$Pt at the center of mass energies of 220 MeV and 230 MeV are estimated\nand proposed for the future experiments.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:29:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Zhao-Qing",""]]}
{"id":"2308.03128","submitter":"Abu-Al Hassan","authors":"Abu-Al Hassan","title":"Iterative Magnitude Pruning as a Renormalisation Group: A Study in The\n  Context of The Lottery Ticket Hypothesis","comments":"MSci thesis, 40 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This thesis delves into the intricate world of Deep Neural Networks (DNNs),\nfocusing on the exciting concept of the Lottery Ticket Hypothesis (LTH). The\nLTH posits that within extensive DNNs, smaller, trainable subnetworks termed\n\"winning tickets\", can achieve performance comparable to the full model. A key\nprocess in LTH, Iterative Magnitude Pruning (IMP), incrementally eliminates\nminimal weights, emulating stepwise learning in DNNs. Once we identify these\nwinning tickets, we further investigate their \"universality\". In other words,\nwe check if a winning ticket that works well for one specific problem could\nalso work well for other, similar problems. We also bridge the divide between\nthe IMP and the Renormalisation Group (RG) theory in physics, promoting a more\nrigorous understanding of IMP.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:36:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hassan","Abu-Al",""]]}
{"id":"2308.03129","submitter":"Yu-Cun Xie","authors":"Yu-Cun Xie, Salvatore Butera and Bei-Lok Hu","title":"Optomechanical Backreaction of Quantum Field Processes in Dynamical\n  Casimir Effect","comments":"19 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.other gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamical Casimir effect (DCE) and cosmological particle creation (CPC) share\nthe same underlying physical mechanism, that of parametric amplification of\nvacuum fluctuations in the quantum field by an expanding universe or by a fast\nmoving boundary. Backreaction of cosmological particle creation at the Planck\ntime has been shown to play a significant role in the isotropization and\nhomogenization of the early universe. Understanding the backreaction effects of\nquantum field processes in DCE is the goal of this work. We present analyses of\nquantum field processes in two model systems: in 1+1D, a ring with\ntime-dependent radius, and in 3+1D, a symmetric rectangular conducting box with\none moving side. In both cases the time-dependence of the radius or the length\nis determined solely by the backreaction of particle creation and related\neffects, there is no external agent. We find that for 1+1D, the only quantum\nfield effect due to the trace anomaly tends to accelerate the contraction of\nthe ring over and above that due to the attractive force in the static Casimir\neffect. For the rectangular box the expansion or contraction is slowed down\ncompared to that due to the static Casimir effect. Our findings comply with\nwhat is known as the quantum Lenz law, found in cosmological backreaction\nproblems: the backreaction works in the direction of opposing further changes,\nwhich means the suppression of particle creation and a slow down of the system\ndynamics. In conclusion we suggest two related classes of problems of\ntheoretical significance for further investigations.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:41:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xie","Yu-Cun",""],["Butera","Salvatore",""],["Hu","Bei-Lok",""]]}
{"id":"2308.03130","submitter":"Tomos Wells","authors":"T. Wells, W. M. C. Foulkes, S. L. Dudarev and A. P. Horsfield","title":"The Einstein-de Haas Effect in an $\\textrm{Fe}_{15}$ Cluster","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.atm-clus","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Classical models of spin-lattice coupling are at present unable to accurately\nreproduce results for numerous properties of ferromagnetic materials, such as\nheat transport coefficients or the sudden collapse of the magnetic moment in\nhcp-Fe under pressure. This inability has been attributed to the absence of a\nproper treatment of effects that are inherently quantum mechanical in nature,\nnotably spin-orbit coupling. This paper introduces a time-dependent,\nnon-collinear tight binding model, complete with spin-orbit coupling and vector\nStoner exchange terms, that is capable of simulating the Einstein-de Haas\neffect in a ferromagnetic $\\textrm{Fe}_{15}$ cluster. The tight binding model\nis used to investigate the adiabaticity timescales that determine the response\nof the orbital and spin angular momenta to a rotating, externally applied $B$\nfield, and we show that the qualitative behaviours of our simulations can be\nextrapolated to realistic timescales by use of the adiabatic theorem. An\nanalysis of the trends in the torque contributions with respect to the field\nstrength demonstrates that SOC is necessary to observe a transfer of angular\nmomentum from the electrons to the nuclei at experimentally realistic $B$\nfields. The simulations presented in this paper demonstrate the Einstein-de\nHaas effect from first principles using a Fe cluster.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:44:31 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 12:36:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wells","T.",""],["Foulkes","W. M. C.",""],["Dudarev","S. L.",""],["Horsfield","A. P.",""]]}
{"id":"2308.03131","submitter":"Xianfeng Zeng","authors":"Xianfeng Zeng, Yijin Liu, Fandong Meng and Jie Zhou","title":"Towards Multiple References Era -- Addressing Data Leakage and Limited\n  Reference Diversity in NLG Evaluation","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":"  N-gram matching-based evaluation metrics, such as BLEU and chrF, are widely\nutilized across a range of natural language generation (NLG) tasks. However,\nrecent studies have revealed a weak correlation between these matching-based\nmetrics and human evaluations, especially when compared with neural-based\nmetrics like BLEURT. In this paper, we conjecture that the performance\nbottleneck in matching-based metrics may be caused by the limited diversity of\nreferences. To address this issue, we propose to utilize \\textit{multiple\nreferences} to enhance the consistency between these metrics and human\nevaluations. Within the WMT Metrics benchmarks, we observe that the\nmulti-references F200spBLEU surpasses the conventional single-reference one by\nan accuracy improvement of 7.2\\%. Remarkably, it also exceeds the neural-based\nBERTscore by an accuracy enhancement of 3.9\\%. Moreover, we observe that the\ndata leakage issue in large language models (LLMs) can be mitigated to a large\nextent by our multi-reference metric. We release the code and data at\n\\url{https://github.com/SefaZeng/LLM-Ref}\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:49:26 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 02:01:14 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 10:49:20 GMT"},{"version":"v4","created":"Thu, 10 Aug 2023 02:08:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zeng","Xianfeng",""],["Liu","Yijin",""],["Meng","Fandong",""],["Zhou","Jie",""]]}
{"id":"2308.03132","submitter":"Siqian Shen","authors":"Xinyu Fei, Lucas T. Brady, Jeffrey Larson, Sven Leyffer, Siqian Shen","title":"Switching Time Optimization for Binary Quantum Optimal Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum optimal control is a technique for controlling the evolution of a\nquantum system and has been applied to a wide range of problems in quantum\nphysics. We study a binary quantum control optimization problem, where control\ndecisions are binary-valued and the problem is solved in diverse quantum\nalgorithms. In this paper, we utilize classical optimization and computing\ntechniques to develop an algorithmic framework that sequentially optimizes the\nnumber of control switches and the duration of each control interval on a\ncontinuous time horizon. Specifically, we first solve the continuous relaxation\nof the binary control problem based on time discretization and then use a\nheuristic to obtain a controller sequence with a penalty on the number of\nswitches. Then, we formulate a switching time optimization model and apply\nsequential least-squares programming with accelerated time-evolution simulation\nto solve the model. We demonstrate that our computational framework can obtain\nbinary controls with high-quality performance and also reduce computational\ntime via solving a family of quantum control instances in various quantum\nphysics applications.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:51:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fei","Xinyu",""],["Brady","Lucas T.",""],["Larson","Jeffrey",""],["Leyffer","Sven",""],["Shen","Siqian",""]]}
{"id":"2308.03133","submitter":"Francois Golse","authors":"Fran\\c{c}ois Golse","title":"A Duality-Based Proof of the Triangle Inequality for the Wasserstein\n  Distances","comments":"10 pages, no figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This short note gives a proof of the triangle inequality based on the\nKantorovich duality formula for the Wasserstein distances of exponent\n$p\\in[1,+\\infty)$ in the case of a general Polish space. In particular it\navoids the \"glueing of couplings\" procedure used in most textbooks on optimal\ntransport.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:52:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Golse","Fran\u00e7ois",""]]}
{"id":"2308.03134","submitter":"Bozhi Wang","authors":"Bozhi Wang, Jingwei Wen, Jiawei Wu, Haonan Xie, Fan Yang, Shijie Wei,\n  Gui-lu Long","title":"A powered full quantum eigensolver for energy band structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There has been an increasing research focus on quantum algorithms for\ncondensed matter systems recently, particularly on calculating energy band\nstructures. Here, we propose a quantum algorithm, the powered full quantum\neigensolver(P-FQE), by using the exponentiation of operators of the full\nquantum eigensolver(FQE). This leads to an exponential increase in the success\nprobability of measuring the target state in certain circumstances where the\nnumber of generating elements involved in the exponentiation of operators\nexhibit a log polynomial dependence on the number of orbitals. Furthermore, we\nconduct numerical calculations for band structure determination of the twisted\ndouble-layer graphene. We experimentally demonstrate the feasibility and\nrobustness of the P-FQE algorithm using superconducting quantum computers for\ngraphene and Weyl semimetal. One significant advantage of our algorithm is its\nability to reduce the requirements of extremely high-performance hardware,\nmaking it more suitable for energy spectra determination on noisy\nintermediate-scale quantum (NISQ) devices.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:03:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Bozhi",""],["Wen","Jingwei",""],["Wu","Jiawei",""],["Xie","Haonan",""],["Yang","Fan",""],["Wei","Shijie",""],["Long","Gui-lu",""]]}
{"id":"2308.03135","submitter":"Jiazhou Zhou","authors":"Jiazhou Zhou, Xu Zheng, Yuanhuiyi Lyu, Lin Wang","title":"E-CLIP: Towards Label-efficient Event-based Open-world Understanding by\n  CLIP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contrasting Language-image pertaining (CLIP) has recently shown promising\nopen-world and few-shot performance on 2D image-based recognition tasks.\nHowever, the transferred capability of CLIP to the novel event camera data\nstill remains under-explored. In particular, due to the modality gap with the\nimage-text data and the lack of large-scale datasets, achieving this goal is\nnon-trivial and thus requires significant research innovation. In this paper,\nwe propose E-CLIP, a novel and effective framework that unleashes the potential\nof CLIP for event-based recognition to compensate for the lack of large-scale\nevent-based datasets. Our work addresses two crucial challenges: 1) how to\ngeneralize CLIP's visual encoder to event data while fully leveraging events'\nunique properties, e.g., sparsity and high temporal resolution; 2) how to\neffectively align the multi-modal embeddings, i.e., image, text, and events. To\nthis end, we first introduce a novel event encoder that subtly models the\ntemporal information from events and meanwhile generates event prompts to\npromote the modality bridging. We then design a text encoder that generates\ncontent prompts and utilizes hybrid text prompts to enhance the E-CLIP's\ngeneralization ability across diverse datasets. With the proposed event\nencoder, text encoder, and original image encoder, a novel Hierarchical Triple\nContrastive Alignment (HTCA) module is introduced to jointly optimize the\ncorrelation and enable efficient knowledge transfer among the three modalities.\nWe conduct extensive experiments on two recognition benchmarks, and the results\ndemonstrate that our E-CLIP outperforms existing methods by a large margin of\n+3.94% and +4.62% on the N-Caltech dataset, respectively, in both fine-tuning\nand few-shot settings. Moreover, our E-CLIP can be flexibly extended to the\nevent retrieval task using both text or image queries, showing plausible\nperformance.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:05:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Jiazhou",""],["Zheng","Xu",""],["Lyu","Yuanhuiyi",""],["Wang","Lin",""]]}
{"id":"2308.03136","submitter":"Raihaneh Moti","authors":"Raihaneh Moti","title":"On the Nonlocal Newtonian Cosmology","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the absence of an exact development of the cosmological models of the\nMashhoon nonlocal gravity, the Newtonian regime may clarify some aspects of it.\nOne important feature to consider is the formation of horizons, which can be\nunderstood as a consequence of the finite interaction velocity. In order, to\nfully investigate the nonlocal effects, it is necessary to extend the\nintegration over space to the integration over space-time. In this context, we\nshow that the density of effective dark matter would increase, while the\ndensity of baryonic matter decreases, during the deep matter-dominated epoch.\nThis finding is in contradiction with the predictions of the standard model of\ncosmology and it raises concerns about the compatibility of nonlocal effects\nusing Tohline-Kuhn kernel with the standard model.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:11:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moti","Raihaneh",""]]}
{"id":"2308.03137","submitter":"Shiyu Song","authors":"Shiyu Song, Yanqun Tang, Xizhang Wei, Yu Zhou, Xianjie Lu, Zhengpeng\n  Wang, Songhu Ge","title":"Digital Self-Interference Cancellation With Robust Multi-layered Total\n  Least Mean Squares Adaptive Filters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In simultaneous transmit and receive (STAR) wireless communications, digital\nself-interference (SI) cancellation is required before estimating the remote\ntransmission (RT) channel. Considering the inherent connection between SI\nchannel reconstruction and RT channel estimation, we propose a multi-layered\nM-estimate total least mean squares (m-MTLS) joint estimator to estimate both\nchannels. In each layer, our proposed m-MTLS estimator first employs an\nM-estimate total least mean squares (MTLS) algorithm to eliminate residual SI\nfrom the received signal and give a new estimation of the RT channel. Then, it\ngives the final RT channel estimation based on the weighted sum of the\nestimation values obtained from each layer. Compared to traditional minimum\nmean square error (MMSE) estimator and single-layered MTLS estimator, it\ndemonstrates that the m-MTLS estimator has better performance of normalized\nmean squared difference (NMSD). Besides, the simulation results also show the\nrobustness of m-MTLS estimator even in scenarios where the local reference\nsignal is contaminated with noise, and the received signal is impacted by\nstrong impulse noise.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:25:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Song","Shiyu",""],["Tang","Yanqun",""],["Wei","Xizhang",""],["Zhou","Yu",""],["Lu","Xianjie",""],["Wang","Zhengpeng",""],["Ge","Songhu",""]]}
{"id":"2308.03138","submitter":"Dirk Nuyens","authors":"Dirk Nuyens and Laurence Wilkes","title":"A randomised lattice rule algorithm with pre-determined generating\n  vector and random number of points for Korobov spaces with $0 < \\alpha \\le\n  1/2$","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 previous work (Kuo, Nuyens, Wilkes, 2023), we showed that a lattice rule\nwith a pre-determined generating vector but random number of points can achieve\nthe near optimal convergence of $O(n^{-\\alpha-1/2+\\epsilon})$, $\\epsilon > 0$,\nfor the worst case expected error, or randomised error, for numerical\nintegration of high-dimensional functions in the Korobov space with smoothness\n$\\alpha > 1/2$. Compared to the optimal deterministic rate of\n$O(n^{-\\alpha+\\epsilon})$, $\\epsilon > 0$, such a randomised algorithm is\ncapable of an extra half in the rate of convergence. In this paper, we show\nthat a pre-determined generating vector also exists in the case of $0 < \\alpha\n\\le 1/2$. Also here we obtain the near optimal convergence of\n$O(n^{-\\alpha-1/2+\\epsilon})$, $\\epsilon > 0$; or in more detail, we obtain\n$O(\\sqrt{r} \\, n^{-\\alpha-1/2+1/(2r)+\\epsilon'})$ which holds for any choices\nof $\\epsilon' > 0$ and $r \\in \\mathbb{N}$ with $r > 1/(2\\alpha)$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:28:43 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 09:56:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nuyens","Dirk",""],["Wilkes","Laurence",""]]}
{"id":"2308.03139","submitter":"HoangTrieuVy Le","authors":"Hoang Trieu Vy Le, Audrey Repetti, Nelly Pustelnik","title":"PNN: From proximal algorithms to robust unfolded image denoising\n  networks and Plug-and-Play methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A common approach to solve inverse imaging problems relies on finding a\nmaximum a posteriori (MAP) estimate of the original unknown image, by solving a\nminimization problem. In thiscontext, iterative proximal algorithms are widely\nused, enabling to handle non-smooth functions and linear operators. Recently,\nthese algorithms have been paired with deep learning strategies, to further\nimprove the estimate quality. In particular, proximal neural networks (PNNs)\nhave been introduced, obtained by unrolling a proximal algorithm as for finding\na MAP estimate, but over a fixed number of iterations, with learned linear\noperators and parameters. As PNNs are based on optimization theory, they are\nvery flexible, and can be adapted to any image restoration task, as soon as a\nproximal algorithm can solve it. They further have much lighter architectures\nthan traditional networks. In this article we propose a unified framework to\nbuild PNNs for the Gaussian denoising task, based on both the dual-FB and the\nprimal-dual Chambolle-Pock algorithms. We further show that accelerated\ninertial versions of these algorithms enable skip connections in the associated\nNN layers. We propose different learning strategies for our PNN framework, and\ninvestigate their robustness (Lipschitz property) and denoising efficiency.\nFinally, we assess the robustness of our PNNs when plugged in a\nforward-backward algorithm for an image deblurring problem.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:32:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Le","Hoang Trieu Vy",""],["Repetti","Audrey",""],["Pustelnik","Nelly",""]]}
{"id":"2308.03140","submitter":"Jan Hermann","authors":"Jan Hermann, Martin St\\\"ohr, Szabolcs G\\'oger, Shayantan Chaudhuri,\n  B\\'alint Aradi, Reinhard J. Maurer, Alexandre Tkatchenko","title":"libMBD: A general-purpose package for scalable quantum many-body\n  dispersion calculations","comments":"14 pages, 6 figures, submitted to JCP","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many-body dispersion (MBD) is a powerful framework to treat van der Waals\n(vdW) dispersion interactions in density-functional theory and related\natomistic modeling methods. Several independent implementations of MBD with\nvarying degree of functionality exist across a number of electronic structure\ncodes, which both limits the current users of those codes and complicates\ndissemination of new variants of MBD. Here, we develop and document libMBD, a\nlibrary implementation of MBD that is functionally complete, efficient, easy to\nintegrate with any electronic structure code, and already integrated in\nFHI-aims, DFTB+, VASP, Q-Chem, CASTEP, and Quantum ESPRESSO. libMBD is written\nin modern Fortran with bindings to C and Python, uses MPI/ScaLAPACK for\nparallelization, and implements MBD for both finite and periodic systems, with\nanalytical gradients with respect to all input parameters. The computational\ncost has asymptotic cubic scaling with system size, and evaluation of gradients\nonly changes the prefactor of the scaling law, with libMBD exhibiting strong\nscaling up to 256 processor cores. Other MBD properties beyond energy and\ngradients can be calculated with libMBD, such as the charge-density\npolarization, first-order Coulomb correction, the dielectric function, or the\norder-by-order expansion of the energy in the dipole interaction. Calculations\non supramolecular complexes with MBD-corrected electronic structure methods and\na meta-review of previous applications of MBD demonstrate the broad\napplicability of the libMBD package to treat vdW interactions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:35:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hermann","Jan",""],["St\u00f6hr","Martin",""],["G\u00f3ger","Szabolcs",""],["Chaudhuri","Shayantan",""],["Aradi","B\u00e1lint",""],["Maurer","Reinhard J.",""],["Tkatchenko","Alexandre",""]]}
{"id":"2308.03141","submitter":"Megumi Harada","authors":"Megumi Harada and Alexandra Seceleanu and Liana \\c{S}ega","title":"The minimal free resolution of a generic symmetric principal ideal","comments":"50 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the class of principal symmetric ideals, which are ideals\ngenerated by the orbit of a single polynomial under the action of the symmetric\ngroup. Fixing the degree of the generating polynomial, this class of ideals is\nparametrized by points in a suitable projective space. We show that the minimal\nfree resolution of a principal symmetric ideal is constant on a nonempty\nZariski open subset of this projective space and we determine this resolution\nexplicitly. Along the way, we study two classes of graded algebras which we\nterm narrow and extremely narrow; both of which are instances of compressed\nartinian algebras.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:38:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Harada","Megumi",""],["Seceleanu","Alexandra",""],["\u015eega","Liana",""]]}
{"id":"2308.03142","submitter":"Nikos Zarifis","authors":"Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis","title":"Self-Directed Linear Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS math.ST stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In online classification, a learner is presented with a sequence of examples\nand aims to predict their labels in an online fashion so as to minimize the\ntotal number of mistakes. In the self-directed variant, the learner knows in\nadvance the pool of examples and can adaptively choose the order in which\npredictions are made. Here we study the power of choosing the prediction order\nand establish the first strong separation between worst-order and random-order\nlearning for the fundamental task of linear classification. Prior to our work,\nsuch a separation was known only for very restricted concept classes, e.g.,\none-dimensional thresholds or axis-aligned rectangles.\n  We present two main results. If $X$ is a dataset of $n$ points drawn\nuniformly at random from the $d$-dimensional unit sphere, we design an\nefficient self-directed learner that makes $O(d \\log \\log(n))$ mistakes and\nclassifies the entire dataset. If $X$ is an arbitrary $d$-dimensional dataset\nof size $n$, we design an efficient self-directed learner that predicts the\nlabels of $99\\%$ of the points in $X$ with mistake bound independent of $n$. In\ncontrast, under a worst- or random-ordering, the number of mistakes must be at\nleast $\\Omega(d \\log n)$, even when the points are drawn uniformly from the\nunit sphere and the learner only needs to predict the labels for $1\\%$ of them.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:38:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Diakonikolas","Ilias",""],["Kontonis","Vasilis",""],["Tzamos","Christos",""],["Zarifis","Nikos",""]]}
{"id":"2308.03143","submitter":"Nicolas Morales-Duran","authors":"Nicol\\'as Morales-Dur\\'an, Nemin Wei and Allan H. MacDonald","title":"Magic Angles and Fractional Chern Insulators in Twisted Homobilayer TMDs","comments":"11 pages, 5 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 explain the appearance of magic angle flat bands and fractional Chern\ninsulators in twisted K-valley homobilayer transition metal dichalcogenides by\nmapping their continuum model to a Landau level problem. Our approach relies on\nan adiabatic approximation for the quantum mechanics of valence band holes in a\nlayer-pseudospin field that is valid for sufficiently small twist angles and on\na lowest Landau level approximation that is valid for sufficiently large twist\nangles. It simply explains why the quantum geometry of the lowest moir\\'e\nminiband is close to ideal at the flat-band twist angle, predicts that flat\nbands occur only when the valley-dependent moir\\'e potential is sufficiently\nstrong compared to the interlayer tunneling amplitude, and provides a powerful\nstarting point for the study of interactions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:43:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Morales-Dur\u00e1n","Nicol\u00e1s",""],["Wei","Nemin",""],["MacDonald","Allan H.",""]]}
{"id":"2308.03144","submitter":"Tristan J Riviere","authors":"Francesco Palmurella, Tristan Rivi\\`ere","title":"The Parametric Willmore Flow","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":"  We establish a minimal positive existence time of the parametric Willmore\nflow for any smooth initial data (smooth immersion of a closed oriented\nsurface). The minimal existence time is a function exclusively of geometric\ndata which in particular are all well defined for general weak lipschitz\n$W^{2,2}$ immersions. This fact combined with the conservation law formulation\nof the equation given by the first author in 2008 opens the possibility for\ndefining the Willmore flow for weak lipschitz $W^{2,2}$ initial data.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:44:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Palmurella","Francesco",""],["Rivi\u00e8re","Tristan",""]]}
{"id":"2308.03145","submitter":"Giacomo Pollari","authors":"Pollari Giacomo","title":"Cosmological scenarios from topological invariants: Inflation and\n  Quintom theory with Barbero-Immirzi scalar field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the present work we provide a cosmological description of the Palatini\naction with the addition of three well-known topological invariants, each of\nwhich is attached to a scalar field. As a consequence, torsion plays a central\nrole, yielding an effective action with three dynamical scalar fields coupled\nto gravity subjected to the influence of a potential. A special heed will be\naddressed to inflation scenarios and quintom theory, although other noteworthy\ncases will be analyzed. Two out of three scalars can be thought as the\nBarbero-Immirzi scalar field coupled to the Holst and Nieh-Yan terms with a\npotential whereby they shape the evolution of the universe. The other field\nturns out to be a phantom that we couple to the inflaton that at late times\nholds the stage inducing a fast expansion\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:47:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Giacomo","Pollari",""]]}
{"id":"2308.03146","submitter":"Stefano Borgo","authors":"Chiara Bassetti, Enrico Blanzieri, Stefano Borgo, Sofia Marangon","title":"Towards socially-competent and culturally-adaptive artificial agents\n  Expressive order, interactional disruptions and recovery strategies","comments":null,"journal-ref":"Interaction Studies, Vol. 23, Dec 2022, p.469-512","doi":"10.1075/is.22021.bas","report-no":null,"categories":"cs.AI cs.CY cs.HC cs.MA cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The development of artificial agents for social interaction pushes to enrich\nrobots with social skills and knowledge about (local) social norms. One\npossibility is to distinguish the expressive and the functional orders during a\nhuman-robot interaction. The overarching aim of this work is to set a framework\nto make the artificial agent socially-competent beyond dyadic\ninteraction-interaction in varying multi-party social situations-and beyond\nindividual-based user personalization, thereby enlarging the current conception\nof \"culturally-adaptive\". The core idea is to provide the artificial agent with\nthe capability to handle different kinds of interactional disruptions, and\nassociated recovery strategies, in microsociology. The result is obtained by\nclassifying functional and social disruptions, and by investigating the\nrequirements a robot's architecture should satisfy to exploit such knowledge.\nThe paper also highlights how this level of competence is achieved by focusing\non just three dimensions: (i) social capability, (ii) relational role, and\n(iii) proximity, leaving aside the further complexity of full-fledged\nhuman-human interactions. Without going into technical aspects, End-to-end\nData-driven Architectures and Modular Architectures are discussed to evaluate\nthe degree to which they can exploit this new set of social and cultural\nknowledge. Finally, a list of general requirements for such agents is proposed.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:47:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bassetti","Chiara",""],["Blanzieri","Enrico",""],["Borgo","Stefano",""],["Marangon","Sofia",""]]}
{"id":"2308.03147","submitter":"Jeremy Darling","authors":"Jeremy Darling, Jennie Paine, Mark J. Reid, Karl M. Menten, Shoko\n  Sakai, Andrea Ghez","title":"An Updated Reference Frame for the Galactic Inner Parsec","comments":"18 pages, 7 figures, 3 tables. Accepted by ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Infrared observations of stellar orbits about Sgr A* probe the mass\ndistribution in the inner parsec of the Galaxy and provide definitive evidence\nfor the existence of a massive black hole. However, the infrared astrometry is\nrelative and is tied to the radio emission from Sgr A* using stellar SiO masers\nthat coincide with infrared-bright stars. To support and improve this two-step\nastrometry, we present new astrometric observations of 15 stellar SiO masers\nwithin 2 pc of Sgr A*. Combined with legacy observations spanning 25.8 years,\nwe re-analyze the relative offsets of these masers from Sgr A* and measure\npositions and proper motions that are significantly improved compared to the\npreviously published reference frame. Maser positions are corrected for\nepoch-specific differential aberration, precession, nutation, and solar\ngravitational deflection. Omitting the supergiant IRS 7, the mean position\nuncertainties are 0.46 mas and 0.84 mas in RA and Dec., and the mean proper\nmotion uncertainties are 0.07 mas yr$^{-1}$ and 0.12 mas yr$^{-1}$,\nrespectively. At a distance of 8.2 kpc, these correspond to position\nuncertainties of 3.7 AU and 6.9 AU and proper motion uncertainties of 2.7 km\ns$^{-1}$ and 4.6 km s$^{-1}$. The reference frame stability, the uncertainty in\nthe variance-weighted mean proper motion of the maser ensemble, is 8 $\\mu$as\nyr$^{-1}$ (0.30 km s$^{-1}$) in RA and 11 $\\mu$as yr$^{-1}$ (0.44 km s$^{-1}$)\nin Dec., which represents a 2.3-fold improvement over previous work and a new\nbenchmark for the maser-based reference frame.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:49:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Darling","Jeremy",""],["Paine","Jennie",""],["Reid","Mark J.",""],["Menten","Karl M.",""],["Sakai","Shoko",""],["Ghez","Andrea",""]]}
{"id":"2308.03148","submitter":"Tsviatko Rangelov","authors":"Nikolai Kutev and Tsviatko Rangelov","title":"Improved Hardy inequality with logarithmic term","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  New Hardy type inequality with double singular kernel and with additional\nlogarithmic term in a ball $B\\subset \\mathbb{R}^n$ is proved. As an application\nan estimate from below of the first eigenvalue for Dirichlet problem of\np-Laplacian in a bounded domain $\\Omega\\subset \\mathbb{R}^n$ is obtain.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:49:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kutev","Nikolai",""],["Rangelov","Tsviatko",""]]}
{"id":"2308.03149","submitter":"Jia Zhang","authors":"Jia Zhang, Rui Xi, Yuan He, Yimiao Sun, Xiuzhen Guo, Weiguo Wang, Xin\n  Na, Yunhao Liu, Zhenguo Shi, Tao Gu","title":"A Survey of mmWave-based Human Sensing: Technology, Platform and\n  Applications","comments":"30 pages, 17 figures, IEEE Survey & Tutorial","journal-ref":null,"doi":"10.1109/COMST.2023.3298300","report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the rapid development of the Internet of Things (IoT) and the rise of 5G\ncommunication networks and automatic driving, millimeter wave (mmWave) sensing\nis emerging and starts impacting our life and workspace. mmWave sensing can\nsense humans and objects in a contactless way, providing fine-grained sensing\nability. In the past few years, many mmWave sensing techniques have been\nproposed and applied in various human sensing applications (e.g., human\nlocalization, gesture recognition, and vital monitoring). We discover the need\nof a comprehensive survey to summarize the technology, platforms and\napplications of mmWave-based human sensing. In this survey, we first present\nthe mmWave hardware platforms and some key techniques of mmWave sensing. We\nthen provide a comprehensive review of existing mmWave-based human sensing\nworks. Specifically, we divide existing works into four categories according to\nthe sensing granularity: human tracking and localization, motion recognition,\nbiometric measurement and human imaging. Finally, we discuss the potential\nresearch challenges and present future directions in this area.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:53:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Jia",""],["Xi","Rui",""],["He","Yuan",""],["Sun","Yimiao",""],["Guo","Xiuzhen",""],["Wang","Weiguo",""],["Na","Xin",""],["Liu","Yunhao",""],["Shi","Zhenguo",""],["Gu","Tao",""]]}
{"id":"2308.03150","submitter":"Nemali Venkat Sai Abhishek","authors":"N V S Abhishek, Pushpak Bhattacharyya","title":"\"We care\": Improving Code Mixed Speech Emotion Recognition in\n  Customer-Care Conversations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Speech Emotion Recognition (SER) is the task of identifying the emotion\nexpressed in a spoken utterance. Emotion recognition is essential in building\nrobust conversational agents in domains such as law, healthcare, education, and\ncustomer support. Most of the studies published on SER use datasets created by\nemploying professional actors in a noise-free environment. In natural settings\nsuch as a customer care conversation, the audio is often noisy with speakers\nregularly switching between different languages as they see fit. We have worked\nin collaboration with a leading unicorn in the Conversational AI sector to\ndevelop Natural Speech Emotion Dataset (NSED). NSED is a natural code-mixed\nspeech emotion dataset where each utterance in a conversation is annotated with\nemotion, sentiment, valence, arousal, and dominance (VAD) values. In this\npaper, we show that by incorporating word-level VAD value we improve on the\ntask of SER by 2%, for negative emotions, over the baseline value for NSED.\nHigh accuracy for negative emotion recognition is essential because customers\nexpressing negative opinions/views need to be pacified with urgency, lest\ncomplaints and dissatisfaction snowball and get out of hand. Escalation of\nnegative opinions speedily is crucial for business interests. Our study then\ncan be utilized to develop conversational agents which are more polite and\nempathetic in such situations.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:56:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Abhishek","N V S",""],["Bhattacharyya","Pushpak",""]]}
{"id":"2308.03151","submitter":"Zheng Ma","authors":"Zheng Ma, Mianzhi Pan, Wenhan Wu, Kanzhi Cheng, Jianbing Zhang,\n  Shujian Huang and Jiajun Chen","title":"Food-500 Cap: A Fine-Grained Food Caption Benchmark for Evaluating\n  Vision-Language Models","comments":"Accepted at ACM Multimedia (ACMMM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision-language models (VLMs) have shown impressive performance in\nsubstantial downstream multi-modal tasks. However, only comparing the\nfine-tuned performance on downstream tasks leads to the poor interpretability\nof VLMs, which is adverse to their future improvement. Several prior works have\nidentified this issue and used various probing methods under a zero-shot\nsetting to detect VLMs' limitations, but they all examine VLMs using general\ndatasets instead of specialized ones. In practical applications, VLMs are\nusually applied to specific scenarios, such as e-commerce and news fields, so\nthe generalization of VLMs in specific domains should be given more attention.\nIn this paper, we comprehensively investigate the capabilities of popular VLMs\nin a specific field, the food domain. To this end, we build a food caption\ndataset, Food-500 Cap, which contains 24,700 food images with 494 categories.\nEach image is accompanied by a detailed caption, including fine-grained\nattributes of food, such as the ingredient, shape, and color. We also provide a\nculinary culture taxonomy that classifies each food category based on its\ngeographic origin in order to better analyze the performance differences of VLM\nin different regions. Experiments on our proposed datasets demonstrate that\npopular VLMs underperform in the food domain compared with their performance in\nthe general domain. Furthermore, our research reveals severe bias in VLMs'\nability to handle food items from different geographic regions. We adopt\ndiverse probing methods and evaluate nine VLMs belonging to different\narchitectures to verify the aforementioned observations. We hope that our study\nwill bring researchers' attention to VLM's limitations when applying them to\nthe domain of food or culinary cultures, and spur further investigations to\naddress this issue.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:56:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Zheng",""],["Pan","Mianzhi",""],["Wu","Wenhan",""],["Cheng","Kanzhi",""],["Zhang","Jianbing",""],["Huang","Shujian",""],["Chen","Jiajun",""]]}
{"id":"2308.03152","submitter":"Wei Xiong","authors":"Wei Xiong, Yanfei Xiang, Hao Wu, Shuyi Zhou, Yuze Sun, Muyuan Ma,\n  Xiaomeng Huang","title":"AI-GOMS: Large AI-Driven Global Ocean Modeling System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ocean modeling is a powerful tool for simulating the physical, chemical, and\nbiological processes of the ocean, which is the foundation for marine science\nresearch and operational oceanography. Modern numerical ocean modeling mainly\nconsists of governing equations and numerical algorithms. Nonlinear\ninstability, computational expense, low reusability efficiency and high\ncoupling costs have gradually become the main bottlenecks for the further\ndevelopment of numerical ocean modeling. Recently, artificial\nintelligence-based modeling in scientific computing has shown revolutionary\npotential for digital twins and scientific simulations, but the bottlenecks of\nnumerical ocean modeling have not been further solved. Here, we present\nAI-GOMS, a large AI-driven global ocean modeling system, for accurate and\nefficient global ocean daily prediction. AI-GOMS consists of a backbone model\nwith the Fourier-based Masked Autoencoder structure for basic ocean variable\nprediction and lightweight fine-tuning models incorporating regional\ndownscaling, wave decoding, and biochemistry coupling modules. AI-GOMS has\nachieved the best performance in 30 days of prediction for the global ocean\nbasic variables with 15 depth layers at 1/4{\\deg} spatial resolution. Beyond\nthe good performance in statistical metrics, AI-GOMS realizes the simulation of\nmesoscale eddies in the Kuroshio region at 1/12{\\deg} spatial resolution and\nocean stratification in the tropical Pacific Ocean. AI-GOMS provides a new\nbackbone-downstream paradigm for Earth system modeling, which makes the system\ntransferable, scalable and reusable.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:59:30 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 17:01:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Xiong","Wei",""],["Xiang","Yanfei",""],["Wu","Hao",""],["Zhou","Shuyi",""],["Sun","Yuze",""],["Ma","Muyuan",""],["Huang","Xiaomeng",""]]}
{"id":"2308.03153","submitter":"Bartlomiej Wiendlocha","authors":"Sylwia Gutowska, Alicja Kawala, Bartlomiej Wiendlocha","title":"Superconductivity near the Mott-Ioffe-Regel limit in the high-entropy\n  alloy superconductor (ScZrNb)$_{1-x}$(RhPd)$_x$ with a CsCl-type lattice","comments":"13 pages, 12 figures, accepted in Physical Review B","journal-ref":"Phys. Rev. B 108, 064507 (2023)","doi":"10.1103/PhysRevB.108.064507","report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Theoretical analysis of the electronic structure of the high-entropy-type\nsuperconductor (ScZrNb)$_{1-x}$(RhPd)$_x$, $x \\in (0.35, 0.45)$ is presented.\nThe studied material is a partially ordered CsCl-type structure, with two\nsublattices, randomly occupied by Sc, Zr, Nb (first sublattice) and Nb, Rh, and\nPd (second sublattice). Calculations were done using the Korringa-Kohn-Rostoker\nmethod with the coherent potential approximation (KKR-CPA) and take into\naccount the substitutional disorder. Our total energy calculations confirm the\npreference for the partially ordered structure over the fully random {\\it\nbcc}-type one. Electronic densities of states $N(E)$, dispersion relations, and\nMcMillan-Hopfield parameters $\\eta$ (electronic contribution to electron-phonon\ncoupling) are studied as a function of composition. The computed increasing\ntrends in $N(E_F)$ and $\\eta$ with $x$ are opposite to what we expected based\non the experimental results, where the decrease in the critical temperature\nwith increasing $x$ was found. Very strong electron scattering due to disorder\nis observed, as the electronic dispersion relations are strongly smeared. As a\nresult, the computed electronic lifetimes $\\tau$ are very short, leading to a\nsmall mean-free path of electrons of the order of interatomic distance, which\nputs (ScZrNb)$_{1-x}$(RhPd)$_x$ near the Mott-Ioffe-Regel limit. The trend in\n$\\tau(x)$ is similar to the trend observed experimentally in $T_c(x)$,\nsuggesting that disorder may be the factor that influences $T_c$ in this series\nof alloys.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:11:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gutowska","Sylwia",""],["Kawala","Alicja",""],["Wiendlocha","Bartlomiej",""]]}
{"id":"2308.03154","submitter":"Oleg Kovalenko","authors":"Oleg Kovalenko","title":"On optimization of cubature formulae for Sobolev classes of functions\n  defined on star domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We find asymptotically optimal methods of recovery of the integration\noperator given values of the function at a finite number of points for a class\nof multivariate functions defined on a bounded star domain that have bounded in\n$L_p$ norm of their distributional gradient; thus we generalize the known\nsolution of this optimization problem in the case, when the domain of\ndefinition of the functions is convex.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:16:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kovalenko","Oleg",""]]}
{"id":"2308.03155","submitter":"Anurag K. Singh","authors":"Bhargav Bhatt, Manuel Blickle, Gennady Lyubeznik, Anurag K. Singh,\n  Wenliang Zhang","title":"Applications of perverse sheaves in commutative algebra","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of this paper is to explain how basic properties of perverse sheaves\nsometimes translate via Riemann-Hilbert correspondences (in both characteristic\n$0$ and characteristic $p$) to highly non-trivial properties of singularities,\nespecially their local cohomology. Along the way, we develop a theory of\nperverse $\\mathbf{F}_p$-sheaves on varieties in characteristic $p$, expanding\non previous work by various authors, and including a strong version of the\nArtin vanishing theorem.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:19:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bhatt","Bhargav",""],["Blickle","Manuel",""],["Lyubeznik","Gennady",""],["Singh","Anurag K.",""],["Zhang","Wenliang",""]]}
{"id":"2308.03156","submitter":"Lingjun Liu","authors":"Lingjun Liu, Meichen Hou, Lingda Xu","title":"Vanishing viscosity limit to the planar rarefaction wave with vacuum for\n  3D compressible Navier-Stokes 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 construct a family of global in time solutions of the 3D\ncompressible Navier-Stokes (N-S) equations with temperature-dependent viscosity\nand heat-conductivity, and show that at arbitrary times {and arbitrary\nstrength} this family of solutions converges to planar rarefaction waves\nconnected to the vacuum as the viscosity vanishes in the sense of\n$L^{\\infty}(\\R^3)$. Different from \\cite{LWW2020,LWW2022}, which study the\nvanishing viscocity limit to rarefaction wave away from vaccum in the domain\n$\\Omega=\\mathbb{R} \\times \\mathbb{T}^2$ with $\\mathbb{T}^2=$ $(\\mathbb{R} /\n\\mathbb{Z})^2$ denoting a two-dimensional unit flat torus with periodic\nboundary condition, the Cauchy problem in $\\R^3$ is considered in this paper.\nSince planar rarefaction waves are not exact solutions of compressible N-S\nequations, we consider perturbations of the infinite global norm, particularly,\nperiodic perturbations. To deal with the infinite oscillation, we construct a\nsuitable ansatz carrying this periodic oscillation such that the difference\nbetween the solution and the ansatz belongs to some Sobolev space and thus the\nenergy method is feasible. Different from \\cite{HuangXuYuan2022}, because the\nviscosity is temperature-dependent and degeneracies are caused by vaccum, the a\npriori assumptions and two Gargliardo-Nirenberg type inequalities is\nessentially used. Next, more careful energy estimates are carried out in this\npaper, by studying the zero and non-zero modes of the solutions, we obtain not\nonly the convergence rate concerning the viscosity and heat conductivity\ncoefficients but also exponential time decay rate for the non-zero mode.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:21:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Lingjun",""],["Hou","Meichen",""],["Xu","Lingda",""]]}
{"id":"2308.03157","submitter":"Timo Laine Au","authors":"Timo Aukusti Laine","title":"Local symmetries, anomalies and constrains in Burgers Turbulence","comments":"10 pages. Details added and typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We study stochastic Burgers turbulence without pressure. We first show that\nthe variational derivative of the Burgers equation is dependent on the velocity\nfield, suggesting the existence of an anomaly. The anomaly is created by an\noperator that is non-self-adjoint. To calculate it correctly, we need to find\nits square. There are similarities with conformal and chiral two-dimensional\nfield theories, but causality is the key that makes the difference. We find a\nlocal symmetry for the Burgers equation that is broken by the anomaly. By\nrequiring the disappearance of this anomaly, the velocity field is constrained\nand local symmetry is maintained. This symmetry follows Kolmogorov's second law\nof self-similarity. One can choose an anomaly-free theory, a partially broken\ntheory, or a fully broken theory by choosing the constraint appropriately.\nThere is an analogy to gauge fixing or vacuum selection which define the local\nconfiguration.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:49:15 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 10:20:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Laine","Timo Aukusti",""]]}
{"id":"2308.03158","submitter":"C\\'esar Fosco","authors":"C. D. Fosco and G. Hansen","title":"Dynamical Casimir effect for fermions in 2+1 dimensions","comments":"16 pages, LaTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the fermion pair creation phenomenon due to the time dependence of\ncurves, where boundary conditions are imposed on a Dirac field in 2+1\ndimensions. These conditions, which lead to non-trivial relations for the\nnormal component of the fermionic current, depend on the value of a\ndimensionless parameter. We show that the pair creation effect is maximized for\nbag boundary conditions, obtained for a particular value of that parameter. The\neffect is studied in terms of the effective action to extract information on\nthe probability of vacuum decay, using an expansion in powers of the\ndeformation of the curves with respect to straight lines. We demonstrate that\nthe first non-trivial contributions to this process can be obtained from the\nelectromagnetic vacuum polarization tensor for a Dirac field coupled to static\nboundaries.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:54:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fosco","C. D.",""],["Hansen","G.",""]]}
{"id":"2308.03159","submitter":"Byeong-Ho Bahn","authors":"Byeong-Ho Bahn","title":"Semilinear elliptic eigenvalue problem: Parametric analyticity and the\n  uncertainty quantification","comments":"31 pages, 0 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, to the best of our knowledge, we make the first attempt at\nstudying the parametric semilinear elliptic eigenvalue problems with the\nparametric coefficient and some power-type nonlinearities. The parametric\ncoefficient is assumed to have an affine dependence on the countably many\nparameters with an appropriate class of sequences of functions. In this paper,\nwe obtain the upper bound estimation for the mixed derivatives of the ground\neigenpairs that has the same form obtained recently for the linear eigenvalue\nproblem. The three most essential ingredients for this estimation are the\nparametric analyticity of the ground eigenpairs, the uniform boundedness of the\nground eigenpairs, and the uniform positive differences between ground\neigenvalues of linear operators. All these three ingredients need new\ntechniques and a careful investigation of the nonlinear eigenvalue problem that\nwill be presented in this paper. As an application, considering each parameter\nas a uniformly distributed random variable, we estimate the expectation of the\neigenpairs using a randomly shifted quasi-Monte Carlo lattice rule and show the\ndimension-independent error bound.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:57:18 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 17:45:32 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 22:01:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bahn","Byeong-Ho",""]]}
{"id":"2308.03160","submitter":"Emanuele Goldoni","authors":"Emanuele Goldoni, Ledo Stefanini","title":"Enrico Fermi: a forgotten article written for Italian teachers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph physics.ed-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1929, Enrico Fermi wrote \"Problemi attuali della fisica\" (\"Contemporary\nProblems of Physics\"), a short article in Italian published in the magazine\n\"Annali dell'istruzione media\". The magazine was sponsored by the Italian\nMinistry of Schooling and Education, and it was addressed to teachers and\nprincipals of middle and high schools. This short text written by Fermi had\nbeen forgotten for a long time. However, in recent years it has been\nrepublished in Italy; moreover, the \"Annali dell'istruzione media\" have been\ndigitized and made freely available online. It is unclear why Fermi wrote an\narticle of a clearly divulgative nature for a non-technical journal, but is\nstill interesting to to read his words and appreciate his skills as a great\nscientific communicator. In this work we include the transcription of the\noriginal article in Italian, and we also propose an English translation to make\nthe text available world-wide and accessible to a broader public.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 16:58:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Goldoni","Emanuele",""],["Stefanini","Ledo",""]]}
{"id":"2308.03161","submitter":"Rafa\\\"el Brandt","authors":"Rafa\\\"el Brandt, Daan Raatjens, Georgi Gaydadjiev","title":"Precise Benchmarking of Explainable AI Attribution Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rationale behind a deep learning model's output is often difficult to\nunderstand by humans. EXplainable AI (XAI) aims at solving this by developing\nmethods that improve interpretability and explainability of machine learning\nmodels. Reliable evaluation metrics are needed to assess and compare different\nXAI methods. We propose a novel evaluation approach for benchmarking\nstate-of-the-art XAI attribution methods. Our proposal consists of a synthetic\nclassification model accompanied by its derived ground truth explanations\nallowing high precision representation of input nodes contributions. We also\npropose new high-fidelity metrics to quantify the difference between\nexplanations of the investigated XAI method and those derived from the\nsynthetic model. Our metrics allow assessment of explanations in terms of\nprecision and recall separately. Also, we propose metrics to independently\nevaluate negative or positive contributions of inputs. Our proposal provides\ndeeper insights into XAI methods output. We investigate our proposal by\nconstructing a synthetic convolutional image classification model and\nbenchmarking several widely used XAI attribution methods using our evaluation\napproach. We compare our results with established prior XAI evaluation metrics.\nBy deriving the ground truth directly from the constructed model in our method,\nwe ensure the absence of bias, e.g., subjective either based on the training\nset. Our experimental results provide novel insights into the performance of\nGuided-Backprop and Smoothgrad XAI methods that are widely in use. Both have\ngood precision and recall scores among positively contributing pixels (0.7,\n0.76 and 0.7, 0.77, respectively), but poor precision scores among negatively\ncontributing pixels (0.44, 0.61 and 0.47, 0.75, resp.). The recall scores in\nthe latter case remain close. We show that our metrics are among the fastest in\nterms of execution time.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:03:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Brandt","Rafa\u00ebl",""],["Raatjens","Daan",""],["Gaydadjiev","Georgi",""]]}
{"id":"2308.03162","submitter":"Xinyang Ge","authors":"Xinyang Ge, Joanna A. Zieli\\'nska and Sergio Maldonado","title":"High-precision interferometric measurement of rapid temperature changes\n  in convective flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using interferometry, we measure rapid temperature variations in convective\nflow to within a few mK. This is enabled by the fast response time and high\nsensitivity of the interferometer to minute changes in the refractive index of\nthe test fluid caused by temperature variations. These features allow us to\ndetect the signature of fine fluid dynamical patters in convective flow in a\nfully non-intrusive manner. For example, we are able to observe an asymmetry in\nthe rising thermal plume (i.e. an asynchronous arrival of two counter-rotating\nvortices at the measurement location), which is not possible to resolve with\nmore traditional (and invasive) techniques, such as RTD (Resistance Temperature\nDetector) sensors. These findings, and the overall reliability of our method,\nare further corroborated by means of Particle Image Velocimetry and Large Eddy\nSimulations. The non-intrusive nature of this method, along with its robustness\nand the ability to readily yield real-time, highly accurate measurements,\nrender this technique very attractive for a wide range of applications in\nexperimental fluid dynamics.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:15:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ge","Xinyang",""],["Zieli\u0144ska","Joanna A.",""],["Maldonado","Sergio",""]]}
{"id":"2308.03163","submitter":"Md Farhamdur Reza","authors":"Md Farhamdur Reza, Ali Rahmati, Tianfu Wu, Huaiyu Dai","title":"CGBA: Curvature-aware Geometric Black-box Attack","comments":"This paper is accepted to publish in ICCV","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Decision-based black-box attacks often necessitate a large number of queries\nto craft an adversarial example. Moreover, decision-based attacks based on\nquerying boundary points in the estimated normal vector direction often suffer\nfrom inefficiency and convergence issues. In this paper, we propose a novel\nquery-efficient curvature-aware geometric decision-based black-box attack\n(CGBA) that conducts boundary search along a semicircular path on a restricted\n2D plane to ensure finding a boundary point successfully irrespective of the\nboundary curvature. While the proposed CGBA attack can work effectively for an\narbitrary decision boundary, it is particularly efficient in exploiting the low\ncurvature to craft high-quality adversarial examples, which is widely seen and\nexperimentally verified in commonly used classifiers under non-targeted\nattacks. In contrast, the decision boundaries often exhibit higher curvature\nunder targeted attacks. Thus, we develop a new query-efficient variant, CGBA-H,\nthat is adapted for the targeted attack. In addition, we further design an\nalgorithm to obtain a better initial boundary point at the expense of some\nextra queries, which considerably enhances the performance of the targeted\nattack. Extensive experiments are conducted to evaluate the performance of our\nproposed methods against some well-known classifiers on the ImageNet and\nCIFAR10 datasets, demonstrating the superiority of CGBA and CGBA-H over\nstate-of-the-art non-targeted and targeted attacks, respectively. The source\ncode is available at https://github.com/Farhamdur/CGBA.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:18:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Reza","Md Farhamdur",""],["Rahmati","Ali",""],["Wu","Tianfu",""],["Dai","Huaiyu",""]]}
{"id":"2308.03164","submitter":"Yue Hu","authors":"Yue Hu, Xinan Ye, Yifei Liu, Souvik Kundu, Gourav Datta, Srikar\n  Mutnuri, Namo Asavisanu, Nora Ayanian, Konstantinos Psounis, Peter Beerel","title":"FireFly A Synthetic Dataset for Ember Detection in Wildfire","comments":"Artificial Intelligence (AI) and Humanitarian Assistance and Disaster\n  Recovery (HADR) workshop, ICCV 2023 in Paris, France","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 \"FireFly\", a synthetic dataset for ember detection\ncreated using Unreal Engine 4 (UE4), designed to overcome the current lack of\nember-specific training resources. To create the dataset, we present a tool\nthat allows the automated generation of the synthetic labeled dataset with\nadjustable parameters, enabling data diversity from various environmental\nconditions, making the dataset both diverse and customizable based on user\nrequirements. We generated a total of 19,273 frames that have been used to\nevaluate FireFly on four popular object detection models. Further to minimize\nhuman intervention, we leveraged a trained model to create a semi-automatic\nlabeling process for real-life ember frames. Moreover, we demonstrated an up to\n8.57% improvement in mean Average Precision (mAP) in real-world wildfire\nscenarios compared to models trained exclusively on a small real dataset.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:19:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hu","Yue",""],["Ye","Xinan",""],["Liu","Yifei",""],["Kundu","Souvik",""],["Datta","Gourav",""],["Mutnuri","Srikar",""],["Asavisanu","Namo",""],["Ayanian","Nora",""],["Psounis","Konstantinos",""],["Beerel","Peter",""]]}
{"id":"2308.03165","submitter":"Wei Cai","authors":"Zhonghao Lin, Haihan Duan, Jiaye Li, Xinyao Sun, Wei Cai","title":"MetaCast: A Self-Driven Metaverse Announcer Architecture Based on\n  Quality of Experience Evaluation Model","comments":null,"journal-ref":null,"doi":"10.1145/3581783.3613761","report-no":null,"categories":"cs.MM cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Metaverse provides users with a novel experience through immersive multimedia\ntechnologies. Along with the rapid user growth, numerous events bursting in the\nmetaverse necessitate an announcer to help catch and monitor ongoing events.\nHowever, systems on the market primarily serve for esports competitions and\nrely on human directors, making it challenging to provide 24-hour delivery in\nthe metaverse persistent world. To fill the blank, we proposed a three-stage\narchitecture for metaverse announcers, which is designed to identify events,\nposition cameras, and blend between shots. Based on the architecture, we\nintroduced a Metaverse Announcer User Experience (MAUE) model to identify the\nfactors affecting the users' Quality of Experience (QoE) from a human-centered\nperspective. In addition, we implemented \\textit{MetaCast}, a practical\nself-driven metaverse announcer in a university campus metaverse prototype, to\nconduct user studies for MAUE model. The experimental results have effectively\nachieved satisfactory announcer settings that align with the preferences of\nmost users, encompassing parameters such as video transition rate, repetition\nrate, importance threshold value, and image composition.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:21:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lin","Zhonghao",""],["Duan","Haihan",""],["Li","Jiaye",""],["Sun","Xinyao",""],["Cai","Wei",""]]}
{"id":"2308.03166","submitter":"Chunming He","authors":"Chunming He, Kai Li, Yachao Zhang, Yulun Zhang, Zhenhua Guo, Xiu Li,\n  Martin Danelljan, Fisher Yu","title":"Strategic Preys Make Acute Predators: Enhancing Camouflaged Object\n  Detectors by Generating Camouflaged Objects","comments":"10 pages, 7 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Camouflaged object detection (COD) is the challenging task of identifying\ncamouflaged objects visually blended into surroundings. Albeit achieving\nremarkable success, existing COD detectors still struggle to obtain precise\nresults in some challenging cases. To handle this problem, we draw inspiration\nfrom the prey-vs-predator game that leads preys to develop better camouflage\nand predators to acquire more acute vision systems and develop algorithms from\nboth the prey side and the predator side. On the prey side, we propose an\nadversarial training framework, Camouflageator, which introduces an auxiliary\ngenerator to generate more camouflaged objects that are harder for a COD method\nto detect. Camouflageator trains the generator and detector in an adversarial\nway such that the enhanced auxiliary generator helps produce a stronger\ndetector. On the predator side, we introduce a novel COD method, called\nInternal Coherence and Edge Guidance (ICEG), which introduces a camouflaged\nfeature coherence module to excavate the internal coherence of camouflaged\nobjects, striving to obtain more complete segmentation results. Additionally,\nICEG proposes a novel edge-guided separated calibration module to remove false\npredictions to avoid obtaining ambiguous boundaries. Extensive experiments show\nthat ICEG outperforms existing COD detectors and Camouflageator is flexible to\nimprove various COD detectors, including ICEG, which brings state-of-the-art\nCOD performance.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:27:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["He","Chunming",""],["Li","Kai",""],["Zhang","Yachao",""],["Zhang","Yulun",""],["Guo","Zhenhua",""],["Li","Xiu",""],["Danelljan","Martin",""],["Yu","Fisher",""]]}
{"id":"2308.03167","submitter":"Anima Ghosh","authors":"Anima Ghosh, Shyam Narayan Singh Yadav, Ming-Hsiu Tsai, Abhishek\n  Dubey, Shangjr Gwo, Chih-Ting Lin, and Ta- Jen Yen","title":"Superior visible photoelectric response with Au/Cu2NiSnS4 core-shell\n  nanocrystals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The incorporation of plasmonic metal nanostructures into semiconducting\nchalcogenides, in the form of core-shell structures, represents a promising\napproach to boosting the performance of photodetectors. In this study, we\ncombined Au nanoparticles with newly developed copper-based chalcogenides\nCu2NiSnS4 (Au/CNTS), to achieve an ultrahigh optoelectronic response in the\nvisible regime. The high-quality Au/CNTS core-shell structure was synthesized\nby developing a unique colloidal hot-injection method, which allowed excellent\ncontrol over sizes, shapes, and elemental compositions. The fabricated Au/CNTS\nhybrid core-shell structure exhibited enhanced optical absorption, carrier\nextraction efficiency, and improved photo-sensing performance, owing to the\nplasmonic-induced resonance energy transfer effect of the Au core. This effect\nled to a significant increase in carrier density between the Au core and CNTS\nshell. These values outperformed a CNTS-based gate-free visible photodetector.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:27:35 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 05:55:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghosh","Anima",""],["Yadav","Shyam Narayan Singh",""],["Tsai","Ming-Hsiu",""],["Dubey","Abhishek",""],["Gwo","Shangjr",""],["Lin","Chih-Ting",""],["Yen","Ta- Jen",""]]}
{"id":"2308.03168","submitter":"Jonas Habel","authors":"Jonas Habel (1 and 2), Alexander Mook (3 and 1), Josef Willsher (1 and\n  2) and Johannes Knolle (1 and 2 and 4) ((1) Technical University of Munich,\n  (2) Munich Center for Quantum Science and Technology, (3) Johannes\n  Gutenberg-University Mainz, (4) Blackett Laboratory London)","title":"Breakdown of Chiral Edge Modes in Topological Magnon Insulators","comments":"23 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Topological magnon insulators (TMI) are ordered magnets supporting chiral\nedge magnon excitations. These edge states are envisioned to serve as\ntopologically protected information channels in low-loss magnonic devices. The\nstandard description of TMI is based on linear spin-wave theory (LSWT), which\napproximates magnons as free non-interacting particles. However, magnon\nexcitations of TMI are genuinely interacting even at zero temperature, calling\ninto question descriptions based on LSWT alone. Here we perform a detailed\nnon-linear spin-wave analysis to investigate the stability of chiral edge\nmagnons. We identify three general breakdown mechanisms: (1) The edge magnon\ncouples to itself, generating a finite lifetime that can be large enough to\nlead to a spectral annihilation of the chiral state; (2) The edge magnon\nhybridizes with the extended bulk magnons and, as a consequence, delocalizes\naway from the edge; (3) Due to a bulk-magnon mediated edge-to-edge coupling,\nthe chiral magnons at opposite edges hybridize. We argue that, in general,\nthese breakdown mechanisms may invalidate predictions based on LSWT and violate\nthe notion of topological protection. We discuss strategies how the breakdown\nof chiral edge magnons can be avoided, e.g. via the application of large\nmagnetic fields. Our results highlight a challenge for the realization of\nchiral edge states in TMI and in other bosonic topological systems without\nparticle number conservation.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:33:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Habel","Jonas","","1 and 2"],["Mook","Alexander","","3 and 1"],["Willsher","Josef","","1 and\n  2"],["Knolle","Johannes","","1 and 2 and 4"]]}
{"id":"2308.03169","submitter":"Elvin Jiang","authors":"Fan Jiang, Elvin Jiang","title":"Effects From Extra Die Rolls and Choosing the Highest or Lowest","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper looks into the gain or loss from rolling a fair die multiple times\nand choosing the highest or lowest number as the outcome over rolling the die\njust once. Specifically, this paper gives a general formula for the expected\nvalue of choosing the highest or lowest value of any number of die rolls and\nsides. It also shows how, for a fixed number of rolls, the ratio between this\nexpected value and the number of sides converges as the number of sides\nincreases asymptotically. The converging behavior of this ratio helps formulate\nthe aforementioned gain or loss.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:37:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jiang","Fan",""],["Jiang","Elvin",""]]}
{"id":"2308.03170","submitter":"Keisuke Okamura","authors":"Keisuke Okamura","title":"Dynamic development of public attitudes towards science policymaking","comments":"Main Text: 18 pages (4 figures); Supplementary Materials: 17 pages (3\n  figures)","journal-ref":"Public Underst. Sci. 25 (2016) 465-479","doi":"10.1177/0963662515605420","report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the heterogeneity of mechanisms that form public attitudes\ntowards science and technology policymaking is essential to the establishment\nof an effective public engagement platform. Using the 2011 public opinion\nsurvey data from Japan (n = 6,136), I divided the general public into three\ncategories: the Attentive public, who are willing to actively engage with\nscience and technology policymaking dialogue; the Interested public, who have\nmoderate interest in science and technology but rely on experts for policy\ndecisions; and the Residual public, who have minimal interest in science and\ntechnology. On the basis of the results of multivariate regression analysis, I\nhave identified several key predispositions towards science and technology and\nother socio-demographic characteristics that influence the shift of individuals\nfrom one category of the general public to another. The findings provide a\nfoundation for understanding how to induce more accountable, evidence-based\nscience and technology policymaking.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:37:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Okamura","Keisuke",""]]}
{"id":"2308.03171","submitter":"Christos Diou","authors":"Anastasios Iliopoulos, John Violos, Christos Diou and Iraklis Varlamis","title":"Detection of Anomalies in Multivariate Time Series Using Ensemble\n  Techniques","comments":"Accepted for publication in the 2023 IEEE Big Data Service conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Anomaly Detection in multivariate time series is a major problem in many\nfields. Due to their nature, anomalies sparsely occur in real data, thus making\nthe task of anomaly detection a challenging problem for classification\nalgorithms to solve. Methods that are based on Deep Neural Networks such as\nLSTM, Autoencoders, Convolutional Autoencoders etc., have shown positive\nresults in such imbalanced data. However, the major challenge that algorithms\nface when applied to multivariate time series is that the anomaly can arise\nfrom a small subset of the feature set. To boost the performance of these base\nmodels, we propose a feature-bagging technique that considers only a subset of\nfeatures at a time, and we further apply a transformation that is based on\nnested rotation computed from Principal Component Analysis (PCA) to improve the\neffectiveness and generalization of the approach. To further enhance the\nprediction performance, we propose an ensemble technique that combines multiple\nbase models toward the final decision. In addition, a semi-supervised approach\nusing a Logistic Regressor to combine the base models' outputs is proposed. The\nproposed methodology is applied to the Skoltech Anomaly Benchmark (SKAB)\ndataset, which contains time series data related to the flow of water in a\nclosed circuit, and the experimental results show that the proposed ensemble\ntechnique outperforms the basic algorithms. More specifically, the performance\nimprovement in terms of anomaly detection accuracy reaches 2% for the\nunsupervised and at least 10% for the semi-supervised models.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:51:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Iliopoulos","Anastasios",""],["Violos","John",""],["Diou","Christos",""],["Varlamis","Iraklis",""]]}
{"id":"2308.03172","submitter":"Shuang Ao","authors":"Shuang Ao, Stefan Rueger, Advaith Siddharthan","title":"Two Sides of Miscalibration: Identifying Over and Under-Confidence\n  Prediction for Network Calibration","comments":"9 pages","journal-ref":"2023","doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Proper confidence calibration of deep neural networks is essential for\nreliable predictions in safety-critical tasks. Miscalibration can lead to model\nover-confidence and/or under-confidence; i.e., the model's confidence in its\nprediction can be greater or less than the model's accuracy. Recent studies\nhave highlighted the over-confidence issue by introducing calibration\ntechniques and demonstrated success on various tasks. However, miscalibration\nthrough under-confidence has not yet to receive much attention. In this paper,\nwe address the necessity of paying attention to the under-confidence issue. We\nfirst introduce a novel metric, a miscalibration score, to identify the overall\nand class-wise calibration status, including being over or under-confident. Our\nproposed metric reveals the pitfalls of existing calibration techniques, where\nthey often overly calibrate the model and worsen under-confident predictions.\nThen we utilize the class-wise miscalibration score as a proxy to design a\ncalibration technique that can tackle both over and under-confidence. We report\nextensive experiments that show our proposed methods substantially\noutperforming existing calibration techniques. We also validate our proposed\ncalibration technique on an automatic failure detection task with a\nrisk-coverage curve, reporting that our methods improve failure detection as\nwell as trustworthiness of the model. The code are available at\n\\url{https://github.com/AoShuang92/miscalibration_TS}.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:59:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ao","Shuang",""],["Rueger","Stefan",""],["Siddharthan","Advaith",""]]}
{"id":"2308.03173","submitter":"Giorgos Kapetanakis","authors":"Giorgos Kapetanakis and Ioannis Rizos","title":"Teaching perspectives of the Frobenius coin problem of two denominators","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $a,b$ be positive, relatively prime, integers. Our goal is to\ncharacterize, in an elementary way, all positive integers $c$ that can be\nexpressed as a linear combination of $a,b$ with non-negative integer\ncoefficients and discuss the teaching perspectives of our methods.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 17:59:54 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 05:52:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kapetanakis","Giorgos",""],["Rizos","Ioannis",""]]}
{"id":"2308.03174","submitter":"Natalia Maslova","authors":"N.V. Maslova","title":"Finite simple groups with two maximal subgroups of coprime orders","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 1962, V.A. Belonogov proved that if a finite group $G$ contains two\nmaximal subgroups of coprime orders, then either $G$ is one of known solvable\ngroups or $G$ is simple. In this short note based on results by M. Liebeck and\nJ. Saxl on odd order maximal subgroups in finite simple groups we determine\npossibilities for triples $(G,H,M)$, where $G$ is a finite nonabelian simple\ngroup, $H$ and $M$ are maximal subgroups of $G$ with $(|H|,|M|)=1$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:04:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Maslova","N. V.",""]]}
{"id":"2308.03175","submitter":"Rongguang Wang","authors":"Rongguang Wang, Guray Erus, Pratik Chaudhari, Christos Davatzikos","title":"Adapting Machine Learning Diagnostic Models to New Populations Using a\n  Small Amount of Data: Results from Clinical Neuroscience","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.IV q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) has shown great promise for revolutionizing a number of\nareas, including healthcare. However, it is also facing a reproducibility\ncrisis, especially in medicine. ML models that are carefully constructed from\nand evaluated on a training set might not generalize well on data from\ndifferent patient populations or acquisition instrument settings and protocols.\nWe tackle this problem in the context of neuroimaging of Alzheimer's disease\n(AD), schizophrenia (SZ) and brain aging. We develop a weighted empirical risk\nminimization approach that optimally combines data from a source group, e.g.,\nsubjects are stratified by attributes such as sex, age group, race and clinical\ncohort to make predictions on a target group, e.g., other sex, age group, etc.\nusing a small fraction (10%) of data from the target group. We apply this\nmethod to multi-source data of 15,363 individuals from 20 neuroimaging studies\nto build ML models for diagnosis of AD and SZ, and estimation of brain age. We\nfound that this approach achieves substantially better accuracy than existing\ndomain adaptation techniques: it obtains area under curve greater than 0.95 for\nAD classification, area under curve greater than 0.7 for SZ classification and\nmean absolute error less than 5 years for brain age prediction on all target\ngroups, achieving robustness to variations of scanners, protocols, and\ndemographic or clinical characteristics. In some cases, it is even better than\ntraining on all data from the target group, because it leverages the diversity\nand size of a larger training set. We also demonstrate the utility of our\nmodels for prognostic tasks such as predicting disease progression in\nindividuals with mild cognitive impairment. Critically, our brain age\nprediction models lead to new clinical insights regarding correlations with\nneurophysiological tests.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:05:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Rongguang",""],["Erus","Guray",""],["Chaudhari","Pratik",""],["Davatzikos","Christos",""]]}
{"id":"2308.03176","submitter":"Shuang Ao","authors":"Shuang Ao","title":"Building Safe and Reliable AI systems for Safety Critical Tasks with\n  Vision-Language Processing","comments":"4 pages","journal-ref":"2023","doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although AI systems have been applied in various fields and achieved\nimpressive performance, their safety and reliability are still a big concern.\nThis is especially important for safety-critical tasks. One shared\ncharacteristic of these critical tasks is their risk sensitivity, where small\nmistakes can cause big consequences and even endanger life. There are several\nfactors that could be guidelines for the successful deployment of AI systems in\nsensitive tasks: (i) failure detection and out-of-distribution (OOD) detection;\n(ii) overfitting identification; (iii) uncertainty quantification for\npredictions; (iv) robustness to data perturbations. These factors are also\nchallenges of current AI systems, which are major blocks for building safe and\nreliable AI. Specifically, the current AI algorithms are unable to identify\ncommon causes for failure detection. Furthermore, additional techniques are\nrequired to quantify the quality of predictions. All these contribute to\ninaccurate uncertainty quantification, which lowers trust in predictions. Hence\nobtaining accurate model uncertainty quantification and its further improvement\nare challenging. To address these issues, many techniques have been proposed,\nsuch as regularization methods and learning strategies. As vision and language\nare the most typical data type and have many open source benchmark datasets,\nthis thesis will focus on vision-language data processing for tasks like\nclassification, image captioning, and vision question answering. In this\nthesis, we aim to build a safeguard by further developing current techniques to\nensure the accurate model uncertainty for safety-critical tasks.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:05:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ao","Shuang",""]]}
{"id":"2308.03177","submitter":"Zhenhua Ning","authors":"Zhenhua Ning, Zhuotao Tian, Guangming Lu, Wenjie Pei","title":"Boosting Few-shot 3D Point Cloud Segmentation via Query-Guided\n  Enhancement","comments":"Accepted to ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although extensive research has been conducted on 3D point cloud\nsegmentation, effectively adapting generic models to novel categories remains a\nformidable challenge. This paper proposes a novel approach to improve point\ncloud few-shot segmentation (PC-FSS) models. Unlike existing PC-FSS methods\nthat directly utilize categorical information from support prototypes to\nrecognize novel classes in query samples, our method identifies two critical\naspects that substantially enhance model performance by reducing contextual\ngaps between support prototypes and query features. Specifically, we (1) adapt\nsupport background prototypes to match query context while removing extraneous\ncues that may obscure foreground and background in query samples, and (2)\nholistically rectify support prototypes under the guidance of query features to\nemulate the latter having no semantic gap to the query targets. Our proposed\ndesigns are agnostic to the feature extractor, rendering them readily\napplicable to any prototype-based methods. The experimental results on S3DIS\nand ScanNet demonstrate notable practical benefits, as our approach achieves\nsignificant improvements while still maintaining high efficiency. The code for\nour approach is available at\nhttps://github.com/AaronNZH/Boosting-Few-shot-3D-Point-Cloud-Segmentation-via-Query-Guided-Enhancement\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:07:45 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 05:26:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ning","Zhenhua",""],["Tian","Zhuotao",""],["Lu","Guangming",""],["Pei","Wenjie",""]]}
{"id":"2308.03178","submitter":"Denys Slobodianiuk","authors":"Denys Slobodianiuk","title":"The set of limits of Riemann integral sums of a multifunction and Banach\n  space geometry","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be a Banach space and $F: [0, 1] \\rightarrow 2^{X} \\setminus \\{\n\\varnothing \\}$ be a bounded multifunction. We study properties of the set\n$I(F)$ of limits in Hausdorff distance of Riemann integral sums of $F$. The\nmain results are:\n  (1) $I(F)$ is convex in the case of finite-dimensional $X$;\n  (2) $I(F) = I(\\operatorname{conv} F)$ in B-convex spaces or for\ncompact-valued multifunctions;\n  (3) $I(F)$ consists of convex sets whenever $X$ is B-convex;\n  (4) $I(F)$ is star-shaped (thus non-empty) for compact-valued multifunctions\nin separable spaces.\n  (5) For each infinite-dimensional Banach space there is a bounded\nmultifunction with empty $I(F)$.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:10:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Slobodianiuk","Denys",""]]}
{"id":"2308.03179","submitter":"Shuang Ao","authors":"Shuang Ao, Stefan Rueger, Advaith Siddharthan","title":"Empirical Optimal Risk to Quantify Model Trustworthiness for Failure\n  Detection","comments":"7 pages","journal-ref":"2023","doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Failure detection (FD) in AI systems is a crucial safeguard for the\ndeployment for safety-critical tasks. The common evaluation method of FD\nperformance is the Risk-coverage (RC) curve, which reveals the trade-off\nbetween the data coverage rate and the performance on accepted data. One common\nway to quantify the RC curve by calculating the area under the RC curve.\nHowever, this metric does not inform on how suited any method is for FD, or\nwhat the optimal coverage rate should be. As FD aims to achieve higher\nperformance with fewer data discarded, evaluating with partial coverage\nexcluding the most uncertain samples is more intuitive and meaningful than full\ncoverage. In addition, there is an optimal point in the coverage where the\nmodel could achieve ideal performance theoretically. We propose the Excess Area\nUnder the Optimal RC Curve (E-AUoptRC), with the area in coverage from the\noptimal point to the full coverage. Further, the model performance at this\noptimal point can represent both model learning ability and calibration. We\npropose it as the Trust Index (TI), a complementary evaluation metric to the\noverall model accuracy. We report extensive experiments on three benchmark\nimage datasets with ten variants of transformer and CNN models. Our results\nshow that our proposed methods can better reflect the model trustworthiness\nthan existing evaluation metrics. We further observe that the model with high\noverall accuracy does not always yield the high TI, which indicates the\nnecessity of the proposed Trust Index as a complementary metric to the model\noverall accuracy. The code are available at\n\\url{https://github.com/AoShuang92/optimal_risk}.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:11:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ao","Shuang",""],["Rueger","Stefan",""],["Siddharthan","Advaith",""]]}
{"id":"2308.03180","submitter":"Gaurav Saxena","authors":"G. Saxena and A. Jain","title":"Cluster radioactivity from trans-tin to superheavy region using an\n  improved empirical formula","comments":"12 pages, 2 Figures, 5 Tables, Accepted in European Physics Journal A","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A simple relation $(aZ_{c} + b)(Z_{d}/Q)^{1/2} + (cZ_{c} + d)$ of estimation\nof the half-life of cluster emission is further improved for cluster and\n$\\alpha$-decays, separately, by incorporating isospin of parent nucleus as well\nas angular momentum taken away by the emitted particle. This improved version\nis not only found robust in producing experimental half-lives belonging to the\ntrans-tin and trans-lead regions but also elucidates cluster emission in\nsuperheavy nuclei over the usual $\\alpha$-decay. Considering daughter nuclei\naround the doubly magic $^{100}$Sn and $^{208}$Pb nuclei for trans-tin and\ntrans-lead (including superheavy) parents, respectively, a systematic and\nextensive study of 56$\\leq$Z$\\leq$120 isotopes is performed for the light and\nheavy cluster emissions. A fair competition among cluster emission,\n$\\alpha$-decay, spontaneous fission, and $\\beta$-decay is observed in this\nbroad range resulting in a substantial probability of C to Sr clusters from\nseveral nuclei, which demonstrates the adequacy of shell effects. The present\narticle proposes a single, improved, latest-fitted, and effective formula of\ncluster radioactivity that can be used to estimate precise half-lives for a\nwide range of the periodic chart from trans-tin to superheavy nuclei.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:15:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Saxena","G.",""],["Jain","A.",""]]}
{"id":"2308.03181","submitter":"Tornike Shubitidze","authors":"Yaraslau Tamashevich, Tornike Shubitidze, Luca Dal Negro, Marco\n  Ornigotti","title":"Field theory description of the non-perturbative optical nonlinearity of\n  epsilon-near-zero media","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we introduce a fully non-perturbative approach for the\ndescription of the optical nonlinearity of epsilonnear-zero (ENZ) media. In\nparticular, based on the rigorous Feynman path integral method, we develop a\ndressed Lagrangian field theory for light-matter interactions and discuss its\napplication to dispersive Kerr media with order-of-unity light-induced\nrefractive index variations. Specifically, considering the relevant case of\nIndium Tin Oxide (ITO) nonlinearities, we address the novel regime of\nnon-perturbative refractive index variations in ENZ media and establish that it\nfollows naturally from a scalar field theory with a Born-Infeld (BI)\nLagrangian. Our results extend the HuttnerBarnett-Bechler electrodynamics model\nto the case of non-perturbative optical Kerr media providing an intrinsically\nnonlinear, field-theoretic framework for understanding the exceptional\nnonlinearity of ITO materials beyond traditional perturbation theory\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:18:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tamashevich","Yaraslau",""],["Shubitidze","Tornike",""],["Negro","Luca Dal",""],["Ornigotti","Marco",""]]}
{"id":"2308.03182","submitter":"Kaiyuan Xu","authors":"Kaiyuan Xu, Christos G. Cassandras","title":"Scaling up the Optimal Safe Control of Connected and Automated Vehicles\n  to a Traffic Network: A Hierarchical Framework of Modular Control Zones","comments":"arXiv admin note: substantial text overlap with arXiv:2203.04348","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 the problem of scaling up optimal and safe controllers for\nConnected and Automated Vehicles (CAVs) from a single Control Zone (CZ) around\na traffic conflict area to an entire network. The goal is to jointly minimize\ntravel time and energy consumption for all CAVs, while providing\nspeed-dependent safety guarantees within a CZ and satisfying velocity and\nacceleration constraints. A hierarchical modular CZ framework is developed\nconsisting of a lower level where decentralized controllers are used that\ncombine Optimal control and Control Barrier Functions (OCBF) and a higher level\nwhere a feedback flow controller is proposed to coordinate adjacent CZs. The\nflow controller is parameterized by a terminal velocity constraint that serves\nas the interface between CZs. Simulation results show that the proposed modular\ncontrol zone framework outperforms a direct extension of the OCBF framework to\nmultiple CZs without any flow control.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:27:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Kaiyuan",""],["Cassandras","Christos G.",""]]}
{"id":"2308.03183","submitter":"Ioannis Pikoulis","authors":"Ioannis Pikoulis, Panagiotis P. Filntisis, Petros Maragos","title":"Photorealistic and Identity-Preserving Image-Based Emotion Manipulation\n  with Latent Diffusion Models","comments":"14 pages, 5 tables, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the emotion manipulation capabilities of\ndiffusion models with \"in-the-wild\" images, a rather unexplored application\narea relative to the vast and rapidly growing literature for image-to-image\ntranslation tasks. Our proposed method encapsulates several pieces of prior\nwork, with the most important being Latent Diffusion models and text-driven\nmanipulation with CLIP latents. We conduct extensive qualitative and\nquantitative evaluations on AffectNet, demonstrating the superiority of our\napproach in terms of image quality and realism, while achieving competitive\nresults relative to emotion translation compared to a variety of GAN-based\ncounterparts. Code is released as a publicly available repo.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:28:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pikoulis","Ioannis",""],["Filntisis","Panagiotis P.",""],["Maragos","Petros",""]]}
{"id":"2308.03184","submitter":"Paul Sweeney","authors":"Paul Sweeney Jr","title":"New Counterexamples to Min-Oo's Conjecture via Tunnels","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Min-Oo's Conjecture is a positive curvature version of the positive mass\ntheorem. Brendle, Marques, and Neves produced a perturbative counterexample to\nthis conjecture. In 2021, Carlotto asked if it is possible to develop a novel\ngluing method in the setting of Min-Oo's Conjecture and in doing so produce new\ncounterexamples. Here we answer this question in the affirmative. These new\ncounterexamples are non-perturbative in nature; moreover, we also produce\nexamples with more complicated topology. Our main tool is a quantitative\nversion of Gromov-Lawson Schoen-Yau surgery.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:31:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sweeney","Paul","Jr"]]}
{"id":"2308.03185","submitter":"Guangmo Tong","authors":"Mina Samizadeh, Guangmo Tong","title":"VN-Solver: Vision-based Neural Solver for Combinatorial Optimization\n  over Graphs","comments":"CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data-driven approaches have been proven effective in solving combinatorial\noptimization problems over graphs such as the traveling salesman problems and\nthe vehicle routing problem. The rationale behind such methods is that the\ninput instances may follow distributions with salient patterns that can be\nleveraged to overcome the worst-case computational hardness. For optimization\nproblems over graphs, the common practice of neural combinatorial solvers\nconsumes the inputs in the form of adjacency matrices. In this paper, we\nexplore a vision-based method that is conceptually novel: can neural models\nsolve graph optimization problems by \\textit{taking a look at the graph\npattern}? Our results suggest that the performance of such vision-based methods\nis not only non-trivial but also comparable to the state-of-the-art\nmatrix-based methods, which opens a new avenue for developing data-driven\noptimization solvers.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:33:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Samizadeh","Mina",""],["Tong","Guangmo",""]]}
{"id":"2308.03186","submitter":"Norman Knyazev","authors":"Norman Knyazev and Harrie Oosterhuis","title":"A Lightweight Method for Modeling Confidence in Recommendations with\n  Learned Beta Distributions","comments":"In Proceedings of the 17th ACM Conference on Recommender Systems\n  (RecSys '23), September 18-22, 2023, Singapore, Singapore. ACM, New York, NY,\n  USA, 12 pages","journal-ref":null,"doi":"10.1145/3604915.3608788","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Most Recommender Systems (RecSys) do not provide an indication of confidence\nin their decisions. Therefore, they do not distinguish between recommendations\nof which they are certain, and those where they are not. Existing confidence\nmethods for RecSys are either inaccurate heuristics, conceptually complex or\ncomputationally very expensive. Consequently, real-world RecSys applications\nrarely adopt these methods, and thus, provide no confidence insights in their\nbehavior. In this work, we propose learned beta distributions (LBD) as a simple\nand practical recommendation method with an explicit measure of confidence. Our\nmain insight is that beta distributions predict user preferences as probability\ndistributions that naturally model confidence on a closed interval, yet can be\nimplemented with the minimal model-complexity. Our results show that LBD\nmaintains competitive accuracy to existing methods while also having a\nsignificantly stronger correlation between its accuracy and confidence.\nFurthermore, LBD has higher performance when applied to a high-precision\ntargeted recommendation task. Our work thus shows that confidence in RecSys is\npossible without sacrificing simplicity or accuracy, and without introducing\nheavy computational complexity. Thereby, we hope it enables better insight into\nreal-world RecSys and opens the door for novel future applications.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:35:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Knyazev","Norman",""],["Oosterhuis","Harrie",""]]}
{"id":"2308.03187","submitter":"John Campbell","authors":"John M. Campbell","title":"A Combinatorial Hopf Algebra on Partition Diagrams","comments":"Submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a Combinatorial Hopf Algebra (CHA) with bases indexed by the\npartition diagrams indexing the bases for partition algebras. By analogy with\nthe operation $H_{\\alpha} H_{\\beta} = H_{\\alpha \\cdot \\beta}$ for the complete\nhomogeneous basis of the CHA $ \\textsf{NSym}$ given by concatenating\ncompositions $\\alpha$ and $\\beta$, we mimic this multiplication rule by setting\n$\\textsf{H}_{\\pi} \\textsf{H}_{\\rho} = \\textsf{H}_{\\pi \\otimes \\rho}$ for\npartition diagrams $\\pi$ and $\\rho$ and for the horizontal concatenation $\\pi\n\\otimes \\rho$ of $ \\pi$ and $\\rho$. This gives rise to a free, graded algebra\n$\\textsf{ParSym}$, which we endow with a CHA structure by lifting the CHA\nstructure of $ \\textsf{NSym}$ using an analogue, for partition diagrams, of\nnear-concatenations of integer compositions. Unlike the Hopf algebra\n$\\textsf{NCSym}$ on set partitions, the new CHA $\\textsf{ParSym}$ projects onto\n$\\textsf{NSym}$ in natural way via a ``forgetful'' morphism analogous to the\nprojection of $\\textsf{NSym}$ onto its commutative counterpart $\\textsf{Sym}$.\nWe prove, using the Boolean transform for the sequence $(B_{2n} : n \\in\n\\mathbb{N})$ of even-indexed Bell numbers, an analogue of Comtet's generating\nfunction for the sequence counting irreducible permutations, yielding a formula\nfor the number of generators in each degree for $\\textsf{ParSym}$, and we\nprove, using a sign-reversing involution, an evaluation for the antipode for\n$\\textsf{ParSym}$. An advantage of our CHA being defined on partition diagrams\nin full generality, in contrast to a previously defined Hopf algebra on uniform\nblock permutations, is given by how the coproduct operation we have defined for\n$\\textsf{ParSym}$ is such that the usual diagram subalgebras of partition\nalgebras naturally give rise to Hopf subalgebras of $\\textsf{ParSym}$ by\nrestricting the indexing sets of the graded components to diagrams of a\nspecified form.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:38:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Campbell","John M.",""]]}
{"id":"2308.03188","submitter":"Liangming Pan","authors":"Liangming Pan, Michael Saxon, Wenda Xu, Deepak Nathani, Xinyi Wang,\n  William Yang Wang","title":"Automatically Correcting Large Language Models: Surveying the landscape\n  of diverse self-correction strategies","comments":"Work in Progress. Version 2","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) have demonstrated remarkable performance across\na wide array of NLP tasks. However, their efficacy is undermined by undesired\nand inconsistent behaviors, including hallucination, unfaithful reasoning, and\ntoxic content. A promising approach to rectify these flaws is self-correction,\nwhere the LLM itself is prompted or guided to fix problems in its own output.\nTechniques leveraging automated feedback -- either produced by the LLM itself\nor some external system -- are of particular interest as they are a promising\nway to make LLM-based solutions more practical and deployable with minimal\nhuman feedback. This paper presents a comprehensive review of this emerging\nclass of techniques. We analyze and taxonomize a wide array of recent work\nutilizing these strategies, including training-time, generation-time, and\npost-hoc correction. We also summarize the major applications of this strategy\nand conclude by discussing future directions and challenges.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:38:52 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 03:47:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pan","Liangming",""],["Saxon","Michael",""],["Xu","Wenda",""],["Nathani","Deepak",""],["Wang","Xinyi",""],["Wang","William Yang",""]]}
{"id":"2308.03189","submitter":"John Daugman","authors":"John Daugman","title":"Understanding Biometric Entropy and Iris Capacity: Avoiding Identity\n  Collisions on National Scales","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The numbers of persons who can be enrolled by their iris patterns with no\nidentity collisions is studied in relation to the biometric entropy extracted,\nand the decision operating threshold. The population size at which identity\ncollision becomes likelier than not, given those variables, defines iris\n\"capacity.\" The general solution to this combinatorial problem is derived, in\nanalogy with the well-known \"birthday problem.\" Its application to unique\nbiometric identification on national population scales is shown, referencing\nempirical data from US NIST (National Institute of Standards and Technology)\ntrials involving 1.2 trillion (1.2 x 10^(12) ) iris comparisons. The entropy of\na given person's two iris patterns suffices for global identity uniqueness.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:44:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Daugman","John",""]]}
{"id":"2308.03190","submitter":"Giuseppe De Marco","authors":"Giuseppe De Marco","title":"On punctured locally compact spaces","comments":"6 pages, no figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In a recent paper \\cite{T} the fact that a class of locally compact metric\nspaces $X$, among which are Euclidean spaces, are not homemorphic to their\npunctured version $X\\men\\{p\\}$, was given an interesting new proof which does\nnot use algebraic topology; essential tools of this proof are a boundedly\ncompact metric structure, and path--connectedness near infinity. Here we show\nthat local compactness and ordinary connectedness near infinity suffice; no\nmetrizability is needed, and moreover we can also delete whole compact subsets,\nnot only single points. Some non--homeomorphism results on many--holed\nEuclidean balls are also obtained. This note ought to distil the essence of the\nmethod developed in \\cite{T}.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:47:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["De Marco","Giuseppe",""]]}
{"id":"2308.03191","submitter":"Aruna Sankaranarayanan","authors":"Aruna Sankaranarayanan, Erik Hemberg, Una-May O'Reilly","title":"The Facebook Algorithm's Active Role in Climate Advertisement Delivery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Communication strongly influences attitudes on climate change. Within\nsponsored communication, high spend and high reach advertising dominates. In\nthe advertising ecosystem we can distinguish actors with adversarial stances:\norganizations with contrarian or advocacy communication goals, who direct the\nadvertisement delivery algorithm to launch ads in different destinations by\nspecifying targets and campaign objectives. We present an observational\n(N=275,632) and a controlled (N=650) study which collectively indicate that the\nadvertising delivery algorithm could itself be an actor, asserting\nstatistically significant influence over advertisement destinations,\ncharacterized by U.S. state, gender type, or age range. This algorithmic\nbehaviour may not entirely be understood by the advertising platform (and its\ncreators). These findings have implications for climate communications and\nmisinformation research, revealing that targeting intentions are not always\nfulfilled as requested and that delivery itself could be manipulated.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:53:00 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 02:19:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sankaranarayanan","Aruna",""],["Hemberg","Erik",""],["O'Reilly","Una-May",""]]}
{"id":"2308.03192","submitter":"Yurii Ignat'ev","authors":"Yu. G. Ignat'ev","title":"Formation of supermassive nuclei of Black holes in the early Universe by\n  the mechanism of scalar-gravitational instability. I. Local picture","comments":"19 pages,18 figures, 34 references","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on the formulated and proven similarity properties of cosmological\nmodels based on a statistical system of degenerate scalarly charged fermions,\nas well as the previously identified mechanism of scalar-gravitational\ninstability of cosmological models, a numerical-analytical study of the\nformation of supermassive black hole nuclei in the early Universe was carried\nout. A mathematical model of the evolution of spherical perturbations is\nconstructed, on the basis of which the main regularities of the process of\nevolution of collapsing masses and the dependence of the parameters of forming\nblack holes on the fundamental parameters of the cosmological model and the\nwavelength of gravitational perturbations are revealed. In this case, the mass\nloss of the black hole due to quantum evaporation is taken into account. A\nstable tendency for the early formation of supermassive black hole nuclei in\nthe class of cosmological models under study is shown, and a close connection\nbetween the growth of masses of spherical perturbations and the nature of the\nsingular points of these models is shown. Keywords: scalarly charged plasma,\ncosmological model, Higgs scalar field, gravitational stability, spherical\nperturbations, black hole formation, evaporation.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:55:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ignat'ev","Yu. G.",""]]}
{"id":"2308.03193","submitter":"Rohit Mohan","authors":"Rohit Mohan, Jos\\'e Arce, Sassan Mokhtar, Daniele Cattaneo and Abhinav\n  Valada","title":"Syn-Mediverse: A Multimodal Synthetic Dataset for Intelligent Scene\n  Understanding of Healthcare Facilities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Safety and efficiency are paramount in healthcare facilities where the lives\nof patients are at stake. Despite the adoption of robots to assist medical\nstaff in challenging tasks such as complex surgeries, human expertise is still\nindispensable. The next generation of autonomous healthcare robots hinges on\ntheir capacity to perceive and understand their complex and frenetic\nenvironments. While deep learning models are increasingly used for this\npurpose, they require extensive annotated training data which is impractical to\nobtain in real-world healthcare settings. To bridge this gap, we present\nSyn-Mediverse, the first hyper-realistic multimodal synthetic dataset of\ndiverse healthcare facilities. Syn-Mediverse contains over \\num{48000} images\nfrom a simulated industry-standard optical tracking camera and provides more\nthan 1.5M annotations spanning five different scene understanding tasks\nincluding depth estimation, object detection, semantic segmentation, instance\nsegmentation, and panoptic segmentation. We demonstrate the complexity of our\ndataset by evaluating the performance on a broad range of state-of-the-art\nbaselines for each task. To further advance research on scene understanding of\nhealthcare facilities, along with the public dataset we provide an online\nevaluation benchmark available at \\url{http://syn-mediverse.cs.uni-freiburg.de}\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:20:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mohan","Rohit",""],["Arce","Jos\u00e9",""],["Mokhtar","Sassan",""],["Cattaneo","Daniele",""],["Valada","Abhinav",""]]}
{"id":"2308.03194","submitter":"Matthew Buican","authors":"Matthew Buican and Hongliang Jiang","title":"From Free Fields to Interacting SCFTs via Representation Theory","comments":"30 pages;","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We ask when it is possible to construct arbitrary unitary multiplets of the\nsuperconformal algebra with eight Poincar\\'e supercharges that are compatible\nwith locality from (continuous deformations of) representations in free field\ntheories. We answer this question in two, three, and five dimensions. In four\ndimensions, we resort to an intricate but self-consistent web of conjectures.\nIf correct, these conjectures imply various new non-perturbative constraints on\nshort multiplets in any local unitary 4d $\\mathcal{N}=2$ superconformal field\ntheory and on an unusual set of related vertex algebras. Throughout, we connect\nour results with properties of deformations in the space of theories.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:23:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Buican","Matthew",""],["Jiang","Hongliang",""]]}
{"id":"2308.03195","submitter":"Johan Andberger","authors":"Johan Andberger, Lorenzo Graziotto, Luca Sacchi, Mattias Beck, Giacomo\n  Scalari, J\\'er\\^ome Faist","title":"Terahertz chiral metamaterial cavities breaking time-reversal symmetry","comments":"17 pages, 8 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":"  We demonstrate terahertz chiral metamaterial cavities that break\ntime-reversal symmetry by coupling the degenerate linearly polarized modes of\ntwo orthogonal sets of nano-antenna arrays using the inter-Landau level\ntransition of a two-dimensional electron gas in a perpendicular magnetic field,\nrealizing normalized light-matter coupling rates up to\n$\\Omega_R/\\omega_{\\mathrm{cav}} = 0.78$. The deep sub-wavelength confinement\nand gap of the nano-antennas means that the ultra-strong coupling regime can be\nreached even with a very small number of carriers, making it viable to be used\nwith a variety of 2D materials, including graphene. In addition it possesses a\nnon-degenerate chiral ground state that can be used to study the effect of\ncircularly polarized electromagnetic quantum fluctuations by means of\nweakly-perturbing magneto-transport measurements.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:24:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Andberger","Johan",""],["Graziotto","Lorenzo",""],["Sacchi","Luca",""],["Beck","Mattias",""],["Scalari","Giacomo",""],["Faist","J\u00e9r\u00f4me",""]]}
{"id":"2308.03196","submitter":"Michael Fromm","authors":"Michael Fromm, Owe Philipsen, Wolfgang Unger and Christopher Winterowd","title":"Quantum Gate Sets for Lattice QCD in the strong coupling limit: $N_f=1$","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive the primitive quantum gate sets to simulate lattice quantum\nchromodynamics (LQCD) in the strong-coupling limit with one flavor of massless\nstaggered quarks. This theory is of interest for studies at non-zero density as\nthe sign problem can be overcome using Monte Carlo methods. In this work, we\nuse it as a testing ground for quantum simulations. The key point is that no\ntruncation of the bosonic Hilbert space is necessary as the theory is\nformulated in terms of color-singlet degrees of freedom (``baryons'' and\n``mesons''). The baryons become static in the limit of continuous time and\ndecouple, whereas the dynamics of the mesonic theory involves two qubits per\nlattice site. Lending dynamics also to the ``baryons'' simply requires to use\nthe derived gate set in its controlled version.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:27:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fromm","Michael",""],["Philipsen","Owe",""],["Unger","Wolfgang",""],["Winterowd","Christopher",""]]}
{"id":"2308.03197","submitter":"Felipe Pinheiro J\\'unior","authors":"Felipe P. S. Junior, Jorge L. C. Domingos, W. P. Ferreira and F. Q.\n  Potiguar","title":"Vortex synchronization in dry active matter","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It was recently shown that dry active matter may form rotating vortices\naround circular obstacles. However, is lacking of a systematic study in the\nliterature. Here, we study how two such structures interact mainly as a\nfunction of the shortest distance between the obstacles. We find that, like the\nobservations of vortex formation in wet active matter, both vortices can\nsynchronize their rotations in either opposite or in the same direction; we\ncall such regimes antiferromagnetic or ferromagnetic, respectively. We show\nthat, for the antiferromagnetic case, both vortices keep their motion\ncorrelated by exchanging particles through the region in between them,\nsimilarly to a cog; on the other hand, for the ferromagnetic regime, the\nparticle exchange takes place above and below the vortices, as two opposite\nparticle currents appear, similarly to a belt wrapped around both and, driving\nthem through their edges.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:41:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Junior","Felipe P. S.",""],["Domingos","Jorge L. C.",""],["Ferreira","W. P.",""],["Potiguar","F. Q.",""]]}
{"id":"2308.03198","submitter":"Shuyang Bian","authors":"Shuyang Bian, Yuanyuan Xie, Flora Zhang","title":"Re-imagining the Future of Forest Management -- An Age-Dependent\n  Approach towards Harvesting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.OT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Facing the drastic climate changes, current strategies for enhancing carbon\ndioxide stocks need to be thoroughly honed. To address the problem, we first\nbuilt a carbon sequestration growth model driven by growth rate dependency\n(GRDM). We abstracted the carbon cycling system into the process of\nphotosynthesis, the humidity fluctuation, and the original storage of carbon in\nthe trees. In the photosynthesis model, we considered various factors,\nincluding transition rate of absorption and organic matter production. We also\ndesigned an Economic Return Evaluation Model (EREM) to estimate the optimal\ndistribution of trees in the forest based on the utility function. Maximizing\nthe utility brought by the amount of carbon storage, we derived the equation\nfor profit optimization with the constraints of total economic expenses\nallowed. To assess its performance, we took an object-oriented approach,\nsimulated an ideal forest by placing instances of trees and plotted a\ntime-dependent forest composition graph. After proper normalization of climate\nand economic data, we also make predictions for 169 worldwide forest-covered\ncountries. Our model further suggests high sensitivity and robustness with a\nsimilar trend of overall utility when environmental aridity or proportion of\nharvested woods are varied. Finally, we apply the model to Georgia temperate\ndeciduous forest, and we evaluate the carbon storage ability to adjust the Red\nSpruce based on available biological literature research. We recognize that\nwhile the model is preliminary in its failure to identify a diverse array of\nvariables, it has encapsulated key features of idealized forests.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:52:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bian","Shuyang",""],["Xie","Yuanyuan",""],["Zhang","Flora",""]]}
{"id":"2308.03199","submitter":"Denton Ebel","authors":"Michael Greenberg, Denton S. Ebel","title":"Laser Scanning Confocal Microscopy of Comet Material in Aerogel","comments":"17 pages, 6 figures, 2 tables","journal-ref":"Geosphere 6: 515-523 (2010)","doi":"10.1130/GES00557.1","report-no":null,"categories":"astro-ph.EP astro-ph.IM physics.geo-ph physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We report non-destructive 3-dimensional imaging and analysis techniques for\nmaterial returned by the Stardust cometary collector. Our technique utilizes\n3-dimensional laser scanning confocal microscopy (3D LSCM) to image whole\nStardust tracks, in situ, with attainable resolutions <90 nm/pixel edge. LSCM\nimages illustrate track morphology and fragmentation history; image\nsegmentation techniques provide quantifiable volumetric and dynamic\nmeasurements. We present a method for multipart image acquisition and\nregistration in 3-D. Additionally, we present a 3D deconvolution method for\naerogel, using a theoretically calculated point spread function for first-order\ncorrections of optical aberrations induced by light diffraction and refractive\nindex mismatches. LSCM is a benchtop technique and is an excellent alternative\nto synchrotron x-ray computed microtomography for optically transparent media.\nOur technique, developed over the past 2 years, is a non-invasive, rapid\ntechnique for fine-scale imaging of high value returned samples from the\nStardust mission, as well as various other samples from the geosciences.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:02:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Greenberg","Michael",""],["Ebel","Denton S.",""]]}
{"id":"2308.03200","submitter":"Joyanta Jyoti Mondal","authors":"Joyanta Jyoti Mondal, Md. Farhadul Islam, Raima Islam, Nowsin Kabir\n  Rhidi, A. B. M. Alim Al Islam, Meem Arafat Manab, Jannatun Noor","title":"Unmasking the Invisible: Finding Location-Specific Aggregated Air\n  Quality Index with Smartphone-Captured Images","comments":"15 pages, 7 figures, submitted to Nature Scientific Reports","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 prevalence and mobility of smartphones make these a widely used tool for\nenvironmental health research. However, their potential for determining\naggregated air quality index (AQI) based on PM2.5 concentration in specific\nlocations remains largely unexplored in the existing literature. In this paper,\nwe thoroughly examine the challenges associated with predicting\nlocation-specific PM2.5 concentration using images taken with smartphone\ncameras. The focus of our study is on Dhaka, the capital of Bangladesh, due to\nits significant air pollution levels and the large population exposed to it.\nOur research involves the development of a Deep Convolutional Neural Network\n(DCNN), which we train using over a thousand outdoor images taken and\nannotated. These photos are captured at various locations in Dhaka, and their\nlabels are based on PM2.5 concentration data obtained from the local US\nconsulate, calculated using the NowCast algorithm. Through supervised learning,\nour model establishes a correlation index during training, enhancing its\nability to function as a Picture-based Predictor of PM2.5 Concentration (PPPC).\nThis enables the algorithm to calculate an equivalent daily averaged AQI index\nfrom a smartphone image. Unlike, popular overly parameterized models, our model\nshows resource efficiency since it uses fewer parameters. Furthermore, test\nresults indicate that our model outperforms popular models like ViT and INN, as\nwell as popular CNN-based models such as VGG19, ResNet50, and MobileNetV2, in\npredicting location-specific PM2.5 concentration. Our dataset is the first\npublicly available collection that includes atmospheric images and\ncorresponding PM2.5 measurements from Dhaka. Our code and dataset will be made\npublic when publishing the paper.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:10:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mondal","Joyanta Jyoti",""],["Islam","Md. Farhadul",""],["Islam","Raima",""],["Rhidi","Nowsin Kabir",""],["Islam","A. B. M. Alim Al",""],["Manab","Meem Arafat",""],["Noor","Jannatun",""]]}
{"id":"2308.03201","submitter":"Chris Tapo","authors":"Chris Tapo","title":"Derived Braids of Decreasing Products and their Categories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Derived braids have been used to classify categorical structures based on the\nbraid underlying a braided monoidal category V. With four-strand braids\nunderlying the composition morphisms of tensor products of categories enriched\nover V, equality of derived braids has been seen to correspond with the results\nof Joyal and Street on coherence for braided monoidal categories, namely that\ndiagrams commute when the braids underlying the legs of the diagram are equal.\nEquality of derived braids can then be seen as a generalization of the\nYang-Baxter equation that appears in the work of Joyal and Street. The main\nresult is a proof that decreasing products, which are braids formed from\ncomponent braids with even numbers of strands, have equivalent derived braids.\nPlans for future work include interpreting what categorical structures\ncorrespond to decreasing products.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:14:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tapo","Chris",""]]}
{"id":"2308.03202","submitter":"Qucheng Peng","authors":"Qucheng Peng, Ce Zheng, Chen Chen","title":"Source-free Domain Adaptive Human Pose Estimation","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Human Pose Estimation (HPE) is widely used in various fields, including\nmotion analysis, healthcare, and virtual reality. However, the great expenses\nof labeled real-world datasets present a significant challenge for HPE. To\novercome this, one approach is to train HPE models on synthetic datasets and\nthen perform domain adaptation (DA) on real-world data. Unfortunately, existing\nDA methods for HPE neglect data privacy and security by using both source and\ntarget data in the adaptation process. To this end, we propose a new task,\nnamed source-free domain adaptive HPE, which aims to address the challenges of\ncross-domain learning of HPE without access to source data during the\nadaptation process. We further propose a novel framework that consists of three\nmodels: source model, intermediate model, and target model, which explores the\ntask from both source-protect and target-relevant perspectives. The\nsource-protect module preserves source information more effectively while\nresisting noise, and the target-relevant module reduces the sparsity of spatial\nrepresentations by building a novel spatial probability space, and\npose-specific contrastive learning and information maximization are proposed on\nthe basis of this space. Comprehensive experiments on several domain adaptive\nHPE benchmarks show that the proposed method outperforms existing approaches by\na considerable margin. The codes are available at\nhttps://github.com/davidpengucf/SFDAHPE.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:19:06 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 16:33:43 GMT"},{"version":"v3","created":"Tue, 15 Aug 2023 15:47:34 GMT"},{"version":"v4","created":"Fri, 18 Aug 2023 23:50:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Peng","Qucheng",""],["Zheng","Ce",""],["Chen","Chen",""]]}
{"id":"2308.03203","submitter":"Youssef Sultan","authors":"Youssef Sultan, Yongqiang Wang, James Scanlon, Lisa D'lima","title":"Microvasculature Segmentation in Human BioMolecular Atlas Program\n  (HuBMAP)","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Image segmentation serves as a critical tool across a range of applications,\nencompassing autonomous driving's pedestrian detection and pre-operative tumor\ndelineation in the medical sector. Among these applications, we focus on the\nNational Institutes of Health's (NIH) Human BioMolecular Atlas Program\n(HuBMAP), a significant initiative aimed at creating detailed cellular maps of\nthe human body. In this study, we concentrate on segmenting various\nmicrovascular structures in human kidneys, utilizing 2D Periodic Acid-Schiff\n(PAS)-stained histology images. Our methodology begins with a foundational\nFastAI U-Net model, upon which we investigate alternative backbone\narchitectures, delve into deeper models, and experiment with Feature Pyramid\nNetworks. We rigorously evaluate these varied approaches by benchmarking their\nperformance against our baseline U-Net model. This study thus offers a\ncomprehensive exploration of cutting-edge segmentation techniques, providing\nvaluable insights for future research in the field.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:30:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sultan","Youssef",""],["Wang","Yongqiang",""],["Scanlon","James",""],["D'lima","Lisa",""]]}
{"id":"2308.03204","submitter":"Peter Schafhalter","authors":"Peter Schafhalter, Sukrit Kalra, Le Xu, Joseph E. Gonzalez, Ion Stoica","title":"Leveraging Cloud Computing to Make Autonomous Vehicles Safer","comments":"IROS 2023 (to appear); 8 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The safety of autonomous vehicles (AVs) depends on their ability to perform\ncomplex computations on high-volume sensor data in a timely manner. Their\nability to run these computations with state-of-the-art models is limited by\nthe processing power and slow update cycles of their onboard hardware. In\ncontrast, cloud computing offers the ability to burst computation to vast\namounts of the latest generation of hardware. However, accessing these cloud\nresources requires traversing wireless networks that are often considered to be\ntoo unreliable for real-time AV driving applications.\n  Our work seeks to harness this unreliable cloud to enhance the accuracy of an\nAV's decisions, while ensuring that it can always fall back to its on-board\ncomputational capabilities. We identify three mechanisms that can be used by\nAVs to safely leverage the cloud for accuracy enhancements, and elaborate why\ncurrent execution systems fail to enable these mechanisms. To address these\nlimitations, we provide a system design based on the speculative execution of\nan AV's pipeline in the cloud, and show the efficacy of this approach in\nsimulations of complex real-world scenarios that apply these mechanisms.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:37:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Schafhalter","Peter",""],["Kalra","Sukrit",""],["Xu","Le",""],["Gonzalez","Joseph E.",""],["Stoica","Ion",""]]}
{"id":"2308.03205","submitter":"Xuesu Xiao","authors":"Xuesu Xiao and Zifan Xu and Garrett Warnell and Peter Stone and Ferran\n  Gebelli Guinjoan and Romulo T. Rodrigues and Herman Bruyninckx and Hanjaya\n  Mandala and Guilherme Christmann and Jose Luis Blanco-Claraco and Shravan\n  Somashekara Rai","title":"Autonomous Ground Navigation in Highly Constrained Spaces: Lessons\n  learned from The 2nd BARN Challenge at ICRA 2023","comments":"arXiv admin note: text overlap with arXiv:2208.10473","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The 2nd BARN (Benchmark Autonomous Robot Navigation) Challenge took place at\nthe 2023 IEEE International Conference on Robotics and Automation (ICRA 2023)\nin London, UK and continued to evaluate the performance of state-of-the-art\nautonomous ground navigation systems in highly constrained environments.\nCompared to The 1st BARN Challenge at ICRA 2022 in Philadelphia, the\ncompetition has grown significantly in size, doubling the numbers of\nparticipants in both the simulation qualifier and physical finals: Ten teams\nfrom all over the world participated in the qualifying simulation competition,\nsix of which were invited to compete with each other in three physical obstacle\ncourses at the conference center in London, and three teams won the challenge\nby navigating a Clearpath Jackal robot from a predefined start to a goal with\nthe shortest amount of time without colliding with any obstacle. The\ncompetition results, compared to last year, suggest that the teams are making\nprogress toward more robust and efficient ground navigation systems that work\nout-of-the-box in many obstacle environments. However, a significant amount of\nfine-tuning is still needed onsite to cater to different difficult navigation\nscenarios. Furthermore, challenges still remain for many teams when facing\nextremely cluttered obstacles and increasing navigation speed. In this article,\nwe discuss the challenge, the approaches used by the three winning teams, and\nlessons learned to direct future research.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:37:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xiao","Xuesu",""],["Xu","Zifan",""],["Warnell","Garrett",""],["Stone","Peter",""],["Guinjoan","Ferran Gebelli",""],["Rodrigues","Romulo T.",""],["Bruyninckx","Herman",""],["Mandala","Hanjaya",""],["Christmann","Guilherme",""],["Blanco-Claraco","Jose Luis",""],["Rai","Shravan Somashekara",""]]}
{"id":"2308.03206","submitter":"Denton Ebel","authors":"Denton S. Ebel, Richard O. Sack","title":"Djerfisherite: Nebular Source of Refractory Potassium","comments":"18 pages, 5 figures, 4 tables","journal-ref":"Contributions to Mineralogy and Petrology 166: 923-934 (2013)","doi":"0.1007/s00410-013-0898-x","report-no":null,"categories":"astro-ph.EP astro-ph.IM physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Djerfisherite is an important carrier of potassium in highly reduced\nenstatite chondrites, where it occurs in sub-round metal-sulfide nodules. These\nnodules were once free-floating objects in the protoplanetary nebula. Here, we\nanalyze existing and new data to derive an equation of state (EOS) for\ndjerfisherites of K_{6}(Cu,Fe,Ni)^{B} (Fe,Ni,Cu)^{C}_{24} S_{26}Cl structural\nformula. We use this EOS to calculate the thermal stability of djerfisherite\ncoexisting in equilibrium with a cooling vapor of solar composition enriched in\na dust analogous to anhydrous, chondritic interplanetary dust (C-IDP). We find\nthat condensed mineral assemblages closely match those found in enstatite\nchondrites, with djerfisherite condensing above 1000 K in C-IDP dust enriched\nsystems. Results may have implications for the volatile budgets of terrestrial\nplanets, and the incorporation of K into early-formed, highly reduced,\nplanetary cores. Previous work links enstatite chondrites to the planet\nMercury, where the surface has a terrestrial K/Th ratio, high S/Si ratio, and\nvery low FeO content. Mercury's accretion history may yield insights into\nEarth's.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:43:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ebel","Denton S.",""],["Sack","Richard O.",""]]}
{"id":"2308.03207","submitter":"Sergei Popov B.","authors":"Sergei B. Popov (ICTP)","title":"FRBs and magnetar activity statistics","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With simple estimates based on recent observational data and the assumption\nthat among known FRB sources most repeaters with extremely high rates of\nrepetition (super-repeaters) are already identified, we demonstrate that the\nhypothesis that super-repeaters and one-off events come from the same\npopulation of magnetars is not self-contradictory. In this toy model, the\nsuper-repeater stage has a duration of about a few years and the period when\none-off events are mostly emitted corresponds to the active life of a magnetar\n$\\sim $few$\\times 10^3$~years. Intervals between strong events (observed as\none-off FRBs) from the same source are $\\sim10$~years, corresponding to the\nexpected time interval between giant flares.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:47:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Popov","Sergei B.","","ICTP"]]}
{"id":"2308.03208","submitter":"Kirsten Hogenson","authors":"Joseph Gutstadt, Kirsten Hogenson, John Koerner","title":"Solving Abalone on Small Boards","comments":"18 pages, 20 figures, submitted for publication in August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Abalone is a 2-player board game with perfect information. The game is played\non a 5x5x5 hexagonal grid and ends when a player pushes 6 of their opponents'\npieces off the board. Abalone is similar to games like chess and Go in that all\nthree games have high branching factors, making it difficult for a computer to\ndetermine the outcome of a game. However, solving smaller, simplified versions\nof Abalone can offer insight into how to play the full-size game optimally. In\nthis paper, we strongly solve a variation of Abalone played on a 2x2x2\nhexagonal board. We also weakly solve an Abalone variation on a 2x2x3 hexagonal\nboard.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 20:54:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gutstadt","Joseph",""],["Hogenson","Kirsten",""],["Koerner","John",""]]}
{"id":"2308.03209","submitter":"Kaidi Cao","authors":"Kaidi Cao, Rui Deng, Shirley Wu, Edward W Huang, Karthik Subbian, Jure\n  Leskovec","title":"Communication-Free Distributed GNN Training with Vertex Cut","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Training Graph Neural Networks (GNNs) on real-world graphs consisting of\nbillions of nodes and edges is quite challenging, primarily due to the\nsubstantial memory needed to store the graph and its intermediate node and edge\nfeatures, and there is a pressing need to speed up the training process. A\ncommon approach to achieve speed up is to divide the graph into many smaller\nsubgraphs, which are then distributed across multiple GPUs in one or more\nmachines and processed in parallel. However, existing distributed methods\nrequire frequent and substantial cross-GPU communication, leading to\nsignificant time overhead and progressively diminishing scalability. Here, we\nintroduce CoFree-GNN, a novel distributed GNN training framework that\nsignificantly speeds up the training process by implementing communication-free\ntraining. The framework utilizes a Vertex Cut partitioning, i.e., rather than\npartitioning the graph by cutting the edges between partitions, the Vertex Cut\npartitions the edges and duplicates the node information to preserve the graph\nstructure. Furthermore, the framework maintains high model accuracy by\nincorporating a reweighting mechanism to handle a distorted graph distribution\nthat arises from the duplicated nodes. We also propose a modified DropEdge\ntechnique to further speed up the training process. Using an extensive set of\nexperiments on real-world networks, we demonstrate that CoFree-GNN speeds up\nthe GNN training process by up to 10 times over the existing state-of-the-art\nGNN training approaches.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:04:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cao","Kaidi",""],["Deng","Rui",""],["Wu","Shirley",""],["Huang","Edward W",""],["Subbian","Karthik",""],["Leskovec","Jure",""]]}
{"id":"2308.03210","submitter":"Chrysoula Kosma","authors":"Chrysoula Kosma, Giannis Nikolentzos, Michalis Vazirgiannis","title":"Time-Parameterized Convolutional Neural Networks for Irregularly Sampled\n  Time Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Irregularly sampled multivariate time series are ubiquitous in several\napplication domains, leading to sparse, not fully-observed and non-aligned\nobservations across different variables. Standard sequential neural network\narchitectures, such as recurrent neural networks (RNNs) and convolutional\nneural networks (CNNs), consider regular spacing between observation times,\nposing significant challenges to irregular time series modeling. While most of\nthe proposed architectures incorporate RNN variants to handle irregular time\nintervals, convolutional neural networks have not been adequately studied in\nthe irregular sampling setting. In this paper, we parameterize convolutional\nlayers by employing time-explicitly initialized kernels. Such general functions\nof time enhance the learning process of continuous-time hidden dynamics and can\nbe efficiently incorporated into convolutional kernel weights. We, thus,\npropose the time-parameterized convolutional neural network (TPCNN), which\nshares similar properties with vanilla convolutions but is carefully designed\nfor irregularly sampled time series. We evaluate TPCNN on both interpolation\nand classification tasks involving real-world irregularly sampled multivariate\ntime series datasets. Our experimental results indicate the competitive\nperformance of the proposed TPCNN model which is also significantly more\nefficient than other state-of-the-art methods. At the same time, the proposed\narchitecture allows the interpretability of the input series by leveraging the\ncombination of learnable time functions that improve the network performance in\nsubsequent tasks and expedite the inaugural application of convolutions in this\nfield.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:10:30 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 06:39:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kosma","Chrysoula",""],["Nikolentzos","Giannis",""],["Vazirgiannis","Michalis",""]]}
{"id":"2308.03211","submitter":"Frank Sottile","authors":"Frank Sottile","title":"Some problems at the interface of approximation theory and algebraic\n  geometry","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We sketch an assortment of problems that were posed -- and not yet solved --\nduring problem sessions at the conference ``Approximation Theory and Numerical\nAnalysis meet Algebra, Geometry, and Topology'', which was held at the\nPalazzone Cortona 5--9 September 2022.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:16:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sottile","Frank",""]]}
{"id":"2308.03212","submitter":"Lena Strobl","authors":"Lena Strobl","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold\n  Circuits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformers have emerged as a widely used neural network model for various\nnatural language processing tasks. Previous research explored their\nrelationship with constant-depth threshold circuits, making two assumptions:\naverage-hard attention and logarithmic precision for internal computations\nrelative to input length. Merrill et al. (2022) prove that average-hard\nattention transformers recognize languages that fall within the complexity\nclass TC0, denoting the set of languages that can be recognized by\nconstant-depth polynomial-size threshold circuits. Likewise, Merrill and\nSabharwal (2023) show that log-precision transformers recognize languages\nwithin the class of uniform TC0. This shows that both transformer models can be\nsimulated by constant-depth threshold circuits, with the latter being more\nrobust due to generating a uniform circuit family. Our paper shows that the\nfirst result can be extended to yield uniform circuits as well.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:23:22 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 18:54:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Strobl","Lena",""]]}
{"id":"2308.03213","submitter":"Tianyi Hao","authors":"Kun Liu, Tianyi Hao, and Swamit Tannu","title":"Enabling High Performance Debugging for Variational Quantum Algorithms\n  using Compressed Sensing","comments":"13 pages, 13 figures. KL and TH contributed equally to this work","journal-ref":"In Proceedings of the 50th Annual International Symposium on\n  Computer Architecture (ISCA '23), June 17-21, 2023, Orlando, FL, USA.\n  Association for Computing Machinery, New York, NY, USA, Article 9, 1-13","doi":"10.1145/3579371.3589044","report-no":null,"categories":"quant-ph cs.AR cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Variational quantum algorithms (VQAs) can potentially solve practical\nproblems using contemporary Noisy Intermediate Scale Quantum (NISQ) computers.\nVQAs find near-optimal solutions in the presence of qubit errors by classically\noptimizing a loss function computed by parameterized quantum circuits. However,\ndeveloping and testing VQAs is challenging due to the limited availability of\nquantum hardware, their high error rates, and the significant overhead of\nclassical simulations. Furthermore, VQA researchers must pick the right\ninitialization for circuit parameters, utilize suitable classical optimizer\nconfigurations, and deploy appropriate error mitigation methods. Unfortunately,\nthese tasks are done in an ad-hoc manner today, as there are no software tools\nto configure and tune the VQA hyperparameters.\n  In this paper, we present OSCAR (cOmpressed Sensing based Cost lAndscape\nReconstruction) to help configure: 1) correct initialization, 2) noise\nmitigation techniques, and 3) classical optimizers to maximize the quality of\nthe solution on NISQ hardware. OSCAR enables efficient debugging and\nperformance tuning by providing users with the loss function landscape without\nrunning thousands of quantum circuits as required by the grid search. Using\nOSCAR, we can accurately reconstruct the complete cost landscape with up to\n100X speedup. Furthermore, OSCAR can compute an optimizer function query in an\ninstant by interpolating a computed landscape, thus enabling the trial run of a\nVQA configuration with considerably reduced overhead.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:35:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Kun",""],["Hao","Tianyi",""],["Tannu","Swamit",""]]}
{"id":"2308.03214","submitter":"Guy Boyde","authors":"Guy Boyde","title":"Stable homology isomorphisms for the partition and Jones annular\n  algebras","comments":"22 pages, comments very welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the homology of the Jones annular algebras is isomorphic to that\nof the cyclic groups below a line of gradient $\\frac{1}{2}$. We also show that\nthe homology of the partition algebras is isomorphic to that of the symmetric\ngroups below a line of gradient 1, strengthening a result of\nBoyd-Hepworth-Patzt. Both isomorphisms hold in a range exceeding the stability\nrange of the algebras in question. Along the way, we prove the usual odd-strand\nand invertible parameter results for the Jones annular algebras.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:45:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Boyde","Guy",""]]}
{"id":"2308.03215","submitter":"Nikhil Ghosh","authors":"Nikhil Ghosh, Spencer Frei, Wooseok Ha, and Bin Yu","title":"The Effect of SGD Batch Size on Autoencoder Learning: Sparsity,\n  Sharpness, and Feature 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":"  In this work, we investigate the dynamics of stochastic gradient descent\n(SGD) when training a single-neuron autoencoder with linear or ReLU activation\non orthogonal data. We show that for this non-convex problem, randomly\ninitialized SGD with a constant step size successfully finds a global minimum\nfor any batch size choice. However, the particular global minimum found depends\nupon the batch size. In the full-batch setting, we show that the solution is\ndense (i.e., not sparse) and is highly aligned with its initialized direction,\nshowing that relatively little feature learning occurs. On the other hand, for\nany batch size strictly smaller than the number of samples, SGD finds a global\nminimum which is sparse and nearly orthogonal to its initialization, showing\nthat the randomness of stochastic gradients induces a qualitatively different\ntype of \"feature selection\" in this setting. Moreover, if we measure the\nsharpness of the minimum by the trace of the Hessian, the minima found with\nfull batch gradient descent are flatter than those found with strictly smaller\nbatch sizes, in contrast to previous works which suggest that large batches\nlead to sharper minima. To prove convergence of SGD with a constant step size,\nwe introduce a powerful tool from the theory of non-homogeneous random walks\nwhich may be of independent interest.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 21:54:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ghosh","Nikhil",""],["Frei","Spencer",""],["Ha","Wooseok",""],["Yu","Bin",""]]}
{"id":"2308.03216","submitter":"Michele Coghi","authors":"Michele Coghi and Mario Maurelli","title":"Existence and uniqueness by Kraichnan noise for 2D Euler equations with\n  unbounded vorticity","comments":null,"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 the 2D Euler equations on $\\mathbb{R}^2$ in vorticity form, with\nunbounded initial vorticity, perturbed by a suitable non-smooth Kraichnan\ntransport noise.\n  We show weak existence for every $\\dot{H}^{-1}$ initial vorticity. Thanks to\nthe noise, the solutions that we construct are limits in law of a regularized\nstochastic Euler equation and enjoy an additional $L^2([0,T];H^{-\\alpha})$\nregularity, for $0<\\alpha<1$.\n  For certain regularity indices of the Kraichan noise, we show also pathwise\nuniqueness for every $L^p$ initial vorticity, for $p>3/2$. This result is not\nknown without noise.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:03:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Coghi","Michele",""],["Maurelli","Mario",""]]}
{"id":"2308.03217","submitter":"Linbo Wang","authors":"Linbo Wang, Jing Wu, Xianyong Fang, Zhengyi Liu, Chenjie Cao, Yanwei\n  Fu","title":"Local Consensus Enhanced Siamese Network with Reciprocal Loss for\n  Two-view Correspondence Learning","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":"  Recent studies of two-view correspondence learning usually establish an\nend-to-end network to jointly predict correspondence reliability and relative\npose. We improve such a framework from two aspects. First, we propose a Local\nFeature Consensus (LFC) plugin block to augment the features of existing\nmodels. Given a correspondence feature, the block augments its neighboring\nfeatures with mutual neighborhood consensus and aggregates them to produce an\nenhanced feature. As inliers obey a uniform cross-view transformation and share\nmore consistent learned features than outliers, feature consensus strengthens\ninlier correlation and suppresses outlier distraction, which makes output\nfeatures more discriminative for classifying inliers/outliers. Second, existing\napproaches supervise network training with the ground truth correspondences and\nessential matrix projecting one image to the other for an input image pair,\nwithout considering the information from the reverse mapping. We extend\nexisting models to a Siamese network with a reciprocal loss that exploits the\nsupervision of mutual projection, which considerably promotes the matching\nperformance without introducing additional model parameters. Building upon\nMSA-Net, we implement the two proposals and experimentally achieve\nstate-of-the-art performance on benchmark datasets.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:20:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Linbo",""],["Wu","Jing",""],["Fang","Xianyong",""],["Liu","Zhengyi",""],["Cao","Chenjie",""],["Fu","Yanwei",""]]}
{"id":"2308.03218","submitter":"Kun Tao","authors":"Kun Tao, Rongrong Chen, Lei Yang, Jin Gao, Desheng Xue and Chenglong\n  Jia","title":"The Cu induced ultraflat band in the Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O$_4$\n  ($x=0,0.5$)","comments":"8 pages, 7 figures","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":"  Based on the first principle calculations, we investigate the geometry and\nthe electronic structures of the lead apatite with and without the Cu doped.\nOur calculations found that without the Cu doping the lead apatite crystal is\nan insulator with a flat band above the Fermi lever. Furthermore, our results\nindicate that by introducing the O1 vacancies would results in the disappear of\nthe flat bands in the undopped crystal. While the Cu is doped forming the\nLK-99, there exist the ultra-flat bands crossing the Fermi level induced by the\ndoped Cu atoms, which is due to the hybridization between the d states of the\nCu atoms and the p states of the fully occupied 1/4 occupied O1 atoms.\nMoreover, we point out that the hybridization maybe the key for the realization\nof the room temperature superconductivity for the LK-99, and a possible\nsolutions method to improve the quality of the crystal is proposed. Our work\nprovides a foundation for the future studies on the unique electronic and the\nsuperconductivity properties of the LK-99 crystal.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:23:06 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 13:43:21 GMT"},{"version":"v3","created":"Thu, 17 Aug 2023 10:02:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tao","Kun",""],["Chen","Rongrong",""],["Yang","Lei",""],["Gao","Jin",""],["Xue","Desheng",""],["Jia","Chenglong",""]]}
{"id":"2308.03219","submitter":"Sufei Shi","authors":"Zhen Lian, Dongxue Chen, Lei Ma, Yuze Meng, Ying Su, Li Yan, Xiong\n  Huang, Qiran Wu, Xinyue Chen, Mark Blei, Takashi Taniguchi, Kenji Watanabe,\n  Sefaattin Tongay, Chuanwei Zhang, Yong-Tao Cui, Su-Fei Shi","title":"Quadrupolar Excitons and Hybridized Interlayer Mott Insulator in a\n  Trilayer Moir\\'e Superlattice","comments":null,"journal-ref":"Nature Communications volume 14, Article number: 4604 (2023)","doi":"10.1038/s41467-023-40288-9","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transition metal dichalcogenide (TMDC) moir\\'e superlattices, owing to the\nmoir\\'e flatbands and strong correlation, can host periodic electron crystals\nand fascinating correlated physics. The TMDC heterojunctions in the type-II\nalignment also enable long-lived interlayer excitons that are promising for\ncorrelated bosonic states, while the interaction is dictated by the asymmetry\nof the heterojunction. Here we demonstrate a new excitonic state, quadrupolar\nexciton, in a symmetric WSe2-WS2-WSe2 trilayer moir\\'e superlattice. The\nquadrupolar excitons exhibit a quadratic dependence on the electric field,\ndistinctively different from the linear Stark shift of the dipolar excitons in\nheterobilayers. This quadrupolar exciton stems from the hybridization of WSe2\nvalence moir\\'e flatbands. The same mechanism also gives rise to an interlayer\nMott insulator state, in which the two WSe2 layers share one hole laterally\nconfined in one moir\\'e unit cell. In contrast, the hole occupation probability\nin each layer can be continuously tuned via an out-of-plane electric field,\nreaching 100% in the top or bottom WSe2 under a large electric field,\naccompanying the transition from quadrupolar excitons to dipolar excitons. Our\nwork demonstrates a trilayer moir\\'e system as a new exciting playground for\nrealizing novel correlated states and engineering quantum phase transitions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:24:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lian","Zhen",""],["Chen","Dongxue",""],["Ma","Lei",""],["Meng","Yuze",""],["Su","Ying",""],["Yan","Li",""],["Huang","Xiong",""],["Wu","Qiran",""],["Chen","Xinyue",""],["Blei","Mark",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Tongay","Sefaattin",""],["Zhang","Chuanwei",""],["Cui","Yong-Tao",""],["Shi","Su-Fei",""]]}
{"id":"2308.03220","submitter":"J. Samuel Jiang","authors":"J. S. Jiang, Qianheng Du, Ulrich Welp, Ramakanta Chapai, Hanu Arava,\n  Yuzi Liu, Yue Li, John Pearson, Anand Bhattacharya, and Hyowon Park","title":"A15 Phase Ta3Sb Thin Films: Direct Synthesis and Giant Spin-Orbit\n  Effects","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 use co-sputtering to directly synthesize thin films of the A15 phase\nintermetallic compound Ta3Sb, which has been predicted to have a giant spin\nHall conductivity. We identify a large window of Ta:Sb flux ratio that\nstabilizes single-phase A15 Ta3Sb. Composition analyses of these films show a\nTa:Sb atomic ratio of 4:1, which is consistent with the known Ta-Sb phase\ndiagram. The spin Hall conductivity of thin film Ta3Sb is -3400+/-400 (hbar/2e)\nS/cm and the spin-orbit torque efficiency is -0.6+/-0.1 at 20 K, as determined\nfrom harmonic Hall measurements of Ta3Sb/permalloy bilayer structures. These\ngiant values make Ta3Sb a promising material for efficient charge-to-spin\nconversion in spintronic applications. Large field-like spin-orbit effective\nfields that are independent of the ferromagnetic layer thickness have also been\nmeasured in the Ta3Sb/permalloy bilayers. We attribute the field-like\nspin-orbit effective field to the Rashba effect at the interface.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:27:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jiang","J. S.",""],["Du","Qianheng",""],["Welp","Ulrich",""],["Chapai","Ramakanta",""],["Arava","Hanu",""],["Liu","Yuzi",""],["Li","Yue",""],["Pearson","John",""],["Bhattacharya","Anand",""],["Park","Hyowon",""]]}
{"id":"2308.03221","submitter":"Ryuji Okazaki","authors":"Reiji Okada, Hiroto Isomura, Yoshiki J. Sato, Ryuji Okazaki, Masayuki\n  Inoue, Shinya Yoshioka","title":"Mechanically exfoliated low-layered [Ca$_2$CoO$_3$]$_{0.62}$[CoO$_2$]: A\n  single-crystalline p-type transparent conducting oxide","comments":"6 pages, 4 figures, 1 table. This article may be downloaded for\n  personal use only. Any other use requires prior permission of the author and\n  AIP Publishing","journal-ref":"Appl. Phys. Lett. 123, 051110 (2023)","doi":"10.1063/5.0162677","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el physics.app-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transparent conducting oxides (TCOs) are essential components of\noptoelectronic devices and various materials have been explored for highly\nefficient TCOs having a combination of high transmittance and low sheet\nresistance. Here, we focus on a misfit thermoelectric oxide\n[Ca$_2$CoO$_3$]$_{0.62}$[CoO$_2$] and fabricate the transparent low-layered\ncrystals by a mechanical tape-peeling method using the single-crystalline\nsamples. From the transmittance measurement, we find that the thickness of\nlow-layered samples is several orders of hundred nanometers, which is\ncomparable with the estimation from the scanning electron microscopy images.\nCompared to the previous results on the polycrystalline and $c$-axis oriented\ntransparent films, the electrical resistivity is reduced owing to the\nsingle-crystalline nature. The figure of merit for the transparent conducting\nmaterials in the present low-layered samples is then evaluated to be higher\nthan the values in the previous reports. The present results on the low-layered\nsingle-crystalline [Ca$_2$CoO$_3$]$_{0.62}$[CoO$_2$] may offer a unique class\nof multi-functional transparent thermoelectric oxides.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:35:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Okada","Reiji",""],["Isomura","Hiroto",""],["Sato","Yoshiki J.",""],["Okazaki","Ryuji",""],["Inoue","Masayuki",""],["Yoshioka","Shinya",""]]}
{"id":"2308.03222","submitter":"Zhe Huang","authors":"Zhe Huang, Ye-Ji Mun, Haonan Chen, Yiqing Xie, Yilong Niu, Xiang Li,\n  Ninghan Zhong, Haoyuan You, D. Livingston McPherson, and Katherine\n  Driggs-Campbell","title":"Towards Safe Multi-Level Human-Robot Interaction in Industrial Tasks","comments":"2 pages, 1 figure. Accepted by CASE 2023 Special Session on The\n  Next-Generation Resilient Cyber-Physical Manufacturing Networks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multiple levels of safety measures are required by multiple interaction modes\nwhich collaborative robots need to perform industrial tasks with human\nco-workers. We develop three independent modules to account for safety in\ndifferent types of human-robot interaction: vision-based safety monitoring\npauses robot when human is present in a shared space; contact-based safety\nmonitoring pauses robot when unexpected contact happens between human and\nrobot; hierarchical intention tracking keeps robot in a safe distance from\nhuman when human and robot work independently, and switches robot to compliant\nmode when human intends to guide robot. We discuss the prospect of future\nresearch in development and integration of multi-level safety modules. We focus\non how to provide safety guarantees for collaborative robot solutions with\nhuman behavior modeling.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:39:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Zhe",""],["Mun","Ye-Ji",""],["Chen","Haonan",""],["Xie","Yiqing",""],["Niu","Yilong",""],["Li","Xiang",""],["Zhong","Ninghan",""],["You","Haoyuan",""],["McPherson","D. Livingston",""],["Driggs-Campbell","Katherine",""]]}
{"id":"2308.03223","submitter":"Ngoc Tien Tran","authors":"Ngoc Tien Tran","title":"Discrete weak duality of hybrid high-order methods for convex\n  minimization 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":"  This paper derives a discrete dual problem for a prototypical hybrid\nhigh-order method for convex minimization problems. The discrete primal and\ndual problem satisfy a weak convex duality that leads to a priori error\nestimates with convergence rates under additional smoothness assumptions. This\nduality holds for general polytopal meshes and arbitrary polynomial degree of\nthe discretization. A nouvelle postprocessing is proposed and allows for\na~posteriori error estimates on simplicial meshes using primal-dual techniques.\nThis motivates an adaptive mesh-refining algorithm, which performs superiorly\ncompared to uniform mesh refinements.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:42:07 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 19:12:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tran","Ngoc Tien",""]]}
{"id":"2308.03224","submitter":"Alfredo Gonz\\'alez-Espinoza","authors":"Alfredo Gonz\\'alez-Espinoza, Joshua B. Plotkin","title":"Quantifying the evolution of harmony and novelty in western classical\n  music","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Music is a complex socio-cultural construct, which fascinates researchers in\ndiverse fields, as well as the general public. Understanding the historical\ndevelopment of music may help us understand perceptual and cognition, while\nalso yielding insight in the processes of cultural transmission, creativity,\nand innovation. Here, we present a study of musical features related to\nharmony, and we document how they evolved over 400 years in western classical\nmusic. We developed a variant of the center of effect algorithm to call the\nmost likely for a given set of notes, to represent a musical piece as a\nsequence of local keys computed measure by measure. We develop measures to\nquantify key uncertainty, and diversity and novelty in key transitions. We\nprovide specific examples to demonstrate the features represented by these\nconcepts, and we argue how they are related to harmonic complexity and can be\nused to study the evolution of harmony. We confirm several observations and\ntrends previously reported by musicologists and scientists, with some\ndiscrepancies during the Classical period. We report a decline in innovation in\nharmonic transitions in the early classical period followed by a steep increase\nin the late classical; and we give an explanation for this finding that is\nconsistent with accounts by music theorists. Finally, we discuss the\nlimitations of this approach for cross-cultural studies and the need for more\nexpressive but still tractable representations of musical scores, as well as a\nlarge and reliable musical corpus, for future study.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 23:00:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gonz\u00e1lez-Espinoza","Alfredo",""],["Plotkin","Joshua B.",""]]}
{"id":"2308.03225","submitter":"Maxim Chernodub","authors":"Victor E. Ambru\\c{s} and Maxim N. Chernodub","title":"Acceleration as a circular motion along an imaginary circle:\n  Kubo-Martin-Schwinger condition for accelerating field theories in\n  imaginary-time formalism","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech gr-qc hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss the imaginary-time formalism for field theories in thermal\nequilibrium in uniformly accelerating frames. We show that under a Wick\nrotation of Minkowski spacetime, the Rindler event horizon shrinks to a point\nin a two-dimensional subspace tangential to the acceleration direction and the\nimaginary time. We demonstrate that the accelerated version of the\nKubo-Martin-Schwinger (KMS) condition implies an identification of all\nspacetime points related by integer-multiple rotations in the tangential\nsubspace about this Euclidean Rindler event-horizon point, with the rotational\nquanta defined by the thermal acceleration, $\\alpha = a/T$. In the Wick-rotated\nRindler hyperbolic coordinates, the KMS relations reduce to standard\n(anti-)periodic boundary conditions in terms of the imaginary proper time\n(rapidity) coordinate. Our findings pave the way to study, using\nfirst-principle lattice simulations, the Hawking-Unruh radiation in geometries\nwith event horizons, phase transitions in accelerating Early Universe, and\nearly stages of quark-gluon plasma created in relativistic heavy-ion\ncollisions.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 23:09:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ambru\u015f","Victor E.",""],["Chernodub","Maxim N.",""]]}
{"id":"2308.03226","submitter":"Sudarsana Kadiri","authors":"Sudarsana Reddy Kadiri, Farhad Javanmardi, Paavo Alku","title":"Investigation of Self-supervised Pre-trained Models for Classification\n  of Voice Quality from Speech and Neck Surface Accelerometer Signals","comments":"Accepted by Computer Speech & Language","journal-ref":null,"doi":"10.1016/j.csl.2023.101550","report-no":null,"categories":"eess.AS cs.AI cs.CL cs.MM cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Prior studies in the automatic classification of voice quality have mainly\nstudied the use of the acoustic speech signal as input. Recently, a few studies\nhave been carried out by jointly using both speech and neck surface\naccelerometer (NSA) signals as inputs, and by extracting MFCCs and glottal\nsource features. This study examines simultaneously-recorded speech and NSA\nsignals in the classification of voice quality (breathy, modal, and pressed)\nusing features derived from three self-supervised pre-trained models\n(wav2vec2-BASE, wav2vec2-LARGE, and HuBERT) and using a SVM as well as CNNs as\nclassifiers. Furthermore, the effectiveness of the pre-trained models is\ncompared in feature extraction between glottal source waveforms and raw signal\nwaveforms for both speech and NSA inputs. Using two signal processing methods\n(quasi-closed phase (QCP) glottal inverse filtering and zero frequency\nfiltering (ZFF)), glottal source waveforms are estimated from both speech and\nNSA signals. The study has three main goals: (1) to study whether features\nderived from pre-trained models improve classification accuracy compared to\nconventional features (spectrogram, mel-spectrogram, MFCCs, i-vector, and\nx-vector), (2) to investigate which of the two modalities (speech vs. NSA) is\nmore effective in the classification task with pre-trained model-based\nfeatures, and (3) to evaluate whether the deep learning-based CNN classifier\ncan enhance the classification accuracy in comparison to the SVM classifier.\nThe results revealed that the use of the NSA input showed better classification\nperformance compared to the speech signal. Between the features, the\npre-trained model-based features showed better classification accuracies, both\nfor speech and NSA inputs compared to the conventional features. It was also\nfound that the HuBERT features performed better than the wav2vec2-BASE and\nwav2vec2-LARGE features.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 23:16:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kadiri","Sudarsana Reddy",""],["Javanmardi","Farhad",""],["Alku","Paavo",""]]}
{"id":"2308.03227","submitter":"Ghazal Farhani","authors":"Ghazal Farhani","title":"A Clustering Approach for Remotely Sensed Data in the Western United\n  States","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing frequency and scale of wildfires carry significant ecological,\nsocioeconomic, and environmental implications, prompting the need for a deeper\ngrasp of wildfire characteristics. Essential meteorological factors like\ntemperature, humidity, and precipitation wield a crucial impact on fire\nbehavior and the estimation of burned areas. This study aims to unravel the\ninterconnections between meteorological conditions and fire attributes within\nthe Salmon-Challis National Forest located in east-central Idaho, USA. Through\nthe utilization of remotely sensed data from the Fire Monitoring, Mapping, and\nModeling system (Fire M3) alongside meteorological variables recorded between\n2010 and 2020, an exploration is conducted into varied meteorological patterns\nassociated with wildfire events. By integrating the computed burned area into\nthe clustering process, valuable insights are gained into the specific\ninfluences of fire weather conditions on the extent of burned areas. The\nSalmon-Challis National Forest, encompassing more than 4.3 million acres and\nencompassing the largest wilderness area in the Continental United States,\nemerges as a pivotal research site for wildfire investigations. This work\nelucidates the data attributes employed for clustering and visualization, along\nwith the algorithms employed. Additionally, the study presents research\nfindings and delineates potential future applications, ultimately contributing\nto the advancement of fire management and mitigation strategies in regions\nprone to wildfires.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 23:31:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Farhani","Ghazal",""]]}
{"id":"2308.03228","submitter":"Sarah Payne","authors":"Jordan Kodner, Sarah Payne, Jeffrey Heinz","title":"Why Linguistics Will Thrive in the 21st Century: A Reply to Piantadosi\n  (2023)","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":"  We present a critical assessment of Piantadosi's (2023) claim that \"Modern\nlanguage models refute Chomsky's approach to language,\" focusing on four main\npoints. First, despite the impressive performance and utility of large language\nmodels (LLMs), humans achieve their capacity for language after exposure to\nseveral orders of magnitude less data. The fact that young children become\ncompetent, fluent speakers of their native languages with relatively little\nexposure to them is the central mystery of language learning to which Chomsky\ninitially drew attention, and LLMs currently show little promise of solving\nthis mystery. Second, what can the artificial reveal about the natural? Put\nsimply, the implications of LLMs for our understanding of the cognitive\nstructures and mechanisms underlying language and its acquisition are like the\nimplications of airplanes for understanding how birds fly. Third, LLMs cannot\nconstitute scientific theories of language for several reasons, not least of\nwhich is that scientific theories must provide interpretable explanations, not\njust predictions. This leads to our final point: to even determine whether the\nlinguistic and cognitive capabilities of LLMs rival those of humans requires\nexplicating what humans' capacities actually are. In other words, it requires a\nseparate theory of language and cognition; generative linguistics provides\nprecisely such a theory. As such, we conclude that generative linguistics as a\nscientific discipline will remain indispensable throughout the 21st century and\nbeyond.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 23:41:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kodner","Jordan",""],["Payne","Sarah",""],["Heinz","Jeffrey",""]]}
{"id":"2308.03229","submitter":"Kuo-Wei Huang","authors":"Kuo-Wei Huang","title":"Toward Null State Equations in $d>2$","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In two-dimensional CFTs with a large central charge, the level-two BPZ\nequation governs the heavy-light scalar four-point correlator when the light\nprobe scalar has dimension $h= - {1\\over 2}$; the corresponding linear ordinary\ndifferential equation can be recast into a schematic form $x^2 u_{xx}+u=0$. In\nthis paper, we make an observation that in a class of four-dimensional CFTs\nwith a large central charge, the heavy-light scalar correlator in the\nnear-lightcone limit obeys a similar equation, $x^3 u_{xxxy}+u=0$, when the\nlight scalar has dimension $\\Delta=-1$. We focus on the multi-stress tensor\nsector of the theory and also discuss the corresponding equations for the cases\nwith $\\Delta = -2, -3$. The solutions to these linear partial differential\nequations in higher dimensions are shown, after a suitable change of variables,\nto reproduce the near-lightcone correlators previously obtained via holography\nand conformal bootstrap.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 23:50:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Kuo-Wei",""]]}
{"id":"2308.03230","submitter":"Hrushikesh Mhaskar","authors":"Hrushikesh Mhaskar, Tong Mao","title":"Tractability of approximation by general shallow networks","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":"  In this paper, we present a sharper version of the results in the paper\nDimension independent bounds for general shallow networks; Neural Networks,\n\\textbf{123} (2020), 142-152. Let $\\mathbb{X}$ and $\\mathbb{Y}$ be compact\nmetric spaces. We consider approximation of functions of the form $\nx\\mapsto\\int_{\\mathbb{Y}} G( x, y)d\\tau( y)$, $ x\\in\\mathbb{X}$, by\n$G$-networks of the form $ x\\mapsto \\sum_{k=1}^n a_kG( x, y_k)$, $ y_1,\\cdots,\ny_n\\in\\mathbb{Y}$, $a_1,\\cdots, a_n\\in\\mathbb{R}$. Defining the dimensions of\n$\\mathbb{X}$ and $\\mathbb{Y}$ in terms of covering numbers, we obtain dimension\nindependent bounds on the degree of approximation in terms of $n$, where also\nthe constants involved are all dependent at most polynomially on the\ndimensions. Applications include approximation by power rectified linear unit\nnetworks, zonal function networks, certain radial basis function networks as\nwell as the important problem of function extension to higher dimensional\nspaces.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 00:14:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mhaskar","Hrushikesh",""],["Mao","Tong",""]]}
{"id":"2308.03231","submitter":"Runzhe Tao","authors":"Zhixiong Di, Runzhe Tao, Lin Chen, Qiang Wu, Yibo Lin","title":"Imbalanced Large Graph Learning Framework for FPGA Logic Elements\n  Packing Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Packing is a required step in a typical FPGA CAD flow. It has high impacts to\nthe performance of FPGA placement and routing. Early prediction of packing\nresults can guide design optimization and expedite design closure. In this\nwork, we propose an imbalanced large graph learning framework, ImLG, for\nprediction of whether logic elements will be packed after placement.\nSpecifically, we propose dedicated feature extraction and feature aggregation\nmethods to enhance the node representation learning of circuit graphs. With\nimbalanced distribution of packed and unpacked logic elements, we further\npropose techniques such as graph oversampling and mini-batch training for this\nimbalanced learning task in large circuit graphs. Experimental results\ndemonstrate that our framework can improve the F1 score by 42.82% compared to\nthe most recent Gaussian-based prediction method. Physical design results show\nthat the proposed method can assist the placer in improving routed wirelength\nby 0.93% and SLICE occupation by 0.89%.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 00:30:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Di","Zhixiong",""],["Tao","Runzhe",""],["Chen","Lin",""],["Wu","Qiang",""],["Lin","Yibo",""]]}
{"id":"2308.03232","submitter":"Takuki Tomita","authors":"Yoshinosuke Hirakawa, Takuki Tomita","title":"Absolute zeta functions and ceiling and floor Puiseux polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For the $\\mathbb{Z}$-lift $X_\\mathbb{Z}$ of a Noetherian monoid scheme $X$,\nDeitmar-Koyama-Kurokawa calculated its absolute zeta function by interpolating\n$\\#X_\\mathbb{Z}(\\mathbb{F}_q)$ for all prime powers $q$ using the Fourier\ntransform. In this article, we give another interpretation of their absolute\nzeta function using a certain polynomial which does not necessarily interpolate\n$\\#X_\\mathbb{Z}(\\mathbb{F}_q)$ for all $q$. Extending this idea, we introduce\nan absolute zeta function of a smooth variety $X$ over $\\mathbb{Q}$ by means of\na certain pair of Puiseux polynomials which estimate $\\#X(\\mathbb{F}_{p^m})$\nfor sufficiently large $p$. We call them the ceiling and floor Puiseux\npolynomials of $X$. In particular, our absolute zeta function of an elliptic\ncurve defined over $\\mathbb{Q}$ does not depend on its isomorphism class.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 00:31:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hirakawa","Yoshinosuke",""],["Tomita","Takuki",""]]}
{"id":"2308.03233","submitter":"Runzhe Tao","authors":"Zhixiong Di, Runzhe Tao, Jing Mai, Lin Chen, Yibo Lin","title":"LEAPS: Topological-Layout-Adaptable Multi-die FPGA Placement for Super\n  Long Line Minimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-die FPGAs are crucial components in modern computing systems,\nparticularly for high-performance applications such as artificial intelligence\nand data centers. Super long lines (SLLs) provide interconnections between\nsuper logic regions (SLRs) for a multi-die FPGA on a silicon interposer. They\nhave significantly higher delay compared to regular interconnects, which need\nto be minimized. With the increase in design complexity, the growth of SLLs\ngives rise to challenges in timing and power closure. Existing placement\nalgorithms focus on optimizing the number of SLLs but often face limitations\ndue to specific topologies of SLRs. Furthermore, they fall short of achieving\ncontinuous optimization of SLLs throughout the entire placement process. This\nhighlights the necessity for more advanced and adaptable solutions.\n  In this paper, we propose LEAPS, a comprehensive, systematic, and adaptable\nmulti-die FPGA placement algorithm for SLL minimization. Our contributions are\nthreefold: 1) proposing a high-performance global placement algorithm for\nmulti-die FPGAs that optimizes the number of SLLs while addressing other\nessential design constraints such as wirelength, routability, and clock\nrouting; 2) introducing a versatile method for more complex SLR topologies of\nmulti-die FPGAs, surpassing the limitations of existing approaches; and 3)\nexecuting continuous optimization of SLLs across the whole placement stages,\nincluding global placement (GP), legalization (LG), and detailed placement\n(DP). Experimental results demonstrate the effectiveness of LEAPS in reducing\nSLLs and enhancing circuit performance. Compared with the most recent\nstate-of-the-art (SOTA) method, LEAPS achieves an average reduction of 40.19%\nin SLLs and 9.99% in HPWL, while exhibiting a notable 34.34$\\times$ improvement\nin runtime.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 00:34:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Di","Zhixiong",""],["Tao","Runzhe",""],["Mai","Jing",""],["Chen","Lin",""],["Lin","Yibo",""]]}
{"id":"2308.03234","submitter":"Hunter McNichols","authors":"Hunter McNichols, Wanyong Feng, Jaewook Lee, Alexander Scarlatos,\n  Digory Smith, Simon Woodhead, Andrew Lan","title":"Exploring Automated Distractor and Feedback Generation for Math\n  Multiple-choice Questions via In-context Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiple-choice questions (MCQs) are ubiquitous in almost all levels of\neducation since they are easy to administer, grade, and are a reliable format\nin both assessments and practices. An important aspect of MCQs is the\ndistractors, i.e., incorrect options that are designed to target specific\nmisconceptions or insufficient knowledge among students. To date, the task of\ncrafting high-quality distractors has largely remained a labor-intensive\nprocess for teachers and learning content designers, which has limited\nscalability. In this work, we explore the task of automated distractor and\ncorresponding feedback message generation in math MCQs using large language\nmodels. We establish a formulation of these two tasks and propose a simple,\nin-context learning-based solution. Moreover, we explore using two non-standard\nmetrics to evaluate the quality of the generated distractors and feedback\nmessages. We conduct extensive experiments on these tasks using a real-world\nMCQ dataset that contains student response information. Our findings suggest\nthat there is a lot of room for improvement in automated distractor and\nfeedback generation. We also outline several directions for future work\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:03:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["McNichols","Hunter",""],["Feng","Wanyong",""],["Lee","Jaewook",""],["Scarlatos","Alexander",""],["Smith","Digory",""],["Woodhead","Simon",""],["Lan","Andrew",""]]}
{"id":"2308.03235","submitter":"Nour Eddine Zekaoui","authors":"Nour Eddine Zekaoui, Siham Yousfi, Maryem Rhanoui, Mounia Mikram","title":"Analysis of the Evolution of Advanced Transformer-Based Language Models:\n  Experiments on Opinion Mining","comments":null,"journal-ref":"IAES Int. J. Artif. Intell. (IJ-AI) 12(4), 1995-2010 (Dec. 2023)","doi":"10.11591/ijai.v12.i4.pp1995-2010","report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Opinion mining, also known as sentiment analysis, is a subfield of natural\nlanguage processing (NLP) that focuses on identifying and extracting subjective\ninformation in textual material. This can include determining the overall\nsentiment of a piece of text (e.g., positive or negative), as well as\nidentifying specific emotions or opinions expressed in the text, that involves\nthe use of advanced machine and deep learning techniques. Recently,\ntransformer-based language models make this task of human emotion analysis\nintuitive, thanks to the attention mechanism and parallel computation. These\nadvantages make such models very powerful on linguistic tasks, unlike recurrent\nneural networks that spend a lot of time on sequential processing, making them\nprone to fail when it comes to processing long text. The scope of our paper\naims to study the behaviour of the cutting-edge Transformer-based language\nmodels on opinion mining and provide a high-level comparison between them to\nhighlight their key particularities. Additionally, our comparative study shows\nleads and paves the way for production engineers regarding the approach to\nfocus on and is useful for researchers as it provides guidelines for future\nresearch subjects.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:10:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zekaoui","Nour Eddine",""],["Yousfi","Siham",""],["Rhanoui","Maryem",""],["Mikram","Mounia",""]]}
{"id":"2308.03236","submitter":"Xingyu Li","authors":"Xingyu Li and Bo Tang","title":"G-Mix: A Generalized Mixup Learning Framework Towards Flat Minima","comments":"19 pages, 23 figures","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 demonstrated promising results in various\ncomplex tasks. However, current DNNs encounter challenges with\nover-parameterization, especially when there is limited training data\navailable. To enhance the generalization capability of DNNs, the Mixup\ntechnique has gained popularity. Nevertheless, it still produces suboptimal\noutcomes. Inspired by the successful Sharpness-Aware Minimization (SAM)\napproach, which establishes a connection between the sharpness of the training\nloss landscape and model generalization, we propose a new learning framework\ncalled Generalized-Mixup, which combines the strengths of Mixup and SAM for\ntraining DNN models. The theoretical analysis provided demonstrates how the\ndeveloped G-Mix framework enhances generalization. Additionally, to further\noptimize DNN performance with the G-Mix framework, we introduce two novel\nalgorithms: Binary G-Mix and Decomposed G-Mix. These algorithms partition the\ntraining data into two subsets based on the sharpness-sensitivity of each\nexample to address the issue of \"manifold intrusion\" in Mixup. Both theoretical\nexplanations and experimental results reveal that the proposed BG-Mix and\nDG-Mix algorithms further enhance model generalization across multiple datasets\nand models, achieving state-of-the-art performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:25:10 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 16:14:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Xingyu",""],["Tang","Bo",""]]}
{"id":"2308.03237","submitter":"Srishti Pal","authors":"Srishti Pal, Arnab Seth, Anzar Ali, Yogesh Singh, D. V. S. Muthu,\n  Subhro Bhattacharjee, and A. K. Sood","title":"Strong coupling of lattice and orbital excitations in quantum magnet\n  Ca$_{10}$Cr$_7$O$_{28}$: Anomalous temperature dependence of Raman phonons","comments":"5 pages, 3 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 report low-temperature Raman signatures of the Heisenberg quantum magnet\nCa$_{10}$Cr$_7$O$_{28}$, showing clear anomalies in phonon mode frequencies and\nlinewidths below $\\sim$100 K. This crossover temperature lies in between the\nJahn-Teller (JT) temperature scale ($>$ room temperature) and the temperature\nscale associated with the spin exchange interactions ($<$ 12 K). Our\nexperimental observation is well captured by a novel secondary JT transition\nassociated with a cooperative reorientation of the orbitals giving rise to\nanomalies in the temperature dependence of Raman frequencies and linewidths.\nSuch orbital reorganisation, in turn, affects the spin-spin exchange\ninteractions that decide the fate of the magnet at lower temperatures and hence\nprovide important clues to understand the energetics of the possible lower\ntemperature quantum paramagnetic phase.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:28:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pal","Srishti",""],["Seth","Arnab",""],["Ali","Anzar",""],["Singh","Yogesh",""],["Muthu","D. V. S.",""],["Bhattacharjee","Subhro",""],["Sood","A. K.",""]]}
{"id":"2308.03238","submitter":"Athul Pradeepkumar Girija","authors":"Athul Pradeepkumar Girija","title":"A Survey of the Design Trade Space for Atmospheric Entry, Descent, and\n  Landing Missions","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM physics.app-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Over the history of planetary exploration, atmospheric entry vehicles have\nbeen used to deliver probes and landers to Venus, Mars, Jupiter, and Titan.\nWhile the entry vehicles are tools for furthering scientific exploration, by\ndelivering probes and landers which perform in-situ exploration, the entry\nvehicle and trajectory design in itself is of significant interest. Entering an\natmosphere subjects the vehicle to deceleration and aerodynamic heating loads\nwhich the vehicle must withstand to deliver the probe or the lander inside the\natmosphere. The conditions encountered depend on the destination, the\natmosphere-relative entry speed, the vehicle type, ballistic coefficient, the\nvehicle geometry, and the entry-flight path angle. The driving constraints are\nthe peak aerodynamic deceleration, peak heat rate, and the total heat load\nencountered during the critical phase of the entry. Jupiter presents the most\nextreme entry conditions, while Titan presents the most benign entry\nenvironment. This study presents a survey of the design trade space for\natmospheric entry missions across the Solar System using carpet plots, along\nwith benchmarks from historical missions, which can serve as a useful reference\nfor designing future missions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:28:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Girija","Athul Pradeepkumar",""]]}
{"id":"2308.03239","submitter":"Bora Yongacoglu","authors":"Bora Yongacoglu and G\\\"urdal Arslan and Serdar Y\\\"uksel","title":"Asynchronous Decentralized Q-Learning: Two Timescale Analysis By\n  Persistence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.LG cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-stationarity is a fundamental challenge in multi-agent reinforcement\nlearning (MARL), where agents update their behaviour as they learn. Many\ntheoretical advances in MARL avoid the challenge of non-stationarity by\ncoordinating the policy updates of agents in various ways, including\nsynchronizing times at which agents are allowed to revise their policies.\nSynchronization enables analysis of many MARL algorithms via multi-timescale\nmethods, but such synchrony is infeasible in many decentralized applications.\nIn this paper, we study an asynchronous variant of the decentralized Q-learning\nalgorithm, a recent MARL algorithm for stochastic games. We provide sufficient\nconditions under which the asynchronous algorithm drives play to equilibrium\nwith high probability. Our solution utilizes constant learning rates in the\nQ-factor update, which we show to be critical for relaxing the synchrony\nassumptions of earlier work. Our analysis also applies to asynchronous\ngeneralizations of a number of other algorithms from the regret testing\ntradition, whose performance is analyzed by multi-timescale methods that study\nMarkov chains obtained via policy update dynamics. This work extends the\napplicability of the decentralized Q-learning algorithm and its relatives to\nsettings in which parameters are selected in an independent manner, and tames\nnon-stationarity without imposing the coordination assumptions of prior work.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:32:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yongacoglu","Bora",""],["Arslan","G\u00fcrdal",""],["Y\u00fcksel","Serdar",""]]}
{"id":"2308.03240","submitter":"Xin Chen","authors":"Xin Chen, Andy Sun, Wenbo Shi, Na Li","title":"Carbon-Aware Optimal Power Flow","comments":null,"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":"  To facilitate effective decarbonization of the electric power sector, this\npaper introduces the generic Carbon-aware Optimal Power Flow (C-OPF) method for\npower system decision-making that considers demand-side carbon accounting and\nemission management. Built upon the classic optimal power flow (OPF) model, the\nC-OPF method incorporates carbon emission flow equations and constraints, as\nwell as carbon-related objectives, to jointly optimize power flow and carbon\nflow. In particular, this paper establishes the invertibility of the carbon\nflow matrix and proposes modeling and linearization techniques to address the\nissues of undetermined power flow directions and bilinear terms in the C-OPF\nmodel. Additionally, two novel carbon emission models, together with the carbon\naccounting schemes, for energy storage systems are developed and integrated\ninto the C-OPF model. Numerical simulations demonstrate the characteristics and\neffectiveness of the C-OPF method, in comparison with OPF solutions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:32:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Xin",""],["Sun","Andy",""],["Shi","Wenbo",""],["Li","Na",""]]}
{"id":"2308.03241","submitter":"Sudheesh Singanamalla","authors":"Venkatesh Potluri, Sudheesh Singanamalla, Nussara Tieanklin, Jennifer\n  Mankoff","title":"Notably Inaccessible -- Data Driven Understanding of Data Science\n  Notebook (In)Accessibility","comments":"19 pages, 8 figures, 5 tables","journal-ref":null,"doi":"10.1145/3597638.3608417","report-no":null,"categories":"cs.HC cs.CY cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational notebooks, tools that facilitate storytelling through\nexploration, data analysis, and information visualization, have become the\nwidely accepted standard in the data science community. These notebooks have\nbeen widely adopted through notebook software such as Jupyter, Datalore and\nGoogle Colab, both in academia and industry. While there is extensive research\nto learn how data scientists use computational notebooks, identify their pain\npoints, and enable collaborative data science practices, very little is known\nabout the various accessibility barriers experienced by blind and visually\nimpaired (BVI) users using these notebooks. BVI users are unable to use\ncomputational notebook interfaces due to (1) inaccessibility of the interface,\n(2) common ways in which data is represented in these interfaces, and (3)\ninability for popular libraries to provide accessible outputs. We perform a\nlarge scale systematic analysis of 100000 Jupyter notebooks to identify various\naccessibility challenges in published notebooks affecting the creation and\nconsumption of these notebooks. Through our findings, we make recommendations\nto improve accessibility of the artifacts of a notebook, suggest authoring\npractices, and propose changes to infrastructure to make notebooks accessible.\nAn accessible PDF can be obtained at\nhttps://blvi.dev/noteably-inaccessible-paper\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:33:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Potluri","Venkatesh",""],["Singanamalla","Sudheesh",""],["Tieanklin","Nussara",""],["Mankoff","Jennifer",""]]}
{"id":"2308.03242","submitter":"Yi Zhang","authors":"Ya-xiang Yuan and Yi Zhang","title":"Analysis Accelerated Mirror Descent via High-resolution ODEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mirror descent plays a crucial role in constrained optimization and\nacceleration schemes, along with its corresponding low-resolution ordinary\ndifferential equations (ODEs) framework have been proposed. However, the\nlow-resolution ODEs are unable to distinguish between Polyak's heavy-ball\nmethod and Nesterov's accelerated gradient method. This problem also arises\nwith accelerated mirror descent. To address this issue, we derive\nhigh-resolution ODEs for accelerated mirror descent and propose a general\nLyapunov function framework to analyze its convergence rate in both continuous\nand discrete time. Furthermore, we demonstrate that accelerated mirror descent\ncan minimize the squared gradient norm at an inverse cubic rate.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:40:23 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 01:58:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yuan","Ya-xiang",""],["Zhang","Yi",""]]}
{"id":"2308.03243","submitter":"Chien-Cheng Chyou","authors":"Chien Cheng Chyou, Hung-Ting Su, Winston H. Hsu","title":"Unsupervised Adversarial Detection without Extra Model: Training Loss\n  Should Change","comments":"AdvML in ICML 2023\n  code:https://github.com/CycleBooster/Unsupervised-adversarial-detection-without-extra-model","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adversarial robustness poses a critical challenge in the deployment of deep\nlearning models for real-world applications. Traditional approaches to\nadversarial training and supervised detection rely on prior knowledge of attack\ntypes and access to labeled training data, which is often impractical. Existing\nunsupervised adversarial detection methods identify whether the target model\nworks properly, but they suffer from bad accuracies owing to the use of common\ncross-entropy training loss, which relies on unnecessary features and\nstrengthens adversarial attacks. We propose new training losses to reduce\nuseless features and the corresponding detection method without prior knowledge\nof adversarial attacks. The detection rate (true positive rate) against all\ngiven white-box attacks is above 93.9% except for attacks without limits\n(DF($\\infty$)), while the false positive rate is barely 2.5%. The proposed\nmethod works well in all tested attack types and the false positive rates are\neven better than the methods good at certain types.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:41:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chyou","Chien Cheng",""],["Su","Hung-Ting",""],["Hsu","Winston H.",""]]}
{"id":"2308.03244","submitter":"Chongyang Zhao","authors":"Chongyang Zhao, Yuankai Qi and Qi Wu","title":"Mind the Gap: Improving Success Rate of Vision-and-Language Navigation\n  by Revisiting Oracle Success Routes","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":"  Vision-and-Language Navigation (VLN) aims to navigate to the target location\nby following a given instruction. Unlike existing methods focused on predicting\na more accurate action at each step in navigation, in this paper, we make the\nfirst attempt to tackle a long-ignored problem in VLN: narrowing the gap\nbetween Success Rate (SR) and Oracle Success Rate (OSR). We observe a\nconsistently large gap (up to 9%) on four state-of-the-art VLN methods across\ntwo benchmark datasets: R2R and REVERIE. The high OSR indicates the robot agent\npasses the target location, while the low SR suggests the agent actually fails\nto stop at the target location at last. Instead of predicting actions directly,\nwe propose to mine the target location from a trajectory given by off-the-shelf\nVLN models. Specially, we design a multi-module transformer-based model for\nlearning compact discriminative trajectory viewpoint representation, which is\nused to predict the confidence of being a target location as described in the\ninstruction. The proposed method is evaluated on three widely-adopted datasets:\nR2R, REVERIE and NDH, and shows promising results, demonstrating the potential\nfor more future research.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:43:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Chongyang",""],["Qi","Yuankai",""],["Wu","Qi",""]]}
{"id":"2308.03245","submitter":"Yu Lu","authors":"Yu Lu, Shao-Ming Fei","title":"Detection of Genuine Multipartite Entanglement in Arbitrary Multipartite\n  systems","comments":"13 pages, 3 figures,1 table","journal-ref":"ResultsinPhysics52(2023)106816","doi":"10.1016/j.rinp.2023.106816","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study the genuine multipartite entanglement of arbitrary $n$-partite\nquantum states by representing the density matrices in terms of the generalized\nPauli operators. We introduce a general framework for detecting genuine\nmultipartite entanglement and non full-separability of multipartite quantum\nstates with arbitrary dimensions based on correlation tensors. Effective\ncriterion is derived to verify the genuine multipartite entanglement. Detailed\nexamples are given to show that the criterion detects more genuine multipartite\nentanglement than the existing criteria.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:44:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lu","Yu",""],["Fei","Shao-Ming",""]]}
{"id":"2308.03246","submitter":"Chao Min","authors":"Chao Min, Liwei Wang and Yang Chen","title":"Asymptotics of Hankel Determinants for Some Freud Weights","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the large $n$ asymptotics of Hankel determinants\ngenerated by some nontrivial Freud weight functions. These are obtained from\nthe integral representations of the Hankel determinants in terms of the\nrecurrence coefficients for the corresponding orthogonal polynomials and with\nthe aid of a recent result of Claeys, Krasovsky and Minakov [Commun. Math.\nPhys. 402 (2023) 833-894]. We also derive the large $n$ asymptotics of the\nsub-leading coefficients and the squares of $L^2$-norm of the monic orthogonal\npolynomials.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:48:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Min","Chao",""],["Wang","Liwei",""],["Chen","Yang",""]]}
{"id":"2308.03247","submitter":"Shuzhen Yang","authors":"Shuzhen Yang","title":"Parameter learning: stochastic optimal control approach with\n  reinforcement learning","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we develop a stochastic optimal control approach with\nreinforcement learning structure to learn the unknown parameters appeared in\nthe drift and diffusion terms of the stochastic differential equation. By\nchoosing an appropriate cost functional, based on a classical optimal feedback\ncontrol, we translate the original optimal control problem to a new control\nproblem which takes place the unknown parameter as control, and the related\noptimal control can be used to estimate the unknown parameter. We establish the\nmathematical framework of the dynamic equation for the exploratory state, which\nis consistent with the existing results. Furthermore, we consider the linear\nstochastic differential equation case where the drift or diffusion term with\nunknown parameter. Then, we investigate the general case where both the drift\nand diffusion terms contain unknown parameters. For the above cases, we show\nthat the optimal density function satisfies a Gaussian distribution which can\nbe used to estimate the unknown parameter. Based on the obtained estimation of\nthe parameters, we can do empirical analysis for a given model.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:53:00 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 12:57:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Shuzhen",""]]}
{"id":"2308.03248","submitter":"Uri Onn","authors":"Tyrone Crisp, Ehud Meir and Uri Onn","title":"Functor morphing and representations of automorphism groups of modules","comments":"Preliminary version, comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a strategy to study irreducible representations of automorphism\ngroups of finite modules over local rings. We prove that these automorphism\ngroups fit in a hierarchy that facilitates a stratification of their\nirreducible representations in terms of smaller building blocks using symmetric\nmonoidal categories and invariant theory.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:00:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Crisp","Tyrone",""],["Meir","Ehud",""],["Onn","Uri",""]]}
{"id":"2308.03249","submitter":"Mahdi Nikdast","authors":"Amin Shafiee, Sanmitra Banerjee, Krishnendu Chakrabarty, Sudeep\n  Pasricha, Mahdi Nikdast","title":"Analysis of Optical Loss and Crosstalk Noise in MZI-based Coherent\n  Photonic Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET cs.AI cs.PF","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the continuous increase in the size and complexity of machine learning\nmodels, the need for specialized hardware to efficiently run such models is\nrapidly growing. To address such a need, silicon-photonic-based neural network\n(SP-NN) accelerators have recently emerged as a promising alternative to\nelectronic accelerators due to their lower latency and higher energy\nefficiency. Not only can SP-NNs alleviate the fan-in and fan-out problem with\nlinear algebra processors, their operational bandwidth can match that of the\nphotodetection rate (typically 100 GHz), which is at least over an order of\nmagnitude faster than electronic counterparts that are restricted to a clock\nrate of a few GHz. Unfortunately, the underlying silicon photonic devices in\nSP-NNs suffer from inherent optical losses and crosstalk noise originating from\nfabrication imperfections and undesired optical couplings, the impact of which\naccumulates as the network scales up. Consequently, the inferencing accuracy in\nan SP-NN can be affected by such inefficiencies -- e.g., can drop to below 10%\n-- the impact of which is yet to be fully studied. In this paper, we\ncomprehensively model the optical loss and crosstalk noise using a bottom-up\napproach, from the device to the system level, in coherent SP-NNs built using\nMach-Zehnder interferometer (MZI) devices. The proposed models can be applied\nto any SP-NN architecture with different configurations to analyze the effect\nof loss and crosstalk. Such an analysis is important where there are\ninferencing accuracy and scalability requirements to meet when designing an\nSP-NN. Using the proposed analytical framework, we show a high power penalty\nand a catastrophic inferencing accuracy drop of up to 84% for SP-NNs of\ndifferent scales with three known MZI mesh configurations (i.e., Reck,\nClements, and Diamond) due to accumulated optical loss and crosstalk noise.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:01:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shafiee","Amin",""],["Banerjee","Sanmitra",""],["Chakrabarty","Krishnendu",""],["Pasricha","Sudeep",""],["Nikdast","Mahdi",""]]}
{"id":"2308.03250","submitter":"Samson H. W. Leong","authors":"Samson H. W. Leong, Juan Calder\\'on Bustillo, Miguel Gracia-Linares,\n  Pablo Laguna","title":"Impact of ringdown higher-order modes on black-hole mergers in dense\n  environments: the scalar field case, detectability and parameter biases","comments":null,"journal-ref":null,"doi":null,"report-no":"LIGO DCC -- P2300236","categories":"gr-qc astro-ph.CO astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dense environments hosting compact binary mergers can leave an imprint on the\ngravitational-wave emission which, in turn, can be used to identify the\ncharacteristics of the environment. To demonstrate such scenario, we consider a\nsimple setup of binary black holes with an environment consisting of a\nscalar-field bubble. We use this as a proxy for more realistic environments and\nas an example of the simplest physics beyond the standard model. We perform\nBayesian inference on the numerical relativity waveforms using state-of-the-art\nwaveform templates for black-hole mergers. In particular, we perform parameter\nestimation and model selection on signals from black-hole mergers with\ndifferent mass ratios, total mass and loudness, and hosted by scalar-field\nbubbles of varying field amplitude. We find that sub-dominant gravitational\nwave modes emitted during the coalescence and ringdown are key to identifying\nenvironmental effects. In particular, we find that for face-on signals\ndominated by the quadrupole mode, the environment is only detectable if both\nthe ringdown and the late inspiral/early merger fall in the detector band, so\nthat inconsistencies can be found between the inferred binary parameters and\nthose of the final black hole. For edge-on mergers we find that the environment\ncan be detected even if only the ringdown is in band, thanks to the information\nencoded in the quasi-normal mode structure of the final black-hole.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:02:00 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 07:05:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Leong","Samson H. W.",""],["Bustillo","Juan Calder\u00f3n",""],["Gracia-Linares","Miguel",""],["Laguna","Pablo",""]]}
{"id":"2308.03251","submitter":"Seok-Hwan Park","authors":"Sangwon Jo, Hoon Lee, Seok-Hwan Park","title":"Joint Precoding and Fronthaul Compression for Cell-Free MIMO Downlink\n  With Radio Stripes","comments":"To be presented at IEEE Globecom 2023, Kuala Lumpur, Malaysia, Dec.\n  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":"  A sequential fronthaul network, referred to as radio stripes, is a promising\nfronthaul topology of cell-free MIMO systems. In this setup, a single cable\nsuffices to connect access points (APs) to a central processor (CP). Thus,\nradio stripes are more effective than conventional star fronthaul topology\nwhich requires dedicated cables for each of APs. Most of works on radio stripes\nfocused on the uplink communication or downlink energy transfer. This work\ntackles the design of the downlink data transmission for the first time. The CP\nsends compressed information of linearly precoded signals to the APs on\nfronthaul. Due to the serial transfer on radio stripes, each AP has an access\nto all the compressed blocks which pass through it. Thus, an advanced\ncompression technique, called Wyner-Ziv (WZ) compression, can be applied in\nwhich each AP decompresses all the received blocks to exploit them for the\nreconstruction of its desired precoded signal as side information. The problem\nof maximizing the sum-rate is tackled under the standard point-to-point (P2P)\nand WZ compression strategies. Numerical results validate the performance gains\nof the proposed scheme.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:07:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jo","Sangwon",""],["Lee","Hoon",""],["Park","Seok-Hwan",""]]}
{"id":"2308.03252","submitter":"Sidong Feng","authors":"Sidong Feng, Chunyang Chen, Zhenchang Xing","title":"Video2Action: Reducing Human Interactions in Action Annotation of App\n  Tutorial Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tutorial videos of mobile apps have become a popular and compelling way for\nusers to learn unfamiliar app features. To make the video accessible to the\nusers, video creators always need to annotate the actions in the video,\nincluding what actions are performed and where to tap. However, this process\ncan be time-consuming and labor-intensive. In this paper, we introduce a\nlightweight approach Video2Action, to automatically generate the action scenes\nand predict the action locations from the video by using image-processing and\ndeep-learning methods. The automated experiments demonstrate the good\nperformance of Video2Action in acquiring actions from the videos, and a user\nstudy shows the usefulness of our generated action cues in assisting video\ncreators with action annotation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:08:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Sidong",""],["Chen","Chunyang",""],["Xing","Zhenchang",""]]}
{"id":"2308.03253","submitter":"Zonghai Yao","authors":"Pengshan Cai, Zonghai Yao, Fei Liu, Dakuo Wang, Meghan Reilly, Huixue\n  Zhou, Lingxi Li, Yi Cao, Alok Kapoor, Adarsha Bajracharya, Dan Berlowitz,\n  Hong Yu","title":"PaniniQA: Enhancing Patient Education Through Interactive Question\n  Answering","comments":"Accepted to TACL 2023. Equal contribution for the first two authors.\n  This arXiv version is a pre-MIT Press publication version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Patient portal allows discharged patients to access their personalized\ndischarge instructions in electronic health records (EHRs). However, many\npatients have difficulty understanding or memorizing their discharge\ninstructions. In this paper, we present PaniniQA, a patient-centric interactive\nquestion answering system designed to help patients understand their discharge\ninstructions. PaniniQA first identifies important clinical content from\npatients' discharge instructions and then formulates patient-specific\neducational questions. In addition, PaniniQA is also equipped with answer\nverification functionality to provide timely feedback to correct patients'\nmisunderstandings. Our comprehensive automatic and human evaluation results\ndemonstrate our PaniniQA is capable of improving patients' mastery of their\nmedical instructions through effective interactions\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:18:23 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 02:41:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cai","Pengshan",""],["Yao","Zonghai",""],["Liu","Fei",""],["Wang","Dakuo",""],["Reilly","Meghan",""],["Zhou","Huixue",""],["Li","Lingxi",""],["Cao","Yi",""],["Kapoor","Alok",""],["Bajracharya","Adarsha",""],["Berlowitz","Dan",""],["Yu","Hong",""]]}
{"id":"2308.03254","submitter":"Rudolf Podgornik","authors":"Hu Ruixuan, Arghya Majee, Jure Dobnikar and Rudolf Podgornik","title":"Electrostatic interactions between charge regulated spherical macroions","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the interaction between two charge regulating spherical macroions\nwith dielectric interior and dissociable surface groups immersed in a\nmonovalent electrolyte solution. The charge dissociation is modelled via the\nFrumkin-Fowler-Guggenheim isotherm, which allows for multiple adsorption\nequilibrium states. The interactions are derived from the solutions of the\nmean-field Poisson-Boltzmann type theory with charge regulation boundary\nconditions. For a range of conditions we find symmetry breaking transitions\nfrom symmetric to asymmetric charge distribution exhibiting annealed charge\npatchiness, which results in like-charge attraction even in a univalent\nelectrolyte -- thus fundamentally modifying the nature of electrostatic\ninteractions in charge-stabilized colloidal suspensions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:18:40 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 01:33:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ruixuan","Hu",""],["Majee","Arghya",""],["Dobnikar","Jure",""],["Podgornik","Rudolf",""]]}
{"id":"2308.03255","submitter":"XinLin Zhao","authors":"Xinlin. Zhao, Song. Wang, Xue. Li, Junhui. Liu, Bowen. Huang, Haibo.\n  Yuan, Zhongrui. Bai, Hailong. Yuan, Haotong. Zhang, Jifeng. Liu","title":"Wide binaries with white dwarf or neutron star companions discovered\n  from Gaia DR3 and LAMOST","comments":"15 pages, 10 figures, accepted by APJ","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":"  Gaia DR3 mission has provided orbital parameter estimations for about 440,000\nbinary systems, offering a valuable resource for searching binaries including a\ncompact component. By combining the Gaia DR3 data with radial velocities (RVs)\nfrom the LAMOST spectroscopic survey, we identify three wide binaries\ncontaining white dwarf or neutron star. For each binary system, we estimate the\nstellar parameters of the visible companion (either a main-sequence star or a\ngiant) and orbital parameters, and calculate the binary mass function and the\nminimum mass of the unseen object. Notably, all these unseen objects have a\nminimum mass in excess of 1.4 solarmass when using the Gaia DR3 orbital\nsolutions. There is no obvious excess observed in the blue/red band of the Gaia\nDR3 XP spectra, and the LAMOST medium-resolution spectra do not exhibit any\nprominent double-lined feature. The absence of an additional component in the\nresults of spectral disentangling further suggests the presence of compact\nobjects within these systems.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:24:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Xinlin.",""],["Wang","Song.",""],["Li","Xue.",""],["Liu","Junhui.",""],["Huang","Bowen.",""],["Yuan","Haibo.",""],["Bai","Zhongrui.",""],["Yuan","Hailong.",""],["Zhang","Haotong.",""],["Liu","Jifeng.",""]]}
{"id":"2308.03256","submitter":"Js Chen","authors":"Jiawei Li, Jiansheng Chen, Jinyuan Liu, Huimin Ma","title":"Learning a Graph Neural Network with Cross Modality Interaction for\n  Image Fusion","comments":"9 pages, 10 figures, ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Infrared and visible image fusion has gradually proved to be a vital fork in\nthe field of multi-modality imaging technologies. In recent developments,\nresearchers not only focus on the quality of fused images but also evaluate\ntheir performance in downstream tasks. Nevertheless, the majority of methods\nseldom put their eyes on the mutual learning from different modalities,\nresulting in fused images lacking significant details and textures. To overcome\nthis issue, we propose an interactive graph neural network (GNN)-based\narchitecture between cross modality for fusion, called IGNet. Specifically, we\nfirst apply a multi-scale extractor to achieve shallow features, which are\nemployed as the necessary input to build graph structures. Then, the graph\ninteraction module can construct the extracted intermediate features of the\ninfrared/visible branch into graph structures. Meanwhile, the graph structures\nof two branches interact for cross-modality and semantic learning, so that\nfused images can maintain the important feature expressions and enhance the\nperformance of downstream tasks. Besides, the proposed leader nodes can improve\ninformation propagation in the same modality. Finally, we merge all graph\nfeatures to get the fusion result. Extensive experiments on different datasets\n(TNO, MFNet and M3FD) demonstrate that our IGNet can generate visually\nappealing fused images while scoring averagely 2.59% mAP@.5 and 7.77% mIoU\nhigher in detection and segmentation than the compared state-of-the-art\nmethods. The source code of the proposed IGNet can be available at\nhttps://github.com/lok-18/IGNet.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:25:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Jiawei",""],["Chen","Jiansheng",""],["Liu","Jinyuan",""],["Ma","Huimin",""]]}
{"id":"2308.03257","submitter":"Hyunki Seong","authors":"Hyunki Seong and David Hyunchul Shim","title":"TempFuser: Learning Tactical and Agile Flight Maneuvers in Aerial\n  Dogfights using a Long Short-Term Temporal Fusion Transformer","comments":"8 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Aerial dogfights necessitate understanding the tactically changing maneuvers\nfrom a long-term perspective, along with the rapidly changing aerodynamics from\na short-term view. In this paper, we propose a novel long short-term temporal\nfusion transformer (TempFuser) for a policy network in aerial dogfights. Our\nmethod uses two LSTM-based input embeddings to encode long-term, sparse state\ntrajectories, as well as short-term, dense state trajectories. By integrating\nthe two embeddings through a transformer encoder, the method subsequently\nderives end-to-end flight commands for agile and tactical maneuvers. We\nformulate a deep reinforcement learning framework to train our TempFuser-based\npolicy model. We then extensively validate our model, demonstrating that it\noutperforms other baseline models against a diverse range of opponent aircraft\nin a high-fidelity environment. Our model successfully learns basic fighter\nmaneuvers, human pilot-like tactical maneuvers, and robust supersonic pursuit\nin low altitudes without explicitly coded prior knowledge. Videos are available\nat \\url{https://sites.google.com/view/tempfuser}\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:28:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Seong","Hyunki",""],["Shim","David Hyunchul",""]]}
{"id":"2308.03258","submitter":"Tianrui Qin","authors":"Tianrui Qin, Xitong Gao, Juanjuan Zhao, Kejiang Ye, Cheng-Zhong Xu","title":"APBench: A Unified Benchmark for Availability Poisoning Attacks and\n  Defenses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The efficacy of availability poisoning, a method of poisoning data by\ninjecting imperceptible perturbations to prevent its use in model training, has\nbeen a hot subject of investigation. Previous research suggested that it was\ndifficult to effectively counteract such poisoning attacks. However, the\nintroduction of various defense methods has challenged this notion. Due to the\nrapid progress in this field, the performance of different novel methods cannot\nbe accurately validated due to variations in experimental setups. To further\nevaluate the attack and defense capabilities of these poisoning methods, we\nhave developed a benchmark -- APBench for assessing the efficacy of adversarial\npoisoning. APBench consists of 9 state-of-the-art availability poisoning\nattacks, 8 defense algorithms, and 4 conventional data augmentation techniques.\nWe also have set up experiments with varying different poisoning ratios, and\nevaluated the attacks on multiple datasets and their transferability across\nmodel architectures. We further conducted a comprehensive evaluation of 2\nadditional attacks specifically targeting unsupervised models. Our results\nreveal the glaring inadequacy of existing attacks in safeguarding individual\nprivacy. APBench is open source and available to the deep learning community:\nhttps://github.com/lafeat/apbench.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:30:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Qin","Tianrui",""],["Gao","Xitong",""],["Zhao","Juanjuan",""],["Ye","Kejiang",""],["Xu","Cheng-Zhong",""]]}
{"id":"2308.03259","submitter":"Shao-Bo Lin","authors":"Shao-Bo Lin","title":"Optimal Approximation and Learning Rates for Deep Convolutional Neural\n  Networks","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper focuses on approximation and learning performance analysis for\ndeep convolutional neural networks with zero-padding and max-pooling. We prove\nthat, to approximate $r$-smooth function, the approximation rates of deep\nconvolutional neural networks with depth $L$ are of order $ (L^2/\\log\nL)^{-2r/d} $, which is optimal up to a logarithmic factor. Furthermore, we\ndeduce almost optimal learning rates for implementing empirical risk\nminimization over deep convolutional neural networks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:37:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lin","Shao-Bo",""]]}
{"id":"2308.03260","submitter":"Niranjan Sitapure","authors":"Niranjan Sitapure, and Atharva Kulkarni","title":"Exploring Different Time-series-Transformer (TST) Architectures: A Case\n  Study in Battery Life Prediction for Electric Vehicles (EVs)","comments":"13 pages and 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, battery technology for electric vehicles (EVs) has been a\nmajor focus, with a significant emphasis on developing new battery materials\nand chemistries. However, accurately predicting key battery parameters, such as\nstate-of-charge (SOC) and temperature, remains a challenge for constructing\nadvanced battery management systems (BMS). Existing battery models do not\ncomprehensively cover all parameters affecting battery performance, including\nnon-battery-related factors like ambient temperature, cabin temperature,\nelevation, and regenerative braking during EV operation. Due to the difficulty\nof incorporating these auxiliary parameters into traditional models, a\ndata-driven approach is suggested. Time-series-transformers (TSTs), leveraging\nmultiheaded attention and parallelization-friendly architecture, are explored\nalongside LSTM models. Novel TST architectures, including encoder TST + decoder\nLSTM and a hybrid TST-LSTM, are also developed and compared against existing\nmodels. A dataset comprising 72 driving trips in a BMW i3 (60 Ah) is used to\naddress battery life prediction in EVs, aiming to create accurate TST models\nthat incorporate environmental, battery, vehicle driving, and heating circuit\ndata to predict SOC and battery temperature for future time steps.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:42:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sitapure","Niranjan",""],["Kulkarni","Atharva",""]]}
{"id":"2308.03261","submitter":"Qi-Fang L\\\"u","authors":"Qing-Fu Song, Qi-Fang L\\\"u, Atsushi Hosaka","title":"Bottom-charmed baryons in a nonrelativistic quark model","comments":"13 pages, 6 figures, comments and suggestions are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we study the low-lying mass spectra for bottom-charmed baryons\nin a nonrelativistic quark model by solving the three-body Schr\\\"odinger\nequation. The lowest $\\Xi_{bc}$, $\\Xi_{bc}^\\prime$, $\\Omega_{bc}$, and\n$\\Omega_{bc}^\\prime$ states are predicted to be about 6979, 6953, 7109, and\n7092 MeV, respectively. Also, the strong decays for the low-lying excited\nstates are investigated. Our results indicate that some of $\\lambda-$mode\n$P-$wave bottom-charmed baryons are relatively narrow, which can be searched\nfor in future experiments. For the low-lying $\\rho-$mode and $\\rho-\\lambda$\nhybrid states, their strong decays are highly suppressed and they can survive\nas extremely narrow states. Moreover, the mass spectra and strong decays for\nbottom-charmed baryons preserve the heavy quark symmetry well. We hope our\ncalculations can provide helpful information for further experimental and\ntheoretical researches.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:46:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Song","Qing-Fu",""],["L\u00fc","Qi-Fang",""],["Hosaka","Atsushi",""]]}
{"id":"2308.03262","submitter":"Jianqi Ma","authors":"Jianqi Ma, Zhetong Liang, Wangmeng Xiang, Xi Yang, Lei Zhang","title":"A Benchmark for Chinese-English Scene Text Image Super-resolution","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":"  Scene Text Image Super-resolution (STISR) aims to recover high-resolution\n(HR) scene text images with visually pleasant and readable text content from\nthe given low-resolution (LR) input. Most existing works focus on recovering\nEnglish texts, which have relatively simple character structures, while little\nwork has been done on the more challenging Chinese texts with diverse and\ncomplex character structures. In this paper, we propose a real-world\nChinese-English benchmark dataset, namely Real-CE, for the task of STISR with\nthe emphasis on restoring structurally complex Chinese characters. The\nbenchmark provides 1,935/783 real-world LR-HR text image pairs~(contains 33,789\ntext lines in total) for training/testing in 2$\\times$ and 4$\\times$ zooming\nmodes, complemented by detailed annotations, including detection boxes and text\ntranscripts. Moreover, we design an edge-aware learning method, which provides\nstructural supervision in image and feature domains, to effectively reconstruct\nthe dense structures of Chinese characters. We conduct experiments on the\nproposed Real-CE benchmark and evaluate the existing STISR models with and\nwithout our edge-aware loss. The benchmark, including data and source code, is\navailable at https://github.com/mjq11302010044/Real-CE.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 02:57:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Jianqi",""],["Liang","Zhetong",""],["Xiang","Wangmeng",""],["Yang","Xi",""],["Zhang","Lei",""]]}
{"id":"2308.03263","submitter":"Xilong Pei","authors":"Xilong Pei, Haifan Yin, Li Tan, Lin Cao, Taorui Yang","title":"Prototyping and real-world field trials of RIS-aided wireless\n  communications","comments":"10 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reconfigurable intelligent surface (RIS) is a promising technology that has\nthe potential to change the way we interact with the wireless propagating\nenvironment. In this paper, we design and fabricate an RIS system that can be\nused in the fifth generation (5G) mobile communication networks. We also\npropose a practical two-step spatial-oversampling codebook algorithm for the\nbeamforming of RIS, which is based on the spatial structure of the wireless\nchannel. This algorithm has much lower complexity compared to the\ntwo-dimensional full-space searching-based codebook, yet with only negligible\nperformance loss. Then, a series of experiments are conducted with the\nfabricated RIS systems, covering the office, corridor, and outdoor\nenvironments, in order to verified the effectiveness of RIS in both laboratory\nand current 5G commercial networks. In the office and corridor scenarios, the\n5.8 GHz RIS provided a 10-20 dB power gain at the receiver. In the outdoor\ntest, over 35 dB power gain was observed with RIS compared to the\nnon-deployment case. However, in commercial 5G networks, the 2.6 GHz RIS\nimproved indoor signal strength by only 4-7 dB. The experimental results\nindicate that RIS achieves higher power gain when transceivers are equipped\nwith directional antennas instead of omni-directional antennas.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:00:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pei","Xilong",""],["Yin","Haifan",""],["Tan","Li",""],["Cao","Lin",""],["Yang","Taorui",""]]}
{"id":"2308.03264","submitter":"Yang Lu","authors":"Yang Lu, Xinglong Zhang, Xin Xu, Weijia Yao","title":"Learning-based Near-optimal Motion Planning for Intelligent Vehicles\n  with Uncertain Dynamics","comments":"10 pages, 12 figures, submitted to RAL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motion planning has been an important research topic in achieving safe and\nflexible maneuvers for intelligent vehicles. However, it remains challenging to\nrealize efficient and optimal planning in the presence of uncertain model\ndynamics. In this paper, a sparse kernel-based reinforcement learning (RL)\nalgorithm with Gaussian Process (GP) Regression (called GP-SKRL) is proposed to\nachieve online adaption and near-optimal motion planning performance. In this\nalgorithm, we design an efficient sparse GP regression method to learn the\nuncertain dynamics. Based on the updated model, a sparse kernel-based policy\niteration algorithm with an exponential barrier function is designed to learn\nthe near-optimal planning policies with the capability to avoid dynamic\nobstacles. Thereby, batch-mode GP-SKRL with online adaption capability can\nestimate the changing system dynamics. The converged RL policies are then\ndeployed on vehicles efficiently under a safety-aware module. As a result, the\nproduced driving actions are safe and less conservative, and the planning\nperformance has been noticeably improved. Extensive simulation results show\nthat GP-SKRL outperforms several advanced motion planning methods in terms of\naverage cumulative cost, trajectory length, and task completion time. In\nparticular, experiments on a Hongqi E-HS3 vehicle demonstrate that superior\nGP-SKRL provides a practical planning solution.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:06:12 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 08:40:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lu","Yang",""],["Zhang","Xinglong",""],["Xu","Xin",""],["Yao","Weijia",""]]}
{"id":"2308.03265","submitter":"Campbell Wheeler","authors":"Campbell Wheeler","title":"Quantum modularity for a closed hyperbolic 3-manifold","comments":"72 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"MPIM-Bonn-2023","categories":"math.GT hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proves quantum modularity of both functions from $\\mathbb{Q}$ and\n$q$-series associated to the closed manifold obtained by $-1/2$ surgery on the\nfigure-eight knot, $4_1(-1,2)$. In a sense, this is a companion to work of\nGaroufalidis-Zagier where similar statements were studied in detail for some\nsimple knots. It is shown that quantum modularity for closed manifolds provides\na unification of Chen-Yang's volume conjecture with Witten's asymptotic\nexpansion conjecture. Additionally we show that $4_1(-1,2)$ is a\ncounter-examples to previous conjectures relating the Witten-Reshetikhin-Turaev\ninvariant and the $\\widehat{Z}(q)$ series. This could be reformulated in terms\nof a \"strange identity\", which gives a volume conjecture for the $\\widehat{Z}$\ninvariant. Using factorisation of state integrals, we give conjectural but\nprecise $q$-hypergeometric formulae for generating series of Stokes constants\nof this manifold. This is the first such precise proposal for a closed\nhyperbolic manifold. This work appeared in a similar form in the author's\nthesis.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:07:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wheeler","Campbell",""]]}
{"id":"2308.03266","submitter":"Xian Shi","authors":"Xian Shi, Yexin Yang, Zerui Li, Shiliang Zhang","title":"SeACo-Paraformer: A Non-Autoregressive ASR System with Flexible and\n  Effective Hotword Customization Ability","comments":"updated draft","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hotword customization is one of the important issues remained in ASR field -\nit is of value to enable users of ASR systems to customize names of entities,\npersons and other phrases. The past few years have seen both implicit and\nexplicit modeling strategies for ASR contextualization developed. While these\napproaches have performed adequately, they still exhibit certain shortcomings\nsuch as instability in effectiveness. In this paper we propose\nSemantic-augmented Contextual-Paraformer (SeACo-Paraformer) a novel NAR based\nASR system with flexible and effective hotword customization ability. It\ncombines the accuracy of the AED-based model, the efficiency of the NAR model,\nand the excellent performance in contextualization. In 50,000 hours industrial\nbig data experiments, our proposed model outperforms strong baselines in\ncustomization and general ASR tasks. Besides, we explore an efficient way to\nfilter large scale incoming hotwords for further improvement. The source codes\nand industrial models proposed and compared are all opened as well as two\nhotword test sets.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:12:27 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 07:03:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shi","Xian",""],["Yang","Yexin",""],["Li","Zerui",""],["Zhang","Shiliang",""]]}
{"id":"2308.03267","submitter":"Yicong Li","authors":"Yicong Li, Xun Yang, An Zhang, Chun Feng, Xiang Wang, Tat-Seng Chua","title":"Redundancy-aware Transformer for Video Question Answering","comments":"Accepted to ACM MM23","journal-ref":null,"doi":"10.1145/3581783.3612577","report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper identifies two kinds of redundancy in the current VideoQA\nparadigm. Specifically, the current video encoders tend to holistically embed\nall video clues at different granularities in a hierarchical manner, which\ninevitably introduces \\textit{neighboring-frame redundancy} that can overwhelm\ndetailed visual clues at the object level. Subsequently, prevailing\nvision-language fusion designs introduce the \\textit{cross-modal redundancy} by\nexhaustively fusing all visual elements with question tokens without explicitly\ndifferentiating their pairwise vision-language interactions, thus making a\npernicious impact on the answering.\n  To this end, we propose a novel transformer-based architecture, that aims to\nmodel VideoQA in a redundancy-aware manner. To address the neighboring-frame\nredundancy, we introduce a video encoder structure that emphasizes the\nobject-level change in neighboring frames, while adopting an out-of-neighboring\nmessage-passing scheme that imposes attention only on distant frames. As for\nthe cross-modal redundancy, we equip our fusion module with a novel adaptive\nsampling, which explicitly differentiates the vision-language interactions by\nidentifying a small subset of visual elements that exclusively support the\nanswer. Upon these advancements, we find this\n\\underline{R}edundancy-\\underline{a}ware trans\\underline{former} (RaFormer) can\nachieve state-of-the-art results on multiple VideoQA benchmarks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:16:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yicong",""],["Yang","Xun",""],["Zhang","An",""],["Feng","Chun",""],["Wang","Xiang",""],["Chua","Tat-Seng",""]]}
{"id":"2308.03268","submitter":"Xin Chen","authors":"Xin Chen, Hungpo Chao, Wenbo Shi, Na Li","title":"Towards Carbon-Free Electricity: A Comprehensive Flow-Based Framework\n  for Power Grid Carbon Accounting and Decarbonization","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 presents a comprehensive framework for advancing research and\npolicy development related to decarbonization in electric power systems. It\nencompasses three pivotal subjects, including carbon accounting, carbon-aware\ndecision-making, and carbon-electricity market design. For each of these\nsubjects, this paper outlines the key problems, existing methods, and potential\nsolutions. Distinguished from existing pool-based emissions models, this\nframework introduces a novel flow-based emissions model that incorporates the\nunderlying physical power grid and power flows. It thus enables precise carbon\naccounting at both temporal and spatial scales, facilitating informed\ndecision-making towards achieving the ultimate objective of grid\ndecarbonization. Specifically, this framework presents a flow-based accounting\nmethodology, introduces the carbon-aware optimal power flow (C-OPF) technique\nas the theoretical foundation for decarbonization decision-making, and explores\nthe potential design of carbon-electricity markets and carbon pricing\nmechanisms to incentivize decentralized decarbonization actions. Additionally,\nthis paper provides in-depth discussions of the critical issues that arise\nwithin these subjects, such as data availability, infrastructure development,\nfairness and equity, and more.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:18:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Xin",""],["Chao","Hungpo",""],["Shi","Wenbo",""],["Li","Na",""]]}
{"id":"2308.03269","submitter":"Haodi Ma","authors":"Haodi Ma, Anthony Colas, Yuejie Wang, Ali Sadeghian, Daisy Zhe Wang","title":"Simple Rule Injection for ComplEx 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":"  Recent works in neural knowledge graph inference attempt to combine logic\nrules with knowledge graph embeddings to benefit from prior knowledge. However,\nthey usually cannot avoid rule grounding, and injecting a diverse set of rules\nhas still not been thoroughly explored. In this work, we propose InjEx, a\nmechanism to inject multiple types of rules through simple constraints, which\ncapture definite Horn rules. To start, we theoretically prove that InjEx can\ninject such rules. Next, to demonstrate that InjEx infuses interpretable prior\nknowledge into the embedding space, we evaluate InjEx on both the knowledge\ngraph completion (KGC) and few-shot knowledge graph completion (FKGC) settings.\nOur experimental results reveal that InjEx outperforms both baseline KGC models\nas well as specialized few-shot models while maintaining its scalability and\nefficiency.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:19:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Haodi",""],["Colas","Anthony",""],["Wang","Yuejie",""],["Sadeghian","Ali",""],["Wang","Daisy Zhe",""]]}
{"id":"2308.03270","submitter":"Ruxi Shi","authors":"Ruxi Shi and Guohua Zhang","title":"Mean topological dimension of induced amenable group actions","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we generalize [BS22, Main Theorem] from actions of a single\ntransformation to amenable group actions, which answers affirmatively the\nquestion raised in [BS22] by Burguet and the first-named author of the paper.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:21:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shi","Ruxi",""],["Zhang","Guohua",""]]}
{"id":"2308.03271","submitter":"Kai Yang","authors":"Kai Yang, Yuan Liu, Zijuan Zhao, Peijin Ding, Wenqian Zhao","title":"Local Structure-aware Graph Contrastive Representation 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":"  Traditional Graph Neural Network (GNN), as a graph representation learning\nmethod, is constrained by label information. However, Graph Contrastive\nLearning (GCL) methods, which tackle the label problem effectively, mainly\nfocus on the feature information of the global graph or small subgraph\nstructure (e.g., the first-order neighborhood). In the paper, we propose a\nLocal Structure-aware Graph Contrastive representation Learning method (LS-GCL)\nto model the structural information of nodes from multiple views. Specifically,\nwe construct the semantic subgraphs that are not limited to the first-order\nneighbors. For the local view, the semantic subgraph of each target node is\ninput into a shared GNN encoder to obtain the target node embeddings at the\nsubgraph-level. Then, we use a pooling function to generate the subgraph-level\ngraph embeddings. For the global view, considering the original graph preserves\nindispensable semantic information of nodes, we leverage the shared GNN encoder\nto learn the target node embeddings at the global graph-level. The proposed\nLS-GCL model is optimized to maximize the common information among similar\ninstances at three various perspectives through a multi-level contrastive loss\nfunction. Experimental results on five datasets illustrate that our method\noutperforms state-of-the-art graph representation learning approaches for both\nnode classification and link prediction tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:23:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Kai",""],["Liu","Yuan",""],["Zhao","Zijuan",""],["Ding","Peijin",""],["Zhao","Wenqian",""]]}
{"id":"2308.03272","submitter":"Xinda Liu","authors":"Xinda Liu, Yaohui Zhu, Linhu Liu, Jiang Tian, Lili Wang","title":"Feature-Suppressed Contrast for Self-Supervised Food Pre-training","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":"  Most previous approaches for analyzing food images have relied on extensively\nannotated datasets, resulting in significant human labeling expenses due to the\nvaried and intricate nature of such images. Inspired by the effectiveness of\ncontrastive self-supervised methods in utilizing unlabelled data, weiqing\nexplore leveraging these techniques on unlabelled food images. In contrastive\nself-supervised methods, two views are randomly generated from an image by data\naugmentations. However, regarding food images, the two views tend to contain\nsimilar informative contents, causing large mutual information, which impedes\nthe efficacy of contrastive self-supervised learning. To address this problem,\nwe propose Feature Suppressed Contrast (FeaSC) to reduce mutual information\nbetween views. As the similar contents of the two views are salient or highly\nresponsive in the feature map, the proposed FeaSC uses a response-aware scheme\nto localize salient features in an unsupervised manner. By suppressing some\nsalient features in one view while leaving another contrast view unchanged, the\nmutual information between the two views is reduced, thereby enhancing the\neffectiveness of contrast learning for self-supervised food pre-training. As a\nplug-and-play module, the proposed method consistently improves BYOL and\nSimSiam by 1.70\\% $\\sim$ 6.69\\% classification accuracy on four publicly\navailable food recognition datasets. Superior results have also been achieved\non downstream segmentation tasks, demonstrating the effectiveness of the\nproposed method.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:27:04 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:37:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Xinda",""],["Zhu","Yaohui",""],["Liu","Linhu",""],["Tian","Jiang",""],["Wang","Lili",""]]}
{"id":"2308.03273","submitter":"Tingguang Li","authors":"Tingguang Li, Yizheng Zhang, Chong Zhang, Qingxu Zhu, Jiapeng sheng,\n  Wanchao Chi, Cheng Zhou, Lei Han","title":"Learning Terrain-Adaptive Locomotion with Agile Behaviors by Imitating\n  Animals","comments":"7 pages, 5 figures. To be published in IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a general learning framework for controlling a\nquadruped robot that can mimic the behavior of real animals and traverse\nchallenging terrains. Our method consists of two steps: an imitation learning\nstep to learn from motions of real animals, and a terrain adaptation step to\nenable generalization to unseen terrains. We capture motions from a Labrador on\nvarious terrains to facilitate terrain adaptive locomotion. Our experiments\ndemonstrate that our policy can traverse various terrains and produce a\nnatural-looking behavior. We deployed our method on the real quadruped robot\nMax via zero-shot simulation-to-reality transfer, achieving a speed of 1.1 m/s\non stairs climbing.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:29:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Tingguang",""],["Zhang","Yizheng",""],["Zhang","Chong",""],["Zhu","Qingxu",""],["sheng","Jiapeng",""],["Chi","Wanchao",""],["Zhou","Cheng",""],["Han","Lei",""]]}
{"id":"2308.03274","submitter":"Chengqing Yu","authors":"Chengqing Yu, Fei Wang, Zezhi Shao, Tao Sun, Lin Wu, Yongjun Xu","title":"DSformer: A Double Sampling Transformer for Multivariate Time Series\n  Long-term Prediction","comments":"Accepted by CIKM 2023 (FULL paper)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multivariate time series long-term prediction, which aims to predict the\nchange of data in a long time, can provide references for decision-making.\nAlthough transformer-based models have made progress in this field, they\nusually do not make full use of three features of multivariate time series:\nglobal information, local information, and variables correlation. To\neffectively mine the above three features and establish a high-precision\nprediction model, we propose a double sampling transformer (DSformer), which\nconsists of the double sampling (DS) block and the temporal variable attention\n(TVA) block. Firstly, the DS block employs down sampling and piecewise sampling\nto transform the original series into feature vectors that focus on global\ninformation and local information respectively. Then, TVA block uses temporal\nattention and variable attention to mine these feature vectors from different\ndimensions and extract key information. Finally, based on a parallel structure,\nDSformer uses multiple TVA blocks to mine and integrate different features\nobtained from DS blocks respectively. The integrated feature information is\npassed to the generative decoder based on a multi-layer perceptron to realize\nmultivariate time series long-term prediction. Experimental results on nine\nreal-world datasets show that DSformer can outperform eight existing baselines.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:32:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yu","Chengqing",""],["Wang","Fei",""],["Shao","Zezhi",""],["Sun","Tao",""],["Wu","Lin",""],["Xu","Yongjun",""]]}
{"id":"2308.03275","submitter":"Xiachong Feng","authors":"Xiachong Feng, Xiaocheng Feng, Xiyuan Du, Min-Yen Kan, Bing Qin","title":"Adapter-based Selective Knowledge Distillation for Federated\n  Multi-domain Meeting Summarization","comments":"This work has been submitted to the IEEE TASLP for possible\n  publication. Copyright may be transferred without notice, after which this\n  version may no longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Meeting summarization has emerged as a promising technique for providing\nusers with condensed summaries. However, existing work has focused on training\nmodels on centralized data, neglecting real-world scenarios where meeting data\nare infeasible to collect centrally, due to their sensitive nature. This gap\nmotivates us to explore federated learning for meeting summarization. Two\ncritical challenges impede progress. First, state-of-the-art summarizers are\nbased on parameter-heavy pre-trained models. Exchanging such a model's\nparameters across clients imposes large bandwidth costs. Second, as real-world\nmeeting data belong to various domains and are distributed across clients, they\nare instances of non-identically and independently distributed (non-IID). IID\nassumptions do not hold, which changes which forms of learning algorithms best\napply. To address this, we propose Adapter-based Federated Selective Knowledge\nDistillation (AdaFedSelecKD) for training performant client models.\nSpecifically, we develop an adapter-based summarization model where two\nadapters cooperatively facilitate learning using fewer parameters to reduce\ncommunication costs. Then, we devise a selective knowledge distillation\nstrategy, assisting clients in robustly handling domain-focused modelling on\ntheir own data, while leveraging global parameters based on non-IID data.\nExtensive experiments on the QMSum benchmark demonstrate AdaFedSelecKD can\nachieve comparable performance with powerful centralized training methods, and\nshows its generalizability and robustness.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:34:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Xiachong",""],["Feng","Xiaocheng",""],["Du","Xiyuan",""],["Kan","Min-Yen",""],["Qin","Bing",""]]}
{"id":"2308.03276","submitter":"Chanwut Kittivorawong","authors":"Chanwut Kittivorawong, Yongming Ge, Yousef Helal, Alvin Cheung","title":"Spatialyze: A Geospatial Video Analytics System with Spatial-Aware\n  Optimizations","comments":"GitHub Repository: https://github.com/apperception-db/spatialyze","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Videos that are shot using commodity hardware such as phones and surveillance\ncameras record various metadata such as time and location. We encounter such\ngeospatial videos on a daily basis and such videos have been growing in volume\nsignificantly. Yet, we do not have data management systems that allow users to\ninteract with such data effectively.\n  In this paper, we describe Spatialyze, a new framework for end-to-end\nquerying of geospatial videos. Spatialyze comes with a domain-specific language\nwhere users can construct geospatial video analytic workflows using a 3-step,\ndeclarative, build-filter-observe paradigm. Internally, Spatialyze leverages\nthe declarative nature of such workflows, the temporal-spatial metadata stored\nwith videos, and physical behavior of real-world objects to optimize the\nexecution of workflows. Our results using real-world videos and workflows show\nthat Spatialyze can reduce execution time by up to 5.3x, while maintaining up\nto 97.1% accuracy compared to unoptimized execution.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:35:47 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:55:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kittivorawong","Chanwut",""],["Ge","Yongming",""],["Helal","Yousef",""],["Cheung","Alvin",""]]}
{"id":"2308.03277","submitter":"Shiyu Yuan","authors":"Shiyu Yuan, Jingda Yang, Sudhanshu Arya, Carlo Lipizzi, Ying Wang","title":"From Ambiguity to Explicitness: NLP-Assisted 5G Specification\n  Abstraction for Formal Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Formal method-based analysis of the 5G Wireless Communication Protocol is\ncrucial for identifying logical vulnerabilities and facilitating an\nall-encompassing security assessment, especially in the design phase. Natural\nLanguage Processing (NLP) assisted techniques and most of the tools are not\nwidely adopted by the industry and research community. Traditional formal\nverification through a mathematics approach heavily relied on manual logical\nabstraction prone to being time-consuming, and error-prone. The reason that the\nNLP-assisted method did not apply in industrial research may be due to the\nambiguity in the natural language of the protocol designs nature is\ncontroversial to the explicitness of formal verification. To address the\nchallenge of adopting the formal methods in protocol designs, targeting (3GPP)\nprotocols that are written in natural language, in this study, we propose a\nhybrid approach to streamline the analysis of protocols. We introduce a\ntwo-step pipeline that first uses NLP tools to construct data and then uses\nconstructed data to extract identifiers and formal properties by using the NLP\nmodel. The identifiers and formal properties are further used for formal\nanalysis. We implemented three models that take different dependencies between\nidentifiers and formal properties as criteria. Our results of the optimal model\nreach valid accuracy of 39% for identifier extraction and 42% for formal\nproperties predictions. Our work is proof of concept for an efficient procedure\nin performing formal analysis for largescale complicate specification and\nprotocol analysis, especially for 5G and nextG communications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:37:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yuan","Shiyu",""],["Yang","Jingda",""],["Arya","Sudhanshu",""],["Lipizzi","Carlo",""],["Wang","Ying",""]]}
{"id":"2308.03278","submitter":"Kerui Huang","authors":"Kerui Huang, Jianhong Tian, Lei Sun, Li Zeng, Peng Xie, Aihua Deng,\n  Ping Mo, Zhibo Zhou, Ming Jiang, Yun Wang, Xiaocheng Jiang","title":"Key Gene Mining in Transcriptional Regulation for Specific Biological\n  Processes with Small Sample Sizes Using Multi-network pipeline Transformer","comments":"34 pages,6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gene mining is an important topic in the field of life sciences, but\ntraditional machine learning methods cannot consider the regulatory\nrelationships between genes. Deep learning methods perform poorly in small\nsample sizes. This study proposed a deep learning method, called\nTransGeneSelector, that can mine critical regulatory genes involved in certain\nlife processes using a small-sample transcriptome dataset. The method combines\na WGAN-GP data augmentation network, a sample filtering network, and a\nTransformer classifier network, which successfully classified the state\n(germinating or dry seeds) of Arabidopsis thaliana seed in a dataset of 79\nsamples, showing performance comparable to that of Random Forests. Further,\nthrough the use of SHapley Additive exPlanations method, TransGeneSelector\nsuccessfully mined genes involved in seed germination. Through the construction\nof gene regulatory networks and the enrichment analysis of KEGG, as well as\nRT-qPCR quantitative analysis, it was confirmed that these genes are at a more\nupstream regulatory level than those Random Forests mined, and the top 11 genes\nthat were uniquely mined by TransGeneSelector were found to be related to the\nKAI2 signaling pathway, which is of great regulatory importance for\ngermination-related genes. This study provides a practical tool for life\nscience researchers to mine key genes from transcriptome data.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:37:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Kerui",""],["Tian","Jianhong",""],["Sun","Lei",""],["Zeng","Li",""],["Xie","Peng",""],["Deng","Aihua",""],["Mo","Ping",""],["Zhou","Zhibo",""],["Jiang","Ming",""],["Wang","Yun",""],["Jiang","Xiaocheng",""]]}
{"id":"2308.03279","submitter":"Wenxuan Zhou","authors":"Wenxuan Zhou, Sheng Zhang, Yu Gu, Muhao Chen, Hoifung Poon","title":"UniversalNER: Targeted Distillation from Large Language Models for Open\n  Named Entity Recognition","comments":"Project page: https://universal-ner.github.io/","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 remarkable generalizability,\nsuch as understanding arbitrary entities and relations. Instruction tuning has\nproven effective for distilling LLMs into more cost-efficient models such as\nAlpaca and Vicuna. Yet such student models still trail the original LLMs by\nlarge margins in downstream applications. In this paper, we explore targeted\ndistillation with mission-focused instruction tuning to train student models\nthat can excel in a broad application class such as open information\nextraction. Using named entity recognition (NER) for case study, we show how\nChatGPT can be distilled into much smaller UniversalNER models for open NER.\nFor evaluation, we assemble the largest NER benchmark to date, comprising 43\ndatasets across 9 diverse domains such as biomedicine, programming, social\nmedia, law, finance. Without using any direct supervision, UniversalNER attains\nremarkable NER accuracy across tens of thousands of entity types, outperforming\ngeneral instruction-tuned models such as Alpaca and Vicuna by over 30 absolute\nF1 points in average. With a tiny fraction of parameters, UniversalNER not only\nacquires ChatGPT's capability in recognizing arbitrary entity types, but also\noutperforms its NER accuracy by 7-9 absolute F1 points in average. Remarkably,\nUniversalNER even outperforms by a large margin state-of-the-art multi-task\ninstruction-tuned systems such as InstructUIE, which uses supervised NER\nexamples. We also conduct thorough ablation studies to assess the impact of\nvarious components in our distillation approach. We will release the\ndistillation recipe, data, and UniversalNER models to facilitate future\nresearch on targeted distillation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:39:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Wenxuan",""],["Zhang","Sheng",""],["Gu","Yu",""],["Chen","Muhao",""],["Poon","Hoifung",""]]}
{"id":"2308.03280","submitter":"Junyi Zeng","authors":"Junyi Zeng, Chong Bao, Rui Chen, Zilong Dong, Guofeng Zhang, Hujun\n  Bao, Zhaopeng Cui","title":"Mirror-NeRF: Learning Neural Radiance Fields for Mirrors with\n  Whitted-Style Ray Tracing","comments":"Accepted to ACM Multimedia 2023. Project Page:\n  https://zju3dv.github.io/Mirror-NeRF/","journal-ref":null,"doi":"10.1145/3581783.3611857","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Neural Radiance Fields (NeRF) has exhibited significant success in\nnovel view synthesis, surface reconstruction, etc. However, since no physical\nreflection is considered in its rendering pipeline, NeRF mistakes the\nreflection in the mirror as a separate virtual scene, leading to the inaccurate\nreconstruction of the mirror and multi-view inconsistent reflections in the\nmirror. In this paper, we present a novel neural rendering framework, named\nMirror-NeRF, which is able to learn accurate geometry and reflection of the\nmirror and support various scene manipulation applications with mirrors, such\nas adding new objects or mirrors into the scene and synthesizing the\nreflections of these new objects in mirrors, controlling mirror roughness, etc.\nTo achieve this goal, we propose a unified radiance field by introducing the\nreflection probability and tracing rays following the light transport model of\nWhitted Ray Tracing, and also develop several techniques to facilitate the\nlearning process. Experiments and comparisons on both synthetic and real\ndatasets demonstrate the superiority of our method. The code and supplementary\nmaterial are available on the project webpage:\nhttps://zju3dv.github.io/Mirror-NeRF/.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:48:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zeng","Junyi",""],["Bao","Chong",""],["Chen","Rui",""],["Dong","Zilong",""],["Zhang","Guofeng",""],["Bao","Hujun",""],["Cui","Zhaopeng",""]]}
{"id":"2308.03281","submitter":"Dinkun Long","authors":"Zehan Li, Xin Zhang, Yanzhao Zhang, Dingkun Long, Pengjun Xie, Meishan\n  Zhang","title":"Towards General Text Embeddings with Multi-stage Contrastive Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present GTE, a general-purpose text embedding model trained with\nmulti-stage contrastive learning. In line with recent advancements in unifying\nvarious NLP tasks into a single format, we train a unified text embedding model\nby employing contrastive learning over a diverse mixture of datasets from\nmultiple sources. By significantly increasing the number of training data\nduring both unsupervised pre-training and supervised fine-tuning stages, we\nachieve substantial performance gains over existing embedding models. Notably,\neven with a relatively modest parameter count of 110M, GTE$_\\text{base}$\noutperforms the black-box embedding API provided by OpenAI and even surpasses\n10x larger text embedding models on the massive text embedding benchmark.\nFurthermore, without additional fine-tuning on each programming language\nindividually, our model outperforms previous best code retrievers of similar\nsize by treating code as text. In summary, our model achieves impressive\nresults by effectively harnessing multi-stage contrastive learning, offering a\npowerful and efficient text embedding model with broad applicability across\nvarious NLP and code-related tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:52:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Zehan",""],["Zhang","Xin",""],["Zhang","Yanzhao",""],["Long","Dingkun",""],["Xie","Pengjun",""],["Zhang","Meishan",""]]}
{"id":"2308.03282","submitter":"Yukuan Min","authors":"Yukuan Min and Aming Wu and Cheng Deng","title":"Environment-Invariant Curriculum Relation Learning for Fine-Grained\n  Scene Graph Generation","comments":"ICCV2023. arXiv admin note: text overlap with arXiv:2203.11654 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The scene graph generation (SGG) task is designed to identify the predicates\nbased on the subject-object pairs.However,existing datasets generally include\ntwo imbalance cases: one is the class imbalance from the predicted predicates\nand another is the context imbalance from the given subject-object pairs, which\npresents significant challenges for SGG. Most existing methods focus on the\nimbalance of the predicted predicate while ignoring the imbalance of the\nsubject-object pairs, which could not achieve satisfactory results. To address\nthe two imbalance cases, we propose a novel Environment Invariant Curriculum\nRelation learning (EICR) method, which can be applied in a plug-and-play\nfashion to existing SGG methods. Concretely, to remove the imbalance of the\nsubject-object pairs, we first construct different distribution environments\nfor the subject-object pairs and learn a model invariant to the environment\nchanges. Then, we construct a class-balanced curriculum learning strategy to\nbalance the different environments to remove the predicate imbalance.\nComprehensive experiments conducted on VG and GQA datasets demonstrate that our\nEICR framework can be taken as a general strategy for various SGG models, and\nachieve significant improvements.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:56:15 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 01:19:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Min","Yukuan",""],["Wu","Aming",""],["Deng","Cheng",""]]}
{"id":"2308.03283","submitter":"Qin Liao","authors":"Qin Liao, Jieyu Liu, Anqi Huang, Lei Huang, Zhuoying Fei, Xiquan Fu","title":"High-rate discretely-modulated continuous-variable quantum key\n  distribution using quantum machine learning","comments":"18 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a high-rate scheme for discretely-modulated continuous-variable\nquantum key distribution (DM CVQKD) using quantum machine learning\ntechnologies, which divides the whole CVQKD system into three parts, i.e., the\ninitialization part that is used for training and estimating quantum\nclassifier, the prediction part that is used for generating highly correlated\nraw keys, and the data-postprocessing part that generates the final secret key\nstring shared by Alice and Bob. To this end, a low-complexity quantum k-nearest\nneighbor (QkNN) classifier is designed for predicting the lossy\ndiscretely-modulated coherent states (DMCSs) at Bob's side. The performance of\nthe proposed QkNN-based CVQKD especially in terms of machine learning metrics\nand complexity is analyzed, and its theoretical security is proved by using\nsemi-definite program (SDP) method. Numerical simulation shows that the secret\nkey rate of our proposed scheme is explicitly superior to the existing DM CVQKD\nprotocols, and it can be further enhanced with the increase of modulation\nvariance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:00:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liao","Qin",""],["Liu","Jieyu",""],["Huang","Anqi",""],["Huang","Lei",""],["Fei","Zhuoying",""],["Fu","Xiquan",""]]}
{"id":"2308.03284","submitter":"Narges Heidari","authors":"N. Heidari, H. Hassanabadi, A. A. Ara\\'ujo Filho and J. K\\u{r}\\'i\\u{z}","title":"Exploring Non--commutativity as a Perturbation in the Schwarzschild\n  Black Hole: Quasinormal Modes, Scattering, and Shadows","comments":null,"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 work, by a novel approach to studying the scattering of a\nSchwarzschild black hole, the non--commutativity is introduced as a\nperturbation. We begin by reformulating the Klein--Gordon equation for the\nscalar field in a new form that takes into account the deformed\nnon--commutative spacetime. Using this formulation, an effective potential for\nthe scattering process is derived. To calculate the quasinormal modes, we\nemploy the WKB method and also utilize fitting techniques to investigate the\nimpact of non--commutativity on the scalar quasinormal modes. We thoroughly\nanalyze the results obtained from these different methods. Moreover, the\ngreybody factor and absorption cross section are investigated. Additionally, we\nexplore the behavior of null geodesics in the presence of non--commutativity.\nSpecifically, we examine the photonic, and shadow radius as well as the light\ntrajectories for different non--commutative parameters. Therefore, by\naddressing these various aspects, we aim to provide a comprehensive\nunderstanding of the influence of non--commutativity on the scattering of a\nSchwarzschild--like black hole and its implications for the behavior of scalar\nfields and light trajectories.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:03:50 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 17:55:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Heidari","N.",""],["Hassanabadi","H.",""],["Filho","A. A. Ara\u00fajo",""],["Kur\u00eduz","J.",""]]}
{"id":"2308.03285","submitter":"Yoonjung Lee","authors":"Mikyoung Lee and Yoonjung Lee","title":"Weighted Hessian estimates in Orlicz spaces for nondivergence elliptic\n  operators with certain potentials","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove interior weighted Hessian estimates in Orlicz spaces for\nnondivergence type elliptic equations with a lower order term which involves a\nnonnegative potential satisfying a reverse H\\\"older type condition.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:04:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lee","Mikyoung",""],["Lee","Yoonjung",""]]}
{"id":"2308.03286","submitter":"Ke Zhu","authors":"Ke Zhu and Minghao Fu and Jianxin Wu","title":"Multi-Label Self-Supervised Learning with Scene Images","comments":"ICCV2023","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) methods targeting scene images have seen a\nrapid growth recently, and they mostly rely on either a dedicated dense\nmatching mechanism or a costly unsupervised object discovery module. This paper\nshows that instead of hinging on these strenuous operations, quality image\nrepresentations can be learned by treating scene/multi-label image SSL simply\nas a multi-label classification problem, which greatly simplifies the learning\nframework. Specifically, multiple binary pseudo-labels are assigned for each\ninput image by comparing its embeddings with those in two dictionaries, and the\nnetwork is optimized using the binary cross entropy loss. The proposed method\nis named Multi-Label Self-supervised learning (MLS). Visualizations\nqualitatively show that clearly the pseudo-labels by MLS can automatically find\nsemantically similar pseudo-positive pairs across different images to\nfacilitate contrastive learning. MLS learns high quality representations on\nMS-COCO and achieves state-of-the-art results on classification, detection and\nsegmentation benchmarks. At the same time, MLS is much simpler than existing\nmethods, making it easier to deploy and for further exploration.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:04:22 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 01:34:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhu","Ke",""],["Fu","Minghao",""],["Wu","Jianxin",""]]}
{"id":"2308.03287","submitter":"Samuel Desmarais","authors":"Samuel Desmarais (1), Gerardo Ramos-Palacios (2), Jonathan Poree (1),\n  Stephen A. Lee (1), Alexis Leconte (1), Abbas F. Sadikot (2), Jean Provost (1\n  and 3) ((1) Polytechnique Montreal, (2) Montreal Neurological Institute and\n  Hospital - McGill University, (3) Institut de Cardiologie de Montreal)","title":"Equivalent-Time-Active-Cavitation-Imaging Enables Vascular-Resolution\n  Blood-Brain-Barrier-Opening-Therapy Planning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linking cavitation and anatomy was found to be important for predictable\noutcomes in Focused-Ultrasound Blood-Brain-Barrier-Opening and requires high\nresolution cavitation mapping. However, cavitation mapping techniques for\nplanning and monitoring of therapeutic procedures either 1) do not leverage the\nfull resolution capabilities of ultrasound imaging or 2) place strong\nconstraints on the length of the therapeutic pulse. This study aimed to develop\na high-resolution technique that could resolve vascular anatomy in the\ncavitation map. Herein, we develop BP-ETACI, derived from bandpass sampling and\ndual-frequency contrast imaging at 12.5 MHz to produce cavitation maps prior\nand during blood-brain barrier opening with long therapeutic bursts using a\n1.5-MHz focused transducer in the brain of C57BL/6 mice. The BP-ETACI\ncavitation maps were found to correlate with the vascular anatomy in ultrasound\nlocalization microscopy vascular maps and in histological sections. Cavitation\nmaps produced from non-blood-brain-barrier disrupting doses showed the same\ncavitation-bearing vasculature as maps produced over entire blood-brain-barrier\nopening procedures, allowing use for 1) monitoring FUS-BBBO, but also for 2)\ntherapy planning and target verification. BP-ETACI is versatile, created high\nresolution cavitation maps in the mouse brain and is easily translatable to\nexisting FUS-BBBO experiments. As such, it provides a means to further study\ncavitation phenomena in FUS-BBBO.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:06:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Desmarais","Samuel","","1\n  and 3"],["Ramos-Palacios","Gerardo","","1\n  and 3"],["Poree","Jonathan","","1\n  and 3"],["Lee","Stephen A.","","1\n  and 3"],["Leconte","Alexis","","1\n  and 3"],["Sadikot","Abbas F.","","1\n  and 3"],["Provost","Jean","","1\n  and 3"]]}
{"id":"2308.03288","submitter":"James Bremer","authors":"Murdock Aubry and James Bremer","title":"The Levin approach to the numerical calculation of phase functions","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 solutions of scalar ordinary differential equations become more complex\nas their coefficients increase in magnitude. As a consequence, when a standard\nsolver is applied to such an equation, its running time grows with the\nmagnitudes of the equation's coefficients. It is well known, however, that\nscalar ordinary differential equations with slowly-varying coefficients admit\nslowly-varying phase functions whose cost to represent via standard techniques\nis largely independent of the magnitude of the equation's coefficients. This\nobservation is the basis of most methods for the asymptotic approximation of\nthe solutions of ordinary differential equations, including the WKB method.\nHere, we introduce two numerical algorithms for constructing phase functions\nfor scalar ordinary differential equations inspired by the classical Levin\nmethod for the calculation of oscillatory integrals. In the case of a large\nclass of scalar ordinary differential equations with slowly-varying\ncoefficients, their running times are independent of the magnitude of the\nequation's coefficients. The results of extensive numerical experiments\ndemonstrating the properties of our algorithms are presented.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:10:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aubry","Murdock",""],["Bremer","James",""]]}
{"id":"2308.03289","submitter":"Cameron Seth","authors":"Eric Blais and Cameron Seth","title":"Testing Graph Properties with the Container Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish nearly optimal sample complexity bounds for testing the\n$\\rho$-clique property in the dense graph model. Specifically, we show that it\nis possible to distinguish graphs on $n$ vertices that have a $\\rho n$-clique\nfrom graphs for which at least $\\epsilon n^2$ edges must be added to form a\n$\\rho n$-clique by sampling and inspecting a random subgraph on only\n$\\tilde{O}(\\rho^3/\\epsilon^2)$ vertices.\n  We also establish new sample complexity bounds for $\\epsilon$-testing\n$k$-colorability. In this case, we show that a sampled subgraph on\n$\\tilde{O}(k/\\epsilon)$ vertices suffices to distinguish $k$-colorable graphs\nfrom those for which any $k$-coloring of the vertices causes at least $\\epsilon\nn^2$ edges to be monochromatic.\n  The new bounds for testing the $\\rho$-clique and $k$-colorability properties\nare both obtained via new extensions of the graph container method. This method\nhas been an effective tool for tackling various problems in graph theory and\ncombinatorics. Our results demonstrate that it is also a powerful tool for the\nanalysis of property testing algorithms.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:15:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Blais","Eric",""],["Seth","Cameron",""]]}
{"id":"2308.03290","submitter":"Jordan Dotzel","authors":"Jordan Dotzel, Gang Wu, Andrew Li, Muhammad Umar, Yun Ni, Mohamed S.\n  Abdelfattah, Zhiru Zhang, Liqun Cheng, Martin G. Dixon, Norman P. Jouppi,\n  Quoc V. Le, Sheng Li","title":"FLIQS: One-Shot Mixed-Precision Floating-Point and Integer Quantization\n  Search","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":"  Quantization has become a mainstream compression technique for reducing model\nsize, computational requirements, and energy consumption for modern deep neural\nnetworks (DNNs). With the improved numerical support in recent hardware,\nincluding multiple variants of integer and floating point, mixed-precision\nquantization has become necessary to achieve high-quality results with low\nmodel cost. Prior mixed-precision quantization methods have performed a\npost-training quantization search, which compromises on accuracy, or a\ndifferentiable quantization search, which leads to high memory usage from\nbranching. Therefore, we propose the first one-shot mixed-precision\nquantization search that eliminates the need for retraining in both integer and\nlow-precision floating point models. We evaluate our floating-point and integer\nquantization search (FLIQS) on multiple convolutional networks and vision\ntransformer models to discover Pareto-optimal models. Our approach discovers\nmodels that improve upon uniform precision, manual mixed-precision, and recent\ninteger quantization search methods. With the proposed integer quantization\nsearch, we increase the accuracy of ResNet-18 on ImageNet by 1.31% points and\nResNet-50 by 0.90% points with equivalent model cost over previous methods.\nAdditionally, for the first time, we explore a novel mixed-precision\nfloating-point search and improve MobileNetV2 by up to 0.98% points compared to\nprior state-of-the-art FP8 models. Finally, we extend FLIQS to simultaneously\nsearch a joint quantization and neural architecture space and improve the\nImageNet accuracy by 2.69% points with similar model cost on a MobileNetV2\nsearch space.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:17:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dotzel","Jordan",""],["Wu","Gang",""],["Li","Andrew",""],["Umar","Muhammad",""],["Ni","Yun",""],["Abdelfattah","Mohamed S.",""],["Zhang","Zhiru",""],["Cheng","Liqun",""],["Dixon","Martin G.",""],["Jouppi","Norman P.",""],["Le","Quoc V.",""],["Li","Sheng",""]]}
{"id":"2308.03291","submitter":"Milo\\v{s} Stanojevi\\'c","authors":"Milo\\v{s} Stanojevi\\'c and Laurent Sartran","title":"SynJax: Structured Probability Distributions for JAX","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The development of deep learning software libraries enabled significant\nprogress in the field by allowing users to focus on modeling, while letting the\nlibrary to take care of the tedious and time-consuming task of optimizing\nexecution for modern hardware accelerators. However, this has benefited only\nparticular types of deep learning models, such as Transformers, whose\nprimitives map easily to the vectorized computation. The models that explicitly\naccount for structured objects, such as trees and segmentations, did not\nbenefit equally because they require custom algorithms that are difficult to\nimplement in a vectorized form.\n  SynJax directly addresses this problem by providing an efficient vectorized\nimplementation of inference algorithms for structured distributions covering\nalignment, tagging, segmentation, constituency trees and spanning trees. With\nSynJax we can build large-scale differentiable models that explicitly model\nstructure in the data. The code is available at\nhttps://github.com/deepmind/synjax.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:20:38 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 08:20:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Stanojevi\u0107","Milo\u0161",""],["Sartran","Laurent",""]]}
{"id":"2308.03292","submitter":"Kasra Hejazi","authors":"Kasra Hejazi, Mario Motta, Garnet Kin-Lic Chan","title":"Adiabatic quantum imaginary time evolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce an adiabatic state preparation protocol which implements quantum\nimaginary time evolution under the Hamiltonian of the system. Unlike the\noriginal quantum imaginary time evolution algorithm, adiabatic quantum\nimaginary time evolution does not require quantum state tomography during its\nruntime, and unlike standard adiabatic state preparation, the final Hamiltonian\nis not the system Hamiltonian. Instead, the algorithm obtains the adiabatic\nHamiltonian by integrating a classical differential equation that ensures that\none follows the imaginary time evolution state trajectory. We introduce some\nheuristics that allow this protocol to be implemented on quantum architectures\nwith limited resources. We explore the performance of this algorithm via\nclassical simulations in a one-dimensional spin model and highlight essential\nfeatures that determine its cost, performance, and implementability for longer\ntimes. We find competitive performance when compared to the original quantum\nimaginary time evolution, and argue that the rapid convergence of this protocol\nand its low resource requirements make it attractive for near-term state\npreparation applications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:27:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hejazi","Kasra",""],["Motta","Mario",""],["Chan","Garnet Kin-Lic",""]]}
{"id":"2308.03293","submitter":"Tomoya Mizumoto Dr.","authors":"Tomoya Mizumoto, Takato Yamazaki, Katsumasa Yoshikawa, Masaya Ohagi,\n  Toshiki Kawamoto and Toshinori Sato","title":"Dialogue Systems Can Generate Appropriate Responses without the Use of\n  Question Marks? -- Investigation of the Effects of Question Marks on Dialogue\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When individuals engage in spoken discourse, various phenomena can be\nobserved that differ from those that are apparent in text-based conversation.\nWhile written communication commonly uses a question mark to denote a query, in\nspoken discourse, queries are frequently indicated by a rising intonation at\nthe end of a sentence. However, numerous speech recognition engines do not\nappend a question mark to recognized queries, presenting a challenge when\ncreating a spoken dialogue system. Specifically, the absence of a question mark\nat the end of a sentence can impede the generation of appropriate responses to\nqueries in spoken dialogue systems. Hence, we investigate the impact of\nquestion marks on dialogue systems, with the results showing that they have a\nsignificant impact. Moreover, we analyze specific examples in an effort to\ndetermine which types of utterances have the impact on dialogue systems.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:42:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mizumoto","Tomoya",""],["Yamazaki","Takato",""],["Yoshikawa","Katsumasa",""],["Ohagi","Masaya",""],["Kawamoto","Toshiki",""],["Sato","Toshinori",""]]}
{"id":"2308.03294","submitter":"David Ruiz-Tijerina","authors":"Isaac Soltero and David A. Ruiz-Tijerina","title":"Dimensionality crossover for moir\\'e excitons in twisted bilayers of\n  anisotropic two-dimensional semiconductors","comments":"7 pages, plus 6 supplementary notes","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the energies and optical spectra of excitons in twisted bilayers of\nanisotropic van der Waals semiconductors exhibiting moir\\'e patterns, taking\nphosphorene as a case study. Following the electronic Hamiltonian introduced by\nus in [Phys. Rev. B 105, 235421 (2022)], and leveraging the scale separation\nbetween the moir\\'e lengthscale and the exciton Bohr radii, we introduce a\ncontinuous model for excitons that incorporates the spatial variation of their\nbinding energies. Our zone-folding calculations reveal a dimensionality\ncrossover for the exciton states, driven by the combined dispersion- and\nmoir\\'e potential anisotropies, from quantum-dot-like (0D) lattices at twist\nangles $\\theta<\\theta_*$, to quantum-wire-like (1D) arrays at\n$\\theta>\\theta_*$, with crossover angle $\\theta_*=4^\\circ$. We identify clear\nsignatures of this dimensionality crossover in the twist angle dependence of\nthe excitonic absorption spectra, which allows experimental verification of our\ntheoretical results through standard optical measurements. Our results\nestablish two-dimensional anisotropic moir\\'e semiconductors as versatile\nsolid-state platforms for exploring bosonic correlations across different\ndimensionalities.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:42:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Soltero","Isaac",""],["Ruiz-Tijerina","David A.",""]]}
{"id":"2308.03295","submitter":"Junyao Wang","authors":"Junyao Wang, Luke Chen, Mohammad Abdullah Al Faruque","title":"DOMINO: Domain-invariant Hyperdimensional Classification for\n  Multi-Sensor Time Series 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":"  With the rapid evolution of the Internet of Things, many real-world\napplications utilize heterogeneously connected sensors to capture time-series\ninformation. Edge-based machine learning (ML) methodologies are often employed\nto analyze locally collected data. However, a fundamental issue across\ndata-driven ML approaches is distribution shift. It occurs when a model is\ndeployed on a data distribution different from what it was trained on, and can\nsubstantially degrade model performance. Additionally, increasingly\nsophisticated deep neural networks (DNNs) have been proposed to capture spatial\nand temporal dependencies in multi-sensor time series data, requiring intensive\ncomputational resources beyond the capacity of today's edge devices. While\nbrain-inspired hyperdimensional computing (HDC) has been introduced as a\nlightweight solution for edge-based learning, existing HDCs are also vulnerable\nto the distribution shift challenge. In this paper, we propose DOMINO, a novel\nHDC learning framework addressing the distribution shift problem in noisy\nmulti-sensor time-series data. DOMINO leverages efficient and parallel matrix\noperations on high-dimensional space to dynamically identify and filter out\ndomain-variant dimensions. Our evaluation on a wide range of multi-sensor time\nseries classification tasks shows that DOMINO achieves on average 2.04% higher\naccuracy than state-of-the-art (SOTA) DNN-based domain generalization\ntechniques, and delivers 16.34x faster training and 2.89x faster inference.\nMore importantly, DOMINO performs notably better when learning from partially\nlabeled and highly imbalanced data, providing 10.93x higher robustness against\nhardware noises than SOTA DNNs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:44:12 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 14:40:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Junyao",""],["Chen","Luke",""],["Faruque","Mohammad Abdullah Al",""]]}
{"id":"2308.03296","submitter":"Juhan Bae","authors":"Roger Grosse, Juhan Bae, Cem Anil, Nelson Elhage, Alex Tamkin,\n  Amirhossein Tajdini, Benoit Steiner, Dustin Li, Esin Durmus, Ethan Perez,\n  Evan Hubinger, Kamil\\.e Luko\\v{s}i\\=ut\\.e, Karina Nguyen, Nicholas Joseph,\n  Sam McCandlish, Jared Kaplan, Samuel R. Bowman","title":"Studying Large Language Model Generalization with Influence Functions","comments":"119 pages, 47 figures, 22 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When trying to gain better visibility into a machine learning model in order\nto understand and mitigate the associated risks, a potentially valuable source\nof evidence is: which training examples most contribute to a given behavior?\nInfluence functions aim to answer a counterfactual: how would the model's\nparameters (and hence its outputs) change if a given sequence were added to the\ntraining set? While influence functions have produced insights for small\nmodels, they are difficult to scale to large language models (LLMs) due to the\ndifficulty of computing an inverse-Hessian-vector product (IHVP). We use the\nEigenvalue-corrected Kronecker-Factored Approximate Curvature (EK-FAC)\napproximation to scale influence functions up to LLMs with up to 52 billion\nparameters. In our experiments, EK-FAC achieves similar accuracy to traditional\ninfluence function estimators despite the IHVP computation being orders of\nmagnitude faster. We investigate two algorithmic techniques to reduce the cost\nof computing gradients of candidate training sequences: TF-IDF filtering and\nquery batching. We use influence functions to investigate the generalization\npatterns of LLMs, including the sparsity of the influence patterns, increasing\nabstraction with scale, math and programming abilities, cross-lingual\ngeneralization, and role-playing behavior. Despite many apparently\nsophisticated forms of generalization, we identify a surprising limitation:\ninfluences decay to near-zero when the order of key phrases is flipped.\nOverall, influence functions give us a powerful new tool for studying the\ngeneralization properties of LLMs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:47:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Grosse","Roger",""],["Bae","Juhan",""],["Anil","Cem",""],["Elhage","Nelson",""],["Tamkin","Alex",""],["Tajdini","Amirhossein",""],["Steiner","Benoit",""],["Li","Dustin",""],["Durmus","Esin",""],["Perez","Ethan",""],["Hubinger","Evan",""],["Luko\u0161i\u016bt\u0117","Kamil\u0117",""],["Nguyen","Karina",""],["Joseph","Nicholas",""],["McCandlish","Sam",""],["Kaplan","Jared",""],["Bowman","Samuel R.",""]]}
{"id":"2308.03297","submitter":"Hyeong Soo Chang","authors":"Hyeong Soo Chang","title":"Approximate Constrained Discounted Dynamic Programming with Uniform\n  Feasibility and Optimality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a dynamic programming (DP) approach to approximately solving an\ninfinite-horizon constrained Markov decision process (CMDP) problem with a\nfixed initial-state for the expected total discounted-reward criterion with a\nuniform-feasibility constraint of the expected total discounted-cost in a\ndeterministic, history-independent, and stationary policy set. We derive a\nDP-equation that recursively holds for a CMDP problem and its sub-CMDP\nproblems, where each problem, induced from the parameters of the original CMDP\nproblem, admits a uniformly-optimal feasible policy in its policy set\nassociated with the inputs to the problem. A policy constructed from the\nDP-equation is shown to achieve the optimal values, defined for the CMDP\nproblem the policy is a solution to, at all states. Based on the result, we\ndiscuss off-line and on-line computational algorithms, motivated from policy\niteration for MDPs, whose output sequences have local convergences for the\noriginal CMDP problem.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:47:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chang","Hyeong Soo",""]]}
{"id":"2308.03298","submitter":"Fei Qin","authors":"Fei Qin, David Parkinson, Adam R. H. Stevens, Cullan Howlett","title":"A New Halo Density Profile for Galaxies","comments":"13 pages. 9 figures. ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  More precise measurements of galaxy clustering will be provided by the next\ngeneration of galaxy surveys such as DESI, WALLABY and SKA. To utilize this\ninformation to improve our understanding of the Universe, we need to accurately\nmodel the distribution of galaxies in their host dark matter halos. In this\nwork we present a new halo density profile model for galaxies, which makes\npredictions for the positions of galaxies in the host halo, different to the\nwidely adopted Navarro-Frenk-White (NFW) profile, since galaxies tend to be\nfound more in the outskirts of halos (nearer the virial radius) than an NFW\nprofile. The parameterised density profile model is fit and tested using the\nDarkSage semi-analytic model of galaxy formation. We find that our density\nprofile model can accurately reproduce the halo occupation distribution and\ngalaxy two-point correlation function of the DarkSage simulation. We also\nderive the analytic expressions for the circular velocity and gravitational\npotential energy for this density profile. We use the SDSS DR10 galaxy group\ncatalogue to validate this halo density profile model. Compared to the NFW\nprofile, we find that our model more accurately predicts the positions of\ngalaxies in their host halo and the galaxy two-point correlation function.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 04:57:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Qin","Fei",""],["Parkinson","David",""],["Stevens","Adam R. H.",""],["Howlett","Cullan",""]]}
{"id":"2308.03299","submitter":"Aimen Gaba","authors":"Aimen Gaba, Zhanna Kaufman, Jason Chueng, Marie Shvakel, Kyle Wm.\n  Hall, Yuriy Brun, and Cindy Xiong Bearfield","title":"My Model is Unfair, Do People Even Care? Visual Design Affects Trust and\n  Perceived Bias in Machine Learning","comments":"11 pages, 6 figures, to appear in IEEE Transactions of Visualization\n  and Computer Graphics (Also in proceedings of IEEE VIS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning technology has become ubiquitous, but, unfortunately, often\nexhibits bias. As a consequence, disparate stakeholders need to interact with\nand make informed decisions about using machine learning models in everyday\nsystems. Visualization technology can support stakeholders in understanding and\nevaluating trade-offs between, for example, accuracy and fairness of models.\nThis paper aims to empirically answer \"Can visualization design choices affect\na stakeholder's perception of model bias, trust in a model, and willingness to\nadopt a model?\" Through a series of controlled, crowd-sourced experiments with\nmore than 1,500 participants, we identify a set of strategies people follow in\ndeciding which models to trust. Our results show that men and women prioritize\nfairness and performance differently and that visual design choices\nsignificantly affect that prioritization. For example, women trust fairer\nmodels more often than men do, participants value fairness more when it is\nexplained using text than as a bar chart, and being explicitly told a model is\nbiased has a bigger impact than showing past biased performance. We test the\ngeneralizability of our results by comparing the effect of multiple textual and\nvisual design choices and offer potential explanations of the cognitive\nmechanisms behind the difference in fairness perception and trust. Our research\nguides design considerations to support future work developing visualization\nsystems for machine learning.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:01:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gaba","Aimen",""],["Kaufman","Zhanna",""],["Chueng","Jason",""],["Shvakel","Marie",""],["Hall","Kyle Wm.",""],["Brun","Yuriy",""],["Bearfield","Cindy Xiong",""]]}
{"id":"2308.03300","submitter":"XiaoHui Zhang","authors":"Xiaohui Zhang, Jiangyan Yi, Jianhua Tao, Chenglong Wang, Chuyuan Zhang","title":"Do You Remember? Overcoming Catastrophic Forgetting for Fake Audio\n  Detection","comments":"40th Internation Conference on Machine Learning (ICML 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":"  Current fake audio detection algorithms have achieved promising performances\non most datasets. However, their performance may be significantly degraded when\ndealing with audio of a different dataset. The orthogonal weight modification\nto overcome catastrophic forgetting does not consider the similarity of genuine\naudio across different datasets. To overcome this limitation, we propose a\ncontinual learning algorithm for fake audio detection to overcome catastrophic\nforgetting, called Regularized Adaptive Weight Modification (RAWM). When\nfine-tuning a detection network, our approach adaptively computes the direction\nof weight modification according to the ratio of genuine utterances and fake\nutterances. The adaptive modification direction ensures the network can\neffectively detect fake audio on the new dataset while preserving its knowledge\nof old model, thus mitigating catastrophic forgetting. In addition, genuine\naudio collected from quite different acoustic conditions may skew their feature\ndistribution, so we introduce a regularization constraint to force the network\nto remember the old distribution in this regard. Our method can easily be\ngeneralized to related fields, like speech emotion recognition. We also\nevaluate our approach across multiple datasets and obtain a significant\nperformance improvement on cross-dataset experiments.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:05:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Xiaohui",""],["Yi","Jiangyan",""],["Tao","Jianhua",""],["Wang","Chenglong",""],["Zhang","Chuyuan",""]]}
{"id":"2308.03301","submitter":"Dirk Spennemann","authors":"Dirk HR Spennemann","title":"What has ChatGPT read? The origins of archaeological citations used by a\n  generative artificial intelligence application","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":"  The public release of ChatGPT has resulted in considerable publicity and has\nled to wide-spread discussion of the usefulness and capabilities of generative\nAI language models. Its ability to extract and summarise data from textual\nsources and present them as human-like contextual responses makes it an\neminently suitable tool to answer questions users might ask. This paper tested\nwhat archaeological literature appears to have been included in ChatGPT's\ntraining phase. While ChatGPT offered seemingly pertinent references, a large\npercentage proved to be fictitious. Using cloze analysis to make inferences on\nthe sources 'memorised' by a generative AI model, this paper was unable to\nprove that ChatGPT had access to the full texts of the genuine references. It\ncan be shown that all references provided by ChatGPT that were found to be\ngenuine have also been cited on Wikipedia pages. This strongly indicates that\nthe source base for at least some of the data is found in those pages. The\nimplications of this in relation to data quality are discussed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:06:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Spennemann","Dirk HR",""]]}
{"id":"2308.03302","submitter":"Casey Lam","authors":"Casey Y. Lam, Jessica R. Lu","title":"A re-analysis of the isolated black hole candidate\n  OGLE-2011-BLG-0462/MOA-2011-BLG-191","comments":"23 pages, 18 figures, 8 tables. Accepted for publication in ApJ on 2\n  Aug 2023 [Same as v1, just fixed typo in email address]","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There are expected to be $\\sim 10^8$ isolated black holes (BHs) in the Milky\nWay. OGLE-2011-BLG-0462/MOA-2011-BLG-191 (OB110462) is the only such BH with a\nmass measurement to date. However, its mass is disputed: Lam et al. (2022a,b)\nmeasured a lower mass of $1.6 - 4.4 M_\\odot$, while Sahu et al. (2022);\nMr\\'{o}z et al. (2022) measured a higher mass of $5.8 - 8.7 M_\\odot$. We\nre-analyze OB110462, including new data from the Hubble Space Telescope (HST)\nand re-reduced Optical Gravitational Lensing Experiment (OGLE) photometry. We\nalso re-reduce and re-analyze the HST dataset with newly available software. We\nfind significantly different ($\\sim 1$ mas) HST astrometry than Lam et al.\n(2022a,b) in the de-magnified epochs due to the amount of positional bias\ninduced by a bright star $\\sim$0.4 arcsec from OB110462. After modeling the\nupdated photometric and astrometric datasets, we find the lens of OB110462 is a\n$6.0^{+1.2}_{-1.0} M_\\odot$ BH. Future observations with the Nancy Grace Roman\nSpace Telescope, which will have an astrometric precision comparable or better\nto HST but a field of view $100\\times$ larger, will be able to measure hundreds\nof isolated BH masses via microlensing. This will enable the measurement of the\nBH mass distribution and improve understanding of massive stellar evolution and\nBH formation channels.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:11:36 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 17:55:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lam","Casey Y.",""],["Lu","Jessica R.",""]]}
{"id":"2308.03303","submitter":"Lin Zhang","authors":"Longteng Zhang, Lin Zhang, Shaohuai Shi, Xiaowen Chu, Bo Li","title":"LoRA-FA: Memory-efficient Low-rank Adaptation for Large Language Models\n  Fine-tuning","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":"  The low-rank adaptation (LoRA) method can largely reduce the amount of\ntrainable parameters for fine-tuning large language models (LLMs), however, it\nstill requires expensive activation memory to update low-rank weights. Reducing\nthe number of LoRA layers or using activation recomputation could harm the\nfine-tuning performance or increase the computational overhead. In this work,\nwe present LoRA-FA, a memory-efficient fine-tuning method that reduces the\nactivation memory without performance degradation and expensive recomputation.\nLoRA-FA chooses to freeze the projection-down weight of $A$ and update the\nprojection-up weight of $B$ in each LoRA layer. It ensures the change of model\nweight reside in a low-rank space during LLMs fine-tuning, while eliminating\nthe requirement to store full-rank input activations. We conduct extensive\nexperiments across multiple model types (RoBERTa, T5, LLaMA) and model scales.\nOur results show that LoRA-FA can always achieve close fine-tuning accuracy\nacross different tasks compared to full parameter fine-tuning and LoRA.\nFurthermore, LoRA-FA can reduce the overall memory cost by up to 1.4$\\times$\ncompared to LoRA.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:12:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Longteng",""],["Zhang","Lin",""],["Shi","Shaohuai",""],["Chu","Xiaowen",""],["Li","Bo",""]]}
{"id":"2308.03304","submitter":"Chandra Prakash","authors":"Naokant Deo, Chandra Prakash and D. K. Verma","title":"Some Approximation Properties by Sz\\'asz-P{\\u{a}}lt{\\u{a}}nea type\n  Operators involving the Appell Polynomials of class $A^2$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.FA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This article contributes to the new summation of Sz\\'asz operators with the\nhelp of Appell polynomials of class $A^{2}$. We verified Bohman-Korovkin's\ntheorem and prove the convergence results like Lipschitz-type space,\nVoronvaskaja-type asymptotic formula, and modulus of continuity using the given\noperators. Furthermore, we have shown the weighted modulus of continuity and\nthe derivative of bounded variation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:17:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Deo","Naokant",""],["Prakash","Chandra",""],["Verma","D. K.",""]]}
{"id":"2308.03305","submitter":"Azumi Sakai","authors":"Azumi Sakai, Masayasu Harada, Chiho Nonaka, Chihiro Sasaki, Kenta\n  Shigaki, Satoshi Yano","title":"Probing the QCD phase transition with chiral mixing in dilepton\n  production","comments":"6 pages, 4 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":"  We perform a systematic study of dilepton emission in a hot QCD medium based\non three different scenarios of chiral mixing, each of which yields a\ncharacteristic structure in the vector spectral function. The in-medium\nspectral functions are accommodated into the state-of-the-art hydrodynamic\nsimulations for a relativistic viscous fluid to calculate the dilepton\nproduction rate, fully accounting for the space-time evolution of a created\nfireball in relativistic heavy-ion collisions. We demonstrate that the\nlow-temperature theorem of chiral mixing extrapolated toward a chiral\ncrossover, often used in the literature, leads to critical shortcomings: the\ninadequacy of width broadening, and a substantial overestimate of the dilepton\nyield maximized around the invariant mass of $M = 1.2$ GeV. The proper\nprescription offers a milder yet sizable increase in the window of $1.1 < M <\n1.4$ GeV as the direct signature of chiral symmetry restoration.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:18:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sakai","Azumi",""],["Harada","Masayasu",""],["Nonaka","Chiho",""],["Sasaki","Chihiro",""],["Shigaki","Kenta",""],["Yano","Satoshi",""]]}
{"id":"2308.03306","submitter":"Guoji Fu","authors":"Guoji Fu, Mohammed Haroon Dupty, Yanfei Dong, Lee Wee Sun","title":"Implicit Graph Neural Diffusion Based on Constrained Dirichlet Energy\n  Minimization","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Implicit graph neural networks (GNNs) have emerged as a potential approach to\nenable GNNs to capture long-range dependencies effectively. However, poorly\ndesigned implicit GNN layers can experience over-smoothing or may have limited\nadaptability to learn data geometry, potentially hindering their performance in\ngraph learning problems. To address these issues, we introduce a geometric\nframework to design implicit graph diffusion layers based on a parameterized\ngraph Laplacian operator. Our framework allows learning the geometry of vertex\nand edge spaces, as well as the graph gradient operator from data. We further\nshow how implicit GNN layers can be viewed as the fixed-point solution of a\nDirichlet energy minimization problem and give conditions under which it may\nsuffer from over-smoothing. To overcome the over-smoothing problem, we design\nour implicit graph diffusion layer as the solution of a Dirichlet energy\nminimization problem with constraints on vertex features, enabling it to trade\noff smoothing with the preservation of node feature information. With an\nappropriate hyperparameter set to be larger than the largest eigenvalue of the\nparameterized graph Laplacian, our framework guarantees a unique equilibrium\nand quick convergence. Our models demonstrate better performance than leading\nimplicit and explicit GNNs on benchmark datasets for node and graph\nclassification tasks, with substantial accuracy improvements observed for some\ndatasets.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:22:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fu","Guoji",""],["Dupty","Mohammed Haroon",""],["Dong","Yanfei",""],["Sun","Lee Wee",""]]}
{"id":"2308.03307","submitter":"Howard Nuer","authors":"Howard Nuer and Alan Sorani","title":"The Bogomolov-Gieseker-Koseki inequality on surfaces with canonical\n  singularities in arbitrary characteristic","comments":"13 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This note generalizes the celebrated Bogomolov-Gieseker inequality for smooth\nprojective surfaces over an algebraically closed field of characteristic zero\nto projective surfaces in arbitrary characteristic with canonical\nsingularities. We also generalize to this context some classical applications\nof the Bogomolov-Gieseker inequality.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:27:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nuer","Howard",""],["Sorani","Alan",""]]}
{"id":"2308.03308","submitter":"Udi Boker","authors":"Shaull Almagor, Daniel Assa, Udi Boker","title":"Synchronized CTL over One-Counter Automata","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the model-checking problem of Synchronized Computation-Tree Logic\n(CTL+Sync) over One-Counter Automata (OCAs). CTL+Sync augments CTL with\ntemporal operators that require several paths to satisfy properties in a\nsynchronous manner, e.g., the property ``all paths should eventually see $p$ at\nthe same time''. The model-checking problem for CTL+Sync over finite-state\nKripke structures was shown to be in $\\mathsf{P}^{\\mathsf{NP}^{\\mathsf{NP}}}$.\nOCAs are labelled transition systems equipped with a non-negative counter that\ncan be zero-tested. Thus, they induce infinite-state systems whose computation\ntrees are not regular. The model-checking problem for CTL over OCAs was shown\nto be $\\mathsf{PSPACE}$-complete.\n  We show that the model-checking problem for CTL+Sync over OCAs is decidable.\nHowever, the upper bound we give is non-elementary. We therefore proceed to\nstudy the problem for a central fragment of CTL+Sync, extending CTL with\noperators that require all paths to satisfy properties in a synchronous manner,\nand show that it is in $\\mathsf{EXP}^\\mathsf{NEXP}$ (and in particular in\n$\\mathsf{EXPSPACE}$), by exhibiting a certain \"segmented periodicity\" in the\ncomputation trees of OCAs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:27:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Almagor","Shaull",""],["Assa","Daniel",""],["Boker","Udi",""]]}
{"id":"2308.03309","submitter":"Tatsuya Kaneko","authors":"Tatsuya Kaneko, Yuta Murakami, Denis Gole\\v{z}, Zhiyuan Sun, Andrew J.\n  Millis","title":"Exciton-spin interactions in antiferromagnetic charge-transfer\n  insulators","comments":"13 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 derive exciton-spin interactions from a microscopic correlated model that\ncaptures important aspects of the physics of charge-transfer (CT) insulators to\naddress magnetism associated with exciton creation. We present a minimal model\nconsisting of coupled clusters of transition metal d and ligand p orbitals that\ncaptures the essential features of the local atomic and electronic structure.\nFirst, we identify the lowest-energy state and optically allowed excited states\nwithin a cluster by applying the molecular orbital picture to the ligand p\norbitals. Then, we derive the effective interactions between two clusters\nmediated by intercluster hoppings, which include exciton-spin couplings. The\ninterplay of the correlations and the spatial structure of the CT exciton leads\nto strong magnetic exchange couplings with spatial anisotropy. Finally, we\ncalculate an optical excitation spectrum in our effective model to obtain\ninsights into magnetic sidebands optically observed in magnetic materials. We\ndemonstrate that the spin-flip excitation due to the strongly enhanced local\nspin interactions around the exciton gives rise to the magnetic sidebands.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:33:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kaneko","Tatsuya",""],["Murakami","Yuta",""],["Gole\u017e","Denis",""],["Sun","Zhiyuan",""],["Millis","Andrew J.",""]]}
{"id":"2308.03310","submitter":"Yuta Hasegawa","authors":"Yuta Hasegawa, Toshiyuki Imamura, Takuya Ina, Naoyuki Onodera, Yuuichi\n  Asahi, Yasuhiro Idomura","title":"GPU Optimization of Lattice Boltzmann Method with Local Ensemble\n  Transform Kalman Filter","comments":null,"journal-ref":"2022 IEEE/ACM Workshop on Latest Advances in Scalable Algorithms\n  for Large-Scale Heterogeneous Systems (ScalAH), pp. 10-17 (2022)","doi":"10.1109/ScalAH56622.2022.00007","report-no":null,"categories":"physics.flu-dyn cs.DC physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ensemble data assimilation of computational fluid dynamics simulations\nbased on the lattice Boltzmann method (LBM) and the local ensemble transform\nKalman filter (LETKF) is implemented and optimized on a GPU supercomputer based\non NVIDIA A100 GPUs. To connect the LBM and LETKF parts, data transpose\ncommunication is optimized by overlapping computation, file I/O, and\ncommunication based on data dependency in each LETKF kernel. In two dimensional\nforced isotropic turbulence simulations with the ensemble size of $M=64$ and\nthe number of grid points of $N_x=128^2$, the optimized implementation achieved\n$\\times3.80$ speedup from the naive implementation, in which the LETKF part is\nnot parallelized. The main computing kernel of the local problem is the\neigenvalue decomposition (EVD) of $M\\times M$ real symmetric dense matrices,\nwhich is computed by a newly developed batched EVD in $\\verb|EigenG|$. The\nbatched EVD in $\\verb|EigenG|$ outperforms that in $\\verb|cuSOLVER|$, and\n$\\times65.3$ speedup was achieved.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:37:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hasegawa","Yuta",""],["Imamura","Toshiyuki",""],["Ina","Takuya",""],["Onodera","Naoyuki",""],["Asahi","Yuuichi",""],["Idomura","Yasuhiro",""]]}
{"id":"2308.03311","submitter":"Peiling Jiang","authors":"Haijun Xia, Tony Wang, Aditya Gunturu, Peiling Jiang, William Duan,\n  Xiaoshuo Yao","title":"CrossTalk: Intelligent Substrates for Language-Oriented Interaction in\n  Video-Based Communication and Collaboration","comments":null,"journal-ref":null,"doi":"10.1145/3586183.3606773","report-no":null,"categories":"cs.HC cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the advances and ubiquity of digital communication media such as\nvideoconferencing and virtual reality, they remain oblivious to the rich\nintentions expressed by users. Beyond transmitting audio, videos, and messages,\nwe envision digital communication media as proactive facilitators that can\nprovide unobtrusive assistance to enhance communication and collaboration.\nInformed by the results of a formative study, we propose three key design\nconcepts to explore the systematic integration of intelligence into\ncommunication and collaboration, including the panel substrate, language-based\nintent recognition, and lightweight interaction techniques. We developed\nCrossTalk, a videoconferencing system that instantiates these concepts, which\nwas found to enable a more fluid and flexible communication and collaboration\nexperience.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:40:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xia","Haijun",""],["Wang","Tony",""],["Gunturu","Aditya",""],["Jiang","Peiling",""],["Duan","William",""],["Yao","Xiaoshuo",""]]}
{"id":"2308.03312","submitter":"Kexin Pei","authors":"Kexin Pei, Weichen Li, Qirui Jin, Shuyang Liu, Scott Geng, Lorenzo\n  Cavallaro, Junfeng Yang, Suman Jana","title":"Symmetry-Preserving Program Representations for Learning Code Semantics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have shown promise in automated program\nreasoning, a crucial aspect of many security tasks. However, existing LLM\narchitectures for code are often borrowed from other domains like natural\nlanguage processing, raising concerns about their generalization and robustness\nto unseen code. A key generalization challenge is to incorporate the knowledge\nof code semantics, including control and data flow, into the LLM architectures.\n  Drawing inspiration from examples of convolution layers exploiting\ntranslation symmetry, we explore how code symmetries can enhance LLM\narchitectures for program analysis and modeling. We present a rigorous\ngroup-theoretic framework that formally defines code symmetries as\nsemantics-preserving transformations and provides techniques for precisely\nreasoning about symmetry preservation within LLM architectures. Using this\nframework, we introduce a novel variant of self-attention that preserves\nprogram symmetries, demonstrating its effectiveness in generalization and\nrobustness through detailed experimental evaluations across different binary\nand source code analysis tasks. Overall, our code symmetry framework offers\nrigorous and powerful reasoning techniques that can guide the future\ndevelopment of specialized LLMs for code and advance LLM-guided program\nreasoning tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:40:58 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 16:08:51 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 04:53:52 GMT"},{"version":"v4","created":"Tue, 29 Aug 2023 01:44:39 GMT"},{"version":"v5","created":"Thu, 31 Aug 2023 02:29:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pei","Kexin",""],["Li","Weichen",""],["Jin","Qirui",""],["Liu","Shuyang",""],["Geng","Scott",""],["Cavallaro","Lorenzo",""],["Yang","Junfeng",""],["Jana","Suman",""]]}
{"id":"2308.03313","submitter":"Chao Li","authors":"Chao Li, Xing Su, Haoying Han, Cong Xue, Chunmo Zheng, Chao Fan","title":"Quantifying the Impact of Large Language Models on Collective Opinion\n  Dynamics","comments":"21 pages, 4figures,2tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The process of opinion expression and exchange is a critical component of\ndemocratic societies. As people interact with large language models (LLMs) in\nthe opinion shaping process different from traditional media, the impacts of\nLLMs are increasingly recognized and being concerned. However, the knowledge\nabout how LLMs affect the process of opinion expression and exchange of social\nopinion networks is very limited. Here, we create an opinion network dynamics\nmodel to encode the opinions of LLMs, cognitive acceptability and usage\nstrategies of individuals, and simulate the impact of LLMs on opinion dynamics\nin a variety of scenarios. The outcomes of the simulations inform about\neffective demand-oriented opinion network interventions. The results from this\nstudy suggested that the output opinion of LLMs has a unique and positive\neffect on the collective opinion difference. The marginal effect of cognitive\nacceptability on collective opinion formation is nonlinear and shows a\ndecreasing trend. When people partially rely on LLMs, the exchange process of\nopinion becomes more intense and the diversity of opinion becomes more\nfavorable. In fact, there is 38.6% more opinion diversity when people all\npartially rely on LLMs, compared to prohibiting the use of LLMs entirely. The\noptimal diversity of opinion was found when the fractions of people who do not\nuse, partially rely on, and fully rely on LLMs reached roughly 4:12:1. Our\nexperiments also find that introducing extra agents with\nopposite/neutral/random opinions, we can effectively mitigate the impact of\nbiased/toxic output from LLMs. Our findings provide valuable insights into\nopinion dynamics in the age of LLMs, highlighting the need for customized\ninterventions tailored to specific scenarios to address the drawbacks of\nimproper output and use of LLMs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:45:17 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 01:53:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Chao",""],["Su","Xing",""],["Han","Haoying",""],["Xue","Cong",""],["Zheng","Chunmo",""],["Fan","Chao",""]]}
{"id":"2308.03314","submitter":"Yuqiang Sun","authors":"Yuqiang Sun, Daoyuan Wu, Yue Xue, Han Liu, Haijun Wang, Zhengzi Xu,\n  Xiaofei Xie, Yang Liu","title":"When GPT Meets Program Analysis: Towards Intelligent Detection of Smart\n  Contract Logic Vulnerabilities in GPTScan","comments":"This is a technical report from Nanyang Technological University","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Smart contracts are prone to various vulnerabilities, leading to substantial\nfinancial losses over time. Current analysis tools mainly target\nvulnerabilities with fixed control or dataflow patterns, such as re-entrancy\nand integer overflow. However, a recent study on Web3 security bugs revealed\nthat about 80% of these bugs cannot be audited by existing tools due to the\nlack of domain-specific property description and checking. Given recent\nadvances in Generative Pretraining Transformer (GPT), it is worth exploring how\nGPT could aid in detecting logic vulnerabilities in smart contracts. In this\npaper, we propose GPTScan, the first tool combining GPT with static analysis\nfor smart contract logic vulnerability detection. Instead of relying solely on\nGPT to identify vulnerabilities, which can lead to high false positives and is\nlimited by GPT's pre-trained knowledge, we utilize GPT as a versatile code\nunderstanding tool. By breaking down each logic vulnerability type into\nscenarios and properties, GPTScan matches candidate vulnerabilities with GPT.\nTo enhance accuracy, GPTScan further instructs GPT to intelligently recognize\nkey variables and statements, which are then validated by static confirmation.\nEvaluation on diverse datasets with around 400 contract projects and 3K\nSolidity files shows that GPTScan achieves high precision (over 90%) for token\ncontracts and acceptable precision (57.14%) for large projects like Web3Bugs.\nIt effectively detects groundtruth logic vulnerabilities with a recall of over\n80%, including 9 new vulnerabilities missed by human auditors. GPTScan is fast\nand cost-effective, taking an average of 14.39 seconds and 0.01 USD to scan per\nthousand lines of Solidity code. Moreover, static confirmation helps GPTScan\nreduce two-thirds of false positives.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:48:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sun","Yuqiang",""],["Wu","Daoyuan",""],["Xue","Yue",""],["Liu","Han",""],["Wang","Haijun",""],["Xu","Zhengzi",""],["Xie","Xiaofei",""],["Liu","Yang",""]]}
{"id":"2308.03315","submitter":"Arturo C. Mart\\'i","authors":"Ives Torriente-Garc\\'ia, Arturo C. Mart\\'i, Mart\\'in Monteiro, Cecilia\n  Stari, Juan C. Castro-Palacio, Juan A. Monsoriu","title":"RLC series circuit made simple and portable with smartphones","comments":"7 pages, 1 table, 3 figs","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article presents a novel method for studying RLC series circuits using\ntwo smartphones, one used as a signal generator and the other as an\noscilloscope. We measure the voltage at the external resistor as a function of\nfrequency when subjected to a sinusoidal electromotive force. The experimental\nresults demonstrate a remarkable agreement with the theoretical curve for the\nvoltage at the resistor and the resonance frequency, validating the accuracy of\nthe smartphone-based setup. The experiment fills the gap in educational\nmaterials related to electrical circuits and provides a portable alternative to\ntraditional, expensive laboratory equipment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:58:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Torriente-Garc\u00eda","Ives",""],["Mart\u00ed","Arturo C.",""],["Monteiro","Mart\u00edn",""],["Stari","Cecilia",""],["Castro-Palacio","Juan C.",""],["Monsoriu","Juan A.",""]]}
{"id":"2308.03316","submitter":"Kuangheng He","authors":"Kuangheng He","title":"Deep Q-Network for Stochastic Process Environments","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Reinforcement learning is a powerful approach for training an optimal policy\nto solve complex problems in a given system. This project aims to demonstrate\nthe application of reinforcement learning in stochastic process environments\nwith missing information, using Flappy Bird and a newly developed stock trading\nenvironment as case studies. We evaluate various structures of Deep Q-learning\nnetworks and identify the most suitable variant for the stochastic process\nenvironment. Additionally, we discuss the current challenges and propose\npotential improvements for further work in environment-building and\nreinforcement learning techniques.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 05:58:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["He","Kuangheng",""]]}
{"id":"2308.03317","submitter":"Sophia Abraham","authors":"Sophia J. Abraham, Kehelwala D. G. Maduranga, Jeffery Kinnison,\n  Zachariah Carmichael, Jonathan D. Hauenstein, Walter J. Scheirer","title":"HomOpt: A Homotopy-Based Hyperparameter Optimization Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning has achieved remarkable success over the past couple of\ndecades, often attributed to a combination of algorithmic innovations and the\navailability of high-quality data available at scale. However, a third critical\ncomponent is the fine-tuning of hyperparameters, which plays a pivotal role in\nachieving optimal model performance. Despite its significance, hyperparameter\noptimization (HPO) remains a challenging task for several reasons. Many HPO\ntechniques rely on naive search methods or assume that the loss function is\nsmooth and continuous, which may not always be the case. Traditional methods,\nlike grid search and Bayesian optimization, often struggle to quickly adapt and\nefficiently search the loss landscape. Grid search is computationally\nexpensive, while Bayesian optimization can be slow to prime. Since the search\nspace for HPO is frequently high-dimensional and non-convex, it is often\nchallenging to efficiently find a global minimum. Moreover, optimal\nhyperparameters can be sensitive to the specific dataset or task, further\ncomplicating the search process. To address these issues, we propose a new\nhyperparameter optimization method, HomOpt, using a data-driven approach based\non a generalized additive model (GAM) surrogate combined with homotopy\noptimization. This strategy augments established optimization methodologies to\nboost the performance and effectiveness of any given method with faster\nconvergence to the optimum on continuous, discrete, and categorical domain\nspaces. We compare the effectiveness of HomOpt applied to multiple optimization\ntechniques (e.g., Random Search, TPE, Bayes, and SMAC) showing improved\nobjective performance on many standardized machine learning benchmarks and\nchallenging open-set recognition tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:01:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Abraham","Sophia J.",""],["Maduranga","Kehelwala D. G.",""],["Kinnison","Jeffery",""],["Carmichael","Zachariah",""],["Hauenstein","Jonathan D.",""],["Scheirer","Walter J.",""]]}
{"id":"2308.03318","submitter":"Wenxiong Zhao","authors":"Wenxiong Zhao and Yufeng Zhang","title":"The effect of substrate temperature on cadmium telluride films in high\n  temperature vapor deposition process","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":"  Physical vapor high-temperature deposition of CdTe thin films is one of the\nmain methods for preparing high-efficiency CdTe solar cells, but\nhigh-temperature deposition also has an impact on the internal structure of the\nfilm. The difference in thermal expansion coefficients between the substrate\nand CdTe leads to the generation of internal stress in the CdTe thin film\nduring the cooling process. In this work, we prepared thin films with different\nsubstrate temperatures using a homemade GVD device, and observed by SEM that\nthe crystallization quality of the film gradually improved with the increase of\nsubstrate temperature, but accompanied by the shift of XRD peak position. We\ncalculated the internal stress situation of the film by the shift amount, and\nthe possible causes of stress generation were speculated by the results of TEM\nand SAED to be the combined effects of the different thermal expansion\ncoefficients between the substrate and the film and the stacking fault defects\ninside the film.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:03:33 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 11:29:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhao","Wenxiong",""],["Zhang","Yufeng",""]]}
{"id":"2308.03319","submitter":"John Kozlowski","authors":"John Kozlowski, Dennis Perchak, Kieron Burke","title":"Generalized Gradient Approximation Made Thermal","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using the methodology of conditional-probability density functional theory,\nand several mild assumptions, we calculate the temperature-dependence of the\nPerdew-Burke-Ernzerhof (PBE) generalized gradient approximation (GGA). This\nnumerically-defined thermal GGA reduces to the local approximation in the\nuniform limit and PBE at zero temperature, and can be fit reasonably accurately\n(within 8%) assuming the temperature-dependent enhancement is independent of\nthe gradient. This locally thermal PBE satisfies both the coordinate-scaled\ncorrelation inequality and the concavity condition, which we prove for finite\ntemperatures. The temperature dependence differs markedly from existing thermal\nGGA's.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:06:29 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 18:30:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kozlowski","John",""],["Perchak","Dennis",""],["Burke","Kieron",""]]}
{"id":"2308.03320","submitter":"Lumin Liu","authors":"Lumin Liu, Jun Zhang, Shenghui Song, Khaled B. Letaief","title":"Binary Federated Learning with Client-Level Differential Privacy","comments":"6 pages, 6 figures, accepted by IEEE GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) is a privacy-preserving collaborative learning\nframework, and differential privacy can be applied to further enhance its\nprivacy protection. Existing FL systems typically adopt Federated Average\n(FedAvg) as the training algorithm and implement differential privacy with a\nGaussian mechanism. However, the inherent privacy-utility trade-off in these\nsystems severely degrades the training performance if a tight privacy budget is\nenforced. Besides, the Gaussian mechanism requires model weights to be of\nhigh-precision. To improve communication efficiency and achieve a better\nprivacy-utility trade-off, we propose a communication-efficient FL training\nalgorithm with differential privacy guarantee. Specifically, we propose to\nadopt binary neural networks (BNNs) and introduce discrete noise in the FL\nsetting. Binary model parameters are uploaded for higher communication\nefficiency and discrete noise is added to achieve the client-level differential\nprivacy protection. The achieved performance guarantee is rigorously proved,\nand it is shown to depend on the level of discrete noise. Experimental results\nbased on MNIST and Fashion-MNIST datasets will demonstrate that the proposed\ntraining algorithm achieves client-level privacy protection with performance\ngain while enjoying the benefits of low communication overhead from binary\nmodel updates.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:07:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Lumin",""],["Zhang","Jun",""],["Song","Shenghui",""],["Letaief","Khaled B.",""]]}
{"id":"2308.03321","submitter":"Huanran Chen","authors":"Zikai Zhou, Huanran Chen","title":"AFN: Adaptive Fusion Normalization via Encoder-Decoder Framework","comments":"arXiv admin note: text overlap with arXiv:2106.01899 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The success of deep learning is inseparable from normalization layers.\nResearchers have proposed various normalization functions, and each of them has\nboth advantages and disadvantages. In response, efforts have been made to\ndesign a unified normalization function that combines all normalization\nprocedures and mitigates their weaknesses. We also proposed a new normalization\nfunction called Adaptive Fusion Normalization. Through experiments, we\ndemonstrate AFN outperforms the previous normalization techniques in domain\ngeneralization and image classification tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:08:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Zikai",""],["Chen","Huanran",""]]}
{"id":"2308.03322","submitter":"Yuke Li","authors":"Hao Ni, Yuke Li, Heng Tao Shen, Jingkuan Song","title":"Part-Aware Transformer for Generalizable 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":"  Domain generalization person re-identification (DG-ReID) aims to train a\nmodel on source domains and generalize well on unseen domains. Vision\nTransformer usually yields better generalization ability than common CNN\nnetworks under distribution shifts. However, Transformer-based ReID models\ninevitably over-fit to domain-specific biases due to the supervised learning\nstrategy on the source domain. We observe that while the global images of\ndifferent IDs should have different features, their similar local parts (e.g.,\nblack backpack) are not bounded by this constraint. Motivated by this, we\npropose a pure Transformer model (termed Part-aware Transformer) for DG-ReID by\ndesigning a proxy task, named Cross-ID Similarity Learning (CSL), to mine local\nvisual information shared by different IDs. This proxy task allows the model to\nlearn generic features because it only cares about the visual similarity of the\nparts regardless of the ID labels, thus alleviating the side effect of\ndomain-specific biases. Based on the local similarity obtained in CSL, a\nPart-guided Self-Distillation (PSD) is proposed to further improve the\ngeneralization of global features. Our method achieves state-of-the-art\nperformance under most DG ReID settings. Under the Market$\\to$Duke setting, our\nmethod exceeds state-of-the-art by 10.9% and 12.8% in Rank1 and mAP,\nrespectively. The code is available at\nhttps://github.com/liyuke65535/Part-Aware-Transformer.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:15:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ni","Hao",""],["Li","Yuke",""],["Shen","Heng Tao",""],["Song","Jingkuan",""]]}
{"id":"2308.03323","submitter":"Sanket Dutta","authors":"Subhasanket Dutta, Umesh Kumar Verma, Sarika Jalan","title":"Solitary death in coupled limit-cycle oscillators with higher-order\n  interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Coupled limit cycle oscillators with pairwise interactions depict phase\ntransitions to amplitude or oscillation death. This Letter introduces a scheme\nfor higher-order interactions, which can not be decomposed into pairwise\ninteractions. We investigate Stuart Landau oscillators' dynamical evolution\nunder the impression of such a coupling scheme and discover a particular type\nof oscillator death where a coupling-dependent stable death state, away from\nthe origin, arises in isolation without being accompanied by any other stable\nstate. We call such a state a Solitary death state. Moreover, the explosive\ntransition to the death state is preceded by a surge in amplitude, followed by\nthe revival of the oscillations. Such versatile dynamical states are further\nenriched with sensitivity to initial conditions. Finally, we point out the\nresemblance of the results with different dynamical states associated with\nepileptic seizures.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:15:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dutta","Subhasanket",""],["Verma","Umesh Kumar",""],["Jalan","Sarika",""]]}
{"id":"2308.03324","submitter":"Hajime Kubota","authors":"Hajime Kubota","title":"Grid homology for spatial graphs and a K\\\"{u}nneth formula of connected\n  sum","comments":"30 pages, 18 figures","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 research the grid homology for spatial graphs with cut\nedges. We show that the grid homology for spatial graph $f$ is trivial if $f$\nhas sinks, sources, or cut edges. As an application, we give a purely\ncombinatorial proof of a K\\\"{u}nneth formula for the knot Floer homology of\nconnected sums in the framework of the grid homology.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:16:50 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:44:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kubota","Hajime",""]]}
{"id":"2308.03325","submitter":"Denny Lane Sombillo","authors":"Leonarc Michelle Santos and Denny Lane B. Sombillo","title":"Interpretation of near-threshold peaks using the method of independent\n  S-matrix poles","comments":"19 pages, 4 figures; Added references","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a model-independent analysis of near-threshold enhancements using\nindependent S-matrix poles. In this formulation, we constructed a Jost function\nwith controllable zeros to ensure that no poles are generated on the physical\nRiemann sheet. We show that there is a possibility of misinterpreting the\nobserved near-threshold signals if one utilized a limited parametrization and\nrestrict the analysis to only one element of the S-matrix. Specifically, there\nis a possibility of the emergence of ambiguous pair of poles which are\nsingularities of the full S-matrix but may not manifest in one of its elements.\nFor a more concrete discussion, we focused on an effective two-channel\nscattering where the full S-matrix is a $2\\times2$ matrix. We apply our method\nto the coupled two-channel analysis of the $P_\\psi^N(4312)^+$ and found that\nthe compact pentaquark interpretation cannot be ruled out yet.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:17:08 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 07:50:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Santos","Leonarc Michelle",""],["Sombillo","Denny Lane B.",""]]}
{"id":"2308.03326","submitter":"Takeshi Kato","authors":"Takeshi Kato","title":"Generative AI trial for nonviolent communication mediation","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aiming for a mixbiotic society that combines freedom and solidarity among\npeople with diverse values, I focused on nonviolent communication (NVC) that\nenables compassionate giving in various situations of social division and\nconflict, and tried a generative AI for it. Specifically, ChatGPT was used in\nplace of the traditional certified trainer to test the possibility of mediating\n(modifying) input sentences in four processes: observation, feelings, needs,\nand requests. The results indicate that there is potential for the application\nof generative AI, although not yet at a practical level. Suggested improvement\nguidelines included adding model responses, relearning revised responses,\nspecifying appropriate terminology for each process, and re-asking for required\ninformation. The use of generative AI will be useful initially to assist\ncertified trainers, to prepare for and review events and workshops, and in the\nfuture to support consensus building and cooperative behavior in digital\ndemocracy, platform cooperatives, and cyber-human social co-operating systems.\nIt is hoped that the widespread use of NVC mediation using generative AI will\nlead to the early realization of a mixbiotic society.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:19:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kato","Takeshi",""]]}
{"id":"2308.03327","submitter":"Gyorgy Csaba","authors":"Domonkos Laszlo Farkas and Gyorgy Csaba","title":"Parametric excitations of coupled nanomagnets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall nlin.PS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We demonstrate that parametrically excited eigenmodes in nearby nanomagnets\ncan be coupled to each other. Both positive (in-phase) and negative\n(anti-phase) couplings can be realized by a combination of appropriately chosen\ngeometry and excitation field frequency. The oscillations are sufficiently\nstable against thermal fluctuations. The phase relation between field-coupled\nnanomagnets shows a hysteretic behavior with the phase relation being locked\nover a wide frequency range. We envision that this computational study lays the\ngroundwork to use field-coupled nanomagnets as parametrons as building blocks\nof logic devices, neuromorphic systems or Ising machines.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:19:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Farkas","Domonkos Laszlo",""],["Csaba","Gyorgy",""]]}
{"id":"2308.03328","submitter":"Yao Su","authors":"Meng Wang, Yao Su, Hang Li, Jiarui Li, Jixiang Liang, Hangxin Liu","title":"Aggregating Single-wheeled Mobile Robots for Omnidirectional Movements","comments":null,"journal-ref":"IROS 2023","doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a novel modular robot system that can self-reconfigure to\nachieve omnidirectional movements for collaborative object transportation. Each\nrobotic module is equipped with a steerable omni-wheel for navigation and is\nshaped as a regular icositetragon with a permanent magnet installed on each\ncorner for stable docking. After aggregating multiple modules and forming a\nstructure that can cage a target object, we have developed an\noptimization-based method to compute the distribution of all wheels' heading\ndirections, which enables efficient omnidirectional movements of the structure.\nBy implementing a hierarchical controller on our prototyped system in both\nsimulation and experiment, we validated the trajectory tracking performance of\nan individual module and a team of six modules in multiple navigation and\ncollaborative object transportation settings. The results demonstrate that the\nproposed system can maintain a stable caging formation and achieve smooth\ntransportation, indicating the effectiveness of our hardware and locomotion\ndesigns.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:22:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Meng",""],["Su","Yao",""],["Li","Hang",""],["Li","Jiarui",""],["Liang","Jixiang",""],["Liu","Hangxin",""]]}
{"id":"2308.03329","submitter":"Amal Cheriyan George","authors":"A. G. Cheriyan, S. Vig, Sreelekshmi Mohan","title":"New radio lobes at parsec scale from the East-West protostellar jet\n  RAFGL2591","comments":"15 pages, 9 figures, Accepted for publication in MNRAS","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":"  RAFGL2591 is a massive star-forming complex in the Cygnus-X region comprising\nof a cluster of embedded protostars and young stellar objects located at a\ndistance of 3.33 kpc. We investigate low-frequency radio emission from the\nprotostellar jet associated with RAFGL2591 using the Giant Metrewave Radio\nTelescope (GMRT) at 325, 610 and 1280 MHz. For the first time, we have detected\nradio jet lobes in the E-W direction, labelled as GMRT-1 and GMRT-2. While\nGMRT-1 displays a flat radio spectral index of $\\alpha$ = -0.10 , GMRT-2 shows\na steeply negative value $\\alpha$ = -0.62 suggestive of non-thermal emission.\nH$_2$ emission maps show the presence of numerous knots, arcs and extended\nemission towards the East-West jet, excited by the protostar VLA 3. In\naddition, we report a few H$_2$ knots in the North-East and South-West for the\nfirst time. The radio lobes (GMRT-1, GMRT-2) and H$_2$ emission towards this\nregion are understood in the context of the prominent East-West jet as well as\nits lesser-known sibling jet in the North-East and South-West direction. To\nmodel the radio emission from the lobes, we have employed a numerical model\nincluding both thermal and non-thermal emission and found number densities\ntowards these lobes in the range 100 - 1000 cm$^{-3}$ . The misalignment of the\nEast-West jet lobes exhibits a reflection symmetry with a bending of $\\sim$\n20$\\circ$ . We attempt to understand this misalignment through precession\ncaused by a binary partner and/or a supersonic side wind from source(s) in the\nvicinity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:23:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cheriyan","A. G.",""],["Vig","S.",""],["Mohan","Sreelekshmi",""]]}
{"id":"2308.03330","submitter":"Yuyi Zhong","authors":"Yuyi Zhong, Ruiwei Wang, Siau-Cheng Khoo","title":"Expediting Neural Network Verification via Network Reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A wide range of verification methods have been proposed to verify the safety\nproperties of deep neural networks ensuring that the networks function\ncorrectly in critical applications. However, many well-known verification tools\nstill struggle with complicated network architectures and large network sizes.\nIn this work, we propose a network reduction technique as a pre-processing\nmethod prior to verification. The proposed method reduces neural networks via\neliminating stable ReLU neurons, and transforming them into a sequential neural\nnetwork consisting of ReLU and Affine layers which can be handled by the most\nverification tools. We instantiate the reduction technique on the\nstate-of-the-art complete and incomplete verification tools, including\nalpha-beta-crown, VeriNet and PRIMA. Our experiments on a large set of\nbenchmarks indicate that the proposed technique can significantly reduce neural\nnetworks and speed up existing verification tools. Furthermore, the experiment\nresults also show that network reduction can improve the availability of\nexisting verification tools on many networks by reducing them into sequential\nneural networks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:23:24 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 09:16:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhong","Yuyi",""],["Wang","Ruiwei",""],["Khoo","Siau-Cheng",""]]}
{"id":"2308.03331","submitter":"Wei Wan","authors":"Wei Wan, Shengshan Hu, Minghui Li, Jianrong Lu, Longling Zhang, Leo Yu\n  Zhang, Hai Jin","title":"A Four-Pronged Defense Against Byzantine Attacks in Federated Learning","comments":"This paper has been accepted by the 31st ACM International Conference\n  on Multimedia (MM '23)","journal-ref":null,"doi":"10.1145/3581783.3612474","report-no":null,"categories":"cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  \\textit{Federated learning} (FL) is a nascent distributed learning paradigm\nto train a shared global model without violating users' privacy. FL has been\nshown to be vulnerable to various Byzantine attacks, where malicious\nparticipants could independently or collusively upload well-crafted updates to\ndeteriorate the performance of the global model. However, existing defenses\ncould only mitigate part of Byzantine attacks, without providing an all-sided\nshield for FL. It is difficult to simply combine them as they rely on totally\ncontradictory assumptions.\n  In this paper, we propose FPD, a\n\\underline{\\textbf{f}}our-\\underline{\\textbf{p}}ronged\n\\underline{\\textbf{d}}efense against both non-colluding and colluding Byzantine\nattacks. Our main idea is to utilize absolute similarity to filter updates\nrather than relative similarity used in existingI works. To this end, we first\npropose a reliable client selection strategy to prevent the majority of threats\nin the bud. Then we design a simple but effective score-based detection method\nto mitigate colluding attacks. Third, we construct an enhanced spectral-based\noutlier detector to accurately discard abnormal updates when the training data\nis \\textit{not independent and identically distributed} (non-IID). Finally, we\ndesign update denoising to rectify the direction of the slightly noisy but\nharmful updates. The four sequentially combined modules can effectively\nreconcile the contradiction in addressing non-colluding and colluding Byzantine\nattacks. Extensive experiments over three benchmark image classification\ndatasets against four state-of-the-art Byzantine attacks demonstrate that FPD\ndrastically outperforms existing defenses in IID and non-IID scenarios (with\n$30\\%$ improvement on model accuracy).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:24:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wan","Wei",""],["Hu","Shengshan",""],["Li","Minghui",""],["Lu","Jianrong",""],["Zhang","Longling",""],["Zhang","Leo Yu",""],["Jin","Hai",""]]}
{"id":"2308.03332","submitter":"Rawad Melhem","authors":"Rawad Melhem, Assef Jafar, Riad Hamadeh","title":"Improving Deep Attractor Network by BGRU and GMM for Speech Separation","comments":null,"journal-ref":"Journal of Harbin Institute of Technology (New Series), vol. 28,\n  no. 3, pp. 90-96, 2021","doi":"10.11916/j.issn.1005-9113.2019044","report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep Attractor Network (DANet) is the state-of-the-art technique in speech\nseparation field, which uses Bidirectional Long Short-Term Memory (BLSTM), but\nthe complexity of the DANet model is very high. In this paper, a simplified and\npowerful DANet model is proposed using Bidirectional Gated neural network\n(BGRU) instead of BLSTM. The Gaussian Mixture Model (GMM) other than the\nk-means was applied in DANet as a clustering algorithm to reduce the complexity\nand increase the learning speed and accuracy. The metrics used in this paper\nare Signal to Distortion Ratio (SDR), Signal to Interference Ratio (SIR),\nSignal to Artifact Ratio (SAR), and Perceptual Evaluation Speech Quality (PESQ)\nscore. Two speaker mixture datasets from TIMIT corpus were prepared to evaluate\nthe proposed model, and the system achieved 12.3 dB and 2.94 for SDR and PESQ\nscores respectively, which were better than the original DANet model. Other\nimprovements were 20.7% and 17.9% in the number of parameters and time\ntraining, respectively. The model was applied on mixed Arabic speech signals\nand the results were better than that in English.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:26:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Melhem","Rawad",""],["Jafar","Assef",""],["Hamadeh","Riad",""]]}
{"id":"2308.03333","submitter":"Zixiang Ding","authors":"Bin Yin, Junjie Xie, Yu Qin, Zixiang Ding, Zhichao Feng, Xiang Li, Wei\n  Lin","title":"Heterogeneous Knowledge Fusion: A Novel Approach for Personalized\n  Recommendation via LLM","comments":"Accepted at RecSys 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The analysis and mining of user heterogeneous behavior are of paramount\nimportance in recommendation systems. However, the conventional approach of\nincorporating various types of heterogeneous behavior into recommendation\nmodels leads to feature sparsity and knowledge fragmentation issues. To address\nthis challenge, we propose a novel approach for personalized recommendation via\nLarge Language Model (LLM), by extracting and fusing heterogeneous knowledge\nfrom user heterogeneous behavior information. In addition, by combining\nheterogeneous knowledge and recommendation tasks, instruction tuning is\nperformed on LLM for personalized recommendations. The experimental results\ndemonstrate that our method can effectively integrate user heterogeneous\nbehavior and significantly improve recommendation performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:29:20 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 07:05:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yin","Bin",""],["Xie","Junjie",""],["Qin","Yu",""],["Ding","Zixiang",""],["Feng","Zhichao",""],["Li","Xiang",""],["Lin","Wei",""]]}
{"id":"2308.03334","submitter":"Thom\\'as  Fogarty Dr","authors":"Duc Tuan Hoang, Friederike Metz, Andreas Thomasen, Tran Duong Anh-Tai,\n  Thomas Busch and Thom\\'as Fogarty","title":"Variational quantum algorithm for ergotropy estimation in quantum\n  many-body batteries","comments":"16 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum batteries are predicted to have the potential to outperform their\nclassical counterparts and are therefore an important element in the\ndevelopment of quantum technologies. In this work we simulate the charging\nprocess and work extraction of many-body quantum batteries on\nnoisy-intermediate scale quantum (NISQ) devices, and devise the Variational\nQuantum Ergotropy (VQErgo) algorithm which finds the optimal unitary operation\nthat maximises work extraction from the battery. We test VQErgo by calculating\nthe ergotropy of a quantum battery undergoing transverse field Ising dynamics.\nWe investigate the battery for different system sizes and charging times and\nanalyze the minimum required circuit depth of the variational optimization\nusing both ideal and noisy simulators. Finally, we optimize part of the VQErgo\nalgorithm and calculate the ergotropy on one of IBM's quantum devices.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:29:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hoang","Duc Tuan",""],["Metz","Friederike",""],["Thomasen","Andreas",""],["Anh-Tai","Tran Duong",""],["Busch","Thomas",""],["Fogarty","Thom\u00e1s",""]]}
{"id":"2308.03335","submitter":"Fumiya Nishimura","authors":"Fumiya Nishimura, Yui Kuramochi, Kazuhiro Yamamoto","title":"Standard quantum limit of finite-size optical lattice clock in\n  estimating gravitational potential","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We evaluated the accuracy limit for estimating gravitational potential using\noptical lattice clocks by utilizing the quantum Cram\\'{e}r--Rao bound. We then\ncompared the results for single-layer and multilayer optical lattice clocks.\nThe results indicate that the lower bound of variance of the estimator of\ngravitational potential using finite-size optical lattice clocks diverges and\nrecovers repeatedly as a function of time. Namely, the accuracy of the\ngravitational potential estimation is not a monotonic function of time owing to\nthe effect of gravitational dephasing in finite-size optical lattice clock.\nFurther, this effect creates an estimation accuracy limit when attempting to\navoid the divergence of the lower bound. When the number of layers in the\noptical lattice clock is sufficiently large, the limit is independent of the\noptical lattice clock details. The time required to reach this limit is\ncalculated to be approximately 33 hours for a three-dimensional optical lattice\nclock consisting of one million cadmium atoms due to Earth's gravity, and\napproximately the same for other atoms.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:34:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nishimura","Fumiya",""],["Kuramochi","Yui",""],["Yamamoto","Kazuhiro",""]]}
{"id":"2308.03336","submitter":"Dong Wu","authors":"W. B. Zhang, Y. H. Li, D. Wu, J. Zhang","title":"Colliding of two high Mach-number quantum degenerate plasma jets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Colliding of two high Mach-number quantum degenerate plasmas is one of the\nmost essential components in the double-cone ignition (DCI) inertial\nconfinement fusion scheme, in which two highly compressed plasma jets from the\ncone-tips collide along with rapid conversion from the colliding kinetic\nenergies to the internal energy of a stagnated isochoric plasma. Due to the\neffects of high densities and high Mach-numbers of the colliding plasma jets,\nquantum degeneracy and kinetic physics might play important roles and challenge\nthe predictions of traditional hydrodynamic models. In this work, the colliding\nprocess of two high Mach number quantum degenerate Deuterium-plasma jets with\nsizable scale ($\\sim 1000\\ \\si{\\mu m}$, $\\sim 300\\ \\si{ps}$, $\\sim 100\\\n\\si{g/cc}$, $\\sim 300\\ \\si{km/s}$) were investigated with first-principle\nkinetic simulations and theoretical analyses. In order to achieve high-density\ncompression, the colliding kinetic pressure should be significantly higher than\nthe pressure raised by the quantum degeneracy. This means high colliding Mach\nnumbers are required. However, when the Mach number is further increased, we\nsurprisingly found a decreasing trend of density compression, due to kinetic\neffects. It is therefore suggested that there is theoretically optimal\ncolliding velocity to achieve the highest density compression. Our results\nwould provide valuable suggestions for the base-line design of the DCI\nexperiments and also might be of relevance in some violent astrophysical\nprocesses, such as the merger of two white dwarfs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:36:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","W. B.",""],["Li","Y. H.",""],["Wu","D.",""],["Zhang","J.",""]]}
{"id":"2308.03337","submitter":"Kourosh Parand","authors":"Alireza Afzal Aghaei, Kourosh Parand, Ali Nikkhah, Shakila Jaberi","title":"Solving Falkner-Skan type equations via Legendre and Chebyshev Neural\n  Blocks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, a new deep-learning architecture for solving the non-linear\nFalkner-Skan equation is proposed. Using Legendre and Chebyshev neural blocks,\nthis approach shows how orthogonal polynomials can be used in neural networks\nto increase the approximation capability of artificial neural networks. In\naddition, utilizing the mathematical properties of these functions, we overcome\nthe computational complexity of the backpropagation algorithm by using the\noperational matrices of the derivative. The efficiency of the proposed method\nis carried out by simulating various configurations of the Falkner-Skan\nequation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:38:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aghaei","Alireza Afzal",""],["Parand","Kourosh",""],["Nikkhah","Ali",""],["Jaberi","Shakila",""]]}
{"id":"2308.03338","submitter":"Jinha Kim","authors":"Jaewoo Jung, Jinha Kim, Minki Kim, Yeongrak Kim","title":"An Eisenbud-Goto type inequality for Stanley-Reisner ideals and\n  simplicial complexes","comments":"18 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AT math.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The Leray number of an abstract simplicial complex is the minimal integer $d$\nwhere its induced subcomplexes have trivial homology groups in dimension $d$ or\ngreater. We give an upper bound on the Leray number of a complex in terms of\nhow the facets are attached to each other. We also describe the structure of\ncomplexes for the equality of the bound that we found. Through the\nStanley-Reisner correspondence, our results give an Eisenbud-Goto type\ninequality for any square-free monomial ideals. This generalizes Terai's\nresult.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:43:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jung","Jaewoo",""],["Kim","Jinha",""],["Kim","Minki",""],["Kim","Yeongrak",""]]}
{"id":"2308.03339","submitter":"Michiya Mori","authors":"Michiya Mori","title":"On the Scottish Book Problem 155 by Mazur and Sternbach","comments":"3 pages","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"math.FA math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Problem 155 of the Scottish Book asks whether every bijection $U\\colon X\\to\nY$ between two Banach spaces $X, Y$ with the property that, each point of $X$\nhas a neighborhood on which $U$ is isometric, is globally isometric on $X$. We\nprove that this is true under the additional assumption that $X$ is separable\nand the weaker assumption of surjectivity instead of bijectivity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:46:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mori","Michiya",""]]}
{"id":"2308.03340","submitter":"Cheng Wang","authors":"Cheng Wang and Wei Li","title":"A Hybrid CNN-Transformer Architecture with Frequency Domain Contrastive\n  Learning for Image Deraining","comments":"21 pages,6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image deraining is a challenging task that involves restoring degraded images\naffected by rain streaks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:47:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Cheng",""],["Li","Wei",""]]}
{"id":"2308.03341","submitter":"Marcello Poletti","authors":"Marcello Poletti","title":"Bertlmann's socks from a G\\\"odelian perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum mechanics is a theory that is as effective as it is counterintuitive.\nWhile quantum practices operate impeccably, they compel us to embrace enigmatic\nphenomena like the collapse of the state vector and non-locality, thereby\npushing us towards untenable \"hypotheses non fingo\" stances. However, a century\nafter its inception, we are presented with a promising interpretive key,\nintimated by Wheeler as early as 1974. The interpretative paradoxes of this\ntheory might be resolved if we discern the relationship between logical\nundecidability and quantum undecidability. It will be demonstrated how both are\nintricately linked to an observer/observed relational issue, and how the\nidiosyncratic behaviours of quantum physics can be reconciled with the\nnormative, following this path.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:49:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Poletti","Marcello",""]]}
{"id":"2308.03342","submitter":"Merab Gogberashvili Prof","authors":"Merab Gogberashvili and Ani Girgvliani","title":"General spherically symmetric solution of Cotton gravity","comments":"9 pages, no figures","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 present the general spherically symmetric solution to the\nvacuum equations of Cotton gravity. The obtained metric solution reveals the\npresence of singularities at the photosphere of a spherical source, which\nobstruct the formation of Schwarzschild-like black holes. The solution is\ncharacterized by two integration constants that can be associated with the\nHubble horizon and utilized to model the dark matter and dark energy. We\nexamine the diverse features of the solution, including the introduction of\nlong-range modifications to Newton's force through the incorporation of the\nvelocity-squared repulsive term.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:50:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gogberashvili","Merab",""],["Girgvliani","Ani",""]]}
{"id":"2308.03343","submitter":"Maximilian Obst","authors":"Maximilian Obst, Tobias N\\\"orenberg, Gonzalo \\'Alvarez-P\\'erez, Thales\n  V. A. G. de Oliveira, Javier Taboada-Guti\\'errez, Fl\\'avio H. Feres, Felix G.\n  Kaps, Osama Hatem, Andrei Luferau, Alexey Y. Nikitin, J. Michael Klopf, Pablo\n  Alonso-Gonz\\'alez, Susanne C. Kehr and Lukas M. Eng","title":"Terahertz Twistoptics -- engineering canalized phonon polaritons","comments":"25 pages, 4 figures, article, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The terahertz (THz) frequency range is key to study collective excitations in\nmany crystals and organic molecules. However, due to the large wavelength of\nTHz radiation, the local probing of these excitations in smaller crystalline\nstructures or few-molecular arrangements, requires sophisticated methods to\nconfine THz light down to the nanometer length scale, as well as to manipulate\nsuch a confined radiation. For this purpose, in recent years, taking advantage\nof hyperbolic phonon polaritons (HPhP) in highly anisotropic van der Waals\n(vdW) materials has emerged as a promising approach, offering a multitude of\nmanipulation options such as control over the wavefront shape and propagation\ndirection. Here, we demonstrate the first THz application of\ntwist-angle-induced HPhP manipulation, designing the propagation of confined\nTHz radiation between 8.39 and 8.98 THz in the vdW material alpha-molybdenum\ntrioxide ($\\alpha-MoO_{3}$), hence extending twistoptics to this intriguing\nfrequency range. Our images, recorded by near-field optical microscopy, show\nthe frequency- and twist-angle-dependent change between hyperbolic and elliptic\npolariton propagation, revealing a polaritonic transition at THz frequencies.\nAs a result, we are able to allocate canalization (highly collimated\npropagation) of confined THz radiation by carefully adjusting these two\nparameters, i.e. frequency and twist angle. Specifically, we report polariton\ncanalization in $\\alpha-MoO_{3}$ at 8.67 THz for a twist angle of 50{\\deg}. Our\nresults demonstrate an unprecedented control and the manipulation of\nhighly-confined collective excitations at THz frequencies, offering novel\npossibilities for nanophotonic applications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:51:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Obst","Maximilian",""],["N\u00f6renberg","Tobias",""],["\u00c1lvarez-P\u00e9rez","Gonzalo",""],["de Oliveira","Thales V. A. G.",""],["Taboada-Guti\u00e9rrez","Javier",""],["Feres","Fl\u00e1vio H.",""],["Kaps","Felix G.",""],["Hatem","Osama",""],["Luferau","Andrei",""],["Nikitin","Alexey Y.",""],["Klopf","J. Michael",""],["Alonso-Gonz\u00e1lez","Pablo",""],["Kehr","Susanne C.",""],["Eng","Lukas M.",""]]}
{"id":"2308.03344","submitter":"Shang-Wei Lin","authors":"Shang-Wei Lin, Tzu-Fan Wang, Yean-Ru Chen, Zhe Hou, David San\\'an, Yon\n  Shin Teo","title":"A Parallel and Distributed Quantum SAT Solver Based on Entanglement and\n  Quantum Teleportation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Boolean satisfiability (SAT) solving is a fundamental problem in computer\nscience. Finding efficient algorithms for SAT solving has broad implications in\nmany areas of computer science and beyond. Quantum SAT solvers have been\nproposed in the literature based on Grover's algorithm. Although existing\nquantum SAT solvers can consider all possible inputs at once, they evaluate\neach clause in the formula one by one sequentially, making the time complexity\nO(m) -- linear to the number of clauses m -- per Grover iteration. In this\nwork, we develop a parallel quantum SAT solver, which reduces the time\ncomplexity in each iteration from linear time O(m) to constant time O(1) by\nutilising extra entangled qubits. To further improve the scalability of our\nsolution in case of extremely large problems, we develop a distributed version\nof the proposed parallel SAT solver based on quantum teleportation such that\nthe total qubits required are shared and distributed among a set of quantum\ncomputers (nodes), and the quantum SAT solving is accomplished collaboratively\nby all the nodes. We have proved the correctness of our approaches and\ndemonstrated them in simulations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:52:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lin","Shang-Wei",""],["Wang","Tzu-Fan",""],["Chen","Yean-Ru",""],["Hou","Zhe",""],["San\u00e1n","David",""],["Teo","Yon Shin",""]]}
{"id":"2308.03345","submitter":"Michiya Mori","authors":"Michiya Mori","title":"On the shape of correlation matrices for unitaries","comments":"4 pages","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a positive integer $n$, we study the collection\n$\\mathcal{F}_{\\mathrm{fin}}(n)$ formed of all $n\\times n$ matrices whose\nentries $a_{ij}$, $1\\leq i,j\\leq n$, can be written as $a_{ij}=\\tau(U_j^*U_i)$\nfor some $n$-tuple $U_1, U_2, \\ldots, U_n$ of unitaries in a finite-dimensional\nvon Neumann algebra $\\mathcal{M}$ with tracial state $\\tau$. We show that\n$\\mathcal{F}_{\\mathrm{fin}}(n)$ is not closed for every $n\\geq 8$. This\nimproves a result by Musat and R{\\o}rdam which states the same for $n\\geq 11$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:55:19 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 04:19:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mori","Michiya",""]]}
{"id":"2308.03346","submitter":"Urei Miura","authors":"Urei Miura and Keisuke Totsuka","title":"Supersymmetry Breaking in a Generalized Nicolai Model with Fermion\n  Pairing","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a supersymmetric lattice fermion model that contains both\nfermion pairing and the interacting Nicolai model. This model possesses a\nsingle control parameter, $g$, introduced through the anticommutator of the\nsupersymmetry generators (supercharge), and it is shown that supersymmetry is\nbroken in both finite and infinite systems as long as $g$ is finite.\nAdditionally, the single-mode approximation is employed to establish an upper\nbound on the dispersion relation of Nambu-Goldstone (NG) fermions,\ndemonstrating their gaplessness. Finally, it is shown, through numerical and\nanalytic calculations, that the anticipated extensive ground-state degeneracy\nand a zero-energy flat band does not occur for generic values of the parameter\n$g$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:58:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Miura","Urei",""],["Totsuka","Keisuke",""]]}
{"id":"2308.03347","submitter":"Osamu Fujino","authors":"Osamu Fujino","title":"On vanishing theorems for analytic spaces","comments":"9 pages. arXiv admin note: substantial text overlap with\n  arXiv:2205.14801, arXiv:2209.06382","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is a short report on our new vanishing theorems for projective morphisms\nbetween complex analytic spaces. We established a complex analytic\ngeneralization of Koll\\'ar's torsion-freeness and vanishing theorem for\nanalytic simple normal crossing pairs. Although our results may look\nartificial, they have already played a crucial role for the study of minimal\nmodels in the complex analytic setting.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:02:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fujino","Osamu",""]]}
{"id":"2308.03348","submitter":"Xingxing Yang","authors":"Xingxing Yang, Jie Chen, Zaifeng Yang","title":"Cooperative Colorization: Exploring Latent Cross-Domain Priors for NIR\n  Image Spectrum Translation","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":"10.1145/3581783.3612008","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Near-infrared (NIR) image spectrum translation is a challenging problem with\nmany promising applications. Existing methods struggle with the mapping\nambiguity between the NIR and the RGB domains, and generalize poorly due to the\nlimitations of models' learning capabilities and the unavailability of\nsufficient NIR-RGB image pairs for training. To address these challenges, we\npropose a cooperative learning paradigm that colorizes NIR images in parallel\nwith another proxy grayscale colorization task by exploring latent cross-domain\npriors (i.e., latent spectrum context priors and task domain priors), dubbed\nCoColor. The complementary statistical and semantic spectrum information from\nthese two task domains -- in the forms of pre-trained colorization networks --\nare brought in as task domain priors. A bilateral domain translation module is\nsubsequently designed, in which intermittent NIR images are generated from\ngrayscale and colorized in parallel with authentic NIR images; and vice versa\nfor the grayscale images. These intermittent transformations act as latent\nspectrum context priors for efficient domain knowledge exchange. We\nprogressively fine-tune and fuse these modules with a series of pixel-level and\nfeature-level consistency constraints. Experiments show that our proposed\ncooperative learning framework produces satisfactory spectrum translation\noutputs with diverse colors and rich textures, and outperforms state-of-the-art\ncounterparts by 3.95dB and 4.66dB in terms of PNSR for the NIR and grayscale\ncolorization tasks, respectively.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:02:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Xingxing",""],["Chen","Jie",""],["Yang","Zaifeng",""]]}
{"id":"2308.03349","submitter":"Shengzhi Li","authors":"Shengzhi Li, Nima Tajbakhsh","title":"SciGraphQA: A Large-Scale Synthetic Multi-Turn Question-Answering\n  Dataset for Scientific Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we present SciGraphQA, a synthetic multi-turn question-answer\ndataset related to academic graphs. SciGraphQA is 13 times larger than\nChartVQA, the previously largest chart-visual question-answering dataset. It is\nalso the largest open-sourced chart VQA dataset with non-synthetic charts. To\nbuild our dataset, we selected 290,000 Computer Science or Machine Learning\nArXiv papers published between 2010 and 2020, and then used Palm-2 to generate\n295K samples of open-vocabulary multi-turn question-answering dialogues about\nthe graphs. As context, we provided the text-only Palm-2 with paper title,\nabstract, paragraph mentioning the graph, and rich text contextual data from\nthe graph itself, obtaining dialogues with an average 2.23 question-answer\nturns for each graph. We asked GPT-4 to assess the matching quality of our\nquestion-answer turns given the paper's context, obtaining an average rating of\n8.7/10 on our 3K test set. We evaluated the 0-shot capability of the most\npopular MLLM models such as LLaVa, mPLUGowl, BLIP-2, and openFlamingo's on our\ndataset, finding LLaVA-13B being the most performant with a CIDEr score of\n0.08. We further enriched the question prompts for LLAVA by including the\nserialized data tables extracted from the graphs using the DePlot model,\nboosting LLaVA's 0-shot CIDEr to 0.15. To verify the validity of our dataset,\nwe also fine-tuned LLaVa using our dataset, reaching a substantially higher\nCIDEr score of 0.26. We anticipate further accuracy improvement by including\nsegmentation mask tokens and leveraging larger LLM backbones coupled with\nemergent prompting techniques. Our code and data are open-sourced.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:03:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Shengzhi",""],["Tajbakhsh","Nima",""]]}
{"id":"2308.03350","submitter":"Yuxi Zhu","authors":"Zhu Yuxi, Meng Zili, Shen Yixin, Xu Mingwei, Wu Jianping","title":"Robustifying Measurement-Based Congestion Control Algorithms","comments":"6+1 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The design methodology of congestion control algorithms (CCAs) has shifted\nfrom control-based to measurement-based in recent years. However, we find that\nmeasurement-based CCAs, although having better performance, are not robust\nenough in fluctuating network environments, which are increasingly common\nnowadays. In this paper, we propose PAD to make measurement-based CCAs as\nrobust as control-based CCAs in fluctuating environments while enjoying the\nperformance benefits in general. PAD identifies that the root cause is that\nmeasurement-based CCAs blindly rely on measurement results, which unfortunately\ncan be inaccurate, and will transiently mislead the CCAs to misbehave. The\npreliminary design of PAD works as a shim layer between the socket and CCAs so\nas to scale to any measurement-based CCAs, which turns out to outperform most\ncommonly used CCAs in fluctuating environments.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:05:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yuxi","Zhu",""],["Zili","Meng",""],["Yixin","Shen",""],["Mingwei","Xu",""],["Jianping","Wu",""]]}
{"id":"2308.03351","submitter":"Yuki Yasuda Ph.D.","authors":"Yuki Yasuda and Ryo Onishi","title":"A Theory of Evidence Lower Bound and Its Application to Super-Resolution\n  Data Assimilation (SRDA) Using Conditional Variational Autoencoders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study proposes a framework that concurrently optimizes the assimilation\nand generation processes of observation data. This is implemented with a\nconditional variational autoencoder (CVAE) composed of an encoder and a\ndecoder. The encoder performs assimilation by estimating the true state from\nthe background state and observations at a given time, whereas the decoder\nserves as an observation operator and generates observations from the true\nstate. The loss function for the unsupervised learning of CVAEs is regarded as\nan objective function for three-dimensional variational (3D-Var) assimilation,\nproviding a theoretical basis for the use of CVAEs. Furthermore, by leveraging\nthe arbitrariness of the prior distribution, the proposed framework is applied\nto super-resolution data assimilation (SRDA). Specifically, the background\nstate is super-resolved by an SR model and then used in training the CVAE. This\napproach allows the encoder to execute SR and DA simultaneously. The\neffectiveness of the proposed SRDA is validated via numerical experiments on an\nidealized barotropic ocean jet system. The SR model can be trained using the\nobservations as target data, despite most grid points being missing. This\nachievement is attributed to the translation equivariance of convolution.\nComparisons with an ensemble Kalman filter show the superior performance and\nreduced computational cost of the SRDA. Importantly, the SRDA can infer\nhigh-resolution forecasts at any time step through the combination of the SR\nmodel and CVAE. This research provides a theoretical foundation and motivation\nfor the use of deep generative models in DA.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:06:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yasuda","Yuki",""],["Onishi","Ryo",""]]}
{"id":"2308.03352","submitter":"Niklas Herrmann","authors":"Niklas J. Herrmann, Holger Euchner, Axel Gro{\\ss}, Birger Horstmann","title":"The cycling mechanism of manganese-oxide cathodes in zinc batteries: A\n  theory-based approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Zinc-based batteries offer good volumetric energy densities and are\ncompatible with environmentally friendly aqueous electrolytes. Zinc-ion\nbatteries (ZIBs) rely on a lithium-ion-like Zn$^{2+}$-shuttle, which enables\nhigher roundtrip efficiencies and better cycle life than zinc-air batteries.\nManganese-oxide cathodes in near-neutral zinc sulfate electrolytes are the most\nprominent candidates for ZIBs. Zn$^{2+}$-insertion, H$^+$-insertion, and\nMn$^{2+}$-dissolution are proposed to contribute to the charge-storage\nmechanism. During discharge and charge, two distinct phases are observed.\nNotably, the pH-driven precipitation of zinc-sulfate-hydroxide is detected\nduring the second discharge phase. However, a complete and consistent\nunderstanding of the two-phase mechanism of these ZIBs is still missing. This\npaper presents a continuum full cell model supported by DFT calculations to\ninvestigate the implications of these observations. We integrate the\ncomplex-formation reactions of near-neutral aqueous electrolytes into the\nbattery model and, in combination with the DFT calculations, draw a consistent\npicture of the cycling mechanism. We investigate the interplay between\nelectrolyte pH and reaction mechanisms at the manganese-oxide cathodes and\nidentify the dominant charge-storage mechanism. Our model is validated with\nelectrochemical cycling data, cyclic voltammograms, and in-situ pH measurments.\nThis allows us to analyse the influence of cell design and electrolyte\ncomposition on cycling and optimize the battery performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:09:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Herrmann","Niklas J.",""],["Euchner","Holger",""],["Gro\u00df","Axel",""],["Horstmann","Birger",""]]}
{"id":"2308.03353","submitter":"Seth Kurfman","authors":"Seth W. Kurfman, Andrew Franson, Piyush Shah, Yueguang Shi, Hil Fung\n  Harry Cheung, Katherine E. Nygren, Mitchell Swyt, Kristen S. Buchanan,\n  Gregory D. Fuchs, Michael E. Flatt\\'e, Gopalan Srinivasan, Michael Page, and\n  Ezekiel Johnston-Halperin","title":"$\\textit{In situ}$ electric-field control of ferromagnetic resonance in\n  the low-loss organic-based ferrimagnet V[TCNE]$_{x\\sim 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":"  We demonstrate indirect electric-field control of ferromagnetic resonance\n(FMR) in devices that integrate the low-loss, molecule-based, room-temperature\nferrimagnet vanadium tetracyanoethylene (V[TCNE]$_{x \\sim 2}$) mechanically\ncoupled to PMN-PT piezoelectric transducers. Upon straining the V[TCNE]$_x$\nfilms, the FMR frequency is tuned by more than 6 times the resonant linewidth\nwith no change in Gilbert damping for samples with $\\alpha = 6.5 \\times\n10^{-5}$. We show this tuning effect is due to a strain-dependent magnetic\nanisotropy in the films and find the magnetoelastic coefficient $|\\lambda_S|\n\\sim (1 - 4.4)$ ppm, backed by theoretical predictions from DFT calculations\nand magnetoelastic theory. Noting the rapidly expanding application space for\nstrain-tuned FMR, we define a new metric for magnetostrictive materials,\n$\\textit{magnetostrictive agility}$, given by the ratio of the magnetoelastic\ncoefficient to the FMR linewidth. This agility allows for a direct comparison\nbetween magnetostrictive materials in terms of their comparative efficacy for\nmagnetoelectric applications requiring ultra-low loss magnetic resonance\nmodulated by strain. With this metric, we show V[TCNE]$_x$ is competitive with\nother magnetostrictive materials including YIG and Terfenol-D. This combination\nof ultra-narrow linewidth and magnetostriction in a system that can be directly\nintegrated into functional devices without requiring heterogeneous integration\nin a thin-film geometry promises unprecedented functionality for electric-field\ntuned microwave devices ranging from low-power, compact filters and circulators\nto emerging applications in quantum information science and technology.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:14:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kurfman","Seth W.",""],["Franson","Andrew",""],["Shah","Piyush",""],["Shi","Yueguang",""],["Cheung","Hil Fung Harry",""],["Nygren","Katherine E.",""],["Swyt","Mitchell",""],["Buchanan","Kristen S.",""],["Fuchs","Gregory D.",""],["Flatt\u00e9","Michael E.",""],["Srinivasan","Gopalan",""],["Page","Michael",""],["Johnston-Halperin","Ezekiel",""]]}
{"id":"2308.03354","submitter":"Linjie Fu","authors":"Linjie Fu, Xia Li, Xiuding Cai, Dong Miao, Yu Yao and Yali Shen","title":"Energy-Guided Diffusion Model for CBCT-to-CT Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cone Beam CT (CBCT) plays a crucial role in Adaptive Radiation Therapy (ART)\nby accurately providing radiation treatment when organ anatomy changes occur.\nHowever, CBCT images suffer from scatter noise and artifacts, making relying\nsolely on CBCT for precise dose calculation and accurate tissue localization\nchallenging. Therefore, there is a need to improve CBCT image quality and\nHounsfield Unit (HU) accuracy while preserving anatomical structures. To\nenhance the role and application value of CBCT in ART, we propose an\nenergy-guided diffusion model (EGDiff) and conduct experiments on a chest tumor\ndataset to generate synthetic CT (sCT) from CBCT. The experimental results\ndemonstrate impressive performance with an average absolute error of\n26.87$\\pm$6.14 HU, a structural similarity index measurement of 0.850$\\pm$0.03,\na peak signal-to-noise ratio of the sCT of 19.83$\\pm$1.39 dB, and a normalized\ncross-correlation of the sCT of 0.874$\\pm$0.04. These results indicate that our\nmethod outperforms state-of-the-art unsupervised synthesis methods in accuracy\nand visual quality, producing superior sCT images.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:23:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fu","Linjie",""],["Li","Xia",""],["Cai","Xiuding",""],["Miao","Dong",""],["Yao","Yu",""],["Shen","Yali",""]]}
{"id":"2308.03355","submitter":"Sayantan Banerjee","authors":"Jyotishka Datta, Sayantan Banerjee, David B. Dunson","title":"Nonparametric Bayes multiresolution testing for high-dimensional rare\n  events","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a variety of application areas, there is interest in assessing evidence of\ndifferences in the intensity of event realizations between groups. For example,\nin cancer genomic studies collecting data on rare variants, the focus is on\nassessing whether and how the variant profile changes with the disease subtype.\nMotivated by this application, we develop multiresolution nonparametric Bayes\ntests for differential mutation rates across groups. The multiresolution\napproach yields fast and accurate detection of spatial clusters of rare\nvariants, and our nonparametric Bayes framework provides great flexibility for\nmodeling the intensities of rare variants. Some theoretical properties are also\nassessed, including weak consistency of our Dirichlet Process-Poisson-Gamma\nmixture over multiple resolutions. Simulation studies illustrate excellent\nsmall sample properties relative to competitors, and we apply the method to\ndetect rare variants related to common variable immunodeficiency from whole\nexome sequencing data on 215 patients and over 60,027 control subjects.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:24:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Datta","Jyotishka",""],["Banerjee","Sayantan",""],["Dunson","David B.",""]]}
{"id":"2308.03356","submitter":"Peng-Wei Zhao","authors":"Y. L. Yang and P. W. Zhao","title":"A relativistic model-free prediction for neutrinoless double beta decay\n  at leading order","comments":"6 pages, 4 figures. Comments and suggestions are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-lat hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Starting from a manifestly Lorentz-invariant chiral Lagrangian, we present a\nmodel-free prediction for the transition amplitude of the process\n$nn\\rightarrow pp e^-e^-$ induced by light Majorana neutrinos, which is a key\nprocess of the neutrinoless double beta decay ($0\\nu\\beta\\beta$) in heavy\nnuclei employed in large-scale searches. Contrary to the nonrelativistic case,\nwe show that the transition amplitude can be renormalized at leading order\nwithout any uncertain contact operators. The predicted amplitude defines a\nstringent benchmark for the previous estimation with model-dependent inputs,\nand greatly reduces the uncertainty of $0\\nu\\beta\\beta$ transition operator in\nthe calculations of nuclear matrix elements. Generalizations of the present\nframework could also help to address the uncertainties in $0\\nu\\beta\\beta$\ndecay induced by other mechanisms. In addition, the present work motivates a\nrelativistic ab initio calculation of $0\\nu\\beta\\beta$ decay in light and\nmedium-mass nuclei.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:24:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Y. L.",""],["Zhao","P. W.",""]]}
{"id":"2308.03357","submitter":"Yoshiki Obinata","authors":"Yoshiki Obinata, Naoaki Kanazawa, Kento Kawaharazuka, Iori Yanokura,\n  Soonhyo Kim, Kei Okada and Masayuki Inaba","title":"Foundation Model based Open Vocabulary Task Planning and Executive\n  System for General Purpose Service Robots","comments":"In review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper describes a strategy for implementing a robotic system capable of\nperforming General Purpose Service Robot (GPSR) tasks in robocup@home. The GPSR\ntask is that a real robot hears a variety of commands in spoken language and\nexecutes a task in a daily life environment. To achieve the task, we integrate\nfoundation models based inference system and a state machine task executable.\nThe foundation models plan the task and detect objects with open vocabulary,\nand a state machine task executable manages each robot's actions. This system\nworks stable, and we took first place in the RoboCup@home Japan Open 2022's\nGPSR with 130 points, more than 85 points ahead of the other teams.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:26:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Obinata","Yoshiki",""],["Kanazawa","Naoaki",""],["Kawaharazuka","Kento",""],["Yanokura","Iori",""],["Kim","Soonhyo",""],["Okada","Kei",""],["Inaba","Masayuki",""]]}
{"id":"2308.03358","submitter":"Jingdi Chen","authors":"Jingdi Chen, Tian Lan","title":"Minimizing Return Gaps with Discrete Communications in Decentralized\n  POMDP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Communication is crucial for solving cooperative Multi-Agent Reinforcement\nLearning tasks in Partially-Observable Markov Decision Processes. Existing\nworks often rely on black-box methods to encode local information/features into\nmessages shared with other agents. However, such black-box approaches are\nunable to provide any quantitative guarantees on the expected return and often\nlead to the generation of continuous messages with high communication overhead\nand poor interpretability. In this paper, we establish an upper bound on the\nreturn gap between an ideal policy with full observability and an optimal\npartially-observable policy with discrete communication. This result enables us\nto recast multi-agent communication into a novel online clustering problem over\nthe local observations at each agent, with messages as cluster labels and the\nupper bound on the return gap as clustering loss. By minimizing the upper\nbound, we propose a surprisingly simple design of message generation functions\nin multi-agent communication and integrate it with reinforcement learning using\na Regularized Information Maximization loss function. Evaluations show that the\nproposed discrete communication significantly outperforms state-of-the-art\nmulti-agent communication baselines and can achieve nearly-optimal returns with\nfew-bit messages that are naturally interpretable.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:26:55 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 14:06:59 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 19:25:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Jingdi",""],["Lan","Tian",""]]}
{"id":"2308.03359","submitter":"Yinjie Zhao","authors":"Yinjie Zhao, Lichen Zhao, Qian Yu, Jing Zhang, Lu Sheng, Dong Xu","title":"Distortion-aware Transformer in 360{\\deg} Salient Object Detection","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the emergence of VR and AR, 360{\\deg} data attracts increasing attention\nfrom the computer vision and multimedia communities. Typically, 360{\\deg} data\nis projected into 2D ERP (equirectangular projection) images for feature\nextraction. However, existing methods cannot handle the distortions that result\nfrom the projection, hindering the development of 360-data-based tasks.\nTherefore, in this paper, we propose a Transformer-based model called DATFormer\nto address the distortion problem. We tackle this issue from two perspectives.\nFirstly, we introduce two distortion-adaptive modules. The first is a\nDistortion Mapping Module, which guides the model to pre-adapt to distorted\nfeatures globally. The second module is a Distortion-Adaptive Attention Block\nthat reduces local distortions on multi-scale features. Secondly, to exploit\nthe unique characteristics of 360{\\deg} data, we present a learnable relation\nmatrix and use it as part of the positional embedding to further improve\nperformance. Extensive experiments are conducted on three public datasets, and\nthe results show that our model outperforms existing 2D SOD (salient object\ndetection) and 360 SOD methods.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:28:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Yinjie",""],["Zhao","Lichen",""],["Yu","Qian",""],["Zhang","Jing",""],["Sheng","Lu",""],["Xu","Dong",""]]}
{"id":"2308.03360","submitter":"Ramy Eskander","authors":"Shivani Shekhar, Simran Tiwari, T. C. Rensink, Ramy Eskander, Wael\n  Salloum","title":"Coupling Symbolic Reasoning with Language Modeling for Efficient\n  Longitudinal Understanding of Unstructured Electronic Medical Records","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The application of Artificial Intelligence (AI) in healthcare has been\nrevolutionary, especially with the recent advancements in transformer-based\nLarge Language Models (LLMs). However, the task of understanding unstructured\nelectronic medical records remains a challenge given the nature of the records\n(e.g., disorganization, inconsistency, and redundancy) and the inability of\nLLMs to derive reasoning paradigms that allow for comprehensive understanding\nof medical variables. In this work, we examine the power of coupling symbolic\nreasoning with language modeling toward improved understanding of unstructured\nclinical texts. We show that such a combination improves the extraction of\nseveral medical variables from unstructured records. In addition, we show that\nthe state-of-the-art commercially-free LLMs enjoy retrieval capabilities\ncomparable to those provided by their commercial counterparts. Finally, we\nelaborate on the need for LLM steering through the application of symbolic\nreasoning as the exclusive use of LLMs results in the lowest performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:29:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shekhar","Shivani",""],["Tiwari","Simran",""],["Rensink","T. C.",""],["Eskander","Ramy",""],["Salloum","Wael",""]]}
{"id":"2308.03361","submitter":"Hao Zhang","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, J. Bloms, A. Bortone, I. Boyko,\n  R. A. Briere, A. Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N.\n  Cao, S. A. Cetin, J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G.\n  Chelkov, C. Chen, Chao Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S.\n  M. Chen, T. Chen, X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen,\n  W. S. Cheng, S. K. Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J.\n  Cui, H. L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y.\n  Deng, A. Denig, I. Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding,\n  Y. Ding, Y. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, 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, X. T. H., T. T. Han, W. Y. Han, X.\n  Q. Hao, F. A. Harris, K. K. He, K. L. He, F. H. H. Heinsius, C. H. Heinz, Y.\n  K. Heng, C. Herold, T. Holtmann, P. C. Hong, G. Y. 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, M. Irshad, J.\n  Jackson, S. Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q. P. Ji, X. B. Ji, X. L.\n  Ji, Y. Y. Ji, X. Q. Jia, Z. K. Jia, P. C. Jiang, S. S. Jiang, T. J. Jiang, X.\n  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, L.\n  Koch, O. B. Kolcu, B. Kopf, M. K. Kuessner, A. Kupsc, W. K\\\"uhn, J. J. Lane,\n  J. S. Lange, P. Larin, A. Lavania, L. Lavezzi, T. T. Lei, Z. H. Lei, H.\n  Leithoff, M. Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, Cheng Li, D. M. Li,\n  F. Li, G. Li, H. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J. S.\n  Li, J. W. Li, K. L. Li, Ke Li, L. J Li, L. K. Li, Lei Li, M. H. Li, P. R. Li,\n  Q. X. Li, S. X. Li, T. Li, W. D. Li, W. G. Li, X. H. Li, X. L. Li, Xiaoyu Li,\n  Y. G. Li, Z. J. Li, Z. X. Li, C. Liang, H. Liang, H. Liang, H. Liang, Y. F.\n  Liang, Y. T. Liang, G. R. Liao, L. Z. Liao, J. Libby, A. Limphirat, D. X.\n  Lin, T. Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, D. Liu, F. H. Liu, Fang\n  Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huanhuan Liu, Huihui\n  Liu, J. B. Liu, J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L.\n  C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu,\n  W. M. Liu, X. Liu, Y. Liu, Y. Liu, Y. B. Liu, Z. A. Liu, Z. Q. Liu, X. C.\n  Lou, F. X. Lu, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P. Lu, Z. H. Lu, C. L.\n  Luo, M. X. Luo, T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu, F. C. Ma, H. L. Ma,\n  J. L. Ma, L. L. Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T. Ma, X. Y. Ma, Y. Ma,\n  Y. M. Ma, F. E. Maas, M. Maggiora, S. Malde, A. Mangoni, Y. J. Mao, Z. P.\n  Mao, S. Marcello, Z. X. Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J.\n  Min, 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, 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. W. 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, Q. N. Xu, W. Xu, W. L. Xu, X. P. Xu, Y. C. Xu, Z. P. Xu, Z. S.\n  Xu, F. Yan, L. Yan, W. B. Yan, W. C. Yan, X. Q Yan, H. J. Yang, H. L. Yang,\n  H. X. Yang, Tao Yang, Y. Yang, Y. F. Yang, Y. X. Yang, Yifan Yang, Z. W.\n  Yang, Z. P. Yao, M. Ye, M. H. Ye, J. H. Yin, Z. Y. You, B. X. Yu, C. X. Yu,\n  G. Yu, J. S. Yu, T. Yu, X. D. Yu, C. Z. Yuan, L. Yuan, S. C. Yuan, X. Q.\n  Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, A. A. Zafar, F. R. Zeng, X. Zeng, Y.\n  Zeng, Y. J. Zeng, X. Y. Zhai, Y. C. Zhai, Y. H. Zhan, A. Q. Zhang, B. L.\n  Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, H. Zhang, H. H. Zhang, H. H.\n  Zhang, H. Q. Zhang, H. Y. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. W.\n  Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, Jiawei Zhang, L.\n  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. Zhang, Y. T. Zhang, Y. H. Zhang, Yan Zhang, Yao Zhang, Z. H. Zhang, Z. L.\n  Zhang, Z. Y. Zhang, Z. Y. Zhang, G. Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao,\n  Lei Zhao, Ling Zhao, M. G. Zhao, S. J. Zhao, Y. B. Zhao, Y. X. Zhao, Z. G.\n  Zhao, A. Zhemchugov, B. Zheng, J. P. Zheng, W. J. Zheng, Y. H. Zheng, B.\n  Zhong, X. Zhong, H. Zhou, L. P. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y.\n  Zhou, Y. Z. Zhou, J. Zhu, K. Zhu, K. J. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S.\n  Q. Zhu, T. J. Zhu, W. J. Zhu, Y. C. Zhu, Z. A. Zhu, J. H. Zou, J. Zu","title":"Measurement of the $e^+e^- \\to \\Lambda\\bar\\Sigma^0 + c.c.$ cross\n  sections at $\\sqrt{s}$ from 2.3094 to 3.0800 GeV","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Born cross sections and effective form factors of the process\n$e^+e^-\\to\\Lambda\\bar\\Sigma^0 + c.c.$ are measured at 14 center-of-mass energy\npoints from 2.3094 to 3.0800 GeV, based on data corresponding to an integrated\nluminosity of $(478.5 \\pm 4.8)\\ \\text{pb}^{-1}$ collected with the BESIII\ndetector. A non-zero Born cross section is observed at the center-of-mass\nenergy of 2.3094 GeV with a statistical significance of more than five standard\ndeviations, and the cross sections at other energies are obtained with improved\nprecision compared to earlier measurements from the BaBar Collaboration. The\nBorn cross-section lineshape is described better by a shape with a plateau near\nthe threshold than by a pQCD motivated functional form.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:31:51 GMT"}],"update_date":"2023-08-08","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.",""],["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","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.",""],["H.","X. T.",""],["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","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","X. Q.",""],["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. K.",""],["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","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.",""],["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.",""],["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.",""],["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","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. W.",""],["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","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","X. Y.",""],["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.03362","submitter":"Seongyeon Kim","authors":"Seongyeon Kim, Sunghwan Moon, Ihyeok Seo","title":"Reconstruction of the initial data from the solutions of damped wave\n  equations","comments":"10 pages","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 two types of damped wave equations: the weakly\ndamped equation and the strongly damped equation and show that the initial\nvelocity from the solution on the unit sphere. This inverse problem is related\nto Photoacoustic Tomography (PAT), a hybrid medical imaging technique. PAT is\nbased on generating acoustic waves inside of an object of interest and one of\nthe mathematical problem in PAT is reconstructing the initial velocity from the\nsolution of the wave equation measured on the outside of object. Using the\nspherical harmonics and spectral theorem, we demonstrate a way to recover the\ninitial velocity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:33:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kim","Seongyeon",""],["Moon","Sunghwan",""],["Seo","Ihyeok",""]]}
{"id":"2308.03363","submitter":"Shashank Kotyan","authors":"Shashank Kotyan","title":"A reading survey on adversarial machine learning: Adversarial attacks\n  and their understanding","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":"  Deep Learning has empowered us to train neural networks for complex data with\nhigh performance. However, with the growing research, several vulnerabilities\nin neural networks have been exposed. A particular branch of research,\nAdversarial Machine Learning, exploits and understands some of the\nvulnerabilities that cause the neural networks to misclassify for near original\ninput. A class of algorithms called adversarial attacks is proposed to make the\nneural networks misclassify for various tasks in different domains. With the\nextensive and growing research in adversarial attacks, it is crucial to\nunderstand the classification of adversarial attacks. This will help us\nunderstand the vulnerabilities in a systematic order and help us to mitigate\nthe effects of adversarial attacks. This article provides a survey of existing\nadversarial attacks and their understanding based on different perspectives. We\nalso provide a brief overview of existing adversarial defences and their\nlimitations in mitigating the effect of adversarial attacks. Further, we\nconclude with a discussion on the future research directions in the field of\nadversarial machine learning.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:37:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kotyan","Shashank",""]]}
{"id":"2308.03364","submitter":"Zheng Chen","authors":"Zheng Chen, Yulun Zhang, Jinjin Gu, Linghe Kong, Xiaokang Yang, Fisher\n  Yu","title":"Dual Aggregation Transformer for Image Super-Resolution","comments":"Accepted to ICCV 2023. Code is available at\n  https://github.com/zhengchen1999/DAT","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformer has recently gained considerable popularity in low-level vision\ntasks, including image super-resolution (SR). These networks utilize\nself-attention along different dimensions, spatial or channel, and achieve\nimpressive performance. This inspires us to combine the two dimensions in\nTransformer for a more powerful representation capability. Based on the above\nidea, we propose a novel Transformer model, Dual Aggregation Transformer (DAT),\nfor image SR. Our DAT aggregates features across spatial and channel\ndimensions, in the inter-block and intra-block dual manner. Specifically, we\nalternately apply spatial and channel self-attention in consecutive Transformer\nblocks. The alternate strategy enables DAT to capture the global context and\nrealize inter-block feature aggregation. Furthermore, we propose the adaptive\ninteraction module (AIM) and the spatial-gate feed-forward network (SGFN) to\nachieve intra-block feature aggregation. AIM complements two self-attention\nmechanisms from corresponding dimensions. Meanwhile, SGFN introduces additional\nnon-linear spatial information in the feed-forward network. Extensive\nexperiments show that our DAT surpasses current methods. Code and models are\nobtainable at https://github.com/zhengchen1999/DAT.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:39:39 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 05:21:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Zheng",""],["Zhang","Yulun",""],["Gu","Jinjin",""],["Kong","Linghe",""],["Yang","Xiaokang",""],["Yu","Fisher",""]]}
{"id":"2308.03365","submitter":"Shijue Huang","authors":"Shijue Huang, Bingbing Wang, Libo Qin, Qin Zhao and Ruifeng Xu","title":"Improving Few-shot and Zero-shot Entity Linking with Coarse-to-Fine\n  Lexicon-based Retriever","comments":"Accepted to NLPCC2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Few-shot and zero-shot entity linking focus on the tail and emerging\nentities, which are more challenging but closer to real-world scenarios. The\nmainstream method is the ''retrieve and rerank'' two-stage framework. In this\npaper, we propose a coarse-to-fine lexicon-based retriever to retrieve entity\ncandidates in an effective manner, which operates in two layers. The first\nlayer retrieves coarse-grained candidates by leveraging entity names, while the\nsecond layer narrows down the search to fine-grained candidates within the\ncoarse-grained ones. In addition, this second layer utilizes entity\ndescriptions to effectively disambiguate tail or new entities that share names\nwith existing popular entities. Experimental results indicate that our approach\ncan obtain superior performance without requiring extensive finetuning in the\nretrieval stage. Notably, our approach ranks the 1st in NLPCC 2023 Shared Task\n6 on Chinese Few-shot and Zero-shot Entity Linking.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:39:43 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 07:02:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Shijue",""],["Wang","Bingbing",""],["Qin","Libo",""],["Zhao","Qin",""],["Xu","Ruifeng",""]]}
{"id":"2308.03366","submitter":"Qiuling Xu","authors":"Qiuling Xu, Pannaga Shivaswamy and Xiangyu Zhang","title":"POSIT: Promotion of Semantic Item Tail via Adversarial Learning","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In many recommender problems, a handful of popular items (e.g. movies/TV\nshows, news etc.) can be dominant in recommendations for many users. However,\nwe know that in a large catalog of items, users are likely interested in more\nthan what is popular. The dominance of popular items may mean that users will\nnot see items they would likely enjoy. In this paper, we propose a technique to\novercome this problem using adversarial machine learning. We define a metric to\ntranslate user-level utility metric in terms of an advantage/disadvantage over\nitems. We subsequently use that metric in an adversarial learning framework to\nsystematically promote disadvantaged items. The resulting algorithm identifies\nsemantically meaningful items that get promoted in the learning algorithm. In\nthe empirical study, we evaluate the proposed technique on three publicly\navailable datasets and four competitive baselines. The result shows that our\nproposed method not only improves the coverage, but also, surprisingly,\nimproves the overall performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:41:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Qiuling",""],["Shivaswamy","Pannaga",""],["Zhang","Xiangyu",""]]}
{"id":"2308.03367","submitter":"Christos Saroglou Dr","authors":"K\\'aroly J. B\\\"or\\\"oczky, Christos Saroglou","title":"Uniqueness when the $L_p$ curvature is close to be a constant for\n  $p\\in[0,1)$","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.AP math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For fixed positive integer $n$, $p\\in[0,1]$, $a\\in(0,1)$, we prove that if a\nfunction $g:\\mathbb{S}^{n-1}\\to \\mathbb{R}$ is sufficiently close to 1, in the\n$C^a$ sense, then there exists a unique convex body $K$ whose $L_p$ curvature\nfunction equals $g$. This was previously established for $n=3$, $p=0$ by Chen,\nFeng, Liu \\cite{CFL22} and in the symmetric case by Chen, Huang, Li, Liu\n\\cite{CHLL20}. Related, we show that if $p=0$ and $n=4$ or $n\\leq 3$ and\n$p\\in[0,1)$, and the $L_p$ curvature function $g$ of a (sufficiently regular,\ncontaining the origin) convex body $K$ satisfies $\\lambda^{-1}\\leq g\\leq\n\\lambda$, for some $\\lambda>1$, then $\\max_{x\\in\\mathbb{S}^{n-1}}h_K(x)\\leq\nC(p,\\lambda)$, for some constant $C(p,\\lambda)>0$ that depends only on $p$ and\n$\\lambda$. This also extends a result from Chen, Feng, Liu \\cite{CFL22}. Along\nthe way, we obtain a result, that might be of independent interest, concerning\nthe question of when the support of the $L_p$ surface area measure is lower\ndimensional. Finally, we establish a strong non-uniqueness result for the\n$L_p$-Minkowksi problem, for $-n<p<0$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:41:42 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 12:33:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["B\u00f6r\u00f6czky","K\u00e1roly J.",""],["Saroglou","Christos",""]]}
{"id":"2308.03368","submitter":"Christian Maire","authors":"Donghyeok Lim (EWHA), Christian Maire (FEMTO-ST)","title":"On the analyticity of the maximal extension of a number field with\n  prescribed ramification and splitting","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 all the $p$-adic analytic groups that are realizable as Galois\ngroups of the maximal pro-$p$ extensions of number fields with prescribed\nramification and splitting under an assumption which allows us to move away\nfrom the Tame Fontaine-Mazur conjecture.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:43:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lim","Donghyeok","","EWHA"],["Maire","Christian","","FEMTO-ST"]]}
{"id":"2308.03369","submitter":"Clement Benard","authors":"Cl\\'ement B\\'enard, Julie Josse (PREMEDICAL)","title":"Variable importance for causal forests: breaking down the heterogeneity\n  of treatment effects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Causal random forests provide efficient estimates of heterogeneous treatment\neffects. However, forest algorithms are also well-known for their black-box\nnature, and therefore, do not characterize how input variables are involved in\ntreatment effect heterogeneity, which is a strong practical limitation. In this\narticle, we develop a new importance variable algorithm for causal forests, to\nquantify the impact of each input on the heterogeneity of treatment effects.\nThe proposed approach is inspired from the drop and relearn principle, widely\nused for regression problems. Importantly, we show how to handle the forest\nretrain without a confounding variable. If the confounder is not involved in\nthe treatment effect heterogeneity, the local centering step enforces\nconsistency of the importance measure. Otherwise, when a confounder also\nimpacts heterogeneity, we introduce a corrective term in the retrained causal\nforest to recover consistency. Additionally, experiments on simulated,\nsemi-synthetic, and real data show the good performance of our importance\nmeasure, which outperforms competitors on several test cases. Experiments also\nshow that our approach can be efficiently extended to groups of variables,\nproviding key insights in practice.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:43:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["B\u00e9nard","Cl\u00e9ment","","PREMEDICAL"],["Josse","Julie","","PREMEDICAL"]]}
{"id":"2308.03370","submitter":"Victor Montenegro","authors":"Yaoling Yang, Victor Montenegro, Abolfazl Bayat","title":"Extractable Information Capacity in Sequential Measurements Metrology","comments":"4 pages main text, 5 pages Supplemental Material. Feedback is\n  welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The conventional formulation of quantum sensing is based on the assumption\nthat the probe is reset to its initial state after each measurement. In a very\ndistinct approach, one can also pursue a sequential measurement scheme in which\ntime-consuming resetting is avoided. In this situation, every measurement\noutcome effectively comes from a different probe, yet correlated with other\ndata samples. Finding a proper description for the precision of sequential\nmeasurement sensing is very challenging as it requires the analysis of long\nsequences with exponentially large outcomes. Here, we develop a recursive\nformula and an efficient Monte-Carlo approach to calculate the Fisher\ninformation, as a figure of merit for sensing precision, for arbitrary lengths\nof sequential measurements. Our results show that Fisher information initially\nscales non-linearly with the number of measurements and then asymptotically\nsaturates to linear scaling. Such transition, which fundamentally constrains\nthe extractable information about the parameter of interest, is directly linked\nto the finite memory of the probe when undergoes multiple sequential\nmeasurements. Based on these, we establish a figure of merit to determine the\noptimal measurement sequence length and exemplify our results in three\ndifferent physical systems.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:48:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Yaoling",""],["Montenegro","Victor",""],["Bayat","Abolfazl",""]]}
{"id":"2308.03371","submitter":"Nicola Soave","authors":"Francesco Esposito, Berardino Sciunzi and Nicola Soave","title":"Notes on Overdetermined Singular Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain some rigidity results for overdetermined boundary value problems\nfor singular solutions in bounded domains.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:49:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Esposito","Francesco",""],["Sciunzi","Berardino",""],["Soave","Nicola",""]]}
{"id":"2308.03372","submitter":"Gionnieve Lim","authors":"Gionnieve Lim, Simon T. Perrault","title":"XAI in Automated Fact-Checking? The Benefits Are Modest And There's No\n  One-Explanation-Fits-All","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fact-checking is a popular countermeasure against misinformation but the\nmassive volume of information online has spurred active research in the\nautomation of the task. Like expert fact-checking, it is not enough for an\nautomated fact-checker to just be accurate, but also be able to inform and\nconvince the user of the validity of its prediction. This becomes viable with\nexplainable artificial intelligence (XAI). In this work, we conduct a study of\nXAI fact-checkers involving 180 participants to determine how users' actions\ntowards news and their attitudes towards explanations are affected by the XAI.\nOur results suggest that XAI has limited effects on users' agreement with the\nveracity prediction of the automated fact-checker and on their intents to share\nnews. However, XAI does nudge them towards forming uniform judgments of news\nveracity, thereby signaling a reliance on the explanations. We also found\npolarizing preferences towards XAI, raising several design considerations on\nthese.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:49:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lim","Gionnieve",""],["Perrault","Simon T.",""]]}
{"id":"2308.03373","submitter":"Elena Masciadri Dr.","authors":"Elena Masciadri, Alessio Turchi, Luca Fini","title":"Towards operational optical turbulence forecast systems at different\n  scales","comments":"4 figures, 1 table, SPIE, 2022, Vol. 12185, id. 121851Q, doi:\n  10.1117/12.2629287","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The forecast on a time scale of 1 or 2 hours is crucial for all kind of new\ngeneration facilities (ELTs) instrumentation supported by the adaptive optics\nthat will be mainly operated in Service Mode. In a recent study (Masciadri et\nal. 2020) we have showed that we can forecast the seeing and atmospheric\nparameters at such short time scales using an autoregressive method achieving\nunprecedented model accuracies with a substantial gain with respect to\nforecasts performed the day before (i.e. on longer time scales) obtained with\nan atmospheric mesoscale model. Equally we showed a gain with respect to the\nmethod by persistence using simply real-time measurements in situ on the same\nshort time scale (1-2 hours). The auto-regressive method makes use of the\nforecasts done with mesoscale atmospheric models and real-time measurements and\nsince 2019 has been implemented in the operational forecast system ALTA Center\nsupporting LBT observations. In this contribution we apply the same approach to\nthe VLT site extending the method to all the main astroclimatic parameters i.e.\nthe seeing, the wavefront coherence time, the isoplanatic angle and the ground\nlayer fraction. We prove that such a method offers unprecedented forecast\naccuracies for all the astroclimatic parameters with clear gains with respect\nto the prediction by persistence. Preliminary calculations indicate also better\naccuracies than those obtained with the machine learning based approach using\nin situ measurements. We will apply soon such a method in an operational\nforecast system that we conceived for the VLT.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:53:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Masciadri","Elena",""],["Turchi","Alessio",""],["Fini","Luca",""]]}
{"id":"2308.03374","submitter":"Jiahua Dong","authors":"Jiahua Dong, Wenqi Liang, Yang Cong, Gan Sun","title":"Heterogeneous Forgetting Compensation for Class-Incremental Learning","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":"  Class-incremental learning (CIL) has achieved remarkable successes in\nlearning new classes consecutively while overcoming catastrophic forgetting on\nold categories. However, most existing CIL methods unreasonably assume that all\nold categories have the same forgetting pace, and neglect negative influence of\nforgetting heterogeneity among different old classes on forgetting\ncompensation. To surmount the above challenges, we develop a novel\nHeterogeneous Forgetting Compensation (HFC) model, which can resolve\nheterogeneous forgetting of easy-to-forget and hard-to-forget old categories\nfrom both representation and gradient aspects. Specifically, we design a\ntask-semantic aggregation block to alleviate heterogeneous forgetting from\nrepresentation aspect. It aggregates local category information within each\ntask to learn task-shared global representations. Moreover, we develop two\nnovel plug-and-play losses: a gradient-balanced forgetting compensation loss\nand a gradient-balanced relation distillation loss to alleviate forgetting from\ngradient aspect. They consider gradient-balanced compensation to rectify\nforgetting heterogeneity of old categories and heterogeneous relation\nconsistency. Experiments on several representative datasets illustrate\neffectiveness of our HFC model. The code is available at\nhttps://github.com/JiahuaDong/HFC.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:53:39 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 01:43:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dong","Jiahua",""],["Liang","Wenqi",""],["Cong","Yang",""],["Sun","Gan",""]]}
{"id":"2308.03375","submitter":"Maximilian Neidhardt","authors":"M. Neidhardt, S. Gerlach F. N. Schmidt, I. A. K. Fiedler, S. Grube, B.\n  Busse, and A. Schlaefer","title":"VR-based body tracking to stimulate musculoskeletal training","comments":"Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Training helps to maintain and improve sufficient muscle function, body\ncontrol, and body coordination. These are important to reduce the risk of\nfracture incidents caused by falls, especially for the elderly or people\nrecovering from injury. Virtual reality training can offer a cost-effective and\nindividualized training experience. We present an application for the HoloLens\n2 to enable musculoskeletal training for elderly and impaired persons to allow\nfor autonomous training and automatic progress evaluation. We designed a\nvirtual downhill skiing scenario that is controlled by body movement to\nstimulate balance and body control. By adapting the parameters of the ski\nslope, we can tailor the intensity of the training to individual users. In this\nwork, we evaluate whether the movement data of the HoloLens 2 alone is\nsufficient to control and predict body movement and joint angles during\nmusculoskeletal training. We record the movements of 10 healthy volunteers with\nexternal tracking cameras and track a set of body and joint angles of the\nparticipant during training. We estimate correlation coefficients and\nsystematically analyze whether whole body movement can be derived from the\nmovement data of the HoloLens 2. No participant reports movement sickness\neffects and all were able to quickly interact and control their movement during\nskiing. Our results show a high correlation between HoloLens 2 movement data\nand the external tracking of the upper body movement and joint angles of the\nlower limbs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:54:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Neidhardt","M.",""],["Schmidt","S. Gerlach F. N.",""],["Fiedler","I. A. K.",""],["Grube","S.",""],["Busse","B.",""],["Schlaefer","A.",""]]}
{"id":"2308.03376","submitter":"Olivier Spanjaard","authors":"Hugo Gilbert (LAMSADE), Mohamed Ouaguenouni, Meltem Ozturk (LAMSADE),\n  Olivier Spanjaard","title":"Robust Ordinal Regression for Subsets Comparisons with Interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is dedicated to a robust ordinal method for learning the\npreferences of a decision maker between subsets. The decision model, derived\nfrom Fishburn and LaValle (1996) and whose parameters we learn, is general\nenough to be compatible with any strict weak order on subsets, thanks to the\nconsideration of possible interactions between elements. Moreover, we accept\nnot to predict some preferences if the available preference data are not\ncompatible with a reliable prediction. A predicted preference is considered\nreliable if all the simplest models (Occam's razor) explaining the preference\ndata agree on it. Following the robust ordinal regression methodology, our\npredictions are based on an uncertainty set encompassing the possible values of\nthe model parameters. We define a robust ordinal dominance relation between\nsubsets and we design a procedure to determine whether this dominance relation\nholds. Numerical tests are provided on synthetic and real-world data to\nevaluate the richness and reliability of the preference predictions made.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:54:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gilbert","Hugo","","LAMSADE"],["Ouaguenouni","Mohamed","","LAMSADE"],["Ozturk","Meltem","","LAMSADE"],["Spanjaard","Olivier",""]]}
{"id":"2308.03377","submitter":"Moyu Zhang","authors":"Moyu Zhang, Xinning Zhu, Chunhong Zhang, Wenchen Qian, Feng Pan, Hui\n  Zhao","title":"Counterfactual Monotonic Knowledge Tracing for Assessing Students'\n  Dynamic Mastery of Knowledge Concepts","comments":"Accepted by CIKM 2023, 10 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the core of the Knowledge Tracking (KT) task, assessing students' dynamic\nmastery of knowledge concepts is crucial for both offline teaching and online\neducational applications. Since students' mastery of knowledge concepts is\noften unlabeled, existing KT methods rely on the implicit paradigm of\nhistorical practice to mastery of knowledge concepts to students' responses to\npractices to address the challenge of unlabeled concept mastery. However,\npurely predicting student responses without imposing specific constraints on\nhidden concept mastery values does not guarantee the accuracy of these\nintermediate values as concept mastery values. To address this issue, we\npropose a principled approach called Counterfactual Monotonic Knowledge Tracing\n(CMKT), which builds on the implicit paradigm described above by using a\ncounterfactual assumption to constrain the evolution of students' mastery of\nknowledge concepts.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:57:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Moyu",""],["Zhu","Xinning",""],["Zhang","Chunhong",""],["Qian","Wenchen",""],["Pan","Feng",""],["Zhao","Hui",""]]}
{"id":"2308.03378","submitter":"Davide Torlo","authors":"Francesco Romor, Davide Torlo, Gianluigi Rozza","title":"Friedrichs' systems discretized with the Discontinuous Galerkin method:\n  domain decomposable model order reduction and Graph Neural Networks\n  approximating vanishing viscosity solutions","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":"  Friedrichs' systems (FS) are symmetric positive linear systems of first-order\npartial differential equations (PDEs), which provide a unified framework for\ndescribing various elliptic, parabolic and hyperbolic semi-linear PDEs such as\nthe linearized Euler equations of gas dynamics, the equations of compressible\nlinear elasticity and the Dirac-Klein-Gordon system. FS were studied to\napproximate PDEs of mixed elliptic and hyperbolic type in the same domain. For\nthis and other reasons, the versatility of the discontinuous Galerkin method\n(DGM) represents the best approximation space for FS. We implement a\ndistributed memory solver for stationary FS in deal.II. Our focus is model\norder reduction. Since FS model hyperbolic PDEs, they often suffer from a slow\nKolmogorov n-width decay. We develop two approaches to tackle this problem. The\nfirst is domain decomposable reduced-order models (DD-ROMs). We will show that\nthe DGM offers a natural formulation of DD-ROMs, in particular regarding\ninterface penalties, compared to the continuous finite element method. We also\ndevelop new repartitioning strategies to obtain more efficient local\napproximations of the solution manifold. The second approach involves graph\nneural networks used to infer the limit of a succession of projection-based\nlinear ROMs corresponding to lower viscosity constants: the heuristic behind is\nto develop a multi-fidelity super-resolution paradigm to mimic the mathematical\nconvergence to vanishing viscosity solutions while exploiting to the most\ninterpretable and certified projection-based ROMs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:57:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Romor","Francesco",""],["Torlo","Davide",""],["Rozza","Gianluigi",""]]}
{"id":"2308.03379","submitter":"Maria Di Mascolo","authors":"M. Thenarasu, K. Rameshkumar, M. Di Mascolo (G-SCOP\\_DOME2S), S.P.\n  Anbuudayasankar","title":"Multi-criteria scheduling of realistic flexible job shop: a novel\n  approach for integrating simulation modelling and multi-criteria decision\n  making","comments":null,"journal-ref":"International Journal of Production Research, 2023, pp.1-23","doi":"10.1080/00207543.2023.2238084","report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Increased flexibility in job shops leads to more complexity in\ndecision-making for shop floor engineers. Partial Flexible Job Shop Scheduling\n(PFJSS) is a subset of Job shop problems and has substantial application in the\nreal world. Priority Dispatching Rules (PDRs) are simple and easy to implement\nfor making quick decisions in real-time. The present study proposes a novel\nmethod of integrating Multi-Criteria Decision Making (MCDM) methods and the\nDiscrete Event Simulation (DES) Model to define job priorities in large-scale\nproblems involving multiple criteria. DES approach is employed to model the\nPFJSS to evaluate Makespan, Flow Time, and Tardiness-based measures considering\nstatic and dynamic job arrivals. The proposed approach is implemented in a\nbenchmark problem and large-scale PFJSS. The integration of MCDM methods and\nsimulation models offers the flexibility to choose the parameters that need to\ngovern the ranking of jobs. The solution given by the proposed methods is\ntested with the best-performing Composite Dispatching Rules (CDR), combining\nseveral PDR, which are available in the literature. Proposed MCDM approaches\nperform well for Makespan, Flow Time, and Tardiness-based measures for\nlarge-scale real-world problems. The proposed methodology integrated with the\nDES model is easy to implement in a real-time shop floor environment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:58:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Thenarasu","M.","","G-SCOP\\_DOME2S"],["Rameshkumar","K.","","G-SCOP\\_DOME2S"],["Di Mascolo","M.","","G-SCOP\\_DOME2S"],["Anbuudayasankar","S. P.",""]]}
{"id":"2308.03380","submitter":"Yu. M. Zinoviev","authors":"Yu. M. Zinoviev","title":"On hypersymmetry in three dimensioons","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we presented a number of explicit examples for the cubic\nvertices describing an interaction of massless spin-5/2 field with massive\nboson and fermion including all hypertransformations necessary for the vertices\nto be gauge invariant. Here we restrict ourselves with the massive bosons with\nspins s=2,1,0 and massive fermions with spins s=3/2,1/2. Our general analysis\npredicted that the vertex must exist for any boson and fermion with the spin\ndifference 3/2 or 1/2. And indeed it appeared that the vertex exists for all\nsix possible pairs (2,1,0) X (3/2,1/2). As in the case of massive\nsupermultiplets, our construction is based on the gauge invariant description\nfor the massive fields with spins s >= 1. Moreover, we have explicitly checked\nthat all the vertices are invariant also under the gauge symmetries of these\nmassive fields.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:59:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zinoviev","Yu. M.",""]]}
{"id":"2308.03381","submitter":"Risheng Liu","authors":"Yingchi Liu, Zhu Liu, Long Ma, Jinyuan Liu, Xin Fan, Zhongxuan Luo,\n  Risheng Liu","title":"Bilevel Generative Learning for Low-Light Vision","comments":"Accepted by ACM MM'2023, The code will be available at\n  https://github.com/Yingchi1998/BGL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, there has been a growing interest in constructing deep learning\nschemes for Low-Light Vision (LLV). Existing techniques primarily focus on\ndesigning task-specific and data-dependent vision models on the standard RGB\ndomain, which inherently contain latent data associations. In this study, we\npropose a generic low-light vision solution by introducing a generative block\nto convert data from the RAW to the RGB domain. This novel approach connects\ndiverse vision problems by explicitly depicting data generation, which is the\nfirst in the field. To precisely characterize the latent correspondence between\nthe generative procedure and the vision task, we establish a bilevel model with\nthe parameters of the generative block defined as the upper level and the\nparameters of the vision task defined as the lower level. We further develop\ntwo types of learning strategies targeting different goals, namely low cost and\nhigh accuracy, to acquire a new bilevel generative learning paradigm. The\ngenerative blocks embrace a strong generalization ability in other low-light\nvision tasks through the bilevel optimization on enhancement tasks. Extensive\nexperimental evaluations on three representative low-light vision tasks, namely\nenhancement, detection, and segmentation, fully demonstrate the superiority of\nour proposed approach. The code will be available at\nhttps://github.com/Yingchi1998/BGL.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:59:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Yingchi",""],["Liu","Zhu",""],["Ma","Long",""],["Liu","Jinyuan",""],["Fan","Xin",""],["Luo","Zhongxuan",""],["Liu","Risheng",""]]}
{"id":"2308.03382","submitter":"Qian Huang","authors":"Junzhou Chen, Qian Huang, Yulin Chen, Linyi Qian, Chengyuan Yu","title":"Enhancing Nucleus Segmentation with HARU-Net: A Hybrid Attention Based\n  Residual U-Blocks Network","comments":"Nucleus segmentation, Deep learning, Instance segmentation, Medical\n  imaging, Dual-Branch network","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":"  Nucleus image segmentation is a crucial step in the analysis, pathological\ndiagnosis, and classification, which heavily relies on the quality of nucleus\nsegmentation. However, the complexity of issues such as variations in nucleus\nsize, blurred nucleus contours, uneven staining, cell clustering, and\noverlapping cells poses significant challenges. Current methods for nucleus\nsegmentation primarily rely on nuclear morphology or contour-based approaches.\nNuclear morphology-based methods exhibit limited generalization ability and\nstruggle to effectively predict irregular-shaped nuclei, while contour-based\nextraction methods face challenges in accurately segmenting overlapping nuclei.\nTo address the aforementioned issues, we propose a dual-branch network using\nhybrid attention based residual U-blocks for nucleus instance segmentation. The\nnetwork simultaneously predicts target information and target contours.\nAdditionally, we introduce a post-processing method that combines the target\ninformation and target contours to distinguish overlapping nuclei and generate\nan instance segmentation image. Within the network, we propose a context fusion\nblock (CF-block) that effectively extracts and merges contextual information\nfrom the network. Extensive quantitative evaluations are conducted to assess\nthe performance of our method. Experimental results demonstrate the superior\nperformance of the proposed method compared to state-of-the-art approaches on\nthe BNS, MoNuSeg, CoNSeg, and CPM-17 datasets.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:03:20 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 07:38:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Junzhou",""],["Huang","Qian",""],["Chen","Yulin",""],["Qian","Linyi",""],["Yu","Chengyuan",""]]}
{"id":"2308.03383","submitter":"Chengzhao Shan","authors":"Chengzhao Shan, Jiayan Zhang, Yongkui Ma, Xuejun Sha, Honglin Zhao,\n  Jiankang Zhang, Lajos Hanzo","title":"Energy-efficient Time-modulated Beam-forming for Joint\n  Communication-Radar Systems","comments":"14 pages, 9 figures, Journal","journal-ref":null,"doi":"10.1109/TGCN.2023.3302899","report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To alleviate the shortage of spectral resources as well as to reduce the\nweight, volume, and power consumption of wireless systems, joint\ncommunication-radar (JCR) systems have become a focus of interest in both civil\nand military fields. JCR systems based on time-modulated arrays (TMAs)\nconstitute an attractive solution as a benefit of their high degree of beam\nsteering freedom, low cost, and high accuracy. However, their sideband\nradiation results in energy loss, which is an inherent drawback. Hence the\nenergy-efficiency optimization of TMA-based JCR systems is of salient\nimportance, but most of the existing TMA energy-efficiency optimization methods\ndo not apply to JCR systems. To circumvent their problems, a single-sideband\nstructure is designed for flexibly reconfigurable energy-efficient TMA beam\nsteering. First, some preliminaries on single-sideband TMAs are introduced.\nThen, a closed-form expression is derived for characterizing the energy\nefficiency. Finally, the theoretical results are validated by simulations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:05:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shan","Chengzhao",""],["Zhang","Jiayan",""],["Ma","Yongkui",""],["Sha","Xuejun",""],["Zhao","Honglin",""],["Zhang","Jiankang",""],["Hanzo","Lajos",""]]}
{"id":"2308.03384","submitter":"Sergey Troshin","authors":"S.M. Troshin, N.E. Tyurin","title":"Cumulative activity of inelastic events under hadron collisions","comments":"10 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce the notion of cumulative activity for inelastic events generated\nunder hadron collisions, discuss its energy dependence and connection with the\nreflective scattering mode. These issues\n  are relevant for enlightening the asymptotic dynamics in view of the LHC\nmeasurements.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:07:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Troshin","S. M.",""],["Tyurin","N. E.",""]]}
{"id":"2308.03385","submitter":"Rahul Shome","authors":"Rahul Shome and Zachary Kingston and Lydia E. Kavraki","title":"Robots as AI Double Agents: Privacy in Motion Planning","comments":"To be published at at 2023 IEEE/RSJ International Conference on\n  Intelligent Robots and Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robotics and automation are poised to change the landscape of home and work\nin the near future. Robots are adept at deliberately moving, sensing, and\ninteracting with their environments. The pervasive use of this technology\npromises societal and economic payoffs due to its capabilities - conversely,\nthe capabilities of robots to move within and sense the world around them is\nsusceptible to abuse. Robots, unlike typical sensors, are inherently\nautonomous, active, and deliberate. Such automated agents can become AI double\nagents liable to violate the privacy of coworkers, privileged spaces, and other\nstakeholders. In this work we highlight the understudied and inevitable threats\nto privacy that can be posed by the autonomous, deliberate motions and sensing\nof robots. We frame the problem within broader sociotechnological questions\nalongside a comprehensive review. The privacy-aware motion planning problem is\nformulated in terms of cost functions that can be modified to induce\nprivacy-aware behavior - preserving, agnostic, or violating. Simulated case\nstudies in manipulation and navigation, with altered cost functions, are used\nto demonstrate how privacy-violating threats can be easily injected, sometimes\nwith only small changes in performance (solution path lengths). Such\nfunctionality is already widely available. This preliminary work is meant to\nlay the foundations for near-future, holistic, interdisciplinary investigations\nthat can address questions surrounding privacy in intelligent robotic behaviors\ndetermined by planning algorithms.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:07:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shome","Rahul",""],["Kingston","Zachary",""],["Kavraki","Lydia E.",""]]}
{"id":"2308.03386","submitter":"George Perrakis","authors":"George Perrakis, Anna C. Tasolamprou, George Kakavelakis, Konstantinos\n  Petridis, Michael Graetzel, George Kenanakis, Stelios Tzortzakis, Maria\n  Kafesaki","title":"Transparent Multispectral Photonic Electrode for All-Weather Stable and\n  Efficient Perovskite Solar Cells","comments":"20 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Perovskite solar cells (PSCs) are the most promising technology for advancing\ncurrent photovoltaic performance. However, the main challenge for their\npractical deployment and commercialization is their operational stability,\naffected by solar illumination and heating, as well as the electric field that\nis generated in the PV device by light exposure. Here, we propose a transparent\nmultispectral photonic electrode placed on top of the glass substrate of solar\ncells, which simultaneously reduces the device solar heating and enhances its\nefficiency. Specifically, the proposed photonic electrode, composed of a\nlow-resistivity metal and a conductive layer, simultaneously serves as a\nhighly-efficient infrared filter and an ultra-thin transparent front contact,\ndecreasing devices' solar heating and operating temperature. At the same time,\nit simultaneously serves as an anti-reflection coating, enhancing the\nefficiency. We additionally enhance the device cooling by coating the front\nglass substrate side with a visibly transparent film (PDMS), which maximizes\nsubstrate's thermal radiation. To determine the potential of our photonic\napproach and fully explore the cooling potential of PSCs, we first provide\nexperimental characterizations of the absorption properties (in both visible\nand infrared wavelengths) of state-of-the-art PSCs among the most promising\nones regarding the efficiency, stability, and cost. We then numerically show\nthat applying our approach to promising PSCs can result in lower operating\ntemperatures by over 9.0 oC and an absolute efficiency increase higher than\n1.3%. These results are insensitive to varying environmental conditions. Our\napproach is simple and only requires modification of the substrate; it\ntherefore points to a feasible photonic approach for advancing current\nphotovoltaic performance with next-generation solar cell materials.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:11:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Perrakis","George",""],["Tasolamprou","Anna C.",""],["Kakavelakis","George",""],["Petridis","Konstantinos",""],["Graetzel","Michael",""],["Kenanakis","George",""],["Tzortzakis","Stelios",""],["Kafesaki","Maria",""]]}
{"id":"2308.03387","submitter":"Zichao Xiao","authors":"Zichao Xiao, Rang Liu, Ming Li, and Qian Liu","title":"A Novel Joint Angle-Range-Velocity Estimation Method for MIMO-OFDM ISAC\n  Systems","comments":"13 pages, 9 figures, submitted to IEEE Trans","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Integrated sensing and communications (ISAC) is emerging as a key technique\nfor next-generation wireless systems. In order to enable ubiquitous mobile\nnetwork and widely deployed base stations with radar sensing functionality,\nusing standard multiple-input multiple-output (MIMO) orthogonal frequency\ndivision multiplexing (OFDM) transmitter architectures and waveforms to achieve\nboth satisfactory sensing and communication performance is a crucial task for\npractical implementations of ISAC. In this paper, we propose a novel joint\nangle-range-velocity estimation algorithm for the considered MIMO-OFDM ISAC\nsystem. The approach is based on classical MIMO-OFDM waveforms widely adopted\nin wireless communications. Specifically, the angle-range-velocity information\nof potential targets is jointly extracted by utilizing all the received echo\nsignals in a coherent processing interval (CPI). Therefore, the proposed joint\nestimation algorithm can achieve larger processing gains and higher resolution\nby fully exploiting echo signals and jointly estimating the\nangle-range-velocity information. Theoretical analysis for maximum unambiguous\nrange, resolution, and processing gains are provided to verify the advantages\nof the proposed joint estimation algorithm. Finally, extensive numerical\nexperiments are presented to demonstrate that the proposed estimation approach\ncan achieve significantly lower root-mean-square-error (RMSE) of\nangle/range/velocity estimation for both single-target and multi-target\nscenarios.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:15:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xiao","Zichao",""],["Liu","Rang",""],["Li","Ming",""],["Liu","Qian",""]]}
{"id":"2308.03388","submitter":"Joachim Arts","authors":"Joni Driessen and Joost de Kruijf and Joachim Arts and Geert-Jan van\n  Houtum","title":"Optimal Design of Lines Replaceable Units","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Line Replaceable Unit (LRU) is a collection of connected parts in a system\nthat is replaced when any part of the LRU fails. Companies use LRUs as a\nmechanism to reduce downtime of systems following a failure. The design of LRUs\ndetermines how fast a replacement is performed, so a smart design reduces\nreplacement and downtime cost. A firm must purchase/repair a LRU upon failure,\nand large LRUs are more expensive to purchase/repair. Hence, a firm seeks to\ndesign LRUs such that the average costs per time unit are minimized. We\nformalize this problem in a new model that captures how parts in a system are\nconnected, and how they are disassembled from the system. Our model optimizes\nthe design of LRUs such that the replacement (and downtime) costs and LRU\npurchase/repair costs are minimized. We present a set partitioning formulation\nfor which we prove a rare result: the optimal solution is integer, despite a\nnon--integral feasible polyhedron. Secondly, we formulate our problem as a\nbinary linear program. The paper concludes by numerically comparing the\ncomputation times of both formulations and illustrates the effects of various\nparameters on the model's outcome.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:16:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Driessen","Joni",""],["de Kruijf","Joost",""],["Arts","Joachim",""],["van Houtum","Geert-Jan",""]]}
{"id":"2308.03389","submitter":"Amaresh Jaiswal","authors":"Amaresh Jaiswal","title":"Quasiparticle Cosmology","comments":"5 pages, 1 figure, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider collective dynamics of the universe within a quasiparticle\napproach where the thermodynamics of a system is governed by the thermal mass\nof the constituents. The spacetime dependence of this thermal mass leads to a\nnegative contribution to the pressure and a positive contribution to the energy\ndensity, similar to the effect due to dark energy. We propose a mechanism based\non thermodynamic arguments to quantify this contribution from the zero point\nenergy of the system. For a sufficiently large spacetime variation of the\nthermal mass, the effective pressure can become negative and could mimic a dark\nenergy equation of state. We demonstrate an application of the proposed\nframework on QCD axion.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:18:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jaiswal","Amaresh",""]]}
{"id":"2308.03390","submitter":"Leon Pietschmann","authors":"Leon Pietschmann, Paul-David Zuercher, Erik Bub\\'ik, Zhutian Chen,\n  Hanspeter Pfister, Thomas Bohn\\'e","title":"Quantifying the Impact of XR Visual Guidance on User Performance Using a\n  Large-Scale Virtual Assembly Experiment","comments":"IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The combination of Visual Guidance and Extended Reality (XR) technology holds\nthe potential to greatly improve the performance of human workforces in\nnumerous areas, particularly industrial environments. Focusing on virtual\nassembly tasks and making use of different forms of supportive visualisations,\nthis study investigates the potential of XR Visual Guidance. Set in a web-based\nimmersive environment, our results draw from a heterogeneous pool of 199\nparticipants. This research is designed to significantly differ from previous\nexploratory studies, which yielded conflicting results on user performance and\nassociated human factors. Our results clearly show the advantages of XR Visual\nGuidance based on an over 50\\% reduction in task completion times and mistakes\nmade; this may further be enhanced and refined using specific frameworks and\nother forms of visualisations/Visual Guidance. Discussing the role of other\nfactors, such as cognitive load, motivation, and usability, this paper also\nseeks to provide concrete avenues for future research and practical takeaways\nfor practitioners.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:18:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pietschmann","Leon",""],["Zuercher","Paul-David",""],["Bub\u00edk","Erik",""],["Chen","Zhutian",""],["Pfister","Hanspeter",""],["Bohn\u00e9","Thomas",""]]}
{"id":"2308.03391","submitter":"Agustin Moreno","authors":"Cengiz Aydin, Urs Frauenfelder, Dayung Koh, Agustin Moreno","title":"Symplectic methods in space mission design","comments":"21 pages. To appear in the proceedings of the 2023 AAS/AIAA\n  Astrodynamics Specialist Conference, American Astronautical Society (AAS),\n  American Institute of Aeronautics and Astronautics (AIAA)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Using methods from symplectic geometry, the second and fourth authors have\nprovided theoretical groundwork and tools aimed at analyzing periodic orbits,\ntheir stability and their bifurcations in families, for the purpose of space\nmission design. The Broucke stability diagram was refined, and the \"Floer\nnumerical invariants\" where considered, as numbers which stay invariant before\nand after a bifurcation, and therefore serve as tests for the algorithms used,\nas well as being easy to implement. These tools were further employed for\nnumerical studies. In this article, we will further illustrate these methods\nwith numerical studies of families of orbits for the Jupiter-Europa system,\nwith emphasis on planar-to-spatial bifurcations, from deformation of the\nfamilies in Hill's lunar problem studied by the first author.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:20:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aydin","Cengiz",""],["Frauenfelder","Urs",""],["Koh","Dayung",""],["Moreno","Agustin",""]]}
{"id":"2308.03392","submitter":"Tirza Routtenberg","authors":"Morad Halihal and Tirza Routtenberg and H. Vincent Poor","title":"Estimation of Complex-Valued Laplacian Matrices for Topology\n  Identification in Power Systems","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","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the problem of estimating a complex-valued\nLaplacian matrix from a linear Gaussian model, with a focus on its application\nin the estimation of admittance matrices in power systems. The proposed\napproach is based on a constrained maximum likelihood estimator (CMLE) of the\ncomplex-valued Laplacian, which is formulated as an optimization problem with\nLaplacian and sparsity constraints. The complex-valued Laplacian is a\nsymmetric, non-Hermitian matrix that exhibits a joint sparsity pattern between\nits real and imaginary parts. Leveraging the l1 relaxation and the joint\nsparsity, we develop two estimation algorithms for the implementation of the\nCMLE. The first algorithm is based on casting the optimization problem as a\nsemi-definite programming (SDP) problem, while the second algorithm is based on\ndeveloping an efficient augmented Lagrangian method (ALM) solution. Next, we\napply the proposed SDP and ALM algorithms for the problem of estimating the\nadmittance matrix under three commonly-used measurement models, that stem from\nKirchhoff's and Ohm's laws, each with different assumptions and\nsimplifications: 1) the nonlinear alternating current (AC) model; 2) the\ndecoupled linear power flow (DLPF) model; and 3) the direct current (DC) model.\nThe performance of the SDP and the ALM algorithms is evaluated using data from\nthe IEEE 33-bus power system data under different settings. The numerical\nexperiments demonstrate that the proposed algorithms outperform existing\nmethods in terms of mean-squared-error (MSE) and F-score, thus, providing a\nmore accurate recovery of the admittance matrix.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:20:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Halihal","Morad",""],["Routtenberg","Tirza",""],["Poor","H. Vincent",""]]}
{"id":"2308.03393","submitter":"Michael Fucilla","authors":"Michael Fucilla","title":"Probing the high-energy dynamics of QCD: selected theoretical and\n  phenomenological studies","comments":"335 pages, 55 Figures, PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The center-of-mass energies available at modern accelerators, such as the\nLarge Hadron Collider (LHC), and at forthcoming generation accelerators, such\nas the Electron-Ion Collider (EIC), offer us a unique opportunity to\ninvestigate hadronic matter under the most extreme conditions ever reached. In\nparticular, we can access the Regge-Gribov regime of QCD, described by the\nBalitsky-Fadin-Kuraev-Lipatov (BFKL) approach along with its non-linear\ngeneralizations (the set of B-JIMWLK equations). The aim of these approaches is\nto resum large-energy logarithmic corrections which spoil the convergence of\nperturbative series at high-energy. The aforementioned approaches are\ntheoretically developed both in the leading (LL) and the next-to-leading (NLL)\napproximation, but precise full NLL predictions still remains an open\nchallenge. Furthermore, extending BFKL beyond the NLL approximation has been an\nopen problem for more than twenty years. We face the task of hunting precision\nin this field from different perspectives. In particular, within the BFKL\napproach, we calculate the next-to-leading order (NLO) impact factor for the\nHiggs boson production. This is the necessary ingredient to study the inclusive\nforward emissions of a Higgs boson in association with a backward identified\njet. Moreover, by using already known NLO impact factors, we propose a series\nof new semi-hard reactions that can be used to investigate BFKL dynamics at the\nLHC within NLL accuracy. We consider also the problem of extending BFKL beyond\nthe NLL approximation and compute one of the ingredients entering the BFKL\nkernel at the next-to-NLL (NNLL) accuracy. Finally, in the saturation\n(non-linear) framework, we calculate the diffractive double hadron photo- or\nelectroproduction cross sections with full NLL accuracy, useful to detect\nsaturation effects, at both the future EIC or already at LHC (via Ultra\nPeripheral Collisions).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:20:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fucilla","Michael",""]]}
{"id":"2308.03394","submitter":"Wenfei Liu","authors":"Chen Jiang, Wenfei Liu","title":"On numerically trivial automorphisms of compact hyperk\\\"ahler manifolds\n  of dimension 4","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 prove that the automorphism group of a compact hyperk\\\"ahler manifold of\ndimension 4 acts faithfully on the cohomology ring.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:21:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jiang","Chen",""],["Liu","Wenfei",""]]}
{"id":"2308.03395","submitter":"Carlo Ferrigno","authors":"Carlo Ferrigno, Antonino D'A\\`i, and Elena Ambrosi","title":"Energy-resolved pulse profiles of accreting pulsars: Diagnostic tools\n  for spectral features","comments":"Accepted for publication on A&A","journal-ref":null,"doi":"10.1051/0004-6361/202347062","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce a method for extracting spectral information from\nenergy-resolved light curves folded at the neutron star spin period (known as\npulse profiles) in accreting X-ray binaries. Spectra of these sources are\nsometimes characterized by features superimposed on a smooth continuum, such as\niron emission lines and cyclotron resonant scattering features. We address here\nthe question on how to derive quantitative constraints on such features from\nenergy-dependent changes in the pulse profiles. We developed a robust method\nfor determining in each energy-selected bin the value of the pulsed fraction\nusing the fast Fourier transform opportunely truncated at the number of\nharmonics needed to satisfactorily describe the actual profile. We determined\nthe uncertainty on this value by sampling through Monte Carlo simulations a\ntotal of 1000 faked profiles. We rebinned the energy-resolved pulse profiles to\nhave a constant minimum signal-to-noise ratio throughout the whole energy band.\nFinally we characterize the dependence of the energy-resolved pulsed fraction\nusing a phenomenological polynomial model and search for features corresponding\nto spectral signatures of iron emission or cyclotron lines using Gaussian line\nprofiles. We apply our method to a representative sample of NuSTAR observations\nof well-known accreting X-ray pulsars. We show that, with this method, it is\npossible to characterize the pulsed fraction spectra, and to constrain the\nposition and widths of such features with a precision comparable with the\nspectral results. We also explore how harmonic decomposition, correlation, and\nlag spectra might be used as additional probes for detection and\ncharacterization of such features.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:23:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ferrigno","Carlo",""],["D'A\u00ec","Antonino",""],["Ambrosi","Elena",""]]}
{"id":"2308.03396","submitter":"Francesco Romor","authors":"Francesco Romor, Giovanni Stabile, Gianluigi Rozza","title":"Explicable hyper-reduced order models on nonlinearly approximated\n  solution manifolds of compressible and incompressible Navier-Stokes equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A slow decaying Kolmogorov n-width of the solution manifold of a parametric\npartial differential equation precludes the realization of efficient linear\nprojection-based reduced-order models. This is due to the high dimensionality\nof the reduced space needed to approximate with sufficient accuracy the\nsolution manifold. To solve this problem, neural networks, in the form of\ndifferent architectures, have been employed to build accurate nonlinear\nregressions of the solution manifolds. However, the majority of the\nimplementations are non-intrusive black-box surrogate models, and only a part\nof them perform dimension reduction from the number of degrees of freedom of\nthe discretized parametric models to a latent dimension. We present a new\nintrusive and explicable methodology for reduced-order modelling that employs\nneural networks for solution manifold approximation but that does not discard\nthe physical and numerical models underneath in the predictive/online stage. We\nwill focus on autoencoders used to compress further the dimensionality of\nlinear approximants of solution manifolds, achieving in the end a nonlinear\ndimension reduction. After having obtained an accurate nonlinear approximant,\nwe seek for the solutions on the latent manifold with the residual-based\nnonlinear least-squares Petrov-Galerkin method, opportunely hyper-reduced in\norder to be independent from the number of degrees of freedom. New adaptive\nhyper-reduction strategies are developed along with the employment of local\nnonlinear approximants. We test our methodology on two nonlinear time-dependent\nparametric benchmarks involving a supersonic flow past a NACA airfoil with\nchanging Mach number and an incompressible turbulent flow around the Ahmed body\nwith changing slant angle.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:25:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Romor","Francesco",""],["Stabile","Giovanni",""],["Rozza","Gianluigi",""]]}
{"id":"2308.03397","submitter":"Rama Sharma","authors":"Rama Sharma, Tapio P. Simula, and Andrew J. Groszek","title":"Fluctuation theorem anomaly in a point-vortex fluid","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The second law of thermodynamics posits that in closed macroscopic systems\nthe rate of entropy production must be positive. However, small systems can\nexhibit negative entropy production over short timescales, seemingly in\ncontradiction with this law. The fluctuation theorem quantitatively connects\nthese two limits, predicting that entropy producing trajectories become\nexponentially dominant as the system size and measurement time are increased.\nHere we explore the predictions of the fluctuation theorem for a fluid of\npoint-vortices, where the long-range interactions and existence of negative\nabsolute temperature states provide an intriguing test bed for the theorem. Our\nresults suggest that while the theorem broadly holds even at negative absolute\ntemperatures, the long-range interactions inherent to the vortex matter lead to\nanomalously large entropy production over short time intervals. The predictions\nof the fluctuation theorem are only fully recovered when sufficient noise is\nintroduced to the dynamics to overwhelm the vortex-vortex interactions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:26:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sharma","Rama",""],["Simula","Tapio P.",""],["Groszek","Andrew J.",""]]}
{"id":"2308.03398","submitter":"Florie Bouvier","authors":"Florie Bouvier (1), Etienne Peyrot (1), Alan Balendran (1), Corentin\n  S\\'egalas (2), Ian Roberts (3), Fran\\c{c}ois Petit (1), Rapha\\\"el Porcher (1\n  and 4) ((1) Universit\\'e Paris Cit\\'e and Universit\\'e Sorbonne Paris Nord,\n  Inserm, INRAE, Center for Research in Epidemiology and StatisticS (CRESS),\n  F-75004 Paris, France, (2) Universit\\'e Bordeaux, Inserm, Bordeaux Population\n  Health Research Center, Bordeaux, France, (3) Clinical Trials Unit, London\n  School of Hygiene & Tropical Medicine, London, UK, (4) Centre\n  d'Epid\\'emiologie Clinique, Assistance Publique-H\\^opitaux de Paris,\n  H\\^otel-Dieu, Paris, France)","title":"Do machine learning methods lead to similar individualized treatment\n  rules? A comparison study on real data","comments":"26 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Identifying subgroups of patients who benefit from a treatment is a key\naspect of personalized medicine, these subgroups can be used to develop\nindividualized treatment rules (ITRs). Many machine learning methods have been\nproposed to create such rules. However, to what extent methods lead to the same\nITRs, i.e., recommending the same treatment for the same individuals is\nunclear. To see if methods lead to similar ITRs, we compared the most common\napproaches in two randomized control trials. Two classes of methods can be\ndistinguished to develop an ITR. The first class of methods relies on\npredicting individualized treatment effects from which an ITR is derived by\nrecommending the evaluated treatment to the individuals with a predicted\nbenefit. In the second class, methods directly estimate the ITR without\nestimating individualized treatment effects. For each trial, the performance of\nITRs was assessed with various metrics, and the pairwise agreement between ITRs\nwas also calculated. Results showed that the ITRs obtained by the different\nmethods generally had considerable disagreements regarding the individuals to\nbe treated. A better concordance was found among akin methods. Overall, when\nevaluating the performance of ITRs in a validation sample, all methods produced\nITRs with limited performance, suggesting a high potential for overfitting. The\ndifferent methods do not lead to similar ITRs and are therefore not\ninterchangeable. The choice of the method has a lot of influence on which\npatients end up being given a certain treatment which draws some concerns about\nthe practical use of the methods.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:28:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bouvier","Florie","","1\n  and 4"],["Peyrot","Etienne","","1\n  and 4"],["Balendran","Alan","","1\n  and 4"],["S\u00e9galas","Corentin","","1\n  and 4"],["Roberts","Ian","","1\n  and 4"],["Petit","Fran\u00e7ois","","1\n  and 4"],["Porcher","Rapha\u00ebl","","1\n  and 4"]]}
{"id":"2308.03399","submitter":"Jun Doi","authors":"Jun Doi, Hiroshi Horii, Christopher Wood","title":"Efficient techniques to GPU Accelerations of Multi-Shot Quantum\n  Computing Simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computers are becoming practical for computing numerous applications.\nHowever, simulating quantum computing on classical computers is still demanding\nyet useful because current quantum computers are limited because of computer\nresources, hardware limits, instability, and noises. Improving quantum\ncomputing simulation performance in classical computers will contribute to the\ndevelopment of quantum computers and their algorithms. Quantum computing\nsimulations on classical computers require long performance times, especially\nfor quantum circuits with a large number of qubits or when simulating a large\nnumber of shots for noise simulations or circuits with intermediate measures.\nGraphical processing units (GPU) are suitable to accelerate quantum computer\nsimulations by exploiting their computational power and high bandwidth memory\nand they have a large advantage in simulating relatively larger qubits\ncircuits. However, GPUs are inefficient at simulating multi-shots runs with\nnoises because the randomness prevents highly parallelization. In addition,\nGPUs have a disadvantage in simulating circuits with a small number of qubits\nbecause of the large overheads in GPU kernel execution. In this paper, we\nintroduce optimization techniques for multi-shot simulations on GPUs. We gather\nmultiple shots of simulations into a single GPU kernel execution to reduce\noverheads by scheduling randomness caused by noises. In addition, we introduce\nshot-branching that reduces calculations and memory usage for multi-shot\nsimulations. By using these techniques, we speed up x10 from previous\nimplementations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:32:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Doi","Jun",""],["Horii","Hiroshi",""],["Wood","Christopher",""]]}
{"id":"2308.03400","submitter":"Dongjun Lee","authors":"Dongjun Lee, Donggeun Ko, Jaekwang Kim","title":"Hierarchical Contrastive Learning with Multiple Augmentation for\n  Sequential Recommendation","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sequential recommendation addresses the issue of preference drift by\npredicting the next item based on the user's previous behaviors. Recently, a\npromising approach using contrastive learning has emerged, demonstrating its\neffectiveness in recommending items under sparse user-item interactions.\nSignificantly, the effectiveness of combinations of various augmentation\nmethods has been demonstrated in different domains, particularly in computer\nvision. However, when it comes to augmentation within a contrastive learning\nframework in sequential recommendation, previous research has only focused on\nlimited conditions and simple structures. Thus, it is still possible to extend\nexisting approaches to boost the effects of augmentation methods by using\nprogressed structures with the combinations of multiple augmentation methods.\nIn this work, we propose a novel framework called Hierarchical Contrastive\nLearning with Multiple Augmentation for Sequential Recommendation(HCLRec) to\novercome the aforementioned limitation. Our framework leverages existing\naugmentation methods hierarchically to improve performance. By combining\naugmentation methods continuously, we generate low-level and high-level view\npairs. We employ a Transformers-based model to encode the input sequence\neffectively. Furthermore, we introduce additional blocks consisting of\nTransformers and position-wise feed-forward network(PFFN) layers to learn the\ninvariance of the original sequences from hierarchically augmented views. We\npass the input sequence to subsequent layers based on the number of increment\nlevels applied to the views to handle various augmentation levels. Within each\nlayer, we compute contrastive loss between pairs of views at the same level.\nExtensive experiments demonstrate that our proposed method outperforms\nstate-of-the-art approaches and that HCLRec is robust even when faced with the\nproblem of sparse interaction.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:38:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lee","Dongjun",""],["Ko","Donggeun",""],["Kim","Jaekwang",""]]}
{"id":"2308.03401","submitter":"Dirk van der Marel","authors":"Francesco Barantani, Christophe Berthod, and Dirk van der Marel","title":"Can dd excitations mediate pairing ?","comments":"6 pages, 4 figures","journal-ref":"Physica C: Superconductivity and its Applications, Vol 613,\n  1354321 (2023) - Open Access","doi":"10.1016/j.physc.2023.1354321","report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cu-$3d$ states in the high-$T_c$ cuprates are often described as a single\nband of $3d_{x^2-y^2}$ states, with the other four $3d$ states having about 2\nto 3 eV higher energy due to the lower-than-octahedral crystal field at the\ncopper sites. However, excitations to these higher energy states observed with\nRIXS show indications of strong coupling to doped holes in the $3d_{x^2-y^2}$\nband. This relaunches a decades-old question of the possible role of the\norbital degrees of freedom that once motivated Bednorz and M\\\"uller to search\nfor superconductivity in these systems. Here we explore a direction different\nfrom the Jahn-Teller electron-phonon coupling considered by Bednorz and\nM\\\"uller, namely the interaction between holes mediated by $dd$ excitations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:39:59 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 16:25:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Barantani","Francesco",""],["Berthod","Christophe",""],["van der Marel","Dirk",""]]}
{"id":"2308.03402","submitter":"Cl\\'audio Correia Jos\\'e Pereira","authors":"Cl\\'audio Correia, Miguel Correia, Lu\\'is Rodrigues","title":"Using Range-Revocable Pseudonyms to Provide Backward Unlinkability in\n  the Edge (Extended Version)","comments":"19 pages. Extended version of the paper accepted in CCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we propose a novel abstraction that we have named\nRange-Revocable Pseudonyms (RRPs). RRPs are a new class of pseudonyms whose\nvalidity can be revoked for any time-range within its original validity period.\nThe key feature of RRPs is that the information provided to revoke a pseudonym\nfor a given timerange cannot be linked with the information provided when using\nthe pseudonym outside the revoked range. We provide an algorithm to implement\nRRPs using efficient cryptographic primitives where the space complexity of the\npseudonym is constant, regardless of the granularity of the revocation range,\nand the space complexity of the revocation information only grows\nlogarithmically with the granularity; this makes the use of RRPs far more\nefficient than the use of many short-lived pseudonyms. We have used RRPs to\ndesign EDGAR, an access control system for VANET scenarios that offers backward\nunlinkability. The experimental evaluation of EDGAR shows that, when using\nRRPs, the revocation can be performed efficiently (even when using time slots\nas small as 1 second) and that users can authenticate with low latency\n($0.5-3.5$ ms).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:42:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Correia","Cl\u00e1udio",""],["Correia","Miguel",""],["Rodrigues","Lu\u00eds",""]]}
{"id":"2308.03403","submitter":"Stefan L\\\"udtke","authors":"Stefan L\\\"udtke and Maria E. Pierce","title":"Towards Machine Learning-based Fish Stock Assessment","comments":"Accepted at Fragile Earth Workshop 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accurate assessment of fish stocks is crucial for sustainable fisheries\nmanagement. However, existing statistical stock assessment models can have low\nforecast performance of relevant stock parameters like recruitment or spawning\nstock biomass, especially in ecosystems that are changing due to global warming\nand other anthropogenic stressors. In this paper, we investigate the use of\nmachine learning models to improve the estimation and forecast of such stock\nparameters. We propose a hybrid model that combines classical statistical stock\nassessment models with supervised ML, specifically gradient boosted trees. Our\nhybrid model leverages the initial estimate provided by the classical model and\nuses the ML model to make a post-hoc correction to improve accuracy. We\nexperiment with five different stocks and find that the forecast accuracy of\nrecruitment and spawning stock biomass improves considerably in most cases.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:44:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["L\u00fcdtke","Stefan",""],["Pierce","Maria E.",""]]}
{"id":"2308.03404","submitter":"Christoffer Riis","authors":"Christoffer Riis, Francisco N. Antunes, Tatjana Boli\\'c, G\\'erald\n  Gurtner, Andrew Cook, Carlos Lima Azevedo, and Francisco C\\^amara Pereira","title":"Applied metamodelling for ATM performance simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The use of Air traffic management (ATM) simulators for planing and operations\ncan be challenging due to their modelling complexity. This paper presents XALM\n(eXplainable Active Learning Metamodel), a three-step framework integrating\nactive learning and SHAP (SHapley Additive exPlanations) values into simulation\nmetamodels for supporting ATM decision-making. XALM efficiently uncovers hidden\nrelationships among input and output variables in ATM simulators, those usually\nof interest in policy analysis. Our experiments show XALM's predictive\nperformance comparable to the XGBoost metamodel with fewer simulations.\nAdditionally, XALM exhibits superior explanatory capabilities compared to\nnon-active learning metamodels.\n  Using the `Mercury' (flight and passenger) ATM simulator, XALM is applied to\na real-world scenario in Paris Charles de Gaulle airport, extending an arrival\nmanager's range and scope by analysing six variables. This case study\nillustrates XALM's effectiveness in enhancing simulation interpretability and\nunderstanding variable interactions. By addressing computational challenges and\nimproving explainability, XALM complements traditional simulation-based\nanalyses.\n  Lastly, we discuss two practical approaches for reducing the computational\nburden of the metamodelling further: we introduce a stopping criterion for\nactive learning based on the inherent uncertainty of the metamodel, and we show\nhow the simulations used for the metamodel can be reused across key performance\nindicators, thus decreasing the overall number of simulations needed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:46:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Riis","Christoffer",""],["Antunes","Francisco N.",""],["Boli\u0107","Tatjana",""],["Gurtner","G\u00e9rald",""],["Cook","Andrew",""],["Azevedo","Carlos Lima",""],["Pereira","Francisco C\u00e2mara",""]]}
{"id":"2308.03405","submitter":"Jingshu Li","authors":"Jingshu Li, Zhengyun You","title":"Search for Charged Lepton Flavor Violation in $J/\\psi$ decays at BESIII","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The observation of any charged lepton flavor violation (CLFV) process would\nbe a clear signal of new physics beyond the Standard Model. Various decay\nmodes, including lepton ($\\mu, \\tau$) decays, pseudoscalar meson ($K,\\pi$)\ndecays, vector meson ($\\phi, J/\\psi, \\Upsilon$) decays, and Higgs decays, have\nbeen explored to detect CLFV. Focusing on the search for CLFV at the\n$\\tau$-charm region, the results of the search for $J/\\psi\\to e\\tau / e\\mu$\nusing the 10 billion $J/\\psi$ events collected by the BESIII experiment are\npresented. The upper limits (ULs) at the 90$\\%$ confidence level are\n$\\mathcal{B}(J/\\psi\\to e^\\pm\\tau^\\mp)<7.5\\times10^{-8}$ and\n$\\mathcal{B}(J/\\psi\\to e^\\pm\\mu^\\mp)<4.5\\times10^{-9}$, respectively. Improving\nthe previously published limits by two orders of magnitudes, the results are\nthe most stringent CLFV searches in heavy quarkonium system.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:47:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Jingshu",""],["You","Zhengyun",""]]}
{"id":"2308.03406","submitter":"Neta Maimon","authors":"Lior Molcho, Neta B. Maimon, Neomi Hezi, Talya Zeimer, Nathan\n  Intrator, Tanya Gurevich","title":"Evaluation of Parkinsons disease with early diagnosis using\n  single-channel EEG features and auditory cognitive assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parkinsons disease (PD) diagnosis is challenging due to subtle early clinical\nsigns. F-DOPA PET is commonly used for early PD diagnosis. We explore the\npotential of machine-learning (ML) based EEG features extracted from\nsingle-channel EEG during auditory cognitive assessment as a noninvasive,\nlow-cost support for PD diagnosis. The study included data collected from 32\nparticipants who underwent an F-DOPA PET scan as part of their standard\ntreatment and 20 cognitively healthy controls. Participants performed an\nauditory cognitive assessment recorded with Neurosteer EEG device. Data\nprocessing involved wavelet-packet decomposition and ML. First, a prediction\nmodel was developed to predict 1/3 of the undisclosed F-DOPA results. Then,\ngeneralized linear mixed models were calculated to distinguish between PD and\nnon-PD subjects on the frequency bands and ML-based EEG features (A0 and L1)\npreviously associated with cognitive functions. The prediction model accurately\nlabeled patients with unrevealed scores as positive F-DOPA. Novel EEG feature\nA0 and the Delta band showed significant separation between study groups, with\nhealthy controls exhibiting higher activity than PD patients. EEG feature L1\nactivity was significantly lower in resting state compared to high-cognitive\nload. This effect was absent in the PD group, suggesting that lower activity in\nresting state is lacking in PD patients. This study successfully demonstrated\nthe ability to separate patients with positive vs. negative F-DOPA PET results\nwith an easy-to-use single-channel EEG during an auditory cognitive assessment.\nFuture longitudinal studies should further explore the potential utility of\nthis tool for early PD diagnosis and as a potential biomarker in PD.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:48:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Molcho","Lior",""],["Maimon","Neta B.",""],["Hezi","Neomi",""],["Zeimer","Talya",""],["Intrator","Nathan",""],["Gurevich","Tanya",""]]}
{"id":"2308.03407","submitter":"Kaixuan Wei","authors":"Kaixuan Wei, Xiao Li, Johannes Froech, Praneeth Chakravarthula, James\n  Whitehead, Ethan Tseng, Arka Majumdar, Felix Heide","title":"Spatially Varying Nanophotonic Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The explosive growth of computation and energy cost of artificial\nintelligence has spurred strong interests in new computing modalities as\npotential alternatives to conventional electronic processors. Photonic\nprocessors that execute operations using photons instead of electrons, have\npromised to enable optical neural networks with ultra-low latency and power\nconsumption. However, existing optical neural networks, limited by the\nunderlying network designs, have achieved image recognition accuracy much lower\nthan state-of-the-art electronic neural networks. In this work, we close this\ngap by introducing a large-kernel spatially-varying convolutional neural\nnetwork learned via low-dimensional reparameterization techniques. We\nexperimentally instantiate the network with a flat meta-optical system that\nencompasses an array of nanophotonic structures designed to induce\nangle-dependent responses. Combined with an extremely lightweight electronic\nbackend with approximately 2K parameters we demonstrate a nanophotonic neural\nnetwork reaches 73.80\\% blind test classification accuracy on CIFAR-10 dataset,\nand, as such, the first time, an optical neural network outperforms the first\nmodern digital neural network -- AlexNet (72.64\\%) with 57M parameters,\nbringing optical neural network into modern deep learning era.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:48:46 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 22:25:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wei","Kaixuan",""],["Li","Xiao",""],["Froech","Johannes",""],["Chakravarthula","Praneeth",""],["Whitehead","James",""],["Tseng","Ethan",""],["Majumdar","Arka",""],["Heide","Felix",""]]}
{"id":"2308.03408","submitter":"Yuan Li","authors":"Yuan Li","title":"On traveling waves and global existence for a nonlinear Schr\\\"odinger\n  system with three waves interaction","comments":"22 Page. arXiv admin note: text overlap with arXiv:2209.05305 by\n  other authors","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 three components system of nonlinear Schr\\\"odinger\nequations related to the Raman amplification in a plasma. By using variational\nmethod, a new result on the existence of traveling wave solutions are obtained\nunder the non-mass resonance condition. We also study the new global existence\nresult for oscillating data. Both of our results essentially due to the absence\nof Galilean symmetry in the system.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:54:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yuan",""]]}
{"id":"2308.03409","submitter":"Yuchen Ma","authors":"Yuchen Ma, Zhengcong Fei, Junshi Huang","title":"DiT: Efficient Vision Transformers with Dynamic Token Routing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recently, the tokens of images share the same static data flow in many dense\nnetworks. However, challenges arise from the variance among the objects in\nimages, such as large variations in the spatial scale and difficulties of\nrecognition for visual entities. In this paper, we propose a data-dependent\ntoken routing strategy to elaborate the routing paths of image tokens for\nDynamic Vision Transformer, dubbed DiT. The proposed framework generates a\ndata-dependent path per token, adapting to the object scales and visual\ndiscrimination of tokens. In feed-forward, the differentiable routing gates are\ndesigned to select the scaling paths and feature transformation paths for image\ntokens, leading to multi-path feature propagation. In this way, the impact of\nobject scales and visual discrimination of image representation can be\ncarefully tuned. Moreover, the computational cost can be further reduced by\ngiving budget constraints to the routing gate and early-stopping of feature\nextraction. In experiments, our DiT achieves superior performance and favorable\ncomplexity/accuracy trade-offs than many SoTA methods on ImageNet\nclassification, object detection, instance segmentation, and semantic\nsegmentation. Particularly, the DiT-B5 obtains 84.8\\% top-1 Acc on ImageNet\nwith 10.3 GFLOPs, which is 1.0\\% higher than that of the SoTA method with\nsimilar computational complexity. These extensive results demonstrate that DiT\ncan serve as versatile backbones for various vision tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:55:48 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 13:53:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ma","Yuchen",""],["Fei","Zhengcong",""],["Huang","Junshi",""]]}
{"id":"2308.03410","submitter":"Junsik Bae","authors":"Junsik Bae, Daisuke Kawagoe","title":"Nonexistence of multi-dimensional solitary waves for the Euler-Poisson\n  system","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 the nonexistence of multi-dimensional solitary waves for the\nEuler-Poisson system governing ion dynamics. It is well-known that the\none-dimensional Euler-Poisson system has solitary waves that travel faster than\nthe ion-sound speed. In contrast, we show that the two-dimensional and\nthree-dimensional models do not admit nontrivial irrotational spatially\nlocalized traveling waves for any traveling velocity and for general pressure\nlaws. We derive some Pohozaev type identities associated with the energy and\ndensity integrals. This approach is extended to prove the nonexistence of\nirrotational multi-dimensional solitary waves for the two-species Euler-Poisson\nsystem for ions and electrons.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:58:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bae","Junsik",""],["Kawagoe","Daisuke",""]]}
{"id":"2308.03411","submitter":"Jose Angel Sosa Martinez","authors":"Jose Sosa and David Hogg","title":"A Horse with no Labels: Self-Supervised Horse Pose Estimation from\n  Unlabelled Images and Synthetic Prior","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Obtaining labelled data to train deep learning methods for estimating animal\npose is challenging. Recently, synthetic data has been widely used for pose\nestimation tasks, but most methods still rely on supervised learning paradigms\nutilising synthetic images and labels. Can training be fully unsupervised? Is a\ntiny synthetic dataset sufficient? What are the minimum assumptions that we\ncould make for estimating animal pose? Our proposal addresses these questions\nthrough a simple yet effective self-supervised method that only assumes the\navailability of unlabelled images and a small set of synthetic 2D poses. We\ncompletely remove the need for any 3D or 2D pose annotations (or complex 3D\nanimal models), and surprisingly our approach can still learn accurate 3D and\n2D poses simultaneously. We train our method with unlabelled images of horses\nmainly collected for YouTube videos and a prior consisting of 2D synthetic\nposes. The latter is three times smaller than the number of images needed for\ntraining. We test our method on a challenging set of horse images and evaluate\nthe predicted 3D and 2D poses. We demonstrate that it is possible to learn\naccurate animal poses even with as few assumptions as unlabelled images and a\nsmall set of 2D poses generated from synthetic data. Given the minimum\nrequirements and the abundance of unlabelled data, our method could be easily\ndeployed to different animals.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:02:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sosa","Jose",""],["Hogg","David",""]]}
{"id":"2308.03412","submitter":"Cl\\'ement Leloup","authors":"Cl\\'ement Leloup, Josquin Errard and Radek Stompor","title":"Non-parametric maximum likelihood component separation for CMB\n  polarization 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":"  Mitigation of the impact of foreground contributions to measurements of\nCosmic Microwave Background (CMB) polarization is a crucial step in modern CMB\ndata analysis and is of particular importance for a detection of large-scale\nCMB $B$ modes. A large variety of techniques, based on different assumptions\nand aiming at either a full component separation or merely cleaning the\nforeground signals from the CMB maps, have been described in the literature. In\nthis work, we consider this problem within a unified framework based on the\nmaximum likelihood principle, under the assumption that the signal at each\nfrequency can be represented as a linear mixture of sky templates. We discuss\nthe impact of various additional assumptions on the final outcome of the\nprocedure. We find that the component separation problem can be fully solved in\ntwo specific situations: when we either know the frequency scaling of all the\ncomponents or can correctly model them with a limited number of unknown\nparameters, as is the case in the parametric component separation techniques;\nor when we either know the statistical properties of all the components, the\nforegrounds and CMB, or can correctly model them with a limited number of\nparameters, as for instance in SMICA-like approaches. However, we also show\nthat much less stringent assumptions are sufficient if we only aim at\nrecovering the cleaned CMB signal. In particular, we discuss a ``minimally\ninformed'' non-parametric method based on maximum likelihood. The method only\nassumes that the component properties are independent on the sky direction, at\nleast over some region of the sky, and that the CMB covariance is known up to\nsome limited number of parameters. We apply this method to recover the CMB $B$\nmodes polarization signal in the context of forthcoming CMB experiments and\ncompare its performance with that of the standard parametric... (abridged)\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:03:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Leloup","Cl\u00e9ment",""],["Errard","Josquin",""],["Stompor","Radek",""]]}
{"id":"2308.03413","submitter":"Tianxiang Ma","authors":"Tianxiang Ma, Bingchuan Li, Qian He, Jing Dong, Tieniu Tan","title":"GaFET: Learning Geometry-aware Facial Expression Translation from\n  In-The-Wild 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":"  While current face animation methods can manipulate expressions individually,\nthey suffer from several limitations. The expressions manipulated by some\nmotion-based facial reenactment models are crude. Other ideas modeled with\nfacial action units cannot generalize to arbitrary expressions not covered by\nannotations. In this paper, we introduce a novel Geometry-aware Facial\nExpression Translation (GaFET) framework, which is based on parametric 3D\nfacial representations and can stably decoupled expression. Among them, a\nMulti-level Feature Aligned Transformer is proposed to complement non-geometric\nfacial detail features while addressing the alignment challenge of spatial\nfeatures. Further, we design a De-expression model based on StyleGAN, in order\nto reduce the learning difficulty of GaFET in unpaired \"in-the-wild\" images.\nExtensive qualitative and quantitative experiments demonstrate that we achieve\nhigher-quality and more accurate facial expression transfer results compared to\nstate-of-the-art methods, and demonstrate applicability of various poses and\ncomplex textures. Besides, videos or annotated training data are omitted,\nmaking our method easier to use and generalize.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:03:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Tianxiang",""],["Li","Bingchuan",""],["He","Qian",""],["Dong","Jing",""],["Tan","Tieniu",""]]}
{"id":"2308.03414","submitter":"Wen Xia","authors":"Wen Xia and Shenwei Huang","title":"Critical $(P_5,dart)$-Free Graphs","comments":"arXiv admin note: text overlap with arXiv:2211.04179","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains\nno induced subgraph isomorphic to $H_1$ and $H_2$. Let $P_t$ be the path on $t$\nvertices. A dart is the graph obtained from a diamond by adding a new vertex\nand making it adjacent to exactly one vertex which degree is 3 in the diamond.\nIn this paper, we show that there are finitely many $k$-vertex-critical\n$(P_5,dart)$-free graphs for $k \\ge 1$. To prove the results we use induction\non $k$ and perform a careful structural analysis via Strong Perfect Graph\nTheorem combined with the pigeonhole principle based on the properties of\nvertex-critical graphs. Our results imply the existence of a polynomial-time\ncertifying algorithm to decide the $k$-colorability of $(P_5,dart)$-free graphs\nfor $k \\ge 1$ where the certificate is either a $k$-coloring or a\n$(k+1)$-vertex-critical induced subgraph.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:05:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xia","Wen",""],["Huang","Shenwei",""]]}
{"id":"2308.03415","submitter":"Christian Huber","authors":"Christian Huber, Tu Anh Dinh, Carlos Mullov, Ngoc Quan Pham, Thai Binh\n  Nguyen, Fabian Retkowski, Stefan Constantin, Enes Yavuz Ugan, Danni Liu,\n  Zhaolin Li, Sai Koneru, Jan Niehues and Alexander Waibel","title":"End-to-End Evaluation for Low-Latency Simultaneous Speech Translation","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 challenge of low-latency speech translation has recently draw significant\ninterest in the research community as shown by several publications and shared\ntasks. Therefore, it is essential to evaluate these different approaches in\nrealistic scenarios. However, currently only specific aspects of the systems\nare evaluated and often it is not possible to compare different approaches.\n  In this work, we propose the first framework to perform and evaluate the\nvarious aspects of low-latency speech translation under realistic conditions.\nThe evaluation is carried out in an end-to-end fashion. This includes the\nsegmentation of the audio as well as the run-time of the different components.\n  Secondly, we compare different approaches to low-latency speech translation\nusing this framework. We evaluate models with the option to revise the output\nas well as methods with fixed output. Furthermore, we directly compare\nstate-of-the-art cascaded as well as end-to-end systems. Finally, the framework\nallows to automatically evaluate the translation quality as well as latency and\nalso provides a web interface to show the low-latency model outputs to the\nuser.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:06:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huber","Christian",""],["Dinh","Tu Anh",""],["Mullov","Carlos",""],["Pham","Ngoc Quan",""],["Nguyen","Thai Binh",""],["Retkowski","Fabian",""],["Constantin","Stefan",""],["Ugan","Enes Yavuz",""],["Liu","Danni",""],["Li","Zhaolin",""],["Koneru","Sai",""],["Niehues","Jan",""],["Waibel","Alexander",""]]}
{"id":"2308.03416","submitter":"Thomas Wodtko","authors":"Thomas Wodtko, Thomas Griebel, and Michael Buchholz","title":"Adaptive Patched Grid Mapping","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 work, we propose a novel adaptive grid mapping approach, the Adaptive\nPatched Grid Map, which enables a situational aware grid based perception for\nautonomous vehicles. Its structure allows a flexible representation of the\nsurrounding unstructured environment. By splitting types of information into\nseparate layers less memory is allocated when data is unevenly or sporadically\navailable. However, layers must be resampled during the fusion process to cope\nwith dynamically changing cell sizes. Therefore, we propose a novel spatial\ncell fusion approach. Together with the proposed fusion framework, dynamically\nchanging external requirements, such as cell resolution specifications and\nhorizon targets, are considered. For our evaluation, real-world data were\nrecorded from an autonomous vehicle driving through various traffic situations.\nBased on this, the memory efficiency is compared to other approaches, and\nfusion execution times are determined. The results confirm the adaptation to\nrequirement changes and a significant memory usage reduction.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:08:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wodtko","Thomas",""],["Griebel","Thomas",""],["Buchholz","Michael",""]]}
{"id":"2308.03417","submitter":"Shaoor Munir","authors":"Shaoor Munir, Patrick Lee, Umar Iqbal, Zubair Shafiq, Sandra Siby","title":"PURL: Safe and Effective Sanitization of Link Decoration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While privacy-focused browsers have taken steps to block third-party cookies\nand browser fingerprinting, novel tracking methods that bypass existing\ndefenses continue to emerge. Since trackers need to exfiltrate information from\nthe client- to server-side through link decoration regardless of the tracking\ntechnique they employ, a promising orthogonal approach is to detect and\nsanitize tracking information in decorated links. We present PURL, a\nmachine-learning approach that leverages a cross-layer graph representation of\nwebpage execution to safely and effectively sanitize link decoration. Our\nevaluation shows that PURL significantly outperforms existing countermeasures\nin terms of accuracy and reducing website breakage while being robust to common\nevasion techniques. We use PURL to perform a measurement study on top-million\nwebsites. We find that link decorations are widely abused by well-known\nadvertisers and trackers to exfiltrate user information collected from browser\nstorage, email addresses, and scripts involved in fingerprinting.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:08:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Munir","Shaoor",""],["Lee","Patrick",""],["Iqbal","Umar",""],["Shafiq","Zubair",""],["Siby","Sandra",""]]}
{"id":"2308.03418","submitter":"Agnieszka Kuc","authors":"Ismail Eren, Yun An, Agnieszka B. Kuc","title":"Hydrogen Transport Between Layers of Transition Metal-Dichalcogenides","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrogen is a crucial source of green energy and has been extensively studied\nfor its potential usage in fuel cells. The advent of two-dimensional crystals\n(2DCs) has taken hydrogen research to new heights, enabling it to tunnel\nthrough layers of 2DCs or be transported within voids between the layers, as\ndemonstrated in recent experiments by Geim's group. In this study, we\ninvestigate how the composition and stacking of transition-metal dichalcogenide\n(TMDC) layers influence the transport and self-diffusion coefficients (D) of\nhydrogen atoms using well-tempered metadynamics simulations. Our findings show\nthat modifying either the transition metal or the chalcogen atoms significantly\naffects the free energy barriers (Delta F) and, consequently, the\nself-diffusion of hydrogen atoms between the 2DC layers. In the Hh polytype (2H\nstacking), MoSe2 exhibits the lowest Delta F, while WS2 has the highest,\nresulting in the largest D for the former system. Additionally, hydrogen atoms\ninside the RhM (or 3R) polytype encounter more than twice lower energy barriers\nand, thus, much higher diffusivity compared to those within the most stable Hh\nstacking. These findings are particularly significant when investigating\ntwisted layers or homo- or heterostructures, as different stacking areas may\ndominate over others, potentially leading to directional transport and\ninteresting materials for ion or atom sieving.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:09:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Eren","Ismail",""],["An","Yun",""],["Kuc","Agnieszka B.",""]]}
{"id":"2308.03419","submitter":"Lyuye Zhang","authors":"Lyuye Zhang, Chengwei Liu, Sen Chen, Zhengzi Xu, Lingling Fan, Lida\n  Zhao, Yiran Zhang, Yang Liu","title":"Mitigating Persistence of Open-Source Vulnerabilities in Maven Ecosystem","comments":"12 pages, 9 figures, the 38th IEEE/ACM International Conference on\n  Automated Software Engineering (ASE2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vulnerabilities from third-party libraries (TPLs) have been unveiled to\nthreaten the Maven ecosystem. Despite patches being released promptly after\nvulnerabilities are disclosed, the libraries and applications in the community\nstill use the vulnerable versions, which makes the vulnerabilities persistent\nin the Maven ecosystem (e.g., the notorious Log4Shell still greatly influences\nthe Maven ecosystem nowadays from 2021). Both academic and industrial\nresearchers have proposed user-oriented standards and solutions to address\nvulnerabilities, while such solutions fail to tackle the ecosystem-wide\npersistent vulnerabilities because it requires a collective effort from the\ncommunity to timely adopt patches without introducing breaking issues.\n  To seek an ecosystem-wide solution, we first carried out an empirical study\nto examine the prevalence of persistent vulnerabilities in the Maven ecosystem.\nThen, we identified affected libraries for alerts by implementing an algorithm\nmonitoring downstream dependents of vulnerabilities based on an up-to-date\ndependency graph. Based on them, we further quantitatively revealed that\npatches blocked by upstream libraries caused the persistence of\nvulnerabilities. After reviewing the drawbacks of existing countermeasures, to\naddress them, we proposed a solution for range restoration (Ranger) to\nautomatically restore the compatible and secure version ranges of dependencies\nfor downstream dependents. The automatic restoration requires no manual effort\nfrom the community, and the code-centric compatibility assurance ensures smooth\nupgrades to patched versions. Moreover, Ranger along with the ecosystem\nmonitoring can timely alert developers of blocking libraries and suggest\nflexible version ranges to rapidly unblock patch versions. By evaluation,\nRanger could restore 75.64% of ranges which automatically remediated 90.32% of\nvulnerable downstream projects.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:11:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Lyuye",""],["Liu","Chengwei",""],["Chen","Sen",""],["Xu","Zhengzi",""],["Fan","Lingling",""],["Zhao","Lida",""],["Zhang","Yiran",""],["Liu","Yang",""]]}
{"id":"2308.03420","submitter":"Chen Chen","authors":"Pengfei Wu, Chen Chen, Dexiang Lai, Jian Zhong","title":"A Safe DRL Method for Fast Solution of Real-Time Optimal Power Flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-level penetration of intermittent renewable energy sources (RESs) has\nintroduced significant uncertainties into modern power systems. In order to\nrapidly and economically respond to the fluctuations of power system operating\nstate, this paper proposes a safe deep reinforcement learning (SDRL) based\nmethod for fast solution of real-time optimal power flow (RT-OPF) problems. The\nproposed method considers the volatility of RESs and temporal constraints, and\nformulates the RT-OPF as a Constrained Markov Decision Process (CMDP). In the\ntraining process, the proposed method hybridizes the proximal policy\noptimization (PPO) and the primal-dual method. Instead of integrating the\nconstraint violation penalty with the reward function, its actor gradients are\nestimated by a Lagrange advantage function which is derived from two critic\nsystems based on economic reward and violation cost. The decoupling of reward\nand cost alleviates reward sparsity while improving critic approximation\naccuracy. Moreover, the introduction of Lagrange multipliers enables the agent\nto comprehend the trade-off between optimality and feasibility. Numerical tests\nare carried out and compared with penalty-based DRL methods on the IEEE 9-bus,\n30-bus, and 118-bus test systems. The results show that the well-trained SDRL\nagent can significantly improve the computation efficiency while satisfying the\nsecurity constraints and optimality requirements.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:13:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wu","Pengfei",""],["Chen","Chen",""],["Lai","Dexiang",""],["Zhong","Jian",""]]}
{"id":"2308.03421","submitter":"Yufan Jiang","authors":"Yufan Jiang, Qiaozhi He, Xiaomin Zhuang, Zhihua Wu, Kunpeng Wang,\n  Wenlai Zhao, Guangwen Yang","title":"RecycleGPT: An Autoregressive Language Model with Recyclable Module","comments":"Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing large language models have to run K times to generate a sequence of\nK tokens. In this paper, we present RecycleGPT, a generative language model\nwith fast decoding speed by recycling pre-generated model states without\nrunning the whole model in multiple steps. Our approach relies on the\nobservation that adjacent tokens in a sequence usually have strong correlations\nand the next token in a sequence can be reasonably guessed or inferred based on\nthe preceding ones. Experiments and analysis demonstrate the effectiveness of\nour approach in lowering inference latency, achieving up to 1.4x speedup while\npreserving high performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:14:33 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 07:58:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jiang","Yufan",""],["He","Qiaozhi",""],["Zhuang","Xiaomin",""],["Wu","Zhihua",""],["Wang","Kunpeng",""],["Zhao","Wenlai",""],["Yang","Guangwen",""]]}
{"id":"2308.03422","submitter":"Jianzong Wang","authors":"Yong Zhang, Zhitao Li, Jianzong Wang, Yiming Gao, Ning Cheng, Fengying\n  Yu, Jing Xiao","title":"Prompt Guided Copy Mechanism for Conversational Question Answering","comments":"Accepted by 24th Annual Conference of the International Speech\n  Communication Association (INTERSPEECH 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conversational Question Answering (CQA) is a challenging task that aims to\ngenerate natural answers for conversational flow questions. In this paper, we\npropose a pluggable approach for extractive methods that introduces a novel\nprompt-guided copy mechanism to improve the fluency and appropriateness of the\nextracted answers. Our approach uses prompts to link questions to answers and\nemploys attention to guide the copy mechanism to verify the naturalness of\nextracted answers, making necessary edits to ensure that the answers are fluent\nand appropriate. The three prompts, including a question-rationale relationship\nprompt, a question description prompt, and a conversation history prompt,\nenhance the copy mechanism's performance. Our experiments demonstrate that this\napproach effectively promotes the generation of natural answers and achieves\ngood results in the CoQA challenge.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:15:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Yong",""],["Li","Zhitao",""],["Wang","Jianzong",""],["Gao","Yiming",""],["Cheng","Ning",""],["Yu","Fengying",""],["Xiao","Jing",""]]}
{"id":"2308.03423","submitter":"Jianzong Wang","authors":"Jiaxin Fan, Yong Zhang, Hanzhang Li, Jianzong Wang, Zhitao Li, Sheng\n  Ouyang, Ning Cheng, Jing Xiao","title":"Boosting Chinese ASR Error Correction with Dynamic Error Scaling\n  Mechanism","comments":"Accepted by 24th Annual Conference of the International Speech\n  Communication Association (INTERSPEECH 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Chinese Automatic Speech Recognition (ASR) error correction presents\nsignificant challenges due to the Chinese language's unique features, including\na large character set and borderless, morpheme-based structure. Current\nmainstream models often struggle with effectively utilizing word-level features\nand phonetic information. This paper introduces a novel approach that\nincorporates a dynamic error scaling mechanism to detect and correct\nphonetically erroneous text generated by ASR output. This mechanism operates by\ndynamically fusing word-level features and phonetic information, thereby\nenriching the model with additional semantic data. Furthermore, our method\nimplements unique error reduction and amplification strategies to address the\nissues of matching wrong words caused by incorrect characters. Experimental\nresults indicate substantial improvements in ASR error correction,\ndemonstrating the effectiveness of our proposed method and yielding promising\nresults on established datasets.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:19:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fan","Jiaxin",""],["Zhang","Yong",""],["Li","Hanzhang",""],["Wang","Jianzong",""],["Li","Zhitao",""],["Ouyang","Sheng",""],["Cheng","Ning",""],["Xiao","Jing",""]]}
{"id":"2308.03424","submitter":"Matthias Urban","authors":"Matthias Urban and Carsten Binnig","title":"CAESURA: Language Models as Multi-Modal Query Planners","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traditional query planners translate SQL queries into query plans to be\nexecuted over relational data. However, it is impossible to query other data\nmodalities, such as images, text, or video stored in modern data systems such\nas data lakes using these query planners. In this paper, we propose\nLanguage-Model-Driven Query Planning, a new paradigm of query planning that\nuses Language Models to translate natural language queries into executable\nquery plans. Different from relational query planners, the resulting query\nplans can contain complex operators that are able to process arbitrary\nmodalities. As part of this paper, we present a first GPT-4 based prototype\ncalled CEASURA and show the general feasibility of this idea on two datasets.\nFinally, we discuss several ideas to improve the query planning capabilities of\ntoday's Language Models.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:20:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Urban","Matthias",""],["Binnig","Carsten",""]]}
{"id":"2308.03425","submitter":"Federico Rossi","authors":"Federico Rossi, Francesco Urbani, Marco Cococcioni, Emanuele Ruffaldi,\n  Sergio Saponara","title":"FPPU: Design and Implementation of a Pipelined Full Posit Processing\n  Unit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By exploiting the modular RISC-V ISA this paper presents the customization of\ninstruction set with posit\\textsuperscript{\\texttrademark} arithmetic\ninstructions to provide improved numerical accuracy, well-defined behavior and\nincreased range of representable numbers while keeping the flexibility and\nbenefits of open-source ISA, like no licensing and royalty fee and community\ndevelopment. In this work we present the design, implementation and integration\ninto the low-power Ibex RISC-V core of a full posit processing unit capable to\ndirectly implement in hardware the four arithmetic operations (add, sub, mul,\ndiv and fma), the inversion, the float-to-posit and posit-to-float conversions.\nWe evaluate speed, power and area of this unit (that we have called Full Posit\nProcessing Unit). The FPPU has been prototyped on Alveo and Kintex FPGAs, and\nits impact on the metrics of the full-RISC-V core have been evaluated, showing\nthat we can provide real number processing capabilities to the mentioned core\nwith an increase in area limited to $7\\%$ for 8-bit posits and to $15\\%$ for\n16-bit posits. Finally we present tests one the use of posits for deep neural\nnetworks with different network models and datasets, showing minimal drop in\naccuracy when using 16-bit posits instead of 32-bit IEEE floats.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:20:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rossi","Federico",""],["Urbani","Francesco",""],["Cococcioni","Marco",""],["Ruffaldi","Emanuele",""],["Saponara","Sergio",""]]}
{"id":"2308.03426","submitter":"Minchul Lee","authors":"Rosa L\\'opez, Pascal Simon, Minchul Lee","title":"Heat and charge transport in interacting nanoconductors driven by\n  time-modulated temperatures","comments":"23 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We investigate the quantum transport of the heat and the charge through a\nquantum dot (QD) coupled to fermionic contacts under the influence of time\nmodulation of temperatures. We derive within the nonequilibrium Keldysh Green's\nfunction (NEGF) formalism, exact formulas for the charge, heat currents and the\ndissipation power by employing the concept of gravitational field firstly\nintroduced by Luttinger in the sixties. The gravitational field, entering into\nthe system Hamiltonian and being coupled to the energies stored in the\ncontacts, plays a similar role as the electrostatic potential that is coupled\nto the charge density. We extend the original idea of Luttinger to correctly\nhandle the dynamical transport driven under a time-modulated (ac) temperature,\nby coupling the gravitational field to not only the contact energy but also to\nhalf of the energy stored in the tunneling barriers connecting the QD to the\ncontacts. The validity of our formalism is supported in that it satisfies the\nOnsager reciprocity relations and also reproduces the dynamics obtained from\nthe scattering theory for noninteracting cases. Our formalism provides a\nsystematical procedure to obtain general expressions for the charge and heat\ncurrents in the linear response regime solely in terms of the retarded and\nadvanced components of the interacting QD NEGFs by a help of the charge\nconservation and some sum rules. In order to demonstrate the utility of our\nformalism, we apply it to the noninteracting and interacting QD junctions and\ninterpret the charge and heat transports in terms of the equivalent quantum RC\ncircuits. Via a systematic consideration of the effect of the Coulomb\ninteraction under the ac drive of temperature, our formalism reveals that the\ninteraction can modify the response for charging and energy relaxation with a\nsignificant different temperature dependence.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:20:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["L\u00f3pez","Rosa",""],["Simon","Pascal",""],["Lee","Minchul",""]]}
{"id":"2308.03427","submitter":"Jingqing Ruan","authors":"Jingqing Ruan, Yihong Chen, Bin Zhang, Zhiwei Xu, Tianpeng Bao,\n  Guoqing Du, Shiwei Shi, Hangyu Mao, Xingyu Zeng, Rui Zhao","title":"TPTU: Task Planning and Tool Usage of Large Language Model-based AI\n  Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With recent advancements in natural language processing, Large Language\nModels (LLMs) have emerged as powerful tools for various real-world\napplications. Despite their prowess, the intrinsic generative abilities of LLMs\nmay prove insufficient for handling complex tasks which necessitate a\ncombination of task planning and the usage of external tools. In this paper, we\nfirst propose a structured framework tailored for LLM-based AI Agents and\ndiscuss the crucial capabilities necessary for tackling intricate problems.\nWithin this framework, we design two distinct types of agents (i.e., one-step\nagent and sequential agent) to execute the inference process. Subsequently, we\ninstantiate the framework using various LLMs and evaluate their Task Planning\nand Tool Usage (TPTU) abilities on typical tasks. By highlighting key findings\nand challenges, our goal is to provide a helpful resource for researchers and\npractitioners to leverage the power of LLMs in their AI applications. Our study\nemphasizes the substantial potential of these models, while also identifying\nareas that need more investigation and improvement.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:22:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ruan","Jingqing",""],["Chen","Yihong",""],["Zhang","Bin",""],["Xu","Zhiwei",""],["Bao","Tianpeng",""],["Du","Guoqing",""],["Shi","Shiwei",""],["Mao","Hangyu",""],["Zeng","Xingyu",""],["Zhao","Rui",""]]}
{"id":"2308.03428","submitter":"Weijie Ren","authors":"Weijie Ren, Wenjia Xie, Ye Zhang, Hang Yu, Zhengyu Tian","title":"Numerical stability analysis of shock-capturing methods for strong\n  shocks II: high-order finite-volume schemes","comments":"42 pages, 28 figures","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":"  The shock instability problem commonly arises in flow simulations involving\nstrong shocks, particularly when employing high-order schemes, limiting their\napplications in hypersonic flow simulations. This study focuses on exploring\nthe numerical characteristics and underlying mechanisms of shock instabilities\nin fifth-order finite-volume WENO schemes. To this end, for the first time, we\nhave established the matrix stability analysis method for the fifth-order\nscheme. By predicting the evolution of perturbation errors in the exponential\ngrowth stage, this method provides quantitative insights into the behavior of\nshock-capturing and helps elucidate the mechanisms that cause shock\ninstabilities. Results reveal that even dissipative solvers also suffer from\nshock instabilities when the spatial accuracy is increased to fifth-order.\nFurther investigation indicates that this is due to the excessively high\nspatial accuracy of the WENO scheme near the numerical shock structure.\nMoreover, the shock instability problem of fifth-order schemes is demonstrated\nto be a multidimensional coupling problem. To stably capture strong shocks, it\nis crucial to have sufficient dissipation on transverse faces and ensure at\nleast two points within the numerical shock structure in the direction\nperpendicular to the shock. The source location of instability is also\nclarified by the matrix stability analysis method, revealing that the\ninstability arises from the numerical shock structure. Additionally, stability\nanalysis demonstrates that local characteristic decomposition helps mitigate\nshock instabilities in high-order schemes, although the instability still\npersists. These conclusions pave the way for a better understanding of the\nshock instability in fifth-order schemes and provide guidance for the\ndevelopment of more reliable high-order shock-capturing methods for\ncompressible flows with high Mach numbers.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:24:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ren","Weijie",""],["Xie","Wenjia",""],["Zhang","Ye",""],["Yu","Hang",""],["Tian","Zhengyu",""]]}
{"id":"2308.03429","submitter":"Herman Sugiharto","authors":"Herman Sugiharto, Aradea, Husni Mubarok","title":"RCMHA: Relative Convolutional Multi-Head Attention for Natural Language\n  Modelling","comments":"13 pages, 13 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Attention module finds common usage in language modeling, presenting\ndistinct challenges within the broader scope of Natural Language Processing.\nMulti-Head Attention (MHA) employs an absolute positional encoding, which\nimposes limitations on token length and entails substantial memory consumption\nduring the processing of embedded inputs. The current remedy proposed by\nresearchers involves the utilization of relative positional encoding, similar\nto the approach adopted in Transformer-XL or Relative Multi-Head Attention\n(RMHA), albeit the employed architecture consumes considerable memory\nresources. To address these challenges, this study endeavors to refine MHA,\nleveraging relative positional encoding in conjunction with the Depth-Wise\nConvolutional Layer architecture, which promises heightened accuracy coupled\nwith minimized memory usage. The proposed RCMHA framework entails the\nmodification of two integral components: firstly, the application of the\nDepth-Wise Convolutional Layer to the input embedding, encompassing Query, Key,\nand Value parameters; secondly, the incorporation of Relative Positional\nEncoding into the attention scoring phase, harmoniously integrated with Scaled\nDot-Product Attention. Empirical experiments underscore the advantages of\nRCMHA, wherein it exhibits superior accuracy, boasting a score of 0.572 in\ncomparison to alternative attention modules such as MHA, Multi-DConv-Head\nAttention (MDHA), and RMHA. Concerning memory utilization, RMHA emerges as the\nmost frugal, demonstrating an average consumption of 2.98 GB, surpassing RMHA\nwhich necessitates 3.5 GB.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:24:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sugiharto","Herman",""],["Aradea","",""],["Mubarok","Husni",""]]}
{"id":"2308.03430","submitter":"San-Dong Guo","authors":"Hao-Tian Guo, San-Dong Guo and Yee Sin Ang","title":"Electric-field induced half-metal in monolayer CrSBr","comments":"6 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":"  Two-dimensional (2D) half-metallic materials are highly desirable for\nnanoscale spintronic applications. Here, we propose a new mechanism that can\nachieve half-metallicity in 2D ferromagnetic (FM) material with two-layer\nmagnetic atoms by electric field tuning. We use a concrete example of\nexperimentally synthesized CrSBr monolayer to illustrate our proposal through\nthe first-principle calculations. It is found that the half-metal can be\nachieved in CrSBr within appropriate electric field range, and the\ncorresponding amplitude of electric field intensity is available in experiment.\nJanus monolayer $\\mathrm{Cr_2S_2BrI}$ is constructed, which possesses built-in\nelectric field due to broken horizontal mirror symmetry. However,\n$\\mathrm{Cr_2S_2BrI}$ without and with applied external electric field is\nalways a FM semiconductor. A possible memory device is also proposed based on\nCrSBr monolayer. Our works will stimulate the application of 2D FM CrSBr in\nfuture spintronic nanodevices.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:24:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guo","Hao-Tian",""],["Guo","San-Dong",""],["Ang","Yee Sin",""]]}
{"id":"2308.03431","submitter":"Florian Messerer","authors":"Florian Messerer, Katrin Baumg\\\"artner, Armin Nurkanovi\\'c, Moritz\n  Diehl","title":"Approximate propagation of normal distributions for stochastic optimal\n  control of nonsmooth systems","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 method for the approximate propagation of mean and covariance of\na probability distribution through ordinary differential equations (ODE) with\ndiscontinous right-hand side. For piecewise affine systems, a normalization of\nthe propagated probability distribution at every time step allows us to\nanalytically compute the expectation integrals of the mean and covariance\ndynamics while explicitly taking into account the discontinuity. This leads to\na natural smoothing of the discontinuity such that for relevant levels of\nuncertainty the resulting ODE can be integrated directly with standard schemes\nand it is neither necessary to prespecify the switching sequence nor to use a\nswitch detection method. We then show how this result can be employed in the\nmore general case of piecewise smooth functions based on a structure preserving\nlinearization scheme. The resulting dynamics can be straightforwardly used\nwithin standard formulations of stochastic optimal control problems with chance\nconstraints.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:25:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Messerer","Florian",""],["Baumg\u00e4rtner","Katrin",""],["Nurkanovi\u0107","Armin",""],["Diehl","Moritz",""]]}
{"id":"2308.03432","submitter":"Yuxuan Zhang","authors":"Yuxuan Zhang, Lei Liu and Li Liu","title":"Cuing Without Sharing: A Federated Cued Speech Recognition Framework via\n  Mutual Knowledge Distillation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cued Speech (CS) is a visual coding tool to encode spoken languages at the\nphonetic level, which combines lip-reading and hand gestures to effectively\nassist communication among people with hearing impairments. The Automatic CS\nRecognition (ACSR) task aims to recognize CS videos into linguistic texts,\nwhich involves both lips and hands as two distinct modalities conveying\ncomplementary information. However, the traditional centralized training\napproach poses potential privacy risks due to the use of facial and gesture\nvideos in CS data. To address this issue, we propose a new Federated Cued\nSpeech Recognition (FedCSR) framework to train an ACSR model over the\ndecentralized CS data without sharing private information. In particular, a\nmutual knowledge distillation method is proposed to maintain cross-modal\nsemantic consistency of the Non-IID CS data, which ensures learning a unified\nfeature space for both linguistic and visual information. On the server side, a\nglobally shared linguistic model is trained to capture the long-term\ndependencies in the text sentences, which is aligned with the visual\ninformation from the local clients via visual-to-linguistic distillation. On\nthe client side, the visual model of each client is trained with its own local\ndata, assisted by linguistic-to-visual distillation treating the linguistic\nmodel as the teacher. To the best of our knowledge, this is the first approach\nto consider the federated ACSR task for privacy protection. Experimental\nresults on the Chinese CS dataset with multiple cuers demonstrate that our\napproach outperforms both mainstream federated learning baselines and existing\ncentralized state-of-the-art ACSR methods, achieving 9.7% performance\nimprovement for character error rate (CER) and 15.0% for word error rate (WER).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:26:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Yuxuan",""],["Liu","Lei",""],["Liu","Li",""]]}
{"id":"2308.03433","submitter":"Zhi Zhou","authors":"Siyu Cen, Zhi Zhou","title":"Numerical Reconstruction of Diffusion and Potential Coefficients from\n  Two Observations: Decoupled Recovery and Error Estimates","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The focus of this paper is on the concurrent reconstruction of both the\ndiffusion and potential coefficients present in an elliptic/parabolic equation,\nutilizing two internal measurements of the solutions. A decoupled algorithm is\nconstructed to sequentially recover these two parameters. In the first step, we\nimplement a straightforward reformulation that results in a standard problem of\nidentifying the diffusion coefficient. This coefficient is then numerically\nrecovered, with no requirement for knowledge of the potential, by utilizing an\noutput least-square method coupled with finite element discretization. In the\nsecond step, the previously recovered diffusion coefficient is employed to\nreconstruct the potential coefficient, applying a method similar to the first\nstep. Our approach is stimulated by a constructive conditional stability, and\nwe provide rigorous a priori error estimates in $L^2(\\Omega)$ for the recovered\ndiffusion and potential coefficients. Our approach is stimulated by a\nconstructive conditional stability, and we provide rigorous a priori error\nestimates in $L^2(\\Omega)$ for the recovered diffusion and potential\ncoefficients. To derive these estimates, we develop a weighted energy argument\nand suitable positivity conditions. These estimates offer a beneficial guide\nfor choosing regularization parameters and discretization mesh sizes, in\naccordance with the noise level. Some numerical experiments are presented to\ndemonstrate the accuracy of the numerical scheme and support our theoretical\nresults.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:28:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cen","Siyu",""],["Zhou","Zhi",""]]}
{"id":"2308.03434","submitter":"Christine Cheng","authors":"Christine T. Cheng","title":"Tyshkevich's Graph Decomposition and the Distinguishing Numbers of\n  Unigraphs","comments":"22 pages plus an appendix with 8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A $c$-labeling $\\phi: V(G) \\rightarrow \\{1, 2, \\hdots, c \\}$ of graph $G$ is\ndistinguishing if, for every non-trivial automorphism $\\pi$ of $G$, there is\nsome vertex $v$ so that $\\phi(v) \\neq \\phi(\\pi(v))$. The distinguishing number\nof $G$, $D(G)$, is the smallest $c$ such that $G$ has a distinguishing\n$c$-labeling.\n  We consider a compact version of Tyshkevich's graph decomposition theorem\nwhere trivial components are maximally combined to form a complete graph or a\ngraph of isolated vertices. Suppose the compact canonical decomposition of $G$\nis $G_{k} \\circ G_{k-1} \\circ \\cdots \\circ G_1 \\circ G_0$. We prove that $\\phi$\nis a distinguishing labeling of $G$ if and only if $\\phi$ is a distinguishing\nlabeling of $G_i$ when restricted to $V(G_i)$ for $i = 0, \\hdots, k$. Thus,\n$D(G) = \\max \\{D(G_i), i = 0, \\hdots, k \\}$. We then present an algorithm that\ncomputes the distinguishing number of a unigraph in linear time.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:32:12 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 18:42:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cheng","Christine T.",""]]}
{"id":"2308.03435","submitter":"Holger Nobach","authors":"Holger Nobach","title":"Differential Temperature Anemometer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Common thermal anemometers (hot-wire, hot-film, or similar) are based on the\nthermal equilibrium between the electrical power heating the sensor and the\nconvection of the ambient medium cooling the sensor. The response times of such\ninstruments are often insufficient in rapidly fluctuating flow processes due to\nthe thermal inertia of their sensing elements. By using the instantaneous\nimbalance between the heating and the cooling power, which leads to a\ntemperature gradient of the sensor, an instantaneous response of the\nmeasurement system can be achieved.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:33:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nobach","Holger",""]]}
{"id":"2308.03436","submitter":"Renier Hough Mr","authors":"Renier T. Hough, Douglas Rennehan, Chiaki Kobayashi, S. Ilani Loubser,\n  Romeel Dav\\'e, Arif Babul, Weiguang Cui","title":"SIMBA-C: An updated chemical enrichment model for galactic chemical\n  evolution in the SIMBA simulation","comments":"16 Pages, 9 Figure, 1 Table, Accepted for MNRAS publication: 8 August\n  2023, doi:10.1093/mnras/stad2394","journal-ref":null,"doi":"10.1093/mnras/stad2394","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new chemical enrichment and stellar feedback model into GIZMO,\nusing the SIMBA sub-grid models as a base. Based on the state-of-the-art\nchemical evolution model of Kobayashi et al., SIMBA-C tracks 34 elements from\nH$\\rightarrow$Ge and removes SIMBA's instantaneous recycling approximation.\nFurthermore, we make some minor improvements to SIMBA's base feedback models.\nSIMBA-C provides significant improvements on key diagnostics such as the knee\nof the $z=0$ galaxy stellar mass function, the faint end of the main sequence,\nand the ability to track black holes in dwarf galaxies. SIMBA-C also matches\nbetter with recent observations of the mass-metallicity relation at $z=0,2$. By\nnot assuming instantaneous recycling, SIMBA-C provides a much better match to\ngalactic abundance ratio measures such as [O/Fe] and [N/O]. SIMBA-C thus opens\nup new avenues to constrain feedback models using detailed chemical abundance\nmeasures across cosmic time.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:36:19 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 13:18:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hough","Renier T.",""],["Rennehan","Douglas",""],["Kobayashi","Chiaki",""],["Loubser","S. Ilani",""],["Dav\u00e9","Romeel",""],["Babul","Arif",""],["Cui","Weiguang",""]]}
{"id":"2308.03437","submitter":"Arijit Biswas","authors":"Arijit Biswas and Harald Mundt","title":"AudioVMAF: Audio Quality Prediction with VMAF","comments":"Accepted to 155th Audio Engineering Society (AES), New York, NY, USA,\n  October 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Video Multimethod Assessment Fusion (VMAF) [1], [2], [3] is a popular tool in\nthe industry for measuring coded video quality. In this study, we propose an\nauditory-inspired frontend in existing VMAF for creating videos of reference\nand coded spectrograms, and extended VMAF for measuring coded audio quality. We\nname our system AudioVMAF. We demonstrate that image replication is capable of\nfurther enhancing prediction accuracy, especially when band-limited anchors are\npresent. The proposed method significantly outperforms all existing visual\nquality features repurposed for audio, and even demonstrates a significant\noverall improvement of 7.8% and 2.0% of Pearson and Spearman rank correlation\ncoefficient, respectively, over a dedicated audio quality metric (ViSQOL-v3\n[4]) also inspired from the image domain.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:37:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Biswas","Arijit",""],["Mundt","Harald",""]]}
{"id":"2308.03438","submitter":"Jack Smith","authors":"Jack Smith","title":"Hochschild cohomology of the Fukaya category via Floer cohomology with\n  coefficients","comments":"55 pages, 9 figures, comments welcome, v2 typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a monotone Lagrangian $L$ in a compact symplectic manifold $X$, we\nconstruct a commutative diagram relating the closed-open string map $CO_\\lambda\n: QH^*(X) \\to HH^*(\\mathcal{F}(X)_\\lambda)$ to a variant of the length-zero\nclosed-open map on $L$ incorporating $\\mathbf{k}[H_1(L; \\mathbb{Z})]$\ncoefficients, denoted $CO^0_\\mathbf{L}$. The former is categorically important\nbut very difficult to compute, whilst the latter is geometrically natural and\namenable to calculation. We further show that, after a suitable completion,\ninjectivity of $CO^0_\\mathbf{L}$ implies injectivity of $CO_\\lambda$. Via\nSheridan's version of Abouzaid's generation criterion, this gives a powerful\ntool for proving split-generation of the Fukaya category. We illustrate this by\nshowing that the real part of a monotone toric manifold (of minimal Chern\nnumber at least 2) split-generates the Fukaya category in characteristic 2. We\nalso give a short new proof (modulo foundational assumptions in the\nnon-monotone case) that the Fukaya category of an arbitrary compact toric\nmanifold is split-generated by toric fibres.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:37:54 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 08:58:49 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Smith","Jack",""]]}
{"id":"2308.03439","submitter":"Arik Avagyan","authors":"Arik Avagyan","title":"A Result About the Classification of Quantum Covariance Matrices Based\n  on Their Eigenspectra","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":"  The set of valid covariance matrices of a continuous-variable quantum system\nwith a finite number of degrees of freedom is a strict subset of the set of\nreal positive-definite matrices due to Heisenberg's uncertainty principle. This\nhas the implication that, in general, not every orthogonal transform of a\ndiagonal quantum covariance matrix produces a valid quantum covariance matrix.\nA natural question thus arises, to find the set of quantum covariance matrices\nconsistent with a given eigenspectrum. For the special class of pure Gaussian\nstates the set of quantum covariance matrices with a given eigenspectrum\nconsists of a single orbit of the action of the orthogonal symplectic group.\nThe eigenspectra of the covariance matrices of this class of states are\ncomposed of pairs that each multiply to one. We describe a larger non-trivial\nclass of eigenspectra with the property that the set of quantum covariance\nmatrices corresponding to any eigenspectrum in this class are related by\northogonal symplectic transformations. Further, we show that all non-degenerate\neigenspectra with this property must belong to this class, and that the set of\nsuch eigenspectra coincides with the class of non-degenerate eigenspectra that\nidentify the physically relevant thermal and squeezing parameters of a Gaussian\nstate.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:40:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Avagyan","Arik",""]]}
{"id":"2308.03440","submitter":"Chen Gao","authors":"Chen Gao and Zhouping Xin","title":"Prandtl Boundary Layers in An Infinitely Long Convergent Channel","comments":null,"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 large Reynold number limits and asymptotic behaviors\nof solutions to the 2D steady Navier-Stokes equations in an infinitely long\nconvergent channel. It is shown that for a general convergent infinitely long\nnozzle whose boundary curves satisfy curvature-decreasing and any given finite\nnegative mass flux, the Prandtl's viscous boundary layer theory holds in the\nsense that there exists a Navier-Stokes flow with no-slip boundary condition\nfor small viscosity, which is approximated uniformly by the superposition of an\nEuler flow and a Prandtl flow. Moreover, the singular asymptotic behaviors of\nthe solution to the Navier-Stokes equations near the vertex of the nozzle and\nat infinity are determined by the given mass flux, which is also important for\nthe constructions of the Prandtl approximation solution due to the possible\nsingularities at the vertex and non-compactness of the nozzle. One of the key\ningredients in our analysis is that the curvature-decreasing condition on\nboundary curves of the convergent nozzle ensures that the limiting inviscid\nflow is pressure favourable and plays crucial roles in both the Prandtl\nexpansion and the stability analysis.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:44:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gao","Chen",""],["Xin","Zhouping",""]]}
{"id":"2308.03441","submitter":"Davide Bevacqua","authors":"Davide Bevacqua, Paolo Saracco, Francesco La Barbera, Giuseppe D'Ago,\n  Roberto de Propris, Ignacio Ferreras, Anna Gallazzi, Anna Pasquali, Chiara\n  Spiniello","title":"The elemental abundances of quiescent galaxies in the LEGA-C survey: the\n  (non-)evolution of [{\\alpha}/Fe] from z = 0.75 to z = 0","comments":"12 pages, 10 figures, 2 tables, 1 appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We measure the [${\\alpha}$/Fe] abundances for 183 quiescent galaxies at z =\n0.60 - 0.75 with stellar masses ranging 10.4 \\leq log10 10.4 $\\leq$ log10\n(M$_*$ /M$_\\odot$) $\\leq$ 11.6 selected from the LEGA-C survey. We estimate\n[${\\alpha}$/Fe] from the ratio of the spectral indices Mgb (${\\lambda} \\sim\n5177$ {\\AA}) and Fe4383, compared to predictions of simple stellar population\nmodels. We find that 91% of quiescents in our sample have supersolar\n[${\\alpha}$/Fe], with an average value of [${\\alpha}$/Fe] = +0.24 $\\pm$ 0.01.\nWe find no significant correlation between [${\\alpha}$/Fe] and stellar\nmetallicity, mass, velocity dispersion, and average formation time. Galaxies\nthat formed the bulk of their stellar mass on time scales shorter than 1 Gyr\nfollow the same [${\\alpha}$/Fe] distribution as those which formed on longer\ntime scales. In comparison to local early-type galaxies and to stacked spectra\nof quiescent galaxies at z = 0.38 and z = 0.07, we find that the average\n[${\\alpha}$/Fe] has not changed between z = 0.75 and the present time. Our work\nshows that the vast majority of massive quiescent galaxies at z $\\sim$ 0.7 are\n${\\alpha}$-enhanced, and that no detectable evolution of the average\n[${\\alpha}$/Fe] has taken place over the last $\\sim$ 6.5 Gyr.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:48:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bevacqua","Davide",""],["Saracco","Paolo",""],["La Barbera","Francesco",""],["D'Ago","Giuseppe",""],["de Propris","Roberto",""],["Ferreras","Ignacio",""],["Gallazzi","Anna",""],["Pasquali","Anna",""],["Spiniello","Chiara",""]]}
{"id":"2308.03442","submitter":"Hugo Nowacki","authors":"H. Nowacki, E. Alecian, K. Perraut, B. Zaire, C. P. Folsom, K.\n  Pouilly, J. Bouvier, R. Manick, G. Pantolmos, A. P. Sousa, C. Dougados, G. A.\n  J. Hussain, S. H. P. Alencar, J. B. Le Bouquin","title":"Star-disk interactions in the strongly accreting T Tauri Star S CrA N","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aims : We aimed at constraining the accretion-ejection phenomena around the\nstrongly-accreting Northern component of the S CrA young binary system (S CrA\nN) by deriving its magnetic field topology and its magnetospheric properties,\nand by detecting ejection signatures, if any.\n  Methods : We led a two-week observing campaign on S CrA N with the ESPaDOnS\noptical spectropolarimeter at the Canada-France-Hawaii Telescope. We recorded\n12 Stokes I and V spectra over 14 nights. We computed the corresponding\nLeast-Square Deconvolution (LSD) profiles of the photospheric lines and\nperformed Zeeman-Doppler Imaging (ZDI). We analysed the kinematics of\nnoticeable emission lines, namely He I $\\lambda 5876$ and the four first lines\nof the Balmer series, known to trace the accretion process.\n  Conclusions : The findings from spectropolarimetry are complementary to those\nprovided by optical long-baseline interferometry, allowing us to construct a\ncoherent view of the innermost regions of a young, strongly accreting star.\nYet, the strong and complex magnetic field reconstructed for S CrA N is\ninconsistent with the observed magnetic signatures of the emission lines\nassociated to the post-shock region. We recommend a multi-technique,\nsynchronized campaign of several days to put more constrains on a system that\nvaries on a $\\sim$ 1 day timescale.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 09:57:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nowacki","H.",""],["Alecian","E.",""],["Perraut","K.",""],["Zaire","B.",""],["Folsom","C. P.",""],["Pouilly","K.",""],["Bouvier","J.",""],["Manick","R.",""],["Pantolmos","G.",""],["Sousa","A. P.",""],["Dougados","C.",""],["Hussain","G. A. J.",""],["Alencar","S. H. P.",""],["Bouquin","J. B. Le",""]]}
{"id":"2308.03443","submitter":"Tatsuhiro Shimizu","authors":"Tatsuhiro Shimizu, Laura Forastiere","title":"Doubly Robust Estimator for Off-Policy Evaluation with Large Action\n  Spaces","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study Off-Policy Evaluation (OPE) in contextual bandit settings with large\naction spaces. The benchmark estimators suffer from severe bias and variance\ntradeoffs. Parametric approaches suffer from bias due to difficulty specifying\nthe correct model, whereas ones with importance weight suffer from variance. To\novercome these limitations, Marginalized Inverse Propensity Scoring (MIPS) was\nproposed to mitigate the estimator's variance via embeddings of an action. To\nmake the estimator more accurate, we propose the doubly robust estimator of\nMIPS called the Marginalized Doubly Robust (MDR) estimator. Theoretical\nanalysis shows that the proposed estimator is unbiased under weaker assumptions\nthan MIPS while maintaining variance reduction against IPS, which was the main\nadvantage of MIPS. The empirical experiment verifies the supremacy of MDR\nagainst existing estimators.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:00:07 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 10:34:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shimizu","Tatsuhiro",""],["Forastiere","Laura",""]]}
{"id":"2308.03444","submitter":"Paul R. Scovell","authors":"P. R. Scovell, E. Meehan, S. M. Paling, M. Thiesse, X. Liu, C. Ghag,\n  M. Ginsz, P. Quirin and D. Ralet","title":"Ultra-Low Background Germanium Assay at the Boulby Underground\n  Laboratory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As we move to an era where next generation low-background particle physics\nexperiments begin to be designed and constructed, the ability to assay\nmaterials with high sensitivity and at speed with a variety of techniques will\nbe key. This paper describes the Mirion Technologies (Canberra) specialty\nultra-low background detectors installed and commissioned at the Boulby\nUnderground Laboratory between 2017 and 2021. The low background levels of the\ndetectors combine with low background shielding and a radon-reduced dry\nnitrogen purge system to give sensitivity approaching the best in the world\nwithout the need for intricate shielding solutions. For an optimised sample\ngeometry, run for 100 days, it would be possible to reach close to 10\n$\\mu$Bq/kg ($10^{-12}$ g/g) for background isotopes of interest in neutrinoless\ndouble-beta decay.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:01:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Scovell","P. R.",""],["Meehan","E.",""],["Paling","S. M.",""],["Thiesse","M.",""],["Liu","X.",""],["Ghag","C.",""],["Ginsz","M.",""],["Quirin","P.",""],["Ralet","D.",""]]}
{"id":"2308.03445","submitter":"Ecaterina Sava-Huss","authors":"Nico Heizmann, Robin Kaiser, Ecaterina Sava-Huss","title":"Height probabilities for Abelian sandpiles and the looping constant on\n  Sierpinski graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the Abelian sandpile model and related quantities such as\nheight probabilities and looping constant on fractal graphs. In particular, we\ngive an algorithmic approach for calculating the height probabilities of\nrecurrent sandpiles under stationarity on finite iterations of the Sierpinski\ngraphs by using the connection between recurrent configurations of the Abelian\nsandpile Markov chain and uniform spanning trees. We also calculate the\nexpected fraction of vertices of height i for $i\\in\\{0,1,2,3\\}$ and expected\nbulk average height of sandpiles under stationarity and relate it to the\nlooping constant on the Sierpinski gasket.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:02:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Heizmann","Nico",""],["Kaiser","Robin",""],["Sava-Huss","Ecaterina",""]]}
{"id":"2308.03446","submitter":"Lorcan Conlon","authors":"Lorcan O. Conlon, Angus Walsh, Yuhan Hua, Oliver Thearle, Tobias Vogl,\n  Falk Eilenberger, Ping Koy Lam and Syed M. Assad","title":"Testing the postulates of quantum mechanics with coherent states of\n  light and homodyne detection","comments":"11 pages, comments very welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum mechanics has withstood every experimental test thus far. However, it\nrelies on ad-hoc postulates which require experimental verification. Over the\npast decade there has been a great deal of research testing these postulates,\nwith numerous tests of Born's rule for determining probabilities and the\ncomplex nature of the Hilbert space being carried out. Although these tests are\nyet to reveal any significant deviation from textbook quantum theory, it\nremains important to conduct such tests in different configurations and using\ndifferent quantum states. Here we perform the first such test using coherent\nstates of light in a three-arm interferometer combined with homodyne detection.\nOur proposed configuration requires additional assumptions, but allows us to\nuse quantum states which exist in a larger Hilbert space compared to previous\ntests. For testing Born's rule, we find that the third order interference is\nbounded to be $\\kappa$ = 0.002 $\\pm$ 0.004 and for testing whether quantum\nmechanics is complex or not we find a Peres parameter of F = 1.0000 $\\pm$\n0.0003 (F = 1 corresponds to the expected complex quantum mechanics). We also\nuse our experiment to test Glauber's theory of optical coherence.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:07:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Conlon","Lorcan O.",""],["Walsh","Angus",""],["Hua","Yuhan",""],["Thearle","Oliver",""],["Vogl","Tobias",""],["Eilenberger","Falk",""],["Lam","Ping Koy",""],["Assad","Syed M.",""]]}
{"id":"2308.03447","submitter":"Rita T. Sousa","authors":"Rita T. Sousa, Sara Silva, Heiko Paulheim, Catia Pesquita","title":"Biomedical Knowledge Graph Embeddings with Negative Statements","comments":"19 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A knowledge graph is a powerful representation of real-world entities and\ntheir relations. The vast majority of these relations are defined as positive\nstatements, but the importance of negative statements is increasingly\nrecognized, especially under an Open World Assumption. Explicitly considering\nnegative statements has been shown to improve performance on tasks such as\nentity summarization and question answering or domain-specific tasks such as\nprotein function prediction. However, no attention has been given to the\nexploration of negative statements by knowledge graph embedding approaches\ndespite the potential of negative statements to produce more accurate\nrepresentations of entities in a knowledge graph.\n  We propose a novel approach, TrueWalks, to incorporate negative statements\ninto the knowledge graph representation learning process. In particular, we\npresent a novel walk-generation method that is able to not only differentiate\nbetween positive and negative statements but also take into account the\nsemantic implications of negation in ontology-rich knowledge graphs. This is of\nparticular importance for applications in the biomedical domain, where the\ninadequacy of embedding approaches regarding negative statements at the\nontology level has been identified as a crucial limitation.\n  We evaluate TrueWalks in ontology-rich biomedical knowledge graphs in two\ndifferent predictive tasks based on KG embeddings: protein-protein interaction\nprediction and gene-disease association prediction. We conduct an extensive\nanalysis over established benchmarks and demonstrate that our method is able to\nimprove the performance of knowledge graph embeddings on all tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:08:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sousa","Rita T.",""],["Silva","Sara",""],["Paulheim","Heiko",""],["Pesquita","Catia",""]]}
{"id":"2308.03448","submitter":"Xin Jin","authors":"Xin Jin, Jia-Wen Xiao, Ling-Hao Han, Chunle Guo, Ruixun Zhang, Xialei\n  Liu, Chongyi Li","title":"Lighting Every Darkness in Two Pairs: A Calibration-Free Pipeline for\n  RAW Denoising","comments":"Accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Calibration-based methods have dominated RAW image denoising under extremely\nlow-light environments. However, these methods suffer from several main\ndeficiencies: 1) the calibration procedure is laborious and time-consuming, 2)\ndenoisers for different cameras are difficult to transfer, and 3) the\ndiscrepancy between synthetic noise and real noise is enlarged by high digital\ngain. To overcome the above shortcomings, we propose a calibration-free\npipeline for Lighting Every Drakness (LED), regardless of the digital gain or\ncamera sensor. Instead of calibrating the noise parameters and training\nrepeatedly, our method could adapt to a target camera only with few-shot paired\ndata and fine-tuning. In addition, well-designed structural modification during\nboth stages alleviates the domain gap between synthetic and real noise without\nany extra computational cost. With 2 pairs for each additional digital gain (in\ntotal 6 pairs) and 0.5% iterations, our method achieves superior performance\nover other calibration-based methods. Our code is available at\nhttps://github.com/Srameo/LED .\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:09:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jin","Xin",""],["Xiao","Jia-Wen",""],["Han","Ling-Hao",""],["Guo","Chunle",""],["Zhang","Ruixun",""],["Liu","Xialei",""],["Li","Chongyi",""]]}
{"id":"2308.03449","submitter":"Seungcheol Park","authors":"Seungcheol Park, Hojun Choi, U Kang","title":"Knowledge-preserving Pruning for Pre-trained Language Models without\n  Retraining","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a pre-trained language model, how can we efficiently compress it\nwithout retraining? Retraining-free structured pruning algorithms are crucial\nin pre-trained language model compression due to their significantly reduced\npruning cost and capability to prune large language models. However, existing\nretraining-free algorithms encounter severe accuracy degradation, as they fail\nto preserve the useful knowledge of pre-trained models. In this paper, we\npropose K-pruning (Knowledge-preserving pruning), an accurate retraining-free\nstructured pruning algorithm for pre-trained language models. K-pruning\nidentifies and prunes attention heads and neurons deemed to be superfluous,\nbased on the amount of their inherent knowledge. K-pruning applies an iterative\nprocess of pruning followed by knowledge reconstruction for each sub-layer to\npreserve the knowledge of the pre-trained models. Consequently, K-pruning shows\nup to 58.02%p higher F1 score than existing retraining-free pruning algorithms\nunder a high compression rate of 80% on the SQuAD benchmark.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:11:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Park","Seungcheol",""],["Choi","Hojun",""],["Kang","U",""]]}
{"id":"2308.03450","submitter":"Zicong Hong","authors":"Zicong Hong, Xiaoyu Qiu, Jian Lin, Wuhui Chen, Yue Yu, Hui Wang, Song\n  Guo, Wen Gao","title":"Intelligence-Endogenous Management Platform for Computing and Network\n  Convergence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Massive emerging applications are driving demand for the ubiquitous\ndeployment of computing power today. This trend not only spurs the recent\npopularity of the \\emph{Computing and Network Convergence} (CNC), but also\nintroduces an urgent need for the intelligentization of a management platform\nto coordinate changing resources and tasks in the CNC. Therefore, in this\narticle, we present the concept of an intelligence-endogenous management\nplatform for CNCs called \\emph{CNC brain} based on artificial intelligence\ntechnologies. It aims at efficiently and automatically matching the supply and\ndemand with high heterogeneity in a CNC via four key building blocks, i.e.,\nperception, scheduling, adaptation, and governance, throughout the CNC's life\ncycle. Their functionalities, goals, and challenges are presented. To examine\nthe effectiveness of the proposed concept and framework, we also implement a\nprototype for the CNC brain based on a deep reinforcement learning technology.\nAlso, it is evaluated on a CNC testbed that integrates two open-source and\npopular frameworks (OpenFaas and Kubernetes) and a real-world business dataset\nprovided by Microsoft Azure. The evaluation results prove the proposed method's\neffectiveness in terms of resource utilization and performance. Finally, we\nhighlight the future research directions of the CNC brain.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:12:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hong","Zicong",""],["Qiu","Xiaoyu",""],["Lin","Jian",""],["Chen","Wuhui",""],["Yu","Yue",""],["Wang","Hui",""],["Guo","Song",""],["Gao","Wen",""]]}
{"id":"2308.03451","submitter":"Anirban Ghosh","authors":"Sudipta Mandal, Anirban Ghosh","title":"Diffusion dynamics of an overdamped active ellipsoidal particle in two\n  dimensions","comments":"15 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shape asymmetry is the most abundant in nature and attracted great interest\nin recent research. The phenomenon is widely recognized: a free ellipsoidal\nBrownian particle displays anisotropic diffusion during short time intervals,\nwhich subsequently transitions to an isotropic diffusion pattern over longer\ntime scales. We have further expanded this concept to incorporate active\nellipsoidal particles characterized by an initial self-propelled velocity. In\nour previous study\\cite{ghosh2022persistence}, we derived the analytical\nexpressions and simulation results of the persistence probability of an active\nanisotropic particle without any external potential and with an external\nharmonic potential. This paper provides analytical and simulation results of\ndiffusion coefficients of an active ellipsoidal particle. In comparison to a\npassive particle, we demonstrate that the long-term diffusion coefficient of an\nactive particle is influenced by both the magnitude of the propulsion velocity\nand the rotational diffusion coefficient. We have also studied the\napproximations of different results for diffusion coefficients in $t\\ll\nD_\\theta^{-1}$ time-scale. We investigated diffusion dynamics for the free\nparticle as well as the particle in a harmonic trap, and the particle subject\nto a constant field force. Additionally, we have studied the scaled average\nvelocity of an ellipsoidal active particle in different force fields. We show\nanalytically and numerically that the long-term diffusion coefficient is\naltered by the presence of external forces in comparison to a free particle.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:13:21 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 05:47:41 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 12:36:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mandal","Sudipta",""],["Ghosh","Anirban",""]]}
{"id":"2308.03452","submitter":"Marco Fasondini","authors":"M. Fasondini, J.R. King, J.A.C. Weideman","title":"Complex-plane singularity dynamics for blow up in a nonlinear heat\n  equation: analysis and computation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.NA math.CA math.CV math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Blow-up solutions to a heat equation with spatial periodicity and a quadratic\nnonlinearity are studied through asymptotic analyses and a variety of numerical\nmethods. The focus is on the dynamics of the singularities in the complexified\nspace domain. Blow up in finite time is caused by these singularities\neventually reaching the real axis. The analysis provides a distinction between\nsmall and large nonlinear effects, as well as insight into the various time\nscales on which blow up is approached. It is shown that an ordinary\ndifferential equation with quadratic nonlinearity plays a central role in the\nasymptotic analysis. This equation is studied in detail, including its\nnumerical computation on multiple Riemann sheets, and the far-field solutions\nare shown to be given at leading order by a Weierstrass elliptic function.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:14:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fasondini","M.",""],["King","J. R.",""],["Weideman","J. A. C.",""]]}
{"id":"2308.03453","submitter":"Pietro Colangelo","authors":"Pietro Colangelo, Fulvia De Fazio, Francesco Loparco, Nicola Losacco","title":"Dalitz decays $D_{sJ}^{(*)} \\to D_s^{(*)} \\ell^+ \\ell^- $","comments":"LaTeX, 23 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"BARI-TH/23-749","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Dalitz decays of the positive parity $D_{sJ}^{(*)}$ charmed mesons,\n$D_{sJ}^{(*)} \\to D_s^{(*)} \\ell^+ \\ell^-$ with $J=0,1,2$ and $\\ell=e, \\mu$,\nare important processes to investigate the nature of the $D_{sJ}^{(*)}$ states.\nWe analyze the full set of decays, considering the four lightest $D_{sJ}^{(*)}$\nmesons as belonging to the heavy quark spin doublets $\\displaystyle\ns_\\ell^P=\\frac{1}{2}^+$ and $\\displaystyle \\frac{3}{2}^+$, with $s_\\ell^P$ the\nspin-parity of the light degrees of freedom in mesons. The description implies\nrelations among the observables in various modes. We study the decay\ndistributions in the dilepton invariant mass squared and the distributions in\nthe angle between the charged lepton momentum and the momentum of the produced\nmeson, which are expressed in terms of universal form factors and of effective\nstrong couplings. Such measurements are feasible at the present facilities.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:17:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Colangelo","Pietro",""],["De Fazio","Fulvia",""],["Loparco","Francesco",""],["Losacco","Nicola",""]]}
{"id":"2308.03454","submitter":"Yang Sun","authors":"Yang Sun, Kai-Ming Ho, Vladimir Antropov","title":"Metallization and Spin Fluctuations in Cu-doped Lead Apatite","comments":null,"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":"  An electronic structure and magnetic properties analysis of the recently\nproposed Cu-doped lead apatite is performed. We show that electronic structures\nof differently Cu-substituted structures are characterized by localized\nmolecular Cu-O bands at or near the Fermi level. The Cu substitutions can\nhappen at both Pb1 and Pb2 sites, leading to metallic and semiconducting states\ndifferently. The electronic states in these bands are highly unstable\nmagnetically and form clusters of rigidly ferromagnetically coupled magnetic\nmoments on Cu and neighboring oxygen atoms with a total moment of about 1\n$\\mu_B$. The ground state of uniformly Cu-doped lead apatite appears to be\nmagnetic and semiconducting. The non-uniform distribution of two Cu atoms at\nthe nearest Pb2 sites leads to an antiferromagnetic semiconducting state with\nformation energy close to uniformly distributed Cu configurations. The\ninclusion of quantum spin fluctuations confirms the stability of magnetic Cu-O\nclusters. Our calculations revealed the absence of the long-range magnetic\norder between uniformly distributed Cu-O clusters, creating the spin glass type\nof system.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:17:32 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 08:44:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Yang",""],["Ho","Kai-Ming",""],["Antropov","Vladimir",""]]}
{"id":"2308.03455","submitter":"Fabio Zanolin","authors":"Fabrizio Masullo, Fabio Zanolin, Josep Bonet Avalos","title":"Folding Domain Functions (FDF): a Random Variable Transformation\n  technique for the non-invertible case, with applications to RDEs","comments":"37 pages, 19 Box with figures in the pdf, 29 figures in the folder, 8\n  figures generated with TeX","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Random Variable Transformation (RVT) method is a fundamental tool for\ndetermining the probability distribution function associated with a Random\nVariable (RV) Y=g(X), where X is a RV and g is a suitable transformation. In\nthe usual applications of this method, one has to evaluate the derivative of\nthe inverse of g. This can be a straightforward procedure when g is invertible,\nwhile difficulties may arise when g is non-invertible. The RVT method has\nreceived a great deal of attention in the recent years, because of its crucial\nrelevance in many applications. In the present work we introduce a new approach\nwhich allows to determine the probability density function of the RV Y=g(X),\nwhen g is non-invertible due to its non-bijective nature. The main interest of\nour approach is that it can be easily implemented, from the numerical point of\nview, but mostly because of its low computational cost, which makes it very\ncompetitive. As a proof of concept, we apply our method to some numerical\nexamples related to random differential equations, as well as discrete\nmappings, all of them of interest in the domain of applied Physics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:18:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Masullo","Fabrizio",""],["Zanolin","Fabio",""],["Avalos","Josep Bonet",""]]}
{"id":"2308.03456","submitter":"Pablo Cerd\\'a-Dur\\'an","authors":"Carlos Pastor-Marcos, Pablo Cerd\\'a-Dur\\'an, Daniel Walker, Alejandro\n  Torres-Forn\\'e, Ernazar Abdikamalov, Sherwood Richers, Jos\\'e Antonio Font","title":"Bayesian inference from gravitational waves in fast-rotating,\n  core-collapse supernovae","comments":"16 pages, 22 pages, submitted to PRD","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Core-collapse supernovae (CCSNe) are prime candidates for gravitational-wave\ndetectors. The analysis of their complex waveforms can potentially provide\ninformation on the physical processes operating during the collapse of the iron\ncores of massive stars. In this work we analyze the early-bounce rapidly\nrotating CCSN signals reported in the waveform catalog of Richers et al 2017,\nwhich comprises over 1800 axisymmetric simulations extending up to about\n$10$~ms of post-bounce evolution. It was previously established that for a\nlarge range of progenitors, the amplitude of the bounce signal, $\\Delta h$, is\nproportional to the ratio of rotational-kinetic energy to potential energy,\nT/|W|, and the peak frequency, $f_{\\rm peak}$, is proportional to the square\nroot of the central rest-mass density. In this work, we exploit these relations\nto suggest that it could be possible to use such waveforms to infer\nprotoneutron star properties from a future gravitational wave observation, if\nthe distance and inclination are well known. Our approach relies on the ability\nto describe a subset of the waveforms in the early post-bounce phase in a\nsimple template form depending only on two parameters, $\\Delta h$ and $f_{\\rm\npeak}$. We use this template to perform a Bayesian inference analysis of\nwaveform injections in Gaussian colored noise for a network of three\ngravitational wave detectors formed by Advanced LIGO and Advanced Virgo. We\nshow that it is possible to recover the injected parameters, peak frequency and\namplitude, with an accuracy better than 10% for more than 50% of the detectable\nsignals (given known distance and inclination angle). However, inference on\nwaveforms from outside the Richers catalog is not reliable, indicating a need\nfor carefully verified waveforms of the first 10 ms after bounce of rapidly\nrotating supernovae of different progenitors with agreement between different\ncodes.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:19:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pastor-Marcos","Carlos",""],["Cerd\u00e1-Dur\u00e1n","Pablo",""],["Walker","Daniel",""],["Torres-Forn\u00e9","Alejandro",""],["Abdikamalov","Ernazar",""],["Richers","Sherwood",""],["Font","Jos\u00e9 Antonio",""]]}
{"id":"2308.03457","submitter":"Zhuang Qi","authors":"Zhuang Qi, Lei Meng, Zitan Chen, Han Hu, Hui Lin, Xiangxu Meng","title":"Cross-Silo Prototypical Calibration for Federated Learning with Non-IID\n  Data","comments":null,"journal-ref":null,"doi":"10.1145/3581783.361248","report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated Learning aims to learn a global model on the server side that\ngeneralizes to all clients in a privacy-preserving manner, by leveraging the\nlocal models from different clients. Existing solutions focus on either\nregularizing the objective functions among clients or improving the aggregation\nmechanism for the improved model generalization capability. However, their\nperformance is typically limited by the dataset biases, such as the\nheterogeneous data distributions and the missing classes. To address this\nissue, this paper presents a cross-silo prototypical calibration method\n(FedCSPC), which takes additional prototype information from the clients to\nlearn a unified feature space on the server side. Specifically, FedCSPC first\nemploys the Data Prototypical Modeling (DPM) module to learn data patterns via\nclustering to aid calibration. Subsequently, the cross-silo prototypical\ncalibration (CSPC) module develops an augmented contrastive learning method to\nimprove the robustness of the calibration, which can effectively project\ncross-source features into a consistent space while maintaining clear decision\nboundaries. Moreover, the CSPC module's ease of implementation and\nplug-and-play characteristics make it even more remarkable. Experiments were\nconducted on four datasets in terms of performance comparison, ablation study,\nin-depth analysis and case study, and the results verified that FedCSPC is\ncapable of learning the consistent features across different data sources of\nthe same class under the guidance of calibrated model, which leads to better\nperformance than the state-of-the-art methods. The source codes have been\nreleased at https://github.com/qizhuang-qz/FedCSPC.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:25:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Qi","Zhuang",""],["Meng","Lei",""],["Chen","Zitan",""],["Hu","Han",""],["Lin","Hui",""],["Meng","Xiangxu",""]]}
{"id":"2308.03458","submitter":"Rodrigo Leiva","authors":"J. L. Ortiz, C. L. Pereira, B. Sicardy, F. Braga-Ribas, A. Takey, A.\n  M. Fouad, A. A. Shaker, S. Kaspi, N. Brosch, M. Kretlow, R. Leiva, J.\n  Desmars, B. E. Morgado, N. Morales, M. Vara-Lubiano, P. Santos-Sanz, E.\n  Fern\\'andez-Valenzuela, D. Souami, R. Duffard, F. L. Rommel, Y. Kilic, O.\n  Erece, D. Koseoglu, E. Ege, R. Morales, A. Alvarez-Candal, J. L. Rizos, J. M.\n  G\\'omez-Lim\\'on, M. Assafin, R. Vieira-Martins, A. R. Gomes-J\\'unior, J. I.\n  B. Camargo, and J. Lecacheux","title":"The changing material around (2060) Chiron from an occultation on 2022\n  December 15","comments":"6 pages, 4, figures","journal-ref":"A&A 676, L12 (2023)","doi":"10.1051/0004-6361/202347025","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We could accurately predict the shadow path and successfully observe an\noccultation of a bright star by Chiron on 2022 December 15. The Kottamia\nAstronomical Observatory in Egypt did not detect the occultation by the solid\nbody, but we detected three extinction features in the light curve that had\nsymmetrical counterparts with respect to the central time of the occultation.\nOne of the features is broad and shallow, whereas the other two features are\nsharper with a maximum extinction of $\\sim$25$\\%$ at the achieved spatial\nresolution of 19 km per data point. From the Wise observatory in Israel, we\ndetected the occultation caused by the main body and several extinction\nfeatures surrounding the body. When all the secondary features are plotted in\nthe sky plane we find that they can be caused by a broad $\\sim$580 km disk with\nconcentrations at radii of 325 \\pm 16 km and 423 \\pm 11 km surrounding Chiron.\nAt least one of these structures appears to be outside the Roche limit. The\necliptic coordinates of the pole of the disk are $\\lambda$ = 151$^\\circ~\\pm$\n8$^\\circ$ and $\\beta$ = 18$^\\circ~\\pm$ 11$^\\circ$, in agreement with previous\nresults. We also show our long-term photometry indicating that Chiron had\nsuffered a brightness outburst of at least 0.6 mag between March and September\n2021 and that Chiron was still somewhat brighter at the occultation date than\nat its nominal pre-outburst phase. The outermost extinction features might be\nconsistent with a bound or temporarily bound structure associated with the\nbrightness increase. However, the nature of the brightness outburst is unclear,\nand it is also unclear whether the dust or ice released in the outburst could\nbe feeding a putative ring structure or if it emanated from it.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:26:18 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ortiz","J. L.",""],["Pereira","C. L.",""],["Sicardy","B.",""],["Braga-Ribas","F.",""],["Takey","A.",""],["Fouad","A. M.",""],["Shaker","A. A.",""],["Kaspi","S.",""],["Brosch","N.",""],["Kretlow","M.",""],["Leiva","R.",""],["Desmars","J.",""],["Morgado","B. E.",""],["Morales","N.",""],["Vara-Lubiano","M.",""],["Santos-Sanz","P.",""],["Fern\u00e1ndez-Valenzuela","E.",""],["Souami","D.",""],["Duffard","R.",""],["Rommel","F. L.",""],["Kilic","Y.",""],["Erece","O.",""],["Koseoglu","D.",""],["Ege","E.",""],["Morales","R.",""],["Alvarez-Candal","A.",""],["Rizos","J. L.",""],["G\u00f3mez-Lim\u00f3n","J. M.",""],["Assafin","M.",""],["Vieira-Martins","R.",""],["Gomes-J\u00fanior","A. R.",""],["Camargo","J. I. B.",""],["Lecacheux","J.",""]]}
{"id":"2308.03459","submitter":"Mathieu Baillif","authors":"Mathieu Baillif","title":"Non-metrizable manifolds and contractibility","comments":"26 pages, 12 figures. Section 6 contains the preprint\n  arXiv:1908.09901","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate whether non-metrizable manifolds in various classes can be\nhomotopy equivalent to a CW-complex (in short: heCWc), and in particular\ncontractible. We show that a non-metrizable manifold cannot be heCWc if it has\none of the following properties: it contains a countably compact non-compact\nsubspace; it contains a copy of an $\\omega_1$-compact subset of an\n$\\omega_1$-tree; it contains a non-Lindel\\\"of closed subspace functionally\nnarrow in it. (These results hold for more general spaces than just manifolds.)\nWe also show that the positive part of the tangent bundle of the long ray is\nnot heCWc (for any smoothing). These theorems follow from stabilization\nproperties of real valued maps. On a more geometric side, we also show that the\nPr\\\"ufer surface, which has been shown to be contractible long ago, has an open\nsubmanifold which is not heCWc. On the other end of the spectrum, we show that\nthere is a non-metrizable contractible Type I surface.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:31:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Baillif","Mathieu",""]]}
{"id":"2308.03460","submitter":"Andreas Kofler","authors":"Andreas Kofler, Kirsten Miriam Kerkering, Laura G\\\"oschel, Ariane\n  Fillmer, Cristoph Kolbitsch","title":"Quantitative MR Image Reconstruction using Parameter-Specific Dictionary\n  Learning with Adaptive Dictionary-Size and Sparsity-Level Choice","comments":"Accepted for publication in IEEE Transactions on Biomedical\n  Engineering, see https://ieeexplore.ieee.org/document/10209588","journal-ref":null,"doi":"10.1109/TBME.2023.3300090","report-no":null,"categories":"eess.IV eess.SP physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Objective: We propose a method for the reconstruction of parameter-maps in\nQuantitative Magnetic Resonance Imaging (QMRI).\n  Methods: Because different quantitative parameter-maps differ from each other\nin terms of local features, we propose a method where the employed dictionary\nlearning (DL) and sparse coding (SC) algorithms automatically estimate the\noptimal dictionary-size and sparsity level separately for each parameter-map.\nWe evaluated the method on a $T_1$-mapping QMRI problem in the brain using the\nBrainWeb data as well as in-vivo brain images acquired on an ultra-high field\n7T scanner. We compared it to a model-based acceleration for parameter mapping\n(MAP) approach, other sparsity-based methods using total variation (TV),\nWavelets (Wl) and Shearlets (Sh), and to a method which uses DL and SC to\nreconstruct qualitative images, followed by a non-linear (DL+Fit).\n  Results: Our algorithm surpasses MAP, TV, Wl and Sh in terms of RMSE and\nPSNR. It yields better or comparable results to DL+Fit by additionally\nsignificantly accelerating the reconstruction by a factor of approximately\nseven.\n  Conclusion: The proposed method outperforms the reported methods of\ncomparison and yields accurate $T_1$-maps. Although presented for $T_1$-mapping\nin the brain, our method's structure is general and thus most probably also\napplicable for the the reconstruction of other quantitative parameters in other\norgans.\n  Significance: From a clinical perspective, the obtained $T_1$-maps could be\nutilized to differentiate between healthy subjects and patients with\nAlzheimer's disease. From a technical perspective, the proposed unsupervised\nmethod could be employed to obtain ground-truth data for the development of\ndata-driven methods based on supervised learning.+\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:34:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kofler","Andreas",""],["Kerkering","Kirsten Miriam",""],["G\u00f6schel","Laura",""],["Fillmer","Ariane",""],["Kolbitsch","Cristoph",""]]}
{"id":"2308.03461","submitter":"Mariella Kast","authors":"Mariella Kast, Jan S Hesthaven","title":"Positional Embeddings for Solving PDEs with Evolutional Deep Neural\n  Networks","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 extends the paradigm of evolutional deep neural networks (EDNNs) to\nsolving parametric time-dependent partial differential equations (PDEs) on\ndomains with geometric structure. By introducing positional embeddings based on\neigenfunctions of the Laplace-Beltrami operator, geometric properties are\nencoded intrinsically and Dirichlet, Neumann and periodic boundary conditions\nof the PDE solution are enforced directly through the neural network\narchitecture. The proposed embeddings lead to improved error convergence for\nstatic PDEs and extend EDNNs towards computational domains of realistic\ncomplexity. Several steps are taken to improve performance of EDNNs: Solving\nthe EDNN update equation with a Krylov solver avoids the explicit assembly of\nJacobians and enables scaling to larger neural networks. Computational\nefficiency is further improved by an ad-hoc active sampling scheme that uses\nthe PDE dynamics to effectively sample collocation points. A modified linearly\nimplicit Rosenbrock method is proposed to alleviate the time step requirements\nof stiff PDEs. Lastly, a completely training-free approach, which automatically\nenforces initial conditions and only requires time integration, is compared\nagainst EDNNs that are trained on the initial conditions. We report results for\nthe Korteweg-de Vries equation, a nonlinear heat equation and (nonlinear)\nadvection-diffusion problems on domains with and without holes and various\nboundary conditions, to demonstrate the effectiveness of the method. The\nnumerical results highlight EDNNs as a promising surrogate model for\nparametrized PDEs with slow decaying Kolmogorov n-width.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:39:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kast","Mariella",""],["Hesthaven","Jan S",""]]}
{"id":"2308.03462","submitter":"Rahul Kothari","authors":"Rahul Kothari (IIT Mandi and Western Cape U.) and Roy Maartens\n  (Western Cape U. and Portsmouth U., ICG)","title":"A geometrical interpretation of foreground filters for HI intensity","comments":"10 Pages + 4 Figures + 1 Appendix + References. (Version 2 with\n  slight modifications)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We give a new geometrical interpretation of HI intensity mapping foreground\nfilters in harmonic space, for both single-dish and interferometer mode\nsurveys. We derive the foreground-filtered HI auto power spectrum and then\nextend this to the cross-power spectrum of HI with CMB lensing. Foreground\nfiltering leads to a loss of isotropy in Fourier space, resulting in harmonic\nspace non-diagonal correlations, which we show are small compared to the\ndiagonal ones. On large scales, foreground filters lead to a major loss of\npower in the HI$\\,\\times\\,$CMB lensing correlations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:39:53 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 10:00:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kothari","Rahul","","IIT Mandi and Western Cape U."],["Maartens","Roy","","Western Cape U. and Portsmouth U., ICG"]]}
{"id":"2308.03463","submitter":"Zhongjie Duan","authors":"Zhongjie Duan, Lizhou You, Chengyu Wang, Cen Chen, Ziheng Wu, Weining\n  Qian, Jun Huang","title":"DiffSynth: Latent In-Iteration Deflickering for Realistic Video\n  Synthesis","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, diffusion models have emerged as the most powerful approach\nin image synthesis. However, applying these models directly to video synthesis\npresents challenges, as it often leads to noticeable flickering contents.\nAlthough recently proposed zero-shot methods can alleviate flicker to some\nextent, we still struggle to generate coherent videos. In this paper, we\npropose DiffSynth, a novel approach that aims to convert image synthesis\npipelines to video synthesis pipelines. DiffSynth consists of two key\ncomponents: a latent in-iteration deflickering framework and a video\ndeflickering algorithm. The latent in-iteration deflickering framework applies\nvideo deflickering to the latent space of diffusion models, effectively\npreventing flicker accumulation in intermediate steps. Additionally, we propose\na video deflickering algorithm, named patch blending algorithm, that remaps\nobjects in different frames and blends them together to enhance video\nconsistency. One of the notable advantages of DiffSynth is its general\napplicability to various video synthesis tasks, including text-guided video\nstylization, fashion video synthesis, image-guided video stylization, video\nrestoring, and 3D rendering. In the task of text-guided video stylization, we\nmake it possible to synthesize high-quality videos without cherry-picking. The\nexperimental results demonstrate the effectiveness of DiffSynth. All videos can\nbe viewed on our project page. Source codes will also be released.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:41:52 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 07:54:55 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 02:26:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Duan","Zhongjie",""],["You","Lizhou",""],["Wang","Chengyu",""],["Chen","Cen",""],["Wu","Ziheng",""],["Qian","Weining",""],["Huang","Jun",""]]}
{"id":"2308.03464","submitter":"Mieczys{\\l}aw K{\\l}opotek","authors":"Mieczys{\\l}aw A. K{\\l}opotek","title":"Wide Gaps and Clustering Axioms","comments":"14 Theorems. arXiv admin note: substantial text overlap with\n  arXiv:2211.17036","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The widely applied k-means algorithm produces clusterings that violate our\nexpectations with respect to high/low similarity/density and is in conflict\nwith Kleinberg's axiomatic system for distance based clustering algorithms that\nformalizes those expectations in a natural way. k-means violates in particular\nthe consistency axiom. We hypothesise that this clash is due to the not\nexplicated expectation that the data themselves should have the property of\nbeing clusterable in order to expect the algorithm clustering hem to fit a\nclustering axiomatic system. To demonstrate this, we introduce two new\nclusterability properties, variational k-separability and residual\nk-separability and show that then the Kleinberg's consistency axiom holds for\nk-means operating in the Euclidean or non-Euclidean space. Furthermore, we\npropose extensions of k-means algorithm that fit approximately the Kleinberg's\nrichness axiom that does not hold for k-means. In this way, we reconcile\nk-means with Kleinberg's axiomatic framework in Euclidean and non-Euclidean\nsettings. Besides contribution to the theory of axiomatic frameworks of\nclustering and for clusterability theory, practical contribution is the\npossibility to construct {datasets for testing purposes of algorithms\noptimizing k-means cost function. This includes a method of construction of\n{clusterable data with known in advance global optimum.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:43:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["K\u0142opotek","Mieczys\u0142aw A.",""]]}
{"id":"2308.03465","submitter":"Eli Kraisler","authors":"Yuli Goshen and Eli Kraisler","title":"Energy of a many-electron system in an ensemble ground-state, versus\n  electron number and spin: piecewise-linearity and flat plane condition\n  generalized","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.atom-ph physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Description of the total energy of a many-electron system, $E$, as a function\nof the total number of electrons $N_\\textrm{tot}$ (integer or fractional) is of\ngreat importance in atomic and molecular physics, theoretical chemistry and\nmaterials science. Equally significant is the correct dependence of the energy\non the spin of the system, $S_\\textrm{tot}$. In this Letter we extend previous\nwork, allowing both $N_\\textrm{tot}$ and $S_\\textrm{tot}$ to vary continuously,\ntaking on both integer and fractional values, rigorously considering systems\nwith arbitrary values of $N_\\textrm{tot}$ and of the equilibrium spin. We\ndescribe the ground state of a finite, many-electron system by an ensemble of\npure states, and characterize the dependence of the energy and the\nspin-densities on both $N_\\textrm{tot}$ and $S_\\textrm{tot}$. Our findings\ngeneralize the piecewise-linearity principle of Phys. Rev. Lett. 49, 1691\n(1982) and the flat-plane condition of Phys. Rev. Lett. 102, 066403 (2009). We\nfind that the ensemble ground state consists of four pure states at most,\nprovided that the absolute value of the spin is smaller or equal to its\nequilibrium value, for a given $N_\\textrm{tot}$. As a result, a degeneracy in\nthe ensemble ground-state occurs, such that the total energy and the density\nare unique, but the spin-densities are not. Moreover, we find a new type of a\nderivative discontinuity, which manifests in the case of spin variation at\nconstant $N_\\textrm{tot}$, as a jump in the Kohn-Sham potential at the edges of\nthe variation range. Our findings serve as a basis for development of advanced\napproximations in density functional theory and other many-electron methods.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:46:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Goshen","Yuli",""],["Kraisler","Eli",""]]}
{"id":"2308.03466","submitter":"Stephan Mennicke","authors":"Tobias Sch\\\"uler and Stephan Mennicke and Malte Lochau","title":"Abstract Domains for Database Manipulating Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Database manipulating systems (DMS) formalize operations on relational\ndatabases like adding new tuples or deleting existing ones. To ensure\nsufficient expressiveness for capturing practical database systems, DMS\noperations incorporate guarding expressions first-order formulas over countable\nvalue domains. Those features impose infinite state, infinitely branching\nprocesses thus making automated reasoning about properties like the\nreachability of states intractable. Most recent approaches, therefore, restrict\nDMS to obtain decidable fragments. Nevertheless, a comprehensive semantic\nframework capturing full DMS, yet incorporating effective notions of data\nabstraction and process equivalence is an open issue. In this paper, we propose\nDMS process semantics based on principles of abstract interpretation. The\nconcrete domain consists of all valid databases, whereas the abstract domain\nemploys different constructions for unifying sets of databases being\nsemantically equivalent up to particular fragments of the DMS guard language.\nThe connection between abstract and concrete domains is effectively established\nby homomorphic mappings whose properties and restrictions depend on the\nexpressiveness of the DMS fragment under consideration. We instantiate our\nframework for canonical DMS fragments and investigate semantical preservation\nof abstractions up to bisimilarity, being one of the strongest equivalence\nnotions for operational process semantics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:46:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sch\u00fcler","Tobias",""],["Mennicke","Stephan",""],["Lochau","Malte",""]]}
{"id":"2308.03467","submitter":"Guruprasad Parasnis","authors":"Guruprasad Parasnis, Anmol Chokshi, Kailas Devadkar","title":"RoadScan: A Novel and Robust Transfer Learning Framework for Autonomous\n  Pothole Detection in Roads","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research paper presents a novel approach to pothole detection using Deep\nLearning and Image Processing techniques. The proposed system leverages the\nVGG16 model for feature extraction and utilizes a custom Siamese network with\ntriplet loss, referred to as RoadScan. The system aims to address the critical\nissue of potholes on roads, which pose significant risks to road users.\nAccidents due to potholes on the roads have led to numerous accidents. Although\nit is necessary to completely remove potholes, it is a time-consuming process.\nHence, a general road user should be able to detect potholes from a safe\ndistance in order to avoid damage. Existing methods for pothole detection\nheavily rely on object detection algorithms which tend to have a high chance of\nfailure owing to the similarity in structures and textures of a road and a\npothole. Additionally, these systems utilize millions of parameters thereby\nmaking the model difficult to use in small-scale applications for the general\ncitizen. By analyzing diverse image processing methods and various\nhigh-performing networks, the proposed model achieves remarkable performance in\naccurately detecting potholes. Evaluation metrics such as accuracy, EER,\nprecision, recall, and AUROC validate the effectiveness of the system.\nAdditionally, the proposed model demonstrates computational efficiency and\ncost-effectiveness by utilizing fewer parameters and data for training. The\nresearch highlights the importance of technology in the transportation sector\nand its potential to enhance road safety and convenience. The network proposed\nin this model performs with a 96.12 % accuracy, 3.89 % EER, and a 0.988 AUROC\nvalue, which is highly competitive with other state-of-the-art works.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:47:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Parasnis","Guruprasad",""],["Chokshi","Anmol",""],["Devadkar","Kailas",""]]}
{"id":"2308.03468","submitter":"Edward Malec","authors":"Edward Malec","title":"The mass density contrast in perturbed\n  Friedman-Lemaitre-Robertson-Walker cosmologies","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze the evolution of the mass density contrast in spherical\nperturbations of flat Friedman-Lemaitre-Robertson-Walker cosmologies. Both dark\nmatter and dark energy are included. In the absence of dark energy the\nevolution equation coincides with that obtained by Bonnor within the\n``Newtonian cosmology''.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:50:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Malec","Edward",""]]}
{"id":"2308.03469","submitter":"Harmandeep Kaur","authors":"Harmandeep Kaur, Abhishek Pandey and Gauree Shanker","title":"Conformal Warped Product Submersion","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, the concept of Riemannian warped product submersion is\ngeneralized to the conformal case. We introduce the notion of conformal warped\nproduct submersion. It is a submersion between warped product manifolds that\npreserves angles between the horizontal vectors. The fundamental tensors of\nsubmersion are derived for conformal warped product submersion.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:51:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kaur","Harmandeep",""],["Pandey","Abhishek",""],["Shanker","Gauree",""]]}
{"id":"2308.03470","submitter":"Taichi Liu","authors":"Taichi Liu, Chen Gao, Zhenyu Wang, Dong Li, Jianye Hao, Depeng Jin and\n  Yong Li","title":"Uncertainty-aware Consistency Learning for Cold-Start Item\n  Recommendation","comments":"Accepted by SIGIR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph Neural Network (GNN)-based models have become the mainstream approach\nfor recommender systems. Despite the effectiveness, they are still suffering\nfrom the cold-start problem, i.e., recommend for few-interaction items.\nExisting GNN-based recommendation models to address the cold-start problem\nmainly focus on utilizing auxiliary features of users and items, leaving the\nuser-item interactions under-utilized. However, embeddings distributions of\ncold and warm items are still largely different, since cold items' embeddings\nare learned from lower-popularity interactions, while warm items' embeddings\nare from higher-popularity interactions. Thus, there is a seesaw phenomenon,\nwhere the recommendation performance for the cold and warm items cannot be\nimproved simultaneously. To this end, we proposed a Uncertainty-aware\nConsistency learning framework for Cold-start item recommendation (shorten as\nUCC) solely based on user-item interactions. Under this framework, we train the\nteacher model (generator) and student model (recommender) with consistency\nlearning, to ensure the cold items with additionally generated low-uncertainty\ninteractions can have similar distribution with the warm items. Therefore, the\nproposed framework improves the recommendation of cold and warm items at the\nsame time, without hurting any one of them. Extensive experiments on benchmark\ndatasets demonstrate that our proposed method significantly outperforms\nstate-of-the-art methods on both warm and cold items, with an average\nperformance improvement of 27.6%.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:56:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Taichi",""],["Gao","Chen",""],["Wang","Zhenyu",""],["Li","Dong",""],["Hao","Jianye",""],["Jin","Depeng",""],["Li","Yong",""]]}
{"id":"2308.03471","submitter":"Sohail Ahmed Khan","authors":"Sohail Ahmed Khan and Duc-Tien Dang-Nguyen","title":"Deepfake Detection: A Comparative Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper present a comprehensive comparative analysis of supervised and\nself-supervised models for deepfake detection. We evaluate eight supervised\ndeep learning architectures and two transformer-based models pre-trained using\nself-supervised strategies (DINO, CLIP) on four benchmarks (FakeAVCeleb,\nCelebDF-V2, DFDC, and FaceForensics++). Our analysis includes intra-dataset and\ninter-dataset evaluations, examining the best performing models, generalisation\ncapabilities, and impact of augmentations. We also investigate the trade-off\nbetween model size and performance. Our main goal is to provide insights into\nthe effectiveness of different deep learning architectures (transformers,\nCNNs), training strategies (supervised, self-supervised), and deepfake\ndetection benchmarks. These insights can help guide the development of more\naccurate and reliable deepfake detection systems, which are crucial in\nmitigating the harmful impact of deepfakes on individuals and society.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:57:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Khan","Sohail Ahmed",""],["Dang-Nguyen","Duc-Tien",""]]}
{"id":"2308.03472","submitter":"Lucas English","authors":"Lucas English, Mahdi Abolghasemi","title":"How to forecast power generation in wind farms? Insights from leveraging\n  hierarchical structure","comments":"22 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Forecasting of renewable energy generation provides key insights which may\nhelp with decision-making towards global decarbonisation. Renewable energy\ngeneration can often be represented through cross-sectional hierarchies,\nwhereby a single farm may have multiple individual generators. Hierarchical\nforecasting through reconciliation has demonstrated a significant increase in\nthe quality of forecasts both theoretically and empirically. However, it is not\nevident whether forecasts generated by individual temporal and cross-sectional\naggregation can be superior to integrated cross-temporal forecasts and to\nindividual forecasts on more granular data. In this study, we investigate the\naccuracies of different cross-sectional and cross-temporal reconciliation\nmethods using both linear regression and gradient boosting machine learning for\nforecasting wind farm power generation. We found that cross-temporal\nreconciliation is superior to individual cross-sectional reconciliation at\nmultiple temporal aggregations. Cross-temporally reconciled machine learning\nbase forecasts also demonstrated a high accuracy at coarser temporal\ngranularities, which may encourage adoption for short-term wind forecasts. We\nalso show that linear regression can outperform machine learning models across\nmost levels in cross-sectional wind time series.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:02:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["English","Lucas",""],["Abolghasemi","Mahdi",""]]}
{"id":"2308.03473","submitter":"Xiao Shen","authors":"Riddhipratim Basu, Xiao Shen","title":"Time correlations in KPZ models with diffusive initial conditions","comments":"47 pages, 3 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":"  Temporal correlation for randomly growing interfaces in the KPZ universality\nclass is a topic of recent interest. Most of the works so far have been\nconcentrated on the zero temperature model of exponential last passage\npercolation, and three special initial conditions, namely droplet, flat and\nstationary. We focus on studying the time correlation problem for generic\nrandom initial conditions with diffusive growth. We formulate our results in\nterms of the positive temperature exactly solvable model of the inverse-gamma\npolymer and obtain up to constant upper and lower bounds for the correlation\nbetween the free energy of two polymers whose endpoints are close together or\nfar apart. The exponents match the zero temperature results obtained in\n(Ferrari-Occelli'19) in the stationary case following the conjectures of\n(Ferrari-Spohn'16). Our proofs apply almost verbatim to the zero temperature\nset-up of exponential LPP and are valid for a broad class of initial\nconditions. Our arguments rely on the one point moderate deviation estimates\nwhich have recently been obtained using stationary polymer techniques and thus\ndo not depend on complicated exact formulae.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:04:33 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 09:51:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Basu","Riddhipratim",""],["Shen","Xiao",""]]}
{"id":"2308.03474","submitter":"Maximilian H\\\"orl","authors":"Maximilian H\\\"orl and Christian Rohde","title":"Rigorous Derivation of Discrete Fracture Models for Darcy Flow in the\n  Limit of Vanishing Aperture","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 single-phase flow in a fractured porous medium governed by\nDarcy's law with spatially varying hydraulic conductivity matrices in both bulk\nand fractures. The width-to-length ratio of a fracture is of the order of a\nsmall parameter $\\varepsilon$ and the ratio $K_\\mathrm{f}^\\star /\nK_\\mathrm{b}^\\star$ of the characteristic hydraulic conductivities in the\nfracture and bulk domains is assumed to scale with $\\varepsilon^\\alpha$ for a\nparameter $\\alpha \\in \\mathbb{R}$. The fracture geometry is parameterized by\naperture functions on a submanifold of codimension one. Given a fracture, we\nderive the limit models as $\\varepsilon \\rightarrow 0$. Depending on the value\nof $\\alpha$, we obtain five different limit models as $\\varepsilon \\rightarrow\n0$, for which we present rigorous convergence results.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:05:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["H\u00f6rl","Maximilian",""],["Rohde","Christian",""]]}
{"id":"2308.03475","submitter":"Chaoya Jiang","authors":"Chaoya Jiang, Haiyang Xu, Wei Ye, Qinghao Ye, Chenliang Li, Ming Yan,\n  Bin Bi, Shikun Zhang, Ji Zhang, Fei Huang","title":"COPA: Efficient Vision-Language Pre-training Through Collaborative\n  Object- and Patch-Text Alignment","comments":"Accepted on ACM MM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vision-Language Pre-training (VLP) methods based on object detection enjoy\nthe rich knowledge of fine-grained object-text alignment but at the cost of\ncomputationally expensive inference. Recent Visual-Transformer (ViT)-based\napproaches circumvent this issue while struggling with long visual sequences\nwithout detailed cross-modal alignment information. This paper introduces a\nViT-based VLP technique that efficiently incorporates object information\nthrough a novel patch-text alignment mechanism. Specifically, we convert\nobject-level signals into patch-level ones and devise a Patch-Text Alignment\npre-training task (PTA) to learn a text-aware patch detector. By using\noff-the-shelf delicate object annotations in 5\\% training images, we jointly\ntrain PTA with other conventional VLP objectives in an end-to-end manner,\nbypassing the high computational cost of object detection and yielding an\neffective patch detector that accurately detects text-relevant patches, thus\nconsiderably reducing patch sequences and accelerating computation within the\nViT backbone. Our experiments on a variety of widely-used benchmarks reveal\nthat our method achieves a speedup of nearly 88\\% compared to prior VLP models\nwhile maintaining competitive or superior performance on downstream tasks with\nsimilar model size and data scale.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:05:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jiang","Chaoya",""],["Xu","Haiyang",""],["Ye","Wei",""],["Ye","Qinghao",""],["Li","Chenliang",""],["Yan","Ming",""],["Bi","Bin",""],["Zhang","Shikun",""],["Zhang","Ji",""],["Huang","Fei",""]]}
{"id":"2308.03476","submitter":"Tianyuan Zhang","authors":"Wei Jiang, Tianyuan Zhang, Shuangcheng Liu, Weiyu Ji, Zichao Zhang,\n  Gang Xiao","title":"Exploring the Physical World Adversarial Robustness of Vehicle Detection","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":"  Adversarial attacks can compromise the robustness of real-world detection\nmodels. However, evaluating these models under real-world conditions poses\nchallenges due to resource-intensive experiments. Virtual simulations offer an\nalternative, but the absence of standardized benchmarks hampers progress.\nAddressing this, we propose an innovative instant-level data generation\npipeline using the CARLA simulator. Through this pipeline, we establish the\nDiscrete and Continuous Instant-level (DCI) dataset, enabling comprehensive\nexperiments involving three detection models and three physical adversarial\nattacks. Our findings highlight diverse model performances under adversarial\nconditions. Yolo v6 demonstrates remarkable resilience, experiencing just a\nmarginal 6.59% average drop in average precision (AP). In contrast, the ASA\nattack yields a substantial 14.51% average AP reduction, twice the effect of\nother algorithms. We also note that static scenes yield higher recognition AP\nvalues, and outcomes remain relatively consistent across varying weather\nconditions. Intriguingly, our study suggests that advancements in adversarial\nattack algorithms may be approaching its ``limitation''.In summary, our work\nunderscores the significance of adversarial attacks in real-world contexts and\nintroduces the DCI dataset as a versatile benchmark. Our findings provide\nvaluable insights for enhancing the robustness of detection models and offer\nguidance for future research endeavors in the realm of adversarial attacks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:09:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jiang","Wei",""],["Zhang","Tianyuan",""],["Liu","Shuangcheng",""],["Ji","Weiyu",""],["Zhang","Zichao",""],["Xiao","Gang",""]]}
{"id":"2308.03477","submitter":"Romain A. Meyer","authors":"Romain A. Meyer, Marcel Neeleman, Fabian Walter, Bram Venemans","title":"ALMA 300 pc resolution imaging of a z=6.79 quasar: no evidence for\n  supermassive black hole influence on the [C II] kinematics","comments":"Accepted for publication in ApJ. 10 pages + appendices. Main results:\n  Figures 1+4","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present ALMA [C II] 158 $\\mu \\rm{m}$ and dust continuum observations of\nthe $z=6.79$ quasar J0109--3047 at a resolution of $0.\"045$ ($\\sim$300 pc). The\ndust and [C II] emission are enclosed within a $\\sim 500\\, \\rm{pc}$ radius,\nwith the central beam ($r<144\\ \\rm{pc}$) accounting for $\\sim$25\\% (8\\%) of the\ntotal continuum ([C II]) emission. The far--infrared luminosity density\nincreases radially from $\\sim$5 $\\times 10^{11} L_\\odot\\ \\rm{kpc}^{-2}$ to a\ncentral value of $\\sim$70 $\\times 10^{11} L_\\odot\\ \\rm{kpc}^{-2}$ (SFRD\n$\\sim$50-700 $M_\\odot\\ \\rm{yr}^{-1}\\ \\rm{kpc}^{-2}$). The [C II] kinematics are\ndispersion-dominated with a constant velocity dispersion of $137 \\pm 6\n\\,\\rm{km\\ s}^{-1}$. The constant dispersion implies that the underlying mass\ndistribution is not centrally peaked, consistent with the expectations of a\nflat gas mass profile. The lack of an upturn in velocity dispersion within the\ncentral beam is inconsistent with a black hole mass greater than\n$M_{\\rm{BH}}<6.5\\times 10^{8}\\ M_\\odot\\ (2\\sigma$ level), unless highly\nfine-tuned changes in the ISM properties conspire to produce a decrease of the\ngas mass in the central beam comparable to the black hole mass. Our\nobservations therefore imply either that a) the black hole is less massive than\npreviously measured or b) the central peak of the far-infrared and [C II]\nemission are not tracing the location of the black hole, as suggested by the\ntentative offset between the near-infrared position of the quasar and the ALMA\ncontinuum emission.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:11:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Meyer","Romain A.",""],["Neeleman","Marcel",""],["Walter","Fabian",""],["Venemans","Bram",""]]}
{"id":"2308.03478","submitter":"Yang Li","authors":"Yang Li and Shihao Wu and Quan Pan","title":"Network Security in the Industrial Control System: A Survey","comments":"This work is finished three years ago","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Along with the development of intelligent manufacturing, especially with the\nhigh connectivity of the industrial control system (ICS), the network security\nof ICS becomes more important. And in recent years, there has been much\nresearch on the security of the ICS network. However, in practical usage, there\nare many types of protocols, which means a high vulnerability in protocols.\nTherefore, in this paper, we give a complete review of the protocols that are\nusually used in ICS. Then, we give a comprehensive review on network security\nin terms of Defence in Depth (DiD), including data encryption, access control\npolicy, intrusion detection system, software-defined network, etc. Through\nthese works, we try to provide a new perspective on the exciting new\ndevelopments in this field.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:19:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yang",""],["Wu","Shihao",""],["Pan","Quan",""]]}
{"id":"2308.03479","submitter":"Quentin Rouxel","authors":"Quentin Rouxel (LARSEN), Ruoshi Wen, Zhibin Li (UCL), Carlo Tiseo,\n  Jean-Baptiste Mouret (LARSEN), Serena Ivaldi (LARSEN)","title":"Feasibility Retargeting for Multi-contact Teleoperation and Physical\n  Interaction","comments":"2nd Workshop Toward Robot Avatars, 2023 IEEE International Conference\n  on Robotics and Automation (ICRA), Jun 2023, London, United Kingdom","journal-ref":null,"doi":"10.1109/tmech.2022.3152844/mm2","report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This short paper outlines two recent works on multi-contact teleoperation and\nthe development of the SEIKO (Sequential Equilibrium Inverse Kinematic\nOptimization) framework. SEIKO adapts commands from the operator in real-time\nand ensures that the reference configuration sent to the underlying controller\nis feasible. Additionally, an admittance scheme is used to implement physical\ninteraction, which is then combined with the operator's command and retargeted.\nSEIKO has been applied in simulations on various robots, including humanoid and\nquadruped robots designed for loco-manipulation. Furthermore, SEIKO has been\ntested on real hardware for bimanual heavy object carrying tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:21:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rouxel","Quentin","","LARSEN"],["Wen","Ruoshi","","UCL"],["Li","Zhibin","","UCL"],["Tiseo","Carlo","","LARSEN"],["Mouret","Jean-Baptiste","","LARSEN"],["Ivaldi","Serena","","LARSEN"]]}
{"id":"2308.03480","submitter":"Alex Barcel\\'o","authors":"Alex Barcelo, Anna Queralt and Toni Cortes","title":"Enhancing iteration performance on distributed task-based workflows","comments":null,"journal-ref":null,"doi":"10.1016/j.future.2023.07.032","report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Task-based programming models have proven to be a robust and versatile way to\napproach development of applications for distributed environments. They provide\nnatural programming patterns with high performance. However, execution on this\nparadigm can be very sensitive to granularity --i.e., the quantity and\nexecution length of tasks. Granularity is often linked with the block size of\nthe data, and finding the optimal block size has several challenges, as it\nrequires inner knowledge of the computing environment.\n  Our proposal is to supplement the task-based programming model with a new\nmechanism --our SplIter proposal. At its core, the SplIter provides a\ntransparent way to split a collection into partitions (logical groups of\nblocks, obtained without any transfers nor data rearrangement), which can then\nbe iterated. Tasks are linked to those partitions, which means that SplIter\nbreaks the dependency between block size and task granularity.\n  The evaluation shows that the SplIter is able to achieve performance\nimprovements of over one order of magnitude when compared to the baseline, and\nit is either competitive or strictly better (depending on application\ncharacteristics) to the competitor alternative. We have chosen different\napplications covering a wide variety of scenarios; those applications are\nrepresentatives of a broader set of applications and domains. The changes\nrequired in the source code of a task-based application are minimal, preserving\nthe high programmability of the programming model. Two different\nstate-of-the-art task-based frameworks have been evaluated for all the\napplications: COMPSs and Dask, showing that the SplIter can be effectively used\nwithin different frameworks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:22:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Barcelo","Alex",""],["Queralt","Anna",""],["Cortes","Toni",""]]}
{"id":"2308.03481","submitter":"Huanchao Zhou","authors":"Zhidong Bai, Jiang Hu, Jack W. Silverstein, and Huanchao Zhou","title":"Exact Separation of Eigenvalues of Large Dimensional Noncentral Sample\n  Covariance Matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $ \\bbB_n =\\frac{1}{n}(\\bbR_n + \\bbT^{1/2}_n \\bbX_n)(\\bbR_n + \\bbT^{1/2}_n\n\\bbX_n)^* $ where $ \\bbX_n $ is a $ p \\times n $ matrix with independent\nstandardized random variables, $ \\bbR_n $ is a $ p \\times n $ non-random\nmatrix, representing the information, and $ \\bbT_{n} $ is a $ p \\times p $\nnon-random nonnegative definite Hermitian matrix. Under some conditions on $\n\\bbR_n \\bbR_n^* $ and $ \\bbT_n $, it has been proved that for any closed\ninterval outside the support of the limit spectral distribution, with\nprobability one there will be no eigenvalues falling in this interval for all $\np $ sufficiently large. The purpose of this paper is to carry on with the study\nof the support of the limit spectral distribution, and we show that there is an\nexact separation phenomenon: with probability one, the proper number of\neigenvalues lie on either side of these intervals.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:24:23 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 06:59:20 GMT"},{"version":"v3","created":"Sun, 13 Aug 2023 13:58:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bai","Zhidong",""],["Hu","Jiang",""],["Silverstein","Jack W.",""],["Zhou","Huanchao",""]]}
{"id":"2308.03482","submitter":"Markus Johansson","authors":"Markus Johansson","title":"Nine Lorentz covariant bitensors for two Dirac spinors to indicate all\n  entangled states","comments":"9 pages; The submission was noted by the arXiv admin as having a text\n  overlap with a submission on the same general topic arXiv:2308.00896 due to\n  the use of some shared terminology","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spinorial degrees of freedom of two spacelike separated Dirac particles\nare considered and a collection of nine locally Lorentz covariant bitensors is\nconstructed. Four of these bitensors have been previously described in [Phys.\nRev. A 105, 032402 (2022), arXiv:2103.07784]. The collection of bitensors has\nthe property that all nine bitensors are simultaneously zero if and only if the\nstate of the two particles is a product state. Thus this collection of\nbitensors indicates any type of spinor entanglement between two spacelike\nseparated Dirac particles.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:25:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Johansson","Markus",""]]}
{"id":"2308.03483","submitter":"Devendra  Kumar","authors":"Shivam Rathod, Megha Malasi, Archana Lakhani, Devendra Kumar","title":"How to enhance anomalous Hall effects in magnetic Weyl semimetal\n  Co$_3$Sn$_2$S$_2$?","comments":"16 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large spin-orbit coupling, kagome lattice, nontrivial topological band\nstructure with inverted bands anti-crossings, and Weyl nodes are essential\ningredients, ideally required to obtain maximal anomalous Hall effect (AHE) are\nsimultaneously present in Co$_3$Sn$_2$S$_2$. It is a leading platform to show\nlarge intrinsic anomalous Hall conductivity (AHC) and giant anomalous Hall\nangle (AHA) simultaneously at low fields. The giant AHE in Co$_3$Sn$_2$S$_2$ is\nrobust against small-scale doping-related chemical potential changes. In this\nwork, we unveil a selective and co-chemical doping route to maximize AHEs in\nCo$_3$Sn$_2$S$_2$. To begin with, in Co$_3$Sn$_{2-x}$In$_x$S$_2$, we brought\nthe chemical potential at the hotspot of Berry curvature along with a maximum\nof asymmetric impurity scattering in high mobility region. As a result at\nx=0.05, we found a significant enhancement of AHA (95%) and AHC (190%) from the\nsynergistic enhancement of extrinsic and intrinsic mechanisms from modified\nBerry curvature of gaped nodal lines. Later, with anticipation of further\nimprovements in AHE, we grew hole-co-doped\nCo$_{3-y}$Fe$_y$Sn$_{2-x}$In$_x$S$_2$ crystals, where we found rather a\nsuppression of AHEs. The role of dopants in giving extrinsic effects or band\nbroadening can be better understood when chemical potential does not change\nafter doping. By simultaneous and equal co-doping with electrons and holes in\nCo$_{3-y-z}$Fe$_y$Ni$_z$Sn$_2$S$_2$, we kept the chemical potential unchanged.\nHenceforth, we found a significant enhancement in intrinsic AHC $\\sim$116% due\nto the disorder broadenings in kagome bands\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:26:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rathod","Shivam",""],["Malasi","Megha",""],["Lakhani","Archana",""],["Kumar","Devendra",""]]}
{"id":"2308.03484","submitter":"Xin Zhou Dr","authors":"Xin Zhou, Yang Su, Ji Yang, Xuepeng Chen, Yan Sun, Zhibo Jiang, Min\n  Wang, Hongchi Wang, Shaobo Zhang, Ye Xu, Qingzeng Yan, Lixia Yuan, Zhiwei\n  Chen, Yiping Ao, Yuehui Ma","title":"A Systematic Study of Associations between Supernova Remnants and\n  Molecular Clouds","comments":"77 pages, 20 figures, 4 tables (with machine-readable versions),\n  accepted for publication in ApJS","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 universally search for evidence of kinematic and spatial correlation of\nsupernova remnant (SNR) and molecular cloud (MC) associations for nearly all\nSNRs in the coverage of the MWISP CO survey, i.e. 149 SNRs, 170 SNR candidates,\nand 18 pure pulsar wind nebulae (PWNe) in 1 deg < l < 230 deg and -5.5 deg < b\n< 5.5 deg. Based on high-quality and unbiased 12CO/13CO/C18O (J = 1--0) survey\ndata, we apply automatic algorithms to identify broad lines and spatial\ncorrelations for molecular gas in each SNR region. The 91% of SNR-MC\nassociations detected previously are identified in this paper by CO line\nemission. Overall, there could be as high as 80% of SNRs associated with MCs.\nThe proportion of SNRs associated with MCs is high within the Galactic\nlongitude less than ~50 deg. Kinematic distances of all SNRs that are\nassociated with MCs are estimated based on systemic velocities of associated\nMCs. The radius of SNRs associated with MCs follows a lognormal distribution,\nwhich peaks at ~8.1 pc. The progenitor initial mass of these SNRs follows a\npower-law distribution with an index of ~-2.3 that is consistent with the\nSalpeter index of -2.35. We find that SNR-MC associations are mainly\ndistributed in a thin disk along the Galactic plane, while a small amount\ndistributed in a thick disk. With the height of these SNRs from the Galactic\nplane below ~45 pc, the distribution of the average radius relative to the\nheight of them is roughly flat, and the average radius increases with the\nheight when above ~45 pc.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:27:09 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 11:02:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhou","Xin",""],["Su","Yang",""],["Yang","Ji",""],["Chen","Xuepeng",""],["Sun","Yan",""],["Jiang","Zhibo",""],["Wang","Min",""],["Wang","Hongchi",""],["Zhang","Shaobo",""],["Xu","Ye",""],["Yan","Qingzeng",""],["Yuan","Lixia",""],["Chen","Zhiwei",""],["Ao","Yiping",""],["Ma","Yuehui",""]]}
{"id":"2308.03485","submitter":"Tomer Lev Lehman","authors":"Tomer Lev Lehman, Hagit Attiya, and Danny Hendler","title":"Recoverable and Detectable Self-Implementations of Swap","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recoverable algorithms tolerate failures and recoveries of processes by using\nnon-volatile memory. Of particular interest are self-implementations of key\noperations, in which a recoverable operation is implemented from its\nnon-recoverable counterpart (in addition to reads and writes). This paper\npresents two self-implementations of the SWAP operation. One works in the\nsystem-wide failures model, where all processes fail and recover together, and\nthe other in the independent failures model, where each process crashes and\nrecovers independently of the other processes. Both algorithms are wait-free in\ncrash-free executions, but their recovery code is blocking. We prove that this\nis inherent for the independent failures model. The impossibility result is\nproved for implementations of distinguishable operations using interfering\nfunctions, and in particular, it applies to a recoverable self-implementation\nof swap.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:27:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lehman","Tomer Lev",""],["Attiya","Hagit",""],["Hendler","Danny",""]]}
{"id":"2308.03486","submitter":"Filipe Cordeiro","authors":"Vicente Sampaio and Filipe R. Cordeiro","title":"Improving Mass Detection in Mammography Images: A Study of Weakly\n  Supervised Learning and Class Activation Map Methods","comments":"Accepted for publication at SIBGRAPI 20203","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, weakly supervised models have aided in mass detection using\nmammography images, decreasing the need for pixel-level annotations. However,\nmost existing models in the literature rely on Class Activation Maps (CAM) as\nthe activation method, overlooking the potential benefits of exploring other\nactivation techniques. This work presents a study that explores and compares\ndifferent activation maps in conjunction with state-of-the-art methods for\nweakly supervised training in mammography images. Specifically, we investigate\nCAM, GradCAM, GradCAM++, XGradCAM, and LayerCAM methods within the framework of\nthe GMIC model for mass detection in mammography images. The evaluation is\nconducted on the VinDr-Mammo dataset, utilizing the metrics Accuracy, True\nPositive Rate (TPR), False Negative Rate (FNR), and False Positive Per Image\n(FPPI). Results show that using different strategies of activation maps during\ntraining and test stages leads to an improvement of the model. With this\nstrategy, we improve the results of the GMIC method, decreasing the FPPI value\nand increasing TPR.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:28:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sampaio","Vicente",""],["Cordeiro","Filipe R.",""]]}
{"id":"2308.03487","submitter":"Stephanie Jean-Daubias","authors":"St\\'ephanie Jean-Daubias (LIRIS, TWEAK, UCBL)","title":"JADE: a board game to teach software ergonomics","comments":null,"journal-ref":"Interaction Design and Architecture(s) Journal, 2023, 56, pp.29-52","doi":"10.55612/s-5002-056-002","report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  JADE is an educational game we have imagined, designed, built, and used\nsuccessfully in various contexts. This board game enables learning and\npracticing software ergonomics concepts. It is intended for beginners. We use\nit every year during several hours with our second-year computer science\nstudents at Lyon 1 University. In this paper, we present the classical version\nof the game, as well as the design and evaluation process that we applied. We\nalso present the hybrid version of JADE, which relies on the use of QR codes\nand videos. We also present its use in our teaching (with about 850 learners\nfor a total duration of 54 hours, which totals more than 2500 student-hours).\nWe then discuss the results obtained and present the considered evolutions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:29:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jean-Daubias","St\u00e9phanie","","LIRIS, TWEAK, UCBL"]]}
{"id":"2308.03488","submitter":"Moyu Zhang","authors":"Moyu Zhang, Xinning Zhu, Chunhong Zhang, Feng Pan, Wenchen Qian, Hui\n  Zhao","title":"No Length Left Behind: Enhancing Knowledge Tracing for Modeling\n  Sequences of Excessive or Insufficient Lengths","comments":"Accepted by CIKM 2023, 10 pages, 8 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowledge tracing (KT) aims to predict students' responses to practices based\non their historical question-answering behaviors. However, most current KT\nmethods focus on improving overall AUC, leaving ample room for optimization in\nmodeling sequences of excessive or insufficient lengths. As sequences get\nlonger, computational costs will increase exponentially. Therefore, KT methods\nusually truncate sequences to an acceptable length, which makes it difficult\nfor models on online service systems to capture complete historical practice\nbehaviors of students with too long sequences. Conversely, modeling students\nwith short practice sequences using most KT methods may result in overfitting\ndue to limited observation samples. To address the above limitations, we\npropose a model called Sequence-Flexible Knowledge Tracing (SFKT).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:30:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Moyu",""],["Zhu","Xinning",""],["Zhang","Chunhong",""],["Pan","Feng",""],["Qian","Wenchen",""],["Zhao","Hui",""]]}
{"id":"2308.03489","submitter":"Surajit Borkotokey Dr","authors":"Surajit Borkotokey, Sujata Gowala and Rajnish Kumar","title":"The Expected Shapley value on a class of probabilistic games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study a class of probabilistic cooperative games which can be treated as\nan extension of the classical cooperative games with transferable utilities.\nThe coalitions have an exogenous probability of being realized. This\nprobability distribution is known beforehand and the distribution of the\nexpected worth needs to be done before the realization of the state. We obtain\na value for this class of games and present three characterizations of this\nvalue using natural extensions of the axioms used in the seminal axiomatization\nof the Shapley value. The value, which we call the Expected Shapley value,\nallocates the players their expected worth with respect to a probability\ndistribution.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:31:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Borkotokey","Surajit",""],["Gowala","Sujata",""],["Kumar","Rajnish",""]]}
{"id":"2308.03490","submitter":"Ananya Rawat Miss","authors":"Ananya Rawat, Girjesh R. Gupta","title":"Exploring source region of 3-min slow magnetoacoustic waves observed in\n  coronal fan loops rooted in sunspot umbra","comments":"Accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2426","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sunspots host various oscillations and wave phenomena like umbral flashes,\numbral oscillations, running penumbral waves, and coronal waves. All fan loops\nrooted in sunspot umbra constantly show a 3-min period propagating slow\nmagnetoacoustic waves in the corona. However, their origin in the lower\natmosphere is still unclear. In this work, we studied these oscillations in\ndetail along a clean fan loop system rooted in active region AR12553 for a\nduration of 4-hour on June 16, 2016 observed by Interface Region Imaging\nSpectrograph (IRIS) and Solar Dynamics Observatory (SDO). We traced foot-points\nof several fan loops by identifying their locations at different atmospheric\nheights from the corona to the photosphere. We found presence of 3-min\noscillations at foot-points of all the loops and at all atmospheric heights. We\nfurther traced origin of these waves by utilising their amplitude modulation\ncharacteristics while propagating in the solar atmosphere. We found several\namplitude modulation periods in the range of 9-14 min, 20-24 min, and 30-40 min\nof these 3-min waves at all heights. Based on our findings, we interpret that\n3-min slow magnetoacoustic waves propagating in coronal fan loops are driven by\n3-min oscillations observed at the photospheric foot-points of these fan loops\nin the umbral region. We also explored any connection between 3-min and 5-min\noscillations observed at the photospheric foot-points of these loops and found\nthem to be weakly coupled. Results provide clear evidence of magnetic coupling\nof the solar atmosphere through propagation of 3-min waves along fan loops at\ndifferent atmospheric heights.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:32:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rawat","Ananya",""],["Gupta","Girjesh R.",""]]}
{"id":"2308.03491","submitter":"Antonio Jim\\'enez Vargas","authors":"M. G. Cabrera-Padilla, A. Jim\\'enez-Vargas and D. Ruiz-Casternado","title":"p-Summing Bloch mappings on the complex unit disc","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The notion of $p$-summing Bloch mapping from the complex unit open disc\n$\\mathbb{D}$ into a complex Banach space $X$ is introduced for any $1\\leq\np\\leq\\infty$. It is shown that the linear space of such mappings, equipped with\na natural seminorm $\\pi^{\\mathbb{B}}_p$, is M\\\"obius-invariant. Moreover, its\nsubspace consisting of all those mappings which preserve the zero is an\ninjective Banach ideal of normalized Bloch mappings. Bloch versions of the\nPietsch's domination/factorization Theorem and the Maurey's extrapolation\nTheorem are presented. We also introduce the spaces of $X$-valued Bloch\nmolecules on $\\mathbb{D}$ and identify the spaces of normalized $p$-summing\nBloch mappings from $\\mathbb{D}$ into $X^*$ under the norm $\\pi^{\\mathbb{B}}_p$\nwith the duals of such spaces of molecules under the Bloch version of the\n$p$-Chevet--Saphar tensor norms $d_p$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:33:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cabrera-Padilla","M. G.",""],["Jim\u00e9nez-Vargas","A.",""],["Ruiz-Casternado","D.",""]]}
{"id":"2308.03492","submitter":"Xiang Feng","authors":"Xiang Feng, Kaizhang Kang, Fan Pei, Huakeng Ding, Jinjiang You, Ping\n  Tan, Kun Zhou, Hongzhi Wu","title":"Learning Photometric Feature Transform for Free-form Object Scan","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 a novel framework to automatically learn to aggregate and\ntransform photometric measurements from multiple unstructured views into\nspatially distinctive and view-invariant low-level features, which are fed to a\nmulti-view stereo method to enhance 3D reconstruction. The illumination\nconditions during acquisition and the feature transform are jointly trained on\na large amount of synthetic data. We further build a system to reconstruct the\ngeometry and anisotropic reflectance of a variety of challenging objects from\nhand-held scans. The effectiveness of the system is demonstrated with a\nlightweight prototype, consisting of a camera and an array of LEDs, as well as\nan off-the-shelf tablet. Our results are validated against reconstructions from\na professional 3D scanner and photographs, and compare favorably with\nstate-of-the-art techniques.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:34:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Xiang",""],["Kang","Kaizhang",""],["Pei","Fan",""],["Ding","Huakeng",""],["You","Jinjiang",""],["Tan","Ping",""],["Zhou","Kun",""],["Wu","Hongzhi",""]]}
{"id":"2308.03493","submitter":"Shahid Mubasshar","authors":"Shahid Mubasshar","title":"Nonlocal theory of elasticity in the natural vibrations of curved CNTs\n  with defects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current study presents the natural vibrations of single-walled carbon\nnanotubes (SWCNTs) using the nonlocal theory of elasticity. The study will help\nto develop nanodevices. The study focuses on the natural vibrations of curved\nor arch-like carbon nanotubes (CNTs). It is considered that the CNT has a\ncrack-like defect and is simply supported (SS) at both ends. To model the\nequations of motion for the CNTs, a curved nanobeam approach is adopted, and\nthe governing equations are solved using the separation of variables method.\nThis research investigates the natural frequencies of three types of CNTs:\narmchair, zigzag, and chiral. A qualitative validation study demonstrates that\nthe obtained results align with those published in the literature. Notably, the\nstudy reveals that small-scale effects and defects in the nanotubes influence\nthe natural frequencies of CNTs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:40:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mubasshar","Shahid",""]]}
{"id":"2308.03494","submitter":"Surajit Borkotokey Dr","authors":"Niharika Kakoty, Surajit Borkotokey, Rajnish Kumar, Abhijit Bora","title":"Weighted position value for Network games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In Network games under cooperative framework, the position value is a link\nbased allocation rule. It is obtained from the Shapley value of an associated\ncooperative game where the links of the network are considered players. The\nShapley value of each of the links is then divided equally among the players\nwho form those links. The inherent assumption is that the value is indifferent\nto the weights of the players in the network. Depending on how much central a\nplayer is in the network, or the ability of making links with other players\netc., for example, players can be considered to have weights. Thus, in such\nsituations, dividing the Shapley value equally among the players can be an\nover-simplistic notion. We propose a generalised version of the position value:\nthe weighted position value that allocates the Shapley shares proportional to\nthe players' weights. These weights of the players are exogenously given. We\nprovide two axiomatic characterizations of our value. Finally, a bidding\nmechanism is formulated to show that any sub-game perfect equilibrium (SPE) of\nthis mechanism coincides with the weighted position value.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:40:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kakoty","Niharika",""],["Borkotokey","Surajit",""],["Kumar","Rajnish",""],["Bora","Abhijit",""]]}
{"id":"2308.03495","submitter":"Kidist Amde Mekonnen Miss","authors":"Kidist Amde Mekonnen","title":"Balanced Face Dataset: Guiding StyleGAN to Generate Labeled Synthetic\n  Face Image Dataset for Underrepresented Group","comments":"7 pages, 7 figures,submitted to AMLD Africa 2021 conference","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":"  For a machine learning model to generalize effectively to unseen data within\na particular problem domain, it is well-understood that the data needs to be of\nsufficient size and representative of real-world scenarios. Nonetheless,\nreal-world datasets frequently have overrepresented and underrepresented\ngroups. One solution to mitigate bias in machine learning is to leverage a\ndiverse and representative dataset. Training a model on a dataset that covers\nall demographics is crucial to reducing bias in machine learning. However,\ncollecting and labeling large-scale datasets has been challenging, prompting\nthe use of synthetic data generation and active labeling to decrease the costs\nof manual labeling. The focus of this study was to generate a robust face image\ndataset using the StyleGAN model. In order to achieve a balanced distribution\nof the dataset among different demographic groups, a synthetic dataset was\ncreated by controlling the generation process of StyleGaN and annotated for\ndifferent downstream tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:42:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mekonnen","Kidist Amde",""]]}
{"id":"2308.03496","submitter":"Abhijit Gadekar","authors":"Abhijit Gadekar","title":"Design and Implementation of an Efficient Onboard Computer System for\n  CanSat Atmosphere Monitoring","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.AR cs.RO cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With advancements in technology, the smaller versions of satellites have\ngained momentum in the space industry for earth monitoring and\ncommunication-based applications. The rise of CanSat technology has\nsignificantly impacted the space industry by providing a cost-effective\nsolution for space exploration. CanSat is a simulation model of a real\nsatellite and plays a crucial role in collecting and transmitting atmospheric\ndata. This paper discusses the design of an Onboard Computer System forCanSat,\nused to study various environmental parameters by monitoring the concentrations\nof gases in the atmosphere. The Onboard Computer System uses GPS,\naccelerometer, altitude, temperature, pressure, gyroscope, magnetometer, UV\nradiation, and air quality sensors for atmospheric sensing. A highly efficient\nand low-power ESP32 microcontroller and a transceiver module are used to\nacquire data, facilitate seamless communication and transmit the collected data\nto the ground station.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:43:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gadekar","Abhijit",""]]}
{"id":"2308.03497","submitter":"Yuhuan Yuan","authors":"Maria Lukacova-Medvidova, Bangwei She, Yuhuan Yuan","title":"Penalty method for the Navier-Stokes-Fourier system with Dirichlet\n  boundary conditions: convergence and error estimates","comments":"45 pages, 3 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 study the convergence and error estimates of a finite volume method for\nthe compressible Navier-Stokes-Fourier system with Dirichlet boundary\nconditions. Physical fluid domain is typically smooth and needs to be\napproximated by a polygonal computational domain. This leads to domain-related\ndiscretization errors, the so-called variational crimes. To treat them\nefficiently we embed the fluid domain into a large enough cubed domain, and\npropose a finite volume scheme for the corresponding domain-penalized problem.\nUnder the assumption that the numerical density and temperature are uniformly\nbounded, we derive the ballistic energy inequality, yielding a priori estimates\nand the consistency of the penalization finite volume approximations. Further,\nwe show that the numerical solutions converge weakly to a generalized, the\nso-called dissipative measure-valued, solution of the corresponding Dirichlet\nproblem. If a strong solution exists, we prove that our numerical\napproximations converge strongly with the rate 1/4. Additionally, assuming\nuniform boundedness of the approximate velocities, we obtain global existence\nof the strong solution. In this case we prove that the numerical solutions\nconverge strongly to the strong solution with the optimal rate 1/2.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:43:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lukacova-Medvidova","Maria",""],["She","Bangwei",""],["Yuan","Yuhuan",""]]}
{"id":"2308.03498","submitter":"Osamu Fujino","authors":"Osamu Fujino","title":"Log canonical inversion of adjunction","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is a short note on the log canonical inversion of adjunction.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:46:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fujino","Osamu",""]]}
{"id":"2308.03499","submitter":"J\\'er\\^ome Chenevez","authors":"Khaled Alizai, J\\'er\\^ome Chenevez, Andrew Cumming, Nathalie Degenaar,\n  Maurizio Falanga, Duncan K. Galloway, Jean J. M. in `t Zand, Gaurava K.\n  Jaisawal, Laurens Keek, Erik Kuulkers, Nathanael Lampe, Hendrik Schatz,\n  Motoko Serino","title":"A catalogue of unusually long thermonuclear bursts on neutron stars","comments":"Published in MNRAS, 20 pages, 7 figures, 4 tables","journal-ref":"Monthly Notices of the Royal Astronomical Society, 2023, Vol. 521,\n  pp. 3608-3624","doi":"10.1093/mnras/stad374","report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rare, energetic (long) thermonuclear (Type I) X-ray bursts are classified\neither as intermediate-duration or superbursts, based on their duration.\nIntermediate-duration bursts lasting a few to tens of minutes are thought to\narise from the thermonuclear runaway of a relatively thick (10^10 g/cm2) helium\nlayer, while superbursts lasting hours are attributed to the detonation of an\nunderlying carbon layer. We present a catalogue of 84 long thermonuclear bursts\nfrom 40 low-mass X-ray binaries, and defined from a new set of criteria\ndistinguishing them from the more frequent short bursts. The three criteria\nare: (1) a total energy release larger than 10^40 erg, (2) a photospheric\nradius expansion phase longer than 10 s, and (3) a burst time-scale longer than\n70 s. This work is based on a comprehensive systematic analysis of 70 bursts\nfound with INTEGRAL, RXTE, Swift, BeppoSAX, MAXI, and NICER, as well as 14 long\nbursts from the literature that were detected with earlier generations of X-ray\ninstruments. For each burst, we measure its peak flux and fluence, which\neventually allows us to confirm the distinction between intermediate-duration\nbursts and superbursts. Additionally, we list 18 bursts that only partially\nmeet the above inclusion criteria, possibly bridging the gap between normal and\nintermediate-duration bursts. With this catalogue, we significantly increase\nthe number of long-duration bursts included in the MINBAR and thereby provide a\nsubstantial sample of these rare X-ray bursts for further study.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:52:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Alizai","Khaled",""],["Chenevez","J\u00e9r\u00f4me",""],["Cumming","Andrew",""],["Degenaar","Nathalie",""],["Falanga","Maurizio",""],["Galloway","Duncan K.",""],["Zand","Jean J. M. in `t",""],["Jaisawal","Gaurava K.",""],["Keek","Laurens",""],["Kuulkers","Erik",""],["Lampe","Nathanael",""],["Schatz","Hendrik",""],["Serino","Motoko",""]]}
{"id":"2308.03500","submitter":"Pawan Goyal","authors":"Peter Benner and Pawan Goyal and Paul Van Dooren","title":"Parameterized Interpolation of Passive Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the tangential interpolation problem for a passive transfer function\nin standard state-space form. We derive new interpolation conditions based on\nthe computation of a deflating subspace associated with a selection of spectral\nzeros of a parameterized para-Hermitian transfer function. We show that this\ntechnique improves the robustness of the low order model and that it can also\nbe applied to non-passive systems, provided they have sufficiently many\nspectral zeros in the open right half plane. We analyze the accuracy needed for\nthe computation of the deflating subspace, in order to still have a passive\nlower order model and we derive a novel selection procedure of spectral zeros\nin order to obtain low order models with a small approximation error.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:53:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Benner","Peter",""],["Goyal","Pawan",""],["Van Dooren","Paul",""]]}
{"id":"2308.03501","submitter":"Georgios Antoniou","authors":"Georgios Antoniou","title":"New perspectives on scalar fields in strong gravity","comments":"132 pages, Ph.D. thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent developments in the field of gravitational physics, including the\nemergence of gravitational wave astronomy, black hole images, and more accurate\ntelescopes, have allowed us to probe the strong-field character of gravity in a\nnovel and revolutionary manner. This accessibility related to strong gravity\nbrings into the foreground discussions about potential modifications to General\nRelativity (GR) that are particularly relevant in high curvature regimes. The\nmost straightforward way to generalise GR is to consider an additional degree\nof freedom, in the form of a scalar field. In this thesis, we study generalised\nscalar tensor theories that predict interesting strong-gravity phenomenology.\nFirst, we review scalar no-hair theorems and the conditions under which they\ncan be evaded. Next, we study solutions of black holes with scalar hair and the\nway in which higher derivative terms alter their properties. We then move our\ndiscussion to the spontaneously scalarized solutions, which only deviate from\nGR in the strong-field regime. We propose a model consistent with compact\nobject scalarization, that allows for a GR attractor at late times, without\nfine-tuning (EsRGB model). Then, we proceed to study properties of black holes\nand neutron stars in this theory, revealing the interesting phenomenology of\nthe solutions. We also study the radial stability of black holes in EsRGB and\nperform a preliminary analysis of the hyperbolicity of the problem. Finally, we\ntake a look at the shadows of black holes and wormholes in theories with scalar\nfields, in light of recent observations of black hole shadows.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:53:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Antoniou","Georgios",""]]}
{"id":"2308.03502","submitter":"Sabrina Roscani Dr","authors":"S. D. Roscani, K. Ryszewska and L.D. Venturato","title":"On a Space Fractional Stefan problem of Dirichlet type with Caputo flux","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a space-fractional Stefan problem with the Dirichlet boundary\nconditions. It is a model that describes superdiffusive phenomena. Our main\nresult is the existence of the unique classical solution to this problem. In\nthe proof we apply evolution operators theory and the Schauder fixed point\ntheorem. It appears that studying fractional Stefan problem with Dirichlet\nboundary conditions requires a substantial modifications of the approach in\ncomparison with the existing results for problems with different kinds of\nboundary conditions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:56:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Roscani","S. D.",""],["Ryszewska","K.",""],["Venturato","L. D.",""]]}
{"id":"2308.03503","submitter":"Vadim E. Levit","authors":"Vadim E. Levit and Eugen Mandrescu","title":"1-Konig-Egervary Graphs","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\alpha(G)$ denote the cardinality of a maximum independent set, while\n$\\mu(G)$ be the size of a maximum matching in $G=\\left( V,E\\right) $. It is\nknown that if $\\alpha(G)+\\mu(G)=\\left\\vert V\\right\\vert $, then $G$ is a\n\\textit{K\\\"{o}nig-Egerv\\'{a}ry graph. If $\\alpha (G)+\\mu(G)=\\left\\vert\nV\\right\\vert -1$, then $G$ is an $1$-K\\\"{o}nig-Egerv\\'{a}ry graph. If $G$ is\nnot a K\\\"{o}nig-Egerv\\'{a}ry graph, and there exists a vertex $v\\in V$ (an edge\n$e\\in E$) such that $G-v$ ($G-e$) is K\\\"{o}nig-Egerv\\'{a}ry, then $G$ is called\na vertex (an edge) almost K\\\"{o}nig-Egerv\\'{a}ry graph (respectively). In this\npaper, we characterize all these types of almost K\\\"{o}nig-Egerv\\'{a}ry graphs\nand present interrelationships between them.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:58:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Levit","Vadim E.",""],["Mandrescu","Eugen",""]]}
{"id":"2308.03504","submitter":"Dhruv Muley","authors":"Dhruv Muley, Julio David Melon Fuksman, Hubert Klahr","title":"Three-temperature radiation hydrodynamics with PLUTO: Tests and\n  applications to protoplanetary disks","comments":"Accepted to Astronomy and Astrophysics; 16 pages, 11 figures incl.\n  Appendix. Comments and questions welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In circumstellar disks around T Tauri stars, visible and near-infrared\nstellar irradiation is intercepted by dust at the disk's optical surface and\nreprocessed into thermal infrared; this subsequently undergoes radiative\ndiffusion through the optically thick bulk of the disk. The gas component --\noverwhelmingly dominant by mass, but contributing little to the opacity -- is\nheated primarily by gas-grain collisions. In hydrodynamical simulations,\nhowever, typical models for this heating process (local isothermality,\n$\\beta$-cooling, two-temperature radiation hydrodynamics) incorporate\nsimplifying assumptions that limit their ranges of validity. To build on these\nmethods, we develop a ``three-temperature\" numerical scheme, which\nself-consistently models energy exchange between gas, dust, and radiation, as a\npart of the PLUTO radiation-hydrodynamics code. With a range of test problems\nin 0D, 1D, 2D, and 3D, we demonstrate the efficacy of our method, and make the\ncase for its applicability to a wide range of problems in disk physics,\nincluding hydrodynamic instabilities and disk-planet interaction.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:59:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Muley","Dhruv",""],["Fuksman","Julio David Melon",""],["Klahr","Hubert",""]]}
{"id":"2308.03505","submitter":"Wojciech Satula","authors":"W. Satula, M. A. Bentley, A. Jalili, S. Uthayakumaar","title":"Sensitivity study of mirror energy differences in positive parity bands\n  of T=3/2 A=45 nuclei","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Symmetry conserving density functional theory (DFT) based\nno-core-configuration-interaction framework (DFT-NCCI) is an excellent tool for\nprecision calculation of diverse (pseudo-)observables related to isospin\nsymmetry breaking from elusive isospin impurities trough isospin corrections to\nsuperallowed beta decays to mirror- and triplet-displacement energies and\nmirror energy differences (MED) along rotational bands. In our recent work\n[Phys. Rev. C {\\bf 106}, 024327 (2022)] we performed axial DFT-NCCI\ncalculations and failed to reproduce a sign of MED in positive-parity bands of\n45Sc/45Cr T=3/2 mirror pair what casts a shadow on credibility of the model. In\nthis work we aim to perform a thorough analysis of this case with the focus on\nsensitivity of our predictions with respect to: (i) low-energy constants (LECs)\nof our effective contact charge symmetry breaking (CSB) force and (ii) nuclear\nshape. We demonstrate, among the other, that inclusion of triaxial\npositive-parity ground-state - which is actually the global positive-parity\nminimum in our unconstrained mean-field calculation - in the DFT-NCCI\ncalculations instead of the axial one used before leads to MED which are\nconsistent with experimental data concerning both their sign as well as\nmagnitude without any need for fine-tuning of the model's LECs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:00:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Satula","W.",""],["Bentley","M. A.",""],["Jalili","A.",""],["Uthayakumaar","S.",""]]}
{"id":"2308.03506","submitter":"Ming Zhang","authors":"Ming Zhang, Sheng-Yuan Li, De-Cheng Zou, Chao-Ming Zhang","title":"Analytical approximate solutions of AdS black holes in\n  Einstein-Weyl-scalar gravity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We consider Einstein-Weyl gravity with a minimally coupled scalar field in\nfour dimensional spacetime. By using the Minimal Geometric Deformation (MGD)\napproach, we split the highly nonlinear coupled field equations into two\nsubsystems that describing the background geometry and scalar field source,\nrespectively. Regarding the Schwarzschild-AdS metric as a background geometry,\nwe derive analytical approximate solutions of scalar field and deformation\nmetric functions with Homotopy Analysis Method (HAM), providing their\nanalytical approximations to fourth order. Moreover, we discuss the accuracy of\nthe analytical approximations, showing they are sufficiently accurate\nthroughout the exterior spacetime.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:01:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Ming",""],["Li","Sheng-Yuan",""],["Zou","De-Cheng",""],["Zhang","Chao-Ming",""]]}
{"id":"2308.03507","submitter":"Surajit Borkotokey Dr","authors":"Ritu Dutta, Rajnish Kumnar and Surajit Borkotokey","title":"How to choose a Compatible Committee?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Electing a committee of size k from m alternatives (k < m) is an interesting\nproblem under the multi-winner voting rules. However, very few committee\nselection rules found in the literature consider the coalitional possibilities\namong the alternatives that the voters believe that certain coalitions are more\neffective and can more efficiently deliver desired outputs. To include such\npossibilities, in this present study, we consider a committee selection problem\n(or multi-winner voting problem) where voters are able to express their opinion\nregarding interdependencies among alternatives. Using a dichotomous preference\nscale termed generalized approval evaluation we construct an $m$-person\ncoalitional game which is more commonly called a cooperative game with\ntransferable utilities. To identify each alternative's score we use the Shapley\nvalue (Shapley, 1953) of the cooperative game we construct for the purpose. Our\napproach to the committee selection problem emphasizes on an important issue\ncalled the compatibility principle. Further, we show that the properties of the\nShapley value are well suited in the committee selection context too. We\nexplore several properties of the proposed committee selection rule.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:02:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dutta","Ritu",""],["Kumnar","Rajnish",""],["Borkotokey","Surajit",""]]}
{"id":"2308.03508","submitter":"Xavier Waintal","authors":"Nicolas Jolly and Yuriel N\\'u\\~nez Fern\\'andez and Xavier Waintal","title":"Tensorized orbitals for computational chemistry","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Choosing a basis set is the first step of a quantum chemistry calculation and\nit sets its maximum accuracy. This choice of orbitals is limited by strong\ntechnical constraints as one must be able to compute a large number of high\ndimensional integrals from these orbitals. Here we use tensor network\ntechniques to construct representations of orbitals that essentially lift these\ntechnical constraints. We show that a large class of orbitals can be put into\n``tensorized'' form including the Gaussian orbitals, the exact hydrogenoid\natomic orbitals and orbitals for chemical bonds. Our method provides a path for\nbuilding more accurate and more compact basis sets beyond what has been\naccessible with previous technology.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:03:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jolly","Nicolas",""],["Fern\u00e1ndez","Yuriel N\u00fa\u00f1ez",""],["Waintal","Xavier",""]]}
{"id":"2308.03509","submitter":"Kaiye Shi","authors":"Kaiye Shi, Wei Zhang, and Zheng-Xin Liu","title":"Abelian and non-Abelian quantum spin liquids in a three-component Bose\n  gas on optical Kagome lattices","comments":"7+3 pages, 5+1 figures","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":"  Realization of non-Abelian anyons in topological phases is a crucial step\ntoward topological quantum computation. We propose a scheme to realize a\nnon-Abelian quantum spin liquid (QSL) phase in a three-component Bose gas with\ncontact interaction on optical Kagome lattices. In the strong coupling regime,\nthe system is described by an effective spin-1 model with two- and three-body\ninteractions between neighboring spins. By mapping out the phase diagram via\nvariational Monte Carlo method, we find a non-Abelian chiral spin liquid phase\nin which the Ising-type anyons obey non-Abelian braiding statistics. The\ngapless chiral edge states can be detected by measuring the spin-spin\ncorrelation from atomic population. Furthermore, an interesting Z2 QSL phase is\nobserved exhibiting both topological order and lattice symmetry breaking order.\nOur scheme can be implemented in cold quantum gases of bosonic atoms.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:05:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shi","Kaiye",""],["Zhang","Wei",""],["Liu","Zheng-Xin",""]]}
{"id":"2308.03510","submitter":"Fernando Szechtman","authors":"Alexander Montoya Ocampo and Fernando Szechtman","title":"The automorphism group of finite $2$-groups associated to the Macdonald\n  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 consider the Macdonald group $\\langle x,y\\,|\\, x^{[x,y]}=x^{1+2^m\\ell},\\,\ny^{[y,x]}=y^{1+2^m\\ell}\\rangle$ and its Sylow 2-subgroup $J=\\langle x,y\\,|\\,\nx^{[x,y]}=x^{1+2^m\\ell},\\, y^{[y,x]}=y^{1+2^m\\ell},\nx^{2^{3m-1}}=y^{2^{3m-1}}=1\\rangle$, where $m\\geq 1$ and $\\ell$ is odd. Then\n$J$ has order $2^{7m-3}$, and nilpotency class 5 if $m>1$ and 3 if $m=1$. We\ndetermine the automorphism group of the 2-groups $J$, $H=J/Z(J)$ and\n$K=H/Z(H)$, where $|H|=2^{6m-3}$ and $|K|=2^{5m-3}$. Explicit multiplication,\npower, and commutator formulas for $J$, $H$, and $K$ are given, and used in the\ncalculation of $\\mathrm{Aut}(J)$, $\\mathrm{Aut}(H)$, and $\\mathrm{Aut}(K)$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:05:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ocampo","Alexander Montoya",""],["Szechtman","Fernando",""]]}
{"id":"2308.03511","submitter":"Yan Feng","authors":"Yan Feng, Panchamy Krishnakumari","title":"A data-driven approach to predict decision point choice during normal\n  and evacuation wayfinding in multi-story buildings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Understanding pedestrian route choice behavior in complex buildings is\nimportant to ensure pedestrian safety. Previous studies have mostly used\ntraditional data collection methods and discrete choice modeling to understand\nthe influence of different factors on pedestrian route and exit choice,\nparticularly in simple indoor environments. However, research on pedestrian\nroute choice in complex buildings is still limited. This paper presents a\ndata-driven approach for understanding and predicting the pedestrian decision\npoint choice during normal and emergency wayfinding in a multi-story building.\nFor this, we first built an indoor network representation and proposed a data\nmapping technique to map VR coordinates to the indoor representation. We then\nused a well-established machine learning algorithm, namely the random forest\n(RF) model to predict pedestrian decision point choice along a route during\nfour wayfinding tasks in a multi-story building. Pedestrian behavioral data in\na multi-story building was collected by a Virtual Reality experiment. The\nresults show a much higher prediction accuracy of decision points using the RF\nmodel (i.e., 93% on average) compared to the logistic regression model. The\nhighest prediction accuracy was 96% for task 3. Additionally, we tested the\nmodel performance combining personal characteristics and we found that personal\ncharacteristics did not affect decision point choice. This paper demonstrates\nthe potential of applying a machine learning algorithm to study pedestrian\nroute choice behavior in complex indoor buildings.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:05:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Yan",""],["Krishnakumari","Panchamy",""]]}
{"id":"2308.03512","submitter":"Bryce Cyr","authors":"Bryce Cyr, Jens Chluba, and Sandeep Kumar Acharya","title":"A cosmic string solution to the radio synchrotron background","comments":"5 pages, 4 figures, comments welcome!","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":"  We investigate the low-frequency spectral emission from a network of\nsuperconducting cosmic string loops in hopes of explaining the observed radio\nsynchrotron background. After considering constraints from a variety of\nastrophysical and cosmological measurements, we identify a best-fit solution\nwith string tension $G\\mu \\simeq 6.5 \\times 10^{-12}$ and current $\\mathcal{I}\n\\simeq 2.5 \\times 10^6$ GeV. This model yields a convincing fit to the data and\nmay be testable in the near future by spectral distortion (TMS, BISOU) and 21\ncm experiments (HERA, SKA, REACH). We also find that soft photon heating\nprotects us against current constraints from global $21$ cm experiments.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:07:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cyr","Bryce",""],["Chluba","Jens",""],["Acharya","Sandeep Kumar",""]]}
{"id":"2308.03513","submitter":"Fernando Szechtman","authors":"Alexander Montoya Ocampo and Fernando Szechtman","title":"On the isomorphism problem for certain $p$-groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider 9 infinite families of finite $p$-groups, for $p$ a prime, and we\nsettle the isomorphism problem that arises when the parameters that define\nthese groups are modified.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:08:28 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 02:03:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ocampo","Alexander Montoya",""],["Szechtman","Fernando",""]]}
{"id":"2308.03514","submitter":"Sungho Suh","authors":"Sungho Suh, Vitor Fortes Rey, Sizhen Bian, Yu-Chi Huang, Jo\\v{z}e M.\n  Ro\\v{z}anec, Hooman Tavakoli Ghinani, Bo Zhou, Paul Lukowicz","title":"Worker Activity Recognition in Manufacturing Line Using Near-body\n  Electric Field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Manufacturing industries strive to improve production efficiency and product\nquality by deploying advanced sensing and control systems. Wearable sensors are\nemerging as a promising solution for achieving this goal, as they can provide\ncontinuous and unobtrusive monitoring of workers' activities in the\nmanufacturing line. This paper presents a novel wearable sensing prototype that\ncombines IMU and body capacitance sensing modules to recognize worker\nactivities in the manufacturing line. To handle these multimodal sensor data,\nwe propose and compare early, and late sensor data fusion approaches for\nmulti-channel time-series convolutional neural networks and deep convolutional\nLSTM. We evaluate the proposed hardware and neural network model by collecting\nand annotating sensor data using the proposed sensing prototype and Apple\nWatches in the testbed of the manufacturing line. Experimental results\ndemonstrate that our proposed methods achieve superior performance compared to\nthe baseline methods, indicating the potential of the proposed approach for\nreal-world applications in manufacturing industries. Furthermore, the proposed\nsensing prototype with a body capacitive sensor and feature fusion method\nimproves by 6.35%, yielding a 9.38% higher macro F1 score than the proposed\nsensing prototype without a body capacitive sensor and Apple Watch data,\nrespectively.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:10:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Suh","Sungho",""],["Rey","Vitor Fortes",""],["Bian","Sizhen",""],["Huang","Yu-Chi",""],["Ro\u017eanec","Jo\u017ee M.",""],["Ghinani","Hooman Tavakoli",""],["Zhou","Bo",""],["Lukowicz","Paul",""]]}
{"id":"2308.03515","submitter":"George Retsinas","authors":"George Retsinas, Giorgos Sfikas, Christophoros Nikou","title":"Keyword Spotting Simplified: A Segmentation-Free Approach using\n  Character Counting and CTC re-scoring","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances in segmentation-free keyword spotting treat this problem\nw.r.t. an object detection paradigm and borrow from state-of-the-art detection\nsystems to simultaneously propose a word bounding box proposal mechanism and\ncompute a corresponding representation. Contrary to the norm of such methods\nthat rely on complex and large DNN models, we propose a novel segmentation-free\nsystem that efficiently scans a document image to find rectangular areas that\ninclude the query information. The underlying model is simple and compact,\npredicting character occurrences over rectangular areas through an implicitly\nlearned scale map, trained on word-level annotated images. The proposed\ndocument scanning is then performed using this character counting in a\ncost-effective manner via integral images and binary search. Finally, the\nretrieval similarity by character counting is refined by a pyramidal\nrepresentation and a CTC-based re-scoring algorithm, fully utilizing the\ntrained CNN model. Experimental validation on two widely-used datasets shows\nthat our method achieves state-of-the-art results outperforming the more\ncomplex alternatives, despite the simplicity of the underlying model.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:11:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Retsinas","George",""],["Sfikas","Giorgos",""],["Nikou","Christophoros",""]]}
{"id":"2308.03516","submitter":"Dor Katzelnick","authors":"Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh","title":"An Improved Approximation Algorithm for the Max-$3$-Section Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider the Max-$3$-Section problem, where we are given an undirected\ngraph $ G=(V,E)$ equipped with non-negative edge weights $w :E\\rightarrow\n\\mathbb{R}_+$ and the goal is to find a partition of $V$ into three equisized\nparts while maximizing the total weight of edges crossing between different\nparts. Max-$3$-Section is closely related to other well-studied graph\npartitioning problems, e.g., Max-$k$-Cut, Max-$3$-Cut, and Max-Bisection. We\npresent a polynomial time algorithm achieving an approximation of $ 0.795$,\nthat improves upon the previous best known approximation of $ 0.673$. The\nrequirement of multiple parts that have equal sizes renders Max-$3$-Section\nmuch harder to cope with compared to, e.g., Max-Bisection. We show a new\nalgorithm that combines the existing approach of Lassere hierarchy along with a\nrandom cut strategy that suffices to give our result.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:11:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Katzelnick","Dor",""],["Pillai","Aditya",""],["Schwartz","Roy",""],["Singh","Mohit",""]]}
{"id":"2308.03517","submitter":"Farbod Hassani","authors":"Amirmohammad Chegeni, Farbod Hassani, Alireza Vafaei Sadr, Nima\n  Khosravi, Martin Kunz","title":"Clusternets: A deep learning approach to probe clustering dark energy","comments":"12 pages, 6 figures, 6 tables; data available at\n  https://doi.org/10.5281/zenodo.8220732","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning (ML) algorithms are becoming popular in cosmology for\nextracting valuable information from cosmological data. In this paper, we\nevaluate the performance of a Convolutional Neural Network (CNN) trained on\nmatter density snapshots to distinguish clustering Dark Energy (DE) from the\ncosmological constant scenario and to detect the speed of sound ($c_s$)\nassociated with clustering DE. We compare the CNN results with those from a\nRandom Forest (RF) algorithm trained on power spectra. Varying the dark energy\nequation of state parameter $w_{\\rm{DE}}$ within the range of -0.7 to -0.99,\nwhile keeping $c_s^2 = 1$, we find that the CNN approach results in a\nsignificant improvement in accuracy over the RF algorithm. The improvement in\nclassification accuracy can be as high as $40\\%$ depending on the physical\nscales involved. We also investigate the ML algorithms' ability to detect the\nimpact of the speed of sound by choosing $c_s^2$ from the set $\\{1, 10^{-2},\n10^{-4}, 10^{-7}\\}$ while maintaining a constant $w_{\\rm DE}$ for three\ndifferent cases: $w_{\\rm DE} \\in \\{-0.7, -0.8, -0.9\\}$. Our results suggest\nthat distinguishing between various values of $c_s^2$ and the case where\n$c_s^2=1$ is challenging, particularly at small scales and when\n$w_{\\rm{DE}}\\approx -1$. However, as we consider larger scales, the accuracy of\n$c_s^2$ detection improves. Notably, the CNN algorithm consistently outperforms\nthe RF algorithm, leading to an approximate $20\\%$ enhancement in $c_s^2$\ndetection accuracy in some cases.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:11:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chegeni","Amirmohammad",""],["Hassani","Farbod",""],["Sadr","Alireza Vafaei",""],["Khosravi","Nima",""],["Kunz","Martin",""]]}
{"id":"2308.03518","submitter":"Seyedsaeed Razavikia","authors":"Saeed Razavikia, Sajad Daei, Mikael Skoglund, Gabor Fodor, Carlo\n  Fischione","title":"Off-the-grid Blind Deconvolution and Demixing","comments":null,"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":"  We consider the problem of gridless blind deconvolution and demixing (GB2D)\nin scenarios where multiple users communicate messages through multiple unknown\nchannels, and a single base station (BS) collects their contributions. This\nscenario arises in various communication fields, including wireless\ncommunications, the Internet of Things, over-the-air computation, and\nintegrated sensing and communications. In this setup, each user's message is\nconvolved with a multi-path channel formed by several scaled and delayed copies\nof Dirac spikes. The BS receives a linear combination of the convolved signals,\nand the goal is to recover the unknown amplitudes, continuous-indexed delays,\nand transmitted waveforms from a compressed vector of measurements at the BS.\nHowever, in the absence of any prior knowledge of the transmitted messages and\nchannels, GB2D is highly challenging and intractable in general. To address\nthis issue, we assume that each user's message follows a distinct modulation\nscheme living in a known low-dimensional subspace. By exploiting these subspace\nassumptions and the sparsity of the multipath channels for different users, we\ntransform the nonlinear GB2D problem into a matrix tuple recovery problem from\na few linear measurements. To achieve this, we propose a semidefinite\nprogramming optimization that exploits the specific low-dimensional structure\nof the matrix tuple to recover the messages and continuous delays of different\ncommunication paths from a single received signal at the BS. Finally, our\nnumerical experiments show that our proposed method effectively recovers all\ntransmitted messages and the continuous delay parameters of the channels with a\nsufficient number of samples.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:11:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Razavikia","Saeed",""],["Daei","Sajad",""],["Skoglund","Mikael",""],["Fodor","Gabor",""],["Fischione","Carlo",""]]}
{"id":"2308.03519","submitter":"Michael F\\\"arber","authors":"Michael F\\\"arber, Nicholas Popovic","title":"Vocab-Expander: A System for Creating Domain-Specific Vocabularies Based\n  on Word Embeddings","comments":"accepted at RANLP'23","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 Vocab-Expander at https://vocab-expander.com, an\nonline tool that enables end-users (e.g., technology scouts) to create and\nexpand a vocabulary of their domain of interest. It utilizes an ensemble of\nstate-of-the-art word embedding techniques based on web text and ConceptNet, a\ncommon-sense knowledge base, to suggest related terms for already given terms.\nThe system has an easy-to-use interface that allows users to quickly confirm or\nreject term suggestions. Vocab-Expander offers a variety of potential use\ncases, such as improving concept-based information retrieval in technology and\ninnovation management, enhancing communication and collaboration within\norganizations or interdisciplinary projects, and creating vocabularies for\nspecific courses in education.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:13:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["F\u00e4rber","Michael",""],["Popovic","Nicholas",""]]}
{"id":"2308.03520","submitter":"Konstantin Bliokh","authors":"Daria A. Smirnova, Franco Nori, and Konstantin Y. Bliokh","title":"Water-Wave Vortices and Skyrmions","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.class-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological wave structures -- phase vortices, skyrmions, merons, etc. -- are\nattracting enormous attention in a variety of quantum and classical wave\nfields. Surprisingly, these structures have never been properly explored in the\nmost obvious example of classical waves: water-surface (e.g., gravity) waves.\nHere we fill this gap and describe: (i) water-wave vortices of different orders\ncarrying quantized angular momentum with orbital and spin contributions, (ii)\nskyrmion lattices formed by the instantaneous displacements of the\nwater-surface particles in wave interference, (iii) meron (half-skyrmion)\nlattices formed by the spin density vectors, as well as (iv) spatiotemporal\nwater-wave vortices and skyrmions. We show that all these topological entities\ncan be readily generated in linear water-wave interference experiments. Our\nfindings can find applications in microfluidics and show that water waves can\nbe employed as an attainable playground for emulating universal topological\nwave phenomena.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:14:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Smirnova","Daria A.",""],["Nori","Franco",""],["Bliokh","Konstantin Y.",""]]}
{"id":"2308.03521","submitter":"Xuefeng Han","authors":"Xuefeng Han, Jun Li, Wen Chen, Zhen Mei, Kang Wei, Ming Ding,\n  H.Vincent Poor","title":"Analysis and Optimization of Wireless Federated Learning with Data\n  Heterogeneity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  With the rapid proliferation of smart mobile devices, federated learning (FL)\nhas been widely considered for application in wireless networks for distributed\nmodel training. However, data heterogeneity, e.g., non-independently\nidentically distributions and different sizes of training data among clients,\nposes major challenges to wireless FL. Limited communication resources\ncomplicate the implementation of fair scheduling which is required for training\non heterogeneous data, and further deteriorate the overall performance. To\naddress this issue, this paper focuses on performance analysis and optimization\nfor wireless FL, considering data heterogeneity, combined with wireless\nresource allocation. Specifically, we first develop a closed-form expression\nfor an upper bound on the FL loss function, with a particular emphasis on data\nheterogeneity described by a dataset size vector and a data divergence vector.\nThen we formulate the loss function minimization problem, under constraints on\nlong-term energy consumption and latency, and jointly optimize client\nscheduling, resource allocation, and the number of local training epochs (CRE).\nNext, via the Lyapunov drift technique, we transform the CRE optimization\nproblem into a series of tractable problems. Extensive experiments on\nreal-world datasets demonstrate that the proposed algorithm outperforms other\nbenchmarks in terms of the learning accuracy and energy consumption.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:18:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Han","Xuefeng",""],["Li","Jun",""],["Chen","Wen",""],["Mei","Zhen",""],["Wei","Kang",""],["Ding","Ming",""],["Poor","H. Vincent",""]]}
{"id":"2308.03522","submitter":"Utku G\\\"urel","authors":"Utku G\\\"urel and Andrea Giuntoli","title":"Shear Thinning from Bond Orientation in Model Unentangled Bottlebrush\n  Polymer Melts","comments":null,"journal-ref":null,"doi":"10.1021/acs.macromol.3c01061","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rheology of molecular brushes remains challenging to control due to the\nmultiple length scales and relaxation processes involved and the lack of direct\nobservation of molecular conformation during flow. We use molecular dynamics\nsimulations to determine the shear thinning of unentangled bottlebrush polymers\nwith varying architecture, from linear chains to combs, to densely grafted\nbottlebrushes, to star-like and star polymers. We find shear thinning exponents\nin line with theoretical and experimental results and characterize the shape\nand orientation of bottlebrushes in steady-state flow. Many shape parameters\nderived from the gyration tensor show molecular alignment with the flow for all\nsystems. Yet, the orientation of individual bonds is what most strongly\ncorrelates with the architecture-dependent shear-thinning exponents. In densely\ngrafted bottlebrushes, the packing of side chains prevents alignment with the\nflow, causing a reduction in shear thinning. The molecular insight from our\nsimulations is useful to tune the architecture of bottlebrushes to control\ntheir rheology.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:17:16 GMT"}],"update_date":"2023-08-08","authors_parsed":[["G\u00fcrel","Utku",""],["Giuntoli","Andrea",""]]}
{"id":"2308.03524","submitter":"Jovan Komatovic","authors":"Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel\n  Vidigueira","title":"Strong Byzantine Agreement with Adaptive Word Complexity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The strong Byzantine agreement (SBA) problem is defined among n processes,\nout of which t < n can be faulty and behave arbitrarily. SBA allows correct\n(non-faulty) processes to agree on a common value. Moreover, if all correct\nprocesses have proposed the same value, only that value can be agreed upon. It\nhas been known for a long time that any solution to the SBA problem incurs\nquadratic worst-case word complexity; additionally, the bound was known to be\ntight. However, no existing protocol achieves adaptive word complexity, where\nthe number of exchanged words depends on the actual number of faults, and not\non the upper bound. Therefore, it is still unknown whether SBA with adaptive\nword complexity exists. This paper answers the question in the affirmative.\nNamely, we introduce STRONG, a synchronous protocol that solves SBA among n =\n(2 + Omega(1))t + 1 processes and achieves adaptive word complexity. We show\nthat the fundamental challenge of adaptive SBA lies in efficiently solving\ncertification, the problem of obtaining a constant-sized, locally-verifiable\nproof that a value can safely be decided.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:20:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Civit","Pierre",""],["Gilbert","Seth",""],["Guerraoui","Rachid",""],["Komatovic","Jovan",""],["Vidigueira","Manuel",""]]}
{"id":"2308.03525","submitter":"Simon Guisset","authors":"Simon Guisset and Arick Shao","title":"On counterexamples to unique continuation for critically singular wave\n  equations","comments":"31 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider wave equations with a critically singular potential $\\xi \\cdot\n\\sigma^{-2}$ diverging as an inverse square at a hypersurface $\\sigma = 0$. Our\naim is to construct counterexamples to unique continuation from $\\sigma = 0$\nfor this equation, provided there exists a family of null geodesics trapped\nnear $\\sigma = 0$. This extends the classical geometric optics construction of\nAlinhac-Baouendi (i) to linear differential operators with singular\ncoefficients, and (ii) over non-small portions of $\\sigma = 0$ - by showing\nthat such counterexamples can be further continued as long as this null\ngeodesic family remains trapped and regular. As an application to relativity\nand holography, we construct counterexamples to unique continuation from the\nconformal boundaries of asymptotically Anti-de Sitter spacetimes for some\nKlein-Gordon equations; this complements the unique continuation results of the\nsecond author with Chatzikaleas, Holzegel, and McGill and suggests a potential\nmechanism for counterexamples to the AdS/CFT correspondence.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:21:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guisset","Simon",""],["Shao","Arick",""]]}
{"id":"2308.03526","submitter":"Michael Mathieu","authors":"Micha\\\"el Mathieu, Sherjil Ozair, Srivatsan Srinivasan, Caglar\n  Gulcehre, Shangtong Zhang, Ray Jiang, Tom Le Paine, Richard Powell, Konrad\n  \\.Zo{\\l}na, Julian Schrittwieser, David Choi, Petko Georgiev, Daniel Toyama,\n  Aja Huang, Roman Ring, Igor Babuschkin, Timo Ewalds, Mahyar Bordbar, Sarah\n  Henderson, Sergio G\\'omez Colmenarejo, A\\\"aron van den Oord, Wojciech Marian\n  Czarnecki, Nando de Freitas, Oriol Vinyals","title":"AlphaStar Unplugged: Large-Scale Offline Reinforcement Learning","comments":"32 pages, 13 figures, previous version published as a NeurIPS 2021\n  workshop: https://openreview.net/forum?id=Np8Pumfoty","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  StarCraft II is one of the most challenging simulated reinforcement learning\nenvironments; it is partially observable, stochastic, multi-agent, and\nmastering StarCraft II requires strategic planning over long time horizons with\nreal-time low-level execution. It also has an active professional competitive\nscene. StarCraft II is uniquely suited for advancing offline RL algorithms,\nboth because of its challenging nature and because Blizzard has released a\nmassive dataset of millions of StarCraft II games played by human players. This\npaper leverages that and establishes a benchmark, called AlphaStar Unplugged,\nintroducing unprecedented challenges for offline reinforcement learning. We\ndefine a dataset (a subset of Blizzard's release), tools standardizing an API\nfor machine learning methods, and an evaluation protocol. We also present\nbaseline agents, including behavior cloning, offline variants of actor-critic\nand MuZero. We improve the state of the art of agents using only offline data,\nand we achieve 90% win rate against previously published AlphaStar behavior\ncloning agent.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:21:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mathieu","Micha\u00ebl",""],["Ozair","Sherjil",""],["Srinivasan","Srivatsan",""],["Gulcehre","Caglar",""],["Zhang","Shangtong",""],["Jiang","Ray",""],["Paine","Tom Le",""],["Powell","Richard",""],["\u017bo\u0142na","Konrad",""],["Schrittwieser","Julian",""],["Choi","David",""],["Georgiev","Petko",""],["Toyama","Daniel",""],["Huang","Aja",""],["Ring","Roman",""],["Babuschkin","Igor",""],["Ewalds","Timo",""],["Bordbar","Mahyar",""],["Henderson","Sarah",""],["Colmenarejo","Sergio G\u00f3mez",""],["Oord","A\u00e4ron van den",""],["Czarnecki","Wojciech Marian",""],["de Freitas","Nando",""],["Vinyals","Oriol",""]]}
{"id":"2308.03527","submitter":"Kristina Schaaff","authors":"Kristina Schaaff, Caroline Reinig, Tim Schlippe","title":"Exploring ChatGPT's Empathic Abilities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Empathy is often understood as the ability to share and understand another\nindividual's state of mind or emotion. With the increasing use of chatbots in\nvarious domains, e.g., children seeking help with homework, individuals looking\nfor medical advice, and people using the chatbot as a daily source of everyday\ncompanionship, the importance of empathy in human-computer interaction has\nbecome more apparent. Therefore, our study investigates the extent to which\nChatGPT based on GPT-3.5 can exhibit empathetic responses and emotional\nexpressions. We analyzed the following three aspects: (1) understanding and\nexpressing emotions, (2) parallel emotional response, and (3) empathic\npersonality. Thus, we not only evaluate ChatGPT on various empathy aspects and\ncompare it with human behavior but also show a possible way to analyze the\nempathy of chatbots in general. Our results show, that in 91.7% of the cases,\nChatGPT was able to correctly identify emotions and produces appropriate\nanswers. In conversations, ChatGPT reacted with a parallel emotion in 70.7% of\ncases. The empathic capabilities of ChatGPT were evaluated using a set of five\nquestionnaires covering different aspects of empathy. Even though the results\nindicate that the empathic abilities of ChatGPT are still below the average of\nhealthy humans, the scores are better than those of people who have been\ndiagnosed with Asperger syndrome / high-functioning autism.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:23:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Schaaff","Kristina",""],["Reinig","Caroline",""],["Schlippe","Tim",""]]}
{"id":"2308.03528","submitter":"Lawrence Hollom","authors":"Lawrence Hollom","title":"A note on monotonicity in Maker-Breaker graph colouring games","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the Maker-Breaker vertex colouring game, first publicised by Gardner in\n1981, Maker and Breaker alternately colour vertices of a graph using a fixed\npalette, maintaining a proper colouring at all times. Maker aims to colour the\nwhole graph, and Breaker aims to make some vertex impossible to colour. We are\ninterested in the following question, first asked by Zhu in 1999: if Maker wins\nwith $k$ colours available, must they also win with $k+1$? This question has\nremained open, attracting significant attention and being reposed for many\nsimilar games. While we cannot resolve this problem for the vertex colouring\ngame, we can answer it in the affirmative for the game of arboricity, resolving\na question of Bartnicki, Grytczuk, and Kierstead from 2008.\n  We then consider how one might approach the question of monotonicity for the\nvertex colouring game, and work with a related game in which the vertices must\nbe coloured in a prescribed order. We demonstrate that this `ordered vertex\ncolouring game' does not have the above monotonicity property, and discuss the\nimplications of this fact to the unordered game.\n  Finally, we provide counterexamples to two open problems concerning a\nconnected version of the graph colouring game.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:24:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hollom","Lawrence",""]]}
{"id":"2308.03529","submitter":"Huimin Zeng","authors":"Huimin Zeng, Weinong Wang, Xin Tao, Zhiwei Xiong, Yu-Wing Tai, Wenjie\n  Pei","title":"Feature Decoupling-Recycling Network for Fast Interactive Segmentation","comments":"Accepted to ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent interactive segmentation methods iteratively take source image, user\nguidance and previously predicted mask as the input without considering the\ninvariant nature of the source image. As a result, extracting features from the\nsource image is repeated in each interaction, resulting in substantial\ncomputational redundancy. In this work, we propose the Feature\nDecoupling-Recycling Network (FDRN), which decouples the modeling components\nbased on their intrinsic discrepancies and then recycles components for each\nuser interaction. Thus, the efficiency of the whole interactive process can be\nsignificantly improved. To be specific, we apply the Decoupling-Recycling\nstrategy from three perspectives to address three types of discrepancies,\nrespectively. First, our model decouples the learning of source image semantics\nfrom the encoding of user guidance to process two types of input domains\nseparately. Second, FDRN decouples high-level and low-level features from\nstratified semantic representations to enhance feature learning. Third, during\nthe encoding of user guidance, current user guidance is decoupled from\nhistorical guidance to highlight the effect of current user guidance. We\nconduct extensive experiments on 6 datasets from different domains and\nmodalities, which demonstrate the following merits of our model: 1) superior\nefficiency than other methods, particularly advantageous in challenging\nscenarios requiring long-term interactions (up to 4.25x faster), while\nachieving favorable segmentation performance; 2) strong applicability to\nvarious methods serving as a universal enhancement technique; 3) well\ncross-task generalizability, e.g., to medical image segmentation, and\nrobustness against misleading user guidance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:26:34 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 05:29:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zeng","Huimin",""],["Wang","Weinong",""],["Tao","Xin",""],["Xiong","Zhiwei",""],["Tai","Yu-Wing",""],["Pei","Wenjie",""]]}
{"id":"2308.03530","submitter":"Ljupcho Milosheski","authors":"Ljupcho Milosheski, Gregor Cerar, Bla\\v{z} Bertalani\\v{c}, Carolina\n  Fortuna and Mihael Mohor\\v{c}i\\v{c}","title":"Deep Feature Learning for Wireless Spectrum Data","comments":null,"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":"  In recent years, the traditional feature engineering process for training\nmachine learning models is being automated by the feature extraction layers\nintegrated in deep learning architectures. In wireless networks, many studies\nwere conducted in automatic learning of feature representations for\ndomain-related challenges. However, most of the existing works assume some\nsupervision along the learning process by using labels to optimize the model.\nIn this paper, we investigate an approach to learning feature representations\nfor wireless transmission clustering in a completely unsupervised manner, i.e.\nrequiring no labels in the process. We propose a model based on convolutional\nneural networks that automatically learns a reduced dimensionality\nrepresentation of the input data with 99.3% less components compared to a\nbaseline principal component analysis (PCA). We show that the automatic\nrepresentation learning is able to extract fine-grained clusters containing the\nshapes of the wireless transmission bursts, while the baseline enables only\ngeneral separability of the data based on the background noise.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:27:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Milosheski","Ljupcho",""],["Cerar","Gregor",""],["Bertalani\u010d","Bla\u017e",""],["Fortuna","Carolina",""],["Mohor\u010di\u010d","Mihael",""]]}
{"id":"2308.03531","submitter":"Michael F\\\"arber","authors":"Michael F\\\"arber, Jannik Schwade, Adam Jatowt","title":"Measuring Variety, Balance, and Disparity: An Analysis of Media Coverage\n  of the 2021 German Federal Election","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":"  Determining and measuring diversity in news articles is important for a\nnumber of reasons, including preventing filter bubbles and fueling public\ndiscourse, especially before elections. So far, the identification and analysis\nof diversity have been illuminated in a variety of ways, such as measuring the\noverlap of words or topics between news articles related to US elections.\nHowever, the question of how diversity in news articles can be measured\nholistically, i.e., with respect to (1) variety, (2) balance, and (3)\ndisparity, considering individuals, parties, and topics, has not been\naddressed. In this paper, we present a framework for determining diversity in\nnews articles according to these dimensions. Furthermore, we create and provide\na dataset of Google Top Stories, encompassing more than 26,000 unique headlines\nfrom more than 900 news outlets collected within two weeks before and after the\n2021 German federal election. While we observe high diversity for more general\nsearch terms (e.g., \"election\"), a range of search terms (\"education,\"\n\"Europe,\" \"climate protection,\" \"government\") resulted in news articles with\nhigh diversity in two out of three dimensions. This reflects a more subjective,\ndedicated discussion on rather future-oriented topics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:30:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["F\u00e4rber","Michael",""],["Schwade","Jannik",""],["Jatowt","Adam",""]]}
{"id":"2308.03532","submitter":"Ioannis Karafyllidis G.","authors":"G. D. Varsamis, I. G. Karafyllidis, K. M. Gilkes, U. Arranz, R.\n  Martin-Cuevas, G. Calleja, J. Wong, H. C. Jessen, P. Dimitrakis, P. Kolovos,\n  R. Sandaltzopoulos","title":"Quantum algorithm for de novo DNA sequence assembly based on quantum\n  walks on graphs","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  De novo DNA sequence assembly is based on finding paths in overlap graphs,\nwhich is a NP-hard problem. We developed a quantum algorithm for de novo\nassembly based on quantum walks in graphs. The overlap graph is partitioned\nrepeatedly to smaller graphs that form a hierarchical structure. We use quantum\nwalks to find paths in low rank graphs and a quantum algorithm that finds\nHamiltonian paths in high hierarchical rank. We tested the partitioning quantum\nalgorithm, as well as the quantum algorithm that finds Hamiltonian paths in\nhigh hierarchical rank and confirmed its correct operation using Qiskit. We\ndeveloped a custom simulation for quantum walks to search for paths in low rank\ngraphs. The approach described in this paper may serve as a basis for the\ndevelopment of efficient quantum algorithms that solve the de novo DNA assembly\nproblem.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:30:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Varsamis","G. D.",""],["Karafyllidis","I. G.",""],["Gilkes","K. M.",""],["Arranz","U.",""],["Martin-Cuevas","R.",""],["Calleja","G.",""],["Wong","J.",""],["Jessen","H. C.",""],["Dimitrakis","P.",""],["Kolovos","P.",""],["Sandaltzopoulos","R.",""]]}
{"id":"2308.03533","submitter":"Shahid Mubasshar","authors":"Shahid Mubasshar","title":"Natural vibrations of circular nano-arches of piecewise constant\n  thickness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The free vibrations of elastic circular arches made of a nano-material are\nconsidered. A method of determination of eigenfrequencies of nano-arches\nweakened with stable cracks is developed making use of the concept of the\nmassless spring and Eringen's nonlocal theory of elasticity. The aim of the\npaper is to evaluate the sensitivity of eigenfrequencies on the geometrical and\nphysical parameters of the nano-arch.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:31:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mubasshar","Shahid",""]]}
{"id":"2308.03534","submitter":"Andreas Pieper","authors":"Andreas Pieper","title":"On the non-Transversality of the Hyperelliptic Locus and the\n  Supersingular Locus for $g=3$","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper gives a criterion for a moduli point to be a point of\nnon-transversal intersection of the hyperelliptic locus and the supersingular\nlocus in the Siegel moduli stack $\\mathfrak{A}_3 \\times \\mathbb{F}_p$. It is\nshown that for infinitely many primes $p$ there exists such a point.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:32:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pieper","Andreas",""]]}
{"id":"2308.03535","submitter":"Tongsheng Wang","authors":"Tongsheng Wang, Tanveer ul Islam, Erik Steur, Tess Homan, Ishu\n  Aggarwal, Patrick R. Onck, Jaap den Toonder, and Ye Wang","title":"Programmable metachronal motion of densely packed magnetic artificial\n  cilia","comments":"6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Despite recent advances in artificial cilia technologies, the application of\nmetachrony, which is the collective wavelike motion by cilia moving\nout-of-phase, has been severely hampered by difficulties in controlling densely\npacked artificial cilia at micrometer length scales. Moreover, there has been\nno direct experimental proof yet that a metachronal wave in combination with\nfully reciprocal ciliary motion can generate significant microfluidic flow on a\nmicrometer scale as theoretically predicted. In this study, using an in-house\ndeveloped precise micro-molding technique, we have fabricated densely packed\nmagnetic artificial cilia that can generate well-controlled metachronal waves.\nWe studied the effect of pure metachrony on fluid flow by excluding all\nsymmetry-breaking ciliary features. Experimental and simulation results prove\nthat net fluid transport can be generated by metachronal motion alone, and the\neffectiveness is strongly dependent on cilia spacing. This technique not only\noffers a biomimetic experimental platform to better understand the mechanisms\nunderlying metachrony, it also opens new pathways towards advanced industrial\napplications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:33:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Tongsheng",""],["Islam","Tanveer ul",""],["Steur","Erik",""],["Homan","Tess",""],["Aggarwal","Ishu",""],["Onck","Patrick R.",""],["Toonder","Jaap den",""],["Wang","Ye",""]]}
{"id":"2308.03536","submitter":"Ahmad Zafari","authors":"Ahmad Zafari, Kiran Kiran, Inmaculada Gimenez-Garcia, Antoni\n  Forner-Cuenca, Kenong Xia, Ian Gibson, Davoud Jafari","title":"Framework for additive manufacturing of porous Inconel 718 for\n  electrochemical applications","comments":null,"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":"  Porous electrodes were developed using laser powder bed fusion of Inconel 718\nlattice structures and electrodeposition of a porous nickel catalytic layer.\nLaser energy densities of 83-333 J/m were used to fabricate 500 $\\mu$m thick\nelectrodes made of body centered cubic unit cells of 200-500 $\\mu$m and strut\nthicknesses of 100-200 um. Unit cells of 500 $\\mu$m and strut thickness of 200\n$\\mu$m were identified as optimum. Despite small changes in feature sizes by\nthe energy input, the porosity of more than 50 percent and pore size of 100\n$\\mu$m did not change. Nickel electrodeposition created a network of\nsubmicrometer pores. The electrodes' electrochemical efficiency was assessed by\nanalysing hydrogen/oxygen evolution reaction (HER/OER) in a three-electrode\nsetup. For HER, a much larger maximum current density of -372 mA/cm$^2$ at a\nless negative potential of -0.4 V vs RHE (potential against reversible hydrogen\nelectrode) was produced in the nickel-coated samples, as compared to -240\nmA/cm$^2$ at -0.6 V in the bare one, indicating superior performance of the\ncoated sample. For OER, however, both bare and nickel-coated electrodes\nsimilarly showed a maximum current density of 350 mA/cm$^2$ at 1.8 V vs RHE due\nto performance trade-offs arising from sample composition and structure.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:33:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zafari","Ahmad",""],["Kiran","Kiran",""],["Gimenez-Garcia","Inmaculada",""],["Forner-Cuenca","Antoni",""],["Xia","Kenong",""],["Gibson","Ian",""],["Jafari","Davoud",""]]}
{"id":"2308.03537","submitter":"Shotaro Baba","authors":"Shotaro Z. Baba, Nobuyuki Yoshioka, Takahiro Sagawa","title":"Work extractability from energy eigenstates under optimized local\n  operations","comments":"10 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 relationship between the second law of thermodynamics and the\nenergy eigenstates of quantum many-body systems that undergo cyclic unitary\nevolution. Using a numerically optimized control protocol, we analyze how the\nwork extractability is affected by the integrability of the system. Our\nfindings reveal that, in nonintegrable systems the number of work-extractable\nenergy eigenstates converges to zero, even when the local control operations\nare optimized. In contrast, in integrable systems, there are exponentially many\neigenstates from which positive work can be extracted, regardless of the\nlocality of the control operations. We numerically demonstrate that such a\nstrikingly different behavior can be attributed to the number of athermal\nenergy eigenstates. Our results provide insights into the foundations of the\nsecond law of thermodynamics in isolated quantum many-body systems, which are\nexpected to contribute to the development of quantum many-body heat engines.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:34:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Baba","Shotaro Z.",""],["Yoshioka","Nobuyuki",""],["Sagawa","Takahiro",""]]}
{"id":"2308.03538","submitter":"Xiaobo Ma","authors":"Xiaobo Ma, Abolfazl Karimpour, Yao-Jan Wu","title":"On-ramp and Off-ramp Traffic Flows Estimation Based on A Data-driven\n  Transfer Learning Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To develop the most appropriate control strategy and monitor, maintain, and\nevaluate the traffic performance of the freeway weaving areas, state and local\nDepartments of Transportation need to have access to traffic flows at each pair\nof on-ramp and off-ramp. However, ramp flows are not always readily available\nto transportation agencies and little effort has been made to estimate these\nmissing flows in locations where no physical sensors are installed. To bridge\nthis research gap, a data-driven framework is proposed that can accurately\nestimate the missing ramp flows by solely using data collected from loop\ndetectors on freeway mainlines. The proposed framework employs a transfer\nlearning model. The transfer learning model relaxes the assumption that the\nunderlying data distributions of the source and target domains must be the\nsame. Therefore, the proposed framework can guarantee high-accuracy estimation\nof on-ramp and off-ramp flows on freeways with different traffic patterns,\ndistributions, and characteristics. Based on the experimental results, the flow\nestimation mean absolute errors range between 23.90 veh/h to 40.85 veh/h for\non-ramps, and 31.58 veh/h to 45.31 veh/h for off-ramps; the flow estimation\nroot mean square errors range between 34.55 veh/h to 57.77 veh/h for on-ramps,\nand 41.75 veh/h to 58.80 veh/h for off-ramps. Further, the comparison analysis\nshows that the proposed framework outperforms other conventional machine\nlearning models. The estimated ramp flows based on the proposed method can help\ntransportation agencies to enhance the operations of their ramp control\nstrategies for locations where physical sensors are not installed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:36:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Xiaobo",""],["Karimpour","Abolfazl",""],["Wu","Yao-Jan",""]]}
{"id":"2308.03539","submitter":"Maksim Katerishich","authors":"Maksim Katerishich, Mikhail Kurenkov, Sausar Karaf, Artem Nenashev,\n  Dzmitry Tsetserukou","title":"DNFOMP: Dynamic Neural Field Optimal Motion Planner for Navigation of\n  Autonomous Robots in Cluttered Environment","comments":"6 pages, 6 figures, accepted to The 2023 IEEE Conference on Systems,\n  Man, and Cybernetics https://ieeesmc2023.org/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motion planning in dynamically changing environments is one of the most\ncomplex challenges in autonomous driving. Safety is a crucial requirement,\nalong with driving comfort and speed limits. While classical sampling-based,\nlattice-based, and optimization-based planning methods can generate smooth and\nshort paths, they often do not consider the dynamics of the environment. Some\ntechniques do consider it, but they rely on updating the environment on-the-go\nrather than explicitly accounting for the dynamics, which is not suitable for\nself-driving. To address this, we propose a novel method based on the Neural\nField Optimal Motion Planner (NFOMP), which outperforms state-of-the-art\napproaches in terms of normalized curvature and the number of cusps. Our\napproach embeds previously known moving obstacles into the neural field\ncollision model to account for the dynamics of the environment. We also\nintroduce time profiling of the trajectory and non-linear velocity constraints\nby adding Lagrange multipliers to the trajectory loss function. We applied our\nmethod to solve the optimal motion planning problem in an urban environment\nusing the BeamNG.tech driving simulator. An autonomous car drove the generated\ntrajectories in three city scenarios while sharing the road with the obstacle\nvehicle. Our evaluation shows that the maximum acceleration the passenger can\nexperience instantly is -7.5 m/s^2 and that 89.6% of the driving time is\ndevoted to normal driving with accelerations below 3.5 m/s^2. The driving style\nis characterized by 46.0% and 31.4% of the driving time being devoted to the\nlight rail transit style and the moderate driving style, respectively.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:38:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Katerishich","Maksim",""],["Kurenkov","Mikhail",""],["Karaf","Sausar",""],["Nenashev","Artem",""],["Tsetserukou","Dzmitry",""]]}
{"id":"2308.03540","submitter":"Ark Modi","authors":"Ark Modi, Alonso Viladomat Jasso, Roberto Ferrara, Christian Deppe,\n  Janis Noetzel, Fred Fung, Maximilian Schaedler","title":"Testing of Hybrid Quantum-Classical K-Means for Nonlinear Noise\n  Mitigation","comments":"2023 IEEE Global Communications Conference: Selected Areas in\n  Communications: Quantum Communications and Computing","journal-ref":null,"doi":null,"report-no":"1570911652","categories":"quant-ph eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nearest-neighbour clustering is a powerful set of heuristic algorithms that\nfind natural application in the decoding of signals transmitted using the\n$M$-Quadrature Amplitude Modulation (M-QAM) protocol. Lloyd et al. proposed a\nquantum version of the algorithm that promised an exponential speed-up. We\nanalyse the performance of this algorithm by simulating the use of a hybrid\nquantum-classical implementation of it upon 16-QAM and experimental 64-QAM\ndata. We then benchmark the implementation against the classical k-means\nclustering algorithm. The choice of quantum encoding of the classical data\nplays a significant role in the performance, as it would for the hybrid\nquantum-classical implementation of any quantum machine learning algorithm. In\nthis work, we use the popular angle embedding method for data embedding and the\nSWAP test for overlap estimation. The algorithm is emulated in software using\nQiskit and tested on simulated and real-world experimental data. The\ndiscrepancy in accuracy from the perspective of the induced metric of the angle\nembedding method is discussed, and a thorough analysis regarding the angle\nembedding method in the context of distance estimation is provided. We detail\nan experimental optic fibre setup as well, from which we collect 64-QAM data.\nThis is the dataset upon which the algorithms are benchmarked. Finally, some\npromising current and future directions for further research are discussed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:38:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Modi","Ark",""],["Jasso","Alonso Viladomat",""],["Ferrara","Roberto",""],["Deppe","Christian",""],["Noetzel","Janis",""],["Fung","Fred",""],["Schaedler","Maximilian",""]]}
{"id":"2308.03541","submitter":"Kentaro Fukumoto Prof.","authors":"Kentaro Fukumoto","title":"Not Linearly Correlated, But Dependent: A Family of Normal Mode Copulas","comments":"26 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  When scholars study joint distributions of multiple variables, copulas are\nuseful. However, if the variables are not linearly correlated with each other\nyet are still not independent, most of conventional copulas are not up to the\ntask. Examples include (inversed) U-shaped relationships and\nheteroskedasticity. To fill this gap, this manuscript sheds new light on a\nlittle-known copula, which I call the \"normal mode copula.\" I characterize the\ncopula's properties and show that the copula is asymmetric and nonmonotonic\nunder certain conditions. I also apply the copula to a dataset about U.S. House\nvote share and campaign expenditure to demonstrate that the normal mode copula\nhas better performance than other conventional copulas.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:39:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fukumoto","Kentaro",""]]}
{"id":"2308.03542","submitter":"Xiaobo Ma","authors":"Xiaobo Ma, Adrian Cottam, Mohammad Razaur Rahman Shaon, Yao-Jan Wu","title":"A Transfer Learning Framework for Proactive Ramp Metering Performance\n  Assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transportation agencies need to assess ramp metering performance when\ndeploying or expanding a ramp metering system. The evaluation of a ramp\nmetering strategy is primarily centered around examining its impact on freeway\ntraffic mobility. One way these effects can be explored is by comparing traffic\nstates, such as the speed before and after the ramp metering strategy has been\naltered. Predicting freeway traffic states for the after scenarios following\nthe implementation of a new ramp metering control strategy could offer valuable\ninsights into the potential effectiveness of the target strategy. However, the\nuse of machine learning methods in predicting the freeway traffic state for the\nafter scenarios and evaluating the effectiveness of transportation policies or\ntraffic control strategies such as ramp metering is somewhat limited in the\ncurrent literature. To bridge the research gap, this study presents a framework\nfor predicting freeway traffic parameters (speed, occupancy, and flow rate) for\nthe after situations when a new ramp metering control strategy is implemented.\nBy learning the association between the spatial-temporal features of traffic\nstates in before and after situations for known freeway segments, the proposed\nframework can transfer this learning to predict the traffic parameters for new\nfreeway segments. The proposed framework is built upon a transfer learning\nmodel. Experimental results show that the proposed framework is feasible for\nuse as an alternative for predicting freeway traffic parameters to proactively\nevaluate ramp metering performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:44:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Xiaobo",""],["Cottam","Adrian",""],["Shaon","Mohammad Razaur Rahman",""],["Wu","Yao-Jan",""]]}
{"id":"2308.03543","submitter":"Xinpeng Huang","authors":"Xinpeng Huang","title":"Slepian concentration problem for polynomials on the unit Ball","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the Slepian spatiospectral concentration problem for the space of\nmulti-variate polynomials on the unit ball in $\\mathbb{R}^d$. We will discuss\nthe phenomenon of an asymptotically bimodal distribution of eigenvalues of the\nspatiospectral concentration operators of polynomial spaces equipped with two\ndifferent notions of bandwidth: (a) the space of polynomials with a fixed\nmaximal overall polynomial degree, (b) the space of polynomials separated into\nradial and spherical contributions, with fixed but separate maximal degrees for\nthe radial and spherical contributions, respectively. In particular, we\ninvestigate the transition position of the bimodal eigenvalue distribution (the\nso-called Shannon number) for both setups. The analytic results are illustrated\nby numerical examples on the 3-D ball.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:45:11 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 09:43:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huang","Xinpeng",""]]}
{"id":"2308.03544","submitter":"Veer Awana Dr","authors":"Kapil Kumar, N. K. Karn, Yogesh Kumar and V.P.S. Awana (CSIR-NPL)","title":"Absence of superconductivity in LK-99 at ambient conditions","comments":"15Pages Text+Figs - updated version","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The report of synthesis of modified Lead apatite (LK-99) with evidence of\nsuperconductivity at more than boiling water temperature has steered the whole\nscientific community. There have been several failures to reproduce\nsuperconductivity in LK-99 including partial successes. Here, we have continued\nour efforts to synthesize phase pure LK-99 with improved precursors. The\nprocess has been followed as suggested by Sukbae Lee et. al., [1,2]. The phase\npurity of each precursor is evidenced by Powder X-ray diffraction (PXRD) and\nwell fitted by Rietveld refinement. The PXRD confirms the synthesis of phase\npure polycrystalline LK-99 with apatite structure. The freshly synthesized\nsample does not show any signature of superconductivity levitation on a magnet\n(diamagnetism). The magnetization measurements on SQUID also show that LK-99 is\ndiamagnetic at 280 K, there is no sign of superconductivity in LK-99 at room\ntemperature. Moreover, we have also performed first principle calculations to\ninvestigate the electronic band structure of the LK-99 near Fermi level. Our\nstudy verifies that the Cu doped lead apatite (LK-99) has bands crossing at\nFermi level, indicating generation of strong correlation in the system.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:48:56 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 07:02:32 GMT"},{"version":"v3","created":"Wed, 9 Aug 2023 04:51:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kumar","Kapil","","CSIR-NPL"],["Karn","N. K.","","CSIR-NPL"],["Kumar","Yogesh","","CSIR-NPL"],["Awana","V. P. S.","","CSIR-NPL"]]}
{"id":"2308.03545","submitter":"Xiaobo Ma","authors":"Xiaobo Ma, Abolfazl Karimpour, Yao-Jan Wu","title":"A Causal Inference Approach to Eliminate the Impacts of Interfering\n  Factors on Traffic Performance Evaluation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Before and after study frameworks are widely adopted to evaluate the\neffectiveness of transportation policies and emerging technologies. However,\nmany factors such as seasonal factors, holidays, and lane closure might\ninterfere with the evaluation process by inducing variation in traffic volume\nduring the before and after periods. In practice, limited effort has been made\nto eliminate the effects of these factors. In this study, an extreme gradient\nboosting (XGBoost)-based propensity score matching method is proposed to reduce\nthe biases caused by traffic volume variation during the before and after\nperiods. In order to evaluate the effectiveness of the proposed method, a\ncorridor in the City of Chandler, Arizona where an advanced traffic signal\ncontrol system has been recently implemented was selected. The results\nindicated that the proposed method is able to effectively eliminate the\nvariation in traffic volume caused by the COVID-19 global Pandemic during the\nevaluation process. In addition, the results of the t-test and\nKolmogorov-Smirnov (KS) test demonstrated that the proposed method outperforms\nother conventional propensity score matching methods. The application of the\nproposed method is also transferrable to other before and after evaluation\nstudies and can significantly assist the transportation engineers to eliminate\nthe impacts of traffic volume variation on the evaluation process.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:49:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Xiaobo",""],["Karimpour","Abolfazl",""],["Wu","Yao-Jan",""]]}
{"id":"2308.03546","submitter":"Jaroslav Supina","authors":"Jana Borzov\\'a, Lenka Hal\\v{c}inov\\'a, Jaroslav \\v{S}upina","title":"Conditional Aggregation-Based Choquet Integral as a Choquet Integral on\n  a Hyperspace","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We aim at representing the recently introduced conditional aggregation-based\nChoquet integral as a standard Choquet integral on a hyperset. The\nrepresentation is one of transformations considered by R.R. Yager and R. Mesiar\nin 2015. Thus we study the properties of the conditional aggregation-based\nChoquet integral using well-known facts about the standard Choquet integral. In\nparticular, we obtain several formulas for its computation. We also provide the\nrepresentation of the conditional aggregation-based Choquet integral in terms\nof the M\\\"obius transform.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:51:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Borzov\u00e1","Jana",""],["Hal\u010dinov\u00e1","Lenka",""],["\u0160upina","Jaroslav",""]]}
{"id":"2308.03547","submitter":"Valmir C. Barbosa","authors":"Raphael M. Guedes, Jos\\'e F. de Rezende, Valmir C. Barbosa","title":"Near-optimal pilot assignment in cell-free massive 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 cs.NI math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The main source of performance degradation in cell-free massive MIMO is pilot\ncontamination, which causes interference during uplink training and affects\nchannel estimation negatively. Contamination occurs when the same pilot\nsequence is assigned to more than one user. This is in general inevitable, as\nthe number of mutually orthogonal pilot sequences corresponds to only a\nfraction of the coherence interval. We introduce an algorithm for pilot\nassignment that has an approximation ratio close to 1 for a plausibly large\nnumber of orthogonal pilot sequences. It also has low computational complexity\nunder massive parallelism.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:55:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Guedes","Raphael M.",""],["de Rezende","Jos\u00e9 F.",""],["Barbosa","Valmir C.",""]]}
{"id":"2308.03548","submitter":"Arkadiusz Bochniak","authors":"Arkadiusz Bochniak and Gerardo Ortiz","title":"Fusion Mechanism for Quasiparticles and Topological Quantum Order in the\n  Lowest-Landau-Level","comments":"22 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall math-ph math.MP quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Starting from Halperin multilayer systems we develop a hierarchical scheme\nthat generates, bosonic and fermionic, single-layer quantum Hall states (or\nvacua) of arbitrary filling factor. Our scheme allows for the insertion of\nquasiparticle excitations with either Abelian or non-Abelian statistics and\nquantum numbers that depend on the nature of the original vacuum. Most\nimportantly, it reveals a fusion mechanism for quasielectrons and\nmagnetoexcitons that generalizes ideas about particle fractionalization\nintroduced in Commun. Phys. 5, 171 (2022) for the case of Laughlin fluids. In\naddition, in the second quantization representation, we uncover the inherent\ntopological quantum order characterizing these vacua. In particular, we\nillustrate the methodology by constructing generalized composite (generalized\nRead) operators for the non-Abelian Pfaffian and Hafnian quantum fluid states.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:55:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bochniak","Arkadiusz",""],["Ortiz","Gerardo",""]]}
{"id":"2308.03549","submitter":"Songhua Yang","authors":"Songhua Yang, Hanjie Zhao, Senbin Zhu, Guangyu Zhou, Hongfei Xu,\n  Yuxiang Jia, Hongying Zan","title":"Zhongjing: Enhancing the Chinese Medical Capabilities of Large Language\n  Model through Expert Feedback and Real-world Multi-turn Dialogue","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in Large Language Models (LLMs) have achieved remarkable\nbreakthroughs in understanding and responding to user intents. However, their\nperformance lag behind general use cases in some expertise domains, such as\nChinese medicine. Existing efforts to incorporate Chinese medicine into LLMs\nrely on Supervised Fine-Tuning (SFT) with single-turn and distilled dialogue\ndata. These models lack the ability for doctor-like proactive inquiry and\nmulti-turn comprehension and cannot always align responses with safety and\nprofessionalism experts. In this work, we introduce Zhongjing, the first\nChinese medical LLaMA-based LLM that implements an entire training pipeline\nfrom pre-training to reinforcement learning with human feedback (RLHF).\nAdditionally, we introduce a Chinese multi-turn medical dialogue dataset of\n70,000 authentic doctor-patient dialogues, CMtMedQA, which significantly\nenhances the model's capability for complex dialogue and proactive inquiry\ninitiation. We define a refined annotation rule and evaluation criteria given\nthe biomedical domain's unique characteristics. Results show that our model\noutperforms baselines in various capacities and matches the performance of\nChatGPT in a few abilities, despite having 50x training data with previous best\nmodel and 100x parameters with ChatGPT. RLHF further improves the model's\ninstruction-following ability and safety.We also release our code, datasets and\nmodel for further research.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:56:13 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 02:59:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Songhua",""],["Zhao","Hanjie",""],["Zhu","Senbin",""],["Zhou","Guangyu",""],["Xu","Hongfei",""],["Jia","Yuxiang",""],["Zan","Hongying",""]]}
{"id":"2308.03550","submitter":"Ariel Neufeld","authors":"Ariel Neufeld, Qikun Xiang","title":"Feasible approximation of matching equilibria for large-scale matching\n  for teams problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a numerical algorithm for computing approximately optimal\nsolutions of the matching for teams problem. Our algorithm is efficient for\nproblems involving a large number of agent categories and allows for the\nmeasures describing the agent types to be non-discrete. Specifically, we\nparametrize the so-called transfer functions and develop a parametric version\nof the dual formulation. Our algorithm tackles this parametric formulation and\nproduces feasible and approximately optimal solutions for the primal and dual\nformulations of the matching for teams problem. These solutions also yield\nupper and lower bounds for the optimal value, and the difference between the\nupper and lower bounds provides a direct sub-optimality estimate of the\ncomputed solutions. Moreover, we are able to control a theoretical upper bound\non the sub-optimality to be arbitrarily close to 0 under mild conditions. We\nsubsequently prove that the approximate primal and dual solutions converge when\nthe sub-optimality goes to 0 and their limits constitute a true matching\nequilibrium. Thus, the outputs of our algorithm are regarded as an approximate\nmatching equilibrium. We also analyze the theoretical computational complexity\nof our parametric formulation as well as the sparsity of the resulting\napproximate matching equilibrium. Through numerical experiments, we showcase\nthat the proposed algorithm can produce high-quality approximate matching\nequilibria and is applicable to versatile settings, including a\nhigh-dimensional setting involving 100 agent categories.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:58:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Neufeld","Ariel",""],["Xiang","Qikun",""]]}
{"id":"2308.03551","submitter":"Michael Engel","authors":"Xingchen Ye, Jun Chen, M. Eric Irrgang, Michael Engel, Angang Dong,\n  Sharon C. Glotzer, Christopher B. Murray","title":"Quasicrystalline Nanocrystal Superlattice with Partial Matching Rules","comments":"18 pages, 4 figures","journal-ref":"Nature Materials 16, 214-219 (2017)","doi":"10.1038/nmat4759","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.soft physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Expanding the library of self-assembled superstructures provides insight into\nthe behavior of atomic crystals and supports the development of materials with\nmesoscale order. Here we build upon recent findings of soft matter\nquasicrystals and report a quasicrystalline binary nanocrystal superlattice\nthat exhibits correlations in the form of partial matching rules reducing\ntiling disorder. We determine a three-dimensional structure model through\nelectron tomography and direct imaging of surface topography. The 12-fold\nrotational symmetry of the quasicrystal is broken in sub-layers, forming a\nrandom tiling of rectangles, large triangles, and small triangles with 6-fold\nsymmetry. We analyze the geometry of the experimental tiling and discuss\nfactors relevant for the stabilization of the quasicrystal. Our joint\nexperimental-computational study demonstrates the power of nanocrystal\nsuperlattice engineering and further narrows the gap between the richness of\ncrystal structures found with atoms and in soft matter assemblies.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:59:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ye","Xingchen",""],["Chen","Jun",""],["Irrgang","M. Eric",""],["Engel","Michael",""],["Dong","Angang",""],["Glotzer","Sharon C.",""],["Murray","Christopher B.",""]]}
{"id":"2308.03552","submitter":"Valmir C. Barbosa","authors":"Eduardo J. Aguilar, Valmir C. Barbosa, Raul Donangelo, Sergio R. Souza","title":"Phase separation in tilings of a bounded region of the plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a finite set of two-dimensional tile types, the field concerned with\ncovering the plane with tiles of these types only has a long history, having\nenjoyed great prominence in the last six to seven decades, not only as a topic\nof recreational mathematics but mainly as a topic of scientific interest. Much\nof this interest has revolved around fundamental geometrical problems such as\nminimizing the variety of tile types to be used, and also around important\napplications in areas such as crystallography and others concerned with various\natomic- and molecular-scale phenomena. All applications are of course confined\nto finite regions, but in many cases they refer back directly to progress in\ntiling the whole plane. Tilings of bounded regions of the plane have also been\nactively studied, but in general the additional complications imposed by the\nboundary conditions tend to constrain progress to mostly indirect results, such\nas recurrence relations. Here we study the tiling of rectangular regions of the\nplane by squares, dominoes, and straight tetraminoes. For this set of tile\ntypes, not even recurrence relations seem to be available. Our approach is to\nseek to characterize this system through some of the fundamental quantities of\nstatistical physics. We do this on two parallel tracks, one fully analytical\nfor a special case, the other based on the Wang-Landau method for state-density\nestimation. Given a simple Hamiltonian based solely on tile contacts, we have\nfound either approach to lead to illuminating depictions of entropy,\ntemperature, and above all phase separation. The notion of phase separation, in\nthis context, refers to keeping track of how many tiles of each type are used\nin each of the many possibilities. We have found that this helps bind together\ndifferent aspects of the system in question and conjecture that future\napplications will benefit from the possibilities it affords.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:01:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aguilar","Eduardo J.",""],["Barbosa","Valmir C.",""],["Donangelo","Raul",""],["Souza","Sergio R.",""]]}
{"id":"2308.03553","submitter":"Masakiyo Miyazawa","authors":"Masakiyo Miyazawa","title":"Palm problems arising in BAR approach and its applications","comments":"Submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider Palm distributions arising in a Markov process with time\nhomogeneous transitions which is jointly stationary with multiple point\nprocesses. Motivated by a BAR approach studied in the recent paper Braverman,\nDai and Miyazawa (2023}, we are interested in two problems; when this Markov\nprocess inherits the same Markov structure under the Palm distributions, and\nhow the state changes at counting instants of the point processes can be\nhandled to derive stationary equations when there are simultaneous counts and\neach of them influences the state changes. We affirmatively answer to the first\nproblem, and propose a framework for resolving the second problem. We also\ndiscuss how those results can be applied in deriving BAR's for the diffusion\napproximation of queueing models in heavy traffic. In particular, as their new\napplication, the heavy traffic limit of the stationary distribution is derived\nfor a single server queue with a finite waiting room. Those examples show how\nthe BAR approach is useful under the proposed framework.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:02:00 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 04:44:51 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Miyazawa","Masakiyo",""]]}
{"id":"2308.03554","submitter":"\\'Angel Luis Perales G\\'omez","authors":"\\'Angel Luis Perales G\\'omez, Enrique Tom\\'as Mart\\'inez Beltr\\'an,\n  Pedro Miguel S\\'anchez S\\'anchez, Alberto Huertas Celdr\\'an","title":"TemporalFED: Detecting Cyberattacks in Industrial Time-Series Data Using\n  Decentralized Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Industry 4.0 has brought numerous advantages, such as increasing productivity\nthrough automation. However, it also presents major cybersecurity issues such\nas cyberattacks affecting industrial processes. Federated Learning (FL)\ncombined with time-series analysis is a promising cyberattack detection\nmechanism proposed in the literature. However, the fact of having a single\npoint of failure and network bottleneck are critical challenges that need to be\ntackled. Thus, this article explores the benefits of the Decentralized\nFederated Learning (DFL) in terms of cyberattack detection and resource\nconsumption. The work presents TemporalFED, a software module for detecting\nanomalies in industrial environments using FL paradigms and time series.\nTemporalFED incorporates three components: Time Series Conversion, Feature\nEngineering, and Time Series Stationary Conversion. To evaluate TemporalFED, it\nwas deployed on Fedstellar, a DFL framework. Then, a pool of experiments\nmeasured the detection performance and resource consumption in a chemical gas\nindustrial environment with different time-series configurations, FL paradigms,\nand topologies. The results showcase the superiority of the configuration\nutilizing DFL and Semi-Decentralized Federated Learning (SDFL) paradigms, along\nwith a fully connected topology, which achieved the best performance in anomaly\ndetection. Regarding resource consumption, the configuration without feature\nengineering employed less bandwidth, CPU, and RAM than other configurations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:06:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["G\u00f3mez","\u00c1ngel Luis Perales",""],["Beltr\u00e1n","Enrique Tom\u00e1s Mart\u00ednez",""],["S\u00e1nchez","Pedro Miguel S\u00e1nchez",""],["Celdr\u00e1n","Alberto Huertas",""]]}
{"id":"2308.03555","submitter":"Ayush Tripathi","authors":"Ayush Tripathi, Aryan Gupta, A.P. Prathosh, Suriya Prakash\n  Muthukrishnan, Lalan Kumar","title":"NeuroAiR: Deep Learning Framework for Airwriting Recognition from\n  Scalp-recorded Neural Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Airwriting recognition is a task that involves identifying letters written in\nfree space using finger movement. It is a special case of gesture recognition,\nwhere gestures correspond to letters in a specific language.\nElectroencephalography (EEG) is a non-invasive technique for recording brain\nactivity and has been widely used in brain-computer interface applications.\nLeveraging EEG signals for airwriting recognition offers a promising\nalternative input method for Human-Computer Interaction. One key advantage of\nairwriting recognition is that users don't need to learn new gestures. By\nconcatenating recognized letters, a wide range of words can be formed, making\nit applicable to a broader population. However, there has been limited research\nin the recognition of airwriting using EEG signals, which forms the core focus\nof this study. The NeuroAiR dataset comprising EEG signals recorded during\nwriting English uppercase alphabets is first constructed. Various features are\nthen explored in conjunction with different deep learning models to achieve\naccurate airwriting recognition. These features include processed EEG data,\nIndependent Component Analysis components, source-domain-based scout time\nseries, and spherical and head harmonic decomposition-based features.\nFurthermore, the impact of different EEG frequency bands on system performance\nis comprehensively investigated. The highest accuracy achieved in this study is\n44.04% using Independent Component Analysis components and the EEGNet\nclassification model. The results highlight the potential of EEG-based\nairwriting recognition as a user-friendly modality for alternative input\nmethods in Human-Computer Interaction applications. This research sets a strong\nbaseline for future advancements and demonstrates the viability and utility of\nEEG-based airwriting recognition.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:08:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tripathi","Ayush",""],["Gupta","Aryan",""],["Prathosh","A. P.",""],["Muthukrishnan","Suriya Prakash",""],["Kumar","Lalan",""]]}
{"id":"2308.03556","submitter":"Boxiao Shen","authors":"Boxiao Shen, Yongpeng Wu, Wenjun Zhang, Symeon Chatzinotas, Bj\\\"orn\n  Ottersten","title":"Joint Device Identification, Channel Estimation, and Signal Detection\n  for LEO Satellite-Enabled Random Access","comments":"This paper has been accepted for presentation at the IEEE GLOBECOM\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper investigates joint device identification, channel estimation, and\nsignal detection for LEO satellite-enabled grant-free random access, where a\nmultiple-input multipleoutput (MIMO) system with orthogonal time-frequency\nspace modulation (OTFS) is utilized to combat the dynamics of the\nterrestrial-satellite link (TSL). We divide the receiver structure into three\nmodules: first, a linear module for identifying active devices, which leverages\nthe generalized approximate message passing (GAMP) algorithm to eliminate\ninter-user interference in the delay-Doppler domain; second, a non-linear\nmodule adopting the message passing algorithm to jointly estimate channel and\ndetect transmit signals; the third aided by Markov random field (MRF) aims to\nexplore the three dimensional block sparsity of channel in the\ndelay-Doppler-angle domain. The soft information is exchanged iteratively\nbetween these three modules by careful scheduling. Furthermore, the\nexpectation-maximization algorithm is embedded to learn the hyperparameters in\nprior distributions. Simulation results demonstrate that the proposed scheme\noutperforms the conventional methods significantly in terms of activity error\nrate, channel estimation accuracy, and symbol error rate.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:09:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shen","Boxiao",""],["Wu","Yongpeng",""],["Zhang","Wenjun",""],["Chatzinotas","Symeon",""],["Ottersten","Bj\u00f6rn",""]]}
{"id":"2308.03557","submitter":"Martin Doff-Sotta","authors":"Martin Doff-Sotta, Mark Cannon, Marko Bacic","title":"Data-driven robust MPC of tiltwing VTOL aircraft","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 investigates robust tube-based Model Predictive Control (MPC) of a\ntiltwing Vertical Take-Off and Landing (VTOL) aircraft subject to wind\ndisturbances and model uncertainty. Our approach is based on a Difference of\nConvex (DC) function decomposition of the dynamics to develop a computationally\ntractable optimisation with robust tubes for the system trajectories. We\nconsider a case study of a VTOL aircraft subject to wind gusts and whose\naerodynamics is defined from data.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:09:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Doff-Sotta","Martin",""],["Cannon","Mark",""],["Bacic","Marko",""]]}
{"id":"2308.03558","submitter":"Wai Man Si","authors":"Wai Man Si, Michael Backes, Yang Zhang","title":"Mondrian: Prompt Abstraction Attack Against Large Language Models for\n  Cheaper API Pricing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Machine Learning as a Service (MLaaS) market is rapidly expanding and\nbecoming more mature. For example, OpenAI's ChatGPT is an advanced large\nlanguage model (LLM) that generates responses for various queries with\nassociated fees. Although these models can deliver satisfactory performance,\nthey are far from perfect. Researchers have long studied the vulnerabilities\nand limitations of LLMs, such as adversarial attacks and model toxicity.\nInevitably, commercial ML models are also not exempt from such issues, which\ncan be problematic as MLaaS continues to grow. In this paper, we discover a new\nattack strategy against LLM APIs, namely the prompt abstraction attack.\nSpecifically, we propose Mondrian, a simple and straightforward method that\nabstracts sentences, which can lower the cost of using LLM APIs. In this\napproach, the adversary first creates a pseudo API (with a lower established\nprice) to serve as the proxy of the target API (with a higher established\nprice). Next, the pseudo API leverages Mondrian to modify the user query,\nobtain the abstracted response from the target API, and forward it back to the\nend user. Our results show that Mondrian successfully reduces user queries'\ntoken length ranging from 13% to 23% across various tasks, including text\nclassification, generation, and question answering. Meanwhile, these abstracted\nqueries do not significantly affect the utility of task-specific and general\nlanguage models like ChatGPT. Mondrian also reduces instruction prompts' token\nlength by at least 11% without compromising output quality. As a result, the\nprompt abstraction attack enables the adversary to profit without bearing the\ncost of API development and deployment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:10:35 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Si","Wai Man",""],["Backes","Michael",""],["Zhang","Yang",""]]}
{"id":"2308.03559","submitter":"Peter Skj{\\o}tt Thorup","authors":"Rasmus S. Christensen, Peter S. Thorup, Lasse R. J{\\o}rgensen, Martin\n  Roelsgaard, Karl F. F. Fischer, Ann-Christin Dippel and Bo Brummerstedt\n  Iversen","title":"Oxide layer formation prevents deteriorating ion migration in\n  thermoelectric Cu$_2$Se during operation in air","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":"  Cu$_2$Se is a mixed ionic-electronic conductor with outstanding\nthermoelectric performance originally envisioned for space missions.\nApplications were discontinued due to material instability, where elemental Cu\ngrows at the electrode interfaces during operation in vacuum. Here, we show\nthat when Cu$_2$Se is operating in air, formation of an oxide surface layer\nsuppresses Cu$^+$ migration along the current direction. In operando X-ray\nscattering and electrical resistivity measurements quantify Cu$^+$ migration\nthrough refinement of atomic occupancies and phase composition analysis. Cu\ndeposition can be prevented during operation in air, irrespective of a critical\nvoltage, if the thermal gradient is applied along the current direction.\nMaximum entropy electron density analysis provides experimental evidence that\nCu$^+$ migration pathways under thermal and electrical gradients differ\nsubstantially from equilibrium diffusion. The study establishes new promise for\ninexpensive sustainable Cu$_2$Se in thermoelectric applications, and it\nunderscores the importance of atomistic insight into materials during\nthermoelectric operating conditions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:11:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Christensen","Rasmus S.",""],["Thorup","Peter S.",""],["J\u00f8rgensen","Lasse R.",""],["Roelsgaard","Martin",""],["Fischer","Karl F. F.",""],["Dippel","Ann-Christin",""],["Iversen","Bo Brummerstedt",""]]}
{"id":"2308.03560","submitter":"Umberto Zerbinati","authors":"M. L. Trezzi and U. Zerbinati","title":"When rational functions meet virtual elements: The lightning Virtual\n  Element Method","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 propose a lightning Virtual Element Method that eliminates the\nstabilisation term by actually computing the virtual component of the local VEM\nbasis functions using a lightning approximation. In particular, the lightning\nVEM approximates the virtual part of the basis functions using rational\nfunctions with poles clustered exponentially close to the corners of each\nelement of the polygonal tessellation. This results in two great advantages.\nFirst, the mathematical analysis of a priori error estimates is much easier and\nessentially identical to the one for any other non-conforming Galerkin\ndiscretisation. Second, the fact that the lightning VEM truly computes the\nbasis functions allows the user to access the point-wise value of the numerical\nsolution without needing any reconstruction techniques. The cost of the local\nconstruction of the VEM basis is the implementation price that one has to pay\nfor the advantages of the lightning VEM method, but the embarrassingly\nparallelizable nature of this operation will ultimately result in a\ncost-efficient scheme almost comparable to standard VEM and FEM.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:12:39 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 13:57:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Trezzi","M. L.",""],["Zerbinati","U.",""]]}
{"id":"2308.03561","submitter":"Helder Lima","authors":"H\\'elder Lima","title":"Bidiagonal matrix factorisations associated with symmetric multiple\n  orthogonal polynomials and lattice paths","comments":"29 pages, 2 figures. arXiv admin note: text overlap with\n  arXiv:2208.03539","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the two main results presented here we give representations as products of\nbidiagonal matrices for the production matrices of certain generating\npolynomials of lattice paths and we show that those production matrices are the\nHessenberg matrices associated with the components of the decomposition of\nsymmetric multiple orthogonal polynomials. As a consequence of these results,\nwe can use the recently found connection between lattice paths, branched\ncontinued fractions, and multiple orthogonal polynomials to analyse symmetric\nmultiple orthogonal polynomials.\n  We revisit known results about the location of the zeros of symmetric\nmultiple orthogonal polynomials, we find combinatorial interpretations for the\nmoments of the dual sequence of a symmetric multiple orthogonal polynomial\nsequence, we give an explicit proof of the existence of orthogonality measures\nsupported on a starlike set for symmetric multiple orthogonal polynomials with\npositive recurrence coefficients as well as orthogonality measures on the\npositive real line for the components of the decomposition of these symmetric\nmultiple orthogonal polynomials, and we give explicit formulas as terminating\nhypergeometric series for Appell sequences of symmetric multiple orthogonal\npolynomials with respect to an arbitrary number of measures whose densities can\nbe expressed via Meijer G-functions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:14:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lima","H\u00e9lder",""]]}
{"id":"2308.03562","submitter":"Kessem Zamir- Abramovich","authors":"Kessem Zamir- Abramovich, Nathaniel Furman, Albert Herrero-Parareda,\n  Filippo Capolino and Jacob Scheuer","title":"Low-Threshold Lasing with Frozen Mode Regime and Stationary Inflection\n  Point in Three Coupled Waveguide Structure","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The frozen mode regime is a unique slow-light scenario in periodic\nstructures, where the flat-bands (zero group velocity) are associated with the\nformation of high-order stationary points (aka exceptional points). The\nformation of exceptional points is accompanied by enhancement of various\noptical properties such as gain, Q-factor and absorption, which are key\nproperties for the realization of wide variety of devices such as switches,\nmodulators and lasers. Here we present and study a new integrated optical\nperiodic structure consisting of three waveguides coupled via micro-cavities\nand directional coupler. We study this design theoretically, demonstrating that\na proper choice of parameters yields a third order stationary inflection point\n(SIP). We also show that the structure can be designed to exhibit two\nalmost-overlapping SIPs at the center of the Brillouin Zone. We study the\ntransmission and reflection of light propagating through realistic devices\ncomprising a finite number of unit-cells and investigate their spectral\nproperties in the vicinity of the stationary points. Finally, we analyze the\nlasing frequencies and threshold level of finite structures (as a function of\nthe number of unit-cells) and show that it outperforms conventional lasers\nutilizing regular band edge lasing (such as DFB lasers).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:14:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Abramovich","Kessem Zamir-",""],["Furman","Nathaniel",""],["Herrero-Parareda","Albert",""],["Capolino","Filippo",""],["Scheuer","Jacob",""]]}
{"id":"2308.03563","submitter":"Konstantin Sorokin","authors":"Konstantin Sorokin, Andrey Zaitsew, Aleksandr Levin, German Magai,\n  Maxim Beketov, Vladimir Sotskov","title":"Global cognitive graph properties dynamics of hippocampal formation","comments":"12 pages, 6 figures, paper for DAMDID 2023 Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present study we have used a set of methods and metrics to build a\ngraph of relative neural connections in a hippocampus of a rodent. A set of\ngraphs was built on top of time-sequenced data and analyzed in terms of\ndynamics of a connection genesis. The analysis has shown that during the\nprocess of a rodent exploring a novel environment, the relations between\nneurons constantly change which indicates that globally memory is constantly\nupdated even for known areas of space. Even if some neurons gain cognitive\nspecialization, the global network though remains relatively stable.\nAdditionally we suggest a set of methods for building a graph of cognitive\nneural network.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:15:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sorokin","Konstantin",""],["Zaitsew","Andrey",""],["Levin","Aleksandr",""],["Magai","German",""],["Beketov","Maxim",""],["Sotskov","Vladimir",""]]}
{"id":"2308.03564","submitter":"Sh. Khachatryan","authors":"Shahane A. Khachatryan","title":"New series of multi-parametric solutions to GYBE: quantum gates and\n  integrability","comments":"39 pages","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 obtain two series of spectral parameter dependent solutions to the\ngeneralized Yang-Baxter equations (GYBE), for definite types of $N_1^2\\times\nN_2^2$ matrices with general dimensions $N_1$ and $N_2$. Appropriate extensions\nare presented for the inhomogeneous GYBEs. The first series of the solutions\nincludes as particular cases the $X$-shaped trigonometric braiding matrices.\nFor construction of the second series the colored and graded permutation\noperators are defined, and multi-spectral parameter Yang-Baxterization is\nperformed. For some examples the corresponding integrable models are discussed.\nThe unitary solutions existing in these two series can be considered as\ngeneralizations of the multipartite Bell matrices in the quantum information\ntheory.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:15:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Khachatryan","Shahane A.",""]]}
{"id":"2308.03565","submitter":"Tianyi Sun","authors":"Tianyi Sun and Bradley Nelson","title":"Topological Interpretations of GPT-3","comments":"70 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is an experiential study of investigating a consistent method for\nderiving the correlation between sentence vector and semantic meaning of a\nsentence. We first used three state-of-the-art word/sentence embedding methods\nincluding GPT-3, Word2Vec, and Sentence-BERT, to embed plain text sentence\nstrings into high dimensional spaces. Then we compute the pairwise distance\nbetween any possible combination of two sentence vectors in an embedding space\nand map them into a matrix. Based on each distance matrix, we compute the\ncorrelation of distances of a sentence vector with respect to the other\nsentence vectors in an embedding space. Then we compute the correlation of each\npair of the distance matrices. We observed correlations of the same sentence in\ndifferent embedding spaces and correlations of different sentences in the same\nembedding space. These observations are consistent with our hypothesis and take\nus to the next stage.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:16:42 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 12:12:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sun","Tianyi",""],["Nelson","Bradley",""]]}
{"id":"2308.03566","submitter":"Jae-Kyoung Jang","authors":"Sukyoung K. Yi, J. K. Jang, Julien Devriendt, Yohan Dubois, San Han,\n  Taysun Kimm, Katarina Kraljic, Minjung Park, Sebastien Peirani, Christophe\n  Pichon, and Jinsu Rhee","title":"On the Significance of the Thick Disks of Disk Galaxies","comments":"28 pages, 24 figures. Submitted to ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thick disks are a prevalent feature observed in numerous disk galaxies\nincluding our own Milky Way. Their significance has been reported to vary\nwidely, ranging from a few to 100% of the disk mass, depending on the galaxy\nand the measurement method. We use the NewHorizon simulation which has high\nspatial and stellar mass resolutions to investigate the issue of thick disk\nmass fraction. We also use the NewHorizon2 simulation that was run on the same\ninitial conditions but additionally traced nine chemical elements. Based on a\nsample of 27 massive disk galaxies with M* > 10^10 M_{\\odot} in NewHorizon, the\ncontribution of the thick disk was found to be 34 \\pm 15% in r-band luminosity\nor 48 \\pm 13% in mass to the overall galactic disk, which seems in agreement\nwith observational data. The vertical profiles of 0, 22, and 5 galaxies are\nbest fitted by 1, 2, or 3 sech2 components, respectively. The NewHorizon2 data\nshow that the selection of thick disk stars based on a single [{\\alpha}/Fe] cut\nis severely contaminated by stars of different kinematic properties while\nmissing a bulk of kinematically thick disk stars. Vertical luminosity profile\nfits recover the key properties of thick disks reasonably well. The majority of\nstars are born near the galactic mid-plane with high circularity and get heated\nwith time via fluctuation in the force field. Depending on the star formation\nand merger histories, galaxies may naturally develop thick disks with\nsignificantly different properties.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:17:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yi","Sukyoung K.",""],["Jang","J. K.",""],["Devriendt","Julien",""],["Dubois","Yohan",""],["Han","San",""],["Kimm","Taysun",""],["Kraljic","Katarina",""],["Park","Minjung",""],["Peirani","Sebastien",""],["Pichon","Christophe",""],["Rhee","Jinsu",""]]}
{"id":"2308.03567","submitter":"Francesco Coghi","authors":"David C. Stuhrmann and Francesco Coghi","title":"Understanding random-walk dynamical phase coexistence through waiting\n  times","comments":"8 pages, 6 figures. v2: fixed minor typos + added references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the appearance of first-order dynamical phase transitions (DPTs) as\n`intermittent' co-existing phases in the fluctuations of random walks on\ngraphs. We show that the diverging time scale leading to critical behaviour is\nthe waiting time to jump from one phase to another. This time scale is crucial\nfor observing the system's relaxation to stationarity and demonstrates\nergodicity of the system at criticality. We illustrate these results through\nthree analytical examples which provide insights into random walks exploring\nrandom graphs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:17:54 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 16:34:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Stuhrmann","David C.",""],["Coghi","Francesco",""]]}
{"id":"2308.03568","submitter":"Di Yang","authors":"Di Yang, Don Zagier","title":"Mapping partition functions","comments":"72 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AG math.MP nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce an infinite group action on partition functions of WK type,\nmeaning of the type of the partition function $Z^{\\rm WK}$ in the famous result\nof Witten and Kontsevich expressing the partition function of $\\psi$-class\nintegrals on the compactified moduli space $\\overline{\\mathcal{M}}_{g,n}$ as a\n$\\tau$-function for the Korteweg--de Vries hierarchy. Specifically, the group\nwhich acts is the group $\\mathcal{G}$ of formal power series of one variable\n$\\varphi(V)=V+O(V^2)$, with group law given by composition, acting in a\nsuitable way on the infinite tuple of variables of the partition functions. In\nparticular, any $\\varphi \\in \\mathcal{G}$ sends the Witten--Kontsevich (WK)\npartition function $Z^{\\rm WK}$ to a new partition function $Z^\\varphi$, which\nwe call the WK mapping partition function associated to $\\varphi$. We show that\nthe genus zero part of $\\log Z^\\varphi$ is independent of $\\varphi$ and give an\nexplicit recursive description for its higher genus parts (loop equation), and\nas applications of this obtain relationships of the $\\psi$-class integrals to\nGaussian Unitary Ensemble and generalized Br\\'ezin--Gross--Witten correlators.\nIn a different direction, we use $Z^\\varphi$ to construct a new integrable\nhierarchy, which we call the WK mapping hierarchy associated to $\\varphi$. We\nshow that this hierarchy is a bihamiltonian perturbation of the Riemann--Hopf\nhierarchy possessing a $\\tau$-structure, and conjecture that it is a universal\nobject for all such perturbations. Similarly, for any $\\varphi\\in\\mathcal{G}$,\nwe define the Hodge mapping partition function associated to $\\varphi$, prove\nthat it is integrable, and study its role in hamiltonian perturbations of the\nRiemann--Hopf hierarchy possessing a $\\tau$-structure. Finally, we establish a\ngeneralized Hodge--WK correspondence relating different Hodge mapping partition\nfunctions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:18:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Di",""],["Zagier","Don",""]]}
{"id":"2308.03569","submitter":"Aleksandar Ljepoja","authors":"Aleksandar Ljepoja, C.J. Bolech, Nayana Shah","title":"Systematic compactification of the (multi) two-channel Kondo model. I.\n  Consistent bosonization-debosonization approach and exact comparisons","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Capitalizing on recent work, that clarifies the consistent use of\nbosonization-debosonization methods to study Kondo-type quantum impurity models\neven in non-equilibrium settings, we revisit the compactification procedure of\nthe two-channel Kondo model (by which it is rewritten more compactly using the\nsingle-channel version of the model and exploiting separation and duality\nbetween spin and charge) and uncover some hidden approximations that could\nlimit its range of validity. This complements and extends, for two or any even\nnumber of channels, beyond previous work on the Toulouse limit of these models,\nand reinforces the need for the use of an extended framework in these\ncalculations. We carry out a number of exact comparisons between the different\nmodels, and show that keeping track of the, so called, consistency factors\nleads to full agreement between the compactified and original version of the\nmodel.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:19:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ljepoja","Aleksandar",""],["Bolech","C. J.",""],["Shah","Nayana",""]]}
{"id":"2308.03570","submitter":"Maggie Makar","authors":"Ron Nafshi, Maggie Makar","title":"Partial identification of kernel based two sample tests with mismeasured\n  data","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":"  Nonparametric two-sample tests such as the Maximum Mean Discrepancy (MMD) are\noften used to detect differences between two distributions in machine learning\napplications. However, the majority of existing literature assumes that\nerror-free samples from the two distributions of interest are available.We\nrelax this assumption and study the estimation of the MMD under\n$\\epsilon$-contamination, where a possibly non-random $\\epsilon$ proportion of\none distribution is erroneously grouped with the other. We show that under\n$\\epsilon$-contamination, the typical estimate of the MMD is unreliable.\nInstead, we study partial identification of the MMD, and characterize sharp\nupper and lower bounds that contain the true, unknown MMD. We propose a method\nto estimate these bounds, and show that it gives estimates that converge to the\nsharpest possible bounds on the MMD as sample size increases, with a\nconvergence rate that is faster than alternative approaches. Using three\ndatasets, we empirically validate that our approach is superior to the\nalternatives: it gives tight bounds with a low false coverage rate.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:21:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nafshi","Ron",""],["Makar","Maggie",""]]}
{"id":"2308.03571","submitter":"Polina Kofman O.","authors":"Polina Kofman, Sergey Shevchenko, Franco Nori","title":"Tuning the initial phase to control the final state of a driven qubit:\n  single-passage coherent destruction of tunneling","comments":null,"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":"  A driven quantum system can experience Landau-Zener-Stueckelberg-Majorana\n(LZSM) transitions between its states, when the respective energy levels\nquasi-cross. If this quasicrossing is passed repeatedly under periodic driving,\nthe trajectories can interfere either constructively or destructively. In the\nlatter case, known as coherent destruction of tunneling, the transition between\nthe energy states is suppressed. Even for a double-passage case, the\naccumulated phase difference (also referred to as the Stueckelberg phase) can\nlead to destructive interference, resulting in no transition. In this paper we\ndiscuss a similar process for a single-passage dynamics. We study the LZSM\nsingle-passage problem starting from a superposition state. The phase\ndifference of this initial state results in interference. When this is\ndestructive, resulting in a zero transition probability, such situation can be\ncalled single-passage coherent destruction of tunneling. When the phase is\nchosen so that the occupation probabilities do not change after the transition,\nthis can be called occupation conservation and this is analogous to the problem\nof transitionless driving. We demonstrate how varying the system parameters\n(driving velocity, initial phase, initial detuning) can be used for quantum\ncontrol.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:23:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kofman","Polina",""],["Shevchenko","Sergey",""],["Nori","Franco",""]]}
{"id":"2308.03572","submitter":"Xueping Gong","authors":"Xueping Gong and Jiheng Zhang","title":"Provably Efficient Learning in Partially Observable Contextual Bandit","comments":"arXiv admin note: text overlap with arXiv:2010.03104 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we investigate transfer learning in partially observable\ncontextual bandits, where agents have limited knowledge from other agents and\npartial information about hidden confounders. We first convert the problem to\nidentifying or partially identifying causal effects between actions and rewards\nthrough optimization problems. To solve these optimization problems, we\ndiscretize the original functional constraints of unknown distributions into\nlinear constraints, and sample compatible causal models via sequentially\nsolving linear programmings to obtain causal bounds with the consideration of\nestimation error. Our sampling algorithms provide desirable convergence results\nfor suitable sampling distributions. We then show how causal bounds can be\napplied to improving classical bandit algorithms and affect the regrets with\nrespect to the size of action sets and function spaces. Notably, in the task\nwith function approximation which allows us to handle general context\ndistributions, our method improves the order dependence on function space size\ncompared with previous literatures. We formally prove that our causally\nenhanced algorithms outperform classical bandit algorithms and achieve orders\nof magnitude faster convergence rates. Finally, we perform simulations that\ndemonstrate the efficiency of our strategy compared to the current\nstate-of-the-art methods. This research has the potential to enhance the\nperformance of contextual bandit agents in real-world applications where data\nis scarce and costly to obtain.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:24:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gong","Xueping",""],["Zhang","Jiheng",""]]}
{"id":"2308.03573","submitter":"Reda Bellafqira","authors":"Mohammed Lansari, Reda Bellafqira, Katarzyna Kapusta, Vincent\n  Thouvenot, Olivier Bettan, Gouenou Coatrieux","title":"When Federated Learning meets Watermarking: A Comprehensive Overview of\n  Techniques for Intellectual Property Protection","comments":"2figures, 14pages, 3tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated Learning (FL) is a technique that allows multiple participants to\ncollaboratively train a Deep Neural Network (DNN) without the need of\ncentralizing their data. Among other advantages, it comes with\nprivacy-preserving properties making it attractive for application in sensitive\ncontexts, such as health care or the military. Although the data are not\nexplicitly exchanged, the training procedure requires sharing information about\nparticipants' models. This makes the individual models vulnerable to theft or\nunauthorized distribution by malicious actors. To address the issue of\nownership rights protection in the context of Machine Learning (ML), DNN\nWatermarking methods have been developed during the last five years. Most\nexisting works have focused on watermarking in a centralized manner, but only a\nfew methods have been designed for FL and its unique constraints. In this\npaper, we provide an overview of recent advancements in Federated Learning\nwatermarking, shedding light on the new challenges and opportunities that arise\nin this field.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:24:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lansari","Mohammed",""],["Bellafqira","Reda",""],["Kapusta","Katarzyna",""],["Thouvenot","Vincent",""],["Bettan","Olivier",""],["Coatrieux","Gouenou",""]]}
{"id":"2308.03574","submitter":"Etor Arza Gonzalez","authors":"Etor Arza, Leni K. Le Goff and Emma Hart","title":"Generalized Early Stopping in Evolutionary Direct Policy Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG cs.NE cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lengthy evaluation times are common in many optimization problems such as\ndirect policy search tasks, especially when they involve conducting evaluations\nin the physical world, e.g. in robotics applications. Often, when evaluating a\nsolution over a fixed time period, it becomes clear that the objective value\nwill not increase with additional computation time (for example, when a\ntwo-wheeled robot continuously spins on the spot). In such cases, it makes\nsense to stop the evaluation early to save computation time. However, most\napproaches to stop the evaluation are problem-specific and need to be\nspecifically designed for the task at hand. Therefore, we propose an early\nstopping method for direct policy search. The proposed method only looks at the\nobjective value at each time step and requires no problem-specific knowledge.\n  We test the introduced stopping criterion in five direct policy search\nenvironments drawn from games, robotics, and classic control domains, and show\nthat it can save up to 75% of the computation time. We also compare it with\nproblem-specific stopping criteria and demonstrate that it performs comparably\nwhile being more generally applicable.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:25:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Arza","Etor",""],["Goff","Leni K. Le",""],["Hart","Emma",""]]}
{"id":"2308.03575","submitter":"Nikolaos Schetakis","authors":"Nikolaos Schetakis, Davit Aghamalyan, Michael Boguslavsky, Agnieszka\n  Rees, Marc Raktomalala, Paul Griffin","title":"Quantum Machine Learning for Credit Scoring","comments":"12 pages, 5 figures, article","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we explore the use of quantum machine learning (QML) applied to\ncredit scoring for small and medium-sized enterprises (SME). A\nquantum/classical hybrid approach has been used with several models, activation\nfunctions, epochs and other parameters. Results are shown from the best model,\nusing two quantum classifiers and a classical neural network, applied to data\nfor companies in Singapore. We observe significantly more efficient training\nfor the quantum models over the classical models with the quantum model trained\nfor 350 epochs compared to 3500 epochs for comparable prediction performance.\nSurprisingly, a degradation in the accuracy was observed as the number of\nqubits was increased beyond 12 qubits and also with the addition of extra\nclassifier blocks in the quantum model. Practical issues for executing on\nsimulators and real quantum computers are also explored. Overall, we see great\npromise in this first in-depth exploration of the use of hybrid QML in credit\nscoring.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:27:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Schetakis","Nikolaos",""],["Aghamalyan","Davit",""],["Boguslavsky","Michael",""],["Rees","Agnieszka",""],["Raktomalala","Marc",""],["Griffin","Paul",""]]}
{"id":"2308.03576","submitter":"Rebecca Nicholls","authors":"R. Nicholls, D. A. Chaney, G. H. Lander, R. Springell, C. Bell","title":"Structural properties of epitaxial {\\alpha}-U thin films on Ti, Zr, W\n  and Nb","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Thin layers of orthorhombic uranium ({\\alpha}-U) have been grown onto\nbuffered sapphire substrates by d.c. magnetron sputtering, resulting in the\ndiscovery of new epitaxial matches to Ti(00.1) and Zr(00.1) surfaces. These\nsystems have been characterised by X-ray diffraction and reflectivity and the\noptimal deposition temperatures have been determined. More advanced structural\ncharacterisation of the known Nb(110) and W(110) buffered {\\alpha}-U systems\nhas also been carried out, showing that past reports of the domain structures\nof the U layers are incomplete. The ability of this low symmetry structure to\nform crystalline matches across a range of crystallographic templates\nhighlights the complexity of U metal epitaxy and points naturally toward\nstudies of the low temperature electronic properties of {\\alpha}-U as a\nfunction of epitaxial strain.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:32:46 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 11:44:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nicholls","R.",""],["Chaney","D. A.",""],["Lander","G. H.",""],["Springell","R.",""],["Bell","C.",""]]}
{"id":"2308.03577","submitter":"Weijie Tian","authors":"Jun Nian and Weijie Tian","title":"Gravitational Waves of Non-Extremal Kerr Black Holes from Conformal\n  Symmetry","comments":"20 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the low-energy limit, the near region of a generic Kerr black hole has\nbeen conjectured to be holographically dual to a two-dimensional conformal\nfield theory. In this paper, we consider a test object in a circular orbit near\nthe horizon of a non-extremal Kerr black hole. We first couple it to a massless\nscalar field. The resulting scalar radiation at the horizon is computed from\nthe perspectives of gravity and dual conformal field theory. Considering the\ninfluence of nonzero temperature, the agreement of both computations is found.\nThen, we generalize the analysis to the gravitational radiation and find\nagreement again. The agreement supports the conjectured holography and provides\na potential theoretical tool for gravitational wave computations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:34:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nian","Jun",""],["Tian","Weijie",""]]}
{"id":"2308.03578","submitter":"Laxman Dhulipala","authors":"Laxman Dhulipala and Jason Lee and Jakub {\\L}\\k{a}cki and Vahab\n  Mirrokni","title":"TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs","comments":"To appear at SIGMOD 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DB cs.DC cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce TeraHAC, a $(1+\\epsilon)$-approximate hierarchical agglomerative\nclustering (HAC) algorithm which scales to trillion-edge graphs. Our algorithm\nis based on a new approach to computing $(1+\\epsilon)$-approximate HAC, which\nis a novel combination of the nearest-neighbor chain algorithm and the notion\nof $(1+\\epsilon)$-approximate HAC. Our approach allows us to partition the\ngraph among multiple machines and make significant progress in computing the\nclustering within each partition before any communication with other partitions\nis needed.\n  We evaluate TeraHAC on a number of real-world and synthetic graphs of up to 8\ntrillion edges. We show that TeraHAC requires over 100x fewer rounds compared\nto previously known approaches for computing HAC. It is up to 8.3x faster than\nSCC, the state-of-the-art distributed algorithm for hierarchical clustering,\nwhile achieving 1.16x higher quality. In fact, TeraHAC essentially retains the\nquality of the celebrated HAC algorithm while significantly improving the\nrunning time.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:35:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dhulipala","Laxman",""],["Lee","Jason",""],["\u0141\u0105cki","Jakub",""],["Mirrokni","Vahab",""]]}
{"id":"2308.03579","submitter":"Donald Reising","authors":"Joshua H. Tyler, Mohamed K.M. Fadul, Matthew R. Hilling, Donald R.\n  Reising, T. Daniel Loveless","title":"Assessing Adversarial Replay and Deep Learning-Driven Attacks on\n  Specific Emitter Identification-based Security Approaches","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Specific Emitter Identification (SEI) detects, characterizes, and identifies\nemitters by exploiting distinct, inherent, and unintentional features in their\ntransmitted signals. Since its introduction, a significant amount of work has\nbeen conducted; however, most assume the emitters are passive and that their\nidentifying signal features are immutable and challenging to mimic. Suggesting\nthe emitters are reluctant and incapable of developing and implementing\neffective SEI countermeasures; however, Deep Learning (DL) has been shown\ncapable of learning emitter-specific features directly from their raw in-phase\nand quadrature signal samples, and Software-Defined Radios (SDRs) can\nmanipulate them. Based on these capabilities, it is fair to question the ease\nat which an emitter can effectively mimic the SEI features of another or\nmanipulate its own to hinder or defeat SEI. This work considers SEI mimicry\nusing three signal features mimicking countermeasures; off-the-self DL; two\nSDRs of different sizes, weights, power, and cost (SWaP-C); handcrafted and\nDL-based SEI processes, and a coffee shop deployment. Our results show\noff-the-shelf DL algorithms, and SDR enables SEI mimicry; however, adversary\nsuccess is hindered by: the use of decoy emitter preambles, the use of a\ndenoising autoencoder, and SDR SWaP-C constraints.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:35:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tyler","Joshua H.",""],["Fadul","Mohamed K. M.",""],["Hilling","Matthew R.",""],["Reising","Donald R.",""],["Loveless","T. Daniel",""]]}
{"id":"2308.03580","submitter":"Ram Krishna Pandey","authors":"Akshit Achara, Ram Krishna Pandey","title":"Revealing the Underlying Patterns: Investigating Dataset Similarity,\n  Performance, and Generalization","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":"  Supervised deep learning models require significant amount of labelled data\nto achieve an acceptable performance on a specific task. However, when tested\non unseen data, the models may not perform well. Therefore, the models need to\nbe trained with additional and varying labelled data to improve the\ngeneralization. In this work, our goal is to understand the models, their\nperformance and generalization. We establish image-image, dataset-dataset, and\nimage-dataset distances to gain insights into the model's behavior. Our\nproposed distance metric when combined with model performance can help in\nselecting an appropriate model/architecture from a pool of candidate\narchitectures. We have shown that the generalization of these models can be\nimproved by only adding a small number of unseen images (say 1, 3 or 7) into\nthe training set. Our proposed approach reduces training and annotation costs\nwhile providing an estimate of model performance on unseen data in dynamic\nenvironments.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:35:53 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 13:39:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Achara","Akshit",""],["Pandey","Ram Krishna",""]]}
{"id":"2308.03581","submitter":"Yingji Zhang","authors":"Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, Andre Freitas","title":"Towards Controllable Natural Language Inference through Lexical\n  Inference Types","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Explainable natural language inference aims to provide a mechanism to produce\nexplanatory (abductive) inference chains which ground claims to their\nsupporting premises. A recent corpus called EntailmentBank strives to advance\nthis task by explaining the answer to a question using an entailment tree\n\\cite{dalvi2021explaining}. They employ the T5 model to directly generate the\ntree, which can explain how the answer is inferred. However, it lacks the\nability to explain and control the generation of intermediate steps, which is\ncrucial for the multi-hop inference process. % One recent corpus,\nEntailmentBank, aims to push this task forward by explaining an answer to a\nquestion according to an entailment tree \\cite{dalvi2021explaining}. They\nemploy T5 to generate the tree directly, which can explain how the answer is\ninferred but cannot explain how the intermediate is generated, which is\nessential to the multi-hop inference process. In this work, we focus on\nproposing a controlled natural language inference architecture for\nmulti-premise explanatory inference. To improve control and enable explanatory\nanalysis over the generation, we define lexical inference types based on\nAbstract Meaning Representation (AMR) graph and modify the architecture of T5\nto learn a latent sentence representation (T5 bottleneck) conditioned on said\ntype information. We also deliver a dataset of approximately 5000 annotated\nexplanatory inference steps, with well-grounded lexical-symbolic operations.\nExperimental results indicate that the inference typing induced at the T5\nbottleneck can help T5 to generate a conclusion under explicit control.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:37:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Yingji",""],["Carvalho","Danilo S.",""],["Pratt-Hartmann","Ian",""],["Freitas","Andre",""]]}
{"id":"2308.03582","submitter":"Hsuvas Borkakoty","authors":"Hsuvas Borkakoty and Luis Espinosa-Anke","title":"WIKITIDE: A Wikipedia-Based Timestamped Definition Pairs Dataset","comments":"Accepted by RANLP 2023 main conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A fundamental challenge in the current NLP context, dominated by language\nmodels, comes from the inflexibility of current architectures to 'learn' new\ninformation. While model-centric solutions like continual learning or\nparameter-efficient fine tuning are available, the question still remains of\nhow to reliably identify changes in language or in the world. In this paper, we\npropose WikiTiDe, a dataset derived from pairs of timestamped definitions\nextracted from Wikipedia. We argue that such resource can be helpful for\naccelerating diachronic NLP, specifically, for training models able to scan\nknowledge resources for core updates concerning a concept, an event, or a named\nentity. Our proposed end-to-end method is fully automatic, and leverages a\nbootstrapping algorithm for gradually creating a high-quality dataset. Our\nresults suggest that bootstrapping the seed version of WikiTiDe leads to better\nfine-tuned models. We also leverage fine-tuned models in a number of downstream\ntasks, showing promising results with respect to competitive baselines.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:38:54 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 12:31:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Borkakoty","Hsuvas",""],["Espinosa-Anke","Luis",""]]}
{"id":"2308.03583","submitter":"Jaco Ruit","authors":"Jaco Ruit","title":"Formal category theory in $\\infty$-equipments I","comments":"56 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a generalization of proarrow equipments to the\n$\\infty$-categorical setting, termed $\\infty$-equipments. These equipments take\nthe form of particular double $\\infty$-categories that support a notion of\ninternal formal higher category theory. We will explore several examples of\n$\\infty$-equipments. In particular, we will study the prototypical example\ngiven by the $\\infty$-equipment of $\\infty$-categories, and construct\n$\\infty$-equipments of $\\infty$-categories internal to general $\\infty$-toposes\nas well. The final objective of this article is to study the fundamental\nnotions of formal higher category theory within an arbitrary\n$\\infty$-equipment. To this end, we not only follow the classical approach but\nalso expand upon it.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:40:03 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ruit","Jaco",""]]}
{"id":"2308.03584","submitter":"Leonardo Azevedo","authors":"Leonardo Guerreiro Azevedo, Renan Francisco Santos Souza, Elton F. de\n  S. Soares, Raphael M. Thiago, Julio Cesar Cardoso Tesolin, Ann C. Oliveira,\n  Marcio Ferreira Moreno","title":"A Polystore Architecture Using Knowledge Graphs to Support Queries on\n  Heterogeneous Data Stores","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern applications commonly need to manage dataset types composed of\nheterogeneous data and schemas, making it difficult to access them in an\nintegrated way. A single data store to manage heterogeneous data using a common\ndata model is not effective in such a scenario, which results in the domain\ndata being fragmented in the data stores that best fit their storage and access\nrequirements (e.g., NoSQL, relational DBMS, or HDFS). Besides, organization\nworkflows independently consume these fragments, and usually, there is no\nexplicit link among the fragments that would be useful to support an integrated\nview. The research challenge tackled by this work is to provide the means to\nquery heterogeneous data residing on distinct data repositories that are not\nexplicitly connected. We propose a federated database architecture by providing\na single abstract global conceptual schema to users, allowing them to write\ntheir queries, encapsulating data heterogeneity, location, and linkage by\nemploying: (i) meta-models to represent the global conceptual schema, the\nremote data local conceptual schemas, and mappings among them; (ii) provenance\nto create explicit links among the consumed and generated data residing in\nseparate datasets. We evaluated the architecture through its implementation as\na polystore service, following a microservice architecture approach, in a\nscenario that simulates a real case in Oil \\& Gas industry. Also, we compared\nthe proposed architecture to a relational multidatabase system based on foreign\ndata wrappers, measuring the user's cognitive load to write a query (or query\ncomplexity) and the query processing time. The results demonstrated that the\nproposed architecture allows query writing two times less complex than the one\nwritten for the relational multidatabase system, adding an excess of no more\nthan 30% in query processing time.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:42:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Azevedo","Leonardo Guerreiro",""],["Souza","Renan Francisco Santos",""],["Soares","Elton F. de S.",""],["Thiago","Raphael M.",""],["Tesolin","Julio Cesar Cardoso",""],["Oliveira","Ann C.",""],["Moreno","Marcio Ferreira",""]]}
{"id":"2308.03585","submitter":"Mengyu Cao","authors":"Jiaqi Liao, Zequn Lv, Mengyu Cao, Mei Lu","title":"Nontrivial Intersecting Families in Multisets","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $ k $, $ m $ and $ n $ be three positive integers. A $ k $-multiset in $\n[n]_m $ ($ m = \\infty $ is allowed) is a $ k $-`set' whose elements are\nintegers from $ \\cb{1, \\ldots, n} $, and each element is allowed to have at\nmost $ m $ repetitions. A family of $ k $-multisets in $ [n]_m $ is called\nintersecting if every pair of $k$-multisets from the family have non-empty\nintersection. In this paper, we use a transpositional trick and the\nHilton-Milner Theorem to give the size and structure of the largest non-trivial\nintersecting family of $ k $-multisets in $ [n]_m $.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:44:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liao","Jiaqi",""],["Lv","Zequn",""],["Cao","Mengyu",""],["Lu","Mei",""]]}
{"id":"2308.03586","submitter":"Nafiseh Kakhani","authors":"Nafiseh Kakhani, Moien Rangzan, Ali Jamali, Sara Attarchi, Seyed Kazem\n  Alavipanah, and Thomas Scholten","title":"SoilNet: An Attention-based Spatio-temporal Deep Learning Framework for\n  Soil Organic Carbon Prediction with Digital Soil Mapping in Europe","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Digital soil mapping (DSM) is an advanced approach that integrates\nstatistical modeling and cutting-edge technologies, including machine learning\n(ML) methods, to accurately depict soil properties and their spatial\ndistribution. Soil organic carbon (SOC) is a crucial soil attribute providing\nvaluable insights into soil health, nutrient cycling, greenhouse gas emissions,\nand overall ecosystem productivity. This study highlights the significance of\nspatial-temporal deep learning (DL) techniques within the DSM framework. A\nnovel architecture is proposed, incorporating spatial information using a base\nconvolutional neural network (CNN) model and spatial attention mechanism, along\nwith climate temporal information using a long short-term memory (LSTM)\nnetwork, for SOC prediction across Europe. The model utilizes a comprehensive\nset of environmental features, including Landsat-8 images, topography, remote\nsensing indices, and climate time series, as input features. Results\ndemonstrate that the proposed framework outperforms conventional ML approaches\nlike random forest commonly used in DSM, yielding lower root mean square error\n(RMSE). This model is a robust tool for predicting SOC and could be applied to\nother soil properties, thereby contributing to the advancement of DSM\ntechniques and facilitating land management and decision-making processes based\non accurate information.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:44:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kakhani","Nafiseh",""],["Rangzan","Moien",""],["Jamali","Ali",""],["Attarchi","Sara",""],["Alavipanah","Seyed Kazem",""],["Scholten","Thomas",""]]}
{"id":"2308.03587","submitter":"Atindra Pal","authors":"Rafiqul Alam, Prasun Boyal, Shubhankar Roy, Ratnadwip Singha,\n  Buddhadeb Pal, Riju Pal, Prabhat Mandal, Priya Mahadevan and Atindra Nath Pal","title":"Detection of nontrivial topology driven by charge density wave in a\n  semi-Dirac metal","comments":"11 pages, 4 figures, Includes supplementary information, Accepted in\n  Advanced Functional Materials","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 presence of electron correlations in a system with topological order can\nlead to exotic ground states. Considering single crystals of LaAgSb2 which has\na square net crystal structure, one finds multiple charge density wave\ntransitions (CDW) as the temperature is lowered. We find large planar Hall\n(PHE) signals in the CDW phase, which are still finite in the high temperature\nphase though they change sign. Optimising the structure within first-principles\ncalculations, one finds an unusual chiral metallic phase. This is because as\nthe temperature is lowered, the electrons on the Ag atoms get more localized,\nleading to stronger repulsions between electrons associated with atoms on\ndifferent layers. This leads to successive layers sliding with respect to each\nother, thereby stabilising a chiral structure in which inversion symmetry is\nalso broken. The large Berry curvature associated with the low temperature\nstructure explains the low temperature PHE. At high temperature the PHE arises\nfrom the changes induced in the tilted Dirac cone in a magnetic field. Our work\nrepresents a route towards detecting and understanding the mechanism in a\ncorrelation driven topological transition through electron transport\nmeasurements, complemented by ab-initio electronic structure calculations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:44:45 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 12:56:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Alam","Rafiqul",""],["Boyal","Prasun",""],["Roy","Shubhankar",""],["Singha","Ratnadwip",""],["Pal","Buddhadeb",""],["Pal","Riju",""],["Mandal","Prabhat",""],["Mahadevan","Priya",""],["Pal","Atindra Nath",""]]}
{"id":"2308.03588","submitter":"Penghang Yu","authors":"Penghang Yu, Zhiyi Tan, Guanming Lu, Bing-Kun Bao","title":"Multi-View Graph Convolutional Network for Multimedia Recommendation","comments":"MM'23","journal-ref":null,"doi":"10.1145/3581783.3613915","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multimedia recommendation has received much attention in recent years. It\nmodels user preferences based on both behavior information and item multimodal\ninformation. Though current GCN-based methods achieve notable success, they\nsuffer from two limitations: (1) Modality noise contamination to the item\nrepresentations. Existing methods often mix modality features and behavior\nfeatures in a single view (e.g., user-item view) for propagation, the noise in\nthe modality features may be amplified and coupled with behavior features. In\nthe end, it leads to poor feature discriminability; (2) Incomplete user\npreference modeling caused by equal treatment of modality features. Users often\nexhibit distinct modality preferences when purchasing different items. Equally\nfusing each modality feature ignores the relative importance among different\nmodalities, leading to the suboptimal user preference modeling. To tackle the\nabove issues, we propose a novel Multi-View Graph Convolutional Network for the\nmultimedia recommendation. Specifically, to avoid modality noise contamination,\nthe modality features are first purified with the aid of item behavior\ninformation. Then, the purified modality features of items and behavior\nfeatures are enriched in separate views, including the user-item view and the\nitem-item view. In this way, the distinguishability of features is enhanced.\nMeanwhile, a behavior-aware fuser is designed to comprehensively model user\npreferences by adaptively learning the relative importance of different\nmodality features. Furthermore, we equip the fuser with a self-supervised\nauxiliary task. This task is expected to maximize the mutual information\nbetween the fused multimodal features and behavior features, so as to capture\ncomplementary and supplementary preference information simultaneously.\nExtensive experiments on three public datasets demonstrate the effectiveness of\nour methods.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:45:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yu","Penghang",""],["Tan","Zhiyi",""],["Lu","Guanming",""],["Bao","Bing-Kun",""]]}
{"id":"2308.03589","submitter":"Kary Fr\\\"amling","authors":"Kary Fr\\\"amling","title":"Feature Importance versus Feature Influence and What It Signifies for\n  Explainable AI","comments":"Presented at The 1st World Conference on eXplainable Artificial\n  Intelligence, Lissabon, 26-28 July 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When used in the context of decision theory, feature importance expresses how\nmuch changing the value of a feature can change the model outcome (or the\nutility of the outcome), compared to other features. Feature importance should\nnot be confused with the feature influence used by most state-of-the-art\npost-hoc Explainable AI methods. Contrary to feature importance, feature\ninfluence is measured against a reference level or baseline. The Contextual\nImportance and Utility (CIU) method provides a unified definition of global and\nlocal feature importance that is applicable also for post-hoc explanations,\nwhere the value utility concept provides instance-level assessment of how\nfavorable or not a feature value is for the outcome. The paper shows how CIU\ncan be applied to both global and local explainability, assesses the fidelity\nand stability of different methods, and shows how explanations that use\ncontextual importance and contextual utility can provide more expressive and\nflexible explanations than when using influence only.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:46:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fr\u00e4mling","Kary",""]]}
{"id":"2308.03590","submitter":"Aleksandar Ljepoja","authors":"Aleksandar Ljepoja, Nayana Shah, C. J. Bolech","title":"Systematic compactification of the (multi) two-channel Kondo model. II.\n  Comparative study of scaling and universality","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Following up on the systematic compactification of the two-channel Kondo\nmodel (and its multi-channel extensions; see companion paper I) and the\ndemonstration of its validity over the past proposal of compactification, we\nresort to a study of scaling using Anderson's simple poor man's procedure to\ncarry out a comparative study of these two and the original model. By doing so\nwe unveil a universal agreement among the three models in how they flow upon\nscaling, and suggest what are the general limits of such a concordance. In this\nway we further elucidate the conditions under which the standard\nsimplifications implicit in many bosonization-based mappings (particularly of\nquantum impurity models) can be used reliably, and when the consistent\nbosonization-debosonization approach is needed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:46:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ljepoja","Aleksandar",""],["Shah","Nayana",""],["Bolech","C. J.",""]]}
{"id":"2308.03591","submitter":"Xiaozhe Wang","authors":"Xun Gong, Xiaozhe Wang, Bo Cao","title":"On Data-Driven Modeling and Control in Modern Power Grids Stability:\n  Survey and Perspective","comments":"To appear in Applied Energy","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Modern power grids are fast evolving with the increasing volatile renewable\ngeneration, distributed energy resources (DERs) and time-varying operating\nconditions. The DERs include rooftop photovoltaic (PV), small wind turbines,\nenergy storages, flexible loads, electric vehicles (EVs), etc. The grid control\nis confronted with low inertia, uncertainty and nonlinearity that challenge the\noperation security, efficacy and efficiency. The ongoing digitization of power\ngrids provides opportunities to address the challenges with data-driven and\ncontrol. This paper provides a comprehensive review of emerging data-driven\ndynamical modeling and control methods and their various applications in power\ngrid. Future trends are also discussed based on advances in data-driven\ncontrol.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:47:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gong","Xun",""],["Wang","Xiaozhe",""],["Cao","Bo",""]]}
{"id":"2308.03592","submitter":"Michael Berhanu Dr","authors":"Martin Chaigne, Michael Berhanu and Arshad Kudrolli","title":"Dissolution-driven propulsion of floating solids","comments":null,"journal-ref":"Proceedings of the National Academy of Sciences,\n  120(32):e2301947120, 2023","doi":"10.1073/pnas.2301947120","report-no":null,"categories":"cond-mat.soft physics.flu-dyn physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that unconstrained asymmetric dissolving solids floating in a fluid\ncan move rectilinearly as a result of attached density currents which occur\nalong their inclined surfaces. Solids in the form of boats composed of\ncentimeter-scale sugar and salt slabs attached to a buoy are observed to move\nrapidly in water with speeds up to 5 mm/s determined by the inclination angle\nand orientation of the dissolving surfaces. While symmetric boats drift slowly,\nasymmetric boats are observed to accelerate rapidly along a line before\nreaching a terminal velocity when their drag matches the thrust generated by\ndissolution. By visualizing the flow around the body, we show that the boat\nvelocity is always directed opposite to the horizontal component of the density\ncurrent. We derive the thrust acting on the body from its measured kinematics,\nand show that the propulsion mechanism is consistent with the unbalanced\nmomentum generated by the attached density current. We obtain an analytical\nformula for the body speed depending on geometry and material properties, and\nshow that it captures the observed trends reasonably. Our analysis shows that\nthe gravity current sets the scale of the body speed consistent with our\nobservations, and we estimate that speeds can grow slowly as the cube-root of\nthe length of the inclined dissolving surface. The dynamics of dissolving\nsolids demonstrated here applies equally well to solids undergoing phase\nchange, and may enhance the drift of melting icebergs, besides unraveling a\nprimal strategy by which to achieve locomotion in active matter.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:48:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chaigne","Martin",""],["Berhanu","Michael",""],["Kudrolli","Arshad",""]]}
{"id":"2308.03593","submitter":"Justin Gambrell","authors":"Justin Gambrell, Eric Brewe","title":"Towards a Generalized Assessment of Computational Thinking for\n  Introductory Physics Students","comments":"22 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational thinking in physics has many different forms, definitions, and\nimplementations depending on the level of physics, or the institution it is\npresented in. In order to better integrate computational thinking in\nintroductory physics, we need to understand what physicists find important\nabout computational thinking in introductory physics. We present a qualitative\nanalysis of twenty-six interviews asking academic (N=18) and industrial (N=8)\nphysicists about the teaching and learning of computational thinking in\nintroductory physics courses. These interviews are part of a longer-term\nproject towards developing an assessment protocol for computational thinking in\nintroductory physics. We find that academic and industrial physicists value\nstudents' ability to read code and that Python (or VPython) and spreadsheets\nwere the preferred computational language or environment used. Additionally,\nthe interviewees mentioned that identifying the core physics concepts within a\nprogram, explaining code to others, and good program hygiene (i.e., commenting\nand using meaningful variable names) are important skills for introductory\nstudents to acquire. We also find that while a handful of interviewees note\nthat the experience and skills gained from computation are quite useful for\nstudent's future careers, they also describe multiple limiting factors of\nteaching computation in introductory physics, such as curricular overhaul, not\nhaving \"space\" for computation, and student rejection. The interviews show that\nwhile adding computational thinking to physics students repertoire is\nimportant, the importance really comes from using computational thinking to\nlearn and understand physics better. This informs us that the assessment we\ndevelop should only include the basics of computational thinking needed to\nassess introductory physics knowledge.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:51:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Gambrell","Justin",""],["Brewe","Eric",""]]}
{"id":"2308.03594","submitter":"Khurram Azeem Hashmi","authors":"Khurram Azeem Hashmi, Goutham Kallempudi, Didier Stricker, Muhammamd\n  Zeshan Afzal","title":"FeatEnHancer: Enhancing Hierarchical Features for Object Detection and\n  Beyond Under Low-Light Vision","comments":"19 pages, 9 Figures, and 10 Tables. Accepted at ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Extracting useful visual cues for the downstream tasks is especially\nchallenging under low-light vision. Prior works create enhanced representations\nby either correlating visual quality with machine perception or designing\nillumination-degrading transformation methods that require pre-training on\nsynthetic datasets. We argue that optimizing enhanced image representation\npertaining to the loss of the downstream task can result in more expressive\nrepresentations. Therefore, in this work, we propose a novel module,\nFeatEnHancer, that hierarchically combines multiscale features using\nmultiheaded attention guided by task-related loss function to create suitable\nrepresentations. Furthermore, our intra-scale enhancement improves the quality\nof features extracted at each scale or level, as well as combines features from\ndifferent scales in a way that reflects their relative importance for the task\nat hand. FeatEnHancer is a general-purpose plug-and-play module and can be\nincorporated into any low-light vision pipeline. We show with extensive\nexperimentation that the enhanced representation produced with FeatEnHancer\nsignificantly and consistently improves results in several low-light vision\ntasks, including dark object detection (+5.7 mAP on ExDark), face detection\n(+1.5 mAPon DARK FACE), nighttime semantic segmentation (+5.1 mIoU on ACDC ),\nand video object detection (+1.8 mAP on DarkVision), highlighting the\neffectiveness of enhancing hierarchical features under low-light vision.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:52:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hashmi","Khurram Azeem",""],["Kallempudi","Goutham",""],["Stricker","Didier",""],["Afzal","Muhammamd Zeshan",""]]}
{"id":"2308.03595","submitter":"Renan Fernando Franco Da Silva","authors":"Renan F. F. da Silva and Rafael C. S. Schouery","title":"A Branch-and-Cut-and-Price Algorithm for Cutting Stock and Related\n  Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a branch-and-cut-and-price framework to solve Cutting Stock\nProblems with strong relaxations using Set Covering (Partition) Formulations,\nwhich are solved by column generation. We propose an extended Ryan-Foster\nbranching scheme for non-binary models, a pricing algorithm that converges in a\nfew iterations, and a variable selection algorithm based on branching history.\nThese strategies are combined with subset-row cuts and custom primal heuristics\nto create a framework that overcomes the current state-of-the-art for the\nfollowing problems: Cutting Stock, Skiving Stock, Ordered Open-End Bin Packing,\nClass-Constrained Bin Packing, and Identical Parallel Machines Scheduling with\nMinimum Makespan. Additionally, a new challenging benchmark for Cutting Stock\nis introduced.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:56:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["da Silva","Renan F. F.",""],["Schouery","Rafael C. S.",""]]}
{"id":"2308.03596","submitter":"Saeed Haddadi","authors":"M. R. Pourkarimi, S. Haddadi, M. Nashaat, K. V. Kulikov and Yu. M.\n  Shukrinov","title":"Thermal local quantum uncertainty in a two-qubit-superconducting system\n  under decoherence","comments":"11 pages, 9 figures. All comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By considering the local quantum uncertainty (LQU) as a measure of quantum\ncorrelations, the thermal evolution of a two-qubit-superconducting system is\ninvestigated. We show that the thermal LQU can be increased by manipulating the\nHamiltonian parameters such as the mutual coupling and Josephson energies,\nhowever, it undergoes sudden transitions at specific temperatures. Notably, our\ntheoretical results are in good agreement with experimental data for thermal\nentanglement. Furthermore, a detailed analysis is presented regarding the\nimpact of decohering channels on thermal LQU. This controllable LQU in\nengineering applications can disclose the advantage enabled in the\nsuperconducting charge qubits for designing quantum computers and quantum\nbatteries.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:57:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pourkarimi","M. R.",""],["Haddadi","S.",""],["Nashaat","M.",""],["Kulikov","K. V.",""],["Shukrinov","Yu. M.",""]]}
{"id":"2308.03597","submitter":"Sylwia Bujkiewicz","authors":"Chinyereugo M Umemneku-Chikere, Lorna Wheaton, Heather Poad, Devleena\n  Ray, Ilse Cuevas Andrade, Sam Khan, Paul Tappenden, Keith R Abrams, Rhiannon\n  K Owen and Sylwia Bujkiewicz","title":"Individual participant data from digital sources informed and improved\n  precision in the evaluation of predictive biomarkers in Bayesian network\n  meta-analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Objective: We aimed to develop a meta-analytic model for evaluation of\npredictive biomarkers and targeted therapies, utilising data from digital\nsources when individual participant data (IPD) from randomised controlled\ntrials (RCTs) are unavailable.\n  Methods: A Bayesian network meta-regression model, combining aggregate data\n(AD) from RCTs and IPD, was developed for modelling time-to-event data to\nevaluate predictive biomarkers. IPD were sourced from electronic health\nrecords, using target trial emulation approach, or digitised Kaplan-Meier\ncurves. The model is illustrated using two examples; breast cancer with a\nhormone receptor biomarker, and metastatic colorectal cancer with the Kirsten\nRat Sarcoma (KRAS) biomarker.\n  Results: The model developed allowed for estimation of treatment effects in\ntwo subgroups of patients defined by their biomarker status. Effectiveness of\ntaxane did not differ in hormone receptor positive and negative breast cancer\npatients. Epidermal growth factor receptor (EGFR) inhibitors were more\neffective than chemotherapy in KRAS wild type colorectal cancer patients but\nnot in patients with KRAS mutant status. Use of IPD reduced uncertainty of the\nsub-group specific treatment effect estimates by up to 49%.\n  Conclusion: Utilisation of IPD allowed for more detailed evaluation of\npredictive biomarkers and cancer therapies and improved precision of the\nestimates compared to use of AD alone.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:59:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Umemneku-Chikere","Chinyereugo M",""],["Wheaton","Lorna",""],["Poad","Heather",""],["Ray","Devleena",""],["Andrade","Ilse Cuevas",""],["Khan","Sam",""],["Tappenden","Paul",""],["Abrams","Keith R",""],["Owen","Rhiannon K",""],["Bujkiewicz","Sylwia",""]]}
{"id":"2308.03598","submitter":"Mla{\\dj}an Jovanovi\\'c Dr","authors":"Peter Voss and Mladjan Jovanovic","title":"Why We Don't Have AGI Yet","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The original vision of AI was re-articulated in 2002 via the term 'Artificial\nGeneral Intelligence' or AGI. This vision is to build 'Thinking Machines' -\ncomputer systems that can learn, reason, and solve problems similar to the way\nhumans do. This is in stark contrast to the 'Narrow AI' approach practiced by\nalmost everyone in the field over the many decades. While several large-scale\nefforts have nominally been working on AGI (most notably DeepMind), the field\nof pure focused AGI development has not been well funded or promoted. This is\nsurprising given the fantastic value that true AGI can bestow on humanity. In\naddition to the dearth of effort in this field, there are also several\ntheoretical and methodical missteps that are hampering progress. We highlight\nwhy purely statistical approaches are unlikely to lead to AGI, and identify\nseveral crucial cognitive abilities required to achieve human-like adaptability\nand autonomous learning. We conclude with a survey of socio-technical factors\nthat have undoubtedly slowed progress towards AGI.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:59:31 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 14:49:24 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 11:30:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Voss","Peter",""],["Jovanovic","Mladjan",""]]}
{"id":"2308.03599","submitter":"Amelia Panther","authors":"Amelia Panther, Alexander A. Tsirlin, Ioannis Rousochatzakis","title":"Frustration relief and reorientation transition in the kagome-like\n  dolerophanite Cu$_2$OSO$_4$","comments":"20 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 a theoretical study of dolerophanite Cu$_2$OSO$_4$, a layered\nkagome-like spin-$\\frac{1}{2}$ magnetic insulator that can be described either\nas a system of chains coupled through dimers or as a kagome lattice where every\nthird spin is replaced by a ferromagnetic spin dimer. Building on insights from\nab initio calculations, classical numerical minimizations, and semiclassical\nexpansions, we arrive at a minimal microscopic description that accounts for\nthe experimental data reported so far, including the nature of the magnetic\norder, the reported spin length, and the observed anisotropy. The latter arises\nby a peculiar competition between the antisymmetric (Dzyaloshinskii-Moriya) and\nthe symmetric part of the exchange anisotropy, which gives rise to a two-step\nre-orientation process involving two successive continuous phase transitions.\nOur work uncovers mechanisms stabilizing canted ferrimagnetic order in kagome\nsystems, and highlights strong magnetic anisotropy in the presence if\ndissimilar magnetic orbitals on crystallographically nonequivalent Cu sites. We\nalso show how these anisotropy terms affect the spin-wave spectrum and how they\ncan be tracked experimentally.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:00:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Panther","Amelia",""],["Tsirlin","Alexander A.",""],["Rousochatzakis","Ioannis",""]]}
{"id":"2308.03600","submitter":"Brinda Kuthanazhi","authors":"Brinda Kuthanazhi, Simon X. M. Riberolles, Dominic H. Ryan, Philip J.\n  Ryan, Jong-Woo Kim, Lin-Lin Wang, Robert J. McQueeney, Benjamin G. Ueland and\n  Paul C. Canfield","title":"Single crystal growth and characterization of antiferromagnetically\n  ordering EuIn$_2$","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":"  We report the single crystal growth and characterization of EuIn$_2$, a\nmagnetic topological semimetal candidate according to our density functional\ntheory (DFT) calculations. We present results from electrical resistance,\nmagnetization, M\\\"ossbauer spectroscopy, and X-ray resonant magnetic scattering\n(XRMS) measurements. We observe three magnetic transitions at\n$T_{\\text{N}1}\\sim 14.2~$K, $T_{\\text{N}2}\\sim12.8~$K and $T_{\\text{N}3}\\sim\n11~$K, signatures of which are consistently seen in anisotropic temperature\ndependent magnetic susceptibility and electrical resistance data. M\\\"ossbauer\nspectroscopy measurements on ground crystals suggest an incommensurate\nsinusoidally modulated magnetic structure below the transition at\n$T_{\\text{N}1}\\sim 14~$K, followed by the appearance of higher harmonics in the\nmodulation on further cooling roughly below $T_{\\text{N}2}\\sim13~$K, before the\nmoment distribution squaring up below the lowest transition around\n$T_{\\text{N}3}\\sim 11~$K. XRMS measurements showed the appearance of magnetic\nBragg peaks below $T_{\\text{N}1}\\sim14~$K, with a propagation vector of\n$\\bm{\\tau}$ $=(\\tau_h,\\bar{\\tau}_h,0)$, with $\\tau_h$varying with temperature,\nand showing a jump at $T_{\\text{N}3}\\sim11$~K. The temperature dependence of\n$\\tau_h$ between $\\sim11$~K and $14$~K shows incommensurate values consistent\nwith the M\\\"{o}ssbauer data. XRMS data indicate that $\\tau_h$ remains\nincommensurate at low temperatures and locks into $\\tau_h=0.3443(1)$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:02:06 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kuthanazhi","Brinda",""],["Riberolles","Simon X. M.",""],["Ryan","Dominic H.",""],["Ryan","Philip J.",""],["Kim","Jong-Woo",""],["Wang","Lin-Lin",""],["McQueeney","Robert J.",""],["Ueland","Benjamin G.",""],["Canfield","Paul C.",""]]}
{"id":"2308.03601","submitter":"Du\\v{s}an Vari\\v{s}","authors":"Josef Jon, Du\\v{s}an Vari\\v{s}, Michal Nov\\'ak, Jo\\~ao Paulo Aires and\n  Ond\\v{r}ej Bojar","title":"Negative Lexical Constraints in Neural 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":"  This paper explores negative lexical constraining in English to Czech neural\nmachine translation. Negative lexical constraining is used to prohibit certain\nwords or expressions in the translation produced by the neural translation\nmodel. We compared various methods based on modifying either the decoding\nprocess or the training data. The comparison was performed on two tasks:\nparaphrasing and feedback-based translation refinement. We also studied to\nwhich extent these methods \"evade\" the constraints presented to the model\n(usually in the dictionary form) by generating a different surface form of a\ngiven constraint.We propose a way to mitigate the issue through training with\nstemmed negative constraints to counter the model's ability to induce a variety\nof the surface forms of a word that can result in bypassing the constraint. We\ndemonstrate that our method improves the constraining, although the problem\nstill persists in many cases.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:04:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jon","Josef",""],["Vari\u0161","Du\u0161an",""],["Nov\u00e1k","Michal",""],["Aires","Jo\u00e3o Paulo",""],["Bojar","Ond\u0159ej",""]]}
{"id":"2308.03602","submitter":"Ritesh Ghosh","authors":"Ritesh Ghosh, Sibasish Laha, Eileen Meyer, Agniva Roychowdhury,\n  Xiaolong Yang, J. A. Acosta Pulido, Suvendu Rakshit, Shivangi Pandey, Josefa\n  Becerra Gonzalez, Ehud Behar, Luigi C. Gallo, Francesca Panessa, Stefano\n  Bianchi, Fabio La Franca, Nicolas Scepi, Mitchell C. Begelman, Anna Lia\n  Longinotti, Elisabeta Lusso, Samantha Oates, Matt Nicholl, S. Bradley Cenko,\n  Brendan O Connor, Erica Hammerstein, Jincen Jose, Krisztina Eva Gabanyi,\n  Federica Ricci, and Sabyasachi Chattopadhyay","title":"A re-emerging bright soft-X-ray state of the changing-look Active\n  Galactic Nucleus 1ES~1927+654: a multi-wavelength view","comments":"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":"  1ES1927+654 is a nearby active galactic nucleus that has shown an enigmatic\noutburst in optical/UV followed by X-rays, exhibiting strange variability\npatterns at timescales of months-years. Here we report the unusual X-ray, UV,\nand radio variability of the source in its post-flare state (Jan 2022- May\n2023). Firstly, we detect an increase in the soft X-ray (0.3-2 keV) flux from\nMay 2022- May 2023 by almost a factor of five, which we call the\nbright-soft-state. The hard X-ray 2-10 keV flux increased by a factor of two,\nwhile the UV flux density did not show any significant changes ($\\le 30\\%$) in\nthe same period. The integrated energy pumped into the soft and hard X-ray\nduring this period of eleven months is $\\sim 3.57\\times 10^{50}$ erg and\n$5.9\\times 10^{49}$ erg, respectively. From the energetics, it is evident that\nwhatever is producing the soft excess (SE) is pumping out more energy than\neither the UV or hard X-ray source. Since the energy source presumably is\nultimately the accretion of matter onto the SMBH, the SE emitting region must\nbe receiving the majority of this energy. In addition, the source does not\nfollow the typical disc-corona relation found in AGNs, neither in the initial\nflare (in 2017-2019) nor in the current bright soft state (2022-2023). We found\nthat the core (<1 pc) radio emission at 5 GHz gradually increased till March\n2022 but showed a dip in August 2022. The G\\\"udel Benz relation ($L_{\\rm\nradio}/L_{\\rm X-ray}\\sim 10^{-5}$), however, is still within the expected range\nfor radio-quiet AGN and further follow-up radio observations are currently\nbeing undertaken.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:05:15 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 12:20:59 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ghosh","Ritesh",""],["Laha","Sibasish",""],["Meyer","Eileen",""],["Roychowdhury","Agniva",""],["Yang","Xiaolong",""],["Pulido","J. A. Acosta",""],["Rakshit","Suvendu",""],["Pandey","Shivangi",""],["Gonzalez","Josefa Becerra",""],["Behar","Ehud",""],["Gallo","Luigi C.",""],["Panessa","Francesca",""],["Bianchi","Stefano",""],["La Franca","Fabio",""],["Scepi","Nicolas",""],["Begelman","Mitchell C.",""],["Longinotti","Anna Lia",""],["Lusso","Elisabeta",""],["Oates","Samantha",""],["Nicholl","Matt",""],["Cenko","S. Bradley",""],["Connor","Brendan O",""],["Hammerstein","Erica",""],["Jose","Jincen",""],["Gabanyi","Krisztina Eva",""],["Ricci","Federica",""],["Chattopadhyay","Sabyasachi",""]]}
{"id":"2308.03603","submitter":"Dipanjan Dey","authors":"Dipanjan Dey, Koushiki, Pankaj S. Joshi","title":"Equilibrium states from gravitational collapse of minimally coupled\n  scalar field with non-zero potential","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the model of spherically symmetric and spatially homogeneous\ngravitational collapse of a minimally coupled scalar field. Our study focuses\non obtaining the scalar field potential that leads to a final equilibrium state\nin the gravitational collapse. We demonstrate the existence of a class of\nscalar field solutions that can indeed result in such an end equilibrium state.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:06:57 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dey","Dipanjan",""],["Koushiki","",""],["Joshi","Pankaj S.",""]]}
{"id":"2308.03604","submitter":"Pablo Amster","authors":"Pablo Amster and Juli\\'an Epstein","title":"Another brick in the Gronwall","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  May the Gronwall Lemma be regarded as a maximum principle? An abstract\nversion of the celebrated inequality is obtained by means of the spectral bound\nof a compact operator defined on a Banach lattice. As a consequence, uniqueness\nand continuous dependence results for the general semilinear problem\n$L(u)=N(u)$ are established.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:06:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Amster","Pablo",""],["Epstein","Juli\u00e1n",""]]}
{"id":"2308.03605","submitter":"Hirofumi Nishi","authors":"Hirofumi Nishi and Taichi Kosugi and Yusuke Nishiya and Yu-ichiro\n  Matsushita","title":"Quadratic acceleration of multi-step probabilistic algorithms for state\n  preparation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For quantum state preparation, a non-unitary operator is typically designed\nto decay undesirable states contained in an initial state using ancilla qubits\nand a probabilistic action. Probabilistic algorithms do not accelerate the\ncomputational process compared to classical ones. In this study, quantum\namplitude amplification (QAA) and multi-step probabilistic algorithms are\ncombined to achieve quadratic acceleration. This method outperforms quantum\nphase estimation in terms of infidelity. The quadratic acceleration was\nconfirmed by the probabilistic imaginary-time evolution (PITE) method.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:07:03 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 15:14:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nishi","Hirofumi",""],["Kosugi","Taichi",""],["Nishiya","Yusuke",""],["Matsushita","Yu-ichiro",""]]}
{"id":"2308.03606","submitter":"Aleksandar Ljepoja","authors":"Aleksandar Ljepoja, C. J. Bolech, Nayana Shah","title":"Systematic compactification of the (multi) two-channel Kondo model. III.\n  Extended field-theoretic renormalization group analysis","comments":"28 pages, 14 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We carry out a field-theoretical renormalization group procedure based on the\nCallan-Symanzik equation to calculate the detailed flow for the (multi)\ntwo-channel Kondo model and its compactified versions. In doing so, we go\nbeyond the universal terms in the beta function we obtained using poor man's\nscaling (see companion paper II) and culminate our analysis of how the\ncompactified versions of the model fare against the original one. Among other\nresults, we explore the large-channel-number limit and also extend our\nconsiderations to the finite temperature crossover region. Moreover, we gain\ninsights into the contradistinction between the consistent vs. conventional\nbosonization-debosonization formalisms, thereby advancing our understanding on\nmultiple fronts. In particular, we make use of renormalization-flow arguments\nto further justify the consistent refermionization of the parallel Kondo\ninteraction we presented earlier (see companion paper I).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:07:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ljepoja","Aleksandar",""],["Bolech","C. J.",""],["Shah","Nayana",""]]}
{"id":"2308.03607","submitter":"Arpith Kumar","authors":"Arpith Kumar, Anosh Joseph, Piyush Kumar","title":"Investigating Spontaneous SO(10) Symmetry Breaking in Type IIB Matrix\n  Model","comments":"6 pages, 1 figure. Contribution to the proceedings of the XXV\n  DAE-BRNS HEP Symposium 2022, 12-16 December 2022, IISER Mohali, India","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-perturbative formulations are essential to understand the dynamical\ncompactification of extra dimensions in superstring theories. The type IIB\n(IKKT) matrix model in the large-$N$ limit is one such conjectured formulation\nfor a ten-dimensional type IIB superstring. In this model, a smooth spacetime\nmanifold is expected to emerge from the eigenvalues of the ten bosonic\nmatrices. When this happens, the SO(10) symmetry in the Euclidean signature\nmust be spontaneously broken. The Euclidean version has a severe sign problem\nsince the Pfaffian obtained after integrating out the fermions is inherently\ncomplex. In recent years, the complex Langevin method (CLM) has successfully\ntackled the sign problem. We apply the CLM method to study the Euclidean\nversion of the type IIB matrix model and investigate the possibility of\nspontaneous SO(10) symmetry breaking. In doing so, we encounter a\nsingular-drift problem. To counter this, we introduce supersymmetry-preserving\ndeformations with a Myers term. We study the spontaneous symmetry breaking in\nthe original model at the vanishing deformation parameter limit. Our analysis\nindicates that the phase of the Pfaffian induces the spontaneous SO(10)\nsymmetry breaking in the Euclidean type IIB model.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:59:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kumar","Arpith",""],["Joseph","Anosh",""],["Kumar","Piyush",""]]}
{"id":"2308.03608","submitter":"Zichun Wang","authors":"Zichun Wang, Yulun Zhang, Debing Zhang, Ying Fu","title":"Recurrent Self-Supervised Video Denoising with Denser Receptive Field","comments":"Accepted to ACMMM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised video denoising has seen decent progress through the use of\nblind spot networks. However, under their blind spot constraints, previous\nself-supervised video denoising methods suffer from significant information\nloss and texture destruction in either the whole reference frame or neighbor\nframes, due to their inadequate consideration of the receptive field. Moreover,\nthe limited number of available neighbor frames in previous methods leads to\nthe discarding of distant temporal information. Nonetheless, simply adopting\nexisting recurrent frameworks does not work, since they easily break the\nconstraints on the receptive field imposed by self-supervision. In this paper,\nwe propose RDRF for self-supervised video denoising, which not only fully\nexploits both the reference and neighbor frames with a denser receptive field,\nbut also better leverages the temporal information from both local and distant\nneighbor features. First, towards a comprehensive utilization of information\nfrom both reference and neighbor frames, RDRF realizes a denser receptive field\nby taking more neighbor pixels along the spatial and temporal dimensions.\nSecond, it features a self-supervised recurrent video denoising framework,\nwhich concurrently integrates distant and near-neighbor temporal features. This\nenables long-term bidirectional information aggregation, while mitigating error\naccumulation in the plain recurrent framework. Our method exhibits superior\nperformance on both synthetic and real video denoising datasets. Codes will be\navailable at https://github.com/Wang-XIaoDingdd/RDRF.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:09:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Zichun",""],["Zhang","Yulun",""],["Zhang","Debing",""],["Fu","Ying",""]]}
{"id":"2308.03609","submitter":"Oriol Vendrell","authors":"Jing Sun and Oriol Vendrell","title":"Modification of Thermal Chemical Rates in a Cavity via Resonant Effects\n  in the Collective Regime","comments":"20 pages, 5 figures plus TOC image","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The modification of thermal chemical rates in Fabry-Perot cavities, as\nobserved in experiments, still poses theoretical challenges. While we have a\nbetter grasp of how the reactivity of isolated molecules and model systems\nchanges under strong coupling, we lack a comprehensive understanding of the\ncombined effects and the specific roles played by activated and spectator\nmolecules during reactive events. In this study, we investigate an ensemble of\nrandomly oriented gas-phase HONO molecules undergoing a cis-trans isomerization\nreaction on an ab-initio potential energy surface. Using the classical reactive\nflux method, we analyze the transmission coefficient and determine conditions\nthat lead to accelerated rates within the collective regime. We identify two\nmain mechanisms at work: firstly, spectator molecules enhance the cavity's\nability to dissipate excess energy from the activated molecule post-reactive\nevent. Additionally, the interaction between spectator molecules and the cavity\ngives rise to the creation of polaritonic modes. These modes then interact with\nthe activated molecule at a shifted resonance frequency.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:09:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sun","Jing",""],["Vendrell","Oriol",""]]}
{"id":"2308.03610","submitter":"Liao Qu","authors":"Huichao Zhang, Bowen Chen, Hao Yang, Liao Qu, Xu Wang, Li Chen, Chao\n  Long, Feida Zhu, Kang Du, Min Zheng","title":"AvatarVerse: High-quality & Stable 3D Avatar Creation from Text and Pose","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Creating expressive, diverse and high-quality 3D avatars from highly\ncustomized text descriptions and pose guidance is a challenging task, due to\nthe intricacy of modeling and texturing in 3D that ensure details and various\nstyles (realistic, fictional, etc). We present AvatarVerse, a stable pipeline\nfor generating expressive high-quality 3D avatars from nothing but text\ndescriptions and pose guidance. In specific, we introduce a 2D diffusion model\nconditioned on DensePose signal to establish 3D pose control of avatars through\n2D images, which enhances view consistency from partially observed scenarios.\nIt addresses the infamous Janus Problem and significantly stablizes the\ngeneration process. Moreover, we propose a progressive high-resolution 3D\nsynthesis strategy, which obtains substantial improvement over the quality of\nthe created 3D avatars. To this end, the proposed AvatarVerse pipeline achieves\nzero-shot 3D modeling of 3D avatars that are not only more expressive, but also\nin higher quality and fidelity than previous works. Rigorous qualitative\nevaluations and user studies showcase AvatarVerse's superiority in synthesizing\nhigh-fidelity 3D avatars, leading to a new standard in high-quality and stable\n3D avatar creation. Our project page is: https://avatarverse3d.github.io\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:09:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Huichao",""],["Chen","Bowen",""],["Yang","Hao",""],["Qu","Liao",""],["Wang","Xu",""],["Chen","Li",""],["Long","Chao",""],["Zhu","Feida",""],["Du","Kang",""],["Zheng","Min",""]]}
{"id":"2308.03611","submitter":"Elena Kopylova","authors":"E.A. Kopylova","title":"On global attraction to solitons for 3D Maxwell-Lorentz equations","comments":"12 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the Maxwell field coupled to a single rotating charge. This\nHamiltonian system admits soliton-type solutions, where the field is static,\nwhile the charge rotates with constant angular velocity. We prove that any\nsolution of finite energy converges, in suitable local energy seminorms, to the\ncorresponding soliton in the long time limit.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:13:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kopylova","E. A.",""]]}
{"id":"2308.03612","submitter":"Patrick Brown","authors":"Patrick R. Brown, Clayton P. Barrows, Jarrad G. Wright, Gregory L.\n  Brinkman, Sourabh Dalvi, Jiazi Zhang, and Trieu Mai","title":"A general method for estimating zonal transmission interface limits from\n  nodal network data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Capacity expansion models for the electric power system often employ zonal\n(rather than nodal) resolution, necessitating estimates of aggregate power\ntransfer limits across the interfaces between model zones. Interface limits\nbetween planning areas are sometimes published, but they are not generalizable\nto arbitrary zone shapes. There is thus a need for a reproducible method for\nestimating interface transfer limits (ITLs) between user-defined zones directly\nfrom nodal transmission system data. Here, we present a simple method for\nestimating ITLs using a DC power flow approximation via the power transfer\ndistribution factor (PTDF) matrix. Linear optimization is performed to identify\nthe distribution of power flows that maximizes the total flow on\ninterface-crossing lines, subject to individual line ratings, limits on bus\ninjection/withdrawal, and the relationships among flows, injections, and\nwithdrawals imposed by the PTDF matrix. We demonstrate the application of the\nmethod on a 134-zone ~65000-bus system, and we explore the influence of flow\ndirection, contingency level, and zone size on the estimated ITLs. There is\nsignificant heterogeneity in the ratio of the ITL to the sum of\ninterface-crossing line ratings, which highlights the importance of accounting\nfor the physical constraints on power flows imposed by Kirchhoff's laws when\nestimating zonal ITLs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:14:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Brown","Patrick R.",""],["Barrows","Clayton P.",""],["Wright","Jarrad G.",""],["Brinkman","Gregory L.",""],["Dalvi","Sourabh",""],["Zhang","Jiazi",""],["Mai","Trieu",""]]}
{"id":"2308.03613","submitter":"Fengming Lin","authors":"Fengming Lin, Yan Xia, Nishant Ravikumar, Qiongyao Liu, Michael\n  MacRaild, Alejandro F Frangi","title":"Adaptive Semi-Supervised Segmentation of Brain Vessels with Ambiguous\n  Labels","comments":"Accepted by DALI MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate segmentation of brain vessels is crucial for cerebrovascular disease\ndiagnosis and treatment. However, existing methods face challenges in capturing\nsmall vessels and handling datasets that are partially or ambiguously\nannotated. In this paper, we propose an adaptive semi-supervised approach to\naddress these challenges. Our approach incorporates innovative techniques\nincluding progressive semi-supervised learning, adaptative training strategy,\nand boundary enhancement. Experimental results on 3DRA datasets demonstrate the\nsuperiority of our method in terms of mesh-based segmentation metrics. By\nleveraging the partially and ambiguously labeled data, which only annotates the\nmain vessels, our method achieves impressive segmentation performance on\nmislabeled fine vessels, showcasing its potential for clinical applications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:16:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lin","Fengming",""],["Xia","Yan",""],["Ravikumar","Nishant",""],["Liu","Qiongyao",""],["MacRaild","Michael",""],["Frangi","Alejandro F",""]]}
{"id":"2308.03614","submitter":"Hua-Ming Wang","authors":"Hua-Ming Wang","title":"Times of a branching process with immigration in varying environment\n  attaining a fixed level","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider a branching process $\\{Z_n\\}_{n\\ge 0}$ with immigration in varying\nenvironment. For $a\\in\\{0,1,2,...\\},$ let $C=\\{n\\ge0:Z_n=a\\}$ be the collection\nof times at which the population size of the process attains level $a.$ We give\na criterion to determine whether the set $C$ is finite or not. For critical\nGalton-Watson process, we show that $|C\\cap [1,n]|/\\log n\\rightarrow S$ in\ndistribution, where $S$ is an exponentially distributed random variable with\n$P(S>t)=e^{-t},\\ t>0.$\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:18:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wang","Hua-Ming",""]]}
{"id":"2308.03615","submitter":"Le Xu","authors":"Le Xu, Divyanshu Saxena, Neeraja J. Yadwadkar, Aditya Akella, and\n  Indranil Gupta","title":"Dirigo: Self-scaling Stateful Actors For Serverless Real-time Data\n  Processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose Dirigo, a distributed stream processing service built atop virtual\nactors. Dirigo achieves both a high level of resource efficiency and\nperformance isolation driven by user intent (SLO). To improve resource\nefficiency, Dirigo adopts a serverless architecture that enables time-sharing\nof compute resources among streaming operators, both within and across\napplications. Meanwhile, Dirigo improves performance isolation by inheriting\nthe property of function autoscaling from serverless architecture.\nSpecifically, Dirigo proposes (i) dual-mode actor, an actor abstraction that\ndynamically provides orderliness guarantee for streaming operator during\nautoscaling and (ii) a data plane scheduling mechanism, along with its API,\nthat allows scheduling and scaling at the message-level granularity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:20:02 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Xu","Le",""],["Saxena","Divyanshu",""],["Yadwadkar","Neeraja J.",""],["Akella","Aditya",""],["Gupta","Indranil",""]]}
{"id":"2308.03616","submitter":"Lixiang Zhao","authors":"Lixiang Zhao, Tobias Isenberg, Fuqi Xie, Hai-Ning Liang, Lingyun Yu","title":"MeTACAST: Target- and Context-aware Spatial Selection in VR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose three novel spatial data selection techniques for particle data in\nVR visualization environments. They are designed to be target- and\ncontext-aware and be suitable for a wide range of data features and complex\nscenarios. Each technique is designed to be adjusted to particular selection\nintents: the selection of consecutive dense regions, the selection of\nfilament-like structures, and the selection of clusters -- with all of them\nfacilitating post-selection threshold adjustment. These techniques allow users\nto precisely select those regions of space for further exploration -- with\nsimple and approximate 3D pointing, brushing, or drawing input -- using\nflexible point- or path-based input and without being limited by 3D occlusions,\nnon-homogeneous feature density, or complex data shapes. These new techniques\nare evaluated in a controlled experiment and compared with the Baseline method,\na region-based 3D painting selection. Our results indicate that our techniques\nare effective in handling a wide range of scenarios and allow users to select\ndata based on their comprehension of crucial features. Furthermore, we analyze\nthe attributes, requirements, and strategies of our spatial selection methods\nand compare them with existing state-of-the-art selection methods to handle\ndiverse data features and situations. Based on this analysis we provide\nguidelines for choosing the most suitable 3D spatial selection techniques based\non the interaction environment, the given data characteristics, or the need for\ninteractive post-selection threshold adjustment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:21:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhao","Lixiang",""],["Isenberg","Tobias",""],["Xie","Fuqi",""],["Liang","Hai-Ning",""],["Yu","Lingyun",""]]}
{"id":"2308.03617","submitter":"Dima Shepelyansky L","authors":"A.D.Chepelianskii and D.L.Shepelyansky","title":"Quantum synchronization and entanglement of dissipative qubits coupled\n  to a resonator","comments":"20 pages, 12+4 figs","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the properties of a driven cavity coupled to several qubits in the\nframework of a dissipative Jaynes-Cummings model. We show that the rotating\nwave approximation (RWA) allows to reduce the description of original driven\nmodel to an effective Jaynes-Cummings model with strong coupling between\nphotons and qubits. Two semi-analytical approaches are developed to describe\nthe steady state of this system. We first treat the weak dissipation limit\nwhere we derive perturbative series of rate equations that converge to the\nexact RWA steady-state except near the cavity resonance. This approach exactly\ndescribes the multi-photon resonances in the system. Then in the strong\ndissipation limit we introduce a semiclassical approximation which allows to\nreproduce the mean spin-projections and cavity state. This approach reproduces\nthe RWA exactly in the strong dissipation limit but provides good qualitative\ntrends even in more quantum regimes. We then focus on quantum synchronization\nof qubits through their coupling to the cavity. We demonstrate the entangled\nsteady state of a pair of qubits synchronized through their interaction with a\ndriven cavity in presence of dissipation and decoherence. Finally we discuss\nsynchronization of a larger number of qubits.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:22:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chepelianskii","A. D.",""],["Shepelyansky","D. L.",""]]}
{"id":"2308.03618","submitter":"Jes\\'us Cobos Jim\\'enez","authors":"J. Cobos, D. F. Locher, A. Bermudez, M. M\\\"uller, E. Rico","title":"Noise-aware variational eigensolvers: a dissipative route for lattice\n  gauge theories","comments":"27 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-lat hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel variational ansatz for the ground state preparation of the\n$\\mathbb{Z}_2$ lattice gauge theory (LGT) in quantum simulators (QSs). It\ncombines dissipative and unitary operations in a completely deterministic\nscheme with a circuit complexity that does not scale with the size of the\nconsidered lattice. We find that, with very few variational parameters, the\nansatz is able to achieve $>\\!99\\%$ fidelity with the true ground state in both\nthe confined and deconfined phase of the $\\mathbb{Z}_2$ LGT. We benchmark our\nproposal against the unitary Hamiltonian variational ansatz (HVA), and find a\nclear advantage of our scheme, especially for few variational parameters as\nwell as for large system sizes. After performing a finite-size scaling\nanalysis, we show that our dissipative variational ansatz is able to predict\ncritical exponents with accuracies that surpass the capabilities of the HVA.\nFurthermore, we investigate the ground-state preparation algorithm in the\npresence of circuit-level noise and determine variational error thresholds,\nwhich determine error rates $p_{L}$, below which it would be beneficial to\nincrease the number of layers $L \\mapsto L+1$. Comparing those values to\nquantum gate errors $p$ of state-of-the-art quantum processors, we provide a\ndetailed assessment of the prospects of our scheme to explore the\n$\\mathbb{Z}_2$ LGT on near-term devices.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:23:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cobos","J.",""],["Locher","D. F.",""],["Bermudez","A.",""],["M\u00fcller","M.",""],["Rico","E.",""]]}
{"id":"2308.03619","submitter":"Cesare Tresca","authors":"Cesare Tresca, Pietro Maria Forcella, Andrea Angeletti, Luigi Ranalli,\n  Cesare Franchini, Michele Reticcioli, Gianni Profeta","title":"Evidence of Molecular Hydrogen in the N-doped LuH3 System: a Possible\n  Path to Superconductivity?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The report of near-ambient superconductivity in nitrogen-doped lutetium\nhydrides could represent an epochal discovery, awaited for more than a century,\npossibly leading to inconceivable scientific and technological implications.\nHowever, after months since the first report, clear experimental and\ntheoretical confirmations are yet to come: The initially proposed compound\nstructure fails to explain the superconducting behavior, calling for a shift in\nperspective. By means of machine-learning-accelerated force-field molecular\ndynamics, we explore the formation of H2 molecules in nitrogen-doped lutetium\nhydride, demonstrating the active role of nitrogen in stabilizing this phase.\nOur density functional theory calculations show that the presence of hydrogen\nmolecules leads to a dynamically stable structure, characterized by a\nsuperconducting phase requiring no applied pressure, although the predicted\ntemperatures are still much lower than room temperature. We believe that the\npossibility to stabilize hydrogen in molecular form represents a new route to\nexplore disordered phases in hydrides and their transport properties at near\nambient conditions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:23:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tresca","Cesare",""],["Forcella","Pietro Maria",""],["Angeletti","Andrea",""],["Ranalli","Luigi",""],["Franchini","Cesare",""],["Reticcioli","Michele",""],["Profeta","Gianni",""]]}
{"id":"2308.03620","submitter":"Tao Kong","authors":"Ya Jing, Xuelin Zhu, Xingbin Liu, Qie Sima, Taozheng Yang, Yunhai\n  Feng, Tao Kong","title":"Exploring Visual Pre-training for Robot Manipulation: Datasets, Models\n  and Methods","comments":"IEEE/RSJ International Conference on Intelligent Robots and Systems\n  (IROS), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual pre-training with large-scale real-world data has made great progress\nin recent years, showing great potential in robot learning with pixel\nobservations. However, the recipes of visual pre-training for robot\nmanipulation tasks are yet to be built. In this paper, we thoroughly\ninvestigate the effects of visual pre-training strategies on robot manipulation\ntasks from three fundamental perspectives: pre-training datasets, model\narchitectures and training methods. Several significant experimental findings\nare provided that are beneficial for robot learning. Further, we propose a\nvisual pre-training scheme for robot manipulation termed Vi-PRoM, which\ncombines self-supervised learning and supervised learning. Concretely, the\nformer employs contrastive learning to acquire underlying patterns from\nlarge-scale unlabeled data, while the latter aims learning visual semantics and\ntemporal dynamics. Extensive experiments on robot manipulations in various\nsimulation environments and the real robot demonstrate the superiority of the\nproposed scheme. Videos and more details can be found on\n\\url{https://explore-pretrain-robot.github.io}.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:24:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jing","Ya",""],["Zhu","Xuelin",""],["Liu","Xingbin",""],["Sima","Qie",""],["Yang","Taozheng",""],["Feng","Yunhai",""],["Kong","Tao",""]]}
{"id":"2308.03621","submitter":"Benjamin Perez-Estay","authors":"Benjam\\'in P\\'erez-Estay, Mar\\'ia Luisa Cordero, N\\'estor Sep\\'ulveda,\n  Rodrigo Soto","title":"Accumulation and depletion of E. coli in surfaces mediated by curvature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Can topography be used to control bacteria accumulation? We address this\nquestion in the model system of smooth-swimming and run-and-tumble\n\\textit{Escherichia coli} swimming near a sinusoidal surface, and show that the\naccumulation of bacteria is determined by the characteristic curvature of the\nsurface. For low curvatures, cells swim along the surface due to steric\nalignment and are ejected from the surface when they reach the peak of the\nsinusoid. Increasing curvature enhances this effect and reduces the density of\nbacteria in the curved surface. However, for curvatures larger than\n$\\kappa^*\\approx 0.3 \\mu m^{-1}$, bacteria become trapped in the valleys, where\nthey can remain for long periods of time. Minimal simulations considering only\nsteric interactions with the surface reproduce these results and give insights\ninto the physical mechanisms defining the critical curvature, which is found to\nscale with the inverse of the bacterial length. We show that for curvatures\nlarger than $\\kappa^*$, the otherwise stable alignment with the wall becomes\nunstable while the stable orientation is now perpendicular to the wall, thus\npredicting accurately the onset of trapping at the valleys.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:26:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["P\u00e9rez-Estay","Benjam\u00edn",""],["Cordero","Mar\u00eda Luisa",""],["Sep\u00falveda","N\u00e9stor",""],["Soto","Rodrigo",""]]}
{"id":"2308.03622","submitter":"Analabha Roy","authors":"Mahbub Rahaman, Takashi Mori, Analabha Roy","title":"Phase Crossover induced by Dynamical Many Body Localization in\n  Periodically Driven Long-Range Spin Systems","comments":"Communicated for Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.quant-gas cond-mat.str-el quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamical many-body freezing occurs in periodic transverse field-driven\nintegrable quantum spin systems. Under resonance conditions, quantum dynamics\ncauses practically infinite hysteresis in the drive response, maintaining its\nstarting value. We find similar resonant freezing in the Lipkin-Meshkov-Glick\n(LMG) model. In the LMG, the resonance conditions in the driving field\nsuppresses the heating postulated by the Eigenstate Thermalization Hypothesis\n(ETH) by inducing Dynamical Many Body Localization, or DMBL. This is in\ncontrast to Many Body Localization (MBL), which requires disorder to suppress\nETH. DMBL has been validated by the Inverse Participation Ratio (IPR) of the\nquasi-stationary Floquet modes. Similarly to the TFIM, the LMG exhibits\nhigh-frequency localization only at the resonances. IPR localization in the LMG\ndeteriorates with an inverse system size law at lower frequencies, which\nindicates heating to infinite temperature. Furthermore, adiabatically\nincreasing frequency and amplitude from low values raises the Floquet state IPR\nin the LMG from nearly zero to unity, indicating a phase crossover. This\noccurrence enables a future technique to construct an MBL engine in clean\nsystems that can be cycled by adjusting drive parameters only.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:26:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Rahaman","Mahbub",""],["Mori","Takashi",""],["Roy","Analabha",""]]}
{"id":"2308.03623","submitter":"Francesco Taurone","authors":"Francesco Taurone, Daniel E. Lucani, Marcell Feh\\'er, Qi Zhang","title":"Lossless preprocessing of floating point data to enhance compression","comments":null,"journal-ref":null,"doi":"10.1007/978-3-031-38318-2","report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Data compression algorithms typically rely on identifying repeated sequences\nof symbols from the original data to provide a compact representation of the\nsame information, while maintaining the ability to recover the original data\nfrom the compressed sequence. Using data transformations prior to the\ncompression process has the potential to enhance the compression capabilities,\nbeing lossless as long as the transformation is invertible. Floating point data\npresents unique challenges to generate invertible transformations with high\ncompression potential. This paper identifies key conditions for basic\noperations of floating point data that guarantee lossless transformations.\nThen, we show four methods that make use of these observations to deliver\nlossless compression of real datasets, where we improve compression rates up to\n40 %.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:27:42 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Taurone","Francesco",""],["Lucani","Daniel E.",""],["Feh\u00e9r","Marcell",""],["Zhang","Qi",""]]}
{"id":"2308.03624","submitter":"Tao Kong","authors":"Taozheng Yang, Ya Jing, Hongtao Wu, Jiafeng Xu, Kuankuan Sima,\n  Guangzeng Chen, Qie Sima, Tao Kong","title":"MOMA-Force: Visual-Force Imitation for Real-World Mobile Manipulation","comments":"IEEE/RSJ International Conference on Intelligent Robots and Systems\n  (IROS), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a novel method for mobile manipulators to perform\nmultiple contact-rich manipulation tasks. While learning-based methods have the\npotential to generate actions in an end-to-end manner, they often suffer from\ninsufficient action accuracy and robustness against noise. On the other hand,\nclassical control-based methods can enhance system robustness, but at the cost\nof extensive parameter tuning. To address these challenges, we present\nMOMA-Force, a visual-force imitation method that seamlessly combines\nrepresentation learning for perception, imitation learning for complex motion\ngeneration, and admittance whole-body control for system robustness and\ncontrollability. MOMA-Force enables a mobile manipulator to learn multiple\ncomplex contact-rich tasks with high success rates and small contact forces. In\na real household setting, our method outperforms baseline methods in terms of\ntask success rates. Moreover, our method achieves smaller contact forces and\nsmaller force variances compared to baseline methods without force imitation.\nOverall, we offer a promising approach for efficient and robust mobile\nmanipulation in the real world. Videos and more details can be found on\n\\url{https://visual-force-imitation.github.io}\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:31:07 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yang","Taozheng",""],["Jing","Ya",""],["Wu","Hongtao",""],["Xu","Jiafeng",""],["Sima","Kuankuan",""],["Chen","Guangzeng",""],["Sima","Qie",""],["Kong","Tao",""]]}
{"id":"2308.03625","submitter":"Lennart Dabelow","authors":"Lennart Dabelow and Ralf Eichhorn","title":"Thermodynamic nature of irreversibility in active matter","comments":"11 pages, 3 figures (+ suppl. 8 pages, 1 figure)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Active matter describes systems whose constituents convert energy from their\nsurroundings into directed motion, such as bacteria or catalytic colloids. We\nunravel a remarkable direct link between the dynamics and thermodynamics for\nsuspensions of such active particles: The thermodynamic equivalent of\nirreversibility is the swim pressure. Like in the famous fluctuation theorems\nof stochastic thermodynamics, irreversibility is defined as the log-ratio of\nthe probabilities to observe a given set of particle trajectories and their\ntime reverses. Our discovery is thus similar in spirit to what is known for\npassive systems, for which those fluctuation theorems relate the\nirreversibility to the thermodynamic entropy. It is based on numerical\nsimulations and on analytical arguments for the limits of low particle density\nand/or high activity in the paradigmatic model of active Ornstein-Uhlenbeck\nparticles.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:33:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dabelow","Lennart",""],["Eichhorn","Ralf",""]]}
{"id":"2308.03626","submitter":"Marek Chalupa","authors":"Marek Chalupa and Thomas A. Henzinger","title":"Monitoring Hyperproperties With Prefix Transducers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyperproperties are properties that relate multiple execution traces.\nPrevious work on monitoring hyperproperties focused on synchronous\nhyperproperties, usually specified in HyperLTL. When monitoring synchronous\nhyperproperties, all traces are assumed to proceed at the same speed. We\nintroduce (multi-trace) prefix transducers and show how to use them for\nmonitoring synchronous as well as, for the first time, asynchronous\nhyperproperties. Prefix transducers map multiple input traces into one or more\noutput traces, by incrementally matching prefixes of the input traces against\nexpressions similar to regular expressions. The prefixes of different traces\nwhich are consumed by a single matching step of the monitor may have different\nlengths. The deterministic and executable nature of prefix transducers makes\nthem more suitable as an intermediate formalism for runtime verification than\nlogical specifications, which tend to be highly nondeterministic, especially in\nthe case of asynchronous hyperproperties. We report on a set of experiments\nabout monitoring asynchronous version of observational determinism.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:34:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chalupa","Marek",""],["Henzinger","Thomas A.",""]]}
{"id":"2308.03627","submitter":"L.J. Zhang","authors":"L.J. Zhang","title":"Recent advances in triboelectric nanogenerators: energy harvest and\n  other applications","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":"  Triboelectric nanogenerators (TENG) with triboelectrification and\nelectrostatic induction effects have attracted wide attention in recent\ndecades, for its diversified application scenarios such as power generation,\nsensing, and so on. Undoubtedly, although still lacks standardized large-scale\nproduction, TENG has demonstrated good performance and increasingly promising\nprospects in fields such as energy harvest, healthcare, and medical monitoring.\nHere, this minireview provides a brief summary on the latest application\nprogress of TENG, which may offer insights for expanding application fields and\ndeveloping design concepts for TENG based devices.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:34:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","L. J.",""]]}
{"id":"2308.03628","submitter":"Andrew Wang","authors":"Andrew Wang, Carlota Bozal-Ginesta, Sai Govind Hari Kumar, Al\\'an\n  Aspuru-Guzik, Geoffrey A. Ozin","title":"Designing Materials Acceleration Platforms for Heterogeneous CO2\n  Photo(thermal)catalysis","comments":null,"journal-ref":null,"doi":"10.1016/j.matt.2023.03.015","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Materials acceleration platforms (MAPs) combine automation and artificial\nintelligence to accelerate the discovery of molecules and materials. They have\npotential to play a role in addressing complex societal problems such as\nclimate change. Solar chemicals and fuels generation via heterogeneous CO2\nphoto(thermal)catalysis is a relatively unexplored process that holds potential\nfor contributing towards an environmentally and economically sustainable\nfuture, and therefore a very promising application for MAP science and\nengineering. Here, we present a brief overview of how design and innovation in\nheterogeneous CO2 photo(thermal)catalysis, from materials discovery to\nengineering and scale-up, could benefit from MAPs. We discuss relevant design\nand performance descriptors and the level of automation of state-of-the-art\nexperimental techniques, and we review examples of artificial intelligence in\ndata analysis. Based on these precedents, we finally propose a MAP outline for\nautonomous and accelerated discoveries in the emerging field of solar chemicals\nand fuels sourced from CO2 photo(thermal)catalysis.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:35:36 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 03:44:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Andrew",""],["Bozal-Ginesta","Carlota",""],["Kumar","Sai Govind Hari",""],["Aspuru-Guzik","Al\u00e1n",""],["Ozin","Geoffrey A.",""]]}
{"id":"2308.03629","submitter":"Lifeng Han Dr","authors":"Haifa Alrdahi, Lifeng Han, Hendrik \\v{S}uvalov, Goran Nenadic","title":"MedMine: Examining Pre-trained Language Models on Medication Mining","comments":"Open Research Project. 7 pages, 1 figure, 5 tables","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":"  Automatic medication mining from clinical and biomedical text has become a\npopular topic due to its real impact on healthcare applications and the recent\ndevelopment of powerful language models (LMs). However, fully-automatic\nextraction models still face obstacles to be overcome such that they can be\ndeployed directly into clinical practice for better impacts. Such obstacles\ninclude their imbalanced performances on different entity types and clinical\nevents. In this work, we examine current state-of-the-art pre-trained language\nmodels (PLMs) on such tasks, via fine-tuning including the monolingual model\nMed7 and multilingual large language model (LLM) XLM-RoBERTa. We compare their\nadvantages and drawbacks using historical medication mining shared task data\nsets from n2c2-2018 challenges. We report the findings we get from these\nfine-tuning experiments such that they can facilitate future research on\naddressing them, for instance, how to combine their outputs, merge such models,\nor improve their overall accuracy by ensemble learning and data augmentation.\nMedMine is part of the M3 Initiative \\url{https://github.com/HECTA-UoM/M3}\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:36:03 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 15:38:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Alrdahi","Haifa",""],["Han","Lifeng",""],["\u0160uvalov","Hendrik",""],["Nenadic","Goran",""]]}
{"id":"2308.03630","submitter":"Sourav Roy","authors":"Sourav Roy, C. D. Santangelo","title":"Curvature screening in draped mechanical metamaterial sheet","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a framework to understand the mechanics of metamaterial sheets on\ncurved surfaces. Here we have constructed a continuum elastic theory of\nmechanical metamaterials by introducing an auxiliary, scalar gauge-like field\nthat absorbs the strain along the soft mode and projects out the stiff ones. We\npropose a general form of the elastic energy of a mechanism based metamaterial\nsheet and specialize to the cases of dilational metamaterials and shear\nmetamaterials conforming to positively and negatively curved substrates in the\nF\\\"{o}ppl-Von K\\'{a}rm\\'{a}n limit of small strains. We perform numerical\nsimulations of these systems and obtain good agreement with our analytical\npredictions. This work provides a framework that can be easily extended to\nexplore non-linear soft modes in metamaterial elasticity in future.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:36:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Roy","Sourav",""],["Santangelo","C. D.",""]]}
{"id":"2308.03631","submitter":"Md Junayed Hasan","authors":"Md Junayed Hasan, Eyad Elyan, Yijun Yan, Jinchang Ren, Md Mostafa\n  Kamal Sarker","title":"Segmentation Framework for Heat Loss Identification in Thermal Images:\n  Empowering Scottish Retrofitting and Thermographic Survey Companies","comments":"9 Pages, 3 Figures, Accepted from the conference - BICS 2023: 2023\n  International Conference on Brain-Inspired Cognitive Systems Kuala Lumpur,\n  Malaysia, August 5-6, 2023 [peer-reviewed]","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Retrofitting and thermographic survey (TS) companies in Scotland collaborate\nwith social housing providers to tackle fuel poverty. They employ ground-level\ninfrared (IR) camera-based-TSs (GIRTSs) for collecting thermal images to\nidenti-fy the heat loss sources resulting from poor insulation. However, this\nidentifica-tion process is labor-intensive and time-consuming, necessitating\nextensive data processing. To automate this, an AI-driven approach is\nnecessary. Therefore, this study proposes a deep learning (DL)-based\nsegmentation framework using the Mask Region Proposal Convolutional Neural\nNetwork (Mask RCNN) to validate its applicability to these thermal images. The\nobjective of the framework is to au-tomatically identify, and crop heat loss\nsources caused by weak insulation, while also eliminating obstructive objects\npresent in those images. By doing so, it min-imizes labor-intensive tasks and\nprovides an automated, consistent, and reliable solution. To validate the\nproposed framework, approximately 2500 thermal imag-es were collected in\ncollaboration with industrial TS partner. Then, 1800 repre-sentative images\nwere carefully selected with the assistance of experts and anno-tated to\nhighlight the target objects (TO) to form the final dataset. Subsequently, a\ntransfer learning strategy was employed to train the dataset, progressively\naug-menting the training data volume and fine-tuning the pre-trained baseline\nMask RCNN. As a result, the final fine-tuned model achieved a mean average\nprecision (mAP) score of 77.2% for segmenting the TO, demonstrating the\nsignificant po-tential of proposed framework in accurately quantifying energy\nloss in Scottish homes.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:36:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hasan","Md Junayed",""],["Elyan","Eyad",""],["Yan","Yijun",""],["Ren","Jinchang",""],["Sarker","Md Mostafa Kamal",""]]}
{"id":"2308.03632","submitter":"Francesco Bajardi","authors":"Francesco Bajardi, Daniel Blixt, Salvatore Capozziello","title":"The Gauss-Bonnet topological scalar in the Geometric Trinity of Gravity","comments":"18 pages; Accepted for publication in IJGMMP","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Gauss-Bonnet topological scalar is presented in metric-teleparallel\nformalism as well as in the symmetric and general teleparallel formulations. In\nall of the aforementioned frameworks, the full expressions are provided\nexplicitly in terms of torsion, non-metricity and Levi-Civita covariant\nderivative. The number of invariant terms of this form is counted and compared\nwith the number which can appear in the corresponding effective field theory.\nAlthough the difference in this number is not very large, it is found that the\nGauss-Bonnet invariant excludes some of the effective field theory terms. This\nresult sheds new light on how General Relativity symmetries can be maintained\nat higher order in teleparallel theories: this fact appears to be highly\nnontrivial in the teleparallel formulation. The importance of the so-called\n``pseudo-invariant'' theories like $f(T)$- and $f(T,T_\\mathcal{G})$-gravity is\nfurther discussed in the context of teleparallel Gauss-Bonnet gravity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:38:58 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:10:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bajardi","Francesco",""],["Blixt","Daniel",""],["Capozziello","Salvatore",""]]}
{"id":"2308.03633","submitter":"Gianni Bianchini","authors":"Gianni Bianchini and Andrea Garulli and Antonio Giannitrapani and\n  Mirko Leomanni and Renato Quartullo","title":"Learning-based Parameter Optimization for a Class of Orbital Tracking\n  Control Laws","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 presents a machine learning approach for tuning the parameters of\na family of stabilizing controllers for orbital tracking. An augmented random\nsearch algorithm is deployed, which aims at minimizing a cost function\ncombining convergence time and fuel consumption. The main feature of the\nproposed learning strategy is that closed-loop stability is always guaranteed\nduring the exploration of the parameter space, {a property that allows one to\nstreamline the training process by restricting the search domain to\nwell-behaved control policies.} The proposed approach is tested on two case\nstudies: an orbital transfer and a rendezvous and docking mission. It is shown\nthat in both cases the learned control parameters lead to a significant\nimprovement of the considered performance measure.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:40:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bianchini","Gianni",""],["Garulli","Andrea",""],["Giannitrapani","Antonio",""],["Leomanni","Mirko",""],["Quartullo","Renato",""]]}
{"id":"2308.03634","submitter":"Enrico Pasqualetto","authors":"Enrico Pasqualetto","title":"Projective and injective tensor products of Banach $L^0$-modules","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study projective and injective tensor products of Banach $L^0$-modules\nover a $\\sigma$-finite measure space. En route, we extend to Banach\n$L^0$-modules several technical tools of independent interest, such as quotient\noperators, summable families, and Schauder bases.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:41:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Pasqualetto","Enrico",""]]}
{"id":"2308.03635","submitter":"Dominik Kempa","authors":"Dominik Kempa and Tomasz Kociumaka","title":"Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in\n  Optimal Compressed Space","comments":"Accepted to FOCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last decades, the necessity to process massive amounts of textual data\nfueled the development of compressed text indexes: data structures efficiently\nanswering queries on a given text while occupying space proportional to the\ncompressed representation of the text. A widespread phenomenon in compressed\nindexing is that more powerful queries require larger indexes. For example,\nrandom access, the most basic query, can be supported in\n$O(\\delta\\log\\frac{n\\log\\sigma}{\\delta\\log n})$ space (where $n$ is the text\nlength, $\\sigma$ is the alphabet size, and $\\delta$ is text's substring\ncomplexity), which is the asymptotically smallest space to represent a string,\nfor all $n$, $\\sigma$, and $\\delta$ (Kociumaka, Navarro, Prezza; IEEE Trans.\nInf. Theory 2023). The other end of the hierarchy is occupied by indexes\nsupporting the powerful suffix array (SA) queries. The currently smallest one\ntakes $O(r\\log\\frac{n}{r})$ space, where $r\\geq\\delta$ is the number of runs in\nthe BWT of the text (Gagie, Navarro, Prezza; J. ACM 2020).\n  We present a new compressed index that needs only\n$O(\\delta\\log\\frac{n\\log\\sigma}{\\delta\\log n})$ space to support SA\nfunctionality in $O(\\log^{4+\\epsilon} n)$ time. This collapses the hierarchy of\ncompressed data structures into a single point: The space required to represent\nthe text is simultaneously sufficient for efficient SA queries. Our result\nimmediately improves the space complexity of dozens of algorithms, which can\nnow be executed in optimal compressed space.\n  In addition, we show how to construct our index in $O(\\delta\\text{ polylog }\nn)$ time from the LZ77 parsing of the text. For highly repetitive texts, this\nis up to exponentially faster than the previously best algorithm. To obtain our\nresults, we develop numerous techniques of independent interest, including the\nfirst $O(\\delta\\log\\frac{n\\log\\sigma}{\\delta\\log n})$-size index for LCE\nqueries.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:41:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kempa","Dominik",""],["Kociumaka","Tomasz",""]]}
{"id":"2308.03636","submitter":"Diego Amancio","authors":"Adilson Vital Jr. and Filipi N. Silva and Diego R. Amancio","title":"Comparing biased random walks in graph embedding and link prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Random walks find extensive application across various complex network\ndomains, including embedding generation and link prediction. Despite the\nwidespread utilization of random walks, the precise impact of distinct biases\non embedding generation from sequence data and their subsequent effects on link\nprediction remain elusive. In this study, we conduct a comparative analysis of\nseveral random walk strategies, each rooted in different biases: true\nself-avoidance, unbiased randomness, bias towards node degree, and inverse node\ndegree bias. Furthermore, we explore diverse adaptations of the node2vec\nalgorithm to induce distinct exploratory behaviors. Our empirical findings\ndemonstrate that despite the varied behaviors inherent in these embeddings,\nonly slight performance differences manifest in the context of link prediction.\nThis implies the resilient recovery of network structure, regardless of the\nspecific walk heuristic employed to traverse the network. Consequently, the\nresults suggest that data generated from sequences governed by unknown\nmechanisms can be successfully reconstructed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:41:28 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vital","Adilson","Jr."],["Silva","Filipi N.",""],["Amancio","Diego R.",""]]}
{"id":"2308.03637","submitter":"Gijs Schr\\\"oder","authors":"Gijs Schr\\\"oder, Inge MN Wortel, Johannes Textor","title":"Implementing Immune Repertoire Models Using Weighted Finite State\n  Machines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The adaptive immune system's T and B cells can be viewed as large populations\nof simple, diverse classifiers. Artificial immune systems (AIS)\n$\\unicode{x2013}$ algorithmic models of T or B cell repertoires\n$\\unicode{x2013}$ are used in both computational biology and natural computing\nto investigate how the immune system adapts to its changing environments.\nHowever, researchers have struggled to build such systems at scale. For\nstring-based AISs, finite state machines (FSMs) can store cell repertoires in\ncompressed representations that are orders of magnitude smaller than explicitly\nstored receptor sets. This strategy allows AISs with billions of receptors to\nbe generated in a matter of seconds. However, to date, these FSM-based AISs\nhave been unable to deal with multiplicity in input data. Here, we show how\nweighted FSMs can be used to represent cell repertoires and model immunological\nprocesses like negative and positive selection, while also taking into account\nthe multiplicity of input data. We use our method to build simple\nimmune-inspired classifier systems that solve various toy problems in anomaly\ndetection, showing how weights can be crucial for both performance and\nrobustness to parameters. Our approach can potentially be extended to increase\nthe scale of other population-based machine learning algorithms such as\nlearning classifier systems.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:42:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Schr\u00f6der","Gijs",""],["Wortel","Inge MN",""],["Textor","Johannes",""]]}
{"id":"2308.03638","submitter":"Sakharam Gawade","authors":"Ankush Agarwal, Sakharam Gawade, Amar Prakash Azad and Pushpak\n  Bhattacharyya","title":"KITLM: Domain-Specific Knowledge InTegration into Language Models for\n  Question Answering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) have demonstrated remarkable performance in a\nwide range of natural language tasks. However, as these models continue to grow\nin size, they face significant challenges in terms of computational costs.\nAdditionally, LLMs often lack efficient domain-specific understanding, which is\nparticularly crucial in specialized fields such as aviation and healthcare. To\nboost the domain-specific understanding, we propose, KITLM, a novel knowledge\nbase integration approach into language model through relevant information\ninfusion. By integrating pertinent knowledge, not only the performance of the\nlanguage model is greatly enhanced, but the model size requirement is also\nsignificantly reduced while achieving comparable performance. Our proposed\nknowledge-infused model surpasses the performance of both GPT-3.5-turbo and the\nstate-of-the-art knowledge infusion method, SKILL, achieving over 1.5 times\nimprovement in exact match scores on the MetaQA. KITLM showed a similar\nperformance boost in the aviation domain with AeroQA. The drastic performance\nimprovement of KITLM over the existing methods can be attributed to the\ninfusion of relevant knowledge while mitigating noise. In addition, we release\ntwo curated datasets to accelerate knowledge infusion research in specialized\nfields: a) AeroQA, a new benchmark dataset designed for multi-hop\nquestion-answering within the aviation domain, and b) Aviation Corpus, a\ndataset constructed from unstructured text extracted from the National\nTransportation Safety Board reports. Our research contributes to advancing the\nfield of domain-specific language understanding and showcases the potential of\nknowledge infusion techniques in improving the performance of language models\non question-answering.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:42:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Agarwal","Ankush",""],["Gawade","Sakharam",""],["Azad","Amar Prakash",""],["Bhattacharyya","Pushpak",""]]}
{"id":"2308.03639","submitter":"Graham Bruce","authors":"Donato Conteduca, Saba N. Khan, Manuel A. Mart\\'inez Ruiz, Graham D.\n  Bruce, Thomas F. Krauss and Kishan Dholakia","title":"Fano resonance-assisted all-dielectric array for enhanced near-field\n  optical trapping of nanoparticles","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Near-field optics can overcome the diffraction limit by creating strong\noptical gradients to enable the trapping of nanoparticles. However, it remains\nchallenging to achieve efficient stable trapping without heating and thermal\neffects. Dielectric structures have been used to address this issue, but they\nusually offer weak trap stiffness. In this work, we exploit the Fano resonance\neffect in an all-dielectric quadrupole nanostructure to realize a twenty-fold\nenhancement of trap stiffness, compared to the off-resonance case. This enables\na high effective trap stiffness of $1.19$ fN/nm for 100 nm diameter polystyrene\nnanoparticles with 3.5 mW/$\\mu$m$^{2}$ illumination. Furthermore, we\ndemonstrate the capability of the structure to simultaneously trap two\nparticles at distinct locations within the nanostructure array.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:46:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Conteduca","Donato",""],["Khan","Saba N.",""],["Ruiz","Manuel A. Mart\u00ednez",""],["Bruce","Graham D.",""],["Krauss","Thomas F.",""],["Dholakia","Kishan",""]]}
{"id":"2308.03640","submitter":"Anastasia Golovin","authors":"Anastasia Golovin, Jan M\\\"olter, Christian Kuehn","title":"Polyadic Opinion Formation: The Adaptive Voter Model on a Hypergraph","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The adaptive voter model is widely used to model opinion dynamics in social\ncomplex networks. However, existing adaptive voter models are limited to only\npairwise interactions and fail to capture the intricate social dynamics which\narises in groups. This paper extends the adaptive voter model to hypergraphs to\nexplore how forces of peer pressure influence collective decision-making. The\nmodel consists of two processes: individuals can either consult the group and\nchange their opinion or leave the group and join a different one. The interplay\nbetween those two processes gives rise to a two-phase dynamics. In the initial\nphase, the topology of the hypergraph quickly reaches a new stable state. In\nthe subsequent phase, opinion dynamics plays out on the new topology depending\non the mechanism by which opinions spread. If the group always follows the\nmajority, the network rapidly converges to fragmented communities. In contrast,\nif individuals choose an opinion proportionally to its representation in the\ngroup, the system remains in a metastable state for an extended period of time.\nThe results are supported both by stochastic simulations and an analytical\nmean-field description in terms of hypergraph moments with a moment closure at\nthe pair level.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:47:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Golovin","Anastasia",""],["M\u00f6lter","Jan",""],["Kuehn","Christian",""]]}
{"id":"2308.03641","submitter":"Wanying Zhang","authors":"Wanying Zhang, Yong Zhang and Jingyu Li","title":"Convergence of densities of spatial averages of the linear stochastic\n  heat equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\{u(t,x)\\}_{t>0,x\\in{{\\mathbb R}^{d}}}$ denote the solution to the\nlinear (fractional) stochastic heat equation. We establish rates of convergence\nwith respect to the uniform distance between the density of spatial averages of\nsolution and the density of the standard normal distribution in some different\nscenarios. We first consider the case that $u_0\\equiv1$, and the stochastic\nfractional heat equation is driven by a space-time white noise. When $\\alpha=2$\n(parabolic Anderson model, PAM for short) and the stochastic heat equation is\ndriven by colored noise in space, we present the rates of convergence\nrespectively in the case that $u_0\\equiv1$, $d\\geq1$ and $u_0=\\delta_0$, $d=1$\nunder an additional condition $\\hat f(\\mathbb{R}^d)<\\infty$. Our results are\nobtained by using a combination of the Malliavin calculus and Stein's method\nfor normal approximations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:47:23 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhang","Wanying",""],["Zhang","Yong",""],["Li","Jingyu",""]]}
{"id":"2308.03642","submitter":"Yan Li","authors":"Yan Li and Liping Zhang","title":"RIP-based Performance Guarantee for Low Rank Matrix Recovery via\n  $L_{*-F}$ Minimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the undetermined linear system $\\bm{b}=\\mathcal{A}(\\bm{X})+\\bm{s}$, vector\n$\\bm{b}$ and operator $\\mathcal{A}$ are the known measurements and $\\bm{s}$ is\nthe unknown noise. In this paper, we investigate sufficient conditions for\nexactly reconstructing desired matrix $\\bm{X}$ being low-rank or approximately\nlow-rank. We use the difference of nuclear norm and Frobenius norm ($L_{*-F}$)\nas a surrogate for rank function and establish a new nonconvex relaxation of\nsuch low rank matrix recovery, called the $L_{*-F}$ minimization, in order to\napproximate the rank function closer. For such nonconvex and nonsmooth\nconstrained $L_{*-F}$ minimization problems, based on whether the noise level\nis $0$, we give the upper bound estimation of the recovery error respectively.\nParticularly, in the noise-free case, one sufficient condition for exact\nrecovery is presented. If linear operator $\\mathcal{A}$ satisfies the\nrestricted isometry property with\n$\\delta_{4r}<\\frac{\\sqrt{2r}-1}{\\sqrt{2r}-1+\\sqrt{2}(\\sqrt{2r}+1)}$, then\n$r$-\\textbf{rank} matrix $\\bm{X}$ can be exactly recovered without other\nassumptions. In addition, we also take insights into the regularized $L_{*-F}$\nminimization model since such regularized model is more widely used in\nalgorithm design. We provide the recovery error estimation of this regularized\n$L_{*-F}$ minimization model via RIP tool. To our knowledge, this is the first\nresult on exact reconstruction of low rank matrix via regularized $L_{*-F}$\nminimization.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:47:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yan",""],["Zhang","Liping",""]]}
{"id":"2308.03643","submitter":"Yueheng Li","authors":"Yueheng Li, Zicheng Zhang, Hao Chen, Zhan Ma","title":"Mamba: Bringing Multi-Dimensional ABR to WebRTC","comments":"In Proceedings of the 31st ACM International Conference on\n  Multimedia, October 29-November 3, 2023, Ottawa, ON, Canada. ACM, New York,\n  NY, USA, 9 pages","journal-ref":null,"doi":"10.1145/3581783.361191","report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contemporary real-time video communication systems, such as WebRTC, use an\nadaptive bitrate (ABR) algorithm to assure high-quality and low-delay services,\ne.g., promptly adjusting video bitrate according to the instantaneous network\nbandwidth. However, target bitrate decisions in the network and bitrate control\nin the codec are typically incoordinated and simply ignoring the effect of\ninappropriate resolution and frame rate settings also leads to compromised\nresults in bitrate control, thus devastatingly deteriorating the quality of\nexperience (QoE). To tackle these challenges, Mamba, an end-to-end\nmulti-dimensional ABR algorithm is proposed, which utilizes multi-agent\nreinforcement learning (MARL) to maximize the user's QoE by adaptively and\ncollaboratively adjusting encoding factors including the quantization\nparameters (QP), resolution, and frame rate based on observed states such as\nnetwork conditions and video complexity information in a video conferencing\nsystem. We also introduce curriculum learning to improve the training\nefficiency of MARL. Both the in-lab and real-world evaluation results\ndemonstrate the remarkable efficacy of Mamba.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:47:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Yueheng",""],["Zhang","Zicheng",""],["Chen","Hao",""],["Ma","Zhan",""]]}
{"id":"2308.03644","submitter":"Anna Sterzik","authors":"Anna Sterzik, Monique Meuschke, Douglas W. Cunningham, Kai Lawonn","title":"Perceptually Uniform Construction of Illustrative Textures","comments":"11 pages, 15 figures, to be published in IEEE Transactions on\n  Visualization and Computer Graphics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Illustrative textures, such as stippling or hatching, were predominantly used\nas an alternative to conventional Phong rendering. Recently, the potential of\nencoding information on surfaces or maps using different densities has also\nbeen recognized. This has the significant advantage that additional color can\nbe used as another visual channel and the illustrative textures can then be\noverlaid. Effectively, it is thus possible to display multiple information,\nsuch as two different scalar fields on surfaces simultaneously. In previous\nwork, these textures were manually generated and the choice of density was\nunempirically determined. Here, we first want to determine and understand the\nperceptual space of illustrative textures. We chose a succession of simplices\nwith increasing dimensions as primitives for our textures: Dots, lines, and\ntriangles. Thus, we explore the texture types of stippling, hatching, and\ntriangles. We create a range of textures by sampling the density space\nuniformly. Then, we conduct three perceptual studies in which the participants\nperformed pairwise comparisons for each texture type. We use multidimensional\nscaling (MDS) to analyze the perceptual spaces per category. The perception of\nstippling and triangles seems relatively similar. Both are adequately described\nby a 1D manifold in 2D space. The perceptual space of hatching consists of two\nmain clusters: Crosshatched textures, and textures with only one hatching\ndirection. However, the perception of hatching textures with only one hatching\ndirection is similar to the perception of stippling and triangles. Based on our\nfindings, we construct perceptually uniform illustrative textures. Afterwards,\nwe provide concrete application examples for the constructed textures.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:48:23 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 14:30:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sterzik","Anna",""],["Meuschke","Monique",""],["Cunningham","Douglas W.",""],["Lawonn","Kai",""]]}
{"id":"2308.03645","submitter":"Yu-Xiao Liu","authors":"Jing-Cheng Chang, Song He, Yu-Xiao Liu and Long Zhao","title":"Island formula in Planck brane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Double holography offers a profound understanding of the island formula by\ndescribing a gravitational system on AdS$_d$ coupled to a conformal field\ntheory on $\\mathbb{R}^{1,d-1}$, dual to an AdS$_{d+1}$ spacetime with an\nend-of-the-world (EOW) brane. In this work, we extend the proposal in [A.\nAlmheiri et al. JHEP 03 (2020) 149] by considering that the dual bulk spacetime\nhas two EOW branes: one with a gravitational system and the other with a\nthermal bath. We demonstrate an equivalence between this proposal and the wedge\nholographic theory. We examine it in both Anti-de Sitter gravity and de Sitter\ngravity by calculating the entanglement entropy of the Hawking radiation.\nFinally, we employ the doubly holographic model to verify the formula for the\nentanglement entropy in a subregion within conformally flat spacetime.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:51:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chang","Jing-Cheng",""],["He","Song",""],["Liu","Yu-Xiao",""],["Zhao","Long",""]]}
{"id":"2308.03646","submitter":"Qicheng Tang","authors":"Qicheng Tang, Zixia Wei, Yin Tang, Xueda Wen, and W. Zhu","title":"Universal entanglement signatures of interface conformal field theories","comments":"7 pages main text, 30 pages supplementary materials","journal-ref":null,"doi":null,"report-no":"YITP-23-100, RIKEN-iTHEMS-Report-23","categories":"cond-mat.stat-mech hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An interface connecting two distinct conformal field theories hosts rich\ncritical behaviors. In this work, we investigate the entanglement properties of\nsuch critical interface theories for probing the underlying universality. As\ninspired by holographic perspectives, we demonstrate vital features of various\nentanglement measures regarding such interfaces based on several paradigmatic\nlattice models. Crucially, for two subsystems adjacent at the interface, the\nmutual information and the reflected entropy exhibit identical leading\nlogarithmic scaling, giving an effective interface central charge that takes\nthe same value as the smaller central charge of the two conformal field\ntheories. Our work demonstrates that the entanglement measure offers a powerful\ntool to explore the rich physics in critical interface theories.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:52:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tang","Qicheng",""],["Wei","Zixia",""],["Tang","Yin",""],["Wen","Xueda",""],["Zhu","W.",""]]}
{"id":"2308.03647","submitter":"Kateryna Buryachenko Prof.","authors":"Kateryna Buryachenko","title":"Maximum principle for the weak solutions of the Cauchy problem for the\n  fourth-order hyperbolic equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the maximum principle for the weak solutions to the Cauchy\nproblem for the hyperbolic fourth-order linear equations with constant complex\ncoefficients in the plane bounded domain\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:57:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Buryachenko","Kateryna",""]]}
{"id":"2308.03648","submitter":"Richard Nock","authors":"Richard Nock and Mathieu Guillame-Bert","title":"Generative Forests","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tabular data represents one of the most prevalent form of data. When it comes\nto data generation, many approaches would learn a density for the data\ngeneration process, but would not necessarily end up with a sampler, even less\nso being exact with respect to the underlying density. A second issue is on\nmodels: while complex modeling based on neural nets thrives in image or text\ngeneration (etc.), less is known for powerful generative models on tabular\ndata. A third problem is the visible chasm on tabular data between training\nalgorithms for supervised learning with remarkable properties (e.g. boosting),\nand a comparative lack of guarantees when it comes to data generation. In this\npaper, we tackle the three problems, introducing new tree-based generative\nmodels convenient for density modeling and tabular data generation that improve\non modeling capabilities of recent proposals, and a training algorithm which\nsimplifies the training setting of previous approaches and displays\nboosting-compliant convergence. This algorithm has the convenient property to\nrely on a supervised training scheme that can be implemented by a few tweaks to\nthe most popular induction scheme for decision tree induction with two classes.\nExperiments are provided on missing data imputation and comparing generated\ndata to real data, displaying the quality of the results obtained by our\napproach, in particular against state of the art.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:58:53 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Nock","Richard",""],["Guillame-Bert","Mathieu",""]]}
{"id":"2308.03649","submitter":"Hanul Jeon","authors":"Hanul Jeon","title":"On Separating Wholeness Axioms","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we prove that $\\mathsf{WA}_1$ implies the consistency of\n$\\mathsf{WA}_0$, and $\\mathsf{WA}_{n+2}$ implies the consistency of\n$\\mathsf{WA}_n$ for $n\\ge 0$. We also prove that $\\mathsf{ZFC+WA}_n$ is\nfinitely axiomatizable, and $\\mathsf{ZFC+WA}$ is not finitely axiomatizable.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:59:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Jeon","Hanul",""]]}
{"id":"2308.03650","submitter":"Luis Robledo","authors":"C.V. Nithish Kumar, and L. M. Robledo","title":"Hexadecapole axial collectivity in the rare earth region, a beyond mean\n  field study","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hexadecapole collectivity and its interplay with quadrupole degrees of\nfreedom is studied in an axial symmetry preserving framework based on the\nHartree Fock Bogoliubov (HFB) plus generator coordinate method (GCM). Results\nare obtained for several even-even isotopes of Sm and Gd with various\nparametrizations of the Gogny force. The analysis of the results indicates the\nstrong coupling between the quadrupole and hexadecapole degrees of freedom. The\nfirst two excited states are vibrational in character in most of the cases. The\nimpact of prolate-oblate shape mixing in the properties of hexadecapole states\nis analyzed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:02:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kumar","C. V. Nithish",""],["Robledo","L. M.",""]]}
{"id":"2308.03651","submitter":"Weikai Yang","authors":"Yuxing Zhou, Weikai Yang, Jiashu Chen, Changjian Chen, Zhiyang Shen,\n  Xiaonan Luo, Lingyun Yu, Shixia Liu","title":"Cluster-Aware Grid Layout","comments":"Accecpted in IEEE VIS 2023. 11 pages. 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Grid visualizations are widely used in many applications to visually explain\na set of data and their proximity relationships. However, existing layout\nmethods face difficulties when dealing with the inherent cluster structures\nwithin the data. To address this issue, we propose a cluster-aware grid layout\nmethod that aims to better preserve cluster structures by simultaneously\nconsidering proximity, compactness, and convexity in the optimization process.\nOur method utilizes a hybrid optimization strategy that consists of two phases.\nThe global phase aims to balance proximity and compactness within each cluster,\nwhile the local phase ensures the convexity of cluster shapes. We evaluate the\nproposed grid layout method through a series of quantitative experiments and\ntwo use cases, demonstrating its effectiveness in preserving cluster structures\nand facilitating analysis tasks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:05:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Zhou","Yuxing",""],["Yang","Weikai",""],["Chen","Jiashu",""],["Chen","Changjian",""],["Shen","Zhiyang",""],["Luo","Xiaonan",""],["Yu","Lingyun",""],["Liu","Shixia",""]]}
{"id":"2308.03652","submitter":"Ardit Ramadani","authors":"Ardit Ramadani, Peter Ewert, Heribert Schunkert, Nassir Navab","title":"WarpEM: Dynamic Time Warping for Accurate Catheter Registration in\n  EM-guided Procedures","comments":"The 26th International Conference on Medical Image Computing and\n  Computer Assisted Intervention, MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Accurate catheter tracking is crucial during minimally invasive endovascular\nprocedures (MIEP), and electromagnetic (EM) tracking is a widely used\ntechnology that serves this purpose. However, registration between preoperative\nimages and the EM tracking system is often challenging. Existing registration\nmethods typically require manual interactions, which can be time-consuming,\nincrease the risk of errors and change the procedural workflow. Although\nseveral registration methods are available for catheter tracking, such as\nmarker-based and path-based approaches, their limitations can impact the\naccuracy of the resulting tracking solution, consequently, the outcome of the\nmedical procedure.\n  This paper introduces a novel automated catheter registration method for\nEM-guided MIEP. The method utilizes 3D signal temporal analysis, such as\nDynamic Time Warping (DTW) algorithms, to improve registration accuracy and\nreliability compared to existing methods. DTW can accurately warp and match\nEM-tracked paths to the vessel's centerline, making it particularly suitable\nfor registration. The introduced registration method is evaluated for accuracy\nin a vascular phantom using a marker-based registration as the ground truth.\nThe results indicate that the DTW method yields accurate and reliable\nregistration outcomes, with a mean error of $2.22$mm. The introduced\nregistration method presents several advantages over state-of-the-art methods,\nsuch as high registration accuracy, no initialization required, and increased\nautomation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:07:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ramadani","Ardit",""],["Ewert","Peter",""],["Schunkert","Heribert",""],["Navab","Nassir",""]]}
{"id":"2308.03653","submitter":"Szilvia Pothoczki","authors":"Imre Bak\\'o, L\\'aszl\\'o Pusztai, Szilvia Pothoczki","title":"Why some simple sugars are much better soluble in water than others?","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 molecular dynamics (AIMD) simulations have been performed on\naqueous solutions of four simple sugars, {\\alpha}-D-glucose, \\b{eta}-D-glucose,\n{\\alpha}-D-mannose and {\\alpha}-D-galactose. Hydrogen bonding (HB) properties,\nsuch as the number of donor and acceptor type HB-s, and the lengths and\nstrengths of hydrogen bonds between sugar and water molecules, have been\ndetermined. Related electronic properties, such as the dipole moments of water\nmolecules and partial charges of the sugar O-atoms, have also been calculated.\n\\b{eta}-D-glucose has been found to form the highest number of hydrophilic, and\nthe smallest number of hydrophobic hydrogen bonds to neighboring water\nmolecules, whereas {\\alpha}-D-glucose appears to be the exact opposite.\n\\b{eta}-D-glucose possesses the most symmetric, while {\\alpha}-D-glucose the\nmost asymmetric hydrations shells among the four saccharides investigated here.\nThese characteristics, obtained from the AIMD calculations, appear to be\nrelated strongly to the differing solubilities of small sugars.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:08:26 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bak\u00f3","Imre",""],["Pusztai","L\u00e1szl\u00f3",""],["Pothoczki","Szilvia",""]]}
{"id":"2308.03654","submitter":"Yuhang Wang","authors":"Weijie Chen, Xinyan Wang, Yuhang Wang","title":"FFF: Fragments-Guided Flexible Fitting for Building Complete Protein\n  Structures","comments":"Published in the Proceedings of the IEEE/CVF Conference on Computer\n  Vision and Pattern Recognition (CVPR), 2023","journal-ref":"Proceedings of the IEEE/CVF Conference on Computer Vision and\n  Pattern Recognition (CVPR), 2023, pp. 19776-19785","doi":null,"report-no":null,"categories":"cs.CV cs.AI q-bio.BM q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cryo-electron microscopy (cryo-EM) is a technique for reconstructing the\n3-dimensional (3D) structure of biomolecules (especially large protein\ncomplexes and molecular assemblies). As the resolution increases to the\nnear-atomic scale, building protein structures de novo from cryo-EM maps\nbecomes possible. Recently, recognition-based de novo building methods have\nshown the potential to streamline this process. However, it cannot build a\ncomplete structure due to the low signal-to-noise ratio (SNR) problem. At the\nsame time, AlphaFold has led to a great breakthrough in predicting protein\nstructures. This has inspired us to combine fragment recognition and structure\nprediction methods to build a complete structure. In this paper, we propose a\nnew method named FFF that bridges protein structure prediction and protein\nstructure recognition with flexible fitting. First, a multi-level recognition\nnetwork is used to capture various structural features from the input 3D\ncryo-EM map. Next, protein structural fragments are generated using pseudo\npeptide vectors and a protein sequence alignment method based on these\nextracted features. Finally, a complete structural model is constructed using\nthe predicted protein fragments via flexible fitting. Based on our benchmark\ntests, FFF outperforms the baseline methods for building complete protein\nstructures.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:10:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chen","Weijie",""],["Wang","Xinyan",""],["Wang","Yuhang",""]]}
{"id":"2308.03655","submitter":"Saikat Goswami","authors":"Saikat Goswami","title":"Formal one parameter deformation of Lie-Yamaguti algebras","comments":"Suggestions and comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Infinitesimal deformation theory of Lie-Yamaguti algebras was introduced by\nTao Zhang and Juan Li . We extend their theory to develop formal one-parameter\ndeformation theory of Lie-Yamaguti algebras. It turns out that the right\ndeformation cohomology which controls deformations in this context, is a\nvariant of Lie-Yamaguti algebra cohomology. At the end, we introduce the free\nLie-Yamaguti algebra and prove that it is rigid.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:10:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Goswami","Saikat",""]]}
{"id":"2308.03656","submitter":"Jen-Tse Huang","authors":"Jen-tse Huang, Man Ho Lam, Eric John Li, Shujie Ren, Wenxuan Wang,\n  Wenxiang Jiao, Zhaopeng Tu, Michael R. Lyu","title":"Emotionally Numb or Empathetic? Evaluating How LLMs Feel Using\n  EmotionBench","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the community has witnessed the advancement of Large Language\nModels (LLMs), which have shown remarkable performance on various downstream\ntasks. Led by powerful models like ChatGPT and Claude, LLMs are revolutionizing\nhow users engage with software, assuming more than mere tools but intelligent\nassistants. Consequently, evaluating LLMs' anthropomorphic capabilities becomes\nincreasingly important in contemporary discourse. Utilizing the emotion\nappraisal theory from psychology, we propose to evaluate the empathy ability of\nLLMs, i.e., how their feelings change when presented with specific situations.\nAfter a careful and comprehensive survey, we collect a dataset containing over\n400 situations that have proven effective in eliciting the eight emotions\ncentral to our study. Categorizing the situations into 36 factors, we conduct a\nhuman evaluation involving more than 1,200 subjects worldwide. With the human\nevaluation results as references, our evaluation includes five LLMs, covering\nboth commercial and open-source models, including variations in model sizes,\nfeaturing the latest iterations, such as GPT-4 and LLaMA 2. A conclusion can be\ndrawn from the results that, despite several misalignments, LLMs can generally\nrespond appropriately to certain situations. Nevertheless, they fall short in\nalignment with the emotional behaviors of human beings and cannot establish\nconnections between similar situations. Our collected dataset of situations,\nthe human evaluation results, and the code of our testing framework, dubbed\nEmotionBench, is made publicly in https://github.com/CUHK-ARISE/EmotionBench.\nWe aspire to contribute to the advancement of LLMs regarding better alignment\nwith the emotional behaviors of human beings, thereby enhancing their utility\nand applicability as intelligent assistants.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:18:30 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Huang","Jen-tse",""],["Lam","Man Ho",""],["Li","Eric John",""],["Ren","Shujie",""],["Wang","Wenxuan",""],["Jiao","Wenxiang",""],["Tu","Zhaopeng",""],["Lyu","Michael R.",""]]}
{"id":"2308.03657","submitter":"Daye Lim","authors":"Daye Lim, Tom Van Doorsselaere, David Berghmans, Richard J. Morton,\n  Vaibhav Pant, and Sudip Mandal","title":"The Role of High-frequency Transverse Oscillations in Coronal Heating","comments":"9 pages, 3 figures","journal-ref":"The Astrophysical Journal Letters, 952, L15,2023","doi":"10.3847/2041-8213/ace423","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transverse oscillations that do not show significant damping in solar coronal\nloops are found to be ubiquitous. Recently, the discovery of high-frequency\ntransverse oscillations in small-scale loops has been accelerated by the\nExtreme Ultraviolet Imager onboard Solar Orbiter. We perform a meta-analysis by\nconsidering the oscillation parameters reported in the literature. Motivated by\nthe power law of the velocity power spectrum of propagating transverse waves\ndetected with CoMP, we consider the distribution of energy fluxes as a function\nof oscillation frequencies and the distribution of the number of oscillations\nas a function of energy fluxes and energies. These distributions are described\nas a power law. We propose that the power law slope ($\\delta=-1.40$) of energy\nfluxes depending on frequencies could be used for determining whether\nhigh-frequency oscillations dominate the total heating ($\\delta < 1$) or not\n($\\delta > 1$). In addition, we found that the oscillation number distribution\ndepending on energy fluxes has a power law slope of $\\alpha=1.00$, being less\nthan 2, which means that oscillations with high energy fluxes provide the\ndominant contribution to the total heating. It is shown that, on average,\nhigher energy fluxes are generated from higher frequency oscillations. The\ntotal energy generated by transverse oscillations ranges from about $10^{20}$\nto $10^{25}$ erg, corresponding to the energies for nanoflare\n($10^{24}-10^{27}$ erg), picoflare ($10^{21}-10^{24}$ erg), and femtoflare\n($10^{18}-10^{21}$ erg). The respective slope results imply that high-frequency\noscillations could provide the dominant contribution to total coronal heating\ngenerated by decayless transverse oscillations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:18:56 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Lim","Daye",""],["Van Doorsselaere","Tom",""],["Berghmans","David",""],["Morton","Richard J.",""],["Pant","Vaibhav",""],["Mandal","Sudip",""]]}
{"id":"2308.03658","submitter":"Xinran Fang","authors":"Xinran Fang, Wei Feng, Yunfei Chen, Ning Ge, and Gan Zheng","title":"Sensing-Communication-Computing-Control Closed Loop for Unmanned Space\n  Exploration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT cs.SY eess.SY math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With a growing interest in outer space, space robots have become a focus of\nexploration. To coordinate them for unmanned space exploration, we propose to\nuse the \"mother-daughter structure\". In this setup, the mother spacecraft\norbits the planet, while daughter probes are distributed across the surface.\nThe mother spacecraft senses the environment, computes control commands and\ndistributes them to daughter probes to take actions. They synergistically form\nsensing-communication-computing-control ($\\mathbf{SC^3}$) loops, which are\nindivisible. We thereby optimize the spacecraft-probe downlink within\n$\\mathbf{SC^3}$ loops to minimize the sum linear quadratic regulator (LQR)\ncost. The optimization variables are block length and transmit power. On\naccount of the cycle time constraint, the spacecraft-probe downlink operates in\nthe finite block length (FBL) regime. To solve the nonlinear mixed-integer\nproblem, we first identify the optimal block length and then transform the\npower allocation problem into a tractable convex one. Additionally, we derive\nthe approximate closed-form solutions for the proposed scheme and also for the\nmax-sum rate scheme and max-min rate scheme. On this basis, we reveal their\ndifferent power allocation principles. Moreover, we find that for\ntime-insensitive control tasks, the proposed scheme demonstrates equivalence to\nthe max-min rate scheme. These findings are verified through simulations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:19:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fang","Xinran",""],["Feng","Wei",""],["Chen","Yunfei",""],["Ge","Ning",""],["Zheng","Gan",""]]}
{"id":"2308.03659","submitter":"Dovydas Joksas","authors":"Adnan Mehonic and Dovydas Joksas","title":"Emerging Nonvolatile Memories for Machine Learning","comments":"28 pages, 13 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Digital computers have been getting exponentially faster for decades, but\nhuge challenges exist today. Transistor scaling, described by Moore's law, has\nbeen slowing down over the last few years, ending the era of fully predictable\nperformance improvements. Furthermore, the data-centric computing demands\nfueled by machine learning applications are rapidly growing, and current\ncomputing systems -- even with the historical rate of improvements driven by\nMoore's law -- cannot keep up with these enormous computational demands. Some\nare turning to analogue in-memory computing as a solution, where specialised\nsystems operating on physical principles accelerate specific tasks. We explore\nhow emerging nonvolatile memories can be used to implement such systems\ntailored for machine learning. In particular, we discuss how memristive\ncrossbar arrays can accelerate key linear algebra operations used in neural\nnetworks, what technological challenges remain, and how they can be overcome.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:20:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mehonic","Adnan",""],["Joksas","Dovydas",""]]}
{"id":"2308.03660","submitter":"Andreas Mueller","authors":"Marcel Moravek, Alexander Zender, Andreas M\\\"uller","title":"Detecting Spells in Fantasy Literature with a Transformer Based\n  Artificial Intelligence","comments":"18 pages, 11 figures, 13 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Transformer architectures and models have made significant progress in\nlanguage-based tasks. In this area, is BERT one of the most widely used and\nfreely available transformer architecture. In our work, we use BERT for\ncontext-based phrase recognition of magic spells in the Harry Potter novel\nseries. Spells are a common part of active magic in fantasy novels. Typically,\nspells are used in a specific context to achieve a supernatural effect. A\nseries of investigations were conducted to see if a Transformer architecture\ncould recognize such phrases based on their context in the Harry Potter saga.\nFor our studies a pre-trained BERT model was used and fine-tuned utilising\ndifferent datasets and training methods to identify the searched context. By\nconsidering different approaches for sequence classification as well as token\nclassification, it is shown that the context of spells can be recognised.\nAccording to our investigations, the examined sequence length for fine-tuning\nand validation of the model plays a significant role in context recognition.\nBased on this, we have investigated whether spells have overarching properties\nthat allow a transfer of the neural network models to other fantasy universes\nas well. The application of our model showed promising results and is worth to\nbe deepened in subsequent studies.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:20:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moravek","Marcel",""],["Zender","Alexander",""],["M\u00fcller","Andreas",""]]}
{"id":"2308.03661","submitter":"Allen Liu","authors":"Jonathan A. Kelner, Jerry Li, Allen Liu, Aaron Sidford, Kevin Tian","title":"Matrix Completion in Almost-Verification Time","comments":"FOCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS math.OC math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a new framework for solving the fundamental problem of low-rank\nmatrix completion, i.e., approximating a rank-$r$ matrix $\\mathbf{M} \\in\n\\mathbb{R}^{m \\times n}$ (where $m \\ge n$) from random observations. First, we\nprovide an algorithm which completes $\\mathbf{M}$ on $99\\%$ of rows and columns\nunder no further assumptions on $\\mathbf{M}$ from $\\approx mr$ samples and\nusing $\\approx mr^2$ time. Then, assuming the row and column spans of\n$\\mathbf{M}$ satisfy additional regularity properties, we show how to boost\nthis partial completion guarantee to a full matrix completion algorithm by\naggregating solutions to regression problems involving the observations.\n  In the well-studied setting where $\\mathbf{M}$ has incoherent row and column\nspans, our algorithms complete $\\mathbf{M}$ to high precision from\n$mr^{2+o(1)}$ observations in $mr^{3 + o(1)}$ time (omitting logarithmic\nfactors in problem parameters), improving upon the prior state-of-the-art\n[JN15] which used $\\approx mr^5$ samples and $\\approx mr^7$ time. Under an\nassumption on the row and column spans of $\\mathbf{M}$ we introduce (which is\nsatisfied by random subspaces with high probability), our sample complexity\nimproves to an almost information-theoretically optimal $mr^{1 + o(1)}$, and\nour runtime improves to $mr^{2 + o(1)}$. Our runtimes have the appealing\nproperty of matching the best known runtime to verify that a rank-$r$\ndecomposition $\\mathbf{U}\\mathbf{V}^\\top$ agrees with the sampled observations.\nWe also provide robust variants of our algorithms that, given random\nobservations from $\\mathbf{M} + \\mathbf{N}$ with $\\|\\mathbf{N}\\|_{F} \\le\n\\Delta$, complete $\\mathbf{M}$ to Frobenius norm distance $\\approx\nr^{1.5}\\Delta$ in the same runtimes as the noiseless setting. Prior noisy\nmatrix completion algorithms [CP10] only guaranteed a distance of $\\approx\n\\sqrt{n}\\Delta$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:24:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kelner","Jonathan A.",""],["Li","Jerry",""],["Liu","Allen",""],["Sidford","Aaron",""],["Tian","Kevin",""]]}
{"id":"2308.03662","submitter":"Francesco Romor","authors":"Guglielmo Padula, Francesco Romor, Giovanni Stabile, Gianluigi Rozza","title":"Generative Models for the Deformation of Industrial Shapes with Linear\n  Geometric Constraints: model order and parameter space reductions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Real-world applications of computational fluid dynamics often involve the\nevaluation of quantities of interest for several distinct geometries that\ndefine the computational domain or are embedded inside it. For example, design\noptimization studies require the realization of response surfaces from the\nparameters that determine the geometrical deformations to relevant outputs to\nbe optimized. In this context, a crucial aspect to be addressed are the limited\nresources at disposal to computationally generate different geometries or to\nphysically obtain them from direct measurements. This is the case for\npatient-specific biomedical applications for example. When additional linear\ngeometrical constraints need to be imposed, the computational costs increase\nsubstantially. Such constraints include total volume conservation, barycenter\nlocation and fixed moments of inertia. We develop a new paradigm that employs\ngenerative models from machine learning to efficiently sample new geometries\nwith linear constraints. A consequence of our approach is the reduction of the\nparameter space from the original geometrical parametrization to a\nlow-dimensional latent space of the generative models. Crucial is the\nassessment of the quality of the distribution of the constrained geometries\nobtained with respect to physical and geometrical quantities of interest.\nNon-intrusive model order reduction is enhanced since smaller parametric spaces\nare considered. We test our methodology on two academic test cases: a mixed\nPoisson problem on the 3d Stanford bunny with fixed barycenter deformations and\nthe multiphase turbulent incompressible Navier-Stokes equations for the\nDuisburg test case with fixed volume deformations of the naval hull.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:25:08 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Padula","Guglielmo",""],["Romor","Francesco",""],["Stabile","Giovanni",""],["Rozza","Gianluigi",""]]}
{"id":"2308.03663","submitter":"Edward Witten","authors":"Edward Witten","title":"A Background Independent Algebra in Quantum Gravity","comments":"37 pp","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose an algebra of operators along an observer's worldline as a\nbackground-independent algebra in quantum gravity. In that context, it is\nnatural to think of the Hartle-Hawking no boundary state as a universal state\nof maximum entropy, and to define entropy in terms of the relative entropy with\nthis state. In the case that the only spacetimes considered correspond to de\nSitter vacua with different values of the cosmological constant, this\ndefinition leads to sensible results.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:26:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Witten","Edward",""]]}
{"id":"2308.03664","submitter":"Sungho Suh","authors":"Dhruv Mittal, Hymalai Bello, Bo Zhou, Mayank Shekhar Jha, Sungho Suh,\n  Paul Lukowicz","title":"Two-stage Early Prediction Framework of Remaining Useful Life for\n  Lithium-ion Batteries","comments":"Accepted at the 49th Annual Conference of the IEEE Industrial\n  Electronics Society (IECON 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Early prediction of remaining useful life (RUL) is crucial for effective\nbattery management across various industries, ranging from household appliances\nto large-scale applications. Accurate RUL prediction improves the reliability\nand maintainability of battery technology. However, existing methods have\nlimitations, including assumptions of data from the same sensors or\ndistribution, foreknowledge of the end of life (EOL), and neglect to determine\nthe first prediction cycle (FPC) to identify the start of the unhealthy stage.\nThis paper proposes a novel method for RUL prediction of Lithium-ion batteries.\nThe proposed framework comprises two stages: determining the FPC using a neural\nnetwork-based model to divide the degradation data into distinct health states\nand predicting the degradation pattern after the FPC to estimate the remaining\nuseful life as a percentage. Experimental results demonstrate that the proposed\nmethod outperforms conventional approaches in terms of RUL prediction.\nFurthermore, the proposed method shows promise for real-world scenarios,\nproviding improved accuracy and applicability for battery management.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:28:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mittal","Dhruv",""],["Bello","Hymalai",""],["Zhou","Bo",""],["Jha","Mayank Shekhar",""],["Suh","Sungho",""],["Lukowicz","Paul",""]]}
{"id":"2308.03665","submitter":"Felix Chalumeau","authors":"Felix Chalumeau, Bryan Lim, Raphael Boige, Maxime Allard, Luca\n  Grillotti, Manon Flageat, Valentin Mac\\'e, Arthur Flajolet, Thomas Pierrot,\n  Antoine Cully","title":"QDax: A Library for Quality-Diversity and Population-based Algorithms\n  with Hardware Acceleration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  QDax is an open-source library with a streamlined and modular API for\nQuality-Diversity (QD) optimization algorithms in Jax. The library serves as a\nversatile tool for optimization purposes, ranging from black-box optimization\nto continuous control. QDax offers implementations of popular QD,\nNeuroevolution, and Reinforcement Learning (RL) algorithms, supported by\nvarious examples. All the implementations can be just-in-time compiled with\nJax, facilitating efficient execution across multiple accelerators, including\nGPUs and TPUs. These implementations effectively demonstrate the framework's\nflexibility and user-friendliness, easing experimentation for research\npurposes. Furthermore, the library is thoroughly documented and tested with\n95\\% coverage.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:29:44 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chalumeau","Felix",""],["Lim","Bryan",""],["Boige","Raphael",""],["Allard","Maxime",""],["Grillotti","Luca",""],["Flageat","Manon",""],["Mac\u00e9","Valentin",""],["Flajolet","Arthur",""],["Pierrot","Thomas",""],["Cully","Antoine",""]]}
{"id":"2308.03666","submitter":"Shide Du","authors":"Shide Du, Zihan Fang, Shiyang Lan, Yanchao Tan, Manuel G\\\"unther,\n  Shiping Wang, Wenzhong Guo","title":"Bridging Trustworthiness and Open-World Learning: An Exploratory Neural\n  Approach for Enhancing Interpretability, Generalization, and Robustness","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":"  As researchers strive to narrow the gap between machine intelligence and\nhuman through the development of artificial intelligence technologies, it is\nimperative that we recognize the critical importance of trustworthiness in\nopen-world, which has become ubiquitous in all aspects of daily life for\neveryone. However, several challenges may create a crisis of trust in current\nartificial intelligence systems that need to be bridged: 1) Insufficient\nexplanation of predictive results; 2) Inadequate generalization for learning\nmodels; 3) Poor adaptability to uncertain environments. Consequently, we\nexplore a neural program to bridge trustworthiness and open-world learning,\nextending from single-modal to multi-modal scenarios for readers. 1) To enhance\ndesign-level interpretability, we first customize trustworthy networks with\nspecific physical meanings; 2) We then design environmental well-being\ntask-interfaces via flexible learning regularizers for improving the\ngeneralization of trustworthy learning; 3) We propose to increase the\nrobustness of trustworthy learning by integrating open-world recognition losses\nwith agent mechanisms. Eventually, we enhance various trustworthy properties\nthrough the establishment of design-level explainability, environmental\nwell-being task-interfaces and open-world recognition programs. These designed\nopen-world protocols are applicable across a wide range of surroundings, under\nopen-world multimedia recognition scenarios with significant performance\nimprovements observed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:35:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Du","Shide",""],["Fang","Zihan",""],["Lan","Shiyang",""],["Tan","Yanchao",""],["G\u00fcnther","Manuel",""],["Wang","Shiping",""],["Guo","Wenzhong",""]]}
{"id":"2308.03667","submitter":"Roland Speicher","authors":"Johannes Hoffmann, Tobias Mai and Roland Speicher","title":"Computing the noncommutative inner rank by means of operator-valued free\n  probability theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the noncommutative version of the Edmonds' problem, which asks to\ndetermine the inner rank of a matrix in noncommuting variables. We provide an\nalgorithm for the calculation of this inner rank by relating the problem with\nthe distribution of a basic object in free probability theory, namely\noperator-valued semicircular elements. We have to solve a matrix-valued\nquadratic equation, for which we provide precise analytical and numerical\ncontrol on the fixed point algorithm for solving the equation. Numerical\nexamples show the efficiency of the algorithm.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:37:10 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hoffmann","Johannes",""],["Mai","Tobias",""],["Speicher","Roland",""]]}
{"id":"2308.03668","submitter":"Kazushi Aoyama","authors":"Kazushi Aoyama","title":"Half-quantum flux in spin-triplet superconducting rings with bias\n  current","comments":"5 pages, 2 figures + supplemental material","journal-ref":"Phys. Rev. B 108, L060502 (2023)","doi":"10.1103/PhysRevB.108.L060502","report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Effects of a bias electric current have been theoretically investigated in a\nspin-triplet superconducting ring in a magnetic field. Based on the\nGinzburg-Landau theory, we show that the bias current can stabilize a\nhalf-quantum-flux (HQF) state via couplings to the Zeeman field and the\ndipole-type spin-orbit interaction, the latter becoming active when the field\nis tilted from the ring axis. The emergence of the HQF state is reflected as a\nfield-induced half-quantum-shift in the Little-Parks (LP) oscillation in the\ncritical current. Possible relevance to recent LP experiments is also\ndiscussed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:37:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Aoyama","Kazushi",""]]}
{"id":"2308.03669","submitter":"Tatsuhiro Shimizu","authors":"Tatsuhiro Shimizu","title":"Diffusion Model in Causal Inference with Unmeasured Confounders","comments":"6 pages, 7 figures","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 study how to extend the use of the diffusion model to answer the causal\nquestion from the observational data under the existence of unmeasured\nconfounders. In Pearl's framework of using a Directed Acyclic Graph (DAG) to\ncapture the causal intervention, a Diffusion-based Causal Model (DCM) was\nproposed incorporating the diffusion model to answer the causal questions more\naccurately, assuming that all of the confounders are observed. However,\nunmeasured confounders in practice exist, which hinders DCM from being\napplicable. To alleviate this limitation of DCM, we propose an extended model\ncalled Backdoor Criterion based DCM (BDCM), whose idea is rooted in the\nBackdoor criterion to find the variables in DAG to be included in the decoding\nprocess of the diffusion model so that we can extend DCM to the case with\nunmeasured confounders. Synthetic data experiment demonstrates that our\nproposed model captures the counterfactual distribution more precisely than DCM\nunder the unmeasured confounders.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:40:34 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 05:17:09 GMT"},{"version":"v3","created":"Tue, 15 Aug 2023 04:21:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shimizu","Tatsuhiro",""]]}
{"id":"2308.03670","submitter":"Bobby Azad","authors":"Babak Azad, Ahmed Abdalla, Kwanghee Won, Ali Mirzakhani Nafchi","title":"Improving FHB Screening in Wheat Breeding Using an Efficient Transformer\n  Model","comments":"10 pages, 5 figures, 1 table. Presented at the 2023 ASABE Annual\n  International Meeting conference in Omaha, Nebraska. Also available at\n  https://elibrary.asabe.org/abstract.asp?aid=54149","journal-ref":"In 2023 ASABE Annual International Meeting (p. 1). American\n  Society of Agricultural and Biological Engineers","doi":"10.13031/aim.202300569","report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Fusarium head blight is a devastating disease that causes significant\neconomic losses annually on small grains. Efficiency, accuracy, and timely\ndetection of FHB in the resistance screening are critical for wheat and barley\nbreeding programs. In recent years, various image processing techniques have\nbeen developed using supervised machine learning algorithms for the early\ndetection of FHB. The state-of-the-art convolutional neural network-based\nmethods, such as U-Net, employ a series of encoding blocks to create a local\nrepresentation and a series of decoding blocks to capture the semantic\nrelations. However, these methods are not often capable of long-range modeling\ndependencies inside the input data, and their ability to model multi-scale\nobjects with significant variations in texture and shape is limited. Vision\ntransformers as alternative architectures with innate global self-attention\nmechanisms for sequence-to-sequence prediction, due to insufficient low-level\ndetails, may also limit localization capabilities. To overcome these\nlimitations, a new Context Bridge is proposed to integrate the local\nrepresentation capability of the U-Net network in the transformer model. In\naddition, the standard attention mechanism of the original transformer is\nreplaced with Efficient Self-attention, which is less complicated than other\nstate-of-the-art methods. To train the proposed network, 12,000 wheat images\nfrom an FHB-inoculated wheat field at the SDSU research farm in Volga, SD, were\ncaptured. In addition to healthy and unhealthy plants, these images encompass\nvarious stages of the disease. A team of expert pathologists annotated the\nimages for training and evaluating the developed model. As a result, the\neffectiveness of the transformer-based method for FHB-disease detection,\nthrough extensive experiments across typical tasks for plant image\nsegmentation, is demonstrated.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:44:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Azad","Babak",""],["Abdalla","Ahmed",""],["Won","Kwanghee",""],["Nafchi","Ali Mirzakhani",""]]}
{"id":"2308.03671","submitter":"Michael F\\\"arber","authors":"Michael F\\\"arber, David Lamprecht, Johan Krause, Linn Aung, Peter\n  Haase","title":"SemOpenAlex: The Scientific Landscape in 26 Billion RDF Triples","comments":"accepted at ISWC'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present SemOpenAlex, an extensive RDF knowledge graph that contains over\n26 billion triples about scientific publications and their associated entities,\nsuch as authors, institutions, journals, and concepts. SemOpenAlex is licensed\nunder CC0, providing free and open access to the data. We offer the data\nthrough multiple channels, including RDF dump files, a SPARQL endpoint, and as\na data source in the Linked Open Data cloud, complete with resolvable URIs and\nlinks to other data sources. Moreover, we provide embeddings for knowledge\ngraph entities using high-performance computing. SemOpenAlex enables a broad\nrange of use-case scenarios, such as exploratory semantic search via our\nwebsite, large-scale scientific impact quantification, and other forms of\nscholarly big data analytics within and across scientific disciplines.\nAdditionally, it enables academic recommender systems, such as recommending\ncollaborators, publications, and venues, including explainability capabilities.\nFinally, SemOpenAlex can serve for RDF query optimization benchmarks, creating\nscholarly knowledge-guided language models, and as a hub for semantic\nscientific publishing.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:46:39 GMT"}],"update_date":"2023-08-08","authors_parsed":[["F\u00e4rber","Michael",""],["Lamprecht","David",""],["Krause","Johan",""],["Aung","Linn",""],["Haase","Peter",""]]}
{"id":"2308.03672","submitter":"Florian Wetzels","authors":"Florian Wetzels, Mathieu Pont, Julien Tierny, Christoph Garth","title":"Merge Tree Geodesics and Barycenters with Path Mappings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Comparative visualization of scalar fields is often facilitated using\nsimilarity measures such as edit distances. In this paper, we describe a novel\napproach for similarity analysis of scalar fields that combines two recently\nintroduced techniques: Wasserstein geodesics/barycenters as well as path\nmappings, a branch decomposition-independent edit distance. Effectively, we are\nable to leverage the reduced susceptibility of path mappings to small\nperturbations in the data when compared with the original Wasserstein distance.\nOur approach therefore exhibits superior performance and quality in typical\ntasks such as ensemble summarization, ensemble clustering, and temporal\nreduction of time series, while retaining practically feasible runtimes. Beyond\nstudying theoretical properties of our approach and discussing implementation\naspects, we describe a number of case studies that provide empirical insights\ninto its utility for comparative visualization, and demonstrate the advantages\nof our method in both synthetic and real-world scenarios. We supply a C++\nimplementation that can be used to reproduce our results.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:47:15 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Wetzels","Florian",""],["Pont","Mathieu",""],["Tierny","Julien",""],["Garth","Christoph",""]]}
{"id":"2308.03673","submitter":"Amartya Saha","authors":"Amartya Saha","title":"$w_{1+\\infty}$ and Carrollian Holography","comments":"The correct justification for the anti-holomorphic truncation of the\n  Carrollian field $S^+_2$ is added after eqn. (3.6). Reference added","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a $1+2$D Carrollian conformal field theory, the Ward identities of the two\nlocal fields $S^+_0$ and $S^+_1$, entirely built out of the Carrollian\nconformal stress-tensor, contain respectively up to the leading and the\nsubleading positive helicity soft graviton theorems in the $1+3$D\nasymptotically flat space-time. This work investigates how the subsubleading\nsoft graviton theorem can be encoded into the Ward identity of a Carrollian\nconformal field $S^+_2$. The operator product expansion (OPE) $S^+_2S^+_2$ is\nconstructed using general Carrollian conformal symmetry principles and the OPE\ncommutativity property, under the assumption that any time-independent,\nnon-Identity field that is mutually local with $S^+_0,S^+_1,S^+_2$ has positive\nCarrollian scaling dimension. It is found that, for this OPE to be consistent,\nanother local field $S^+_3$ must automatically exist in the theory. The\npresence of an infinite tower of local fields $S^+_{k\\geq3}$ is then revealed\niteratively as a consistency condition for the $S^+_2S^+_{k-1}$ OPE. The\ngeneral $S^+_kS^+_l$ OPE is similarly obtained and the symmetry algebra\nmanifest in this OPE is found to be the Kac-Moody algebra of the wedge\nsub-algebra of $w_{1+\\infty}$. The Carrollian time-coordinate plays the central\nrole in this purely holographic construction. The 2D Celestial conformally soft\ngraviton primary $H^k(z,\\bar{z})$ is realized to be contained in the Carrollian\nconformal primary $S_{1-k}^+(t,z,\\bar{z})$. Finally, the existence of the\ninfinite tower of fields $S^+_{k}$ is shown to be directly related to an\ninfinity of positive helicity soft graviton theorems.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:47:18 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 05:37:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Saha","Amartya",""]]}
{"id":"2308.03674","submitter":"Pablo Martinez Reviriego","authors":"Pablo Martinez-Reviriego, Daniel Esperante, Alexej Grudiev, Benito\n  Gimeno, C\\'esar Blanch, Daniel Gonz\\'alez-Iglesias, Nuria Fuster-Mart\\'inez,\n  Pablo Mart\\'in-Luna, Eduardo Mart\\'inez, Abraham Menendez and Juan Fuster","title":"Dielectric Assist Accelerating Structures for Compact Linear\n  Accelerators of Low Energy Particles in Hadrontherapy Treatments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.app-ph physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dielectric Assist Accelerating (DAA) structures based on ultralow-loss\nceramic are being studied as an alternative to conventional disk-loaded copper\ncavities. This accelerating structure consists of dielectric disks with irises\narranged periodically in metallic structures working under the TM$_{02}$-$\\pi$\nmode. In this paper, the numerical design of an S-band DAA structure for low\nbeta particles, such as protons or carbon ions used for Hadrontherapy\ntreatments, is shown. Four dielectric materials with different permittivity and\nloss tangent are studied as well as different particle velocities. Through\noptimization, a design that concentrates most of the RF power in the vacuum\nspace near the beam axis is obtained, leading to a significant reduction of\npower loss on the metallic walls. This allows to fabricate cavities with an\nextremely high quality factor, over 100 000, and shunt impedance over 300\nM$\\Omega$/m at room temperature. During the numerical study, the design\noptimization has been improved by adjusting some of the cell parameters in\norder to both increase the shunt impedance and reduce the peak electric field\nin certain locations of the cavity, which can lead to instabilities in its\nnormal functioning.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:49:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Martinez-Reviriego","Pablo",""],["Esperante","Daniel",""],["Grudiev","Alexej",""],["Gimeno","Benito",""],["Blanch","C\u00e9sar",""],["Gonz\u00e1lez-Iglesias","Daniel",""],["Fuster-Mart\u00ednez","Nuria",""],["Mart\u00edn-Luna","Pablo",""],["Mart\u00ednez","Eduardo",""],["Menendez","Abraham",""],["Fuster","Juan",""]]}
{"id":"2308.03675","submitter":"Debadrito Roy","authors":"Debadrito Roy, Sudhir Ranjan Jain","title":"Quantum thermodynamic cycles in the forward and time-reversed regimes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A quantum engine with n qubits performing thermodynamic cycles with two\nthermal reservoirs is presented. While such constructions have been aplenty,\nhere we show the existence of what we term as \"limit cycle\" at a purely quantum\nlevel of description owing to the properties of superoperators governing the\nevolution of states. It is shown that the limit cycle is the same under forward\nand reverse protocol of cycle operations. This limit cycle becomes the basis of\nthe quantum engine. One dimensional Ising model has been used to illustrate\nthese ideas.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:50:29 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Roy","Debadrito",""],["Jain","Sudhir Ranjan",""]]}
{"id":"2308.03676","submitter":"Mohammad Amin Saeidi","authors":"Mohammad Amin Saeidi, Haider Shoaib, Hina Tabassum","title":"A Tractable Handoff-aware Rate Outage Approximation with Applications to\n  THz-enabled Vehicular Network Optimization","comments":"This paper has been accepted in the IEEE Global Communications\n  (GLOBECOM) 2023 conference","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":"  In this paper, we first develop a tractable mathematical model of the handoff\n(HO)-aware rate outage experienced by a typical connected and autonomous\nvehicle (CAV) in a given THz vehicular network. The derived model captures the\nimpact of line-of-sight (LOS) Nakagami-m fading channels, interference, and\nmolecular absorption effects. We first derive the statistics of the\ninterference-plus-molecular absorption noise ratio and demonstrate that it can\nbe approximated by Gamma distribution using Welch-Satterthwaite approximation.\nThen, we show that the distribution of signal-to-interference-plus-molecular\nabsorption noise ratio (SINR) follows a generalized Beta prime distribution.\nBased on this, a closed-form HO-aware rate outage expression is derived.\nFinally, we formulate and solve a CAVs' traffic flow maximization problem to\noptimize the base-stations (BSs) density and speed of CAVs with collision\navoidance, rate outage, and CAVs' minimum traffic flow constraint. The CAVs'\ntraffic flow is modeled using Log-Normal distribution. Our numerical results\nvalidate the accuracy of the derived expressions using Monte-Carlo simulations\nand discuss useful insights related to optimal BS density and CAVs' speed as a\nfunction of crash intensity level, THz molecular absorption effects, minimum\nroad-traffic flow and rate requirements, and maximum speed and rate outage\nlimits.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:50:40 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:45:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Saeidi","Mohammad Amin",""],["Shoaib","Haider",""],["Tabassum","Hina",""]]}
{"id":"2308.03677","submitter":"Katrin Tent","authors":"Anna-Maria Ammer and Katrin Tent","title":"On the model theory of open generalized polygons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that for any $n\\geq 3$ the theory of open generalized $n$-gons is\ncomplete, decidable and strictly stable, yielding a new class of examples in\nthe zoo of stable theories.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:52:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ammer","Anna-Maria",""],["Tent","Katrin",""]]}
{"id":"2308.03678","submitter":"Igor Sfiligoi","authors":"Igor Sfiligoi, David Schultz, Benedikt Riedel and Frank W\\\"urthwein","title":"Evaluation of ARM CPUs for IceCube available through Google Kubernetes\n  Engine","comments":"5 pages,3 tables, Submitted to proceedings of CHEP23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PF astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The IceCube experiment has substantial simulation needs and is in continuous\nsearch for the most cost-effective ways to satisfy them. The most CPU-intensive\npart relies on CORSIKA, a cosmic ray air shower simulation. Historically,\nIceCube relied exclusively on x86-based CPUs, like Intel Xeon and AMD EPYC, but\nrecently server-class ARM-based CPUs are also becoming available, both on-prem\nand in the cloud. In this paper we present our experience in running a sample\nCORSIKA simulation on both ARM and x86 CPUs available through Google Kubernetes\nEngine (GKE). We used the production binaries for the x86 instances, but had to\nbuild the binaries for ARM instances from source code, which turned out to be\nmostly painless. Our benchmarks show that ARM-based CPUs in GKE were not only\nthe most cost-effective but were also the fastest in absolute terms in all the\ntested configurations. While the advantage is not drastic, about 20% in\ncost-effectiveness and less than 10% in absolute terms, it is still large\nenough to warrant an investment in ARM support for IceCube.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:52:00 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sfiligoi","Igor",""],["Schultz","David",""],["Riedel","Benedikt",""],["W\u00fcrthwein","Frank",""]]}
{"id":"2308.03679","submitter":"EPTCS","authors":"Michael Moortgat (Utrecht University), Mehrnoosh Sadrzadeh (UCL)","title":"Proceedings Modalities in substructural logics: Applications at the\n  interfaces of logic, language and computation","comments":null,"journal-ref":"EPTCS 381, 2023","doi":"10.4204/EPTCS.381","report-no":null,"categories":"cs.LO cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By calling into question the implicit structural rules that are taken for\ngranted in classical logic, substructural logics have brought to the fore new\nforms of reasoning with applications in many interdisciplinary areas of\ninterest. Modalities, in the substructural setting, provide the tools to\ncontrol and finetune the logical resource management. The focus of the workshop\nis on applications in the areas of interest to the ESSLLI community, in\nparticular logical approaches to natural language syntax and semantics and the\ndynamics of reasoning. The workshop is held with the support of the Horizon\n2020 MSCA-Rise project MOSAIC .\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:40:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Moortgat","Michael","","Utrecht University"],["Sadrzadeh","Mehrnoosh","","UCL"]]}
{"id":"2308.03680","submitter":"Gustavo Gil da Silveira","authors":"G. Gil da Silveira, M. S. Mateus Jr","title":"Investigation of spin-dependent dark matter in mono-photon production at\n  high-energy colliders","comments":"30 pages, 14 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Many theories about dark matter have emerged due to its strong theoretical\nappeal in explaining astrophysical phenomena. However, experimental and\ntheoretical particle physics have yet not provided evidence that dark matter is\npart of the observable Universe. Our work aims to investigate the interaction\nbetween Standard Model (SM) fermions and different species of dark matter (DM)\nparticles in high-energy collisions through interaction of a new massive vector\nmediator, Z'. The production of scalar and fermion DM pairs via fermion\nannihilation into the new vector boson is investigated near a resonance, where\na SM signal from hard photon emission is considered as initial state radiation,\nnamely a mono-photon production. Values of coupling constants between the DM\nand the SM particles are mapped in contrast to the Planck satellite data for\nthermal relic density DM computed in the correct framework for the relic\ndensity near a resonance, where a weaker suppression of the relic density is\nexpected. We show for the CLIC and LHC kinematic regimes that certain mass\nranges and coupling constants of these DM particles are in agreement with the\nexpected relic density near a resonance and are not excluded by collider and\nastrophysical limits.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:56:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["da Silveira","G. Gil",""],["Mateus","M. S.","Jr"]]}
{"id":"2308.03681","submitter":"Vera Uzunova A.","authors":"Vera Uzunova and Krzysztof Byczuk","title":"Analytic density of states of two-dimensional Chern insulator","comments":"12 pages, 17 figures","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":"  We present analytic expressions for the density of states and its consistent\nderivation for the two-dimensional Qi-Wu-Zhang (QWZ) Hamiltonian, a generic\nmodel for the Chern topological insulators of class A. This density of states\nis expressed in terms of elliptical integrals. We discuss and plot special\ncases of the dispersion relations and the corresponding densities of states.\nSpectral moments are also presented. The exact formulae ought to be useful in\ndetermining physical properties of the non-interacting Chern insulators and\nwithin the dynamical mean-field theory for interacting fermions with the QWZ\nHamiltonian in the non-interacting limit.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:56:20 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Uzunova","Vera",""],["Byczuk","Krzysztof",""]]}
{"id":"2308.03682","submitter":"David G. Grier","authors":"Mia C. Morrell and David G. Grier","title":"Acoustodynamic mass determination: Accounting for inertial effects in\n  acoustic levitation of granular materials","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Acoustic traps use forces exerted by sound waves to confine and transport\nsmall objects. The dynamics of an object moving in the force landscape of an\nacoustic trap can be significantly influenced by the inertia of the surrounding\nfluid medium. These inertial effects can be observed by setting a trapped\nobject in oscillation and tracking it as it relaxes back to mechanical\nequilibrium in its trap. Large deviations from Stokesian dynamics during this\nprocess can be explained quantitatively by accounting for boundary-layer\neffects in the fluid. The measured oscillations of a perturbed particle then\ncan be used not only to calibrate the trap but also to characterize the\nparticle.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:56:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Morrell","Mia C.",""],["Grier","David G.",""]]}
{"id":"2308.03683","submitter":"Joao A. Silva","authors":"Giulia Fardelli, Tobias Hansen, Joao A. Silva","title":"AdS Virasoro-Shapiro amplitude with KK modes","comments":"28 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We determine the first curvature correction for the string amplitude of two\nsupergravity states and two Kaluza-Klein modes on $\\text{AdS}_5 \\times\n\\text{S}^5$, which is dual to the correlator $\\langle \\mathcal{O}_2\n\\mathcal{O}_2 \\mathcal{O}_p \\mathcal{O}_p \\rangle$ of half-BPS operators in\n$\\mathcal{N}=4$ SYM theory. The result has the form of an integral over the\nRiemann sphere as for the usual Virasoro-Shapiro amplitude, with the insertion\nof single-valued multiple polylogarithms of weight three. The result fixes OPE\ndata of single-trace operators in $\\mathcal{N}=4$ SYM theory at strong\ncoupling, including operators with non-zero $R$-charge and odd spin. We\nsuccessfully check our results by comparing to data available from\nintegrability, localisation and consistency with a $10d$ effective action.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:56:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fardelli","Giulia",""],["Hansen","Tobias",""],["Silva","Joao A.",""]]}
{"id":"2308.03684","submitter":"Dongyuan Shi","authors":"Dongyuan Shi and Woon-Seng Gan and Bhan Lam and Shulin Wen and Xiaoyi\n  Shen","title":"Active Noise Control based on the Momentum Multichannel Normalized\n  Filtered-x Least Mean Square Algorithm","comments":"Conference: INTER-NOISE and NOISE-CON Congress and Conference\n  Proceedings 2020 At Korea Volume: 261","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multichannel active noise control (MCANC) is widely utilized to achieve\nsignificant noise cancellation area in the complicated acoustic field.\nMeanwhile, the filter-x least mean square (FxLMS) algorithm gradually becomes\nthe benchmark solution for the implementation of MCANC due to its low\ncomputational complexity. However, its slow convergence speed more or less\nundermines the performance of dealing with quickly varying disturbances, such\nas piling noise. Furthermore, the noise power variation also deteriorates the\nrobustness of the algorithm when it adopts the fixed step size. To solve these\nissues, we integrated the normalized multichannel FxLMS with the momentum\nmethod, which hence, effectively avoids the interference of the primary noise\npower and accelerates the convergence of the algorithm. To validate its\neffectiveness, we deployed this algorithm in a multichannel noise control\nwindow to control the real machine noise.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:59:38 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shi","Dongyuan",""],["Gan","Woon-Seng",""],["Lam","Bhan",""],["Wen","Shulin",""],["Shen","Xiaoyi",""]]}
{"id":"2308.03685","submitter":"An Yan","authors":"An Yan, Yu Wang, Yiwu Zhong, Chengyu Dong, Zexue He, Yujie Lu, William\n  Wang, Jingbo Shang, Julian McAuley","title":"Learning Concise and Descriptive Attributes for Visual Recognition","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances in foundation models present new opportunities for\ninterpretable visual recognition -- one can first query Large Language Models\n(LLMs) to obtain a set of attributes that describe each class, then apply\nvision-language models to classify images via these attributes. Pioneering work\nshows that querying thousands of attributes can achieve performance competitive\nwith image features. However, our further investigation on 8 datasets reveals\nthat LLM-generated attributes in a large quantity perform almost the same as\nrandom words. This surprising finding suggests that significant noise may be\npresent in these attributes. We hypothesize that there exist subsets of\nattributes that can maintain the classification performance with much smaller\nsizes, and propose a novel learning-to-search method to discover those concise\nsets of attributes. As a result, on the CUB dataset, our method achieves\nperformance close to that of massive LLM-generated attributes (e.g., 10k\nattributes for CUB), yet using only 32 attributes in total to distinguish 200\nbird species. Furthermore, our new paradigm demonstrates several additional\nbenefits: higher interpretability and interactivity for humans, and the ability\nto summarize knowledge for a recognition task.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:00:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yan","An",""],["Wang","Yu",""],["Zhong","Yiwu",""],["Dong","Chengyu",""],["He","Zexue",""],["Lu","Yujie",""],["Wang","William",""],["Shang","Jingbo",""],["McAuley","Julian",""]]}
{"id":"2308.03686","submitter":"Joe Benton","authors":"Joe Benton, Valentin De Bortoli, Arnaud Doucet, George Deligiannidis","title":"Linear Convergence Bounds for Diffusion Models via Stochastic\n  Localization","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":"  Diffusion models are a powerful method for generating approximate samples\nfrom high-dimensional data distributions. Several recent results have provided\npolynomial bounds on the convergence rate of such models, assuming\n$L^2$-accurate score estimators. However, up until now the best known such\nbounds were either superlinear in the data dimension or required strong\nsmoothness assumptions. We provide the first convergence bounds which are\nlinear in the data dimension (up to logarithmic factors) assuming only finite\nsecond moments of the data distribution. We show that diffusion models require\nat most $\\tilde O(\\frac{d \\log^2(1/\\delta)}{\\varepsilon^2})$ steps to\napproximate an arbitrary data distribution on $\\mathbb{R}^d$ corrupted with\nGaussian noise of variance $\\delta$ to within $\\varepsilon^2$ in\nKullback--Leibler divergence. Our proof builds on the Girsanov-based methods of\nprevious works. We introduce a refined treatment of the error arising from the\ndiscretization of the reverse SDE, which is based on tools from stochastic\nlocalization.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:01:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Benton","Joe",""],["De Bortoli","Valentin",""],["Doucet","Arnaud",""],["Deligiannidis","George",""]]}
{"id":"2308.03687","submitter":"Qi Wang","authors":"Frank E. Curtis, Xin Jiang, and Qi Wang","title":"Almost-sure convergence of iterates and multipliers in stochastic\n  sequential quadratic optimization","comments":null,"journal-ref":null,"doi":null,"report-no":"Lehigh ISE Technical Report 23T-019","categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic sequential quadratic optimization (SQP) methods for solving\ncontinuous optimization problems with nonlinear equality constraints have\nattracted attention recently, such as for solving large-scale data-fitting\nproblems subject to nonconvex constraints. However, for a recently proposed\nsubclass of such methods that is built on the popular stochastic-gradient\nmethodology from the unconstrained setting, convergence guarantees have been\nlimited to the asymptotic convergence of the expected value of a stationarity\nmeasure to zero. This is in contrast to the unconstrained setting in which\nalmost-sure convergence guarantees (of the gradient of the objective to zero)\ncan be proved for stochastic-gradient-based methods. In this paper, new\nalmost-sure convergence guarantees for the primal iterates, Lagrange\nmultipliers, and stationarity measures generated by a stochastic SQP algorithm\nin this subclass of methods are proved. It is shown that the error in the\nLagrange multipliers can be bounded by the distance of the primal iterate to a\nprimal stationary point plus the error in the latest stochastic gradient\nestimate. It is further shown that, subject to certain assumptions, this latter\nerror can be made to vanish by employing a running average of the Lagrange\nmultipliers that are computed during the run of the algorithm. The results of\nnumerical experiments are provided to demonstrate the proved theoretical\nguarantees.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:03:40 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Curtis","Frank E.",""],["Jiang","Xin",""],["Wang","Qi",""]]}
{"id":"2308.03688","submitter":"Xiao Liu","authors":"Xiao Liu, Hao Yu, Hanchen Zhang, Yifan Xu, Xuanyu Lei, Hanyu Lai, Yu\n  Gu, Hangliang Ding, Kaiwen Men, Kejuan Yang, Shudan Zhang, Xiang Deng, Aohan\n  Zeng, Zhengxiao Du, Chenhui Zhang, Sheng Shen, Tianjun Zhang, Yu Su, Huan\n  Sun, Minlie Huang, Yuxiao Dong, Jie Tang","title":"AgentBench: Evaluating LLMs as Agents","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) are becoming increasingly smart and autonomous,\ntargeting real-world pragmatic missions beyond traditional NLP tasks. As a\nresult, there has been an urgent need to evaluate LLMs as agents on challenging\ntasks in interactive environments. We present AgentBench, a multi-dimensional\nevolving benchmark that currently consists of 8 distinct environments to assess\nLLM-as-Agent's reasoning and decision-making abilities in a multi-turn\nopen-ended generation setting. Our extensive test over 25 LLMs (including APIs\nand open-sourced models) shows that, while top commercial LLMs present a strong\nability of acting as agents in complex environments, there is a significant\ndisparity in performance between them and open-sourced competitors. It also\nserves as a component of an ongoing project with wider coverage and deeper\nconsideration towards systematic LLM evaluation. Datasets, environments, and an\nintegrated evaluation package for AgentBench are released at\nhttps://github.com/THUDM/AgentBench\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:08:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Xiao",""],["Yu","Hao",""],["Zhang","Hanchen",""],["Xu","Yifan",""],["Lei","Xuanyu",""],["Lai","Hanyu",""],["Gu","Yu",""],["Ding","Hangliang",""],["Men","Kaiwen",""],["Yang","Kejuan",""],["Zhang","Shudan",""],["Deng","Xiang",""],["Zeng","Aohan",""],["Du","Zhengxiao",""],["Zhang","Chenhui",""],["Shen","Sheng",""],["Zhang","Tianjun",""],["Su","Yu",""],["Sun","Huan",""],["Huang","Minlie",""],["Dong","Yuxiao",""],["Tang","Jie",""]]}
{"id":"2308.03690","submitter":"Davide Ferrari","authors":"Davide Ferrari, Andrea Pupa, Alberto Signoretti, Cristian Secchi","title":"Safe Multimodal Communication in Human-Robot Collaboration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The new industrial settings are characterized by the presence of human and\nrobots that work in close proximity, cooperating in performing the required\njob. Such a collaboration, however, requires to pay attention to many aspects.\nFirstly, it is crucial to enable a communication between this two actors that\nis natural and efficient. Secondly, the robot behavior must always be compliant\nwith the safety regulations, ensuring always a safe collaboration. In this\npaper, we propose a framework that enables multi-channel communication between\nhumans and robots by leveraging multimodal fusion of voice and gesture commands\nwhile always respecting safety regulations. The framework is validated through\na comparative experiment, demonstrating that, thanks to multimodal\ncommunication, the robot can extract valuable information for performing the\nrequired task and additionally, with the safety layer, the robot can scale its\nspeed to ensure the operator's safety.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:08:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ferrari","Davide",""],["Pupa","Andrea",""],["Signoretti","Alberto",""],["Secchi","Cristian",""]]}
{"id":"2308.03691","submitter":"Jirka Hlinka","authors":"Jiri Hlinka","title":"Possible ferroic properties of copper-substituted lead phosphate apatite","comments":"4 pages, 5 figures","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":"  Paper provides symmetry arguments explaining that charge density wave induced\nby copper doping to lead phosphate apatite crystal implies a symmetry breaking\nphase transition from $P6_3/m$ (176) to a polar and chiral phase with $P6_3$\n(173) spacegroup symmetry.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:08:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Hlinka","Jiri",""]]}
{"id":"2308.03692","submitter":"Anatolii Mokshin","authors":"Ilnaz I. Fairushin, Anatolii V. Mokshin","title":"Collective ion dynamics in Coulomb one-component plasmas within the\n  self-consistent relaxation theory","comments":"9 pages, 5 figures","journal-ref":"Phys. Rev. E 108, 015206(2023)","doi":"10.1103/PhysRevE.108.015206","report-no":null,"categories":"physics.plasm-ph cond-mat.dis-nn cond-mat.stat-mech physics.class-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present the theoretical formalism describing the collective\nion dynamics of the nonideal Coulomb classical one-component plasmas on the\nbasis of the self-consistent relaxation theory. The theory is adapted to\naccount for correlations between the frequency relaxation parameters that\ncharacterize the three- and four-particle dynamics and the parameters\nassociated with the two-particle dynamics. The dynamic structure factor spectra\nand dispersion characteristics calculated for a wide range of wave numbers are\nin agreement with the molecular dynamics simulation data and the results\nobtained with the theory of the frequency moments. The proposed formalism\nreproduces all the features inherent to the Coulomb one-component plasmas and\nrequires only knowledge of the coupling parameter and the information about the\nstructure.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:10:55 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fairushin","Ilnaz I.",""],["Mokshin","Anatolii V.",""]]}
{"id":"2308.03693","submitter":"Christopher Burns","authors":"Christopher Burns","title":"The Bornological Dual of the Structure Sheaves of Complex Manifolds","comments":"21 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An alternative proof of bornological Verdier duality for complex manifolds,\nas proven initially by Prosmans & Schneiders is given, using Schneider's theory\nof quasi-abelian homological algebra, and the theory of residues and duality.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:11:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Burns","Christopher",""]]}
{"id":"2308.03694","submitter":"Etienne Granet","authors":"Etienne Granet and Henrik Dreyer","title":"Continuous Hamiltonian dynamics on noisy digital quantum computers\n  without Trotter error","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce an algorithm to compute Hamiltonian dynamics on digital quantum\ncomputers that requires only a finite circuit depth to reach an arbitrary\nprecision, i.e. achieves zero Trotter error with finite depth. This finite\nnumber of gates comes at the cost of an attenuation of the measured expectation\nvalue by a known amplitude, requiring more shots per circuit. The algorithm\ngeneralizes to time-dependent Hamiltonians, for example for adiabatic state\npreparation. This makes it particularly suitable for present-day relatively\nnoisy hardware that supports only circuits with moderate depth.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:12:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Granet","Etienne",""],["Dreyer","Henrik",""]]}
{"id":"2308.03695","submitter":"Anuj Dawar","authors":"Anuj Dawar and Lauri Hella","title":"Quantifiers closed under partial polymorphisms","comments":"Submitted. 17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study Lindstrom quantifiers that satisfy certain closure properties which\nare motivated by the study of polymorphisms in the context of constraint\nsatisfaction problems (CSP). When the algebra of polymorphisms of a finite\nstructure B satisfies certain equations, this gives rise to a natural closure\ncondition on the class of structures that map homomorphically to B. The\ncollection of quantifiers that satisfy closure conditions arising from a fixed\nset of equations are rather more general than those arising as CSP. For any\nsuch conditions P, we define a pebble game that delimits the distinguishing\npower of the infinitary logic with all quantifiers that are P-closed. We use\nthe pebble game to show that the problem of deciding whether a system of linear\nequations is solvable in Z2 is not expressible in the infinitary logic with all\nquantifiers closed under a near-unanimity condition.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:12:31 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dawar","Anuj",""],["Hella","Lauri",""]]}
{"id":"2308.03696","submitter":"Jing Yang","authors":"Hai-Long Shi, Xi-Wen Guan, and Jing Yang","title":"Universal shot-noise limit for quantum metrology with local Hamiltonians","comments":"6+11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.quant-gas math-ph math.MP nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum many-body interactions can induce quantum entanglement among\nparticles, rendering them valuable resources for quantum-enhanced sensing. In\nthis work, we derive a universal and fundamental bound for the growth of the\nquantum Fisher information. We apply our bound to the metrological protocol\nrequiring only separable initial states, which can be readily prepared in\nexperiments. By establishing a link between our bound and the Lieb-Robinson\nbound, which characterizes the operator growth in locally interacting quantum\nmany-body systems, we prove that the precision cannot surpass the shot noise\nlimit at all times in locally interacting quantum systems. This conclusion also\nholds for an initial state that is the non-degenerate ground state of a local\nand gapped Hamiltonian. These findings strongly hint that when one can only\nprepare separable initial states, nonlocal and long-range interactions are\nessential resources for surpassing the shot noise limit. This observation is\nconfirmed through numerical analysis on the long-range Ising model. Our results\nbridge the field of many-body quantum sensing and operator growth in many-body\nquantum systems and open the possibility to investigate the interplay between\nquantum sensing and control, many-body physics and information scrambling\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:13:01 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shi","Hai-Long",""],["Guan","Xi-Wen",""],["Yang","Jing",""]]}
{"id":"2308.03697","submitter":"Mohammad Ghomi","authors":"Igor Belegradek and Mohammad Ghomi","title":"Point selections from Jordan domains in Riemannian Surfaces","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.GN math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using fiber bundle theory and conformal mappings, we continuously select a\npoint from the interior of Jordan domains in Riemannian surfaces. This\nselection can be made equivariant under isometries, and take on prescribed\nvalues such as the center of mass when the domains are convex. Analogous\nresults for conformal transformations are obtained as well. It follows that the\nspace of Jordan domains in surfaces of constant curvature admits an\nisometrically equivariant strong deformation retraction onto the space of round\ndisks. Finally we develop a canonical procedure for selecting points from\nplanar Jordan domains.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:13:11 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Belegradek","Igor",""],["Ghomi","Mohammad",""]]}
{"id":"2308.03698","submitter":"Songlin Fan","authors":"Songlin Fan and Wei Gao","title":"Screen-based 3D Subjective Experiment Software","comments":"Accepted to ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, widespread 3D graphics (e.g., point clouds and meshes) have drawn\nconsiderable efforts from academia and industry to assess their perceptual\nquality by conducting subjective experiments. However, lacking a handy software\nfor 3D subjective experiments complicates the construction of 3D graphics\nquality assessment datasets, thus hindering the prosperity of relevant fields.\nIn this paper, we develop a powerful platform with which users can flexibly\ndesign their 3D subjective methodologies and build high-quality datasets,\neasing a broad spectrum of 3D graphics subjective quality study. To accurately\nillustrate the perceptual quality differences of 3D stimuli, our software can\nsimultaneously render the source stimulus and impaired stimulus and allows both\nstimuli to respond synchronously to viewer interactions. Compared with amateur\n3D visualization tool-based or image/video rendering-based schemes, our\napproach embodies typical 3D applications while minimizing cognitive overload\nduring subjective experiments. We organized a subjective experiment involving\n40 participants to verify the validity of the proposed software. Experimental\nanalyses demonstrate that subjective tests on our software can produce\nreasonable subjective quality scores of 3D models. All resources in this paper\ncan be found at https://openi.pcl.ac.cn/OpenDatasets/3DQA.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:14:27 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 03:40:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fan","Songlin",""],["Gao","Wei",""]]}
{"id":"2308.03699","submitter":"Saad Saleh","authors":"Saad J. Saleh and Ed K. Biegert","title":"Towards Streamer-Free Marine Seismic Surveys: The Role of Formation\n  Control Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the applicability of recent advances in formation control theory\nand robust network analysis to the problem of designing streamer-free marine\nseismic surveys. To this end, we carry out a theoretical and numerical\nfeasibility study to highlight the power and utility of this methodology,\nproviding an explicit formula for the control law required to continually\nmaneuver the data acquisition formation, and specifically addressing the\nrobustness issue related to potential sensor failures.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:17:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Saleh","Saad J.",""],["Biegert","Ed K.",""]]}
{"id":"2308.03700","submitter":"Yee Sin Ang","authors":"Xukun Feng, Chit Siong Lau, Shi-Jun Liang, Ching Hua Lee, Shengyuan A.\n  Yang, Yee Sin Ang","title":"Half-Valley Ohmic Contact and Contact-Limited Valley-Contrasting Current\n  Injection","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two-dimensional (2D) ferrovalley semiconductor (FVSC) with spontaneous valley\npolarization offers an exciting material platform for probing Berry phase\nphysics. How FVSC can be incorporated in valleytronic device applications,\nhowever, remain an open question. Here we generalize the concept of\nmetal/semiconductor (MS) contact into the realm of valleytronics. We propose a\nhalf-valley Ohmic contact based on FVSC/graphene heterostructure where the two\nvalleys of FVSC separately forms Ohmic and Schottky contacts with those of\ngraphene, thus allowing current to be valley-selectively injected through the\n`Ohmic' valley while being blocked in the `Schottky' valley. We develop a\ntheory of contact-limited valley-contrasting current injection and demonstrate\nthat such transport mechanism can produce gate-tunable valley-polarized\ninjection current. Using RuCl$_2$/graphene heterostructure as an example, we\nillustrate a device concept of valleytronic barristor where high valley\npolarization efficiency and sizable current on/off ratio, can be achieved under\nexperimentally feasible electrostatic gating conditions. These findings uncover\ncontact-limited valley-contrasting current injection as an efficient mechanism\nfor valley polarization manipulation, and reveals the potential of valleytronic\nMS contact as a functional building block of valleytronic device technology.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:21:26 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:17:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Feng","Xukun",""],["Lau","Chit Siong",""],["Liang","Shi-Jun",""],["Lee","Ching Hua",""],["Yang","Shengyuan A.",""],["Ang","Yee Sin",""]]}
{"id":"2308.03701","submitter":"Majed Nashaat","authors":"Yu. M. Shukrinov, E. Kovalenko, J. Tekic, K. Kulikov, and M. Nashaat","title":"Buzdin, Shapiro and Chimera Steps in $\\varphi_0$ Josephson Junctions","comments":"5 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The unique resonance and locking phenomena in the\nsuperconductor-ferromagnet-superconductor $\\varphi_0$ Josephson junction under\nexternal electromagnetic radiation are demonstrated when not just the electric\nbut also the magnetic component of external radiation is taken into account.\nDue to the coupling of superconductivity and magnetism in this system, the\nmagnetic moment precession of the ferromagnetic layer caused by the magnetic\ncomponent of external radiation can lock the Josephson oscillations, which\nresults in the appearance of a particular type of steps in the current-voltage\ncharacteristics, completely different from the well-known Shapiro steps. We\ncall these steps the Buzdin steps in the case when the system is driven only by\nthe magnetic component and the Chimera steps in the case when both magnetic and\nelectric components are present. Unlike the Shapiro steps where the\nmagnetization remains constant along the step, here it changes though the\nsystem is locked. The spin-orbit coupling substantially contributes to the\namplitude, i.e., the size of these steps. Dramatic changes in their amplitudes\nare also observed at frequencies near the ferromagnetic resonance. Combinations\nof the Josephson and Kittel ferromagnetic resonances together with different\ntypes of locking pronounced in dynamics and current-voltage characteristics\nmake the physics of this system very interesting and open up a series of new\napplications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:22:18 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 11:21:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shukrinov","Yu. M.",""],["Kovalenko","E.",""],["Tekic","J.",""],["Kulikov","K.",""],["Nashaat","M.",""]]}
{"id":"2308.03702","submitter":"Paramita Deka Ms","authors":"Paramita Deka, Kalpana Bora","title":"Sensitivity of octant of $\\theta_{23}$, CP violation and mass hierarchy\n  in NO$\\nu$A with multinucleon and detector effects","comments":"15 pages, 8 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we investigate how multinucleon enhancement and RPA (Random\nPhase Approximation) suppression can affect the measurement of three unknown\nneutrino oscillation parameters - the CP-violating phase $\\delta_{CP}$, the\noctant of the atmospheric mixing angle $\\theta_{23}$, and the determination of\nthe mass hierarchy, in the appearance channel of the NO$\\nu$A experiment. We\ninclude the presence of the detector effect as well in the analysis, which is\ncrucial for capturing realistic experimental scenarios. It is found that the\nanalysis using our comprehensive model (QE(+RPA)+2p2h) exhibits significantly\nenhanced sensitivity compared to the pure QE interaction process, in all the\ncases. Also, the higher octant of $\\theta_{23}$, the lower half plane of\n$\\delta_{CP}$, and the normal mass hierarchy (HO-LHP-NH) exhibit improved\nsensitivity, enabling a more precise determination of the corresponding\nparameters. Furthermore, it is also noted that improving the performance of the\ndetector also improves the results. Thus, including multinucleon effects and\nimproving detector efficiency have the potential to enhance the capabilities of\nthe NO$\\nu$A (and other long baseline) experiment in conducting precise\nparameter studies.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:22:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Deka","Paramita",""],["Bora","Kalpana",""]]}
{"id":"2308.03703","submitter":"Pingping Zhang Dr","authors":"Xuehu Liu and Pingping Zhang and Huchuan Lu","title":"Video-based Person Re-identification with Long Short-Term Representation\n  Learning","comments":"This work is accepted by ICIG2023, including 13 pages, 5 figures and\n  5 tables. Modifications may be performed for further improvements","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video-based person Re-Identification (V-ReID) aims to retrieve specific\npersons from raw videos captured by non-overlapped cameras. As a fundamental\ntask, it spreads many multimedia and computer vision applications. However, due\nto the variations of persons and scenes, there are still many obstacles that\nmust be overcome for high performance. In this work, we notice that both the\nlong-term and short-term information of persons are important for robust video\nrepresentations. Thus, we propose a novel deep learning framework named Long\nShort-Term Representation Learning (LSTRL) for effective V-ReID. More\nspecifically, to extract long-term representations, we propose a\nMulti-granularity Appearance Extractor (MAE), in which four granularity\nappearances are effectively captured across multiple frames. Meanwhile, to\nextract short-term representations, we propose a Bi-direction Motion Estimator\n(BME), in which reciprocal motion information is efficiently extracted from\nconsecutive frames. The MAE and BME are plug-and-play and can be easily\ninserted into existing networks for efficient feature learning. As a result,\nthey significantly improve the feature representation ability for V-ReID.\nExtensive experiments on three widely used benchmarks show that our proposed\napproach can deliver better performances than most state-of-the-arts.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:22:47 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liu","Xuehu",""],["Zhang","Pingping",""],["Lu","Huchuan",""]]}
{"id":"2308.03704","submitter":"Yancheng Liang","authors":"Yancheng Liang, Jiajie Zhang, Hui Li, Xiaochen Liu, Yi Hu, Yong Wu,\n  Jinyao Zhang, Yongyan Liu, Yi Wu","title":"DeRisk: An Effective Deep Learning Framework for Credit Risk Prediction\n  over Real-World Financial Data","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":"  Despite the tremendous advances achieved over the past years by deep learning\ntechniques, the latest risk prediction models for industrial applications still\nrely on highly handtuned stage-wised statistical learning tools, such as\ngradient boosting and random forest methods. Different from images or\nlanguages, real-world financial data are high-dimensional, sparse, noisy and\nextremely imbalanced, which makes deep neural network models particularly\nchallenging to train and fragile in practice. In this work, we propose DeRisk,\nan effective deep learning risk prediction framework for credit risk prediction\non real-world financial data. DeRisk is the first deep risk prediction model\nthat outperforms statistical learning approaches deployed in our company's\nproduction system. We also perform extensive ablation studies on our method to\npresent the most critical factors for the empirical success of DeRisk.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:22:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liang","Yancheng",""],["Zhang","Jiajie",""],["Li","Hui",""],["Liu","Xiaochen",""],["Hu","Yi",""],["Wu","Yong",""],["Zhang","Jinyao",""],["Liu","Yongyan",""],["Wu","Yi",""]]}
{"id":"2308.03705","submitter":"Alisa Kovtunova","authors":"Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann\n  and Alisa Kovtunova","title":"Combining Proofs for Description Logic and Concrete Domain Reasoning\n  (Technical Report)","comments":"Extended version of a paper accepted at the 7th International Joint\n  Conference on Rules and Reasoning (RuleML+RR 2023). The software and the\n  dataset described in the paper are available online, see\n  https://doi.org/10.5281/zenodo.8208780","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Logic-based approaches to AI have the advantage that their behavior can in\nprinciple be explained with the help of proofs of the computed consequences.\nFor ontologies based on Description Logic (DL), we have put this advantage into\npractice by showing how proofs for consequences derived by DL reasoners can be\ncomputed and displayed in a user-friendly way. However, these methods are\ninsufficient in applications where also numerical reasoning is relevant. The\npresent paper considers proofs for DLs extended with concrete domains (CDs)\nbased on the rational numbers, which leave reasoning tractable if integrated\ninto the lightweight DL $\\mathcal{E}\\hspace{-0.1em}\\mathcal{L}_\\bot$. Since no\nimplemented DL reasoner supports these CDs, we first develop reasoning\nprocedures for them, and show how they can be combined with reasoning\napproaches for pure DLs, both for $\\mathcal{E}\\hspace{-0.1em}\\mathcal{L}_\\bot$\nand the more expressive DL $\\mathcal{ALC}$. These procedures are designed such\nthat it is easy to extract proofs from them. We show how the extracted CD\nproofs can be combined with proofs on the DL side into integrated proofs that\nexplain both the DL and the CD reasoning.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:23:04 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Alrabbaa","Christian",""],["Baader","Franz",""],["Borgwardt","Stefan",""],["Koopmann","Patrick",""],["Kovtunova","Alisa",""]]}
{"id":"2308.03706","submitter":"Stefano Matta","authors":"Andrea Loi, Stefano Matta, Daria Uccheddu","title":"Uniqueness of equilibrium and redistributive policies: a geometric\n  approach to efficiency","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper examines the relationship between resource reallocation,\nuniqueness of equilibrium and efficiency in economics. We explore the\nimplications of reallocation policies for stability, conflict, and\ndecision-making by analysing the existence of geodesic coordinate functions in\nthe equilibrium manifold. Our main result shows that in an economy with M = 2\nconsumers and L goods, if L coordinate functions, representing policies, are\ngeodesics on the equilibrium manifold (a property that we call the finite\ngeodesic property), then the equilibrium is globally unique. The presence of\ngeodesic variables indicates optimization and efficiency in the economy, while\nnon-geodesic variables add complexity. Finally, we establish a link between the\nexisting results on curvature, minimal entropy, geodesics and uniqueness in\nsmooth exchange economies. This study contributes to the understanding of the\ngeometric and economic properties of equilibria and offers potential\napplications in policy considerations. Keywords: Uniqueness of equilibrium,\nredistributive policies, geodesics, equilibrium manifold, equilibrium\nselection, curvature, geodesics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:23:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Loi","Andrea",""],["Matta","Stefano",""],["Uccheddu","Daria",""]]}
{"id":"2308.03707","submitter":"Enrico Della Valle","authors":"Enrico Della Valle, Procopios Constantinou, Thorsten Schmitt, Gabriel\n  Aeppli, Vladimir N. Strocov","title":"Static disorder in soft X-ray angle-resolved photoemission spectroscopy:\n  theory and application to ion-bombarded InAs(110)","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":"  Angle-resolved photoemission spectroscopy (ARPES) is one of the most\nubiquitous characterization techniques utilized in the field of condensed\nmatter physics. The resulting spectral intensity consists of a coherent and\nincoherent part, whose relative contribution is governed by atomic disorder,\nwhere thermal contribution is expressed in terms of the Debye-Waller factor\n(DWF). In this work, we present a soft-X-ray study on the sputter-induced\ndisorder of InAs(110) surface. We define a new quantity, referred to as the\ncoherence factor FC, which is the analogue of the DWF, extended to static\ndisorder. We show that FC alone can be used to quantify the depletion of\ncoherent intensity with increasing disorder, and, in combination with the DWF,\nallows considerations of thermal and static disorder effects on the same\nfooting. Our study also unveils an intriguing finding: as disorder increases,\nthe ARPES intensity of quantum well states originating from the conduction band\ndepletes more rapidly compared to the valence bands. This difference can be\nattributed to the predominance of quasi-elastic defect scattering and the\ndifference in phase space available for such scattering for conduction-band\n(CB) and valence-band (VB) initial states. Specifically, the absence of empty\nstates well below the Fermi energy (EF) hinders the quasi-elastic scattering of\nthe VB states, while their abundance in vicinity of EF enhances the scattering\nrate of the CB states. Additionally, we observe no noticeable increase in\nbroadening of the VB dispersions as the sputter-induced disorder increases.\nThis observation aligns with the notion that valence initial states are less\nlikely to experience the quasi-elastic defect scattering, which would shorten\ntheir lifetime, and with the random uncorrelated nature of the defects\nintroduced by the ion sputtering.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:23:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Della Valle","Enrico",""],["Constantinou","Procopios",""],["Schmitt","Thorsten",""],["Aeppli","Gabriel",""],["Strocov","Vladimir N.",""]]}
{"id":"2308.03708","submitter":"Francesca Greselin","authors":"Vytaras Brazauskas, Francesca Greselin, and Ricardas Zitikis","title":"Measuring income inequality via percentile relativities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME econ.EM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  \"The rich are getting richer\" implies that the population income\ndistributions are getting more right skewed and heavily tailed. For such\ndistributions, the mean is not the best measure of the center, but the\nclassical indices of income inequality, including the celebrated Gini index,\nare all mean-based. In view of this, Professor Gastwirth sounded an alarm back\nin 2014 by suggesting to incorporate the median into the definition of the Gini\nindex, although noted a few shortcomings of his proposed index. In the present\npaper we make a further step in the modification of classical indices and, to\nacknowledge the possibility of differing viewpoints, arrive at three\nmedian-based indices of inequality. They avoid the shortcomings of the previous\nindices and can be used even when populations are ultra heavily tailed, that\nis, when their first moments are infinite. The new indices are illustrated both\nanalytically and numerically using parametric families of income distributions,\nand further illustrated using capital incomes coming from 2001 and 2018 surveys\nof fifteen European countries. We also discuss the performance of the indices\nfrom the perspective of income transfers.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:25:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Brazauskas","Vytaras",""],["Greselin","Francesca",""],["Zitikis","Ricardas",""]]}
{"id":"2308.03709","submitter":"Debesh Jha","authors":"Nikhil Kumar Tomar, Debesh Jha, Ulas Bagci","title":"Prototype Learning for Out-of-Distribution Polyp Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing polyp segmentation models from colonoscopy images often fail to\nprovide reliable segmentation results on datasets from different centers,\nlimiting their applicability. Our objective in this study is to create a robust\nand well-generalized segmentation model named PrototypeLab that can assist in\npolyp segmentation. To achieve this, we incorporate various lighting modes such\nas White light imaging (WLI), Blue light imaging (BLI), Linked color imaging\n(LCI), and Flexible spectral imaging color enhancement (FICE) into our new\nsegmentation model, that learns to create prototypes for each class of object\npresent in the images. These prototypes represent the characteristic features\nof the objects, such as their shape, texture, color. Our model is designed to\nperform effectively on out-of-distribution (OOD) datasets from multiple\ncenters. We first generate a coarse mask that is used to learn prototypes for\nthe main object class, which are then employed to generate the final\nsegmentation mask. By using prototypes to represent the main class, our\napproach handles the variability present in the medical images and generalize\nwell to new data since prototype capture the underlying distribution of the\ndata. PrototypeLab offers a promising solution with a dice coefficient of\n$\\geq$ 90\\% and mIoU $\\geq$ 85\\% with a near real-time processing speed for\npolyp segmentation. It achieved superior performance on OOD datasets compared\nto 16 state-of-the-art image segmentation architectures, potentially improving\nclinical outcomes. Codes are available at\nhttps://github.com/xxxxx/PrototypeLab.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:30:24 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tomar","Nikhil Kumar",""],["Jha","Debesh",""],["Bagci","Ulas",""]]}
{"id":"2308.03710","submitter":"KyeongRo Kim","authors":"KyeongRo Kim and Donggyun Seo","title":"Uniform difference between the length spectra of Out(F2) and the genus\n  two 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":"  In this paper, we analyze the natural homomorphism from the genus g\nhandlebody group to the outer automorphism group of the free group with rank g,\nin terms of length spectra. In general, the preimage of each fully irreducible\nouter automorphism contains a potentially infinite number of pseudo-Anosov\nmapping classes. Our study reveals a crucial relationship: for any\npseudo-Anosov map in this preimage, its stretch factor must equal or exceed\nthat of the corresponding fully irreducible outer automorphism. Notably, in the\ncase of genus two, we establish that the minimum stretch factor among these\npseudo-Anosov maps is less than ten times the stretch factor of the fully\nirreducible outer automorphism. These results partially address a question by\nHensel and have practical implications, including a lower bound for the\ngeodesic counting problem in the genus two handlebody group.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:30:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kim","KyeongRo",""],["Seo","Donggyun",""]]}
{"id":"2308.03711","submitter":"Fabio Zucca","authors":"Daniela Bertacchi, Elisabetta Candellero, Fabio Zucca","title":"Martin boundaries and asymptotic behavior of branching random walks","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be an infinite, locally finite and transitive graph. We investigate\nthe relation between supercritical, transient branching random walks (BRW) and\nthe Martin boundary for its underlying random walk (RW). We show results\nregarding the typical asymptotic directions taken by the particles, and as a\nconsequence we find a new connection between $t$-Martin boundaries and standard\nMartin boundaries. Moreover, given a subgraph $U$ we study two aspects of BRW\nin $U$: when the trajectories visit $U$ infinitely often (survival) and when\nthey stay inside $U$ forever (persistence). We relate these behavior, via the\nmean of the offspring distribution, with the spectral radii of the underlying\nRWs on $G$ and on $U$. We show that there are cases where the BRW does not\nsurvive in $U$, but RW on $G$ converges to the boundary of $U$ with positive\nprobability; however, this does not happen when $U$ is connected. In contrast,\nBRW can survive with positive probability in $U$ even though the RW eventually\nexits $U$ almost surely. We conclude with several examples and counterexamples.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:30:50 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bertacchi","Daniela",""],["Candellero","Elisabetta",""],["Zucca","Fabio",""]]}
{"id":"2308.03712","submitter":"Emin Orhan","authors":"A. Emin Orhan","title":"Scaling may be all you need for achieving human-level object recognition\n  capacity with human-like visual experience","comments":"v2 adds an Appendix containing results with alternative scaling\n  functions; code & models available from\n  https://github.com/eminorhan/humanlike-vits","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.NE q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper asks whether current self-supervised learning methods, if\nsufficiently scaled up, would be able to reach human-level visual object\nrecognition capabilities with the same type and amount of visual experience\nhumans learn from. Previous work on this question only considered the scaling\nof data size. Here, we consider the simultaneous scaling of data size, model\nsize, and image resolution. We perform a scaling experiment with vision\ntransformers up to 633M parameters in size (ViT-H/14) trained with up to 5K\nhours of human-like video data (long, continuous, mostly egocentric videos)\nwith image resolutions of up to 476x476 pixels. The efficiency of masked\nautoencoders (MAEs) as a self-supervised learning algorithm makes it possible\nto run this scaling experiment on an unassuming academic budget. We find that\nit is feasible to reach human-level object recognition capacity at sub-human\nscales of model size, data size, and image size, if these factors are scaled up\nsimultaneously. To give a concrete example, we estimate that a 2.5B parameter\nViT model trained with 20K hours (2.3 years) of human-like video data with a\nspatial resolution of 952x952 pixels should be able to reach roughly\nhuman-level accuracy on ImageNet. Human-level competence is thus achievable for\na fundamental perceptual capability from human-like perceptual experience\n(human-like in both amount and type) with extremely generic learning algorithms\nand architectures and without any substantive inductive biases.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:31:38 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 16:23:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Orhan","A. Emin",""]]}
{"id":"2308.03713","submitter":"Bingyan Xie","authors":"Bingyan Xie, Yongpeng Wu, Yuxuan Shi, Derrick Wing Kwan Ng, Wenjun\n  Zhang","title":"Communication-Efficient Framework for Distributed Image Semantic\n  Wireless Transmission","comments":"This paper has been accepted by IEEE Internet of Things Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IT eess.IV math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-node communication, which refers to the interaction among multiple\ndevices, has attracted lots of attention in many Internet-of-Things (IoT)\nscenarios. However, its huge amounts of data flows and inflexibility for task\nextension have triggered the urgent requirement of communication-efficient\ndistributed data transmission frameworks. In this paper, inspired by the great\nsuperiorities on bandwidth reduction and task adaptation of semantic\ncommunications, we propose a federated learning-based semantic communication\n(FLSC) framework for multi-task distributed image transmission with IoT\ndevices. Federated learning enables the design of independent semantic\ncommunication link of each user while further improves the semantic extraction\nand task performance through global aggregation. Each link in FLSC is composed\nof a hierarchical vision transformer (HVT)-based extractor and a task-adaptive\ntranslator for coarse-to-fine semantic extraction and meaning translation\naccording to specific tasks. In order to extend the FLSC into more realistic\nconditions, we design a channel state information-based multiple-input\nmultiple-output transmission module to combat channel fading and noise.\nSimulation results show that the coarse semantic information can deal with a\nrange of image-level tasks. Moreover, especially in low signal-to-noise ratio\nand channel bandwidth ratio regimes, FLSC evidently outperforms the traditional\nscheme, e.g. about 10 peak signal-to-noise ratio gain in the 3 dB channel\ncondition.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:32:14 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 02:53:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xie","Bingyan",""],["Wu","Yongpeng",""],["Shi","Yuxuan",""],["Ng","Derrick Wing Kwan",""],["Zhang","Wenjun",""]]}
{"id":"2308.03714","submitter":"Tom Chou","authors":"Xiangting Li, Sara Habibipour, Tom Chou, Otto O. Yang","title":"The role of APOBEC3-induced mutations in the differential evolution of\n  monkeypox virus","comments":"22 pages, 7 figures, Supplement","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE cond-mat.stat-mech q-bio.GN q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent studies show that newly sampled monkeypox virus (MPXV) genomes exhibit\nmutations consistent with Apolipoprotein B mRNA Editing Catalytic\nPolypeptide-like3 (APOBEC3)-mediated editing, compared to MPXV genomes\ncollected earlier. It is unclear whether these single nucleotide polymorphisms\n(SNPs) result from APOBEC3-induced editing or are a consequence of genetic\ndrift within one or more MPXV animal reservoirs. We develop a simple method\nbased on a generalization of the General-Time-Reversible (GTR) model to show\nthat the observed SNPs are likely the result of APOBEC3-induced editing. The\nstatistical features allow us to extract lineage information and estimate\nevolutionary events.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:35:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Li","Xiangting",""],["Habibipour","Sara",""],["Chou","Tom",""],["Yang","Otto O.",""]]}
{"id":"2308.03715","submitter":"Sandip Maji","authors":"Sandip Maji, and Srinivasan Natesan","title":"Superconvergence analysis of interior penalty discontinuous Galerkin\n  method for a class of time-fractional diffusion 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 this study, we consider a class of non-autonomous time-fractional partial\nadvection-diffusion-reaction (TF-ADR) equations with Caputo type fractional\nderivative. To obtain the numerical solution of the model problem, we apply the\nnon-symmetric interior penalty Galerkin (NIPG) method in space on a uniform\nmesh and the L1-scheme in time on a graded mesh. It is demonstrated that the\ncomputed solution is discretely stable. Superconvergence of error estimates for\nthe proposed method are obtained using the discrete energy-norm. Also, we have\napplied the proposed method to solve semilinear problems after linearizing by\nthe Newton linearization process. The theoretical results are verified through\nnumerical experiments.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:36:27 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Maji","Sandip",""],["Natesan","Srinivasan",""]]}
{"id":"2308.03716","submitter":"Iarley P. Lobo Dr","authors":"Pedro H. Morais, Iarley P. Lobo, Christian Pfeifer, Rafael Alves\n  Batista, Valdir B. Bezerra","title":"Modified particle lifetimes as a signature of deformed relativity","comments":"5 pages. Acknowledgments added","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate a compatibility between the relativity principle and the clock\npostulate in deformed special relativity, by identifying the relevant deformed\nLorentz transformations in position space between arbitrary frames. This result\nleads to a first-principles correction to the dilated lifetime of fundamental\nparticles. It turns out that these modified time dilations offer a way to\nscrutinize Lorentz invariance (or deviations thereof) to high precision.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:38:07 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 17:46:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Morais","Pedro H.",""],["Lobo","Iarley P.",""],["Pfeifer","Christian",""],["Batista","Rafael Alves",""],["Bezerra","Valdir B.",""]]}
{"id":"2308.03717","submitter":"Abhishek Tyagi","authors":"Abhay Tyagi, Abhishek Tyagi, Manpreet Kaur, Jayanthi Sivaswami, Richa\n  Aggarwal, Kapil Dev Soni, Anjan Trikha","title":"Automated Real Time Delineation of Supraclavicular Brachial Plexus in\n  Neck Ultrasonography Videos: A Deep Learning Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Peripheral nerve blocks are crucial to treatment of post-surgical pain and\nare associated with reduction in perioperative opioid use and hospital stay.\nAccurate interpretation of sono-anatomy is critical for the success of\nultrasound (US) guided peripheral nerve blocks and can be challenging to the\nnew operators. This prospective study enrolled 227 subjects who were\nsystematically scanned for supraclavicular and interscalene brachial plexus in\nvarious settings using three different US machines to create a dataset of 227\nunique videos. In total, 41,000 video frames were annotated by experienced\nanaesthesiologists using partial automation with object tracking and active\ncontour algorithms. Four baseline neural network models were trained on the\ndataset and their performance was evaluated for object detection and\nsegmentation tasks. Generalizability of the best suited model was then tested\non the datasets constructed from separate US scanners with and without\nfine-tuning. The results demonstrate that deep learning models can be leveraged\nfor real time segmentation of supraclavicular brachial plexus in neck\nultrasonography videos with high accuracy and reliability. Model was also\ntested for its ability to differentiate between supraclavicular and adjoining\ninterscalene brachial plexus. The entire dataset has been released publicly for\nfurther study by the research community.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:40:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Tyagi","Abhay",""],["Tyagi","Abhishek",""],["Kaur","Manpreet",""],["Sivaswami","Jayanthi",""],["Aggarwal","Richa",""],["Soni","Kapil Dev",""],["Trikha","Anjan",""]]}
{"id":"2308.03718","submitter":"Efimia Panagiotaki","authors":"Efimia Panagiotaki, Daniele De Martini, Georgi Pramatarov, Matthew\n  Gadd, Lars Kunze","title":"SEM-GAT: Explainable Semantic Pose Estimation using Learned Graph\n  Attention","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a GNN-based method for exploiting semantics and local\ngeometry to guide the identification of reliable pointcloud registration\ncandidates. Semantic and morphological features of the environment serve as key\nreference points for registration, enabling accurate lidar-based pose\nestimation. Our novel lightweight static graph structure informs our\nattention-based keypoint node aggregation GNN network by identifying semantic\ninstance-based relationships, acting as inductive bias to significantly reduce\nthe computational burden of pointcloud registration. By connecting candidate\nnodes and exploiting cross-graph attention, we identify confidence scores for\nall potential registration correspondences, estimating the displacement between\npointcloud scans. Our pipeline enables introspective analysis of the model's\nperformance by correlating it with the individual contributions of local\nstructures in the environment, providing valuable insights into the system's\nbehaviour. We test our method on the KITTI odometry dataset, achieving\ncompetitive accuracy compared to benchmark methods and a higher track\nsmoothness while relying on significantly fewer network parameters.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:43:46 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Panagiotaki","Efimia",""],["De Martini","Daniele",""],["Pramatarov","Georgi",""],["Gadd","Matthew",""],["Kunze","Lars",""]]}
{"id":"2308.03719","submitter":"Sivanesan G","authors":"G. Sivanesan and C. Selvaraj","title":"Laplacian Eigen values of character degree graphs of solvable groups","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 group, let $Irr(G)$ be the set of all complex\nirreducible characters of $G$ and let $cd(G)$ be the set of all degrees of\ncharacters in $Irr(G).$ Let $\\rho(G)$ be the set of primes that divide degrees\nin $cd(G).$ The character degree graph $\\Delta(G)$ of $G$ is the simple\nundirected graph with vertex set $\\rho(G)$ and in which two distinct vertices\n$p$ and $q$ are adjacent if there exists a character degree $r \\in cd(G)$ such\nthat $r$ is divisible by the product $pq.$ In this paper, we obtain Laplacian\neigen values and distance Laplacian eigen values of regular character degree\ngraph, super graphs of regular character degree graph and character degree\ngraph with diameter $2$ has two blocks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:45:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Sivanesan","G.",""],["Selvaraj","C.",""]]}
{"id":"2308.03720","submitter":"Christopher Dodd","authors":"Christopher Dodd","title":"Witt Differential Operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a smooth scheme $X$ over a perfect field $k$ of positive characteristic,\nwe define (for each $m\\in\\mathbb{Z}$) a sheaf of rings\n$\\mathcal{\\widehat{D}}_{W(X)}^{(m)}$ of differential operators (of level $m$)\nover the Witt vectors of $X$. If $\\mathfrak{X}$ is a lift of $X$ to a smooth\nformal scheme over $W(k)$, then for $m\\geq0$ modules over\n$\\mathcal{\\widehat{D}}_{W(X)}^{(m)}$ are closely related to modules over\nBerthelot's ring $\\widehat{\\mathcal{D}}_{\\mathfrak{X}}^{(m)}$ of differential\noperators of level $m$ on $\\mathfrak{X}$. Our construction therefore gives an\ndescription of suitable categories of modules over these algebras, which\ndepends only on the special fibre $X$. There is an embedding of the category of\ncrystals on $X$ (over $W_{r}(k)$) into modules over\n$\\mathcal{\\widehat{D}}_{W(X)}^{(0)}/p^{r}$; and so we obtain an alternate\ndescription of this category as well. For a map $\\varphi:X\\to Y$ we develop the\nformalism of pullback and pushforward of\n$\\mathcal{\\widehat{D}}_{W(X)}^{(m)}$-modules and show all of the expected\nproperties. When working mod $p^{r}$, this includes compatibility with the\ncorresponding formalism for crystals, assuming $\\varphi$ is smooth. In this\ncase we also show that there is a ``relative de Rham Witt resolution''\n(analogous to the usual relative de Rham resolution in $\\mathcal{D}$-module\ntheory) and therefore that the pushforward of (a quite general subcategory of)\nmodules over $\\mathcal{\\widehat{D}}_{W(X)}^{(0)}/p^{r}$ can be computed via the\nreduction mod $p^{r}$ of Langer-Zink's relative de Rham Witt complex. Finally\nwe explain a generalization of Bloch's theorem relating integrable de Rham-Witt\nconnections to crystals.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:46:18 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dodd","Christopher",""]]}
{"id":"2308.03721","submitter":"Ilija Zeljkovic","authors":"Alexander LaFleur, Hong Li, Corey E. Frank, Muxian Xu, Siyu Cheng,\n  Ziqiang Wang, Nicholas P. Butch and Ilija Zeljkovic","title":"Inhomogeneous high temperature melting and decoupling of charge density\n  waves in spin-triplet superconductor UTe2","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":"  Periodic spatial modulations of the superfluid density, or pair density\nwaves, have now been widely detected in unconventional superconductors, either\nas the primary or the secondary states accompanying charge density waves.\nUnderstanding how these density waves emerge, or conversely get suppressed by\nexternal parameters, provides an important insight into their nature. Here we\nuse spectroscopic imaging scanning tunneling microscopy to study the evolution\nof density waves in the heavy fermion spin-triplet superconductor UTe2 as a\nfunction of temperature and magnetic field. We discover that charge\nmodulations, composed of three different wave vectors gradually weaken but\npersist to a surprisingly high temperature T_CDW ~ 10-12 K. By tracking the\nlocal amplitude of modulations, we find that these modulations become spatially\ninhomogeneous, and form patches that shrink in size with higher temperature or\nwith applied magnetic field. Interestingly, one of the density wave vectors\nalong the mirror symmetry has a slightly different temperature onset, thus\nrevealing an unexpected decoupling of the three-component CDW state.\nImportantly, T_CDW determined from our work matches closely to the temperature\nscale believed to be related to magnetic fluctuations, providing the first\npossible connection between density waves observed by surface probes and bulk\nmeasurements. Combined with magnetic field sensitivity of the modulations, this\ncould point towards an important role of spin fluctuations or short-range\nmagnetic order in the formation of the primary charge density wave.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:52:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["LaFleur","Alexander",""],["Li","Hong",""],["Frank","Corey E.",""],["Xu","Muxian",""],["Cheng","Siyu",""],["Wang","Ziqiang",""],["Butch","Nicholas P.",""],["Zeljkovic","Ilija",""]]}
{"id":"2308.03722","submitter":"Thanh Dung Le","authors":"Thanh-Dung Le","title":"GRN-Transformer: Enhancing Motion Artifact Detection in PICU\n  Photoplethysmogram Signals","comments":"Under preparation to submit to IEEE for possible publications","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This study investigates artifact detection in clinical photoplethysmogram\nsignals using Transformer-based models. Recent findings have shown that in\ndetecting artifacts from the Pediatric Critical Care Unit at CHU Sainte-Justine\n(CHUSJ), semi-supervised learning label propagation and conventional supervised\nmachine learning (K-nearest neighbors) outperform the Transformer-based\nattention mechanism, particularly in limited data scenarios. However, these\nmethods exhibit sensitivity to data volume and limited improvement with\nincreased data availability. We propose the GRN-Transformer, an innovative\nmodel that integrates the Gated Residual Network (GRN) into the Transformer\narchitecture to overcome these limitations. The GRN-Transformer demonstrates\nsuperior performance, achieving remarkable metrics of 98% accuracy, 90%\nprecision, 97% recall, and 93% F1 score, clearly surpassing the Transformer's\nresults of 95% accuracy, 85% precision, 86% recall, and 85% F1 score. By\nintegrating the GRN, which excels at feature extraction, with the Transformer's\nattention mechanism, the proposed GRN-Transformer overcomes the limitations of\nprevious methods. It achieves smoother training and validation loss,\neffectively mitigating overfitting and demonstrating enhanced performance in\nsmall datasets with imbalanced classes. The GRN-Transformer's potential impact\non artifact detection can significantly improve the reliability and accuracy of\nthe clinical decision support system at CHUSJ, ultimately leading to improved\npatient outcomes and safety. Remarkably, the proposed model stands as the\npioneer in its domain, being the first of its kind to detect artifacts from PPG\nsignals. Further research could explore its applicability to other medical\ndomains and datasets with similar constraints.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:54:52 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Le","Thanh-Dung",""]]}
{"id":"2308.03723","submitter":"McKell Woodland","authors":"McKell Woodland, Nihil Patel, Mais Al Taie, Joshua P. Yung, Tucker J.\n  Netherton, Ankit B. Patel, and Kristy K. Brock","title":"Dimensionality Reduction for Improving Out-of-Distribution Detection in\n  Medical Image Segmentation","comments":"This preprint has not undergone peer review or any post-submission\n  improvements or corrections. The Version of Record of this contribution will\n  be published in the Proceedings of Uncertainty for Safe Utilization of\n  Machine Learning in Medical Imaging (5th International Workshop) - Held in\n  conjunction with MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Clinically deployed segmentation models are known to fail on data outside of\ntheir training distribution. As these models perform well on most cases, it is\nimperative to detect out-of-distribution (OOD) images at inference to protect\nagainst automation bias. This work applies the Mahalanobis distance post hoc to\nthe bottleneck features of a Swin UNETR model that segments the liver on\nT1-weighted magnetic resonance imaging. By reducing the dimensions of the\nbottleneck features with principal component analysis, OOD images were detected\nwith high performance and minimal computational load.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:58:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Woodland","McKell",""],["Patel","Nihil",""],["Taie","Mais Al",""],["Yung","Joshua P.",""],["Netherton","Tucker J.",""],["Patel","Ankit B.",""],["Brock","Kristy K.",""]]}
{"id":"2308.03724","submitter":"Xin Wang","authors":"Stephen F. King, Rishav Roshan, Xin Wang, Graham White, Masahito\n  Yamazaki","title":"Quantum Gravity Effects on Dark Matter and Gravitational Waves","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore how quantum gravity effects, manifested through the breaking of\ndiscrete symmetry responsible for both Dark Matter and Domain Walls, can have\nobservational effects through CMB observations and gravitational waves. To\nillustrate the idea we consider a simple model with two scalar fields and two\n$\\mathcal{Z}_2$ symmetries, one being responsible for Dark Matter stability,\nand the other spontaneously broken and responsible for Domain Walls, where both\nsymmetries are assumed to be explicitly broken by quantum gravity effects. We\nshow the recent gravitational wave spectrum observed by several pulsar timing\narray projects can help constrain such effects.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:00:32 GMT"}],"update_date":"2023-08-08","authors_parsed":[["King","Stephen F.",""],["Roshan","Rishav",""],["Wang","Xin",""],["White","Graham",""],["Yamazaki","Masahito",""]]}
{"id":"2308.03725","submitter":"Renjie Liang","authors":"Renjie Liang, Yiming Yang, Hui Lu, Li Li","title":"Efficient Temporal Sentence Grounding in Videos with Multi-Teacher\n  Knowledge Distillation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Temporal Sentence Grounding in Videos (TSGV) aims to detect the event\ntimestamps described by the natural language query from untrimmed videos. This\npaper discusses the challenge of achieving efficient computation in TSGV models\nwhile maintaining high performance. Most existing approaches exquisitely design\ncomplex architectures to improve accuracy with extra layers and loss, suffering\nfrom inefficiency and heaviness. Although some works have noticed that, they\nonly make an issue of feature fusion layers, which can hardly enjoy the\nhighspeed merit in the whole clunky network. To tackle this problem, we propose\na novel efficient multi-teacher model (EMTM) based on knowledge distillation to\ntransfer diverse knowledge from both heterogeneous and isomorphic networks.\nSpecifically, We first unify different outputs of the heterogeneous models into\none single form. Next, a Knowledge Aggregation Unit (KAU) is built to acquire\nhigh-quality integrated soft labels from multiple teachers. After that, the KAU\nmodule leverages the multi-scale video and global query information to\nadaptively determine the weights of different teachers. A Shared Encoder\nstrategy is then proposed to solve the problem that the student shallow layers\nhardly benefit from teachers, in which an isomorphic teacher is collaboratively\ntrained with the student to align their hidden states. Extensive experimental\nresults on three popular TSGV benchmarks demonstrate that our method is both\neffective and efficient without bells and whistles.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:07:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liang","Renjie",""],["Yang","Yiming",""],["Lu","Hui",""],["Li","Li",""]]}
{"id":"2308.03726","submitter":"Jay Paranjape","authors":"Jay N. Paranjape, Nithin Gopalakrishnan Nair, Shameema Sikder, S.\n  Swaroop Vedula, Vishal M. Patel","title":"AdaptiveSAM: Towards Efficient Tuning of SAM for Surgical Scene\n  Segmentation","comments":"10 pages, 6 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Segmentation is a fundamental problem in surgical scene analysis using\nartificial intelligence. However, the inherent data scarcity in this domain\nmakes it challenging to adapt traditional segmentation techniques for this\ntask. To tackle this issue, current research employs pretrained models and\nfinetunes them on the given data. Even so, these require training deep networks\nwith millions of parameters every time new data becomes available. A recently\npublished foundation model, Segment-Anything (SAM), generalizes well to a large\nvariety of natural images, hence tackling this challenge to a reasonable\nextent. However, SAM does not generalize well to the medical domain as is\nwithout utilizing a large amount of compute resources for fine-tuning and using\ntask-specific prompts. Moreover, these prompts are in the form of\nbounding-boxes or foreground/background points that need to be annotated\nexplicitly for every image, making this solution increasingly tedious with\nhigher data size. In this work, we propose AdaptiveSAM - an adaptive\nmodification of SAM that can adjust to new datasets quickly and efficiently,\nwhile enabling text-prompted segmentation. For finetuning AdaptiveSAM, we\npropose an approach called bias-tuning that requires a significantly smaller\nnumber of trainable parameters than SAM (less than 2\\%). At the same time,\nAdaptiveSAM requires negligible expert intervention since it uses free-form\ntext as prompt and can segment the object of interest with just the label name\nas prompt. Our experiments show that AdaptiveSAM outperforms current\nstate-of-the-art methods on various medical imaging datasets including surgery,\nultrasound and X-ray. Code is available at\nhttps://github.com/JayParanjape/biastuning\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:12:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Paranjape","Jay N.",""],["Nair","Nithin Gopalakrishnan",""],["Sikder","Shameema",""],["Vedula","S. Swaroop",""],["Patel","Vishal M.",""]]}
{"id":"2308.03727","submitter":"Shiliang Zhang","authors":"Xuehui Ma, Shiliang Zhang, Yushuai Li, Fucai Qian, Tingwen Huang","title":"Adaptive robust tracking control with active learning for linear systems\n  with ellipsoidal bounded uncertainties","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 is concerned with the robust tracking control of linear uncertain\nsystems, whose unknown system parameters and disturbances are bounded within\nellipsoidal sets. We propose an adaptive robust control that can actively learn\nthe ellipsoid sets. Particularly, the proposed approach utilizes the recursive\nset-membership state estimation in learning the ellipsoidal sets, aiming at\nmitigating uncertainties in the system control. Upon the learned sets\nrepresenting the recognized uncertainties, we construct a robust control with\none-step prediction for system output tracking. In deriving an optimized\ncontrol law, we reformulate the optimization objective into a second-order cone\nprogramming problem that can be solved in a computationally friendly way. To\nfurther stimulate the active learning of uncertainties over the control\nprocedures, we enrich the information used for the learning by maximizing the\nvolume of the ellipsoid set, supposed to lead to increased learning accuracy\nand accelerated uncertainty reduction. To verify our approach, we conduct\nnumerical simulations to compare the fixed-ellipsoidal-set robust control with\nours, and investigate the positive effect of the designed active learning in\nthe uncertain system control process.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:13:43 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Ma","Xuehui",""],["Zhang","Shiliang",""],["Li","Yushuai",""],["Qian","Fucai",""],["Huang","Tingwen",""]]}
{"id":"2308.03728","submitter":"Gregory J. Galloway","authors":"Gregory J. Galloway","title":"Remarks on the size of apparent horizons","comments":"10 pages. v2: minor changes/corrections, reference added","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Marginally outer trapped surfaces (also referred to as apparent horizons)\nthat are stable in 3-dimensional initial data sets obeying the dominant energy\ncondition strictly are known to satisfy an area bound. The main purpose of this\nnote is to show (in several ways) that such surfaces also satisfy a diameter\nbound.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:17:04 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 13:07:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Galloway","Gregory J.",""]]}
{"id":"2308.03729","submitter":"Wenqi Shao","authors":"Wenqi Shao, Yutao Hu, Peng Gao, Meng Lei, Kaipeng Zhang, Fanqing Meng,\n  Peng Xu, Siyuan Huang, Hongsheng Li, Yu Qiao, Ping Luo","title":"Tiny LVLM-eHub: Early Multimodal Experiments with Bard","comments":"24 pages, 24 figures, 7 Tables. Project Page:\n  http://lvlm-ehub.opengvlab.com/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in Large Vision-Language Models (LVLMs) have demonstrated\nsignificant progress in tackling complex multimodal tasks. Among these\ncutting-edge developments, Google's Bard stands out for its remarkable\nmultimodal capabilities, promoting comprehensive comprehension and reasoning\nacross various domains. This work presents an early and holistic evaluation of\nLVLMs' multimodal abilities, with a particular focus on Bard, by proposing a\nlightweight variant of LVLM-eHub, named Tiny LVLM-eHub. In comparison to the\nvanilla version, Tiny LVLM-eHub possesses several appealing properties.\nFirstly, it provides a systematic assessment of six categories of multimodal\ncapabilities, including visual perception, visual knowledge acquisition, visual\nreasoning, visual commonsense, object hallucination, and embodied intelligence,\nthrough quantitative evaluation of $42$ standard text-related visual\nbenchmarks. Secondly, it conducts an in-depth analysis of LVLMs' predictions\nusing the ChatGPT Ensemble Evaluation (CEE), which leads to a robust and\naccurate evaluation and exhibits improved alignment with human evaluation\ncompared to the word matching approach. Thirdly, it comprises a mere $2.1$K\nimage-text pairs, facilitating ease of use for practitioners to evaluate their\nown offline LVLMs. Through extensive experimental analysis, this study\ndemonstrates that Bard outperforms previous LVLMs in most multimodal\ncapabilities except object hallucination, to which Bard is still susceptible.\nTiny LVLM-eHub serves as a baseline evaluation for various LVLMs and encourages\ninnovative strategies aimed at advancing multimodal techniques. Our project is\npublicly available at \\url{https://github.com/OpenGVLab/Multi-Modality-Arena}.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:17:05 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shao","Wenqi",""],["Hu","Yutao",""],["Gao","Peng",""],["Lei","Meng",""],["Zhang","Kaipeng",""],["Meng","Fanqing",""],["Xu","Peng",""],["Huang","Siyuan",""],["Li","Hongsheng",""],["Qiao","Yu",""],["Luo","Ping",""]]}
{"id":"2308.03730","submitter":"Lev Utkin","authors":"Lev V. Utkin and Danila Y. Eremenko and Andrei V. Konstantinov","title":"SurvBeX: An explanation method of the machine learning survival models\n  based on the Beran estimator","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":"  An explanation method called SurvBeX is proposed to interpret predictions of\nthe machine learning survival black-box models. The main idea behind the method\nis to use the modified Beran estimator as the surrogate explanation model.\nCoefficients, incorporated into Beran estimator, can be regarded as values of\nthe feature impacts on the black-box model prediction. Following the well-known\nLIME method, many points are generated in a local area around an example of\ninterest. For every generated example, the survival function of the black-box\nmodel is computed, and the survival function of the surrogate model (the Beran\nestimator) is constructed as a function of the explanation coefficients. In\norder to find the explanation coefficients, it is proposed to minimize the mean\ndistance between the survival functions of the black-box model and the Beran\nestimator produced by the generated examples. Many numerical experiments with\nsynthetic and real survival data demonstrate the SurvBeX efficiency and compare\nthe method with the well-known method SurvLIME. The method is also compared\nwith the method SurvSHAP. The code implementing SurvBeX is available at:\nhttps://github.com/DanilaEremenko/SurvBeX\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:18:37 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Utkin","Lev V.",""],["Eremenko","Danila Y.",""],["Konstantinov","Andrei V.",""]]}
{"id":"2308.03731","submitter":"Iskander A. Taimanov","authors":"Y. A. Kordyukov, I.A. Taimanov","title":"Quasi-classical approximation of monopole harmonics","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":"  Using the generalization of the multidimensional WKB method to magnetic\nLaplacians corresponding to monopoles, which we proposed earlier, we obtain\nexplicit formulas for quasi-classical approximations of eigenfunctions for the\nDirac monopole.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:22:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kordyukov","Y. A.",""],["Taimanov","I. A.",""]]}
{"id":"2308.03732","submitter":"Iskander A. Taimanov","authors":"A.E. Mironov, A. Senninger, I.A. Taimanov","title":"Orthogonal curvilinear coordinate systems and torsion-free sheaves over\n  reducible spectral curves","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The methods of finite-gap integration are used to construct orthogonal\ncurvilinear coordinate systems in the Euclidean space corresponding to sheaves\nof rank one without torsion over reducible singular spectral curves.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:27:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Mironov","A. E.",""],["Senninger","A.",""],["Taimanov","I. A.",""]]}
{"id":"2308.03733","submitter":"Valeria Pastushenko","authors":"A. D. Kodukhov, V. A. Pastushenko, N. S. Kirsanov, D. A. Kronberg, M.\n  Pflitsch, and V. M. Vinokur","title":"Boosting quantum key distribution via the end-to-end loss control","comments":null,"journal-ref":"Cryptography 7, 38 (2023)","doi":"10.3390/cryptography7030038","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rise of quantum technologies, data security increasingly relies on\nquantum cryptography and its most notable application, quantum key distribution\n(QKD). Yet, current technological limitations, in particular, the\nunavailability of quantum repeaters, cause relatively low key distribution\nrates in practical QKD implementations. Here, we demonstrate a remarkable\nimprovement in the QKD performance using end-to-end line tomography for the\nwide class of relevant protocols. Our approach is based on the real-time\ndetection of interventions in the transmission channel, enabling an adaptive\nresponse that modifies the QKD setup and post-processing parameters, leading,\nthereby, to a substantial increase in the key distribution rates. Our findings\nprovide everlastingly secure efficient quantum cryptography deployment\npotentially overcoming the repeaterless rate-distance limit.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:32:14 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Kodukhov","A. D.",""],["Pastushenko","V. A.",""],["Kirsanov","N. S.",""],["Kronberg","D. A.",""],["Pflitsch","M.",""],["Vinokur","V. M.",""]]}
{"id":"2308.03734","submitter":"Yixiang Yao","authors":"Yixiang Yao, Weizhao Jin, Srivatsan Ravi","title":"Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity\n  Resolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The entity resolution problem requires finding pairs across datasets that\nbelong to different owners but refer to the same entity in the real world. To\ntrain and evaluate solutions (either rule-based or machine-learning-based) to\nthe entity resolution problem, generating a ground truth dataset with entity\npairs or clusters is needed. However, such a data annotation process involves\nhumans as domain oracles to review the plaintext data for all candidate record\npairs from different parties, which inevitably infringes the privacy of data\nowners, especially in privacy-sensitive cases like medical records. To the best\nof our knowledge, there is no prior work on privacy-preserving ground truth\ndataset generation, especially in the domain of entity resolution. We propose a\nnovel blind annotation protocol based on homomorphic encryption that allows\ndomain oracles to collaboratively label ground truths without sharing data in\nplaintext with other parties. In addition, we design a domain-specific\neasy-to-use language that hides the sophisticated underlying homomorphic\nencryption layer. Rigorous proof of the privacy guarantee is provided and our\nempirical experiments via an annotation simulator indicate the feasibility of\nour privacy-preserving protocol (f-measure on average achieves more than 90\\%\ncompared with the real ground truths).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:32:33 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Yao","Yixiang",""],["Jin","Weizhao",""],["Ravi","Srivatsan",""]]}
{"id":"2308.03735","submitter":"Allegra Laro","authors":"Allegra Laro, Yanqing Chen, Hao He, Babak Aghazadeh","title":"Randomized algorithms for precise measurement of differentially-private,\n  personalized recommendations","comments":"Submitted to AAAI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Personalized recommendations form an important part of today's internet\necosystem, helping artists and creators to reach interested users, and helping\nusers to discover new and engaging content. However, many users today are\nskeptical of platforms that personalize recommendations, in part due to\nhistorically careless treatment of personal data and data privacy. Now,\nbusinesses that rely on personalized recommendations are entering a new\nparadigm, where many of their systems must be overhauled to be privacy-first.\nIn this article, we propose an algorithm for personalized recommendations that\nfacilitates both precise and differentially-private measurement. We consider\nadvertising as an example application, and conduct offline experiments to\nquantify how the proposed privacy-preserving algorithm affects key metrics\nrelated to user experience, advertiser value, and platform revenue compared to\nthe extremes of both (private) non-personalized and non-private, personalized\nimplementations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:34:58 GMT"},{"version":"v2","created":"Tue, 8 Aug 2023 16:20:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Laro","Allegra",""],["Chen","Yanqing",""],["He","Hao",""],["Aghazadeh","Babak",""]]}
{"id":"2308.03736","submitter":"Iskander A. Taimanov","authors":"Iskander A. Taimanov","title":"On the formality problem for manifolds with special holonomy","comments":"16 pages","journal-ref":"Filomat 37:25 (2023), 8709-8718","doi":"10.2298/FIL2325709T","report-no":null,"categories":"math.DG math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In sections 1 and 2 we follow our online talk at the 21st Geometrical Seminar\n(Beograd, Serbia) on June 30, 2022 by giving a survey of the formality problem\nfor manifold with special holonomy and exposing recent results by M. Amann and\nthe author on the formality of Joyce's examples of G_2-manifolds. In section 3\nwe expose the approach to establishing the formality by using the intersection\nMassey products.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:36:12 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Taimanov","Iskander A.",""]]}
{"id":"2308.03737","submitter":"Koki Otaki","authors":"Koki Otaki and Masao Mori","title":"Frequency of the dark matter subhalo collisions and bifurcation sequence\n  arising formation of dwarf galaxies","comments":"21 pages, 15 figures. Accepted for publication in 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":"  The cold dark matter (CDM) model predicts galaxies have 100 times more dark\nmatter mass than stars. Nevertheless, recent observations report the existence\nof dark-matter-deficient galaxies with less dark matter than expected. To solve\nthis problem, we investigate the physical processes of galaxy formation in\nhead-on collisions between gas-containing dark matter subhaloes (DMSHs).\nAnalytical estimation of the collision frequency between DMSHs associated with\na massive host halo indicates that collisions frequently occur within 1/10th of\nthe virial radius of the host halo, with a collision timescale of about 10 Myr,\nand the most frequent relative velocity increases with increasing radius. Using\nanalytical models and numerical simulations, we show the bifurcation channel of\nthe formation of dark-matter-dominated and dark-matter-deficient galaxies. In\nthe case of low-velocity collisions, a dark-matter-dominated galaxy is formed\nby the merging of two DMSHs. In the case of moderate-velocity collisions, the\ntwo DMSHs penetrate each other. However the gas medium collides, and star\nformation begins as the gas density increases, forming a dwarf galaxy without\ndark matter at the collision surface. In the case of high-velocity collisions,\nshock-breakout occurs due to the shock waves generated at the collision surface\nreaching the gas surface, and no galaxy forms. For example, the simulation\ndemonstrates that a pair of DMSHs with a mass of 10^9 Msun containing gas of\n0.1 solar metallicity forms a dark-matter-deficient galaxy with a stellar mass\nof 10^7 Msun for a relative velocity of 200 km/s.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:36:34 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Otaki","Koki",""],["Mori","Masao",""]]}
{"id":"2308.03738","submitter":"Roberto Menezes","authors":"I. Andrade and R. Menezes","title":"Kinks in cuscuton-like models with two scalar fields","comments":"9 pages, 6 figures. To appear in EPJC","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This work deals with the presence of localized structures in relativistic\nsystems described by two real scalar fields in two-dimensional spacetime. We\nconsider the usual two-field model with the inclusion of the cuscuton term,\nwhich couples the fields regardless the potential. First we follow the steps of\nprevious work to show that the system supports a first-order framework,\nallowing us to obtain the energy of solutions without knowing their explicit\nform. The cuscuton term brings versatility into the first-order equations,\nwhich gives rise to interesting modifications in the profiles of topological\nconfigurations, such as the smooth control over their slope and the internal\nstructure of the energy density.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:36:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Andrade","I.",""],["Menezes","R.",""]]}
{"id":"2308.03739","submitter":"Pierre-Henri Chavanis","authors":"P.H. Chavanis, J. Sopik, C. Sire","title":"Phase transitions in self-gravitating systems and bacterial populations\n  surrounding a central body","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the nature of phase transitions in a self-gravitating classical gas\nin the presence of a central body. The central body can mimic a black hole at\nthe center of a galaxy or a rocky core (protoplanet) in the context of\nplanetary formation. In the chemotaxis of bacterial populations, sharing formal\nanalogies with self-gravitating systems, the central body can be a supply of\n``food'' (chemoattractant). We consider both microcanonical (fixed energy) and\ncanonical (fixed temperature) descriptions and study the inequivalence of\nstatistical ensembles. At high energies (resp. high temperatures), the system\nis in a ``gaseous'' phase and at low energies (resp. low temperatures) it is in\na condensed phase with a ``cusp-halo'' structure, where the cusp corresponds to\nthe rapid increase of the density of the gas at the contact with the central\nbody. For a fixed density $\\rho_{*}$ of the central body, we show the existence\nof two critical points in the phase diagram, one in each ensemble, depending on\nthe core radius $R_{*}$: for small radii $R_{*}<R_{*}^{\\rm MCP}$, there exist\nboth microcanonical and canonical phase transitions (that are zeroth and first\norder); for intermediate radii $R_{*}^{\\rm MCP}<R_{*}<R_{*}^{\\rm CCP}$, only\ncanonical phase transitions are present; and for large radii $R_{*}>R_{*}^{\\rm\nCCP}$, there is no phase transition at all. We study how the nature of these\nphase transitions changes as a function of the dimension of space. We also\ndiscuss the analogies and the differences with phase transitions in the\nself-gravitating Fermi gas [P.H. Chavanis, Phys. Rev. E 65, 056123 (2002)].\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:38:19 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Chavanis","P. H.",""],["Sopik","J.",""],["Sire","C.",""]]}
{"id":"2308.03740","submitter":"Micah Musser","authors":"Micah Musser","title":"A Cost Analysis of Generative Language Models and Influence Operations","comments":"21 pages, 5 figures; associated GitHub repository available at\n  https://github.com/georgetown-cset/disinfo-costs","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite speculation that recent large language models (LLMs) are likely to be\nused maliciously to improve the quality or scale of influence operations,\nuncertainty persists regarding the economic value that LLMs offer\npropagandists. This research constructs a model of costs facing propagandists\nfor content generation at scale and analyzes (1) the potential savings that\nLLMs could offer propagandists, (2) the potential deterrent effect of\nmonitoring controls on API-accessible LLMs, and (3) the optimal strategy for\npropagandists choosing between multiple private and/or open source LLMs when\nconducting influence operations. Primary results suggest that LLMs need only\nproduce usable outputs with relatively low reliability (roughly 25%) to offer\ncost savings to propagandists, that the potential reduction in content\ngeneration costs can be quite high (up to 70% for a highly reliable model), and\nthat monitoring capabilities have sharply limited cost imposition effects when\nalternative open source models are available. In addition, these results\nsuggest that nation-states -- even those conducting many large-scale influence\noperations per year -- are unlikely to benefit economically from training\ncustom LLMs specifically for use in influence operations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:38:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Musser","Micah",""]]}
{"id":"2308.03741","submitter":"Muhammad Bilal Shaikh","authors":"Muhammad Bilal Shaikh, Douglas Chai, Syed Mohammed Shamsul Islam and\n  Naveed Akhtar","title":"MAiVAR-T: Multimodal Audio-image and Video Action Recognizer using\n  Transformers","comments":"6 pages, 7 figures, 4 tables, Peer reviewed, Accepted @ The 11th\n  European Workshop on Visual Information Processing (EUVIP) will be held on\n  11th-14th September 2023, in Gj{\\o}vik, Norway. arXiv admin note: text\n  overlap with arXiv:2103.15691 by other authors","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":"  In line with the human capacity to perceive the world by simultaneously\nprocessing and integrating high-dimensional inputs from multiple modalities\nlike vision and audio, we propose a novel model, MAiVAR-T (Multimodal\nAudio-Image to Video Action Recognition Transformer). This model employs an\nintuitive approach for the combination of audio-image and video modalities,\nwith a primary aim to escalate the effectiveness of multimodal human action\nrecognition (MHAR). At the core of MAiVAR-T lies the significance of distilling\nsubstantial representations from the audio modality and transmuting these into\nthe image domain. Subsequently, this audio-image depiction is fused with the\nvideo modality to formulate a unified representation. This concerted approach\nstrives to exploit the contextual richness inherent in both audio and video\nmodalities, thereby promoting action recognition. In contrast to existing\nstate-of-the-art strategies that focus solely on audio or video modalities,\nMAiVAR-T demonstrates superior performance. Our extensive empirical evaluations\nconducted on a benchmark action recognition dataset corroborate the model's\nremarkable performance. This underscores the potential enhancements derived\nfrom integrating audio and video modalities for action recognition purposes.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 11:00:25 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Shaikh","Muhammad Bilal",""],["Chai","Douglas",""],["Islam","Syed Mohammed Shamsul",""],["Akhtar","Naveed",""]]}
{"id":"2308.03742","submitter":"P\\'al Zs\\'amboki","authors":"Dalma Galambos and P\\'al Zs\\'amboki","title":"What about translation? New coding system for content analysis on the\n  perception of literary translation around the political transformation in\n  1989 in Hungary as a classification problem on an unbalanced dataset","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  To track trends in the perception of literary translation around the\npolitical transformation in 1989 in Hungary, a coding system was developed on\nthe paragraphs of the 1980-1999 issues of the literary journal Alf\\\"old. This\npaper describes how we trained BERT models to carry over the coding system to\nthe 1980-1999 issues of the literary journal Nagyvil\\'ag. We use extensive\nhyperparameter tuning, loss functions robust to label unbalance, 10-fold\ncross-validation for precise evaluations and a model ensemble for prediction,\nmanual validation on the predict set, a new calibration method to better\npredict label counts for sections of the Nagyvil\\'ag corpus, and to study the\nrelations between labels, we construct label relation networks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:46:49 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Galambos","Dalma",""],["Zs\u00e1mboki","P\u00e1l",""]]}
{"id":"2308.03743","submitter":"Aur\\'elien Decelle","authors":"Giovanni Catania, Aur\\'elien Decelle, and Beatriz Seoane","title":"The Copycat Perceptron: Smashing Barriers Through Collective Learning","comments":"4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We characterize the equilibrium properties of a model of $y$ coupled binary\nperceptrons in the teacher-student scenario, subject to a suitable learning\nrule, with an explicit ferromagnetic coupling proportional to the Hamming\ndistance between the students' weights. In contrast to recent works, we analyze\na more general setting in which a thermal noise is present that affects the\ngeneralization performance of each student. Specifically, in the presence of a\nnonzero temperature, which assigns nonzero probability to configurations that\nmisclassify samples with respect to the teacher's prescription, we find that\nthe coupling of replicas leads to a shift of the phase diagram to smaller\nvalues of $\\alpha$: This suggests that the free energy landscape gets smoother\naround the solution with good generalization (i.e., the teacher) at a fixed\nfraction of reviewed examples, which allows local update algorithms such as\nSimulated Annealing to reach the solution before the dynamics gets frozen.\nFinally, from a learning perspective, these results suggest that more students\n(in this case, with the same amount of data) are able to learn the same rule\nwhen coupled together with a smaller amount of data.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:51:09 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Catania","Giovanni",""],["Decelle","Aur\u00e9lien",""],["Seoane","Beatriz",""]]}
{"id":"2308.03744","submitter":"Roman Popovych","authors":"Oleksandra O. Vinnichenko, Vyacheslav M. Boyko and Roman O. Popovych","title":"Lie reductions and exact solutions of dispersionless Nizhnik equation","comments":"41 pages, 1 table, application of results of arXiv:2211.09759","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We exhaustively classify the Lie reductions of the real dispersionless\nNizhnik equation to partial differential equations in two independent variables\nand to ordinary differential equations. Lie and point symmetries of reduced\nequations are comprehensively studied, including the analysis of which of them\ncorrespond to hidden symmetries of the original equation. If necessary,\nassociated Lie reductions of a nonlinear Lax representation of the\ndispersionless Nizhnik equation are carried out as well. As a result, we\nconstruct wide families of new invariant solutions of this equation in explicit\nform in terms of elementary, Lambert and hypergeometric functions as well as in\nparametric or implicit form. We show that Lie reductions to algebraic equations\nlead to no new solutions of this equation in addition to the constructed ones.\nMultiplicative separation of variables is used for illustrative construction of\nnon-invariant solutions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:51:54 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Vinnichenko","Oleksandra O.",""],["Boyko","Vyacheslav M.",""],["Popovych","Roman O.",""]]}
{"id":"2308.03745","submitter":"Bingjie Wang","authors":"Bingjie Wang, Seiji Fujimoto, Ivo Labbe, Lukas J. Furtak, Tim B.\n  Miller, David J. Setton, Adi Zitrin, Hakim Atek, Rachel Bezanson, Gabriel\n  Brammer, Joel Leja, Pascal A. Oesch, Sedona H. Price, Iryna Chemerynska, Sam\n  E. Cutler, Pratika Dayal, Pieter van Dokkum, Andy D. Goulding, Jenny E.\n  Greene, Y. Fudamoto, Gourav Khullar, Vasily Kokorev, Danilo Marchesini,\n  Richard Pan, John R. Weaver, Katherine E. Whitaker, Christina C. Williams","title":"UNCOVER: Illuminating the Early Universe -- JWST/NIRSpec Confirmation of\n  $z > 12$ Galaxies","comments":"submitted to ApJL; 13 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Observations of high-redshift galaxies provide a critical direct test to the\ntheories of early galaxy formation, yet to date, only four have been\nspectroscopically confirmed at $z>12$. Due to strong gravitational lensing over\na wide area, the galaxy cluster field Abell~2744 is ideal for searching for the\nearliest galaxies. Here we present JWST/NIRSpec observations of two galaxies: a\nrobust detection at $z_{\\rm spec} = 12.393^{+0.004}_{-0.001}$, and a plausible\ncandidate at $z_{\\rm spec} = 13.079^{+0.013}_{-0.001}$. The galaxies are\ndiscovered in JWST/NIRCam imaging and their distances are inferred with\nJWST/NIRSpec spectroscopy, all from the JWST Cycle 1 UNCOVER Treasury survey.\nDetailed stellar population modeling using JWST NIRCam and NIRSpec data\ncorroborates the primeval characteristics of these galaxies: low mass ($\\sim\n10^8~{\\rm M_\\odot}$), young, rapidly-assembling, metal-poor, and star-forming.\nInterestingly, both galaxies are spatially resolved, having lensing-corrected\nrest-UV effective radii on the order of 300-400 pc, which are notably larger\nthan other spectroscopically confirmed $z \\gtrsim 12$ systems. The observed\ndynamic range of $z \\gtrsim 12$ size spans over an order of magnitude, implying\na significant scatter in the size-mass relation at early times. Deep into the\nepoch of reionization, these discoveries elucidate the emergence of the first\ngalaxies.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:52:11 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 12:37:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Bingjie",""],["Fujimoto","Seiji",""],["Labbe","Ivo",""],["Furtak","Lukas J.",""],["Miller","Tim B.",""],["Setton","David J.",""],["Zitrin","Adi",""],["Atek","Hakim",""],["Bezanson","Rachel",""],["Brammer","Gabriel",""],["Leja","Joel",""],["Oesch","Pascal A.",""],["Price","Sedona H.",""],["Chemerynska","Iryna",""],["Cutler","Sam E.",""],["Dayal","Pratika",""],["van Dokkum","Pieter",""],["Goulding","Andy D.",""],["Greene","Jenny E.",""],["Fudamoto","Y.",""],["Khullar","Gourav",""],["Kokorev","Vasily",""],["Marchesini","Danilo",""],["Pan","Richard",""],["Weaver","John R.",""],["Whitaker","Katherine E.",""],["Williams","Christina C.",""]]}
{"id":"2308.03746","submitter":"Rohit Dokara","authors":"Rohit Dokara, Nirupam Roy, Karl Menten, Sarita Vig, Prasun Dutta,\n  Henrik Beuther, Jagadheep D. Pandian, Michael Rugel, Md Rashid, Andreas\n  Brunthaler","title":"Metrewave Galactic Plane with the uGMRT (MeGaPluG) Survey: Lessons from\n  the Pilot Study","comments":"To be published in A&A. 13 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Context. The advent of wide-band receiver systems on interferometer arrays\nenables one to undertake high-sensitivity and high-resolution radio continuum\nsurveys of the Galactic plane in a reasonable amount of telescope time.\nHowever, to date, there are only a few such studies of the first quadrant of\nthe Milky Way that have been carried out at frequencies below 1 GHz. The Giant\nMetrewave Radio Telescope (GMRT) has recently upgraded its receivers with\nwide-band capabilities (now called the uGMRT) and provides a good opportunity\nto conduct high resolution surveys, while also being sensitive to the extended\nstructures.\n  Aims. We wish to assess the feasibility of conducting a large-scale snapshot\nsurvey, the Metrewave Galactic Plane with the uGMRT Survey (MeGaPluG), to\nsimultaneously map extended sources and compact objects at an angular\nresolution lower than $10''$ and a point source sensitivity of 0.15 mJy/beam.\n  Methods. We performed an unbiased survey of a small portion of the Galactic\nplane, covering the W43/W44 regions ($l=29^\\circ-35^\\circ$ and $|b|<1^\\circ$)\nin two frequency bands: 300$-$500 MHz and 550$-$750 MHz. The 200 MHz wide-band\nreceivers on the uGMRT are employed to observe the target field in several\npointings, spending nearly 14 minutes on each pointing in two separate scans.\nWe developed an automated pipeline for the calibration, and a semi-automated\nself-calibration procedure is used to image each pointing using multi-scale\nCLEAN and outlier fields.\n  Results. We produced continuum mosaics of the surveyed region at a final\ncommon resolution of $25''$ in the two bands that have central frequencies of\n400 MHz and 650 MHz, with a point source sensitivity better than 5 mJy/beam. We\nplan to cover a larger footprint of the Galactic plane in the near future based\non the lessons learnt from this study. (Abridged)\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:52:41 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Dokara","Rohit",""],["Roy","Nirupam",""],["Menten","Karl",""],["Vig","Sarita",""],["Dutta","Prasun",""],["Beuther","Henrik",""],["Pandian","Jagadheep D.",""],["Rugel","Michael",""],["Rashid","Md",""],["Brunthaler","Andreas",""]]}
{"id":"2308.03747","submitter":"Zhanhao Liang","authors":"Zhanhao Liang, Yuhui Yuan","title":"Mask Frozen-DETR: High Quality Instance Segmentation with One GPU","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 aim to study how to build a strong instance segmenter with\nminimal training time and GPUs, as opposed to the majority of current\napproaches that pursue more accurate instance segmenter by building more\nadvanced frameworks at the cost of longer training time and higher GPU\nrequirements. To achieve this, we introduce a simple and general framework,\ntermed Mask Frozen-DETR, which can convert any existing DETR-based object\ndetection model into a powerful instance segmentation model. Our method only\nrequires training an additional lightweight mask network that predicts instance\nmasks within the bounding boxes given by a frozen DETR-based object detector.\nRemarkably, our method outperforms the state-of-the-art instance segmentation\nmethod Mask DINO in terms of performance on the COCO test-dev split (55.3% vs.\n54.7%) while being over 10X times faster to train. Furthermore, all of our\nexperiments can be trained using only one Tesla V100 GPU with 16 GB of memory,\ndemonstrating the significant efficiency of our proposed framework.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:53:21 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Liang","Zhanhao",""],["Yuan","Yuhui",""]]}
{"id":"2308.03748","submitter":"Stijn Cambie","authors":"Stijn Cambie, Jun Gao, Younjin Kim, Hong Liu","title":"The Erd\\H{o}s distinct subset sums problem in a modular setting","comments":"12 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the following variant of the Erd\\H{o}s distinct subset sums problem.\n  Given $t \\ge 0$ and sufficiently large $n$, every $n$-element set $A$ whose\nsubset sums are distinct modulo $N=2^n+t$ satisfies\n  $$\\max A \\ge \\Big(\\frac{1}{3}-o(1)\\Big)N.$$\n  Furthermore, we provide examples showing that the constant $\\frac 13$ is best\npossible. For small values of $t$, we characterise the structure of all\nsumset-distinct sets modulo $N=2^n+t$ of cardinality $n$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:53:51 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Cambie","Stijn",""],["Gao","Jun",""],["Kim","Younjin",""],["Liu","Hong",""]]}
{"id":"2308.03749","submitter":"Alice C. Quillen","authors":"Danielle Bovie, A. C. Quillen, Rachel Glade","title":"Rearrangement of Granular Surfaces on Asteroids due to Thermal Cycling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP cond-mat.soft physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In granular systems, thermal cycling causes compaction, creep, penetration of\ndense objects, and ratcheting of grains against each other. On asteroid\nsurfaces, thermal cycling is high amplitude and can happen billions of times in\na few million years. We use a 1-dimensional thermophysical conductivity model\nto estimate the relative displacement of grains in proximity to one another,\ncaused by variations in thermal conductivity or shadows. We find that grains\nwould experience relative displacements of order a few microns during each\nthermal cycle. If thermal cycling causes diffusive transport, then the\nasteroid's few centimeters deep thermal skin depth could flow a few centimeters\nin a million years. Thermal cycling could cause long-distance flows on sloped\nsurfaces, allowing fine materials to collect in depressions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:54:13 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bovie","Danielle",""],["Quillen","A. C.",""],["Glade","Rachel",""]]}
{"id":"2308.03750","submitter":"Oscar Higgott","authors":"Oscar Higgott and Nikolas P. Breuckmann","title":"Constructions and performance of hyperbolic and semi-hyperbolic Floquet\n  codes","comments":"28 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 families of Floquet codes derived from colour code tilings of\nclosed hyperbolic surfaces. These codes have weight-two check operators, a\nfinite encoding rate and can be decoded efficiently with minimum-weight perfect\nmatching. We also construct semi-hyperbolic Floquet codes, which have improved\ndistance scaling, and are obtained via a fine-graining procedure. Using a\ncircuit-based noise model that assumes direct two-qubit measurements, we show\nthat semi-hyperbolic Floquet codes can be $48\\times$ more efficient than planar\nhoneycomb codes and therefore over $100\\times$ more efficient than alternative\ncompilations of the surface code to two-qubit measurements, even at physical\nerror rates of $0.3\\%$ to $1\\%$. We further demonstrate that semi-hyperbolic\nFloquet codes can have a teraquop footprint of only 32 physical qubits per\nlogical qubit at a noise strength of $0.1\\%$. For standard circuit-level\ndepolarising noise at $p=0.1\\%$, we find a $30\\times$ improvement over planar\nhoneycomb codes and a $5.6\\times$ improvement over surface codes. Finally, we\nanalyse small instances that are amenable to near-term experiments, including a\n16-qubit Floquet code derived from the Bolza surface.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:54:45 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Higgott","Oscar",""],["Breuckmann","Nikolas P.",""]]}
{"id":"2308.03751","submitter":"Johannes Mitscherling","authors":"Moritz M. Hirschmann and Johannes Mitscherling","title":"Minimal model for double Weyl points, multiband quantum geometry, and\n  singular flat band inspired by LK-99","comments":"Shortened for peer-review, phase convention adjusted, recent\n  literature added","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":"  Two common difficulties in the design of topological quantum materials are\nthat the desired features lie too far from the Fermi level and are spread over\na too large energy range. Doping-induced states at the Fermi level provide a\nsolution, where non-trivial topological properties are enforced by the\ndoping-reduced symmetry. To show this, we consider a regular placement of\ndopants in a lattice of space group (SG) 176 (P6$\\text{}_3$/m), which reduces\nthe symmetry to SG 143 (P3). Our two- and four-band models feature\nsymmetry-enforced double Weyl points at $\\Gamma$ and A with Chern bands for\n$k_z\\neq 0,\\pi$, Van Hove singularities, nontrivial multiband quantum geometry\ndue to mixed orbital character, and a singular flat band. The excellent\nagreement with density-functional theory (DFT) calculations on copper-doped\nlead apatite ('LK-99') provides evidence that minimal topological bands at the\nFermi level can be realized in doped materials.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:00 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 11:02:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hirschmann","Moritz M.",""],["Mitscherling","Johannes",""]]}
{"id":"2308.03752","submitter":"Vincent Emery","authors":"Vincent Emery","title":"Arithmetic groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.GR math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lecture notes on an introductory course on arithmetic lattices (EPFL 2014).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Emery","Vincent",""]]}
{"id":"2308.03753","submitter":"Andrzej Pokraka","authors":"Shounak De and Andrzej Pokraka","title":"Cosmology meets cohomology","comments":"36+3 pages, 8 figures; included ancillary files","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc math-ph math.AG math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The cosmological polytope and bootstrap programs have revealed interesting\nconnections between positive geometries, modern on-shell methods and bootstrap\nprinciples studied in the amplitudes community with the wavefunction of the\nUniverse in toy models of FRW cosmologies. To compute these FRW correlators,\none often faces integrals that are too difficult to evaluate by direct\nintegration. Borrowing from the Feynman integral community, the method of\n(canonical) differential equations provides an efficient alternative for\nevaluating these integrals. Moreover, we further develop our geometric\nunderstanding of these integrals by describing the associated \\emph{relative}\ntwisted cohomology. Leveraging recent progress in our understanding of relative\ntwisted cohomology in the Feynman integral community, we give an algorithm to\npredict the basis size and simplify the computation of the differential\nequations satisfied by FRW correlators.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:22 GMT"}],"update_date":"2023-08-08","authors_parsed":[["De","Shounak",""],["Pokraka","Andrzej",""]]}
{"id":"2308.03754","submitter":"Giulio Biroli","authors":"Tony Bonnaire, Davide Ghio, Kamesh Krishnamurthy, Francesca Mignacco,\n  Atsushi Yamamura and Giulio Biroli","title":"High-Dimensional Non-Convex Landscapes and Gradient Descent Dynamics","comments":"Lectures given by G. Biroli at the 2022 Les Houches Summer School\n  \"Statistical Physics and Machine Learning\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In these lecture notes we present different methods and concepts developed in\nstatistical physics to analyze gradient descent dynamics in high-dimensional\nnon-convex landscapes. Our aim is to show how approaches developed in physics,\nmainly statistical physics of disordered systems, can be used to tackle open\nquestions on high-dimensional dynamics in Machine Learning.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:36 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Bonnaire","Tony",""],["Ghio","Davide",""],["Krishnamurthy","Kamesh",""],["Mignacco","Francesca",""],["Yamamura","Atsushi",""],["Biroli","Giulio",""]]}
{"id":"2308.03755","submitter":"Lue Fan","authors":"Lue Fan, Feng Wang, Naiyan Wang, Zhaoxiang Zhang","title":"FSD V2: Improving Fully Sparse 3D Object Detection with Virtual Voxels","comments":null,"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 fully sparse architecture has garnered increasing attention.\nFSDv1 stands out as a representative work, achieving impressive efficacy and\nefficiency, albeit with intricate structures and handcrafted designs. In this\npaper, we present FSDv2, an evolution that aims to simplify the previous FSDv1\nwhile eliminating the inductive bias introduced by its handcrafted\ninstance-level representation, thus promoting better general applicability. To\nthis end, we introduce the concept of \\textbf{virtual voxels}, which takes over\nthe clustering-based instance segmentation in FSDv1. Virtual voxels not only\naddress the notorious issue of the Center Feature Missing problem in fully\nsparse detectors but also endow the framework with a more elegant and\nstreamlined approach. Consequently, we develop a suite of components to\ncomplement the virtual voxel concept, including a virtual voxel encoder, a\nvirtual voxel mixer, and a virtual voxel assignment strategy. Through empirical\nvalidation, we demonstrate that the virtual voxel mechanism is functionally\nsimilar to the handcrafted clustering in FSDv1 while being more general. We\nconduct experiments on three large-scale datasets: Waymo Open Dataset,\nArgoverse 2 dataset, and nuScenes dataset. Our results showcase\nstate-of-the-art performance on all three datasets, highlighting the\nsuperiority of FSDv2 in long-range scenarios and its general applicability to\nachieve competitive performance across diverse scenarios. Moreover, we provide\ncomprehensive experimental analysis to elucidate the workings of FSDv2. To\nfoster reproducibility and further research, we have open-sourced FSDv2 at\nhttps://github.com/tusen-ai/SST.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:48 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Fan","Lue",""],["Wang","Feng",""],["Wang","Naiyan",""],["Zhang","Zhaoxiang",""]]}
{"id":"2308.03756","submitter":"Konrad Viebahn","authors":"Konrad Viebahn, Anne-Sophie Walter, Eric Bertok, Zijie Zhu, Marius\n  G\\\"achter, Armando A. Aligia, Fabian Heidrich-Meisner, and Tilman Esslinger","title":"Interaction-induced charge pumping in a topological many-body system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.mes-hall cond-mat.str-el physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A topological 'Thouless' pump represents the quantised motion of particles in\nresponse to a slow, cyclic modulation of external control parameters. The\nThouless pump, like the quantum Hall effect, is of fundamental interest in\nphysics because it links physically measurable quantities, such as particle\ncurrents, to geometric properties of the experimental system, which can be\nrobust against perturbations and thus technologically useful. So far,\nexperiments probing the interplay between topology and inter-particle\ninteractions have remained relatively scarce. Here we observe a Thouless-type\ncharge pump in which the particle current and its directionality inherently\nrely on the presence of strong interactions. Experimentally, we utilise\nfermionic atoms in a dynamical superlattice which traces a pump trajectory that\nremains trivial in the non-interacting limit. Remarkably, the transferred\ncharge in the interacting system is half of its usual value in the\nnon-interacting case, in agreement with matrix-product-state simulations. Our\nexperiments suggest that Thouless charge pumps are promising platforms to gain\ninsights into interaction-driven topological transitions and topological\nquantum matter.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:58 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Viebahn","Konrad",""],["Walter","Anne-Sophie",""],["Bertok","Eric",""],["Zhu","Zijie",""],["G\u00e4chter","Marius",""],["Aligia","Armando A.",""],["Heidrich-Meisner","Fabian",""],["Esslinger","Tilman",""]]}
{"id":"2308.03757","submitter":"Hadi AlZayer","authors":"Brandon Y. Feng, Hadi Alzayer, Michael Rubinstein, William T. Freeman,\n  Jia-Bin Huang","title":"3D Motion Magnification: Visualizing Subtle Motions with Time Varying\n  Radiance Fields","comments":"ICCV 2023. See the project page at\n  https://3d-motion-magnification.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motion magnification helps us visualize subtle, imperceptible motion.\nHowever, prior methods only work for 2D videos captured with a fixed camera. We\npresent a 3D motion magnification method that can magnify subtle motions from\nscenes captured by a moving camera, while supporting novel view rendering. We\nrepresent the scene with time-varying radiance fields and leverage the Eulerian\nprinciple for motion magnification to extract and amplify the variation of the\nembedding of a fixed point over time. We study and validate our proposed\nprinciple for 3D motion magnification using both implicit and tri-plane-based\nradiance fields as our underlying 3D scene representation. We evaluate the\neffectiveness of our method on both synthetic and real-world scenes captured\nunder various camera setups.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:59:59 GMT"}],"update_date":"2023-08-08","authors_parsed":[["Feng","Brandon Y.",""],["Alzayer","Hadi",""],["Rubinstein","Michael",""],["Freeman","William T.",""],["Huang","Jia-Bin",""]]}
{"id":"2308.03775","submitter":"Sergei Silvestrov","authors":"Talat Nazir, Zakaria Ali, Shahin Nosrat Jogan, Sergei Silvestrov","title":"Fixed point results for set-contractions on dislocated metric space with\n  a directed graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generalized (rational) graph contractions in the framework of a dislocated\nmetric space endowed with a directed graph are investigated. Fixed point\nresults for set-contractions are obtained. We also provide some examples to\nillustrate our main results. Moreover, the well-posedness of obtained fixed\npoint results are also shown. Our obtained results extend many results in the\nexisting literature.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 01:15:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nazir","Talat",""],["Ali","Zakaria",""],["Jogan","Shahin Nosrat",""],["Silvestrov","Sergei",""]]}
{"id":"2308.03776","submitter":"Shubham Kumar Rajput","authors":"S. K. Rajput","title":"Rotation and Oblique Irradiation Effects on Phototactic Algal Suspension\n  Instability","comments":"arXiv admin note: substantial text overlap with arXiv:2306.14477","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft math.DS physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we aim to explore the behavior of microorganisms in response\nto natural lighting conditions, considering the off-normal angles at which the\nsun strikes the Earth's surface. To achieve this, we investigate the effect of\noblique irradiation on a rotating medium, as this combination represents a more\nrealistic scenario in the natural environment. Our primary focus is on\nunderstanding the phototactic behavior of microorganisms, which refers to their\nmovement towards or away from light. Under conditions of low light,\nmicroorganisms tend to exhibit positive phototaxis, moving towards the light\nsource, while in intense light, they display negative phototaxis, moving away\nfrom the light source. By studying a suspension that is illuminated by oblique\ncollimated flux with a constant radiation intensity applied to the top surface,\nwe can gain insights into how microorganisms respond to varying light\nconditions and rotation. The stability analysis is conducted using linear\nperturbation theory, which allows us to predict both the stationary and\noscillatory characteristics of the bio-convective instability at the onset of\nbioconvection. Through this analysis, we observe that rotation plays a\nsignificant stabilizing role in the system, while oblique irradiation has a\ndestabilizing effect on the suspension.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:24:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rajput","S. K.",""]]}
{"id":"2308.03777","submitter":"Yuanyuan Wei","authors":"Yuanyuan Wei, Dehua Hu, Bijie Bai, Chenqi Meng, Tsz Kin Chan, Xing\n  Zhao, Yuye Wang, Yi-Ping Ho, Wu Yuan, and Ho-Pui Ho","title":"Lab-in-a-Tube: A portable imaging spectrophotometer for cost-effective,\n  high-throughput, and label-free analysis of centrifugation processes","comments":"21 Pages, 6 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph eess.IV eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Centrifuges serve as essential instruments in modern experimental sciences,\nfacilitating a wide range of routine sample processing tasks that necessitate\nmaterial sedimentation. However, the study for real time observation of the\ndynamical process during centrifugation has remained elusive. In this study, we\ndeveloped an innovative Lab_in_a_Tube imaging spectrophotometer that\nincorporates capabilities of real time image analysis and programmable\ninterruption. This portable LIAT device costs less than 30 US dollars. Based on\nour knowledge, it is the first Wi Fi camera built_in in common lab centrifuges\nwith active closed_loop control. We tested our LIAT imaging spectrophotometer\nwith solute solvent interaction investigation obtained from lab centrifuges\nwith quantitative data plotting in a real time manner. Single re circulating\nflow was real time observed, forming the ring shaped pattern during\ncentrifugation. To the best of our knowledge, this is the very first\nobservation of similar phenomena. We developed theoretical simulations for the\nsingle particle in a rotating reference frame, which correlated well with\nexperimental results. We also demonstrated the first demonstration to visualize\nthe blood sedimentation process in clinical lab centrifuges. This remarkable\ncost effectiveness opens up exciting opportunities for centrifugation\nmicrobiology research and paves the way for the creation of a network of\ncomputational imaging spectrometers at an affordable price for large scale and\ncontinuous monitoring of centrifugal processes in general.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:58:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wei","Yuanyuan",""],["Hu","Dehua",""],["Bai","Bijie",""],["Meng","Chenqi",""],["Chan","Tsz Kin",""],["Zhao","Xing",""],["Wang","Yuye",""],["Ho","Yi-Ping",""],["Yuan","Wu",""],["Ho","Ho-Pui",""]]}
{"id":"2308.03778","submitter":"Alexander Kholmanskiy","authors":"Alexander Kholmanskiy","title":"Role of water in physics of blood and cerebrospinal fluid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Known physical mechanisms of temperature dependence anomalies of water\nproperties were used to explain the regularities in temperature dependence\n(TDs) of dynamic, electrical and optical characteristics of biological systems.\nThe dynamics of hydrogen bonds in bulk and hydrated water affected the\nactivation energies TDs of ion currents of voltage-dependent channels that\nregulate signaling and trophic bonds in the neuropil of the cortical\nparenchyma. The physics of minimizing the TD of the isobaric heat capacity of\nwater made it possible to explain the stabilization and functional optimization\nof the thermodynamics of eyeball fluids at 34.5 C and the human brain during\nsleep at 36.5 C. At these temperatures, the thermoreceptors of the cornea and\nthe cells of the ganglionic layer of the retina, through connections with the\nsuprachiasmatic nucleus and the pineal gland, switch the circadian rhythm from\ndaytime to nighttime. The phylogenesis of the circadian rhythm was reflected in\nthe dependence of the duration of the nighttime sleep of mammals on the\ndiameter of the eyeball and the mass of the pineal gland. The activity of all\nthe nerves of the eyeball led to the division of the nocturnal brain metabolism\ninto NREM and REM phases. These phases correspond to two modes of the\nglymphatic system - electrochemical and dynamic. The first is responsible for\nthe relaxation processes of synaptic plasticity and chemical neutralization of\ntoxins with the participation of water and melatonin. Rapid eye movement and an\nincrease in cerebral blood flow in the second mode increase water exchange in\nthe parenchyma and flush out toxins into the venous system. Electrophysics of\nclearance and conductivity of ionic and water channels of membranes of blood\nvessels and astrocytes modulate oscillations of polarization potentials of\nwater dipole domains in parietal plasma layers of arterioles and capillaries.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:33:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kholmanskiy","Alexander",""]]}
{"id":"2308.03779","submitter":"Shallu Sharma","authors":"Iqbal Kour, Pooja Saproo and Shallu Sharma","title":"Some new results in extended cone b-metric space","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The main aspect of this paper is to investigate some topological properties\nand Kannan-type contractions in extended cone b-metric spaces. Additionally we\nhave imposed some extra conditions such that a sequence in an extended cone\nb-metric space becomes a Cauchy sequence. Furthermore, in order to achieve new\nresults the concept of asymptotic regularity has also been utilized.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 11:27:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kour","Iqbal",""],["Saproo","Pooja",""],["Sharma","Shallu",""]]}
{"id":"2308.03780","submitter":"Abhiroop Sarkar","authors":"Abhiroop Sarkar, Debayan Ghosh, Kinshuk Ganguly, Snehal Ghosh and\n  Subhajit Saha","title":"Exploring IoT for real-time CO2 monitoring and analysis","comments":"9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.CY eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As a part of this project, we have developed an IoT-based instrument\nutilizing the NODE MCU-ESP8266 module, MQ135 gas sensor, and DHT-11 sensor for\nmeasuring CO$_2$ levels in parts per million (ppm), temperature, and humidity.\nThe escalating CO$_2$ levels worldwide necessitate constant monitoring and\nanalysis to comprehend the implications for human health, safety, energy\nefficiency, and environmental well-being. Thus, an efficient and cost-effective\nsolution is imperative to measure and transmit data for statistical analysis\nand storage. The instrument offers real-time monitoring, enabling a\ncomprehensive understanding of indoor environmental conditions. By providing\nvaluable insights, it facilitates the implementation of measures to ensure\nhealth and safety, optimize energy efficiency, and promote effective\nenvironmental monitoring. This scientific endeavor aims to contribute to the\ngrowing body of knowledge surrounding CO$_2$ levels, temperature, and humidity,\nfostering sustainable practices and informed decision-making\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 13:10:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sarkar","Abhiroop",""],["Ghosh","Debayan",""],["Ganguly","Kinshuk",""],["Ghosh","Snehal",""],["Saha","Subhajit",""]]}
{"id":"2308.03781","submitter":"Han Zhao","authors":"Han Zhao (1), David Kamensky (1), John T. Hwang (1), Jiun-Shyan Chen\n  (2 and 1) ((1) Department of Mechanical and Aerospace Engineering, University\n  of California San Diego, (2) Department of Structural Engineering, University\n  of California San Diego)","title":"Automated shape and thickness optimization for non-matching isogeometric\n  shells using free-form deformation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Isogeometric analysis (IGA) has emerged as a promising approach in the field\nof structural optimization, benefiting from the seamless integration between\nthe computer-aided design (CAD) geometry and the analysis model by employing\nnon-uniform rational B-splines (NURBS) as basis functions. However, structural\noptimization for real-world CAD geometries consisting of multiple non-matching\nNURBS patches remains a challenging task. In this work, we propose a unified\nformulation for shape and thickness optimization of separately-parametrized\nshell structures by adopting the free-form deformation (FFD) technique, so that\ncontinuity with respect to design variables is preserved at patch intersections\nduring optimization. Shell patches are modeled with isogeometric\nKirchhoff--Love theory and coupled using a penalty-based method in the\nanalysis. We use Lagrange extraction to link the control points associated with\nthe B-spline FFD block and shell patches, and we perform IGA using the same\nextraction matrices by taking advantage of existing finite element assembly\nprocedures in the FEniCS partial differential equation (PDE) solution library.\nMoreover, we enable automated analytical derivative computation by leveraging\nadvanced code generation in FEniCS, thereby facilitating efficient\ngradient-based optimization algorithms. The framework is validated using a\ncollection of benchmark problems, demonstrating its applications to shape and\nthickness optimization of aircraft wings with complex shell layouts.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:56:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhao","Han","","2 and 1"],["Kamensky","David","","2 and 1"],["Hwang","John T.","","2 and 1"],["Chen","Jiun-Shyan","","2 and 1"]]}
{"id":"2308.03782","submitter":"Yue Ling","authors":"Yue Ling","title":"Bio+Clinical BERT, BERT Base, and CNN Performance Comparison for\n  Predicting Drug-Review Satisfaction","comments":"KDD 2023 Workshop on Applied Data Science for Healthcare","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 objective of this study is to develop natural language processing (NLP)\nmodels that can analyze patients' drug reviews and accurately classify their\nsatisfaction levels as positive, neutral, or negative. Such models would reduce\nthe workload of healthcare professionals and provide greater insight into\npatients' quality of life, which is a critical indicator of treatment\neffectiveness. To achieve this, we implemented and evaluated several\nclassification models, including a BERT base model, Bio+Clinical BERT, and a\nsimpler CNN. Results indicate that the medical domain-specific Bio+Clinical\nBERT model significantly outperformed the general domain base BERT model,\nachieving macro f1 and recall score improvement of 11%, as shown in Table 2.\nFuture research could explore how to capitalize on the specific strengths of\neach model. Bio+Clinical BERT excels in overall performance, particularly with\nmedical jargon, while the simpler CNN demonstrates the ability to identify\ncrucial words and accurately classify sentiment in texts with conflicting\nsentiments.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 20:01:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ling","Yue",""]]}
{"id":"2308.03783","submitter":"Samantha Kucher","authors":"Samantha Kucher, Adrian Ko\\'zluk, Philippe Petitjeans, Agn\\`es Maurel\n  and Vincent Pagneux","title":"Backscattering reduction in a twisted water wave channel","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph nlin.PS physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study theoretically and experimentally how to reduce the backscattering of\nwater waves in a channel with multiple turns. We show that it is not only\npossible to cancel backscattering but also to achieve a remarkable transmission\nin such geometries. In order to avoid the reflection that naturally arises at\neach turn of the waveguide, an anisotropic metamaterial made of closely-spaced\nthin vertical plates is used. The efficiency of the metamaterial arrangement\ndepends only slightly on the frequency of the incident wave, as long as its\nwavelength is much larger than the periodicity of the array. This phenomenon is\nnot restricted only to water wave channels but also applies to any type of\nwaves with Neumann boundary conditions.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 15:11:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kucher","Samantha",""],["Ko\u017aluk","Adrian",""],["Petitjeans","Philippe",""],["Maurel","Agn\u00e8s",""],["Pagneux","Vincent",""]]}
{"id":"2308.03784","submitter":"Mehrdad Sabetzadeh","authors":"Dipeeka Luitel, Shabnam Hassani, Mehrdad Sabetzadeh","title":"Improving Requirements Completeness: Automated Assistance through Large\n  Language Models","comments":"Submitted to Requirements Engineering Journal (REJ) - REFSQ'23\n  Special Issue. arXiv admin note: substantial text overlap with\n  arXiv:2302.04792","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Natural language (NL) is arguably the most prevalent medium for expressing\nsystems and software requirements. Detecting incompleteness in NL requirements\nis a major challenge. One approach to identify incompleteness is to compare\nrequirements with external sources. Given the rise of large language models\n(LLMs), an interesting question arises: Are LLMs useful external sources of\nknowledge for detecting potential incompleteness in NL requirements? This\narticle explores this question by utilizing BERT. Specifically, we employ\nBERT's masked language model (MLM) to generate contextualized predictions for\nfilling masked slots in requirements. To simulate incompleteness, we withhold\ncontent from the requirements and assess BERT's ability to predict terminology\nthat is present in the withheld content but absent in the disclosed content.\nBERT can produce multiple predictions per mask. Our first contribution is\ndetermining the optimal number of predictions per mask, striking a balance\nbetween effectively identifying omissions in requirements and mitigating noise\npresent in the predictions. Our second contribution involves designing a\nmachine learning-based filter to post-process BERT's predictions and further\nreduce noise. We conduct an empirical evaluation using 40 requirements\nspecifications from the PURE dataset. Our findings indicate that: (1) BERT's\npredictions effectively highlight terminology that is missing from\nrequirements, (2) BERT outperforms simpler baselines in identifying relevant\nyet missing terminology, and (3) our filter significantly reduces noise in the\npredictions, enhancing BERT's effectiveness as a tool for completeness checking\nof requirements.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:49:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Luitel","Dipeeka",""],["Hassani","Shabnam",""],["Sabetzadeh","Mehrdad",""]]}
{"id":"2308.03785","submitter":"Zhibing He","authors":"Zhibing He, Yunpeng Zhao, Peter Bickel, Charles Weko, Dan Cheng and\n  Jirui Wang","title":"Network Inference Using the Hub Model and Variants","comments":"arXiv admin note: substantial text overlap with arXiv:2004.09709","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Statistical network analysis primarily focuses on inferring the parameters of\nan observed network. In many applications, especially in the social sciences,\nthe observed data is the groups formed by individual subjects. In these\napplications, the network is itself a parameter of a statistical model. Zhao\nand Weko (2019) propose a model-based approach, called the hub model, to infer\nimplicit networks from grouping behavior. The hub model assumes that each\nmember of the group is brought together by a member of the group called the\nhub. The set of members which can serve as a hub is called the hub set. The hub\nmodel belongs to the family of Bernoulli mixture models. Identifiability of\nBernoulli mixture model parameters is a notoriously difficult problem. This\npaper proves identifiability of the hub model parameters and estimation\nconsistency under mild conditions. Furthermore, this paper generalizes the hub\nmodel by introducing a model component that allows hubless groups in which\nindividual nodes spontaneously appear independent of any other individual. We\nrefer to this additional component as the null component. The new model bridges\nthe gap between the hub model and the degenerate case of the mixture model --\nthe Bernoulli product. Identifiability and consistency are also proved for the\nnew model. In addition, a penalized likelihood approach is proposed to estimate\nthe hub set when it is unknown.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 03:56:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["He","Zhibing",""],["Zhao","Yunpeng",""],["Bickel","Peter",""],["Weko","Charles",""],["Cheng","Dan",""],["Wang","Jirui",""]]}
{"id":"2308.03786","submitter":"Kasra Rouhi","authors":"Kasra Rouhi, Robert Marosi, Tarek Mealy, Alexander Figotin, Filippo\n  Capolino","title":"Parametric Modeling of Serpentine Waveguide Traveling Wave Tubes","comments":"16 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A simple and fast model for numerically calculating small-signal gain in\nserpentine waveguide traveling-wave tubes (TWTs) is described. In the framework\nof the Pierce model, we consider one-dimensional electron flow along a\ndispersive single-mode slow-wave structure (SWS), accounting for the\nspace-charge effect. The analytical model accounts for the frequency-dependent\nphase velocity and characteristic impedance obtained using various equivalent\ncircuit models from the literature, validated by comparison with full-wave\neigenmode simulation. The model includes a relation between the modal\ncharacteristic impedance and the interaction (Pierce) impedance of the SWS,\nincluding also an extra correction factor that accounts for the variation of\nthe electric field distribution and hence of the interaction impedance over the\nbeam cross section. By applying boundary conditions to our generalized Pierce\nmodel, we compute both the theoretical gain of a TWT and all the complex-valued\nwavenumbers of the hot modes versus frequency and compare our results with\nnumerically intensive particle-in-cell (PIC) simulations; the good agreement in\nthe comparison demonstrates the accuracy and simplicity of our generalized\nmodel. For various examples where we vary the average electron beam (e-beam)\nphase velocity, average e-beam current, number of unit cells, and input radio\nfrequency (RF) power, we demonstrate that our model is robust in the\nsmall-signal regime.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:27:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rouhi","Kasra",""],["Marosi","Robert",""],["Mealy","Tarek",""],["Figotin","Alexander",""],["Capolino","Filippo",""]]}
{"id":"2308.03787","submitter":"Yusaku Mori","authors":"Yusaku Mori","title":"Pentagram Map by Euclidean Approach","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As one type of incidence theory, the geometry of pentagram map seems quite\nclassical at first. However, this is an excellent example of such a classical\nidea developed into a marvellous insight by some modern approach. We introduce\nan alternative approach based on the setting of the ordinary Euclidean\ngeometry.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:59:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mori","Yusaku",""]]}
{"id":"2308.03788","submitter":"Christian Rack","authors":"Christian Rack, Tamara Fernando, Murat Yalcin, Andreas Hotho, Marc\n  Erich Latoschik","title":"Who Is Alyx? A new Behavioral Biometric Dataset for User Identification\n  in XR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This article presents a new dataset containing motion and physiological data\nof users playing the game \"Half-Life: Alyx\". The dataset specifically targets\nbehavioral and biometric identification of XR users. It includes motion and\neye-tracking data captured by a HTC Vive Pro of 71 users playing the game on\ntwo separate days for 45 minutes. Additionally, we collected physiological data\nfrom 31 of these users. We provide benchmark performances for the task of\nmotion-based identification of XR users with two prominent state-of-the-art\ndeep learning architectures (GRU and CNN). After training on the first session\nof each user, the best model can identify the 71 users in the second session\nwith a mean accuracy of 95% within 2 minutes. The dataset is freely available\nunder https://github.com/cschell/who-is-alyx\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 09:34:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rack","Christian",""],["Fernando","Tamara",""],["Yalcin","Murat",""],["Hotho","Andreas",""],["Latoschik","Marc Erich",""]]}
{"id":"2308.03789","submitter":"Mohamed Sana","authors":"Mohamed Sana and Emilio Calvanese Strinati","title":"Semantic Channel Equalizer: Modelling Language Mismatch in Multi-User\n  Semantic Communications","comments":"This work has been accepted for publication in 2023 IEEE Global\n  Communications Conference (GLOBECOM) SAC: Machine Learning for Communications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a multi-user semantic communications system in which agents\n(transmitters and receivers) interact through the exchange of semantic messages\nto convey meanings. In this context, languages are instrumental in structuring\nthe construction and consolidation of knowledge, influencing conceptual\nrepresentation and semantic extraction and interpretation. Yet, the crucial\nrole of languages in semantic communications is often overlooked. When this is\nnot the case, agent languages are assumed compatible and unambiguously\ninteroperable, ignoring practical limitations that may arise due to language\nmismatching. This is the focus of this work. When agents use distinct\nlanguages, message interpretation is prone to semantic noise resulting from\ncritical distortion introduced by semantic channels. To address this problem,\nthis paper proposes a new semantic channel equalizer to counteract and limit\nthe critical ambiguity in message interpretation. Our proposed solution models\nthe mismatch of languages with measurable transformations over semantic\nrepresentation spaces. We achieve this using optimal transport theory, where we\nmodel such transformations as transportation maps. Then, to recover at the\nreceiver the meaning intended by the teacher we operate semantic equalization\nto compensate for the transformation introduced by the semantic channel, either\nbefore transmission and/or after the reception of semantic messages. We\nimplement the proposed approach as an operation over a codebook of\ntransformations specifically designed for successful communication. Numerical\nresults show that the proposed semantic channel equalizer outperforms\ntraditional approaches in terms of operational complexity and transmission\naccuracy.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 12:08:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sana","Mohamed",""],["Strinati","Emilio Calvanese",""]]}
{"id":"2308.03790","submitter":"Javier LLorca","authors":"C. Pascual-Gonz\\'alez, J. de la Vega, C. Thompson, J. P.\n  Fern\\'andez-Bl\\'azquez, D. Herr\\'aez-Molinero, N. Biurrun, I. Lizarralde, J.\n  S\\'anchez del R\\'io, C. Gonz\\'alez, J. LLorca","title":"Processing and mechanical properties of novel biodegradable poly-lactic\n  acid/Zn 3D printed scaffolds for application in tissue regeneration","comments":null,"journal-ref":"journal of the mechanical behavior of biomedical materials 132\n  (2022) 105290","doi":null,"report-no":null,"categories":"physics.med-ph cond-mat.mtrl-sci physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The feasibility to manufacture scaffolds of poly-lactic acid reinforced with\nZn particles by fused filament fabrication is demonstrated for the first time.\nFilaments of 2.85 mm in diameter of PLA reinforced with different weight\nfractions of $\\mu$m-sized Zn - 1 wt. \\% Mg alloy particles (in the range 3.5 to\n17.5 wt. \\%) were manufactured by a double extrusion in method in which\nstandard extrusion is followed by a precision extrusion in a filament-maker\nmachine. Filaments with constant diameter, negligible porosity and a\nhomogeneous reinforcement distribution were obtained for Zn weight fractions of\nup to 10.5\\%. It was found that the presence of Zn particles led to limited\nchanges in the physico-chemical properties of the PLA that did not affect the\nwindow temperature for 3D printing nor the melt flow index. Thus, porous\nscaffolds could be manufactured by fused filament fabrication at 190\\textdegree\nC with poly-lactic acid/Zn composites containing 3.5 and 7 wt. \\% of Zn and at\n170\\textdegree C when the Zn content was 10.5 wt. \\% with excellent dimensional\naccuracy and mechanical properties.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:11:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pascual-Gonz\u00e1lez","C.",""],["de la Vega","J.",""],["Thompson","C.",""],["Fern\u00e1ndez-Bl\u00e1zquez","J. P.",""],["Herr\u00e1ez-Molinero","D.",""],["Biurrun","N.",""],["Lizarralde","I.",""],["del R\u00edo","J. S\u00e1nchez",""],["Gonz\u00e1lez","C.",""],["LLorca","J.",""]]}
{"id":"2308.03791","submitter":"Edoardo Marangone","authors":"Edoardo Marangone and Claudio Di Ciccio and Daniele Friolo and Eugenio\n  Nerio Nemmi and Daniele Venturi and Ingo Weber","title":"Enabling Data Confidentiality with Public Blockchains","comments":"arXiv admin note: substantial text overlap with arXiv:2303.17977","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Blockchain technology is apt to facilitate the automation of multi-party\ncooperations among various players in a decentralized setting, especially in\ncases where trust among participants is limited. Transactions are stored in a\nledger, a replica of which is retained by every node of the blockchain network.\nThe operations saved thereby are thus publicly accessible. While this aspect\nenhances transparency, reliability, and persistence, it hinders the utilization\nof public blockchains for process automation as it violates typical\nconfidentiality requirements in corporate settings. To overcome this issue, we\npropose our approach named Multi-Authority Approach to Transaction Systems for\nInteroperating Applications (MARTSIA). Based on Multi-Authority Attribute-Based\nEncryption (MA-ABE), MARTSIA enables read-access control over shared data at\nthe level of message parts. User-defined policies determine whether an actor\ncan interpret the publicly stored information or not, depending on the actor's\nattributes declared by a consortium of certifiers. Still, all nodes in the\nblockchain network can attest to the publication of the (encrypted) data. We\nprovide a formal analysis of the security guarantees of MARTSIA, and illustrate\nthe proof-of-concept implementation over multiple blockchain platforms. To\ndemonstrate its interoperability, we showcase its usage in ensemble with a\nstate-of-the-art blockchain-based engine for multi-party process execution, and\nthree real-world decentralized applications in the context of NFT markets,\nsupply chain, and retail.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:21:48 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 13:17:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Marangone","Edoardo",""],["Di Ciccio","Claudio",""],["Friolo","Daniele",""],["Nemmi","Eugenio Nerio",""],["Venturi","Daniele",""],["Weber","Ingo",""]]}
{"id":"2308.03792","submitter":"Stanislav Fort","authors":"Stanislav Fort","title":"Multi-attacks: Many images $+$ the same adversarial attack $\\to$ many\n  target labels","comments":"Code at https://github.com/stanislavfort/multi-attacks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that we can easily design a single adversarial perturbation $P$ that\nchanges the class of $n$ images $X_1,X_2,\\dots,X_n$ from their original,\nunperturbed classes $c_1, c_2,\\dots,c_n$ to desired (not necessarily all the\nsame) classes $c^*_1,c^*_2,\\dots,c^*_n$ for up to hundreds of images and target\nclasses at once. We call these \\textit{multi-attacks}. Characterizing the\nmaximum $n$ we can achieve under different conditions such as image resolution,\nwe estimate the number of regions of high class confidence around a particular\nimage in the space of pixels to be around $10^{\\mathcal{O}(100)}$, posing a\nsignificant problem for exhaustive defense strategies. We show several\nimmediate consequences of this: adversarial attacks that change the resulting\nclass based on their intensity, and scale-independent adversarial examples. To\ndemonstrate the redundancy and richness of class decision boundaries in the\npixel space, we look for its two-dimensional sections that trace images and\nspell words using particular classes. We also show that ensembling reduces\nsusceptibility to multi-attacks, and that classifiers trained on random labels\nare more susceptible. Our code is available on GitHub.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:41:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fort","Stanislav",""]]}
{"id":"2308.03793","submitter":"Xuefeng Hu","authors":"Xuefeng Hu, Ke Zhang, Lu Xia, Albert Chen, Jiajia Luo, Yuyin Sun, Ken\n  Wang, Nan Qiao, Xiao Zeng, Min Sun, Cheng-Hao Kuo, Ram Nevatia","title":"ReCLIP: Refine Contrastive Language Image Pre-Training with Source Free\n  Domain Adaptation","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":"  Large-scale Pre-Training Vision-Language Model such as CLIP has demonstrated\noutstanding performance in zero-shot classification, e.g. achieving 76.3% top-1\naccuracy on ImageNet without seeing any example, which leads to potential\nbenefits to many tasks that have no labeled data. However, while applying CLIP\nto a downstream target domain, the presence of visual and text domain gaps and\ncross-modality misalignment can greatly impact the model performance. To\naddress such challenges, we propose ReCLIP, the first source-free domain\nadaptation method for vision-language models, which does not require any source\ndata or target labeled data. ReCLIP first learns a projection space to mitigate\nthe misaligned visual-text embeddings and learns pseudo labels, and then\ndeploys cross-modality self-training with the pseudo labels, to update visual\nand text encoders, refine labels and reduce domain gaps and misalignments\niteratively. With extensive experiments, we demonstrate ReCLIP reduces the\naverage error rate of CLIP from 30.17% to 25.06% on 22 image classification\nbenchmarks.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 18:11:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hu","Xuefeng",""],["Zhang","Ke",""],["Xia","Lu",""],["Chen","Albert",""],["Luo","Jiajia",""],["Sun","Yuyin",""],["Wang","Ken",""],["Qiao","Nan",""],["Zeng","Xiao",""],["Sun","Min",""],["Kuo","Cheng-Hao",""],["Nevatia","Ram",""]]}
{"id":"2308.03794","submitter":"Jacob John M","authors":"Jacob John, Charles Hirst, Max Boleininger, Chris Hardie, Mark Gilbert","title":"Quench Risk Increase With Radiation Damage","comments":"6 pages, 9 figures, 1 table. Work presented at Symposium on Fusion\n  Engineering 2023 in Oxford on July 13th. The work is a hot topic and has been\n  shared publicly. The work has significant implications for the design of some\n  private machines. After publishing on Arxiv the work will be shared for peer\n  review. The work will be submitted for a IEEE Transactions on plasma science\n  early September","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cond-mat.mtrl-sci physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superconducting magnets are often proposed to confine plasma in fusion\nreactors. Superconducting material enables the magnets to carry current\ndensities that would melt materials with non-zero resistance. Quench occurs\nwhen superconductivity is lost and the current starts to generate heat. Unless\nprevented with a fast enough control system, the heat generated during a quench\ncan cause catastrophic damage to the coils. This work describes a less-studied\nheating mechanism that increases the likelihood and aggressiveness of fusion\nmagnet quenches. Defects accumulate in the magnet structural material under\nirradiation by the fusion process. The defects store energy in the material and\nchange thermal and normal state electrical properties. Wigner energy is\nreleased when defects anneal. After a 0.9 mDPA neutron irradiation, a 10 K\ndisturbance from 20 K is predicted to release enough energy to result in a\nfinal temperature of 40 K. Irradiation damage also reduces the quench time\nconstant by increasing normal state resistivity and thus Ohmic heating. The\ncontinuous operation of a fusion reactor produces an increasingly unstable\nthermodynamic system in superconducting magnets by changing electrical and\nthermal properties with irradiation damage. The temperature margin between\noperation and quench runaway reduces with irradiation. The next steps are to\ninclude these observations in quench models and validate the predictions\nexperimentally. Implications of this work is felt by all fusion powerplant\nprojects planning to leverage superconducting magnets. Designs will recognize\nthis risk with more stringent specifications on quench control systems and\nmaximum duration of coil operation at cryogenic temperature between periodic\nreleases of Wigner energy to avoid catastrophic quench failures.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 20:45:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["John","Jacob",""],["Hirst","Charles",""],["Boleininger","Max",""],["Hardie","Chris",""],["Gilbert","Mark",""]]}
{"id":"2308.03795","submitter":"Renze Lou","authors":"Renze Lou, Wenpeng Yin","title":"Forget Demonstrations, Focus on Learning from Textual Instructions","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work studies a challenging yet more realistic setting for zero-shot\ncross-task generalization: demonstration-free learning from textual\ninstructions, presuming the existence of a paragraph-style task definition\nwhile no demonstrations exist. To better learn the task supervision from the\ndefinition, we propose two strategies: first, to automatically find out the\ncritical sentences in the definition; second, a ranking objective to force the\nmodel to generate the gold outputs with higher probabilities when those\ncritical parts are highlighted in the definition. The joint efforts of the two\nstrategies yield state-of-the-art performance on the challenging benchmark. Our\ncode will be released in the final version of the paper.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:44:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lou","Renze",""],["Yin","Wenpeng",""]]}
{"id":"2308.03796","submitter":"Kent A. Peacock","authors":"Kent A. Peacock","title":"Superluminal Transformations in Spacetimes of Definite Metric","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper reviews and extends an approach to superluminal kinematics set\nforth by R. Sutherland and J. Shepanski in 1986. This theory is characterized\nby a spacetime with positive definite metric, a Lorentz factor of the form\n$1/\\sqrt{\\beta^2 - 1}$, and real-valued proper times and proper lengths for\nsuperluminal reference frames.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:33:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Peacock","Kent A.",""]]}
{"id":"2308.03797","submitter":"Yungui Ma","authors":"Yi Zhou, Junjie Zhan, Ziyang Xu, Yifan Shao, Yubo Wang, Yongdi Dang,\n  Sen Zhang, Yungui Ma","title":"Electromagnetic Spatiotemporal Differentiators","comments":"6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spatiotemporal optical computing devices which could perform mathematical\noperations in both spatial and temporal domains can provide unprecedented\nmeasures to build efficient and real-time information processing systems. It is\nparticularly important to realize the comprehensive functions in a compact\ndesign for better integration with electronic components. In this work, we\nexperimentally demonstrated an analogue spatiotemporal differentiator in\nmicrowaves based on an asymmetrical metasurface which has a phase singularity\nin the spatiotemporal domain. We showed that this structure could give rise to\na spatiotemporal transfer function required by an ideal first-order\ndifferentiator in both spatial and temporal domains by tailoring the\nunidirectional excitation of spoof surface plasmon polaritons (SSPPs). The\nspatial edge detection was performed utilizing a metallic slit and the temporal\ndifferentiation capability of the device was examined by Gaussian-like temporal\npulses of different width. We further confirmed the differentiator demonstrated\nhere could detect sharp changes of spatiotemporal pulses even with intricate\nprofiles and theoretically estimated the resolution limits of the spatial and\ntemporal edge detection. We also show that the pulse input after passing the\nspatiotemporal differentiator implemented here could carry a transverse orbital\nangular momentum (OAM) with a fractal topology charge which further increases\nthe information quantity.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:42:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhou","Yi",""],["Zhan","Junjie",""],["Xu","Ziyang",""],["Shao","Yifan",""],["Wang","Yubo",""],["Dang","Yongdi",""],["Zhang","Sen",""],["Ma","Yungui",""]]}
{"id":"2308.03798","submitter":"Dr. Goutam Manna","authors":"Arijit Panda, Surajit Das, Goutam Manna and Saibal Ray","title":"Reconstruction of $f(R,T)$ gravity model via the Raychaudhuri equation","comments":"14 pages, 27 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this work, we investigate on an analytical solution for an alternative of\nmodified gravity theory, viz., the $f(R,T)$ gravity for two different eras,\ni.e., matter and dark energy dominated accelerating universe from completely\ngeometrical and mathematical point of view with the help of the well-known\nRaychaudhuri equation. To develop the construction of $f(R,T)$ gravity model,\nwe consider the functional form of $f(R,T)$ as the sum of two independent\nfunctions of the Ricci scalar $R$ and the trace of the energy-momentum tensor\n$T$, respectively, under the consideration of a power law expansion of the\nuniverse. In this study, the viability, stability and all the energy conditions\nhave been examined. The strong energy condition is not satisfied for our model,\nwhich is obvious for the present scenario of the universe.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 08:12:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Panda","Arijit",""],["Das","Surajit",""],["Manna","Goutam",""],["Ray","Saibal",""]]}
{"id":"2308.03799","submitter":"Hooman Moradpour","authors":"A. Ghasemi Azar, H. Rezaei, H. Moradpour","title":"On the Shapiro time delay","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Listening to echoes has long been a way to estimate distances, a technique\nwhose backbone is the time delay. The gravitational field also creates a time\ndelay, called Shapiro time delay, that helps us to extract some information\nfrom the field and is indeed due to the photon journey through the field. Here,\nthe ability of the Shapiro effect to distinguish naked singularities from\nnon-naked ones (black holes) is discussed. It is also inferred that this time\ndelay may be hired to compare the various types of singularities with different\ndimensions. Besides them, the possibility of detecting the rotation of the\nassumed objects through surveying the gravitational time delay is also\naddressed.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 12:06:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Azar","A. Ghasemi",""],["Rezaei","H.",""],["Moradpour","H.",""]]}
{"id":"2308.03800","submitter":"Qiuru Li","authors":"Qiuru Li","title":"Textual Data Mining for Financial Fraud Detection: A Deep Learning\n  Approach","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":"  In this report, I present a deep learning approach to conduct a natural\nlanguage processing (hereafter NLP) binary classification task for analyzing\nfinancial-fraud texts. First, I searched for regulatory announcements and\nenforcement bulletins from HKEX news to define fraudulent companies and to\nextract their MD&A reports before I organized the sentences from the reports\nwith labels and reporting time. My methodology involved different kinds of\nneural network models, including Multilayer Perceptrons with Embedding layers,\nvanilla Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), and\nGated Recurrent Unit (GRU) for the text classification task. By utilizing this\ndiverse set of models, I aim to perform a comprehensive comparison of their\naccuracy in detecting financial fraud. My results bring significant\nimplications for financial fraud detection as this work contributes to the\ngrowing body of research at the intersection of deep learning, NLP, and\nfinance, providing valuable insights for industry practitioners, regulators,\nand researchers in the pursuit of more robust and effective fraud detection\nmethodologies.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 15:33:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Qiuru",""]]}
{"id":"2308.03801","submitter":"R\\'obert Rajk\\'o","authors":"R\\'obert Rajk\\'o","title":"On problematic practice of using normalization in\n  Self-modeling/Multivariate Curve Resolution (S/MCR)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.NA math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The paper is briefly dealing with greater or lesser misused normalization in\nself-modeling/multivariate curve resolution (S/MCR) practice. The importance of\nthe correct use of the ode solvers and apt kinetic illustrations are\nelucidated. The new terms, external and internal normalizations are defined and\ninterpreted. The problem of reducibility of a matrix is touched. Improper\ngeneralization/development of normalization-based methods are cited as\nexamples. The position of the extreme values of the signal contribution\nfunction is clarified. An Executable Notebook with Matlab Live Editor was\ncreated for algorithmic explanations and depictions.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 20:40:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rajk\u00f3","R\u00f3bert",""]]}
{"id":"2308.03802","submitter":"Rajapboy Saparbayev","authors":"Rajapboy Saparbayev","title":"Fractional Telegraph equation with the Riemann-Liouville derivative","comments":"arXiv admin note: substantial text overlap with arXiv:2305.11883","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Telegraph equation $(\\partial_{t}^{\\rho })^{2}u(x,t)+2\\alpha\n\\partial_{t}^{\\rho }u(x,t)-u_{xx}(x,t)=f(x,t)$, where $0<t\\leq T$ and\n$0<\\rho<1$, with the Riemann-Liouville derivative is considered. Existence and\nuniqueness theorem for the solution to the problem under consideration is\nproved. Inequalities of stability are obtained. The applied method allows us to\nstudy a similar problem by taking instead of $d^2/dx^2$ an arbitrary elliptic\ndifferential operator $A(x, D)$, having a compact inverse.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:28:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Saparbayev","Rajapboy",""]]}
{"id":"2308.03803","submitter":"D. Vijayan Senthilkumar","authors":"Akash Yadav, Krishnanand J, V.K. Chandrasekar, Wei Zou, J\\\"urgen\n  Kurths, D.V. Senthilkumar","title":"Exotic swarming dynamics of high-dimensional swarmalators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Swarmalators are oscillators that can swarm as well as sync via a dynamic\nbalance between their spatial proximity and phase similarity. We present a\ngeneralized D-dimensional swarmalator model, which is more realistic and\nversatile, that captures the self-organizing behaviors of a plethora of\nreal-world collectives. This allows for modeling complicated processes such as\nflocking, schooling of fish, cell sorting during embryonic development,\nresidential segregation, and opinion dynamics in social groups. We demonstrate\nits versatility by capturing the manoeuvers of the school of fish and traveling\nwaves of gene expression, both qualitatively and quantitatively, embryonic cell\nsorting, microrobot collectives, and various life stages of slime mold by a\nsuitable extension of the original model to incorporate appropriate features\nbesides a gallery of its intrinsic self-organizations for various interactions.\nWe expect this high-dimensional model to be potentially useful in describing\nswarming systems in a wide range of disciplines including physics of active\nmatter, developmental biology, sociology, and engineering.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:33:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yadav","Akash",""],["J","Krishnanand",""],["Chandrasekar","V. K.",""],["Zou","Wei",""],["Kurths","J\u00fcrgen",""],["Senthilkumar","D. V.",""]]}
{"id":"2308.03804","submitter":"Alon Rashelbach","authors":"Alon Rashelbach, Ori Rottensterich, Mark Silberstien","title":"Nucleotide String Indexing using Range Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS q-bio.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The two most common data-structures for genome indexing, FM-indices and\nhash-tables, exhibit a fundamental trade-off between memory footprint and\nperformance. We present Ranger, a new indexing technique for nucleotide\nsequences that is both memory efficient and fast. We observe that nucleotide\nsequences can be represented as integer ranges and leverage a range-matching\nalgorithm based on neural networks to perform the lookup.\n  We prototype Ranger in software and integrate it into the popular Minimap2\ntool. Ranger achieves almost identical end-to-end performance as the original\nMinimap2, while occupying 1.7$\\times$ and 1.2$\\times$ less memory for short-\nand long-reads, respectively. With a limited memory capacity, Ranger achieves\nup to 4.3$\\times$ speedup for short reads compared to FM-Index, and up to\n4.2$\\times$ and 1.8$\\times$ speedups for short- and long-reads, compared to\nhash-tables. Ranger opens up new opportunities in the context of hardware\nacceleration by reducing the memory footprint of long-seed indexes used in\nstate-of-the-art alignment accelerators by up to 23$\\times$ which results with\n3$\\times$ faster alignment and negligible accuracy degradation. Moreover, its\nworst case memory bandwidth and latency can be bounded in advance without the\nneed to inflate DRAM capacity.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 06:49:31 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rashelbach","Alon",""],["Rottensterich","Ori",""],["Silberstien","Mark",""]]}
{"id":"2308.03805","submitter":"Taoran Sheng","authors":"Taoran Sheng and Manfred Huber","title":"Weakly Supervised Multi-Task Representation Learning for Human Activity\n  Analysis Using Wearables","comments":null,"journal-ref":"Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. 4, 2,\n  Article 57 (June 2020), 18 pages","doi":"10.1145/3397330","report-no":null,"categories":"cs.LG cs.AI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sensor data streams from wearable devices and smart environments are widely\nstudied in areas like human activity recognition (HAR), person identification,\nor health monitoring. However, most of the previous works in activity and\nsensor stream analysis have been focusing on one aspect of the data, e.g. only\nrecognizing the type of the activity or only identifying the person who\nperformed the activity. We instead propose an approach that uses a weakly\nsupervised multi-output siamese network that learns to map the data into\nmultiple representation spaces, where each representation space focuses on one\naspect of the data. The representation vectors of the data samples are\npositioned in the space such that the data with the same semantic meaning in\nthat aspect are closely located to each other. Therefore, as demonstrated with\na set of experiments, the trained model can provide metrics for clustering data\nbased on multiple aspects, allowing it to address multiple tasks simultaneously\nand even to outperform single task supervised methods in many situations. In\naddition, further experiments are presented that in more detail analyze the\neffect of the architecture and of using multiple tasks within this framework,\nthat investigate the scalability of the model to include additional tasks, and\nthat demonstrate the ability of the framework to combine data for which only\npartial relationship information with respect to the target tasks is available.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:20:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sheng","Taoran",""],["Huber","Manfred",""]]}
{"id":"2308.03806","submitter":"Jeff Yan","authors":"Ping Wang, Shishir Nagaraja, Aur\\'elien Bourquard, Haichang Gao, Jeff\n  Yan","title":"SoK: Acoustic Side Channels","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a state-of-the-art analysis of acoustic side channels, cover all\nthe significant academic research in the area, discuss their security\nimplications and countermeasures, and identify areas for future research. We\nalso make an attempt to bridge side channels and inverse problems, two fields\nthat appear to be completely isolated from each other but have deep\nconnections.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 14:36:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Ping",""],["Nagaraja","Shishir",""],["Bourquard","Aur\u00e9lien",""],["Gao","Haichang",""],["Yan","Jeff",""]]}
{"id":"2308.03807","submitter":"Jianping Zhang","authors":"Xiaohong Fan, Yin Yang, Ke Chen, Yujie Feng, and Jianping Zhang","title":"Nest-DGIL: Nesterov-optimized Deep Geometric Incremental Learning for CS\n  Image Reconstruction","comments":"15 pages","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":"  Proximal gradient-based optimization is one of the most common strategies for\nsolving image inverse problems as well as easy to implement. However, these\ntechniques often generate heavy artifacts in image reconstruction. One of the\nmost popular refinement methods is to fine-tune the regularization parameter to\nalleviate such artifacts, but it may not always be sufficient or applicable due\nto increased computational costs. In this work, we propose a deep geometric\nincremental learning framework based on second Nesterov proximal gradient\noptimization. The proposed end-to-end network not only has the powerful\nlearning ability for high/low frequency image features,but also can\ntheoretically guarantee that geometric texture details will be reconstructed\nfrom preliminary linear reconstruction.Furthermore, it can avoid the risk of\nintermediate reconstruction results falling outside the geometric decomposition\ndomains and achieve fast convergence. Our reconstruction framework is\ndecomposed into four modules including general linear reconstruction, cascade\ngeometric incremental restoration, Nesterov acceleration and post-processing.\nIn the image restoration step,a cascade geometric incremental learning module\nis designed to compensate for the missing texture information from different\ngeometric spectral decomposition domains. Inspired by overlap-tile strategy, we\nalso develop a post-processing module to remove the block-effect in\npatch-wise-based natural image reconstruction. All parameters in the proposed\nmodel are learnable,an adaptive initialization technique of physical-parameters\nis also employed to make model flexibility and ensure converging smoothly. We\ncompare the reconstruction performance of the proposed method with existing\nstate-of-the-art methods to demonstrate its superiority. Our source codes are\navailable at https://github.com/fanxiaohong/Nest-DGIL.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 15:47:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fan","Xiaohong",""],["Yang","Yin",""],["Chen","Ke",""],["Feng","Yujie",""],["Zhang","Jianping",""]]}
{"id":"2308.03808","submitter":"Lance Cooley","authors":"Lance Cooley, Kathleen Amm, Whitney Hischier, Steven Rotkoff, and\n  David Larbalestier","title":"Business models to assure availability of advanced superconductors for\n  the accelerator sector and promote stewardship of superconducting magnet\n  technology for the US economy","comments":"28 pages not including appendices, 6 figures. arXiv admin note:\n  substantial text overlap with arXiv:2208.12379","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph cond-mat.supr-con","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Stakeholders representing concerns of national and global leadership,\nindustries that use superconducting magnets in products, manufacturers of\nsuperconducting wires and tapes that supply to industries, and innovation\ngenerators from small businesses and universities came together to address\nstewardship of superconducting magnet technology and assurance of supply of\nadvanced superconductors to the accelerator sector. This report outlines\npotential public-private partnerships that develop and enhance domestic\ncapabilities to meet the needs of science facilities in the accelerator systems\nsector and in the broader commercial ecosystem.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 19:30:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cooley","Lance",""],["Amm","Kathleen",""],["Hischier","Whitney",""],["Rotkoff","Steven",""],["Larbalestier","David",""]]}
{"id":"2308.03809","submitter":"Titus Masese PhD","authors":"Godwill Mbiti Kanyolo, Titus Masese, Yoshinobu Miyazaki, Shintaro\n  Tachibana, Chengchao Zhong, Yuki Orikasa, Tomohiro Saito","title":"Honeycomb Layered Frameworks with Metallophilic Bilayers","comments":"68 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Honeycomb layered frameworks with metallophilic bilayers have garnered\ntraction in various disciplines due to their unique configuration and numerous\nphysicochemical and topological properties, such as fast ionic conduction,\ncoordination chemistry, and structural defects. These properties make them\nattractive for energy storage applications, leading to increased attention\ntowards their metallophilic bilayer arrangements. This Review focuses on recent\nadvancements in this field, including characterisation techniques like X-ray\nabsorption spectroscopy and high-resolution transmission electron microscopy,\nparticularly for silver-based oxides. It also highlights strategies related to\ncationic-deficient phases induced by topology or temperature, expanding the\ncompositional space of honeycomb layered frameworks with a focus on cationic\nbilayer architectures. The Review further discusses theoretical approaches for\nunderstanding the bilayered structure, especially concerning critical phenomena\nat the monolayer-bilayer phase transition. Honeycomb layered frameworks are\ndescribed as optimised lattices within the congruent sphere packing problem,\nequivalent to a specific two-dimensional conformal field theory. The\nmonolayer-bilayer phase transition involves a 2D-to-3D crossover. Overall, this\nReview aims to provide a panoramic view of honeycomb layered frameworks with\nmetallophilic bilayers and their potential applications in the emerging field\nof quantum matter. It is valuable for recent graduates and experts alike across\ndiverse fields, extending beyond materials science and chemistry.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 00:21:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kanyolo","Godwill Mbiti",""],["Masese","Titus",""],["Miyazaki","Yoshinobu",""],["Tachibana","Shintaro",""],["Zhong","Chengchao",""],["Orikasa","Yuki",""],["Saito","Tomohiro",""]]}
{"id":"2308.03810","submitter":"Xingyu Li","authors":"Xingyu Li, Bo Tang, Haifeng Li","title":"AdaER: An Adaptive Experience Replay Approach for Continual Lifelong\n  Learning","comments":"18 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continual lifelong learning is an machine learning framework inspired by\nhuman learning, where learners are trained to continuously acquire new\nknowledge in a sequential manner. However, the non-stationary nature of\nstreaming training data poses a significant challenge known as catastrophic\nforgetting, which refers to the rapid forgetting of previously learned\nknowledge when new tasks are introduced. While some approaches, such as\nexperience replay (ER), have been proposed to mitigate this issue, their\nperformance remains limited, particularly in the class-incremental scenario\nwhich is considered natural and highly challenging. In this paper, we present a\nnovel algorithm, called adaptive-experience replay (AdaER), to address the\nchallenge of continual lifelong learning. AdaER consists of two stages: memory\nreplay and memory update. In the memory replay stage, AdaER introduces a\ncontextually-cued memory recall (C-CMR) strategy, which selectively replays\nmemories that are most conflicting with the current input data in terms of both\ndata and task. Additionally, AdaER incorporates an entropy-balanced reservoir\nsampling (E-BRS) strategy to enhance the performance of the memory buffer by\nmaximizing information entropy. To evaluate the effectiveness of AdaER, we\nconduct experiments on established supervised continual lifelong learning\nbenchmarks, specifically focusing on class-incremental learning scenarios. The\nresults demonstrate that AdaER outperforms existing continual lifelong learning\nbaselines, highlighting its efficacy in mitigating catastrophic forgetting and\nimproving learning performance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:25:45 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 16:23:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Xingyu",""],["Tang","Bo",""],["Li","Haifeng",""]]}
{"id":"2308.03811","submitter":"Sen Lin","authors":"Sen Lin, Daouda Sow, Kaiyi Ji, Yingbin Liang, Ness Shroff","title":"Non-Convex Bilevel Optimization with Time-Varying Objective Functions","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":"  Bilevel optimization has become a powerful tool in a wide variety of machine\nlearning problems. However, the current nonconvex bilevel optimization\nconsiders an offline dataset and static functions, which may not work well in\nemerging online applications with streaming data and time-varying functions. In\nthis work, we study online bilevel optimization (OBO) where the functions can\nbe time-varying and the agent continuously updates the decisions with online\nstreaming data. To deal with the function variations and the unavailability of\nthe true hypergradients in OBO, we propose a single-loop online bilevel\noptimizer with window averaging (SOBOW), which updates the outer-level decision\nbased on a window average of the most recent hypergradient estimations stored\nin the memory. Compared to existing algorithms, SOBOW is computationally\nefficient and does not need to know previous functions. To handle the unique\ntechnical difficulties rooted in single-loop update and function variations for\nOBO, we develop a novel analytical technique that disentangles the complex\ncouplings between decision variables, and carefully controls the hypergradient\nestimation error. We show that SOBOW can achieve a sublinear bilevel local\nregret under mild conditions. Extensive experiments across multiple domains\ncorroborate the effectiveness of SOBOW.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 06:27:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lin","Sen",""],["Sow","Daouda",""],["Ji","Kaiyi",""],["Liang","Yingbin",""],["Shroff","Ness",""]]}
{"id":"2308.03812","submitter":"Teun Van Nuland Dr.","authors":"Teun D. H. van Nuland","title":"Noncompact uniform universal approximation","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.FA math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The universal approximation theorem is generalised to uniform convergence on\nthe (noncompact) input space $\\mathbb R^n$. All continuous functions that\nvanish at infinity can be uniformly approximated by neural networks with one\nhidden layer, for all continuous activation functions $\\varphi\\neq0$ with\nasymptotically linear behaviour at $\\pm\\infty$. When $\\varphi$ is moreover\nbounded, we exactly determine which functions can be uniformly approximated by\nneural networks, with the following unexpected results. Let\n$\\overline{\\mathcal{N}_\\varphi^l(\\mathbb R^n)}$ denote the vector space of\nfunctions that are uniformly approximable by neural networks with $l$ hidden\nlayers and $n$ inputs. For all $n$ and all $l\\geq2$,\n$\\overline{\\mathcal{N}_\\varphi^l(\\mathbb R^n)}$ turns out to be an algebra\nunder the pointwise product. If the left limit of $\\varphi$ differs from its\nright limit (for instance, when $\\varphi$ is sigmoidal) the algebra\n$\\overline{\\mathcal{N}_\\varphi^l(\\mathbb R^n)}$ ($l\\geq2$) is independent of\n$\\varphi$ and $l$, and equals the closed span of products of sigmoids composed\nwith one-dimensional projections. If the left limit of $\\varphi$ equals its\nright limit, $\\overline{\\mathcal{N}_\\varphi^l(\\mathbb R^n)}$ ($l\\geq1$) equals\nthe (real part of the) commutative resolvent algebra, a C*-algebra which is\nused in mathematical approaches to quantum theory. In the latter case, the\nalgebra is independent of $l\\geq1$, whereas in the former case\n$\\overline{\\mathcal{N}_\\varphi^2(\\mathbb R^n)}$ is strictly bigger than\n$\\overline{\\mathcal{N}_\\varphi^1(\\mathbb R^n)}$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:54:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["van Nuland","Teun D. H.",""]]}
{"id":"2308.03813","submitter":"Marek Wodzinski","authors":"Marek Wodzinski, Mateusz Daniol, Daria Hemmerling, Miroslaw Socha","title":"High-Resolution Cranial Defect Reconstruction by Iterative,\n  Low-Resolution, Point Cloud Completion Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV cs.LG cs.NA math.NA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Each year thousands of people suffer from various types of cranial injuries\nand require personalized implants whose manual design is expensive and\ntime-consuming. Therefore, an automatic, dedicated system to increase the\navailability of personalized cranial reconstruction is highly desirable. The\nproblem of the automatic cranial defect reconstruction can be formulated as the\nshape completion task and solved using dedicated deep networks. Currently, the\nmost common approach is to use the volumetric representation and apply deep\nnetworks dedicated to image segmentation. However, this approach has several\nlimitations and does not scale well into high-resolution volumes, nor takes\ninto account the data sparsity. In our work, we reformulate the problem into a\npoint cloud completion task. We propose an iterative, transformer-based method\nto reconstruct the cranial defect at any resolution while also being fast and\nresource-efficient during training and inference. We compare the proposed\nmethods to the state-of-the-art volumetric approaches and show superior\nperformance in terms of GPU memory consumption while maintaining high-quality\nof the reconstructed defects.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:39:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wodzinski","Marek",""],["Daniol","Mateusz",""],["Hemmerling","Daria",""],["Socha","Miroslaw",""]]}
{"id":"2308.03814","submitter":"Maayan Zhitomirsky-Geffet Zhitomirsky-Geffet","authors":"Maor Weinberger, Maayan Zhitomirsky-Geffet and Dan Bouhnik","title":"Sex differences in attitudes towards online privacy and anonymity among\n  Israeli students with different technical backgrounds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Introduction. In this exploratory study, we proposed an experimental\nframework to investigate and model male/female differences in attitudes towards\nonline privacy and anonymity among Israeli students. Our aim was to\ncomparatively model men and women's online privacy attitudes, and to assess the\nonline privacy gender gap. Method. Various factors related to the user's online\nprivacy and anonymity were considered, such as awareness of anonymous threats\nmade online, concern for protecting personal information on the Internet,\nonline privacy self-efficacy, online privacy literacy and users' tendency to\nengage in privacy paradox behaviour, i.e., personal data disclosure despite the\nawareness of anonymity and privacy threats. Analysis. A user study was carried\nout among 169 Israeli academic students through a quantitative method using\nclosed-ended questionnaires. The subjects' responses were analysed using\nstandard statistical measures. We then proposed a summarized comparative model\nfor the two sexes' online privacy behaviour. Results. We found that a digital\ngap still exists between men and women regarding technological knowledge and\nskills used to protect their identity and personal information on the Web.\nInterestingly, users' tendency to engage in privacy paradox behaviour was not\nhigher among men despite their higher level of technological online privacy\nliteracy compared to women. Conclusions. Women's relatively high online privacy\nself-efficacy level and their low awareness of technological threat do not\nmatch their relatively low technological online privacy literacy level. This\nleads to a lower ability to protect their identity and personal information as\ncompared to men. We conclude that further steps should be taken to eliminate\nthe inter-gender technological gap in online privacy and anonymity awareness\nand literacy.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:36:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Weinberger","Maor",""],["Zhitomirsky-Geffet","Maayan",""],["Bouhnik","Dan",""]]}
{"id":"2308.03815","submitter":"Faizuddin Ahmed","authors":"Faizuddin Ahmed","title":"Topologically Charged Rotating Wormhole","comments":"7 pages; no figure, improved version","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a stationary metric ansatz represents rotating\ntraversable wormhole named topologically charged Schwarzschild-Klinkahmer\nwormhole space-time. We discuss geodesics motion of test particles and photon\nray around this topologically charged rotating wormhole background and analyze\nthe results.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:48:55 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 03:02:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ahmed","Faizuddin",""]]}
{"id":"2308.03816","submitter":"Benjamin Howard","authors":"Maria Fox, Benjamin Howard, and Naoki Imai","title":"Rapoport-Zink spaces of type GU(2,n-2)","comments":"55 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe the structure of the supersingular Rapoport-Zink space associated\nto the group of unitary similitudes of signature (2,n-2) for an unramified\nquadratic extension of p-adic fields. In earlier work, two of the authors\ndescribed the irreducible components in the category of\nschemes-up-to-perfection. The goal of this work is to remove the qualifier\n\"up-to-perfection\".\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:01:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fox","Maria",""],["Howard","Benjamin",""],["Imai","Naoki",""]]}
{"id":"2308.03817","submitter":"Ga\\v{s}per Vuga","authors":"Ga\\v{s}per Vuga, Bo\\v{s}tjan Mavri\\v{c}, Bo\\v{z}idar \\v{S}arler","title":"An improved local radial basis function method for solving small-strain\n  elasto-plasticity","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":"  Strong-form meshless methods received much attention in recent years and are\nbeing extensively researched and applied to a wide range of problems in science\nand engineering. However, the solution of elasto-plastic problems has proven to\nbe elusive because of often non-smooth constitutive relations between stress\nand strain. The novelty in tackling them is the introduction of virtual finite\ndifference stencils to formulate a hybrid radial basis function generated\nfinite difference (RBF-FD) method, which is used to solve smallstrain von Mises\nelasto-plasticity for the first time by this original approach. The paper\nfurther contrasts the new method to two alternative legacy RBF-FD approaches,\nwhich fail when applied to this class of problems. The three approaches differ\nin the discretization of the divergence operator found in the balance equation\nthat acts on the non-smooth stress field. Additionally, an innovative\nstabilization technique is employed to stabilize boundary conditions and is\nshown to be essential for any of the approaches to converge successfully.\nApproaches are assessed on elastic and elasto-plastic benchmarks where\nadmissible ranges of newly introduced free parameters are studied regarding\nstability, accuracy, and convergence rate.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:34:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Vuga","Ga\u0161per",""],["Mavri\u010d","Bo\u0161tjan",""],["\u0160arler","Bo\u017eidar",""]]}
{"id":"2308.03818","submitter":"Cesar F. Caiafa","authors":"Cesar F. Caiafa, Ramiro M. Irastorza","title":"A sparse coding approach to inverse problems with application to\n  microwave tomography imaging","comments":"submitted to RevMexAA (conference series)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inverse imaging problems that are ill-posed can be encountered across\nmultiple domains of science and technology, ranging from medical diagnosis to\nastronomical studies. To reconstruct images from incomplete and distorted data,\nit is necessary to create algorithms that can take into account both, the\nphysical mechanisms responsible for generating these measurements and the\nintrinsic characteristics of the images being analyzed. In this work, the\nsparse representation of images is reviewed, which is a realistic, compact and\neffective generative model for natural images inspired by the visual system of\nmammals. It enables us to address ill-posed linear inverse problems by training\nthe model on a vast collection of images. Moreover, we extend the application\nof sparse coding to solve the non-linear and ill-posed problem in microwave\ntomography imaging, which could lead to a significant improvement of the\nstate-of-the-arts algorithms.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:28:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Caiafa","Cesar F.",""],["Irastorza","Ramiro M.",""]]}
{"id":"2308.03819","submitter":"Zhiqian Chen","authors":"Zijian Zhang, Zonghan Zhang, Zhiqian Chen","title":"XFlow: Benchmarking Flow Behaviors over Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The occurrence of diffusion on a graph is a prevalent and significant\nphenomenon, as evidenced by the spread of rumors, influenza-like viruses, smart\ngrid failures, and similar events. Comprehending the behaviors of flow is a\nformidable task, due to the intricate interplay between the distribution of\nseeds that initiate flow propagation, the propagation model, and the topology\nof the graph. The study of networks encompasses a diverse range of academic\ndisciplines, including mathematics, physics, social science, and computer\nscience. This interdisciplinary nature of network research is characterized by\na high degree of specialization and compartmentalization, and the cooperation\nfacilitated by them is inadequate. From a machine learning standpoint, there is\na deficiency in a cohesive platform for assessing algorithms across various\ndomains. One of the primary obstacles to current research in this field is the\nabsence of a comprehensive curated benchmark suite to study the flow behaviors\nunder network scenarios.\n  To address this disparity, we propose the implementation of a novel benchmark\nsuite that encompasses a variety of tasks, baseline models, graph datasets, and\nevaluation tools. In addition, we present a comprehensive analytical framework\nthat offers a generalized approach to numerous flow-related tasks across\ndiverse domains, serving as a blueprint and roadmap. Drawing upon the outcomes\nof our empirical investigation, we analyze the advantages and disadvantages of\ncurrent foundational models, and we underscore potential avenues for further\nstudy. The datasets, code, and baseline models have been made available for the\npublic at: https://github.com/XGraphing/XFlow\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:49:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Zijian",""],["Zhang","Zonghan",""],["Chen","Zhiqian",""]]}
{"id":"2308.03820","submitter":"Sammy Alaoui Soulimani","authors":"Sammy Alaoui Soulimani and Martin G. Gulbrandsen","title":"Bridgeland stability conditions and skew lines on $\\mathbb{P}^3$","comments":"42 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inspired by Schmidt's work on twisted cubics, we study wall crossings in\nBridgeland stability, starting with the Hilbert scheme\n$\\mathrm{Hilb}^{2m+2}(\\mathbb{P}^3)$ parametrizing pairs of skew lines and\nplane conics union a point. We find two walls. Each wall crossing corresponds\nto a contraction of a divisor in the moduli space and the contracted space\nremains smooth. Building on work by Chen--Coskun--Nollet we moreover prove that\nthe contractions are $K$-negative extremal in the sense of Mori theory and so\nthe moduli spaces are projective.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:16:51 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Soulimani","Sammy Alaoui",""],["Gulbrandsen","Martin G.",""]]}
{"id":"2308.03821","submitter":"Benjamin Feuer","authors":"Benjamin Feuer, Ameya Joshi, Minh Pham, Chinmay Hegde","title":"Distributionally Robust Classification on a Data Budget","comments":"TMLR 2023; openreview link:\n  https://openreview.net/forum?id=D5Z2E8CNsD","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real world uses of deep learning require predictable model behavior under\ndistribution shifts. Models such as CLIP show emergent natural distributional\nrobustness comparable to humans, but may require hundreds of millions of\ntraining samples. Can we train robust learners in a domain where data is\nlimited? To rigorously address this question, we introduce JANuS (Joint\nAnnotations and Names Set), a collection of four new training datasets with\nimages, labels, and corresponding captions, and perform a series of carefully\ncontrolled investigations of factors contributing to robustness in image\nclassification, then compare those results to findings derived from a\nlarge-scale meta-analysis. Using this approach, we show that standard ResNet-50\ntrained with the cross-entropy loss on 2.4 million image samples can attain\ncomparable robustness to a CLIP ResNet-50 trained on 400 million samples. To\nour knowledge, this is the first result showing (near) state-of-the-art\ndistributional robustness on limited data budgets. Our dataset is available at\n\\url{https://huggingface.co/datasets/penfever/JANuS_dataset}, and the code used\nto reproduce our experiments can be found at\n\\url{https://github.com/penfever/vlhub/}.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:30:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Feuer","Benjamin",""],["Joshi","Ameya",""],["Pham","Minh",""],["Hegde","Chinmay",""]]}
{"id":"2308.03822","submitter":"LSC P&P Committee","authors":"The LIGO Scientific Collaboration, the Virgo Collaboration, and the\n  KAGRA Collaboration: A. G. Abac, R. Abbott, H. Abe, F. Acernese, K. Ackley,\n  C. Adamcewicz, S. Adhicary, N. Adhikari, R. X. Adhikari, V. K. Adkins, V. B.\n  Adya, C. Affeldt, D. Agarwal, M. Agathos, O. D. Aguiar, I. Aguilar, L.\n  Aiello, A. Ain, P. Ajith, T. Akutsu, S. Albanesi, R. A. Alfaidi, A. Al-Jodah,\n  C. All\\'en\\'e, A. Allocca, M. Almualla, P. A. Altin, S. \\'Alvarez-L\\'opez, A.\n  Amato, L. Amez-Droz, A. Amorosi, S. Anand, A. Ananyeva, R. Andersen, S. B.\n  Anderson, W. G. Anderson, M. Andia, M. Ando, T. Andrade, N. Andres, M.\n  Andr\\'es-Carcasona, T. Andri\\'c, S. Ansoldi, J. M. Antelis, S. Antier, M.\n  Aoumi, T. Apostolatos, E. Z. Appavuravther, S. Appert, S. K. Apple, K. Arai,\n  A. Araya, M. C. Araya, J. S. Areeda, N. Aritomi, F. Armato, N. Arnaud, M.\n  Arogeti, S. M. Aronson, K. G. Arun, G. Ashton, Y. Aso, M. Assiduo, S. Assis\n  de Souza Melo, S. M. Aston, P. Astone, F. Aubin, K. AultONeal, S. Babak, A.\n  Badalyan, F. Badaracco, C. Badger, S. Bae, S. Bagnasco, Y. Bai, J. G. Baier,\n  R. Bajpai, T. Baka, M. Ball, G. Ballardin, S. W. Ballmer, G. Baltus, S.\n  Banagiri, B. Banerjee, D. Bankar, P. Baral, J. C. Barayoga, J. Barber, B. C.\n  Barish, D. Barker, P. Barneo, F. Barone, B. Barr, L. Barsotti, M. Barsuglia,\n  D. Barta, S. D. Barthelmy, M. A. Barton, I. Bartos, S. Basak, A. Basalaev, R.\n  Bassiri, A. Basti, M. Bawaj, P. Baxi, J. C. Bayley, A. C. Baylor, M. Bazzan,\n  B. B\\'ecsy, V. M. Bedakihale, F. Beirnaert, M. Bejger, A. S. Bell, V.\n  Benedetto, D. Beniwal, W. Benoit, J. D. Bentley, M. Ben Yaala, S. Bera, M.\n  Berbel, F. Bergamin, B. K. Berger, S. Bernuzzi, M. Beroiz, C. P. L. Berry, D.\n  Bersanetti, A. Bertolini, J. Betzwieser, D. Beveridge, N. Bevins, R.\n  Bhandare, A. V. Bhandari, U. Bhardwaj, R. Bhatt, D. Bhattacharjee, S.\n  Bhaumik, A. Bianchi, I. A. Bilenko, M. Bilicki, G. Billingsley, A. Binetti,\n  S. Bini, O. Birnholtz, S. Biscans, M. Bischi, S. Biscoveanu, A. Bisht, M.\n  Bitossi, M.-A. Bizouard, J. K. Blackburn, C. D. Blair, D. G. Blair, F. Bobba,\n  N. Bode, M. Bo\\\"er, G. Bogaert, G. Boileau, M. Boldrini, G. N. Bolingbroke,\n  L. D. Bonavena, R. Bondarescu, F. Bondu, E. Bonilla, M. S. Bonilla, R.\n  Bonnand, P. Booker, V. Boschi, S. Bose, V. Bossilkov, V. Boudart, A. Bozzi,\n  C. Bradaschia, P. R. Brady, M. Braglia, A. Branch, M. Branchesi, M. Breschi,\n  T. Briant, A. Brillet, M. Brinkmann, P. Brockill, A. F. Brooks, D. D. Brown,\n  M. L. Brozzetti, S. Brunett, G. Bruno, R. Bruntz, J. Bryant, F. Bucci, J.\n  Buchanan, O. Bulashenko, T. Bulik, H. J. Bulten, A. Buonanno, K. Burtnyk, R.\n  Buscicchio, D. Buskulic, C. Buy, G. S. Cabourn Davies, G. Cabras, R. Cabrita,\n  L. Cadonati, G. Cagnoli, C. Cahillane, H. W. Cain III, J. Calder\\'on\n  Bustillo, J. D. Callaghan, T. A. Callister, E. Calloni, J. B. Camp, M.\n  Canepa, G. Caneva Santoro, M. Cannavacciuolo, K. C. Cannon, H. Cao, Z. Cao,\n  L. A. Capistran, E. Capocasa, E. Capote, G. Carapella, F. Carbognani, M.\n  Carlassara, J. B. Carlin, M. Carpinelli, J. J. Carter, G. Carullo, J.\n  Casanueva Diaz, C. Casentini, G. Castaldi, S. Y. Castro-Lucas, S. Caudill, M.\n  Cavagli\\`a, R. Cavalieri, G. Cella, P. Cerd\\'a-Dur\\'an, E. Cesarini, W.\n  Chaibi, S. Chalathadka-Subrahmanya, C. Chan, J. C. L. Chan, K. H. M. Chan, M.\n  Chan, W. L. Chan, K. Chandra, I. P. Chang, R.-J. Chang, W. Chang, P. Chanial,\n  S. Chao, C. Chapman-Bird, E. L. Charlton, P. Charlton, E. Chassande-Mottin,\n  L. Chastain, C. Chatterjee, Debarati Chatterjee, Deep Chatterjee, M.\n  Chaturvedi, S. Chaty, K. Chatziioannou, A. Chen, A. H.-Y. Chen, D. Chen, H.\n  Chen, H. Y. Chen, J. Chen, K. H. Chen, X. Chen, Y.-R. Chen, Y. Chen, H.\n  Cheng, P. Chessa, H. Y. Chia, F. Chiadini, C. Chiang, G. Chiarini, A. Chiba,\n  R. Chiba, R. Chierici, A. Chincarini, M. L. Chiofalo, A. Chiummo, C. Chou, S.\n  Choudhary, N. Christensen, S. S. Y. Chua, K. W. Chung, G. Ciani, P.\n  Ciecielag, M. Cie\\'slar, M. Cifaldi, A. A. Ciobanu, R. Ciolfi, F. Clara, J.\n  A. Clark, T. A. Clarke, P. Clearwater, S. Clesse, F. Cleva, E. Coccia, E.\n  Codazzo, P.-F. Cohadon, M. Colleoni, C. G. Collette, J. Collins, A. Colombo,\n  M. Colpi, C. M. Compton, L. Conti, S. J. Cooper, T. R. Corbitt, I.\n  Cordero-Carri\\'on, S. Corezzi, N. J. Cornish, A. Corsi, S. Cortese, C. A.\n  Costa, R. Cottingham, M. W. Coughlin, A. Couineaux, J.-P. Coulon, S. T.\n  Countryman, J.-F. Coupechoux, B. Cousins, P. Couvares, D. M. Coward, M. J.\n  Cowart, B. D. Cowburn, D. C. Coyne, R. Coyne, K. Craig, J. D. E. Creighton,\n  T. D. Creighton, A. W. Criswell, J. C. G. Crockett-Gray, M. Croquette, R.\n  Crouch, S. G. Crowder, J. R. Cudell, T. J. Cullen, A. Cumming, E. Cuoco, M.\n  Cury{\\l}o, M. Cusinato, P. Dabadie, T. Dal Canton, S. Dall'Osso, G. D\\'alya,\n  B. D'Angelo, S. Danilishin, S. D'Antonio, K. Danzmann, K. E. Darroch, C.\n  Darsow-Fromm, L. P. Dartez, A. Dasgupta, S. Datta, V. Dattilo, A. Daumas, I.\n  Dave, A. Davenport, M. Davier, D. Davis, M. C. Davis, E. J. Daw, M. Dax, M.\n  Deenadayalan, J. Degallaix, M. De Laurentis, S. Del\\'eglise, V. Del Favero,\n  F. De Lillo, D. Dell'Aquila, W. Del Pozzo, F. De Marco, F. De Matteis, V.\n  D'Emilio, N. Demos, T. Dent, A. Depasse, R. De Pietri, R. De Rosa, C. De\n  Rossi, R. De Simone, S. Dhurandhar, R. Diab, P. Z. Diamond, M. C. D\\'iaz, N.\n  A. Didio, T. Dietrich, L. Di Fiore, C. Di Fronzo, F. Di Giovanni, M. Di\n  Giovanni, T. Di Girolamo, D. Diksha, A. Di Lieto, A. Di Michele, J. Ding, S.\n  Di Pace, I. Di Palma, F. Di Renzo, Divyajyoti, A. Dmitriev, Z. Doctor, E.\n  Dohmen, P. P. Doleva, L. Donahue, L. D'Onofrio, F. Donovan, K. L. Dooley, T.\n  Dooney, S. Doravari, O. Dorosh, M. Drago, J. C. Driggers, Y. Drori, H. Du,\n  J.-G. Ducoin, L. Dunn, U. Dupletsa, D. D'Urso, H. Duval, P.-A. Duverne, S. E.\n  Dwyer, C. Eassa, M. Ebersold, T. Eckhardt, G. Eddolls, B. Edelman, T. B. Edo,\n  O. Edy, A. Effler, J. Eichholz, H. Einsle, M. Eisenmann, R. A. Eisenstein, A.\n  Ejlli, E. Engelby, A. J. Engl, L. Errico, R. C. Essick, H. Estell\\'es, D.\n  Estevez, T. Etzel, C. R. Evans, M. Evans, T. M. Evans, T. Evstafyeva, B. E.\n  Ewing, J. M. Ezquiaga, F. Fabrizi, F. Faedi, V. Fafone, H. Fair, S.\n  Fairhurst, P. C. Fan, A. M. Farah, B. Farr, W. M. Farr, E. J. Fauchon-Jones,\n  G. Favaro, M. Favata, M. Fays, J. Feicht, M. M. Fejer, E. Fenyvesi, D. L.\n  Ferguson, I. Ferrante, T. A. Ferreira, F. Fidecaro, A. Fiori, I. Fiori, M.\n  Fishbach, R. P. Fisher, R. Fittipaldi, V. Fiumara, R. Flaminio, S. M.\n  Fleischer, L. S. Fleming, E. Floden, H. Fong, J. A. Font, B. Fornal, P. W. F.\n  Forsyth, K. Franceschetti, A. Franke, S. Frasca, F. Frasconi, A. Frattale\n  Mascioli, Z. Frei, A. Freise, O. Freitas, R. Frey, W. Frischhertz, P.\n  Fritschel, V. V. Frolov, G. G. Fronz\\'e, S. Fujii, I. Fukunaga, P. Fulda, M.\n  Fyffe, W. E. Gabella, B. Gadre, J. R. Gair, J. Gais, S. Galaudage, S.\n  Gallardo, R. Gamba, D. Ganapathy, A. Ganguly, S. G. Gaonkar, B. Garaventa, J.\n  Garcia-Bellido, C. Garc\\'ia-N\\'u\\~nez, C. Garc\\'ia-Quir\\'os, J. W. Gardner,\n  K. A. Gardner, J. Gargiulo, F. Garufi, C. Gasbarra, B. Gateley, V. Gayathri,\n  G. Gemme, A. Gennai, J. George, O. Gerberding, L. Gergely, N. Ghadiri,\n  Abhirup Ghosh, Archisman Ghosh, Shaon Ghosh, Shrobana Ghosh, Suprovo Ghosh,\n  Tathagata Ghosh, L. Giacoppo, J. A. Giaime, K. D. Giardina, D. R. Gibson, C.\n  Gier, P. Giri, F. Gissi, S. Gkaitatzis, J. Glanzer, A. E. Gleckl, F. Glotin,\n  J. Godfrey, P. Godwin, E. Goetz, R. Goetz, J. Golomb, S. Gomez Lopez, B.\n  Goncharov, G. Gonz\\'alez, A. W. Goodwin-Jones, M. Gosselin, R. Gouaty, D. W.\n  Gould, S. Goyal, B. Grace, A. Grado, V. Graham, A. E. Granados, M. Granata,\n  V. Granata, S. Gras, P. Grassia, C. Gray, R. Gray, G. Greco, A. C. Green, S.\n  M. Green, S. R. Green, A. M. Gretarsson, E. M. Gretarsson, D. Griffith, W. L.\n  Griffiths, H. L. Griggs, G. Grignani, A. Grimaldi, C. Grimaud, H. Grote, A.\n  S. Gruson, D. Guerra, D. Guetta, G. M. Guidi, A. R. Guimaraes, H. K. Gulati,\n  F. Gulminelli, A. M. Gunny, H. Guo, Y. Guo, Anchal Gupta, Anuradha Gupta, Ish\n  Gupta, N. C. Gupta, P. Gupta, S. K. Gupta, N. Gupte, R. Gurav, J. Gurs, E. K.\n  Gustafson, N. Gutierrez, F. Guzman, D. Haba, L. Haegel, G. Hain, 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. A. Hannuksela, A. G. Hanselman, H. Hansen, J.\n  Hanson, R. Harada, T. Harder, K. Haris, T. Harmark, J. Harms, G. M. Harry, I.\n  W. Harry, D. Hartwig, B. Haskell, C.-J. Haster, J. S. Hathaway, K. Haughian,\n  H. Hayakawa, K. Hayama, F. J. Hayes, J. Healy, A. Heffernan, A. Heidmann, M.\n  C. 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.-S. Hennig,\n  M. Hennig, C. Henshaw, A. Hernandez, T. Hertog, M. Heurs, A. L. Hewitt, S.\n  Higginbotham, S. Hild, P. Hill, Y. Himemoto, A. S. Hines, N. Hirata, C.\n  Hirose, J. Ho, S. Hoang, S. Hochheim, D. Hofman, J. N. Hohmann, N. A.\n  Holland, K. Holley-Bockelmann, I. J. Hollows, Z. J. Holmes, D. E. Holz, C.\n  Hong, Q. Hong, J. Hornung, S. Hoshino, J. Hough, S. Hourihane, E. J. Howell,\n  C. G. Hoy, D. Hoyland, H.-F. Hsieh, C. Hsiung, H. C. Hsu, S.-C. Hsu, W.-F.\n  Hsu, P. Hu, Q. Hu, H. Y. Huang, Y.-J. Huang, Y. Huang, Y. T. Huang, M. T.\n  H\\\"ubner, A. D. Huddart, B. Hughey, D. C. Y. Hui, V. Hui, R. Hur, S. Husa, R.\n  Huxford, T. Huynh-Dinh, J. Hyland, A. Iakovlev, G. A. Iandolo, A. Iess, K.\n  Inayoshi, Y. Inoue, G. Iorio, P. Iosif, J. Irwin, M. Isi, M. A. Ismail, Y.\n  Itoh, M. Iwaya, B. R. Iyer, V. JaberianHamedan, T. Jacqmin, P.-E. Jacquet, S.\n  J. Jadhav, S. P. Jadhav, D. Jain, T. Jain, A. L. James, P. A. James, R.\n  Jamshidi, A. Z. Jan, K. Jani, L. Janiurek, J. Janquart, K. Janssens, N. N.\n  Janthalur, S. Jaraba, P. Jaranowski, S. Jarov, P. Jasal, R. Jaume, W. Javed,\n  K. Jenner, A. Jennings, W. Jia, J. Jiang, H.-B. Jin, K. Johansmeyer, G. R.\n  Johns, N. A. Johnson, R. Johnston, N. Johny, D. H. Jones, D. I. Jones, R.\n  Jones, P. Joshi, L. Ju, K. Jung, J. Junker, V. Juste, T. Kajita, C.\n  Kalaghatgi, V. Kalogera, M. Kamiizumi, N. Kanda, S. Kandhasamy, G. Kang, J.\n  B. Kanner, S. J. Kapadia, D. P. Kapasi, S. Karat, C. Karathanasis, S. Karki,\n  T. Karydas, Y. A. Kas-danouche, R. Kashyap, M. Kasprzack, W. Kastaun, J.\n  Kato, T. Kato, S. Katsanevas, E. Katsavounidis, J. K. Katsuren, W. Katzman,\n  T. Kaur, K. Kawabe, F. K\\'ef\\'elian, D. Keitel, J. Kelley-Derzon, S. A.\n  Kemper, J. Kennington, R. Kesharwani, J. S. Key, S. Khadka, F. Y. Khalili, T.\n  Khanam, E. A. Khazanov, M. Khursheed, N. Kijbunchoo, C. Kim, J. C. Kim, K.\n  Kim, M. H. Kim, P. Kim, S. Kim, W. S. Kim, Y.-M. Kim, C. Kimball, N. Kimura,\n  M. Kinley-Hanlon, R. Kirchhoff, J. S. Kissel, T. Kiyota, S. Klimenko, T.\n  Klinger, A. M. Knee, N. Knust, P. Koch, S. M. Koehlenbeck, G. Koekoek, K.\n  Kohri, K. Kokeyama, S. Koley, N. D. Koliadko, P. Kolitsidou, M. Kolstein, K.\n  Komori, V. Kondrashov, A. K. H. Kong, A. Kontos, M. Korobko, R. V. Kossak, N.\n  Kouvatsos, M. Kovalam, N. Koyama, D. B. Kozak, S. L. Kranzhoff, V. Kringel,\n  N. V. Krishnendu, A. Kr\\'olak, G. Kuehn, P. Kuijer, S. Kulkarni, A. Kulur\n  Ramamohan, A. Kumar, Praveen Kumar, Prayush Kumar, Rahul Kumar, Rakesh Kumar,\n  J. Kume, K. Kuns, S. Kuroyanagi, S. Kuwahara, K. Kwak, K. Kwan, G. Lacaille,\n  P. Lagabbe, D. Laghi, S. Lai, M. H. Lakkis, E. Lalande, M. Lalleman, A.\n  Lamberts, M. Landry, B. B. Lane, R. N. Lang, J. Lange, B. Lantz, A. La Rana,\n  I. La Rosa, A. Lartaux-Vollard, P. D. Lasky, J. Lawrence, M. Laxen, A.\n  Lazzarini, C. Lazzaro, P. Leaci, S. Leavey, S. LeBohec, Y. K. Lecoeuche, H.\n  M. Lee, H. W. Lee, K. Lee, R.-K. Lee, R. Lee, S. Lee, Y. Lee, I. N. Legred,\n  J. Lehmann, L. Lehner, A. Lema\\^itre, M. Lenti, M. Leonardi, E. Leonova, N.\n  Leroy, M. Lesovsky, N. Letendre, M. Lethuillier, C. Levesque, Y. Levin, K.\n  Leyde, A. K. Y. Li, K. L. Li, T. G. F. Li, X. Li, Chien-Yu Lin, Chun-Yu Lin,\n  E. T. Lin, F. Lin, H. Lin, L. C.-C. Lin, Y. Lin, F. Linde, S. D. Linker, T.\n  B. Littenberg, A. Liu, G. C. Liu, Jian Liu, F. Llamas, R. K. L. Lo, T. Lo,\n  J.-P. Locquet, L. London, A. Longo, D. Lopez, M. Lopez Portilla, M.\n  Lorenzini, V. Loriette, M. Lormand, G. Losurdo, T. P. Lott, J. D. Lough, H.\n  A. Loughlin, C. O. Lousto, G. Lovelace, M. J. Lowry, H. L\\\"uck, D. Lumaca, A.\n  P. Lundgren, A. W. Lussier, J. E. Lynam, L.-T. Ma, S. Ma, M. Ma'arif, R.\n  Macas, M. MacInnis, D. M. Macleod, I. A. O. MacMillan, A. Macquet, K. Maeda,\n  S. Maenaut, I. Maga\\~na Hernandez, C. Magazz\\`u, R. M. Magee, R. Maggiore, M.\n  Magnozzi, M. Mahesh, S. Mahesh, M. Maini, S. Majhi, E. Majorana, C. N.\n  Makarem, S. Maliakal, A. Malik, N. Man, V. Mandic, V. Mangano, B. Mannix, G.\n  L. Mansell, G. Mansingh, M. Manske, M. Mantovani, M. Mapelli, F. Marchesoni,\n  D. Mar\\'in Pina, F. Marion, S. M\\'arka, Z. M\\'arka, C. Markakis, A. S.\n  Markosyan, A. Markowitz, E. Maros, A. Marquina, S. Marsat, F. Martelli, I. W.\n  Martin, R. M. Martin, B. B. Martinez, M. Martinez, V. A. Martinez, V.\n  Martinez, A. Martini, K. Martinovic, D. V. Martynov, E. J. Marx, H.\n  Masalehdan, A. Masserot, M. Masso-Reid, M. Mastrodicasa, S. Mastrogiovanni,\n  M. Mateu-Lucena, M. Matiushechkina, M. Matsuyama, N. Mavalvala, N. Maxwell,\n  G. McCarrol, R. McCarthy, D. E. McClelland, S. McCormick, L. McCuller, G. I.\n  McGhee, J. McGinn, M. Mchedlidze, C. McIsaac, J. McIver, K. McKinney, A.\n  McLeod, T. McRae, S. T. McWilliams, D. Meacher, M. Mehmet, A. K. Mehta, Q.\n  Meijer, A. Melatos, S. Mellaerts, A. Menendez-Vazquez, C. S. Menoni, R. A.\n  Mercer, L. Mereni, K. Merfeld, E. L. Merilh, J. D. Merritt, M. Merzougui, C.\n  Messenger, C. Messick, M. Meyer-Conde, F. Meylahn, A. Mhaske, A. Miani, H.\n  Miao, I. Michaloliakos, C. Michel, Y. Michimura, H. Middleton, D. P.\n  Mihaylov, A. L. Miller, A. Miller, B. Miller, S. Miller, M. Millhouse, E.\n  Milotti, Y. Minenkov, N. Mio, Ll. M. Mir, L. Mirasola, M. Miravet-Ten\\'es, C.\n  . Miritescu, A. Mishkin, A. Mishra, C. Mishra, T. Mishra, T. Mistry, A. L.\n  Mitchell, S. Mitra, V. P. Mitrofanov, G. Mitselmakher, R. Mittleman, O.\n  Miyakawa, S. Miyamoto, S. Miyoki, G. Mo, L. Mobilia, L. M. Modafferi, S. R.\n  P. Mohapatra, S. R. Mohite, M. Molina-Ruiz, C. Mondal, M. Mondin, M. Montani,\n  C. J. Moore, M. Morales, D. Moraru, F. Morawski, A. More, S. More, C. Moreno,\n  G. Moreno, S. Morisaki, Y. Moriwaki, G. Morras, A. Moscatello, B. Mours, C.\n  M. Mow-Lowry, S. Mozzon, F. Muciaccia, Arunava Mukherjee, D. Mukherjee, Soma\n  Mukherjee, Subroto Mukherjee, Suvodip Mukherjee, N. Mukund, A. Mullavey, J.\n  Munch, E. A. Mu\\~niz, M. Murakoshi, P. G. Murray, S. Muusse, S. L. Nadji, A.\n  Nagar, T. Nagar, N. Nagarajan, K. Nakamura, H. Nakano, M. Nakano, V.\n  Napolano, I. Nardecchia, T. Narikawa, H. Narola, L. Naticchioni, R. K. Nayak,\n  B. F. Neil, J. Neilson, A. Nelson, T. J. N. Nelson, M. Nery, S. Nesseris, A.\n  Neunzert, K. Y. Ng, S. W. S. Ng, C. Nguyen, P. Nguyen, L. Nguyen Quynh, S. A.\n  Nichols, G. Nieradka, A. Niko, Y. Nishino, A. Nishizawa, S. Nissanke, E.\n  Nitoglia, W. Niu, F. Nocera, M. Norman, C. North, J. Novak, J. F. Nu\\~no\n  Siles, G. Nurbek, L. K. Nuttall, K. Obayashi, J. Oberling, J. O'Dell, E.\n  Oelker, M. Oertel, A. Offermans, G. Oganesyan, J. J. Oh, K. Oh, S. H. Oh, T.\n  O'Hanlon, M. Ohashi, M. Ohkawa, F. Ohme, H. Ohta, A. S. Oliveira, R. Oliveri,\n  V. Oloworaran, B. O'Neal, K. Oohara, B. O'Reilly, R. G. Ormiston, N. D.\n  Ormsby, M. Orselli, R. O'Shaughnessy, Y. Oshima, S. Oshino, S. Ossokine, C.\n  Osthelder, D. J. Ottaway, A. Ouzriat, H. Overmier, A. E. Pace, R. Pagano, M.\n  A. Page, A. Pai, S. A. Pai, A. Pal, S. Pal, O. Palashov, M. P\\'alfi, C.\n  Palomba, K.-C. Pan, P. K. Panda, L. Panebianco, P. T. H. Pang, F. Pannarale,\n  B. C. Pant, F. H. Panther, C. D. Panzer, F. Paoletti, A. Paoli, A. Paolone,\n  E. E. Papalexakis, L. Papalini, G. Pappas, A. Parisi, J. Park, W. Parker, D.\n  Pascucci, A. Pasqualetti, R. Passaquieti, D. Passuello, M. Patel, D. Pathak,\n  M. Pathak, A. Patra, B. Patricelli, A. S. Patron, S. Paul, E. Payne, T.\n  Pearce, M. Pedraza, R. Pegna, M. Pegoraro, A. Pele, F. E. Pe\\~na Arellano, S.\n  Penn, A. Perego, A. Pereira, C. J. Perez, J. J. Perez, L. H. Perez, C.\n  P\\'erigois, C. C. Perkins, A. Perreca, J. Perret, S. Perri\\`es, J. W. Perry,\n  D. Pesios, J. Petermann, C. Petrillo, H. P. Pfeiffer, H. Pham, K. A. Pham, K.\n  S. Phukon, H. Phurailatpam, O. J. Piccinni, M. Pichot, M. Piendibene, F.\n  Piergiovanni, L. Pierini, G. Pierra, V. Pierro, M. . Pietrzak, G. Pillant, M.\n  Pillas, F. Pilo, L. Pinard, C. Pineda-Bosque, I. M. Pinto, M. Pinto, B. J.\n  Piotrzkowski, M. Pirello, M. D. Pitkin, A. Placidi, E. Placidi, M. L. Planas,\n  W. Plastino, R. Poggiani, E. Polini, L. Pompili, S. Ponrathnam, J. Poon, E.\n  Porcelli, J. Portell, E. K. Porter, C. Posnansky, R. Poulton, J. Powell, M.\n  Pracchia, B. K. Pradhan, T. Pradier, A. K. Prajapati, K. Prasai, R. Prasanna,\n  P. Prasia, G. Pratten, M. Principe, G. A. Prodi, L. Prokhorov, P. Prosposito,\n  L. Prudenzi, A. Puecher, J. Pullin, M. Punturo, F. Puosi, P. Puppo, M.\n  P\\\"urrer, H. Qi, J. Qin, V. Quetschke, P. J. Quinonez, R. Quitzow-James, F.\n  J. Raab, G. Raaijmakers, N. Radulesco, P. Raffai, S. X. Rail, S. Raja, C.\n  Rajan, K. E. Ramirez, A. Ramos-Buades, D. Rana, E. Randel, P. R. Rangnekar,\n  P. Rapagnani, A. Ray, V. Raymond, M. Razzano, J. Read, M. Recaman Payo, T.\n  Regimbau, L. Rei, S. Reid, S. W. Reid, D. H. Reitze, P. Relton, A. Renzini,\n  P. Rettegno, B. Revenu, A. Reza, M. Rezac, A. S. Rezaei, F. Ricci, M. Ricci,\n  D. Richards, J. W. Richardson, A. Rijal, K. Riles, H. K. Riley, S. Rinaldi,\n  C. Robertson, N. A. Robertson, F. Robinet, M. Robinson, A. Rocchi, L.\n  Rolland, J. G. Rollins, M. Romanelli, A. E. Romano, R. Romano, A. Romero, I.\n  M. Romero-Shaw, J. H. Romie, S. Ronchini, T. J. Roocke, L. Rosa, T. J.\n  Rosauer, C. A. Rose, D. Rosi\\'nska, M. P. Ross, M. Rossello, S. Rowan, S.\n  Roy, A. Royzman, D. Rozza, P. Ruggi, E. Ruiz Morales, K. Ruiz-Rocha, S.\n  Sachdev, T. Sadecki, J. Sadiq, P. Saffarieh, S. S. Saha, T. Sainrat, S.\n  Sajith Menon, K. Sakai, M. Sakellariadou, T. Sako, S. Sakon, O. S. Salafia,\n  F. Salces-Carcoba, L. Salconi, M. Saleem, F. Salemi, M. Sall\\'e, S. Salvador,\n  A. Sanchez, E. J. Sanchez, J. H. Sanchez, L. E. Sanchez, N. Sanchis-Gual, J.\n  R. Sanders, E. M. S\\\"anger, T. R. Saravanan, N. Sarin, A. Sasli, P. Sassi, B.\n  Sassolas, H. Satari, R. Sato, S. Sato, Y. Sato, O. Sauter, R. L. Savage, V.\n  Savant, T. Sawada, H. L. Sawant, S. Sayah, D. Schaetzl, M. Scheel, S. J.\n  Scherf, J. Scheuer, M. G. Schiworski, P. Schmidt, S. Schmidt, S. J. Schmitz,\n  R. Schnabel, M. Schneewind, R. M. S. Schofield, A. Sch\\\"onbeck, K.\n  Schouteden, H. Schuler, B. W. Schulte, B. F. Schutz, E. Schwartz, J. Scott,\n  S. M. Scott, T. C. Seetharamu, M. Seglar-Arroyo, Y. Sekiguchi, D. Sellers, A.\n  S. Sengupta, D. Sentenac, E. G. Seo, J. W. Seo, V. Sequino, G. Servignat, Y.\n  Setyawati, T. Shaffer, M. S. Shahriar, M. A. Shaikh, B. Shams, L. Shao, P.\n  Sharma, S. Sharma-Chaudhary, P. Shawhan, N. S. Shcheblanov, A. Sheela, B.\n  Shen, K. G. Shepard, Y. Shikano, M. Shikauchi, K. Shimode, H. Shinkai, J.\n  Shiota, D. H. Shoemaker, D. M. Shoemaker, R. W. Short, S. ShyamSundar, A.\n  Sider, H. Siegel, M. Sieniawska, D. Sigg, L. Silenzi, M. Simmonds, L. P.\n  Singer, A. Singh, D. Singh, M. K. Singh, A. Singha, A. M. Sintes, V. Sipala,\n  V. Skliris, B. J. J. Slagmolen, T. J. Slaven-Blair, J. Smetana, J. R. Smith,\n  L. Smith, R. J. E. Smith, J. Soldateschi, S. N. Somala, K. Somiya, K. Soni,\n  S. Soni, V. Sordini, F. Sorrentino, N. Sorrentino, R. Soulard, T. Souradeep,\n  E. Sowell, V. Spagnuolo, A. P. Spencer, M. Spera, P. Spinicelli, A. K.\n  Srivastava, V. Srivastava, C. Stachie, F. Stachurski, D. A. Steer, J.\n  Steinlechner, S. Steinlechner, N. Stergioulas, P. Stevens, M. StPierre, L. C.\n  Strang, G. Stratta, M. D. Strong, A. Strunk, R. Sturani, A. L. Stuver, M.\n  Suchenek, S. Sudhagar, N. Sueltmann, H. G. Suh, A. G. Sullivan, T. Z.\n  Summerscales, L. Sun, S. Sunil, A. Sur, J. Suresh, P. J. Sutton, Takamasa\n  Suzuki, Takanori Suzuki, B. L. Swinkels, A. Syx, M. J. Szczepa\\'nczyk, P.\n  Szewczyk, M. Tacca, H. Tagoshi, S. C. Tait, H. Takahashi, R. Takahashi, A.\n  Takamori, K. Takatani, H. Takeda, M. Takeda, C. J. Talbot, C. Talbot, M.\n  Tamaki, N. Tamanini, D. Tanabe, K. Tanaka, S. J. Tanaka, T. Tanaka, A. J.\n  Tanasijczuk, S. Tanioka, D. B. Tanner, D. Tao, L. Tao, R. D. Tapia, E. N.\n  Tapia San Mart\\'in, R. Tarafder, C. Taranto, A. Taruya, J. D. Tasson, M.\n  Teloi, R. Tenorio, L. Terkowski, H. Themann, M. P. Thirugnanasambandam, L. M.\n  Thomas, M. Thomas, P. Thomas, J. E. Thompson, S. R. Thondapu, K. A. Thorne,\n  E. Thrane, J. Tissino, Shubhanshu Tiwari, Srishti Tiwari, V. Tiwari, A. M.\n  Toivonen, A. E. Tolley, T. Tomaru, K. Tomita, T. Tomura, M. Tonelli, A.\n  Toriyama, A. Torres-Forn\\'e, C. I. Torrie, M. Toscani, I. Tosta e Melo, E.\n  Tournefier, A. A. Trani, A. Trapananti, F. Travasso, G. Traylor, J. Trenado,\n  M. Trevor, M. C. Tringali, A. Tripathee, L. Troiano, A. Trovato, L. Trozzo,\n  R. J. Trudeau, M. Tse, R. Tso, S. Tsuchida, L. Tsukada, T. Tsutsui, K.\n  Turbang, M. Turconi, C. Turski, H. Ubach, A. S. Ubhi, N. Uchikata, T.\n  Uchiyama, R. P. Udall, T. Uehara, K. Ueno, C. S. Unnikrishnan, T. Ushiba, A.\n  Utina, H. Vahlbruch, N. Vaidya, G. Vajente, A. Vajpeyi, G. Valdes, M.\n  Valentini, S. A. Vallejo-Pe\\~na, S. Vallero, V. Valsan, N. van Bakel, M. van\n  Beuzekom, M. van Dael, J. F. J. van den Brand, C. Van Den Broeck, D. C.\n  Vander-Hyde, M. van der Sluys, A. Van de Walle, J. van Dongen, H. van\n  Haevermaet, J. V. van Heijningen, J. Vanosky, M. H. P. M. van Putten, Z. van\n  Ranst, N. van Remortel, M. Vardaro, A. F. Vargas, V. Varma, M. Vas\\'uth, A.\n  Vecchio, G. Vedovato, J. Veitch, P. J. Veitch, J. Venneberg, P. Verdier, D.\n  Verkindt, P. Verma, Y. Verma, S. M. Vermeulen, D. Veske, F. Vetrano, A.\n  Veutro, A. Vicer\\'e, S. Vidyant, A. D. Viets, A. Vijaykumar, V. Villa-Ortega,\n  E. T. Vincent, J.-Y. Vinet, S. Viret, A. Virtuoso, S. Vitale, H. Vocca, D.\n  Voigt, E. R. G. von Reis, J. S. A. von Wrangel, S. P. Vyatchanin, L. E. Wade,\n  M. Wade, K. J. Wagner, R. C. Walet, M. Walker, G. S. Wallace, L. Wallace, H.\n  Wang, J. Z. Wang, W. H. Wang, R. L. Ward, J. Warner, M. Was, T. Washimi, N.\n  Y. Washington, K. Watada, D. Watarai, K. E. Wayt, B. Weaver, C. R. Weaving,\n  S. A. Webster, M. Weinert, A. J. Weinstein, R. Weiss, C. M. Weller, R. A.\n  Weller, F. Wellmann, L. Wen, P. We{\\ss}els, K. Wette, J. T. Whelan, D. D.\n  White, B. F. Whiting, C. Whittle, J. B. Wildberger, O. S. Wilk, D. Wilken, K.\n  Willetts, D. Williams, M. J. Williams, A. R. Williamson, J. L. Willis, B.\n  Willke, M. Wils, C. C. Wipf, G. Woan, J. Woehler, J. K. Wofford, D. Wong, H.\n  T. Wong, I. C. F. Wong, M. Wright, C. Wu, D. S. Wu, H. Wu, D. M. Wysocki, L.\n  Xiao, V. A. Xu, N. Yadav, H. Yamamoto, K. Yamamoto, M. Yamamoto, T. S.\n  Yamamoto, T. Yamamoto, S. Yamamura, R. Yamazaki, S. Yan, F. W. Yang, K. Z.\n  Yang, L.-C. Yang, Y.-C. Yang, Yang Yang, Yi Yang, M. J. Yap, Z. Yarbrough,\n  S.-W. Yeh, A. B. Yelikar, S. M. C. Yeung, T. Y. Yeung, J. Yokoyama, T.\n  Yokozawa, J. Yoo, H. Yu, H. Yuzurihara, A. Zadro\\.zny, A. J. Zannelli, M.\n  Zanolin, M. Zeeshan, T. Zelenova, J.-P. Zendri, M. Zevin, J. Zhang, L. Zhang,\n  R. Zhang, T. Zhang, Yanqi Zhang, Ya Zhang, C. Zhao, Yue Zhao, Yuhang Zhao, Y.\n  Zheng, H. Zhong, R. Zhou, Z.-H. Zhu, A. B. Zimmerman, M. E. Zucker, J.\n  Zweizig","title":"Search for Eccentric Black Hole Coalescences during the Third Observing\n  Run of LIGO and Virgo","comments":"24 pages, 5 figures","journal-ref":null,"doi":null,"report-no":"LIGO-P2300080","categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the growing number of confident binary black hole coalescences\nobserved through gravitational waves so far, the astrophysical origin of these\nbinaries remains uncertain. Orbital eccentricity is one of the clearest tracers\nof binary formation channels. Identifying binary eccentricity, however, remains\nchallenging due to the limited availability of gravitational waveforms that\ninclude effects of eccentricity. Here, we present observational results for a\nwaveform-independent search sensitive to eccentric black hole coalescences,\ncovering the third observing run (O3) of the LIGO and Virgo detectors. We\nidentified no new high-significance candidates beyond those that were already\nidentified with searches focusing on quasi-circular binaries. We determine the\nsensitivity of our search to high-mass (total mass $M>70$ $M_\\odot$) binaries\ncovering eccentricities up to 0.3 at 15 Hz orbital frequency, and use this to\ncompare model predictions to search results. Assuming all detections are indeed\nquasi-circular, for our fiducial population model, we place an upper limit for\nthe merger rate density of high-mass binaries with eccentricities $0 < e \\leq\n0.3$ at $0.33$ Gpc$^{-3}$ yr$^{-1}$ at 90\\% confidence level.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 15:54:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["The LIGO Scientific Collaboration","",""],["the Virgo Collaboration","",""],["the KAGRA Collaboration","",""],["Abac","A. G.",""],["Abbott","R.",""],["Abe","H.",""],["Acernese","F.",""],["Ackley","K.",""],["Adamcewicz","C.",""],["Adhicary","S.",""],["Adhikari","N.",""],["Adhikari","R. X.",""],["Adkins","V. K.",""],["Adya","V. B.",""],["Affeldt","C.",""],["Agarwal","D.",""],["Agathos","M.",""],["Aguiar","O. D.",""],["Aguilar","I.",""],["Aiello","L.",""],["Ain","A.",""],["Ajith","P.",""],["Akutsu","T.",""],["Albanesi","S.",""],["Alfaidi","R. A.",""],["Al-Jodah","A.",""],["All\u00e9n\u00e9","C.",""],["Allocca","A.",""],["Almualla","M.",""],["Altin","P. A.",""],["\u00c1lvarez-L\u00f3pez","S.",""],["Amato","A.",""],["Amez-Droz","L.",""],["Amorosi","A.",""],["Anand","S.",""],["Ananyeva","A.",""],["Andersen","R.",""],["Anderson","S. B.",""],["Anderson","W. G.",""],["Andia","M.",""],["Ando","M.",""],["Andrade","T.",""],["Andres","N.",""],["Andr\u00e9s-Carcasona","M.",""],["Andri\u0107","T.",""],["Ansoldi","S.",""],["Antelis","J. M.",""],["Antier","S.",""],["Aoumi","M.",""],["Apostolatos","T.",""],["Appavuravther","E. Z.",""],["Appert","S.",""],["Apple","S. K.",""],["Arai","K.",""],["Araya","A.",""],["Araya","M. C.",""],["Areeda","J. S.",""],["Aritomi","N.",""],["Armato","F.",""],["Arnaud","N.",""],["Arogeti","M.",""],["Aronson","S. M.",""],["Arun","K. G.",""],["Ashton","G.",""],["Aso","Y.",""],["Assiduo","M.",""],["Melo","S. Assis de Souza",""],["Aston","S. M.",""],["Astone","P.",""],["Aubin","F.",""],["AultONeal","K.",""],["Babak","S.",""],["Badalyan","A.",""],["Badaracco","F.",""],["Badger","C.",""],["Bae","S.",""],["Bagnasco","S.",""],["Bai","Y.",""],["Baier","J. G.",""],["Bajpai","R.",""],["Baka","T.",""],["Ball","M.",""],["Ballardin","G.",""],["Ballmer","S. W.",""],["Baltus","G.",""],["Banagiri","S.",""],["Banerjee","B.",""],["Bankar","D.",""],["Baral","P.",""],["Barayoga","J. C.",""],["Barber","J.",""],["Barish","B. C.",""],["Barker","D.",""],["Barneo","P.",""],["Barone","F.",""],["Barr","B.",""],["Barsotti","L.",""],["Barsuglia","M.",""],["Barta","D.",""],["Barthelmy","S. D.",""],["Barton","M. A.",""],["Bartos","I.",""],["Basak","S.",""],["Basalaev","A.",""],["Bassiri","R.",""],["Basti","A.",""],["Bawaj","M.",""],["Baxi","P.",""],["Bayley","J. C.",""],["Baylor","A. C.",""],["Bazzan","M.",""],["B\u00e9csy","B.",""],["Bedakihale","V. M.",""],["Beirnaert","F.",""],["Bejger","M.",""],["Bell","A. S.",""],["Benedetto","V.",""],["Beniwal","D.",""],["Benoit","W.",""],["Bentley","J. D.",""],["Yaala","M. Ben",""],["Bera","S.",""],["Berbel","M.",""],["Bergamin","F.",""],["Berger","B. K.",""],["Bernuzzi","S.",""],["Beroiz","M.",""],["Berry","C. P. L.",""],["Bersanetti","D.",""],["Bertolini","A.",""],["Betzwieser","J.",""],["Beveridge","D.",""],["Bevins","N.",""],["Bhandare","R.",""],["Bhandari","A. V.",""],["Bhardwaj","U.",""],["Bhatt","R.",""],["Bhattacharjee","D.",""],["Bhaumik","S.",""],["Bianchi","A.",""],["Bilenko","I. A.",""],["Bilicki","M.",""],["Billingsley","G.",""],["Binetti","A.",""],["Bini","S.",""],["Birnholtz","O.",""],["Biscans","S.",""],["Bischi","M.",""],["Biscoveanu","S.",""],["Bisht","A.",""],["Bitossi","M.",""],["Bizouard","M. -A.",""],["Blackburn","J. K.",""],["Blair","C. D.",""],["Blair","D. G.",""],["Bobba","F.",""],["Bode","N.",""],["Bo\u00ebr","M.",""],["Bogaert","G.",""],["Boileau","G.",""],["Boldrini","M.",""],["Bolingbroke","G. N.",""],["Bonavena","L. D.",""],["Bondarescu","R.",""],["Bondu","F.",""],["Bonilla","E.",""],["Bonilla","M. S.",""],["Bonnand","R.",""],["Booker","P.",""],["Boschi","V.",""],["Bose","S.",""],["Bossilkov","V.",""],["Boudart","V.",""],["Bozzi","A.",""],["Bradaschia","C.",""],["Brady","P. R.",""],["Braglia","M.",""],["Branch","A.",""],["Branchesi","M.",""],["Breschi","M.",""],["Briant","T.",""],["Brillet","A.",""],["Brinkmann","M.",""],["Brockill","P.",""],["Brooks","A. F.",""],["Brown","D. D.",""],["Brozzetti","M. L.",""],["Brunett","S.",""],["Bruno","G.",""],["Bruntz","R.",""],["Bryant","J.",""],["Bucci","F.",""],["Buchanan","J.",""],["Bulashenko","O.",""],["Bulik","T.",""],["Bulten","H. J.",""],["Buonanno","A.",""],["Burtnyk","K.",""],["Buscicchio","R.",""],["Buskulic","D.",""],["Buy","C.",""],["Davies","G. S. Cabourn",""],["Cabras","G.",""],["Cabrita","R.",""],["Cadonati","L.",""],["Cagnoli","G.",""],["Cahillane","C.",""],["Cain","H. W.","III"],["Bustillo","J. Calder\u00f3n",""],["Callaghan","J. D.",""],["Callister","T. A.",""],["Calloni","E.",""],["Camp","J. B.",""],["Canepa","M.",""],["Santoro","G. Caneva",""],["Cannavacciuolo","M.",""],["Cannon","K. C.",""],["Cao","H.",""],["Cao","Z.",""],["Capistran","L. A.",""],["Capocasa","E.",""],["Capote","E.",""],["Carapella","G.",""],["Carbognani","F.",""],["Carlassara","M.",""],["Carlin","J. B.",""],["Carpinelli","M.",""],["Carter","J. J.",""],["Carullo","G.",""],["Diaz","J. Casanueva",""],["Casentini","C.",""],["Castaldi","G.",""],["Castro-Lucas","S. Y.",""],["Caudill","S.",""],["Cavagli\u00e0","M.",""],["Cavalieri","R.",""],["Cella","G.",""],["Cerd\u00e1-Dur\u00e1n","P.",""],["Cesarini","E.",""],["Chaibi","W.",""],["Chalathadka-Subrahmanya","S.",""],["Chan","C.",""],["Chan","J. C. L.",""],["Chan","K. H. M.",""],["Chan","M.",""],["Chan","W. L.",""],["Chandra","K.",""],["Chang","I. P.",""],["Chang","R. -J.",""],["Chang","W.",""],["Chanial","P.",""],["Chao","S.",""],["Chapman-Bird","C.",""],["Charlton","E. L.",""],["Charlton","P.",""],["Chassande-Mottin","E.",""],["Chastain","L.",""],["Chatterjee","C.",""],["Chatterjee","Debarati",""],["Chatterjee","Deep",""],["Chaturvedi","M.",""],["Chaty","S.",""],["Chatziioannou","K.",""],["Chen","A.",""],["Chen","A. H. -Y.",""],["Chen","D.",""],["Chen","H.",""],["Chen","H. Y.",""],["Chen","J.",""],["Chen","K. H.",""],["Chen","X.",""],["Chen","Y. -R.",""],["Chen","Y.",""],["Cheng","H.",""],["Chessa","P.",""],["Chia","H. Y.",""],["Chiadini","F.",""],["Chiang","C.",""],["Chiarini","G.",""],["Chiba","A.",""],["Chiba","R.",""],["Chierici","R.",""],["Chincarini","A.",""],["Chiofalo","M. L.",""],["Chiummo","A.",""],["Chou","C.",""],["Choudhary","S.",""],["Christensen","N.",""],["Chua","S. S. Y.",""],["Chung","K. W.",""],["Ciani","G.",""],["Ciecielag","P.",""],["Cie\u015blar","M.",""],["Cifaldi","M.",""],["Ciobanu","A. A.",""],["Ciolfi","R.",""],["Clara","F.",""],["Clark","J. A.",""],["Clarke","T. A.",""],["Clearwater","P.",""],["Clesse","S.",""],["Cleva","F.",""],["Coccia","E.",""],["Codazzo","E.",""],["Cohadon","P. -F.",""],["Colleoni","M.",""],["Collette","C. G.",""],["Collins","J.",""],["Colombo","A.",""],["Colpi","M.",""],["Compton","C. M.",""],["Conti","L.",""],["Cooper","S. J.",""],["Corbitt","T. R.",""],["Cordero-Carri\u00f3n","I.",""],["Corezzi","S.",""],["Cornish","N. J.",""],["Corsi","A.",""],["Cortese","S.",""],["Costa","C. A.",""],["Cottingham","R.",""],["Coughlin","M. W.",""],["Couineaux","A.",""],["Coulon","J. -P.",""],["Countryman","S. T.",""],["Coupechoux","J. -F.",""],["Cousins","B.",""],["Couvares","P.",""],["Coward","D. M.",""],["Cowart","M. J.",""],["Cowburn","B. D.",""],["Coyne","D. C.",""],["Coyne","R.",""],["Craig","K.",""],["Creighton","J. D. E.",""],["Creighton","T. D.",""],["Criswell","A. W.",""],["Crockett-Gray","J. C. G.",""],["Croquette","M.",""],["Crouch","R.",""],["Crowder","S. G.",""],["Cudell","J. R.",""],["Cullen","T. J.",""],["Cumming","A.",""],["Cuoco","E.",""],["Cury\u0142o","M.",""],["Cusinato","M.",""],["Dabadie","P.",""],["Canton","T. Dal",""],["Dall'Osso","S.",""],["D\u00e1lya","G.",""],["D'Angelo","B.",""],["Danilishin","S.",""],["D'Antonio","S.",""],["Danzmann","K.",""],["Darroch","K. E.",""],["Darsow-Fromm","C.",""],["Dartez","L. P.",""],["Dasgupta","A.",""],["Datta","S.",""],["Dattilo","V.",""],["Daumas","A.",""],["Dave","I.",""],["Davenport","A.",""],["Davier","M.",""],["Davis","D.",""],["Davis","M. C.",""],["Daw","E. J.",""],["Dax","M.",""],["Deenadayalan","M.",""],["Degallaix","J.",""],["De Laurentis","M.",""],["Del\u00e9glise","S.",""],["Del Favero","V.",""],["De Lillo","F.",""],["Dell'Aquila","D.",""],["Del Pozzo","W.",""],["De Marco","F.",""],["De Matteis","F.",""],["D'Emilio","V.",""],["Demos","N.",""],["Dent","T.",""],["Depasse","A.",""],["De Pietri","R.",""],["De Rosa","R.",""],["De Rossi","C.",""],["De Simone","R.",""],["Dhurandhar","S.",""],["Diab","R.",""],["Diamond","P. Z.",""],["D\u00edaz","M. C.",""],["Didio","N. A.",""],["Dietrich","T.",""],["Di Fiore","L.",""],["Di Fronzo","C.",""],["Di Giovanni","F.",""],["Di Giovanni","M.",""],["Di Girolamo","T.",""],["Diksha","D.",""],["Di Lieto","A.",""],["Di Michele","A.",""],["Ding","J.",""],["Di Pace","S.",""],["Di Palma","I.",""],["Di Renzo","F.",""],["Divyajyoti","",""],["Dmitriev","A.",""],["Doctor","Z.",""],["Dohmen","E.",""],["Doleva","P. P.",""],["Donahue","L.",""],["D'Onofrio","L.",""],["Donovan","F.",""],["Dooley","K. L.",""],["Dooney","T.",""],["Doravari","S.",""],["Dorosh","O.",""],["Drago","M.",""],["Driggers","J. C.",""],["Drori","Y.",""],["Du","H.",""],["Ducoin","J. -G.",""],["Dunn","L.",""],["Dupletsa","U.",""],["D'Urso","D.",""],["Duval","H.",""],["Duverne","P. -A.",""],["Dwyer","S. E.",""],["Eassa","C.",""],["Ebersold","M.",""],["Eckhardt","T.",""],["Eddolls","G.",""],["Edelman","B.",""],["Edo","T. B.",""],["Edy","O.",""],["Effler","A.",""],["Eichholz","J.",""],["Einsle","H.",""],["Eisenmann","M.",""],["Eisenstein","R. A.",""],["Ejlli","A.",""],["Engelby","E.",""],["Engl","A. J.",""],["Errico","L.",""],["Essick","R. C.",""],["Estell\u00e9s","H.",""],["Estevez","D.",""],["Etzel","T.",""],["Evans","C. R.",""],["Evans","M.",""],["Evans","T. M.",""],["Evstafyeva","T.",""],["Ewing","B. E.",""],["Ezquiaga","J. M.",""],["Fabrizi","F.",""],["Faedi","F.",""],["Fafone","V.",""],["Fair","H.",""],["Fairhurst","S.",""],["Fan","P. C.",""],["Farah","A. M.",""],["Farr","B.",""],["Farr","W. M.",""],["Fauchon-Jones","E. J.",""],["Favaro","G.",""],["Favata","M.",""],["Fays","M.",""],["Feicht","J.",""],["Fejer","M. M.",""],["Fenyvesi","E.",""],["Ferguson","D. L.",""],["Ferrante","I.",""],["Ferreira","T. A.",""],["Fidecaro","F.",""],["Fiori","A.",""],["Fiori","I.",""],["Fishbach","M.",""],["Fisher","R. P.",""],["Fittipaldi","R.",""],["Fiumara","V.",""],["Flaminio","R.",""],["Fleischer","S. M.",""],["Fleming","L. S.",""],["Floden","E.",""],["Fong","H.",""],["Font","J. A.",""],["Fornal","B.",""],["Forsyth","P. W. F.",""],["Franceschetti","K.",""],["Franke","A.",""],["Frasca","S.",""],["Frasconi","F.",""],["Mascioli","A. Frattale",""],["Frei","Z.",""],["Freise","A.",""],["Freitas","O.",""],["Frey","R.",""],["Frischhertz","W.",""],["Fritschel","P.",""],["Frolov","V. V.",""],["Fronz\u00e9","G. G.",""],["Fujii","S.",""],["Fukunaga","I.",""],["Fulda","P.",""],["Fyffe","M.",""],["Gabella","W. E.",""],["Gadre","B.",""],["Gair","J. R.",""],["Gais","J.",""],["Galaudage","S.",""],["Gallardo","S.",""],["Gamba","R.",""],["Ganapathy","D.",""],["Ganguly","A.",""],["Gaonkar","S. G.",""],["Garaventa","B.",""],["Garcia-Bellido","J.",""],["Garc\u00eda-N\u00fa\u00f1ez","C.",""],["Garc\u00eda-Quir\u00f3s","C.",""],["Gardner","J. W.",""],["Gardner","K. A.",""],["Gargiulo","J.",""],["Garufi","F.",""],["Gasbarra","C.",""],["Gateley","B.",""],["Gayathri","V.",""],["Gemme","G.",""],["Gennai","A.",""],["George","J.",""],["Gerberding","O.",""],["Gergely","L.",""],["Ghadiri","N.",""],["Ghosh","Abhirup",""],["Ghosh","Archisman",""],["Ghosh","Shaon",""],["Ghosh","Shrobana",""],["Ghosh","Suprovo",""],["Ghosh","Tathagata",""],["Giacoppo","L.",""],["Giaime","J. A.",""],["Giardina","K. D.",""],["Gibson","D. R.",""],["Gier","C.",""],["Giri","P.",""],["Gissi","F.",""],["Gkaitatzis","S.",""],["Glanzer","J.",""],["Gleckl","A. E.",""],["Glotin","F.",""],["Godfrey","J.",""],["Godwin","P.",""],["Goetz","E.",""],["Goetz","R.",""],["Golomb","J.",""],["Lopez","S. Gomez",""],["Goncharov","B.",""],["Gonz\u00e1lez","G.",""],["Goodwin-Jones","A. W.",""],["Gosselin","M.",""],["Gouaty","R.",""],["Gould","D. W.",""],["Goyal","S.",""],["Grace","B.",""],["Grado","A.",""],["Graham","V.",""],["Granados","A. E.",""],["Granata","M.",""],["Granata","V.",""],["Gras","S.",""],["Grassia","P.",""],["Gray","C.",""],["Gray","R.",""],["Greco","G.",""],["Green","A. C.",""],["Green","S. M.",""],["Green","S. R.",""],["Gretarsson","A. M.",""],["Gretarsson","E. M.",""],["Griffith","D.",""],["Griffiths","W. L.",""],["Griggs","H. L.",""],["Grignani","G.",""],["Grimaldi","A.",""],["Grimaud","C.",""],["Grote","H.",""],["Gruson","A. S.",""],["Guerra","D.",""],["Guetta","D.",""],["Guidi","G. M.",""],["Guimaraes","A. R.",""],["Gulati","H. K.",""],["Gulminelli","F.",""],["Gunny","A. M.",""],["Guo","H.",""],["Guo","Y.",""],["Gupta","Anchal",""],["Gupta","Anuradha",""],["Gupta","Ish",""],["Gupta","N. C.",""],["Gupta","P.",""],["Gupta","S. K.",""],["Gupte","N.",""],["Gurav","R.",""],["Gurs","J.",""],["Gustafson","E. K.",""],["Gutierrez","N.",""],["Guzman","F.",""],["Haba","D.",""],["Haegel","L.",""],["Hain","G.",""],["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. A.",""],["Hanselman","A. G.",""],["Hansen","H.",""],["Hanson","J.",""],["Harada","R.",""],["Harder","T.",""],["Haris","K.",""],["Harmark","T.",""],["Harms","J.",""],["Harry","G. M.",""],["Harry","I. W.",""],["Hartwig","D.",""],["Haskell","B.",""],["Haster","C. -J.",""],["Hathaway","J. S.",""],["Haughian","K.",""],["Hayakawa","H.",""],["Hayama","K.",""],["Hayes","F. J.",""],["Healy","J.",""],["Heffernan","A.",""],["Heidmann","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. -S.",""],["Hennig","M.",""],["Henshaw","C.",""],["Hernandez","A.",""],["Hertog","T.",""],["Heurs","M.",""],["Hewitt","A. L.",""],["Higginbotham","S.",""],["Hild","S.",""],["Hill","P.",""],["Himemoto","Y.",""],["Hines","A. S.",""],["Hirata","N.",""],["Hirose","C.",""],["Ho","J.",""],["Hoang","S.",""],["Hochheim","S.",""],["Hofman","D.",""],["Hohmann","J. N.",""],["Holland","N. A.",""],["Holley-Bockelmann","K.",""],["Hollows","I. J.",""],["Holmes","Z. J.",""],["Holz","D. E.",""],["Hong","C.",""],["Hong","Q.",""],["Hornung","J.",""],["Hoshino","S.",""],["Hough","J.",""],["Hourihane","S.",""],["Howell","E. J.",""],["Hoy","C. G.",""],["Hoyland","D.",""],["Hsieh","H. -F.",""],["Hsiung","C.",""],["Hsu","H. C.",""],["Hsu","S. -C.",""],["Hsu","W. -F.",""],["Hu","P.",""],["Hu","Q.",""],["Huang","H. Y.",""],["Huang","Y. -J.",""],["Huang","Y.",""],["Huang","Y. T.",""],["H\u00fcbner","M. T.",""],["Huddart","A. D.",""],["Hughey","B.",""],["Hui","D. C. Y.",""],["Hui","V.",""],["Hur","R.",""],["Husa","S.",""],["Huxford","R.",""],["Huynh-Dinh","T.",""],["Hyland","J.",""],["Iakovlev","A.",""],["Iandolo","G. A.",""],["Iess","A.",""],["Inayoshi","K.",""],["Inoue","Y.",""],["Iorio","G.",""],["Iosif","P.",""],["Irwin","J.",""],["Isi","M.",""],["Ismail","M. A.",""],["Itoh","Y.",""],["Iwaya","M.",""],["Iyer","B. R.",""],["JaberianHamedan","V.",""],["Jacqmin","T.",""],["Jacquet","P. -E.",""],["Jadhav","S. J.",""],["Jadhav","S. P.",""],["Jain","D.",""],["Jain","T.",""],["James","A. L.",""],["James","P. A.",""],["Jamshidi","R.",""],["Jan","A. Z.",""],["Jani","K.",""],["Janiurek","L.",""],["Janquart","J.",""],["Janssens","K.",""],["Janthalur","N. N.",""],["Jaraba","S.",""],["Jaranowski","P.",""],["Jarov","S.",""],["Jasal","P.",""],["Jaume","R.",""],["Javed","W.",""],["Jenner","K.",""],["Jennings","A.",""],["Jia","W.",""],["Jiang","J.",""],["Jin","H. -B.",""],["Johansmeyer","K.",""],["Johns","G. R.",""],["Johnson","N. A.",""],["Johnston","R.",""],["Johny","N.",""],["Jones","D. H.",""],["Jones","D. I.",""],["Jones","R.",""],["Joshi","P.",""],["Ju","L.",""],["Jung","K.",""],["Junker","J.",""],["Juste","V.",""],["Kajita","T.",""],["Kalaghatgi","C.",""],["Kalogera","V.",""],["Kamiizumi","M.",""],["Kanda","N.",""],["Kandhasamy","S.",""],["Kang","G.",""],["Kanner","J. B.",""],["Kapadia","S. J.",""],["Kapasi","D. P.",""],["Karat","S.",""],["Karathanasis","C.",""],["Karki","S.",""],["Karydas","T.",""],["Kas-danouche","Y. A.",""],["Kashyap","R.",""],["Kasprzack","M.",""],["Kastaun","W.",""],["Kato","J.",""],["Kato","T.",""],["Katsanevas","S.",""],["Katsavounidis","E.",""],["Katsuren","J. K.",""],["Katzman","W.",""],["Kaur","T.",""],["Kawabe","K.",""],["K\u00e9f\u00e9lian","F.",""],["Keitel","D.",""],["Kelley-Derzon","J.",""],["Kemper","S. A.",""],["Kennington","J.",""],["Kesharwani","R.",""],["Key","J. S.",""],["Khadka","S.",""],["Khalili","F. Y.",""],["Khanam","T.",""],["Khazanov","E. A.",""],["Khursheed","M.",""],["Kijbunchoo","N.",""],["Kim","C.",""],["Kim","J. C.",""],["Kim","K.",""],["Kim","M. H.",""],["Kim","P.",""],["Kim","S.",""],["Kim","W. S.",""],["Kim","Y. -M.",""],["Kimball","C.",""],["Kimura","N.",""],["Kinley-Hanlon","M.",""],["Kirchhoff","R.",""],["Kissel","J. S.",""],["Kiyota","T.",""],["Klimenko","S.",""],["Klinger","T.",""],["Knee","A. M.",""],["Knust","N.",""],["Koch","P.",""],["Koehlenbeck","S. M.",""],["Koekoek","G.",""],["Kohri","K.",""],["Kokeyama","K.",""],["Koley","S.",""],["Koliadko","N. D.",""],["Kolitsidou","P.",""],["Kolstein","M.",""],["Komori","K.",""],["Kondrashov","V.",""],["Kong","A. K. H.",""],["Kontos","A.",""],["Korobko","M.",""],["Kossak","R. V.",""],["Kouvatsos","N.",""],["Kovalam","M.",""],["Koyama","N.",""],["Kozak","D. B.",""],["Kranzhoff","S. L.",""],["Kringel","V.",""],["Krishnendu","N. V.",""],["Kr\u00f3lak","A.",""],["Kuehn","G.",""],["Kuijer","P.",""],["Kulkarni","S.",""],["Ramamohan","A. Kulur",""],["Kumar","A.",""],["Kumar","Praveen",""],["Kumar","Prayush",""],["Kumar","Rahul",""],["Kumar","Rakesh",""],["Kume","J.",""],["Kuns","K.",""],["Kuroyanagi","S.",""],["Kuwahara","S.",""],["Kwak","K.",""],["Kwan","K.",""],["Lacaille","G.",""],["Lagabbe","P.",""],["Laghi","D.",""],["Lai","S.",""],["Lakkis","M. H.",""],["Lalande","E.",""],["Lalleman","M.",""],["Lamberts","A.",""],["Landry","M.",""],["Lane","B. B.",""],["Lang","R. N.",""],["Lange","J.",""],["Lantz","B.",""],["La Rana","A.",""],["La Rosa","I.",""],["Lartaux-Vollard","A.",""],["Lasky","P. D.",""],["Lawrence","J.",""],["Laxen","M.",""],["Lazzarini","A.",""],["Lazzaro","C.",""],["Leaci","P.",""],["Leavey","S.",""],["LeBohec","S.",""],["Lecoeuche","Y. K.",""],["Lee","H. M.",""],["Lee","H. W.",""],["Lee","K.",""],["Lee","R. -K.",""],["Lee","R.",""],["Lee","S.",""],["Lee","Y.",""],["Legred","I. N.",""],["Lehmann","J.",""],["Lehner","L.",""],["Lema\u00eetre","A.",""],["Lenti","M.",""],["Leonardi","M.",""],["Leonova","E.",""],["Leroy","N.",""],["Lesovsky","M.",""],["Letendre","N.",""],["Lethuillier","M.",""],["Levesque","C.",""],["Levin","Y.",""],["Leyde","K.",""],["Li","A. K. Y.",""],["Li","K. L.",""],["Li","T. G. F.",""],["Li","X.",""],["Lin","Chien-Yu",""],["Lin","Chun-Yu",""],["Lin","E. T.",""],["Lin","F.",""],["Lin","H.",""],["Lin","L. C. -C.",""],["Lin","Y.",""],["Linde","F.",""],["Linker","S. D.",""],["Littenberg","T. B.",""],["Liu","A.",""],["Liu","G. C.",""],["Liu","Jian",""],["Llamas","F.",""],["Lo","R. K. L.",""],["Lo","T.",""],["Locquet","J. -P.",""],["London","L.",""],["Longo","A.",""],["Lopez","D.",""],["Portilla","M. Lopez",""],["Lorenzini","M.",""],["Loriette","V.",""],["Lormand","M.",""],["Losurdo","G.",""],["Lott","T. P.",""],["Lough","J. D.",""],["Loughlin","H. A.",""],["Lousto","C. O.",""],["Lovelace","G.",""],["Lowry","M. J.",""],["L\u00fcck","H.",""],["Lumaca","D.",""],["Lundgren","A. P.",""],["Lussier","A. W.",""],["Lynam","J. E.",""],["Ma","L. -T.",""],["Ma","S.",""],["Ma'arif","M.",""],["Macas","R.",""],["MacInnis","M.",""],["Macleod","D. M.",""],["MacMillan","I. A. O.",""],["Macquet","A.",""],["Maeda","K.",""],["Maenaut","S.",""],["Hernandez","I. Maga\u00f1a",""],["Magazz\u00f9","C.",""],["Magee","R. M.",""],["Maggiore","R.",""],["Magnozzi","M.",""],["Mahesh","M.",""],["Mahesh","S.",""],["Maini","M.",""],["Majhi","S.",""],["Majorana","E.",""],["Makarem","C. N.",""],["Maliakal","S.",""],["Malik","A.",""],["Man","N.",""],["Mandic","V.",""],["Mangano","V.",""],["Mannix","B.",""],["Mansell","G. L.",""],["Mansingh","G.",""],["Manske","M.",""],["Mantovani","M.",""],["Mapelli","M.",""],["Marchesoni","F.",""],["Pina","D. Mar\u00edn",""],["Marion","F.",""],["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","B. B.",""],["Martinez","M.",""],["Martinez","V. A.",""],["Martinez","V.",""],["Martini","A.",""],["Martinovic","K.",""],["Martynov","D. V.",""],["Marx","E. J.",""],["Masalehdan","H.",""],["Masserot","A.",""],["Masso-Reid","M.",""],["Mastrodicasa","M.",""],["Mastrogiovanni","S.",""],["Mateu-Lucena","M.",""],["Matiushechkina","M.",""],["Matsuyama","M.",""],["Mavalvala","N.",""],["Maxwell","N.",""],["McCarrol","G.",""],["McCarthy","R.",""],["McClelland","D. E.",""],["McCormick","S.",""],["McCuller","L.",""],["McGhee","G. I.",""],["McGinn","J.",""],["Mchedlidze","M.",""],["McIsaac","C.",""],["McIver","J.",""],["McKinney","K.",""],["McLeod","A.",""],["McRae","T.",""],["McWilliams","S. T.",""],["Meacher","D.",""],["Mehmet","M.",""],["Mehta","A. K.",""],["Meijer","Q.",""],["Melatos","A.",""],["Mellaerts","S.",""],["Menendez-Vazquez","A.",""],["Menoni","C. S.",""],["Mercer","R. A.",""],["Mereni","L.",""],["Merfeld","K.",""],["Merilh","E. L.",""],["Merritt","J. D.",""],["Merzougui","M.",""],["Messenger","C.",""],["Messick","C.",""],["Meyer-Conde","M.",""],["Meylahn","F.",""],["Mhaske","A.",""],["Miani","A.",""],["Miao","H.",""],["Michaloliakos","I.",""],["Michel","C.",""],["Michimura","Y.",""],["Middleton","H.",""],["Mihaylov","D. P.",""],["Miller","A. L.",""],["Miller","A.",""],["Miller","B.",""],["Miller","S.",""],["Millhouse","M.",""],["Milotti","E.",""],["Minenkov","Y.",""],["Mio","N.",""],["Mir","Ll. M.",""],["Mirasola","L.",""],["Miravet-Ten\u00e9s","M.",""],["Miritescu","C. .",""],["Mishkin","A.",""],["Mishra","A.",""],["Mishra","C.",""],["Mishra","T.",""],["Mistry","T.",""],["Mitchell","A. L.",""],["Mitra","S.",""],["Mitrofanov","V. P.",""],["Mitselmakher","G.",""],["Mittleman","R.",""],["Miyakawa","O.",""],["Miyamoto","S.",""],["Miyoki","S.",""],["Mo","G.",""],["Mobilia","L.",""],["Modafferi","L. M.",""],["Mohapatra","S. R. P.",""],["Mohite","S. R.",""],["Molina-Ruiz","M.",""],["Mondal","C.",""],["Mondin","M.",""],["Montani","M.",""],["Moore","C. J.",""],["Morales","M.",""],["Moraru","D.",""],["Morawski","F.",""],["More","A.",""],["More","S.",""],["Moreno","C.",""],["Moreno","G.",""],["Morisaki","S.",""],["Moriwaki","Y.",""],["Morras","G.",""],["Moscatello","A.",""],["Mours","B.",""],["Mow-Lowry","C. M.",""],["Mozzon","S.",""],["Muciaccia","F.",""],["Mukherjee","Arunava",""],["Mukherjee","D.",""],["Mukherjee","Soma",""],["Mukherjee","Subroto",""],["Mukherjee","Suvodip",""],["Mukund","N.",""],["Mullavey","A.",""],["Munch","J.",""],["Mu\u00f1iz","E. A.",""],["Murakoshi","M.",""],["Murray","P. G.",""],["Muusse","S.",""],["Nadji","S. L.",""],["Nagar","A.",""],["Nagar","T.",""],["Nagarajan","N.",""],["Nakamura","K.",""],["Nakano","H.",""],["Nakano","M.",""],["Napolano","V.",""],["Nardecchia","I.",""],["Narikawa","T.",""],["Narola","H.",""],["Naticchioni","L.",""],["Nayak","R. K.",""],["Neil","B. F.",""],["Neilson","J.",""],["Nelson","A.",""],["Nelson","T. J. N.",""],["Nery","M.",""],["Nesseris","S.",""],["Neunzert","A.",""],["Ng","K. Y.",""],["Ng","S. W. S.",""],["Nguyen","C.",""],["Nguyen","P.",""],["Quynh","L. Nguyen",""],["Nichols","S. A.",""],["Nieradka","G.",""],["Niko","A.",""],["Nishino","Y.",""],["Nishizawa","A.",""],["Nissanke","S.",""],["Nitoglia","E.",""],["Niu","W.",""],["Nocera","F.",""],["Norman","M.",""],["North","C.",""],["Novak","J.",""],["Siles","J. F. Nu\u00f1o",""],["Nurbek","G.",""],["Nuttall","L. K.",""],["Obayashi","K.",""],["Oberling","J.",""],["O'Dell","J.",""],["Oelker","E.",""],["Oertel","M.",""],["Offermans","A.",""],["Oganesyan","G.",""],["Oh","J. J.",""],["Oh","K.",""],["Oh","S. H.",""],["O'Hanlon","T.",""],["Ohashi","M.",""],["Ohkawa","M.",""],["Ohme","F.",""],["Ohta","H.",""],["Oliveira","A. S.",""],["Oliveri","R.",""],["Oloworaran","V.",""],["O'Neal","B.",""],["Oohara","K.",""],["O'Reilly","B.",""],["Ormiston","R. G.",""],["Ormsby","N. D.",""],["Orselli","M.",""],["O'Shaughnessy","R.",""],["Oshima","Y.",""],["Oshino","S.",""],["Ossokine","S.",""],["Osthelder","C.",""],["Ottaway","D. J.",""],["Ouzriat","A.",""],["Overmier","H.",""],["Pace","A. E.",""],["Pagano","R.",""],["Page","M. A.",""],["Pai","A.",""],["Pai","S. A.",""],["Pal","A.",""],["Pal","S.",""],["Palashov","O.",""],["P\u00e1lfi","M.",""],["Palomba","C.",""],["Pan","K. -C.",""],["Panda","P. K.",""],["Panebianco","L.",""],["Pang","P. T. H.",""],["Pannarale","F.",""],["Pant","B. C.",""],["Panther","F. H.",""],["Panzer","C. D.",""],["Paoletti","F.",""],["Paoli","A.",""],["Paolone","A.",""],["Papalexakis","E. E.",""],["Papalini","L.",""],["Pappas","G.",""],["Parisi","A.",""],["Park","J.",""],["Parker","W.",""],["Pascucci","D.",""],["Pasqualetti","A.",""],["Passaquieti","R.",""],["Passuello","D.",""],["Patel","M.",""],["Pathak","D.",""],["Pathak","M.",""],["Patra","A.",""],["Patricelli","B.",""],["Patron","A. S.",""],["Paul","S.",""],["Payne","E.",""],["Pearce","T.",""],["Pedraza","M.",""],["Pegna","R.",""],["Pegoraro","M.",""],["Pele","A.",""],["Arellano","F. E. Pe\u00f1a",""],["Penn","S.",""],["Perego","A.",""],["Pereira","A.",""],["Perez","C. J.",""],["Perez","J. J.",""],["Perez","L. H.",""],["P\u00e9rigois","C.",""],["Perkins","C. C.",""],["Perreca","A.",""],["Perret","J.",""],["Perri\u00e8s","S.",""],["Perry","J. W.",""],["Pesios","D.",""],["Petermann","J.",""],["Petrillo","C.",""],["Pfeiffer","H. P.",""],["Pham","H.",""],["Pham","K. A.",""],["Phukon","K. S.",""],["Phurailatpam","H.",""],["Piccinni","O. J.",""],["Pichot","M.",""],["Piendibene","M.",""],["Piergiovanni","F.",""],["Pierini","L.",""],["Pierra","G.",""],["Pierro","V.",""],["Pietrzak","M. .",""],["Pillant","G.",""],["Pillas","M.",""],["Pilo","F.",""],["Pinard","L.",""],["Pineda-Bosque","C.",""],["Pinto","I. M.",""],["Pinto","M.",""],["Piotrzkowski","B. J.",""],["Pirello","M.",""],["Pitkin","M. D.",""],["Placidi","A.",""],["Placidi","E.",""],["Planas","M. L.",""],["Plastino","W.",""],["Poggiani","R.",""],["Polini","E.",""],["Pompili","L.",""],["Ponrathnam","S.",""],["Poon","J.",""],["Porcelli","E.",""],["Portell","J.",""],["Porter","E. K.",""],["Posnansky","C.",""],["Poulton","R.",""],["Powell","J.",""],["Pracchia","M.",""],["Pradhan","B. K.",""],["Pradier","T.",""],["Prajapati","A. K.",""],["Prasai","K.",""],["Prasanna","R.",""],["Prasia","P.",""],["Pratten","G.",""],["Principe","M.",""],["Prodi","G. A.",""],["Prokhorov","L.",""],["Prosposito","P.",""],["Prudenzi","L.",""],["Puecher","A.",""],["Pullin","J.",""],["Punturo","M.",""],["Puosi","F.",""],["Puppo","P.",""],["P\u00fcrrer","M.",""],["Qi","H.",""],["Qin","J.",""],["Quetschke","V.",""],["Quinonez","P. J.",""],["Quitzow-James","R.",""],["Raab","F. J.",""],["Raaijmakers","G.",""],["Radulesco","N.",""],["Raffai","P.",""],["Rail","S. X.",""],["Raja","S.",""],["Rajan","C.",""],["Ramirez","K. E.",""],["Ramos-Buades","A.",""],["Rana","D.",""],["Randel","E.",""],["Rangnekar","P. R.",""],["Rapagnani","P.",""],["Ray","A.",""],["Raymond","V.",""],["Razzano","M.",""],["Read","J.",""],["Payo","M. Recaman",""],["Regimbau","T.",""],["Rei","L.",""],["Reid","S.",""],["Reid","S. W.",""],["Reitze","D. H.",""],["Relton","P.",""],["Renzini","A.",""],["Rettegno","P.",""],["Revenu","B.",""],["Reza","A.",""],["Rezac","M.",""],["Rezaei","A. S.",""],["Ricci","F.",""],["Ricci","M.",""],["Richards","D.",""],["Richardson","J. W.",""],["Rijal","A.",""],["Riles","K.",""],["Riley","H. K.",""],["Rinaldi","S.",""],["Robertson","C.",""],["Robertson","N. A.",""],["Robinet","F.",""],["Robinson","M.",""],["Rocchi","A.",""],["Rolland","L.",""],["Rollins","J. G.",""],["Romanelli","M.",""],["Romano","A. E.",""],["Romano","R.",""],["Romero","A.",""],["Romero-Shaw","I. M.",""],["Romie","J. H.",""],["Ronchini","S.",""],["Roocke","T. J.",""],["Rosa","L.",""],["Rosauer","T. J.",""],["Rose","C. A.",""],["Rosi\u0144ska","D.",""],["Ross","M. P.",""],["Rossello","M.",""],["Rowan","S.",""],["Roy","S.",""],["Royzman","A.",""],["Rozza","D.",""],["Ruggi","P.",""],["Morales","E. Ruiz",""],["Ruiz-Rocha","K.",""],["Sachdev","S.",""],["Sadecki","T.",""],["Sadiq","J.",""],["Saffarieh","P.",""],["Saha","S. S.",""],["Sainrat","T.",""],["Menon","S. Sajith",""],["Sakai","K.",""],["Sakellariadou","M.",""],["Sako","T.",""],["Sakon","S.",""],["Salafia","O. S.",""],["Salces-Carcoba","F.",""],["Salconi","L.",""],["Saleem","M.",""],["Salemi","F.",""],["Sall\u00e9","M.",""],["Salvador","S.",""],["Sanchez","A.",""],["Sanchez","E. J.",""],["Sanchez","J. H.",""],["Sanchez","L. E.",""],["Sanchis-Gual","N.",""],["Sanders","J. R.",""],["S\u00e4nger","E. M.",""],["Saravanan","T. R.",""],["Sarin","N.",""],["Sasli","A.",""],["Sassi","P.",""],["Sassolas","B.",""],["Satari","H.",""],["Sato","R.",""],["Sato","S.",""],["Sato","Y.",""],["Sauter","O.",""],["Savage","R. L.",""],["Savant","V.",""],["Sawada","T.",""],["Sawant","H. L.",""],["Sayah","S.",""],["Schaetzl","D.",""],["Scheel","M.",""],["Scherf","S. J.",""],["Scheuer","J.",""],["Schiworski","M. G.",""],["Schmidt","P.",""],["Schmidt","S.",""],["Schmitz","S. J.",""],["Schnabel","R.",""],["Schneewind","M.",""],["Schofield","R. M. S.",""],["Sch\u00f6nbeck","A.",""],["Schouteden","K.",""],["Schuler","H.",""],["Schulte","B. W.",""],["Schutz","B. F.",""],["Schwartz","E.",""],["Scott","J.",""],["Scott","S. M.",""],["Seetharamu","T. C.",""],["Seglar-Arroyo","M.",""],["Sekiguchi","Y.",""],["Sellers","D.",""],["Sengupta","A. S.",""],["Sentenac","D.",""],["Seo","E. G.",""],["Seo","J. W.",""],["Sequino","V.",""],["Servignat","G.",""],["Setyawati","Y.",""],["Shaffer","T.",""],["Shahriar","M. S.",""],["Shaikh","M. A.",""],["Shams","B.",""],["Shao","L.",""],["Sharma","P.",""],["Sharma-Chaudhary","S.",""],["Shawhan","P.",""],["Shcheblanov","N. S.",""],["Sheela","A.",""],["Shen","B.",""],["Shepard","K. G.",""],["Shikano","Y.",""],["Shikauchi","M.",""],["Shimode","K.",""],["Shinkai","H.",""],["Shiota","J.",""],["Shoemaker","D. H.",""],["Shoemaker","D. M.",""],["Short","R. W.",""],["ShyamSundar","S.",""],["Sider","A.",""],["Siegel","H.",""],["Sieniawska","M.",""],["Sigg","D.",""],["Silenzi","L.",""],["Simmonds","M.",""],["Singer","L. P.",""],["Singh","A.",""],["Singh","D.",""],["Singh","M. K.",""],["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.",""],["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.",""],["Stachie","C.",""],["Stachurski","F.",""],["Steer","D. A.",""],["Steinlechner","J.",""],["Steinlechner","S.",""],["Stergioulas","N.",""],["Stevens","P.",""],["StPierre","M.",""],["Strang","L. C.",""],["Stratta","G.",""],["Strong","M. D.",""],["Strunk","A.",""],["Sturani","R.",""],["Stuver","A. L.",""],["Suchenek","M.",""],["Sudhagar","S.",""],["Sueltmann","N.",""],["Suh","H. G.",""],["Sullivan","A. G.",""],["Summerscales","T. Z.",""],["Sun","L.",""],["Sunil","S.",""],["Sur","A.",""],["Suresh","J.",""],["Sutton","P. J.",""],["Suzuki","Takamasa",""],["Suzuki","Takanori",""],["Swinkels","B. L.",""],["Syx","A.",""],["Szczepa\u0144czyk","M. J.",""],["Szewczyk","P.",""],["Tacca","M.",""],["Tagoshi","H.",""],["Tait","S. C.",""],["Takahashi","H.",""],["Takahashi","R.",""],["Takamori","A.",""],["Takatani","K.",""],["Takeda","H.",""],["Takeda","M.",""],["Talbot","C. J.",""],["Talbot","C.",""],["Tamaki","M.",""],["Tamanini","N.",""],["Tanabe","D.",""],["Tanaka","K.",""],["Tanaka","S. J.",""],["Tanaka","T.",""],["Tanasijczuk","A. J.",""],["Tanioka","S.",""],["Tanner","D. B.",""],["Tao","D.",""],["Tao","L.",""],["Tapia","R. D.",""],["Mart\u00edn","E. N. Tapia San",""],["Tarafder","R.",""],["Taranto","C.",""],["Taruya","A.",""],["Tasson","J. D.",""],["Teloi","M.",""],["Tenorio","R.",""],["Terkowski","L.",""],["Themann","H.",""],["Thirugnanasambandam","M. P.",""],["Thomas","L. M.",""],["Thomas","M.",""],["Thomas","P.",""],["Thompson","J. E.",""],["Thondapu","S. R.",""],["Thorne","K. A.",""],["Thrane","E.",""],["Tissino","J.",""],["Tiwari","Shubhanshu",""],["Tiwari","Srishti",""],["Tiwari","V.",""],["Toivonen","A. M.",""],["Tolley","A. E.",""],["Tomaru","T.",""],["Tomita","K.",""],["Tomura","T.",""],["Tonelli","M.",""],["Toriyama","A.",""],["Torres-Forn\u00e9","A.",""],["Torrie","C. I.",""],["Toscani","M.",""],["Melo","I. Tosta e",""],["Tournefier","E.",""],["Trani","A. A.",""],["Trapananti","A.",""],["Travasso","F.",""],["Traylor","G.",""],["Trenado","J.",""],["Trevor","M.",""],["Tringali","M. C.",""],["Tripathee","A.",""],["Troiano","L.",""],["Trovato","A.",""],["Trozzo","L.",""],["Trudeau","R. J.",""],["Tse","M.",""],["Tso","R.",""],["Tsuchida","S.",""],["Tsukada","L.",""],["Tsutsui","T.",""],["Turbang","K.",""],["Turconi","M.",""],["Turski","C.",""],["Ubach","H.",""],["Ubhi","A. S.",""],["Uchikata","N.",""],["Uchiyama","T.",""],["Udall","R. P.",""],["Uehara","T.",""],["Ueno","K.",""],["Unnikrishnan","C. S.",""],["Ushiba","T.",""],["Utina","A.",""],["Vahlbruch","H.",""],["Vaidya","N.",""],["Vajente","G.",""],["Vajpeyi","A.",""],["Valdes","G.",""],["Valentini","M.",""],["Vallejo-Pe\u00f1a","S. A.",""],["Vallero","S.",""],["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 der Sluys","M.",""],["Van de Walle","A.",""],["van Dongen","J.",""],["van Haevermaet","H.",""],["van Heijningen","J. V.",""],["Vanosky","J.",""],["van Putten","M. H. P. M.",""],["van Ranst","Z.",""],["van Remortel","N.",""],["Vardaro","M.",""],["Vargas","A. F.",""],["Varma","V.",""],["Vas\u00fath","M.",""],["Vecchio","A.",""],["Vedovato","G.",""],["Veitch","J.",""],["Veitch","P. J.",""],["Venneberg","J.",""],["Verdier","P.",""],["Verkindt","D.",""],["Verma","P.",""],["Verma","Y.",""],["Vermeulen","S. M.",""],["Veske","D.",""],["Vetrano","F.",""],["Veutro","A.",""],["Vicer\u00e9","A.",""],["Vidyant","S.",""],["Viets","A. D.",""],["Vijaykumar","A.",""],["Villa-Ortega","V.",""],["Vincent","E. T.",""],["Vinet","J. -Y.",""],["Viret","S.",""],["Virtuoso","A.",""],["Vitale","S.",""],["Vocca","H.",""],["Voigt","D.",""],["von Reis","E. R. G.",""],["von Wrangel","J. S. A.",""],["Vyatchanin","S. P.",""],["Wade","L. E.",""],["Wade","M.",""],["Wagner","K. J.",""],["Walet","R. C.",""],["Walker","M.",""],["Wallace","G. S.",""],["Wallace","L.",""],["Wang","H.",""],["Wang","J. Z.",""],["Wang","W. H.",""],["Ward","R. L.",""],["Warner","J.",""],["Was","M.",""],["Washimi","T.",""],["Washington","N. Y.",""],["Watada","K.",""],["Watarai","D.",""],["Wayt","K. E.",""],["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.",""],["We\u00dfels","P.",""],["Wette","K.",""],["Whelan","J. T.",""],["White","D. D.",""],["Whiting","B. F.",""],["Whittle","C.",""],["Wildberger","J. B.",""],["Wilk","O. S.",""],["Wilken","D.",""],["Willetts","K.",""],["Williams","D.",""],["Williams","M. J.",""],["Williamson","A. R.",""],["Willis","J. L.",""],["Willke","B.",""],["Wils","M.",""],["Wipf","C. C.",""],["Woan","G.",""],["Woehler","J.",""],["Wofford","J. K.",""],["Wong","D.",""],["Wong","H. T.",""],["Wong","I. C. F.",""],["Wright","M.",""],["Wu","C.",""],["Wu","D. S.",""],["Wu","H.",""],["Wysocki","D. M.",""],["Xiao","L.",""],["Xu","V. A.",""],["Yadav","N.",""],["Yamamoto","H.",""],["Yamamoto","K.",""],["Yamamoto","M.",""],["Yamamoto","T. S.",""],["Yamamoto","T.",""],["Yamamura","S.",""],["Yamazaki","R.",""],["Yan","S.",""],["Yang","F. W.",""],["Yang","K. Z.",""],["Yang","L. -C.",""],["Yang","Y. -C.",""],["Yang","Yang",""],["Yang","Yi",""],["Yap","M. J.",""],["Yarbrough","Z.",""],["Yeh","S. -W.",""],["Yelikar","A. B.",""],["Yeung","S. M. C.",""],["Yeung","T. Y.",""],["Yokoyama","J.",""],["Yokozawa","T.",""],["Yoo","J.",""],["Yu","H.",""],["Yuzurihara","H.",""],["Zadro\u017cny","A.",""],["Zannelli","A. J.",""],["Zanolin","M.",""],["Zeeshan","M.",""],["Zelenova","T.",""],["Zendri","J. -P.",""],["Zevin","M.",""],["Zhang","J.",""],["Zhang","L.",""],["Zhang","R.",""],["Zhang","T.",""],["Zhang","Yanqi",""],["Zhang","Ya",""],["Zhao","C.",""],["Zhao","Yue",""],["Zhao","Yuhang",""],["Zheng","Y.",""],["Zhong","H.",""],["Zhou","R.",""],["Zhu","Z. -H.",""],["Zimmerman","A. B.",""],["Zucker","M. E.",""],["Zweizig","J.",""]]}
{"id":"2308.03823","submitter":"Artem Mishchenko","authors":"Ivan Timokhin, Chuhongxu Chen, Ziwei Wang, Qian Yang, Artem Mishchenko","title":"Synthesis and characterisation of LK-99","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, two arXiv preprints (arXiv:2307.12008, arXiv:2307.12037) reported\nsignatures of superconductivity above room temperature (SART) and at ambient\npressure, striking worldwide experimental research efforts in replicating the\nresults3-6, as well as theoretical attempts to explain the purported\nsuperconductivity7-11. The material of interest has chemical formula\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O, where $x \\approx 1$, and was named by the\nauthors as LK-99. It belongs to lead apatite family, and was synthesised from\ntwo precursors, lanarkite (PbSO$_4\\cdot$PbO) and copper phosphide (Cu$_3$P).\nHere we performed a systematic study on LK-99, starting from solid-state\nsynthesis, followed by characterisation and transport measurements. We did not\nobserve any signatures of superconductivity in our samples of LK-99.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:10:26 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 15:50:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Timokhin","Ivan",""],["Chen","Chuhongxu",""],["Wang","Ziwei",""],["Yang","Qian",""],["Mishchenko","Artem",""]]}
{"id":"2308.03824","submitter":"Anil Khachi Dr.","authors":"Anil Khachi","title":"Phase shift, Amplitude and Wavefunctions for np-system using Morse\n  Potential by Calogero's Approach","comments":"15 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Phase shift(delta(r)), Amplitude(A(r)) and Wave function(u(r)) vs r (in fm)\ncurves for various channels (S, P and D) of n-p scattering have been calculated\nusing phase function method (PFM) method. To do this, inverse potentials\nobtained using the Morse function as the zeroth reference potential is\nemployed. Recently, the GRANADA group published a comprehensive partial wave\nanalysis of scattering data, consisting of 6713 np phase shift data points from\n1950 to 2013. Using the final experimental data points from GRANADA we obtained\nthe parameters for Morse potential by minimizing mean square error (MSE) as the\ncost function. Various quantum functions i.e. delta(r), A(r) and u(r) are\ndescribed upto 5fm with energies Elab = [1, 10, 50, 100, 150, 250, 350].\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:20:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Khachi","Anil",""]]}
{"id":"2308.03825","submitter":"Xinyue Shen","authors":"Xinyue Shen and Zeyuan Chen and Michael Backes and Yun Shen and Yang\n  Zhang","title":"\"Do Anything Now\": Characterizing and Evaluating In-The-Wild Jailbreak\n  Prompts on Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The misuse of large language models (LLMs) has garnered significant attention\nfrom the general public and LLM vendors. In response, efforts have been made to\nalign LLMs with human values and intent use. However, a particular type of\nadversarial prompts, known as jailbreak prompt, has emerged and continuously\nevolved to bypass the safeguards and elicit harmful content from LLMs. In this\npaper, we conduct the first measurement study on jailbreak prompts in the wild,\nwith 6,387 prompts collected from four platforms over six months. Leveraging\nnatural language processing technologies and graph-based community detection\nmethods, we discover unique characteristics of jailbreak prompts and their\nmajor attack strategies, such as prompt injection and privilege escalation. We\nalso observe that jailbreak prompts increasingly shift from public platforms to\nprivate ones, posing new challenges for LLM vendors in proactive detection. To\nassess the potential harm caused by jailbreak prompts, we create a question set\ncomprising 46,800 samples across 13 forbidden scenarios. Our experiments show\nthat current LLMs and safeguards cannot adequately defend jailbreak prompts in\nall scenarios. Particularly, we identify two highly effective jailbreak prompts\nwhich achieve 0.99 attack success rates on ChatGPT (GPT-3.5) and GPT-4, and\nthey have persisted online for over 100 days. Our work sheds light on the\nsevere and evolving threat landscape of jailbreak prompts. We hope our study\ncan facilitate the research community and LLM vendors in promoting safer and\nregulated LLMs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 16:55:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shen","Xinyue",""],["Chen","Zeyuan",""],["Backes","Michael",""],["Shen","Yun",""],["Zhang","Yang",""]]}
{"id":"2308.03826","submitter":"Pingping Zhang Dr","authors":"Xinhao Deng and Pingping Zhang and Wei Liu and Huchuan Lu","title":"Recurrent Multi-scale Transformer for High-Resolution Salient Object\n  Detection","comments":"This work is accepted by ACM MM2023. More modifications may be\n  performed for further improvements","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":"  Salient Object Detection (SOD) aims to identify and segment the most\nconspicuous objects in an image or video. As an important pre-processing step,\nit has many potential applications in multimedia and vision tasks. With the\nadvance of imaging devices, SOD with high-resolution images is of great demand,\nrecently. However, traditional SOD methods are largely limited to\nlow-resolution images, making them difficult to adapt to the development of\nHigh-Resolution SOD (HRSOD). Although some HRSOD methods emerge, there are no\nlarge enough datasets for training and evaluating. Besides, current HRSOD\nmethods generally produce incomplete object regions and irregular object\nboundaries. To address above issues, in this work, we first propose a new\nHRS10K dataset, which contains 10,500 high-quality annotated images at 2K-8K\nresolution. As far as we know, it is the largest dataset for the HRSOD task,\nwhich will significantly help future works in training and evaluating models.\nFurthermore, to improve the HRSOD performance, we propose a novel Recurrent\nMulti-scale Transformer (RMFormer), which recurrently utilizes shared\nTransformers and multi-scale refinement architectures. Thus, high-resolution\nsaliency maps can be generated with the guidance of lower-resolution\npredictions. Extensive experiments on both high-resolution and low-resolution\nbenchmarks show the effectiveness and superiority of the proposed framework.\nThe source code and dataset are released at:\nhttps://github.com/DrowsyMon/RMFormer.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:49:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Deng","Xinhao",""],["Zhang","Pingping",""],["Liu","Wei",""],["Lu","Huchuan",""]]}
{"id":"2308.03827","submitter":"Solomon Eshun","authors":"Solomon Eshun","title":"Equity in Focus : Investigating Gender Disparities in Glioblastoma via\n  Propensity Score Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gender disparities in health outcomes have garnered significant attention,\nprompting investigations into their underlying causes. Glioblastoma (GBM), a\ndevastating and highly aggressive form of brain tumor, serves as a case for\nsuch inquiries. Despite the mounting evidence on gender disparities in GBM\noutcomes, investigations specific at the molecular level remain scarce and\noften limited by confounding biases in observational studies. In this study, I\naimed to investigate the gender-related differences in GBM outcomes using\npropensity score matching (PSM) to control for potential confounding variables.\nThe data used was accessed from the Cancer Genome Atlas (TCGA), encompassing\nfactors such as gender, age, molecular characteristics and different glioma\ngrades. Propensity scores were calculated for each patient using logistic\nregression, representing the likelihood of being male based on the baseline\ncharacteristics. Subsequently, patients were matched using the nearest-neighbor\n(with a restricted caliper) matching to create a balanced male-female group.\nAfter PSM, 303 male-female pairs were identified, with similar baseline\ncharacteristics in terms of age and molecular features. The analysis revealed a\nhigher incidence of GBM in males compared to females, after adjusting for\npotential confounding factors. This study contributes to the discourse on\ngender equity in health, paving the way for targeted interventions and improved\noutcomes, and may guide efforts to improve gender-specific treatment strategies\nfor GBM patients. However, further investigations and prospective studies are\nwarranted to validate these findings and explore additional factors that might\ncontribute to the observed gender-based differences in GBM outcomes aside from\nthe molecular characteristics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 17:56:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Eshun","Solomon",""]]}
{"id":"2308.03828","submitter":"John Ruan","authors":"Jaeden Bardati, John J. Ruan, Daryl Haggard, Michael Tremmel","title":"Signatures of Massive Black Hole Merger Host Galaxies from Cosmological\n  Simulations I: Unique Galaxy Morphologies in Imaging","comments":"19 pages, 10 figures. Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low-frequency gravitational wave experiments such as the Laser Interferometer\nSpace Antenna and pulsar timing arrays are expected to detect individual\nmassive black hole (MBH) binaries and mergers. However, secure methods of\nidentifying the exact host galaxy of each MBH merger amongst the large number\nof galaxies in the gravitational wave localization region are currently\nlacking. We investigate the distinct morphological signatures of MBH merger\nhost galaxies, using the Romulus25 cosmological simulation. We produce mock\ntelescope images of 201 simulated galaxies in Romulus25 hosting recent MBH\nmergers, through stellar population synthesis and dust radiative transfer.\nBased on comparisons to mass- and redshift-matched control samples, we show\nthat combining multiple morphological statistics via a linear discriminant\nanalysis enables identification of the host galaxies of MBH mergers, with\naccuracies that increase with chirp mass and mass ratio. For mergers with high\nchirp masses (>10^8.2 Msun) and high mass ratios (>0.5), the accuracy of this\napproach reaches >80%, and does not decline for at least >1 Gyr after numerical\nmerger. We argue that these trends arise because the most distinctive\nmorphological characteristics of MBH merger and binary host galaxies are\nprominent classical bulges, rather than relatively short-lived morphological\ndisturbances from their preceding galaxy mergers. Since these bulges are formed\nthough major mergers of massive galaxies, they lead to (and become permanent\nsignposts for) MBH binaries and mergers that have high chirp masses and mass\nratios. Our results suggest that galaxy morphology can aid in identifying the\nhost galaxies of future MBH binaries and mergers.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bardati","Jaeden",""],["Ruan","John J.",""],["Haggard","Daryl",""],["Tremmel","Michael",""]]}
{"id":"2308.03829","submitter":"Alexandre Belin","authors":"Alexandre Belin, Jan de Boer, Daniel Louis Jafferis, Pranjal Nayak,\n  Julian Sonner","title":"Approximate CFTs and Random Tensor Models","comments":"45 pages + appendices, 6 figures","journal-ref":null,"doi":null,"report-no":"CERN-TH-2023-068","categories":"hep-th cond-mat.str-el gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A key issue in both the field of quantum chaos and quantum gravity is an\neffective description of chaotic conformal field theories (CFTs), that is CFTs\nthat have a quantum ergodic limit. We develop a framework incorporating the\nconstraints of conformal symmetry and locality, allowing the definition of\nensembles of `CFT data'. These ensembles take on the same role as the ensembles\nof random Hamiltonians in more conventional quantum ergodic phases of many-body\nquantum systems. To describe individual members of the ensembles, we introduce\nthe notion of approximate CFT, defined as a collection of `CFT data' satisfying\nthe usual CFT constraints approximately, i.e. up to small deviations. We show\nthat they generically exist by providing concrete examples. Ensembles of\napproximate CFTs are very natural in holography, as every member of the\nensemble is indistinguishable from a true CFT for low-energy probes that only\nhave access to information from semi-classical gravity. To specify these\nensembles, we impose successively higher moments of the CFT constraints.\nLastly, we propose a theory of pure gravity in AdS$_3$ as a random\nmatrix/tensor model implementing approximate CFT constraints. This tensor model\nis the maximum ignorance ensemble compatible with conformal symmetry, crossing\ninvariance, and a primary gap to the black-hole threshold. The resulting theory\nis a random matrix/tensor model governed by the Virasoro 6j-symbol.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Belin","Alexandre",""],["de Boer","Jan",""],["Jafferis","Daniel Louis",""],["Nayak","Pranjal",""],["Sonner","Julian",""]]}
{"id":"2308.03830","submitter":"Richard Parker","authors":"Miti Patel (1,2), Cheyenne K. M. Polius (1), Matthew Ridsdill-Smith\n  (1,3), Tim Lichtenberg (4) and Richard Parker (1) (1. University of\n  Sheffield, UK, 2. University of Leicester, UK, 3. NARIT, Thailand, 4.\n  Groningen, The Netherlands)","title":"Photoevaporation versus enrichment in the cradle of the Sun","comments":"13 pages, 4 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The presence of short-lived radioisotopes (SLRs) 26-Al and 60-Fe in the Solar\nsystem places constraints on the initial conditions of our planetary system.\nMost theories posit that the origin of 26-Al and 60-Fe is in the interiors of\nmassive stars, and they are either delivered directly to the protosolar disc\nfrom the winds and supernovae of the massive stars, or indirectly via a\nsequential star formation event. However, massive stars that produce SLRs also\nemit photoionising far and extreme ultraviolet radiation, which can destroy the\ngas component of protoplanetary discs, possibly precluding the formation of gas\ngiant planets like Jupiter and Saturn. Here, we perfom N-body simulations of\nstar-forming regions and determine whether discs that are enriched in SLRs can\nretain enough gas to form Jovian planets. We find that discs are enriched and\nsurvive the photoionising radiation only when the dust radius of the disc is\nfixed and not allowed to move inwards due to the photoevaporation, or outwards\ndue to viscous spreading. Even in this optimal scenario, not enough discs\nsurvive until the supernovae of the massive stars and so have zero or very\nlittle enrichment in 60-Fe. We therefore suggest that the delivery of SLRs to\nthe Solar system may not come from the winds and supernovae of massive stars.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Patel","Miti",""],["Polius","Cheyenne K. M.",""],["Ridsdill-Smith","Matthew",""],["Lichtenberg","Tim",""],["Parker","Richard",""]]}
{"id":"2308.03831","submitter":"Oliver Henry Edward Philcox","authors":"Oliver H. E. Philcox, Maresuke Shiraishi","title":"Testing Parity Symmetry with the Polarized Cosmic Microwave Background","comments":"15 pages, 9 figures. Submitted to Phys. Rev. D","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ex hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  New physics in the early Universe could lead to parity-violation in the late\nUniverse, sourcing statistics whose sign changes under point reflection. The\nbest constraints on such phenomena have come from the Planck temperature\nfluctuations; however, this is already cosmic-variance-limited down to\nrelatively small scales, thus only small improvements are expected in the\nfuture. Here, we search for signatures of parity-violation in the polarized\nCMB, using the Planck PR4 $T$- and $E$-mode data. We perform both a\nsimulation-based blind test for any parity-violating signal at $\\ell<518$, and\na targeted search for primordial $U(1)$ gauge fields (and the amplitudes of a\ngeneric collapsed model) at $\\ell<2000$. In all cases, we find no evidence for\nnew physics, with the model-independent test finding consistency with the\nFFP10/NPIPE simulation suite at $(-)0.4\\sigma$, and the gauge field test\nconstraining the fractional amplitude of gauge fields during inflation to be\nbelow $6\\times 10^{-19}$ at $95\\%$ confidence level for a fiducial model. The\naddition of polarization data can significantly improve the constraints,\ndepending on the particular model of primordial physics, and the bounds will\ntighten significantly with the inclusion of smaller-scale information.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Philcox","Oliver H. E.",""],["Shiraishi","Maresuke",""]]}
{"id":"2308.03832","submitter":"Filipe S. Miguel","authors":"Filipe S. Miguel","title":"EFT corrections to scalar and vector quasinormal modes of rapidly\n  rotating black holes","comments":"41 pages, 15 figures, Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quasinormal modes characterize the final stage of a black hole merger. In\nthis regime, spacetime curvature is high, these modes can be used to probe\npotential corrections to general relativity. In this paper, we utilize the\neffective field theory framework to compute the leading order correction to\nmassless scalar and electromagnetic quasinormal modes. Proceeding\nperturbatively in the size of the effective field theory length scale, we\ndescribe a general method to compute the frequencies for Kerr black holes of\nany spin. In the electromagnetic case, we study both parity even and parity odd\neffective field theory corrections, and, surprisingly, prove that the two have\nthe same spectrum. Furthermore, we find that, the corrected frequencies\nseparate into two families, corresponding to the two polarizations of light.\nThe corrections pertaining to each family are equal and opposite. Our results\nare validated through several consistency checks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Miguel","Filipe S.",""]]}
{"id":"2308.03833","submitter":"Grant Remmen","authors":"Clifford Cheung, Grant N. Remmen","title":"Bespoke Dual Resonance","comments":"36 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"CALT-TH 2023-026","categories":"hep-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dual resonance is one of the great miracles of string theory. At a\nfundamental level, it implies that the particles exchanged in different\nchannels are subtly equivalent. Furthermore, it is inextricably linked to the\nproperty of exceptionally tame high-energy behavior. In this paper, we present\nexplicit, closed-form expressions for a new class of dual resonant amplitudes\ndescribing an infinite tower of spins for an arbitrary mass spectrum. In\nparticular, the input of our construction is a user-defined, fully customizable\nchoice of masses. The resulting \"bespoke\" amplitudes are well behaved in the\nultraviolet and analytic except at simple poles whose residues are polynomial\nin the momentum transfer, in accordance with locality. The absence of branch\ncuts can be seen using Newton's identities, but can also be made manifest by\nexpressing the amplitudes as a simple dlog integral of the Veneziano amplitude\nthat remaps the linear Regge trajectories of the string to a tunable spectrum.\nWe identify open regions of parameter space that firmly deviate from string\ntheory but nevertheless comport with partial wave unitarity. Last but not\nleast, we generalize our construction to the scattering of any number of\nparticles in terms of a dlog transform of the Koba-Nielsen worldsheet integral\nformula.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cheung","Clifford",""],["Remmen","Grant N.",""]]}
{"id":"2308.03834","submitter":"Mao Ogawa","authors":"Mao Ogawa, Keiichi Maeda, and Miho Kawabata","title":"Systematic Investigation of Very Early-Phase Spectra of Type Ia\n  Supernovae","comments":"22 pages, 11 figures, and 6 tables. Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  It has been widely accepted that Type Ia supernovae (SNe Ia) are\nthermonuclear explosions of a CO white dwarf. However, the natures of the\nprogenitor system(s) and explosion mechanism(s) are still unclarified. Thanks\nto the recent development of transient observations, they are now frequently\ndiscovered shortly after the explosion, followed by rapid spectroscopic\nobservations. In this study, by modeling very early-phase spectra of SNe Ia, we\ntry to constrain the explosion models of SNe Ia. By using the Monte Carlo\nradiation transfer code, TARDIS, we estimate the properties of their outermost\nejecta. We find that the photospheric velocity of normal-velocity supernovae\n(NV SNe) in the first week is $\\sim$15000 km s$^{-1}$. The outer velocity, to\nwhich the carbon burning extends, spans the range between $\\sim$20000 and 25000\nkm s$^{-1}$. The ejecta density of NV SNe also shows a large diversity. For\nhigh-velocity supernovae (HV SNe) and 1999aa-like SNe, the photospheric\nvelocity is higher, $\\sim$20000 km s$^{-1}$. They are different in the\nphotospheric density, with HV SNe having higher density than 1999aa-like SNe.\nFor all these types, we show that the outermost composition is closely related\nto the outermost ejecta density; the carbon burning layer and the unburnt\ncarbon layer are found in the higher-density and lower-density objects,\nrespectively. This finding suggests that there might be two sequences, the\nhigh-density and carbon-poor group (HV SNe and some NV SNe) and the low-density\nand carbon-rich group (1999aa-like and other NV SNe), which may be associated\nwith different progenitor channels.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ogawa","Mao",""],["Maeda","Keiichi",""],["Kawabata","Miho",""]]}
{"id":"2308.03835","submitter":"Maine Christos","authors":"Maine Christos, Subir Sachdev","title":"Emergence of nodal Bogoliubov quasiparticles across the transition from\n  the pseudogap metal to the d-wave superconductor","comments":"15 pages, 13 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We model the pseudogap state of the hole- and electron-doped cuprates as a\nmetal with hole and/or electron pocket Fermi surfaces. In the absence of\nlong-range antiferromagnetism, such Fermi surfaces violate the Luttinger\nrequirement of enclosing the same area as free electrons at the same density.\nUsing the Ancilla theory of such a pseudogap state, we describe the onset of\nconventional $d$-wave superconductivity by the condensation of a charge e Higgs\nboson transforming as a fundamental under the emergent SU(2) gauge symmetry of\na background $\\pi$-flux spin liquid. In all cases, we find that the $d$-wave\nsuperconductor has gapless Bogoliubov quasiparticles at 4 nodal points on the\nBrillouin zone diagonals with significant velocity anisotropy, just as in the\nBCS state. This includes the case of the electron-doped pseudogap metal with\nonly electron pockets centered at wavevectors $(\\pi, 0)$, $(0, \\pi)$, and an\nelectronic gap along the zone diagonals. Remarkably, in this case too, gapless\nnodal Bogoliubov quasiparticles emerge within the gap at 4 points along the\nzone diagonals upon the onset of superconductivity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Christos","Maine",""],["Sachdev","Subir",""]]}
{"id":"2308.03836","submitter":"Jun Ho Son","authors":"Jun Ho Son, Jason Alicea, Olexei I. Motrunich","title":"Edge states of 2D time-reversal-invariant topological superconductors\n  with strong interactions and disorder: A view from the lattice","comments":"32 pages, 12 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":"  Two-dimensional time-reversal-invariant topological superconductors host\nhelical Majorana fermions at their boundary. We study the fate of these edge\nstates under the combined influence of strong interactions and disorder, using\nthe effective 1D lattice model for the edge introduced by Jones and Metlitski\n[Phys. Rev. B 104, 245130 (2021)]. We specifically develop a strong-disorder\nrenormalization group analysis of the lattice model and identify a regime in\nwhich time-reversal is broken spontaneously, creating random magnetic domains;\nMajorana fermions localize to domain walls and form an infinite-randomness\nfixed point, identical to that appearing in the random transverse-field Ising\nmodel. While this infinite-randomness fixed point describes a fine-tuned\ncritical point in a purely 1D system, in our edge context there is no obvious\ntime-reversal-preserving perturbation that destabilizes the fixed point. Our\nanalysis thus suggests that the infinite-randomness fixed point emerges as a\nstable phase on the edge of 2D topological superconductors when strong disorder\nand interactions are present.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Son","Jun Ho",""],["Alicea","Jason",""],["Motrunich","Olexei I.",""]]}
{"id":"2308.03837","submitter":"Daniel Whalen","authors":"Daniel J. Whalen, Muhammad A. Latif, Mar Mezcua","title":"Radio Emission From a $z =$ 10.3 Black Hole in UHZ1","comments":"5 pages, 2 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent discovery of a 4 $\\times$ 10$^7$ M$_{\\odot}$ black hole (BH) in\nUHZ1 at $z =$ 10.3, just 450 Myr after the big bang, suggests that the seeds of\nthe first quasars may have been direct-collapse black holes (DCBHs) from the\ncollapse of supermassive primordial stars at $z \\sim$ 20. This object was\nidentified in James Webb Space Telescope (JWST) NIRcam and Chandra X-ray data,\nbut recent studies suggest that radio emission from such a BH should also be\nvisible to the Square Kilometer Array (SKA) and the next-generation Very Large\nArray (ngVLA). Here, we present estimates of radio flux for UHZ1 from 0.1 - 10\nGHz, and find that SKA and ngVLA could detect it with integration times of 10 -\n100 hr and just 1 - 10 hr, respectively. It may be possible to see this object\nwith VLA now with longer integration times. The detection of radio emission\nfrom UHZ1 would be a first test of exciting new synergies between near infrared\n(NIR) and radio observatories that could open the era of $z \\sim$ 5 - 15 quasar\nastronomy in the coming decade.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Whalen","Daniel J.",""],["Latif","Muhammad A.",""],["Mezcua","Mar",""]]}
{"id":"2308.03838","submitter":"Manibrata Sen","authors":"Andr\\'e de Gouv\\^ea, Jean Weill, Manibrata Sen","title":"Solar neutrinos and $\\nu_2$ visible decays to $\\nu_1$","comments":"14 pages, 8 figures, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Experimental bounds on the neutrino lifetime depend on the nature of the\nneutrinos and the details of the potentially new physics responsible for\nneutrino decay. In the case where the decays involve active neutrinos in the\nfinal state, the neutrino masses also qualitatively impact how these manifest\nthemselves experimentally. In order to further understand the impact of nonzero\nneutrino masses, we explore how observations of solar neutrinos constrain a\nvery simple toy model. We assume that neutrinos are Dirac fermions and there is\na new massless scalar that couples to neutrinos such that a heavy neutrino -\n$\\nu_2$ with mass $m_2$ - can decay into a lighter neutrino - $\\nu_1$ with mass\n$m_1$ - and a massless scalar. We find that the constraints on the new physics\ncoupling depend, sometimes significantly, on the ratio of the\ndaughter-to-parent neutrino masses, and that, for large enough values of the\nnew physics coupling, the \"dark side\" of the solar neutrino parameter space -\n$\\sin^2\\theta_{12}\\sim 0.7$ - provides a reasonable fit to solar neutrino data.\nOur results generalize to other neutrino-decay scenarios, including those that\nmediate $\\nu_2\\to\\nu_1\\bar{\\nu}_3\\nu_3$ when the neutrino mass ordering is\ninverted mass and $m_2>m_1\\gg m_3$, the mass of $\\nu_3$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["de Gouv\u00eaa","Andr\u00e9",""],["Weill","Jean",""],["Sen","Manibrata",""]]}
{"id":"2308.03839","submitter":"Victoria Toptun","authors":"Victoria A. Toptun, Igor V. Chilingarian, Kirill A. Grishin, Ivan Yu.\n  Katkov","title":"Color Transformations of Photometric Measurements of Galaxies in Optical\n  and Near-Infrared Wide-Field Imaging Surveys","comments":"24 pages, 21 figures, accepted for publication in PASP. The \"Color\n  transformations\" web service and the Python and IDL codes are available at\n  https://colors.voxastro.org/","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past 2 decades, wide-field photometric surveys in optical and\ninfrared domains reached a nearly all-sky coverage thanks to numerous\nobservational facilities operating in both hemispheres. However, subtle\ndifferences among exact realizations of Johnson and SDSS photometric systems\nrequire one to convert photometric measurements into the same system prior to\nanalysis of composite datasets originating from multiple surveys. It turns out\nthat the published photometric transformations lead to substantial biases when\napplied to integrated photometry of galaxies from the corresponding catalogs.\nHere we present photometric transformations based on piece-wise linear\napproximations of integrated photometry of galaxies in the optical surveys\nSDSS, DECaLS, BASS, MzLS, DES, DELVE, KiDS, VST ATLAS, and the near-infrared\nsurveys UKIDSS, UHS, VHS, and VIKING. We validate our transformations by\nconstructing k-corrected color-magnitude diagrams of non-active galaxies and\nmeasuring the position and tightness of the \"red sequence\". We also provide\ntransformations for aperture magnitudes and show how they are affected by the\nimage quality difference among the surveys. We present the implementation of\nthe derived transformations in Python and IDL and also a web-based color\ntransformation calculator for galaxies. By comparing DECaLS and DES, we\nidentified systematic issues in DECaLS photometry for extended galaxies, which\nwe attribute to the photometric software package used by DECaLS. As an\napplication of our method, we compiled two multi-wavelength photometric\ncatalogs for over 200,000 low- and intermediate-redshift galaxies originating\nfrom CfA FAST and Hectospec spectral archives.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Toptun","Victoria A.",""],["Chilingarian","Igor V.",""],["Grishin","Kirill A.",""],["Katkov","Ivan Yu.",""]]}
{"id":"2308.03840","submitter":"Ersilia Guarini","authors":"Ersilia Guarini, Irene Tamborra, Raffaella Margutti, Enrico\n  Ramirez-Ruiz","title":"Transients stemming from collapsing massive stars: The missing pieces to\n  advance joint observations of photons and high-energy neutrinos","comments":"26 pages, including 7 figures and 2 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Collapsing massive stars lead to a broad range of astrophysical transients,\nwhose multi-wavelength emission is powered by a variety of processes including\nradioactive decay, activity of the central engine, and interaction of the\noutflows with a dense circumstellar medium. These transients are also candidate\nfactories of neutrinos with energy up to hundreds of PeV. We review the energy\nreleased by such astrophysical objects across the electromagnetic wavebands as\nwell as neutrinos, in order to outline a strategy to optimize multi-messenger\nfollow-up programs. We find that, while a significant fraction of the explosion\nenergy can be emitted in the infrared-optical-ultraviolet (UVOIR) band, the\noptical signal alone is not optimal for neutrino searches. Rather, the neutrino\nemission is strongly correlated with the one in the radio band, if a dense\ncircumstellar medium surrounds the transient, and with X-rays tracking the\nactivity of the central engine. Joint observations of transients in radio,\nX-rays, and neutrinos will crucially complement those in the UVOIR band,\nbreaking degeneracies in the transient parameter space. Our findings call for\nheightened surveys in the radio and X-ray bands to warrant multi-messenger\ndetections.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Guarini","Ersilia",""],["Tamborra","Irene",""],["Margutti","Raffaella",""],["Ramirez-Ruiz","Enrico",""]]}
{"id":"2308.03841","submitter":"Sourav Mitra","authors":"Atrideb Chatterjee, Sourav Mitra, Amrita Banerjee","title":"Ruling out Strongly Interacting Dark Matter-Dark Radiation Models from\n  Joint Cosmic Microwave Background-Quasar Observations","comments":"Submitted to MNRAS Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The cold dark matter (CDM) paradigm provides a remarkably good description of\nthe Universe's large-scale structure. However, some discrepancies exist between\nits predictions and observations at very small sub-galactic scales. To address\nthese issues, the consideration of a strong interaction between dark matter\nparticles and dark radiation emerges as an intriguing alternative. In this\nstudy, we explore the constraints on those models using joint observations of\nCosmic Microwave Background (CMB) and Quasars with our previously built\nparameter estimation package CosmoReionMC. At 2-$\\sigma$ confidence limits,\nthis analysis rules out all strongly interacting Dark Matter - Dark Radiation\nmodels proposed to date, representing the most stringent constraint on those\nmodels to the best of our knowledge. Future research using a 21-cm experiment\nholds the potential to reveal stronger constraints or uncover hidden\ninteractions within the dark sector.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chatterjee","Atrideb",""],["Mitra","Sourav",""],["Banerjee","Amrita",""]]}
{"id":"2308.03842","submitter":"Ishita Gopalakrishnan","authors":"Ishita Gopalakrishnan, Sanjjushri Varshini R, Ponshriharini V","title":"Search Engine and Recommendation System for the Music Industry built\n  with JinaAI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most intriguing debates regarding a novel task is the development\nof search engines and recommendation-based systems in the music industry.\nStudies have shown a drastic depression in the search engine fields, due to\nconcerning factors such as speed, accuracy and the format of data given for\nquerying. Often people face difficulty in searching for a song solely based on\nthe title, hence a solution is proposed to complete a search analysis through a\nsingle query input and is matched with the lyrics of the songs present in the\ndatabase. Hence it is essential to incorporate cutting-edge technology tools\nfor developing a user-friendly search engine. Jina AI is an MLOps framework for\nbuilding neural search engines that are utilized, in order for the user to\nobtain accurate results. Jina AI effectively helps to maintain and enhance the\nquality of performance for the search engine for the query given. An effective\nsearch engine and a recommendation system for the music industry, built with\nJinaAI.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gopalakrishnan","Ishita",""],["R","Sanjjushri Varshini",""],["V","Ponshriharini",""]]}
{"id":"2308.03843","submitter":"Khagendra Adhikari","authors":"Khagendra Adhikari, Kangjun Seo, K. S. D. Beach, and Bruno Uchoa","title":"Strongly Interacting Phases in Twisted Bilayer Graphene at the Magic\n  Angle","comments":"5+1 pages, 4 figures","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":"  Twisted bilayer graphene near the magic angle is known to have a cascade of\ninsulating phases at integer filling factors of the low-energy bands. In this\nLetter we address the nature of these phases through an unrestricted,\nself-consistent Hartree-Fock calculation on the lattice that accounts for\n\\emph{all} electronic bands. Using numerically unbiased methods, we show that\nCoulomb interactions screened only by metallic gates produce ferromagnetic\ninsulating states at integer fillings $\\nu\\in[-4,4]$ with maximal spin\npolarization $M_{\\text{FM}}=4-|\\nu|$. With the exception of the $\\nu=0,-2$\nstates, all other integer fillings have insulating phases with additional\nsublattice symmetry breaking and antiferromagnetism in the \\emph{remote} bands.\nValley polarization is found away from half filling. Odd filling factors\n$|\\nu|=1,3$ have anomalous quantum Hall states with Chern number\n$|\\mathcal{C}|=1$, whereas the $|\\nu|=3$ states show strong particle-hole\n\\emph{asymmetry} in the small-gap regime. We map the metal-insulator\ntransitions of these phases as a function of the background dielectric\nconstant.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Adhikari","Khagendra",""],["Seo","Kangjun",""],["Beach","K. S. D.",""],["Uchoa","Bruno",""]]}
{"id":"2308.03844","submitter":"Gal Shkolnik","authors":"Gal Shkolnik, Aidan Zabalo, Romain Vasseur, David A. Huse, J. H.\n  Pixley, Snir Gazit","title":"Measurement induced criticality in quasiperiodic modulated random hybrid\n  circuits","comments":"14 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study one-dimensional hybrid quantum circuits perturbed by quenched\nquasiperiodic (QP) modulations across the measurement-induced phase transition\n(MIPT). Considering non-Pisot QP structures, characterized by unbounded\nfluctuations, allows us to tune the wandering exponent $\\beta$ to exceed the\nLuck bound $\\nu \\ge 1/(1-\\beta)$ for the stability of the MIPT where $\\nu\\cong\n4/3$. Via large-scale numerical simulations of random Clifford circuits\ninterleaved with local projective measurements, we find that sufficiently large\nQP structural fluctuations destabilize the MIPT and induce a flow to a broad\nfamily of critical dynamical phase transitions of the infinite QP type that is\ngoverned by the wandering exponent, $\\beta$. We numerically determine the\nassociated critical properties, including the correlation length exponent\nconsistent with saturating the Luck bound, and a universal activated dynamical\nscaling with activation exponent $\\psi \\cong \\beta$, finding excellent\nagreement with the conclusions of real space renormalization group\ncalculations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shkolnik","Gal",""],["Zabalo","Aidan",""],["Vasseur","Romain",""],["Huse","David A.",""],["Pixley","J. H.",""],["Gazit","Snir",""]]}
{"id":"2308.03845","submitter":"Francisco Aros","authors":"Francisco I. Aros, Enrico Vesperini","title":"Effects of massive central objects on the degree of energy equipartition\n  of globular clusters","comments":"Accepted for publication in MNRAS. 14 pages, 11 figures. Main results\n  in Figures 2, 4 and 10 and their respective discussion","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an analysis of the degree of energy equipartition in a sample of\n101 Monte Carlo numerical simulations of globular clusters (GCs) hosting either\na system of stellar-mass black holes (BHS), an intermediate-mass black hole\n(IMBH) or neither of them. For the first time, we systematically explore the\nsignatures that the presence of BHS or IMBHs produces on the degree of energy\nequipartition and if these signatures could be found in current observations.\nWe show that a BHS can halt the evolution towards energy equipartition in the\ncluster centre. We also show that this effect grows stronger with the number of\nstellar-mass black holes in the GC. The signatures introduced by IMBHs depend\non how dominant their masses are to the GCs and for how long the IMBH has\nco-evolved with its host GCs. IMBHs with a mass fraction below 2% of the\ncluster mass produce a similar dynamical effect to BHS, halting the energy\nequipartition evolution. IMBHs with a mass fraction larger than 2% can produce\nan inversion of the observed mass-dependency of the velocity dispersion, where\nthe velocity dispersion grows with mass. We compare our results with\nobservations of Galactic GCs and show that the observed range of the degree of\nenergy equipartition in real clusters is consistent with that found in our\nanalysis. In particular, we show that some Galactic GCs fall within the\nanomalous behaviour expected for systems hosting a BHS or an IMBH and are\npromising candidates for further dynamical analysis.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aros","Francisco I.",""],["Vesperini","Enrico",""]]}
{"id":"2308.03846","submitter":"Bo Xing","authors":"Bo Xing, Chunhan Feng, Richard Scalettar, G. George Batrouni, Dario\n  Poletti","title":"Attractive Su-Schrieffer-Heeger-Hubbard Model on a Square Lattice Away\n  from Half-Filling","comments":"5 pages, 4 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 Su-Schrieffer-Heeger (SSH) model, with bond phonons modulating electron\ntunneling, is a paradigmatic electron-phonon model that hosts an\nantiferromagnetic order to bond order transition at half-filling. In the\npresence of repulsive Hubbard interaction, the antiferromagnetic phase is\nenhanced, but the phase transition remains first-order. Here we explore the\nphysics of the SSH model with attractive Hubbard interaction, which hosts an\ninteresting interplay among charge order, s-wave pairing, and bond order. Using\nthe numerically exact determinant quantum Monte Carlo method, we show that both\ncharge order, present at weak electron-phonon coupling, and bond order, at\nlarge coupling, give way to s-wave pairing when the system is doped.\nFurthermore, we demonstrate that the SSH electron-phonon interaction competes\nwith the attractive Hubbard interaction and reduces the s-wave pairing\ncorrelation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:00:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xing","Bo",""],["Feng","Chunhan",""],["Scalettar","Richard",""],["Batrouni","G. George",""],["Poletti","Dario",""]]}
{"id":"2308.03847","submitter":"Vinicius Mikuni","authors":"Vinicius Mikuni, Benjamin Nachman","title":"CaloScore v2: Single-shot Calorimeter Shower Simulation with Diffusion\n  Models","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion generative models are promising alternatives for fast surrogate\nmodels, producing high-fidelity physics simulations. However, the generation\ntime often requires an expensive denoising process with hundreds of function\nevaluations, restricting the current applicability of these models in a\nrealistic setting. In this work, we report updates on the CaloScore\narchitecture, detailing the changes in the diffusion process, which produces\nhigher quality samples, and the use of progressive distillation, resulting in a\ndiffusion model capable of generating new samples with a single function\nevaluation. We demonstrate these improvements using the Calorimeter Simulation\nChallenge 2022 dataset.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:01:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mikuni","Vinicius",""],["Nachman","Benjamin",""]]}
{"id":"2308.03848","submitter":"Alessandro Pini","authors":"Alessandro Pini, Paolo Vallarino","title":"Wilson loop correlators at strong coupling in $\\mathcal{N}=2$ quiver\n  gauge theories","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 4-dimensional $\\mathcal{N} = 2$ superconformal quiver theories\nwith $SU(N)^M$ gauge group and bi-fundamental matter and we evaluate\ncorrelation functions of $n$ coincident Wilson loops in the planar limit of the\ntheory. Exploiting specific untwisted/twisted combinations of these operators\nand using supersymmetric localization, we are able to resum the whole\nperturbative expansion and find exact expressions for these correlators that\nare valid for all values of the 't Hooft coupling. Moreover, we analytically\nderive the leading strong coupling behaviour of the correlators, showing that\nthey obey a remarkable simple rule. Our analysis is complemented by numerical\nchecks based on a Pad\\'e resummation of the perturbative series.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:01:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pini","Alessandro",""],["Vallarino","Paolo",""]]}
{"id":"2308.03849","submitter":"Shakeel Ur Rahaman","authors":"Joydeep Chakrabortty, Shakeel Ur Rahaman, and Kaanapuli Ramkumar","title":"One-loop Effective Action up to Dimension Eight: Integrating out Heavy\n  Fermion(s)","comments":"1 Table, 42 pages","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 universal one-loop effective action up to dimension eight\nafter integrating out heavy fermion(s) using the Heat-Kernel method. We have\ndiscussed how the Dirac operator being a weak elliptic operator, the fermionic\noperator still can be written in the form of a strong elliptic one such that\nthe Heat-Kernel coefficients can be used to compute the fermionic effective\naction. This action captures the footprint of both the CP conserving as well as\nviolating UV interactions. As it does not rely on the specific forms of either\nUV or low energy theories, can be applicable for a very generic action. Our\nresult encapsulates the effects of heavy fermion loops only.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:01:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chakrabortty","Joydeep",""],["Rahaman","Shakeel Ur",""],["Ramkumar","Kaanapuli",""]]}
{"id":"2308.03850","submitter":"Francisco Duque","authors":"Francisco Duque","title":"Gravitational Waves and the Galactic Potential","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the next decade, third-generation interferometers and the space-based\nLISA mission will observe binaries in galactic centers involving supermassive\nblack holes with millions of solar masses. More precise measurements of more\nextreme events that probe stronger gravitational fields can have a tremendous\nimpact on fundamental physics, astrophysics, and cosmology. However, at the\ngalactic scale, accretion disks, dark matter halos, and dense populations of\ncompact objects can interact gravitationally with coalescing bodies. The role\nthese astrophysical structures play in the evolution and gravitational-wave\nsignature of binary systems remains largely unexplored and previous studies\nhave often relied on ad-hoc Newtonian approximations. In this thesis, we aim to\nimprove this picture. We study how tidal deformations of matter surrounding\nblack holes can mask off deviations from General Relativity. We also explore\nthe deep connection between light rings -- closed orbits of massless particles\n-- and the proper oscillation modes of compact objects. We show that\nindependently of the presence of an environment, the light ring controls the\nlate-time appearance of infalling matter to distant observers and how the final\nblack hole formed in a collision relaxes to stationarity. Finally, we develop\nthe first fully-relativistic framework capable of studying gravitational wave\nemission in non-vacuum environments. We apply it to galactic black-hole\nbinaries surrounded by a dark matter halo and observe the conversion between\nmatter and gravitational waves. This coupling results in significant changes in\nthe energy flux emitted, which could help constrain the properties of galactic\nmatter distributions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:01:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Duque","Francisco",""]]}
{"id":"2308.03851","submitter":"Philippe Suchsland","authors":"Philippe Suchsland, Roderich Moessner, and Pieter W. Claeys","title":"Krylov complexity and Trotter transitions in unitary circuit dynamics","comments":"22 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cond-mat.str-el nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate many-body dynamics where the evolution is governed by unitary\ncircuits through the lens of `Krylov complexity', a recently proposed measure\nof complexity and quantum chaos. We extend the formalism of Krylov complexity\nto unitary circuit dynamics and focus on Floquet circuits arising as the\nTrotter decomposition of Hamiltonian dynamics. For short Trotter steps the\nresults from Hamiltonian dynamics are recovered, whereas a large Trotter step\nresults in different universal behavior characterized by the existence of local\nmaximally ergodic operators: operators with vanishing autocorrelation\nfunctions, as exemplified in dual-unitary circuits. These operators exhibit\nmaximal complexity growth, act as a memoryless bath for the dynamics, and can\nbe directly probed in current quantum computing setups. These two regimes are\nseparated by a crossover in chaotic systems. Conversely, we find that free\nintegrable systems exhibit a nonanalytic transition between these different\nregimes, where maximally ergodic operators appear at a critical Trotter step.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:01:29 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Suchsland","Philippe",""],["Moessner","Roderich",""],["Claeys","Pieter W.",""]]}
{"id":"2308.03852","submitter":"Artem Volosniev","authors":"Tibor Dome, Artem G. Volosniev, Areg Ghazaryan, Laleh Safari, Richard\n  Schmidt, and Mikhail Lemeshko","title":"Quantum Carousel: The Fate of a Bound State Attached to a Linear Rotor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.chem-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the angulon problem -- a linear rotor in a bosonic bath -- in the\nregime where attractive impurity-boson interactions can support a shallow bound\nstate. To study the fate of the angulon in the vicinity of bound-state\nformation, we formulate a beyond-linear-coupling model. First, we consider\nattractive, spherically symmetric impurity-boson interactions for which the\nlinear rotor can be mapped onto a static impurity. The well-known polaron\nformalism provides an adequate description in this limit. For anisotropic\npotentials, the presence of a shallow bound state with pronounced anisotropic\ncharacter leads to a many-body instability that washes out the angulon\ndynamics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:02:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dome","Tibor",""],["Volosniev","Artem G.",""],["Ghazaryan","Areg",""],["Safari","Laleh",""],["Schmidt","Richard",""],["Lemeshko","Mikhail",""]]}
{"id":"2308.03853","submitter":"Madhumita Sushil","authors":"Madhumita Sushil, Vanessa E. Kennedy, Brenda Y. Miao, Divneet Mandair,\n  Travis Zack, Atul J. Butte","title":"Extracting detailed oncologic history and treatment plan from medical\n  oncology notes with large language models","comments":"Source code available at:\n  https://github.com/MadhumitaSushil/OncLLMExtraction","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Both medical care and observational studies in oncology require a thorough\nunderstanding of a patient's disease progression and treatment history, often\nelaborately documented in clinical notes. Despite their vital role, no current\noncology information representation and annotation schema fully encapsulates\nthe diversity of information recorded within these notes. Although large\nlanguage models (LLMs) have recently exhibited impressive performance on\nvarious medical natural language processing tasks, due to the current lack of\ncomprehensively annotated oncology datasets, an extensive evaluation of LLMs in\nextracting and reasoning with the complex rhetoric in oncology notes remains\nunderstudied. We developed a detailed schema for annotating textual oncology\ninformation, encompassing patient characteristics, tumor characteristics,\ntests, treatments, and temporality. Using a corpus of 10 de-identified breast\ncancer progress notes at University of California, San Francisco, we applied\nthis schema to assess the abilities of three recently-released LLMs (GPT-4,\nGPT-3.5-turbo, and FLAN-UL2) to perform zero-shot extraction of detailed\noncological history from two narrative sections of clinical progress notes. Our\nteam annotated 2750 entities, 2874 modifiers, and 1623 relationships. The GPT-4\nmodel exhibited overall best performance, with an average BLEU score of 0.69,\nan average ROUGE score of 0.72, and an average accuracy of 67% on complex tasks\n(expert manual evaluation). Notably, it was proficient in tumor characteristic\nand medication extraction, and demonstrated superior performance in inferring\nsymptoms due to cancer and considerations of future medications. The analysis\ndemonstrates that GPT-4 is potentially already usable to extract important\nfacts from cancer progress notes needed for clinical research, complex\npopulation management, and documenting quality patient care.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:03:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sushil","Madhumita",""],["Kennedy","Vanessa E.",""],["Miao","Brenda Y.",""],["Mandair","Divneet",""],["Zack","Travis",""],["Butte","Atul J.",""]]}
{"id":"2308.03854","submitter":"Aditya G. Parameswaran","authors":"Aditya G. Parameswaran, Shreya Shankar, Parth Asawa, Naman Jain, Yujie\n  Wang","title":"Revisiting Prompt Engineering via Declarative Crowdsourcing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.AI cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Large language models (LLMs) are incredibly powerful at comprehending and\ngenerating data in the form of text, but are brittle and error-prone. There has\nbeen an advent of toolkits and recipes centered around so-called prompt\nengineering-the process of asking an LLM to do something via a series of\nprompts. However, for LLM-powered data processing workflows, in particular,\noptimizing for quality, while keeping cost bounded, is a tedious, manual\nprocess. We put forth a vision for declarative prompt engineering. We view LLMs\nlike crowd workers and leverage ideas from the declarative crowdsourcing\nliterature-including leveraging multiple prompting strategies, ensuring\ninternal consistency, and exploring hybrid-LLM-non-LLM approaches-to make\nprompt engineering a more principled process. Preliminary case studies on\nsorting, entity resolution, and imputation demonstrate the promise of our\napproach\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:04:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Parameswaran","Aditya G.",""],["Shankar","Shreya",""],["Asawa","Parth",""],["Jain","Naman",""],["Wang","Yujie",""]]}
{"id":"2308.03855","submitter":"Zhenhao Jiang","authors":"Zhenhao Jiang, Biao Zeng, Hao Feng, Jin Liu, Jie Zhang, Jia Jia, Ning\n  Hu","title":"Mobile Supply: The Last Piece of Jigsaw of Recommender System","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":"  Recommendation system is a fundamental functionality of online platforms.\nWith the development of computing power of mobile phones, some researchers have\ndeployed recommendation algorithms on users' mobile devices to address the\nproblems of data transmission delay and pagination trigger mechanism. However,\nthe existing edge-side mobile rankings cannot completely solve the problem of\npagination trigger mechanism. The mobile ranking can only sort the items on the\ncurrent page, and the fixed set of candidate items limits the performance of\nthe mobile ranking. Besides, after the user has viewed the items of interest to\nthe user on the current page, the user refresh to get a new page of items. This\nwill affect the user's immersive experience because the user is not satisfied\nwith the left items on the current page. In order to address the problem of\npagination trigger mechanism, we propose a completely new module in the\npipeline of recommender system named Mobile Supply. The pipeline of recommender\nsystem is extended to \"retrival->pre-ranking->ranking->re-ranking->Mobile\nSupply->mobile ranking\". Specifically, we introduce the concept of list value\nand use point-wise paradigm to approximate list-wise estimation to calculate\nthe maximum revenue that can be achieved by mobile ranking for the current\npage. We also design a new mobile ranking approach named device-aware mobile\nranking considering the differences of mobile devices tailored to the new\npipeline. Extensive offline and online experiments show the superiority of our\nproposed method and prove that Mobile Supply can further improve the\nperformance of edge-side recommender system and user experience. Mobile Supply\nhas been deployed on the homepage of a large-scale online food platform and has\nyielded considerable profits in our business.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:06:46 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 02:36:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jiang","Zhenhao",""],["Zeng","Biao",""],["Feng","Hao",""],["Liu","Jin",""],["Zhang","Jie",""],["Jia","Jia",""],["Hu","Ning",""]]}
{"id":"2308.03856","submitter":"Jesse Osborn","authors":"Jesse Osborn, Sarah Mancina, Manuel Silva (for the IceCube\n  Collaboration)","title":"Enhanced Starting Track Real-time Stream for IceCube","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-1464","categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  IceCube real-time alerts allow for rapid follow-up observations of likely\nastrophysical neutrino events, enabling searches for multi-messenger\ncounterparts. The Enhanced Starting Track Real-time Stream (ESTReS) is a\nreal-time extension of the Enhanced Starting Track Event Selection (ESTES), a\nhigh astrophysical purity muon-neutrino sample recently used by IceCube to\nmeasure the astrophysical diffuse flux. A set of computationally cheap cuts\nallows us to run a fast filter in seconds. This online filter selects about 100\nevents per day to be sent to Madison, WI via satellite where the full ESTES\nevent selection is applied within minutes. Events that pass the final set of\ncuts (ESTReS + ESTES) will be sent out as real-time alerts to the broader\nastrophysical community. ESTReS's unique contribution to the current real-time\nalerts will be events in the southern sky in the 5 TeV - 100 TeV range. We\nexpect about 10.3 events per year which average 50% astrophysical purity. In\nthis talk I will report the status of the ESTReS alert stream in the context of\nthe IceCube real-time program.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:09:29 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Osborn","Jesse","","for the IceCube\n  Collaboration"],["Mancina","Sarah","","for the IceCube\n  Collaboration"],["Silva","Manuel","","for the IceCube\n  Collaboration"]]}
{"id":"2308.03857","submitter":"Ravi Kalpathy","authors":"Kiran R. Bhutani, Ravi Kalpathy and Hosam Mahmoud","title":"Degrees in random $m$-ary hooking networks","comments":"21 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The theme in this paper is a composition of random graphs and P\\'olya urns.\nThe random graphs are generated through a small structure called the seed. Via\nP\\'olya urns, we study the asymptotic degree structure in a random $m$-ary\nhooking network and identify strong laws. We further upgrade the result to\nsecond-order asymptotics in the form of multivariate Gaussian limit laws. We\ngive a few concrete examples and explore some properties with a full\nrepresentation of the Gaussian limit in each case. The asymptotic covariance\nmatrix associated with the P\\'olya urn is obtained by a new method that\noriginated in this paper and is reported in [25].\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:09:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bhutani","Kiran R.",""],["Kalpathy","Ravi",""],["Mahmoud","Hosam",""]]}
{"id":"2308.03858","submitter":"Christa Cuchiero","authors":"Christa Cuchiero, Tonio M\\\"ollmann and Josef Teichmann","title":"Ramifications of generalized Feller theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generalized Feller theory provides an important analog to Feller theory\nbeyond locally compact state spaces. This is very useful for solutions of\ncertain stochastic partial differential equations, Markovian lifts of\nfractional processes, or infinite dimensional affine and polynomial processes\nwhich appear prominently in the theory of signature stochastic differential\nequations. We extend several folklore results related to generalized Feller\nprocesses, in particular on their construction and path properties, and provide\nthe often quite sophisticated proofs in full detail. We also introduce the new\nconcept of extended Feller processes and compare them with standard and\ngeneralized ones. A key example relates generalized Feller semigroups of\nalgebra homomorphisms via the method of characteristics to transport equations\nand continuous semiflows on weighted spaces, i.e. a remarkably generic way to\ntreat differential equations on weighted spaces. We also provide a\ncounterexample, which shows that no condition of the basic definition of\ngeneralized Feller semigroups can be dropped.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:10:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cuchiero","Christa",""],["M\u00f6llmann","Tonio",""],["Teichmann","Josef",""]]}
{"id":"2308.03859","submitter":"Harry Richman","authors":"Harry Richman, Farbod Shokrieh, and Chenxi Wu","title":"Counting two-forests and random cut size via potential theory","comments":"20 pages, 5 figures. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.DG math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a lower bound on the number of spanning two-forests in a graph, in\nterms of the number of vertices, edges, and spanning trees. This implies an\nupper bound on the average cut size of a random two-forest. The main tool is an\nidentity relating the number of spanning trees and two-forests to pairwise\neffective resistances in a graph. Along the way, we make connections to\npotential theoretic invariants on metric graphs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:10:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Richman","Harry",""],["Shokrieh","Farbod",""],["Wu","Chenxi",""]]}
{"id":"2308.03860","submitter":"Alisson R Cadore","authors":"Raphaela De Oliveira, Alisson R. Cadore, Raul O. Freitas, Ingrid D.\n  Barcelos","title":"Review on Infrared Nanospectroscopy of Natural 2D Phyllosilicates","comments":"11 pages, 11 figs","journal-ref":"Journal of the Optical Society of America A, 2023","doi":"10.1364/JOSAA.482518","report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Phyllosilicates emerge as a promising class of large bandgap lamellar\ninsulators. Their applications have been explored from fabrication of\ngraphene-based devices to 2D heterostructures based on transition metal\ndicalcogenides with enhanced optical and polaritonics properties. In this\nreview, we provide an overview on the use of IR s-SNOM for studying nano-optics\nand local chemistry of a variety of 2D natural phyllosilicates. Finally, we\nbring a brief update on applications that combine natural lamellar minerals\ninto multifunctional nanophotonic devices driven by electrical control.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:13:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["De Oliveira","Raphaela",""],["Cadore","Alisson R.",""],["Freitas","Raul O.",""],["Barcelos","Ingrid D.",""]]}
{"id":"2308.03861","submitter":"Seyed Mohamad Ali Tousi","authors":"Gbenga Omotara, Seyed Mohamad Ali Tousi, Jared Decker, Derek Brake,\n  Guilherme N. DeSouza","title":"High-Throughput and Accurate 3D Scanning of Cattle Using Time-of-Flight\n  Sensors and Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce a high throughput 3D scanning solution specifically designed to\nprecisely measure cattle phenotypes. This scanner leverages an array of depth\nsensors, i.e. time-of-flight (Tof) sensors, each governed by dedicated embedded\ndevices. The system excels at generating high-fidelity 3D point clouds, thus\nfacilitating an accurate mesh that faithfully reconstructs the cattle geometry\non the fly. In order to evaluate the performance of our system, we have\nimplemented a two-fold validation process. Initially, we test the scanner's\ncompetency in determining volume and surface area measurements within a\ncontrolled environment featuring known objects. Secondly, we explore the impact\nand necessity of multi-device synchronization when operating a series of\ntime-of-flight sensors. Based on the experimental results, the proposed system\nis capable of producing high-quality meshes of untamed cattle for livestock\nstudies.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:15:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Omotara","Gbenga",""],["Tousi","Seyed Mohamad Ali",""],["Decker","Jared",""],["Brake","Derek",""],["DeSouza","Guilherme N.",""]]}
{"id":"2308.03862","submitter":"Yin Shi","authors":"Yin Shi and Jonathan Schirmer and Long-Qing Chen","title":"Hall Coefficient and Resistivity in the Doped Bilayer Hubbard Model","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":"  Finding and understanding non-Fermi liquid transport behaviors are at the\ncore of condensed matter physics. Most of the existing studies were devoted to\nthe monolayer Hubbard model, which is the simplest model that captures\nessential features of high-temperature superconductivity. Here we discover a\nnew type of non-Fermi liquid behavior emergent in the hole-doped bilayer\nHubbard model, using dynamical mean-field theory with a full consideration of\nthe short-range interlayer electron correlation. We find that at low\ntemperatures, the Hall coefficient has a strong nonmonotonic dependence on\ntemperature, leading to a double or quadruple reversal of its sign depending on\nthe doping level. At the same time, the resistivity exhibits two plateaus\nrather than linearity in its temperature dependence. We show that these\nintriguing transport behaviors stem from the formation of coherent interlayer\nsinglets, which scatter off gapped collective modes arising from short-range\ninterlayer antiferromagnetic fluctuations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:15:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shi","Yin",""],["Schirmer","Jonathan",""],["Chen","Long-Qing",""]]}
{"id":"2308.03863","submitter":"Dhayaa Anbajagane","authors":"D. Anbajagane, C. Chang, A. Banerjee, T. Abel, M. Gatti, V. Ajani, A.\n  Alarcon, A. Amon, E. J. Baxter, K. Bechtol, M. R. Becker, G. M. Bernstein, A.\n  Campos, A. Carnero Rosell, M. Carrasco Kind, R. Chen, A. Choi, C. Davis, J.\n  DeRose, H. T. Diehl, S. Dodelson, C. Doux, A. Drlica-Wagner, K. Eckert, J.\n  Elvin-Poole, S. Everett, A. Fert'e, D. Gruen, R. A. Gruendl, I. Harrison, W.\n  G. Hartley, E. M. Huff, B. Jain, M. Jarvis, N. Jeffrey, T. Kacprzak, N.\n  Kokron, N. Kuropatkin, P.-F. Leget, N. MacCrann, J. McCullough, J. Myles, A.\n  Navarro-Alsina, S. Pandey, J. Prat, M. Raveri, R. P. Rollins, A. Roodman, E.\n  S. Rykoff, C. Sanchez, L. F. Secco, I. Sevilla-Noarbe, E. Sheldon, T. Shin,\n  M. A. Troxel, I. Tutusaus, L. Whiteway, B. Yanny, B. Yin, Y. Zhang, T. M. C.\n  Abbott, S. Allam, M. Aguena, O. Alves, F. Andrade-Oliveira, J. Annis, D.\n  Bacon, J. Blazek, D. Brooks, R. Cawthon, L. N. da Costa, M. E. S. Pereira, T.\n  M. Davis, S. Desai, P. Doel, I. Ferrero, J. Frieman, G. Giannini, G.\n  Gutierrez, S. R. Hinton, D. L. Hollowood, K. Honscheid, D. J. James, K.\n  Kuehn, O. Lahav, J. L. Marshall, J. Mena-Fernandez, F. Menanteau, R. Miquel,\n  A. Palmese, A. Pieres, A. A. Plazas Malag'on, K. Reil, E. Sanchez, M. Smith,\n  M. E. C. Swanson, G. Tarle, and P. Wiseman","title":"Beyond the 3rd moment: A practical study of using lensing convergence\n  CDFs for cosmology with DES Y3","comments":"21 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Widefield surveys of the sky probe many clustered scalar fields -- such as\ngalaxy counts, lensing potential, gas pressure, etc. -- that are sensitive to\ndifferent cosmological and astrophysical processes. Our ability to constrain\nsuch processes from these fields depends crucially on the statistics chosen to\nsummarize the field. In this work, we explore the cumulative distribution\nfunction (CDF) at multiple scales as a summary of the galaxy lensing\nconvergence field. Using a suite of N-body lightcone simulations, we show the\nCDFs' constraining power is modestly better than that of the 2nd and 3rd\nmoments of the field, as they approximately capture the information from all\nmoments of the field in a concise data vector. We then study the practical\naspects of applying the CDFs to observational data, using the first three years\nof the Dark Energy Survey (DES Y3) data as an example, and compute the impact\nof different systematics on the CDFs. The contributions from the point spread\nfunction are 2-3 orders of magnitude below the cosmological signal, while those\nfrom reduced shear approximation contribute $\\lesssim 1\\%$ to the signal.\nSource clustering effects and baryon imprints contribute $1-10\\%$. Enforcing\nscale cuts to limit systematics-driven biases in parameter constraints degrades\nthese constraints a noticeable amount, and this degradation is similar for the\nCDFs and the moments. We also detect correlations between the observed\nconvergence field and the shape noise field at $13\\sigma$. We find that the\nnon-Gaussian correlations in the noise field must be modeled accurately to use\nthe CDFs, or other statistics sensitive to all moments, as a rigorous cosmology\ntool.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:20:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Anbajagane","D.",""],["Chang","C.",""],["Banerjee","A.",""],["Abel","T.",""],["Gatti","M.",""],["Ajani","V.",""],["Alarcon","A.",""],["Amon","A.",""],["Baxter","E. J.",""],["Bechtol","K.",""],["Becker","M. R.",""],["Bernstein","G. M.",""],["Campos","A.",""],["Rosell","A. Carnero",""],["Kind","M. Carrasco",""],["Chen","R.",""],["Choi","A.",""],["Davis","C.",""],["DeRose","J.",""],["Diehl","H. T.",""],["Dodelson","S.",""],["Doux","C.",""],["Drlica-Wagner","A.",""],["Eckert","K.",""],["Elvin-Poole","J.",""],["Everett","S.",""],["Fert'e","A.",""],["Gruen","D.",""],["Gruendl","R. A.",""],["Harrison","I.",""],["Hartley","W. G.",""],["Huff","E. M.",""],["Jain","B.",""],["Jarvis","M.",""],["Jeffrey","N.",""],["Kacprzak","T.",""],["Kokron","N.",""],["Kuropatkin","N.",""],["Leget","P. -F.",""],["MacCrann","N.",""],["McCullough","J.",""],["Myles","J.",""],["Navarro-Alsina","A.",""],["Pandey","S.",""],["Prat","J.",""],["Raveri","M.",""],["Rollins","R. P.",""],["Roodman","A.",""],["Rykoff","E. S.",""],["Sanchez","C.",""],["Secco","L. F.",""],["Sevilla-Noarbe","I.",""],["Sheldon","E.",""],["Shin","T.",""],["Troxel","M. A.",""],["Tutusaus","I.",""],["Whiteway","L.",""],["Yanny","B.",""],["Yin","B.",""],["Zhang","Y.",""],["Abbott","T. M. C.",""],["Allam","S.",""],["Aguena","M.",""],["Alves","O.",""],["Andrade-Oliveira","F.",""],["Annis","J.",""],["Bacon","D.",""],["Blazek","J.",""],["Brooks","D.",""],["Cawthon","R.",""],["da Costa","L. N.",""],["Pereira","M. E. S.",""],["Davis","T. M.",""],["Desai","S.",""],["Doel","P.",""],["Ferrero","I.",""],["Frieman","J.",""],["Giannini","G.",""],["Gutierrez","G.",""],["Hinton","S. R.",""],["Hollowood","D. L.",""],["Honscheid","K.",""],["James","D. J.",""],["Kuehn","K.",""],["Lahav","O.",""],["Marshall","J. L.",""],["Mena-Fernandez","J.",""],["Menanteau","F.",""],["Miquel","R.",""],["Palmese","A.",""],["Pieres","A.",""],["Malag'on","A. A. Plazas",""],["Reil","K.",""],["Sanchez","E.",""],["Smith","M.",""],["Swanson","M. E. C.",""],["Tarle","G.",""],["Wiseman","P.",""]]}
{"id":"2308.03864","submitter":"Xingbo Wang","authors":"Zhenhui Peng, Xingbo Wang, Qiushi Han, Junkai Zhu, Xiaojuan Ma, and\n  Huamin Qu","title":"Storyfier: Exploring Vocabulary Learning Support with Text Generation\n  Models","comments":"To appear at the 2023 ACM Symposium on User Interface Software and\n  Technology (UIST); 16 pages (7 figures, 23 tables)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vocabulary learning support tools have widely exploited existing materials,\ne.g., stories or video clips, as contexts to help users memorize each target\nword. However, these tools could not provide a coherent context for any target\nwords of learners' interests, and they seldom help practice word usage. In this\npaper, we work with teachers and students to iteratively develop Storyfier,\nwhich leverages text generation models to enable learners to read a generated\nstory that covers any target words, conduct a story cloze test, and use these\nwords to write a new story with adaptive AI assistance. Our within-subjects\nstudy (N=28) shows that learners generally favor the generated stories for\nconnecting target words and writing assistance for easing their learning\nworkload. However, in the read-cloze-write learning sessions, participants\nusing Storyfier perform worse in recalling and using target words than learning\nwith a baseline tool without our AI features. We discuss insights into\nsupporting learning tasks with generative models.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:25:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Peng","Zhenhui",""],["Wang","Xingbo",""],["Han","Qiushi",""],["Zhu","Junkai",""],["Ma","Xiaojuan",""],["Qu","Huamin",""]]}
{"id":"2308.03865","submitter":"Zhongliang Jiang","authors":"Zhongliang Jiang, Yue Zhou, Dongliang Cao, Nassir Navab","title":"DefCor-Net: Physics-Aware Ultrasound Deformation Correction","comments":"Accepted by MedIA. code is available","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recovery of morphologically accurate anatomical images from deformed ones\nis challenging in ultrasound (US) image acquisition, but crucial to accurate\nand consistent diagnosis, particularly in the emerging field of\ncomputer-assisted diagnosis. This article presents a novel anatomy-aware\ndeformation correction approach based on a coarse-to-fine, multi-scale deep\nneural network (DefCor-Net). To achieve pixel-wise performance, DefCor-Net\nincorporates biomedical knowledge by estimating pixel-wise stiffness online\nusing a U-shaped feature extractor. The deformation field is then computed\nusing polynomial regression by integrating the measured force applied by the US\nprobe. Based on real-time estimation of pixel-by-pixel tissue properties, the\nlearning-based approach enables the potential for anatomy-aware deformation\ncorrection. To demonstrate the effectiveness of the proposed DefCor-Net, images\nrecorded at multiple locations on forearms and upper arms of six volunteers are\nused to train and validate DefCor-Net. The results demonstrate that DefCor-Net\ncan significantly improve the accuracy of deformation correction to recover the\noriginal geometry (Dice Coefficient: from $14.3\\pm20.9$ to $82.6\\pm12.1$ when\nthe force is $6N$).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:27:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jiang","Zhongliang",""],["Zhou","Yue",""],["Cao","Dongliang",""],["Navab","Nassir",""]]}
{"id":"2308.03866","submitter":"Jogi Suda Neto","authors":"Jogi Suda Neto, Li Deng, Thejaswi Raya, Reza Shahbazi, Nick Liu,\n  Adhitya Venkatesh, Miral Shah, Neeru Khosla, Rodrigo Capobianco Guido","title":"Trusting Language Models in Education","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":"  Language Models are being widely used in Education. Even though modern deep\nlearning models achieve very good performance on question-answering tasks,\nsometimes they make errors. To avoid misleading students by showing wrong\nanswers, it is important to calibrate the confidence - that is, the prediction\nprobability - of these models. In our work, we propose to use an XGBoost on top\nof BERT to output the corrected probabilities, using features based on the\nattention mechanism. Our hypothesis is that the level of uncertainty contained\nin the flow of attention is related to the quality of the model's response\nitself.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:27:54 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Neto","Jogi Suda",""],["Deng","Li",""],["Raya","Thejaswi",""],["Shahbazi","Reza",""],["Liu","Nick",""],["Venkatesh","Adhitya",""],["Shah","Miral",""],["Khosla","Neeru",""],["Guido","Rodrigo Capobianco",""]]}
{"id":"2308.03867","submitter":"Yun Guo","authors":"Yun Guo, Xueyao Xiao, Yi Chang, Shumin Deng, Luxin Yan","title":"From Sky to the Ground: A Large-scale Benchmark and Simple Baseline\n  Towards Real Rain Removal","comments":"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-based image deraining methods have made great progress. However, the\nlack of large-scale high-quality paired training samples is the main bottleneck\nto hamper the real image deraining (RID). To address this dilemma and advance\nRID, we construct a Large-scale High-quality Paired real rain benchmark\n(LHP-Rain), including 3000 video sequences with 1 million high-resolution\n(1920*1080) frame pairs. The advantages of the proposed dataset over the\nexisting ones are three-fold: rain with higher-diversity and larger-scale,\nimage with higher-resolution and higher-quality ground-truth. Specifically, the\nreal rains in LHP-Rain not only contain the classical rain\nstreak/veiling/occlusion in the sky, but also the \\textbf{splashing on the\nground} overlooked by deraining community. Moreover, we propose a novel robust\nlow-rank tensor recovery model to generate the GT with better separating the\nstatic background from the dynamic rain. In addition, we design a simple\ntransformer-based single image deraining baseline, which simultaneously utilize\nthe self-attention and cross-layer attention within the image and rain layer\nwith discriminative feature representation. Extensive experiments verify the\nsuperiority of the proposed dataset and deraining method over state-of-the-art.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:39:14 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 14:46:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guo","Yun",""],["Xiao","Xueyao",""],["Chang","Yi",""],["Deng","Shumin",""],["Yan","Luxin",""]]}
{"id":"2308.03868","submitter":"Brian Tang","authors":"Brian Tang and Kang G. Shin","title":"Eye-Shield: Real-Time Protection of Mobile Device Screen Information\n  from Shoulder Surfing","comments":"Published at 32nd USENIX Security Symposium (2023) U.S. Pat. App. No.\n  63/468,650-Conf. #8672","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  People use mobile devices ubiquitously for computing, communication, storage,\nweb browsing, and more. As a result, the information accessed and stored within\nmobile devices, such as financial and health information, text messages, and\nemails, can often be sensitive. Despite this, people frequently use their\nmobile devices in public areas, becoming susceptible to a simple yet effective\nattack, shoulder surfing. Shoulder surfing occurs when a person near a mobile\nuser peeks at the user's mobile device, potentially acquiring passcodes, PINs,\nbrowsing behavior, or other personal information. We propose Eye-Shield, a\nsolution to prevent shoulder surfers from accessing or stealing sensitive\non-screen information. Eye-Shield is designed to protect all types of on-screen\ninformation in real time, without any serious impediment to users' interactions\nwith their mobile devices. Eye-Shield generates images that appear readable at\nclose distances, but appear blurry or pixelated at farther distances and wider\nangles. It is capable of protecting on-screen information from shoulder\nsurfers, operating in real time, and being minimally intrusive to the intended\nusers. Eye-Shield protects images and text from shoulder surfers by reducing\nrecognition rates to 24.24% and 15.91%. Our implementations of Eye-Shield, with\nframe rates of 24 FPS for Android and 43 FPS for iOS, effectively work on\nscreen resolutions as high as 1440x3088. Eye-Shield also incurs acceptable\nmemory usage, CPU utilization, and energy overhead. Finally, our MTurk and\nin-person user studies indicate that Eye-Shield protects on-screen information\nwithout a large usability cost for privacy-conscious users.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:40:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tang","Brian",""],["Shin","Kang G.",""]]}
{"id":"2308.03869","submitter":"Aritra Mandal","authors":"Aritra Mandal, Daniel Tunkelang and Zhe Wu","title":"Semantic Equivalence of e-Commerce Queries","comments":"The 6th Workshop on e-Commerce and NLP","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Search query variation poses a challenge in e-commerce search, as equivalent\nsearch intents can be expressed through different queries with surface-level\ndifferences. This paper introduces a framework to recognize and leverage query\nequivalence to enhance searcher and business outcomes. The proposed approach\naddresses three key problems: mapping queries to vector representations of\nsearch intent, identifying nearest neighbor queries expressing equivalent or\nsimilar intent, and optimizing for user or business objectives. The framework\nutilizes both surface similarity and behavioral similarity to determine query\nequivalence. Surface similarity involves canonicalizing queries based on word\ninflection, word order, compounding, and noise words. Behavioral similarity\nleverages historical search behavior to generate vector representations of\nquery intent. An offline process is used to train a sentence similarity model,\nwhile an online nearest neighbor approach supports processing of unseen\nqueries. Experimental evaluations demonstrate the effectiveness of the proposed\napproach, outperforming popular sentence transformer models and achieving a\nPearson correlation of 0.85 for query similarity. The results highlight the\npotential of leveraging historical behavior data and training models to\nrecognize and utilize query equivalence in e-commerce search, leading to\nimproved user experiences and business outcomes. Further advancements and\nbenchmark datasets are encouraged to facilitate the development of solutions\nfor this critical problem in the e-commerce domain.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:40:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mandal","Aritra",""],["Tunkelang","Daniel",""],["Wu","Zhe",""]]}
{"id":"2308.03870","submitter":"Raphael Huser","authors":"Daniela Cisneros, Arnab Hazra, and Rapha\\\"el Huser","title":"Spatial wildfire risk modeling using mixtures of tree-based multivariate\n  Pareto distributions","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":"  Wildfires pose a severe threat to the ecosystem and economy, and risk\nassessment is typically based on fire danger indices such as the McArthur\nForest Fire Danger Index (FFDI) used in Australia. Studying the joint tail\ndependence structure of high-resolution spatial FFDI data is thus crucial for\nestimating current and future extreme wildfire risk. However, existing\nlikelihood-based inference approaches are computationally prohibitive in high\ndimensions due to the need to censor observations in the bulk of the\ndistribution. To address this, we construct models for spatial FFDI extremes by\nleveraging the sparse conditional independence structure of\nH\\\"usler--Reiss-type generalized Pareto processes defined on trees. These\nmodels allow for a simplified likelihood function that is computationally\nefficient. Our framework involves a mixture of tree-based multivariate Pareto\ndistributions with randomly generated tree structures, resulting in a flexible\nmodel that can capture nonstationary spatial dependence structures. We fit the\nmodel to summer FFDI data from different spatial clusters in Mainland Australia\nand 14 decadal windows between 1999--2022 to study local spatiotemporal\nvariability with respect to the magnitude and extent of extreme wildfires. Our\nresults demonstrate that our proposed method fits the margins and spatial tail\ndependence structure adequately, and is helpful to provide extreme wildfire\nrisk measures.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:40:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cisneros","Daniela",""],["Hazra","Arnab",""],["Huser","Rapha\u00ebl",""]]}
{"id":"2308.03871","submitter":"Shogo Ishikawa","authors":"Shogo Ishikawa, Teppei Okumura, and Takahiro Nishimichi","title":"Mock Observatory: two thousand lightcone mock catalogues of luminous red\n  galaxies from the Hyper Suprime-Cam Survey for the cosmological large-scale\n  analysis","comments":"13 pages, 11 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Estimating a reliable covariance matrix for correlation functions of galaxies\nis a crucial task to obtain accurate cosmological constraints from galaxy\nsurveys. We generate 2,000 independent lightcone mock luminous red galaxy\n(LRGs) catalogues at $0.3 \\leq z \\leq 1.25$, designed to cover CAMIRA LRGs\nobserved by the Subaru Hyper Suprime-Cam Subaru Strategic Programme (HSC SSP).\nWe first produce full-sky lightcone halo catalogues using a COmoving Lagrangian\nAcceleration (COLA) technique, and then trim them to match the footprints of\nthe HSC SSP S20A Wide layers. The mock LRGs are subsequently populated onto the\ntrimmed halo catalogues according to the halo occupation distribution model\nconstrained by the observed CAMIRA LRGs. The stellar mass ($M_{\\star}$) is\nassigned to each LRG by the subhalo abundance-matching technique using the\nobserved stellar-mass functions of CAMIRA LRGs. We evaluate photometric\nredshifts (photo-$z$) of mock LRGs by incorporating the photo-$z$ scatter,\nwhich is derived from the observed $M_{\\star}$--photo-$z$-scatter relations of\nthe CAMIRA LRGs. We validate the constructed full-sky halo and lightcone LRG\nmock catalogues by comparing their angular clustering statistics (i.e., power\nspectra and correlation functions) with those measured from the halo catalogues\nof full $N$-body simulations and the CAMIRA LRG catalogues from the HSC SSP,\nrespectively. We detect clear signatures of baryon acoustic oscillations (BAOs)\nfrom our mock LRGs, whose angular scales are well consistent with theoretical\npredictions. These results demonstrate that our mock LRGs can be used to\nevaluate covariance matrices at large scales and provide predictions for the\nBAO detectability and cosmological constraints.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:44:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ishikawa","Shogo",""],["Okumura","Teppei",""],["Nishimichi","Takahiro",""]]}
{"id":"2308.03872","submitter":"Denis Tolkachev","authors":"D.I.Kazakov, R.M.Iakhibbaev, D.M.Tolkachev","title":"Leading all-loop quantum contribution to the effective potential in the\n  inflationary cosmology","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we have constructed quantum effective potentials and used them\nto study slow-roll inflationary cosmology. We derived the generalised RG\nequation for the effective potential in the leading logarithmic approximation\nand applied it to evaluate the potentials of the $T^2$ and $T^4$-models, which\nare often used in modern models of slow-roll inflation. We found that while the\none-loop correction strongly affects the potential, breaking its original\nsymmetry, the contribution of higher loops smoothes the behaviour of the\npotential. However, unlike the $\\phi^4$-case, we found that the effective\npotentials preserve spontaneous symmetry breaking when summing all the leading\ncorrections. We calculated the spectral indices $n_s$ and $r$ for the effective\npotentials of both models and found that they are consistent with the\nobservational data for a wide range of parameters of the models.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:47:17 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 16:08:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kazakov","D. I.",""],["Iakhibbaev","R. M.",""],["Tolkachev","D. M.",""]]}
{"id":"2308.03873","submitter":"David N. Palacio","authors":"David N Palacio, Alejandro Velasco, Daniel Rodriguez-Cardenas, Kevin\n  Moran, Denys Poshyvanyk","title":"Evaluating and Explaining Large Language Models for Code Using Syntactic\n  Structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Large Language Models (LLMs) for code are a family of high-parameter,\ntransformer-based neural networks pre-trained on massive datasets of both\nnatural and programming languages. These models are rapidly being employed in\ncommercial AI-based developer tools, such as GitHub CoPilot. However, measuring\nand explaining their effectiveness on programming tasks is a challenging\nproposition, given their size and complexity. The methods for evaluating and\nexplaining LLMs for code are inextricably linked. That is, in order to explain\na model's predictions, they must be reliably mapped to fine-grained,\nunderstandable concepts. Once this mapping is achieved, new methods for\ndetailed model evaluations are possible. However, most current explainability\ntechniques and evaluation benchmarks focus on model robustness or individual\ntask performance, as opposed to interpreting model predictions.\n  To this end, this paper introduces ASTxplainer, an explainability method\nspecific to LLMs for code that enables both new methods for LLM evaluation and\nvisualizations of LLM predictions that aid end-users in understanding model\npredictions. At its core, ASTxplainer provides an automated method for aligning\ntoken predictions with AST nodes, by extracting and aggregating normalized\nmodel logits within AST structures. To demonstrate the practical benefit of\nASTxplainer, we illustrate the insights that our framework can provide by\nperforming an empirical evaluation on 12 popular LLMs for code using a curated\ndataset of the most popular GitHub projects. Additionally, we perform a user\nstudy examining the usefulness of an ASTxplainer-derived visualization of model\npredictions aimed at enabling model users to explain predictions. The results\nof these studies illustrate the potential for ASTxplainer to provide insights\ninto LLM effectiveness, and aid end-users in understanding predictions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:50:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Palacio","David N",""],["Velasco","Alejandro",""],["Rodriguez-Cardenas","Daniel",""],["Moran","Kevin",""],["Poshyvanyk","Denys",""]]}
{"id":"2308.03874","submitter":"Evan McKinney","authors":"Evan McKinney, Michael Hatridge, Alex K. Jones","title":"MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design\n  using Mirror Gates","comments":"13 pages, 13 figures. This paper is under review for the IEEE and/or\n  ACM","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building efficient large-scale quantum computers is a significant challenge\ndue to limited qubit connectivities and noisy hardware operations.\nTranspilation is critical to ensure that quantum gates are on physically linked\nqubits, while minimizing $\\texttt{SWAP}$ gates and simultaneously finding\nefficient decomposition into native $\\textit{basis gates}$. The goal of this\nmultifaceted optimization step is typically to minimize circuit depth and to\nachieve the best possible execution fidelity. In this work, we propose\n$\\textit{MIRAGE}$, a collaborative design and transpilation approach to\nminimize $\\texttt{SWAP}$ gates while improving decomposition using\n$\\textit{mirror gates}$. Mirror gates utilize the same underlying physical\ninteractions, but when their outputs are reversed, they realize a different or\n$\\textit{mirrored}$ quantum operation. Given the recent attention to\n$\\sqrt{\\texttt{iSWAP}}$ as a powerful basis gate with decomposition advantages\nover $\\texttt{CNOT}$, we show how systems that implement the $\\texttt{iSWAP}$\nfamily of gates can benefit from mirror gates. Further, $\\textit{MIRAGE}$ uses\nmirror gates to reduce routing pressure and reduce true circuit depth instead\nof just minimizing $\\texttt{SWAP}$s. We explore the benefits of decomposition\nfor $\\sqrt{\\texttt{iSWAP}}$ and $\\sqrt[4]{\\texttt{iSWAP}}$ using mirror gates,\nincluding both expanding Haar coverage and conducting a detailed fault rate\nanalysis trading off circuit depth against approximate gate decomposition. We\nalso describe a novel greedy approach accepting mirror substitution at\ndifferent aggression levels within MIRAGE. Finally, for $\\texttt{iSWAP}$\nsystems that use square-lattice topologies, $\\textit{MIRAGE}$ provides an\naverage of 29.6% reduction in circuit depth by eliminating an average of 59.9f%\n$\\texttt{SWAP}$ gates, which ultimately improves the practical applicability of\nour algorithm.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:52:08 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 03:32:31 GMT"},{"version":"v3","created":"Fri, 11 Aug 2023 01:58:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["McKinney","Evan",""],["Hatridge","Michael",""],["Jones","Alex K.",""]]}
{"id":"2308.03875","submitter":"Esteban Mart\\'inez-Vargas","authors":"Esteban Mart\\'inez-Vargas","title":"Stability Verification of Quantum non-i.i.d. sources","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce the problem of stability verification of quantum sources which\nare non-i.i.d.. The problem consists in ascertaining whether a given quantum\nsource is stable or not, in the sense that it produces always a desired quantum\nstate or if it suffers deviations. Stability is a statistical notion related to\nthe sparsity of errors. This problem is closely related to the problem of\nquantum verification first proposed by Pallister et. al. [1], however, it\nextends the notion of the original problem. We introduce a family of states\nthat come from these non-i.i.d. sources which we call a Markov state. These\nsources are more versatile than the i.i.d. ones as they allow statistical\ndeviations from the norm instead of the more coarse previous approach. We prove\nin theorem 1 that the Markov states are not well described with tensor products\nover a changing source. In theorem 2 we further provide a lower bound on the\ntrace distance between two Markov states, or conversely, an upper bound on the\nfidelity between these states. This is a bound on the capacity of determining\nthe stability property of the source, which shows that it is exponentially\neasier to ascertain this with respect to n, the number of outcomes from the\nsource.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:00:28 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 14:59:36 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 17:32:26 GMT"},{"version":"v4","created":"Thu, 24 Aug 2023 19:25:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mart\u00ednez-Vargas","Esteban",""]]}
{"id":"2308.03876","submitter":"Oz Amram","authors":"Oz Amram and Kevin Pedro","title":"CaloDiffusion with GLaM for High Fidelity Calorimeter Simulation","comments":"21 pages, 9 figures. V2: Added missing references, updated paper\n  format","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-384-CSAID-PPD","categories":"physics.ins-det hep-ex hep-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simulation is crucial for all aspects of collider data analysis, but the\navailable computing budget in the High Luminosity LHC era will be severely\nconstrained. Generative machine learning models may act as surrogates to\nreplace physics-based full simulation of particle detectors, and diffusion\nmodels have recently emerged as the state of the art for other generative\ntasks. We introduce CaloDiffusion, a denoising diffusion model trained on the\npublic CaloChallenge datasets to generate calorimeter showers. Our algorithm\nemploys 3D cylindrical convolutions, which take advantage of symmetries of the\nunderlying data representation. To handle irregular detector geometries, we\naugment the diffusion model with a new geometry latent mapping (GLaM) layer to\nlearn forward and reverse transformations to a regular geometry that is\nsuitable for cylindrical convolutions. The showers generated by our approach\nare nearly indistinguishable from the full simulation, as measured by several\ndifferent metrics.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:09:33 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 21:42:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Amram","Oz",""],["Pedro","Kevin",""]]}
{"id":"2308.03877","submitter":"Jose Raul Bravo Martinez","authors":"J.A. Hernandez, J.R. Bravo, S. Ares de Parga","title":"CECM: A continuous empirical cubature method with application to the\n  dimensional hyperreduction of parameterized finite element models","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 the Continuous Empirical Cubature Method (CECM), a novel algorithm\nfor empirically devising efficient integration rules. The CECM aims to improve\nexisting cubature methods by producing rules that are close to the optimal,\nfeaturing far less points than the number of functions to integrate.\n  The CECM consists on a two-stage strategy. First, a point selection strategy\nis applied for obtaining an initial approximation to the cubature rule,\nfeaturing as many points as functions to integrate. The second stage consists\nin a sparsification strategy in which, alongside the indexes and corresponding\nweights, the spatial coordinates of the points are also considered as design\nvariables. The positions of the initially selected points are changed to render\ntheir associated weights to zero, and in this way, the minimum number of points\nis achieved.\n  Although originally conceived within the framework of hyper-reduced order\nmodels (HROMs), we present the method's formulation in terms of generic\nvector-valued functions, thereby accentuating its versatility across various\nproblem domains. To demonstrate the extensive applicability of the method, we\nconduct numerical validations using univariate and multivariate Lagrange\npolynomials. In these cases, we show the method's capacity to retrieve the\noptimal Gaussian rule. We also asses the method for an arbitrary\nexponential-sinusoidal function in a 3D domain, and finally consider an example\nof the application of the method to the hyperreduction of a multiscale finite\nelement model, showcasing notable computational performance gains.\n  A secondary contribution of the current paper is the Sequential Randomized\nSVD (SRSVD) approach for computing the Singular Value Decomposition (SVD) in a\ncolumn-partitioned format. The SRSVD is particularly advantageous when matrix\nsizes approach memory limitations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:14:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hernandez","J. A.",""],["Bravo","J. R.",""],["de Parga","S. Ares",""]]}
{"id":"2308.03878","submitter":"Xiaojun Yao","authors":"Kyle Lee, James Mulligan, Felix Ringer and Xiaojun Yao","title":"Liouvillian Dynamics of the Open Schwinger Model: String Breaking and\n  Kinetic Dissipation in a Thermal Medium","comments":"23 pages, 16 figures","journal-ref":null,"doi":null,"report-no":"JLAB-THY-23-3894, MIT-CTP-5592, YITP-SB-2023-23, IQuS@UW-21-061","categories":"quant-ph hep-lat hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the dynamics of bound state formation is one of the fundamental\nquestions in confining quantum field theories such as Quantum Chromodynamics\n(QCD). One hadronization mechanism that has garnered significant attention is\nthe breaking of a string initially connecting a fermion and an anti-fermion.\nDeepening our understanding of real-time string-breaking dynamics with simpler,\nlower dimensional models like the Schwinger model can improve our understanding\nof the hadronization process in QCD and other confining systems found in\ncondensed matter and statistical systems. In this paper, we consider the\nstring-breaking dynamics within the Schwinger model and investigate its\nmodification inside a thermal medium, treating the Schwinger model as an open\nquantum system coupled to a thermal environment. Within the regime of weak\ncoupling between the system and environment, the real-time evolution of the\nsystem can be described by a Lindblad evolution equation. We analyze the\nLiouvillian gaps of this Lindblad equation and the time dependence of the\nsystem's von Neumann entropy. We observe that the late-time relaxation rate\ndecreases as the environment correlation length increases. Moreover, when the\nenvironment correlation length is infinite, the system exhibits two steady\nstates, one in each of the sectors with definite charge-conjugation-parity (CP)\nquantum numbers. For parameter regimes where an initial string breaks in\nvacuum, we observe a delay of the string breaking in the medium, due to kinetic\ndissipation effects. Conversely, in regimes where an initial string remains\nintact in vacuum time evolution, we observe string breaking (melting) in the\nthermal medium. We further discuss how the Liouvillian dynamics of the open\nSchwinger model can be simulated on quantum computers and provide an estimate\nof the associated Trotter errors.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:15:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lee","Kyle",""],["Mulligan","James",""],["Ringer","Felix",""],["Yao","Xiaojun",""]]}
{"id":"2308.03879","submitter":"Adam Siegel","authors":"Adam Siegel, Kosuke Mitarai and Keisuke Fujii","title":"Algorithmic error mitigation for quantum eigenvalues estimation","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When estimating the eigenvalues of a given observable, even fault-tolerant\nquantum computers will be subject to errors, namely algorithmic errors. These\nstem from approximations in the algorithms implementing the unitary passed to\nphase estimation to extract the eigenvalues, e.g. Trotterisation or\nqubitisation. These errors can be tamed by increasing the circuit complexity,\nwhich may be unfeasible in early-stage fault-tolerant devices. Rather, we\npropose in this work an error mitigation strategy that enables a reduction of\nthe algorithmic errors up to any order, at the cost of evaluating the\neigenvalues of a set of observables implementable with limited resources. The\nnumber of required observables is estimated and is shown to only grow\npolynomially with the number of terms in the Hamiltonian, and in some cases,\nlinearly with the desired order of error mitigation. Our results show error\nreduction of several orders of magnitude in physically relevant cases, thus\npromise accurate eigenvalue estimation even in early fault-tolerant devices\nwith limited number of qubits.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:16:54 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Siegel","Adam",""],["Mitarai","Kosuke",""],["Fujii","Keisuke",""]]}
{"id":"2308.03880","submitter":"Juanita Puentes","authors":"Juanita Puentes, Angela Castillo, Wilmar Osejo, Yuly Calder\\'on,\n  Viviana Quintero, Lina Saldarriaga, Diana Agudelo and Pablo Arbel\\'aez","title":"Guarding the Guardians: Automated Analysis of Online Child Sexual Abuse","comments":"Artificial Intelligence (AI) and Humanitarian Assistance and Disaster\n  Recovery (HADR) workshop, ICCV 2023 in Paris, France","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Online violence against children has increased globally recently, demanding\nurgent attention. Competent authorities manually analyze abuse complaints to\ncomprehend crime dynamics and identify patterns. However, the manual analysis\nof these complaints presents a challenge because it exposes analysts to harmful\ncontent during the review process. Given these challenges, we present a novel\nsolution, an automated tool designed to analyze children's sexual abuse reports\ncomprehensively. By automating the analysis process, our tool significantly\nreduces the risk of exposure to harmful content by categorizing the reports on\nthree dimensions: Subject, Degree of Criminality, and Damage. Furthermore,\nleveraging our multidisciplinary team's expertise, we introduce a novel\napproach to annotate the collected data, enabling a more in-depth analysis of\nthe reports. This approach improves the comprehension of fundamental patterns\nand trends, enabling law enforcement agencies and policymakers to create\nfocused strategies in the fight against children's violence.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:19:02 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 17:37:27 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Puentes","Juanita",""],["Castillo","Angela",""],["Osejo","Wilmar",""],["Calder\u00f3n","Yuly",""],["Quintero","Viviana",""],["Saldarriaga","Lina",""],["Agudelo","Diana",""],["Arbel\u00e1ez","Pablo",""]]}
{"id":"2308.03881","submitter":"Jibin Joseph","authors":"Jibin Joseph, Alexandros Ziampras, Lucas Jordan, George A. Turpin and\n  Richard P. Nelson","title":"Measuring the Numerical Viscosity in Simulations of Protoplanetary Disks\n  in Cartesian Grids -- The Viscously Spreading Ring Revisited","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrodynamical simulations solve the governing equations on a discrete grid\nof space and time. This discretization causes numerical diffusion similar to a\nphysical viscous diffusion, whose magnitude is often unknown or poorly\nconstrained. With the current trend of simulating accretion disks with no or\nvery low prescribed physical viscosity, it becomes essential to understand and\nquantify this inherent numerical diffusion, in the form of a numerical\nviscosity. We study the behavior of the viscous spreading ring and the spiral\ninstability that develops in it. We then use this setup to quantify the\nnumerical viscosity in Cartesian grids and study its properties. We simulate\nthe viscous spreading ring and the related instability on a two-dimensional\npolar grid using PLUTO as well as FARGO, and ensure convergence of our results\nwith a resolution study. We then repeat our models on a Cartesian grid and\nmeasure the numerical viscosity by comparing results to the known analytical\nsolution, using PLUTO and Athena++. We find that the numerical viscosity in a\nCartesian grid scales with resolution as approximately $\\nu_{num}\\propto\\Delta\nx^2$ and is equivalent to an effective $\\alpha\\sim10^{-4}$ for a common\nnumerical setup. We also show that the spiral instability manifests as a single\nleading spiral throughout the whole domain on polar grids. This is contrary to\nprevious results and indicates that sufficient resolution is necessary in order\nto correctly resolve the instability. Our results are relevant in the context\nof models where the origin should be included in the computational domain, or\nwhen polar grids cannot be used. Examples of such cases include models of disk\naccretion onto a central binary and inherently Cartesian codes.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:19:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Joseph","Jibin",""],["Ziampras","Alexandros",""],["Jordan","Lucas",""],["Turpin","George A.",""],["Nelson","Richard P.",""]]}
{"id":"2308.03882","submitter":"Nirbhay Modhe","authors":"Nirbhay Modhe, Qiaozi Gao, Ashwin Kalyan, Dhruv Batra, Govind Thattai,\n  Gaurav Sukhatme","title":"Exploiting Generalization in Offline Reinforcement Learning via Unseen\n  State Augmentations","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":"  Offline reinforcement learning (RL) methods strike a balance between\nexploration and exploitation by conservative value estimation -- penalizing\nvalues of unseen states and actions. Model-free methods penalize values at all\nunseen actions, while model-based methods are able to further exploit unseen\nstates via model rollouts. However, such methods are handicapped in their\nability to find unseen states far away from the available offline data due to\ntwo factors -- (a) very short rollout horizons in models due to cascading model\nerrors, and (b) model rollouts originating solely from states observed in\noffline data. We relax the second assumption and present a novel unseen state\naugmentation strategy to allow exploitation of unseen states where the learned\nmodel and value estimates generalize. Our strategy finds unseen states by\nvalue-informed perturbations of seen states followed by filtering out states\nwith epistemic uncertainty estimates too high (high error) or too low (too\nsimilar to seen data). We observe improved performance in several offline RL\ntasks and find that our augmentation strategy consistently leads to overall\nlower average dataset Q-value estimates i.e. more conservative Q-value\nestimates than a baseline.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:24:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Modhe","Nirbhay",""],["Gao","Qiaozi",""],["Kalyan","Ashwin",""],["Batra","Dhruv",""],["Thattai","Govind",""],["Sukhatme","Gaurav",""]]}
{"id":"2308.03883","submitter":"Koyena Pal","authors":"Koyena Pal, Aamod Khatiwada, Roee Shraga, Ren\\'ee J. Miller","title":"Generative Benchmark Creation for Table Union Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data management has traditionally relied on synthetic data generators to\ngenerate structured benchmarks, like the TPC suite, where we can control\nimportant parameters like data size and its distribution precisely. These\nbenchmarks were central to the success and adoption of database management\nsystems. But more and more, data management problems are of a semantic nature.\nAn important example is finding tables that can be unioned. While any two\ntables with the same cardinality can be unioned, table union search is the\nproblem of finding tables whose union is semantically coherent. Semantic\nproblems cannot be benchmarked using synthetic data. Our current methods for\ncreating benchmarks involve the manual curation and labeling of real data.\nThese methods are not robust or scalable and perhaps more importantly, it is\nnot clear how robust the created benchmarks are. We propose to use generative\nAI models to create structured data benchmarks for table union search. We\npresent a novel method for using generative models to create tables with\nspecified properties. Using this method, we create a new benchmark containing\npairs of tables that are both unionable and non-unionable but related. We\nthoroughly evaluate recent existing table union search methods over existing\nbenchmarks and our new benchmark. We also present and evaluate a new table\nsearch methods based on recent large language models over all benchmarks. We\nshow that the new benchmark is more challenging for all methods than\nhand-curated benchmarks, specifically, the top-performing method achieves a\nMean Average Precision of around 60%, over 30% less than its performance on\nexisting manually created benchmarks. We examine why this is the case and show\nthat the new benchmark permits more detailed analysis of methods, including a\nstudy of both false positives and false negatives that were not possible with\nexisting benchmarks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:26:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pal","Koyena",""],["Khatiwada","Aamod",""],["Shraga","Roee",""],["Miller","Ren\u00e9e J.",""]]}
{"id":"2308.03884","submitter":"Elena Zappon","authors":"Elena Zappon, Andrea Manzoni, Alfio Quarteroni","title":"A staggered-in-time and non-conforming-in-space numerical framework for\n  realistic cardiac electrophysiology outputs","comments":"26 pages,11 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computer-based simulations of non-invasive cardiac electrical outputs, such\nas electrocardiograms and body surface potential maps, usually entail severe\ncomputational costs due to the need of capturing fine-scale processes and to\nthe complexity of the heart-torso morphology. In this work, we model cardiac\nelectrical outputs by employing a coupled model consisting of a\nreaction-diffusion model - either the bidomain model or the most efficient\npseudo-bidomain model - on the heart, and an elliptic model in the torso. We\nthen solve the coupled problem with a segregated and staggered in-time\nnumerical scheme, that allows for independent and infrequent solution in the\ntorso region. To further reduce the computational load, main novelty of this\nwork is in introduction of an interpolation method at the interface between the\nheart and torso domains, enabling the use of non-conforming meshes, and the\nnumerical framework application to realistic cardiac and torso geometries. The\nreliability and efficiency of the proposed scheme is tested against the\ncorresponding state-of-the-art bidomain-torso model. Furthermore, we explore\nthe impact of torso spatial discretization and geometrical non-conformity on\nthe model solution and the corresponding clinical outputs. The investigation of\nthe interface interpolation method provides insights into the influence of\ntorso spatial discretization and of the geometrical non-conformity on the\nsimulation results and their clinical relevance.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:27:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zappon","Elena",""],["Manzoni","Andrea",""],["Quarteroni","Alfio",""]]}
{"id":"2308.03885","submitter":"Ido Nahshon","authors":"Ido Nahshon, Amir Shpilka","title":"New Bounds on Quotient Polynomials with Applications to Exact\n  Divisibility and Divisibility Testing of Sparse Polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SC cs.CC math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A sparse polynomial (also called a lacunary polynomial) is a polynomial that\nhas relatively few terms compared to its degree. The sparse-representation of a\npolynomial represents the polynomial as a list of its non-zero terms\n(coefficient-degree pairs). In particular, the degree of a sparse polynomial\ncan be exponential in the sparse-representation size.\n  We prove that for monic polynomials $f, g \\in \\mathbb{C}[x]$ such that $g$\ndivides $f$, the $\\ell_2$-norm of the quotient polynomial $f/g$ is bounded by\n$\\lVert f \\rVert_1 \\cdot \\tilde{O}(\\lVert{g}\\rVert_0^3\\text{deg}^2{\nf})^{\\lVert{g}\\rVert_0 - 1}$. This improves upon the exponential (in\n$\\text{deg}{ f}$) bounds for general polynomials and implies that the trivial\nlong division algorithm runs in time quasi-linear in the input size and number\nof terms of the quotient polynomial $f/g$, thus solving a long-standing problem\non exact divisibility of sparse polynomials.\n  We also study the problem of bounding the number of terms of $f/g$ in some\nspecial cases. When $f, g \\in \\mathbb{Z}[x]$ and $g$ is a cyclotomic-free\n(i.e., it has no cyclotomic factors) trinomial, we prove that\n$\\lVert{f/g}\\rVert_0 \\leq O(\\lVert{f}\\rVert_0 \\text{size}({f})^2 \\cdot\n\\log^6{\\text{deg}{ g}})$. When $g$ is a binomial with $g(\\pm 1) \\neq 0$, we\nprove that the sparsity is at most $O(\\lVert{f}\\rVert_0 (\n\\log{\\lVert{f}\\rVert_0} + \\log{\\lVert{f}\\rVert_{\\infty}}))$. Both upper bounds\nare polynomial in the input-size. We leverage these results and give a\npolynomial time algorithm for deciding whether a cyclotomic-free trinomial\ndivides a sparse polynomial over the integers.\n  As our last result, we present a polynomial time algorithm for testing\ndivisibility by pentanomials over small finite fields when $\\text{deg}{ f} =\n\\tilde{O}(\\text{deg}{ g})$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:33:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nahshon","Ido",""],["Shpilka","Amir",""]]}
{"id":"2308.03886","submitter":"Luke Dones","authors":"Ma{\\l}gorzata Kr\\'olikowska and Luke Dones","title":"Oort Cloud Comets Discovered Far from the Sun","comments":"22 pages, 11 tables, 10 figures. Astronomy & Astrophysics, in press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context: Increasingly, Oort Cloud comets are being discovered at great\ndistances from the Sun and tracked over ever wider ranges of heliocentric\ndistances as observational equipment improves. Aims: To investigate in detail\nhow the original semimajor axis for near-parabolic comets depends on the\nselected data arc and the assumed form of the non-gravitational (NG)\nacceleration. Methods: Among currently known Oort Cloud comets with large\nperihelion distances ($q > 3$ au), we selected 32 objects observed over the\nwidest ranges of heliocentric distances in orbital legs before and after\nperihelion. For each of them, we determined a series of orbits using at least\nthree basic types of data sets selected from available positional data (pre-\nand post-perihelion data and the entire data set), and a few forms of NG\nacceleration representing water ice or CO sublimation. Results: We found that\nthe motion of comets is often measurably affected by NG forces at heliocentric\ndistances beyond 5 au from the Sun. The most spectacular example is C/2010 U3\n(Boattini), whose perihelion distance is 8.44 au. NG effects are detectable for\n19 of the 32 comets within the positional data. For five comets, we found\nasymmetric effects of NG forces - in three cases significantly greater before\nperihelion than afterward (C/2017 M4, C/2000 SV$_{75}$, and C/2015 O1), and in\ntwo others the opposite (C/1997 BA$_6$ and C/2006 S3). We also find that the\nwell-known systematic effect of finding more tightly bound original orbits when\nincluding the NG acceleration than in purely gravitational solutions may be\nrelated to the specific form of the standard $g(r)$ function describing the\nsublimation of ices.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:33:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kr\u00f3likowska","Ma\u0142gorzata",""],["Dones","Luke",""]]}
{"id":"2308.03887","submitter":"Andr\\'as Horv\\'ath","authors":"Gergely Szab\\'o, Paolo Bonaiuti, Andrea Ciliberto, Andr\\'as Horv\\'ath","title":"Enhancing Cell Tracking with a Time-Symmetric Deep Learning Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accurate tracking of live cells using video microscopy recordings remains\na challenging task for popular state-of-the-art image processing based object\ntracking methods. In recent years, several existing and new applications have\nattempted to integrate deep-learning based frameworks for this task, but most\nof them still heavily rely on consecutive frame based tracking embedded in\ntheir architecture or other premises that hinder generalized learning. To\naddress this issue, we aimed to develop a new deep-learning based tracking\nmethod that relies solely on the assumption that cells can be tracked based on\ntheir spatio-temporal neighborhood, without restricting it to consecutive\nframes. The proposed method has the additional benefit that the motion patterns\nof the cells can be learned completely by the predictor without any prior\nassumptions, and it has the potential to handle a large number of video frames\nwith heavy artifacts. The efficacy of the proposed method is demonstrated\nthrough multiple biologically motivated validation strategies and compared\nagainst several state-of-the-art cell tracking methods.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:57:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Szab\u00f3","Gergely",""],["Bonaiuti","Paolo",""],["Ciliberto","Andrea",""],["Horv\u00e1th","Andr\u00e1s",""]]}
{"id":"2308.03888","submitter":"Fan  Zhang","authors":"Fan Zhang","title":"Deep neural networks from the perspective of ergodic theory","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The design of deep neural networks remains somewhat of an art rather than\nprecise science. By tentatively adopting ergodic theory considerations on top\nof viewing the network as the time evolution of a dynamical system, with each\nlayer corresponding to a temporal instance, we show that some rules of thumb,\nwhich might otherwise appear mysterious, can be attributed heuristics.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 10:55:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Fan",""]]}
{"id":"2308.03889","submitter":"Gyivan Lopez-Campos","authors":"Gyivan Lopez-Campos, Deborah Oliveros and Jorge L. Ram\\'irez\n  Alfons\\'in","title":"Borsuk and V\\'azsonyi problems through Reuleaux polyhedra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Borsuk conjecture and the V\\'azsonyi problem are two attractive and\nfamous questions in discrete and combinatorial geometry, both based on the\nnotion of diameter of a bounded sets. In this paper, we present an equivalence\nbetween the critical sets with Borsuk number 4 in $\\mathbb{R}^3$ and the\nminimal structures for the V\\'azsonyi problem by using the well-known Reuleaux\npolyhedra. The latter lead to a full characterization of all finite sets in\n$\\mathbb{R}^3$ with Borsuk number 4.\n  The proof of such equivalence needs various ingredients, in particular, we\nproved a conjecture dealing with strongly critical configuration for the\nV\\'azsonyi problem and showed that the diameter graph arising from involutive\npolyhedra is vertex (and edge) 4-critical.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:40:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lopez-Campos","Gyivan",""],["Oliveros","Deborah",""],["Alfons\u00edn","Jorge L. Ram\u00edrez",""]]}
{"id":"2308.03890","submitter":"Jacob Miller","authors":"Jacob Miller and Mohammad Ghoniem and Hsiang-Yun Wu and Helen C.\n  Purchase","title":"On the Perception of Small Sub-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":"  Interpreting a node-link graph is enhanced if similar subgraphs (or motifs)\nare depicted in a similar manner; that is, they have the same visual form.\nSmall motifs within graphs may be perceived to be identical when they are\nstructurally dissimilar, or may be perceived to be dissimilar when they are\nidentical. This issue primarily relates to the Gestalt principle of similarity,\nbut may also include an element of quick, low-level pattern-matching. We\nbelieve that if motifs are identical, they should be depicted identically; if\nthey are nearly-identical, they should be depicted nearly-identically. This\nprinciple is particularly important in domains where motifs hold meaning and\nwhere their identification is important. We identified five small motifs:\nbi-cliques, cliques, cycles, double-cycles, and stars. For each, we defined\nvisual variations on two dimensions: same or different structure, same or\ndifferent shape. We conducted a crowd-sourced empirical study to test the\nperception of similarity of these varied motifs, and found that determining\nwhether motifs are identical or similar is affected by both shape and\nstructure.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:47:20 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 21:54:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Miller","Jacob",""],["Ghoniem","Mohammad",""],["Wu","Hsiang-Yun",""],["Purchase","Helen C.",""]]}
{"id":"2308.03891","submitter":"Anik Saha","authors":"Anik Saha, Oktie Hassanzadeh, Alex Gittens, Jian Ni, Kavitha Srinivas,\n  Bulent Yener","title":"A Cross-Domain Evaluation of Approaches for Causal Knowledge Extraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Causal knowledge extraction is the task of extracting relevant causes and\neffects from text by detecting the causal relation. Although this task is\nimportant for language understanding and knowledge discovery, recent works in\nthis domain have largely focused on binary classification of a text segment as\ncausal or non-causal. In this regard, we perform a thorough analysis of three\nsequence tagging models for causal knowledge extraction and compare it with a\nspan based approach to causality extraction. Our experiments show that\nembeddings from pre-trained language models (e.g. BERT) provide a significant\nperformance boost on this task compared to previous state-of-the-art models\nwith complex architectures. We observe that span based models perform better\nthan simple sequence tagging models based on BERT across all 4 data sets from\ndiverse domains with different types of cause-effect phrases.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:50:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Saha","Anik",""],["Hassanzadeh","Oktie",""],["Gittens","Alex",""],["Ni","Jian",""],["Srinivas","Kavitha",""],["Yener","Bulent",""]]}
{"id":"2308.03892","submitter":"Anup Shakya","authors":"Anup Shakya, Vasile Rus, Deepak Venugopal","title":"Scalable and Equitable Math Problem Solving Strategy Prediction in Big\n  Educational Data","comments":"12 pages, 7 figures Published as a full paper in the 16th\n  International Conference on Educational Data Mining 2023","journal-ref":null,"doi":"10.5281/zenodo.8115669","report-no":null,"categories":"cs.LG cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding a student's problem-solving strategy can have a significant\nimpact on effective math learning using Intelligent Tutoring Systems (ITSs) and\nAdaptive Instructional Systems (AISs). For instance, the ITS/AIS can better\npersonalize itself to correct specific misconceptions that are indicated by\nincorrect strategies, specific problems can be designed to improve strategies\nand frustration can be minimized by adapting to a student's natural way of\nthinking rather than trying to fit a standard strategy for all. While it may be\npossible for human experts to identify strategies manually in classroom\nsettings with sufficient student interaction, it is not possible to scale this\nup to big data. Therefore, we leverage advances in Machine Learning and AI\nmethods to perform scalable strategy prediction that is also fair to students\nat all skill levels. Specifically, we develop an embedding called MVec where we\nlearn a representation based on the mastery of students. We then cluster these\nembeddings with a non-parametric clustering method where we progressively learn\nclusters such that we group together instances that have approximately\nsymmetrical strategies. The strategy prediction model is trained on instances\nsampled from these clusters. This ensures that we train the model over diverse\nstrategies and also that strategies from a particular group do not bias the DNN\nmodel, thus allowing it to optimize its parameters over all groups. Using real\nworld large-scale student interaction datasets from MATHia, we implement our\napproach using transformers and Node2Vec for learning the mastery embeddings\nand LSTMs for predicting strategies. We show that our approach can scale up to\nachieve high accuracy by training on a small sample of a large dataset and also\nhas predictive equality, i.e., it can predict strategies equally well for\nlearners at diverse skill levels.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:51:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shakya","Anup",""],["Rus","Vasile",""],["Venugopal","Deepak",""]]}
{"id":"2308.03893","submitter":"Dallin Nielsen","authors":"Dallin O. Nielsen, Chris G. Van de Walle, Sokrates T. Pantelides,\n  Ronald D. Schrimpf, Daniel M. Fleetwood, and Massimo V. Fischetti","title":"A first-principles approach to closing the \"10-100 eV gap\" for\n  charge-carrier thermalization in semiconductors","comments":"23 pages, 20 figures. This LaTex file uses RevTex4.2 from APS","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":"  The present work is concerned with studying accurately the energy-loss\nprocesses that control the thermalization of hot electrons and holes that are\ngenerated by high-energy radiation in wurtzite GaN, using an ab initio\napproach. Current physical models of the nuclear/particle physics community\ncover thermalization in the high-energy range (kinetic energies exceeding ~100\neV), and the electronic-device community has studied extensively carrier\ntransport in the low-energy range (below ~10 eV). However, the processes that\ncontrol the energy losses and thermalization of electrons and holes in the\nintermediate energy range of about 10-100 eV (the \"10-100 eV gap\") are poorly\nknown. The aim of this research is to close this gap, by utilizing density\nfunctional theory (DFT) to obtain the band structure and dielectric function of\nGaN for energies up to about 100 eV. We also calculate charge-carrier\nscattering rates for the major charge-carrier interactions (phonon scattering,\nimpact ionization, and plasmon emission), using the DFT results and first-order\nperturbation theory. With this information, we study the thermalization of\nelectrons starting at 100 eV using the Monte Carlo method to solve the\nsemiclassical Boltzmann transport equation. Full thermalization of electrons\nand holes is complete within ~1 and 0.5 ps, respectively. Hot electrons\ndissipate about 90% of their initial kinetic energy to the electron-hole gas\n(90 eV) during the first ~0.1 fs, due to rapid plasmon emission and impact\nionization at high energies. The remaining energy is lost more slowly as phonon\nemission dominates at lower energies (below ~10 eV). During the thermalization,\nhot electrons generate pairs with an average energy of ~8.9 eV/pair (11-12\npairs per hot electron). Additionally, during the thermalization, the maximum\nelectron displacement from its original position is found to be on the order of\n100 nm.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 19:59:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nielsen","Dallin O.",""],["Van de Walle","Chris G.",""],["Pantelides","Sokrates T.",""],["Schrimpf","Ronald D.",""],["Fleetwood","Daniel M.",""],["Fischetti","Massimo V.",""]]}
{"id":"2308.03894","submitter":"Zolt\\'an Botta-Duk\\'at","authors":"Zolt\\'an Botta-Duk\\'at","title":"A new approach for evaluating internal cluster validation indices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A vast number of different methods are available for unsupervised\nclassification. Since no algorithm and parameter setting performs best in all\ntypes of data, there is a need for cluster validation to select the actually\nbest-performing algorithm. Several indices were proposed for this purpose\nwithout using any additional (external) information. These internal validation\nindices can be evaluated by applying them to classifications of datasets with a\nknown cluster structure. Evaluation approaches differ in how they use the\ninformation on the ground-truth classification. This paper reviews these\napproaches, considering their advantages and disadvantages, and then suggests a\nnew approach.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:55:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Botta-Duk\u00e1t","Zolt\u00e1n",""]]}
{"id":"2308.03895","submitter":"Bing Cheng","authors":"Bing Cheng, Di Cheng, Tao Jiang, Wei Xia, Boqun Song, Martin Mootz,\n  Liang Luo, Ilias E. Perakis, Yongxin Yao, Yanfeng Guo, and Jigang Wang","title":"Chirality manipulation of ultrafast phase switchings in a correlated\n  CDW-Weyl semimetal","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A recently emerging concept for quantum phase discovery is the controlled\ngapping of linear band crossings in topological semimetals. For example,\nachieving topological superconducting and charge-density-wave (CDW) gapping\ncould introduce Majorana zero modes and axion electrodynamics, respectively.\nLight engineering of correlation gaps in topological materials provides a new\navenue of achieving exotic topological phases inaccessible by conventional\ntuning methods such as doping and straining. Here we demonstrate a light\ncontrol of correlation gaps and ultrafast phase switchings in a model CDW and\npolaron insulator (TaSe$_4$)$_2$I recently predicted to be an axion insulator.\nOur ultrafast terahertz photocurrent spectroscopy reveals a two-step,\nnon-thermal melting of polarons and electronic CDW gap via studying the fluence\ndependence of a {\\em longitudinal} circular photogalvanic current. The\nhelicity-dependent photocurrent observed along the propagation of light reveals\ncontinuous ultrafast switchings from the polaronic state, to the CDW (axion)\nphase, and finally to a hidden Weyl phase as the pump fluence increases. Other\ndistinguishing features corroborating with the light-induced switchings\ninclude: mode-selective coupling of coherent phonons to polaron and CDW\nmodulation, and the emergence of a {\\em non-thermal} chiral photocurrent above\npump threshold of CDW-related phonons. The ultrafast chirality control of\ncorrelated topological states revealed here is important to realize axion\nelectrodynamics and quantum computing.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:01:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cheng","Bing",""],["Cheng","Di",""],["Jiang","Tao",""],["Xia","Wei",""],["Song","Boqun",""],["Mootz","Martin",""],["Luo","Liang",""],["Perakis","Ilias E.",""],["Yao","Yongxin",""],["Guo","Yanfeng",""],["Wang","Jigang",""]]}
{"id":"2308.03896","submitter":"Eleftheria Papadopoulou","authors":"Eleftheria Papadopoulou, Charlene Vance, Paloma S. Rozene Vallespin,\n  Panagiotis Tsapekos, Irini Angelidaki","title":"Saccharina latissima, candy-factory waste, and digestate from full-scale\n  biogas plant as alternative carbohydrate and nutrient sources for lactic acid\n  production","comments":"25 pages, 6 figures","journal-ref":"Bioresource Technology, Volume 380, 2023","doi":"10.1016/j.biortech.2023.129078","report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To substitute petroleum-based materials with bio-based alternatives,\nmicrobial fermentation combined with inexpensive biomass is suggested. In this\nstudy Saccharina latissima hydrolysate, candy-factory waste, and digestate from\nfull-scale biogas plant were explored as substrates for lactic acid production.\nThe lactic acid bacteria Enterococcus faecium, Lactobacillus plantarum, and\nPediococcus pentosaceus were tested as starter cultures. Sugars released from\nseaweed hydrolysate and candy-waste were successfully utilized by the studied\nbacterial strains. Additionally, seaweed hydrolysate and digestate served as\nnutrient supplements supporting microbial fermentation. According to the\nhighest achieved relative lactic acid production, a scaled-up co-fermentation\nof candy-waste and digestate was performed. Lactic acid reached a concentration\nof 65.65 g/L, with 61.69% relative lactic acid production, and 1.37 g/L/hour\nproductivity. The findings indicate that lactic acid can be successfully\nproduced from low-cost industrial residues.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:13:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Papadopoulou","Eleftheria",""],["Vance","Charlene",""],["Vallespin","Paloma S. Rozene",""],["Tsapekos","Panagiotis",""],["Angelidaki","Irini",""]]}
{"id":"2308.03897","submitter":"Theodoros Trochatos","authors":"Theodoros Trochatos, Chuanqi Xu, Sanjay Deshpande, Yao Lu, Yongshan\n  Ding, Jakub Szefer","title":"Hardware Architecture for a Quantum Computer Trusted Execution\n  Environment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The cloud-based environments in which today's and future quantum computers\nwill operate, raise concerns about the security and privacy of user's\nintellectual property. Quantum circuits submitted to cloud-based quantum\ncomputer providers represent sensitive or proprietary algorithms developed by\nusers that need protection. Further, input data is hard-coded into the\ncircuits, and leakage of the circuits can expose users' data. To help protect\nusers' circuits and data from possibly malicious quantum computer cloud\nproviders, this work presented the first hardware architecture for a trusted\nexecution environment for quantum computers. To protect the user's circuits and\ndata, the quantum computer control pulses are obfuscated with decoy control\npulses. While digital data can be encrypted, analog control pulses cannot and\nthis paper proposed the novel decoy pulse approach to obfuscate the analog\ncontrol pulses. The proposed decoy pulses can easily be added to the software\nby users. Meanwhile, the hardware components of the architecture proposed in\nthis paper take care of eliminating, i.e. attenuating, the decoy pulses inside\nthe superconducting quantum computer's dilution refrigerator before they reach\nthe qubits. The hardware architecture also contains tamper-resistant features\nto protect the trusted hardware and users' information. The work leverages a\nnew metric of variational distance to analyze the impact and scalability of\nhardware protection. The variational distance of the circuits protected with\nour scheme, compared to unprotected circuits, is in the range of only $0.16$ to\n$0.26$. This work demonstrates that protection from possibly malicious cloud\nproviders is feasible and all the hardware components needed for the proposed\narchitecture are available today.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:18:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Trochatos","Theodoros",""],["Xu","Chuanqi",""],["Deshpande","Sanjay",""],["Lu","Yao",""],["Ding","Yongshan",""],["Szefer","Jakub",""]]}
{"id":"2308.03898","submitter":"Burak M Gonultas","authors":"Burak M. Gonultas, Pratik Mukherjee, O. Goktug Poyrazoglu and Volkan\n  Isler","title":"System Identification and Control of Front-Steered Ackermann Vehicles\n  through Differentiable Physics","comments":"Accepted for IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we address the problem of system identification and control of\na front-steered vehicle which abides by the Ackermann geometry constraints.\nThis problem arises naturally for on-road and off-road vehicles that require\nreliable system identification and basic feedback controllers for various\napplications such as lane keeping and way-point navigation. Traditional system\nidentification requires expensive equipment and is time consuming. In this work\nwe explore the use of differentiable physics for system identification and\ncontroller design and make the following contributions: i)We develop a\ndifferentiable physics simulator (DPS) to provide a method for the system\nidentification of front-steered class of vehicles whose system parameters are\nlearned using a gradient-based method; ii) We provide results for our\ngradient-based method that exhibit better sample efficiency in comparison to\nother gradient-free methods; iii) We validate the learned system parameters by\nimplementing a feedback controller to demonstrate stable lane keeping\nperformance on a real front-steered vehicle, the F1TENTH; iv) Further, we\nprovide results exhibiting comparable lane keeping behavior for system\nparameters learned using our gradient-based method with lane keeping behavior\nof the actual system parameters of the F1TENTH.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:19:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gonultas","Burak M.",""],["Mukherjee","Pratik",""],["Poyrazoglu","O. Goktug",""],["Isler","Volkan",""]]}
{"id":"2308.03899","submitter":"Valeri Kotov","authors":"Mohamed M. Elsayed, Sang Wook Kim, Juan M. Vanegas, Valeri N. Kotov","title":"Polarization Charge around Impurities in Two-Dimensional Anisotropic\n  Dirac Systems","comments":"12 pages, 10 figures; discussion and figure added","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Introducing quasiparticle anisotropy in graphene via uniaxial strain has a\nprofound effect on the polarization charge density induced by external\nimpurities, both Coulomb and short-range. In particular the charge distribution\ninduced by a Coulomb impurity exhibits a power law tail modulated by a\nstrain-dependent admixture of angular harmonics. The appearance of distributed\ncharge is in sharp contrast to the response in pristine/isotropic graphene,\nwhere for subcritical impurities the polarization charge is fully localized at\nthe impurity position. It is also interesting to note that our results are\nobtained strictly at zero chemical potential, and the behavior is fundamentally\ndistinct from the typical Friedel oscillations observed at finite chemical\npotential. For weak to moderate strain, the $d$-wave symmetry is dominant. The\npresence of Dirac cone tilt, relevant to some 2D materials beyond graphene, can\nalso substantially affect the induced charge distribution. Finally we consider\nimpurities with short range potentials, and study the effect of strain on the\ncharge response. Our results were obtained in the continuum via perturbation\ntheory valid for weak (subcritical) potentials, and supported by numerical\nlattice simulations based on density functional theory.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:23:19 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 02:03:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Elsayed","Mohamed M.",""],["Kim","Sang Wook",""],["Vanegas","Juan M.",""],["Kotov","Valeri N.",""]]}
{"id":"2308.03900","submitter":"Pratheba Selvaraju","authors":"Pratheba Selvaraju","title":"Developability Approximation for Neural Implicits through Rank\n  Minimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Developability refers to the process of creating a surface without any\ntearing or shearing from a two-dimensional plane. It finds practical\napplications in the fabrication industry. An essential characteristic of a\ndevelopable 3D surface is its zero Gaussian curvature, which means that either\none or both of the principal curvatures are zero. This paper introduces a\nmethod for reconstructing an approximate developable surface from a neural\nimplicit surface. The central idea of our method involves incorporating a\nregularization term that operates on the second-order derivatives of the neural\nimplicits, effectively promoting zero Gaussian curvature. Implicit surfaces\noffer the advantage of smoother deformation with infinite resolution,\novercoming the high polygonal constraints of state-of-the-art methods using\ndiscrete representations. We draw inspiration from the properties of surface\ncurvature and employ rank minimization techniques derived from compressed\nsensing. Experimental results on both developable and non-developable surfaces,\nincluding those affected by noise, validate the generalizability of our method.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:23:39 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 15:37:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Selvaraju","Pratheba",""]]}
{"id":"2308.03901","submitter":"Rahul Atul Bhope","authors":"Rahul Atul Bhope, K. R. Jayaram, Nalini Venkatasubramanian, Ashish\n  Verma, Gegi Thomas","title":"FLIPS: Federated Learning using Intelligent Participant Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DC cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents the design and implementation of FLIPS, a middleware\nsystem to manage data and participant heterogeneity in federated learning (FL)\ntraining workloads. In particular, we examine the benefits of label\ndistribution clustering on participant selection in federated learning. FLIPS\nclusters parties involved in an FL training job based on the label distribution\nof their data apriori, and during FL training, ensures that each cluster is\nequitably represented in the participants selected. FLIPS can support the most\ncommon FL algorithms, including FedAvg, FedProx, FedDyn, FedOpt and FedYogi. To\nmanage platform heterogeneity and dynamic resource availability, FLIPS\nincorporates a straggler management mechanism to handle changing capacities in\ndistributed, smart community applications. Privacy of label distributions,\nclustering and participant selection is ensured through a trusted execution\nenvironment (TEE). Our comprehensive empirical evaluation compares FLIPS with\nrandom participant selection, as well as two other \"smart\" selection mechanisms\n- Oort and gradient clustering using two real-world datasets, two different\nnon-IID distributions and three common FL algorithms (FedYogi, FedProx and\nFedAvg). We demonstrate that FLIPS significantly improves convergence,\nachieving higher accuracy by 17 - 20 % with 20 - 60 % lower communication\ncosts, and these benefits endure in the presence of straggler participants.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:28:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bhope","Rahul Atul",""],["Jayaram","K. R.",""],["Venkatasubramanian","Nalini",""],["Verma","Ashish",""],["Thomas","Gegi",""]]}
{"id":"2308.03902","submitter":"Dhawal Buaria","authors":"Dhawal Buaria and Alain Pumir","title":"Role of pressure in generation of intense velocity gradients in\n  turbulent flows","comments":"14 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the role of pressure, via its Hessian tensor $\\mathbf{H}$, on\namplification of vorticity and strain-rate and contrast it with other inviscid\nnonlinear mechanisms. Results are obtained from direct numerical simulations of\nisotropic turbulence with Taylor-scale Reynolds number in the range $140-1300$.\nDecomposing $\\mathbf{H}$ into local isotropic ($\\mathbf{H}^{\\rm I}$) and\nnonlocal deviatoric ($\\mathbf{H}^{\\rm D}$) components reveals that\n$\\mathbf{H}^{\\rm I}$ depletes vortex stretching (VS), whereas $\\mathbf{H}^{\\rm\nD}$ enables it, with the former slightly stronger. The resulting inhibition is\nsignificantly weaker than the nonlinear mechanism which always enables VS.\nHowever, in regions of intense vorticity, identified using conditional\nstatistics, contribution from $\\mathbf{H}$ dominates over nonlinearity, leading\nto overall depletion of VS. We also observe near-perfect alignment between\nvorticity and the eigenvector of $\\mathbf{H}$ corresponding to the smallest\neigenvalue, which conforms with well-known vortex-tubes. We discuss the\nconnection between this depletion, essentially due to (local) $\\mathbf{H}^{\\rm\nI}$, and recently identified self-attenuation mechanism [Buaria et al. {\\em\nNat. Commun.} 11:5852 (2020)], whereby intense vorticity is locally attenuated\nthrough inviscid effects. In contrast, the influence of $\\mathbf{H}$ on\nstrain-amplification is weak. It opposes strain self-amplification, together\nwith VS, but its effect is much weaker than VS. Correspondingly, the\neigenvectors of strain and $\\mathbf{H}$ do not exhibit any strong alignments.\nFor all results, the dependence on Reynolds number is very weak. In addition to\nthe fundamental insights, our work provides useful data and validation\nbenchmarks for future modeling endeavors, for instance in Lagrangian modeling\nof velocity gradient dynamics, where conditional $\\mathbf{H}$ is explicitly\nmodeled.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:31:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Buaria","Dhawal",""],["Pumir","Alain",""]]}
{"id":"2308.03903","submitter":"Dominik Moritz","authors":"Dominik Moritz, Lace M. Padilla, Francis Nguyen, Steven L. Franconeri","title":"Average Estimates in Line Graphs Are Biased Toward Areas of Higher\n  Variability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate variability overweighting, a previously undocumented bias in\nline graphs, where estimates of average value are biased toward areas of higher\nvariability in that line. We found this effect across two preregistered\nexperiments with 140 and 420 participants. These experiments also show that the\nbias is reduced when using a dot encoding of the same series. We can model the\nbias with the average of the data series and the average of the points drawn\nalong the line. This bias might arise because higher variability leads to\nstronger weighting in the average calculation, either due to the longer line\nsegments (even though those segments contain the same number of data values) or\nline segments with higher variability being otherwise more visually salient.\nUnderstanding and predicting this bias is important for visualization design\nguidelines, recommendation systems, and tool builders, as the bias can\nadversely affect estimates of averages and trends.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:35:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Moritz","Dominik",""],["Padilla","Lace M.",""],["Nguyen","Francis",""],["Franconeri","Steven L.",""]]}
{"id":"2308.03904","submitter":"Artem Moskalev","authors":"Artem Moskalev and Anna Sepliarskaia and Erik J. Bekkers and Arnold\n  Smeulders","title":"On genuine invariance learning without weight-tying","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate properties and limitations of invariance\nlearned by neural networks from the data compared to the genuine invariance\nachieved through invariant weight-tying. To do so, we adopt a group theoretical\nperspective and analyze invariance learning in neural networks without\nweight-tying constraints. We demonstrate that even when a network learns to\ncorrectly classify samples on a group orbit, the underlying decision-making in\nsuch a model does not attain genuine invariance. Instead, learned invariance is\nstrongly conditioned on the input data, rendering it unreliable if the input\ndistribution shifts. We next demonstrate how to guide invariance learning\ntoward genuine invariance by regularizing the invariance of a model at the\ntraining. To this end, we propose several metrics to quantify learned\ninvariance: (i) predictive distribution invariance, (ii) logit invariance, and\n(iii) saliency invariance similarity. We show that the invariance learned with\nthe invariance error regularization closely reassembles the genuine invariance\nof weight-tying models and reliably holds even under a severe input\ndistribution shift. Closer analysis of the learned invariance also reveals the\nspectral decay phenomenon, when a network chooses to achieve the invariance to\na specific transformation group by reducing the sensitivity to any input\nperturbation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:41:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Moskalev","Artem",""],["Sepliarskaia","Anna",""],["Bekkers","Erik J.",""],["Smeulders","Arnold",""]]}
{"id":"2308.03905","submitter":"Joel Ruben Antony Moniz","authors":"Cecilia Aas, Hisham Abdelsalam, Irina Belousova, Shruti Bhargava,\n  Jianpeng Cheng, Robert Daland, Joris Driesen, Federico Flego, Tristan Guigue,\n  Anders Johannsen, Partha Lal, Jiarui Lu, Joel Ruben Antony Moniz, Nathan\n  Perkins, Dhivya Piraviperumal, Stephen Pulman, Diarmuid \\'O S\\'eaghdha, David\n  Q. Sun, John Torr, Marco Del Vecchio, Jay Wacker, Jason D. Williams, Hong Yu","title":"Intelligent Assistant Language Understanding On Device","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":"  It has recently become feasible to run personal digital assistants on phones\nand other personal devices. In this paper we describe a design for a natural\nlanguage understanding system that runs on device. In comparison to a\nserver-based assistant, this system is more private, more reliable, faster,\nmore expressive, and more accurate. We describe what led to key choices about\narchitecture and technologies. For example, some approaches in the dialog\nsystems literature are difficult to maintain over time in a deployment setting.\nWe hope that sharing learnings from our practical experiences may help inform\nfuture work in the research community.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:43:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aas","Cecilia",""],["Abdelsalam","Hisham",""],["Belousova","Irina",""],["Bhargava","Shruti",""],["Cheng","Jianpeng",""],["Daland","Robert",""],["Driesen","Joris",""],["Flego","Federico",""],["Guigue","Tristan",""],["Johannsen","Anders",""],["Lal","Partha",""],["Lu","Jiarui",""],["Moniz","Joel Ruben Antony",""],["Perkins","Nathan",""],["Piraviperumal","Dhivya",""],["Pulman","Stephen",""],["S\u00e9aghdha","Diarmuid \u00d3",""],["Sun","David Q.",""],["Torr","John",""],["Del Vecchio","Marco",""],["Wacker","Jay",""],["Williams","Jason D.",""],["Yu","Hong",""]]}
{"id":"2308.03906","submitter":"Indranil Sur Mr","authors":"Indranil Sur, Karan Sikka, Matthew Walmer, Kaushik Koneripalli,\n  Anirban Roy, Xiao Lin, Ajay Divakaran, Susmit Jha","title":"TIJO: Trigger Inversion with Joint Optimization for Defending Multimodal\n  Backdoored Models","comments":"Published as conference paper at ICCV 2023. 13 pages, 6 figures, 7\n  tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present a Multimodal Backdoor Defense technique TIJO (Trigger Inversion\nusing Joint Optimization). Recent work arXiv:2112.07668 has demonstrated\nsuccessful backdoor attacks on multimodal models for the Visual Question\nAnswering task. Their dual-key backdoor trigger is split across two modalities\n(image and text), such that the backdoor is activated if and only if the\ntrigger is present in both modalities. We propose TIJO that defends against\ndual-key attacks through a joint optimization that reverse-engineers the\ntrigger in both the image and text modalities. This joint optimization is\nchallenging in multimodal models due to the disconnected nature of the visual\npipeline which consists of an offline feature extractor, whose output is then\nfused with the text using a fusion module. The key insight enabling the joint\noptimization in TIJO is that the trigger inversion needs to be carried out in\nthe object detection box feature space as opposed to the pixel space. We\ndemonstrate the effectiveness of our method on the TrojVQA benchmark, where\nTIJO improves upon the state-of-the-art unimodal methods from an AUC of 0.6 to\n0.92 on multimodal dual-key backdoors. Furthermore, our method also improves\nupon the unimodal baselines on unimodal backdoors. We present ablation studies\nand qualitative results to provide insights into our algorithm such as the\ncritical importance of overlaying the inverted feature triggers on all visual\nfeatures during trigger inversion. The prototype implementation of TIJO is\navailable at https://github.com/SRI-CSL/TIJO.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:48:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sur","Indranil",""],["Sikka","Karan",""],["Walmer","Matthew",""],["Koneripalli","Kaushik",""],["Roy","Anirban",""],["Lin","Xiao",""],["Divakaran","Ajay",""],["Jha","Susmit",""]]}
{"id":"2308.03907","submitter":"Mohammed Ameen","authors":"Mohammed Ameen, Richard Stone","title":"Advancements In Crowd-Monitoring System: A Comprehensive Analysis of\n  Systematic Approaches and Automation Algorithms: State-of-The-Art","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Growing apprehensions surrounding public safety have captured the attention\nof numerous governments and security agencies across the globe. These entities\nare increasingly acknowledging the imperative need for reliable and secure\ncrowd-monitoring systems to address these concerns. Effectively managing human\ngatherings necessitates proactive measures to prevent unforeseen events or\ncomplications, ensuring a safe and well-coordinated environment. The scarcity\nof research focusing on crowd monitoring systems and their security\nimplications has given rise to a burgeoning area of investigation, exploring\npotential approaches to safeguard human congregations effectively. Crowd\nmonitoring systems depend on a bifurcated approach, encompassing vision-based\nand non-vision-based technologies. An in-depth analysis of these two\nmethodologies will be conducted in this research. The efficacy of these\napproaches is contingent upon the specific environment and temporal context in\nwhich they are deployed, as they each offer distinct advantages. This paper\nendeavors to present an in-depth analysis of the recent incorporation of\nartificial intelligence (AI) algorithms and models into automated systems,\nemphasizing their contemporary applications and effectiveness in various\ncontexts.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:50:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ameen","Mohammed",""],["Stone","Richard",""]]}
{"id":"2308.03908","submitter":"Soumyabrata Chaudhuri","authors":"Soumyabrata Chaudhuri and Saumik Bhattacharya","title":"ViLP: Knowledge Exploration using Vision, Language, and Pose Embeddings\n  for Video Action Recognition","comments":"7 pages, 3 figures, 2 Tables","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":"  Video Action Recognition (VAR) is a challenging task due to its inherent\ncomplexities. Though different approaches have been explored in the literature,\ndesigning a unified framework to recognize a large number of human actions is\nstill a challenging problem. Recently, Multi-Modal Learning (MML) has\ndemonstrated promising results in this domain. In literature, 2D skeleton or\npose modality has often been used for this task, either independently or in\nconjunction with the visual information (RGB modality) present in videos.\nHowever, the combination of pose, visual information, and text attributes has\nnot been explored yet, though text and pose attributes independently have been\nproven to be effective in numerous computer vision tasks. In this paper, we\npresent the first pose augmented Vision-language model (VLM) for VAR. Notably,\nour scheme achieves an accuracy of 92.81% and 73.02% on two popular human video\naction recognition benchmark datasets, UCF-101 and HMDB-51, respectively, even\nwithout any video data pre-training, and an accuracy of 96.11% and 75.75% after\nkinetics pre-training.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:50:54 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chaudhuri","Soumyabrata",""],["Bhattacharya","Saumik",""]]}
{"id":"2308.03909","submitter":"Erik Hupp","authors":"Erik Hupp, Aaron Naber and Kai-Hsiang Wang","title":"Lower Ricci Curvature and Nonexistence of Manifold Structure","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is known that a limit $(M^n_j,g_j)\\to (X^k,d)$ of manifolds $M_j$ with\nuniform lower bounds on Ricci curvature must be $k$-rectifiable for some unique\n$\\dim X:= k\\leq n = \\dim M_j$. It is also known that if $k=n$, then $X^n$ is a\ntopological manifold on an open dense subset, and it has been an open question\nas to whether this holds for $k<n$.\n  Consider now any smooth complete $4$-manifold $(X^4,h)$ with\n$\\text{Ric}>\\lambda$ and $\\lambda\\in \\mathbb{R}$. Then for each $\\epsilon>0$ we\nconstruct a complete $4$-rectifiable metric space $(X^4_\\epsilon,d_\\epsilon)$\nwith $d_{GH}(X^4_\\epsilon,X^4)<\\epsilon$ such that the following hold. First,\n$X^4_\\epsilon$ is a limit space $(M^6_j,g_j)\\to X^4_\\epsilon$ where $M^6_j$ are\nsmooth manifolds with $\\text{Ric}_j>\\lambda$ satisfying the same lower Ricci\nbound. Additionally, $X^4_\\epsilon$ has no open subset which is topologically a\nmanifold. Indeed, for any open $U\\subseteq X^4_\\epsilon$ we have that the\nsecond homology $H_2(U)$ is infinitely generated. Topologically, $X^4_\\epsilon$\nis the connect sum of $X^4$ with an infinite number of densely spaced copies of\n$\\mathbb{C} P^2$ .\n  In this way we see that every $4$-manifold $X^4$ may be approximated\narbitrarily closely by $4$-dimensional limit spaces $X^4_\\epsilon$ which are\nnowhere manifolds. We will see there is an, as now imprecise, sense in which\ngenerically one should expect manifold structures to not exist on spaces with\nhigher dimensional Ricci curvature lower bounds.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:52:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hupp","Erik",""],["Naber","Aaron",""],["Wang","Kai-Hsiang",""]]}
{"id":"2308.03910","submitter":"Snir Ben Ovadia","authors":"Snir Ben Ovadia and Federico Rodriguez-Hetrz","title":"Exponentially fast volume limits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that every exponentially fast limit of the pushed volume is an SRB\nmeasure. More precisely: Let $M$ be a $d$-dimensional closed Riemannian\nmanifold, and let $f\\in\\mathrm{Diff}^{1+\\beta}(M)$, $\\beta>0$. Let $\\mu$ be an\n$f$-invariant probability measure on $M$. Assume that the pushed-volume\nconverges to $\\mu$ exponentially fast in the sense that $$\\exists\nC>0,\\alpha\\in(0,1],\\gamma>0:\\forall g\\in \\mathrm{H\\ddot{o}l}_\\alpha(M),\n\\left|\\frac{1}{N}\\sum_{k=n}^{n+N-1}m(g\\circ f^k)-\\mu(g)\\right|\\leq C\\cdot\n\\|g\\|_\\alpha\\cdot e^{-\\gamma \\cdot(n\\wedge N)},$$ where $n\\wedge\nN:=\\min\\{n,N\\}$. Then we show that $\\mu$ is an SRB measure.\n  Moreover, under the additional assumption that the volume \"almost\"\nexponentially mixes but is not necessarily invariant, we show that unless $\\mu$\nis a Dirac mass at a fixed point (a necessary condition), $\\mu$ admits a\npositive exponent almost everywhere. More explicitly, if $$\\exists\nC>0,\\alpha\\in(0,1],\\gamma>0:\\forall g,h\\in \\mathrm{H\\ddot{o}l}_\\alpha(M),\n\\left|\\int g\\circ f^n \\cdot h dm-\\mu(g)\\cdot m(h)\\right|\\leq C\\cdot\n\\|g\\|_\\alpha\\cdot \\|h\\|_\\alpha\\cdot e^{-\\gamma n},$$ then either $\\mu$ is a\nDirac mass at a fixed point, or it is an SRB measure with a positive Lyapunov\nexponent a.e.\n  In the latter case, we show that $\\mu$ must be ergodic, and that it is the\nunique SRB measure of the system. Moreover, we show that every ergodic\ninvariant measure $\\nu$ satisfies $\\max_i\\chi^+_i(\\nu)\\geq\n\\frac{\\gamma}{2d}>0$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:59:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ovadia","Snir Ben",""],["Rodriguez-Hetrz","Federico",""]]}
{"id":"2308.03911","submitter":"Martin Chuaqui S","authors":"Martin Chuaqui and Brad Osgood","title":"Best M\\\"obius approximations of convex and concave mappings","comments":"11 pages, one figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the best M\\\"obius approximations (BMA) to convex and concave\nconformal mappings of the disk, including the special case of mappings onto\nconvex polygons. The crucial factor is the location of the poles of the BMAs.\nFiner details are possible in the case of polygons through special properties\nof Blaschke products and the prevertices of the mapping function.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:03:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chuaqui","Martin",""],["Osgood","Brad",""]]}
{"id":"2308.03912","submitter":"David Cruz-Uribe OFS","authors":"David Cruz-Uribe and Michael Penrod","title":"Convolution Operators in Matrix Weighted, Variable Lebesgue Spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the theory of matrix weights to the variable Lebesgue spaces. The\ntheory of matrix $\\mathcal{A}_p$ weights has attracted considerable attention\nbeginning with the work of Nazarov, Treil, and Volberg in the 1990s. We extend\nthis theory by generalizing the matrix $\\mathcal{A}_p$ condition to the\nvariable exponent setting. We prove boundedness of the convolution operator\n$\\mathbf{f}\\mapsto \\phi\\ast \\mathbf{F}$ for $\\phi \\in C_c^\\infty(\\Omega)$, and\nshow that the approximate identity defined using $\\phi$ converges in matrix\nweighted, variable Lebesgue spaces $L^{p(\\cdot)}(W,\\Omega)$ for $W$ in matrix\n$\\mathcal{A}_{p(\\cdot)}$. Our approach to this problem is through averaging\noperators; these results are of interest in their own right. As an application\nof our work, we prove a version of the classical $H=W$ theorem for matrix\nweighted, variable exponent Sobolev spaces.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:17:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cruz-Uribe","David",""],["Penrod","Michael",""]]}
{"id":"2308.03913","submitter":"Anil C. Seth","authors":"Aishwarya Ashok, Anil Seth, Peter Erwin, Victor P. Debattista, Adriana\n  de Lorenzo-C\\'aceres, Dmitri A. Gadotti, Jairo M\\'endez-Abreu, John E.\n  Beckman, Ralf Bender, Niv Drory, Deanne Fisher, Ulrich Hopp, Matthias Kluge,\n  Tutku Kolcu, Witold Maciejewski, Kianusch Mehrgan, Taniya Parikh, Roberto\n  Saglia, Marja Seidel and Jens Thomas","title":"Composite Bulges -- III. A Study of Nuclear Star Clusters in Nearby\n  Spiral Galaxies","comments":"Accepted to The Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present photometric and morphological analyses of nuclear star clusters\n(NSCs) -- very dense, massive star clusters present in the central regions of\nmost galaxies -- in a sample of 33 massive disk galaxies within 20 Mpc, part of\nthe \"Composite Bulges Survey.\" We use data from the Hubble Space Telescope\nincluding optical (F475W and F814W) and near-IR (F160W) images from the Wide\nField Camera 3. We fit the images in 2D to take into account the full\ncomplexity of the inner regions of these galaxies (including the contributions\nof nuclear disks and bars), isolating the nuclear star cluster and bulge\ncomponents. We derive NSC radii and magnitudes in all 3 bands, which we then\nuse to estimate NSC masses. Our sample significantly expands the sample of\nmassive late-type galaxies with measured NSC properties. We clearly identify\nnuclear star clusters in nearly 80% of our galaxies, putting a lower limit on\nthe nucleation fraction in these galaxies that is higher than previous\nestimates. We find that the NSCs in our massive disk galaxies are consistent\nwith previous NSC mass-NSC radius and Galaxy Mass-NSC Mass relations. However,\nwe also find a large spread in NSC masses, with a handful of galaxies hosting\nvery low-mass, compact clusters. Our NSCs are aligned in PA with their host\ngalaxy disks but are less flattened. They show no correlations with bar or\nbulge properties. Finally, we find the ratio of NSC to BH mass in our massive\ndisk galaxy sample spans a factor of $\\sim$300.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:18:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ashok","Aishwarya",""],["Seth","Anil",""],["Erwin","Peter",""],["Debattista","Victor P.",""],["de Lorenzo-C\u00e1ceres","Adriana",""],["Gadotti","Dmitri A.",""],["M\u00e9ndez-Abreu","Jairo",""],["Beckman","John E.",""],["Bender","Ralf",""],["Drory","Niv",""],["Fisher","Deanne",""],["Hopp","Ulrich",""],["Kluge","Matthias",""],["Kolcu","Tutku",""],["Maciejewski","Witold",""],["Mehrgan","Kianusch",""],["Parikh","Taniya",""],["Saglia","Roberto",""],["Seidel","Marja",""],["Thomas","Jens",""]]}
{"id":"2308.03914","submitter":"MD Arafat Kabir","authors":"MD Arafat Kabir, Ehsan Kabir, Joshua Hollis, Eli Levy-Mackay,\n  Atiyehsadat Panahi, Jason Bakos, Miaoqing Huang and David Andrews","title":"FPGA Processor In Memory Architectures (PIMs): Overlay or Overhaul ?","comments":"Accepted in 2023 33rd International Conference on Field-Programmable\n  Logic and Applications (FPL)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The dominance of machine learning and the ending of Moore's law have renewed\ninterests in Processor in Memory (PIM) architectures. This interest has\nproduced several recent proposals to modify an FPGA's BRAM architecture to form\na next-generation PIM reconfigurable fabric. PIM architectures can also be\nrealized within today's FPGAs as overlays without the need to modify the\nunderlying FPGA architecture. To date, there has been no study to understand\nthe comparative advantages of the two approaches. In this paper, we present a\nstudy that explores the comparative advantages between two proposed custom\narchitectures and a PIM overlay running on a commodity FPGA. We created PiCaSO,\na Processor in/near Memory Scalable and Fast Overlay architecture as a\nrepresentative PIM overlay. The results of this study show that the PiCaSO\noverlay achieves up to 80% of the peak throughput of the custom designs with\n2.56x shorter latency and 25% - 43% better BRAM memory utilization efficiency.\nWe then show how several key features of the PiCaSO overlay can be integrated\ninto the custom PIM designs to further improve their throughput by 18%, latency\nby 19.5%, and memory efficiency by 6.2%.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:19:29 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kabir","MD Arafat",""],["Kabir","Ehsan",""],["Hollis","Joshua",""],["Levy-Mackay","Eli",""],["Panahi","Atiyehsadat",""],["Bakos","Jason",""],["Huang","Miaoqing",""],["Andrews","David",""]]}
{"id":"2308.03915","submitter":"Jacobo Ayensa-Jim\\'enez","authors":"Javier Orera-Echeverria, Jacobo Ayensa-Jim\\'enez, Manuel Doblare","title":"Predicting and explaining nonlinear material response using deep\n  Physically Guided Neural Networks with Internal Variables","comments":"Main text: 25 pages, 6 figures. Appendices: 13 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nonlinear materials are often difficult to model with classical state model\ntheory because they have a complex and sometimes inaccurate physical and\nmathematical description or we simply do not know how to describe such\nmaterials in terms of relations between external and internal variables. In\nmany disciplines, Neural Network methods have arisen as powerful tools to\nidentify very complex and non-linear correlations. In this work, we use the\nvery recently developed concept of Physically Guided Neural Networks with\nInternal Variables (PGNNIV) to discover constitutive laws using a model-free\napproach and training solely with measured force-displacement data. PGNNIVs\nmake a particular use of the physics of the problem to enforce constraints on\nspecific hidden layers and are able to make predictions without internal\nvariable data. We demonstrate that PGNNIVs are capable of predicting both\ninternal and external variables under unseen load scenarios, regardless of the\nnature of the material considered (linear, with hardening or softening behavior\nand hyperelastic), unravelling the constitutive law of the material hence\nexplaining its nature altogether, placing the method in what is known as\neXplainable Artificial Intelligence (XAI).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:20:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Orera-Echeverria","Javier",""],["Ayensa-Jim\u00e9nez","Jacobo",""],["Doblare","Manuel",""]]}
{"id":"2308.03916","submitter":"Nafisa Aftab","authors":"Nafisa Aftab, Biswajit Paul","title":"X-ray reprocessing: Through the eclipse spectra of low mass X-ray\n  binaries with XMM-Newton","comments":"37 pages, 17 figures, 8 Tables, accepted in New Astronomy (July 28,\n  2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Eclipsing X-ray binaries make an ideal condition to study reprocessed X-rays,\nas the X-rays detected during eclipse are purely reprocessed while the much\nbrighter primary X-rays are blocked by the companion star. We carried out a\ncomprehensive study of X-ray reprocessing with four eclipsing Low Mass X-ray\nBinary (LMXB) systems by comparing X-ray spectra during and outside eclipse\nwith \\textit{XMM-Newton} EPIC pn observations. The 17 observations of MXB\n1659$-$298, AX J1745.6$-$2901, EXO 0748$-$676 and XTE J1710$-$281 give unique\nfeatures of the systems. For example, X-ray reprocessing characteristics in AX\nJ1745.6$-$2901 is found to be nearly same irrespective of the intensity state;\nthere is an indication of different types of variable warp structures in the\ninner accretion disk in EXO 0748$-$676, a high out-of-eclipse to eclipse flux\nratio in XTE J1710$-$281 inspite of a large size of the accretion disk perhaps\nindicates low scale height of the accretion disk. The eclipse spectra for some\nof the LMXB sources are reported for the first time. We have derived the\nfractional visible area of the accretion disk during maximum eclipse phase for\nvarious obscuration geometries. The out-of-eclipse to eclipse flux ratio in\nLMXBs observed to be smaller compared to that found in High Mass X-ray\nBinaries. This indicates greater reprocessing in LMXBs despite having less\ndense, less extended stellar wind from the companion. The X-ray reprocessing\nefficiencies observed in LMXBs indicate large dependencies of X-ray\nreprocessing on the scale height of the accretion disk, relative size of the\ndisk compared to the companion and some other unknown factors.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:26:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aftab","Nafisa",""],["Paul","Biswajit",""]]}
{"id":"2308.03917","submitter":"Chihiro Taguchi","authors":"Chihiro Taguchi, Yusuke Sakai, Parisa Haghani, David Chiang","title":"Universal Automatic Phonetic Transcription into the International\n  Phonetic Alphabet","comments":"5 pages, 7 tables","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":"  This paper presents a state-of-the-art model for transcribing speech in any\nlanguage into the International Phonetic Alphabet (IPA). Transcription of\nspoken languages into IPA is an essential yet time-consuming process in\nlanguage documentation, and even partially automating this process has the\npotential to drastically speed up the documentation of endangered languages.\nLike the previous best speech-to-IPA model (Wav2Vec2Phoneme), our model is\nbased on wav2vec 2.0 and is fine-tuned to predict IPA from audio input. We use\ntraining data from seven languages from CommonVoice 11.0, transcribed into IPA\nsemi-automatically. Although this training dataset is much smaller than\nWav2Vec2Phoneme's, its higher quality lets our model achieve comparable or\nbetter results. Furthermore, we show that the quality of our universal\nspeech-to-IPA models is close to that of human annotators.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:29:51 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Taguchi","Chihiro",""],["Sakai","Yusuke",""],["Haghani","Parisa",""],["Chiang","David",""]]}
{"id":"2308.03918","submitter":"Igor Vladimirov","authors":"Igor G. Vladimirov, Ian R. Petersen","title":"Quadratic-exponential coherent feedback control of linear quantum\n  stochastic systems","comments":"29 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers a risk-sensitive optimal control problem for a\nfield-mediated interconnection of a quantum plant with a coherent\n(measurement-free) quantum controller. The plant and the controller are\nmultimode open quantum harmonic oscillators governed by linear quantum\nstochastic differential equations, which are coupled to each other and driven\nby multichannel quantum Wiener processes modelling the external bosonic fields.\nThe control objective is to internally stabilize the closed-loop system and\nminimize the infinite-horizon asymptotic growth rate of a quadratic-exponential\nfunctional which penalizes the plant variables and the controller output. We\nobtain first-order necessary conditions of optimality for this problem by\ncomputing the partial Frechet derivatives of the cost functional with respect\nto the energy and coupling matrices of the controller in frequency domain and\nstate space. An infinitesimal equivalence between the risk-sensitive and\nweighted coherent quantum LQG control problems is also established. In addition\nto variational methods, we employ spectral factorizations and infinite cascades\nof auxiliary classical systems. Their truncations are applicable to numerical\noptimization algorithms (such as the gradient descent) for coherent quantum\nrisk-sensitive feedback synthesis.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:31:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Vladimirov","Igor G.",""],["Petersen","Ian R.",""]]}
{"id":"2308.03919","submitter":"Adriana Szekeres","authors":"Naama Ben-David, Gal Sela, Adriana Szekeres","title":"The FIDS Theorems: Tensions between Multinode and Multicore Performance\n  in Transactional Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traditionally, distributed and parallel transactional systems have been\nstudied in isolation, as they targeted different applications and experienced\ndifferent bottlenecks. However, modern high-bandwidth networks have made the\nstudy of systems that are both distributed (i.e., employ multiple nodes) and\nparallel (i.e., employ multiple cores per node) necessary to truly make use of\nthe available hardware.\n  In this paper, we study the performance of these combined systems and show\nthat there are inherent tradeoffs between a system's ability to have fast and\nrobust distributed communication and its ability to scale to multiple cores.\nMore precisely, we formalize the notions of a \\emph{fast deciding} path of\ncommunication to commit transactions quickly in good executions, and\n\\emph{seamless fault tolerance} that allows systems to remain robust to server\nfailures. We then show that there is an inherent tension between these two\nnatural distributed properties and well-known multicore scalability properties\nin transactional systems. Finally, we show positive results; it is possible to\nconstruct a parallel distributed transactional system if any one of the\nproperties we study is removed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:33:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ben-David","Naama",""],["Sela","Gal",""],["Szekeres","Adriana",""]]}
{"id":"2308.03920","submitter":"Kartik Krishna","authors":"Kartik Krishna, Aditya G. Nair, Anand Krishnan, Steven L. Brunton,\n  Eurika Kaiser","title":"Control of Vortex Dynamics using Invariants","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.SY eess.SY math.DS math.OC nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vortex-dominated flows are ubiquitous in engineering, and the ability to\nefficiently manipulate the dynamics of these vortices has broad applications,\nfrom wake shaping to mixing enhancement. However, the strongly nonlinear\nbehavior of the vortex dynamics makes this a challenging task. In this work, we\ninvestigate the control of vortex dynamics by using a change of coordinates\nfrom the Biot-Savart equations into well-known invariants, such as the\nHamiltonian, linear, and angular impulses, which are Koopman eigenfunctions. We\nthen combine the resulting model with model predictive control to generate\ncontrol laws that force the vortex system using \"virtual cylinders\". The\ninvariant model is beneficial as it provides a linear, global description of\nthe vortex dynamics through a recently developed Koopman control scheme for\nconserved quantities and invariants. The use of this model has not been well\nstudied in the literature in the context of control. In this paper, we seek to\nunderstand the effect of changing each invariant individually or multiple\ninvariants simultaneously. We use the 4-vortex system as our primary test bed,\nas it is the simplest configuration that exhibits chaotic behavior. We show\nthat by controlling to specific invariant quantities, we can modify the\ntransition from chaotic to quasiperiodic states. Finally, we computationally\ndemonstrate the effectiveness of invariant control on a toy example of tracer\nmixing in the 4-vortex system.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:36:56 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 01:56:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Krishna","Kartik",""],["Nair","Aditya G.",""],["Krishnan","Anand",""],["Brunton","Steven L.",""],["Kaiser","Eurika",""]]}
{"id":"2308.03921","submitter":"Hariharan Subramonyam","authors":"Tyler Angert, Miroslav Ivan Suzara, Jenny Han, Christopher Lawrence\n  Pondoc, Hariharan Subramonyam","title":"Spellburst: A Node-based Interface for Exploratory Creative Coding with\n  Natural Language Prompts","comments":null,"journal-ref":null,"doi":"10.1145/3586183.3606719","report-no":null,"categories":"cs.SE cs.HC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Creative coding tasks are often exploratory in nature. When producing digital\nartwork, artists usually begin with a high-level semantic construct such as a\n\"stained glass filter\" and programmatically implement it by varying code\nparameters such as shape, color, lines, and opacity to produce visually\nappealing results. Based on interviews with artists, it can be effortful to\ntranslate semantic constructs to program syntax, and current programming tools\ndon't lend well to rapid creative exploration. To address these challenges, we\nintroduce Spellburst, a large language model (LLM) powered creative-coding\nenvironment. Spellburst provides (1) a node-based interface that allows artists\nto create generative art and explore variations through branching and merging\noperations, (2) expressive prompt-based interactions to engage in semantic\nprogramming, and (3) dynamic prompt-driven interfaces and direct code editing\nto seamlessly switch between semantic and syntactic exploration. Our evaluation\nwith artists demonstrates Spellburst's potential to enhance creative coding\npractices and inform the design of computational creativity tools that bridge\nsemantic and syntactic spaces.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:54:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Angert","Tyler",""],["Suzara","Miroslav Ivan",""],["Han","Jenny",""],["Pondoc","Christopher Lawrence",""],["Subramonyam","Hariharan",""]]}
{"id":"2308.03922","submitter":"Laura McKemmish K","authors":"Armando N. Perri, Fadia Taher, Laura K. McKemmish","title":"Full Spectroscopic Model and Trihybrid\n  Experimental-Perturbative-Variational Line List for ZrO","comments":null,"journal-ref":null,"doi":"10.1093/mnras/stad2103","report-no":null,"categories":"astro-ph.EP astro-ph.IM astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zirconium monoxide (ZrO) absorption lines define rare S-type stars and are\ncurrently being sought on exoplanets. Successful detection is dependent on an\naccurate and comprehensive line list, with existing data not ideal for many\napplications. Specifically, the Plez \\etal{} line list is near-complete but has\ninsufficient accuracy for high-resolution cross-correlation, while the Sorensen\n\\& Bernath data has high accuracy but only considers a small number of spectral\nbands. This article presents a novel spectroscopic model, variational line list\nand trihybrid line list for the main \\ZrO{} isotopologue, as well as\nisotopologue-extrapolated hybrid line lists for the \\isoa{}, \\isob{}, \\isoc{},\n\\isod{}~and \\isoe{} isotopologues. These were constructed using \\DUO{} based on\nicMRCI-SD/CASSCF~\\abinitio{} electronic data calculated using \\MOLPRO{},\nexperimental energies obtained from a previous \\Marvel{} data compilation and\nperturbative energies from Sorensen \\& Bernath. The new \\ZrO{} \\EXOMOL{}-style\ntrihybrid line list, \\LLname{}, comprises \\noenergies{} energies\n(\\noMaenergies{} experimental) and \\notransitions{} transitions up to\n30,000~\\cm{} (333~nm) between ten low-lying electronic states (\\ZrOX{},\n\\ZrOaa{}, \\ZrOA{}, \\ZrObb{}, \\ZrOB{}, \\ZrOC{}, \\ZrOdd{}, \\ZrOee{}, \\ZrOff{} and\n\\ZrOF{}). The inclusion of experimental energy levels in \\LLname{} means ZrO\nwill be much easier to detect using high-resolution ground-based telescopes in\nthe 12,500 -- 17,500~\\cm{} (571 -- 800~nm) spectral region. The inclusion of\nvariational energy levels means that the ZorrO line list has very high\ncompleteness and can accurately model molecular absorption cross-sections even\nat high temperatures. The \\LLname{} data will hopefully facilitate the first\ndetection of ZrO in the atmosphere of a hot Jupiter exoplanet, or alternatively\nmore conclusively exclude its presence.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:55:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Perri","Armando N.",""],["Taher","Fadia",""],["McKemmish","Laura K.",""]]}
{"id":"2308.03923","submitter":"Sacha Greenfield","authors":"Sacha Greenfield, Leigh Martin, Felix Motzoi, K. Birgitta Whaley,\n  Justin Dressel, and Eli M. Levenson-Falk","title":"Stabilizing two-qubit entanglement with dynamically decoupled active\n  feedback","comments":"27 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose and analyze a protocol for stabilizing a maximally entangled state\nof two noninteracting qubits using active state-dependent feedback from a\ncontinuous two-qubit half-parity measurement in coordination with a concurrent,\nnon-commuting dynamical decoupling drive. We demonstrate the surprising result\nthat such a drive be simultaneous with the measurement and feedback, and can\nalso be part of the feedback protocol itself. We show that robust stabilization\nwith near-unit fidelity can be achieved even in the presence of realistic\nnonidealities, such as time delay in the feedback loop, imperfect\nstate-tracking, inefficient measurements, and dephasing from 1/f-distributed\nqubit-frequency noise. We mitigate feedback-delay error by introducing a\nforward-state-estimation strategy in the feedback controller that tracks the\neffects of control signals already in transit.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:59:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Greenfield","Sacha",""],["Martin","Leigh",""],["Motzoi","Felix",""],["Whaley","K. Birgitta",""],["Dressel","Justin",""],["Levenson-Falk","Eli M.",""]]}
{"id":"2308.03924","submitter":"Daisy Kalra","authors":"MicroBooNE collaboration: P. Abratenko, O. Alterkait, D. Andrade\n  Aldana, L. Arellano, J. Asaadi, A. Ashkenazi, S. Balasubramanian, B. Baller,\n  G. Barr, D. Barrow, J. Barrow, V. Basque, O. Benevides Rodrigues, S. Berkman,\n  A. Bhanderi, A. Bhat, M. Bhattacharya, M. Bishai, A. Blake, B. Bogart, T.\n  Bolton, J.Y. Book, L. Camilleri, Y. Cao, D. Caratelli, I. Caro Terrazas, F.\n  Cavanna, G. Cerati, Y. Chen, J.M. Conrad, M. Convery, L. Cooper-Troendle,\n  J.I. Crespo-Anadon, R. Cross, M. Del Tutto, S.R. Dennis, P. Detje, A. Devitt,\n  R. Diurba, Z. Djurcic, R. Dorrill, K. Duffy, S. Dytman, B. Eberly, P.\n  Englezos, A. Ereditato, J.J. Evans, R. Fine, O.G. Finnerud, B.T. Fleming, N.\n  Foppiani, W. Foreman, D. Franco, A.P. Furmanski, D. Garcia-Gamez, S.\n  Gardiner, G. Ge, S. Gollapinni, O. Goodwin, E. Gramellini, P. Green, H.\n  Greenlee, W. Gu, R. Guenette, P. Guzowski, L. Hagaman, O. Hen, R. Hicks, C.\n  Hilgenberg, G.A. Horton-Smith, Z. Imani, B. Irwin, R. Itay, C. James, X. Ji,\n  L. Jiang, J.H. Jo, R.A. Johnson, Y.J. Jwa, D. Kalra, N. Kamp, G. Karagiorgi,\n  W. Ketchum, M. Kirby, T. Kobilarcik, I. Kreslo, M. B. Leibovitch, I. Lepetic,\n  J.-Y. Li, K. Li, Y. Li, K. Lin, B.R. Littlejohn, H. Liu, W.C. Louis, X. Luo,\n  C. Mariani, D. Marsden, J. Marshall, N. Martinez, D.A. Martinez Caicedo, S.\n  Martynenko, A. Mastbaum, N. McConkey, V. Meddage, J. Micallef, K. Miller, K.\n  Mistry, T. Mohayai, A. Mogan, M. Mooney, A.F. Moor, C.D. Moore, L. Mora\n  Lepin, M.M. Moudgalya, S. Mulleria Babu, D. Naples, A. Navrer-Agasson, N.\n  Nayak, M. Nebot-Guinot, J. Nowak, N. Oza, O. Palamara, N. Pallat, V. Paolone,\n  A. Papadopoulou, V. Papavassiliou, H. Parkinson, S.F. Pate, N. Patel, Z.\n  Pavlovic, E. Piasetzky, I. Ponce-Pinto, I. Pophale, X. Qian, J.L. Raaf, V.\n  Radeka, A. Rafique, M. Reggiani-Guzzo, L. Ren, L. Rochester, J. Rodriguez\n  Rondon, M. Rosenberg, M. Ross-Lonergan, C. Rudolph von Rohr, I. Safa, G.\n  Scanavini, D.W. Schmitz, A. Schukraft, W. Seligman, M.H. Shaevitz, R.\n  Sharankova, J. Shi, E.L. Snider, M. Soderberg, S. Soldner-Rembold, J. Spitz,\n  M. Stancari, J. St. John, T. Strauss, A.M. Szelc, W. Tang, N. Taniuchi, K.\n  Terao, C.Thorpe, D. Torbunov, D. Totani, M. Toups, Y.-T. Tsai, J. Tyler, M.A.\n  Uchida, T. Usher, B. Viren, M. Weber, H. Wei, A.J. White, S. Wolbers, T.\n  Wongjirad, M. Wospakrik, K. Wresilo, N. Wright, W. Wu, E. Yandel, T. Yang,\n  L.E. Yates, H.W. Yu, G.P. Zeller, J. Zennamo, C. Zhang","title":"First demonstration for a LArTPC-based search for intranuclear\n  neutron-antineutron transitions and annihilation in $^{40}$Ar using the\n  MicroBooNE detector","comments":"11 pages, 6 figures, 6 tables","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-410-ND","categories":"hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a novel methodology to search for intranuclear\nneutron-antineutron transition ($n\\rightarrow\\bar{n}$) followed by annihilation\nwithin an $^{40}$Ar nucleus, using the MicroBooNE liquid argon time projection\nchamber (LArTPC) detector. A discovery of $n\\rightarrow\\bar{n}$ transition or\nincreased lower limit on the lifetime of this process would either constitute\nphysics beyond the Standard Model or greatly constrain theories of\nbaryogenesis, respectively. The approach presented in this paper makes use of\ndeep learning methods to select $n\\rightarrow\\bar{n}$ events based on their\nunique features and differentiate them from cosmogenic backgrounds. The\nachieved signal and background efficiencies are (70$\\pm$6)\\% and\n(0.0020$\\pm$0.0003)\\%, respectively. A demonstration of a search is performed\nwith a data set corresponding to an exposure of $3.32\n\\times10^{26}\\,$neutron-years, and where the background rate is constrained\nthrough direct measurement, assuming the presence of a negligible signal. With\nthis approach, no excess of events over the background prediction is observed,\nsetting a demonstrative lower bound on the $n\\rightarrow\\bar{n}$ lifetime in\n$^{40}$Ar of $\\tau_{\\textrm m} > 1.1\\times10^{26}\\,$years, and on the free\n$n\\rightarrow\\bar{n}$ transition time of $\\tau_{\\textrm n-\\bar{n}} >\n2.6\\times10^{5}\\,$s, each at the $90\\%$ confidence level. This analysis\nrepresents a first-ever proof-of-principle demonstration of the ability to\nsearch for this rare process in LArTPCs with high efficiency and low\nbackground.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:00:02 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 13:48:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["MicroBooNE collaboration","",""],["Abratenko","P.",""],["Alterkait","O.",""],["Aldana","D. Andrade",""],["Arellano","L.",""],["Asaadi","J.",""],["Ashkenazi","A.",""],["Balasubramanian","S.",""],["Baller","B.",""],["Barr","G.",""],["Barrow","D.",""],["Barrow","J.",""],["Basque","V.",""],["Rodrigues","O. Benevides",""],["Berkman","S.",""],["Bhanderi","A.",""],["Bhat","A.",""],["Bhattacharya","M.",""],["Bishai","M.",""],["Blake","A.",""],["Bogart","B.",""],["Bolton","T.",""],["Book","J. Y.",""],["Camilleri","L.",""],["Cao","Y.",""],["Caratelli","D.",""],["Terrazas","I. Caro",""],["Cavanna","F.",""],["Cerati","G.",""],["Chen","Y.",""],["Conrad","J. M.",""],["Convery","M.",""],["Cooper-Troendle","L.",""],["Crespo-Anadon","J. I.",""],["Cross","R.",""],["Del Tutto","M.",""],["Dennis","S. R.",""],["Detje","P.",""],["Devitt","A.",""],["Diurba","R.",""],["Djurcic","Z.",""],["Dorrill","R.",""],["Duffy","K.",""],["Dytman","S.",""],["Eberly","B.",""],["Englezos","P.",""],["Ereditato","A.",""],["Evans","J. J.",""],["Fine","R.",""],["Finnerud","O. G.",""],["Fleming","B. T.",""],["Foppiani","N.",""],["Foreman","W.",""],["Franco","D.",""],["Furmanski","A. P.",""],["Garcia-Gamez","D.",""],["Gardiner","S.",""],["Ge","G.",""],["Gollapinni","S.",""],["Goodwin","O.",""],["Gramellini","E.",""],["Green","P.",""],["Greenlee","H.",""],["Gu","W.",""],["Guenette","R.",""],["Guzowski","P.",""],["Hagaman","L.",""],["Hen","O.",""],["Hicks","R.",""],["Hilgenberg","C.",""],["Horton-Smith","G. A.",""],["Imani","Z.",""],["Irwin","B.",""],["Itay","R.",""],["James","C.",""],["Ji","X.",""],["Jiang","L.",""],["Jo","J. H.",""],["Johnson","R. A.",""],["Jwa","Y. J.",""],["Kalra","D.",""],["Kamp","N.",""],["Karagiorgi","G.",""],["Ketchum","W.",""],["Kirby","M.",""],["Kobilarcik","T.",""],["Kreslo","I.",""],["Leibovitch","M. B.",""],["Lepetic","I.",""],["Li","J. -Y.",""],["Li","K.",""],["Li","Y.",""],["Lin","K.",""],["Littlejohn","B. R.",""],["Liu","H.",""],["Louis","W. C.",""],["Luo","X.",""],["Mariani","C.",""],["Marsden","D.",""],["Marshall","J.",""],["Martinez","N.",""],["Caicedo","D. A. Martinez",""],["Martynenko","S.",""],["Mastbaum","A.",""],["McConkey","N.",""],["Meddage","V.",""],["Micallef","J.",""],["Miller","K.",""],["Mistry","K.",""],["Mohayai","T.",""],["Mogan","A.",""],["Mooney","M.",""],["Moor","A. F.",""],["Moore","C. D.",""],["Lepin","L. Mora",""],["Moudgalya","M. M.",""],["Babu","S. Mulleria",""],["Naples","D.",""],["Navrer-Agasson","A.",""],["Nayak","N.",""],["Nebot-Guinot","M.",""],["Nowak","J.",""],["Oza","N.",""],["Palamara","O.",""],["Pallat","N.",""],["Paolone","V.",""],["Papadopoulou","A.",""],["Papavassiliou","V.",""],["Parkinson","H.",""],["Pate","S. F.",""],["Patel","N.",""],["Pavlovic","Z.",""],["Piasetzky","E.",""],["Ponce-Pinto","I.",""],["Pophale","I.",""],["Qian","X.",""],["Raaf","J. L.",""],["Radeka","V.",""],["Rafique","A.",""],["Reggiani-Guzzo","M.",""],["Ren","L.",""],["Rochester","L.",""],["Rondon","J. Rodriguez",""],["Rosenberg","M.",""],["Ross-Lonergan","M.",""],["von Rohr","C. Rudolph",""],["Safa","I.",""],["Scanavini","G.",""],["Schmitz","D. W.",""],["Schukraft","A.",""],["Seligman","W.",""],["Shaevitz","M. H.",""],["Sharankova","R.",""],["Shi","J.",""],["Snider","E. L.",""],["Soderberg","M.",""],["Soldner-Rembold","S.",""],["Spitz","J.",""],["Stancari","M.",""],["John","J. St.",""],["Strauss","T.",""],["Szelc","A. M.",""],["Tang","W.",""],["Taniuchi","N.",""],["Terao","K.",""],["Thorpe","C.",""],["Torbunov","D.",""],["Totani","D.",""],["Toups","M.",""],["Tsai","Y. -T.",""],["Tyler","J.",""],["Uchida","M. A.",""],["Usher","T.",""],["Viren","B.",""],["Weber","M.",""],["Wei","H.",""],["White","A. J.",""],["Wolbers","S.",""],["Wongjirad","T.",""],["Wospakrik","M.",""],["Wresilo","K.",""],["Wright","N.",""],["Wu","W.",""],["Yandel","E.",""],["Yang","T.",""],["Yates","L. E.",""],["Yu","H. W.",""],["Zeller","G. P.",""],["Zennamo","J.",""],["Zhang","C.",""]]}
{"id":"2308.03925","submitter":"Felipe Gon\\c{c}alves","authors":"Felipe Gon\\c{c}alves and Guilherme Vedana","title":"Sphere Packings in Euclidean Space with Forbidden Distances","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CA math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the sphere packing problem in Euclidean space, where\nwe impose additional constraints on the separations of the center points. We\nprove that any sphere packing in dimension $48$, with spheres of radii $r$,\nsuch that \\emph{no} two centers $x_1$ and $x_2$ satisfy $\\sqrt{\\tfrac{4}{3}} <\n\\frac{1}{2r}|x_1-x_2| <\\sqrt{\\tfrac{5}{3}}$, has density less or equal than $(\n3\\pi /2)^{24}/24!$. Equality occurs if and only if the packing is given by a\n$48$-dimensional even unimodular extremal lattice. This shows that any of the\nlattices $P_{48p},P_{48q},P_{48m}$ and $P_{48n}$ are optimal for this\nconstrained packing problem. We also give results for packings up to dimension\n$d\\leq 1200$, where we impose constraints on the distance between centers and\non the minimal norm of the spectrum, and show that even unimodular extremal\nlattices are again uniquely optimal. Moreover, in the $1$-dimensional case, we\ngive a condition on the set of constraints that allow the existence of an\noptimal periodic packing, and we develop an algorithm to find them by relating\nthe problem to a question about linear domino tilings.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:00:49 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 19:15:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gon\u00e7alves","Felipe",""],["Vedana","Guilherme",""]]}
{"id":"2308.03926","submitter":"Ali Kaya","authors":"Ali Kaya","title":"Big-Bang is a Boundary Condition","comments":"16 pages, Revtex 4-1","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There is a common expectation that the big-bang singularity must be resolved\nin quantum gravity but it is not clear how this can be achieved. A major\nobstacle here is the difficulty of interpreting wave-functions in quantum\ngravity. The standard quantum mechanical framework requires a notion of time\nevolution and a proper definition of an invariant inner product having a\nprobability interpretation, both of which are seemingly problematic in quantum\ngravity. We show that these two issues can actually be solved by introducing\nthe embedding coordinates as dynamical variables \\`a la Isham and Kuchar. The\nextended theory is identical to general relativity but has a larger group of\ngauge symmetries. The Wheeler-DeWitt equations describe the change of the\nwave-function from one arbitrary spacelike slice to another, however the\nconstraint algebra makes this evolution purely kinematical and furthermore\nenforces the wave-function to be constrained in the subspace of zero-energy\nstates. An inner product can also be introduced having all the necessary\nrequirements. In this formalism big-bang appears as a finite field space\nboundary on which certain boundary conditions must be imposed for mathematical\nconsistency. We explicitly illustrate this point both in the full theory and in\nthe minisuperspace approximation.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:06:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kaya","Ali",""]]}
{"id":"2308.03927","submitter":"Asma Jodeiri Akbarfam","authors":"Asma Jodeiri Akbarfam, Mahdieh Heidaripour, Hoda Maleki, Gokila Dorai,\n  Gagan Agrawal","title":"ForensiBlock: A Provenance-Driven Blockchain Framework for Data\n  Forensics and Auditability","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.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Maintaining accurate provenance records is paramount in digital forensics, as\nthey underpin evidence credibility and integrity, addressing essential aspects\nlike accountability and reproducibility. Blockchains have several properties\nthat can address these requirements. Previous systems utilized public\nblockchains, i.e., treated blockchain as a black box, and benefiting from the\nimmutability property. However, the blockchain was accessible to everyone,\ngiving rise to security concerns and moreover, efficient extraction of\nprovenance faces challenges due to the enormous scale and complexity of digital\ndata. This necessitates a tailored blockchain design for digital forensics. Our\nsolution, Forensiblock has a novel design that automates investigation steps,\nensures secure data access, traces data origins, preserves records, and\nexpedites provenance extraction. Forensiblock incorporates Role-Based Access\nControl with Staged Authorization (RBAC-SA) and a distributed Merkle root for\ncase tracking. These features support authorized resource access with an\nefficient retrieval of provenance records. Particularly, comparing two methods\nfor extracting provenance records off chain storage retrieval with Merkle root\nverification and a brute-force search the offchain method is significantly\nbetter, especially as the blockchain size and number of cases increase. We also\nfound that our distributed Merkle root creation slightly increases smart\ncontract processing time but significantly improves history access. Overall, we\nshow that Forensiblock offers secure, efficient, and reliable handling of\ndigital forensic data\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:08:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Akbarfam","Asma Jodeiri",""],["Heidaripour","Mahdieh",""],["Maleki","Hoda",""],["Dorai","Gokila",""],["Agrawal","Gagan",""]]}
{"id":"2308.03928","submitter":"Jinfeng Liu","authors":"Sandra A. Obiri and Song Bo and Bernard T. Agyeman and Benjamin\n  Decardi-Nelson and Jinfeng Liu (University of Alberta)","title":"Optimizing the switching operation in monoclonal antibody production:\n  Economic MPC and reinforcement learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Monoclonal antibodies (mAbs) have emerged as indispensable assets in\nmedicine, and are currently at the forefront of biopharmaceutical product\ndevelopment. However, the growing market demand and the substantial doses\nrequired for mAb clinical treatments necessitate significant progress in its\nlarge-scale production. Most of the processes for industrial mAb production\nrely on batch operations, which result in significant downtime. The shift\ntowards a fully continuous and integrated manufacturing process holds the\npotential to boost product yield and quality, while eliminating the extra\nexpenses associated with storing intermediate products. The integrated\ncontinuous mAb production process can be divided into the upstream and\ndownstream processes. One crucial aspect that ensures the continuity of the\nintegrated process is the switching of the capture columns, which are typically\nchromatography columns operated in a fed-batch manner downstream. Due to the\ndiscrete nature of the switching operation, advanced process control algorithms\nsuch as economic MPC (EMPC) are computationally difficult to implement. This is\nbecause an integer nonlinear program (INLP) needs to be solved online at each\nsampling time. This paper introduces two computationally-efficient approaches\nfor EMPC implementation, namely, a sigmoid function approximation approach and\na rectified linear unit (ReLU) approximation approach. It also explores the\napplication of deep reinforcement learning (DRL). These three methods are\ncompared to the traditional switching approach which is based on a 1% product\nbreakthrough rule and which involves no optimization.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:12:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Obiri","Sandra A.","","University of Alberta"],["Bo","Song","","University of Alberta"],["Agyeman","Bernard T.","","University of Alberta"],["Decardi-Nelson","Benjamin","","University of Alberta"],["Liu","Jinfeng","","University of Alberta"]]}
{"id":"2308.03929","submitter":"Ahmed Abdeen Hamed Ph.D","authors":"Ahmed Abdeen Hamed and Alessandro Crimi and Magdalena M. Misiak and\n  Byung Suk Lee","title":"Establishing Trust in ChatGPT BioMedical Generated Text: An\n  Ontology-Based Knowledge Graph to Validate Disease-Symptom Links","comments":"7 Pages, 3 algorithms, 4 tables, and 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Methods: Through an innovative approach, we construct ontology-based\nknowledge graphs from authentic medical literature and AI-generated content.\nOur goal is to distinguish factual information from unverified data. We\ncompiled two datasets: one from biomedical literature using a \"human disease\nand symptoms\" query, and another generated by ChatGPT, simulating articles.\nWith these datasets (PubMed and ChatGPT), we curated 10 sets of 250 abstracts\neach, selected randomly with a specific seed. Our method focuses on utilizing\ndisease ontology (DOID) and symptom ontology (SYMP) to build knowledge graphs,\nrobust mathematical models that facilitate unbiased comparisons. By employing\nour fact-checking algorithms and network centrality metrics, we conducted GPT\ndisease-symptoms link analysis to quantify the accuracy of factual knowledge\namid noise, hypotheses, and significant findings.\n  Results: The findings obtained from the comparison of diverse ChatGPT\nknowledge graphs with their PubMed counterparts revealed some interesting\nobservations. While PubMed knowledge graphs exhibit a wealth of disease-symptom\nterms, it is surprising to observe that some ChatGPT graphs surpass them in the\nnumber of connections. Furthermore, some GPT graphs are demonstrating supremacy\nof the centrality scores, especially for the overlapping nodes. This striking\ncontrast indicates the untapped potential of knowledge that can be derived from\nAI-generated content, awaiting verification. Out of all the graphs, the factual\nlink ratio between any two graphs reached its peak at 60%.\n  Conclusions: An intriguing insight from our findings was the striking number\nof links among terms in the knowledge graph generated from ChatGPT datasets,\nsurpassing some of those in its PubMed counterpart. This early discovery has\nprompted further investigation using universal network metrics to unveil the\nnew knowledge the links may hold.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:13:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hamed","Ahmed Abdeen",""],["Crimi","Alessandro",""],["Misiak","Magdalena M.",""],["Lee","Byung Suk",""]]}
{"id":"2308.03930","submitter":"Thomas Gillis","authors":"Thomas Gillis, Ken Raffenetti, Hui Zhou, Yanfei Guo, Rajeev Thakur","title":"Quantifying the Performance Benefits of Partitioned Communication in MPI","comments":null,"journal-ref":null,"doi":"10.1145/3605573.3605599","report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Partitioned communication was introduced in MPI 4.0 as a user-friendly\ninterface to support pipelined communication patterns, particularly common in\nthe context of MPI+threads. It provides the user with the ability to divide a\nglobal buffer into smaller independent chunks, called partitions, which can\nthen be communicated independently. In this work we first model the performance\ngain that can be expected when using partitioned communication. Next, we\ndescribe the improvements we made to \\mpich{} to enable those gains and provide\na high-quality implementation of MPI partitioned communication. We then\nevaluate partitioned communication in various common use cases and assess the\nperformance in comparison with other MPI point-to-point and one-sided\napproaches. Specifically, we first investigate two scenarios commonly\nencountered for small partition sizes in a multithreaded environment: thread\ncontention and overhead of using many partitions. We propose two solutions to\nalleviate the measured penalty and demonstrate their use. We then focus on\nlarge messages and the gain obtained when exploiting the delay resulting from\ncomputations or load imbalance. We conclude with our perspectives on the\nbenefits of partitioned communication and the various results obtained.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:15:55 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 20:19:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gillis","Thomas",""],["Raffenetti","Ken",""],["Zhou","Hui",""],["Guo","Yanfei",""],["Thakur","Rajeev",""]]}
{"id":"2308.03931","submitter":"Haitham El-Hussieny","authors":"Hend Abdelaziz, Ayman Nada, Hiroyuki Ishii, Haitham El-Hussieny","title":"State Estimation of Continuum Robots: A Nonlinear Constrained Moving\n  Horizon Approach","comments":"This work has been accepted in SICE Japan 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Continuum robots, made from flexible materials with continuous backbones,\nhave several advantages over traditional rigid robots. Some of them are the\nability to navigate through narrow or confined spaces, adapt to irregular or\nchanging environments, and perform tasks in proximity to humans. However, one\nof the challenges in using continuum robots is the difficulty in accurately\nestimating their state, such as their tip position and curvature. This is due\nto the complexity of their kinematics and the inherent uncertainty in their\nmeasurement and control. This paper proposes a moving horizon estimation (MHE)\napproach for estimating the robot's state, including its tip position and shape\nparameters. Our approach involves minimizing the error between measurement\nsamples from an IMU attached to the robot's tip and the estimated state along\nthe estimation horizon using an inline optimization problem. We demonstrate the\neffectiveness of our approach through simulation and experimental results. Our\napproach can potentially improve the accuracy and robustness of state\nestimation and control for continuum robots. It can be applied to various\napplications such as surgery, manufacturing, and inspection.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:19:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Abdelaziz","Hend",""],["Nada","Ayman",""],["Ishii","Hiroyuki",""],["El-Hussieny","Haitham",""]]}
{"id":"2308.03932","submitter":"Eitan Dvorquez","authors":"Eitan Dvorquez, Benjam\\'in Pavez, Qiang Sun, Felipe Pinto, Andrew D.\n  Greentree, Brant C. Gibson, Jer\\'onimo R. Maze","title":"Mu-Metal Enhancement of Effects in Electromagnetic Fields Over Single\n  Emitters Near Topological Insulators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We focus on the transmission and reflection coefficients of light in systems\ninvolving of topological insulators (TI). Due to the electro-magnetic coupling\nin TIs, new mixing coefficients emerge leading to new components of the\nelectromagnetic fields of propagating waves. We have discovered a simple\nheterostructure that provides a 100-fold enhancement of the mixing coefficients\nfor TI materials. Such effect increases with the TI's wave impedance. We also\npredict a transverse deviation of the Poynting vector due to these mixed\ncoefficients contributing to the radiative electromagnetic field of an electric\ndipole. Given an optimal configuration of the dipole-TI system, this deviation\ncould amount to $0.18\\%$ of the Poynting vector due to emission near not\ntopological materials, making this effect detectable.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:22:09 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 21:13:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dvorquez","Eitan",""],["Pavez","Benjam\u00edn",""],["Sun","Qiang",""],["Pinto","Felipe",""],["Greentree","Andrew D.",""],["Gibson","Brant C.",""],["Maze","Jer\u00f3nimo R.",""]]}
{"id":"2308.03933","submitter":"Satyavrat Wagle","authors":"Satyavrat Wagle, Anindya Bijoy Das, David J. Love, Christopher G.\n  Brinton","title":"A Reinforcement Learning-Based Approach to Graph Discovery in\n  D2D-Enabled Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Augmenting federated learning (FL) with direct device-to-device (D2D)\ncommunications can help improve convergence speed and reduce model bias through\nrapid local information exchange. However, data privacy concerns, device trust\nissues, and unreliable wireless channels each pose challenges to determining an\neffective yet resource efficient D2D structure. In this paper, we develop a\ndecentralized reinforcement learning (RL) methodology for D2D graph discovery\nthat promotes communication of non-sensitive yet impactful data-points over\ntrusted yet reliable links. Each device functions as an RL agent, training a\npolicy to predict the impact of incoming links. Local (device-level) and global\nrewards are coupled through message passing within and between device clusters.\nNumerical experiments confirm the advantages offered by our method in terms of\nconvergence speed and straggler resilience across several datasets and FL\nschemes.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:28:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wagle","Satyavrat",""],["Das","Anindya Bijoy",""],["Love","David J.",""],["Brinton","Christopher G.",""]]}
{"id":"2308.03934","submitter":"Nicholas Papadopoulos","authors":"Nicholas Papadopoulos, Mark Lofquist, Andrew W. Clegg, Kevin Gifford","title":"Spectrum Sharing Dynamic Protection Area Neighborhoods for Radio\n  Astronomy","comments":"6 pages, 5 figures, 5 tables, published to WCNC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To enforce incumbent protection through a spectrum access system (SAS) or\nfuture centralized shared spectrum system, dynamic protection area (DPA)\nneighborhood distances are employed. These distances are distance radii, in\nwhich citizen broadband radio service devices (CBSDs) are considered as\npotential interferers for the incumbent spectrum users. The goal of this paper\nis to create an algorithm to define DPA neighborhood distances for radio\nastronomy (RA) facilities with the intent to incorporate those distances into\nexisting SASs and to adopt for future frameworks to increase national spectrum\nsharing. This paper first describes an algorithm to calculate sufficient\nneighborhood distances. Verifying this algorithm by recalculating previously\ncalculated and currently used neighborhood distances for existing DPAs then\nproves its viability for extension to radio astronomy facilities. Applying the\nalgorithm to the Hat Creek Radio Observatory (HCRO) with customized parameters\nresults in distance recommendations, 112 kilometers for category A (devices\nwith 30 dBm/10 MHz max EIRP) and 144 kilometers for category B (devices with 47\ndBm/10MHz max EIRP), for HCRO's inclusion into a SAS and shows that the\nalgorithm can be applied to RA facilities in general. Calculating these\ndistances identifies currently used but likely out-of-date metrics and\nassumptions that should be revisited for the benefit of spectrum sharing.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:29:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Papadopoulos","Nicholas",""],["Lofquist","Mark",""],["Clegg","Andrew W.",""],["Gifford","Kevin",""]]}
{"id":"2308.03935","submitter":"Lei Xu","authors":"Lei Xu, Jutta Toscano, Stefan Willitsch","title":"Trapping and sympathetic cooling of conformationally selected molecular\n  ions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the generation, trapping and sympathetic cooling of individual\nconformers of molecular ions with the example of cis- and\ntrans-meta-aminostyrene. Following conformationally selective photoionization,\nthe incorporation of the conformers into a Coulomb crystal of laser-cooled\ncalcium ions was confirmed by fluorescence imaging, mass spectrometry and\nmolecular dynamics simulations. We deduce the molecules to be stable in the\ntrap environment for more than ten minutes. The present results pave the way\nfor the spectroscopy and controlled chemistry of distinct ionic conformers in\ntraps.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:37:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xu","Lei",""],["Toscano","Jutta",""],["Willitsch","Stefan",""]]}
{"id":"2308.03936","submitter":"Hamid Tizhoosh","authors":"Milad Sikaroudi, Maryam Hosseini, Shahryar Rahnamayan, H.R. Tizhoosh","title":"ALFA -- Leveraging All Levels of Feature Abstraction for Enhancing the\n  Generalization of Histopathology Image Classification Across Unseen Hospitals","comments":"Accepted for publication at ICCV 2023, Computer Vision for Automated\n  Medical Diagnosis Workshop","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 propose an exhaustive methodology that leverages all levels of feature\nabstraction, targeting an enhancement in the generalizability of image\nclassification to unobserved hospitals. Our approach incorporates\naugmentation-based self-supervision with common distribution shifts in\nhistopathology scenarios serving as the pretext task. This enables us to derive\ninvariant features from training images without relying on training labels,\nthereby covering different abstraction levels. Moving onto the subsequent\nabstraction level, we employ a domain alignment module to facilitate further\nextraction of invariant features across varying training hospitals. To\nrepresent the highly specific features of participating hospitals, an encoder\nis trained to classify hospital labels, independent of their diagnostic labels.\nThe features from each of these encoders are subsequently disentangled to\nminimize redundancy and segregate the features. This representation, which\nspans a broad spectrum of semantic information, enables the development of a\nmodel demonstrating increased robustness to unseen images from disparate\ndistributions. Experimental results from the PACS dataset (a domain\ngeneralization benchmark), a synthetic dataset created by applying\nhistopathology-specific jitters to the MHIST dataset (defining different\ndomains with varied distribution shifts), and a Renal Cell Carcinoma dataset\nderived from four image repositories from TCGA, collectively indicate that our\nproposed model is adept at managing varying levels of image granularity. Thus,\nit shows improved generalizability when faced with new, out-of-distribution\nhospital images.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:39:44 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 16:21:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sikaroudi","Milad",""],["Hosseini","Maryam",""],["Rahnamayan","Shahryar",""],["Tizhoosh","H. R.",""]]}
{"id":"2308.03937","submitter":"Xuanxin Hu","authors":"Xuanxin Hu, Nuohao Liu, Vrishank Jambur, Siamak Attarian, Ranran Su,\n  Hongliang Zhang, Jianqi Xi, Hubin Luo, John Perepezko, Izabela Szlufarska","title":"Amorphous shear bands in crystalline materials as drivers of plasticity","comments":null,"journal-ref":"Nature Materials (2023): 1-7","doi":"10.1038/s41563-023-01597-y","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditionally, the formation of amorphous shear bands (SBs) in crystalline\nmaterials has been undesirable, because SBs can nucleate voids and act as\nprecursors to fracture. They also form as a final stage of accumulated damage.\nOnly recently SBs were found to form in undefected crystals, where they serve\nas the primary driver of plasticity without nucleating voids. Here, we have\ndiscovered trends in materials properties that determine when amorphous shear\nbands will form and whether they will drive plasticity or lead to fracture. We\nhave identified the materials systems that exhibit SB deformation, and by\nvarying the composition, we were able to switch from ductile to brittle\nbehavior. Our findings are based on a combination of experimental\ncharacterization and atomistic simulations, and they provide a potential\nstrategy for increasing toughness of nominally brittle materials.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:43:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Xuanxin",""],["Liu","Nuohao",""],["Jambur","Vrishank",""],["Attarian","Siamak",""],["Su","Ranran",""],["Zhang","Hongliang",""],["Xi","Jianqi",""],["Luo","Hubin",""],["Perepezko","John",""],["Szlufarska","Izabela",""]]}
{"id":"2308.03938","submitter":"Donglai Ma","authors":"Donglai Ma, Xin An, Anton Artemyev, Jacob Bortnik, Vassilis\n  Angelopoulos, Xiao-Jia Zhang","title":"Nonlinear Landau resonant interaction between whistler waves and\n  electrons: Excitation of electron acoustic waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electron acoustic waves (EAWs), as well as electron-acoustic solitary\nstructures, play a crucial role in thermalization and acceleration of electron\npopulations in Earth's magnetosphere. These waves are often observed in\nassociation with whistler-mode waves, but the detailed mechanism of EAW and\nwhistler wave coupling is not yet revealed. We investigate the excitation\nmechanism of EAWs and their potential relation to whistler waves using\nparticle-in-cell simulations. Whistler waves are first excited by electrons\nwith a temperature anisotropy perpendicular to the background magnetic field.\nElectrons trapped by these whistler waves through nonlinear Landau resonance\nform localized field-aligned beams, which subsequently excite EAWs. By\ncomparing the growth rate of EAWs and the phase mixing rate of trapped electron\nbeams, we obtain the critical condition for EAW excitation, which is consistent\nwith our simulation results across a wide region in parameter space. These\nresults are expected to be useful in the interpretation of concurrent\nobservations of whistler-mode waves and nonlinear solitary structures, and may\nalso have important implications for investigation of cross-scale energy\ntransfer in the near-Earth space environment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:44:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ma","Donglai",""],["An","Xin",""],["Artemyev","Anton",""],["Bortnik","Jacob",""],["Angelopoulos","Vassilis",""],["Zhang","Xiao-Jia",""]]}
{"id":"2308.03939","submitter":"Furkan K{\\i}nl{\\i}","authors":"Furkan K{\\i}nl{\\i}, Do\\u{g}a Y{\\i}lmaz, Bar{\\i}\\c{s} \\\"Ozcan, Furkan\n  K{\\i}ra\\c{c}","title":"Deterministic Neural Illumination Mapping for Efficient Auto-White\n  Balance Correction","comments":"9 pages, 5 figures, ICCV 2023 Workshops (RCV 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Auto-white balance (AWB) correction is a critical operation in image signal\nprocessors for accurate and consistent color correction across various\nillumination scenarios. This paper presents a novel and efficient AWB\ncorrection method that achieves at least 35 times faster processing with\nequivalent or superior performance on high-resolution images for the current\nstate-of-the-art methods. Inspired by deterministic color style transfer, our\napproach introduces deterministic illumination color mapping, leveraging\nlearnable projection matrices for both canonical illumination form and\nAWB-corrected output. It involves feeding high-resolution images and\ncorresponding latent representations into a mapping module to derive a\ncanonical form, followed by another mapping module that maps the pixel values\nto those for the corrected version. This strategy is designed as\nresolution-agnostic and also enables seamless integration of any pre-trained\nAWB network as the backbone. Experimental results confirm the effectiveness of\nour approach, revealing significant performance improvements and reduced time\ncomplexity compared to state-of-the-art methods. Our method provides an\nefficient deep learning-based AWB correction solution, promising real-time,\nhigh-quality color correction for digital imaging applications. Source code is\navailable at https://github.com/birdortyedi/DeNIM/\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:44:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["K\u0131nl\u0131","Furkan",""],["Y\u0131lmaz","Do\u011fa",""],["\u00d6zcan","Bar\u0131\u015f",""],["K\u0131ra\u00e7","Furkan",""]]}
{"id":"2308.03940","submitter":"Antonios Saravanos","authors":"Antonios Saravanos (1), Mathew X. Curinga (2) ((1) New York\n  University, (2) MIXI: Manhattan Institute for STEM and the Imagination,\n  Adelphi University)","title":"Simulating the Software Development Lifecycle: The Waterfall Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  (1) Background: This study employs a simulation-based approach, adapting the\nwaterfall model, to provides estimates for projects and individual phase\ncompletion times. Additionally, it pin-points potential efficiency issues\nstemming from a suboptimal resource level. It further demonstrates how one can\ngo on to identify a resource level that effectively eliminates bottlenecks and\ncurtails the idle time of resources. (2) Methods: We implement our software\ndevelopment lifecycle using SimPy, a discrete-event simulation framework\nwritten in Python. Our model is executed on 100 projects of varying sizes over\nthree stages. The first, pre-optimization, provides insight based on the\ninitial set of resources. This is followed by the optimization stage, which\nserves to identify the optimal number of resources to eliminate bottlenecks and\nminimize idle time. The third stage, post-optimization, evaluates the resource\noptimized model. (3) Results: The analysis of the simulation-generated data\nreveals the presence of resource bottlenecks during the pre-optimization stage,\nparticularly in the implementation phase. These dissipate after optimization.\n(4) Conclusions: The findings emphasize the advantage of using simulation as a\nsafe and effective way to experiment and plan for software development\nprojects. Such simulations also allow those man-aging software development\nprojects to make accurate, evidence-based projections as to phase and project\ncompletion times and identify optimal resource levels and their interplay. In\nparticular, understanding the tradeoffs between experiencing delayed completion\ntimes and procuring additional resources to alleviate any bottlenecks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:44:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Saravanos","Antonios",""],["Curinga","Mathew X.",""]]}
{"id":"2308.03941","submitter":"Sergei Yurchenko N","authors":"Alec Owens, Sam O. M. Wright, Yakiv Pavlenko, Alexander\n  Mitrushchenkov, Jacek Koput, Sergei N. Yurchenko and Jonathan Tennyson","title":"ExoMol line lists -- LI. Molecular line list for lithium hydroxide\n  (LiOH)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new molecular line list for lithium hydroxide ($^{7}$Li$^{16}$O$^{1}$H)\ncovering wavelengths $\\lambda > 1 \\mu$m (the 0-10000 cm$^{-1}$ range) is\npresented. The OYT7 line list contains over 331 million transitions between\nrotation-vibration energy levels with total angular momentum up to $J=95$ and\nis applicable for temperatures up to $T\\approx 3500$ K. Line list calculations\nare based on a previously published, high-level \\textit{ab initio} potential\nenergy surface and a newly computed dipole moment surface of the ground\n$\\tilde{X}\\,^1\\Sigma^+$ electronic state. Lithium-containing molecules are\nimportant in a variety of stellar objects and there is potential for LiOH to be\nobserved in the atmospheres of exoplanets. This work provides the first,\ncomprehensive line list of LiOH and will facilitate its future molecular\ndetection. The OYT7 line list along with the associated temperature- and\npressure-dependent opacities can be downloaded from the ExoMol database at\nwww.exomol.com and the CDS astronomical database.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 22:51:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Owens","Alec",""],["Wright","Sam O. M.",""],["Pavlenko","Yakiv",""],["Mitrushchenkov","Alexander",""],["Koput","Jacek",""],["Yurchenko","Sergei N.",""],["Tennyson","Jonathan",""]]}
{"id":"2308.03942","submitter":"Mickael Lallouche","authors":"Mickael Lallouche","title":"Internal Reshetikhin-Turaev TQFT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.AT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A 3-dimensional topological quantum field theory (TQFT) is a symmetric\nmonoidal functor from the category of 3-cobordisms to the category of vector\nspaces. Such TQFTs provide in particular numerical invariants of closed\n3-manifolds such as the Reshetikhin-Turaev invariants and representations of\nthe mapping class group of closed surfaces. In 1994, using a modular category,\nTuraev explains how to construct a TQFT. In this article, we describe a\ngeneralization of this construction starting from a ribbon category\n$\\mathcal{C}$ with coend. We present a cobordism by a special kind of tangle\nand we associate to the latter a morphism defined between tensorial products of\nthe coend as described by Lyubashenko in 1994. Composing with an\n\\emph{admissible} color and using extension of Kirby calculus on 3-cobordisms,\nthis morphism gives rise to an \\emph{internal} TQFT which takes values in the\nsymmetric monoidal subcategory of transparent objects of $\\mathcal{C}$. When\nthe category $\\mathcal{C}$ is modular, this subcategory is equivalent to the\ncategory of vector spaces. When the category $\\mathcal{C}$ is premodular and\nnormalizable with invertible dimension, our TQFT is a lift of Turaev's one\nassociated to the modularization of $\\mathcal{C}$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:07:03 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:25:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lallouche","Mickael",""]]}
{"id":"2308.03943","submitter":"Gray Reid","authors":"Gray D. Reid, Matthew W. Choptuik","title":"Universality in the Critical Collapse of the Einstein-Maxwell System","comments":"15 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on critical phenomena in the gravitational collapse of the\nelectromagnetic field in axisymmetry using cylindrical coordinates. We perform\ndetailed numerical simulations of four families of dipole and quadrupole\ninitial data fine-tuned to the onset of black hole formation. It has been\npreviously observed that families which bifurcate into two on-axis critical\nsolutions exhibit distinct growth characteristics from those which collapse at\nthe centre of symmetry. In contrast, our results indicate similar growth\ncharacteristics and periodicity across all families of initial data, including\nthose examined in earlier works. More precisely, for all families investigated,\nwe observe power-law scaling for the maximum of the electromagnetic field\ninvariant ($\\mathrm{max}|F_{\\mu\\nu}F^{\\mu\\nu}| \\sim |p-p^{\\star}|^{-2\\gamma}$)\nwith $\\gamma \\approx 0.149(9)$. We find evidence of approximate discrete\nself-similarity in near-critical time evolutions with a log-scale echoing\nperiod of $\\Delta \\approx 0.62(8)$ across all families of initial data. Our\nmethodology, while reproducing the results of prior studies up to a point,\nprovides new insights into the later stages of critical searches and we propose\na mechanism to explain the observed differences between our work and the\nprevious calculations.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:16:36 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 01:54:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Reid","Gray D.",""],["Choptuik","Matthew W.",""]]}
{"id":"2308.03944","submitter":"Ahmed Agiza","authors":"Ahmed Agiza, Rajarshi Roy, Teodor Dumitru Ene, Saad Godil, Sherief\n  Reda, Bryan Catanzaro","title":"GraPhSyM: Graph Physical Synthesis Model","comments":"Accepted at ICCAD'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we introduce GraPhSyM, a Graph Attention Network (GATv2) model\nfor fast and accurate estimation of post-physical synthesis circuit delay and\narea metrics from pre-physical synthesis circuit netlists. Once trained,\nGraPhSyM provides accurate visibility of final design metrics to early EDA\nstages, such as logic synthesis, without running the slow physical synthesis\nflow, enabling global co-optimization across stages. Additionally, the swift\nand precise feedback provided by GraPhSym is instrumental for\nmachine-learning-based EDA optimization frameworks. Given a gate-level netlist\nof a circuit represented as a graph, GraPhSyM utilizes graph structure,\nconnectivity, and electrical property features to predict the impact of\nphysical synthesis transformations such as buffer insertion and gate sizing.\nWhen trained on a dataset of 6000 prefix adder designs synthesized at an\naggressive delay target, GraPhSyM can accurately predict the post-synthesis\ndelay (98.3%) and area (96.1%) metrics of unseen adders with a fast 0.22s\ninference time. Furthermore, we illustrate the compositionality of GraPhSyM by\nemploying the model trained on a fixed delay target to accurately anticipate\npost-synthesis metrics at a variety of unseen delay targets. Lastly, we report\npromising generalization capabilities of the GraPhSyM model when it is\nevaluated on circuits different from the adders it was exclusively trained on.\nThe results show the potential for GraPhSyM to serve as a powerful tool for\nadvanced optimization techniques and as an oracle for EDA machine learning\nframeworks.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:19:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Agiza","Ahmed",""],["Roy","Rajarshi",""],["Ene","Teodor Dumitru",""],["Godil","Saad",""],["Reda","Sherief",""],["Catanzaro","Bryan",""]]}
{"id":"2308.03945","submitter":"Yulan Gao","authors":"Yulan Gao, Zhaoxiang Hou, Chengyi Yang, Zengxiang Li, Han Yu","title":"The Prospect of Enhancing Large-Scale Heterogeneous Federated Learning\n  with Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) addresses data privacy concerns by enabling\ncollaborative training of AI models across distributed data owners. Wide\nadoption of FL faces the fundamental challenges of data heterogeneity and the\nlarge scale of data owners involved. In this paper, we investigate the prospect\nof Transformer-based FL models for achieving generalization and personalization\nin this setting. We conduct extensive comparative experiments involving FL with\nTransformers, ResNet, and personalized ResNet-based FL approaches under various\nscenarios. These experiments consider varying numbers of data owners to\ndemonstrate Transformers' advantages over deep neural networks in large-scale\nheterogeneous FL tasks. In addition, we analyze the superior performance of\nTransformers by comparing the Centered Kernel Alignment (CKA) representation\nsimilarity across different layers and FL models to gain insight into the\nreasons behind their promising capabilities.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:27:20 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 11:17:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Yulan",""],["Hou","Zhaoxiang",""],["Yang","Chengyi",""],["Li","Zengxiang",""],["Yu","Han",""]]}
{"id":"2308.03946","submitter":"Rong Li","authors":"Rong Li, Qingzhao Zhang, Shuangge Ma","title":"Regulation-incorporated Gene Expression Network-based Heterogeneity\n  Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gene expression-based heterogeneity analysis has been extensively conducted.\nIn recent studies, it has been shown that network-based analysis, which takes a\nsystem perspective and accommodates the interconnections among genes, can be\nmore informative than that based on simpler statistics. Gene expressions are\nhighly regulated. Incorporating regulations in analysis can better delineate\nthe \"sources\" of gene expression effects. Although conditional network analysis\ncan somewhat serve this purpose, it does render enough attention to the\nregulation relationships. In this article, significantly advancing from the\nexisting heterogeneity analyses based only on gene expression networks,\nconditional gene expression network analyses, and regression-based\nheterogeneity analyses, we propose heterogeneity analysis based on gene\nexpression networks (after accounting for or \"removing\" regulation effects) as\nwell as regulations of gene expressions. A high-dimensional penalized fusion\napproach is proposed, which can determine the number of sample groups and\nparameter values in a single step. An effective computational algorithm is\nproposed. It is rigorously proved that the proposed approach enjoys the\nestimation, selection, and grouping consistency properties. Extensive\nsimulations demonstrate its practical superiority over closely related\nalternatives. In the analysis of two breast cancer datasets, the proposed\napproach identifies heterogeneity and gene network structures different from\nthe alternatives and with sound biological implications.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:27:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Rong",""],["Zhang","Qingzhao",""],["Ma","Shuangge",""]]}
{"id":"2308.03947","submitter":"Ali \\\"Ovg\\\"un Dr.","authors":"\\.Ilim \\.Irfan \\c{C}imdiker, Ali \\\"Ovg\\\"un and Durmu\\c{s} Demir","title":"Thin accretion disk images of the black hole in symmergent gravity","comments":"30 pages. Accepted for publication in Classical and Quantum Gravity,\n  \"Special Issue: Focus on Quantum Gravity Phenomenology in the Multi-Messenger\n  Era: Challenges and Perspectives\"\n  (https://iopscience.iop.org/article/10.1088/1361-6382/aceb45). arXiv admin\n  note: text overlap with arXiv:1901.05762, arXiv:2002.00589 by other authors","journal-ref":"Class. Quantum Grav. 40 (2023) 184001","doi":"10.1088/1361-6382/aceb45","report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study circular orbits, effective potential, and\nthin-accretion disk of a black hole in symmergent gravity within the\nNovikov-Thorne model in a way including the energy flux and temperature\ndistribution. We determine bounds on symmergent gravity parameters and conclude\nthat the accretion disk could be used as an astrophysical tool to probe\nsymmergent gravity.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:28:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["\u00c7imdiker","\u0130lim \u0130rfan",""],["\u00d6vg\u00fcn","Ali",""],["Demir","Durmu\u015f",""]]}
{"id":"2308.03948","submitter":"Maciej Fidrysiak","authors":"Maciej Fidrysiak, Andrzej P. K\\k{a}dzielawa, and J\\'ozef Spa{\\l}ek","title":"High Temperature Superconductivity with Strong Correlations and\n  Disorder: Possible Relevance to Cu-doped Apatite","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 examine the properties of topological strongly correlated superconductor\nwith bond disorder on triangular lattice and demonstrate that our theoretical\n($t$-$J$-$U$) model exhibits some unique features of the Cu-doped apatite\n$\\mathrm{Pb_{10-\\mathit{x}}Cu_\\mathit{x}(PO_4)_{6}O}$. Namely, the paired state\nappears only for carrier concentration $0.8 \\lesssim n < 1$ per Cu and is\nfollowed by a close-by phase separation into the superconducting and Mott\ninsulating parts. Furthermore, a moderate amount of the bond disorder ($\\Delta\nt / t \\lesssim 20 \\%$) does not alter essentially the topology with robust\nChern number $C=2$ which diminishes beyond that limit. A room-temperature\nsuperconductivity is attainable only for the exchange to hopping ratio $J/|t|\n\\ge 1$ if one takes the bare bandwidth suggested by current DFT calculations.\nThe admixture of $s$-wave pairing component is induced by the disorder. The\nresults have been obtained within statistically consistent variational\napproximation (SGA).\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:29:54 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 11:24:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fidrysiak","Maciej",""],["K\u0105dzielawa","Andrzej P.",""],["Spa\u0142ek","J\u00f3zef",""]]}
{"id":"2308.03949","submitter":"Ark Modi","authors":"Alonso Viladomat Jasso, Ark Modi, Roberto Ferrara, Christian Deppe,\n  Janis Noetzel, Fred Fung, Maximilian Schaedler","title":"Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour\n  Clustering","comments":"Submitted to Entropy","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nearest-neighbour clustering is a simple yet powerful machine learning\nalgorithm that finds natural application in the decoding of signals in\nclassical optical fibre communication systems. Quantum nearest-neighbour\nclustering promises a speed-up over the classical algorithms, but the current\nembedding of classical data introduces inaccuracies, insurmountable slowdowns,\nor undesired effects. This work proposes the generalised inverse stereographic\nprojection into the Bloch sphere as an encoding for quantum distance estimation\nin k nearest-neighbour clustering, develops an analogous classical counterpart,\nand benchmarks its accuracy, runtime and convergence. Our proposed algorithm\nprovides an improvement in both the accuracy and the convergence rate of the\nalgorithm. We detail an experimental optic fibre setup as well, from which we\ncollect 64-Quadrature Amplitude Modulation data. This is the dataset upon which\nthe algorithms are benchmarked. Through experiments, we demonstrate the\nnumerous benefits and practicality of using the `quantum-inspired'\nstereographic k nearest-neighbour for clustering real-world optical-fibre data.\nThis work also proves that one can achieve a greater advantage by optimising\nthe radius of the inverse stereographic projection.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:35:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jasso","Alonso Viladomat",""],["Modi","Ark",""],["Ferrara","Roberto",""],["Deppe","Christian",""],["Noetzel","Janis",""],["Fung","Fred",""],["Schaedler","Maximilian",""]]}
{"id":"2308.03950","submitter":"Yujie Zhou","authors":"Yujie Zhou, Wenwen Qiang, Anyi Rao, Ning Lin, Bing Su, Jiaqi Wang","title":"Zero-shot Skeleton-based Action Recognition via Mutual Information\n  Estimation and Maximization","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zero-shot skeleton-based action recognition aims to recognize actions of\nunseen categories after training on data of seen categories. The key is to\nbuild the connection between visual and semantic space from seen to unseen\nclasses. Previous studies have primarily focused on encoding sequences into a\nsingular feature vector, with subsequent mapping the features to an identical\nanchor point within the embedded space. Their performance is hindered by 1) the\nignorance of the global visual/semantic distribution alignment, which results\nin a limitation to capture the true interdependence between the two spaces. 2)\nthe negligence of temporal information since the frame-wise features with rich\naction clues are directly pooled into a single feature vector. We propose a new\nzero-shot skeleton-based action recognition method via mutual information (MI)\nestimation and maximization. Specifically, 1) we maximize the MI between visual\nand semantic space for distribution alignment; 2) we leverage the temporal\ninformation for estimating the MI by encouraging MI to increase as more frames\nare observed. Extensive experiments on three large-scale skeleton action\ndatasets confirm the effectiveness of our method. Code:\nhttps://github.com/YujieOuO/SMIE.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:41:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhou","Yujie",""],["Qiang","Wenwen",""],["Rao","Anyi",""],["Lin","Ning",""],["Su","Bing",""],["Wang","Jiaqi",""]]}
{"id":"2308.03951","submitter":"Anand Gnanadesikan","authors":"Anand Gnanadesikan, Gianluca Fabiani, Jingwen Liu, Renske Gelderloos,\n  G. Jay Brett, Yannis Kevrekidis, Thomas Haine, Marie-Aude Pradal,\n  Constantinos Siettos and Jennifer Sleeman","title":"Tipping points in overturning circulation mediated by ocean mixing and\n  the configuration and magnitude of the hydrological cycle: A simple model","comments":"38 pages, 10 figures, Submitted to Journal of Physical Oceanography","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The current configuration of the ocean overturning involves upwelling\npredominantly in the Southern Ocean and sinking predominantly in the Atlantic\nbasin. The reasons for this remain unclear, as both models and paleoclimatic\nobservations suggest that sinking can sometimes occur in the Pacific. We\npresent a six-box model of the overturning in which temperature, salinity and\nlow-latitude pycnocline depths are allowed to vary prognostically in both the\nAtlantic and Pacific. The overturning is driven by temperature, winds, and\nmixing and modulated by the hydrological cycle. In each basin there are three\npossible flow regimes, depending on whether low-latitude water flowing into\nnorthern surface boxes is transformed into dense deep water, somewhat lighter\nintermediate water, or light water that is returned at the surface. The\nresulting model combines insights from a number of previous studies and allows\nfor nine possible global flow regimes. For the modern ocean, we find that\nalthough the interbasin atmospheric freshwater flux suppresses Pacific sinking,\nthe equator-to-pole flux enhances it. When atmospheric temperatures are held\nfixed, seven possible flow regimes can be accessed by changing the amplitude\nand configuration of the modern hydrological cycle . North Pacific overturning\ncan strengthen with either increases or decreases in the hydrological cycle, as\nwell as under reversal of the interbasin freshwater flux. Tipping-point\nbehavior of both transient and equilibrium states is modulated by parameters\nsuch as the poorly constrained lateral diffusive mixing. If hydrological cycle\namplitude is varied consistently with global temperature, northern polar\namplification is necessary for the Atlantic overturning to collapse\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:43:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gnanadesikan","Anand",""],["Fabiani","Gianluca",""],["Liu","Jingwen",""],["Gelderloos","Renske",""],["Brett","G. Jay",""],["Kevrekidis","Yannis",""],["Haine","Thomas",""],["Pradal","Marie-Aude",""],["Siettos","Constantinos",""],["Sleeman","Jennifer",""]]}
{"id":"2308.03952","submitter":"Leuson Da Silva","authors":"Alexandre Verdet, Mohammad Hamdaqa, Leuson Da Silva, Foutse Khomh","title":"Exploring Security Practices in Infrastructure as Code: An Empirical\n  Study","comments":"50 pages, 13 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloud computing has become popular thanks to the widespread use of\nInfrastructure as Code (IaC) tools, allowing the community to conveniently\nmanage and configure cloud infrastructure using scripts. However, the scripting\nprocess itself does not automatically prevent practitioners from introducing\nmisconfigurations, vulnerabilities, or privacy risks. As a result, ensuring\nsecurity relies on practitioners understanding and the adoption of explicit\npolicies, guidelines, or best practices. In order to understand how\npractitioners deal with this problem, in this work, we perform an empirical\nstudy analyzing the adoption of IaC scripted security best practices. First, we\nselect and categorize widely recognized Terraform security practices\npromulgated in the industry for popular cloud providers such as AWS, Azure, and\nGoogle Cloud. Next, we assess the adoption of these practices by each cloud\nprovider, analyzing a sample of 812 open-source projects hosted on GitHub. For\nthat, we scan each project configuration files, looking for policy\nimplementation through static analysis (checkov). Additionally, we investigate\nGitHub measures that might be correlated with adopting these best practices.\nThe category Access policy emerges as the most widely adopted in all providers,\nwhile Encryption in rest are the most neglected policies. Regarding GitHub\nmeasures correlated with best practice adoption, we observe a positive, strong\ncorrelation between a repository number of stars and adopting practices in its\ncloud infrastructure. Based on our findings, we provide guidelines for cloud\npractitioners to limit infrastructure vulnerability and discuss further aspects\nassociated with policies that have yet to be extensively embraced within the\nindustry.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:43:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Verdet","Alexandre",""],["Hamdaqa","Mohammad",""],["Da Silva","Leuson",""],["Khomh","Foutse",""]]}
{"id":"2308.03953","submitter":"Yang Li","authors":"Yang Li, Shitu Zhang, Yuanzheng Li, Jiting Cao, Shuyue Jia","title":"PMU measurements based short-term voltage stability assessment of power\n  systems via deep transfer learning","comments":"Accepted by IEEE Transactions on Instrumentation & Measurement","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":"  Deep learning has emerged as an effective solution for addressing the\nchallenges of short-term voltage stability assessment (STVSA) in power systems.\nHowever, existing deep learning-based STVSA approaches face limitations in\nadapting to topological changes, sample labeling, and handling small datasets.\nTo overcome these challenges, this paper proposes a novel phasor measurement\nunit (PMU) measurements-based STVSA method by using deep transfer learning. The\nmethod leverages the real-time dynamic information captured by PMUs to create\nan initial dataset. It employs temporal ensembling for sample labeling and\nutilizes least squares generative adversarial networks (LSGAN) for data\naugmentation, enabling effective deep learning on small-scale datasets.\nAdditionally, the method enhances adaptability to topological changes by\nexploring connections between different faults. Experimental results on the\nIEEE 39-bus test system demonstrate that the proposed method improves model\nevaluation accuracy by approximately 20% through transfer learning, exhibiting\nstrong adaptability to topological changes. Leveraging the self-attention\nmechanism of the Transformer model, this approach offers significant advantages\nover shallow learning methods and other deep learning-based approaches.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:44:35 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 11:27:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Yang",""],["Zhang","Shitu",""],["Li","Yuanzheng",""],["Cao","Jiting",""],["Jia","Shuyue",""]]}
{"id":"2308.03954","submitter":"Juan B. P\\'erez-S\\'anchez","authors":"Juan B. P\\'erez-S\\'anchez, Federico Mellini, Noel C. Giebink, Joel\n  Yuen-Zhou","title":"Frequency-dependent photoreactivity in disordered molecular polaritons","comments":"12 pages, 12 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":"  We present a powerful formalism (d-CUT-E) to simulate the ultrafast quantum\ndynamics of molecular polaritons in the collective strong coupling regime,\nwhere a disordered ensemble of $N\\gg10^{6}$ molecules couples to a cavity mode.\nNotably, we can capture this dynamics with a cavity hosting a single\n$\\textit{effective}$ molecule with $\\sim N_{bins}$ electronic states, where\n$N_{bins}\\ll N$ is the number of bins discretizing the disorder distribution.\nUsing d-CUT-E we conclude that strong coupling, as evaluated from linear\noptical spectra, can be a poor proxy for polariton chemistry. For highly\ndisordered ensembles, total reaction yield upon broadband excitation is\nidentical to that outside of the cavity, while narrowband excitation produces\ndistinct reaction yields solely due to differences in the initially states\nprepared prior to the reaction.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:45:14 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 23:58:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["P\u00e9rez-S\u00e1nchez","Juan B.",""],["Mellini","Federico",""],["Giebink","Noel C.",""],["Yuen-Zhou","Joel",""]]}
{"id":"2308.03955","submitter":"Sumeet Kulkarni","authors":"Sumeet Kulkarni, Surendra Padamata, Anuradha Gupta, David Radice,\n  Rahul Kashyap","title":"Numerical Relativity Estimates of the Remnant Recoil Velocity in Binary\n  Neutron Star Mergers","comments":"14 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present, for the first time, recoil velocity estimates for binary neutron\nstar mergers using data from numerical relativity simulations. We find that\nbinary neutron star merger remnants can have recoil velocity of the order of a\nfew tens of km/s and as high as $150$ km/s in our dataset. These recoils are\nattained due to equivalent contributions from the anisotropic gravitational\nwave emission as well as the asymmetric ejection of dynamical matter during the\nmerger. We provide fits for net recoil velocity as well as its ejecta component\nas a function of the amount of ejected matter, which may be useful when\nconstraints on the ejected matter are obtained through electromagnetic\nobservations. We also estimate the mass and spin of the remnants and find them\nto be in the range $[2.34, 3.38] M_{\\odot}$ and $[0.63, 0.82]$ respectively,\nfor our dataset.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:46:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kulkarni","Sumeet",""],["Padamata","Surendra",""],["Gupta","Anuradha",""],["Radice","David",""],["Kashyap","Rahul",""]]}
{"id":"2308.03956","submitter":"Muhammad Shah","authors":"Muhammad Ahmed Shah and Bhiksha Raj","title":"Fixed Inter-Neuron Covariability Induces Adversarial Robustness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The vulnerability to adversarial perturbations is a major flaw of Deep Neural\nNetworks (DNNs) that raises question about their reliability when in real-world\nscenarios. On the other hand, human perception, which DNNs are supposed to\nemulate, is highly robust to such perturbations, indicating that there may be\ncertain features of the human perception that make it robust but are not\nrepresented in the current class of DNNs. One such feature is that the activity\nof biological neurons is correlated and the structure of this correlation tends\nto be rather rigid over long spans of times, even if it hampers performance and\nlearning. We hypothesize that integrating such constraints on the activations\nof a DNN would improve its adversarial robustness, and, to test this\nhypothesis, we have developed the Self-Consistent Activation (SCA) layer, which\ncomprises of neurons whose activations are consistent with each other, as they\nconform to a fixed, but learned, covariability pattern. When evaluated on image\nand sound recognition tasks, the models with a SCA layer achieved high\naccuracy, and exhibited significantly greater robustness than multi-layer\nperceptron models to state-of-the-art Auto-PGD adversarial attacks\n\\textit{without being trained on adversarially perturbed data\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:46:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shah","Muhammad Ahmed",""],["Raj","Bhiksha",""]]}
{"id":"2308.03957","submitter":"Sim\\~ao Jo\\~ao","authors":"S. M. Jo\\~ao, Hanwen Jin, Johannes Lischner","title":"Atomistic theory of hot carrier relaxation in large plasmonic\n  nanoparticles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, there has been significant interest in harnessing hot carriers\ngenerated from the decay of localized surface plasmons in metallic\nnanoparticles for applications in photocatalysis, photovoltaics and sensing. In\nthis work, we present an atomistic approach to predict the population of hot\ncarriers under continuous wave illumination in large nanoparticles. For this,\nwe solve the equation of motion of the density matrix taking into account both\nexcitation of hot carriers as well as subsequent relaxation effects. We present\nresults for spherical Au and Ag nanoparticles with up to $250,000$ atoms. We\nfind that the population of highly energetic carriers depends both on the\nmaterial and the nanoparticle size. We also study the increase in the\nelectronic temperature upon illumination and find that Ag nanoparticles exhibit\na much larger temperature increase than Au nanoparticles. Finally, we\ninvestigate the effect of using different models for the relaxation matrix but\nfind that qualitative features of the hot-carrier population are robust.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:48:31 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jo\u00e3o","S. M.",""],["Jin","Hanwen",""],["Lischner","Johannes",""]]}
{"id":"2308.03958","submitter":"Jerry Wei","authors":"Jerry Wei and Da Huang and Yifeng Lu and Denny Zhou and Quoc V. Le","title":"Simple synthetic data reduces sycophancy in large language models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sycophancy is an undesirable behavior where models tailor their responses to\nfollow a human user's view even when that view is not objectively correct\n(e.g., adapting liberal views once a user reveals that they are liberal). In\nthis paper, we study the prevalence of sycophancy in language models and\npropose a simple synthetic-data intervention to reduce this behavior.\n  First, on a set of three sycophancy tasks (Perez et al., 2022) where models\nare asked for an opinion on statements with no correct answers (e.g.,\npolitics), we observe that both model scaling and instruction tuning\nsignificantly increase sycophancy for PaLM models up to 540B parameters.\nSecond, we extend sycophancy evaluations to simple addition statements that are\nobjectively incorrect, finding that despite knowing that these statements are\nwrong, language models will still agree with them if the user does as well.\n  To reduce sycophancy, we present a straightforward synthetic-data\nintervention that takes public NLP tasks and encourages models to be robust to\nuser opinions on these tasks. Adding these data in a lightweight finetuning\nstep can significantly reduce sycophantic behavior on held-out prompts. Code\nfor generating synthetic data for intervention can be found at\nhttps://github.com/google/sycophancy-intervention.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:48:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wei","Jerry",""],["Huang","Da",""],["Lu","Yifeng",""],["Zhou","Denny",""],["Le","Quoc V.",""]]}
{"id":"2308.03959","submitter":"A. A. Natale","authors":"A. A. Natale","title":"A natural QCD infrared cutoff","comments":"10 pages, 3 figures, to appear in the Festschrift for Ruben\n  Aldrovandi","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We briefly discuss some results obtained recently about dynamical gluon mass\ngeneration. We comment that this mass provides a natural QCD infrared cutoff\nand also implies an infrared finite coupling constant. We also discuss the\nphenomenological applications of these results and how they can be treated in\nthe context of the so-called Dynamical Perturbation Theory.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:51:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Natale","A. A.",""]]}
{"id":"2308.03960","submitter":"Anjian Li","authors":"Anjian Li, Amlan Sinha, Ryne Beeson","title":"Amortized Global Search for Efficient Preliminary Trajectory Design with\n  Deep Generative Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Preliminary trajectory design is a global search problem that seeks multiple\nqualitatively different solutions to a trajectory optimization problem. Due to\nits high dimensionality and non-convexity, and the frequent adjustment of\nproblem parameters, the global search becomes computationally demanding. In\nthis paper, we exploit the clustering structure in the solutions and propose an\namortized global search (AmorGS) framework. We use deep generative models to\npredict trajectory solutions that share similar structures with previously\nsolved problems, which accelerates the global search for unseen parameter\nvalues. Our method is evaluated using De Jong's 5th function and a low-thrust\ncircular restricted three-body problem.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:52:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Anjian",""],["Sinha","Amlan",""],["Beeson","Ryne",""]]}
{"id":"2308.03961","submitter":"Nhat Minh Dao","authors":"Nhat-Minh Dao, Thai V. Hoang, Zonghua Zhang","title":"A Benchmarking Study of Matching Algorithms for Knowledge Graph Entity\n  Alignment","comments":"11 pages, 1 figure, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  How to identify those equivalent entities between knowledge graphs (KGs),\nwhich is called Entity Alignment (EA), is a long-standing challenge. So far,\nmany methods have been proposed, with recent focus on leveraging Deep Learning\nto solve this problem. However, we observe that most of the efforts has been\npaid to having better representation of entities, rather than improving entity\nmatching from the learned representations. In fact, how to efficiently infer\nthe entity pairs from this similarity matrix, which is essentially a matching\nproblem, has been largely ignored by the community. Motivated by this\nobservation, we conduct an in-depth analysis on existing algorithms that are\nparticularly designed for solving this matching problem, and propose a novel\nmatching method, named Bidirectional Matching (BMat). Our extensive\nexperimental results on public datasets indicate that there is currently no\nsingle silver bullet solution for EA. In other words, different classes of\nentity similarity estimation may require different matching algorithms to reach\nthe best EA results for each class. We finally conclude that using PARIS, the\nstate-of-the-art EA approach, with BMat gives the best combination in terms of\nEA performance and the algorithm's time and space complexity.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:03:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dao","Nhat-Minh",""],["Hoang","Thai V.",""],["Zhang","Zonghua",""]]}
{"id":"2308.03962","submitter":"Meng-Ru Wu","authors":"Tobias Fischer, Gang Guo, Karlheinz Langanke, Gabriel Martinez-Pinedo,\n  Yong-Zhong Qian, Meng-Ru Wu","title":"Neutrinos and nucleosynthesis of elements","comments":"Review paper submitted to PPNP","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neutrinos are known to play important roles in many astrophysical scenarios\nfrom the early period of the big bang to current stellar evolution being a\nunique messenger of the fusion reactions occurring in the center of our sun. In\nparticular, neutrinos are crucial in determining the dynamics and the\ncomposition evolution in explosive events such as core-collapse supernovae and\nthe merger of two neutron stars. In this paper, we review the current\nunderstanding of supernovae and binary neutron star mergers by focusing on the\nrole of neutrinos therein. Several recent improvements on the theoretical\nmodeling of neutrino interaction rates in nuclear matter as well as their\nimpact on the heavy element nucleosynthesis in the supernova neutrino-driven\nwind are discussed, including the neutrino-nucleon opacity at the mean field\nlevel taking into account the relativistic kinematics of nucleons, the effect\ndue to the nucleon-nucleon correlation, and the nucleon-nucleon bremsstrahlung.\nWe also review the framework used to compute the neutrino-nucleus interactions\nand the up-to-date yield prediction for isotopes from neutrino nucleosynthesis\noccurring in the outer envelope of the supernova progenitor star during the\nexplosion. Here improved predictions of energy spectra of supernova neutrinos\nof all flavors have had significant impact on the nucleosynthesis yields. Rapid\nprogresses in modeling the flavor oscillations of neutrinos in these\nenvironments, including several novel mechanisms for collective neutrino\noscillations and their potential impacts on various nucleosynthesis processes\nare summarized.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:03:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fischer","Tobias",""],["Guo","Gang",""],["Langanke","Karlheinz",""],["Martinez-Pinedo","Gabriel",""],["Qian","Yong-Zhong",""],["Wu","Meng-Ru",""]]}
{"id":"2308.03963","submitter":"Ming Geng","authors":"Ming Geng and Chris E. Mohn","title":"Free energy conservation in ab initio molecular dynamics simulations and\n  homogeneous melt nucleation","comments":"10 figures, 17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.comp-ph physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Z method is a popular atomistic simulation method for determining the\nmelting temperature of solids by using a sequence of molecular dynamics(MD)\nruns in the microcanonical(NVE) ensemble to target the lowest system energy\nwhere the solid always melts. Homogeneous melting at the superheating critical\nlimit($T_h$), is accompanied by a temperature drop to the equilibrium melting\ntemperature($T_m$). Implementation of the Z method interfaced with modern {\\it\nab initio} electronic structure packages use Hellman-Faynman dynamics to\npropagate the ions in the NVE ensemble with the Mermin free energy plus the\nionic kinetic energy conserved. So the electronic temperature($T_{el}$) is kept\nfixed along the trajectory which may introduce some spurious ion-electron\ninteractions in MD runs with large temperature changes. We estimate possible\nsystematic errors in evaluating melting temperature with different choices of\n$T_{el}$. MD runs with the $T_{el}$ = $T_h$ and $T_{el}$ = $T_m$ shows that the\ndifference in melting temperature can be 200-300 K (3-5\\% of the melting\ntemperature) for our two test systems. Our results are in good agreement with\nprevious studies with different methods, suggesting the CaSiO$_3$ and SiO$_2$\nmelts at around 6500 at 100 GPa and 6000 K at 160 GPa. The melting temperature\ndecreases with increasing $T_{el}$ due to the increasing entropic stabilisation\nof the liquid and the system melts about 3 times faster with $T_{el} = T_h$\nthan with $T_{el} = T_m$. A careful choice of $T_{el}$ in BOMD is essential for\nthe critical evaluation of the Z method especially at very high temperatures.\nInspection of the homogeneous melting process shows that melting occurs via a\ntwo-step mechanism: 1) melting of the anion sublattice is accompanied by a\nsmall drop in temperature and 2) the formation of small defects which trigger\nthe formation of small liquid clusters and fully melted.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:03:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Geng","Ming",""],["Mohn","Chris E.",""]]}
{"id":"2308.03964","submitter":"Will Epperson","authors":"Will Epperson, Vaishnavi Gorantla, Dominik Moritz, Adam Perer","title":"Dead or Alive: Continuous Data Profiling for Interactive Data Science","comments":"To appear at IEEE VIS conference 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Profiling data by plotting distributions and analyzing summary statistics is\na critical step throughout data analysis. Currently, this process is manual and\ntedious since analysts must write extra code to examine their data after every\ntransformation. This inefficiency may lead to data scientists profiling their\ndata infrequently, rather than after each transformation, making it easy for\nthem to miss important errors or insights. We propose continuous data profiling\nas a process that allows analysts to immediately see interactive visual\nsummaries of their data throughout their data analysis to facilitate fast and\nthorough analysis. Our system, AutoProfiler, presents three ways to support\ncontinuous data profiling: it automatically displays data distributions and\nsummary statistics to facilitate data comprehension; it is live, so\nvisualizations are always accessible and update automatically as the data\nupdates; it supports follow up analysis and documentation by authoring code for\nthe user in the notebook. In a user study with 16 participants, we evaluate two\nversions of our system that integrate different levels of automation: both\nautomatically show data profiles and facilitate code authoring, however, one\nversion updates reactively and the other updates only on demand. We find that\nboth tools facilitate insight discovery with 91% of user-generated insights\noriginating from the tools rather than manual profiling code written by users.\nParticipants found live updates intuitive and felt it helped them verify their\ntransformations while those with on-demand profiles liked the ability to look\nat past visualizations. We also present a longitudinal case study on how\nAutoProfiler helped domain scientists find serendipitous insights about their\ndata through automatic, live data profiles. Our results have implications for\nthe design of future tools that offer automated data analysis support.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:08:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Epperson","Will",""],["Gorantla","Vaishnavi",""],["Moritz","Dominik",""],["Perer","Adam",""]]}
{"id":"2308.03965","submitter":"Lilianna Hariasz Ms","authors":"L. Hariasz, P.C.F. Di Stefano, M. Stukel, B.C. Rasco, K.P.\n  Rykaczewski, N.T. Brewer, R.K. Grzywacz, E.D. Lukosi, D. W. Stracener, M.\n  Mancuso, F. Petricca, J. Ninkovic, P. Lechner (KDK Collaboration)","title":"Precision measurement of $^{65}$Zn electron-capture decays with the KDK\n  coincidence setup","comments":"Uses similar methodology to the 40K measurement by the KDK\n  Collaboration (Stukel et al PRL 2023, arXiv:2211.10319; Hariasz et al PRC\n  2023, arXiv:2211.10343), as such there may be some similarity in figures and\n  text","journal-ref":"Nuclear Data Sheets 189-224 (2023)","doi":"10.1016/j.nds.2023.04.003","report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  $^{65}$Zn is a common calibration source, moreover used as a radioactive\ntracer in medical and biological studies. In many cases, $\\gamma$-spectroscopy\nis a preferred method of $^{65}$Zn standardization, which relies directly on\nthe branching ratio of $J \\pi (^{65}\\text{Zn} ) = 5/2^- \\rightarrow J \\pi\n(^{65}\\text{Cu}) = 5/2^- $ via electron capture (EC*). We measure the relative\nintensity of this branch to that proceeding directly to the ground state\n(EC$^0$) using a novel coincidence technique, finding\n$I_{\\text{EC}^0}/I_{\\text{EC*}} = 0.9684 \\pm 0.0018$. Re-evaluating the decay\nscheme of $^{65}$Zn by adopting the commonly evaluated branching ratio of\n$I_{\\beta^+}= 1.4271(7)\\%$ we obtain $I_{\\text{EC*}} = (50.08 \\pm 0.06)\\%$, and\n$I_\\text{EC^0} = (48.50 \\pm 0.06) \\%$. The associated 1115 keV gamma intensity\nagrees with the previously reported NNDC value, and is now accessible with a\nfactor of ~2 increase in precision. Our re-evaluation removes reliance on the\ndeduction of this gamma intensity from numerous measurements, some of which\ndisagree and depend directly on total activity determination. The KDK\nexperimental technique provides a new avenue for verification or updates to the\ndecay scheme of $^{65}$Zn, and is applicable to other isotopes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:22:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hariasz","L.","","KDK Collaboration"],["Di Stefano","P. C. F.","","KDK Collaboration"],["Stukel","M.","","KDK Collaboration"],["Rasco","B. C.","","KDK Collaboration"],["Rykaczewski","K. P.","","KDK Collaboration"],["Brewer","N. T.","","KDK Collaboration"],["Grzywacz","R. K.","","KDK Collaboration"],["Lukosi","E. D.","","KDK Collaboration"],["Stracener","D. W.","","KDK Collaboration"],["Mancuso","M.","","KDK Collaboration"],["Petricca","F.","","KDK Collaboration"],["Ninkovic","J.","","KDK Collaboration"],["Lechner","P.","","KDK Collaboration"]]}
{"id":"2308.03966","submitter":"Xi Xiong","authors":"Xi Xiong, Maonan Wang, Dengfeng Sun, and Li Jin","title":"An Approximate Dynamic Programming Approach to Vehicle Platooning\n  Coordination in 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":"  Platooning connected and autonomous vehicles (CAVs) provide significant\nbenefits in terms of traffic efficiency and fuel economy. However, most\nexisting platooning systems assume the availability of pre-determined plans,\nwhich is not feasible in real-time scenarios. In this paper, we address this\nissue in time-dependent networks by formulating a Markov decision process at\neach junction, aiming to minimize travel time and fuel consumption. Initially,\nwe analyze coordinated platooning without routing to explore the cooperation\namong controllers on an identical path. We propose two novel approaches based\non approximate dynamic programming, offering suboptimal control in the context\nof a stochastic finite horizon problem. The results demonstrate the superiority\nof the approximation in the policy space. Furthermore, we investigate\nplatooning in a network setting, where speed profiles and routes are determined\nsimultaneously. To simplify the problem, we decouple the action space by\nprioritizing routing decisions based on travel time estimation. We subsequently\nemploy the aforementioned policy approximation to determine speed profiles,\nconsidering essential parameters such as travel times. Our simulation results\nin SUMO indicate that our method yields better performance than conventional\napproaches, leading to potential travel cost savings of up to 40%.\nAdditionally, we evaluate the resilience of our approach in dynamically\nchanging networks, affirming its ability to maintain efficient platooning\noperations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:26:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xiong","Xi",""],["Wang","Maonan",""],["Sun","Dengfeng",""],["Jin","Li",""]]}
{"id":"2308.03967","submitter":"David Eppstein","authors":"David Eppstein","title":"The Widths of Strict Outerconfluent Graphs","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strict outerconfluent drawing is a style of graph drawing in which vertices\nare drawn on the boundary of a disk, adjacencies are indicated by the existence\nof smooth curves through a system of tracks within the disk, and no two\nadjacent vertices are connected by more than one of these smooth tracks. We\ninvestigate graph width parameters on the graphs that have drawings in this\nstyle. We prove that the clique-width of these graphs is unbounded, but their\ntwin-width is bounded.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:34:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Eppstein","David",""]]}
{"id":"2308.03968","submitter":"Dongkyun Kim","authors":"Dongkyun Kim","title":"CheXFusion: Effective Fusion of Multi-View Features using Transformers\n  for Long-Tailed Chest X-Ray Classification","comments":null,"journal-ref":"ICCVW 2023","doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Medical image classification poses unique challenges due to the long-tailed\ndistribution of diseases, the co-occurrence of diagnostic findings, and the\nmultiple views available for each study or patient. This paper introduces our\nsolution to the ICCV CVAMD 2023 Shared Task on CXR-LT: Multi-Label Long-Tailed\nClassification on Chest X-Rays. Our approach introduces CheXFusion, a\ntransformer-based fusion module incorporating multi-view images. The fusion\nmodule, guided by self-attention and cross-attention mechanisms, efficiently\naggregates multi-view features while considering label co-occurrence.\nFurthermore, we explore data balancing and self-training methods to optimize\nthe model's performance. Our solution achieves state-of-the-art results with\n0.372 mAP in the MIMIC-CXR test set, securing 1st place in the competition. Our\nsuccess in the task underscores the significance of considering multi-view\nsettings, class imbalance, and label co-occurrence in medical image\nclassification. Public code is available at\nhttps://github.com/dongkyuk/CXR-LT-public-solution\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:46:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kim","Dongkyun",""]]}
{"id":"2308.03969","submitter":"Nissim Fraija","authors":"Nissim Fraija, Maria G. Dainotti, B. Betancourt Kamenetskaia, D.\n  Levine, A. Galvan-Gamez","title":"Closure Relations of Synchrotron Self-Compton in Afterglow stratified\n  medium and Fermi-LAT Detected Gamma-Ray Bursts","comments":"13 pages, 3 figures","journal-ref":null,"doi":"10.1093/mnras/stad2236","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Second Gamma-ray Burst Catalog (2FLGC) was announced by the Fermi Large\nArea Telescope (Fermi-LAT) Collaboration. It includes 29 bursts with photon\nenergy higher than 10 GeV. Gamma-ray burst (GRB) afterglow observations have\nbeen adequately explained by the classic synchrotron forward-shock model,\nhowever, photon energies greater than 10 GeV from these transient events are\nchallenging, if not impossible, to characterize using this afterglow model.\nRecently, the closure relations (CRs) of the synchrotron self-Compton (SSC)\nforward-shock model evolving in a stellar wind and homogeneous medium was\npresented to analyze the evolution of the spectral and temporal indexes of\nthose bursts reported in 2FLGC. In this work, we provide the CRs of the same\nafterglow model, but evolving in an intermediate density profile ($\\propto {\\rm\nr^{-k}}$) with ${\\rm 0\\leq k \\leq2.5}$, taking into account the\nadiabatic/radiative regime and with/without energy injection for any value of\nthe electron spectral index. The results show that the current model accounts\nfor a considerable subset of GRBs that cannot be interpreted in either\nstellar-wind or homogeneous afterglow SSC model. The analysis indicates that\nthe best-stratified scenario is most consistent with ${\\rm k=0.5}$ for\nno-energy injection and ${\\rm k=2.5}$ for energy injection.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 00:57:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fraija","Nissim",""],["Dainotti","Maria G.",""],["Kamenetskaia","B. Betancourt",""],["Levine","D.",""],["Galvan-Gamez","A.",""]]}
{"id":"2308.03970","submitter":"Paul Wu","authors":"Paul Pao-Yen Wu, Fabrizio Rggeri, Kerrie Mengersen","title":"Optimal partitioning of directed acyclic graphs with dependent costs\n  between clusters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Many statistical inference contexts, including Bayesian Networks (BNs),\nMarkov processes and Hidden Markov Models (HMMS) could be supported by\npartitioning (i.e.~mapping) the underlying Directed Acyclic Graph (DAG) into\nclusters. However, optimal partitioning is challenging, especially in\nstatistical inference as the cost to be optimised is dependent on both nodes\nwithin a cluster, and the mapping of clusters connected via parent and/or child\nnodes, which we call dependent clusters. We propose a novel algorithm called\nDCMAP for optimal cluster mapping with dependent clusters. Given an arbitrarily\ndefined, positive cost function based on the DAG and cluster mappings, we show\nthat DCMAP converges to find all optimal clusters, and returns near-optimal\nsolutions along the way. Empirically, we find that the algorithm is\ntime-efficient for a DBN model of a seagrass complex system using a computation\ncost function. For a 25 and 50-node DBN, the search space size was $9.91\\times\n10^9$ and $1.51\\times10^{21}$ possible cluster mappings, respectively, but\nnear-optimal solutions with 88\\% and 72\\% similarity to the optimal solution\nwere found at iterations 170 and 865, respectively. The first optimal solution\nwas found at iteration 934 $(\\text{95\\% CI } 926,971)$, and 2256 $(2150,2271)$\nwith a cost that was 4\\% and 0.2\\% of the naive heuristic cost, respectively.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:01:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wu","Paul Pao-Yen",""],["Rggeri","Fabrizio",""],["Mengersen","Kerrie",""]]}
{"id":"2308.03971","submitter":"Tomonari Mizoguchi","authors":"Tomonari Mizoguchi, Yoshihito Kuno, Yasuhiro Hatsugai","title":"Blocking particle dynamics in diamond chain with spatially increasing\n  flux","comments":"12 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.quant-gas physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spatial non-uniformity in tight-binding models serves as a source of rich\nphenomena. In this paper, we study a diamond-chain tight-binding model with a\nspatially-modulated magnetic flux at each plaquette. In the numerical studies\nwith various combinations of the minimum and maximum flux values, we find the\ncharacteristic dynamics of a particle, namely, a particle slows down when\napproaching the plaquette with $\\pi$-flux. This originates from the fact that\nthe sharply localized eigenstates exist around the $\\pi$-flux plaquette. These\nlocalized modes can be understood from a squared model of the original one.\nThis characteristic blocked dynamics will be observed in photonic waveguides or\ncold atoms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:09:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mizoguchi","Tomonari",""],["Kuno","Yoshihito",""],["Hatsugai","Yasuhiro",""]]}
{"id":"2308.03972","submitter":"Yuta Hasegawa","authors":"Yuta Hasegawa, Naoyuki Onodera, Yuuichi Asahi, Takuya Ina, Toshiyuki\n  Imamura, Yasuhiro Idomura","title":"Continuous data assimilation of large eddy simulation by lattice\n  Boltzmann method and local ensemble transform Kalman filter (LBM-LETKF)","comments":"27 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the applicability of the data assimilation (DA) to large eddy\nsimulations (LESs) based on the lattice Boltzmann method (LBM). We carry out\nthe observing system simulation experiment of a two-dimensional (2D) forced\nisotropic turbulence, and examine the DA accuracy of the nudging and the local\nensemble transform Kalman filter (LETKF) with spatially sparse and noisy\nobservation data of flow fields. The advantage of the LETKF is that it does not\nrequire computing spatial interpolation and/or an inverse problem between the\nmacroscopic variables (the density and the pressure) and the velocity\ndistribution function of the LBM, while the nudging introduces additional\nmodels for them. The numerical experiments with $256\\times256$ grids and $10\\%$\nobservation noise in the velocity showed that the root mean square error of the\nvelocity in the LETKF with $8\\times 8$ observation points ($\\sim 0.1\\%$ of the\ntotal grids) and 64 ensemble members becomes smaller than the observation\nnoise, while the nudging requires an order of magnitude larger number of\nobservation points to achieve the same accuracy. Another advantage of the LETKF\nis that it well keeps the amplitude of the energy spectrum, while only the\nphase error becomes larger with more sparse observation. We also see that a\nlack of observation data in the LETKF produces a spurious energy injection in\nhigh wavenumber regimes, leading to numerical instability. Such numerical\ninstability is known as the catastrophic filter divergence problem, which can\nbe suppressed by increasing the number of ensemble members. From these results,\nit was shown that the LETKF enables robust and accurate DA for the 2D LBM with\nsparse and noisy observation data.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:19:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hasegawa","Yuta",""],["Onodera","Naoyuki",""],["Asahi","Yuuichi",""],["Ina","Takuya",""],["Imamura","Toshiyuki",""],["Idomura","Yasuhiro",""]]}
{"id":"2308.03973","submitter":"Mohamed Ibrahim","authors":"Mohamed Assem Ibrahim, Shaizeen Aga","title":"Collaborative Acceleration for FFT on Commercial Processing-In-Memory\n  Architectures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper evaluates the efficacy of recent commercial processing-in-memory\n(PIM) solutions to accelerate fast Fourier transform (FFT), an important\nprimitive across several domains. Specifically, we observe that efficient\nimplementations of FFT on modern GPUs are memory bandwidth bound. As such, the\nmemory bandwidth boost availed by commercial PIM solutions makes a case for PIM\nto accelerate FFT. To this end, we first deduce a mapping of FFT computation to\na strawman PIM architecture representative of recent commercial designs. We\nobserve that even with careful data mapping, PIM is not effective in\naccelerating FFT. To address this, we make a case for collaborative\nacceleration of FFT with PIM and GPU. Further, we propose software and hardware\ninnovations which lower PIM operations necessary for a given FFT. Overall, our\noptimized PIM FFT mapping, termed Pimacolaba, delivers performance and data\nmovement savings of up to 1.38$\\times$ and 2.76$\\times$, respectively, over a\nrange of FFT sizes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:21:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ibrahim","Mohamed Assem",""],["Aga","Shaizeen",""]]}
{"id":"2308.03974","submitter":"Shouhei Honda","authors":"Shouhei Honda and Yuanlin Peng","title":"Sharp gradient estimate, rigidity and almost rigidity of Green functions\n  on non-parabolic $\\mathrm{RCD}(0,N)$ spaces","comments":"46 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inspired by a result of Colding, the present paper studies the Green function\n$G$ on a non-parabolic $\\mathrm{RCD}(0,N)$ space $(X, \\mathsf{d},\n\\mathfrak{m})$ for some finite $N>2$. Defining $\\mathsf{b}_x=G(x,\n\\cdot)^{\\frac{1}{2-N}}$ for a point $x \\in X$, which plays a role of a smoothed\ndistance function from $x$, we prove that the gradient $|\\nabla \\mathsf{b}_x|$\nhas the canonical pointwise representative with the sharp upper bound in terms\nof the $N$-volume density $\\nu_x=\\lim_{r\\to 0^+}\\frac{\\mathfrak{m}\n(B_r(x))}{r^N}$ of $\\mathfrak{m}$ at $x$;\n  \\begin{equation*}\n  |\\nabla \\mathsf{b}_x|(y) \\le \\left(N(N-2)\\nu_x\\right)^{\\frac{1}{N-2}}, \\quad\n\\text{for any $y \\in X \\setminus \\{x\\}$}.\n  \\end{equation*} Moreover the rigidity is obtained, namely, the upper bound is\nattained at a point $y \\in X \\setminus \\{x\\}$ if and only if the space is\nisomorphic to the $N$-metric measure cone over an $\\mathrm{RCD}(N-2, N-1)$\nspace. In the case when $x$ is an $N$-regular point, the rigidity states an\nisomorphism to the $N$-dimensional Euclidean space $\\mathbb{R}^N$, thus, this\nextends the result of Colding to $\\mathrm{RCD}(0,N)$ spaces. It is emphasized\nthat the almost rigidities are also proved, which are new even in the smooth\nframework.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:27:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Honda","Shouhei",""],["Peng","Yuanlin",""]]}
{"id":"2308.03975","submitter":"Jiahang Zhang","authors":"Jiahang Zhang, Lilang Lin, Jiaying Liu","title":"Prompted Contrast with Masked Motion Modeling: Towards Versatile 3D\n  Action Representation Learning","comments":"Accepted by ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised learning has proved effective for skeleton-based human action\nunderstanding, which is an important yet challenging topic. Previous works\nmainly rely on contrastive learning or masked motion modeling paradigm to model\nthe skeleton relations. However, the sequence-level and joint-level\nrepresentation learning cannot be effectively and simultaneously handled by\nthese methods. As a result, the learned representations fail to generalize to\ndifferent downstream tasks. Moreover, combining these two paradigms in a naive\nmanner leaves the synergy between them untapped and can lead to interference in\ntraining. To address these problems, we propose Prompted Contrast with Masked\nMotion Modeling, PCM$^{\\rm 3}$, for versatile 3D action representation\nlearning. Our method integrates the contrastive learning and masked prediction\ntasks in a mutually beneficial manner, which substantially boosts the\ngeneralization capacity for various downstream tasks. Specifically, masked\nprediction provides novel training views for contrastive learning, which in\nturn guides the masked prediction training with high-level semantic\ninformation. Moreover, we propose a dual-prompted multi-task pretraining\nstrategy, which further improves model representations by reducing the\ninterference caused by learning the two different pretext tasks. Extensive\nexperiments on five downstream tasks under three large-scale datasets are\nconducted, demonstrating the superior generalization capacity of PCM$^{\\rm 3}$\ncompared to the state-of-the-art works. Our project is publicly available at:\nhttps://jhang2020.github.io/Projects/PCM3/PCM3.html .\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:27:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Jiahang",""],["Lin","Lilang",""],["Liu","Jiaying",""]]}
{"id":"2308.03976","submitter":"Oleg Morzhin","authors":"Oleg Morzhin, Alexander Pechen","title":"Optimization of Time-Dependent Decoherence Rates and Coherent Control\n  for a Qutrit System","comments":"24 pages, 3 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The work considers an open qutrit system whose density matrix $\\rho(t)$\nevolution is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master\nequation with simultaneous coherent (in the Hamiltonian) and incoherent (in the\nsuperoperator of dissipation) controls. Incoherent control makes the\ndecoherence rates depending on time in a specific controlled manner and within\nclear physical mechanics. We consider the problem of maximizing the\nHilbert-Schmidt overlap between the system's final state $\\rho(T)$ and a given\ntarget state $\\rho_{\\rm target}$ and the problem of minimizing the squared\nHilbert-Schmidt distance between these states. For the both problems, we\nperform their realifications, derive the corresponding Pontryagin function,\nadjount system (with the two cases of transversality conditions in view of the\ntwo terminal objectives), and gradients of the objectives, adapt the one-,\ntwo-, three-step gradient projection methods. For the problem of maximizing the\noverlap, we also adapt the regularized first-order Krotov method. In the\nnumerical experiments, we analyze, first, the methods' operation and, second,\nthe obtained control processes, in respect to considering the environment as a\nresource via incoherent control.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:28:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Morzhin","Oleg",""],["Pechen","Alexander",""]]}
{"id":"2308.03977","submitter":"Florian Bordes","authors":"Florian Bordes, Shashank Shekhar, Mark Ibrahim, Diane Bouchacourt,\n  Pascal Vincent, Ari S. Morcos","title":"PUG: Photorealistic and Semantically Controllable Synthetic Data for\n  Representation Learning","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":"  Synthetic image datasets offer unmatched advantages for designing and\nevaluating deep neural networks: they make it possible to (i) render as many\ndata samples as needed, (ii) precisely control each scene and yield granular\nground truth labels (and captions), (iii) precisely control distribution shifts\nbetween training and testing to isolate variables of interest for sound\nexperimentation. Despite such promise, the use of synthetic image data is still\nlimited -- and often played down -- mainly due to their lack of realism. Most\nworks therefore rely on datasets of real images, which have often been scraped\nfrom public images on the internet, and may have issues with regards to\nprivacy, bias, and copyright, while offering little control over how objects\nprecisely appear. In this work, we present a path to democratize the use of\nphotorealistic synthetic data: we develop a new generation of interactive\nenvironments for representation learning research, that offer both\ncontrollability and realism. We use the Unreal Engine, a powerful game engine\nwell known in the entertainment industry, to produce PUG (Photorealistic Unreal\nGraphics) environments and datasets for representation learning. In this paper,\nwe demonstrate the potential of PUG to enable more rigorous evaluations of\nvision models.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:33:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bordes","Florian",""],["Shekhar","Shashank",""],["Ibrahim","Mark",""],["Bouchacourt","Diane",""],["Vincent","Pascal",""],["Morcos","Ari S.",""]]}
{"id":"2308.03978","submitter":"David Guevel","authors":"David Guevel and Ke Fang (for the IceCube Collaboration)","title":"Cross Correlation of IceCube Neutrinos with Tracers of Large Scale\n  Structure","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-1141","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The origin of most astrophysical neutrinos is unknown, but extragalactic\nneutrino sources may follow the spatial distribution of the large-scale\nstructure of the universe. Galaxies also follow the same large scale\ndistribution, so establishing a correlation between galaxies and IceCube\nneutrinos could help identify the origins of the diffuse neutrinos observed by\nIceCube. Following a preliminary study based on the WISE and 2MASS catalogs, we\nwill investigate an updated galaxy catalog with improved redshift measurements\nand reduced stellar contamination. Our IceCube data sample consists of\ntrack-like muon neutrinos selected from the Northern sky. The excellent angular\nresolution of track-like events and low contamination with atmospheric muons is\nnecessary for the sensitivity of the analysis. Unlike a point source stacking\nanalysis, the calculation of the cross correlation does not scale with the\nnumber of entries in the catalog, making the work tractable for catalogs with\nmillions of objects. We present the development and performance of a two-point\ncross correlation of IceCube neutrinos with a tracer of the large scale\nstructure.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:53:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Guevel","David","","for the IceCube Collaboration"],["Fang","Ke","","for the IceCube Collaboration"]]}
{"id":"2308.03979","submitter":"Risheng Liu","authors":"Zhu Liu, Jinyuan Liu, Benzhuang Zhang, Long Ma, Xin Fan, Risheng Liu","title":"PAIF: Perception-Aware Infrared-Visible Image Fusion for Attack-Tolerant\n  Semantic Segmentation","comments":"Accepted by ACM MM'2023;The source codes are available at\n  https://github.com/LiuZhu-CV/PAIF","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Infrared and visible image fusion is a powerful technique that combines\ncomplementary information from different modalities for downstream semantic\nperception tasks. Existing learning-based methods show remarkable performance,\nbut are suffering from the inherent vulnerability of adversarial attacks,\ncausing a significant decrease in accuracy. In this work, a perception-aware\nfusion framework is proposed to promote segmentation robustness in adversarial\nscenes. We first conduct systematic analyses about the components of image\nfusion, investigating the correlation with segmentation robustness under\nadversarial perturbations. Based on these analyses, we propose a harmonized\narchitecture search with a decomposition-based structure to balance standard\naccuracy and robustness. We also propose an adaptive learning strategy to\nimprove the parameter robustness of image fusion, which can learn effective\nfeature extraction under diverse adversarial perturbations. Thus, the goals of\nimage fusion (\\textit{i.e.,} extracting complementary features from source\nmodalities and defending attack) can be realized from the perspectives of\narchitectural and learning strategies. Extensive experimental results\ndemonstrate that our scheme substantially enhances the robustness, with gains\nof 15.3% mIOU of segmentation in the adversarial scene, compared with advanced\ncompetitors. The source codes are available at\nhttps://github.com/LiuZhu-CV/PAIF.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:55:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liu","Zhu",""],["Liu","Jinyuan",""],["Zhang","Benzhuang",""],["Ma","Long",""],["Fan","Xin",""],["Liu","Risheng",""]]}
{"id":"2308.03980","submitter":"Yuzhenni Wang","authors":"Yuzhenni Wang, Xingxing Yu, and Xiao-Dong Zhang","title":"A class of trees determined by their chromatic symmetric functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stanley introduced the concept of chromatic symmetric functions of graphs\nwhich extends and refines the notion of chromatic polynomials of graphs.\nStanley further conjectured that trees are determined up to isomorphism by\ntheir chromatic symmetric functions. In this paper, we study various\nrepresentations of chromatic symmetric functions. We verify Stanley's\nconjecture for the class of trees with exactly two vertices of degree at least\n3.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:57:25 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 01:14:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Yuzhenni",""],["Yu","Xingxing",""],["Zhang","Xiao-Dong",""]]}
{"id":"2308.03981","submitter":"Kaoru Sano","authors":"Masao Okazaki and Kaoru Sano","title":"Northcott numbers for generalized weighted Weil heights","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We give a generalization of weighted Weil heights. These heights generalize\nboth Weil's heights and Dobrowolski's height. We study Northcott numbers for\nour heights. Our results generalize the authors' former work on Vidaux and\nVidela's question about the Northcott number. As an application, we evaluate\nNorthcott numbers for Talamanca's spectral height on matrices.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:58:11 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:53:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Okazaki","Masao",""],["Sano","Kaoru",""]]}
{"id":"2308.03982","submitter":"Ming Nie","authors":"Ming Nie, Yujing Xue, Chunwei Wang, Chaoqiang Ye, Hang Xu, Xinge Zhu,\n  Qingqiu Huang, Michael Bi Mi, Xinchao Wang, Li Zhang","title":"PARTNER: Level up the Polar Representation for LiDAR 3D Object 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":"  Recently, polar-based representation has shown promising properties in\nperceptual tasks. In addition to Cartesian-based approaches, which separate\npoint clouds unevenly, representing point clouds as polar grids has been\nrecognized as an alternative due to (1) its advantage in robust performance\nunder different resolutions and (2) its superiority in streaming-based\napproaches. However, state-of-the-art polar-based detection methods inevitably\nsuffer from the feature distortion problem because of the non-uniform division\nof polar representation, resulting in a non-negligible performance gap compared\nto Cartesian-based approaches. To tackle this issue, we present PARTNER, a\nnovel 3D object detector in the polar coordinate. PARTNER alleviates the\ndilemma of feature distortion with global representation re-alignment and\nfacilitates the regression by introducing instance-level geometric information\ninto the detection head. Extensive experiments show overwhelming advantages in\nstreaming-based detection and different resolutions. Furthermore, our method\noutperforms the previous polar-based works with remarkable margins of 3.68% and\n9.15% on Waymo and ONCE validation set, thus achieving competitive results over\nthe state-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:59:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nie","Ming",""],["Xue","Yujing",""],["Wang","Chunwei",""],["Ye","Chaoqiang",""],["Xu","Hang",""],["Zhu","Xinge",""],["Huang","Qingqiu",""],["Mi","Michael Bi",""],["Wang","Xinchao",""],["Zhang","Li",""]]}
{"id":"2308.03983","submitter":"Yasuto Hoshi","authors":"Youyang Ng, Daisuke Miyashita, Yasuto Hoshi, Yasuhiro Morioka, Osamu\n  Torii, Tomoya Kodama, Jun Deguchi","title":"SimplyRetrieve: A Private and Lightweight Retrieval-Centric Generative\n  AI Tool","comments":"12 pages, 6 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 Model (LLM) based Generative AI systems have seen significant\nprogress in recent years. Integrating a knowledge retrieval architecture allows\nfor seamless integration of private data into publicly available Generative AI\nsystems using pre-trained LLM without requiring additional model fine-tuning.\nMoreover, Retrieval-Centric Generation (RCG) approach, a promising future\nresearch direction that explicitly separates roles of LLMs and retrievers in\ncontext interpretation and knowledge memorization, potentially leads to more\nefficient implementation. SimplyRetrieve is an open-source tool with the goal\nof providing a localized, lightweight, and user-friendly interface to these\nsophisticated advancements to the machine learning community. SimplyRetrieve\nfeatures a GUI and API based RCG platform, assisted by a Private Knowledge Base\nConstructor and a Retrieval Tuning Module. By leveraging these capabilities,\nusers can explore the potential of RCG for improving generative AI performance\nwhile maintaining privacy standards. The tool is available at\nhttps://github.com/RCGAI/SimplyRetrieve with an MIT license.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:00:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ng","Youyang",""],["Miyashita","Daisuke",""],["Hoshi","Yasuto",""],["Morioka","Yasuhiro",""],["Torii","Osamu",""],["Kodama","Tomoya",""],["Deguchi","Jun",""]]}
{"id":"2308.03984","submitter":"Junhwa Jung","authors":"Junhwa Jung","title":"Diffusive limit of Boltzmann Equation in exterior Domain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of flows over an obstacle is one of the fundamental problems in\nfluids. In this paper we establish the global validity of the diffusive limit\nfor the Boltzmann equations to the Navier-Stokes-Fourier system in an exterior\ndomain. To overcome the well-known difficulty of the lack of Poincare's\ninequality, we develop a new $L^2-L^6$ splitting for dissipative hydrodynamic\npart Pf for nonlinear closure.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:00:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jung","Junhwa",""]]}
{"id":"2308.03985","submitter":"Shaoxiang Qin","authors":"Wenhui Peng, Shaoxiang Qin, Senwen Yang, Jianchun Wang, Xue Liu,\n  Liangzhu (Leon) Wang","title":"Fourier neural operator for real-time simulation of 3D dynamic urban\n  microclimate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Global urbanization has underscored the significance of urban microclimates\nfor human comfort, health, and building/urban energy efficiency. They\nprofoundly influence building design and urban planning as major environmental\nimpacts. Understanding local microclimates is essential for cities to prepare\nfor climate change and effectively implement resilience measures. However,\nanalyzing urban microclimates requires considering a complex array of outdoor\nparameters within computational domains at the city scale over a longer period\nthan indoors. As a result, numerical methods like Computational Fluid Dynamics\n(CFD) become computationally expensive when evaluating the impact of urban\nmicroclimates. The rise of deep learning techniques has opened new\nopportunities for accelerating the modeling of complex non-linear interactions\nand system dynamics. Recently, the Fourier Neural Operator (FNO) has been shown\nto be very promising in accelerating solving the Partial Differential Equations\n(PDEs) and modeling fluid dynamic systems. In this work, we apply the FNO\nnetwork for real-time three-dimensional (3D) urban wind field simulation. The\ntraining and testing data are generated from CFD simulation of the urban area,\nbased on the semi-Lagrangian approach and fractional stepping method to\nsimulate urban microclimate features for modeling large-scale urban problems.\nNumerical experiments show that the FNO model can accurately reconstruct the\ninstantaneous spatial velocity field. We further evaluate the trained FNO model\non unseen data with different wind directions, and the results show that the\nFNO model can generalize well on different wind directions. More importantly,\nthe FNO approach can make predictions within milliseconds on the graphics\nprocessing unit, making real-time simulation of 3D dynamic urban microclimate\npossible.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:03:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Peng","Wenhui","","Leon"],["Qin","Shaoxiang","","Leon"],["Yang","Senwen","","Leon"],["Wang","Jianchun","","Leon"],["Liu","Xue","","Leon"],["Liangzhu","","","Leon"],["Wang","",""]]}
{"id":"2308.03986","submitter":"Yi Zhang","authors":"Ya-xiang Yuan and Yi Zhang","title":"Symplectic Discretization Approach for Developing New Proximal Point\n  Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Proximal point algorithms have found numerous applications in the field of\nconvex optimization, and their accelerated forms have also been proposed.\nHowever, the most commonly used accelerated proximal point algorithm was first\nintroduced in 1967, and recent studies on accelerating proximal point\nalgorithms are relatively scarce. In this paper, we propose high-resolution\nODEs for the proximal point operators for both closed proper convex functions\nand maximally monotone operators, and present a Lyapunov function framework to\ndemonstrate that the trajectories of our high-resolution ODEs exhibit\naccelerated behavior. Subsequently, by symplectically discretizing our\nhigh-resolution ODEs, we obtain new proximal point algorithms known as\nsymplectic proximal point algorithms. By decomposing the continuous-time\nLyapunov function into its elementary components, we demonstrate that\nsymplectic proximal point algorithms possess $O(1/k^2)$ convergence rates.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:04:09 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 06:14:18 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 11:19:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yuan","Ya-xiang",""],["Zhang","Yi",""]]}
{"id":"2308.03987","submitter":"Naoyuki Kamo","authors":"Naoyuki Kamo, Marc Delcroix, Tomohiro Nakatani","title":"Target Speech Extraction with Conditional Diffusion Model","comments":"5 pages, 4 figures, Interspeech2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion model-based speech enhancement has received increased attention\nsince it can generate very natural enhanced signals and generalizes well to\nunseen conditions. Diffusion models have been explored for several sub-tasks of\nspeech enhancement, such as speech denoising, dereverberation, and source\nseparation. In this paper, we investigate their use for target speech\nextraction (TSE), which consists of estimating the clean speech signal of a\ntarget speaker in a mixture of multi-talkers. TSE is realized by conditioning\nthe extraction process on a clue identifying the target speaker. We show we can\nrealize TSE using a conditional diffusion model conditioned on the clue.\nBesides, we introduce ensemble inference to reduce potential extraction errors\ncaused by the diffusion process. In experiments on Libri2mix corpus, we show\nthat the proposed diffusion model-based TSE combined with ensemble inference\noutperforms a comparable TSE system trained discriminatively.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:06:11 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 02:22:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kamo","Naoyuki",""],["Delcroix","Marc",""],["Nakatani","Tomohiro",""]]}
{"id":"2308.03988","submitter":"Gen Nakamura","authors":"Maarten V. de Hoop, Ching-Lung Lin, Gen Nakamura","title":"Uniform Decaying Property of Solutions for Anisotropic Viscoelastic\n  Systems","comments":"27 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The paper concerns about the uniform decaying property (abbreviated by UDP)\nof solutions for an anisotropic viscoelastic system in the form of\nintegrodifferential system (abbreviated by VID system) with mixed type boundary\ncondition. The mixed type condition consists of the homogeneous displacement\nboundary condition and a homogeneous traction boundary condition or with a\ndissipation. By using a dissipative structure of this system, we will prove the\nUDP in a unified way for the two cases, which are, when the time derivative of\nrelaxation tensor decays with polynomial order and it decays with exponential\norder.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:10:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["de Hoop","Maarten V.",""],["Lin","Ching-Lung",""],["Nakamura","Gen",""]]}
{"id":"2308.03989","submitter":"Quan Li","authors":"Chen Cheng, Ziang Li, Zhenhui Peng, and Quan Li","title":"ALens: An Adaptive Domain-Oriented Abstract Writing Training Tool for\n  Novice Researchers","comments":"Accepted by HHME/CHCI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The significance of novice researchers acquiring proficiency in writing\nabstracts has been extensively documented in the field of higher education,\nwhere they often encounter challenges in this process. Traditionally, students\nhave been advised to enroll in writing training courses as a means to develop\ntheir abstract writing skills. Nevertheless, this approach frequently falls\nshort in providing students with personalized and adaptable feedback on their\nabstract writing. To address this gap, we initially conducted a formative study\nto ascertain the user requirements for an abstract writing training tool.\nSubsequently, we proposed a domain-specific abstract writing training tool\ncalled ALens, which employs rhetorical structure parsing to identify key\nconcepts, evaluates abstract drafts based on linguistic features, and employs\nvisualization techniques to analyze the writing patterns of exemplary\nabstracts. A comparative user study involving an alternative abstract writing\ntraining tool has been conducted to demonstrate the efficacy of our approach.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:10:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cheng","Chen",""],["Li","Ziang",""],["Peng","Zhenhui",""],["Li","Quan",""]]}
{"id":"2308.03990","submitter":"Chen Cao","authors":"Richard Jiarui Tong, Cassie Chen Cao, Timothy Xueqian Lee, Guodong\n  Zhao, Ray Wan, Feiyue Wang, Xiangen Hu, Robin Schmucker, Jinsheng Pan, Julian\n  Quevedo, Yu Lu","title":"NEOLAF, an LLM-powered neural-symbolic cognitive architecture","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents the Never Ending Open Learning Adaptive Framework\n(NEOLAF), an integrated neural-symbolic cognitive architecture that models and\nconstructs intelligent agents. The NEOLAF framework is a superior approach to\nconstructing intelligent agents than both the pure connectionist and pure\nsymbolic approaches due to its explainability, incremental learning,\nefficiency, collaborative and distributed learning, human-in-the-loop\nenablement, and self-improvement. The paper further presents a compelling\nexperiment where a NEOLAF agent, built as a problem-solving agent, is fed with\ncomplex math problems from the open-source MATH dataset. The results\ndemonstrate NEOLAF's superior learning capability and its potential to\nrevolutionize the field of cognitive architectures and self-improving adaptive\ninstructional systems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:13:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tong","Richard Jiarui",""],["Cao","Cassie Chen",""],["Lee","Timothy Xueqian",""],["Zhao","Guodong",""],["Wan","Ray",""],["Wang","Feiyue",""],["Hu","Xiangen",""],["Schmucker","Robin",""],["Pan","Jinsheng",""],["Quevedo","Julian",""],["Lu","Yu",""]]}
{"id":"2308.03991","submitter":"Jiawei Zhan","authors":"Jiawei Zhan, Marco Govoni, Giulia Galli","title":"Nonempirical Range-Separated Hybrid Functional with Spatially Dependent\n  Screened Exchange","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":"  Electronic structure calculations based on Density Functional Theory have\nsuccessfully predicted numerous ground state properties of a variety of\nmolecules and materials. However, exchange and correlation functionals\ncurrently used in the literature, including semi-local and hybrid functionals,\nare often inaccurate to describe the electronic properties of heterogeneous\nsolids, especially systems composed of building blocks with large dielectric\nmismatch. Here, we present a dielectric-dependent range-separated hybrid\nfunctional, SE-RSH, for the investigation of heterogeneous materials. We define\na spatially dependent fraction of exact exchange inspired by the static\nCoulomb-hole and screened-exchange (COHSEX) approximation used in many body\nperturbation theory, and we show that the proposed functional accurately\npredicts the electronic structure of several non-metallic interfaces, three-\nand two-dimensional, pristine and defective solids and nanoparticles.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:13:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhan","Jiawei",""],["Govoni","Marco",""],["Galli","Giulia",""]]}
{"id":"2308.03992","submitter":"Chen Cao","authors":"Cassie Chen Cao, Zijian Ding, Jionghao Lin, Frank Hopfgartner","title":"AI Chatbots as Multi-Role Pedagogical Agents: Transforming Engagement in\n  CS Education","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigates the use of Artificial Intelligence (AI)-powered,\nmulti-role chatbots as a means to enhance learning experiences and foster\nengagement in computer science education. Leveraging a design-based research\napproach, we develop, implement, and evaluate a novel learning environment\nenriched with four distinct chatbot roles: Instructor Bot, Peer Bot, Career\nAdvising Bot, and Emotional Supporter Bot. These roles, designed around the\ntenets of Self-Determination Theory, cater to the three innate psychological\nneeds of learners - competence, autonomy, and relatedness. Additionally, the\nsystem embraces an inquiry-based learning paradigm, encouraging students to ask\nquestions, seek solutions, and explore their curiosities.\n  We test this system in a higher education context over a period of one month\nwith 200 participating students, comparing outcomes with conditions involving a\nhuman tutor and a single chatbot. Our research utilizes a mixed-methods\napproach, encompassing quantitative measures such as chat log sequence\nanalysis, and qualitative methods including surveys and focus group interviews.\nBy integrating cutting-edge Natural Language Processing techniques such as\ntopic modelling and sentiment analysis, we offer an in-depth understanding of\nthe system's impact on learner engagement, motivation, and inquiry-based\nlearning.\n  This study, through its rigorous design and innovative approach, provides\nsignificant insights into the potential of AI-empowered, multi-role chatbots in\nreshaping the landscape of computer science education and fostering an\nengaging, supportive, and motivating learning environment.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:13:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cao","Cassie Chen",""],["Ding","Zijian",""],["Lin","Jionghao",""],["Hopfgartner","Frank",""]]}
{"id":"2308.03993","submitter":"Tenta Tani","authors":"Tenta Tani, Takuto Kawakami, Mikito Koshino","title":"Perpendicular electronic transport and moir\\'{e}-induced resonance in\n  twisted interfaces of 3D graphite","comments":"15 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We calculate the perpendicular electrical conductivity in twisted\nthree-dimensional graphite (rotationally-stacked graphite pieces) by using the\neffective continuum model and the recursive Green's function method. In the low\ntwist angle regime $(\\theta \\lesssim 2^\\circ)$, the conductivity shows a\nnon-monotonous dependence with a peak and dip structure as a function of the\ntwist angle. By analyzing the momentum-resolved conductance and the local\ndensity of states, this behavior is attributed to the Fano resonance between\ncontinuum states of bulk graphite and interface-localized states, which is a\nremnant of the flat band in the magic-angle twisted bilayer graphene. We also\napply the formulation to the high-angle regime near the commensurate angle\n$\\theta \\approx 21.8^\\circ$, and reproduce the conductance peak observed in the\nexperiment.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:14:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tani","Tenta",""],["Kawakami","Takuto",""],["Koshino","Mikito",""]]}
{"id":"2308.03994","submitter":"Luobin Lin","authors":"Luobin Lin, Fuquan Chen, Xianhai Huang","title":"Reasonable mechanical model on shallow tunnel excavation to eliminate\n  displacement singularity caused by unbalanced resultant","comments":"45 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When considering initial stress field in geomaterial, nonzero resultant of\nshallow tunnel excavation exists, which produces logarithmic items in complex\npotentials, and would further lead to a unique displacement singularity at\ninfinity to violate geo-engineering fact in real world. The mechanical and\nmathematical reasons of such a unique displacement singularity in the existing\nmechanical models are elaborated, and a new mechanical model is subsequently\nproposed to eliminate this singularity by constraining far-field ground surface\ndisplacement, and the original unbalanced resultant problem is converted into\nan equilibrium one with mixed boundary conditions. To solve stress and\ndisplacement in the new model, the analytic continuation is applied to\ntransform the mixed boundary conditions into a homogenerous Riemann-Hilbert\nproblem with extra constraints, which is then solved using an approximate and\niterative method with good numerical stability. The Lanczos filtering is\napplied to the stress and displacement solution to reduce the Gibbs phenomena\ncaused by abrupt change of the boundary conditions along ground surface.\nSeveral numerical cases are conducted to verify the proposed mechanical model\nand the results strongly validate that the proposed mechanical model\nsuccessfully eliminates the displacement singularity caused by unbalanced\nresultant with good convergence and accuracy to obtain stress and displacement\nfor shallow tunnel excavation. A parametric investigation is subsequently\nconducted to study the influence of tunnel depth, lateral coefficient, and free\nsurface range on stress and displacement distribution in geomaterial.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:14:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lin","Luobin",""],["Chen","Fuquan",""],["Huang","Xianhai",""]]}
{"id":"2308.03995","submitter":"Hengxi Zhang","authors":"Hengxi Zhang, Huaze Tang, Wenbo Ding, Xiao-Ping Zhang","title":"Cooperative Multi-Type Multi-Agent Deep Reinforcement Learning for\n  Resource Management in Space-Air-Ground Integrated Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Space-Air-Ground Integrated Network (SAGIN), integrating heterogeneous\ndevices including low earth orbit (LEO) satellites, unmanned aerial vehicles\n(UAVs), and ground users (GUs), holds significant promise for advancing smart\ncity applications. However, resource management of the SAGIN is a challenge\nrequiring urgent study in that inappropriate resource management will cause\npoor data transmission, and hence affect the services in smart cities. In this\npaper, we develop a comprehensive SAGIN system that encompasses five distinct\ncommunication links and propose an efficient cooperative multi-type multi-agent\ndeep reinforcement learning (CMT-MARL) method to address the resource\nmanagement issue. The experimental results highlight the efficacy of the\nproposed CMT-MARL, as evidenced by key performance indicators such as the\noverall transmission rate and transmission success rate. These results\nunderscore the potential value and feasibility of future implementation of the\nSAGIN.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:15:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Hengxi",""],["Tang","Huaze",""],["Ding","Wenbo",""],["Zhang","Xiao-Ping",""]]}
{"id":"2308.03996","submitter":"Kareem Hegazy","authors":"Kareem Hegazy, James Cryan, Renkai Li, Ming-Fu Lin, Brian Moore, Pedro\n  Nunes, Xiaozhe Shen, Stephen Weathersby, Jie Yang, Xijie Wang, Thomas Wolf","title":"Investigating dissociation pathways of nitrobenzene via\n  mega-electron-volt ultrafast electron diffraction","comments":"5 pages, 3 figures, and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the simplest nitroaromatic compound, nitrobenzene is an interesting model\nsystem to explore the rich photochemistry of nitroaromatic compounds. Previous\nmeasurements of nitrobenzene's photochemical dynamics have probed structural\nand electronic properties, which, at times, paint a convoluted and sometimes\ncontradictory description of the photochemical landscape. A sub-picosecond\nstructural probe can complement previous electronic measurements and aid in\ndetermining the photochemical dynamics with less ambiguity. We investigate the\nultrafast dynamics of nitrobenzene triggered by photoexcitation at 267 nm\nemploying megaelectronvolt ultrafast electron diffraction with femtosecond time\nresolution. We measure the first 5 ps of dynamics and, by comparing our\nmeasured results to simulation, we unambiguously distinguish the lowest singlet\nand triplet electronic states. We observe ground state recovery within 160 +/-\n60 fs through internal conversions and without signal corresponding to\nphotofragmentation. Our lack of dissociation signal within the first 5 ps\nindicates that previously observed photofragmenation reactions take place in\nthe vibrationally \"hot\" ground state on timescales considerably beyond 5 ps.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:27:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hegazy","Kareem",""],["Cryan","James",""],["Li","Renkai",""],["Lin","Ming-Fu",""],["Moore","Brian",""],["Nunes","Pedro",""],["Shen","Xiaozhe",""],["Weathersby","Stephen",""],["Yang","Jie",""],["Wang","Xijie",""],["Wolf","Thomas",""]]}
{"id":"2308.03997","submitter":"Cleto B. Miranda-Neto","authors":"Cleto B. Miranda-Neto, Douglas S. Queiroz","title":"Dao's question on the asymptotic behaviour of fullness","comments":"11 pages. Submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a local ring $(R, \\M)$ of infinite residue field and positive depth, we\naddress the question raised by H. Dao on how to control the asymptotic\nbehaviour of the $\\M$-full, full, and weakly $\\M$-full properties of certain\nideals (such notions were first investigated by D. Rees and J. Watanabe), by\nmeans of bounding appropriate numbers which express such behaviour. We\nestablish upper bounds, and in certain cases even formulas for such invariants.\nThe main tools used in our results are reduction numbers along with\nRatliff-Rush closure of ideals, and also the Castelnuovo-Mumford regularity of\nthe Rees algebra of $\\M$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:28:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Miranda-Neto","Cleto B.",""],["Queiroz","Douglas S.",""]]}
{"id":"2308.03998","submitter":"Zixuan He","authors":"Zixuan He (1)(2), Salik Ram Khana (1)(2), Xin Zhang (3), Manoj Karkee\n  (1)(2), Qin Zhang (1)(2) ((1) Center for Precision and Automated Agricultural\n  Systems, Washington State University, (2) Department of Biological Systems\n  Engineering, Washington State University, (3) Department of Agricultural and\n  Biological Engineering, Mississippi State University)","title":"Real-time Strawberry Detection Based on Improved YOLOv5s Architecture\n  for Robotic Harvesting in open-field environment","comments":"20 pages; 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This study proposed a YOLOv5-based custom object detection model to detect\nstrawberries in an outdoor environment. The original architecture of the\nYOLOv5s was modified by replacing the C3 module with the C2f module in the\nbackbone network, which provided a better feature gradient flow. Secondly, the\nSpatial Pyramid Pooling Fast in the final layer of the backbone network of\nYOLOv5s was combined with Cross Stage Partial Net to improve the generalization\nability over the strawberry dataset in this study. The proposed architecture\nwas named YOLOv5s-Straw. The RGB images dataset of the strawberry canopy with\nthree maturity classes (immature, nearly mature, and mature) was collected in\nopen-field environment and augmented through a series of operations including\nbrightness reduction, brightness increase, and noise adding. To verify the\nsuperiority of the proposed method for strawberry detection in open-field\nenvironment, four competitive detection models (YOLOv3-tiny, YOLOv5s,\nYOLOv5s-C2f, and YOLOv8s) were trained, and tested under the same computational\nenvironment and compared with YOLOv5s-Straw. The results showed that the\nhighest mean average precision of 80.3% was achieved using the proposed\narchitecture whereas the same was achieved with YOLOv3-tiny, YOLOv5s,\nYOLOv5s-C2f, and YOLOv8s were 73.4%, 77.8%, 79.8%, 79.3%, respectively.\nSpecifically, the average precision of YOLOv5s-Straw was 82.1% in the immature\nclass, 73.5% in the nearly mature class, and 86.6% in the mature class, which\nwere 2.3% and 3.7%, respectively, higher than that of the latest YOLOv8s. The\nmodel included 8.6*10^6 network parameters with an inference speed of 18ms per\nimage while the inference speed of YOLOv8s had a slower inference speed of\n21.0ms and heavy parameters of 11.1*10^6, which indicates that the proposed\nmodel is fast enough for real time strawberry detection and localization for\nthe robotic picking.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:28:48 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 01:57:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["He","Zixuan",""],["Khana","Salik Ram",""],["Zhang","Xin",""],["Karkee","Manoj",""],["Zhang","Qin",""]]}
{"id":"2308.03999","submitter":"Abhilekha Dalal","authors":"Abhilekha Dalal, Md Kamruzzaman Sarker, Adrita Barua, Eugene\n  Vasserman, Pascal Hitzler","title":"Understanding CNN Hidden Neuron Activations Using Structured Background\n  Knowledge and Deductive Reasoning","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":"  A major challenge in Explainable AI is in correctly interpreting activations\nof hidden neurons: accurate interpretations would provide insights into the\nquestion of what a deep learning system has internally detected as relevant on\nthe input, demystifying the otherwise black-box character of deep learning\nsystems. The state of the art indicates that hidden node activations can, in\nsome cases, be interpretable in a way that makes sense to humans, but\nsystematic automated methods that would be able to hypothesize and verify\ninterpretations of hidden neuron activations are underexplored. In this paper,\nwe provide such a method and demonstrate that it provides meaningful\ninterpretations. Our approach is based on using large-scale background\nknowledge approximately 2 million classes curated from the Wikipedia concept\nhierarchy together with a symbolic reasoning approach called Concept Induction\nbased on description logics, originally developed for applications in the\nSemantic Web field. Our results show that we can automatically attach\nmeaningful labels from the background knowledge to individual neurons in the\ndense layer of a Convolutional Neural Network through a hypothesis and\nverification process.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:28:50 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 15:59:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dalal","Abhilekha",""],["Sarker","Md Kamruzzaman",""],["Barua","Adrita",""],["Vasserman","Eugene",""],["Hitzler","Pascal",""]]}
{"id":"2308.04000","submitter":"Xinggang Hu","authors":"Xinggang Hu","title":"Multi-level Map Construction for Dynamic Scenes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In dynamic scenes, both localization and mapping in visual SLAM face\nsignificant challenges. In recent years, numerous outstanding research works\nhave proposed effective solutions for the localization problem. However, there\nhas been a scarcity of excellent works focusing on constructing long-term\nconsistent maps in dynamic scenes, which severely hampers map applications. To\naddress this issue, we have designed a multi-level map construction system\ntailored for dynamic scenes. In this system, we employ multi-object tracking\nalgorithms, DBSCAN clustering algorithm, and depth information to rectify the\nresults of object detection, accurately extract static point clouds, and\nconstruct dense point cloud maps and octree maps. We propose a plane map\nconstruction algorithm specialized for dynamic scenes, involving the\nextraction, filtering, data association, and fusion optimization of planes in\ndynamic environments, thus creating a plane map. Additionally, we introduce an\nobject map construction algorithm targeted at dynamic scenes, which includes\nobject parameterization, data association, and update optimization. Extensive\nexperiments on public datasets and real-world scenarios validate the accuracy\nof the multi-level maps constructed in this study and the robustness of the\nproposed algorithms. Furthermore, we demonstrate the practical application\nprospects of our algorithms by utilizing the constructed object maps for\ndynamic object tracking.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:29:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Xinggang",""]]}
{"id":"2308.04001","submitter":"Ming Li Dr.","authors":"Ming Li, Jingqiao Hu, Wei Chen, Weipeng Kong, and Jin Huang","title":"Explicit Topology Optimization of Conforming Voronoi Foams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Topology optimization is able to maximally leverage the high DOFs and\nmechanical potentiality of porous foams but faces three fundamental challenges:\nconforming to free-form outer shapes, maintaining geometric connectivity\nbetween adjacent cells, and achieving high simulation accuracy. To resolve the\nissues, borrowing the concept from Voronoi tessellation, we propose to use the\nsite (or seed) positions and radii of the beams as the DOFs for open-cell foam\ndesign. Such DOFs cover extensive design space and have clear geometrical\nmeaning, which makes it easy to provide explicit controls (e.g. granularity).\nDuring the gradient-based optimization, the foam topology can change freely,\nand some seeds may even be pushed out of the shape, which greatly alleviates\nthe challenges of prescribing a fixed underlying grid. The mechanical property\nof our foam is computed from its highly heterogeneous density field counterpart\ndiscretized on a background mesh, with a much improved accuracy via a new\nmaterial-aware numerical coarsening method. We also explore the\ndifferentiability of the open-cell Voronoi foams w.r.t. its seed locations, and\npropose a local finite difference method to estimate the derivatives\nefficiently. We do not only show the improved foam performance of our Voronoi\nfoam in comparison with classical topology optimization approaches, but also\ndemonstrate its advantages in various settings, especially when the target\nvolume fraction is extremely low.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:32:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Ming",""],["Hu","Jingqiao",""],["Chen","Wei",""],["Kong","Weipeng",""],["Huang","Jin",""]]}
{"id":"2308.04002","submitter":"Mostafa Nouh","authors":"M. Moghaddaszadeh, M. Mousa, A. Aref, and M. Nouh","title":"Reconfigurable elastic neuromorphic metasurfaces towards mechanical\n  intelligence and cognitive wave-based computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability of mechanical systems to perform basic computations has gained\ntraction over recent years, providing an unconventional alternative to digital\ncomputing in off grid, low power, and severe thermal environments which render\nthe majority of electronic components inoperable. However, much of the work in\nmechanical computing has focused on logic operations via quasi-static\nprescribed displacements in origami, bistable, and soft deformable matter. In\nhere, we present a first attempt to describe the fundamental framework of an\nelastic neuromorphic metasurface that performs distinct classification tasks,\nproviding a new set of challenges given the complex nature of elastic waves\nwith respect to scattering and manipulation. Multiple layers of reconfigurable\nwaveguides are phase-trained via constant weights and trainable activation\nfunctions in a manner that enables the resultant wave scattering at the readout\nlocation to focus on the correct class within the detection plane. We\ndemonstrate the neuromorphic system's ability to exhibit high accuracy in two\ndistinct tasks owing to a fully reconfigurable design, eliminating the need for\ncostly remanufacturing.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:38:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Moghaddaszadeh","M.",""],["Mousa","M.",""],["Aref","A.",""],["Nouh","M.",""]]}
{"id":"2308.04003","submitter":"Jiewen Hu","authors":"Jiewen Hu, Gang Liu, Zheng Ma, Ming Xiao and Pingzhi Fan","title":"Low-complexity Resource Allocation for User Paired RSMA in Future 6G\n  Wireless Networks","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":"  Rate-splitting multiple access (RSMA) uplink requires optimization of\ndecoding order and power allocation, while decoding order is a discrete\nvariable, and it is very complex to find the optimal decoding order if the\nnumber of users is large enough. This letter proposes a low-complexity user\npairing-based resource allocation algorithm with the objective of minimizing\nthe maximum latency, which significantly reduces the computational complexity\nand also achieves similar performance to unpaired uplink RSMA. A closed-form\nexpression for power and bandwidth allocation is first derived, and then a\nbisection method is used to determine the optimal resource allocation. Finally,\nthe proposed algorithm is compared with unpaired RSMA, paired NOMA and unpaired\nNOMA. The results demonstrate the effectiveness of the proposed algorithm.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:44:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Jiewen",""],["Liu","Gang",""],["Ma","Zheng",""],["Xiao","Ming",""],["Fan","Pingzhi",""]]}
{"id":"2308.04004","submitter":"Xuejuan Yang","authors":"X.J. Yang and Aigen Li","title":"Aliphatics and Aromatics in the Universe: The Pre-JWST Era","comments":"30 pages, 15 figures, accepted for publication by ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The so-called \"unidentified infrared emission\" (UIE) features at 3.3, 6.2,\n7.7, 8.6, and 11.3 micron ubiquitously seen in a wide variety of astrophysical\nregions are generally attributed to polycyclic aromatic hydrocarbon (PAH)\nmolecules. Astronomical PAHs often have an aliphatic component (e.g., aliphatic\nsidegroups like methyl --CH3 may be attached as functional groups to PAHs) as\nrevealed by the detection in many UIE sources of the aliphatic C--H stretching\nfeature at 3.4 micron. With its unprecedented sensitivity, unprecedented\nspatial resolution and high spectral resolution, the James Webb Space Telescope\n(JWST) holds great promise for evolutionizing the studies of aliphatics and\naromatics in the universe. To facilitate analyzing JWST observations, we\npresent a theoretical framework for determining the aliphatic fractions\n(\\eta_ali) of PAHs, the fractions of C atoms in aliphatic units, from the\nemission intensity ratios of the 3.4 micron feature to the 3.3 micron feature.\nTo demonstrate the effectiveness of this framework, we compile the 3.3 and 3.4\nmicron UIE data obtained in the pre-JWST era for an as complete as possible\nsample, and then apply the framework to these pre-JWST data. We derive a median\naliphatic fraction of <\\eta_ali>=5.4\\% and find that the aliphatic fractions\nare the highest in protoplanetary nebulae illuminated by cool stars lacking\nultraviolet radiation. Nevertheless, the \"hardness\" of stellar photons is not\nthe only factor affecting the PAH aliphaticity, other factors such as the\nstarlight intensity may also play an important role.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:47:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yang","X. J.",""],["Li","Aigen",""]]}
{"id":"2308.04005","submitter":"Micha{\\l} Byra","authors":"Michal Byra, Muhammad Febrian Rachmadi, Henrik Skibbe","title":"Few-shot medical image classification with simple shape and texture text\n  descriptors using vision-language models","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we investigate the usefulness of vision-language models (VLMs)\nand large language models for binary few-shot classification of medical images.\nWe utilize the GPT-4 model to generate text descriptors that encapsulate the\nshape and texture characteristics of objects in medical images. Subsequently,\nthese GPT-4 generated descriptors, alongside VLMs pre-trained on natural\nimages, are employed to classify chest X-rays and breast ultrasound images. Our\nresults indicate that few-shot classification of medical images using VLMs and\nGPT-4 generated descriptors is a viable approach. However, accurate\nclassification requires to exclude certain descriptors from the calculations of\nthe classification scores. Moreover, we assess the ability of VLMs to evaluate\nshape features in breast mass ultrasound images. We further investigate the\ndegree of variability among the sets of text descriptors produced by GPT-4. Our\nwork provides several important insights about the application of VLMs for\nmedical image analysis.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:48:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Byra","Michal",""],["Rachmadi","Muhammad Febrian",""],["Skibbe","Henrik",""]]}
{"id":"2308.04006","submitter":"Shashank Gupta","authors":"Shashank Gupta","title":"An Ethereum-based Product Identification System for Anti-counterfeits","comments":"5 page, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DB cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fake products are items that are marketed and sold as genuine, high-quality\nproducts but are counterfeit or low-quality knockoffs. These products are often\ndesigned to closely mimic the appearance and branding of the genuine product to\ndeceive consumers into thinking they are purchasing the real thing. Fake\nproducts can range from clothing and accessories to electronics and other goods\nand can be found in a variety of settings, including online marketplaces and\nbrick-and-mortar stores. Blockchain technology can be used to help detect fake\nproducts in a few different ways. One of the most common ways is through the\nuse of smart contracts, which are self-executing contracts with the terms of\nthe agreement between buyer and seller being directly written into lines of\ncode. This allows for a high level of transparency and traceability in supply\nchain transactions, making it easier to identify and prevent the sale of fake\nproducts and the use of unique product identifiers, such as serial numbers or\nQR codes, that are recorded on the blockchain. This allows consumers to easily\nverify the authenticity of a product by scanning the code and checking it\nagainst the information recorded on the blockchain. In this study, we will use\nsmart contracts to detect fake products and will evaluate based on Gas cost and\nethers used for each implementation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:57:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gupta","Shashank",""]]}
{"id":"2308.04007","submitter":"Wang Yiran","authors":"Yiran Wang, Haiwang Zhong, Guangchun Ruan","title":"A Projection-Based Approach for Distributed Energy Resources Aggregation","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":"  Aggregating distributed energy resources (DERs) is of great significance to\nimprove the overall operational efficiency of smart grid. The aggregation model\nneeds to consider various factors such as network constraints, operational\nconstraints, and economic characteristics of the DERs. This paper constructs a\nmulti-slot DER aggregation model that considers the above factors using\nfeasible region projection approach, which achieved the protection of DERs data\ninformation and the elimination of internal variables. A system economic\ndispatch (ED) model is established for the operators to make full use of the\nDER clusters. We calculate the feasible regions with temporal coupling by\nextending the Progressive Vertex Enumeration (PVE) algorithm to high dimension\nby the Quickhull algorithm. Finally, an IEEE 39-bus distribution network is\nsimulated with DERs to verify the effectiveness of the proposed model. Results\nshow that the two-step ED derives the same results as the centralized ED.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:02:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Yiran",""],["Zhong","Haiwang",""],["Ruan","Guangchun",""]]}
{"id":"2308.04008","submitter":"Yunquan Zhu","authors":"Yunquan Zhu, Xinkai Gao, Bo Ke, Ruizhi Qiao, Xing Sun","title":"Coarse-to-Fine: Learning Compact Discriminative Representation for\n  Single-Stage Image Retrieval","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":"  Image retrieval targets to find images from a database that are visually\nsimilar to the query image. Two-stage methods following retrieve-and-rerank\nparadigm have achieved excellent performance, but their separate local and\nglobal modules are inefficient to real-world applications. To better trade-off\nretrieval efficiency and accuracy, some approaches fuse global and local\nfeature into a joint representation to perform single-stage image retrieval.\nHowever, they are still challenging due to various situations to tackle,\n$e.g.$, background, occlusion and viewpoint. In this work, we design a\nCoarse-to-Fine framework to learn Compact Discriminative representation (CFCD)\nfor end-to-end single-stage image retrieval-requiring only image-level labels.\nSpecifically, we first design a novel adaptive softmax-based loss which\ndynamically tunes its scale and margin within each mini-batch and increases\nthem progressively to strengthen supervision during training and intra-class\ncompactness. Furthermore, we propose a mechanism which attentively selects\nprominent local descriptors and infuse fine-grained semantic relations into the\nglobal representation by a hard negative sampling strategy to optimize\ninter-class distinctiveness at a global scale. Extensive experimental results\nhave demonstrated the effectiveness of our method, which achieves\nstate-of-the-art single-stage image retrieval performance on benchmarks such as\nRevisited Oxford and Revisited Paris. Code is available at\nhttps://github.com/bassyess/CFCD.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:06:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhu","Yunquan",""],["Gao","Xinkai",""],["Ke","Bo",""],["Qiao","Ruizhi",""],["Sun","Xing",""]]}
{"id":"2308.04009","submitter":"Jinrae Kim","authors":"Jinrae Kim, Youdan Kim","title":"Safe Control Synthesis for Multicopter via Control Barrier Function\n  Backstepping","comments":"6 pages, 2 figures, accepted for IEEE Conference on Decision and\n  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":"  A safe controller for multicopter is proposed using control barrier function.\nMulticopter dynamics are reformulated to deal with mixed-relative-degree and\nnon-strict-feedback-form dynamics, and a time-varying safe backstepping\ncontroller is designed. Despite the time-varying variation, it is proven that\nthe control input can be obtained by solving quadratic programming with affine\ninequality constraints. The proposed controller does not utilize a cascade\ncontrol system design, unlike existing studies on the safe control of\nmulticopter. Various safety constraints on angular velocity, total thrust\ndirection, velocity, and position can be considered. Numerical simulation\nresults support that the proposed safe controller does not violate all safety\nconstraints including low- and high-level dynamics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:06:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kim","Jinrae",""],["Kim","Youdan",""]]}
{"id":"2308.04010","submitter":"Yuya Murakami","authors":"Yuya Murakami and Yuji Terashima","title":"Homological blocks with simple Lie algebras and\n  Witten--Reshetikhin--Turaev invariants","comments":"11 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT hep-th math-ph math.MP math.NT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, for any Seifert fibered homology 3-sphere, we introduce\nhomological blocks with simple Lie algebra and prove that its radial limits are\nidentified with the Witten--Reshetikhin--Turaev invariants. To prove it, we\ndevelop an asymptotic formula and a vanishing result of asymptotic\ncoefficients.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:09:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Murakami","Yuya",""],["Terashima","Yuji",""]]}
{"id":"2308.04011","submitter":"Weilin Chen","authors":"Ruichu Cai, Zeqin Yang, Weilin Chen, Yuguang Yan, Zhifeng Hao","title":"Generalization bound for estimating causal effects from observational\n  network data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ME","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Estimating causal effects from observational network data is a significant\nbut challenging problem. Existing works in causal inference for observational\nnetwork data lack an analysis of the generalization bound, which can\ntheoretically provide support for alleviating the complex confounding bias and\npractically guide the design of learning objectives in a principled manner. To\nfill this gap, we derive a generalization bound for causal effect estimation in\nnetwork scenarios by exploiting 1) the reweighting schema based on joint\npropensity score and 2) the representation learning schema based on Integral\nProbability Metric (IPM). We provide two perspectives on the generalization\nbound in terms of reweighting and representation learning, respectively.\nMotivated by the analysis of the bound, we propose a weighting regression\nmethod based on the joint propensity score augmented with representation\nlearning. Extensive experimental studies on two real-world networks with\nsemi-synthetic data demonstrate the effectiveness of our algorithm.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:14:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cai","Ruichu",""],["Yang","Zeqin",""],["Chen","Weilin",""],["Yan","Yuguang",""],["Hao","Zhifeng",""]]}
{"id":"2308.04012","submitter":"Sierra Pugh","authors":"Sierra Pugh, Andrew T. Levin, Gideon Meyerowitz-Katz, Satej Soman,\n  Nana Owusu-Boaitey, Anthony B. Zwi, Anup Malani, Ander Wilson, Bailey K.\n  Fosdick","title":"A hierarchical Bayesian model for estimating age-specific COVID-19\n  infection fatality rates in developing countries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The COVID-19 infection fatality rate (IFR) is the proportion of individuals\ninfected with SARS-CoV-2 who subsequently die. As COVID-19 disproportionately\naffects older individuals, age-specific IFR estimates are imperative to\nfacilitate comparisons of the impact of COVID-19 between locations and\nprioritize distribution of scare resources. However, there lacks a coherent\nmethod to synthesize available data to create estimates of IFR and\nseroprevalence that vary continuously with age and adequately reflect\nuncertainties inherent in the underlying data. In this paper we introduce a\nnovel Bayesian hierarchical model to estimate IFR as a continuous function of\nage that acknowledges heterogeneity in population age structure across\nlocations and accounts for uncertainty in the estimates due to seroprevalence\nsampling variability and the imperfect serology test assays. Our approach\nsimultaneously models test assay characteristic, serology, and death data,\nwhere the serology and death data are often available only for binned age\ngroups. Information is shared across locations through hierarchical modeling to\nimprove estimation of the parameters with limited data. Modeling data from 26\ndeveloping country locations during the first year of the COVID-19 pandemic, we\nfound seroprevalence did not change dramatically with age, and the IFR at age\n60 was above the high-income country benchmark for most locations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:15:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pugh","Sierra",""],["Levin","Andrew T.",""],["Meyerowitz-Katz","Gideon",""],["Soman","Satej",""],["Owusu-Boaitey","Nana",""],["Zwi","Anthony B.",""],["Malani","Anup",""],["Wilson","Ander",""],["Fosdick","Bailey K.",""]]}
{"id":"2308.04013","submitter":"Miaoyi Tang","authors":"Miaoyi Tang, Meiqin Liu, Senlin Zhang, Ronghao Zheng, Shanling Dong","title":"Distributed Target Tracking with Fading Channels over Underwater\n  Wireless Sensor Networks","comments":"12 pages, 6 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.IT cs.SY math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates the problem of distributed target tracking via\nunderwater wireless sensor networks (UWSNs) with fading channels. The\ndegradation of signal quality due to wireless channel fading can significantly\nimpact network reliability and subsequently reduce the tracking accuracy. To\naddress this issue, we propose a modified distributed unscented Kalman filter\n(DUKF) named DUKF-Fc, which takes into account the effects of measurement\nfluctuation and transmission failure induced by channel fading. The channel\nestimation error is also considered when designing the estimator and a\nsufficient condition is established to ensure the stochastic boundedness of the\nestimation error. The proposed filtering scheme is versatile and possesses wide\napplicability to numerous real-world scenarios, e.g., tracking a maneuvering\nunderwater target with acoustic sensors. Simulation results demonstrate the\neffectiveness of the proposed filtering algorithm. In addition, considering the\nconstraints of network energy resources, the issue of investigating a trade-off\nbetween tracking performance and energy consumption is discussed accordingly.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:16:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tang","Miaoyi",""],["Liu","Meiqin",""],["Zhang","Senlin",""],["Zheng","Ronghao",""],["Dong","Shanling",""]]}
{"id":"2308.04014","submitter":"Benjamin Th\\'erien","authors":"Kshitij Gupta, Benjamin Th\\'erien, Adam Ibrahim, Mats L. Richter,\n  Quentin Anthony, Eugene Belilovsky, Irina Rish, Timoth\\'ee Lesort","title":"Continual Pre-Training of Large Language Models: How to (re)warm your\n  model?","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":"  Large language models (LLMs) are routinely pre-trained on billions of tokens,\nonly to restart the process over again once new data becomes available. A much\ncheaper and more efficient solution would be to enable the continual\npre-training of these models, i.e. updating pre-trained models with new data\ninstead of re-training them from scratch. However, the distribution shift\ninduced by novel data typically results in degraded performance on past data.\nTaking a step towards efficient continual pre-training, in this work, we\nexamine the effect of different warm-up strategies. Our hypothesis is that the\nlearning rate must be re-increased to improve compute efficiency when training\non a new dataset. We study the warmup phase of models pre-trained on the Pile\n(upstream data, 300B tokens) as we continue to pre-train on SlimPajama\n(downstream data, 297B tokens), following a linear warmup and cosine decay\nschedule. We conduct all experiments on the Pythia 410M language model\narchitecture and evaluate performance through validation perplexity. We\nexperiment with different pre-training checkpoints, various maximum learning\nrates, and various warmup lengths. Our results show that while rewarming models\nfirst increases the loss on upstream and downstream data, in the longer run it\nimproves the downstream performance, outperforming models trained from\nscratch$\\unicode{x2013}$even for a large downstream dataset.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:18:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gupta","Kshitij",""],["Th\u00e9rien","Benjamin",""],["Ibrahim","Adam",""],["Richter","Mats L.",""],["Anthony","Quentin",""],["Belilovsky","Eugene",""],["Rish","Irina",""],["Lesort","Timoth\u00e9e",""]]}
{"id":"2308.04015","submitter":"Norman Do","authors":"Xavier Coulter, Norman Do and Ellena Moskovsky","title":"Integration on complex Grassmannians, deformed monotone Hurwitz numbers,\n  and interlacing phenomena","comments":"30 pages, 3 figures. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a family of polynomials, which arise in three distinct ways: in\nthe large $N$ expansion of a matrix integral, as a weighted enumeration of\nfactorisations of permutations, and via the topological recursion. More\nexplicitly, we interpret the complex Grassmannian $\\mathrm{Gr}(M,N)$ as the\nspace of $N \\times N$ idempotent Hermitian matrices of rank $M$ and develop a\nWeingarten calculus to integrate products of matrix elements over it. In the\nregime of large $N$ and fixed ratio $\\frac{M}{N}$, such integrals have\nexpansions whose coefficients count factorisations of permutations into\nmonotone sequences of transpositions, with each sequence weighted by a monomial\nin $t = 1 - \\frac{N}{M}$. This gives rise to the desired polynomials, which\nspecialise to the monotone Hurwitz numbers when $t = 1$.\n  These so-called deformed monotone Hurwitz numbers satisfy a cut-and-join\nrecursion, a one-point recursion, and the topological recursion. Furthermore,\nwe conjecture on the basis of overwhelming empirical evidence that the deformed\nmonotone Hurwitz numbers are real-rooted polynomials whose roots satisfy\nremarkable interlacing phenomena.\n  An outcome of our work is the viewpoint that the topological recursion can be\nused to \"topologise\" sequences of polynomials, and we claim that the resulting\nfamilies of polynomials may possess interesting properties. As a further case\nstudy, we consider a weighted enumeration of dessins d'enfant and conjecture\nthat the resulting polynomials are also real-rooted and satisfy analogous\ninterlacing properties.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:18:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Coulter","Xavier",""],["Do","Norman",""],["Moskovsky","Ellena",""]]}
{"id":"2308.04016","submitter":"Hanjae Kim","authors":"Hanjae Kim, Jiyoung Lee, Seongheon Park, Kwanghoon Sohn","title":"Hierarchical Visual Primitive Experts for Compositional Zero-Shot\n  Learning","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compositional zero-shot learning (CZSL) aims to recognize unseen compositions\nwith prior knowledge of known primitives (attribute and object). Previous works\nfor CZSL often suffer from grasping the contextuality between attribute and\nobject, as well as the discriminability of visual features, and the long-tailed\ndistribution of real-world compositional data. We propose a simple and scalable\nframework called Composition Transformer (CoT) to address these issues. CoT\nemploys object and attribute experts in distinctive manners to generate\nrepresentative embeddings, using the visual network hierarchically. The object\nexpert extracts representative object embeddings from the final layer in a\nbottom-up manner, while the attribute expert makes attribute embeddings in a\ntop-down manner with a proposed object-guided attention module that models\ncontextuality explicitly. To remedy biased prediction caused by imbalanced data\ndistribution, we develop a simple minority attribute augmentation (MAA) that\nsynthesizes virtual samples by mixing two images and oversampling minority\nattribute classes. Our method achieves SoTA performance on several benchmarks,\nincluding MIT-States, C-GQA, and VAW-CZSL. We also demonstrate the\neffectiveness of CoT in improving visual discrimination and addressing the\nmodel bias from the imbalanced data distribution. The code is available at\nhttps://github.com/HanjaeKim98/CoT.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:24:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kim","Hanjae",""],["Lee","Jiyoung",""],["Park","Seongheon",""],["Sohn","Kwanghoon",""]]}
{"id":"2308.04017","submitter":"Jiayan Pei","authors":"Jianye Ji, Jiayan Pei, Shaochuan Lin, Taotao Zhou, Hengxu He, Jia Jia,\n  Ning Hu","title":"Multi-Granularity Attention Model for Group 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":"  Group recommendation provides personalized recommendations to a group of\nusers based on their shared interests, preferences, and characteristics.\nCurrent studies have explored different methods for integrating individual\npreferences and making collective decisions that benefit the group as a whole.\nHowever, most of them heavily rely on users with rich behavior and ignore\nlatent preferences of users with relatively sparse behavior, leading to\ninsufficient learning of individual interests. To address this challenge, we\npresent the Multi-Granularity Attention Model (MGAM), a novel approach that\nutilizes multiple levels of granularity (i.e., subsets, groups, and supersets)\nto uncover group members' latent preferences and mitigate recommendation noise.\nSpecially, we propose a Subset Preference Extraction module that enhances the\nrepresentation of users' latent subset-level preferences by incorporating their\nprevious interactions with items and utilizing a hierarchical mechanism.\nAdditionally, our method introduces a Group Preference Extraction module and a\nSuperset Preference Extraction module, which explore users' latent preferences\non two levels: the group-level, which maintains users' original preferences,\nand the superset-level, which includes group-group exterior information. By\nincorporating the subset-level embedding, group-level embedding, and\nsuperset-level embedding, our proposed method effectively reduces group\nrecommendation noise across multiple granularities and comprehensively learns\nindividual interests. Extensive offline and online experiments have\ndemonstrated the superiority of our method in terms of performance.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:24:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ji","Jianye",""],["Pei","Jiayan",""],["Lin","Shaochuan",""],["Zhou","Taotao",""],["He","Hengxu",""],["Jia","Jia",""],["Hu","Ning",""]]}
{"id":"2308.04018","submitter":"Dongyoon Yang","authors":"Dongyoon Yang, Kunwoong Kim, Yongdai Kim","title":"Improving Performance of Semi-Supervised Learning by Adversarial Attacks","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semi-supervised learning (SSL) algorithm is a setup built upon a realistic\nassumption that access to a large amount of labeled data is tough. In this\nstudy, we present a generalized framework, named SCAR, standing for Selecting\nClean samples with Adversarial Robustness, for improving the performance of\nrecent SSL algorithms. By adversarially attacking pre-trained models with\nsemi-supervision, our framework shows substantial advances in classifying\nimages. We introduce how adversarial attacks successfully select high-confident\nunlabeled data to be labeled with current predictions. On CIFAR10, three recent\nSSL algorithms with SCAR result in significantly improved image classification.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:29:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yang","Dongyoon",""],["Kim","Kunwoong",""],["Kim","Yongdai",""]]}
{"id":"2308.04019","submitter":"Shaochuan Lin","authors":"Shaochuan Lin, Jiayan Pei, Taotao Zhou, Hengxu He, Jia Jia, Ning Hu","title":"Exploring the Spatiotemporal Features of Online Food Recommendation\n  Service","comments":"accepted by SIGIR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Online Food Recommendation Service (OFRS) has remarkable spatiotemporal\ncharacteristics and the advantage of being able to conveniently satisfy users'\nneeds in a timely manner. There have been a variety of studies that have begun\nto explore its spatiotemporal properties, but a comprehensive and in-depth\nanalysis of the OFRS spatiotemporal features is yet to be conducted. Therefore,\nthis paper studies the OFRS based on three questions: how spatiotemporal\nfeatures play a role; why self-attention cannot be used to model the\nspatiotemporal sequences of OFRS; and how to combine spatiotemporal features to\nimprove the efficiency of OFRS. Firstly, through experimental analysis, we\nsystemically extracted the spatiotemporal features of OFRS, identified the most\nvaluable features and designed an effective combination method. Secondly, we\nconducted a detailed analysis of the spatiotemporal sequences, which revealed\nthe shortcomings of self-attention in OFRS, and proposed a more optimized\nspatiotemporal sequence method for replacing self-attention. In addition, we\nalso designed a Dynamic Context Adaptation Model to further improve the\nefficiency and performance of OFRS. Through the offline experiments on two\nlarge datasets and online experiments for a week, the feasibility and\nsuperiority of our model were proven.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:33:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lin","Shaochuan",""],["Pei","Jiayan",""],["Zhou","Taotao",""],["He","Hengxu",""],["Jia","Jia",""],["Hu","Ning",""]]}
{"id":"2308.04020","submitter":"Yuan Xue","authors":"Jiarong Ye, Haomiao Ni, Peng Jin, Sharon X. Huang, Yuan Xue","title":"Synthetic Augmentation with Large-scale Unconditional Pre-training","comments":"MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning based medical image recognition systems often require a\nsubstantial amount of training data with expert annotations, which can be\nexpensive and time-consuming to obtain. Recently, synthetic augmentation\ntechniques have been proposed to mitigate the issue by generating realistic\nimages conditioned on class labels. However, the effectiveness of these methods\nheavily depends on the representation capability of the trained generative\nmodel, which cannot be guaranteed without sufficient labeled training data. To\nfurther reduce the dependency on annotated data, we propose a synthetic\naugmentation method called HistoDiffusion, which can be pre-trained on\nlarge-scale unlabeled datasets and later applied to a small-scale labeled\ndataset for augmented training. In particular, we train a latent diffusion\nmodel (LDM) on diverse unlabeled datasets to learn common features and generate\nrealistic images without conditional inputs. Then, we fine-tune the model with\nclassifier guidance in latent space on an unseen labeled dataset so that the\nmodel can synthesize images of specific categories. Additionally, we adopt a\nselective mechanism to only add synthetic samples with high confidence of\nmatching to target labels. We evaluate our proposed method by pre-training on\nthree histopathology datasets and testing on a histopathology dataset of\ncolorectal cancer (CRC) excluded from the pre-training datasets. With\nHistoDiffusion augmentation, the classification accuracy of a backbone\nclassifier is remarkably improved by 6.4% using a small set of the original\nlabels. Our code is available at https://github.com/karenyyy/HistoDiffAug.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:34:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ye","Jiarong",""],["Ni","Haomiao",""],["Jin","Peng",""],["Huang","Sharon X.",""],["Xue","Yuan",""]]}
{"id":"2308.04021","submitter":"Pradeep Kumar","authors":"Pradeep Kumar, Tanoy Kanti Konar, Leela Ganesh Chandra Lakkaraju,\n  Aditi Sen De","title":"Quantum Resources in Harrow-Hassidim-Lloyd Algorithm","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum algorithms have the ability to reduce runtime for executing tasks\nbeyond the capabilities of classical algorithms. Therefore, identifying the\nresources responsible for quantum advantages is an interesting endeavour. We\nprove that nonvanishing quantum correlations, both bipartite and genuine\nmultipartite entanglement, are required for solving nontrivial linear systems\nof equations in the Harrow-Hassidim-Lloyd (HHL) algorithm. Moreover, we find a\nnonvanishing l1-norm quantum coherence of the entire system and the register\nqubit which turns out to be related to the success probability of the\nalgorithm. Quantitative analysis of the quantum resources reveals that while a\nsignificant amount of bipartite entanglement is generated in each step and\nrequired for this algorithm, multipartite entanglement content is inversely\nproportional to the performance indicator. In addition, we report that when\nimperfections chosen from Gaussian distribution are incorporated in controlled\nrotations, multipartite entanglement increases with the strength of the\ndisorder, albeit error also increases while bipartite entanglement and\ncoherence decreases, confirming the beneficial role of bipartite entanglement\nand coherence in this algorithm.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:35:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kumar","Pradeep",""],["Konar","Tanoy Kanti",""],["Lakkaraju","Leela Ganesh Chandra",""],["De","Aditi Sen",""]]}
{"id":"2308.04022","submitter":"Quan Li","authors":"Longfei Chen, Qianyu Liu, Chenyang Zhang, Yangkun Huang, Zhenhui Peng,\n  Haipeng Zeng, Zhida Sun, Xiaojuan Ma, and Quan Li","title":"Amplifying the Music Listening Experience through Song Comments on Music\n  Streaming Platforms","comments":"In the Proceedings of ChinaVis 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Music streaming services are increasingly popular among younger generations\nwho seek social experiences through personal expression and sharing of\nsubjective feelings in comments. However, such emotional aspects are often\nignored by current platforms, which affects the listeners' ability to find\nmusic that triggers specific personal feelings. To address this gap, this study\nproposes a novel approach that leverages deep learning methods to capture\ncontextual keywords, sentiments, and induced mechanisms from song comments. The\nstudy augments a current music app with two features, including the\npresentation of tags that best represent song comments and a novel map metaphor\nthat reorganizes song comments based on chronological order, content, and\nsentiment. The effectiveness of the proposed approach is validated through a\nusage scenario and a user study that demonstrate its capability to improve the\nuser experience of exploring songs and browsing comments of interest. This\nstudy contributes to the advancement of music streaming services by providing a\nmore personalized and emotionally rich music experience for younger\ngenerations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:35:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Longfei",""],["Liu","Qianyu",""],["Zhang","Chenyang",""],["Huang","Yangkun",""],["Peng","Zhenhui",""],["Zeng","Haipeng",""],["Sun","Zhida",""],["Ma","Xiaojuan",""],["Li","Quan",""]]}
{"id":"2308.04023","submitter":"Tengren Zhang","authors":"Richard Canary, Andrew Zimmer, Tengren Zhang","title":"Patterson-Sullivan measures for relatively Anosov groups","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish existence, uniqueness and ergodicity results for\nPatterson-Sullivan measures for relatively Anosov groups. As applications we\nobtain an entropy gap theorem and a strict concavity result for entropies\nassociated to linear functionals.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:37:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Canary","Richard",""],["Zimmer","Andrew",""],["Zhang","Tengren",""]]}
{"id":"2308.04024","submitter":"Jonathan Jaegerman","authors":"Hasham Burhani, Xiao Qi Shi, Jonathan Jaegerman, Daniel Balicki","title":"Scope Loss for Imbalanced Classification and RL Exploration","comments":"11 pages, 2 figures, under review for NeurIPS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate equivalence between the reinforcement learning problem and the\nsupervised classification problem. We consequently equate the exploration\nexploitation trade-off in reinforcement learning to the dataset imbalance\nproblem in supervised classification, and find similarities in how they are\naddressed. From our analysis of the aforementioned problems we derive a novel\nloss function for reinforcement learning and supervised classification. Scope\nLoss, our new loss function, adjusts gradients to prevent performance losses\nfrom over-exploitation and dataset imbalances, without the need for any tuning.\nWe test Scope Loss against SOTA loss functions over a basket of benchmark\nreinforcement learning tasks and a skewed classification dataset, and show that\nScope Loss outperforms other loss functions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:40:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Burhani","Hasham",""],["Shi","Xiao Qi",""],["Jaegerman","Jonathan",""],["Balicki","Daniel",""]]}
{"id":"2308.04025","submitter":"Yu Pan","authors":"Yu Pan","title":"MSAC: Multiple Speech Attribute Control Method for Speech Emotion\n  Recognition","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.MM eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Despite significant progress, speech emotion recognition (SER) remains\nchallenging due to inherent complexity and ambiguity of the emotion attribute,\nparticularly in wild world. Whereas current studies primarily focus on\nrecognition and generalization capabilities, this work pioneers an exploration\ninto the reliability of SER methods and investigates how to model the speech\nemotion from the aspect of data distribution across various speech attributes.\nSpecifically, we first build a novel CNN-based SER model which adopts additive\nmargin softmax loss to expand the distance between features of different\nclasses, thereby enhancing their discrimination. Second, a novel multiple\nspeech attribute control method MSAC is proposed to explicitly control speech\nattributes, enabling the model to be less affected by emotion-agnostic\nattributes and capture more fine-grained emotion-related features. Third, we\nmake a first attempt to test and analyze the reliability of the proposed SER\nworkflow using the out-of-distribution detection method. Extensive experiments\non both single and cross-corpus SER scenarios show that our proposed unified\nSER workflow consistently outperforms the baseline in terms of recognition,\ngeneralization, and reliability performance. Besides, in single-corpus SER, the\nproposed SER workflow achieves superior recognition results with a WAR of\n72.97\\% and a UAR of 71.76\\% on the IEMOCAP corpus.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:43:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pan","Yu",""]]}
{"id":"2308.04026","submitter":"Jiaju Lin","authors":"Jiaju Lin, Haoran Zhao, Aochi Zhang, Yiting Wu, Huqiuyue Ping, Qin\n  Chen","title":"AgentSims: An Open-Source Sandbox for Large Language Model Evaluation","comments":"submit to EMNLP2023 demo track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With ChatGPT-like large language models (LLM) prevailing in the community,\nhow to evaluate the ability of LLMs is an open question. Existing evaluation\nmethods suffer from following shortcomings: (1) constrained evaluation\nabilities, (2) vulnerable benchmarks, (3) unobjective metrics. We suggest that\ntask-based evaluation, where LLM agents complete tasks in a simulated\nenvironment, is a one-for-all solution to solve above problems. We present\nAgentSims, an easy-to-use infrastructure for researchers from all disciplines\nto test the specific capacities they are interested in. Researchers can build\ntheir evaluation tasks by adding agents and buildings on an interactive GUI or\ndeploy and test new support mechanisms, i.e. memory, planning and tool-use\nsystems, by a few lines of codes. Our demo is available at\nhttps://agentsims.com .\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:59:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lin","Jiaju",""],["Zhao","Haoran",""],["Zhang","Aochi",""],["Wu","Yiting",""],["Ping","Huqiuyue",""],["Chen","Qin",""]]}
{"id":"2308.04027","submitter":"Sen Hu","authors":"Sen Hu and Andrey Losev","title":"Feynman geometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we introduce a notion of Feynman geometry on which quantum\nfield theories could be properly defined. A strong Feynman geometry is a\ngeometry when the vector space of $A_\\infty$ structures is finite dimensional.\nA weak Feynman geometry is a geometry when the vector space of $A_\\infty$\nstructures is infinite dimensional while the relevant operators are of\ntrace-class. We construct families of Feynman geometries with \"continuum\" as\ntheir limit.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:03:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Sen",""],["Losev","Andrey",""]]}
{"id":"2308.04028","submitter":"Shashank Gupta","authors":"Shashank Gupta","title":"Top K Relevant Passage Retrieval for Biomedical Question Answering","comments":"6 pages, 5 figures. arXiv admin note: text overlap with\n  arXiv:2004.04906 by other authors","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":"  Question answering is a task that answers factoid questions using a large\ncollection of documents. It aims to provide precise answers in response to the\nuser's questions in natural language. Question answering relies on efficient\npassage retrieval to select candidate contexts, where traditional sparse vector\nspace models, such as TF-IDF or BM25, are the de facto method. On the web,\nthere is no single article that could provide all the possible answers\navailable on the internet to the question of the problem asked by the user. The\nexisting Dense Passage Retrieval model has been trained on Wikipedia dump from\nDec. 20, 2018, as the source documents for answering questions. Question\nanswering (QA) has made big strides with several open-domain and machine\ncomprehension systems built using large-scale annotated datasets. However, in\nthe clinical domain, this problem remains relatively unexplored. According to\nmultiple surveys, Biomedical Questions cannot be answered correctly from\nWikipedia Articles. In this work, we work on the existing DPR framework for the\nbiomedical domain and retrieve answers from the Pubmed articles which is a\nreliable source to answer medical questions. When evaluated on a BioASQ QA\ndataset, our fine-tuned dense retriever results in a 0.81 F1 score.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:06:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gupta","Shashank",""]]}
{"id":"2308.04029","submitter":"Xiaomin Lin","authors":"Aadi Palnitkar, Rashmi Kapu, Xiaomin Lin, Cheng Liu, Nare Karapetyan,\n  Yiannis Aloimonos","title":"ChatSim: Underwater Simulation with Natural Language Prompting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robots are becoming an essential part of many operations including marine\nexploration or environmental monitoring. However, the underwater environment\npresents many challenges, including high pressure, limited visibility, and\nharsh conditions that can damage equipment. Real-world experimentation can be\nexpensive and difficult to execute. Therefore, it is essential to simulate the\nperformance of underwater robots in comparable environments to ensure their\noptimal functionality within practical real-world contexts.OysterSim generates\nphoto-realistic images and segmentation masks of objects in marine\nenvironments, providing valuable training data for underwater computer vision\napplications. By integrating ChatGPT into underwater simulations, users can\nconvey their thoughts effortlessly and intuitively create desired underwater\nenvironments without intricate coding. \\invis{Moreover, researchers can realize\nsubstantial time and cost savings by evaluating their algorithms across diverse\nunderwater conditions in the simulation.} The objective of ChatSim is to\nintegrate Large Language Models (LLM) with a simulation\nenvironment~(OysterSim), enabling direct control of the simulated environment\nvia natural language input. This advancement can greatly enhance the\ncapabilities of underwater simulation, with far-reaching benefits for marine\nexploration and broader scientific research endeavors.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:08:40 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 12:47:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Palnitkar","Aadi",""],["Kapu","Rashmi",""],["Lin","Xiaomin",""],["Liu","Cheng",""],["Karapetyan","Nare",""],["Aloimonos","Yiannis",""]]}
{"id":"2308.04030","submitter":"Zhiyuan Peng","authors":"Binfeng Xu, Xukun Liu, Hua Shen, Zeyu Han, Yuhan Li, Murong Yue,\n  Zhiyuan Peng, Yuchen Liu, Ziyu Yao, Dongkuan Xu","title":"Gentopia: A Collaborative Platform for Tool-Augmented LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Augmented Language Models (ALMs) empower large language models with the\nability to use tools, transforming them into intelligent agents for real-world\ninteractions. However, most existing frameworks for ALMs, to varying degrees,\nare deficient in the following critical features: flexible customization,\ncollaborative democratization, and holistic evaluation. We present gentopia, an\nALM framework enabling flexible customization of agents through simple\nconfigurations, seamlessly integrating various language models, task formats,\nprompting modules, and plugins into a unified paradigm. Furthermore, we\nestablish gentpool, a public platform enabling the registration and sharing of\nuser-customized agents. Agents registered in gentpool are composable such that\nthey can be assembled together for agent collaboration, advancing the\ndemocratization of artificial intelligence. To ensure high-quality agents,\ngentbench, an integral component of gentpool, is designed to thoroughly\nevaluate user-customized agents across diverse aspects such as safety,\nrobustness, efficiency, etc. We release gentopia on Github and will\ncontinuously move forward.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:12:29 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xu","Binfeng",""],["Liu","Xukun",""],["Shen","Hua",""],["Han","Zeyu",""],["Li","Yuhan",""],["Yue","Murong",""],["Peng","Zhiyuan",""],["Liu","Yuchen",""],["Yao","Ziyu",""],["Xu","Dongkuan",""]]}
{"id":"2308.04031","submitter":"Takumi Otani","authors":"Takumi Otani, Yuuki Shiraishi, Atsushi Takahashi","title":"The number of full exceptional collections modulo spherical twists for\n  extended Dynkin quivers","comments":"27 pages, 1 figure, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CO math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper calculates the number of full exceptional collections modulo an\naction of a free abelian group of rank one for an abelian category of coherent\nsheaves on an orbifold projective line with a positive orbifold Euler\ncharacteristic, which is equivalent to the one of finite dimensional modules\nover an extended Dynkin quiver of ADE type by taking their derived categories.\nThis is done by a recursive formula naturally generalizing the one for the\nDynkin case by Deligne whose categorical interpretation is due to\nObaid--Nauman--Shammakh--Fakieh--Ringel.\n  Moreover, the number coincides with the degree of the Lyashko--Looijenga map\nof the Frobenius manifold for the orbifold projective line, which hints a\nconsistency in some problems in Bridgeland's stability conditions and mirror\nsymmetry.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:14:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Otani","Takumi",""],["Shiraishi","Yuuki",""],["Takahashi","Atsushi",""]]}
{"id":"2308.04032","submitter":"Balaram Panda","authors":"Etienne Naude (1), Henry Gann (1), Balaram Panda (1), Lance Zhang (1),\n  Raina Song (1), Yuwei Shen (1) ((1) The University of Auckland)","title":"Measure of Uncertainty in Human Emotions","comments":"A revised title has been adopted, differing from the original\n  (\"Investigating the impact machine emotion classification uncertainty\n  displays have on the human decision making process\"), in order to better\n  encapsulate the research findings within the context","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many research explore how well computers are able to examine emotions\ndisplayed by humans and use that data to perform different tasks. However,\nthere have been very few research which evaluate the computers ability to\ngenerate emotion classification information in an attempt to help the user make\ndecisions or perform tasks. This is a crucial area to explore as it is\nparamount to the two way communication between humans and computers. This\nresearch conducted an experiment to investigate the impact of different\nuncertainty information displays of emotion classification on the human\ndecision making process. Results show that displaying more uncertainty\ninformation can help users to be more confident when making decisions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:17:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Naude","Etienne","","The University of Auckland"],["Gann","Henry","","The University of Auckland"],["Panda","Balaram","","The University of Auckland"],["Zhang","Lance","","The University of Auckland"],["Song","Raina","","The University of Auckland"],["Shen","Yuwei","","The University of Auckland"]]}
{"id":"2308.04033","submitter":"Manikanta Kotaru","authors":"Manikanta Kotaru","title":"Adapting Foundation Models for Information Synthesis of Wireless\n  Communication Specifications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing approaches to understanding, developing and researching modern\nwireless communication technologies involves time-intensive and arduous process\nof sifting through numerous webpages and technical specification documents,\ngathering the required information and synthesizing it. This paper presents\nNextGen Communications Copilot, a conversational artificial intelligence tool\nfor information synthesis of wireless communication specifications. The system\nbuilds on top of recent advancements in foundation models and consists of three\nkey additional components: a domain-specific database, a context extractor, and\na feedback mechanism. The system appends user queries with concise and\nquery-dependent contextual information extracted from a database of wireless\ntechnical specifications and incorporates tools for expert feedback and data\ncontributions. On evaluation using a benchmark dataset of queries and reference\nresponses created by subject matter experts, the system demonstrated more\nrelevant and accurate answers with an average BLEU score and BERTScore\nF1-measure of 0.37 and 0.79 respectively compared to the corresponding values\nof 0.07 and 0.59 achieved by state-of-the-art tools like ChatGPT.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:21:14 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 20:34:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kotaru","Manikanta",""]]}
{"id":"2308.04034","submitter":"Utku Tefek","authors":"Utku Tefek, Ertem Esiner, Daisuke Mashima, Binbin Chen, Yih-Chun Hu","title":"Caching-based Multicast Message Authentication in Time-critical\n  Industrial Control Systems","comments":"For viewing INFOCOM proceedings in IEEE Xplore see\n  https://ieeexplore.ieee.org/abstract/document/9796767","journal-ref":"IEEE Conference on Computer Communications, London, United\n  Kingdom, 2022, pp. 1039-1048","doi":"10.1109/INFOCOM48880.2022.9796767","report-no":null,"categories":"cs.CR cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Attacks against industrial control systems (ICSs) often exploit the\ninsufficiency of authentication mechanisms. Verifying whether the received\nmessages are intact and issued by legitimate sources can prevent malicious\ndata/command injection by illegitimate or compromised devices. However, the key\nchallenge is to introduce message authentication for various ICS communication\nmodels, including multicast or broadcast, with a messaging rate that can be as\nhigh as thousands of messages per second, within very stringent latency\nconstraints. For example, certain commands for protection in smart grids must\nbe delivered within 2 milliseconds, ruling out public-key cryptography. This\npaper proposes two lightweight message authentication schemes, named CMA and\nits multicast variant CMMA, that perform precomputation and caching to\nauthenticate future messages. With minimal precomputation and communication\noverhead, C(M)MA eliminates all cryptographic operations for the source after\nthe message is given, and all expensive cryptographic operations for the\ndestinations after the message is received. C(M)MA considers the urgency\nprofile (or likelihood) of a set of future messages for even faster\nverification of the most time-critical (or likely) messages. We demonstrate the\nfeasibility of C(M)MA in an ICS setting based on a substation automation system\nin smart grids.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:21:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tefek","Utku",""],["Esiner","Ertem",""],["Mashima","Daisuke",""],["Chen","Binbin",""],["Hu","Yih-Chun",""]]}
{"id":"2308.04036","submitter":"Juan Jos\\'e G\\'omez Rodr\\'iguez","authors":"Juan J. Gomez Rodriguez, J.M.M Montiel, Juan D. Tardos","title":"NR-SLAM: Non-Rigid Monocular SLAM","comments":"12 pages, 7 figures, submited to the IEEE Transactions on Robotics\n  (T-RO)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we present NR-SLAM, a novel non-rigid monocular SLAM system\nfounded on the combination of a Dynamic Deformation Graph with a Visco-Elastic\ndeformation model. The former enables our system to represent the dynamics of\nthe deforming environment as the camera explores, while the later allows us to\nmodel general deformations in a simple way. The presented system is able to\nautomatically initialize and extend a map modeled by a sparse point cloud in\ndeforming environments, that is refined with a sliding-window Deformable Bundle\nAdjustment. This map serves as base for the estimation of the camera motion and\ndeformation and enables us to represent arbitrary surface topologies,\novercoming the limitations of previous methods. To assess the performance of\nour system in challenging deforming scenarios, we evaluate it in several\nrepresentative medical datasets. In our experiments, NR-SLAM outperforms\nprevious deformable SLAM systems, achieving millimeter reconstruction accuracy\nand bringing automated medical intervention closer. For the benefit of the\ncommunity, we make the source code public.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:24:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rodriguez","Juan J. Gomez",""],["Montiel","J. M. M",""],["Tardos","Juan D.",""]]}
{"id":"2308.04037","submitter":"Mamata Das","authors":"Mamata Das, Selvakumar K., P.J.A. Alphonse","title":"A Comparative Study on TF-IDF feature Weighting Method and its Analysis\n  using Unstructured Dataset","comments":"10 pages, 3 figures, COLINS-2021, 5th International Conference on\n  Computational Linguistics and Intelligent Systems, April 22-23, 2021,\n  Kharkiv, Ukraine","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text Classification is the process of categorizing text into the relevant\ncategories and its algorithms are at the core of many Natural Language\nProcessing (NLP). Term Frequency-Inverse Document Frequency (TF-IDF) and NLP\nare the most highly used information retrieval methods in text classification.\nWe have investigated and analyzed the feature weighting method for text\nclassification on unstructured data. The proposed model considered two features\nN-Grams and TF-IDF on the IMDB movie reviews and Amazon Alexa reviews dataset\nfor sentiment analysis. Then we have used the state-of-the-art classifier to\nvalidate the method i.e., Support Vector Machine (SVM), Logistic Regression,\nMultinomial Naive Bayes (Multinomial NB), Random Forest, Decision Tree, and\nk-nearest neighbors (KNN). From those two feature extractions, a significant\nincrease in feature extraction with TF-IDF features rather than based on\nN-Gram. TF-IDF got the maximum accuracy (93.81%), precision (94.20%), recall\n(93.81%), and F1-score (91.99%) value in Random Forest classifier.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:27:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Das","Mamata",""],["K.","Selvakumar",""],["Alphonse","P. J. A.",""]]}
{"id":"2308.04038","submitter":"Saara Sarsa","authors":"Arttu Karppinen and Saara Sarsa","title":"Local second order regularity of solutions to elliptic Orlicz-Laplace\n  equation","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider Orlicz--Laplace equation $-div(\\frac{\\varphi'(|\\nabla\nu|)}{|\\nabla u|}\\nabla u)=f$ where $\\varphi$ is an Orlicz function and either\n$f=0$ or $f\\in L^\\infty$. We prove local second order regularity results for\nthe weak solutions $u$ of the Orlicz--Laplace equation. More precisely, we show\nthat if $\\psi$ is another Orlicz function that is close to $\\varphi$ in a\nsuitable sense, then $\\frac{\\psi'(|\\nabla u|)}{|\\nabla u|}\\nabla u\\in\nW^{1,2}_{loc}$. This work contributes to the building up of quantitative second\norder Sobolev regularity for solutions of nonlinear equations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:29:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Karppinen","Arttu",""],["Sarsa","Saara",""]]}
{"id":"2308.04039","submitter":"Micha{\\l} Byra","authors":"Michal Byra, Charissa Poon, Tomomi Shimogori, Henrik Skibbe","title":"Implicit neural representations for joint decomposition and registration\n  of gene expression images in the marmoset brain","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose a novel image registration method based on implicit neural\nrepresentations that addresses the challenging problem of registering a pair of\nbrain images with similar anatomical structures, but where one image contains\nadditional features or artifacts that are not present in the other image. To\ndemonstrate its effectiveness, we use 2D microscopy $\\textit{in situ}$\nhybridization gene expression images of the marmoset brain. Accurately\nquantifying gene expression requires image registration to a brain template,\nwhich is difficult due to the diversity of patterns causing variations in\nvisible anatomical brain structures. Our approach uses implicit networks in\ncombination with an image exclusion loss to jointly perform the registration\nand decompose the image into a support and residual image. The support image\naligns well with the template, while the residual image captures individual\nimage characteristics that diverge from the template. In experiments, our\nmethod provided excellent results and outperformed other registration\ntechniques.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:30:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Byra","Michal",""],["Poon","Charissa",""],["Shimogori","Tomomi",""],["Skibbe","Henrik",""]]}
{"id":"2308.04040","submitter":"Yun Wang","authors":"Yun Wang, Leixian Shen, Zhengxin You, Xinhuan Shu, Bongshin Lee, John\n  Thompson, Haidong Zhang, and Dongmei Zhang","title":"WonderFlow: Narration-Centric Design of Animated Data Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Creating an animated data video enriched with audio narration takes a\nsignificant amount of time and effort and requires expertise. Users not only\nneed to design complex animations, but also turn written text scripts into\naudio narrations and synchronize visual changes with the narrations. This paper\npresents WonderFlow, an interactive authoring tool, that facilitates\nnarration-centric design of animated data videos. WonderFlow allows authors to\neasily specify a semantic link between text and the corresponding chart\nelements. Then it automatically generates audio narration by leveraging\ntext-to-speech techniques and aligns the narration with an animation.\nWonderFlow provides a visualization structure-aware animation library designed\nto ease chart animation creation, enabling authors to apply pre-designed\nanimation effects to common visualization components. It also allows authors to\npreview and iteratively refine their data videos in a unified system, without\nhaving to switch between different creation tools. To evaluate WonderFlow's\neffectiveness and usability, we created an example gallery and conducted a user\nstudy and expert interviews. The results demonstrated that WonderFlow is easy\nto use and simplifies the creation of data videos with narration-animation\ninterplay.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:31:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Yun",""],["Shen","Leixian",""],["You","Zhengxin",""],["Shu","Xinhuan",""],["Lee","Bongshin",""],["Thompson","John",""],["Zhang","Haidong",""],["Zhang","Dongmei",""]]}
{"id":"2308.04041","submitter":"Shuai Zhang","authors":"Shuai Zhang, Xiaodong Gu, Yuting Chen, Beijun Shen","title":"InfeRE: Step-by-Step Regex Generation via Chain of Inference","comments":"This paper has been accepted by ASE'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatically generating regular expressions (abbrev. regexes) from natural\nlanguage description (NL2RE) has been an emerging research area. Prior studies\ntreat regex as a linear sequence of tokens and generate the final expressions\nautoregressively in a single pass. They did not take into account the\nstep-by-step internal text-matching processes behind the final results. This\nsignificantly hinders the efficacy and interpretability of regex generation by\nneural language models. In this paper, we propose a new paradigm called InfeRE,\nwhich decomposes the generation of regexes into chains of step-by-step\ninference. To enhance the robustness, we introduce a self-consistency decoding\nmechanism that ensembles multiple outputs sampled from different models. We\nevaluate InfeRE on two publicly available datasets, NL-RX-Turk and KB13, and\ncompare the results with state-of-the-art approaches and the popular tree-based\ngeneration approach TRANX. Experimental results show that InfeRE substantially\noutperforms previous baselines, yielding 16.3% and 14.7% improvement in DFA@5\naccuracy on two datasets, respectively. Particularly, InfeRE outperforms the\npopular tree-based generation approach by 18.1% and 11.3% on both datasets,\nrespectively, in terms of DFA@5 accuracy.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:37:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Shuai",""],["Gu","Xiaodong",""],["Chen","Yuting",""],["Shen","Beijun",""]]}
{"id":"2308.04042","submitter":"Zhiyao Hu","authors":"Zhiyao Hu, Qixian Li, Xuanchen Zhang, He-bin Zhang, Long-Gang Huang,\n  Yong-Chun Liu","title":"Nonlinear time-reversal interferometry with arbitrary quadratic\n  collective-spin interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atomic nonlinear interferometry has wide applications in quantum metrology\nand quantum information science. Here we propose a nonlinear time-reversal\ninterferometry scheme with high robustness and metrological gain based on the\nspin squeezing generated by arbitrary quadratic collective-spin interaction,\nwhich could be described by the Lipkin-Meshkov-Glick (LMG) model. We optimize\nthe squeezing process, encoding process, and anti-squeezing process, finding\nthat the two particular cases of the LMG model, one-axis twisting and two-axis\ntwisting outperform in robustness and precision, respectively. Moreover, we\npropose a Floquet driving method to realize equivalent time reverse in the\natomic system, which leads to high performance in precision, robustness, and\noperability. Our study sets a benchmark in achieving high precision and\nrobustness in atomic nonlinear interferometry.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:39:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Zhiyao",""],["Li","Qixian",""],["Zhang","Xuanchen",""],["Zhang","He-bin",""],["Huang","Long-Gang",""],["Liu","Yong-Chun",""]]}
{"id":"2308.04043","submitter":"Alex Taekyung Lee","authors":"Huu T. Do, Alex Taekyung Lee, Hyowon Park, Anh T. Ngo","title":"Delocalized polaron and Burstein-Moss shift induced by Li in\n  $\\alpha$-$\\textrm{V}_{2}\\textrm{O}_{5}$: DFT+DMFT study","comments":"12 pages, 13 figures","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":"  We performed density functional theory (DFT)+$U$ and dynamical mean field\ntheory (DMFT) calculations with continuous time quantum Monte Carlo impurity\nsolver to investigate the electronic properties of V$_2$O$_5$ and\nLi$_x$V$_2$O$_5$ ($x$ = 0.125 and 0.25). Pristine V$_2$O$_5$ is a\ncharge-transfer insulator with strong O $p$-V $d$ hybridization, and exhibits a\nlarge band gap ($E_{\\textrm{gap}}$) as well as non-zero conduction band (CB)\ngap. We show that the band gap, the number of $d$ electrons of vanadium, $N_d$,\nand conduction band (CB) gap for V$_2$O$_5$ obtained from our DMFT calculations\nare in excellent agreement with the experimental values. While the DFT+$U$\napproach replicates the experimental band gap, it overestimates the value of\n$N_d$ and underestimates the CB gap. In the presence of low Li doping, the\nelectronic properties of V$_2$O$_5$ are mainly driven by a polaronic mechanism,\nthe electron spin resonance and electron nuclear double resonance\nspectroscopies observed the coexistence of free and bound polarons. Notably,\nour DMFT results identify both polaron types, with the bound polaron being\nenergetically preferred, while DFT+$U$ method predicts only the free polaron.\nOur DMFT analysis also reveals that increased Li doping leads to electron\nfilling in the conduction band, shifting the Fermi level, this result\nconsistent with the observed Burstein-Moss shift upon enhanced Li doping and we\nthus demonstrate that the DFT+DMFT approach can be used for accurate and\nrealistic description of strongly correlated materials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:40:39 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:58:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Do","Huu T.",""],["Lee","Alex Taekyung",""],["Park","Hyowon",""],["Ngo","Anh T.",""]]}
{"id":"2308.04044","submitter":"Zhichao Wang","authors":"Yevgeny Liokumovich and Zhichao Wang","title":"On the waist and width inequality in complete 3-manifolds with positive\n  scalar curvature","comments":"19 pages; 3 figures; comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that a complete non-compact 3-manifold with scalar curvature bounded\nbelow by a positive constant admits a singular foliation by surfaces of\ncontrolled area and diameter.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:44:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liokumovich","Yevgeny",""],["Wang","Zhichao",""]]}
{"id":"2308.04045","submitter":"Gary Froyland","authors":"Gary Froyland, Dimitrios Giannakis, Edoardo Luna, Joanna Slawinska","title":"Revealing trends and persistent cycles of non-autonomous systems with\n  operator-theoretic techniques: Applications to past and present climate\n  dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An important problem in modern applied science is characterizing the behavior\nof systems with complex internal dynamics subjected to external forcings from\ntheir environment. While a great variety of techniques has been developed to\nanalyze such non-autonomous systems, many approaches rely on the availability\nof ensembles of experiments or simulations in order to generate sufficient\ninformation to encapsulate the external forcings. This makes them unsuitable to\nstudy important classes of natural systems such as climate dynamics where only\na single realization is observed. Here, we show that operator-theoretic\ntechniques previously developed to identify slowly decaying observables of\nautonomous dynamical systems provide a powerful means for identifying trends\nand persistent cycles of non-autonomous systems using data from a \\emph{single}\ntrajectory of the system. Using systematic mathematical analysis and prototype\nexamples, we demonstrate that eigenfunctions of Koopman and transfer operators\nprovide coordinates that simultaneously capture nonlinear trends and coherent\nmodes of internal variability. In addition, we apply our framework to two\nreal-world examples from present and past climate dynamics: Variability of sea\nsurface temperature (SST) over the industrial era and the mid-Pleistocene\ntransition (MPT) of Quaternary glaciation cycles. Our results provide a\nnonparametric representation of SST and surface air temperature (SAT) trends\nover the industrial era, while also capturing the response of the seasonal\nprecipitation cycle to these trends. In addition, our paleo-climate analysis\nreveals the dominant glaciation cycles over the past 3 million years and the\nMPT with a high level of granularity.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:46:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Froyland","Gary",""],["Giannakis","Dimitrios",""],["Luna","Edoardo",""],["Slawinska","Joanna",""]]}
{"id":"2308.04046","submitter":"Max C. Lemme","authors":"Nour Negm, Sarah Zayouna, Shayan Parhizkar, Pen-Sheng Lin, Po-Han\n  Huang, Stephan Suckow, Stephan Schroeder, Eleonora De Luca, Floria Ottonello\n  Briano, Arne Quellmalz, Georg S. Duesberg, Frank Niklaus, Kristinn B.\n  Gylfason, Max C. Lemme","title":"Graphene thermal infrared emitters integrated into silicon photonic\n  waveguides","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cost-efficient and easily integrable broadband mid-infrared (mid-IR) sources\nwould significantly enhance the application space of photonic integrated\ncircuits (PICs). Thermal incandescent sources are superior to other common\nmid-IR emitters based on semiconductor materials in terms of PIC compatibility,\nmanufacturing costs, and bandwidth. Ideal thermal emitters would radiate\ndirectly into the desired modes of the PIC waveguides via near-field coupling\nand would be stable at very high temperatures. Graphene is a semi-metallic\ntwo-dimensional material with comparable emissivity to thin metallic thermal\nemitters. It allows maximum coupling into waveguides by placing it directly\ninto their evanescent fields. Here, we demonstrate graphene mid-IR emitters\nintegrated with photonic waveguides that couple directly into the fundamental\nmode of silicon waveguides designed for a wavelength of 4,2 {\\mu}m relevant for\nCO${_2}$ sensing. High broadband emission intensity is observed at the\nwaveguide-integrated graphene emitter. The emission at the output grating\ncouplers confirms successful coupling into the waveguide mode. Thermal\nsimulations predict emitter temperatures up to 1000{\\deg}C, where the blackbody\nradiation covers the mid-IR region. A coupling efficiency {\\eta}, defined as\nthe light emitted into the waveguide divided by the total emission, of up to\n68% is estimated, superior to data published for other waveguide-integrated\nemitters.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:47:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Negm","Nour",""],["Zayouna","Sarah",""],["Parhizkar","Shayan",""],["Lin","Pen-Sheng",""],["Huang","Po-Han",""],["Suckow","Stephan",""],["Schroeder","Stephan",""],["De Luca","Eleonora",""],["Briano","Floria Ottonello",""],["Quellmalz","Arne",""],["Duesberg","Georg S.",""],["Niklaus","Frank",""],["Gylfason","Kristinn B.",""],["Lemme","Max C.",""]]}
{"id":"2308.04047","submitter":"Dianze Li","authors":"Dianze Li and Jianing Li and Yonghong Tian","title":"SODFormer: Streaming Object Detection with Transformer Using Events and\n  Frames","comments":"18 pages, 15 figures, in IEEE Transactions on Pattern Analysis and\n  Machine Intelligence","journal-ref":null,"doi":"10.1109/TPAMI.2023.3298925","report-no":null,"categories":"cs.CV cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  DAVIS camera, streaming two complementary sensing modalities of asynchronous\nevents and frames, has gradually been used to address major object detection\nchallenges (e.g., fast motion blur and low-light). However, how to effectively\nleverage rich temporal cues and fuse two heterogeneous visual streams remains a\nchallenging endeavor. To address this challenge, we propose a novel streaming\nobject detector with Transformer, namely SODFormer, which first integrates\nevents and frames to continuously detect objects in an asynchronous manner.\nTechnically, we first build a large-scale multimodal neuromorphic object\ndetection dataset (i.e., PKU-DAVIS-SOD) over 1080.1k manual labels. Then, we\ndesign a spatiotemporal Transformer architecture to detect objects via an\nend-to-end sequence prediction problem, where the novel temporal Transformer\nmodule leverages rich temporal cues from two visual streams to improve the\ndetection performance. Finally, an asynchronous attention-based fusion module\nis proposed to integrate two heterogeneous sensing modalities and take\ncomplementary advantages from each end, which can be queried at any time to\nlocate objects and break through the limited output frequency from synchronized\nframe-based fusion strategies. The results show that the proposed SODFormer\noutperforms four state-of-the-art methods and our eight baselines by a\nsignificant margin. We also show that our unifying framework works well even in\ncases where the conventional frame-based camera fails, e.g., high-speed motion\nand low-light conditions. Our dataset and code can be available at\nhttps://github.com/dianzl/SODFormer.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:53:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Dianze",""],["Li","Jianing",""],["Tian","Yonghong",""]]}
{"id":"2308.04048","submitter":"Jitender Kumar","authors":"Praveen Mathil, Jitender Kumar","title":"Characterization of rings with genus two prime ideal sum graphs","comments":"13 figures, Asian-European Journal of Mathematics, Accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $R$ be a commutative ring with unity. The prime ideal sum graph of the\nring $R$ is a simple undirected graph whose vertex set is the set of nonzero\nproper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and\nonly if $I + J$ is a prime ideal of $R$. In this paper, we characterize all the\nfinite non-local commutative rings whose prime ideal sum graph is of genus $2$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:53:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mathil","Praveen",""],["Kumar","Jitender",""]]}
{"id":"2308.04049","submitter":"H\\'ector Camilo Chaparro Camilo","authors":"Ren\\'e Erlin Castillo and H\\'ector Camilo Chaparro","title":"$p$-Laplacian operator with potential in generalized Morrey Spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study some basic properties of generalized Morrey spaces\n$\\mathcal{M}^{p,\\phi}(\\R^{d})$. Also, the problem $-\\mbox{div}(|\\nabla\nu|^{p-2}\\nabla u)+V|u|^{p-2}u=0$ in $\\Omega$, where $\\Omega$ is a bounded open\nset in $\\R^d$, and potential $V$ is assumed to be not equivalent to zero and\nlies in $\\mathcal{M}^{p,\\phi}(\\Omega)$, is studied. Finally, we establish the\nstrong unique continuation for the $p$-Laplace operator in the case\n$V\\in\\mathcal{M}^{p,\\phi}(\\R^d)$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:54:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Castillo","Ren\u00e9 Erlin",""],["Chaparro","H\u00e9ctor Camilo",""]]}
{"id":"2308.04050","submitter":"Anju Panthi","authors":"Anju Panthi, Annapurni Subramaniam, Kaushar Vaidya, Vikrant Jadhav,\n  Sharmila Rani, Sivarani Thirupathi, Sindhu Pandey","title":"Field blue straggler stars: Discovery of white dwarf companions to blue\n  metal-poor stars using UVIT/AstroSat","comments":null,"journal-ref":null,"doi":"10.1093/mnras/stad2385","report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Blue metal-poor (BMP) stars are the main-sequence stars that appear bluer and\nmore luminous than normal turn-off stars of metal-poor globular clusters. They\nare believed to be either field blue straggler stars (FBSS) formed via\npost-mass transfer mechanism or accreted from dwarf satellite galaxies of the\nMilky Way. A significant fraction of BMP stars are discovered to be potential\nbinaries. We observed 27 BMP stars using UVIT/\\textit{AstroSat} in two FUV\nfilters, F148W and F169M. We report the discovery of white dwarf (WD)\ncompanions of 12 BMP stars for the first time. The WD companions have estimated\ntemperatures T$_{eff}$ $\\sim$10500 $-$ 18250 K, and masses 0.17 M$_{\\odot}$ $-$\n0.8 M$_{\\odot}$. Based on [Fe/H] and space velocity, we group the 12 BMP/FBSS\nstars as the thick disk (5) and halo (5), whereas two stars appear to be\nin-between. All the 5 thick disk BMP/FBSS have extremely low-mass (M $<$ 0.2\nM$_{\\odot}$) WDs as companions, whereas the 5 halo BMP/FBSS have low (0.2\nM$_{\\odot}$ $<$ M $<$ 0.4 M$_{\\odot}$), normal (0.4 M$_{\\odot}$ $<$ M $<$\n0.6M$_{\\odot}$), and high mass (M $>$ 0.6 M$_{\\odot}$) WD companions. Our\nanalysis suggests that at least $\\sim$44 $\\%$ of BMP stars are FBSS, and these\nstars hold the key to understand the details of mass transfer, binary\nproperties, and chemical enrichment among the FBSS.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:57:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Panthi","Anju",""],["Subramaniam","Annapurni",""],["Vaidya","Kaushar",""],["Jadhav","Vikrant",""],["Rani","Sharmila",""],["Thirupathi","Sivarani",""],["Pandey","Sindhu",""]]}
{"id":"2308.04051","submitter":"Danny D'Agostino","authors":"Danny D'Agostino","title":"Generative Models for Anomaly Detection and Design-Space Dimensionality\n  Reduction in Shape Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.OC physics.data-an physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our work presents a novel approach to shape optimization, that has the\ntwofold objective to improve the efficiency of global optimization algorithms\nwhile promoting the generation of high-quality designs during the optimization\nprocess free of geometrical anomalies. This is accomplished by reducing the\nnumber of the original design variables defining a new reduced subspace where\nthe geometrical variance is maximized and modeling the underlying generative\nprocess of the data via probabilistic linear latent variable models such as\nFactor Analysis and Probabilistic Principal Component Analysis. We show that\nthe data follows approximately a Gaussian distribution when the shape\nmodification method is linear and the design variables are sampled uniformly at\nrandom, due to the direct application of the central limit theorem. The model\nuncertainty is measured in terms of Mahalanobis distance, and the paper\ndemonstrates that anomalous designs tend to exhibit a high value of this\nmetric. This enables the definition of a new optimization model where anomalous\ngeometries are penalized and consequently avoided during the optimization loop.\nThe procedure is demonstrated for hull shape optimization of the DTMB 5415\nmodel, extensively used as an international benchmark for shape optimization\nproblems. The global optimization routine is carried out using Bayesian\nOptimization and the DIRECT algorithm. From the numerical results, the new\nframework improves the convergence of global optimization algorithms, while\nonly designs with high-quality geometrical features are generated through the\noptimization routine thereby avoiding the wastage of precious computationally\nexpensive simulations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:57:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["D'Agostino","Danny",""]]}
{"id":"2308.04052","submitter":"Roman Negri","authors":"Timothy Merino, Roman Negri, Dipika Rajesh, M Charity, Julian Togelius","title":"The Five-Dollar Model: Generating Game Maps and Sprites from Sentence\n  Embeddings","comments":"to be published in AIIDE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The five-dollar model is a lightweight text-to-image generative architecture\nthat generates low dimensional images from an encoded text prompt. This model\ncan successfully generate accurate and aesthetically pleasing content in low\ndimensional domains, with limited amounts of training data. Despite the small\nsize of both the model and datasets, the generated images are still able to\nmaintain the encoded semantic meaning of the textual prompt. We apply this\nmodel to three small datasets: pixel art video game maps, video game sprite\nimages, and down-scaled emoji images and apply novel augmentation strategies to\nimprove the performance of our model on these limited datasets. We evaluate our\nmodels performance using cosine similarity score between text-image pairs\ngenerated by the CLIP VIT-B/32 model.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:16:51 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Merino","Timothy",""],["Negri","Roman",""],["Rajesh","Dipika",""],["Charity","M",""],["Togelius","Julian",""]]}
{"id":"2308.04053","submitter":"Joan Del Castillo","authors":"Joan del Castillo","title":"Enhancing Markov and Chebyshev's inequalities","comments":"6 pages, 1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The idea of the restricted mean has been used to establish a significantly\nimproved version of Markov's inequality that does not require any new\nassumptions. The result immediately extends on Chebyshev's inequalities and\nChernoff's bound. The improved Markov inequality yields a bound that is\nhundreds or thousands of times more accurate than the original Markov bound for\nhigh quantiles in the most prevalent and diverse situations.\n  The Markov inequality benefits from being model-independent, and the\nlong-standing issue of its imprecision is solved. Practically speaking,\navoidance of model risk is decisive when multiple competing models are present\nin a real-world situation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:23:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["del Castillo","Joan",""]]}
{"id":"2308.04054","submitter":"Neehar Peri","authors":"Neehar Peri, Mengtian Li, Benjamin Wilson, Yu-Xiong Wang, James Hays,\n  Deva Ramanan","title":"An Empirical Analysis of Range for 3D Object Detection","comments":"Accepted to ICCV 2023 Workshop - Robustness and Reliability of\n  Autonomous Vehicles in the Open-World","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  LiDAR-based 3D detection plays a vital role in autonomous navigation.\nSurprisingly, although autonomous vehicles (AVs) must detect both near-field\nobjects (for collision avoidance) and far-field objects (for longer-term\nplanning), contemporary benchmarks focus only on near-field 3D detection.\nHowever, AVs must detect far-field objects for safe navigation. In this paper,\nwe present an empirical analysis of far-field 3D detection using the long-range\ndetection dataset Argoverse 2.0 to better understand the problem, and share the\nfollowing insight: near-field LiDAR measurements are dense and optimally\nencoded by small voxels, while far-field measurements are sparse and are better\nencoded with large voxels. We exploit this observation to build a collection of\nrange experts tuned for near-vs-far field detection, and propose simple\ntechniques to efficiently ensemble models for long-range detection that improve\nefficiency by 33% and boost accuracy by 3.2% CDS.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:29:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Peri","Neehar",""],["Li","Mengtian",""],["Wilson","Benjamin",""],["Wang","Yu-Xiong",""],["Hays","James",""],["Ramanan","Deva",""]]}
{"id":"2308.04055","submitter":"Xuejuan Yang","authors":"Qian Wang, X. J. Yang and Aigen Li","title":"The 2175 Angstrom Interstellar Extinction Bump: Is the Wavelength\n  Variable?","comments":"12 pages, 9 figures, 2 tables, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2352","report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The most striking characteristics of the mysterious 2175 Angstrom extinction\nbump, the strongest spectroscopic absorption feature seen on the interstellar\nextinction curve, are the invariant central wavelength and variable bandwidth:\nits peak position at 2175 Angstrom is remarkably constant while its bandwidth\nvaries from one line of sight to another. However, recent studies of the lines\nof sight toward a number of Herbig Ae/Be stars have revealed that the\nextinction bump exhibits substantial shifts from the canonical wavelength of\n2175 Angstrom. In this work we revisit these lines of sight and take a physical\napproach to determine the ultraviolet (UV) extinction curve for each line of\nsight. It is found that the wavelengths of the derived UV extinction bumps are\naround 2200 Angstrom and the scatters are considerably smaller than that of the\nprevious study based on the same set of Herbig Ae/Be stars, consistent with the\nconventional wisdom. Nevertheless, the scatters are still appreciably larger\nthan that associated with the nominal bump position of 2175 Angstrom. This is\ndiscussed in the context that Herbig Ae/Be stars are not well-suited for\ninterstellar extinction studies.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:36:10 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 02:35:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Qian",""],["Yang","X. J.",""],["Li","Aigen",""]]}
{"id":"2308.04056","submitter":"Md Naimul Hoque","authors":"Md Naimul Hoque, Bhavya Ghai, Kari Kraus, Niklas Elmqvist","title":"Portrayal: Leveraging NLP and Visualization for Analyzing Fictional\n  Characters","comments":null,"journal-ref":"Designing Interactive Systems Conference (DIS), 2023","doi":"10.1145/3563657.3596000","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many creative writing tasks (e.g., fiction writing) require authors to write\ncomplex narrative components (e.g., characterization, events, dialogue) over\nthe course of a long story. Similarly, literary scholars need to manually\nannotate and interpret texts to understand such abstract components. In this\npaper, we explore how Natural Language Processing (NLP) and interactive\nvisualization can help writers and scholars in such scenarios. To this end, we\npresent Portrayal, an interactive visualization system for analyzing characters\nin a story. Portrayal extracts natural language indicators from a text to\ncapture the characterization process and then visualizes the indicators in an\ninteractive interface. We evaluated the system with 12 creative writers and\nscholars in a one-week-long qualitative study. Our findings suggest Portrayal\nhelped writers revise their drafts and create dynamic characters and scenes. It\nhelped scholars analyze characters without the need for any manual annotation,\nand design literary arguments with concrete evidence.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:36:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hoque","Md Naimul",""],["Ghai","Bhavya",""],["Kraus","Kari",""],["Elmqvist","Niklas",""]]}
{"id":"2308.04057","submitter":"Yiannis Karavias","authors":"Marco Barassi (1) and Yiannis Karavias (1) and Chongxian Zhu (1) ((1)\n  University of Birmingham)","title":"Threshold Regression in Heterogeneous Panel Data with Interactive Fixed\n  Effects","comments":"25 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces unit-specific heterogeneity in panel data threshold\nregression. Both slope coefficients and threshold parameters are allowed to\nvary by unit. The heterogeneous threshold parameters manifest via a\nunit-specific empirical quantile transformation of a common underlying\nthreshold parameter which is estimated efficiently from the whole panel. In the\nerrors, the unobserved heterogeneity of the panel takes the general form of\ninteractive fixed effects. The newly introduced parameter heterogeneity has\nimplications for model identification, estimation, interpretation, and\nasymptotic inference. The assumption of a shrinking threshold magnitude now\nimplies shrinking heterogeneity and leads to faster estimator rates of\nconvergence than previously encountered. The asymptotic theory for the proposed\nestimators is derived and Monte Carlo simulations demonstrate its usefulness in\nsmall samples. The new model is employed to examine the Feldstein-Horioka\npuzzle and it is found that the trade liberalization policies of the 80's\nsignificantly impacted cross-country capital mobility.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:37:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Barassi","Marco",""],["Karavias","Yiannis",""],["Zhu","Chongxian",""]]}
{"id":"2308.04058","submitter":"Heedong Do","authors":"Heedong Do, Namyoon Lee","title":"Finding Globally Optimal Configuration of Active RIS in Linear Time","comments":null,"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":"  This paper presents an algorithm for finding the optimal configuration of\nactive reconfigurable intelligent surface (RIS) when both transmitter and\nreceiver are equipped with a single antenna each. The resultant configuration\nis globally optimal and it takes linear time for the computation. Moreover,\nthere is a closed-form expression for the optimal configuration when the direct\nlink vanishes, which enables further analysis.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:42:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Do","Heedong",""],["Lee","Namyoon",""]]}
{"id":"2308.04059","submitter":"Martin Gabelmann","authors":"Thi Nhung Dao, Martin Gabelmann, M. Margarete M\\\"uhlleitner","title":"The ${\\cal O}(\\alpha_t+\\alpha_\\lambda+\\alpha_\\kappa)^2$ Correction to\n  the $\\rho$ Parameter and its Effect on the W Boson Mass Calculation in the\n  Complex NMSSM","comments":null,"journal-ref":null,"doi":null,"report-no":"KA-TP-17-2023, DESY-23-112","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the prediction of the electroweak $\\rho$ parameter and the $W$\nboson mass in the CP-violating Next-to-Minimal Supersymmetric extension of the\nStandard Model (NMSSM) at the two-loop order. The $\\rho$ parameter is\ncalculated at the full one-loop and leading and sub-leading two-loop order\n$\\mathcal{O}(\\alpha + \\alpha_t\\alpha_s +\n\\left(\\alpha_t+\\alpha_\\lambda+\\alpha_\\kappa\\right)^2)$. The new $\\Delta \\rho$\nprediction is incorporated into a prediction of $M_W$ via a full supersymmetric\n(SUSY) one-loop calculation of $\\Delta r$. Furthermore, we include all known\nstate-of-the-art SM higher-order corrections to $\\Delta r$. By comparing\nresults for $\\Delta \\rho$ obtained using on-shell (OS) and\n$\\overline{\\mathrm{DR}}$ renormalization conditions in the top/stop sector, we\nfind that the scheme uncertainty is reduced at one-loop order by 55%, at\ntwo-loop $\\mathcal{O}(\\alpha_s\\alpha_t)$ by 22%, and at two-loop\n$\\mathcal{O}(\\alpha_t+\\alpha_\\kappa+\\alpha_\\lambda)^2$ by 16%, respectively.\nThe influence of the two-loop results on the $M_W$ mass prediction is found to\nbe sub-leading. The new calculation is made public in the computer program\n$\\mathrm{\\tt NMSSMCALC}$. We perform an extensive comparison in the $W$-mass,\nHiggs boson mass and the muon anomalous magnetic moment prediction between our\ncalculation and three other publicly available tools and find very good\nagreement provided that the input parameters and renormalization scales are\ntreated in the same way. Finally, we study the impact of the CP-violating\nphases on the $W$-mass prediction which is found to be smaller than the overall\nsize of the SUSY corrections.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:43:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dao","Thi Nhung",""],["Gabelmann","Martin",""],["M\u00fchlleitner","M. Margarete",""]]}
{"id":"2308.04060","submitter":"Sahar Barmomanesh","authors":"Sahar Barmomanesh and Victor Miranda-Soberanis","title":"Toward Improving Predictive Risk Modelling for New Zealand's Child\n  Welfare System Using Clustering Methods","comments":"20 pages, 5 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The combination of clinical judgement and predictive risk models crucially\nassist social workers to segregate children at risk of maltreatment and decide\nwhen authorities should intervene. Predictive risk modelling to address this\nmatter has been initiated by several governmental welfare authorities worldwide\ninvolving administrative data and machine learning algorithms. While previous\nstudies have investigated risk factors relating to child maltreatment, several\ngaps remain as to understanding how such risk factors interact and whether\npredictive risk models perform differently for children with different\nfeatures. By integrating Principal Component Analysis and K-Means clustering,\nthis paper presents initial findings of our work on the identification of such\nfeatures as well as their potential effect on current risk modelling\nframeworks. This approach allows examining existent, unidentified yet, clusters\nof New Zealand (NZ) children reported with care and protection concerns, as\nwell as to analyse their inner structure, and evaluate the performance of\nprediction models trained cluster wise. We aim to discover the extent of\nclustering degree required as an early step in the development of predictive\nrisk models for child maltreatment and so enhance the accuracy of such models\nintended for use by child protection authorities. The results from testing\nLASSO logistic regression models trained on identified clusters revealed no\nsignificant difference in their performance. The models, however, performed\nslightly better for two clusters including younger children. our results\nsuggest that separate models might need to be developed for children of certain\nage to gain additional control over the error rates and to improve model\naccuracy. While results are promising, more evidence is needed to draw\ndefinitive conclusions, and further investigation is necessary.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:46:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Barmomanesh","Sahar",""],["Miranda-Soberanis","Victor",""]]}
{"id":"2308.04061","submitter":"Dongyoon Yang","authors":"Dongyoon Yang, Insung Kong, Yongdai Kim","title":"Enhancing Adversarial Robustness in Low-Label Regime via Adaptively\n  Weighted Regularization and Knowledge Distillation","comments":"9 pages - Manuscript, 6 pages - Appendix, Accepted in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adversarial robustness is a research area that has recently received a lot of\nattention in the quest for trustworthy artificial intelligence. However, recent\nworks on adversarial robustness have focused on supervised learning where it is\nassumed that labeled data is plentiful. In this paper, we investigate\nsemi-supervised adversarial training where labeled data is scarce. We derive\ntwo upper bounds for the robust risk and propose a regularization term for\nunlabeled data motivated by these two upper bounds. Then, we develop a\nsemi-supervised adversarial training algorithm that combines the proposed\nregularization term with knowledge distillation using a semi-supervised teacher\n(i.e., a teacher model trained using a semi-supervised learning algorithm). Our\nexperiments show that our proposed algorithm achieves state-of-the-art\nperformance with significant margins compared to existing algorithms. In\nparticular, compared to supervised learning algorithms, performance of our\nproposed algorithm is not much worse even when the amount of labeled data is\nvery small. For example, our algorithm with only 8\\% labeled data is comparable\nto supervised adversarial training algorithms that use all labeled data, both\nin terms of standard and robust accuracies on CIFAR-10.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:48:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yang","Dongyoon",""],["Kong","Insung",""],["Kim","Yongdai",""]]}
{"id":"2308.04062","submitter":"Yanguang Chen","authors":"Meng Fu, Yanguang Chen","title":"Scaling invariance of spatial autocorrelation in urban built-up area","comments":"25 pages, 6 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  City is proved to be a scale-free phenomenon, and spatial autocorrelation is\noften employed to analyze spatial redundancy of cities. Unfortunately, spatial\nanalysis results deviated practical requirement in many cases due to fractal\nnature of cities. This paper is devoted to revealing the internal relationship\nbetween the scale dependence of Moran's I and fractal scaling. Mathematical\nreasoning and empirical analysis are employed to derive and test the model on\nthe scale dependence of spatial autocorrelation. The data extraction way for\nfractal dimension estimation is box-counting method, and parameter estimation\nrelies on the least squares regression. In light of the locality postulate of\nspatial correlation and the idea of multifractals, a power law model on Moran's\nI changing with measurement scale is derived from the principle of recursive\nsubdivision of space. The power exponent is proved to be a function of fractal\ndimension. This suggests that the numerical relationship between Moran's I and\nfractal dimension can be established through the scaling process of\ngranularity. An empirical analysis is made to testify the theoretical model. It\ncan be concluded that spatial autocorrelation of urban built-up area has no\ncharacteristic scale in many cases, and urban spatial analysis need new\nthinking.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:51:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fu","Meng",""],["Chen","Yanguang",""]]}
{"id":"2308.04063","submitter":"Yanguang Chen","authors":"Yanguang Chen","title":"Geographical space based on urban allometry and fractal dimension","comments":"16 pages, 4 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The conventional concept of geographical space is mainly referred to actual\nspace based on landscape, maps, and remote sensing images. However, this notion\nof space is not enough to interpret different types of fractal dimension of\ncities. The fractal dimensions derived from Zipf's law and time series analysis\ndo not belong to the traditional geographical space. Based on the nature of the\ndatasets, the urban allometry can be divided into three types: longitudinal\nallometry indicating time, transversal allometry indicating hierarchy, and\nisoline allometry indicating space. According to the principle of dimension\nconsistency, an allometric scaling exponent must be a ratio of one fractal\ndimension to another. From abovementioned three allometric models, we can\nderive three sets of fractal dimension. In light of the three sets of fractal\ndimension and the principle of dimension uniqueness, urban geographical space\nfalls into three categories, including the real space based on isoline\nallometry and spatial distribution, the phase space based on longitudinal\nallometry and time series, and order space based on transversal allometry and\nrank-size distribution. The generalized space not only helps to explain various\nfractal dimensions of cities, but also can be used to develop new theory and\nmethods of geospatial analysis.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:55:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Yanguang",""]]}
{"id":"2308.04064","submitter":"Bo-Hao Wu","authors":"Bo-Hao Wu, Xin-Xin Yang, Wei Zhang and Yu Chen","title":"Superradiant Transition to a Fermionic Quasicrystal in a Cavity","comments":"5+8 pages, 3+6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the steady state superradiance in degenerate Fermi gases has been\nrealized in a cavity, following the previous discovery of the Dicke transition\nin Bose gases. The most prominent signature of fermionic Dicke transition is\nits density dependence, which is manifested as the Fermi surface nesting effect\nand the Pauli blocking effect. We study the superradiant transition in\none-dimensional Fermi gases in a cavity with the presence of an incommensurate\ndipolar lattice. We find a first-order Dicke transition induced by indirect\nresonance effect, which is a resonance between two atomic levels by the level\nrepulsion from a third level, and causes extra gap opening. By formulating a\nphenomenological theory, we find that the critical pumping strength for this\nfirst-order Dicke transition shows a linear V-shape kink near a particular\nindirect resonance modified filling $\\nu_{\\rm IRM}$. The presence and the\nunique density dependence of this transition manifest the fermionic nature and\nverify the mechanism of the quasicrystal superradiant transition.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:56:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wu","Bo-Hao",""],["Yang","Xin-Xin",""],["Zhang","Wei",""],["Chen","Yu",""]]}
{"id":"2308.04065","submitter":"Matthew Zahr","authors":"Charles J. Naudet, Matthew J. Zahr","title":"A space-time high-order implicit shock tracking method for\n  shock-dominated unsteady flows","comments":"35 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math-ph math.MP math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-order implicit shock tracking (fitting) is a class of high-order,\noptimization-based numerical methods to approximate solutions of conservation\nlaws with non-smooth features by aligning elements of the computational mesh\nwith non-smooth features. This ensures the non-smooth features are perfectly\nrepresented by inter-element jumps and high-order basis functions approximate\nsmooth regions of the solution without nonlinear stabilization, which leads to\naccurate approximations on traditionally coarse meshes. In this work, we extend\nimplicit shock tracking to time-dependent problems using a slab-based\nspace-time approach. This is achieved by reformulating a time-dependent\nconservation law as a steady conservation law in one higher dimension and\napplying existing implicit shock tracking techniques. To avoid computations\nover the entire time domain and unstructured mesh generation in higher\ndimensions, we introduce a general procedure to generate conforming,\nsimplex-only meshes of space-time slabs in such a way that preserves features\n(e.g., curved elements, refinement regions) from previous time slabs. The use\nof space-time slabs also simplifies the shock tracking problem by reducing\ntemporal complexity. Several practical adaptations of the implicit shock\ntracking solvers are developed for the space-time setting including 1) a\nself-adjusting temporal boundary, 2) nondimensionalization of a space-time\nslab, 3) adaptive mesh refinement, and 4) shock boundary conditions, which lead\nto accurate solutions on coarse space-time grids, even for problem with complex\nflow features such as curved shocks, shock formation, shock-shock and\nshock-boundary interaction, and triple points.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:59:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Naudet","Charles J.",""],["Zahr","Matthew J.",""]]}
{"id":"2308.04066","submitter":"Fabian Belmonte","authors":"Fabian Belmonte and Harold Bustos","title":"Smooth Fields of Hilbert Spaces, Hermitian bundles and Riemannian Direct\n  Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a field of Hilbert spaces there are two ways to endow it with a smooth\nstructure: the standard and geometrical notion of Hilbert (or Hermitian) bundle\nand the analytical notion of smooth field of Hilbert spaces. We study the\nrelationship between these concepts in a general framework. We apply our\nresults in the following interesting example called Riemannian direct images:\nLet $M,N$ be Riemannian oriented manifolds, $\\rho:M\\to N$ be a submersion and\n$\\pi:E\\to M$ a finite dimensional vector bundle. Also, let\n$M_\\lambda=\\rho^{-1}(\\lambda)$ and fix a suitable measure $\\mu_\\lambda$ in\n$M_\\lambda$. Does the field of Hilbert spaces\n$\\mathcal{H}(\\lambda)=L^2(M_\\lambda,E)$ admits a smooth field of Hilbert space\nstructure? or a Hilbert bundle structure? In order to provide conditions to\nguarantee a positive answer for these questions, we develop an interesting\nformula to derivate functions defined on $N$ as a integral over $M_\\lambda$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:02:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Belmonte","Fabian",""],["Bustos","Harold",""]]}
{"id":"2308.04067","submitter":"Xiangyan Liu","authors":"Wei Ji, Xiangyan Liu, An Zhang, Yinwei Wei, Yongxin Ni, Xiang Wang","title":"Online Distillation-enhanced Multi-modal Transformer for Sequential\n  Recommendation","comments":"11 pages, 7 figures, accepted in ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modal recommendation systems, which integrate diverse types of\ninformation, have gained widespread attention in recent years. However,\ncompared to traditional collaborative filtering-based multi-modal\nrecommendation systems, research on multi-modal sequential recommendation is\nstill in its nascent stages. Unlike traditional sequential recommendation\nmodels that solely rely on item identifier (ID) information and focus on\nnetwork structure design, multi-modal recommendation models need to emphasize\nitem representation learning and the fusion of heterogeneous data sources. This\npaper investigates the impact of item representation learning on downstream\nrecommendation tasks and examines the disparities in information fusion at\ndifferent stages. Empirical experiments are conducted to demonstrate the need\nto design a framework suitable for collaborative learning and fusion of diverse\ninformation. Based on this, we propose a new model-agnostic framework for\nmulti-modal sequential recommendation tasks, called Online\nDistillation-enhanced Multi-modal Transformer (ODMT), to enhance feature\ninteraction and mutual learning among multi-source input (ID, text, and image),\nwhile avoiding conflicts among different features during training, thereby\nimproving recommendation accuracy. To be specific, we first introduce an\nID-aware Multi-modal Transformer module in the item representation learning\nstage to facilitate information interaction among different features. Secondly,\nwe employ an online distillation training strategy in the prediction\noptimization stage to make multi-source data learn from each other and improve\nprediction robustness. Experimental results on a stream media recommendation\ndataset and three e-commerce recommendation datasets demonstrate the\neffectiveness of the proposed two modules, which is approximately 10%\nimprovement in performance compared to baseline models.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:04:17 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 07:53:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ji","Wei",""],["Liu","Xiangyan",""],["Zhang","An",""],["Wei","Yinwei",""],["Ni","Yongxin",""],["Wang","Xiang",""]]}
{"id":"2308.04068","submitter":"Alessandro Alla","authors":"Alessandro Alla and Agnese Pacifico and Michele Palladino and Andrea\n  Pesare","title":"Online identification and control of PDEs via Reinforcement Learning\n  methods","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":"  We focus on the control of unknown Partial Differential Equations (PDEs). The\nsystem dynamics is unknown, but we assume we are able to observe its evolution\nfor a given control input, as typical in a Reinforcement Learning framework. We\npropose an algorithm based on the idea to control and identify on the fly the\nunknown system configuration. In this work, the control is based on the\nState-Dependent Riccati approach, whereas the identification of the model on\nBayesian linear regression. At each iteration, based on the observed data, we\nobtain an estimate of the a-priori unknown parameter configuration of the PDE\nand then we compute the control of the correspondent model. We show by\nnumerical evidence the convergence of the method for infinite horizon control\nproblems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:06:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Alla","Alessandro",""],["Pacifico","Agnese",""],["Palladino","Michele",""],["Pesare","Andrea",""]]}
{"id":"2308.04069","submitter":"Arunima Banerjee Dr.","authors":"Suman Sarkar, Ganesh Narayanan, Arunima Banerjee","title":"Analyzing the cosmic web environment in the vicinity of grand-design and\n  flocculent spirals with local geometric index","comments":"Accepted for publication in JCAP. arXiv admin note: substantial text\n  overlap with arXiv:2302.08087","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":"  We explore the environment of a combined set of $367$ grand-design and $619$\nflocculent spiral galaxies. We introduce a novel estimator called the\n\\textit{local geometric index} to quantify the morphology of the local\nenvironment of these $986$ spirals. The local geometric index allows us to\nclassify the environment of galaxies into voids, sheets, filaments, and\nclusters. We find that grand-designs are mostly located in dense environments\nlike clusters and filaments ($\\sim 78\\%$), whereas the fraction of the\nflocculents lying in sparse environments like voids and sheets is significantly\nhigher ($ > 10\\%$) than that of the grand-designs. A $p$-value $<$ $10 ^{-3}$\nfrom a Kolmogorov-Smirnov test indicates that our results are statistically\nsignificant at $99.9\\%$ confidence level. Further, we note that dense\nenvironments with large tidal flows are dominated by the grand-designs. On the\nother hand, low-density environments such as sheets and voids favor the growth\nof flocculents.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:07:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sarkar","Suman",""],["Narayanan","Ganesh",""],["Banerjee","Arunima",""]]}
{"id":"2308.04070","submitter":"Pochuan Wang","authors":"Pochuan Wang, Chen Shen, Weichung Wang, Masahiro Oda, Chiou-Shann Fuh,\n  Kensaku Mori, Holger R. Roth","title":"ConDistFL: Conditional Distillation for Federated Learning from\n  Partially Annotated Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Developing a generalized segmentation model capable of simultaneously\ndelineating multiple organs and diseases is highly desirable. Federated\nlearning (FL) is a key technology enabling the collaborative development of a\nmodel without exchanging training data. However, the limited access to fully\nannotated training data poses a major challenge to training generalizable\nmodels. We propose \"ConDistFL\", a framework to solve this problem by combining\nFL with knowledge distillation. Local models can extract the knowledge of\nunlabeled organs and tumors from partially annotated data from the global model\nwith an adequately designed conditional probability representation. We validate\nour framework on four distinct partially annotated abdominal CT datasets from\nthe MSD and KiTS19 challenges. The experimental results show that the proposed\nframework significantly outperforms FedAvg and FedOpt baselines. Moreover, the\nperformance on an external test dataset demonstrates superior generalizability\ncompared to models trained on each dataset separately. Our ablation study\nsuggests that ConDistFL can perform well without frequent aggregation, reducing\nthe communication cost of FL. Our implementation will be available at\nhttps://github.com/NVIDIA/NVFlare/tree/dev/research/condist-fl.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:07:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Pochuan",""],["Shen","Chen",""],["Wang","Weichung",""],["Oda","Masahiro",""],["Fuh","Chiou-Shann",""],["Mori","Kensaku",""],["Roth","Holger R.",""]]}
{"id":"2308.04071","submitter":"Lucas Barcelos","authors":"Lucas Barcelos, Tin Lai, Rafael Oliveira, Paulo Borges and Fabio Ramos","title":"Path Signatures for Diversity in Probabilistic Trajectory Optimisation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motion planning can be cast as a trajectory optimisation problem where a cost\nis minimised as a function of the trajectory being generated. In complex\nenvironments with several obstacles and complicated geometry, this optimisation\nproblem is usually difficult to solve and prone to local minima. However,\nrecent advancements in computing hardware allow for parallel trajectory\noptimisation where multiple solutions are obtained simultaneously, each\ninitialised from a different starting point. Unfortunately, without a strategy\npreventing two solutions to collapse on each other, naive parallel optimisation\ncan suffer from mode collapse diminishing the efficiency of the approach and\nthe likelihood of finding a global solution. In this paper we leverage on\nrecent advances in the theory of rough paths to devise an algorithm for\nparallel trajectory optimisation that promotes diversity over the range of\nsolutions, therefore avoiding mode collapses and achieving better global\nproperties. Our approach builds on path signatures and Hilbert space\nrepresentations of trajectories, and connects parallel variational inference\nfor trajectory estimation with diversity promoting kernels. We empirically\ndemonstrate that this strategy achieves lower average costs than competing\nalternatives on a range of problems, from 2D navigation to robotic manipulators\noperating in cluttered environments.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:10:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Barcelos","Lucas",""],["Lai","Tin",""],["Oliveira","Rafael",""],["Borges","Paulo",""],["Ramos","Fabio",""]]}
{"id":"2308.04072","submitter":"Oleksiy Karlovych","authors":"Oleksiy Karlovych and Eugene Shargorodsky","title":"Bounded compact and dual compact approximation properties of Hardy\n  spaces: new results and open problems","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of the paper is to highlight some open problems concerning\napproximation properties of Hardy spaces. We also present some results on the\nbounded compact and the dual compact approximation properties (shortly, BCAP\nand DCAP) of such spaces, to provide background for the open problems. Namely,\nwe consider abstract Hardy spaces $H[X(w)]$ built upon translation-invariant\nBanach function spaces $X$ with weights $w$ such that $w\\in X$ and $w^{-1}\\in\nX'$, where $X'$ is the associate space of $X$. We prove that if $X$ is\nseparable, then $H[X(w)]$ has the BCAP with the approximation constant\n$M(H[X(w)])\\le 2$. Moreover, if $X$ is reflexive, then $H[X(w)]$ has the BCAP\nand the DCAP with the approximation constants $M(H[X(w)])\\le 2$ and\n$M^*(H[X(w)])\\le 2$, respectively. In the case of classical weighted Hardy\nspace $H^p(w) = H[L^p(w)]$ with $1<p<\\infty$, one has a sharper result:\n$M(H^p(w))\\le 2^{|1-2/p|}$ and $M^*(H^p(w))\\le 2^{|1-2/p|}$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:11:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Karlovych","Oleksiy",""],["Shargorodsky","Eugene",""]]}
{"id":"2308.04073","submitter":"Honghui Wang","authors":"Honghui Wang, Lu Lu, Shiji Song, Gao Huang","title":"Learning Specialized Activation Functions for Physics-informed Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA cs.NE math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physics-informed neural networks (PINNs) are known to suffer from\noptimization difficulty. In this work, we reveal the connection between the\noptimization difficulty of PINNs and activation functions. Specifically, we\nshow that PINNs exhibit high sensitivity to activation functions when solving\nPDEs with distinct properties. Existing works usually choose activation\nfunctions by inefficient trial-and-error. To avoid the inefficient manual\nselection and to alleviate the optimization difficulty of PINNs, we introduce\nadaptive activation functions to search for the optimal function when solving\ndifferent problems. We compare different adaptive activation functions and\ndiscuss their limitations in the context of PINNs. Furthermore, we propose to\ntailor the idea of learning combinations of candidate activation functions to\nthe PINNs optimization, which has a higher requirement for the smoothness and\ndiversity on learned functions. This is achieved by removing activation\nfunctions which cannot provide higher-order derivatives from the candidate set\nand incorporating elementary functions with different properties according to\nour prior knowledge about the PDE at hand. We further enhance the search space\nwith adaptive slopes. The proposed adaptive activation function can be used to\nsolve different PDE systems in an interpretable way. Its effectiveness is\ndemonstrated on a series of benchmarks. Code is available at\nhttps://github.com/LeapLabTHU/AdaAFforPINNs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:11:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Honghui",""],["Lu","Lu",""],["Song","Shiji",""],["Huang","Gao",""]]}
{"id":"2308.04074","submitter":"Weichao Zhao","authors":"Weichao Zhao, Hezhen Hu, Wengang Zhou, Li li, Houqiang Li","title":"Exploiting Spatial-Temporal Context for Interacting Hand Reconstruction\n  on Monocular RGB Video","comments":"16 pages","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 RGB data is a challenging\ntask, as it involves many interfering factors, e.g. self- and mutual occlusion\nand similar textures. Previous works only leverage information from a single\nRGB image without modeling their physically plausible relation, which leads to\ninferior reconstruction results. In this work, we are dedicated to explicitly\nexploiting spatial-temporal information to achieve better interacting hand\nreconstruction. On one hand, we leverage temporal context to complement\ninsufficient information provided by the single frame, and design a novel\ntemporal framework with a temporal constraint for interacting hand motion\nsmoothness. On the other hand, we further propose an interpenetration detection\nmodule to produce kinetically plausible interacting hands without physical\ncollisions. Extensive experiments are performed to validate the effectiveness\nof our proposed framework, which achieves new state-of-the-art performance on\npublic benchmarks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:16:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhao","Weichao",""],["Hu","Hezhen",""],["Zhou","Wengang",""],["li","Li",""],["Li","Houqiang",""]]}
{"id":"2308.04075","submitter":"Johan Ulander","authors":"Johan Ulander","title":"Boundary-preserving Lamperti-splitting scheme for some Stochastic\n  Differential Equations","comments":"18 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose and analyse an explicit boundary-preserving scheme for the strong\napproximations of some SDEs with non-globally Lipschitz drift and diffusion\ncoefficients whose state-space is bounded. The scheme consists of a Lamperti\ntransform followed by a Lie--Trotter splitting. We prove\n$L^{p}(\\Omega)$-convergence of order $1$, for every $p \\in \\mathbb{N}$, of the\nscheme and exploit the Lamperti transform to confine the numerical\napproximations to the state-space of the considered SDE. We provide numerical\nexperiments that confirm the theoretical results and compare the proposed\nLamperti-splitting scheme to other numerical schemes for SDEs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:21:07 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 11:27:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ulander","Johan",""]]}
{"id":"2308.04076","submitter":"Nicole Sultanum","authors":"Nicole Sultanum, Arjun Srinivasan","title":"DataTales: Investigating the use of Large Language Models for Authoring\n  Data-Driven Articles","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Authoring data-driven articles is a complex process requiring authors to not\nonly analyze data for insights but also craft a cohesive narrative that\neffectively communicates the insights. Text generation capabilities of\ncontemporary large language models (LLMs) present an opportunity to assist the\nauthoring of data-driven articles and expedite the writing process. In this\nwork, we investigate the feasibility and perceived value of leveraging LLMs to\nsupport authors of data-driven articles. We designed a prototype system,\nDataTales, that leverages a LLM to generate textual narratives accompanying a\ngiven chart. Using DataTales as a design probe, we conducted a qualitative\nstudy with 11 professionals to evaluate the concept, from which we distilled\naffordances and opportunities to further integrate LLMs as valuable data-driven\narticle authoring assistants.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:21:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sultanum","Nicole",""],["Srinivasan","Arjun",""]]}
{"id":"2308.04077","submitter":"Yao Shu","authors":"Yao Shu, Xiaoqiang Lin, Zhongxiang Dai, Bryan Kian Hsiang Low","title":"Federated Zeroth-Order Optimization using Trajectory-Informed Surrogate\n  Gradients","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 optimization, an emerging paradigm which finds wide real-world\napplications such as federated learning, enables multiple clients (e.g., edge\ndevices) to collaboratively optimize a global function. The clients do not\nshare their local datasets and typically only share their local gradients.\nHowever, the gradient information is not available in many applications of\nfederated optimization, which hence gives rise to the paradigm of federated\nzeroth-order optimization (ZOO). Existing federated ZOO algorithms suffer from\nthe limitations of query and communication inefficiency, which can be\nattributed to (a) their reliance on a substantial number of function queries\nfor gradient estimation and (b) the significant disparity between their\nrealized local updates and the intended global updates. To this end, we (a)\nintroduce trajectory-informed gradient surrogates which is able to use the\nhistory of function queries during optimization for accurate and\nquery-efficient gradient estimation, and (b) develop the technique of adaptive\ngradient correction using these gradient surrogates to mitigate the\naforementioned disparity. Based on these, we propose the federated zeroth-order\noptimization using trajectory-informed surrogate gradients (FZooS) algorithm\nfor query- and communication-efficient federated ZOO. Our FZooS achieves\ntheoretical improvements over the existing approaches, which is supported by\nour real-world experiments such as federated black-box adversarial attack and\nfederated non-differentiable metric optimization.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:26:54 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shu","Yao",""],["Lin","Xiaoqiang",""],["Dai","Zhongxiang",""],["Low","Bryan Kian Hsiang",""]]}
{"id":"2308.04078","submitter":"Byoung Ham","authors":"B. S. Ham","title":"Macroscopic quantum correlation using coherence manipulations of\n  polarization-path correlations of a continuous-wave laser","comments":"7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum superposition is normally sustained in a microscopic regime governed\nby Heisenberg uncertainty principle applicable to a single particle. Quantum\ncorrelation between paired particles implies the violation of local realism\ngoverned by classical physics. Over the last decades, quantum features have\nbeen implemented in various quantum technologies including quantum computing,\ncommunications, and sensing. Such quantum features are generally known to be\nimpossible by any classical means. Here, a macroscopic quantum correlation is\npresented for coherence manipulations of polarization-path correlations of a\ncontinuous wave laser, satisfying the joint-parameter relation in an\ninseparable product-basis form. For the coherence control of the\npolarization-path correlation, a pair of electro-optic modulators is used in a\nnoninterfering Mach-Zehnder interferometer for deterministic switching between\npaired polarization bases, resulting in the polarization product-basis\nsuperposition in a selective product-basis choice manner by a followed pair of\nacousto-optic modulators. This unprecedented macroscopic quantum feature opens\nthe door to a new understanding of quantum mechanics beyond the microscopic\nregime for future classical optics-compatible quantum information.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:31:11 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 09:05:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ham","B. S.",""]]}
{"id":"2308.04079","submitter":"George Drettakis","authors":"Bernhard Kerbl, Georgios Kopanas, Thomas Leimk\\\"uhler, George\n  Drettakis","title":"3D Gaussian Splatting for Real-Time Radiance Field Rendering","comments":"https://repo-sam.inria.fr/fungraph/3d-gaussian-splatting/","journal-ref":"ACM Transactions on Graphics, volume 42(4), July 2023","doi":null,"report-no":null,"categories":"cs.GR cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Radiance Field methods have recently revolutionized novel-view synthesis of\nscenes captured with multiple photos or videos. However, achieving high visual\nquality still requires neural networks that are costly to train and render,\nwhile recent faster methods inevitably trade off speed for quality. For\nunbounded and complete scenes (rather than isolated objects) and 1080p\nresolution rendering, no current method can achieve real-time display rates. We\nintroduce three key elements that allow us to achieve state-of-the-art visual\nquality while maintaining competitive training times and importantly allow\nhigh-quality real-time (>= 30 fps) novel-view synthesis at 1080p resolution.\nFirst, starting from sparse points produced during camera calibration, we\nrepresent the scene with 3D Gaussians that preserve desirable properties of\ncontinuous volumetric radiance fields for scene optimization while avoiding\nunnecessary computation in empty space; Second, we perform interleaved\noptimization/density control of the 3D Gaussians, notably optimizing\nanisotropic covariance to achieve an accurate representation of the scene;\nThird, we develop a fast visibility-aware rendering algorithm that supports\nanisotropic splatting and both accelerates training and allows realtime\nrendering. We demonstrate state-of-the-art visual quality and real-time\nrendering on several established datasets.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:37:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kerbl","Bernhard",""],["Kopanas","Georgios",""],["Leimk\u00fchler","Thomas",""],["Drettakis","George",""]]}
{"id":"2308.04080","submitter":"Youer Pu","authors":"Youer Pu (1), Ali Farahbakhsh (1), Lorenzo Alvisi (1), Ittay Eyal (2)\n  ((1) Cornell University, (2) The Technion)","title":"Gorilla: Safe Permissionless Byzantine Consensus","comments":"43 pages, 3 figures, to be published in the International Symposium\n  on Distributed Computing (DISC) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nakamoto's consensus protocol works in a permissionless model and tolerates\nByzantine failures, but only offers probabilistic agreement. Recently, the\nSandglass protocol has shown such weaker guarantees are not a necessary\nconsequence of a permissionless model; yet, Sandglass only tolerates benign\nfailures, and operates in an unconventional partially synchronous model. We\npresent Gorilla Sandglass, the first Byzantine tolerant consensus protocol to\nguarantee, in the same synchronous model adopted by Nakamoto, deterministic\nagreement and termination with probability 1 in a permissionless setting. We\nprove the correctness of Gorilla by mapping executions that would violate\nagreement or termination in Gorilla to executions in Sandglass, where we know\nsuch violations are impossible. Establishing termination proves particularly\ninteresting, as the mapping requires reasoning about infinite executions and\ntheir probabilities.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:37:49 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 07:05:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pu","Youer","","Cornell University"],["Farahbakhsh","Ali","","Cornell University"],["Alvisi","Lorenzo","","Cornell University"],["Eyal","Ittay","","The Technion"]]}
{"id":"2308.04081","submitter":"Yoshikazu Mizuguchi","authors":"Yoshikazu Mizuguchi, Kazuki Yamane, Ryo Matsumoto, Kazuhisa Hoshi,\n  Aichi Yamashita, Akira Miura, Yuki Nakahira, Hirokazu Kadobayashi, Saori I.\n  Kawaguchi, Yoshihiko Takano","title":"Absence of Tc-Pinning Phenomenon Under High Pressure in High-Entropy\n  REO0.5F0.5BiS2 Layered Superconductor","comments":"9 pages, 4 figures","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":"  Recently, robustness of superconductivity (transition temperature, Tc) under\nhigh pressures has been observed in high-entropy alloy (HEA), bcc-type\nTi-Zr-Hf-Nb-Ta, and HEA-type compounds (Ag,In,Sn,Pb,Bi)Te with a NaCl-type\nstructure. Since those materials have three-dimensional crystal structure,\ninvestigation on the pressure dependence of Tc of low-dimensional materials is\nneeded to understand the phenomena. Here, we investigated the superconducting\nproperties and the crystal structure of BiS2-based layered system\nREO0.5F0.5BiS2. Although the robustness of Tc was induced in MTe with\nincreasing M-site configurational entropy, the increase in RE-site\nconfigurational entropy does not induce robustness of Tc under high pressures\nin REO0.5F0.5BiS2. The crystal structure of HEA-type REO0.5F0.5BiS2 was\nconfirmed as monoclinic P21/m, which is the same space group as the\nzero-entropy counterpart LaO0.5F0.5BiS2. The results suggest that an increase\nin configurational entropy at blocking layers do not affect crystal structure\nand superconducting properties under high pressures in the BiS2-based layered\nsystem.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:38:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mizuguchi","Yoshikazu",""],["Yamane","Kazuki",""],["Matsumoto","Ryo",""],["Hoshi","Kazuhisa",""],["Yamashita","Aichi",""],["Miura","Akira",""],["Nakahira","Yuki",""],["Kadobayashi","Hirokazu",""],["Kawaguchi","Saori I.",""],["Takano","Yoshihiko",""]]}
{"id":"2308.04082","submitter":"Andre Luckow","authors":"Florian J. Kiwit, Marwa Marso, Philipp Ross, Carlos A. Riofr\\'io,\n  Johannes Klepsch, Andre Luckow","title":"Application-Oriented Benchmarking of Quantum Generative Learning Using\n  QUARK","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Benchmarking of quantum machine learning (QML) algorithms is challenging due\nto the complexity and variability of QML systems, e.g., regarding model\nansatzes, data sets, training techniques, and hyper-parameters selection. The\nQUantum computing Application benchmaRK (QUARK) framework simplifies and\nstandardizes benchmarking studies for quantum computing applications. Here, we\npropose several extensions of QUARK to include the ability to evaluate the\ntraining and deployment of quantum generative models. We describe the updated\nsoftware architecture and illustrate its flexibility through several example\napplications: (1) We trained different quantum generative models using several\ncircuit ansatzes, data sets, and data transformations. (2) We evaluated our\nmodels on GPU and real quantum hardware. (3) We assessed the generalization\ncapabilities of our generative models using a broad set of metrics that\ncapture, e.g., the novelty and validity of the generated data.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:41:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kiwit","Florian J.",""],["Marso","Marwa",""],["Ross","Philipp",""],["Riofr\u00edo","Carlos A.",""],["Klepsch","Johannes",""],["Luckow","Andre",""]]}
{"id":"2308.04083","submitter":"Wenhan Yu","authors":"Wenhan Yu and Jun Zhao","title":"Heterogeneous 360 Degree Videos in Metaverse: Differentiated\n  Reinforcement Learning Approaches","comments":"This paper appears in IEEE Global Communications Conference\n  (GLOBECOM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advanced video technologies are driving the development of the futuristic\nMetaverse, which aims to connect users from anywhere and anytime. As such, the\nuse cases for users will be much more diverse, leading to a mix of 360-degree\nvideos with two types: non-VR and VR 360-degree videos. This paper presents a\nnovel Quality of Service model for heterogeneous 360-degree videos with\ndifferent requirements for frame rates and cybersickness. We propose a\nframe-slotted structure and conduct frame-wise optimization using self-designed\ndifferentiated deep reinforcement learning algorithms. Specifically, we design\ntwo structures, Separate Input Differentiated Output (SIDO) and Merged Input\nDifferentiated Output (MIDO), for this heterogeneous scenario. We also conduct\ncomprehensive experiments to demonstrate their effectiveness.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:47:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yu","Wenhan",""],["Zhao","Jun",""]]}
{"id":"2308.04084","submitter":"Xuejuan Yang","authors":"Qi Lin, X. J. Yang and Aigen Li","title":"Polycyclic Aromatic Hydrocarbon Molecules and the 2175 Angstrom\n  Interstellar Extinction Bump","comments":"13 pages, 8 figures, 1 table, accepted for publication in 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":"  The exact nature of the 2175 Angstrom extinction bump, the strongest\nspectroscopic absorption feature superimposed on the interstellar extinction\ncurve, remains unknown ever since its discovery in 1965. Popular candidate\ncarriers for the extinction bump include nano-sized graphitic grains and\npolycyclic aromatic hydrocarbon (PAH) molecules. To quantitatively evaluate\nPAHs as a possible carrier, we perform quantum chemical computations for the\nelectronic transitions of 30 compact, pericondensed PAH molecules and their\ncations as well as anions with a wide range of sizes from 16 to 96 C atoms and\na mean size of 43 C atoms. It is found that a mixture of such PAHs, which\nindividually exhibit sharp absorption features, show a smooth and broad\nabsorption band that resembles the 2175 Angstrom interstellar extinction bump.\nArising from \\pi^{*} --\\pi, the width and intensity of the absorption bump for\notherwise randomly-selected and uniformly-weighted PAH mixtures, do not vary\nmuch with PAH sizes and charge states, whereas the position shifts to longer\nwavelengths as PAH size increases. While the computed bump position, with the\ncomputational uncertainty taken into account, appears to agree with that of the\ninterstellar extinction bump, the computed width is considerably broader than\nthe interstellar bump if the molecules are uniformly weighted. It appears that,\nto account for the observed bump width, one has to resort to PAH species of\nspecific sizes and structures.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:47:50 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 02:37:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lin","Qi",""],["Yang","X. J.",""],["Li","Aigen",""]]}
{"id":"2308.04085","submitter":"Xuejuan Yang","authors":"X.J. Yang and Aigen Li","title":"Deuterated Polycyclic Aromatic Hydrocarbons in the Interstellar Medium:\n  The Aliphatic C--D Band Strengths","comments":"41 pages, 24 figures, accepted for publication by ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deuterium (D) was exclusively generated in the Big Bang and the standard Big\nBang Nucleosynthesis (BBN) model predicts a primordial abundance of D/H~26ppm.\nAs the Galaxy evolves, D/H gradually decreases because of astration. The\nGalactic chemical evolution (GCE) model predicts a present-day abundance of\nD/H~20ppm. However, observations of the local interstellar medium (ISM) have\nrevealed that the gas-phase interstellar D/H varies considerably from one\nregion to another and has a median abundance of D/H~13ppm, substantially lower\nthan predicted from the BBN and GCE models. It has been suggested that the\nmissing D atoms of D/H~7ppm could have been locked up in deuterated polycyclic\naromatic hydrocarbon (PAH) molecules. However, we have previously demonstrated\nthat PAHs with aromatic C--D units are insufficient to account for the missing\nD. Here we explore if PAHs with aliphatic C--D units could be a reservoir of D.\nWe perform quantum chemical computations of the vibrational spectra of\n\"superdeuterated\" PAHs (in which one D and one H share an C atom) and PAHs\nattached with D-substituted methyl group, and derive the band strengths of the\naliphatic C--D stretch (A_4.65). By applying the computationally derived A_4.65\nto the observed aliphatic C--D emission at ~4.6--4.8 micron, we find that PAHs\nwith aliphatic C--D units could have tied up a substantial amount of D/H and\nmarginally account for the missing D. The possible routes to generate PAHs with\naliphatic C--D units are also discussed.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:53:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yang","X. J.",""],["Li","Aigen",""]]}
{"id":"2308.04086","submitter":"Yunzhu Pan","authors":"Yunzhu Pan, Chen Gao, Jianxin Chang, Yanan Niu, Yang Song, Kun Gai,\n  Depeng Jin, Yong Li","title":"Understanding and Modeling Passive-Negative Feedback for Short-video\n  Sequential Recommendation","comments":"Accepted by RecSys'23","journal-ref":null,"doi":"10.1145/3604915.3608814","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sequential recommendation is one of the most important tasks in recommender\nsystems, which aims to recommend the next interacted item with historical\nbehaviors as input. Traditional sequential recommendation always mainly\nconsiders the collected positive feedback such as click, purchase, etc.\nHowever, in short-video platforms such as TikTok, video viewing behavior may\nnot always represent positive feedback. Specifically, the videos are played\nautomatically, and users passively receive the recommended videos. In this new\nscenario, users passively express negative feedback by skipping over videos\nthey do not like, which provides valuable information about their preferences.\nDifferent from the negative feedback studied in traditional recommender\nsystems, this passive-negative feedback can reflect users' interests and serve\nas an important supervision signal in extracting users' preferences. Therefore,\nit is essential to carefully design and utilize it in this novel recommendation\nscenario. In this work, we first conduct analyses based on a large-scale\nreal-world short-video behavior dataset and illustrate the significance of\nleveraging passive feedback. We then propose a novel method that deploys the\nsub-interest encoder, which incorporates positive feedback and passive-negative\nfeedback as supervision signals to learn the user's current active\nsub-interest. Moreover, we introduce an adaptive fusion layer to integrate\nvarious sub-interests effectively. To enhance the robustness of our model, we\nthen introduce a multi-task learning module to simultaneously optimize two\nkinds of feedback -- passive-negative feedback and traditional randomly-sampled\nnegative feedback. The experiments on two large-scale datasets verify that the\nproposed method can significantly outperform state-of-the-art approaches. The\ncode is released at https://github.com/tsinghua-fib-lab/RecSys2023-SINE.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:58:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pan","Yunzhu",""],["Gao","Chen",""],["Chang","Jianxin",""],["Niu","Yanan",""],["Song","Yang",""],["Gai","Kun",""],["Jin","Depeng",""],["Li","Yong",""]]}
{"id":"2308.04087","submitter":"Donggeon David Oh","authors":"Donggeon David Oh, Dongjae Lee, H. Jin Kim","title":"Safety-Critical Control under Multiple State and Input Constraints and\n  Application to Fixed-Wing UAV","comments":"Accepted for the 2023 62nd IEEE Conference on Decision and Control\n  (CDC)","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":"  This study presents a framework to guarantee safety for a class of\nsecond-order nonlinear systems under multiple state and input constraints. To\nfacilitate real-world applications, a safety-critical controller must consider\nmultiple constraints simultaneously, while being able to impose general forms\nof constraints designed for various tasks (e.g., obstacle avoidance). With this\nin mind, we first devise a zeroing control barrier function (ZCBF) using a\nnewly proposed nominal evading maneuver. By designing the nominal evading\nmaneuver to 1) be continuously differentiable, 2) satisfy input constraints,\nand 3) be capable of handling other state constraints, we deduce an ultimate\ninvariant set, a subset of the safe set that can be rendered forward invariant\nwith admissible control inputs. Thanks to the development of the ultimate\ninvariant set, we then propose a safety-critical controller, which is a\ncomputationally tractable one-step model predictive controller (MPC) with\nguaranteed recursive feasibility. We validate the proposed framework in\nsimulation, where a fixed-wing UAV tracks a circular trajectory while\nsatisfying multiple safety constraints including collision avoidance, bounds on\nflight speed and flight path angle, and input constraints.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:06:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Oh","Donggeon David",""],["Lee","Dongjae",""],["Kim","H. Jin",""]]}
{"id":"2308.04088","submitter":"Karthick Subramani","authors":"Jeyapradhap Thirisangu, E Hemachandran, and Karthick Subramani","title":"Suspending droplets beyond the Rayleigh limit: The interplay of acoustic\n  and gravity forces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we experimentally investigate the suspension behavior of\ndroplets subjected to standing acoustic waves. We focus on the droplet sizes\nbeyond the Rayleigh limit, i.e., when the droplet size is comparable to the\nwavelength of the acoustic wave. We show that an acoustic field can disrupt the\nuniform motion of aqueous droplets in oil and cause them to either suspend or\nsettle, depending on the interplay between acoustic and gravity forces.\nRemarkably, in contrast to droplets within the Rayleigh limit, the critical\nacoustic power or minimum pressure amplitude required to suspend droplets\nbeyond the Rayleigh limit is dependent on droplet size. As the droplet size\nincreases, the critical acosutic power increases significantly. Building upon\nthis understanding, a novel sorting method is proposed based on critical\nacoustic power.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:07:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Thirisangu","Jeyapradhap",""],["Hemachandran","E",""],["Subramani","Karthick",""]]}
{"id":"2308.04089","submitter":"J Hingies Monisha","authors":"J. Hingies Monisha, V. Vasumathi and Prabal K Maiti","title":"Gold Nanoparticles Aggregation on Graphene Using Reactive Force Field: A\n  Molecular Dynamic Study","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":"  We examine the aggregation behavior of AuNPs of different sizes on graphene\nas function of temperature using molecular dynamic simulations with Reax Force\nField (ReaxFF). In addition, the consequences of such aggregation on the\nmorphology of AuNPs and the charge transfer behavior of AuNP-Graphene hybrid\nstructure are analyzed. The aggregation of AuNPs on graphene is confirmed from\nthe center of mass distance calculation. The simulation results indicate that\nthe size of AuNPs and temperature significantly affect the aggregation behavior\nof AuNPs on graphene. The strain calculation showed that shape of AuNPs changes\ndue to the aggregation and the smaller size AuNPs on graphene exhibit more\nshape changes than larger AuNPs at all the temperatures studies in this work.\nThe charge transfer calculation reveals that, the magnitude of charge transfer\nis higher for larger AuNPs-graphene composite when compared with smaller\nAuNPs-graphene composite. The charge transfer trend and the trends seen in the\nnumber of Au atoms directly in touch with graphene are identical. Hence, our\nresults conclude that, quantity of Au atoms directly in contact with graphene\nduring aggregation is primarily facilitates charge transfer between AuNPs and\ngraphene.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:08:18 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 16:47:21 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 17:22:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Monisha","J. Hingies",""],["Vasumathi","V.",""],["Maiti","Prabal K",""]]}
{"id":"2308.04090","submitter":"Jeel Swami","authors":"Jeel Swami, Ambesh Dixit and Brajesh Tiwari","title":"Impact of Cr-O hyrbidization in ACrO3 (A=La, Y): A Theoretical\n  Investigation","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-nc-nd/4.0/","abstract":"  Electronic properties of spin polarized antiferromagnetic ACrO3 (A = La, Y)\nare explored with Hubbard Model using Density Functional Theory (DFT). These\ntwo isostructural systems are investigated using the different Hubbard energy\nand analyzed the hybridization of chromium 3d orbitals and oxygen 2p orbitals\nand the change in energy band gaps against the Hubbard energy. The bond length\nand bond angle affect significantly the orbital contributions of Cr-3d and O-2p\nelectrons for both the system. We noticed that the Cr-O hybridization affects\nthe orbital degeneracy and is substantiated with partial density of states.\nThese results emphasize the contribution of Hubbard energy in correlated\nelectron systems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:12:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Swami","Jeel",""],["Dixit","Ambesh",""],["Tiwari","Brajesh",""]]}
{"id":"2308.04091","submitter":"Linyan Ren","authors":"Wentao Wei, Linyan Ren","title":"From Unimodal to Multimodal: improving the sEMG-Based Pattern\n  Recognition via deep generative models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal hand gesture recognition (HGR) systems can achieve higher\nrecognition accuracy. However, acquiring multimodal gesture recognition data\ntypically requires users to wear additional sensors, thereby increasing\nhardware costs. This paper proposes a novel generative approach to improve\nSurface Electromyography (sEMG)-based HGR accuracy via virtual Inertial\nMeasurement Unit (IMU) signals. Specifically, we trained a deep generative\nmodel based on the intrinsic correlation between forearm sEMG signals and\nforearm IMU signals to generate virtual forearm IMU signals from the input\nforearm sEMG signals at first. Subsequently, the sEMG signals and virtual IMU\nsignals were fed into a multimodal Convolutional Neural Network (CNN) model for\ngesture recognition. To evaluate the performance of the proposed approach, we\nconducted experiments on 6 databases, including 5 publicly available databases\nand our collected database comprising 28 subjects performing 38 gestures,\ncontaining both sEMG and IMU data. The results show that our proposed approach\noutperforms the sEMG-based unimodal HGR method (with increases of\n2.15%-13.10%). It demonstrates that incorporating virtual IMU signals,\ngenerated by deep generative models, can significantly enhance the accuracy of\nsEMG-based HGR. The proposed approach represents a successful attempt to\ntransition from unimodal HGR to multimodal HGR without additional sensor\nhardware.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:15:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wei","Wentao",""],["Ren","Linyan",""]]}
{"id":"2308.04092","submitter":"Davoud Kamani","authors":"Niloufar Barghi-Janyar and Davoud Kamani","title":"Pair Production of the Open Superstrings from the Parallel-dressed\n  D3-branes in the Compact Spacetime","comments":"14 pages, LaTeX2e, no figure","journal-ref":"Eur. Phys. J. C (2023) 83:716","doi":"10.1140/epjc/s10052-023-11890-4","report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We employ the boundary state formalism to compute the pair creation rate of\nthe open superstrings from the interaction of two parallel D3-branes. The\nbranes live in the partially compact spacetime. In addition, they have been\ndressed with the internal gauge potentials and the Kalb-Ramond field.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:16:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Barghi-Janyar","Niloufar",""],["Kamani","Davoud",""]]}
{"id":"2308.04093","submitter":"Ce Jin","authors":"Ce Jin","title":"0-1 Knapsack in Nearly Quadratic Time","comments":"This paper supersedes an earlier manuscript arXiv:2307.09454 that\n  contained weaker results. Content from the earlier manuscript is partly\n  incorporated into this paper. The earlier manuscript is now obsolete","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study pseudo-polynomial time algorithms for the fundamental \\emph{0-1\nKnapsack} problem. Recent research interest has focused on its fine-grained\ncomplexity with respect to the number of items $n$ and the \\emph{maximum item\nweight} $w_{\\max}$. Under $(\\min,+)$-convolution hypothesis, 0-1 Knapsack does\nnot have $O((n+w_{\\max})^{2-\\delta})$ time algorithms\n(Cygan-Mucha-W\\k{e}grzycki-W\\l{}odarczyk 2017 and\nK\\\"{u}nnemann-Paturi-Schneider 2017). On the upper bound side, currently the\nfastest algorithm runs in $\\tilde O(n + w_{\\max}^{12/5})$ time (Chen, Lian,\nMao, and Zhang 2023), improving the earlier $O(n + w_{\\max}^3)$-time algorithm\nby Polak, Rohwedder, and W\\k{e}grzycki (2021).\n  In this paper, we close this gap between the upper bound and the conditional\nlower bound (up to subpolynomial factors):\n  - The 0-1 Knapsack problem has a deterministic algorithm in $O(n +\nw_{\\max}^{2}\\log^4w_{\\max})$ time.\n  Our algorithm combines and extends several recent structural results and\nalgorithmic techniques from the literature on knapsack-type problems:\n  - We generalize the \"fine-grained proximity\" technique of Chen, Lian, Mao,\nand Zhang (2023) derived from the additive-combinatorial results of Bringmann\nand Wellnitz (2021) on dense subset sums. This allows us to bound the support\nsize of the useful partial solutions in the dynamic program.\n  - To exploit the small support size, our main technical component is a vast\nextension of the \"witness propagation\" method, originally designed by Deng,\nMao, and Zhong (2023) for speeding up dynamic programming in the easier\nunbounded knapsack settings. To extend this approach to our 0-1 setting, we use\na novel pruning method, as well as the two-level color-coding of Bringmann\n(2017) and the SMAWK algorithm on tall matrices.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:17:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jin","Ce",""]]}
{"id":"2308.04094","submitter":"Antonio Lasanta","authors":"Isidoro Gonz\\'alez-Adalid Pemart\\'in, Emanuel Momp\\'o, Antonio\n  Lasanta, V\\'ictor Mart\\'in-Mayor, Jes\\'us Salas","title":"Shortcuts of freely relaxing systems using equilibrium physical\n  observables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many systems, when initially placed far from equilibrium, exhibit surprising\nbehavior in their attempt to equilibrate. Striking examples are the Mpemba\neffect and the cooling-heating asymmetry. These anomalous behaviors can be\nexploited to shorten the time needed to cool down (or heat up) a system.\nThough, a strategy to design these effects in mesoscopic systems is missing. We\nbring forward a description that allows us to formulate such strategies, and,\nalong the way, makes natural these paradoxical behaviors. This is exemplified\nwith the one-dimensional Ising model in a magnetic field.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:18:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pemart\u00edn","Isidoro Gonz\u00e1lez-Adalid",""],["Momp\u00f3","Emanuel",""],["Lasanta","Antonio",""],["Mart\u00edn-Mayor","V\u00edctor",""],["Salas","Jes\u00fas",""]]}
{"id":"2308.04095","submitter":"Chao Wang","authors":"Chao Wang, Jean-Francois Aujol, Guy Gilboa, Yifei Lou","title":"Minimizing Quotient Regularization Model","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quotient regularization models (QRMs) are a class of powerful regularization\ntechniques that have gained considerable attention in recent years, due to\ntheir ability to handle complex and highly nonlinear data sets. However, the\nnonconvex nature of QRM poses a significant challenge in finding its optimal\nsolution. We are interested in scenarios where both the numerator and the\ndenominator of QRM are absolutely one-homogeneous functions, which is widely\napplicable in the fields of signal processing and image processing. In this\npaper, we utilize a gradient flow to minimize such QRM in combination with a\nquadratic data fidelity term. Our scheme involves solving a convex problem\niteratively.The convergence analysis is conducted on a modified scheme in a\ncontinuous formulation, showing the convergence to a stationary point.\nNumerical experiments demonstrate the effectiveness of the proposed algorithm\nin terms of accuracy, outperforming the state-of-the-art QRM solvers.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:21:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Chao",""],["Aujol","Jean-Francois",""],["Gilboa","Guy",""],["Lou","Yifei",""]]}
{"id":"2308.04096","submitter":"Meng Fai Lim","authors":"Meng Fai Lim","title":"On fine Mordell-Weil groups over $\\mathbb{Z}_p$-extensions of an\n  imaginary quadratic field","comments":"Revise intro and make some minor changes in body of paper","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $E$ be an elliptic curve over $\\mathbb{Q}$. Greenberg has posed a\nquestion whether the structure of the fine Selmer group over the cyclotomic\n$\\mathbb{Z}_p$-extension of $\\mathbb{Q}$ can be described by cyclotomic\npolynomials in a certain precise manner. A recent work of Lei has made progress\non this problem by proving that the fine Mordell-Weil group (in the sense of\nWuthrich) does have this required property. The goal of this paper is study the\nanalogous question of Greenberg over various $\\mathbb{Z}_p$-extensions of an\nimaginary quadratic field $F$. In particular, when the elliptic curve has\ncomplex multiplication by the ring of integers of the imaginary quadratic\nfield, we obtain analogous results of Lei over the cyclotomic\n$\\mathbb{Z}_p$-extension and anti-cyclotomic $\\mathbb{Z}_p$-extension of $F$.\nIn the event that the elliptic curve has good ordinary reduction at the prime\n$p$, we further obtain a result over the $\\mathbb{Z}_p$-extension of $F$\nunramified outside precisely one of the prime of $F$ above $p$. Finally, we\nstudy the situation of an elliptic curve over the anticyclotomic\n$\\mathbb{Z}_p$-extension under the generalized Heegner hypothesis. Along the\nway, we establish an analogous result for the BDP-Selmer group which may be of\nindependent interest. Motivated by our results, we pose questions analogous to\nthat of Greenberg in each of the above settings.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:23:55 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 01:33:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lim","Meng Fai",""]]}
{"id":"2308.04097","submitter":"Qinxin Yan","authors":"H. Mete Soner, Qinxin Yan","title":"Viscosity Solutions of the Eikonal Equation on the Wasserstein Space","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dynamic programming equations for mean field control problems with a\nseparable structure are Eikonal equations on the Wasserstein space. Standard\ndifferentiation using linear derivatives yield a direct extension of the\nclassical viscosity theory. We use Fourier representation of the Sobolev norms\non the space of measures, together with the standard techniques from the finite\ndimensional theory to obtain a comparison result among sub and super solutions\nthat are Lipschitz continuous in the Wasserstein-one norm which is directly\nverified for the value function. A key technical result provides a point-wise\nupper bound for the derivative of the linear derivative of a function in terms\nof its Lipschitz norm.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:24:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Soner","H. Mete",""],["Yan","Qinxin",""]]}
{"id":"2308.04098","submitter":"Qiming Ding","authors":"Qi-Ming Ding, Yi-Ming Huang, Xiao Yuan","title":"Molecular docking via quantum approximate optimization algorithm","comments":"10 pages, 5 figures, All comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.chem-ph q-bio.BM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Molecular docking plays a pivotal role in drug discovery and precision\nmedicine, enabling us to understand protein functions and advance novel\ntherapeutics. Here, we introduce a potential alternative solution to this\nproblem, the digitized-counterdiabatic quantum approximate optimization\nalgorithm (DC-QAOA), which utilizes counterdiabatic driving and QAOA on a\nquantum computer. Our method was applied to analyze diverse biological systems,\nincluding the SARS-CoV-2 Mpro complex with PM-2-020B, the DPP-4 complex with\npiperidine fused imidazopyridine 34, and the HIV-1 gp120 complex with\nJP-III-048. The DC-QAOA exhibits superior performance, providing more accurate\nand biologically relevant docking results, especially for larger molecular\ndocking problems. Moreover, QAOA-based algorithms demonstrate enhanced hardware\ncompatibility in the noisy intermediate-scale quantum era, indicating their\npotential for efficient implementation under practical docking scenarios. Our\nfindings underscore quantum computing's potential in drug discovery and offer\nvaluable insights for optimizing protein-ligand docking processes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:25:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ding","Qi-Ming",""],["Huang","Yi-Ming",""],["Yuan","Xiao",""]]}
{"id":"2308.04099","submitter":"Meng Fai Lim","authors":"Meng Fai Lim","title":"On the $p$-divisibility of even $K$-groups of the ring of integers of a\n  cyclotomic field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper,\nwe shall give a sufficient condition when a prime $p$ divides the order of the\ngroups $K_{2k}(\\mathbb{Z}[\\zeta_m+\\zeta_m^{-1}])$ and\n$K_{2k}(\\mathbb{Z}[\\zeta_m])$, where $\\zeta_m$ is a primitive $m$th root of\nunity. When $F$ is a $p$-extension contained in $\\mathbb{Q}(\\zeta_l)$ for some\nprime $l$, we also establish a necessary and sufficient condition for the order\nof $K_{2(p-2)}(\\mathcal{O}_F)$ to be divisible by $p$. This generalizes a\nprevious result of Browkin which in turn has applications towards establishing\nthe existence of infinitely many cyclic extensions of degree $p$ which are $(p,\np-1)$-rational.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:27:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lim","Meng Fai",""]]}
{"id":"2308.04100","submitter":"Shiro Kuriwaki","authors":"Shiro Kuriwaki, Jeffrey B. Lewis, Michael Morse","title":"The Still Secret Ballot: The Limited Privacy Cost of Transparent\n  Election Results","comments":"Initial draft, 42 pages, 6 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  After an election, should election officials release an electronic record of\neach ballot? The release of such cast vote records could bolster the legitimacy\nof the certified result. But it may also facilitate vote revelation, where an\nanalyst unravels the secret ballot by uniquely linking vote choices on the\nanonymous ballot to the voter's name and address in the public voter file. We\nprovide the first empirical study of the extent of vote revelation under\nseveral possible election-reporting regimes, ranging from precinct-level\nresults to the individual ballot records known as cast vote records. Using\nMaricopa County, Arizona, as a case study, we find that cast vote records could\nreveal less than 0.2% of any voters' choices in the 2020 general election.\nPerhaps counterintuitively, releasing cast vote records coded by precinct and\nvote method are no more revelatory than releasing aggregate vote tallies for\neach precinct and vote method. We conclude that cast vote records are\nsufficiently privacy-protecting, and suggest how the privacy violations that do\nremain could be reduced.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:27:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kuriwaki","Shiro",""],["Lewis","Jeffrey B.",""],["Morse","Michael",""]]}
{"id":"2308.04101","submitter":"Huajun Huang Dr","authors":"Huajun Huang, Tin-Yau Tam","title":"Extensions of Yamamoto-Nayak's Theorem","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A result of Nayak asserts that $\\underset{m\\to \\infty}\\lim |A^m|^{1/m}$\nexists for each $n\\times n$ complex matrix $A$, where $|A| = (A^*A)^{1/2}$, and\nthe limit is given in terms of the spectral decomposition. We extend the result\nof Nayak, namely, we prove that the limit of $\\underset{m\\to \\infty}\\lim\n|BA^mC|^{1/m}$ exists for any $n\\times n$ complex matrices $A$, $B$, and $C$\nwhere $B$ and $C$ are nonsingular; the limit is obtained and is independent of\n$B$. We then provide generalization in the context of real semisimple Lie\ngroups.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:30:45 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 20:12:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Huajun",""],["Tam","Tin-Yau",""]]}
{"id":"2308.04102","submitter":"Jason Liang","authors":"Jason Liang, Hormoz Shahrzad, Risto Miikkulainen","title":"Asynchronous Evolution of Deep Neural Network Architectures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.DC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many evolutionary algorithms (EAs) take advantage of parallel evaluation of\ncandidates. However, if evaluation times vary significantly, many worker nodes\n(i.e.,\\ compute clients) are idle much of the time, waiting for the next\ngeneration to be created. Evolutionary neural architecture search (ENAS), a\nclass of EAs that optimizes the architecture and hyperparameters of deep neural\nnetworks, is particularly vulnerable to this issue. This paper proposes a\ngeneric asynchronous evaluation strategy (AES) that is then adapted to work\nwith ENAS. AES increases throughput by maintaining a queue of upto $K$\nindividuals ready to be sent to the workers for evaluation and proceeding to\nthe next generation as soon as $M<<K$ individuals have been evaluated by the\nworkers. A suitable value for $M$ is determined experimentally, balancing\ndiversity and efficiency. To showcase the generality and power of AES, it was\nfirst evaluated in 11-bit multiplexer design (a single-population verifiable\ndiscovery task) and then scaled up to ENAS for image captioning (a\nmulti-population open-ended-optimization task). In both problems, a multifold\nperformance improvement was observed, suggesting that AES is a promising method\nfor parallelizing the evolution of complex systems with long and variable\nevaluation times, such as those in ENAS.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:33:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liang","Jason",""],["Shahrzad","Hormoz",""],["Miikkulainen","Risto",""]]}
{"id":"2308.04103","submitter":"Ji Wei Yoon","authors":"Ji Wei Yoon, Adithya Kumar, Pawan Kumar, Kedar Hippalgaonkar, J\n  Senthilnath, Vijila Chellappan","title":"Explainable machine learning to enable high-throughput electrical\n  conductivity optimization of doped conjugated polymers","comments":"33 Pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The combination of high-throughput experimentation techniques and machine\nlearning (ML) has recently ushered in a new era of accelerated material\ndiscovery, enabling the identification of materials with cutting-edge\nproperties. However, the measurement of certain physical quantities remains\nchallenging to automate. Specifically, meticulous process control,\nexperimentation and laborious measurements are required to achieve optimal\nelectrical conductivity in doped polymer materials. We propose a ML approach,\nwhich relies on readily measured absorbance spectra, to accelerate the workflow\nassociated with measuring electrical conductivity. The first ML model\n(classification model), accurately classifies samples with a conductivity >~25\nto 100 S/cm, achieving a maximum of 100% accuracy rate. For the subset of\nhighly conductive samples, we employed a second ML model (regression model), to\npredict their conductivities, yielding an impressive test R2 value of 0.984. To\nvalidate the approach, we showed that the models, neither trained on the\nsamples with the two highest conductivities of 498 and 506 S/cm, were able to,\nin an extrapolative manner, correctly classify and predict them at satisfactory\nlevels of errors. The proposed ML workflow results in an improvement in the\nefficiency of the conductivity measurements by 89% of the maximum achievable\nusing our experimental techniques. Furthermore, our approach addressed the\ncommon challenge of the lack of explainability in ML models by exploiting\nbespoke mathematical properties of the descriptors and ML model, allowing us to\ngain corroborated insights into the spectral influences on conductivity.\nThrough this study, we offer an accelerated pathway for optimizing the\nproperties of doped polymer materials while showcasing the valuable insights\nthat can be derived from purposeful utilization of ML in experimental science.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:38:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yoon","Ji Wei",""],["Kumar","Adithya",""],["Kumar","Pawan",""],["Hippalgaonkar","Kedar",""],["Senthilnath","J",""],["Chellappan","Vijila",""]]}
{"id":"2308.04104","submitter":"Radoslav K. Zamanov","authors":"R. K. Zamanov, V. Marchev, J. Marti, and G. Y. Latev","title":"Pre-outburst signal in the light curves of the recurrent novae RS Oph\n  and T CrB","comments":"preliminary version","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pre-outburst signal (a decrease of the optical brightness) just before the\noutburst is clearly detected in the observations of the T CrB obtained before\nand during the 1946 outburst. A similar decrease is also visible in the light\ncurve of RS Oph during the 2021 outburst. We suppose that this is due to\nformation of a thick, dense envelope around the white dwarf, and we estimate\nits size (1000 - 2000 km), mass (5.10$^{-8}$ - 6.10$^{-7}$ M$_\\odot$) and\naverage density (5 - 16 g cm$^{-3}$).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:38:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zamanov","R. K.",""],["Marchev","V.",""],["Marti","J.",""],["Latev","G. Y.",""]]}
{"id":"2308.04105","submitter":"Agustin Schiffrin","authors":"Agustin Schiffrin, Martina Capsoni, Gelareh Farahi, Chen-Guang Wang,\n  Cornelius Krull, Marina Castelli, Tanya S. Roussy, Katherine A. Cochrane,\n  Yuefeng Yin, Nikhil Medhekar, Adam Q. Shaw, Wei Ji and Sarah A. Burke","title":"Designing optoelectronic properties by on-surface synthesis: formation\n  and electronic structure of an iron-terpyridine macromolecular complex","comments":null,"journal-ref":null,"doi":"10.1021/acsnano.8b01026","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Supramolecular chemistry protocols applied on surfaces offer compelling\navenues for atomic scale control over organic-inorganic interface structures.\nIn this approach, adsorbate-surface interactions and two-dimensional\nconfinement can lead to morphologies and properties that differ dramatically\nfrom those achieved via conventional synthetic approaches. Here, we describe\nthe bottom-up, on-surface synthesis of one-dimensional coordination\nnanostructures based on an iron (Fe)-terpyridine (tpy) interaction borrowed\nfrom functional metal-organic complexes used in photovoltaic and catalytic\napplications. Thermally activated diffusion of sequentially deposited ligands\nand metal atoms, and intra-ligand conformational changes, lead to Fe-tpy\ncoordination and formation of these nanochains. Low-temperature Scanning\nTunneling Microscopy and Density Functional Theory were used to elucidate the\natomic-scale morphology of the system, providing evidence of a linear tri-Fe\nlinkage between facing, coplanar tpy groups. Scanning Tunneling Spectroscopy\nreveals highest occupied orbitals with dominant contributions from states\nlocated at the Fe node, and ligand states that mostly contribute to the lowest\nunoccupied orbitals. This electronic structure yields potential for hosting\nphoto-induced metal-to-ligand charge transfer in the visible/near-infrared. The\nformation of this unusual tpy/tri-Fe/tpy coordination motif has not been\nobserved for wet chemistry synthesis methods, and is mediated by the bottom-up\non-surface approach used here.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:43:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Schiffrin","Agustin",""],["Capsoni","Martina",""],["Farahi","Gelareh",""],["Wang","Chen-Guang",""],["Krull","Cornelius",""],["Castelli","Marina",""],["Roussy","Tanya S.",""],["Cochrane","Katherine A.",""],["Yin","Yuefeng",""],["Medhekar","Nikhil",""],["Shaw","Adam Q.",""],["Ji","Wei",""],["Burke","Sarah A.",""]]}
{"id":"2308.04106","submitter":"Adriano Barra","authors":"Elena Agliari and Andrea Alessandrelli and Adriano Barra and Federico\n  Ricci-Tersenghi","title":"Parallel Learning by Multitasking Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn physics.bio-ph stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A modern challenge of Artificial Intelligence is learning multiple patterns\nat once (i.e.parallel learning). While this can not be accomplished by standard\nHebbian associative neural networks, in this paper we show how the Multitasking\nHebbian Network (a variation on theme of the Hopfield model working on sparse\ndata-sets) is naturally able to perform this complex task. We focus on systems\nprocessing in parallel a finite (up to logarithmic growth in the size of the\nnetwork) amount of patterns, mirroring the low-storage level of standard\nassociative neural networks at work with pattern recognition. For mild dilution\nin the patterns, the network handles them hierarchically, distributing the\namplitudes of their signals as power-laws w.r.t. their information content\n(hierarchical regime), while, for strong dilution, all the signals pertaining\nto all the patterns are raised with the same strength (parallel regime).\nFurther, confined to the low-storage setting (i.e., far from the spin glass\nlimit), the presence of a teacher neither alters the multitasking performances\nnor changes the thresholds for learning: the latter are the same whatever the\ntraining protocol is supervised or unsupervised. Results obtained through\nstatistical mechanics, signal-to-noise technique and Monte Carlo simulations\nare overall in perfect agreement and carry interesting insights on multiple\nlearning at once: for instance, whenever the cost-function of the model is\nminimized in parallel on several patterns (in its description via Statistical\nMechanics), the same happens to the standard sum-squared error Loss function\n(typically used in Machine Learning).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:43:31 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Agliari","Elena",""],["Alessandrelli","Andrea",""],["Barra","Adriano",""],["Ricci-Tersenghi","Federico",""]]}
{"id":"2308.04107","submitter":"Zhen He","authors":"Zhen He, Wei Luo, Zhaoyang Yin","title":"Generic regularity of conservative solutions to the Novikov equation","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 concentrate on the Novikov equation. For an open dense set\nof C 3 initial data, we prove that the solution is piecewise smooth in the t-x\nplane, while the gradient uux can blow up along finitely many characteristic\ncurves. And we provide a description of the solution in a neighborhood of each\nsingular point.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:44:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["He","Zhen",""],["Luo","Wei",""],["Yin","Zhaoyang",""]]}
{"id":"2308.04108","submitter":"Maria Vitttoria Zanchettin","authors":"Maria Vittoria Zanchettin, Chiara Feruglio, Marcella Massardi, Andrea\n  Lapi, Manuela Bischetti, Sebastiano Cantalupo, Fabrizio Fiore, Angela\n  Bongiorno, Angela Malizia, Andrea Marinucci, Manuela Molina, Enrico\n  Piconcelli, Francesco Tombesi, Andrea Travascio, Giulia Tozzi and Roberta\n  Tripodi","title":"NGC 2992: The interplay between the multiphase disk, wind and radio\n  bubbles","comments":"19 pages, 17 figures, 6 tables; Accepted by A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an analysis of the gas kinematics in NGC 2992, based on VLT/MUSE,\nALMA and VLA data, aimed at characterising the disk, the wind and their\ninterplay in the cold molecular and warm ionised phases. CO(2-1) and H$\\rm\n\\alpha~$ arise from a multiphase disk with inclination 80 deg and radii 1.5 and\n1.8 kpc, respectively. We find that the velocity dispersion of the cold\nmolecular phase is consistent with that of star forming galaxies at the same\nredshift, except in the inner 600 pc region, and in the region between the cone\nwalls and the disk. This suggests that a disk-wind interaction locally boosts\nthe gas turbulence. We detect a clumpy ionised wind distributed in two wide\nopening angle ionisation cones reaching scales of 7 kpc. The [O III] wind\nexpands with velocity exceeding -1000 km/s in the inner 600 pc, a factor of 5\nlarger than the previously reported wind velocity. Based on spatially resolved\nelectron density and ionisation parameter maps, we infer an ionised outflow\nmass of $M_{\\rm of,ion} = (3.2 \\pm 0.3) \\times \\, 10^7 \\, M_{\\odot}$, and a\ntotal ionised outflow rate of $\\dot M_{\\rm of,ion}=13.5\\pm1$ \\sfr. We detected\nclumps of cold molecular gas located above and below the disk reaching maximum\nprojected distances and velocities of 1.7 kpc and 200 km/s, respectively. On\nthese scales, the wind is multiphase, with a fast ionised component and a\nslower molecular one, and a total mass of $M_{\\rm of, ion+mol}= 5.8 \\times 10^7\n\\, M_{\\odot}$, of which the molecular component carries the bulk of the mass.\nThe dusty molecular outflowing clumps and the turbulent ionised gas are located\nat the edges of the radio bubbles, suggesting that the bubbles interact with\nthe surrounding medium through shocks. We detect a dust reservoir co-spatial\nwith the molecular disk, with a cold dust mass $M_{\\rm dust} = (4.04 \\pm 0.03)\n\\times \\, 10^{6} \\, M_{\\odot}$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:45:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zanchettin","Maria Vittoria",""],["Feruglio","Chiara",""],["Massardi","Marcella",""],["Lapi","Andrea",""],["Bischetti","Manuela",""],["Cantalupo","Sebastiano",""],["Fiore","Fabrizio",""],["Bongiorno","Angela",""],["Malizia","Angela",""],["Marinucci","Andrea",""],["Molina","Manuela",""],["Piconcelli","Enrico",""],["Tombesi","Francesco",""],["Travascio","Andrea",""],["Tozzi","Giulia",""],["Tripodi","Roberta",""]]}
{"id":"2308.04109","submitter":"Yongzhu Chang","authors":"Yongzhu Chang, Rongsheng Zhang, Jiashu Pu","title":"I-WAS: a Data Augmentation Method with GPT-2 for Simile Detection","comments":"15 pages, 1 figure","journal-ref":"published ICDAR 2023 D-NLP","doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simile detection is a valuable task for many natural language processing\n(NLP)-based applications, particularly in the field of literature. However,\nexisting research on simile detection often relies on corpora that are limited\nin size and do not adequately represent the full range of simile forms. To\naddress this issue, we propose a simile data augmentation method based on\n\\textbf{W}ord replacement And Sentence completion using the GPT-2 language\nmodel. Our iterative process called I-WAS, is designed to improve the quality\nof the augmented sentences. To better evaluate the performance of our method in\nreal-world applications, we have compiled a corpus containing a more diverse\nset of simile forms for experimentation. Our experimental results demonstrate\nthe effectiveness of our proposed data augmentation method for simile\ndetection.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:47:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chang","Yongzhu",""],["Zhang","Rongsheng",""],["Pu","Jiashu",""]]}
{"id":"2308.04110","submitter":"Naveed Iqbal","authors":"Naveed Iqbal, Mudassir Masood, Ali Nasir, Khurram Karim Qureshi","title":"Review of Contemporary Energy Harvesting Techniques and Their\n  Feasibility in Wireless Geophones","comments":null,"journal-ref":"International Journal of Energy Research, 46(5), 5703-5730","doi":"10.1002/er.7626","report-no":null,"categories":"eess.SP physics.ins-det","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Energy harvesting converts ambient energy to electrical energy providing\nnumerous opportunities to realize wireless sensors. Seismic exploration is a\nprime avenue to benefit from it as energy harvesting equipped geophones would\nrelieve the burden of cables which account for the biggest chunk of exploration\ncost and equipment weight. Since numerous energies are abundantly available in\nseismic fields, these can be harvested to power up geophones. However, due to\nthe random and intermittent nature of the harvested energy, it is important\nthat geophones must be equipped to tap from several energy sources for a stable\noperation. It may involve some initial installation cost but in the long run,\nit is cost-effective and beneficial as the sources for energy harvesting are\navailable naturally. Extensive research has been carried out in recent years to\nharvest energies from various sources. However, there has not been a thorough\ninvestigation of utilizing these developments in the seismic context. In this\nsurvey, a comprehensive literature review is provided on the research progress\nin energy harvesting methods suitable for direct adaptation in geophones.\nSpecifically, the focus is on small form factor energy harvesting circuits and\nsystems capable of harvesting energy from wind, sun, vibrations, temperature\ndifference, and radio frequencies. Furthermore, case studies are presented to\nassess the suitability of the studied energy harvesting methods. Finally, a\ndesign of energy harvesting equipped geophone is also proposed.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:48:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Iqbal","Naveed",""],["Masood","Mudassir",""],["Nasir","Ali",""],["Qureshi","Khurram Karim",""]]}
{"id":"2308.04111","submitter":"Xingliang Tian","authors":"Shengbing Deng and Xingliang Tian","title":"On the stability of Caffarelli-Kohn-Nirenberg inequality in $\\R^2$","comments":"arXiv admin note: text overlap with arXiv:2211.14185 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Dolbeault, Esteban and Loss \\cite{DEL16} obtained an optimal rigidity result,\nthat is, when $a<0$ and $b_{\\mathrm{FS}}(a)\\leq b<a+1$ the extremal function\nfor best constant $\\mathcal{S}_{a,b}>0$ of the following\nCaffarelli-Kohn-Nirenberg inequality is symmetry, \\[\n\\mathcal{S}_{a,b}\\left(\\int_{\\R^2}|x|^{-qb}|u|^q\n\\mathrm{d}x\\right)^{\\frac{2}{q}}\n  \\leq \\int_{\\R^2}|x|^{-2a}|\\nabla u|^2 \\mathrm{d}x, \\quad \\mbox{for all}\\quad\nu\\in C^\\infty_0(\\R^2), \\] where $b_{\\mathrm{FS}}(a):=a-\\frac{a}{\\sqrt{a^2+1}}$,\n$q=\\frac{2}{b-a}$. An important task is investigating the stability of critical\npoints set $\\mathcal{M}$ for this inequality. Firstly, we classify solutions of\nthe linearized problem related to the extremals which fills the work of Felli\nand Schneider \\cite{FS03}. When $b_{\\mathrm{FS}}(a)< b<a+1$, we investigate the\nstability of previous inequality by using spectral estimate combined with a\ncompactness argument that\n  \\begin{align*}\n  \\int_{\\mathbb{R}^2}|x|^{-2a}|\\nabla u|^2 \\mathrm{d}x\n  -\\mathcal{S}_{a,b}\\left(\\int_{\\mathbb{R}^2}|x|^{-qb}|u|^q\n\\mathrm{d}x\\right)^{\\frac{2}{q}}\n  \\geq \\mathcal{B}\n  \\mathrm{dist}(u,\\mathcal{M})^2,\\quad \\mbox{for all}\\quad u\\in\nC^\\infty_0(\\R^2),\n  \\end{align*}\n  for some $\\mathcal{B}>0$, however it is false when $b=b_{\\mathrm{FS}}(a)$,\nwhich extends the work of Wei and Wu \\cite{WW22} to $\\R^2$. Furthermore, we\nobtain the existence of minimizers for $\\mathcal{B}$ which extends the recent\nwork of K\\\"{o}nig \\cite{Ko22-2}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:53:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Deng","Shengbing",""],["Tian","Xingliang",""]]}
{"id":"2308.04112","submitter":"Jiantao Shi","authors":"Jiantao Shi, Ye Guo, Wenchuan Wu, Hongbin Sun","title":"Multi-Interval Rolling-Window Joint Dispatch and Pricing of Energy and\n  Reserve under Uncertainty","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":"  In this paper, the intra-day multi-interval rolling-window joint dispatch and\npricing of energy and reserve is studied under increasing volatile and\nuncertain renewable generations. A look-ahead energy-reserve co-optimization\nmodel is proposed for the rolling-window dispatch, where possible contingencies\nand load/renewable forecast errors over the look-ahead window are modeled as\nseveral scenario trajectories, while generation, especially its ramp, is\njointly scheduled with reserve to minimize the expected system cost considering\nthese scenarios. Based on the proposed model, marginal prices of energy and\nreserve are derived, which incorporate shadow prices of generators' individual\nramping capability limits to eliminate their possible ramping-induced\nopportunity costs or arbitrages. We prove that under mild conditions, the\nproposed market design provides dispatch-following incentives to generators\nwithout the need for out-of-the-market uplifts, and truthful-bidding incentives\nof price-taking generators can be guaranteed as well. Some discussions are also\nmade on how to fit the proposed framework into current market practice. These\nfindings are validated in numerical simulations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:59:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shi","Jiantao",""],["Guo","Ye",""],["Wu","Wenchuan",""],["Sun","Hongbin",""]]}
{"id":"2308.04113","submitter":"Zsolt Gulacsi","authors":"Zsolt Gulacsi","title":"Pentagon chain with spin orbit interactions: exact many-body ground\n  states in the interacting case","comments":"47 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Based on a positive semidefinite operator technique, exact ground states are\ndeduced for the non-integrable conducting polymers possessing pentagon type of\nunit cell. The study is done in the presence of many-body spin-orbit\ninteraction (SOI), local and nearest neighbor Coulomb repulsion (NNCR) and\npresence of external $E$ electric and $B$ magnetic fields, such that the\neffects of $B$ on both orbital and spin degrees of freedom is considered. The\nSOI, NNCR, and presented external field configurations presence in exact\nconducting polymer ground states is a novelty, so the development of the\ntechnique for the treatment possibility of such strongly correlated cases is\npresented in details. The deduced ground states show a broad spectrum of\nphysical characteristics ranging from charge density waves, metal-insulator\ntransitions, to interesting external field driven effects as e.g. modification\npossibility of a static charge distribution by a static external magnetic\nfield.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:00:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gulacsi","Zsolt",""]]}
{"id":"2308.04114","submitter":"Yuxia Wang","authors":"Yuxia Wang, Shimin Tao, Ning Xie, Hao Yang, Timothy Baldwin, Karin\n  Verspoor","title":"Collective Human Opinions in Semantic Textual Similarity","comments":"16 pages, 7 figures","journal-ref":"TACL Submission batch: 7/2022; Revision batch: 1/2023; Published\n  2023","doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the subjective nature of semantic textual similarity (STS) and\npervasive disagreements in STS annotation, existing benchmarks have used\naveraged human ratings as the gold standard. Averaging masks the true\ndistribution of human opinions on examples of low agreement, and prevents\nmodels from capturing the semantic vagueness that the individual ratings\nrepresent. In this work, we introduce USTS, the first Uncertainty-aware STS\ndataset with ~15,000 Chinese sentence pairs and 150,000 labels, to study\ncollective human opinions in STS. Analysis reveals that neither a scalar nor a\nsingle Gaussian fits a set of observed judgements adequately. We further show\nthat current STS models cannot capture the variance caused by human\ndisagreement on individual instances, but rather reflect the predictive\nconfidence over the aggregate dataset.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:00:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Yuxia",""],["Tao","Shimin",""],["Xie","Ning",""],["Yang","Hao",""],["Baldwin","Timothy",""],["Verspoor","Karin",""]]}
{"id":"2308.04115","submitter":"Zian Liu","authors":"Zian Liu, Chao Chen, Muhammad Ejaz Ahmed, Jun Zhang, Dongxi Liu","title":"model-based script synthesis for fuzzing","comments":"12 pages, conference paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kernel fuzzing is important for finding critical kernel vulnerabilities.\nClose-source (e.g., Windows) operating system kernel fuzzing is even more\nchallenging due to the lack of source code. Existing approaches fuzz the kernel\nby modeling syscall sequences from traces or static analysis of system codes.\nHowever, a common limitation is that they do not learn and mutate the syscall\nsequences to reach different kernel states, which can potentially result in\nmore bugs or crashes.\n  In this paper, we propose WinkFuzz, an approach to learn and mutate traced\nsyscall sequences in order to reach different kernel states. WinkFuzz learns\nsyscall dependencies from the trace, identifies potential syscalls in the trace\nthat can have dependent subsequent syscalls, and applies the dependencies to\ninsert more syscalls while preserving the dependencies into the trace. Then\nWinkFuzz fuzzes the synthesized new syscall sequence to find system crashes.\n  We applied WinkFuzz to four seed applications and found a total increase in\nsyscall number of 70.8\\%, with a success rate of 61\\%, within three insert\nlevels. The average time for tracing, dependency analysis, recovering model\nscript, and synthesizing script was 600, 39, 34, and 129 seconds respectively.\nThe instant fuzzing rate is 3742 syscall executions per second. However, the\naverage fuzz efficiency dropped to 155 syscall executions per second when the\ninitializing time, waiting time, and other factors were taken into account. We\nfuzzed each seed application for 24 seconds and, on average, obtained 12.25\ncrashes within that time frame.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:07:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liu","Zian",""],["Chen","Chao",""],["Ahmed","Muhammad Ejaz",""],["Zhang","Jun",""],["Liu","Dongxi",""]]}
{"id":"2308.04116","submitter":"Massimo Boninsegni","authors":"Jieru Hu and Massimo Boninsegni","title":"Phase diagram of muonium hydride: when dimensionality matters","comments":"Five pages, four figures in color","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We carry out a theoretical investigation of the low-temperature phase diagram\nof muonium hydride in two dimensions, using numerical simulations. It is shown\nthat the phase diagram of this substance is qualitatively different in two and\nthree dimensions. Specifically, while in three dimensions it has been shown to\nbe essentially identical to that of parahydrogen, i.e., only displaying a\nsingle (crystalline) phase, in two dimensions it is very similar to that of\nHe-4, with an equilibrium liquid phase that turns superfluid at a temperature\nas high as ~ 2.2 K, and that crystallizes under applied pressure. To our\nknowledge, this is the first well-described case of a condensed matter system\nwhose phase diagram is drastically altered by dimensional reduction.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:10:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Jieru",""],["Boninsegni","Massimo",""]]}
{"id":"2308.04117","submitter":"Danielle Holmes","authors":"Danielle Holmes (1), Benjamin Wilhelm (1), Alexander M. Jakob (2), Xi\n  Yu (1), Fay E. Hudson (1,3), Kohei M. Itoh (4), Andrew S. Dzurak (1,3), David\n  N. Jamieson (2), Andrea Morello (1) ((1) CQC2T, School of Electrical\n  Engineering and Telecommunications, UNSW Sydney, Australia, (2) CQC2T, School\n  of Physics, The University of Melbourne, Australia, (3) Diraq, Sydney,\n  Australia, (4) School of Fundamental Science and Technology, Keio University,\n  Japan)","title":"Improved placement precision of implanted donor spin qubits in silicon\n  using molecule ions","comments":"8 pages, 5 figures, 1 table","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":"  Donor spins in silicon-28 ($^{28}$Si) are among the most performant qubits in\nthe solid state, offering record coherence times and gate fidelities above 99%.\nDonor spin qubits can be fabricated using the semiconductor-industry compatible\nmethod of deterministic ion implantation. Here we show that the precision of\nthis fabrication method can be boosted by implanting molecule ions instead of\nsingle atoms. The bystander ions, co-implanted with the dopant of interest,\ncarry additional kinetic energy and thus increase the detection confidence of\ndeterministic donor implantation employing single ion detectors to signal the\ninduced electron-hole pairs. This allows the placement uncertainty of donor\nqubits to be minimised without compromising on detection confidence. We\ninvestigate the suitability of phosphorus difluoride (PF$_2^+$) molecule ions\nto produce high quality P donor qubits. Since $^{19}$F nuclei have a spin of $I\n= 1/2$, it is imperative to ensure that they do not hyperfine couple to P donor\nelectrons as they would cause decoherence by adding magnetic noise. Using\nsecondary ion mass spectrometry, we confirm that F diffuses away from the\nactive region of qubit devices while the P donors remain close to their\noriginal location during a donor activation anneal. PF$_2$-implanted qubit\ndevices were then fabricated and electron spin resonance (ESR) measurements\nwere performed on the P donor electron. A pure dephasing time of $T_2^* = 20.5\n\\pm 0.5$ $\\mu$s and a coherence time of $T_2^{Hahn} = 424 \\pm 5$ $\\mu$s were\nextracted for the P donor electron-values comparable to those found in previous\nP-implanted qubit devices. Closer investigation of the P donor ESR spectrum\nrevealed that no $^{19}$F nuclear spins were found in the vicinity of the P\ndonor. Molecule ions therefore show great promise for producing high-precision\ndeterministically-implanted arrays of long-lived donor spin qubits.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:13:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Holmes","Danielle",""],["Wilhelm","Benjamin",""],["Jakob","Alexander M.",""],["Yu","Xi",""],["Hudson","Fay E.",""],["Itoh","Kohei M.",""],["Dzurak","Andrew S.",""],["Jamieson","David N.",""],["Morello","Andrea",""]]}
{"id":"2308.04118","submitter":"Qianru Qiu","authors":"Qianru Qiu, Xueting Wang, Mayu Otani","title":"Multimodal Color Recommendation in Vector Graphic Documents","comments":"Accepted to ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Color selection plays a critical role in graphic document design and requires\nsufficient consideration of various contexts. However, recommending appropriate\ncolors which harmonize with the other colors and textual contexts in documents\nis a challenging task, even for experienced designers. In this study, we\npropose a multimodal masked color model that integrates both color and textual\ncontexts to provide text-aware color recommendation for graphic documents. Our\nproposed model comprises self-attention networks to capture the relationships\nbetween colors in multiple palettes, and cross-attention networks that\nincorporate both color and CLIP-based text representations. Our proposed method\nprimarily focuses on color palette completion, which recommends colors based on\nthe given colors and text. Additionally, it is applicable for another color\nrecommendation task, full palette generation, which generates a complete color\npalette corresponding to the given text. Experimental results demonstrate that\nour proposed approach surpasses previous color palette completion methods on\naccuracy, color distribution, and user experience, as well as full palette\ngeneration methods concerning color diversity and similarity to the ground\ntruth palettes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:17:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Qiu","Qianru",""],["Wang","Xueting",""],["Otani","Mayu",""]]}
{"id":"2308.04119","submitter":"Qianxiao Li","authors":"Xiaoli Chen, Beatrice W. Soh, Zi-En Ooi, Eleonore Vissol-Gaudin,\n  Haijun Yu, Kostya S. Novoselov, Kedar Hippalgaonkar, Qianxiao Li","title":"Constructing Custom Thermodynamics Using Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the most exciting applications of AI is automated scientific discovery\nbased on previously amassed data, coupled with restrictions provided by the\nknown physical principles, including symmetries and conservation laws. Such\nautomated hypothesis creation and verification can assist scientists in\nstudying complex phenomena, where traditional physical intuition may fail. Of\nparticular importance are complex dynamic systems where their time evolution is\nstrongly influenced by varying external parameters. In this paper we develop a\nplatform based on a generalised Onsager principle to learn macroscopic\ndynamical descriptions of arbitrary stochastic dissipative systems directly\nfrom observations of their microscopic trajectories. We focus on systems whose\ncomplexity and sheer sizes render complete microscopic description impractical,\nand constructing theoretical macroscopic models requires extensive domain\nknowledge or trial-and-error. Our machine learning approach addresses this by\nsimultaneously constructing reduced thermodynamic coordinates and interpreting\nthe dynamics on these coordinates. We demonstrate our method by studying\ntheoretically and validating experimentally, the stretching of long polymer\nchains in an externally applied field. Specifically, we learn three\ninterpretable thermodynamic coordinates and build a dynamical landscape of\npolymer stretching, including (1) the identification of stable and transition\nstates and (2) the control of the stretching rate. We further demonstrate the\nuniversality of our approach by applying it to an unrelated problem in a\ndifferent domain: constructing macroscopic dynamics for spatial epidemics,\nshowing that our method addresses wide scientific and technological\napplications.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:19:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Xiaoli",""],["Soh","Beatrice W.",""],["Ooi","Zi-En",""],["Vissol-Gaudin","Eleonore",""],["Yu","Haijun",""],["Novoselov","Kostya S.",""],["Hippalgaonkar","Kedar",""],["Li","Qianxiao",""]]}
{"id":"2308.04120","submitter":"Guy D. Moore","authors":"Parikshit M. Junnarkar, Guy D. Moore, Aidan Chaumet","title":"Step scaling with gradient flow and finite temperature","comments":"11 pages including 5 figures and 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We combine gradient flow, step-scaling, and finite-temperature boundary\nconditions to scale-set 2+1+1 flavor QCD lattices with physical HISQ quarks at\nmultiple spacings down to a=0.01378 fm, such that they represent the same\ntemperature at the percent level and the same quark mass to a few percent. This\npreparatory work will allow the evaluation and continuum extrapolation of the\ntopological susceptibility at up to 1 GeV temperatures with good control over\nquark-mass effects.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:19:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Junnarkar","Parikshit M.",""],["Moore","Guy D.",""],["Chaumet","Aidan",""]]}
{"id":"2308.04121","submitter":"Lei Wei","authors":"Zhiwen Duan and Lei Wei","title":"Dispersive decay estimates for the magnetic Schr\\\"odinger equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a proof of dispersive decay for both linear and\nnonlinear magnetic Schr\\\"odinger equations. To achieve this, we introduce the\nfractional distorted Fourier transforms with magnetic potentials and define the\nfractional differential operator $\\arrowvert J_{A}(t)\\arrowvert^{s}$. By\nleveraging the properties of the distorted Fourier transforms and the\nStrichartz estimates of $\\arrowvert J_{A}\\arrowvert^{s}u$, we establish the\ndispersive bounds with the decay rate $t^{-\\frac{n}{2}}$. This decay rate\nprovides valuable insights into the spreading properties and long-term dynamics\nof the solutions to the magnetic Schr\\\"odinger equations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:23:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Duan","Zhiwen",""],["Wei","Lei",""]]}
{"id":"2308.04122","submitter":"Max Knoop Ir.","authors":"Max W. Knoop, Friso H. Hartog, Ferdinand F. J. Schrijer, Olaf W. G.\n  van Campenhout, Michiel van Nesselrooij and Bas W. van Oudheusden","title":"An experimental realisation of steady spanwise forcing for turbulent\n  drag reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an experimental realisation of spatial spanwise forcing in a\nturbulent boundary layer flow, aimed at reducing the frictional drag. The\nforcing is achieved by a series of spanwise running belts, running in\nalternating spanwise direction, thereby generating a steady spatial square-wave\nforcing. Stereoscopic particle image velocimetry is used to investigate the\nimpact of actuation on the flow in terms of turbulence statistics, performance\ncharacteristics, and spanwise velocity profiles, for a waveform of $\\lambda_x^+\n= 401$. An extension of the classical spatial Stokes layer theory is proposed\nbased on the linear superposition of Fourier modes to describe the\nnon-sinusoidal boundary condition. The experimentally obtained spanwise\nprofiles show good agreement with the extended theoretical model. In line with\nreported numerical studies, we confirm that a significant flow control effect\ncan be realised with this type of forcing. The results reveal a maximum drag\nreduction of 26% and a maximum net power savings of 8%. In view of the limited\nspatial extent of the actuation surface in the current setup, the drag\nreduction is expected to increase further as a result of its streamwise\ntransient. The second-order turbulence statistics are attenuated up to a\nwall-normal height of $y^+ \\approx 100$, with a maximum streamwise stress\nreduction of 44% and a reduction of integral turbulence kinetic energy\nproduction of 39%.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:25:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Knoop","Max W.",""],["Hartog","Friso H.",""],["Schrijer","Ferdinand F. J.",""],["van Campenhout","Olaf W. G.",""],["van Nesselrooij","Michiel",""],["van Oudheusden","Bas W.",""]]}
{"id":"2308.04123","submitter":"Davide Villa","authors":"Davide Villa, Daniel Uvaydov, Leonardo Bonati, Pedram Johari, Josep\n  Miquel Jornet, Tommaso Melodia","title":"Twinning Commercial Radio Waveforms in the Colosseum Wireless Network\n  Emulator","comments":"8 pages, 13 figures, 2 tables","journal-ref":null,"doi":"10.1145/3615453.3616519","report-no":null,"categories":"cs.NI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Because of the ever-growing amount of wireless consumers, spectrum-sharing\ntechniques have been increasingly common in the wireless ecosystem, with the\nmain goal of avoiding harmful interference to coexisting communication systems.\nThis is even more important when considering systems, such as nautical and\naerial fleet radars, in which incumbent radios operate mission-critical\ncommunication links. To study, develop, and validate these solutions, adequate\nplatforms, such as the Colosseum wireless network emulator, are key as they\nenable experimentation with spectrum-sharing heterogeneous radio technologies\nin controlled environments. In this work, we demonstrate how Colosseum can be\nused to twin commercial radio waveforms to evaluate the coexistence of such\ntechnologies in complex wireless propagation environments. To this aim, we\ncreate a high-fidelity spectrum-sharing scenario on Colosseum to evaluate the\nimpact of twinned commercial radar waveforms on a cellular network operating in\nthe CBRS band. Then, we leverage IQ samples collected on the testbed to train a\nmachine learning agent that runs at the base station to detect the presence of\nincumbent radar transmissions and vacate the bandwidth to avoid causing them\nharmful interference. Our results show an average detection accuracy of 88%,\nwith accuracy above 90% in SNR regimes above 0 dB and SINR regimes above -20\ndB, and with an average detection time of 137 ms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:26:03 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 15:38:14 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 11:09:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Villa","Davide",""],["Uvaydov","Daniel",""],["Bonati","Leonardo",""],["Johari","Pedram",""],["Jornet","Josep Miquel",""],["Melodia","Tommaso",""]]}
{"id":"2308.04124","submitter":"Milo\\v{s} \\v{S}va\\v{n}a","authors":"Milo\\v{s} \\v{S}va\\v{n}a","title":"Social Media, Topic Modeling and Sentiment Analysis in Municipal\n  Decision Support","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many cities around the world are aspiring to become. However, smart\ninitiatives often give little weight to the opinions of average citizens.\n  Social media are one of the most important sources of citizen opinions. This\npaper presents a prototype of a framework for processing social media posts\nwith municipal decision-making in mind. The framework consists of a sequence of\nthree steps: (1) determining the sentiment polarity of each social media post\n(2) identifying prevalent topics and mapping these topics to individual posts,\nand (3) aggregating these two pieces of information into a fuzzy number\nrepresenting the overall sentiment expressed towards each topic. Optionally,\nthe fuzzy number can be reduced into a tuple of two real numbers indicating the\n\"amount\" of positive and negative opinion expressed towards each topic.\n  The framework is demonstrated on tweets published from Ostrava, Czechia over\na period of about two months. This application illustrates how fuzzy numbers\nrepresent sentiment in a richer way and capture the diversity of opinions\nexpressed on social media.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:27:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["\u0160va\u0148a","Milo\u0161",""]]}
{"id":"2308.04125","submitter":"Chao Wang","authors":"Chao Wang, Ming Yan, Junjie Yu","title":"Sorted L1/L2 Minimization for Sparse Signal Recovery","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces a novel approach for recovering sparse signals using\nsorted L1/L2 minimization. The proposed method assigns higher weights to\nindices with smaller absolute values and lower weights to larger values,\neffectively preserving the most significant contributions to the signal while\npromoting sparsity. We present models for both noise-free and noisy scenarios,\nand rigorously prove the existence of solutions for each case. To solve these\nmodels, we adopt a linearization approach inspired by the difference of convex\nfunctions algorithm. Our experimental results demonstrate the superiority of\nour method over state-of-the-art approaches in sparse signal recovery across\nvarious circumstances, particularly in support detection.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:28:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Chao",""],["Yan","Ming",""],["Yu","Junjie",""]]}
{"id":"2308.04126","submitter":"Dongyang Yu","authors":"Dongyang Yu and Shihao Wang and Yuan Fang and Wangpeng An","title":"OmniDataComposer: A Unified Data Structure for Multimodal Data Fusion\n  and Infinite Data Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.MM cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents OmniDataComposer, an innovative approach for multimodal\ndata fusion and unlimited data generation with an intent to refine and\nuncomplicate interplay among diverse data modalities. Coming to the core\nbreakthrough, it introduces a cohesive data structure proficient in processing\nand merging multimodal data inputs, which include video, audio, and text.\n  Our crafted algorithm leverages advancements across multiple operations such\nas video/image caption extraction, dense caption extraction, Automatic Speech\nRecognition (ASR), Optical Character Recognition (OCR), Recognize Anything\nModel(RAM), and object tracking. OmniDataComposer is capable of identifying\nover 6400 categories of objects, substantially broadening the spectrum of\nvisual information. It amalgamates these diverse modalities, promoting\nreciprocal enhancement among modalities and facilitating cross-modal data\ncorrection. \\textbf{The final output metamorphoses each video input into an\nelaborate sequential document}, virtually transmuting videos into thorough\nnarratives, making them easier to be processed by large language models.\n  Future prospects include optimizing datasets for each modality to encourage\nunlimited data generation. This robust base will offer priceless insights to\nmodels like ChatGPT, enabling them to create higher quality datasets for video\ncaptioning and easing question-answering tasks based on video content.\nOmniDataComposer inaugurates a new stage in multimodal learning, imparting\nenormous potential for augmenting AI's understanding and generation of complex,\nreal-world data.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:30:16 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 09:25:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yu","Dongyang",""],["Wang","Shihao",""],["Fang","Yuan",""],["An","Wangpeng",""]]}
{"id":"2308.04127","submitter":"Tinghua Li","authors":"Tinghua Li and Bayu Jayawardhana","title":"Flexible Distributed Flocking Control for Multi-agent Unicycle Systems","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Currently, the general aim of flocking and formation control laws for\nmulti-agent systems is to form and maintain a rigid configuration, such as, the\nalpha-lattices in flocking control methods, where the desired distance between\neach pair of connected agents is fixed. This introduces a scalability issue for\nlarge-scale deployment of agents due to unrealizable geometrical constraints\nand the constant need of centralized orchestrator to ensure the formation graph\nrigidity. This paper presents a flexible distributed flocking cohesion\nalgorithm for nonholonomic multi-agent systems. The desired geometry\nconfiguration between each pair of agents is adaptive and flexible. The\ndistributed flocking goal is achieved using limited information exchange (i.e.,\nthe local field gradient) between connected neighbor agents and it does not\nrely on any other motion variables measurements, such as (relative) position,\nvelocity, or acceleration. Additionally, the flexible flocking scheme with\nsafety is considered so that the agents with limited sensing capability are\nable to maintain the connectedness of communication topology at all time and\navoid inter-agent collisions. The stability analysis of the proposed methods is\npresented along with numerical simulation results to show their effectiveness.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:32:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Tinghua",""],["Jayawardhana","Bayu",""]]}
{"id":"2308.04128","submitter":"Seokjin Bae","authors":"Yuqing Xing, Seokjin Bae, Ethan Ritz, Fan Yang, Turan Birol, Andrea N.\n  Capa Salinas, Brenden R. Ortiz, Stephen D. Wilson, Ziqiang Wang, Rafael M.\n  Fernandes, Vidya Madhavan","title":"Optical Manipulation of the Charge Density Wave state in RbV3Sb5","comments":"main text: 20 pages, 4 figures // Methods and Extended Data: 16\n  pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Broken time-reversal symmetry in the absence of spin order indicates the\npresence of unusual phases such as orbital magnetism and loop currents. The\nrecently discovered family of kagome superconductors AV$_3$Sb$_5$ (A = K, Rb,\nor Cs), hosting an exotic charge-density wave (CDW) state, has emerged as a\nstrong candidate for this phase. While initial experiments suggested that the\nCDW phase breaks time-reversal symmetry, this idea is being intensely debated\ndue to conflicting experimental data. In this work we use laser-coupled\nscanning tunneling microscopy (STM) to study RbV$_3$Sb$_5$. STM data shows that\nthe Fourier intensities of all three CDW peaks are different, implying that the\nCDW breaks rotational and mirror symmetries. By applying linearly polarized\nlight along high-symmetry directions, we show that the relative intensities of\nthe CDW peaks can be reversibly switched, implying a substantial\nelectro-striction response, indicative of strong non-linear electron-phonon\ncoupling. A similar CDW intensity switching is observed with perpendicular\nmagnetic fields, which implies an unusual piezo-magnetic response that, in\nturn, requires time-reversal symmetry-breaking. We show that the simplest CDW\nthat satisfies these constraints and reconciles previous seemingly\ncontradictory experimental data is an out-of-phase combination of bond charge\norder and loop currents that we dub congruent CDW flux phase. Our laser-STM\ndata opens the door to the possibility of dynamic optical control of complex\nquantum phenomenon in correlated materials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:32:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xing","Yuqing",""],["Bae","Seokjin",""],["Ritz","Ethan",""],["Yang","Fan",""],["Birol","Turan",""],["Salinas","Andrea N. Capa",""],["Ortiz","Brenden R.",""],["Wilson","Stephen D.",""],["Wang","Ziqiang",""],["Fernandes","Rafael M.",""],["Madhavan","Vidya",""]]}
{"id":"2308.04129","submitter":"Jelle Will","authors":"Martin P. A. Assen, Jelle B. Will, Chong Shen Ng, Detlef Lohse,\n  Roberto Verzicco, Dominik Krug","title":"Rising and settling 2D cylinders with centre-of-mass offset","comments":"32 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rotational effects are commonly neglected when considering the dynamics of\nfreely rising or settling isotropic particles. Here, we demonstrate that\nparticle rotations play an important role for rising as well as for settling\ncylinders in situations when mass eccentricity, and thereby a new pendulum\ntimescale, is introduced to the system. We employ two-dimensional simulations\nto study the motion of a single cylinder in a quiescent unbounded\nincompressible Newtonian fluid. This allows us to vary the Galileo number,\ndensity ratio, relative moment of inertia, and Centre-Of-Mass offset (COM)\nsystematically and beyond what is feasible experimentally. For certain buoyant\ndensity ratios, the particle dynamics exhibit a resonance mode, during which\nthe coupling via the Magnus lift force causes a positive feedback between\ntranslational and rotational motions. This mode results in vastly different\ntrajectories with significantly larger rotational and translational amplitudes\nand an increase of the drag coefficient easily exceeding a factor two. We\npropose a simple model that captures how the occurrence of the COM offset\ninduced resonance regime varies, depending on the other input parameters,\nspecifically the density ratio, the Galileo number, and the relative moment of\ninertia. Remarkably, depending on the input parameters, resonance can be\nobserved for centre-of-mass offsets as small as a few percent of the particle\ndiameter, showing that the particle dynamics can be highly sensitive to this\nparameter.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:36:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Assen","Martin P. A.",""],["Will","Jelle B.",""],["Ng","Chong Shen",""],["Lohse","Detlef",""],["Verzicco","Roberto",""],["Krug","Dominik",""]]}
{"id":"2308.04130","submitter":"Arianna Mingone","authors":"Claude Martini, Arianna Mingone","title":"Options are also options on options: how to smile with Black-Scholes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We observe that a European Call option with strike $L > K$ can be seen as a\nCall option with strike $L-K$ on a Call option with strike $K$. Under no\narbitrage assumptions, this yields immediately that the prices of the two\ncontracts are the same, in full generality. We study in detail the relative\npricing function which gives the price of the Call on Call option as a function\nof its underlying Call option, and provide quasi-closed formula for those new\npricing functions in the Carr-Pelts-Tehranchi family [Carr and Pelts, Duality,\nDeltas, and Derivatives Pricing, 2015] and [Tehranchi, A Black-Scholes\ninequality: applications and generalisations, Finance Stoch, 2020] that\nincludes the Black-Scholes model as a particular case. We also study the\nproperties of the function that maps the price normalized by the underlier,\nviewed as a function of the moneyness, to the normalized relative price, which\nallows us to produce several new closed formulas. In connection to the symmetry\ntransformation of a smile, we build a lift of the relative pricing function in\nthe case of an underlier that does not vanish. We finally provide some\nproperties of the implied volatility smiles of Calls on Calls and lifted Calls\non Calls in the Black-Scholes model.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:36:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Martini","Claude",""],["Mingone","Arianna",""]]}
{"id":"2308.04131","submitter":"Piotr Arcab","authors":"Piotr Arcab, Mikolaj Rogalski, and Maciej Trusiak","title":"Single-shot experimental-numerical twin-image removal in lensless\n  digital holographic microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lensless digital holographic microscopy (LDHM) offers very large\nfield-of-view label-free imaging crucial, e.g., in high-throughput particle\ntracking and biomedical examination of cells and tissues. Compact layouts\npromote point-of-case and out-of-laboratory applications. The LDHM, based on\nthe Gabor in-line holographic principle, is inherently spoiled by the\ntwin-image effect, which complicates the quantitative analysis of reconstructed\nphase and amplitude maps. Popular family of solutions consists of numerical\nmethods, which tend to minimize twin-image upon iterative process based on data\nredundancy. Additional hologram recordings are needed, and final results\nheavily depend on the algorithmic parameters, however. In this contribution we\npresent a novel single-shot experimental-numerical twin-image removal technique\nfor LDHM. It leverages two-source off-axis hologram recording deploying simple\nfiber splitter. Additionally, we introduce a novel phase retrieval numerical\nalgorithm specifically tailored to the acquired holograms, that provides\ntwin-image-free reconstruction without compromising the resolution. We\nquantitatively and qualitatively verify proposed method employing phase test\ntarget and cheek cells biosample. The results demonstrate that the proposed\ntechnique enables low-cost, out-of-laboratory LDHM imaging with enhanced\nprecision, achieved through the elimination of twin-image errors. This\nadvancement opens new avenues for more accurate technical and biomedical\nimaging applications using LDHM, particularly in scenarios where cost-effective\nand portable imaging solutions are desired.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:40:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Arcab","Piotr",""],["Rogalski","Mikolaj",""],["Trusiak","Maciej",""]]}
{"id":"2308.04132","submitter":"Tianchi Huang","authors":"Tianchi Huang, Rui-Xiao Zhang, Chenglei Wu, Lifeng Sun","title":"Optimizing Adaptive Video Streaming with Human Feedback","comments":"ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quality of Experience~(QoE)-driven adaptive bitrate (ABR) algorithms are\ntypically optimized using QoE models that are based on the mean opinion\nscore~(MOS), while such principles may not account for user heterogeneity on\nrating scales, resulting in unexpected behaviors. In this paper, we propose\nJade, which leverages reinforcement learning with human feedback~(RLHF)\ntechnologies to better align the users' opinion scores. Jade's rank-based QoE\nmodel considers relative values of user ratings to interpret the subjective\nperception of video sessions. We implement linear-based and Deep Neural Network\n(DNN)-based architectures for satisfying both accuracy and generalization\nability. We further propose entropy-aware reinforced mechanisms for training\npolicies with the integration of the proposed QoE models. Experimental results\ndemonstrate that Jade performs favorably on conventional metrics, such as\nquality and stall ratio, and improves QoE by 8.09%-38.13% in different network\nconditions, emphasizing the importance of user heterogeneity in QoE modeling\nand the potential of combining linear-based and DNN-based models for\nperformance improvement.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:43:18 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 17:00:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Huang","Tianchi",""],["Zhang","Rui-Xiao",""],["Wu","Chenglei",""],["Sun","Lifeng",""]]}
{"id":"2308.04133","submitter":"S. Javad Akhtarshenas","authors":"Nayere Saberian, Seyed Javad Akhtarshenas, and Fereshte Shahbeigi","title":"Measurement sharpness and disturbance trade-off","comments":"10 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Obtaining information from a quantum system through a measurement typically\ndisturbs its state. The post-measurement states for a given measurement,\nhowever, are not unique and highly rely on the chosen measurement model,\ncomplicating the puzzle of information-disturbance. Two distinct questions are\nthen in order. Firstly, what is the minimum disturbance a measurement may\ninduce? Secondly, when a fixed disturbance occurs, how informative is the\npossible measurement in the best-case scenario? Here, we propose various\napproaches to tackle these questions and provide explicit solutions for the set\nof unbiased binary qubit measurements and post-measurement state spaces that\nare equivalent to the image of a unital qubit channel. In particular, we show\nthere are different trade-off relations between the sharpness of this\nmeasurement and the average fidelity of the pre-measurement and\npost-measurement state spaces as well as the sharpness and quantum resources\npreserved in the post-measurement states in terms of coherence and discord-like\ncorrelation once the measurement is applied locally.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:43:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Saberian","Nayere",""],["Akhtarshenas","Seyed Javad",""],["Shahbeigi","Fereshte",""]]}
{"id":"2308.04134","submitter":"Subhadeep Gupta","authors":"Tahiyat Rahman, Anna Wirth-Singh, Andrew Ivanov, Daniel Gochnauer,\n  Emmett Hough and Subhadeep Gupta","title":"Bloch Oscillation Phases investigated by Multi-path Stuckelberg Atom\n  Interferometry","comments":"11 pages including supplemental material, 9 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atoms undergoing Bloch oscillations (BOs) in an accelerating optical lattice\nacquire momentum of two photon recoils per BO. This technique provides a large\nmomentum transfer tool for atom optics, but its full exploitation for atom\ninterferometric sensors requires experimental characterization of associated\nphases. Each BO involves a Landau-Zener crossing with multiple crossings\ninducing interference known as Stuckelberg interference. We develop a\nmulti-path Stuckelberg interferometer and investigate atomic phase evolution\nduring BOs, up to 100 photon recoil momentum transfer. We compare to\nnumerically calculated single-particle Schrodinger evolution, demonstrate\nhighly coherent BO sequences, and assess phase stability requirements for\nBO-enhanced precision interferometry in fundamental physics and sensing\napplications.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:48:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rahman","Tahiyat",""],["Wirth-Singh","Anna",""],["Ivanov","Andrew",""],["Gochnauer","Daniel",""],["Hough","Emmett",""],["Gupta","Subhadeep",""]]}
{"id":"2308.04135","submitter":"Emmanouil Raptakis","authors":"Nowar E. Koning, Sergei M. Kuzenko and Emmanouil S. N. Raptakis","title":"Embedding formalism for ${\\mathcal N}$-extended AdS superspace in four\n  dimensions","comments":"49 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":"  The supertwistor and bi-supertwistor formulations for ${\\mathcal N}$-extended\nanti-de Sitter (AdS) superspace in four dimensions, ${\\rm AdS}^{4|4\\mathcal\nN}$, were derived two years ago in arXiv:2108.03907. In the present paper, we\nintroduce a novel realisation of the ${\\mathcal N}$-extended AdS supergroup\n$\\mathsf{OSp}(\\mathcal{N}|4;\\mathbb{R})$ and apply it to develop a coset\nconstruction for ${\\rm AdS}^{4|4\\mathcal N}$ and the corresponding differential\ngeometry. This realisation naturally leads to an atlas on ${\\rm\nAdS}^{4|4\\mathcal N}$ (that is a generalisation of the stereographic projection\nfor a sphere) that consists of two charts with chiral transition functions for\n${\\mathcal N}>0$. A manifestly $\\mathsf{OSp}(\\mathcal{N}|4;\\mathbb{R})$\ninvariant model for a superparticle in ${\\rm AdS}^{4|4\\mathcal N}$ is proposed.\nAdditionally, by employing a conformal superspace approach, we describe the\nmost general conformally flat $\\mathcal N$-extended supergeometry. This\nconstruction is then specialised to the case of ${\\rm AdS}^{4|4\\mathcal N}$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:48:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Koning","Nowar E.",""],["Kuzenko","Sergei M.",""],["Raptakis","Emmanouil S. N.",""]]}
{"id":"2308.04136","submitter":"Xianing Feng","authors":"X. N. Feng, M. Zhang, and L. F. Wei","title":"Sub-SQL electronic field sensing by simultaneously using quantum\n  entanglements and squeezings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum entanglement and quantum squeezing are two most typical approaches to\nbeat the standard quantum limit (SQL) of the sensitive phase estimations in\nquantum metrology. Each of them has already been utilized individually to\nimprove the sensitivity of electric field sensing with the trapped ion\nplatform, but the upper bound of the demonstrated sensitivity gain is very\nlimited, i.e., the experimental 3dB and theoretical 6dB, over the SQL. Here, by\nsimultaneously using the internal (spin)-external (oscillator) state\nentanglements and the oscillator squeezings to effectively amplify the\naccumulation phase, we show that these sensitivity gains can be effectively\nsurpassed. Hopefully, the proposal provides a novel approach to the stronger\nbeaten of the SQL for the sensitive sensings of the desired electric field and\nalso the other metrologies.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:50:12 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 13:47:43 GMT"},{"version":"v3","created":"Sun, 13 Aug 2023 18:39:23 GMT"},{"version":"v4","created":"Fri, 25 Aug 2023 07:44:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Feng","X. N.",""],["Zhang","M.",""],["Wei","L. F.",""]]}
{"id":"2308.04137","submitter":"Michael Spratling","authors":"Michael W. Spratling","title":"Comprehensive Assessment of the Performance of Deep Learning Classifiers\n  Reveals a Surprising Lack of Robustness","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":"  Reliable and robust evaluation methods are a necessary first step towards\ndeveloping machine learning models that are themselves robust and reliable.\nUnfortunately, current evaluation protocols typically used to assess\nclassifiers fail to comprehensively evaluate performance as they tend to rely\non limited types of test data, and ignore others. For example, using the\nstandard test data fails to evaluate the predictions made by the classifier to\nsamples from classes it was not trained on. On the other hand, testing with\ndata containing samples from unknown classes fails to evaluate how well the\nclassifier can predict the labels for known classes. This article advocates\nbench-marking performance using a wide range of different types of data and\nusing a single metric that can be applied to all such data types to produce a\nconsistent evaluation of performance. Using such a benchmark it is found that\ncurrent deep neural networks, including those trained with methods that are\nbelieved to produce state-of-the-art robustness, are extremely vulnerable to\nmaking mistakes on certain types of data. This means that such models will be\nunreliable in real-world scenarios where they may encounter data from many\ndifferent domains, and that they are insecure as they can easily be fooled into\nmaking the wrong decisions. It is hoped that these results will motivate the\nwider adoption of more comprehensive testing methods that will, in turn, lead\nto the development of more robust machine learning methods in the future.\n  Code is available at:\n\\url{https://codeberg.org/mwspratling/RobustnessEvaluation}\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:50:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Spratling","Michael W.",""]]}
{"id":"2308.04138","submitter":"Dietrich Trautmann","authors":"Dietrich Trautmann","title":"Large Language Model Prompt Chaining for Long Legal Document\n  Classification","comments":"SwissText 2023 Late Breaking Work (Generative AI & LLM)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Prompting is used to guide or steer a language model in generating an\nappropriate response that is consistent with the desired outcome. Chaining is a\nstrategy used to decompose complex tasks into smaller, manageable components.\nIn this study, we utilize prompt chaining for extensive legal document\nclassification tasks, which present difficulties due to their intricate\ndomain-specific language and considerable length. Our approach begins with the\ncreation of a concise summary of the original document, followed by a semantic\nsearch for related exemplar texts and their corresponding annotations from a\ntraining corpus. Finally, we prompt for a label - based on the task - to\nassign, by leveraging the in-context learning from the few-shot prompt. We\ndemonstrate that through prompt chaining, we can not only enhance the\nperformance over zero-shot, but also surpass the micro-F1 score achieved by\nlarger models, such as ChatGPT zero-shot, using smaller models.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:57:01 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Trautmann","Dietrich",""]]}
{"id":"2308.04139","submitter":"Katharina Franke","authors":"Sergey Trishin, Christian Lotze, Nils Krane, Katharina J. Franke","title":"Electronic and magnetic properties of single chalcogen vacancies in\n  MoS$_2$/Au(111)","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":"  Two-dimensional (2D) transition-metal dichalcogenides (TMDC) are considered\nhighly promising platforms for next-generation optoelectronic devices. Owing to\nits atomically thin structure, device performance is strongly impacted by a\nminute amount of defects. Although defects are usually considered to be\ndisturbing, defect engineering has become an important strategy to control and\ndesign new properties of 2D materials. Here, we produce single S vacancies in a\nmonolayer of MoS$_2$ on Au(111). Using a combination of scanning tunneling and\natomic force microscopy, we show that these defects are negatively charged and\ngive rise to a Kondo resonance, revealing the presence of an unpaired electron\nspin exchange coupled to the metal substrate. The strength of the exchange\ncoupling depends on the density of states at the Fermi level, which is\nmodulated by the moir\\'e structure of the MoS$_2$ lattice and the Au(111)\nsubstrate. In the absence of direct hybridization of MoS$_2$ with the metal\nsubstrate, the S vacancy remains charge-neutral. Our results suggest that\ndefect engineering may be used to induce and tune magnetic properties of\notherwise non-magnetic materials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:57:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Trishin","Sergey",""],["Lotze","Christian",""],["Krane","Nils",""],["Franke","Katharina J.",""]]}
{"id":"2308.04140","submitter":"Jens Finkh\\\"auser","authors":"Jens Finkh\\\"auser","title":"Capabilities for Distributed Authorization in Information-Centric\n  Networking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CR cs.NI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Authorization currently introduces partial centralization in otherwise\ndistributed network architectures, such as ICN approaches. Analyzing existing\nwork in (partially) distributed authentication and authorization, and\nrearranging proven methods, this paper introduces a generalized, capability\nbased and fully distributed authorization scheme. It argues that such a scheme\ncan fit neatly into ICN architectures in order to enhance the trust model and\nmitigate against certain classes of denial-of-service attacks. Keywords:\nauthorization, distributed systems security, ICN\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:58:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Finkh\u00e4user","Jens",""]]}
{"id":"2308.04141","submitter":"Christoph Borschensky","authors":"Mayumi Aoki, Lisa Biermann, Christoph Borschensky, Igor P. Ivanov,\n  Margarete M\\\"uhlleitner, Hiroto Shibuya","title":"Intermediate Charge-Breaking Phases and Symmetry Non-Restoration in the\n  2-Higgs-Doublet Model","comments":"38 pages, 7 figures, 3 tables","journal-ref":null,"doi":null,"report-no":"KANAZAWA-23-08, KA-TP-16-2023","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Higgs potentials of extended Higgs sectors exhibit a complex and\ninteresting vacuum structure. When travelling back in time, i.e. going to\nhigher temperatures, the structure may change and exhibit interesting phase\npatterns and sequences of phases related to the respective minima of the\npotential. The investigation of the vacuum structure can give us indirect\ninsights in beyond-Standard-Model physics and the evolution of the Universe. In\nthis paper, we investigate the possibility of an intermediate charge-breaking\n(CB) phase in the 2-Higgs-Doublet Model (2HDM) type I. The existence has been\nreported previously by using a simple potential setup. We here confirm that the\nintermediate CB phase can still exist when using the one-loop corrected\neffective potential including thermal masses. We discuss its features and the\nrelation with SU(2) symmetry (non-)restoration as well as its consistency with\nthe current experimental data. Lastly, we show for some selected benchmark\npoints the rich and interesting phase patterns and sequences that the 2HDM can\nundergo during its evolution from the early Universe to today's electroweak\nvacuum.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:01:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aoki","Mayumi",""],["Biermann","Lisa",""],["Borschensky","Christoph",""],["Ivanov","Igor P.",""],["M\u00fchlleitner","Margarete",""],["Shibuya","Hiroto",""]]}
{"id":"2308.04142","submitter":"Zitan Chen","authors":"Zitan Chen, Zhuang Qi, Xiao Cao, Xiangxian Li, Xiangxu Meng, Lei Meng","title":"Class-level Structural Relation Modelling and Smoothing for Visual\n  Representation Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Representation learning for images has been advanced by recent progress in\nmore complex neural models such as the Vision Transformers and new learning\ntheories such as the structural causal models. However, these models mainly\nrely on the classification loss to implicitly regularize the class-level data\ndistributions, and they may face difficulties when handling classes with\ndiverse visual patterns. We argue that the incorporation of the structural\ninformation between data samples may improve this situation. To achieve this\ngoal, this paper presents a framework termed \\textbf{C}lass-level Structural\nRelation Modeling and Smoothing for Visual Representation Learning (CSRMS),\nwhich includes the Class-level Relation Modelling, Class-aware Graph Sampling,\nand Relational Graph-Guided Representation Learning modules to model a\nrelational graph of the entire dataset and perform class-aware smoothing and\nregularization operations to alleviate the issue of intra-class visual\ndiversity and inter-class similarity. Specifically, the Class-level Relation\nModelling module uses a clustering algorithm to learn the data distributions in\nthe feature space and identify three types of class-level sample relations for\nthe training set; Class-aware Graph Sampling module extends typical training\nbatch construction process with three strategies to sample dataset-level\nsub-graphs; and Relational Graph-Guided Representation Learning module employs\na graph convolution network with knowledge-guided smoothing operations to ease\nthe projection from different visual patterns to the same class. Experiments\ndemonstrate the effectiveness of structured knowledge modelling for enhanced\nrepresentation learning and show that CSRMS can be incorporated with any\nstate-of-the-art visual representation learning models for performance gains.\nThe source codes and demos have been released at\nhttps://github.com/czt117/CSRMS.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:03:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Zitan",""],["Qi","Zhuang",""],["Cao","Xiao",""],["Li","Xiangxian",""],["Meng","Xiangxu",""],["Meng","Lei",""]]}
{"id":"2308.04143","submitter":"Viktor Gerasimenko I","authors":"V.I. Gerasimenko, I.V. Gapyak","title":"Advances in theory of evolution equations of many colliding particles","comments":"67 pages. arXiv admin note: text overlap with arXiv:2111.13940,\n  arXiv:2307.02121, arXiv:2001.06786, arXiv:2012.03001","journal-ref":"In: Modern Problems of Mathematics and its Applications. III.\n  (Eds. V.I. Gerasimenko et al.), Kyiv: IM, 2023, 729-804. ISSN: 1815-2910. The\n  book is dedicated to the 160th anniversary of the birth of academician D. O.\n  Grave","doi":"10.3842/trim.v20n1.528","report-no":null,"categories":"math-ph cond-mat.stat-mech math.AP math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The review presents rigorous results of the theory of fundamental equations\nof evolution of many-particle systems with collisions and also considers their\nconnection with nonlinear kinetic equations describing the collective behavior\nof particles in scaling approximations.\n  This work is dedicated to the 160th anniversary of the birth of Dmytro\nOleksandrovych Grave, the first academician of the Ukraine Academy of Sciences\nin mathematics and the founder of the Institute of Mathematics in 1920.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:05:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gerasimenko","V. I.",""],["Gapyak","I. V.",""]]}
{"id":"2308.04144","submitter":"Hepeng Yao","authors":"Yanliang Guo, Hepeng Yao, Sudipta Dhar, Lorenzo Pizzino, Milena\n  Horvath, Thierry Giamarchi, Manuele Landini, Hanns-Christoph N\\\"agerl","title":"Cooling bosons by dimensional reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cold atomic gases provide a remarkable testbed to study the physics of\ninteracting many-body quantum systems. They have started to play a major role\nas quantum simulators, given the high degree of control that is possible. A\ncrucial element is given by the necessarily non-zero temperature. However\ncooling to the required ultralow temperatures or even simply measuring the\ntemperature directly on the system can prove to be very challenging tasks.\nHere, we implement thermometry on strongly interacting two- and one-dimensional\nBose gases with high sensitivity in the nano-Kelvin temperature range. Our\nmethod is aided by the fact that the decay of the first-order correlation\nfunction is very sensitive to the temperature when interactions are strong. We\nfind that there may be a significant temperature variation when the\nthree-dimensional quantum gas is cut into two-dimensional slices or into\none-dimensional tubes. Strikingly, the temperature for the one-dimensional case\ncan be much lower than the initial temperature. Our findings show that this\ndecrease results from the interplay of dimensional reduction and strong\ninteractions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:05:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Guo","Yanliang",""],["Yao","Hepeng",""],["Dhar","Sudipta",""],["Pizzino","Lorenzo",""],["Horvath","Milena",""],["Giamarchi","Thierry",""],["Landini","Manuele",""],["N\u00e4gerl","Hanns-Christoph",""]]}
{"id":"2308.04145","submitter":"Konrad Jerzy Kapcia","authors":"Konrad Jerzy Kapcia and Jan Bara\\'nski","title":"Magnetic and charge orders on the triangular lattice: Extended Hubbard\n  model with intersite Ising-like magnetic interactions in the atomic limit","comments":"7 pages, 4 figures (13 panels)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.other cond-mat.quant-gas cond-mat.str-el physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the work, we investigated a generalized model of the fermionic lattice gas\nin the form of the extended Hubbard model with intersite Ising-like\ninteractions (both antiferromagnetic and ferromagnetic) at the atomic limit on\nthe triangular lattice. In the ground state, we find the exact phase diagram as\na function of $\\mu$. Within the mean-field decoupling of the intersite term and\nexact treatment of onsite interaction, we found also the diagrams for $T\\geq 0$\nincluding metastable phases. For antiferromagnetic coupling, we find that\nnontrival ordered phase can exist with coexistence of charge and metamagnetic\nordering. The transition between the ordered phase and the nonordered phase can\nbe discontinuous as well continuous depending on the model parameters.\nMoreover, the ordered phase can coexist with the nonordered phase in phase\nseparated states for fixed electron concentration. Additionally, the ranges of\nphases metastability are determined in the neighborhood of the discontinuous\ntransitions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:21:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kapcia","Konrad Jerzy",""],["Bara\u0144ski","Jan",""]]}
{"id":"2308.04146","submitter":"Michele Nicola Notarnicola","authors":"Michele N. Notarnicola and Stefano Olivares","title":"Beating the standard quantum limit for binary phase-shift-keying\n  discrimination with a hybrid feed-forward receiver","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":"  We propose a hybrid feed-forward receiver (HFFRE) for the discrimination of\nbinary phase-shift-keyed coherent states based on the appropriate combination\nof the displacement feed-forward receiver (DFFRE) and a homodyne-like setup\nemploying a low-intensity local oscillator and photon-number-resolving\ndetectors. We investigate the performance of the proposed scheme addressing\nalso realistic scenarios in the presence of non-unit quantum detection\nefficiency, dark counts and a visibility reduction. The present HFFRE\noutperforms the DFFRE in all conditions, beating the standard quantum limit in\nparticular regimes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:25:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Notarnicola","Michele N.",""],["Olivares","Stefano",""]]}
{"id":"2308.04147","submitter":"Lihe Wang","authors":"Lihe Wang","title":"Partial Regularity of Navier-Stokes Equations","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove, with a more geometric approach, that the solutions to the\nNavier-Stokes equations are regular up to a set of Hausdorff dimension 1. The\nmain tool for the proof is a new compactness lemma and the monotonicity\nproperty of harmonic functions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:26:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Lihe",""]]}
{"id":"2308.04148","submitter":"Juan Ruben Gomez-Solano","authors":"Farshad Darabi, Brandon R. Ferrer, and Juan Ruben Gomez-Solano","title":"Stochastic energetics of a colloidal particle trapped in a viscoelastic\n  bath","comments":"3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the statistics of the fluctuations of the energy transfer\nbetween an overdamped Brownian particle, whose motion is confined by a\nstationary harmonic potential, and a surrounding viscoelastic fluid at constant\ntemperature. We derive an analytical expression for the probability density\nfunction of the energy exchanged with the fluid over a finite time interval,\nwhich implicitly involves the friction memory kernel that encodes the coupling\nwith such a non-Markovian environment, and reduces to the well known expression\nfor the heat distribution in a viscous fluid. We show that, while the odd\nmoments of this distribution are zero, the even moments can be explicitly\nexpressed in terms of the auto-correlation function of the particle position,\nwhich generally exhibits a non-mono-exponential decay when the fluid bath is\nviscoelastic. Our results are verified by experimental measurements for an\noptically-trapped colloidal bead in semidilute micellar and polymer solutions,\nfinding and excellent agreement for all time intervals over which the energy\nexchange takes place.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:26:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Darabi","Farshad",""],["Ferrer","Brandon R.",""],["Gomez-Solano","Juan Ruben",""]]}
{"id":"2308.04149","submitter":"Hiroaki Sukegawa","authors":"Jieyuan Song, Thomas Scheike, Cong He, Zhenchao Wen, Tadakatsu Ohkubo,\n  Kazuhiro Hono, Hiroaki Sukegawa, and Seiji Mitani","title":"Fully epitaxial fcc(111) magnetic tunnel junctions with a\n  Co90Fe10/MgAlO/Co90Fe10 structure","comments":"18 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":"  Magnetic tunnel junctions (MTJs) with bcc(001)-type structures such as\nFe(001)/MgO(001)/Fe(001), have been widely used as the core of various\nspintronic devices such as magnetoresistive memories; however, the limited\nmaterial selection of (001)-type MTJs hinders the further development of\nspintronic devices. Here, as an alternative to the (001)-type MTJs, an\nfcc(111)-type MTJ using a fully epitaxial CoFe/rock-salt MgAlO (MAO)/CoFe is\nexplored to introduce close-packed lattice systems into MTJs. Using an\natomically flat Ru(0001) epitaxial buffer layer, fcc(111) epitaxial growth of\nthe CoFe/MAO/CoFe trilayer is achieved. Sharp CoFe(111)/MAO(111) interfaces are\nconfirmed due to the introduction of periodic dislocations by forming a 5:6\nin-plane lattice matching structure. The fabricated (111) MTJ exhibits a tunnel\nmagnetoresistance ratio of 37% at room temperature (47% at 10 K). Symmetric\ndifferential conductance curves with respect to bias polarity are observed,\nindicating the achievement of nearly identical upper and lower MAO interface\nqualities. Despite the charge-uncompensated (111) orientation for a\nrock-salt-like MAO barrier, the achievement of flat, stable, and spin-polarized\nbarrier interfaces opens a promising avenue for expanding the design of MTJ\nstructures.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:27:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Song","Jieyuan",""],["Scheike","Thomas",""],["He","Cong",""],["Wen","Zhenchao",""],["Ohkubo","Tadakatsu",""],["Hono","Kazuhiro",""],["Sukegawa","Hiroaki",""],["Mitani","Seiji",""]]}
{"id":"2308.04150","submitter":"Anna Sterzik","authors":"Anna Sterzik, Nils Lichtenberg, Jana Wilms, Michael Krone, Douglas W.\n  Cunningham, Kai Lawonn","title":"Perception of Line Attributes for Visualization","comments":"11 pages, 9 figures, to be published in IEEE Transactions on\n  Visualization and Computer Graphics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Line attributes such as width and dashing are commonly used to encode\ninformation. However, many questions on the perception of line attributes\nremain, such as how many levels of attribute variation can be distinguished or\nwhich line attributes are the preferred choices for which tasks. We conducted\nthree studies to develop guidelines for using stylized lines to encode scalar\ndata. In our first study, participants drew stylized lines to encode\nuncertainty information. Uncertainty is usually visualized alongside other\ndata. Therefore, alternative visual channels are important for the\nvisualization of uncertainty. Additionally, uncertainty -- e.g., in weather\nforecasts -- is a familiar topic to most people. Thus, we picked it for our\nvisualization scenarios in study 1. We used the results of our study to\ndetermine the most common line attributes for drawing uncertainty: Dashing,\nluminance, wave amplitude, and width. While those line attributes were\nespecially common for drawing uncertainty, they are also commonly used in other\nareas. In studies 2 and 3, we investigated the discriminability of the line\nattributes determined in study 1. Studies 2 and 3 did not require specific\napplication areas; thus, their results apply to visualizing any scalar data in\nline attributes. We evaluated the just-noticeable differences (JND) and derived\nrecommendations for perceptually distinct line levels. We found that\nparticipants could discriminate considerably more levels for the line attribute\nwidth than for wave amplitude, dashing, or luminance.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:27:58 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:24:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sterzik","Anna",""],["Lichtenberg","Nils",""],["Wilms","Jana",""],["Krone","Michael",""],["Cunningham","Douglas W.",""],["Lawonn","Kai",""]]}
{"id":"2308.04151","submitter":"Lorenzo Querol","authors":"Lorenzo S. Querol, Macario O. Cordel II, Dan Jeric A. Rustia, Mary Nia\n  M. Santos","title":"Application for White Spot Syndrome Virus (WSSV) Monitoring using Edge\n  Machine Learning","comments":"6 pages, 7 figures, conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aquaculture industry, strongly reliant on shrimp exports, faces\nchallenges due to viral infections like the White Spot Syndrome Virus (WSSV)\nthat severely impact output yields. In this context, computer vision can play a\nsignificant role in identifying features not immediately evident to skilled or\nuntrained eyes, potentially reducing the time required to report WSSV\ninfections. In this study, the challenge of limited data for WSSV recognition\nwas addressed. A mobile application dedicated to data collection and monitoring\nwas developed to facilitate the creation of an image dataset to train a WSSV\nrecognition model and improve country-wide disease surveillance. The study also\nincludes a thorough analysis of WSSV recognition to address the challenge of\nimbalanced learning and on-device inference. The models explored,\nMobileNetV3-Small and EfficientNetV2-B0, gained an F1-Score of 0.72 and 0.99\nrespectively. The saliency heatmaps of both models were also observed to\nuncover the \"black-box\" nature of these models and to gain insight as to what\nfeatures in the images are most important in making a prediction. These results\nhighlight the effectiveness and limitations of using models designed for\nresource-constrained devices and balancing their performance in accurately\nrecognizing WSSV, providing valuable information and direction in the use of\ncomputer vision in this domain.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:32:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Querol","Lorenzo S.",""],["Cordel","Macario O.","II"],["Rustia","Dan Jeric A.",""],["Santos","Mary Nia M.",""]]}
{"id":"2308.04152","submitter":"Juncheng Li","authors":"Juncheng Li, Kaihang Pan, Zhiqi Ge, Minghe Gao, Hanwang Zhang, Wei Ji,\n  Wenqiao Zhang, Tat-Seng Chua, Siliang Tang, Yueting Zhuang","title":"Empowering Vision-Language Models to Follow Interleaved Vision-Language\n  Instructions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal Large Language Models (MLLMs) have recently sparked significant\ninterest, which demonstrates emergent capabilities to serve as a\ngeneral-purpose model for various vision-language tasks. However, existing\nmethods mainly focus on limited types of instructions with a single image as\nvisual context, which hinders the widespread availability of MLLMs. In this\npaper, we introduce the I4 benchmark to comprehensively evaluate the\ninstruction following ability on complicated interleaved vision-language\ninstructions, which involve intricate image-text sequential context, covering a\ndiverse range of scenarios (e.g., visually-rich webpages/textbooks, lecture\nslides, embodied dialogue). Systematic evaluation on our I4 benchmark reveals a\ncommon defect of existing methods: the Visual Prompt Generator (VPG) trained on\nimage-captioning alignment objective tends to attend to common foreground\ninformation for captioning but struggles to extract specific information\nrequired by particular tasks. To address this issue, we propose a generic and\nlightweight controllable knowledge re-injection module, which utilizes the\nsophisticated reasoning ability of LLMs to control the VPG to conditionally\nextract instruction-specific visual information and re-inject it into the LLM.\nFurther, we introduce an annotation-free cross-attention guided counterfactual\nimage training strategy to methodically learn the proposed module by\ncollaborating a cascade of foundation models. Enhanced by the proposed module\nand training strategy, we present Cheetor, a Transformer-based MLLM that can\neffectively handle a wide variety of interleaved vision-language instructions\nand achieves state-of-the-art zero-shot performance across all tasks of I4,\nwithout high-quality multimodal instruction tuning data. Cheetor also exhibits\ncompetitive performance compared with state-of-the-art instruction tuned models\non MME benchmark.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:32:43 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 07:02:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Juncheng",""],["Pan","Kaihang",""],["Ge","Zhiqi",""],["Gao","Minghe",""],["Zhang","Hanwang",""],["Ji","Wei",""],["Zhang","Wenqiao",""],["Chua","Tat-Seng",""],["Tang","Siliang",""],["Zhuang","Yueting",""]]}
{"id":"2308.04153","submitter":"Sergei Yurchenko N","authors":"Oliver Pearce, Sergei N. Yurchenko and Jonathan Tennyson","title":"ExoMol line lists -- LII. Line Lists for the Methylidyne Cation (CH+)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Comprehensive and accurate rovibronic line lists for the X $^{1}\\Sigma^{+}$\nand A $^{1}\\Pi$ states of $^{12}$C$^{1}$H$^{+}$ and $^{13}$C$^{1}$H$^{+}$ which\nshould be applicable up to temperatures of 5000 K are presented. Available\nempirical potential energy curves and high-level ab initio dipole and\ntransition dipole moment curves are used with the program LEVEL to compute\nrovibronic energy levels and Einstein $A$ coefficients. $\\Lambda$-doubling is\nincorporated into the energy levels and $A$-coefficients involving the A\n$^{1}\\Pi$ state using an empirical method. For $^{12}$C$^{1}$H$^{+}$, line\npositions are improved by using both laboratory and astronomical observational\nspectra as input to the MARVEL procedure. The $^{12}$C$^{1}$H$^{+}$ line list\ncontains 1505 states and 34194 transitions over the frequency range of 0 -\n33010 cm$^{-1}$ ($\\lambda > 300$ nm). Comparisons with observed astronomical\nand laboratory spectra give very good agreement. The PYT CH$^{+}$ line lists\nand partition functions are available from the ExoMol database at\nwww.exomol.com.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:34:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pearce","Oliver",""],["Yurchenko","Sergei N.",""],["Tennyson","Jonathan",""]]}
{"id":"2308.04154","submitter":"Andrea Serafini","authors":"LiquidO Consortium: A. Cabrera, M. Chen, F. Mantovani, A. Serafini, V.\n  Strati, J. Apilluelo, L. Asquith, J.L. Beney, T.J.C. Bezerra, M. Bongrand, C.\n  Bourgeois, D. Breton, M. Briere, J. Busto, A. Cadiou, E. Calvo, V. Chaumat,\n  E. Chauveau, B.J. Cattermole, P. Chimenti, C. Delafosse, H. de Kerret, S.\n  Dusini, A. Earle, C. Frigerio-Martins, J. Gal\\'an, J. A. Garc\\'ia, R.\n  Gazzini, A. Gibson-Foster, A. Gallas, C. Girard-Carillo, W.C. Griffith, F.\n  Haddad, J. Hartnell, A. Hourlier, G. Hull, I. G. Irastorza, L. Koch, P.\n  Lani\\'ece, J.F. Le Du, C. Lefebvre, F. Lefevre, F. Legrand, P. Loaiza, J. A.\n  Lock, G. Luz\\'on, J. Maalmi, C. Marquet, M. Mart\\'inez, B. Mathon, L.\n  M\\'enard, D. Navas-Nicol\\'as, H. Nunokawa, J.P. Ochoa-Ricoux, M. Obolensky,\n  C. Palomares, P. Pillot, J.C.C. Porter, M.S. Pravikoff, H. Ramarijaona, M.\n  Roche, P. Rosier, B. Roskovec, M.L. Sarsa, S. Schoppmann, W. Shorrock, L.\n  Simard, H.Th.J. Steiger, D. Stocco, J.S. Stutzmann, F. Suekane, A. Tunc,\n  M.-A. Verdier, A. Verdugo, B. Viaud, S. M. Wakely, A. Weber and F. Yermia","title":"Probing Earth's Missing Potassium using the Unique Antimatter Signature\n  of Geoneutrinos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph hep-ex physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The formation of the Earth remains an epoch with mysterious puzzles extending\nto our still incomplete understanding of the planet's potential origin and bulk\ncomposition. Direct confirmation of the Earth's internal heat engine was\naccomplished by the successful observation of geoneutrinos originating from\nuranium (U) and thorium (Th) progenies, manifestations of the planet's natural\nradioactivity dominated by potassium (40K) and the decay chains of uranium\n(238U) and thorium (232Th). This radiogenic energy output is critical to\nplanetary dynamics and must be accurately measured for a complete understanding\nof the overall heat budget and thermal history of the Earth. Detecting\ngeoneutrinos remains the only direct probe to do so and constitutes a\nchallenging objective in modern neutrino physics. In particular, the intriguing\npotassium geoneutrinos have never been observed and thus far have been\nconsidered impractical to measure. We propose here a novel approach for\npotassium geoneutrino detection using the unique antimatter signature of\nantineutrinos to reduce the otherwise overwhelming backgrounds to observing\nthis rarest signal. The proposed detection framework relies on the innovative\nLiquidO detection technique to enable positron (e+) identification and\nantineutrino interactions with ideal isotope targets identified here for the\nfirst time. We also provide the complete experimental methodology to yield the\nfirst potassium geoneutrino discovery.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:35:27 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 14:58:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Consortium","LiquidO",""],[":","",""],["Cabrera","A.",""],["Chen","M.",""],["Mantovani","F.",""],["Serafini","A.",""],["Strati","V.",""],["Apilluelo","J.",""],["Asquith","L.",""],["Beney","J. L.",""],["Bezerra","T. J. C.",""],["Bongrand","M.",""],["Bourgeois","C.",""],["Breton","D.",""],["Briere","M.",""],["Busto","J.",""],["Cadiou","A.",""],["Calvo","E.",""],["Chaumat","V.",""],["Chauveau","E.",""],["Cattermole","B. J.",""],["Chimenti","P.",""],["Delafosse","C.",""],["de Kerret","H.",""],["Dusini","S.",""],["Earle","A.",""],["Frigerio-Martins","C.",""],["Gal\u00e1n","J.",""],["Garc\u00eda","J. A.",""],["Gazzini","R.",""],["Gibson-Foster","A.",""],["Gallas","A.",""],["Girard-Carillo","C.",""],["Griffith","W. C.",""],["Haddad","F.",""],["Hartnell","J.",""],["Hourlier","A.",""],["Hull","G.",""],["Irastorza","I. G.",""],["Koch","L.",""],["Lani\u00e9ce","P.",""],["Du","J. F. Le",""],["Lefebvre","C.",""],["Lefevre","F.",""],["Legrand","F.",""],["Loaiza","P.",""],["Lock","J. A.",""],["Luz\u00f3n","G.",""],["Maalmi","J.",""],["Marquet","C.",""],["Mart\u00ednez","M.",""],["Mathon","B.",""],["M\u00e9nard","L.",""],["Navas-Nicol\u00e1s","D.",""],["Nunokawa","H.",""],["Ochoa-Ricoux","J. P.",""],["Obolensky","M.",""],["Palomares","C.",""],["Pillot","P.",""],["Porter","J. C. C.",""],["Pravikoff","M. S.",""],["Ramarijaona","H.",""],["Roche","M.",""],["Rosier","P.",""],["Roskovec","B.",""],["Sarsa","M. L.",""],["Schoppmann","S.",""],["Shorrock","W.",""],["Simard","L.",""],["Steiger","H. Th. J.",""],["Stocco","D.",""],["Stutzmann","J. S.",""],["Suekane","F.",""],["Tunc","A.",""],["Verdier","M. -A.",""],["Verdugo","A.",""],["Viaud","B.",""],["Wakely","S. M.",""],["Weber","A.",""],["Yermia","F.",""]]}
{"id":"2308.04155","submitter":"Jelena Djokic","authors":"Jelena {\\DJ}okic","title":"A short note on the order of the double reduced 2-factor transfer\n  digraph for rectangular grid graphs","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that the order of the double reduced 2-factor transfer digraph\n${\\cal R}^{**}_{m}$ which is needed for the enumeration of the spanning unions\nof cycles in the rectangular grid graph $P_m \\times P_n$ ($m,n \\in N$), when\n$m$ is odd, is equal to $\\displaystyle \\mid V({\\cal R}^{**}_{m}) \\mid =\n\\frac{1}{2} \\left[{m+1 \\choose (m-1)/2 } + {(m+1)/2 \\choose \\lfloor (m+1)/4\n\\rfloor}\\right].$\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:36:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["\u0110okic","Jelena",""]]}
{"id":"2308.04156","submitter":"Huilin Zhang","authors":"Huilin Zhang, Sumei Li, Yongli Chang","title":"Towards Top-Down Stereoscopic Image Quality Assessment via Stereo\n  Attention","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stereoscopic image quality assessment (SIQA) plays a crucial role in\nevaluating and improving the visual experience of 3D content. Existing\nbinocular properties and attention-based methods for SIQA have achieved\npromising performance. However, these bottom-up approaches are inadequate in\nexploiting the inherent characteristics of the human visual system (HVS). This\npaper presents a novel network for SIQA via stereo attention, employing a\ntop-down perspective to guide the quality assessment process. Our proposed\nmethod realizes the guidance from high-level binocular signals down to\nlow-level monocular signals, while the binocular and monocular information can\nbe calibrated progressively throughout the processing pipeline. We design a\ngeneralized Stereo AttenTion (SAT) block to implement the top-down philosophy\nin stereo perception. This block utilizes the fusion-generated attention map as\na high-level binocular modulator, influencing the representation of two\nlow-level monocular features. Additionally, we introduce an Energy Coefficient\n(EC) to account for recent findings indicating that binocular responses in the\nprimate primary visual cortex are less than the sum of monocular responses. The\nadaptive EC can tune the magnitude of binocular response flexibly, thus\nenhancing the formation of robust binocular features within our framework. To\nextract the most discriminative quality information from the summation and\nsubtraction of the two branches of monocular features, we utilize a\ndual-pooling strategy that applies min-pooling and max-pooling operations to\nthe respective branches. Experimental results highlight the superiority of our\ntop-down method in simulating the property of visual perception and advancing\nthe state-of-the-art in the SIQA field. The code of this work is available at\nhttps://github.com/Fanning-Zhang/SATNet.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:37:18 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 08:40:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Huilin",""],["Li","Sumei",""],["Chang","Yongli",""]]}
{"id":"2308.04157","submitter":"Tomohiko Sato","authors":"Hiroshi Ohtsuka, Tomohiko Sato","title":"Refinement of asymptotic behavior of the eigenvalues for the linearized\n  Liouville-Gel'fand Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine the second term of the asymptotic expansions for the first m\neigenvalues and eigenfunctions of the linearized Liouville-Gel'fand problem\nassociated to solutions which blow-up at m points. Our problem is the case with\nan inhomogeneous coefficient in two dimensional domain and we extend the\nprevious studies for the problem with a homogeneous coefficient. We also\ndiscuss in detail the required regularity of the coefficient necessary to get\nthe conclusion.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:39:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ohtsuka","Hiroshi",""],["Sato","Tomohiko",""]]}
{"id":"2308.04158","submitter":"Haojin Zhou Dr","authors":"Powei Chen, Siying Hu, Dr. Haojin Zhou","title":"A Dual Cox Model Theory And Its Applications In Oncology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given the prominence of targeted therapy and immunotherapy in cancer\ntreatment, it becomes imperative to consider heterogeneity in patients'\nresponses to treatments, which contributes greatly to the widely used\nproportional hazard assumption invalidated as in several clinical trials. To\naddress the challenge, we develop a Dual Cox model theory including a Dual Cox\nmodel and a fitting algorithm.\n  As one of the finite mixture models, the proposed Dual Cox model consists of\ntwo independent Cox models based on patients' responses to one designated\ntreatment (usually the experimental one) in the clinical trial. Responses of\npatients in the designated treatment arm can be observed and hence those\npatients are known responders or non-responders. From the perspective of\nsubgroup classification, such a phenomenon renders the proposed model as a\nsemi-supervised problem, compared to the typical finite mixture model where the\nsubgroup classification is usually unsupervised.\n  A specialized expectation-maximization algorithm is utilized for model\nfitting, where the initial parameter values are estimated from the patients in\nthe designated treatment arm and then the iteratively reweighted least squares\n(IRLS) is applied. Under mild assumptions, the consistency and asymptotic\nnormality of its estimators of effect parameters in each Cox model are\nestablished.\n  In addition to strong theoretical properties, simulations demonstrate that\nour theory can provide a good approximation to a wide variety of survival\nmodels, is relatively robust to the change of censoring rate and response rate,\nand has a high prediction accuracy and stability in subgroup classification\nwhile it has a fast convergence rate. Finally, we apply our theory to two\nclinical trials with cross-overed KM plots and identify the subgroups where the\nsubjects benefit from the treatment or not.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:41:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Powei",""],["Hu","Siying",""],["Zhou","Dr. Haojin",""]]}
{"id":"2308.04159","submitter":"Conor McMenamin","authors":"Conor McMenamin","title":"SoK: Cross-Domain MEV","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the current state of the cross-domain world, with particular focus\non the protocols being used/planned for use by multi-domain users. We build on\nexisting frameworks for analyzing how MEV is extracted, while also adding a new\ncategorization of intrinsic-extractable value vs. time-extractable value to\ndescribe how MEV is generated for an extractor. Together, this provides us with\na framework with which we compare classes of protocols enabling cross-domain\nMEV, and the MEV occurring within these classes. We analyze each protocol class\nseparately and compare current implementations to an ideal functionality for\neach. We primarily focus on analyzing the MEV mitigations that these protocols\nprovide, both now, and into the future. In each case, we also outline the\ntechnical barriers that current protocol implementations face. With this\nmethodology, we identify sequencers and order-flow auctions as cross-domain\nprotocols with the greatest potential to mitigate MEV, but also as protocols\nwith some of the biggest technical barriers.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:44:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["McMenamin","Conor",""]]}
{"id":"2308.04160","submitter":"Yuan Huang","authors":"Yuan Huang, Kairui Gu, and Hee-hyol Lee","title":"S&Reg: End-to-End Learning-Based Model for Multi-Goal Path Planning\n  Problem","comments":"7 paegs, 12 figures. Accepted at IEEE International Conference on\n  Robot and Human Interactive Communication (ROMAN), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a novel end-to-end approach for solving the\nmulti-goal path planning problem in obstacle environments. Our proposed model,\ncalled S&Reg, integrates multi-task learning networks with a TSP solver and a\npath planner to quickly compute a closed and feasible path visiting all goals.\nSpecifically, the model first predicts promising regions that potentially\ncontain the optimal paths connecting two goals as a segmentation task.\nSimultaneously, estimations for pairwise distances between goals are conducted\nas a regression task by the neural networks, while the results construct a\nsymmetric weight matrix for the TSP solver. Leveraging the TSP result, the path\nplanner efficiently explores feasible paths guided by promising regions. We\nextensively evaluate the S&Reg model through simulations and compare it with\nthe other sampling-based algorithms. The results demonstrate that our proposed\nmodel achieves superior performance in respect of computation time and solution\ncost, making it an effective solution for multi-goal path planning in obstacle\nenvironments. The proposed approach has the potential to be extended to other\nsampling-based algorithms for multi-goal path planning.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:45:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Huang","Yuan",""],["Gu","Kairui",""],["Lee","Hee-hyol",""]]}
{"id":"2308.04161","submitter":"Frank Wolter","authors":"James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski,\n  Frank Wolter","title":"Current and Future Challenges in Knowledge Representation and Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge Representation and Reasoning is a central, longstanding, and active\narea of Artificial Intelligence. Over the years it has evolved significantly;\nmore recently it has been challenged and complemented by research in areas such\nas machine learning and reasoning under uncertainty. In July 2022 a Dagstuhl\nPerspectives workshop was held on Knowledge Representation and Reasoning. The\ngoal of the workshop was to describe the state of the art in the field,\nincluding its relation with other areas, its shortcomings and strengths,\ntogether with recommendations for future progress. We developed this manifesto\nbased on the presentations, panels, working groups, and discussions that took\nplace at the Dagstuhl Workshop. It is a declaration of our views on Knowledge\nRepresentation: its origins, goals, milestones, and current foci; its relation\nto other disciplines, especially to Artificial Intelligence; and on its\nchallenges, along with key priorities for the next decade.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:47:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Delgrande","James P.",""],["Glimm","Birte",""],["Meyer","Thomas",""],["Truszczynski","Miroslaw",""],["Wolter","Frank",""]]}
{"id":"2308.04162","submitter":"Kailun Yang","authors":"Jiajun Chen, Jiacheng Lin, Zhiqiang Xiao, Haolong Fu, Ke Nai, Kailun\n  Yang, Zhiyong Li","title":"EPCFormer: Expression Prompt Collaboration Transformer for Universal\n  Referring Video Object Segmentation","comments":"The source code will be made publicly available at\n  https://github.com/lab206/EPCFormer","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.AS eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Audio-guided Video Object Segmentation (A-VOS) and Referring Video Object\nSegmentation (R-VOS) are two highly-related tasks, which both aim to segment\nspecific objects from video sequences according to user-provided expression\nprompts. However, due to the challenges in modeling representations for\ndifferent modalities, contemporary methods struggle to strike a balance between\ninteraction flexibility and high-precision localization and segmentation. In\nthis paper, we address this problem from two perspectives: the alignment\nrepresentation of audio and text and the deep interaction among audio, text,\nand visual features. First, we propose a universal architecture, the Expression\nPrompt Collaboration Transformer, herein EPCFormer. Next, we propose an\nExpression Alignment (EA) mechanism for audio and text expressions. By\nintroducing contrastive learning for audio and text expressions, the proposed\nEPCFormer realizes comprehension of the semantic equivalence between audio and\ntext expressions denoting the same objects. Then, to facilitate deep\ninteractions among audio, text, and video features, we introduce an\nExpression-Visual Attention (EVA) mechanism. The knowledge of video object\nsegmentation in terms of the expression prompts can seamlessly transfer between\nthe two tasks by deeply exploring complementary cues between text and audio.\nExperiments on well-recognized benchmarks demonstrate that our universal\nEPCFormer attains state-of-the-art results on both tasks. The source code of\nEPCFormer will be made publicly available at\nhttps://github.com/lab206/EPCFormer.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:48:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Jiajun",""],["Lin","Jiacheng",""],["Xiao","Zhiqiang",""],["Fu","Haolong",""],["Nai","Ke",""],["Yang","Kailun",""],["Li","Zhiyong",""]]}
{"id":"2308.04163","submitter":"Binbin Song","authors":"Binbin Song, Xiangyu Chen, Shuning Xu, and Jiantao Zhou","title":"Under-Display Camera Image Restoration with Scattering Effect","comments":"Accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The under-display camera (UDC) provides consumers with a full-screen visual\nexperience without any obstruction due to notches or punched holes. However,\nthe semi-transparent nature of the display inevitably introduces the severe\ndegradation into UDC images. In this work, we address the UDC image restoration\nproblem with the specific consideration of the scattering effect caused by the\ndisplay. We explicitly model the scattering effect by treating the display as a\npiece of homogeneous scattering medium. With the physical model of the\nscattering effect, we improve the image formation pipeline for the image\nsynthesis to construct a realistic UDC dataset with ground truths. To suppress\nthe scattering effect for the eventual UDC image recovery, a two-branch\nrestoration network is designed. More specifically, the scattering branch\nleverages global modeling capabilities of the channel-wise self-attention to\nestimate parameters of the scattering effect from degraded images. While the\nimage branch exploits the local representation advantage of CNN to recover\nclear scenes, implicitly guided by the scattering branch. Extensive experiments\nare conducted on both real-world and synthesized data, demonstrating the\nsuperiority of the proposed method over the state-of-the-art UDC restoration\ntechniques. The source code and dataset are available at\n\\url{https://github.com/NamecantbeNULL/SRUDC}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:50:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Song","Binbin",""],["Chen","Xiangyu",""],["Xu","Shuning",""],["Zhou","Jiantao",""]]}
{"id":"2308.04164","submitter":"Ling Lin","authors":"Ling Lin, Yongguan Ke, Li Zhang and Chaohong Lee","title":"Calculations of Chern number: equivalence of real-space and\n  twisted-boundary-condition formulae","comments":"16 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chern number is a crucial invariant for characterizing topological feature of\ntwo-dimensional quantum systems. Real-space Chern number allows us to extract\ntopological properties of systems without involving translational symmetry, and\nhence plays an important role in investigating topological systems with\ndisorder or impurity. On the other hand, the twisted boundary condition (TBC)\ncan also be used to define the Chern number in the absence of translational\nsymmetry. Here we study the relation between these different definitions of\nChern number. Through analyzing the TBC formula and two real-space formulae\n(the non-commutative Chern number and the Bott index formula), we show that\nthese approaches are equivalent in the thermodynamic limit. The equivalence is\nalso numerically confirmed via the Haldane model.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:54:20 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 10:14:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lin","Ling",""],["Ke","Yongguan",""],["Zhang","Li",""],["Lee","Chaohong",""]]}
{"id":"2308.04165","submitter":"Koneri Chandrasekran Dr","authors":"K.Chandrasekran and D.J.Prabhakaran","title":"Univalent Functions involving Generalized Hypergeometric Series","comments":"32 Pages. arXiv admin note: substantial text overlap with\n  arXiv:2301.12927","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main objective of the present article is to make interconnection between\nthe Generalized Hyergeometric series and some subclasses of normalized analytic\nfunctions with positive(Tailor's) coefficients in the open unit disc\n$\\mathbb{D} =\\{z:\\, |z|<1\\}$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:56:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chandrasekran","K.",""],["Prabhakaran","D. J.",""]]}
{"id":"2308.04166","submitter":"Rene Allerstorfer","authors":"Rene Allerstorfer, Lloren\\c{c} Escol\\`a-Farr\\`as, Arpan Akash Ray,\n  Boris \\v{S}kori\\'c, Florian Speelman, Philip Verduyn Lunel","title":"Security of a Continuous-Variable based Quantum Position Verification\n  Protocol","comments":"17 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 work we study quantum position verification with continuous-variable\nquantum states. In contrast to existing discrete protocols, we present and\nanalyze a protocol that utilizes coherent states and its properties. Compared\nto discrete-variable photonic states, coherent states offer practical\nadvantages since they can be efficiently prepared and manipulated with current\ntechnology. We prove security of the protocol against any unentangled attackers\nvia entropic uncertainty relations, showing that the adversary has more\nuncertainty than the honest prover about the correct response as long as the\nnoise in the quantum channel is below a certain threshold. Additionally, we\nshow that attackers who pre-share one continuous-variable EPR pair can break\nthe protocol.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:56:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Allerstorfer","Rene",""],["Escol\u00e0-Farr\u00e0s","Lloren\u00e7",""],["Ray","Arpan Akash",""],["\u0160kori\u0107","Boris",""],["Speelman","Florian",""],["Lunel","Philip Verduyn",""]]}
{"id":"2308.04167","submitter":"Naomi Schneider","authors":"Naomi Schneider, Volker Michel, Nico Sneeuw","title":"High-dimensional experiments for the downward continuation using the\n  LRFMP algorithm","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":"  Time-dependent gravity data from satellite missions like GRACE-FO reveal mass\nredistribution in the system Earth at various time scales: long-term climate\nchange signals, inter-annual phenomena like El Nino, seasonal mass transports\nand transients, e. g. due to earthquakes. For this contemporary issue, a\nclassical inverse problem has to be considered: the gravitational potential has\nto be modelled on the Earth's surface from measurements in space. This is also\nknown as the downward continuation problem. Thus, it is important to further\ndevelop current mathematical methods for such inverse problems. For this, the\n(Learning) Inverse Problem Matching Pursuits ((L)IPMPs) have been developed\nwithin the last decade. Their unique feature is the combination of local as\nwell as global trial functions in the approximative solution of an inverse\nproblem such as the downward continuation of the gravitational potential. In\nthis way, they harmonize the ideas of a traditional spherical harmonic ansatz\nand the radial basis function approach. Previous publications on these methods\nshowed proofs of concept. Here, we consider the methods for high-dimensional\nexperiments settings with more than 500 000 grid points which yields a\nresolution of 20 km at best on a realistic satellite geometry. We also explain\nthe changes in the methods that had to be done to work with such a large amount\nof data. The corresponding code (updated for big data use) is available at\nhttps://doi.org/10.5281/zenodo.8223771 under the licence CC BY-NC-SA 3.0\nGermany.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:57:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Schneider","Naomi",""],["Michel","Volker",""],["Sneeuw","Nico",""]]}
{"id":"2308.04168","submitter":"Jan Niklas Kolf","authors":"Jan Niklas Kolf, Fadi Boutros, Jurek Elliesen, Markus Theuerkauf,\n  Naser Damer, Mohamad Alansari, Oussama Abdul Hay, Sara Alansari, Sajid Javed,\n  Naoufel Werghi, Klemen Grm, Vitomir \\v{S}truc, Fernando Alonso-Fernandez,\n  Kevin Hernandez Diaz, Josef Bigun, Anjith George, Christophe Ecabert, Hatef\n  Otroshi Shahreza, Ketan Kotwal, S\\'ebastien Marcel, Iurii Medvedev, Bo Jin,\n  Diogo Nunes, Ahmad Hassanpour, Pankaj Khatiwada, Aafan Ahmad Toor, Bian Yang","title":"EFaR 2023: Efficient Face Recognition Competition","comments":"Accepted at IJCB 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper presents the summary of the Efficient Face Recognition Competition\n(EFaR) held at the 2023 International Joint Conference on Biometrics (IJCB\n2023). The competition received 17 submissions from 6 different teams. To drive\nfurther development of efficient face recognition models, the submitted\nsolutions are ranked based on a weighted score of the achieved verification\naccuracies on a diverse set of benchmarks, as well as the deployability given\nby the number of floating-point operations and model size. The evaluation of\nsubmissions is extended to bias, cross-quality, and large-scale recognition\nbenchmarks. Overall, the paper gives an overview of the achieved performance\nvalues of the submitted solutions as well as a diverse set of baselines. The\nsubmitted solutions use small, efficient network architectures to reduce the\ncomputational cost, some solutions apply model quantization. An outlook on\npossible techniques that are underrepresented in current solutions is given as\nwell.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:58:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kolf","Jan Niklas",""],["Boutros","Fadi",""],["Elliesen","Jurek",""],["Theuerkauf","Markus",""],["Damer","Naser",""],["Alansari","Mohamad",""],["Hay","Oussama Abdul",""],["Alansari","Sara",""],["Javed","Sajid",""],["Werghi","Naoufel",""],["Grm","Klemen",""],["\u0160truc","Vitomir",""],["Alonso-Fernandez","Fernando",""],["Diaz","Kevin Hernandez",""],["Bigun","Josef",""],["George","Anjith",""],["Ecabert","Christophe",""],["Shahreza","Hatef Otroshi",""],["Kotwal","Ketan",""],["Marcel","S\u00e9bastien",""],["Medvedev","Iurii",""],["Jin","Bo",""],["Nunes","Diogo",""],["Hassanpour","Ahmad",""],["Khatiwada","Pankaj",""],["Toor","Aafan Ahmad",""],["Yang","Bian",""]]}
{"id":"2308.04169","submitter":"Eric Grinstein","authors":"Eric Grinstein, Vincent W. Neo and Patrick A. Naylor","title":"Dual input neural networks for positional sound source localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In many signal processing applications, metadata may be advantageously used\nin conjunction with a high dimensional signal to produce a desired output. In\nthe case of classical Sound Source Localization (SSL) algorithms, information\nfrom a high dimensional, multichannel audio signals received by many\ndistributed microphones is combined with information describing acoustic\nproperties of the scene, such as the microphones' coordinates in space, to\nestimate the position of a sound source. We introduce Dual Input Neural\nNetworks (DI-NNs) as a simple and effective way to model these two data types\nin a neural network. We train and evaluate our proposed DI-NN on scenarios of\nvarying difficulty and realism and compare it against an alternative\narchitecture, a classical Least-Squares (LS) method as well as a classical\nConvolutional Recurrent Neural Network (CRNN). Our results show that the DI-NN\nsignificantly outperforms the baselines, achieving a five times lower\nlocalization error than the LS method and two times lower than the CRNN in a\ntest dataset of real recordings.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:59:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Grinstein","Eric",""],["Neo","Vincent W.",""],["Naylor","Patrick A.",""]]}
{"id":"2308.04170","submitter":"Ali Muzaffar","authors":"Ali Muzaffar, Hani Ragab Hassen, Hind Zantout, Michael A Lones","title":"DroidDissector: A Static and Dynamic Analysis Tool for Android Malware\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  DroidDissector is an extraction tool for both static and dynamic features.\nThe aim is to provide Android malware researchers and analysts with an\nintegrated tool that can extract all of the most widely used features in\nAndroid malware detection from one location. The static analysis module\nextracts features from both the manifest file and the source code of the\napplication to obtain a broad array of features that include permissions, API\ncall graphs and opcodes. The dynamic analysis module runs on the latest version\nof Android and analyses the complete behaviour of an application by tracking\nthe system calls used, network traffic generated, API calls used and log files\nproduced by the application.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:59:56 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 10:54:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Muzaffar","Ali",""],["Hassen","Hani Ragab",""],["Zantout","Hind",""],["Lones","Michael A",""]]}
{"id":"2308.04171","submitter":"Zhe Su","authors":"Zhe Su, Hyunjung Hwang, Tristan Torchet, Giacomo Indiveri","title":"Core interface optimization for multi-core neuromorphic processors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hardware implementations of Spiking Neural Networks (SNNs) represent a\npromising approach to edge-computing for applications that require low-power\nand low-latency, and which cannot resort to external cloud-based computing\nservices. However, most solutions proposed so far either support only\nrelatively small networks, or take up significant hardware resources, to\nimplement large networks. To realize large-scale and scalable SNNs it is\nnecessary to develop an efficient asynchronous communication and routing fabric\nthat enables the design of multi-core architectures. In particular the core\ninterface that manages inter-core spike communication is a crucial component as\nit represents the bottleneck of Power-Performance-Area (PPA) especially for the\narbitration architecture and the routing memory. In this paper we present an\narbitration mechanism with the corresponding asynchronous encoding pipeline\ncircuits, based on hierarchical arbiter trees. The proposed scheme reduces the\nlatency by more than 70% in sparse-event mode, compared to the state-of-the-art\narbitration architectures, with lower area cost. The routing memory makes use\nof asynchronous Content Addressable Memory (CAM) with Current Sensing\nCompletion Detection (CSCD), which saves approximately 46% energy, and achieves\na 40% increase in throughput against conventional asynchronous CAM using\nconfigurable delay lines, at the cost of only a slight increase in area. In\naddition as it radically reduces the core interface resources in multi-core\nneuromorphic processors, the arbitration architecture and CAM architecture we\npropose can be also applied to a wide range of general asynchronous circuits\nand systems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:00:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Su","Zhe",""],["Hwang","Hyunjung",""],["Torchet","Tristan",""],["Indiveri","Giacomo",""]]}
{"id":"2308.04172","submitter":"Charlie Abela Dr","authors":"Lizzy Farrugia, Lilian M. Azzopardi, Jeremy Debattista and Charlie\n  Abela","title":"Predicting Drug-Drug Interactions Using Knowledge Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the last decades, people have been consuming and combining more drugs than\nbefore, increasing the number of Drug-Drug Interactions (DDIs). To predict\nunknown DDIs, recently, studies started incorporating Knowledge Graphs (KGs)\nsince they are able to capture the relationships among entities providing\nbetter drug representations than using a single drug property. In this paper,\nwe propose the medicX end-to-end framework that integrates several drug\nfeatures from public drug repositories into a KG and embeds the nodes in the\ngraph using various translation, factorisation and Neural Network (NN) based KG\nEmbedding (KGE) methods. Ultimately, we use a Machine Learning (ML) algorithm\nthat predicts unknown DDIs. Among the different translation and\nfactorisation-based KGE models, we found that the best performing combination\nwas the ComplEx embedding method with a Long Short-Term Memory (LSTM) network,\nwhich obtained an F1-score of 95.19% on a dataset based on the DDIs found in\nDrugBank version 5.1.8. This score is 5.61% better than the state-of-the-art\nmodel DeepDDI. Additionally, we also developed a graph auto-encoder model that\nuses a Graph Neural Network (GNN), which achieved an F1-score of 91.94%.\nConsequently, GNNs have demonstrated a stronger ability to mine the underlying\nsemantics of the KG than the ComplEx model, and thus using higher dimension\nembeddings within the GNN can lead to state-of-the-art performance.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:07:22 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 07:54:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Farrugia","Lizzy",""],["Azzopardi","Lilian M.",""],["Debattista","Jeremy",""],["Abela","Charlie",""]]}
{"id":"2308.04173","submitter":"Sergei Yurchenko N","authors":"Sergei N. Yurchenko, Ryan P. Brady, Jonathan Tennyson, Alexander N.\n  Smirnov, Oleg A. Vasilyev and Victor G. Solomonik","title":"ExoMol line lists -- LIII: Empirical Rovibronic spectra Yttrium Oxide\n  (YO)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Empirical line lists for the open shell molecule $^{89}$Y$^{16}$O (yttrium\noxide) and its isotopologues are presented. The line list covers the 6 lowest\nelectronic states: $X {}^{2}\\Sigma^{+}$, $A {}^{2}\\Pi$, $A' {}^{2}\\Delta$, $B\n{}^{2}\\Sigma^{+}$, $C {}^{2}\\Pi$ and $D {}^{2}\\Sigma^{+}$ up to 60000 cm$^{-1}$\n($<0.167$ $\\mu$m) for rotational excitation up to $J = 400.5$. An \\textit{ab\ninitio} spectroscopic model consisting of potential energy curves (PECs),\nspin-orbit and electronic angular momentum couplings is refined by fitting to\nexperimentally determined energies of YO, derived from published YO\nexperimental transition frequency data. The model is complemented by empirical\nspin-rotation and $\\Lambda$-doubling curves and \\textit{ab initio} dipole\nmoment and transition dipole moment curves computed using MRCI. The \\textit{ab\ninitio} PECs computed using the complete basis set limit extrapolation and the\nCCSD(T) method with its higher quality provide an excellent initial\napproximation for the refinement. Non-adiabatic coupling curves for two pairs\nof states of the same symmetry $A$/$C$ and $B$/$D$ are computed using a\nstate-averaged CASSCF and used to built diabatic representations for the $A\n{}^{2}\\Pi$, $C {}^{2}\\Pi$, $B {}^{2}\\Sigma^{+}$ and $D {}^{2}\\Sigma^{+}$\ncurves. Calculated lifetimes of YO are tuned to agree well with the experiment,\nwhere available. The BRYTS YO line lists for are included into the ExoMol data\nbase (www.exomol.com).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:08:21 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 17:32:07 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yurchenko","Sergei N.",""],["Brady","Ryan P.",""],["Tennyson","Jonathan",""],["Smirnov","Alexander N.",""],["Vasilyev","Oleg A.",""],["Solomonik","Victor G.",""]]}
{"id":"2308.04174","submitter":"Anders Karlsson","authors":"Gautam Chinta, Jay Jorgenson, Anders Karlsson, and Lejla Smajlovi\\'c","title":"The parametrix construction of the heat kernel on a graph","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we develop the parametrix approach for constructing the heat\nkernel on a graph $G$. In particular, we highlight two specific cases. First,\nwe consider the case when $G$ is embedded in a Eulidean domain or manifold\n$\\Omega$, and we use a heat kernel associated to $\\Omega$ to obtain a formula\nfor the heat kernel on $G$. Second, we consider when $G$ is a subgraph of a\nlarger graph $\\widetilde{G}$, and we obtain a formula for the heat kernel on\n$G$ from the heat kernel on $\\widetilde{G}$ restricted to $G$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:13:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chinta","Gautam",""],["Jorgenson","Jay",""],["Karlsson","Anders",""],["Smajlovi\u0107","Lejla",""]]}
{"id":"2308.04175","submitter":"Michael Haack","authors":"Andreas Bischof, Michael Haack and Stephan Stieberger","title":"Scattering three closed strings off a Dp-brane in pure spinor formalism","comments":"64 pages, 11 figures","journal-ref":null,"doi":null,"report-no":"MPP-2023-79, LMU-ASC 28/23","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the disk amplitude of three closed strings in the pure spinor\nformalism. Among others, this amplitude probes tree-level gravitational\ninteractions in the presence of Dp-branes. After disentangling holomorphic and\nanti-holomorphic closed string coordinates on the disk by means of introducing\nmonodromy phases we find a compact expression for the disk amplitude of three\nclosed strings in terms of open superstring six-point amplitudes. Furthermore,\nwe provide the low-energy expansion (in the inverse string tension) of our\namplitude and discuss some relevant Dp-brane couplings associated to it.\nFinally, we write down an expression for the general structure of the disk\namplitude of any number n_c of closed strings in terms of pure open string\namplitudes involving 2n_c open strings.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:15:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bischof","Andreas",""],["Haack","Michael",""],["Stieberger","Stephan",""]]}
{"id":"2308.04176","submitter":"Sang-Eun Han","authors":"Sang-eun Han, Yeonseok Jeong, Seung-won Hwang, Kyungjae Lee","title":"On Monotonic Aggregation for Open-domain QA","comments":"INTERSPEECH 2023 Camera Ready","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Question answering (QA) is a critical task for speech-based retrieval from\nknowledge sources, by sifting only the answers without requiring to read\nsupporting documents. Specifically, open-domain QA aims to answer user\nquestions on unrestricted knowledge sources. Ideally, adding a source should\nnot decrease the accuracy, but we find this property (denoted as\n\"monotonicity\") does not hold for current state-of-the-art methods. We identify\nthe cause, and based on that we propose Judge-Specialist framework. Our\nframework consists of (1) specialist retrievers/readers to cover individual\nsources, and (2) judge, a dedicated language model to select the final answer.\nOur experiments show that our framework not only ensures monotonicity, but also\noutperforms state-of-the-art multi-source QA methods on Natural Questions.\nAdditionally, we show that our models robustly preserve the monotonicity\nagainst noise from speech recognition. We publicly release our code and\nsetting.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:23:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Han","Sang-eun",""],["Jeong","Yeonseok",""],["Hwang","Seung-won",""],["Lee","Kyungjae",""]]}
{"id":"2308.04177","submitter":"Boquan Li","authors":"Boquan Li, Jun Sun, Christopher M. Poskitt","title":"How Generalizable are Deepfake Detectors? An Empirical Study","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.CV cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deepfake videos and images are becoming increasingly credible, posing a\nsignificant threat given their potential to facilitate fraud or bypass access\ncontrol systems. This has motivated the development of deepfake detection\nmethods, in which deep learning models are trained to distinguish between real\nand synthesized footage. Unfortunately, existing detection models struggle to\ngeneralize to deepfakes from datasets they were not trained on, but little work\nhas been done to examine why or how this limitation can be addressed. In this\npaper, we present the first empirical study on the generalizability of deepfake\ndetectors, an essential goal for detectors to stay one step ahead of attackers.\nOur study utilizes six deepfake datasets, five deepfake detection methods, and\ntwo model augmentation approaches, confirming that detectors do not generalize\nin zero-shot settings. Additionally, we find that detectors are learning\nunwanted properties specific to synthesis methods and struggling to extract\ndiscriminative features, limiting their ability to generalize. Finally, we find\nthat there are neurons universally contributing to detection across seen and\nunseen datasets, illuminating a possible path forward to zero-shot\ngeneralizability.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:30:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Boquan",""],["Sun","Jun",""],["Poskitt","Christopher M.",""]]}
{"id":"2308.04178","submitter":"Basabdatta Sen Bhattacharya","authors":"Basabdatta Sen Bhattacharya, Vibhav Sinai Pissurlenkar","title":"Assistive Chatbots for healthcare: a succinct review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial Intelligence (AI) for supporting healthcare services has never\nbeen more necessitated than by the recent global pandemic. Here, we review the\nstate-of-the-art in AI-enabled Chatbots in healthcare proposed during the last\n10 years (2013-2023). The focus on AI-enabled technology is because of its\npotential for enhancing the quality of human-machine interaction via Chatbots,\nreducing dependence on human-human interaction and saving man-hours. Our review\nindicates that there are a handful of (commercial) Chatbots that are being used\nfor patient support, while there are others (non-commercial) that are in the\nclinical trial phases. However, there is a lack of trust on this technology\nregarding patient safety and data protection, as well as a lack of wider\nawareness on its benefits among the healthcare workers and professionals. Also,\npatients have expressed dissatisfaction with Natural Language Processing (NLP)\nskills of the Chatbots in comparison to humans. Notwithstanding the recent\nintroduction of ChatGPT that has raised the bar for the NLP technology, this\nChatbot cannot be trusted with patient safety and medical ethics without\nthorough and rigorous checks to serve in the `narrow' domain of assistive\nhealthcare. Our review suggests that to enable deployment and integration of\nAI-enabled Chatbots in public health services, the need of the hour is: to\nbuild technology that is simple and safe to use; to build confidence on the\ntechnology among: (a) the medical community by focussed training and\ndevelopment; (b) the patients and wider community through outreach.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:35:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bhattacharya","Basabdatta Sen",""],["Pissurlenkar","Vibhav Sinai",""]]}
{"id":"2308.04179","submitter":"Diqun Yan","authors":"Zhe Ye, Diqun Yan, Li Dong, Kailai Shen","title":"Evil Operation: Breaking Speaker Recognition with PaddingBack","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SD eess.AS eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine Learning as a Service (MLaaS) has gained popularity due to\nadvancements in machine learning. However, untrusted third-party platforms have\nraised concerns about AI security, particularly in backdoor attacks. Recent\nresearch has shown that speech backdoors can utilize transformations as\ntriggers, similar to image backdoors. However, human ears easily detect these\ntransformations, leading to suspicion. In this paper, we introduce PaddingBack,\nan inaudible backdoor attack that utilizes malicious operations to make\npoisoned samples indistinguishable from clean ones. Instead of using external\nperturbations as triggers, we exploit the widely used speech signal operation,\npadding, to break speaker recognition systems. Our experimental results\ndemonstrate the effectiveness of the proposed approach, achieving a\nsignificantly high attack success rate while maintaining a high rate of benign\naccuracy. Furthermore, PaddingBack demonstrates the ability to resist defense\nmethods while maintaining its stealthiness against human perception. The\nresults of the stealthiness experiment have been made available at\nhttps://nbufabio25.github.io/paddingback/.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:36:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ye","Zhe",""],["Yan","Diqun",""],["Dong","Li",""],["Shen","Kailai",""]]}
{"id":"2308.04180","submitter":"Michele Linardi","authors":"Bruno Machado Carneiro, Michele Linardi, Julien Longhi","title":"Studying Socially Unacceptable Discourse Classification (SUD) through\n  different eyes: \"Are we on the same page ?\"","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study Socially Unacceptable Discourse (SUD) characterization and detection\nin online text. We first build and present a novel corpus that contains a large\nvariety of manually annotated texts from different online sources used so far\nin state-of-the-art Machine learning (ML) SUD detection solutions. This global\ncontext allows us to test the generalization ability of SUD classifiers that\nacquire knowledge around the same SUD categories, but from different contexts.\nFrom this perspective, we can analyze how (possibly) different annotation\nmodalities influence SUD learning by discussing open challenges and open\nresearch directions. We also provide several data insights which can support\ndomain experts in the annotation task.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:42:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Carneiro","Bruno Machado",""],["Linardi","Michele",""],["Longhi","Julien",""]]}
{"id":"2308.04181","submitter":"Radhika Prosad Datta PhD","authors":"Radhika Prosad Datta","title":"Regularity in forex returns during financial distress: Evidence from\n  India","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper uses the concepts of entropy to study the regularity/irregularity\nof the returns from the Indian Foreign exchange (forex) markets. The\nApproximate Entropy and Sample Entropy statistics which measure the level of\nrepeatability in the data are used to quantify the randomness in the forex\nreturns from the time period 2006 to 2021. The main objective of the research\nis to see how the randomness of the foreign exchange returns evolve over the\ngiven time period particularly during periods of high financial instability or\nturbulence in the global financial market. With this objective we look at 2\nmajor financial upheavals, the subprime crisis also known as the Global\nFinancial Crisis (GFC) during 2006-2007 and the recent Covid-19 pandemic during\n2020-2021. Our empirical results overwhelmingly confirm our working hypothesis\nthat regularity in the returns of the major Indian foreign exchange rates\nincreases during times of financial crisis. This is evidenced by a decrease in\nthe values of the sample entropy and approximate entropy before and\nafter/during the financial crisis period for the majority of the exchange\nrates. Our empirical results also show that Sample Entropy is a better measure\nof regularity than Approximate Entropy for the Indian forex rates which is in\nagreement with the theoretical predictions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:42:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Datta","Radhika Prosad",""]]}
{"id":"2308.04182","submitter":"Sandeep Sahijpal","authors":"Sandeep Sahijpal","title":"Dynamical orbital evolution of asteroids and planetesimals across\n  distinct chemical reservoirs due to accretion growth of planets in the early\n  solar system","comments":"Accepted","journal-ref":"Astrophysics & Astronomy, 2023","doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  N-body numerical simulations code for the orbital motion of\nasteroids/planetesimals within the asteroid belt under the gravitational\ninfluence of the sun and the accreting planets has been developed. The aim is\nto make qualitative, and to an extent a semi-quantitative argument, regarding\nthe possible extent of radial mixing and homogenization of planetesimal\nreservoirs of the two observed distinct spectral types , viz., the S-type and\nC-type, across the heliocentric distances due to their dynamical orbital\nevolution, thereby, eventually leading to the possible accretion of asteroids\nhaving chemically diverse constituents. The spectral S-type and C-type\nasteroids are broadly considered as the parent bodies of the two observed major\nmeteoritic dichotomy classes, namely, the non-carbonaceous (NC) and\ncarbonaceous (CC) meteorites, respectively. The present analysis is performed\nto understand the evolution of the observed dichotomy and its implications due\nto the nebula and early planetary processes during the initial 10 Myrs (Million\nyears). The homogenization across the two classes is studied in context to the\naccretion timescales of the planetesimals with respect to the half-life of the\npotent planetary heat source, 26Al. The accretion over a timescale of ~1.5 Myr.\npossibly resulted in the planetary-scale differentiation of planetesimals to\nproduce CC and NC achondrites and iron meteorite parent bodies, whereas, the\nprolonged accretion over a timescale of 2-5 Myrs. resulted in the formation of\nCC and NC chondrites. Our simulation results indicate a significant role of the\ninitial eccentricities and the masses of the accreting giant planets,\nspecifically, Jupiter and Saturn, in triggering the eccentricity churning of\nthe planetesimals across the radial distances......\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:56:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sahijpal","Sandeep",""]]}
{"id":"2308.04183","submitter":"Jie Peng","authors":"Xin Xie, Junlong Tian, Jie Peng","title":"Ultrafast and deterministic generation of Bell states in the ultrastrong\n  coupling regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have found the special dark state solutions of the anisotropic two-qubit\nquantum Rabi model (QRM), which has at most one photon, and constant\neigenenergy in the whole coupling regime. Accordingly, we propose a scheme to\ndeterministically generate two kinds of the two-qubit Bell states through\nadiabatic evolution along the dark states. With the assistance of the Stark\nshift, the generation time can be reduced to subnanosecond scales, proportional\nto the reverse of the resonator frequency, with fidelity reaching 99%.\nFurthermore, the other two kinds of Bell states can also be ultrafast\ngenerated.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:05:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xie","Xin",""],["Tian","Junlong",""],["Peng","Jie",""]]}
{"id":"2308.04184","submitter":"Luciano Tubaro","authors":"Giuseppe Da Prato, Enrico Priola, Luciano Tubaro","title":"A mild Girsanov formula","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a well posed SPDE$\\colon dZ=(AZ+b(Z)) dt+dW(t),\\,Z_0=x,\n  $\n  on a separable Hilbert space $H$, where $A\\colon H\\to H$ is self-adjoint,\nnegative and such that $A^{-1+\\beta}$ is of trace class for some $\\beta>0$,\n$b\\colon H\\to H$ is Lipschitz continuous and $W$ is a cylindrical Wiener\nprocess on $H$. We denote by $W_A(t)=\\int_0^te^{(t-s)A}\\,dW(s),\\,t\\in[0,T],$\nthe stochastic convolution. We prove, with the help of a formula for nonlinear\ntransformations of Gaussian integrals due to R. Ramer, the following identity\n$$(P\\circ Z_x^{-1})(\\Phi) =\\int_X\\Phi(h+e^{\\cdot A}x)\\, \\exp\\left\\{\n-\\tfrac12|\\gamma_x(h)|^2_{ H_{Q_T}} + I(\\gamma_x)(h)\\right\\} N_{Q_T}(dh), $$\n  where $ N_{Q_T}$ is the law of $W_A$ in $C([0,T],H)$, $ H_{Q_T}$ its\nCameron--Martin space, $$ [\\gamma_x(k)](t)=\\int_0^t e^{(t-s)A}b(k(s)+e^{sA}x)\nds,\\quad t\\in[0,T], \\; k \\in C([0,T],H)\n  $$\n  and $I(\\gamma_x) $ is the It\\^o integral of $\\gamma_x$. Some applications are\ndiscussed; in particular, when $b$ is dissipative we provide an explicit\nformula for the law of the stationary process and the invariant measure $\\nu$\nof the Markov semigroup $(P_t)$.\n  Some concluding remarks are devoted to a similar problem with colored noise.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:06:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Da Prato","Giuseppe",""],["Priola","Enrico",""],["Tubaro","Luciano",""]]}
{"id":"2308.04185","submitter":"Neophytos Charalambides Mr","authors":"Neophytos Charalambides, Hessam Mahdavifar, Mert Pilanci, Alfred O.\n  Hero III","title":"Iterative Sketching for Secure Coded Regression","comments":"28 pages, 7 figures. arXiv admin note: substantial text overlap with\n  arXiv:2201.08522","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CR cs.DC cs.LG cs.NA math.IT math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we propose methods for speeding up linear regression\ndistributively, while ensuring security. We leverage randomized sketching\ntechniques, and improve straggler resilience in asynchronous systems.\nSpecifically, we apply a random orthonormal matrix and then subsample\n\\textit{blocks}, to simultaneously secure the information and reduce the\ndimension of the regression problem. In our setup, the transformation\ncorresponds to an encoded encryption in an \\textit{approximate gradient coding\nscheme}, and the subsampling corresponds to the responses of the non-straggling\nworkers; in a centralized coded computing network. This results in a\ndistributive \\textit{iterative sketching} approach for an $\\ell_2$-subspace\nembedding, \\textit{i.e.} a new sketch is considered at each iteration. We also\nfocus on the special case of the \\textit{Subsampled Randomized Hadamard\nTransform}, which we generalize to block sampling; and discuss how it can be\nmodified in order to secure the data.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:10:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Charalambides","Neophytos",""],["Mahdavifar","Hessam",""],["Pilanci","Mert",""],["Hero","Alfred O.","III"]]}
{"id":"2308.04186","submitter":"Kristin Biesenbender","authors":"Kristin Biesenbender, Nina Smirnova, Philipp Mayr, Isabella Peters","title":"The Emergence of Preprints: Comparing Publishing Behaviour in the Global\n  South and the Global North","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Purpose: The recent proliferation of preprints could be a way for researchers\nworldwide to increase the availability and visibility of their research\nfindings. Against the background of rising publication costs caused by the\nincreasing prevalence of article processing fees, the search for other ways to\npublish research results besides traditional journal publication may increase.\nThis could be especially true for lower-income countries.\nDesign/methodology/approach: Therefore, we are interested in the experiences\nand attitudes towards posting and using preprints in the Global South as\nopposed to the Global North. To explore whether motivations and concerns about\nposting preprints differ, we adopted a mixed-methods approach, combining a\nquantitative survey of researchers with focus group interviews. Findings: We\nfound that respondents from the Global South were more likely to agree to\nadhere to policies and to emphasise that mandates could change publishing\nbehaviour towards open access. They were also more likely to agree posting\npreprints has a positive impact. Respondents from the Global South and the\nGlobal North emphasised the importance of peer-reviewed research for career\nadvancement. Originality: The study has identified a wide range of experiences\nwith and attitudes towards posting preprints among researchers in the Global\nSouth and the Global North. To our knowledge, this has hardly been studied\nbefore, which is also because preprints only have emerged lately in many\ndisciplines and countries.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:13:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Biesenbender","Kristin",""],["Smirnova","Nina",""],["Mayr","Philipp",""],["Peters","Isabella",""]]}
{"id":"2308.04187","submitter":"Lutz Terfloth","authors":"Lutz Terfloth, Michael Schaffer, Heike M. Buhl, Carsten Schulte","title":"Adding Why to What? Analyses of an Everyday Explanation","comments":"Paper accepted and presented at XAI World Conference 2023, Lisboa","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In XAI it is important to consider that, in contrast to explanations for\nprofessional audiences, one cannot assume common expertise when explaining for\nlaypeople. But such explanations between humans vary greatly, making it\ndifficult to research commonalities across explanations. We used the dual\nnature theory, a techno-philosophical approach, to cope with these challenges.\nAccording to it, one can explain, for example, an XAI's decision by addressing\nits dual nature: by focusing on the Architecture (e.g., the logic of its\nalgorithms) or the Relevance (e.g., the severity of a decision, the\nimplications of a recommendation). We investigated 20 game explanations using\nthe theory as an analytical framework. We elaborate how we used the theory to\nquickly structure and compare explanations of technological artifacts. We\nsupplemented results from analyzing the explanation contents with results from\na video recall to explore how explainers justified their explanation. We found\nthat explainers were focusing on the physical aspects of the game first\n(Architecture) and only later on aspects of the Relevance. Reasoning in the\nvideo recalls indicated that EX regarded the focus on the Architecture as\nimportant for structuring the explanation initially by explaining the basic\ncomponents before focusing on more complex, intangible aspects. Shifting\nbetween addressing the two sides was justified by explanation goals, emerging\nmisunderstandings, and the knowledge needs of the explainee. We discovered\nseveral commonalities that inspire future research questions which, if further\ngeneralizable, provide first ideas for the construction of synthetic\nexplanations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:17:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Terfloth","Lutz",""],["Schaffer","Michael",""],["Buhl","Heike M.",""],["Schulte","Carsten",""]]}
{"id":"2308.04188","submitter":"Yingjie He","authors":"Yingjie He, Yuanman Li, Changsheng Chen and Xia Li","title":"Image Copy-Move Forgery Detection via Deep Cross-Scale PatchMatch","comments":"6 pages, 4 figures, accepted by ICME2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recently developed deep algorithms achieve promising progress in the\nfield of image copy-move forgery detection (CMFD). However, they have limited\ngeneralizability in some practical scenarios, where the copy-move objects may\nnot appear in the training images or cloned regions are from the background. To\naddress the above issues, in this work, we propose a novel end-to-end CMFD\nframework by integrating merits from both conventional and deep methods.\nSpecifically, we design a deep cross-scale patchmatch method tailored for CMFD\nto localize copy-move regions. In contrast to existing deep models, our scheme\naims to seek explicit and reliable point-to-point matching between source and\ntarget regions using features extracted from high-resolution scales. Further,\nwe develop a manipulation region location branch for source/target separation.\nThe proposed CMFD framework is completely differentiable and can be trained in\nan end-to-end manner. Extensive experimental results demonstrate the high\ngeneralizability of our method to different copy-move contents, and the\nproposed scheme achieves significantly better performance than existing\napproaches.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:23:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["He","Yingjie",""],["Li","Yuanman",""],["Chen","Changsheng",""],["Li","Xia",""]]}
{"id":"2308.04189","submitter":"Carsten Nielsen","authors":"Carsten Nielsen, Zhe Su, Giacomo Indiveri","title":"Yak: An Asynchronous Bundled Data Pipeline Description Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The design of asynchronous circuits typically requires a judicious definition\nof signals and modules, combined with a proper specification of their timing\nconstraints, which can be a complex and error-prone process, using standard\nHardware Description Languages (HDLs). In this paper we introduce Yak, a new\ndataflow description language for asynchronous bundled data circuits. Yak\nallows designers to generate Verilog and timing constraints automatically, from\na textual description of bundled data control flow structures and combinational\nlogic blocks. The timing constraints are generated using the Local Clock Set\nmethodology and can be consumed by standard industry tools. Yak includes\nergonomic language features such as structured bindings of channels undergoing\nfork and join operations, named value scope propagation along channels, and\nchannel typing. Here we present Yak's language front-end and compare the\nautomated synthesis and layout results of an example circuit with a manual\nconstraint specification approach.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:24:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nielsen","Carsten",""],["Su","Zhe",""],["Indiveri","Giacomo",""]]}
{"id":"2308.04190","submitter":"Xiang He","authors":"Xiang He","title":"Prescription of finite Dirichlet eigenvalues and area on surface with\n  boundary","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the present paper, we consider Dirichlet Laplacian on compact surface. We\nshow that for a fixed surface with boundary $X$, a finite increasing sequence\nof real numbers $0<a_1<a_2<\\cdots<a_N$ and a positive number $A$, there exists\na metric $g$ on $X$ such that for any integer $1\\leq k\\leq N$, we have\n$\\lambda_k^\\mathcal{D}(X,g)=a_k$ and $\\mathrm{Area}(X,g)=A$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:28:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["He","Xiang",""]]}
{"id":"2308.04191","submitter":"Akshat Mudgal","authors":"Akshat Mudgal","title":"An Elekes-R\\'onyai theorem for sets with few products","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given $d,n \\in \\mathbb{N}$, we write a polynomial $F \\in\n\\mathbb{C}[x_1,\\dots,x_n]$ to be degenerate if there exist $P\\in\n\\mathbb{C}[y_1, \\dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\\dots x_n^{v_{j,n}}$\nwith $v_{j,1}, \\dots, v_{j,n} \\in \\mathbb{Q}$, for every $1 \\leq j \\leq n-1$,\nsuch that $F = P(m_1, \\dots, m_{n-1})$. Our main result shows that whenever $F$\nis non-degenerate, then for every finite set $A\\subseteq \\mathbb{C}$ such that\n$|A\\cdot A| \\leq K|A|$, one has \\[ |F(A, \\dots, A)| \\gg_{d,n} |A|^n\n2^{-O_{d,n}((\\log 2K)^{3 + o(1)})}. \\] This is sharp up to a factor of\n$O_{d,n,K}(1)$ since we have the upper bound $|F(A,\\dots,A)| \\leq |A|^n$ and\nthe fact that for every degenerate $F$ and finite set $A \\subseteq \\mathbb{C}$\nwith $|A\\cdot A| \\leq K|A|$, one has \\[ |F(A,\\dots,A)| \\ll\nK^{O_F(1)}|A|^{n-1}.\\] Our techniques rely on a variety of combinatorial and\nlinear algebraic arguments combined with Freiman type inverse theorems and\nSchmidt's subspace theorem.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:32:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mudgal","Akshat",""]]}
{"id":"2308.04192","submitter":"Kwok Ho Wan","authors":"Brendan Pankovich, Angus Kan, Kwok Ho Wan, Maike Ostmann, Alex\n  Neville, Srikrishna Omkar, Adel Sohbi and Kamil Br\\'adler","title":"High photon-loss threshold quantum computing using GHZ-state\n  measurements","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose fault-tolerant architectures based on performing projective\nmeasurements in the Greenberger-Horne-Zeilinger (GHZ) basis on constant-sized,\nentangled resource states. We present linear-optical constructions of the\narchitectures, where the GHZ-state measurements are encoded to suppress the\nerrors induced by photon loss and the probabilistic nature of linear optics.\nSimulations of our constructions demonstrate high single-photon loss thresholds\ncompared to the state-of-the-art linear-optical architecture realized with\nencoded two-qubit fusion measurements performed on constant-sized resource\nstates. We believe this result shows a resource-efficient path to achieving\nphotonic fault-tolerant quantum computing.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:36:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pankovich","Brendan",""],["Kan","Angus",""],["Wan","Kwok Ho",""],["Ostmann","Maike",""],["Neville","Alex",""],["Omkar","Srikrishna",""],["Sohbi","Adel",""],["Br\u00e1dler","Kamil",""]]}
{"id":"2308.04193","submitter":"Alessio Borz\\`i","authors":"Alessio Borz\\`i, Victoria Schleis","title":"Linear Degenerate Tropical Flag Varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study linear degenerations of flag varieties from the point of view of\ntropical geometry. We define the linear degenerate flag Dressian and prove a\ncorrespondence between: $(a)$ points in the linear degenerate flag Dressian,\n$(b)$ linear degenerate flags of valuated matroids, $(c)$ linear degenerate\nflags of tropical linear spaces, and $(d)$ morphisms of valuated matroids\narising from projection maps.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:38:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Borz\u00ec","Alessio",""],["Schleis","Victoria",""]]}
{"id":"2308.04194","submitter":"Dale Weigt","authors":"D. M. Weigt, L. A. Ca\\~nizares, S. A. Maloney, S. A. Murray, E. P.\n  Carley, P. T. Gallagher, A. Macario-Rojas, N. Crisp and C. McGrath","title":"The science behind SURROUND: a constellation of CubeSats around the Sun","comments":"12 pages, 3 figures, 2 tables, submitted to Planetary, Solar and\n  Heliospheric Radio Emissions IX, held 26-28 September, 2022 [ACCEPTED];\n  Edited by: C. K. Louis, C. M. Jackman, G. Fischer, A. H. Sulaiman, P. Zucca,\n  Publishers: Dublin Institute for Advanced Studies and Trinity College Dublin.\n  (these authors contributed equally to this work: D. M. Weigt, L. A.\n  Ca\\~nizares)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the greatest challenge facing current space weather monitoring\noperations is forecasting the arrival of coronal mass ejections (CMEs) and\nSolar Energetic Particles (SEPs) within their Earth-Sun propagation timescales.\nCurrent campaigns mainly rely on extreme ultra-violet and white light\nobservations to create forecasts, missing out many potential events that may be\nhazardous to Earth's infrastructure undetectable at these wavelengths. Here we\nintroduce the SURROUND mission, a constellation of CubeSats each with identical\nradio spectrometers, and the results of the initial Phase-0 study for the\nconcept. The main goal of SURROUND is to monitor and track solar radio bursts\n(SRBs), widely utilised as a useful diagnostic for space weather activity, and\nrevolutionise current forecasting capabilities. The Phase-0 study concludes\nthat SURROUND can achieve its mission objectives using 3 - 5 spacecraft using\ncurrent technologies with feasible SEP and CME forecasting potential: a first\nfor heliospheric monitors.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:39:37 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 08:55:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Weigt","D. M.",""],["Ca\u00f1izares","L. A.",""],["Maloney","S. A.",""],["Murray","S. A.",""],["Carley","E. P.",""],["Gallagher","P. T.",""],["Macario-Rojas","A.",""],["Crisp","N.",""],["McGrath","C.",""]]}
{"id":"2308.04195","submitter":"Atindra Pal","authors":"Biswajit Pabi, \\v{S}tep\\'an Marek, Adwitiya Pal, Puja Kumari, Soumya\n  Jyoti Ray, Arunabha Thakur, Richard Koryt\\'ar, and Atindra Nath Pal","title":"Resonant transport in a highly conducting single molecular junction via\n  metal-metal covalent bond","comments":"23 pages, 6 figures, supplementary included","journal-ref":"Nanoscale (2023)","doi":"10.1039/D3NR02585C","report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Achieving highly transmitting molecular junctions through resonant transport\nat low bias is key to the next-generation low-power molecular devices.\nAlthough, resonant transport in molecular junctions was observed by connecting\na molecule between the metal electrodes via chemical anchors by applying a high\nsource-drain bias (> 1V), the conductance was limited to < 0.1 G$_0$, G$_0$\nbeing the quantum of conductance. Here, we report electronic transport\nmeasurements by directly connecting a Ferrocene molecule between Au electrodes\nat the ambient condition in a mechanically controllable break junction setup\n(MCBJ), revealing a conductance peak at ~ 0.2 G$_0$ in the conductance\nhistogram. A similar experiment was repeated for Ferrocene terminated with\namine (-NH2) and cyano (-CN) anchors, where conductance histograms exhibit an\nextended low conductance feature including the sharp high conductance peak,\nsimilar to pristine ferrocene. Statistical analysis of the data along with\ndensity functional theory-based transport calculation suggests the possible\nmolecular conformation with a strong hybridization between the Au electrodes\nand Fe atom of Ferrocene molecule is responsible for a near-perfect\ntransmission in the vicinity of the Fermi energy, leading to the resonant\ntransport at a small applied bias (< 0.5V). Moreover, calculations including\nVan der Waals/dispersion corrections reveal a covalent like organometallic\nbonding between Au and the central Fe atom of Ferrocene, having bond energies\nof ~ 660 meV. Overall, our study not only demonstrates the realization of an\nair-stable highly transmitting molecular junction, but also provides an\nimportant insight about the nature of chemical bonding at the\nmetal/organo-metallic interface.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:40:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pabi","Biswajit",""],["Marek","\u0160tep\u00e1n",""],["Pal","Adwitiya",""],["Kumari","Puja",""],["Ray","Soumya Jyoti",""],["Thakur","Arunabha",""],["Koryt\u00e1r","Richard",""],["Pal","Atindra Nath",""]]}
{"id":"2308.04196","submitter":"Severin Bunk","authors":"Severin Bunk","title":"$\\infty$-Bundles","comments":"24 pages, several diagrams","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT hep-th math-ph math.DG math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Higher bundles are homotopy coherent generalisations of classical fibre\nbundles. They appear in numerous contexts in geometry, topology and physics. In\nparticular, higher principal bundles provide the geometric framework for\nhigher-group gauge theories with higher-form gauge potentials and their\nhigher-dimensional holonomies. An $\\infty$-categorical formulation of higher\nbundles further allows one to identify these objects in contexts outside the\nworlds of smooth manifolds or topological spaces. This article reviews the\ntheory of $\\infty$-bundles, focussing on principal $\\infty$-bundles, and\nsurveys several of their applications. It is an invited contribution to the\nTopology section in the second edition of the Encyclopedia of Mathematical\nPhysics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:42:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bunk","Severin",""]]}
{"id":"2308.04197","submitter":"Hanjun Li","authors":"Hanjun Li, Xiujun Shu, Sunan He, Ruizhi Qiao, Wei Wen, Taian Guo, Bei\n  Gan, Xing Sun","title":"D3G: Exploring Gaussian Prior for Temporal Sentence Grounding with\n  Glance Annotation","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Temporal sentence grounding (TSG) aims to locate a specific moment from an\nuntrimmed video with a given natural language query. Recently, weakly\nsupervised methods still have a large performance gap compared to fully\nsupervised ones, while the latter requires laborious timestamp annotations. In\nthis study, we aim to reduce the annotation cost yet keep competitive\nperformance for TSG task compared to fully supervised ones. To achieve this\ngoal, we investigate a recently proposed glance-supervised temporal sentence\ngrounding task, which requires only single frame annotation (referred to as\nglance annotation) for each query. Under this setup, we propose a Dynamic\nGaussian prior based Grounding framework with Glance annotation (D3G), which\nconsists of a Semantic Alignment Group Contrastive Learning module (SA-GCL) and\na Dynamic Gaussian prior Adjustment module (DGA). Specifically, SA-GCL samples\nreliable positive moments from a 2D temporal map via jointly leveraging\nGaussian prior and semantic consistency, which contributes to aligning the\npositive sentence-moment pairs in the joint embedding space. Moreover, to\nalleviate the annotation bias resulting from glance annotation and model\ncomplex queries consisting of multiple events, we propose the DGA module, which\nadjusts the distribution dynamically to approximate the ground truth of target\nmoments. Extensive experiments on three challenging benchmarks verify the\neffectiveness of the proposed D3G. It outperforms the state-of-the-art weakly\nsupervised methods by a large margin and narrows the performance gap compared\nto fully supervised methods. Code is available at\nhttps://github.com/solicucu/D3G.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:49:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Hanjun",""],["Shu","Xiujun",""],["He","Sunan",""],["Qiao","Ruizhi",""],["Wen","Wei",""],["Guo","Taian",""],["Gan","Bei",""],["Sun","Xing",""]]}
{"id":"2308.04198","submitter":"Xiaoxue Yu","authors":"Xiaoxue Yu, Rongpeng Li, Fei Wang, Chenghui Peng, Chengchao Liang,\n  Zhifeng Zhao, and Honggang Zhang","title":"Communication-Efficient Cooperative Multi-Agent PPO via Regulated\n  Segment Mixture in Internet of Vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-Agent Reinforcement Learning (MARL) has become a classic paradigm to\nsolve diverse, intelligent control tasks like autonomous driving in Internet of\nVehicles (IoV). However, the widely assumed existence of a central node to\nimplement centralized federated learning-assisted MARL might be impractical in\nhighly dynamic scenarios, and the excessive communication overheads possibly\noverwhelm the IoV system. Therefore, in this paper, we design a communication\nefficient cooperative MARL algorithm, named RSM-MAPPO, to reduce the\ncommunication overheads in a fully distributed architecture. In particular,\nRSM-MAPPO enhances the multi-agent Proximal Policy Optimization (PPO) by\nincorporating the idea of segment mixture and augmenting multiple model\nreplicas from received neighboring policy segments. Afterwards, RSM-MAPPO\nadopts a theory-guided metric to regulate the selection of contributive\nreplicas to guarantee the policy improvement. Finally, extensive simulations in\na mixed-autonomy traffic control scenario verify the effectiveness of the\nRSM-MAPPO algorithm.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:50:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yu","Xiaoxue",""],["Li","Rongpeng",""],["Wang","Fei",""],["Peng","Chenghui",""],["Liang","Chengchao",""],["Zhao","Zhifeng",""],["Zhang","Honggang",""]]}
{"id":"2308.04199","submitter":"Tuck Choy","authors":"Tuck C. Choy","title":"A centennial reappraisal of Heisenberg's Quantum Mechanics with a\n  perspective on Einstein's Quantum Riddle","comments":"(This is the preprint of a paper dedicated to the celebration of 100\n  years of quantum mechanics, on the anniversary of Heisenberg's founding paper\n  on the subject in July 1925, to be published in a celebratory volume in July\n  2025 by World Scientific Publications, Singapore)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.hist-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Heisenberg's breakthrough in his July 1925 paper that set in motion the\ndevelopment of Quantum Mechanics through subsequent papers by Born, Jordan,\nHeisenberg and also Dirac (from 1925 to 1927) is reexamined through a modern\nlens. In this paper, we shall discuss some new perspectives on (i) what could\nbe the guiding intuitions for his discoveries and (ii) the origin of the\nBorn-Jordan-Heisenberg canonical quantization rule. From this vantage point we\nmay get an insight into Einstein's Quantum Riddle\n(Lande1974,Sommerfeld1918,Born1926) and a possible glimpse of what might come\nnext after the last 100 years of Heisenberg's quantum mechanics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:59:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Choy","Tuck C.",""]]}
{"id":"2308.04201","submitter":"Samuel Braunfeld","authors":"Samuel Braunfeld","title":"Decidability in geometric grid classes of permutations","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that the basis and the generating function of a geometric grid class\nof permutations Geom$(M)$ are computable from the matrix $M$, as well as some\nvariations on this result. Our main tool is monadic second-order logic on\npermutations and words.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:03:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Braunfeld","Samuel",""]]}
{"id":"2308.04202","submitter":"Marek Czachor","authors":"Marek Czachor","title":"Hidden tensor structures of any quantum mechanical system: Towards\n  single-particle quantum computation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Standard architecture of quantum information processing is based on bottom-up\ndesign: One begins with a one-digit one-particle system, while multi-digit\nquantum registers demand multi-particle configurations, mathematically modeled\nby tensor products of single quantum digits. Here we show that any single\nquantum system is automatically equipped with hidden tensor structures that\nallow for single-particle top-down designs of quantum information processing.\nHidden tensor structures imply that any quantum system, even as simple as a\nsingle one-dimensional harmonic oscillator, can be decomposed into an arbitrary\nnumber of subsystems. The resulting structure is rich enough to enable quantum\ncomputation, violation of Bell's inequalities, and formulation of universal\nquantum gates. In principle, a single-particle quantum computer is possible.\nMoreover, it is shown that these hidden structures are at the roots of some\nwell known theoretical constructions, such as the Brandt-Greenberg multi-boson\nrepresentation of creation-annihilation operators, intensively investigated in\nthe context of higher-order or fractional-order squeezing. In effect, certain\nrather tedious standard proofs known from the literature can be simplified to\nliterally one line. The general construction is illustrated by concrete\nexamples.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:08:15 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 12:59:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Czachor","Marek",""]]}
{"id":"2308.04203","submitter":"Sylvain Attan","authors":"Jules Anitheou, Sylvain Attan and Kinvi Kangni","title":"Deformations of relative Rota-Baxter operators on Hom-Jacobi-Jordan\n  algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Representations of Hom-Jacobi-Jordan algebras are studied. In particular,\nadjoint representations and trivial representations are studied in detail.\nDerivations and central extensions of Hom-Jacobi-Jordan algebras are also\ndiscussed as an application. Morover, we introduce the cohomology theory on\nHom-Jacobi-Jordan algebras as well as the one of relative Rota-Baxter operators\non Hom-Jacobi-Jordan algebras. Finally, we use the cohomological approach to\nstudy deformations of Hom-Jacobi-Jordan algebras and those of relative\nRota-Baxter operators.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:08:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Anitheou","Jules",""],["Attan","Sylvain",""],["Kangni","Kinvi",""]]}
{"id":"2308.04204","submitter":"Hugo Bot\\'os","authors":"Hugo C. Bot\\'os","title":"On the interplay between discrete invariants of complex hyperbolic disc\n  bundles over surfaces","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the relationship between three natural invariants of complex\nhyperbolic disc orbibundles over oriented and closed hyperbolic $2$-orbifolds.\nThese invariants are the Euler characteristic $\\chi$ of the $2$-orbifold, the\nEuler number $e$ of the disc orbibundle, and the Toledo invariant $\\tau$ of a\nfaithful representation of the surface group into $\\mathrm{PU}(2,1)$ attached\nto the complex hyperbolic structure of the disc orbibundle. Based on previous\nexamples, we conjecture that $-3|\\tau| = 2e+2\\chi$ always holds. For complex\nhyperbolic disc orbibundles over $2$-orbifolds derived from quadrangles of\nbisectors via tessellation, we prove that $3\\tau = 2e+2\\chi$. Furthermore, we\ndemonstrate that $-3|\\tau| = 2e+2\\chi$ holds when a section with no complex\ntangent planes is present.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:08:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bot\u00f3s","Hugo C.",""]]}
{"id":"2308.04205","submitter":"Bowei He","authors":"Bowei He, Yinan Mao, Shiji Zhou, Chen Ma, Zhi Wang","title":"Collaborative Edge Caching: a Meta Reinforcement Learning Approach with\n  Edge Sampling","comments":"Published on IEEE International Conference on Multimedia and Expo\n  2023 (ICME2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current learning-based edge caching schemes usually suffer from dynamic\ncontent popularity, e.g., in the emerging short video platforms, users' request\npatterns shift significantly over time and across different edges. An intuitive\nsolution for a specific local edge cache is to collect more request histories\nfrom other edge caches. However, uniformly merging these request histories may\nnot perform satisfactorily due to heterogeneous content distributions on\ndifferent edges. To solve this problem, we propose a collaborative edge caching\nframework. First, we design a meta-learning-based collaborative strategy to\nguarantee that the local model can timely meet the continually changing content\npopularity. Then, we design an edge sampling method to select more \"valuable\"\nneighbor edges to participate in the local training. To evaluate the proposed\nframework, we conduct trace-driven experiments to demonstrate the effectiveness\nof our design: it improves the average cache hit rate by up to $10.12\\%$\n(normalized) compared with other baselines.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:11:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["He","Bowei",""],["Mao","Yinan",""],["Zhou","Shiji",""],["Ma","Chen",""],["Wang","Zhi",""]]}
{"id":"2308.04206","submitter":"Jiannan Wu","authors":"Jiannan Wu, Yi Jiang, Bin Yan, Huchuan Lu, Zehuan Yuan, Ping Luo","title":"Exploring Transformers for Open-world Instance Segmentation","comments":"Accepted by ICCV2023. 16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open-world instance segmentation is a rising task, which aims to segment all\nobjects in the image by learning from a limited number of base-category\nobjects. This task is challenging, as the number of unseen categories could be\nhundreds of times larger than that of seen categories. Recently, the DETR-like\nmodels have been extensively studied in the closed world while stay unexplored\nin the open world. In this paper, we utilize the Transformer for open-world\ninstance segmentation and present SWORD. Firstly, we introduce to attach the\nstop-gradient operation before classification head and further add IoU heads\nfor discovering novel objects. We demonstrate that a simple stop-gradient\noperation not only prevents the novel objects from being suppressed as\nbackground, but also allows the network to enjoy the merit of heuristic label\nassignment. Secondly, we propose a novel contrastive learning framework to\nenlarge the representations between objects and background. Specifically, we\nmaintain a universal object queue to obtain the object center, and dynamically\nselect positive and negative samples from the object queries for contrastive\nlearning. While the previous works only focus on pursuing average recall and\nneglect average precision, we show the prominence of SWORD by giving\nconsideration to both criteria. Our models achieve state-of-the-art performance\nin various open-world cross-category and cross-dataset generalizations.\nParticularly, in VOC to non-VOC setup, our method sets new state-of-the-art\nresults of 40.0% on ARb100 and 34.9% on ARm100. For COCO to UVO generalization,\nSWORD significantly outperforms the previous best open-world model by 5.9% on\nAPm and 8.1% on ARm100.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:12:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wu","Jiannan",""],["Jiang","Yi",""],["Yan","Bin",""],["Lu","Huchuan",""],["Yuan","Zehuan",""],["Luo","Ping",""]]}
{"id":"2308.04207","submitter":"Chao Wang","authors":"Ting Wang, Xiaotong Wu, Jizhou Li, Chao Wang","title":"Robust retrieval of material chemical states in X-ray microspectroscopy","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  X-ray microspectroscopic techniques are essential for studying morphological\nand chemical changes in materials, providing high-resolution structural and\nspectroscopic information. However, its practical data analysis for reliably\nretrieving the chemical states remains a major obstacle to accelerating the\nfundamental understanding of materials in many research fields. In this work,\nwe propose a novel data formulation model for X-ray microspectroscopy and\ndevelop a dedicated unmixing framework to solve this problem, which is robust\nto noise and spectral variability. Moreover, this framework is not limited to\nthe analysis of two-state material chemistry, making it an effective\nalternative to conventional and widely-used methods. In addition, an\nalternative directional multiplier method with provable convergence is applied\nto obtain the solution efficiently. Our framework can accurately identify and\ncharacterize chemical states in complex and heterogeneous samples, even under\nchallenging conditions such as low signal-to-noise ratios and overlapping\nspectral features. Extensive experimental results on simulated and real\ndatasets demonstrate its effectiveness and reliability.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:17:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Ting",""],["Wu","Xiaotong",""],["Li","Jizhou",""],["Wang","Chao",""]]}
{"id":"2308.04208","submitter":"Benharrat Belaidi","authors":"Benharrat Bela\\\"idi and Tanmay Biswas","title":"Growth of $(\\alpha ,\\beta ,\\gamma )$-order solutions of linear\n  differential equations with entire coefficients","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main aim of this paper is to study the growth of solutions of higher\norder linear differential equations using the concepts of $(\\alpha ,\\beta\n,\\gamma )$-order and $(\\alpha ,\\beta ,\\gamma )$-type. We obtain some results\nwhich improve and generalize some previous results of Kinnunen \\cite{13}, Long\net al. \\cite{L} as well as Bela\\\"{\\i}di \\cite{b3}, \\cite{b5}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:17:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bela\u00efdi","Benharrat",""],["Biswas","Tanmay",""]]}
{"id":"2308.04209","submitter":"Atticus Stonestrom","authors":"Atticus Stonestrom","title":"Torsion-free and distal dp-minimal groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a dp-minimal group. We discuss two different hypotheses on $G$;\nfirst we show that, if $G$ is torsion-free, then it is abelian. Then we\ninvestigate the structure of $G$ when it admits a distal f-generic type,\nshowing in particular that the quotient of $G$ by its FC-center can then be\nnaturally equipped with the structure of a valued group. As an application of\nthis, we show that, in this case, $G$ is virtually nilpotent.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:19:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Stonestrom","Atticus",""]]}
{"id":"2308.04210","submitter":"Damien Calaque","authors":"Damien Calaque","title":"Derived symplectic geometry","comments":"Review paper. This is an invited contribution to the 2nd edition of\n  the Encyclopedia of Mathematical Physics. V2: minor corrections","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is an invited contribution to the 2nd edition of the Encyclopedia of\nMathematical Physics, that provides a very short survey of derived symplectic\ngeometry.\n  Derived symplectic geometry studies symplectic structures on derived stacks.\nDerived stacks are the main players in derived geometry, the purpose of which\nis to deal with singular spaces, while symplectic structures are an essential\ningredient of the geometric formalism of classical mechanics and classical\nfield theory. In addition to providing an overview of a relatively young field\nof research, we provide a case study on Casson's invariant.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:20:07 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 14:07:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Calaque","Damien",""]]}
{"id":"2308.04211","submitter":"Janaka Adassuriya","authors":"S. Gunasekera, J. Adassuriya, I. Madagangoda, K. Werellapatha, K.P.S.C\n  Jayaratne","title":"Spectroscopic observations of novae V1065 CEN and V1280 SCO using 45 cm\n  cassegrain telescope at Arthur C Clarke Institute","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The spectroscopic observations of two novae namely V1065 CEN and V1280 SCO\nwere made by 45 cm Cassegrain telescope in high resolution\n($\\lambda/\\delta\\lambda$=22000) at H$\\alpha$ (6563 \\r{A}) region. V1065 CEN is\nHe/N-type spectra which characterize a broad (Gaussian FWHM 49 \\r{A}), saddle\nshaped and asymmetric H$\\alpha$ emission line without prominent P-Cyg\nabsorption component. Completely different H$\\alpha$ profile of V1280 SCO shows\nprominent P-Cyg absorption and narrow emission line (Gaussian FWHM 26 \\r{A})\nwhich can be classified as Fe II type nova. The expansion velocities of these\ntwo systems measured from the minima of the P-Cyg profiles are close to 2300\nkm/s for V1065 CEN, and 716 km/s for V1280 SCO. Based on the photometric\nanalysis, the Nova V1065 CEN can be classified as fast (11$<$t${_2}$$<$25)\nnova. The derived absolute magnitudes at maximum for nova V1065 CEN to be\nM$_{o,V}$ = -7.58$\\pm$0.18 and M$_{o,B}$= -7.75$\\pm$0.25 correspond to a\ndistance 8.51$\\pm$0.33 kpc. The parameters t$_{2V}$=12 days and t$_{3V}$=14\ndays of nova V1280 SCO determine that the nova is in between very fast and fast\nnova. The mean absolute magnitude at maximum is calculated to be\nM$_{o,V}$=-8.7$\\pm$0.1 and the estimated distance to the nova V1280 SCO is\n3.2$\\pm$0.2 kpc.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:20:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gunasekera","S.",""],["Adassuriya","J.",""],["Madagangoda","I.",""],["Werellapatha","K.",""],["Jayaratne","K. P. S. C",""]]}
{"id":"2308.04212","submitter":"Seyoung Park","authors":"Seyoung Park, Eun Ryung Lee, Hyokyoung G. Hong","title":"Varying-coefficients for regional quantile via KNN-based LASSO with\n  applications to health outcome study","comments":null,"journal-ref":null,"doi":"10.1002/sim.9839","report-no":null,"categories":"stat.ML cs.LG stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Health outcomes, such as body mass index and cholesterol levels, are known to\nbe dependent on age and exhibit varying effects with their associated risk\nfactors. In this paper, we propose a novel framework for dynamic modeling of\nthe associations between health outcomes and risk factors using\nvarying-coefficients (VC) regional quantile regression via K-nearest neighbors\n(KNN) fused Lasso, which captures the time-varying effects of age. The proposed\nmethod has strong theoretical properties, including a tight estimation error\nbound and the ability to detect exact clustered patterns under certain\nregularity conditions. To efficiently solve the resulting optimization problem,\nwe develop an alternating direction method of multipliers (ADMM) algorithm. Our\nempirical results demonstrate the efficacy of the proposed method in capturing\nthe complex age-dependent associations between health outcomes and their risk\nfactors.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:22:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Park","Seyoung",""],["Lee","Eun Ryung",""],["Hong","Hyokyoung G.",""]]}
{"id":"2308.04213","submitter":"Ami Paz","authors":"Hagit Attiya, Pierre Fraigniaud, Ami Paz, and Sergio Rajsbaum","title":"One Step Forward, One Step Back: FLP-Style Proofs and the\n  Round-Reduction Technique for Colorless Tasks","comments":"To appear in DISC'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper compares two generic techniques for deriving lower bounds and\nimpossibility results in distributed computing. First, we prove a speedup\ntheorem (a-la Brandt, 2019), for wait-free colorless algorithms, aiming at\ncapturing the essence of the seminal round-reduction proof establishing a lower\nbound on the number of rounds for 3-coloring a cycle (Linial, 1992), and going\nby backward induction. Second, we consider FLP-style proofs, aiming at\ncapturing the essence of the seminal consensus impossibility proof (Fischer,\nLynch, and Paterson, 1985) and using forward induction.\n  We show that despite their very different natures, these two forms of proof\nare tightly connected. In particular, we show that for every colorless task\n$\\Pi$, if there is a round-reduction proof establishing the impossibility of\nsolving $\\Pi$ using wait-free colorless algorithms, then there is an FLP-style\nproof establishing the same impossibility. For 1-dimensional colorless tasks\n(for an arbitrary number $n\\geq 2$ of processes), we prove that the two proof\ntechniques have exactly the same power, and more importantly, both are\ncomplete: if a 1-dimensional colorless task is not wait-free solvable by $n\\geq\n2$ processes, then the impossibility can be proved by both proof techniques.\nMoreover, a round-reduction proof can be automatically derived, and an\nFLP-style proof can be automatically generated from it.\n  Finally, we illustrate the use of these two techniques by establishing the\nimpossibility of solving any colorless covering task of arbitrary dimension by\nwait-free algorithms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:25:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Attiya","Hagit",""],["Fraigniaud","Pierre",""],["Paz","Ami",""],["Rajsbaum","Sergio",""]]}
{"id":"2308.04214","submitter":"arXiv Admin","authors":"Bruno Rucy Carneiro Alves de Lima, Merlin Kramer and Kalmer Apinis","title":"A Differential Datalog Interpreter","comments":"This version has been removed by arXiv administrators, as we were\n  obligated to do, due to claimed copyright infringement by a third party","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.AI cs.PL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The core reasoning task for datalog engines is materialization, the\nevaluation of a datalog program over a database alongside its physical\nincorporation into the database itself. The de-facto method of computing it, is\nthrough the recursive application of inference rules. Due to it being a costly\noperation, it is a must for datalog engines to provide incremental\nmaterialization, that is, to adjust the computation to new data, instead of\nrestarting from scratch. One of the major caveats, is that deleting data is\nnotoriously more involved than adding, since one has to take into account all\npossible data that has been entailed from what is being deleted. Differential\nDataflow is a computational model that provides efficient incremental\nmaintenance, notoriously with equal performance between additions and\ndeletions, and work distribution, of iterative dataflows. In this paper we\ninvestigate the performance of materialization with three reference datalog\nimplementations, out of which one is built on top of a lightweight relational\nengine, and the two others are differential-dataflow and non-differential\nversions of the same rewrite algorithm, with the same optimizations.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:48:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["de Lima","Bruno Rucy Carneiro Alves",""],["Kramer","Merlin",""],["Apinis","Kalmer",""]]}
{"id":"2308.04215","submitter":"Menglin Xia","authors":"Xuchao Zhang, Menglin Xia, Camille Couturier, Guoqing Zheng, Saravan\n  Rajmohan, Victor Ruhle","title":"Hybrid Retrieval-Augmented Generation for Real-time Composition\n  Assistance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.DC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Retrieval augmented models show promise in enhancing traditional language\nmodels by improving their contextual understanding, integrating private data,\nand reducing hallucination. However, the processing time required for retrieval\naugmented large language models poses a challenge when applying them to tasks\nthat require real-time responses, such as composition assistance.\n  To overcome this limitation, we propose the Hybrid Retrieval-Augmented\nGeneration (HybridRAG) framework that leverages a hybrid setting that combines\nboth client and cloud models. HybridRAG incorporates retrieval-augmented memory\ngenerated asynchronously by a Large Language Model (LLM) in the cloud. By\nintegrating this retrieval augmented memory, the client model acquires the\ncapability to generate highly effective responses, benefiting from the LLM's\ncapabilities. Furthermore, through asynchronous memory integration, the client\nmodel is capable of delivering real-time responses to user requests without the\nneed to wait for memory synchronization from the cloud. Our experiments on\nWikitext and Pile subsets show that HybridRAG achieves lower latency than a\ncloud-based retrieval-augmented LLM, while outperforming client-only models in\nutility.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:27:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Xuchao",""],["Xia","Menglin",""],["Couturier","Camille",""],["Zheng","Guoqing",""],["Rajmohan","Saravan",""],["Ruhle","Victor",""]]}
{"id":"2308.04216","submitter":"Animesh Jana","authors":"Shyam Sundar Ghoshal, Animesh Jana","title":"On blow up of $C^1$ solutions of isentropic Euler system","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 study the break-down of smooth and continuous solution to\nisentropic Euler system in multi dimension. Sideris [Comm. Math. Phys. 1985]\nproved the blow up of smooth solutions when initial data satisfies an `integral\ncondition'. We show that a $C^1$ solution of isentropic Euler equation breaks\ndown if (i) gradient of initial velocity has an eigenvalue with negative\nreal-part at some point $x_0\\in\\mathbb{R}^d$ and (ii) Hessian of initial\ndensity satisfies a smallness condition in Sobolev space. Our proof also works\nfor the data which fails to satisfy the above-mentioned `integral condition'.\nFurther, we prove the global existence of smooth solution when (i) gradient of\ninitial velocity has an eigenvalue with non-negative real-part in whole\n$\\mathbb{R}^d$ and (ii) initial density satisfies a smallness condition. This\nextends the global existence result of [Grassin, Indiana Univ. Math. J. 1998].\nAnother goal of this article is to study the breakdown of continuous weak\nsolutions of isentropic Euler equations. We are able to show that the `integral\ncondition' of Sideris can cause the breakdown of continuous solutions in finite\ntime. This improves the blow up result of Sideris from $C^1$ to continuous\nspace.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:27:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ghoshal","Shyam Sundar",""],["Jana","Animesh",""]]}
{"id":"2308.04217","submitter":"Peter Stoffer","authors":"Gilberto Colangelo, Martin Hoferichter, Peter Stoffer","title":"Puzzles in the hadronic contributions to the muon anomalous magnetic\n  moment","comments":"12 pages, 1 figure, proceedings for \"21st Conference on Flavor\n  Physics and CP Violation,\" \"Les Rencontres de Physique de la Vall\\'ee\n  d'Aoste,\" and \"New Frontiers in Lepton Flavor\"","journal-ref":null,"doi":null,"report-no":"PSI-PR-23-28, ZH-TH 42/23","categories":"hep-ph hep-ex hep-lat nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We summarize recent developments in the Standard-Model evaluation of the\nanomalous magnetic moment of the muon $a_\\mu$, both in the\nhadronic-light-by-light and hadronic-vacuum-polarization contributions. The\ncurrent situation for the latter is puzzling as we are confronted with multiple\ndiscrepancies that are not yet understood. We present updated fits of a\ndispersive representation of the pion vector form factor to the new CMD-3 data\nset and quantify the tensions with the other high-statistics\n$e^+e^-\\to\\pi^+\\pi^-$ experiments in the contribution to $a_\\mu$ in the energy\nrange up to 1 GeV, as well as in the corresponding contribution to the\nintermediate Euclidean window.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:28:22 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Colangelo","Gilberto",""],["Hoferichter","Martin",""],["Stoffer","Peter",""]]}
{"id":"2308.04218","submitter":"Muduo Xu","authors":"Muduo Xu, Jianhao Su, Yutao Liu","title":"AquaSAM: Underwater Image Foreground 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 Segment Anything Model (SAM) has revolutionized natural image\nsegmentation, nevertheless, its performance on underwater images is still\nrestricted. This work presents AquaSAM, the first attempt to extend the success\nof SAM on underwater images with the purpose of creating a versatile method for\nthe segmentation of various underwater targets. To achieve this, we begin by\nclassifying and extracting various labels automatically in SUIM dataset.\nSubsequently, we develop a straightforward fine-tuning method to adapt SAM to\ngeneral foreground underwater image segmentation. Through extensive experiments\ninvolving eight segmentation tasks like human divers, we demonstrate that\nAquaSAM outperforms the default SAM model especially at hard tasks like coral\nreefs. AquaSAM achieves an average Dice Similarity Coefficient (DSC) of 7.13\n(%) improvement and an average of 8.27 (%) on mIoU improvement in underwater\nsegmentation tasks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:30:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xu","Muduo",""],["Su","Jianhao",""],["Liu","Yutao",""]]}
{"id":"2308.04219","submitter":"Yangrui Chen","authors":"Yangrui Chen and Jie Zhang","title":"Anomalous large-scale collective motion in granular Brownian vibrators","comments":"arXiv admin note: text overlap with arXiv:2301.06377","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using Brownian vibrators, we conducted a study on the structures and dynamics\nof quasi-2d granular materials with packing fractions ($\\phi$) ranging from\n0.111 to 0.832. Our observations revealed a remarkable large-scale collective\nmotion in hard granular disk systems, encompassing four distinct phases:\ngranular fluid, collective fluid, poly-crystal, and crystal. The collective\nmotion emerge at $\\phi=$0.317, coinciding with a peak in local density\nfluctuations. However, this collective motion ceased to exist at $\\phi=$0.713\nwhen the system transitioned into a crystalline state. While the poly-crystal\nand crystal phases exhibited similarities to equilibrium hard disks, the first\ntwo phases differed significantly from the equilibrium systems and previous\nexperiments involving uniformly driven spheres. This disparity suggests that\nthe collective motion arises from a competition controlled by volume fraction.\nSpecifically, it involves an active force and an effective attractive\ninteraction resulting from inelastic particle collisions. Remarkably, these\nfindings align with recent theoretical research on the flocking motion of\nspherical active particles without alignment mechanisms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:34:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Yangrui",""],["Zhang","Jie",""]]}
{"id":"2308.04220","submitter":"Efimia Panagiotaki","authors":"Efimia Panagiotaki, Daniele De Martini, Lars Kunze","title":"Semantic Interpretation and Validation of Graph Attention-based\n  Explanations for GNN Models","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CY cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we propose a methodology for investigating the application of\nsemantic attention to enhance the explainability of Graph Neural Network\n(GNN)-based models, introducing semantically-informed perturbations and\nestablishing a correlation between predicted feature-importance weights and\nmodel accuracy. Graph Deep Learning (GDL) has emerged as a promising field for\ntasks like scene interpretation, leveraging flexible graph structures to\nconcisely describe complex features and relationships. As traditional\nexplainability methods used in eXplainable AI (XAI) cannot be directly applied\nto such structures, graph-specific approaches are introduced. Attention\nmechanisms have demonstrated their efficacy in estimating the importance of\ninput features in deep learning models and thus have been previously employed\nto provide feature-based explanations for GNN predictions. Building upon these\ninsights, we extend existing attention-based graph-explainability methods\ninvestigating the use of attention weights as importance indicators of\nsemantically sorted feature sets. Through analysing the behaviour of predicted\nattention-weights distribution in correlation with model accuracy, we gain\nvaluable insights into feature importance with respect to the behaviour of the\nGNN model. We apply our methodology to a lidar pointcloud estimation model\nsuccessfully identifying key semantic classes that contribute to enhanced\nperformance effectively generating reliable post-hoc semantic explanations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:34:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Panagiotaki","Efimia",""],["De Martini","Daniele",""],["Kunze","Lars",""]]}
{"id":"2308.04221","submitter":"Bogdan Malaescu","authors":"Michel Davier, Zoltan Fodor, Antoine Gerardin, Laurent Lellouch,\n  Bogdan Malaescu, Finn M. Stokes, Kalman K. Szabo, Balint C. Toth, Lukas\n  Varnhorst, Zhiqing Zhang","title":"Hadronic vacuum polarization: comparing lattice QCD and data-driven\n  results in systematically improvable ways","comments":"38 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The precision with which hadronic vacuum polarization (HVP) is obtained\ndetermines how accurately important observables, such as the muon anomalous\nmagnetic moment, a_\\mu, or the low-energy running of the electromagnetic\ncoupling, \\alpha, are predicted. The two most precise approaches for\ndetermining HVP are: dispersive relations combined with e+e- to hadrons\ncross-section data, and lattice QCD. However, the results obtained in these two\napproaches display significant tensions, whose origins are not understood. Here\nwe present a framework that sheds light on this issue and, if the two\napproaches can be reconciled, allows them to be combined. Via this framework,\nwe test the hypothesis that the tensions can be explained by modifying the\nR-ratio in different intervals of center-of-mass energy sqrt(s). As\ningredients, we consider observables that have been precisely determined in\nboth approaches. These are the leading hadronic contributions to a_\\mu, to the\nso-called intermediate window observable and to the running of \\alpha between\nspacelike virtualities 1GeV^2 and 10GeV^2 (for which only a preliminary lattice\nresult exists). Our tests take into account all uncertainties and correlations,\nas well as uncertainties on uncertainties in the lattice results. Among our\nfindings, the most striking is that results obtained in the two approaches can\nbe made to agree for all three observables by modifying the \\rho peak in the\nexperimental spectrum. In particular, we find that this requires a common ~5\\%\nincrease in the contributions of the peak to each of the three observables.\nThis finding is robust against the presence or absence of one of the\nconstraining observables. However, such an increase is much larger than the\nuncertainties on the measured R-ratio. We also discuss a variety of\ngeneralizations of the methods used here, as well as the limits in the\ninformation that can be extracted...\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:37:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Davier","Michel",""],["Fodor","Zoltan",""],["Gerardin","Antoine",""],["Lellouch","Laurent",""],["Malaescu","Bogdan",""],["Stokes","Finn M.",""],["Szabo","Kalman K.",""],["Toth","Balint C.",""],["Varnhorst","Lukas",""],["Zhang","Zhiqing",""]]}
{"id":"2308.04222","submitter":"Stefan Zetzsche","authors":"Stefan Zetzsche","title":"Canonical Algebraic Generators in Automata Learning","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many methods for the verification of complex computer systems require the\nexistence of a tractable mathematical abstraction of the system, often in the\nform of an automaton. In reality, however, such a model is hard to come up\nwith, in particular manually. Automata learning is a technique that can\nautomatically infer an automaton model from a system -- by observing its\nbehaviour. The majority of automata learning algorithms is based on the\nso-called L* algorithm. The acceptor learned by L* has an important property:\nit is canonical, in the sense that, it is, up to isomorphism, the unique\ndeterministic finite automaton of minimal size accepting a given regular\nlanguage. Establishing a similar result for other classes of acceptors, often\nwith side-effects, is of great practical importance. Non-deterministic finite\nautomata, for instance, can be exponentially more succinct than deterministic\nones, allowing verification to scale. Unfortunately, identifying a canonical\nsize-minimal non-deterministic acceptor of a given regular language is in\ngeneral not possible: it can happen that a regular language is accepted by two\nnon-isomorphic non-deterministic finite automata of minimal size. In\nparticular, it thus is unclear which one of the automata should be targeted by\na learning algorithm. In this thesis, we further explore the issue and identify\n(sub-)classes of acceptors that admit canonical size-minimal representatives.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:37:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zetzsche","Stefan",""]]}
{"id":"2308.04223","submitter":"Yiming Fei","authors":"Yiming Fei, Jiangang Li, Yanan Li","title":"Real-Time Progressive Learning: Mutually Reinforcing Learning and\n  Control with Neural-Network-Based Selective Memory","comments":"16 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.NE cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Memory, as the basis of learning, determines the storage, update and\nforgetting of the knowledge and further determines the efficiency of learning.\nFeatured with a mechanism of memory, a radial basis function neural network\n(RBFNN) based learning control scheme named real-time progressive learning\n(RTPL) is proposed to learn the unknown dynamics of the system with guaranteed\nstability and closed-loop performance. Instead of the stochastic gradient\ndescent (SGD) update law in adaptive neural control (ANC), RTPL adopts the\nselective memory recursive least squares (SMRLS) algorithm to update the\nweights of the RBFNN. Through SMRLS, the approximation capabilities of the\nRBFNN are uniformly distributed over the feature space and thus the passive\nknowledge forgetting phenomenon of SGD method is suppressed. Subsequently, RTPL\nachieves the following merits over the classical ANC: 1) guaranteed learning\ncapability under low-level persistent excitation (PE), 2) improved learning\nperformance (learning speed, accuracy and generalization capability), and 3)\nlow gain requirement ensuring robustness of RTPL in practical applications.\nMoreover, the RTPL based learning and control will gradually reinforce each\nother during the task execution, making it appropriate for long-term learning\ncontrol tasks. As an example, RTPL is used to address the tracking control\nproblem of a class of nonlinear systems with RBFNN being an adaptive\nfeedforward controller. Corresponding theoretical analysis and simulation\nstudies demonstrate the effectiveness of RTPL.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:39:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fei","Yiming",""],["Li","Jiangang",""],["Li","Yanan",""]]}
{"id":"2308.04224","submitter":"Wang Yao","authors":"Wang Yao, Muhammad Ali Farooq, Joseph Lemley and Peter Corcoran","title":"Will your Doorbell Camera still recognize you as you grow old","comments":"The Paper is accepted in 25th Irish Machine Vision and Image\n  Processing Conference (IMVIP23)","journal-ref":null,"doi":"10.5281/zenodo.8208368","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robust authentication for low-power consumer devices such as doorbell cameras\nposes a valuable and unique challenge. This work explores the effect of age and\naging on the performance of facial authentication methods. Two public age\ndatasets, AgeDB and Morph-II have been used as baselines in this work. A\nphoto-realistic age transformation method has been employed to augment a set of\nhigh-quality facial images with various age effects. Then the effect of these\nsynthetic aging data on the high-performance deep-learning-based face\nrecognition model is quantified by using various metrics including Receiver\nOperating Characteristic (ROC) curves and match score distributions.\nExperimental results demonstrate that long-term age effects are still a\nsignificant challenge for the state-of-the-art facial authentication method.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:43:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yao","Wang",""],["Farooq","Muhammad Ali",""],["Lemley","Joseph",""],["Corcoran","Peter",""]]}
{"id":"2308.04225","submitter":"Michael Kuhlmann","authors":"Michael Kuhlmann, Adrian Meise, Fritz Seebauer, Petra Wagner and\n  Reinhold Haeb-Umbach","title":"Investigating Speaker Embedding Disentanglement on Natural Read Speech","comments":"To be published at 15th ITG conference on speech communication","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Disentanglement is the task of learning representations that identify and\nseparate factors that explain the variation observed in data. Disentangled\nrepresentations are useful to increase the generalizability, explainability,\nand fairness of data-driven models. Only little is known about how well such\ndisentanglement works for speech representations. A major challenge when\ntackling disentanglement for speech representations are the unknown generative\nfactors underlying the speech signal. In this work, we investigate to what\ndegree speech representations encoding speaker identity can be disentangled. To\nquantify disentanglement, we identify acoustic features that are highly\nspeaker-variant and can serve as proxies for the factors of variation\nunderlying speech. We find that disentanglement of the speaker embedding is\nlimited when trained with standard objectives promoting disentanglement but can\nbe improved over vanilla representation learning to some extent.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:43:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kuhlmann","Michael",""],["Meise","Adrian",""],["Seebauer","Fritz",""],["Wagner","Petra",""],["Haeb-Umbach","Reinhold",""]]}
{"id":"2308.04226","submitter":"Vahid Sadiri Javadi","authors":"Vahid Sadiri Javadi, Martin Potthast, Lucie Flek","title":"OpinionConv: Conversational Product Search with Grounded Opinions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL cs.IR cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  When searching for products, the opinions of others play an important role in\nmaking informed decisions. Subjective experiences about a product can be a\nvaluable source of information. This is also true in sales conversations, where\na customer and a sales assistant exchange facts and opinions about products.\nHowever, training an AI for such conversations is complicated by the fact that\nlanguage models do not possess authentic opinions for their lack of real-world\nexperience. We address this problem by leveraging product reviews as a rich\nsource of product opinions to ground conversational AI in true subjective\nnarratives. With OpinionConv, we develop the first conversational AI for\nsimulating sales conversations. To validate the generated conversations, we\nconduct several user studies showing that the generated opinions are perceived\nas realistic. Our assessors also confirm the importance of opinions as an\ninformative basis for decision-making.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:45:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Javadi","Vahid Sadiri",""],["Potthast","Martin",""],["Flek","Lucie",""]]}
{"id":"2308.04227","submitter":"Valentina Bais","authors":"Valentina Bais and Rafael Torres","title":"Smooth structures on non-orientable $4$-manifolds via twisting\n  operations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Four observations compose the main results of this note. The first records\nthe existence of a smoothly embedded 2-sphere $S$ inside $\\mathbb{R} P^2\\times\nS^2$ such that performing a Gluck twist on $S$ produces a manifold $Y$ that is\nhomeomorphic but not diffeomorphic to the total space of the non-trivial\n2-sphere bundle over the real projective plane $S(2\\gamma \\oplus \\mathbb{R})$.\nThe second observation is that there is a 5-dimensional cobordism with a single\n2-handle between the 4-manifold $Y$ and a mapping torus that was used by\nCappell-Shaneson to construct an exotic $\\mathbb{R} P^4$. This construction of\n$Y$ is similar to the one of the Cappell-Shaneson homotopy 4-spheres. The third\nobservation is that twisting an embedded real projective plane inside $Y$\nproduces a manifold that is homeomorphic but not diffeomorphic to the circle\nsum of two copies of $\\mathbb{R}P^4$. Knotting phenomena of 2-spheres in\nnon-orientable 4-manifolds that stands in glaring contrast with known phenomena\nin the orientable domain is pointed out in the fourth observation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:48:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bais","Valentina",""],["Torres","Rafael",""]]}
{"id":"2308.04228","submitter":"Thomas Feuillen","authors":"Thomas Feuillen, Amirafshar Moshtaghpour","title":"Proceedings of the first edition of the International Symposium on\n  Computational Sensing (ISCS23)","comments":"This is the proceedings of the first edition of ISCS which took place\n  in June 2023 in Luxembourg city. More info at ISCS2023.com","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The International Symposium on Computational Sensing (ISCS) brings together\nresearchers from optical microscopy, electron microscopy, RADAR, astronomical\nimaging, biomedical imaging, remote sensing, and signal processing. With a\nparticular focus on applications and demonstrators, the purpose of this\nsymposium is to be a forum where researchers in computational sensing working\nin seemingly unrelated applications can learn, discover, and exchange on their\nnew findings and challenges. This 3-day symposium in the heart of Europe\nfeatures 6 keynotes speakers and is open to extended abstracts for scientific\npresentations and show-and-tell demonstrations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:49:15 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:43:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Feuillen","Thomas",""],["Moshtaghpour","Amirafshar",""]]}
{"id":"2308.04229","submitter":"Benjamin Ward","authors":"Benjamin C. Ward","title":"Stirling Decomposition of Graph Homology in Genus 1","comments":"to appear in Contemp. Math","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that commutative graph homology in genus $g=1$ with $n\\geq 3$\nmarkings has a direct sum decomposition whose summands have rank given by\nStirling numbers of the first kind. These summands are computed as the homology\nof complexes of certain decorated trees. This paper was written with a\nnon-expert audience in mind, and an emphasis is placed on an elementary\ncombinatorial description of these decorated tree complexes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:52:18 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ward","Benjamin C.",""]]}
{"id":"2308.04230","submitter":"Hiroaki Shishido","authors":"Hiroaki Shishido, Yuta Hosaka, Kenta Monden, Akito Inui, Taisei Sayo,\n  Yusuke Kousaka, Yoshihiko Togawa","title":"Spin polarization gate device based on the chirality-induced spin\n  selectivity and robust nonlocal spin polarization","comments":"8 pages, 8 figures","journal-ref":"The Journal of Chemical Physics 159, 064502 (2023)","doi":"10.1063/5.0156505","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nonlocal spin polarization phenomena are thoroughly investigated in the\ndevices made of chiral metallic single crystals of CrNb$_3$S$_6$ and NbSi$_2$\nas well as of polycrystalline NbSi$_2$. We demonstrate that simultaneous\ninjection of charge currents in the opposite ends of the device with the\nnonlocal setup induces the switching behavior of spin polarization in a\ncontrollable manner. Such a nonlocal spin polarization appears regardless of\nthe difference in the materials and device dimensions, implying that the\ncurrent injection in the nonlocal configuration splits spin-dependent chemical\npotentials throughout the chiral crystal even though the current is injected\ninto only a part of the crystal. We show that the proposed model of the spin\ndependent chemical potentials explains the experimental data successfully. The\nnonlocal double-injection device may offer significant potential to control the\nspin polarization to large areas because of the nature of long-range nonlocal\nspin polarization in chiral materials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:53:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shishido","Hiroaki",""],["Hosaka","Yuta",""],["Monden","Kenta",""],["Inui","Akito",""],["Sayo","Taisei",""],["Kousaka","Yusuke",""],["Togawa","Yoshihiko",""]]}
{"id":"2308.04231","submitter":"Dounya Kechiche","authors":"Dounya Kechiche and Ammar Khemmoudj","title":"Stabilization of piezoelectric beam with coleman or pipkin gurtin\n  thermal law and under lorenz gauge condition","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 analysis of stability of piezoelectric beam\nsubject to a thermal law (Coleman or Pipkin Gurtin thermal law) adding some\ndamping mechanism to the electric field in x direction and z direction, then we\ndiscuss several cases. The exponential stability take place when the beam is\nsubjected to a Coleman Gurtin law, otherwise a polynomial stability is\nestablished with Gurtin Pipkin thermal law in case when the electrical field\ncomponents are damped.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:54:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kechiche","Dounya",""],["Khemmoudj","Ammar",""]]}
{"id":"2308.04232","submitter":"Wang Yao","authors":"Wang Yao, Muhammad Ali Farooq, Joseph Lemley, Peter Corcoran","title":"A Comparative Study of Image-to-Image Translation Using GANs for\n  Synthetic Child Race Data","comments":"The Paper is accepted in 25th Irish Machine Vision and Image\n  Processing Conference (IMVIP23)","journal-ref":null,"doi":"10.5281/zenodo.8208491","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The lack of ethnic diversity in data has been a limiting factor of face\nrecognition techniques in the literature. This is particularly the case for\nchildren where data samples are scarce and presents a challenge when seeking to\nadapt machine vision algorithms that are trained on adult data to work on\nchildren. This work proposes the utilization of image-to-image transformation\nto synthesize data of different races and thus adjust the ethnicity of\nchildren's face data. We consider ethnicity as a style and compare three\ndifferent Image-to-Image neural network based methods, specifically pix2pix,\nCycleGAN, and CUT networks to implement Caucasian child data and Asian child\ndata conversion. Experimental validation results on synthetic data demonstrate\nthe feasibility of using image-to-image transformation methods to generate\nvarious synthetic child data samples with broader ethnic diversity.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:54:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yao","Wang",""],["Farooq","Muhammad Ali",""],["Lemley","Joseph",""],["Corcoran","Peter",""]]}
{"id":"2308.04233","submitter":"Ivar Stefansson","authors":"Ivar Stefansson, Jhabriel Varela, Eirik Keilegavlen, Inga Berre","title":"Flexible and rigorous numerical modelling of multiphysics processes in\n  fractured porous media using PorePy","comments":"Run scripts at DOI:10.5281/zenodo.8211479","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multiphysics processes in fractured porous media is a research field of\nimportance for several subsurface applications and has received considerable\nattention over the last decade. The dynamics are characterised by strong\ncouplings between processes as well as interaction between the processes and\nthe structure of the fractured medium itself. The rich range of behavior calls\nfor explorative mathematical modelling, such as experimentation with\nconstitutive laws and novel coupling concepts between physical processes.\nMoreover, efficient simulations of the strong couplings between multiphysics\nprocesses and geological structures require the development of tailored\nnumerical methods.\n  We present a modelling framework and its implementation in the open-source\nsimulation toolbox PorePy, which is designed for rapid prototyping of\nmultiphysics processes in fractured porous media. PorePy uses a\nmixed-dimensional representation of the fracture geometry and generally applies\nfully implicit couplings between processes. The code design follows the\nparadigms of modularity and differentiable programming, which together allow\nfor extreme flexibility in experimentation with governing equations with\nminimal changes to the code base. The code integrity is supported by a\nmultilevel testing framework ensuring the reliability of the code.\n  We present our modelling framework within a context of thermo-poroelasticity\nin deformable fractured porous media, illustrating the close relation between\nthe governing equations and the source code. We furthermore discuss the design\nof the testing framework and present simulations showcasing the extendibility\nof PorePy, as well as the type of results that can be produced by\nmixed-dimensional simulation tools.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:57:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Stefansson","Ivar",""],["Varela","Jhabriel",""],["Keilegavlen","Eirik",""],["Berre","Inga",""]]}
{"id":"2308.04234","submitter":"Naoyuki Matsuoka","authors":"Shinya Kumashiro, Naoyuki Matsuoka, and Taiga Nakashima","title":"Nearly Gorenstein local rings defined by maximal minors of a $2 \\times\n  n$ matrix","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the nearly Gorenstein property of a local ring defined by the\nmaximal minors of a specific $2 \\times n$ matrix with entries in the formal\npower series ring $k[[X_1, X_2, \\ldots , X_n]]$ over a field $k$. Our findings\nallow us to present numerous concrete examples, such as nearly Gorenstein rings\nthat are not almost Gorenstein and vice versa.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:59:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kumashiro","Shinya",""],["Matsuoka","Naoyuki",""],["Nakashima","Taiga",""]]}
{"id":"2308.04235","submitter":"Dmytro Meleshko","authors":"Dmytro Meleshko, Elisabetta Prencipe, S\\\"oren Lange (on behalf of\n  Belle II collab.)","title":"Proceedings Excited QCD on recent quarkonium results at Belle II","comments":"The Excited QCD Workshop's proceedings will be submitted at ACTA\n  Polonica","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Belle experiment has given a substantial contribution in the field of\nheavy quarkonia. Several new states were announced by Belle for the first time,\nin both charmonium and bottomonium spectrum, or the confirmation from Belle\ncorroborated former observations. Belle II is a next-generation experiment,\nwhich aims to continue and expand further the Belle physics program. We report\nin this document about the current status of the experiment and early physics\nresults. Particular attention is devoted to the results of the analyses of the\ndata sets collected during the energy scan (Nov 2021).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:00:52 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 21:15:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Meleshko","Dmytro","","on behalf of\n  Belle II collab."],["Prencipe","Elisabetta","","on behalf of\n  Belle II collab."],["Lange","S\u00f6ren","","on behalf of\n  Belle II collab."]]}
{"id":"2308.04236","submitter":"Jiaoyang Huang","authors":"Amol Aggarwal and Jiaoyang Huang","title":"Edge Rigidity of Dyson Brownian Motion with General Initial Data","comments":"52 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the edge behavior of Dyson Brownian motion with\ngeneral $\\beta$. Specifically, we consider the scenario where the averaged\ninitial density near the edge, on the scale $\\eta_*$, is lower bounded by a\nsquare root profile. Under this assumption, we establish that the fluctuations\nof extreme particles are bounded by $(\\log n)^{{\\rm O}(1)}n^{-2/3}$ after time\n$C\\sqrt{\\eta_*}$. Our result improves previous edge rigidity results from\n[1,24] which require both lower and upper bounds of the averaged initial\ndensity. Additionally, combining with [24], our rigidity estimates are used to\nprove that the distribution of extreme particles converges to the Tracy-Widom\n$\\beta$ distribution in short time.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:02:52 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aggarwal","Amol",""],["Huang","Jiaoyang",""]]}
{"id":"2308.04237","submitter":"Meiyi Zhu","authors":"Meiyi Zhu, Matteo Zecchin, Sangwoo Park, Caili Guo, Chunyan Feng,\n  Osvaldo Simeone","title":"Federated Inference with Reliable Uncertainty Quantification over\n  Wireless Channels via Conformal Prediction","comments":"33 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.AI cs.LG math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider a setting in which devices and a server share a pre-trained model.\nThe server wishes to make an inference on a new input given the model. Devices\nhave access to data, previously not used for training, and can communicate to\nthe server over a common wireless channel. If the devices have no access to the\nnew input, can communication from devices to the server enhance the quality of\nthe inference decision at the server? Recent work has introduced federated\nconformal prediction (CP), which leverages devices-to-server communication to\nimprove the reliability of the server's decision. With federated CP, devices\ncommunicate to the server information about the loss accrued by the shared\npre-trained model on the local data, and the server leverages this information\nto calibrate a decision interval, or set, so that it is guaranteed to contain\nthe correct answer with a pre-defined target reliability level. Previous work\nassumed noise-free communication, whereby devices can communicate a single real\nnumber to the server. In this paper, we study for the first time federated CP\nin a wireless setting. We introduce a novel protocol, termed wireless federated\nconformal prediction (WFCP), which builds on type-based multiple access (TBMA)\nand on a novel quantile correction strategy. WFCP is proved to provide formal\nreliability guarantees in terms of coverage of the predicted set produced by\nthe server. Using numerical results, we demonstrate the significant advantages\nof WFCP against digital implementations of existing federated CP schemes,\nespecially in regimes with limited communication resources and/or large number\nof devices.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:03:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhu","Meiyi",""],["Zecchin","Matteo",""],["Park","Sangwoo",""],["Guo","Caili",""],["Feng","Chunyan",""],["Simeone","Osvaldo",""]]}
{"id":"2308.04238","submitter":"Mingzhong Lu","authors":"Mingzhong Lu, Sheng Fang, Zongzheng Zhou, Youjin Deng","title":"Interplay of the complete-graph and Gaussian fixed-point asymptotics in\n  finite-size scaling of percolation above the upper critical dimension","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Percolation has two mean-field theories, the Gaussian fixed point (GFP) and\nthe Landau mean-field theory or the complete graph (CG) asymptotics. By\nlarge-scale Monte Carlo simulations, we systematically study the interplay of\nthe GFP and CG effects to the finite-size scaling of percolation above the\nupper critical dimension $d_c = 6$ with periodic, free, and cylindrical\nboundary conditions. Our results suggest that, with periodic boundaries, the\n\\emph{unwrapped} correlation length scales as $L^{d/6}$ at the critical point,\ndiverging faster than $L$ above $d_c$. As a consequence, the scaling behaviours\nof macroscopic quantities with respect to the linear system size $L$ follow the\nCG asymptotics. The distance-dependent properties, such as the short-distance\nbehaviour of the two-point correlation function and the Fourier transformed\nquantities with non-zero modes, are still controlled by the GFP. With free\nboundaries, since the correlation length is cutoff by $L$, the finite-size\nscaling at the critical point is controlled by the GFP. However, some\nquantities are observed to exhibit the CG aysmptotics at the low-temperature\npseudo-critical point, such as the sizes of the two largest clusters. With\ncylindrical boundaries, due to the interplay of the GFP and CG effects, the\ncorrelation length along the axial direction of the cylinder scales as $\\xi_L\n\\sim L^{(d-1)/5}$ within the critical window of size $O(L^{-2(d-1)/5})$,\ndistinct from both periodic and free boundaries. A field-theoretical\ncalculation for deriving the scaling of $\\xi_L$ is also presented. Moreover,\nthe one-point surface correlation function along the axial direction of the\ncylinder is observed to scale as ${\\tau}^{(1-d)/2}$ for short distance but then\nenter a plateau of order $L^{-3(d-1)/5}$ before it decays significantly fast.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:09:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lu","Mingzhong",""],["Fang","Sheng",""],["Zhou","Zongzheng",""],["Deng","Youjin",""]]}
{"id":"2308.04239","submitter":"Yuwei Lu","authors":"Yuwei Lu, Haoxiang Jiang, Renming Liu","title":"Enhanced coherent light-matter interaction and room-temperature quantum\n  yield of plasmonic resonances engineered by a chiral exceptional point","comments":"20 pages,9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strong dissipation of plasmonic resonances is detrimental to quantum\nmanipulation. To enhance the quantum coherence, we propose to tailor the local\ndensity of states (LDOS) of plasmonic resonances by integrating with a photonic\ncavity operating at a chiral exceptional point (CEP), where the phase of light\nfield can offer a new degree of freedom to flexibly manipulate the quantum\nstates. A quantized few-mode theory is employed to reveal that the LDOS of the\nproposed hybrid cavity can evolve into sub-Lorentzian lineshape, with\norder-of-magnitude linewidth narrowing and additionally a maximum of eightfold\nenhancement compared to the usual plasmonic-photonic cavity without CEP. This\nresults in the enhanced coherent light-matter interaction accompanied by the\nreduced dissipation of polaritonic states. Furthermore, a scattering theory\nbased on eigenmode decomposition is present to elucidate two mechanisms\nresponsible for the significant improvement of quantum yield at CEP, the\nreduction of plasmonic absorption by the Fano interference and the enhancement\nof cavity radiation through the superscattering. Importantly, we find the\nlatter allows achieving a near-unity quantum yield at room temperature; in\nreturn, high quantum yield is beneficial to experimentally verify the enhanced\nLDOS at CEP by measuring the fluorescence lifetime of a quantum emitter.\nTherefore, our work demonstrates that the plasmonic resonances in\nCEP-engineered environment can serve as a promising platform for exploring the\nquantum states control by virtue of the non-Hermiticity of open optical\nresonators and building the high-performance quantum devices for sensing,\nspectroscopy, quantum information processing and quantum computing.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:10:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lu","Yuwei",""],["Jiang","Haoxiang",""],["Liu","Renming",""]]}
{"id":"2308.04240","submitter":"Alain J. Brizard","authors":"Alain J. Brizard","title":"Polarization Effects in Higher-order Guiding-center Lagrangian Dynamics","comments":"13 pages. arXiv admin note: substantial text overlap with\n  arXiv:2306.04726","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The extended guiding-center Lagrangian equations of motion are derived by\nLie-transform method under the assumption of time-dependent and inhomogeneous\nelectric and magnetic fields that satisfy the standard guiding-center orderings\nfor space-time scales. Polarization effects are introduced into the Lagrangian\ndynamics by the inclusion of the polarization drift velocity in the\nguiding-center velocity and the appearance of finite-Larmor-radius corrections\nin the guiding-center Hamiltonian and guiding-center Poisson bracket.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:11:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Brizard","Alain J.",""]]}
{"id":"2308.04241","submitter":"Zhu Deng Dr","authors":"Zhu Deng, Jinjie Liu, Biao Luo, Can Yuan, Qingrun Yang, Lei Xiao,\n  Wenwen Zhou, Zhu Liu","title":"AutoPCF: Efficient Product Carbon Footprint Accounting with Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The product carbon footprint (PCF) is crucial for decarbonizing the supply\nchain, as it measures the direct and indirect greenhouse gas emissions caused\nby all activities during the product's life cycle. However, PCF accounting\noften requires expert knowledge and significant time to construct life cycle\nmodels. In this study, we test and compare the emergent ability of five large\nlanguage models (LLMs) in modeling the 'cradle-to-gate' life cycles of products\nand generating the inventory data of inputs and outputs, revealing their\nlimitations as a generalized PCF knowledge database. By utilizing LLMs, we\npropose an automatic AI-driven PCF accounting framework, called AutoPCF, which\nalso applies deep learning algorithms to automatically match calculation\nparameters, and ultimately calculate the PCF. The results of estimating the\ncarbon footprint for three case products using the AutoPCF framework\ndemonstrate its potential in achieving automatic modeling and estimation of PCF\nwith a large reduction in modeling time from days to minutes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:12:03 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 06:09:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Deng","Zhu",""],["Liu","Jinjie",""],["Luo","Biao",""],["Yuan","Can",""],["Yang","Qingrun",""],["Xiao","Lei",""],["Zhou","Wenwen",""],["Liu","Zhu",""]]}
{"id":"2308.04242","submitter":"Tommaso Vison\\'a","authors":"Tommaso Vison\\`a","title":"Intersections of randomly translated sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\Xi_n=\\{\\xi_1,\\dots,\\xi_n\\}$ be a sample of $n$ independent points\ndistributed on a regular closed element $K$ of the extended convex ring in\n$\\mathbb{R}^d$ according to a probability measure $\\mu$ on $K$, admitting a\ndensity function. We consider random sets generated from the intersection of\nthe translations of $K$ by elements of $\\Xi_n$, as $X_n=\\bigcap_{i=1}^n\n(K-\\xi_i)$. The aim of this work is to show that scaled $X_n$ as $n\\to\\infty$\nconverges in distribution to the zero cell of a Poisson hyperplane tessellation\nwhose distributionis is determined by the curvature measure of $K$ and the\nbehaviour of the density of $\\mu$ near the boundary of $K$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:12:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Vison\u00e0","Tommaso",""]]}
{"id":"2308.04243","submitter":"Amir Mohammad Mansourian","authors":"Amir M. Mansourian, Rozhan Ahmadi, Shohreh Kasaei","title":"AICSD: Adaptive Inter-Class Similarity Distillation for Semantic\n  Segmentation","comments":"10 pages, 5 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, deep neural networks have achieved remarkable accuracy in\ncomputer vision tasks. With inference time being a crucial factor, particularly\nin dense prediction tasks such as semantic segmentation, knowledge distillation\nhas emerged as a successful technique for improving the accuracy of lightweight\nstudent networks. The existing methods often neglect the information in\nchannels and among different classes. To overcome these limitations, this paper\nproposes a novel method called Inter-Class Similarity Distillation (ICSD) for\nthe purpose of knowledge distillation. The proposed method transfers high-order\nrelations from the teacher network to the student network by independently\ncomputing intra-class distributions for each class from network outputs. This\nis followed by calculating inter-class similarity matrices for distillation\nusing KL divergence between distributions of each pair of classes. To further\nimprove the effectiveness of the proposed method, an Adaptive Loss Weighting\n(ALW) training strategy is proposed. Unlike existing methods, the ALW strategy\ngradually reduces the influence of the teacher network towards the end of\ntraining process to account for errors in teacher's predictions. Extensive\nexperiments conducted on two well-known datasets for semantic segmentation,\nCityscapes and Pascal VOC 2012, validate the effectiveness of the proposed\nmethod in terms of mIoU and pixel accuracy. The proposed method outperforms\nmost of existing knowledge distillation methods as demonstrated by both\nquantitative and qualitative evaluations. Code is available at:\nhttps://github.com/AmirMansurian/AICSD\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:17:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mansourian","Amir M.",""],["Ahmadi","Rozhan",""],["Kasaei","Shohreh",""]]}
{"id":"2308.04244","submitter":"Xiaoyu Chen","authors":"Xiaoyu Chen, Changde Du, Qiongyi Zhou, and Huiguang He","title":"Auditory Attention Decoding with Task-Related Multi-View Contrastive\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.HC eess.AS q-bio.NC q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The human brain can easily focus on one speaker and suppress others in\nscenarios such as a cocktail party. Recently, researchers found that auditory\nattention can be decoded from the electroencephalogram (EEG) data. However,\nmost existing deep learning methods are difficult to use prior knowledge of\ndifferent views (that is attended speech and EEG are task-related views) and\nextract an unsatisfactory representation. Inspired by Broadbent's filter model,\nwe decode auditory attention in a multi-view paradigm and extract the most\nrelevant and important information utilizing the missing view. Specifically, we\npropose an auditory attention decoding (AAD) method based on multi-view VAE\nwith task-related multi-view contrastive (TMC) learning. Employing TMC learning\nin multi-view VAE can utilize the missing view to accumulate prior knowledge of\ndifferent views into the fusion of representation, and extract the approximate\ntask-related representation. We examine our method on two popular AAD datasets,\nand demonstrate the superiority of our method by comparing it to the\nstate-of-the-art method.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:17:37 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Xiaoyu",""],["Du","Changde",""],["Zhou","Qiongyi",""],["He","Huiguang",""]]}
{"id":"2308.04245","submitter":"P. James E. Peebles","authors":"P. J. E. Peebles","title":"Flat Patterns in Cosmic Structure","comments":"12 pages, 15 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":"  It is natural to wonder how far the flat pattern in the distribution of\ngalaxies and clusters of galaxies around the de Vaucoueurs Local Supercluster\nextends, and whether there are other similarly extended flat patterns in cosmic\nstructure. I present evidence of two extended flat sheet-like patterns in the\ndistributions of galaxies and clusters detected at redshifts less than 0.021.\nSheet A contains our position and is tilted 11 degrees from the supergalactic\npole, meaning the Local Supercluster is a moderately bent part of the more\nextended Sheet A. The continuation of this sheet is detected in the disjoint\nsample of galaxies at redshifts 0.021 to 0.041 and of galaxies and clusters of\ngalaxies at redshifts 0.042 to 0.085. Sheet B is 15 Mpc from us at its closest\npoint. It is detected at redshift less than 0.021 and at redshift 0.021 to\n0.041. These results make a serious case for the reality of signatures of close\nto flat extended sheet-like patterns.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:20:38 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 18:51:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Peebles","P. J. E.",""]]}
{"id":"2308.04246","submitter":"Li Hua","authors":"Hua Li, Jiafu Huang","title":"Spectrally-Corrected and Regularized Global Minimum Variance Portfolio\n  for Spiked Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Considering the shortcomings of the traditional sample covariance matrix\nestimation, this paper proposes an improved global minimum variance portfolio\nmodel and named spectral corrected and regularized global minimum variance\nportfolio (SCRGMVP), which is better than the traditional risk model. The key\nof this method is that under the assumption that the population covariance\nmatrix follows the spiked model and the method combines the design idea of the\nsample spectrally-corrected covariance matrix and regularized. The simulation\nof real and synthetic data shows that our method is not only better than the\nperformance of traditional sample covariance matrix estimation (SCME),\nshrinkage estimation (SHRE), weighted shrinkage estimation (WSHRE) and simple\nspectral correction estimation (SCE), but also has lower computational\ncomplexity.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:26:17 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 14:45:57 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 11:25:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Hua",""],["Huang","Jiafu",""]]}
{"id":"2308.04247","submitter":"Vikas Kumar","authors":"Adamya Shyam, Vikas Kumar, Venkateswara Rao Kagita, Arun K Pujari","title":"UniRecSys: A Unified Framework for Personalized, Group, Package, and\n  Package-to-Group Recommendations","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recommender systems aim to enhance the overall user experience by providing\ntailored recommendations for a variety of products and services. These systems\nhelp users make more informed decisions, leading to greater user satisfaction\nwith the platform. However, the implementation of these systems largely depends\non the context, which can vary from recommending an item or package to a user\nor a group. This requires careful exploration of several models during the\ndeployment, as there is no comprehensive and unified approach that deals with\nrecommendations at different levels. Furthermore, these individual models must\nbe closely attuned to their generated recommendations depending on the context\nto prevent significant variation in their generated recommendations. In this\npaper, we propose a novel unified recommendation framework that addresses all\nfour recommendation tasks, namely personalized, group, package, or\npackage-to-group recommendation, filling the gap in the current research\nlandscape. The proposed framework can be integrated with most of the\ntraditional matrix factorization-based collaborative filtering models. The idea\nis to enhance the formulation of the existing approaches by incorporating\ncomponents focusing on the exploitation of the group and package latent\nfactors. These components also help in exploiting a rich latent representation\nof the user/item by enforcing them to align closely with their corresponding\ngroup/package representation. We consider two prominent CF techniques,\nRegularized Matrix Factorization and Maximum Margin Matrix factorization, as\nthe baseline models and demonstrate their customization to various\nrecommendation tasks. Experiment results on two publicly available datasets are\nreported, comparing them to other baseline approaches that consider individual\nrating feedback for group or package recommendations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:26:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shyam","Adamya",""],["Kumar","Vikas",""],["Kagita","Venkateswara Rao",""],["Pujari","Arun K",""]]}
{"id":"2308.04248","submitter":"Harry Walsh","authors":"Harry Walsh, Ozge Mercanoglu Sincan, Ben Saunders, Richard Bowden","title":"Gloss Alignment Using Word Embeddings","comments":"4 pages, 4 figures, 2023 IEEE International Conference on Acoustics,\n  Speech, and Signal Processing Workshops (ICASSPW)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Capturing and annotating Sign language datasets is a time consuming and\ncostly process. Current datasets are orders of magnitude too small to\nsuccessfully train unconstrained \\acf{slt} models. As a result, research has\nturned to TV broadcast content as a source of large-scale training data,\nconsisting of both the sign language interpreter and the associated audio\nsubtitle. However, lack of sign language annotation limits the usability of\nthis data and has led to the development of automatic annotation techniques\nsuch as sign spotting. These spottings are aligned to the video rather than the\nsubtitle, which often results in a misalignment between the subtitle and\nspotted signs. In this paper we propose a method for aligning spottings with\ntheir corresponding subtitles using large spoken language models. Using a\nsingle modality means our method is computationally inexpensive and can be\nutilized in conjunction with existing alignment techniques. We quantitatively\ndemonstrate the effectiveness of our method on the \\acf{mdgs} and \\acf{bobsl}\ndatasets, recovering up to a 33.22 BLEU-1 score in word alignment.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:26:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Walsh","Harry",""],["Sincan","Ozge Mercanoglu",""],["Saunders","Ben",""],["Bowden","Richard",""]]}
{"id":"2308.04249","submitter":"Huiguang He","authors":"Yizhuo Lu, Changde Du, Qiongyi zhou, Dianpeng Wang, Huiguang He","title":"MindDiffuser: Controlled Image Reconstruction from Human Brain Activity\n  with Semantic and Structural Diffusion","comments":"arXiv admin note: substantial text overlap with arXiv:2303.14139","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconstructing visual stimuli from brain recordings has been a meaningful and\nchallenging task. Especially, the achievement of precise and controllable image\nreconstruction bears great significance in propelling the progress and\nutilization of brain-computer interfaces. Despite the advancements in complex\nimage reconstruction techniques, the challenge persists in achieving a cohesive\nalignment of both semantic (concepts and objects) and structure (position,\norientation, and size) with the image stimuli. To address the aforementioned\nissue, we propose a two-stage image reconstruction model called MindDiffuser.\nIn Stage 1, the VQ-VAE latent representations and the CLIP text embeddings\ndecoded from fMRI are put into Stable Diffusion, which yields a preliminary\nimage that contains semantic information. In Stage 2, we utilize the CLIP\nvisual feature decoded from fMRI as supervisory information, and continually\nadjust the two feature vectors decoded in Stage 1 through backpropagation to\nalign the structural information. The results of both qualitative and\nquantitative analyses demonstrate that our model has surpassed the current\nstate-of-the-art models on Natural Scenes Dataset (NSD). The subsequent\nexperimental findings corroborate the neurobiological plausibility of the\nmodel, as evidenced by the interpretability of the multimodal feature employed,\nwhich align with the corresponding brain responses.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:28:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lu","Yizhuo",""],["Du","Changde",""],["zhou","Qiongyi",""],["Wang","Dianpeng",""],["He","Huiguang",""]]}
{"id":"2308.04250","submitter":"Hajime Tanaka","authors":"Yinqiao Wang, Michio Tateno, and Hajime Tanaka","title":"Distinct elastic properties and their origins in glasses and gels","comments":"15 pages, 5 figures, 5 Supplementary Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Glasses and gels, widely encountered amorphous solids with diverse industrial\nand everyday applications, share intriguing similarities such as rigidity\nwithout crystalline order and dynamic slowing down during aging. However, the\nunderlying differences between these two fascinating materials have remained\nelusive. Here we uncover distinct elastic properties concerning observation and\naging times in glasses and gels, while delving into the underlying mechanisms.\nIn glasses, we observe a gradual decrease in the shear modulus, while the bulk\nmodulus remains constant throughout the observation time. In contrast, gels\nexhibit a decrease in both the shear and bulk moduli over the observation time.\nAdditionally, during aging, glasses exhibit a steady trend of stiffening, while\ngels demonstrate initial stiffening followed by softening. By unravelling the\nintricate relationship between structure, dynamics, and elasticity, we\nattribute these differences to mechanisms that minimize free energy: structural\nordering in glasses and interface reduction in gels. Our work not only uncovers\nthe distinct behaviors of glasses and gels but also sheds light on the origin\nand evolution of elasticity in non-equilibrium disordered solids, offering\nsignificant implications for the application and design of amorphous materials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:35:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Yinqiao",""],["Tateno","Michio",""],["Tanaka","Hajime",""]]}
{"id":"2308.04251","submitter":"Fabian Kuhn","authors":"Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti\n  and Gustav Schmid","title":"On the Node-Averaged Complexity of Locally Checkable Problems on Trees","comments":"55 pages, 10 figures, conference version in 37th International\n  Symposium on Distributed Computing (DISC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past decade, a long line of research has investigated the\ndistributed complexity landscape of locally checkable labeling (LCL) problems\non bounded-degree graphs, culminating in an almost-complete classification on\ngeneral graphs and a complete classification on trees. The latter states that,\non bounded-degree trees, any LCL problem has deterministic \\emph{worst-case}\ntime complexity $O(1)$, $\\Theta(\\log^* n)$, $\\Theta(\\log n)$, or\n$\\Theta(n^{1/k})$ for some positive integer $k$, and all of those complexity\nclasses are nonempty. Moreover, randomness helps only for (some) problems with\ndeterministic worst-case complexity $\\Theta(\\log n)$, and if randomness helps\n(asymptotically), then it helps exponentially.\n  In this work, we study how many distributed rounds are needed \\emph{on\naverage per node} in order to solve an LCL problem on trees. We obtain a\npartial classification of the deterministic \\emph{node-averaged} complexity\nlandscape for LCL problems. As our main result, we show that every problem with\nworst-case round complexity $O(\\log n)$ has deterministic node-averaged\ncomplexity $O(\\log^* n)$. We further establish bounds on the node-averaged\ncomplexity of problems with worst-case complexity $\\Theta(n^{1/k})$: we show\nthat all these problems have node-averaged complexity $\\widetilde{\\Omega}(n^{1\n/ (2^k - 1)})$, and that this lower bound is tight for some problems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:35:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Balliu","Alkida",""],["Brandt","Sebastian",""],["Kuhn","Fabian",""],["Olivetti","Dennis",""],["Schmid","Gustav",""]]}
{"id":"2308.04252","submitter":"Mathieu Labussi\\`ere","authors":"Mathieu Labussi\\`ere, C\\'eline Teuli\\`ere, Omar Ait-Aider","title":"Blur aware metric depth estimation with multi-focus plenoptic cameras","comments":"21 pages, 12 Figures, 3 Tables","journal-ref":null,"doi":"10.1016/j.cviu.2023.103802","report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  While a traditional camera only captures one point of view of a scene, a\nplenoptic or light-field camera, is able to capture spatial and angular\ninformation in a single snapshot, enabling depth estimation from a single\nacquisition. In this paper, we present a new metric depth estimation algorithm\nusing only raw images from a multi-focus plenoptic camera. The proposed\napproach is especially suited for the multi-focus configuration where several\nmicro-lenses with different focal lengths are used. The main goal of our blur\naware depth estimation (BLADE) approach is to improve disparity estimation for\ndefocus stereo images by integrating both correspondence and defocus cues. We\nthus leverage blur information where it was previously considered a drawback.\nWe explicitly derive an inverse projection model including the defocus blur\nproviding depth estimates up to a scale factor. A method to calibrate the\ninverse model is then proposed. We thus take into account depth scaling to\nachieve precise and accurate metric depth estimates. Our results show that\nintroducing defocus cues improves the depth estimation. We demonstrate the\neffectiveness of our framework and depth scaling calibration on relative depth\nestimation setups and on real-world 3D complex scenes with ground truth\nacquired with a 3D lidar scanner.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:38:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Labussi\u00e8re","Mathieu",""],["Teuli\u00e8re","C\u00e9line",""],["Ait-Aider","Omar",""]]}
{"id":"2308.04253","submitter":"Pei Su","authors":"Sebastian Schwarzacher, Pei Su","title":"Regularity for an elastic beam interacting with 2D Navier-Stokes\n  equations","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A perfectly elastic beam is situated on top of a fluid canister. The beam is\ndeforming in accordance to an interaction with a Navier-Stokes fluid. Hence,\nthe geometry of the fluid domain is a part of the solution. For this setting we\nshow the existence of a unique strong solution by providing an a-priori\nestimate on the time-derivative of the coupled solution. The estimate is valid\nfor large initial data satisfying natural regularity assumptions and for all\ntimes up to the point of a potential collision.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:39:19 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Schwarzacher","Sebastian",""],["Su","Pei",""]]}
{"id":"2308.04254","submitter":"Haradhan Adhikary","authors":"Haradhan Adhikary (for the NA61/SHINE Collaboration)","title":"Search for the QCD critical point by NA61/SHINE at the CERN SPS","comments":"Contribution to ICNFP 2021, 12 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The existence and location of the QCD critical point is an object of both\nexperimental and theoretical studies. The comprehensive data collected by the\nNA61/SHINE during a two-dimensional scan in beam momentum (13A-150A GeV/c) and\nsystem size (p+p, p+Pb, Be+Be, Ar+Sc, Xe+La, Pb+Pb) allows for a systematic\nsearch for the critical point -- a search for a non-monotonic dependence of\nvarious correlation and fluctuation observables on collision energy and size of\ncolliding nuclei. In particular, fluctuations of particle number in transverse\nmomentum space are studied. They are quantified by measuring the scaling\nbehavior of factorial moments of multiplicity distributions. This contribution\nreviews ongoing NA61/SHINE studies to search for the critical point of the\nstrongly interacting matter.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:41:03 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 08:37:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Adhikary","Haradhan","","for the NA61/SHINE Collaboration"]]}
{"id":"2308.04255","submitter":"Luka Ter\\v{c}on","authors":"Luka Ter\\v{c}on, Nikola Ljube\\v{s}i\\'c","title":"CLASSLA-Stanza: The Next Step for Linguistic Processing of South Slavic\n  Languages","comments":"17 pages, 14 tables, 1 figure; Typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present CLASSLA-Stanza, a pipeline for automatic linguistic annotation of\nthe South Slavic languages, which is based on the Stanza natural language\nprocessing pipeline. We describe the main improvements in CLASSLA-Stanza with\nrespect to Stanza, and give a detailed description of the model training\nprocess for the latest 2.1 release of the pipeline. We also report performance\nscores produced by the pipeline for different languages and varieties.\nCLASSLA-Stanza exhibits consistently high performance across all the supported\nlanguages and outperforms or expands its parent pipeline Stanza at all the\nsupported tasks. We also present the pipeline's new functionality enabling\nefficient processing of web data and the reasons that led to its\nimplementation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:41:41 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 15:24:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ter\u010don","Luka",""],["Ljube\u0161i\u0107","Nikola",""]]}
{"id":"2308.04256","submitter":"Yves-Patrick Pellegrini","authors":"Yves-Patrick Pellegrini and Marc Josien","title":"Shock-driven nucleation and self-organization of dislocations in the\n  dynamical Peierls model","comments":"16 pages and 14 figures + 3 appended pages and 6 figures of\n  Supplemental Material","journal-ref":"Phys. Rev. B 108 (5), 054309 (2023)","doi":"10.1103/PhysRevB.108.054309","report-no":null,"categories":"cond-mat.mtrl-sci nlin.PS physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic nucleation of dislocations caused by a stress front ('shock') of\namplitude $\\sigma_{\\rm a}$ moving with speed $V$ is investigated by solving\nnumerically the Dynamic Peierls Equation with an efficient method. Speed $V$\nand amplitude $\\sigma_{\\rm a}$ are considered as independent variables, with\n$V$ possibly exceeding the longitudinal wavespeed $c_{\\rm L}$. Various\nreactions between dislocations take place such as scattering, dislocation-pair\nnucleation, annihilation, and crossing. Pairs of edge dislocation are always\nnucleated with speed $v\\gtrsim c_{\\rm L}$ (and likewise for screws with $c_{\\rm\nL}$ replaced by $c_{\\rm S}$, the shear wavespeed). The plastic wave exhibits\nself-organization, forming distinct `bulk' and `front' zones. Nucleations occur\neither within the bulk or at the zone interface, depending on the value of $V$.\nThe front zone accumulates dislocations that are expelled from the bulk or from\nthe interface. In each zone, dislocation speeds and densities are measured as\nfunctions of simulation parameters. The densities exhibit a scaling behavior\nwith stress, given by $((\\sigma_a/\\sigma_{\\rm th})^2-1)^\\beta$, where\n$\\sigma_{\\rm th}$ represents the nucleation threshold and $0<\\beta<1$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:44:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pellegrini","Yves-Patrick",""],["Josien","Marc",""]]}
{"id":"2308.04257","submitter":"Stephen Kleene","authors":"Stephen J. Kleene","title":"Estimates for the Constant Mean Curvature Dirichlet Problem on Catenoids","comments":"30 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we solve the constant mean curvature dirichlet problem on\ncatenoidal necks with small scale in $\\mb{R}^3$. The solutions are found in\nexponentially weighted H\\\"older spaces with non-integer weight and are a-priori\nbounded by a uniform constant times $r^{1 + \\gamma}$, where $r$ denotes the\ndistance to the axis of the neck and where $\\gamma$ belongs to the interval\n$(0, 1)$. By comparing the solutions with their limits on the disk, we improve\nthe estimate to $\\gamma =1$. As a corollary, we prove differentiability of\nsolutions in $\\tau$ down to $\\tau = 0$. The surfaces we construct have\napplications to gluing constructions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:44:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kleene","Stephen J.",""]]}
{"id":"2308.04258","submitter":"Paul Primus","authors":"Paul Primus, Khaled Koutini, Gerhard Widmer","title":"Advancing Natural-Language Based Audio Retrieval with PaSST and Large\n  Audio-Caption Data Sets","comments":"submitted to DCASE Workshop 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.IR cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents a text-to-audio-retrieval system based on pre-trained text\nand spectrogram transformers. Our method projects recordings and textual\ndescriptions into a shared audio-caption space in which related examples from\ndifferent modalities are close. Through a systematic analysis, we examine how\neach component of the system influences retrieval performance. As a result, we\nidentify two key components that play a crucial role in driving performance:\nthe self-attention-based audio encoder for audio embedding and the utilization\nof additional human-generated and synthetic data sets during pre-training. We\nfurther experimented with augmenting ClothoV2 captions with available keywords\nto increase their variety; however, this only led to marginal improvements. Our\nsystem ranked first in the 2023's DCASE Challenge, and it outperforms the\ncurrent state of the art on the ClothoV2 benchmark by 5.6 pp. mAP@10.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:46:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Primus","Paul",""],["Koutini","Khaled",""],["Widmer","Gerhard",""]]}
{"id":"2308.04259","submitter":"Brian Lai","authors":"Brian Lai and Dennis S. Bernstein","title":"Generalized Forgetting Recursive Least Squares: Stability and Robustness\n  Guarantees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work present generalized forgetting recursive least squares (GF-RLS), a\ngeneralization of recursive least squares (RLS) that encompasses many\nextensions of RLS as special cases. First, sufficient conditions are presented\nfor the 1) Lyapunov stability, 2) uniform Lyapunov stability, 3) global\nasymptotic stability, and 4) global uniform exponential stability of parameter\nestimation error in GF-RLS when estimating fixed parameters without noise.\nSecond, robustness guarantees are derived for the estimation of time-varying\nparameters in the presence of measurement noise and regressor noise. These\nrobustness guarantees are presented in terms of global uniform ultimate\nboundedness of the parameter estimation error. A specialization of this result\ngives a bound to the asymptotic bias of least squares estimators in the\nerrors-in-variables problem. Lastly, a survey is presented to show how GF-RLS\ncan be used to analyze various extensions of RLS from the literature.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:49:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lai","Brian",""],["Bernstein","Dennis S.",""]]}
{"id":"2308.04260","submitter":"Timur Aslyamov Dr","authors":"Timur Aslyamov, Massimiliano Esposito","title":"Nonequilibrium Response for Markov Jump Processes: Exact Results and\n  Tight Bounds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.bio-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generalizing response theory of open systems far from equilibrium is a\ncentral quest of nonequilibrium statistical physics. Using stochastic\nthermodynamics, we develop an algebraic method to study the response of\nnonequilibrium steady state to arbitrary perturbations. This allows us to\nderive explicit expressions for the response of edge currents as well as\ntraffic to perturbations in kinetic barriers and driving forces. We also show\nthat these responses satisfy very simple bounds. For the response to energy\nperturbations, we straightforwardly recover results obtained using nontrivial\ngraph-theoretical methods.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:49:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aslyamov","Timur",""],["Esposito","Massimiliano",""]]}
{"id":"2308.04261","submitter":"Yassine Himeur","authors":"Oussama Azzouzi, Mohamed Anane, Mouloud Koudil, Mohamed Issad, Yassine\n  Himeur","title":"Novel Area-Efficient and Flexible Architectures for Optimal Ate Pairing\n  on FPGA","comments":"13 pages, 8 figures, and 5 tables","journal-ref":"The Journal of Supercomputing, 2023","doi":"10.1007/s11227-023-05578-5","report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While FPGA is a suitable platform for implementing cryptographic algorithms,\nthere are several challenges associated with implementing Optimal Ate pairing\non FPGA, such as security, limited computing resources, and high power\nconsumption. To overcome these issues, this study introduces three approaches\nthat can execute the optimal Ate pairing on Barreto-Naehrig curves using\nJacobean coordinates with the goal of reaching 128-bit security on the Genesys\nboard. The first approach is a pure software implementation utilizing the\nMicroBlaze processor. The second involves a combination of software and\nhardware, with key operations in $F_{p}$ and $F_{p^{2}}$ being transformed into\nIP cores for the MicroBlaze. The third approach builds on the second by\nincorporating parallelism to improve the pairing process. The utilization of\nmultiple MicroBlaze processors within a single system offers both versatility\nand parallelism to speed up pairing calculations. A variety of methods and\nparameters are used to optimize the pairing computation, including Montgomery\nmodular multiplication, the Karatsuba method, Jacobean coordinates, the Complex\nsquaring method, sparse multiplication, squaring in $G_{\\phi 6}F_{p^{12}}$, and\nthe addition chain method. The proposed systems are designed to efficiently\nutilize limited resources in restricted environments, while still completing\ntasks in a timely manner.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:58:20 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 08:51:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Azzouzi","Oussama",""],["Anane","Mohamed",""],["Koudil","Mouloud",""],["Issad","Mohamed",""],["Himeur","Yassine",""]]}
{"id":"2308.04262","submitter":"Rahul G S","authors":"Rahul G.S., Sriprabha Ramnarayanan, Mohammad Al Fahim, Keerthi Ram,\n  Preejith S.P, and Mohanasankar Sivaprakasam","title":"SDLFormer: A Sparse and Dense Locality-enhanced Transformer for\n  Accelerated MR Image Reconstruction","comments":"Accepted at MICCAI workshop MILLanD 2023 Medical Image Learning with\n  noisy and Limited Data","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Transformers have emerged as viable alternatives to convolutional neural\nnetworks owing to their ability to learn non-local region relationships in the\nspatial domain. The self-attention mechanism of the transformer enables\ntransformers to capture long-range dependencies in the images, which might be\ndesirable for accelerated MRI image reconstruction as the effect of\nundersampling is non-local in the image domain. Despite its computational\nefficiency, the window-based transformers suffer from restricted receptive\nfields as the dependencies are limited to within the scope of the image\nwindows. We propose a window-based transformer network that integrates dilated\nattention mechanism and convolution for accelerated MRI image reconstruction.\nThe proposed network consists of dilated and dense neighborhood attention\ntransformers to enhance the distant neighborhood pixel relationship and\nintroduce depth-wise convolutions within the transformer module to learn\nlow-level translation invariant features for accelerated MRI image\nreconstruction. The proposed model is trained in a self-supervised manner. We\nperform extensive experiments for multi-coil MRI acceleration for coronal PD,\ncoronal PDFS and axial T2 contrasts with 4x and 5x under-sampling in\nself-supervised learning based on k-space splitting. We compare our method\nagainst other reconstruction architectures and the parallel domain\nself-supervised learning baseline. Results show that the proposed model\nexhibits improvement margins of (i) around 1.40 dB in PSNR and around 0.028 in\nSSIM on average over other architectures (ii) around 1.44 dB in PSNR and around\n0.029 in SSIM over parallel domain self-supervised learning. The code is\navailable at https://github.com/rahul-gs-16/sdlformer.git\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:59:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["S.","Rahul G.",""],["Ramnarayanan","Sriprabha",""],["Fahim","Mohammad Al",""],["Ram","Keerthi",""],["P","Preejith S.",""],["Sivaprakasam","Mohanasankar",""]]}
{"id":"2308.04263","submitter":"\\\"Omer Veysel \\c{C}a\\u{g}atan","authors":"Omer Veysel Cagatan, Baris Akgun","title":"BarlowRL: Barlow Twins for Data-Efficient Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces BarlowRL, a data-efficient reinforcement learning agent\nthat combines the Barlow Twins self-supervised learning framework with DER\n(Data-Efficient Rainbow) algorithm. BarlowRL outperforms both DER and its\ncontrastive counterpart CURL on the Atari 100k benchmark. BarlowRL avoids\ndimensional collapse by enforcing information spread to the whole space. This\nhelps RL algorithms to utilize uniformly spread state representation that\neventually results in a remarkable performance. The integration of Barlow Twins\nwith DER enhances data efficiency and achieves superior performance in the RL\ntasks. BarlowRL demonstrates the potential of incorporating self-supervised\nlearning techniques to improve RL algorithms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:59:56 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 01:39:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cagatan","Omer Veysel",""],["Akgun","Baris",""]]}
{"id":"2308.04264","submitter":"Yash Pote","authors":"Gunjan Kumar, Kuldeep S. Meel and Yash Pote","title":"Tolerant Testing of High-Dimensional Samplers with Subcube Conditioning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the tolerant testing problem for high-dimensional samplers. Given as\ninput two samplers $\\mathcal{P}$ and $\\mathcal{Q}$ over the $n$-dimensional\nspace $\\{0,1\\}^n$, and two parameters $\\varepsilon_2 > \\varepsilon_1$, the goal\nof tolerant testing is to test whether the distributions generated by\n$\\mathcal{P}$ and $\\mathcal{Q}$ are $\\varepsilon_1$-close or\n$\\varepsilon_2$-far. Since exponential lower bounds (in $n$) are known for the\nproblem in the standard sampling model, research has focused on models where\none can draw \\textit{conditional} samples.\n  Among these models, \\textit{subcube conditioning} ($\\mathsf{SUBCOND}$), which\nallows conditioning on arbitrary subcubes of the domain, holds the promise of\nwidespread adoption in practice owing to its ability to capture the natural\nbehavior of samplers in constrained domains. To translate the promise into\npractice, we need to overcome two crucial roadblocks for tests based on\n$\\mathsf{SUBCOND}$: the prohibitively large number of queries\n($\\tilde{\\mathcal{O}}(n^5/\\varepsilon_2^5)$) and limitation to non-tolerant\ntesting (i.e., $\\varepsilon_1 = 0$).\n  The primary contribution of this work is to overcome the above challenges: we\ndesign a new tolerant testing methodology (i.e., $\\varepsilon_1 \\geq 0$) that\nallows us to significantly improve the upper bound to\n$\\tilde{\\mathcal{O}}(n^3/(\\varepsilon_2-\\varepsilon_1)^5)$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:00:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kumar","Gunjan",""],["Meel","Kuldeep S.",""],["Pote","Yash",""]]}
{"id":"2308.04265","submitter":"Ninareh Mehrabi","authors":"Ninareh Mehrabi, Palash Goyal, Christophe Dupuy, Qian Hu, Shalini\n  Ghosh, Richard Zemel, Kai-Wei Chang, Aram Galstyan, Rahul Gupta","title":"FLIRT: Feedback Loop In-context Red Teaming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Warning: this paper contains content that may be inappropriate or offensive.\n  As generative models become available for public use in various applications,\ntesting and analyzing vulnerabilities of these models has become a priority.\nHere we propose an automatic red teaming framework that evaluates a given model\nand exposes its vulnerabilities against unsafe and inappropriate content\ngeneration. Our framework uses in-context learning in a feedback loop to red\nteam models and trigger them into unsafe content generation. We propose\ndifferent in-context attack strategies to automatically learn effective and\ndiverse adversarial prompts for text-to-image models. Our experiments\ndemonstrate that compared to baseline approaches, our proposed strategy is\nsignificantly more effective in exposing vulnerabilities in Stable Diffusion\n(SD) model, even when the latter is enhanced with safety features. Furthermore,\nwe demonstrate that the proposed framework is effective for red teaming\ntext-to-text models, resulting in significantly higher toxic response\ngeneration rate compared to previously reported numbers.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:03:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mehrabi","Ninareh",""],["Goyal","Palash",""],["Dupuy","Christophe",""],["Hu","Qian",""],["Ghosh","Shalini",""],["Zemel","Richard",""],["Chang","Kai-Wei",""],["Galstyan","Aram",""],["Gupta","Rahul",""]]}
{"id":"2308.04266","submitter":"Xiaowen Wang","authors":"Xiaowen Wang, Lanjun Wang, Yuting Su, Yongdong Zhang, An-An Liu","title":"MCDAN: a Multi-scale Context-enhanced Dynamic Attention Network for\n  Diffusion Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Information diffusion prediction aims at predicting the target users in the\ninformation diffusion path on social networks. Prior works mainly focus on the\nobserved structure or sequence of cascades, trying to predict to whom this\ncascade will be infected passively. In this study, we argue that user intent\nunderstanding is also a key part of information diffusion prediction. We\nthereby propose a novel Multi-scale Context-enhanced Dynamic Attention Network\n(MCDAN) to predict which user will most likely join the observed current\ncascades. Specifically, to consider the global interactive relationship among\nusers, we take full advantage of user friendships and global cascading\nrelationships, which are extracted from the social network and historical\ncascades, respectively. To refine the model's ability to understand the user's\npreference for the current cascade, we propose a multi-scale sequential\nhypergraph attention module to capture the dynamic preference of users at\ndifferent time scales. Moreover, we design a contextual attention enhancement\nmodule to strengthen the interaction of user representations within the current\ncascade. Finally, to engage the user's own susceptibility, we construct a\nsusceptibility label for each user based on user susceptibility analysis and\nuse the rank of this label for auxiliary prediction. We conduct experiments\nover four widely used datasets and show that MCDAN significantly overperforms\nthe state-of-the-art models. The average improvements are up to 10.61% in terms\nof Hits@100 and 9.71% in terms of MAP@100, respectively.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:08:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Xiaowen",""],["Wang","Lanjun",""],["Su","Yuting",""],["Zhang","Yongdong",""],["Liu","An-An",""]]}
{"id":"2308.04267","submitter":"Maya Dotan","authors":"Maya Dotan, Aviv Yaish, Hsin-Chu Yin, Eytan Tsytkin, Aviv Zohar","title":"The Vulnerable Nature of Decentralized Governance in DeFi","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Decentralized Finance (DeFi) platforms are often governed by Decentralized\nAutonomous Organizations (DAOs) which are implemented via governance protocols.\nGovernance tokens are distributed to users of the platform, granting them\nvoting rights in the platform's governance protocol. Many DeFi platforms have\nalready been subject to attacks resulting in the loss of millions of dollars in\nuser funds.\n  In this paper we show that governance tokens are often not used as intended\nand may be harmful to the security of DeFi platforms. We show that (1) users\noften do not use governance tokens to vote, (2) that voting rates are\nnegatively correlated to gas prices, (3) voting is very centralized.\n  We explore vulnerabilities in the design of DeFi platform's governance\nprotocols and analyze different governance attacks, focusing on the\ntransferable nature of voting rights via governance tokens. Following the\nmovement and holdings of governance tokens, we show they are often used to\nperform a single action and then sold off. We present evidence of DeFi\nplatforms using other platforms' governance protocols to promote their own\nagenda at the expense of the host platform.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:08:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dotan","Maya",""],["Yaish","Aviv",""],["Yin","Hsin-Chu",""],["Tsytkin","Eytan",""],["Zohar","Aviv",""]]}
{"id":"2308.04268","submitter":"Haolun Wu","authors":"Chengming Hu, Xuan Li, Dan Liu, Haolun Wu, Xi Chen, Ju Wang, Xue Liu","title":"Teacher-Student Architecture for Knowledge Distillation: A Survey","comments":"20 pages. arXiv admin note: substantial text overlap with\n  arXiv:2210.17332","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although Deep neural networks (DNNs) have shown a strong capacity to solve\nlarge-scale problems in many areas, such DNNs are hard to be deployed in\nreal-world systems due to their voluminous parameters. To tackle this issue,\nTeacher-Student architectures were proposed, where simple student networks with\na few parameters can achieve comparable performance to deep teacher networks\nwith many parameters. Recently, Teacher-Student architectures have been\neffectively and widely embraced on various knowledge distillation (KD)\nobjectives, including knowledge compression, knowledge expansion, knowledge\nadaptation, and knowledge enhancement. With the help of Teacher-Student\narchitectures, current studies are able to achieve multiple distillation\nobjectives through lightweight and generalized student networks. Different from\nexisting KD surveys that primarily focus on knowledge compression, this survey\nfirst explores Teacher-Student architectures across multiple distillation\nobjectives. This survey presents an introduction to various knowledge\nrepresentations and their corresponding optimization objectives. Additionally,\nwe provide a systematic overview of Teacher-Student architectures with\nrepresentative learning algorithms and effective distillation schemes. This\nsurvey also summarizes recent applications of Teacher-Student architectures\nacross multiple purposes, including classification, recognition, generation,\nranking, and regression. Lastly, potential research directions in KD are\ninvestigated, focusing on architecture design, knowledge quality, and\ntheoretical studies of regression-based learning, respectively. Through this\ncomprehensive survey, industry practitioners and the academic community can\ngain valuable insights and guidelines for effectively designing, learning, and\napplying Teacher-Student architectures on various distillation objectives.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:09:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hu","Chengming",""],["Li","Xuan",""],["Liu","Dan",""],["Wu","Haolun",""],["Chen","Xi",""],["Wang","Ju",""],["Liu","Xue",""]]}
{"id":"2308.04269","submitter":"Yumeng Shi","authors":"Yumeng Shi, Shihao Bai, Xiuying Wei, Ruihao Gong, Jianlei Yang","title":"Lossy and Lossless (L$^2$) Post-training Model Size Compression","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":"  Deep neural networks have delivered remarkable performance and have been\nwidely used in various visual tasks. However, their huge size causes\nsignificant inconvenience for transmission and storage. Many previous studies\nhave explored model size compression. However, these studies often approach\nvarious lossy and lossless compression methods in isolation, leading to\nchallenges in achieving high compression ratios efficiently. This work proposes\na post-training model size compression method that combines lossy and lossless\ncompression in a unified way. We first propose a unified parametric weight\ntransformation, which ensures different lossy compression methods can be\nperformed jointly in a post-training manner. Then, a dedicated differentiable\ncounter is introduced to guide the optimization of lossy compression to arrive\nat a more suitable point for later lossless compression. Additionally, our\nmethod can easily control a desired global compression ratio and allocate\nadaptive ratios for different layers. Finally, our method can achieve a stable\n$10\\times$ compression ratio without sacrificing accuracy and a $20\\times$\ncompression ratio with minor accuracy loss in a short time. Our code is\navailable at https://github.com/ModelTC/L2_Compression .\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:10:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shi","Yumeng",""],["Bai","Shihao",""],["Wei","Xiuying",""],["Gong","Ruihao",""],["Yang","Jianlei",""]]}
{"id":"2308.04270","submitter":"Vladimir Braun M","authors":"V.M. Braun","title":"Kinematic twist-three contributions to pseudo- and quasi-GPDs","comments":"16 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present explicit expressions for the tree-level ``kinematic'' twist-three\ncontributions to the nucleon matrix elements of gauge-invariant nonlocal\nquark-antiquark operators which can be used in lattice calculations of\ngeneralized parton distributions (GPDs). These contributions in particular\nrestore the translation invariance of the results up to higher twist four. The\ncalculated twist-three corrections are logarithmically enhanced as compared to\nthe leading twist, and are discontinuous at the kinematic points $x=\\pm\\xi$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:10:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Braun","V. M.",""]]}
{"id":"2308.04271","submitter":"Lihe Wang","authors":"Lihe Wang","title":"Geometric De Giorgi Theory","comments":"14 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove De Giorgi-Nash-Moser Theory using a geometric approach.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:11:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Lihe",""]]}
{"id":"2308.04272","submitter":"Timo Reinhold","authors":"Timo Reinhold, Alexander I. Shapiro, Sami K. Solanki, and Gibor Basri","title":"New rotation period measurements of 67,163 Kepler stars","comments":"15 pages, 18 figures, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Kepler space telescope leaves a legacy of tens of thousands of stellar\nrotation period measurements. While many of these stars show strong\nperiodicity, there exists an even bigger fraction of stars with irregular\nvariability for which rotation periods are unknown. As a consequence, many\nstellar activity studies might be strongly biased toward the behavior of more\nactive stars with measured rotation periods. To at least partially lift this\nbias, we apply a new method based on the Gradient of the Power Spectrum (GPS).\nThe maximum of the gradient corresponds to the position of the inflection point\n(IP). It was shown previously that the stellar rotation period $P_{rot}$ is\nlinked to the inflection point period $P_{IP}$ by the simple equation $P_{rot}\n= P_{IP}/\\alpha$, where $\\alpha$ is a calibration factor. The GPS method is\nsuperior to classical methods (such as auto-correlation functions (ACF))\nbecause it does not require a repeatable variability pattern in the time\nseries. From the initial sample of 142,168 stars with effective temperature\n$T_{eff}\\leq6500K$ and surface gravity $log g\\geq4.0$ in the Kepler archive, we\ncould measure rotation periods for 67,163 stars by combining the GPS and the\nACF method. We further report the first determination of a rotation period for\n20,397 stars. The GPS periods show good agreement with previous period\nmeasurements using classical methods, where these are available. Furthermore,\nwe show that the scaling factor $\\alpha$ increases for very cool stars with\neffective temperatures below 4000K, which we interpret as spots located at\nhigher latitudes. We conclude that new techniques (such as the GPS method) must\nbe applied to detect rotation periods of stars with small and more irregular\nvariabilities. Ignoring these stars will distort the overall picture of stellar\nactivity and, in particular, solar-stellar comparison studies.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:12:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Reinhold","Timo",""],["Shapiro","Alexander I.",""],["Solanki","Sami K.",""],["Basri","Gibor",""]]}
{"id":"2308.04273","submitter":"Hua-Xing Chen","authors":"Niu Su, Hua-Xing Chen, Wei Chen and Shi-Lin Zhu","title":"Double-gluon charmonium hybrid states with various (exotic) quantum\n  numbers","comments":"6 pages, 2 figures, 2 tables, suggestions and comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the double-gluon charmonium hybrid states with various quantum\nnumbers, each of which is composed of one valence charm quark and one valence\ncharm antiquark as well as two valence gluons. We concentrate on the exotic\nquantum numbers $J^{PC} =0^{--}/0^{+-}/1^{-+}/2^{+-}/3^{-+}$ that the\nconventional $\\bar q q$ mesons can not reach. We apply the QCD sum rule method\nto calculate their masses to be $7.28^{+0.38}_{-0.43}$ GeV,\n$5.19^{+0.36}_{-0.46}$ GeV, $5.46^{+0.41}_{-0.62}$ GeV, $4.48^{+0.25}_{-0.31}$\nGeV, and $5.54^{+0.35}_{-0.43}$ GeV, respectively. We study their possible\ndecay patterns and propose to search for the $J^{PC}=2^{+-}/3^{-+}$ states in\nthe $D^*\\bar D^{(*)}/D^{*}_s \\bar D^{(*)}_s/\\Sigma_c^* \\bar\n\\Sigma_c^{(*)}/\\Xi_c^* \\bar \\Xi_c^{(\\prime,*)}$ channels. Experimental\ninvestigations on these states and decay channels can be useful in classifying\nthe nature of the hybrid state, thus serving as a direct test of QCD in the low\nenergy sector.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:12:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Su","Niu",""],["Chen","Hua-Xing",""],["Chen","Wei",""],["Zhu","Shi-Lin",""]]}
{"id":"2308.04274","submitter":"Kai Liu","authors":"Zhijie Chen, Christopher J. Jensen, Chen Liu, Xixiang Zhang, and Kai\n  Liu","title":"Ionically-Driven Synthesis and Exchange Bias in Mn$_{4}$N/MnN$_{x}$\n  Heterostructures","comments":"21 pages, 5 figures, 7 pages of supplementary material with 5 figures","journal-ref":"Applied Physics Letters, 123, 082403 (2023)","doi":"10.1063/5.0165895","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ferrimagnets have received renewed attention as a promising platform for\nspintronic applications. Of particular interest is the Mn4N from the\n${\\epsilon}$-phase of the manganese nitride as an emergent rare-earth-free\nspintronic material due to its perpendicular magnetic anisotropy, small\nsaturation magnetization, high thermal stability, and large domain wall\nvelocity. We have achieved high-quality (001)-ordered Mn$_{4}$N thin film by\nsputtering Mn onto ${\\eta}$-phase Mn$_{3}$N$_{2}$ seed layers on Si substrates.\nAs the deposited Mn thickness varies, nitrogen ion migration across the\nMn$_{3}$N$_{2}$/Mn layers leads to a continuous evolution of the layers to\nMn$_{3}$N$_{2}$/Mn$_{2}$N/Mn$_{4}$N, Mn$_{2}$N/Mn$_{4}$N, and eventually\nMn$_{4}$N alone. The ferrimagnetic Mn$_{4}$N indeed exhibits perpendicular\nmagnetic anisotropy, and forms via a nucleation-and-growth mechanism. The\nnitrogen ion migration is also manifested in a significant exchange bias, up to\n0.3 T at 5 K, due to the interactions between ferrimagnetic Mn$_{4}$N and\nantiferromagnetic Mn$_{3}$N$_{2}$ and Mn$_{2}$N. These results demonstrate a\npromising all-nitride magneto-ionic platform with remarkable tunability for\ndevice applications.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:15:03 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 16:36:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Zhijie",""],["Jensen","Christopher J.",""],["Liu","Chen",""],["Zhang","Xixiang",""],["Liu","Kai",""]]}
{"id":"2308.04275","submitter":"Xiaochuang Han","authors":"Xiaochuang Han","title":"In-Context Alignment: Chat with Vanilla Language Models Before\n  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":"  In this note, we explore inference-time alignment through in-context\nlearning. We consider a vanilla pretrained language model Llama-2 before any\nfine-tuning and retrieve an average of 9 demonstration alignment examples when\nthe model is prompted to follow chat-style instructions. Compared to direct\nprompting, the in-context alignment without changing model weights leads to a\n7x increase in win-rate w.r.t. the text-davinci-003 model from OpenAI, making\nthe vanilla language model comparable to strong baselines with alignment\nfine-tuning.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:17:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Han","Xiaochuang",""]]}
{"id":"2308.04276","submitter":"Tadao Hoshino","authors":"Tadao Hoshino","title":"Causal Interpretation of Linear Social Interaction Models with\n  Endogenous Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study investigates the causal interpretation of linear social\ninteraction models in the presence of endogeneity in network formation under a\nheterogeneous treatment effects framework. We consider an experimental setting\nin which individuals are randomly assigned to treatments while no interventions\nare made for the network structure. We show that running a linear regression\nignoring network endogeneity is not problematic for estimating the average\ndirect treatment effect. However, it leads to sample selection bias and\nnegative-weights problem for the estimation of the average spillover effect. To\novercome these problems, we propose using potential peer treatment as an\ninstrumental variable (IV), which is automatically a valid IV for actual\nspillover exposure. Using this IV, we examine two IV-based estimands and\ndemonstrate that they have a local average treatment-effect-type causal\ninterpretation for the spillover effect.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:18:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hoshino","Tadao",""]]}
{"id":"2308.04277","submitter":"Yuwei Lu","authors":"Yuwei Lu, Jingfeng Liu, Haoxiang Jiang, Zeyang Liao","title":"Topologically protected subradiant cavity polaritons through linewidth\n  narrowing enabled by dissipationless edge states","comments":"19 pages,8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cavity polaritons derived from the strong light-matter interaction at the\nquantum level provide a basis for efficient manipulation of quantum states via\ncavity field. Polaritons with narrow linewidth and long lifetime are appealing\nin applications such as quantum sensing and storage. Here, we propose a\nprototypical arrangement to implement a whispering-gallery-mode resonator with\ntopological mirror moulded by one-dimensional atom array, which allows to boost\nthe lifetime of cavity polaritons over an order of magnitude. This considerable\nenhancement attributes to the coupling of polaritonic states to dissipationless\nedge states protected by the topological bandgap of atom array that suppresses\nthe leakage of cavity modes. When exceeding the width of Rabi splitting,\ntopological bandgap can further reduce the dissipation from polaritonic states\nto bulk states of atom array, giving arise to subradiant cavity polaritons with\nextremely sharp linewidth. The resultant Rabi oscillation decays with a rate\neven below the free-space decay of a single quantum emitter. Inheriting from\nthe topologically protected properties of edge states, the subradiance of\ncavity polaritons can be preserved in the disordered atom mirror with moderate\nperturbations involving the atomic frequency, interaction strengths and\nlocation. Our work opens up a new paradigm of topology-engineered quantum\nstates with robust quantum coherence for future applications in quantum\ncomputing and network.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:20:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lu","Yuwei",""],["Liu","Jingfeng",""],["Jiang","Haoxiang",""],["Liao","Zeyang",""]]}
{"id":"2308.04278","submitter":"Fujun Gao","authors":"Xun Chen, Fujun Gao, Min Qiu, Jia Zhang, Feng Shu, Shihao Yan","title":"Achieving Covert Communication With A Probabilistic Jamming Strategy","comments":null,"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":"  In this work, we consider a covert communication scenario, where a\ntransmitter Alice communicates to a receiver Bob with the aid of a\nprobabilistic and uninformed jammer against an adversary warden's detection.\nThe transmission status and power of the jammer are random and follow some\npriori probabilities. We first analyze the warden's detection performance as a\nfunction of the jammer's transmission probability, transmit power distribution,\nand Alice's transmit power. We then maximize the covert throughput from Alice\nto Bob subject to a covertness constraint, by designing the covert\ncommunication strategies from three different perspectives: Alice's\nperspective, the jammer's perspective, and the global perspective. Our analysis\nreveals that the minimum jamming power should not always be zero in the\nprobabilistic jamming strategy, which is different from that in the continuous\njamming strategy presented in the literature. In addition, we prove that the\nminimum jamming power should be the same as Alice's covert transmit power,\ndepending on the covertness and average jamming power constraints. Furthermore,\nour results show that the probabilistic jamming can outperform the continuous\njamming in terms of achieving a higher covert throughput under the same\ncovertness and average jamming power constraints.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:20:51 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 10:03:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Xun",""],["Gao","Fujun",""],["Qiu","Min",""],["Zhang","Jia",""],["Shu","Feng",""],["Yan","Shihao",""]]}
{"id":"2308.04279","submitter":"Bhavna Joshi","authors":"Tapan K. Sengupta, Aditi Sengupta, Bhavna Joshi, Prasannabalaji\n  Sundaram","title":"Perturbation Field in The Presence of Uniform Mean Flow: Doppler Effect\n  for Flows and Acoustics","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Having developed the perturbation equation for a dissipative quiescent medium\nfor planar propagation using the linearized compressible Navier-Stokes equation\nwithout the Stokes' hypothesis \\cite{arxiv2023}, here the same is extended\nwhere a uniform mean flow is present in the ambiance to explore the propagation\nproperties for the Doppler effect.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:21:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sengupta","Tapan K.",""],["Sengupta","Aditi",""],["Joshi","Bhavna",""],["Sundaram","Prasannabalaji",""]]}
{"id":"2308.04280","submitter":"Yang Sun","authors":"Yang Sun, Mikhail I. Mendelev, Feng Zhang, Xun Liu, Bo Da, Cai-Zhuang\n  Wang, Renata M. Wentzcovitch and Kai-Ming Ho","title":"Unveiling the effect of Ni on the formation and structure of Earth's\n  inner core","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ni is the second most abundant element in the Earth's core. Yet, its effects\non the inner core's structure and formation process are usually disregarded\nbecause of its similar atomic numbers with Fe. Using ab initio molecular\ndynamics simulations, we find that the bcc phase can spontaneously crystallize\nin liquid Ni at temperatures above Fe's melting point at inner core pressures.\nThe melting temperature of Ni is shown to be 700-800 K higher than that of Fe\nat 323-360 GPa. Phase relations among hcp, bcc, and liquid differ between Fe\nand Ni. Ni can be a bcc stabilizer for Fe at high temperatures and inner core\npressures. A small amount of Ni can accelerate Fe's crystallization under core\npressure. These results suggest Ni may substantially impact the structure and\nformation process of the solid inner core.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:22:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sun","Yang",""],["Mendelev","Mikhail I.",""],["Zhang","Feng",""],["Liu","Xun",""],["Da","Bo",""],["Wang","Cai-Zhuang",""],["Wentzcovitch","Renata M.",""],["Ho","Kai-Ming",""]]}
{"id":"2308.04281","submitter":"Sangmin Park","authors":"Sangmin Park, Robert L. Pego","title":"Convergence and non-convergence in a nonlocal gradient flow","comments":"31 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.AP math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the asymptotic convergence of solutions of $\\partial_t u=-f(u)+\\int\nf(u)$, a nonlocal differential equation that is formally a gradient flow in a\nconstant-mass subspace of $L^2$ arising from simplified models of phase\ntransitions. In case the solution takes finitely many values, we provide a new\nproof of stabilization that uses a {\\L}ojasiewicz-type gradient inequality near\na degenerate curve of equilibria. Solutions with infinitely many values in\ngeneral need not converge to equilibrium, however, which we demonstrate by\nproviding counterexamples for piecewise linear and cubic functions $f$.\nCuriously, the exponential rate of convergence in the finite-value case can\njump from order $O(1)$ to arbitrarily small values upon perturbation of\nparameters.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:22:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Park","Sangmin",""],["Pego","Robert L.",""]]}
{"id":"2308.04282","submitter":"Yash Gondhalekar","authors":"Yash Gondhalekar, Eric D. Feigelson, Gabriel A. Caceres, Marco\n  Montalto, Snehanshu Saha","title":"TCF periodogram's high sensitivity: A method for optimizing detection of\n  small transiting planets","comments":"30 pages, 13 figures, submitted to AAS Journals","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":"  We conduct a methodological study for statistically comparing the\nsensitivities of two periodograms for weak signal planet detection in transit\nsurveys: the widely used Box-Least Squares (BLS) algorithm following light\ncurve detrending and the Transit Comb Filter (TCF) algorithm following\nautoregressive ARIMA modeling. Small depth transits are injected into light\ncurves with different simulated noise characteristics. Two measures of spectral\npeak significance are examined: the periodogram signal-to-noise ratio (SNR) and\na False Alarm Probability (FAP) based on the generalized extreme value\ndistribution. The relative performance of the BLS and TCF algorithms for small\nplanet detection is examined for a range of light curve characteristics,\nincluding orbital period, transit duration, depth, number of transits, and type\nof noise. The TCF periodogram applied to ARIMA fit residuals with the SNR\ndetection metric is preferred when short-memory autocorrelation is present in\nthe detrended light curve and even when the light curve noise had white\nGaussian noise. BLS is more sensitive to small planets only under limited\ncircumstances with the FAP metric. BLS periodogram characteristics are inferior\nwhen autocorrelated noise is present. Application of these methods to TESS\nlight curves with small exoplanets confirms our simulation results. The study\nends with a decision tree that advises transit survey scientists on procedures\nto detect small planets most efficiently. The use of ARIMA detrending and TCF\nperiodograms can significantly improve the sensitivity of any transit survey\nwith regularly spaced cadence.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:24:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gondhalekar","Yash",""],["Feigelson","Eric D.",""],["Caceres","Gabriel A.",""],["Montalto","Marco",""],["Saha","Snehanshu",""]]}
{"id":"2308.04283","submitter":"Muhayyuddin Ahmed","authors":"Muhayyuddin Ahmed, Ahsan Baidar Bakht, Taimur Hassan, Waseem Akram,\n  Ahmed Humais, Lakmal Seneviratne, Shaoming He, Defu Lin, and Irfan Hussain","title":"Vision-Based Autonomous Navigation for Unmanned Surface Vessel in\n  Extreme Marine Conditions","comments":"IEEE/RSJ International Conference on Intelligent Robots (IROS-2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual perception is an important component for autonomous navigation of\nunmanned surface vessels (USV), particularly for the tasks related to\nautonomous inspection and tracking. These tasks involve vision-based navigation\ntechniques to identify the target for navigation. Reduced visibility under\nextreme weather conditions in marine environments makes it difficult for\nvision-based approaches to work properly. To overcome these issues, this paper\npresents an autonomous vision-based navigation framework for tracking target\nobjects in extreme marine conditions. The proposed framework consists of an\nintegrated perception pipeline that uses a generative adversarial network (GAN)\nto remove noise and highlight the object features before passing them to the\nobject detector (i.e., YOLOv5). The detected visual features are then used by\nthe USV to track the target. The proposed framework has been thoroughly tested\nin simulation under extremely reduced visibility due to sandstorms and fog. The\nresults are compared with state-of-the-art de-hazing methods across the\nbenchmarked MBZIRC simulation dataset, on which the proposed scheme has\noutperformed the existing methods across various metrics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:25:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ahmed","Muhayyuddin",""],["Bakht","Ahsan Baidar",""],["Hassan","Taimur",""],["Akram","Waseem",""],["Humais","Ahmed",""],["Seneviratne","Lakmal",""],["He","Shaoming",""],["Lin","Defu",""],["Hussain","Irfan",""]]}
{"id":"2308.04284","submitter":"Simone Costa","authors":"Simone Costa","title":"A Littlewood-Offord kind of problem in $\\mathbb{Z}_p$ and\n  $\\Gamma$-sequenceability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Littlewood-Offord problem is a classical question in probability theory\nand discrete mathematics, proposed, firstly by Littlewood and Offord in the\n1940s. Given a set $A$ of integer, this problem asks for an upper bound on the\nprobability that a randomly chosen subset $X$ of $A$ sums to an integer $x$.\n  This article proposes a variation of the problem, considering a subset $A$ of\na cyclic group of prime order and examining subsets $X\\subseteq A$ of a given\ncardinality $\\ell$. The main focus of this paper is then on bounding the\nprobability distribution of the sum $Y$ of $\\ell$ i.i.d. $Y_1,\\dots, Y_{\\ell}$\nwhose support is contained in $\\mathbb{Z}_p$. The main result here presented is\nthat, if the probability distributions of the variables $Y_i$ are bounded by\n$\\lambda \\leq 9/10$, then, assuming that $p>\n\\frac{2}{\\lambda}\\left(\\frac{\\ell_0}{3}\\right)^{\\nu}$ (for some\n$\\ell_0\\leq\\ell$), the distribution of $Y$ is bounded by\n$\\lambda\\left(\\frac{3}{\\ell_0}\\right)^{\\nu}$ for some positive absolute\nconstant $\\nu$. Then an analogous result is implied for the Littlewood-Offord\nproblem over $\\mathbb{Z}_p$ on subsets $X$ of a given cardinality $\\ell$ in the\nregime where $n$ is large enough.\n  Finally, as an application of our results, we propose a variation of the\nset-sequenceability problem: that of $\\Gamma$-sequenceability. Given a graph\n$\\Gamma$ on the vertex set $\\{1,2,\\dots,n\\}$ and given a subset $A\\subseteq\n\\mathbb{Z}_p$ of size $n$, here we want to find an ordering of $A$ such that\nthe partial sums $s_i$ and $s_j$ are different whenever $\\{i,j\\}\\in E(\\Gamma)$.\nAs a consequence of our results on the Littlewood-Offord problem, we have been\nable to prove that, if the maximum degree of $\\Gamma$ is at most $d$, $n$ is\nlarge enough, and $p>n^2$, any subset $A\\subseteq \\mathbb{Z}_p$ of size $n$ is\n$\\Gamma$-sequenceable.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:25:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Costa","Simone",""]]}
{"id":"2308.04285","submitter":"Chencheng Zhang","authors":"Chencheng Zhang, Hao Yang, Bin Jiang, and Ming Cao","title":"Flocking control against the malicious agent","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 investigates the flocking control of a swarm with a malicious\nagent that falsifies its controller parameters to cause collision, division,\nand escape of agents in the swarm. A novel geometric flocking condition is\nestablished by designing the configuration of the malicious agent and its\nneighbors, under which we propose a hierarchal geometric configuration-based\nflocking control method. To help detect the malicious agent, a parameter\nestimate mechanism is also provided. The proposed method can achieve the\nflocking control goal and meanwhile contain the malicious agent in the swarm\nwithout removing it. Experimental result shows the effectiveness of the\ntheoretical result.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:26:47 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Chencheng",""],["Yang","Hao",""],["Jiang","Bin",""],["Cao","Ming",""]]}
{"id":"2308.04286","submitter":"Peter Vieting","authors":"Peter Vieting and Ralf Schl\\\"uter and Hermann Ney","title":"Comparative Analysis of the wav2vec 2.0 Feature Extractor","comments":"Accepted at ITG 2023","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":"  Automatic speech recognition (ASR) systems typically use handcrafted feature\nextraction pipelines. To avoid their inherent information loss and to achieve\nmore consistent modeling from speech to transcribed text, neural raw waveform\nfeature extractors (FEs) are an appealing approach. Also the wav2vec 2.0 model,\nwhich has recently gained large popularity, uses a convolutional FE which\noperates directly on the speech waveform. However, it is not yet studied\nextensively in the literature. In this work, we study its capability to replace\nthe standard feature extraction methods in a connectionist temporal\nclassification (CTC) ASR model and compare it to an alternative neural FE. We\nshow that both are competitive with traditional FEs on the LibriSpeech\nbenchmark and analyze the effect of the individual components. Furthermore, we\nanalyze the learned filters and show that the most important information for\nthe ASR system is obtained by a set of bandpass filters.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:29:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Vieting","Peter",""],["Schl\u00fcter","Ralf",""],["Ney","Hermann",""]]}
{"id":"2308.04287","submitter":"Robert Bitmead","authors":"Robert R. Bitmead","title":"Stable state and signal estimation in a network context","comments":"12 pages, 1 figure","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":"  Power grid, communications, computer and product reticulation networks are\nfrequently layered or subdivided by design. The layering divides\nresponsibilities and can be driven by operational, commercial, regulatory and\nprivacy concerns. From a control context, a layer, or part of a layer, in a\nnetwork isolates the authority to manage, i.e. control, a dynamic system with\nconnections into unknown parts of the network. The topology of these\nconnections is fully prescribed but the interconnecting signals, currents in\nthe case of power grids and bandwidths in communications, are largely\nunavailable, through lack of sensing and even prohibition. Accordingly, one is\ndriven to simultaneous input and state estimation methods. We study a class of\nalgorithms for this joint task, which has the unfortunate issue of inverting a\nsubsystem, which if it has unstable transmission zeros leads to an unstable and\nunimplementable estimator. Two modifications to the algorithm to ameliorate\nthis problem were recently proposed involving replacing the troublesome\nsubsystem with its outer factor from its inner-outer factorization or using a\nhigh-variance white signal model for the unknown inputs. Here, we establish the\nconnections between the original estimation problem for state and input signal\nand the estimates from the algorithm applied solely to the outer factor. It is\ndemonstrated that the state of the outer factor and that of the original system\nasymptotically coincide and that the estimate of the input signal to the outer\nfactor has asymptotically stationary second-order statistics which are in\none-to-one correspondence with those of the input signal to the original\nsystem, when this signal is itself stationary. Thus, the simultaneous input and\nstate estimation algorithm applied just to the outer factor yields an unbiased\nstate estimate for control and the statistics of the interface signals.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:30:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bitmead","Robert R.",""]]}
{"id":"2308.04288","submitter":"Daiheng Gao","authors":"Daiheng Gao, Xu Chen, Xindi Zhang, Qi Wang, Ke Sun, Bang Zhang,\n  Liefeng Bo, Qixing Huang","title":"Cloth2Tex: A Customized Cloth Texture Generation Pipeline for 3D Virtual\n  Try-On","comments":"15 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Fabricating and designing 3D garments has become extremely demanding with the\nincreasing need for synthesizing realistic dressed persons for a variety of\napplications, e.g. 3D virtual try-on, digitalization of 2D clothes into 3D\napparel, and cloth animation. It thus necessitates a simple and straightforward\npipeline to obtain high-quality texture from simple input, such as 2D reference\nimages. Since traditional warping-based texture generation methods require a\nsignificant number of control points to be manually selected for each type of\ngarment, which can be a time-consuming and tedious process. We propose a novel\nmethod, called Cloth2Tex, which eliminates the human burden in this process.\nCloth2Tex is a self-supervised method that generates texture maps with\nreasonable layout and structural consistency. Another key feature of Cloth2Tex\nis that it can be used to support high-fidelity texture inpainting. This is\ndone by combining Cloth2Tex with a prevailing latent diffusion model. We\nevaluate our approach both qualitatively and quantitatively and demonstrate\nthat Cloth2Tex can generate high-quality texture maps and achieve the best\nvisual effects in comparison to other methods. Project page:\ntomguluson92.github.io/projects/cloth2tex/\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:32:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gao","Daiheng",""],["Chen","Xu",""],["Zhang","Xindi",""],["Wang","Qi",""],["Sun","Ke",""],["Zhang","Bang",""],["Bo","Liefeng",""],["Huang","Qixing",""]]}
{"id":"2308.04289","submitter":"Jakub Radoszewski","authors":"Jakub Radoszewski","title":"Linear Time Construction of Cover Suffix Tree and Applications","comments":"Accepted to ESA 2023. Abstract abridged to satisfy arxiv requirements","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Cover Suffix Tree (CST) of a string $T$ is the suffix tree of $T$ with\nadditional explicit nodes corresponding to halves of square substrings of $T$.\nIn the CST an explicit node corresponding to a substring $C$ of $T$ is\nannotated with two numbers: the number of non-overlapping consecutive\noccurrences of $C$ and the total number of positions in $T$ that are covered by\noccurrences of $C$ in $T$. Kociumaka et al. (Algorithmica, 2015) have shown how\nto compute the CST of a length-$n$ string in $O(n \\log n)$ time. We show how to\ncompute the CST in $O(n)$ time assuming that $T$ is over an integer alphabet.\n  Kociumaka et al. (Algorithmica, 2015; Theor. Comput. Sci., 2018) have shown\nthat knowing the CST of a length-$n$ string $T$, one can compute a linear-sized\nrepresentation of all seeds of $T$ as well as all shortest $\\alpha$-partial\ncovers and seeds in $T$ for a given $\\alpha$ in $O(n)$ time. Thus our result\nimplies linear-time algorithms computing these notions of quasiperiodicity. The\nresulting algorithm computing seeds is substantially different from the\nprevious one (Kociumaka et al., SODA 2012, ACM Trans. Algorithms, 2020).\nKociumaka et al. (Algorithmica, 2015) proposed an $O(n \\log n)$-time algorithm\nfor computing a shortest $\\alpha$-partial cover for each $\\alpha=1,\\ldots,n$;\nwe improve this complexity to $O(n)$.\n  Our results are based on a new characterization of consecutive overlapping\noccurrences of a substring $S$ of $T$ in terms of the set of runs (see Kolpakov\nand Kucherov, FOCS 1999) in $T$. This new insight also leads to an $O(n)$-sized\nindex for reporting overlapping consecutive occurrences of a given pattern $P$\nof length $m$ in $O(m+output)$ time, where $output$ is the number of\noccurrences reported. In comparison, a general index for reporting bounded-gap\nconsecutive occurrences of Navarro and Thankachan (Theor. Comput. Sci., 2016)\nuses $O(n \\log n)$ space.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:33:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Radoszewski","Jakub",""]]}
{"id":"2308.04290","submitter":"Daniel Goodair","authors":"Daniel Goodair","title":"Navier-Stokes Equations with Navier Boundary Conditions and Stochastic\n  Lie Transport: Well-Posedness and Inviscid Limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the existence and uniqueness of global, probabilistically strong,\nanalytically strong solutions of the 2D Stochastic Navier-Stokes Equation under\nNavier boundary conditions. The choice of noise includes a large class of\nadditive, multiplicative and transport models. We emphasise that with a\ntransport type noise, the Navier boundary conditions enable direct energy\nestimates which appear to be prohibited for the usual no-slip condition. The\nimportance of the Stochastic Advection by Lie Transport (SALT) structure, in\ncomparison to a purely transport Stratonovich noise, is also highlighted in\nthese estimates. In the particular cases of SALT noise, the free boundary\ncondition and a domain of non-negative curvature, the inviscid limit exists and\nis a global, probabilistically weak, analytically weak solution of the\ncorresponding Stochastic Euler Equation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:33:24 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 08:57:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Goodair","Daniel",""]]}
{"id":"2308.04291","submitter":"Miguel Fr\\'ias-P\\'erez","authors":"Miguel Fr\\'ias-P\\'erez, Luca Tagliacozzo and Mari Carmen Ba\\~nuls","title":"Converting long-range entanglement into mixture: tensor-network approach\n  to local equilibration","comments":"5 pages, 4 figures, comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the out-of-equilibrium evolution induced by a quench, fast degrees of\nfreedom generate long-range entanglement that is hard to encode with standard\ntensor networks. However, local observables only sense such long-range\ncorrelations through their contribution to the reduced local state as a\nmixture. We present a tensor network method that identifies such long-range\nentanglement and efficiently transforms it into mixture, much easier to\nrepresent. In this way, we obtain an effective description of the time-evolved\nstate as a density matrix that captures the long-time behavior of local\noperators with finite computational resources.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:36:34 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fr\u00edas-P\u00e9rez","Miguel",""],["Tagliacozzo","Luca",""],["Ba\u00f1uls","Mari Carmen",""]]}
{"id":"2308.04292","submitter":"Keisuke Okumura","authors":"Keisuke Okumura","title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and\n  Near-Optimal Multi-Agent Pathfinding","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper addresses the challenges of real-time, large-scale, and\nnear-optimal multi-agent pathfinding (MAPF) through enhancements to the\nrecently proposed LaCAM* algorithm. LaCAM* is a scalable search-based algorithm\nthat guarantees the eventual finding of optimal solutions for cumulative\ntransition costs. While it has demonstrated remarkable planning success rates,\nsurpassing various state-of-the-art MAPF methods, its initial solution quality\nis far from optimal, and its convergence speed to the optimum is slow. To\novercome these limitations, this paper introduces several improvement\ntechniques, partly drawing inspiration from other MAPF methods. We provide\nempirical evidence that the fusion of these techniques significantly improves\nthe solution quality of LaCAM*, thus further pushing the boundaries of MAPF\nalgorithms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:36:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Okumura","Keisuke",""]]}
{"id":"2308.04293","submitter":"Julia Slipantschuk","authors":"Mark Pollicott and Julia Slipantschuk","title":"Effective estimates of ergodic quantities illustrated on the\n  Bolyai-R\\'enyi map","comments":"21 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a practical and effective method for rigorously estimating\nquantities associated to top eigenvalues of transfer operators to very high\nprecision. The method combines explicit error bounds of the Lagrange-Chebyshev\napproximation with an established min-max method. We illustrate its\napplicability by significantly improving rigorous estimates on various ergodic\nquantities associated to the Bolyai-R\\'enyi map.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:38:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pollicott","Mark",""],["Slipantschuk","Julia",""]]}
{"id":"2308.04294","submitter":"Andrea Gurgone","authors":"A. Gurgone (on behalf of the McMule team)","title":"Looking for an axion in a haystack of muons","comments":"4 pages, 2 figures, contribution to NFLF23, version accepted for\n  publication","journal-ref":"JINST 18 C08006 (2023)","doi":"10.1088/1748-0221/18/08/C08006","report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The search for axion-like particles $X$ in muon decays is an excellent\nopportunity for the MEG II and Mu3e experiments to extend their horizons beyond\n$\\mu^+ \\to e^+ \\gamma$ and $\\mu^+ \\to e^+ e^- e^+$. A suitable process for both\nexperiments is the two-body decay $\\mu^+ \\to e^+ X$, whose only signature is a\nmonochromatic peak close to the kinematic endpoint of the positron energy\nspectrum of the $\\mu^+ \\to e^+ \\nu_e \\bar\\nu_\\mu$ background. The hunt for such\nan elusive signal in a vast amount of irreducible background requires extremely\naccurate theoretical predictions to be implemented in a Monte Carlo event\ngenerator. This work presents a new state-of-the-art computation of $\\mu^+ \\to\ne^+ \\nu_e \\bar\\nu_\\mu$ for polarised muons, accomplished with the McMule\nframework. The calculation includes next-to-next-leading order QED corrections\nand logarithmically enhanced terms at even higher orders. The results are also\nused to estimate the sensitivity of both experiments on the branching ratio of\n$\\mu^+ \\to e^+ X$, in order to evaluate the impact of the theoretical error.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:40:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gurgone","A.","","on behalf of the McMule team"]]}
{"id":"2308.04295","submitter":"Robert Simpson Dr","authors":"Simon Wredh, Yunzheng Wang, Joel K.W. Yang, Robert E. Simpson","title":"Multi-level Optical Switching by Amorphization in Single- and Multi-\n  Phase Change Material Structures","comments":"25 pages, 8 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":"  The optical properties of phase-change materials (PCM) can be tuned to\nmultiple levels by controlling the transition between their amorphous and\ncrystalline phases. In multi-material PCM structures, the number of discrete\nreflectance levels can be increased according to the number of PCM layers.\nHowever, the effect of increasing number of layers on quenching and\nreversibility has not been thoroughly studied. In this work, the phase-change\nphysics and thermal conditions required for reversible switching of single and\nmulti-material PCM switches are discussed based on thermo-optical phase-change\nmodels and laser switching experiments. By using nanosecond laser pulses, 16\ndifferent reflectance levels in Ge2Sb2Te5 are demonstrated via amorphization.\nFurthermore, a multi-material switch based on Ge2Sb2Te5 and GeTe with four\ndiscrete reflectance levels is experimentally proven with a reversible\nmulti-level response. The results and design principles presented herein will\nimpact active photonics applications that rely on dynamic multi-level\noperation, such as optical computing, beam steering, and next-generation\ndisplay technologies.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:40:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wredh","Simon",""],["Wang","Yunzheng",""],["Yang","Joel K. W.",""],["Simpson","Robert E.",""]]}
{"id":"2308.04296","submitter":"Shuvayan Brahmachary","authors":"Shuvayan Brahmachary, Nils Thuerey","title":"Unsteady Cylinder Wakes from Arbitrary Bodies with Differentiable\n  Physics-Assisted Neural Network","comments":"codes to follow shortly:\n  https://github.com/tum-pbs/DiffPhys-CylinderWakeFlow/","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work delineates a hybrid predictive framework configured as a\ncoarse-grained surrogate for reconstructing unsteady fluid flows around\nmultiple cylinders of diverse configurations. The presence of cylinders of\narbitrary nature causes abrupt changes in the local flow profile while globally\nexhibiting a wide spectrum of dynamical wakes fluctuating in either a periodic\nor chaotic manner. Consequently, the focal point of the present study is to\nestablish predictive frameworks that accurately reconstruct the overall fluid\nvelocity flowfield such that the local boundary layer profile, as well as the\nwake dynamics, are both preserved for long time horizons. The hybrid framework\nis realized using a base differentiable flow solver combined with a neural\nnetwork, yielding a differentiable physics-assisted neural network (DPNN). The\nframework is trained using bodies with arbitrary shapes, and then it is tested\nand further assessed on out-of-distribution samples. Our results indicate that\nthe neural network acts as a forcing function to correct the local boundary\nlayer profile while also remarkably improving the dissipative nature of the\nflowfields. It is found that the DPNN framework clearly outperforms the\nsupervised learning approach while respecting the reduced feature space\ndynamics. The model predictions for arbitrary bodies indicate that the Strouhal\nnumber distribution with respect to spacing ratio exhibits similar patterns\nwith existing literature. In addition, our model predictions also enable us to\ndiscover similar wake categories for flow past arbitrary bodies. For the\nchaotic wakes, the present approach predicts the chaotic switch in gap flows up\nto the mid-time range.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:41:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Brahmachary","Shuvayan",""],["Thuerey","Nils",""]]}
{"id":"2308.04297","submitter":"Leslie McIntosh","authors":"Leslie D. McIntosh and Cynthia Hudson Vitale","title":"Safeguarding Scientific Integrity: Examining Conflicts of Interest in\n  the Peer Review Process","comments":"15 pages, 3 tables, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This case study analyzes the expertise, potential conflicts of interest, and\nobjectivity of editors, authors, and peer reviewers involved in a 2022 special\njournal issue on fertility, pregnancy, and mental health. Data were collected\non qualifications, organizational affiliations, and relationships among six\npapers' authors, three guest editors, and twelve peer reviewers. Two articles\nwere found to have undisclosed conflicts of interest between authors, an\neditor, and multiple peer reviewers affiliated with anti-abortion advocacy and\nlobbying groups, indicating compromised objectivity.\n  This lack of transparency undermines the peer review process and enables\nbiased research and disinformation proliferation. To increase integrity, we\nrecommend multiple solutions: open peer review, expanded conflict of interest\ndisclosure, increased stakeholder accountability, and retraction when ethical\nstandards are violated. By illuminating noncompliance with ethical peer review\nguidelines, this study aims to raise awareness to help prevent the propagation\nof partisan science through respected scholarly channels.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:42:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["McIntosh","Leslie D.",""],["Vitale","Cynthia Hudson",""]]}
{"id":"2308.04298","submitter":"Lauren Rhodes","authors":"L. Rhodes, M. Caleb, B. W. Stappers, A. Andersson, M. C. Bezuidenhout,\n  L. N. Driessen, I. Heywood","title":"FRB 20121102A: images of the bursts and the varying radio counterpart","comments":"Accepted in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As more Fast Radio Bursts (FRBs) are being localised, we are learning that\nsome fraction have persistent radio sources (PRSs). Such a discovery motivates\nan improvement in our understanding of the nature of those counterparts, the\nrelation to the bursts themselves and why only some FRBs have PRSs. We report\non observations made of FRB 20121102A with the MeerKAT radio telescope. Across\nfive epochs, we detect the PRS associated with FRB 20121102A. Our observations\nare split into a cluster of four epochs (MJD 58732 - 58764) and a separate\nsingle epoch about 1000days later. The measured flux density is constant across\nthe first four observations but then decays by more than one-third in the final\nobservation. Our observations on MJD 58736 coincided with the detections of 11\nbursts from FRB 20121102A by the MeerTRAP backend, seven of which we detected\nin the image plane. We discuss the importance of image plane detections when\nconsidering the commensal transient searches being performed with MeerKAT and\nother radio facilities. We find that MeerKAT is so sensitive that within a\ntwo-second image, we can detect any FRB with a flux density above 2.4mJy at\n1.3GHz and so could localise every FRB that has been detected by CHIME to date.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:44:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Rhodes","L.",""],["Caleb","M.",""],["Stappers","B. W.",""],["Andersson","A.",""],["Bezuidenhout","M. C.",""],["Driessen","L. N.",""],["Heywood","I.",""]]}
{"id":"2308.04299","submitter":"Jakub {\\L}yskawa","authors":"Jakub {\\L}yskawa, Pawe{\\l} Wawrzy\\'nski","title":"Actor-Critic with variable time discretization via sustained actions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reinforcement learning (RL) methods work in discrete time. In order to apply\nRL to inherently continuous problems like robotic control, a specific time\ndiscretization needs to be defined. This is a choice between sparse time\ncontrol, which may be easier to train, and finer time control, which may allow\nfor better ultimate performance. In this work, we propose SusACER, an\noff-policy RL algorithm that combines the advantages of different time\ndiscretization settings. Initially, it operates with sparse time discretization\nand gradually switches to a fine one. We analyze the effects of the changing\ntime discretization in robotic control environments: Ant, HalfCheetah, Hopper,\nand Walker2D. In all cases our proposed algorithm outperforms state of the art.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:45:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["\u0141yskawa","Jakub",""],["Wawrzy\u0144ski","Pawe\u0142",""]]}
{"id":"2308.04300","submitter":"Kirill Samusev","authors":"Nikolay Solodovchenko, Kirill Samusev, Mikhail Limonov","title":"Quadruplets of exceptional points and bound states in the continuum in\n  dielectric rings","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In photonics, most systems are non-Hermitian due to radiation into open space\nand material losses. At the same time, non-Hermitianity defines a new physics,\nin particular, it gives rise to a new class of degenerations called exceptional\npoints, where two or more resonances coalesce in both eigenvalues and\neigenfunctions. The point of coalescence is a square root singularity of the\nenergy spectrum as a function of interaction parameter. We investigated\nanalytically and numerically the photonic properties of a narrow dielectric\nresonator with a rectangular cross section. It is shown that the exceptional\npoints in such a resonator exist in pairs, and each of the points is adjacent\nin the parametric space to a bound state in the continuum, as a result of which\nquadruples of singular photonic states are formed. We also showed that the\nfield distribution in the cross section of the ring is a characteristic\nfingerprint of both the bound state in the continuum and the exceptional point.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:45:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Solodovchenko","Nikolay",""],["Samusev","Kirill",""],["Limonov","Mikhail",""]]}
{"id":"2308.04301","submitter":"Dmitry Korotin","authors":"Dmitry M. Korotin, Dmitry Y. Novoselov, Alexey O. Shorikov, Vladimir\n  I. Anisimov, Artem R. Oganov","title":"Electronic correlations in promising room-temperature superconductor\n  Pb$_9$Cu(PO$_4$)$_6$O: a DFT+DMFT study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present results of the first investigations on the correlated nature of\nelectronic states that cross the Fermi level in Pb$_9$Cu(PO$_4$)$_6$O aka LK-99\nobtained within the DFT + DMFT approach. Coulomb correlations between Cu-$d$\nelectrons led to the opening of the band gap between the extra-O $p$ and Cu\n$d_{xz}/d_{yz}$ states. We state that oxygen $p$ states play a significant role\nin the electronic properties of LK-99. We also assume that doping with\nelectrons is necessary to turn the stoichiometric Pb$_9$Cu(PO$_4$)$_6$O into\nconducting state.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:46:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Korotin","Dmitry M.",""],["Novoselov","Dmitry Y.",""],["Shorikov","Alexey O.",""],["Anisimov","Vladimir I.",""],["Oganov","Artem R.",""]]}
{"id":"2308.04302","submitter":"David Beerling Prof","authors":"David J. Beerling, Euripides P. Kantzas, Maria Val Martin, Mark R.\n  Lomas, Lyla L. Taylor, Shuang Zhang, Yoshiki Kanzaki, Christopher T.\n  Reinhard, Noah J. Planavsky, Rafael M. Eufrasio, Phil Renforth, Jean-Francois\n  Mecure, Hector Pollitt, Philip B. Holden, Neil R. Edwards, Lenny Koh, Dimitar\n  Z. Epihov, Adam Wolf, James E. Hansen, Nick F. Pidgeon and Steven A. Banwart","title":"Transforming U.S. agriculture with crushed rock for CO$_2$ sequestration\n  and increased production","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Enhanced weathering (EW) is a promising modification to current agricultural\npractices that uses crushed silicate rocks to drive carbon dioxide removal\n(CDR). If widely adopted on farmlands, it could help achieve net-zero or\nnegative emissions by 2050. We report detailed state-level analysis indicating\nEW deployed on agricultural land could sequester 0.23-0.38 Gt CO$_2$ yr$^{-1}$\nand meet 36-60 % of U.S. technological CDR goals. Average CDR costs vary\nbetween state, being highest in the first decades before declining to a range\nof $\\sim\\$$100-150 tCO$_2{}^{-1}$ by 2050, including for three states (Iowa,\nIllinois, and Indiana) that contribute most to total national CDR. We identify\nmultiple electoral swing states as being essential for scaling EW that are also\nkey beneficiaries of the practice, indicating the need for strong bipartisan\nsupport of this technology. Assessment the geochemical capacity of rivers and\noceans to carry dissolved EW products from soil drainage suggests EW provides\nsecure long-term CO$_2$ removal on intergenerational time scales. We\nadditionally forecast mitigation of ground-level ozone increases expected with\nfuture climate change, as an indirect benefit of EW, and consequent avoidance\nof yield reductions. Our assessment supports EW as a practical innovation for\nleveraging agriculture to enable positive action on climate change with\nadherence to federal environmental justice priorities. However, implementing a\nstage-gating framework as upscaling proceeds to safeguard against environmental\nand biodiversity concerns will be essential.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:48:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Beerling","David J.",""],["Kantzas","Euripides P.",""],["Martin","Maria Val",""],["Lomas","Mark R.",""],["Taylor","Lyla L.",""],["Zhang","Shuang",""],["Kanzaki","Yoshiki",""],["Reinhard","Christopher T.",""],["Planavsky","Noah J.",""],["Eufrasio","Rafael M.",""],["Renforth","Phil",""],["Mecure","Jean-Francois",""],["Pollitt","Hector",""],["Holden","Philip B.",""],["Edwards","Neil R.",""],["Koh","Lenny",""],["Epihov","Dimitar Z.",""],["Wolf","Adam",""],["Hansen","James E.",""],["Pidgeon","Nick F.",""],["Banwart","Steven A.",""]]}
{"id":"2308.04303","submitter":"Rabbia Asghar","authors":"Rabbia Asghar, Manuel Diaz-Zapata, Lukas Rummelhard, Anne Spalanzani,\n  Christian Laugier","title":"Vehicle Motion Forecasting using Prior Information and Semantic-assisted\n  Occupancy Grid Maps","comments":"Accepted to the 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motion prediction is a challenging task for autonomous vehicles due to\nuncertainty in the sensor data, the non-deterministic nature of future, and\ncomplex behavior of agents. In this paper, we tackle this problem by\nrepresenting the scene as dynamic occupancy grid maps (DOGMs), associating\nsemantic labels to the occupied cells and incorporating map information. We\npropose a novel framework that combines deep-learning-based spatio-temporal and\nprobabilistic approaches to predict vehicle behaviors.Contrary to the\nconventional OGM prediction methods, evaluation of our work is conducted\nagainst the ground truth annotations. We experiment and validate our results on\nreal-world NuScenes dataset and show that our model shows superior ability to\npredict both static and dynamic vehicles compared to OGM predictions.\nFurthermore, we perform an ablation study and assess the role of semantic\nlabels and map in the architecture.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:49:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Asghar","Rabbia",""],["Diaz-Zapata","Manuel",""],["Rummelhard","Lukas",""],["Spalanzani","Anne",""],["Laugier","Christian",""]]}
{"id":"2308.04304","submitter":"Yuhao Chen","authors":"Yuhao Chen, Qianqian Yang, Zhiguo Shi and Jiming Chen","title":"The Model Inversion Eavesdropping Attack in Semantic Communication\n  Systems","comments":"Accepted by 2023 IEEE Global Communications Conference (GLOBECOM)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CR cs.LG eess.IV math.IT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In recent years, semantic communication has been a popular research topic for\nits superiority in communication efficiency. As semantic communication relies\non deep learning to extract meaning from raw messages, it is vulnerable to\nattacks targeting deep learning models. In this paper, we introduce the model\ninversion eavesdropping attack (MIEA) to reveal the risk of privacy leaks in\nthe semantic communication system. In MIEA, the attacker first eavesdrops the\nsignal being transmitted by the semantic communication system and then performs\nmodel inversion attack to reconstruct the raw message, where both the white-box\nand black-box settings are considered. Evaluation results show that MIEA can\nsuccessfully reconstruct the raw message with good quality under different\nchannel conditions. We then propose a defense method based on random\npermutation and substitution to defend against MIEA in order to achieve secure\nsemantic communication. Our experimental results demonstrate the effectiveness\nof the proposed defense method in preventing MIEA.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:50:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Yuhao",""],["Yang","Qianqian",""],["Shi","Zhiguo",""],["Chen","Jiming",""]]}
{"id":"2308.04305","submitter":"Maxwell Young","authors":"Trisha Chakraborty and Jared Saia and Maxwell Young","title":"Defending Hash Tables from Subterfuge with Depth Charge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CR cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of defending a hash table against a Byzantine\nattacker that is trying to degrade the performance of query, insertion and\ndeletion operations. Our defense makes use of resource burning (RB) -- the the\nverifiable expenditure of network resources -- where the issuer of a request\nincurs some RB cost. Our algorithm, Depth Charge, charges RB costs for\noperations based on the depth of the appropriate object in the list that the\nobject hashes to in the table. By appropriately setting the RB costs, our\nalgorithm mitigates the impact of an attacker on the hash table's performance.\nIn particular, in the presence of a significant attack, our algorithm incurs a\ncost which is asymptotically less that the attacker's cost.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:50:25 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chakraborty","Trisha",""],["Saia","Jared",""],["Young","Maxwell",""]]}
{"id":"2308.04306","submitter":"Cheng Yang","authors":"Cheng Yang, Wenye Zhao, Zhiyue Liu, Qingbao Huang","title":"Deep Learning-Based Knowledge Injection for Metaphor Detection: A\n  Comprehensive Review","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The history of metaphor research also marks the evolution of knowledge\ninfusion research. With the continued advancement of deep learning techniques\nin recent years, the natural language processing community has shown great\ninterest in applying knowledge to successful results in metaphor recognition\ntasks. Although there has been a gradual increase in the number of approaches\ninvolving knowledge injection in the field of metaphor recognition, there is a\nlack of a complete review article on knowledge injection based approaches.\nTherefore, the goal of this paper is to provide a comprehensive review of\nresearch advances in the application of deep learning for knowledge injection\nin metaphor recognition tasks. In this paper, we systematically summarize and\ngeneralize the mainstream knowledge and knowledge injection principles, as well\nas review the datasets, evaluation metrics, and benchmark models used in\nmetaphor recognition tasks. Finally, we explore the current issues facing\nknowledge injection methods and provide an outlook on future research\ndirections.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:51:16 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 03:19:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Cheng",""],["Zhao","Wenye",""],["Liu","Zhiyue",""],["Huang","Qingbao",""]]}
{"id":"2308.04307","submitter":"Tommaso Traetta PhD","authors":"Andrea Burgess, Peter Danziger, Tommaso Traetta","title":"A survey on constructive methods for the Oberwolfach problem and its\n  variants","comments":"To be published in the Fields Institute Communications book series.\n  23 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The generalized Oberwolfach problem asks for a decomposition of a graph $G$\ninto specified 2-regular spanning subgraphs $F_1,\\ldots, F_k$, called factors.\nThe classic Oberwolfach problem corresponds to the case when all of the factors\nare pairwise isomorphic, and $G$ is the complete graph of odd order or the\ncomplete graph of even order with the edges of a $1$-factor removed. When there\nare two possible factor types, it is called the Hamilton-Waterloo problem.\n  In this paper we present a survey of constructive methods which have allowed\nrecent progress in this area. Specifically, we consider blow-up type\nconstructions, particularly as applied to the case when each factor consists of\ncycles of the same length. We consider the case when the factors are all\nbipartite (and hence consist of even cycles) and a method for using circulant\ngraphs to find solutions. We also consider constructions which yield solutions\nwith well-behaved automorphisms.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:52:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Burgess","Andrea",""],["Danziger","Peter",""],["Traetta","Tommaso",""]]}
{"id":"2308.04308","submitter":"Lorenzo Bastonero","authors":"Lorenzo Bastonero and Nicola Marzari","title":"Automated all-functionals infrared and Raman spectra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Infrared and Raman spectroscopies are ubiquitous techniques employed in many\nexperimental laboratories, thanks to their fast and non-destructive nature able\nto capture materials' features as spectroscopic fingerprints. Nevertheless,\nthese measurements frequently need theoretical support in order to\nunambiguously decipher and assign complex spectra. Linear-response theory\nprovides an effective way to obtain the higher-order derivatives needed, but\nits applicability to modern exchange-correlation functionals remains limited.\nHere, we devise an automated, open-source, user-friendly approach based on\nground-state density-functional theory and the electric enthalpy functional to\nallow seamless calculations of first-principles infrared and Raman spectra. By\nemploying a finite-displacement and finite-field approach, we allow for the use\nof any functional, as well as an efficient treatment of large low-symmetry\nstructures. Additionally, we propose a simple scheme for efficiently sampling\nthe Brillouin zone with different electric fields. To demonstrate the\ncapabilities of our approach, we provide illustrations using the ferroelectric\nLiNbO$_3$ crystal as a paradigmatic example. We predict infrared and Raman\nspectra using various (semi)local, Hubbard corrected, and hybrid functionals.\nOur results also show how PBE0 and extended Hubbard functionals yield in this\ncase the best match in term of peak positions and intensities, respectively.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:54:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bastonero","Lorenzo",""],["Marzari","Nicola",""]]}
{"id":"2308.04309","submitter":"Cynthia Zastudil","authors":"Cynthia Zastudil, Magdalena Rogalska, Christine Kapp, Jennifer Vaughn,\n  Stephen MacNeil","title":"Generative AI in Computing Education: Perspectives of Students and\n  Instructors","comments":"10 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Generative models are now capable of producing natural language text that is,\nin some cases, comparable in quality to the text produced by people. In the\ncomputing education context, these models are being used to generate code, code\nexplanations, and programming exercises. The rapid adoption of these models has\nprompted multiple position papers and workshops which discuss the implications\nof these models for computing education, both positive and negative. This paper\npresents results from a series of semi-structured interviews with 12 students\nand 6 instructors about their awareness, experiences, and preferences regarding\nthe use of tools powered by generative AI in computing classrooms. The results\nsuggest that Generative AI (GAI) tools will play an increasingly significant\nrole in computing education. However, students and instructors also raised\nnumerous concerns about how these models should be integrated to best support\nthe needs and learning goals of students. We also identified interesting\ntensions and alignments that emerged between how instructors and students\nprefer to engage with these models. We discuss these results and provide\nrecommendations related to curriculum development, assessment methods, and\npedagogical practice. As GAI tools become increasingly prevalent, it's\nimportant to understand educational stakeholders' preferences and values to\nensure that these tools can be used for good and that potential harms can be\nmitigated.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:54:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zastudil","Cynthia",""],["Rogalska","Magdalena",""],["Kapp","Christine",""],["Vaughn","Jennifer",""],["MacNeil","Stephen",""]]}
{"id":"2308.04310","submitter":"Alexey Glutsyuk","authors":"Alexey Glutsyuk","title":"On germs of constriction curves in model of overdamped Josephson\n  junction, dynamical isomonodromic foliation and Painlev\\'e 3 equation","comments":"41 page, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  B.Josephson (Nobel Prize, 1973) predicted tunnelling effect for a system\n(called Josephson junction) of two superconductors separated by a narrow\ndielectric: existence of a supercurrent through it and equations governing it.\nThe overdamped Josephson junction is modeled by a family of differential\nequations on 2-torus depending on 3 parameters: $B$, $A$, $\\omega$. We study\nits rotation number $\\rho(B,A;\\omega)$ as a function of parameters. The\nthree-dimensional phase-lock areas are the level sets $L_r:=\\{\\rho=r\\}$ with\nnon-empty interiors; they exist for $r\\in\\mathbb Z$ (Buchstaber, Karpov,\nTertychnyi). For every fixed $\\omega>0$ and $r\\in\\mathbb Z$ the planar slice\n$L_r\\cap(\\mathbb R^2_{B,A}\\times\\{\\omega\\})$ is a garland of domains going\nvertically to infinity and separated by points; those separating points for\nwhich $A\\neq0$ are called constrictions. In a joint paper by Yu.Bibilo and the\nauthor, it was shown that 1) at each constriction the rescaled abscissa\n$\\ell:=\\frac B\\omega$ is equal to $\\rho$; 2) the family of constrictions with\ngiven $\\ell\\in\\mathbb Z$ is an analytic submanifold $Constr_\\ell$ in $(\\mathbb\nR^2_+)_{a,s}$, $a=\\omega^{-1}$, $s=\\frac A\\omega$. Here we show that the limit\npoints of $Constr_\\ell$ are $\\beta_{\\ell,k}=(0,s_{\\ell,k})$, where\n$s_{\\ell,k}>0$ are zeros of the Bessel function $J_\\ell(s)$, and it lands at\nthem regularly. Known numerical pictures show that high components of\n$Int(L_r)$ look similar. In his paper with Bibilo, the author introduced a\ncandidate to the self-similarity map between neighbor components: the\nPoincar\\'e map of the dynamical isomonodromic foliation governed by Painlev\\'e\n3 equation. Whenever well-defined, it preserves $\\rho$. We show that the\nPoincar\\'e map is well-defined on a neighborhood of the plane $\\{\na=0\\}\\subset\\mathbb R^2_{\\ell,a}\\times(\\mathbb R_+)_s$, and it sends\n$\\beta_{\\ell,k}$ to $\\beta_{\\ell,k+1}$ for integer $\\ell$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:58:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Glutsyuk","Alexey",""]]}
{"id":"2308.04311","submitter":"Florian Eppel","authors":"F. Eppel, M. Kadler, E. Ros, P. Benke, M. Giroletti, J. Hessdoerfer,\n  F. McBride and F. Roesch","title":"VLBI Probes of Jet Physics in Neutrino-Candidate Blazars","comments":"8 pages, 1 figure, 1 table, Proceedings of 38th International Cosmic\n  Ray Conference (ICRC2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, evidence has accumulated that some high-energy cosmic\nneutrinos can be associated with blazars. The strongest evidence for an\nindividual association was found in the case of the blazar TXS 0506+056 in\n2017. In July 2019, another track-like neutrino event (IC190730A) was found\nspatially coincident with the well-known bright flat-spectrum radio quasar PKS\n1502+106. PKS 1502+106 was not found to be in a particularly elevated gamma-ray\nstate, but exhibited a remarkably bright radio outburst at the time of the\nneutrino detection, similar to TXS 0506+056. We have performed a\nmulti-frequency VLBI study from 15 GHz up to 86 GHz on TXS 0506+056, PKS\n1502+106 and one additional neutrino-candidate blazar (PKS 0215+015) to study\nthe radio structure of neutrino candidate blazars in response to their neutrino\nassociation. We have obtained target of opportunity observations with the VLBA\nfor all three sources within $\\sim$1 month from their associated neutrino\nevents and are performing multi-epoch studies of the jet kinematics at 15 GHz\nas part of the MOJAVE program. Here, we present first results on TXS 0506+056\nat 86 GHz and one additional 43 GHz image obtained 27 days after IC170922A,\ncloser in time to the neutrino event than previously published images. We also\ngive an overview about our recent work on PKS 1502+106 and PKS 0215+015.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:59:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Eppel","F.",""],["Kadler","M.",""],["Ros","E.",""],["Benke","P.",""],["Giroletti","M.",""],["Hessdoerfer","J.",""],["McBride","F.",""],["Roesch","F.",""]]}
{"id":"2308.04312","submitter":"Amina Ghoul","authors":"Amina Ghoul, Itheri Yahiaoui, Anne Verroust-Blondet, and Fawzi\n  Nashashibi","title":"Interpretable Goal-Based model for Vehicle Trajectory Prediction in\n  Interactive Scenarios","comments":"arXiv admin note: text overlap with arXiv:2105.03136 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The abilities to understand the social interaction behaviors between a\nvehicle and its surroundings while predicting its trajectory in an urban\nenvironment are critical for road safety in autonomous driving. Social\ninteractions are hard to explain because of their uncertainty. In recent years,\nneural network-based methods have been widely used for trajectory prediction\nand have been shown to outperform hand-crafted methods. However, these methods\nsuffer from their lack of interpretability. In order to overcome this\nlimitation, we combine the interpretability of a discrete choice model with the\nhigh accuracy of a neural network-based model for the task of vehicle\ntrajectory prediction in an interactive environment. We implement and evaluate\nour model using the INTERACTION dataset and demonstrate the effectiveness of\nour proposed architecture to explain its predictions without compromising the\naccuracy.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:00:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ghoul","Amina",""],["Yahiaoui","Itheri",""],["Verroust-Blondet","Anne",""],["Nashashibi","Fawzi",""]]}
{"id":"2308.04313","submitter":"Jan Egger","authors":"Jan Egger, Christina Gsaxner, Xiaojun Chen, Jiang Bian, Jens Kleesiek,\n  Behrus Puladi","title":"Apple Vision Pro for Healthcare: \"The Ultimate Display\"? -- Entering the\n  Wonderland of Precision","comments":"This is a Preprint under CC BY. This work was supported by NIH/NIAID\n  R01AI172875, NIH/NCATS UL1 TR001427, the REACT-EU project KITE and enFaced\n  2.0 (FWF KLI 1044). B. Puladi was funded by the Medical Faculty of the RWTH\n  Aachen University as part of the Clinician Scientist Program. C. Gsaxner was\n  funded by the Advanced Research Opportunities Program from the RWTH Aachen\n  University","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.GR cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At the Worldwide Developers Conference (WWDC) in June 2023, Apple introduced\nthe Vision Pro. The Vision Pro is a Mixed Reality (MR) headset, more\nspecifically it is a Virtual Reality (VR) device with an additional Video\nSee-Through (VST) capability. The VST capability turns the Vision Pro also into\nan Augmented Reality (AR) device. The AR feature is enabled by streaming the\nreal world via cameras to the (VR) screens in front of the user's eyes. This is\nof course not unique and similar to other devices, like the Varjo XR-3.\nNevertheless, the Vision Pro has some interesting features, like an inside-out\nscreen that can show the headset wearers' eyes to \"outsiders\" or a button on\nthe top, called \"Digital Crown\", that allows you to seamlessly blend digital\ncontent with your physical space by turning it. In addition, it is untethered,\nexcept for the cable to the battery, which makes the headset more agile,\ncompared to the Varjo XR-3. This could actually come closer to the \"Ultimate\nDisplay\", which Ivan Sutherland had already sketched in 1965. Not available to\nthe public yet, like the Ultimate Display, we want to take a look into the\ncrystal ball in this perspective to see if it can overcome some clinical\nchallenges that - especially - AR still faces in the medical domain, but also\ngo beyond and discuss if the Vision Pro could support clinicians in essential\ntasks to spend more time with their patients.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:01:51 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 13:34:57 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 05:03:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Egger","Jan",""],["Gsaxner","Christina",""],["Chen","Xiaojun",""],["Bian","Jiang",""],["Kleesiek","Jens",""],["Puladi","Behrus",""]]}
{"id":"2308.04314","submitter":"Lin Yang","authors":"Lin Yang, Xuchuang Wang, Mohammad Hajiesmaili, Lijun Zhang, John C.S.\n  Lui, Don Towsley","title":"Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal\n  Individual Regret and Constant Communication Costs","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":"  Recently, there has been extensive study of cooperative multi-agent\nmulti-armed bandits where a set of distributed agents cooperatively play the\nsame multi-armed bandit game. The goal is to develop bandit algorithms with the\noptimal group and individual regrets and low communication between agents. The\nprior work tackled this problem using two paradigms: leader-follower and fully\ndistributed algorithms. Prior algorithms in both paradigms achieve the optimal\ngroup regret. The leader-follower algorithms achieve constant communication\ncosts but fail to achieve optimal individual regrets. The state-of-the-art\nfully distributed algorithms achieve optimal individual regrets but fail to\nachieve constant communication costs. This paper presents a simple yet\neffective communication policy and integrates it into a learning algorithm for\ncooperative bandits. Our algorithm achieves the best of both paradigms: optimal\nindividual regret and constant communication costs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:02:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yang","Lin",""],["Wang","Xuchuang",""],["Hajiesmaili","Mohammad",""],["Zhang","Lijun",""],["Lui","John C. S.",""],["Towsley","Don",""]]}
{"id":"2308.04315","submitter":"S. Fournais","authors":"S{\\o}ren Fournais, L\\'eo Morin and Nicolas Raymond","title":"Purely magnetic tunnelling between radial magnetic wells","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This article is devoted to the semiclassical spectral analysis of the\nmagnetic Laplacian in two dimensions. Assuming that the magnetic field is\npositive and has two symmetric radial wells, we establish an accurate\ntunnelling formula, that is a one-term estimate of the spectral gap between the\nlowest two eigenvalues. This gap is exponentially small when the semiclassical\nparameter goes to zero, but positive.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:06:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fournais","S\u00f8ren",""],["Morin","L\u00e9o",""],["Raymond","Nicolas",""]]}
{"id":"2308.04316","submitter":"Donald M. Davis","authors":"Donald M. Davis","title":"Geodesic complexity of a cube","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The topological (resp. geodesic) complexity of a topological (resp. metric)\nspace is roughly the smallest number of continuous rules required to choose\npaths (resp. shortest paths) between any points of the space. We prove that the\ngeodesic complexity of a cube exceeds its topological complexity by exactly 2.\nThe proof involves a careful analysis of cut loci of the cube.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:08:32 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Davis","Donald M.",""]]}
{"id":"2308.04317","submitter":"Mankei Tsang","authors":"Xiao-Jie Tan and Mankei Tsang","title":"Quantum limit to subdiffraction incoherent optical imaging. III.\n  Numerical analysis","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To investigate the fundamental limit to far-field incoherent imaging, the\nprequels to this work [M. Tsang, Phys. Rev. A 99, 012305 (2019); 104, 052411\n(2021)] have studied a quantum lower bound on the error of estimating an object\nmoment and proved a scaling law for the bound with respect to the object size.\nAs the scaling law was proved only in the asymptotic limit of vanishing object\nsize, this work performs a numerical analysis of the quantum bound to verify\nthat the law works well for nonzero object sizes in reality. We also use the\nnumerical bounds to study the optimality of a measurement called spatial-mode\ndemultiplexing or SPADE, showing that SPADE not only follows the scaling but is\nalso numerically close to being optimal, at least for low-order moments.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:09:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tan","Xiao-Jie",""],["Tsang","Mankei",""]]}
{"id":"2308.04318","submitter":"Amol Aggarwal","authors":"Amol Aggarwal and Jiaoyang Huang","title":"Local Statistics and Concentration for Non-intersecting Brownian Bridges\n  With Smooth Boundary Data","comments":"110 pages, 14 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 consider non-intersecting Brownian bridges, under fairly\ngeneral upper and lower boundaries, and starting and ending data. Under the\nassumption that these boundary data induce a smooth limit shape (without empty\nfacets), we establish two results. The first is a nearly optimal concentration\nbound for the Brownian bridges in this model. The second is that the bulk local\nstatistics of these bridges along any fixed time converge to the sine process.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:10:03 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Aggarwal","Amol",""],["Huang","Jiaoyang",""]]}
{"id":"2308.04319","submitter":"Dario Tagliaferri","authors":"Dario Tagliaferri and Marouan Mizmizi and Giacomo Oliveri and Umberto\n  Spagnolini and Andrea Massa","title":"Reconfigurable and Static EM Skins on Vehicles for Localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Electromagnetic skins (EMSs) have been recently considered as a booster for\nwireless sensing, but their usage on mobile targets is relatively novel and\ncould be of interest when the target reflectivity can/must be increased to\nimprove its detection or the estimation of parameters. In particular, when\nilluminated by a wide-bandwidth signal (e.g., from a radar operating at\nmillimeter waves), vehicles behave like \\textit{extended targets}, since\nmultiple parts of the vehicle's body effectively contribute to the\nback-scattering. Moreover, in some cases perspective deformations challenge the\ncorrect localization of the vehicle. To address these issues, we propose\nlodging EMSs on vehicles' roof to act as high-reflectivity planar\nretro-reflectors toward the sensing terminal. The advantage is twofold:\n\\textit{(i)} by introducing a compact high-reflectivity structure on the\ntarget, we make vehicles behave like \\textit{point targets}, avoiding\nperspective deformations and related ranging biases and \\textit{(ii)} we\nincrease the reflectivity the vehicle, improving localization performance. We\ndetail the EMS design from the system-level to the full-wave-level considering\nboth reconfigurable intelligent surfaces (RIS) and cost-effective static\npassive electromagnetic skins (SP-EMSs). Localization performance of the\nEMS-aided sensing system is also assessed by Cram\\'er-Rao bound analysis in\nboth narrowband and spatially wideband operating conditions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:11:21 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Tagliaferri","Dario",""],["Mizmizi","Marouan",""],["Oliveri","Giacomo",""],["Spagnolini","Umberto",""],["Massa","Andrea",""]]}
{"id":"2308.04320","submitter":"Maximilian Gl\\\"aser","authors":"Max Gl\\\"aser, Marc E. Pfetsch","title":"Sub-Exponential Lower Bounds for Branch-and-Bound with General\n  Disjunctions via Interpolation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates linear programming based branch-and-bound using\ngeneral disjunctions, also known as stabbing planes, for solving integer\nprograms. We derive the first sub-exponential lower bound (in the encoding\nlength $L$ of the integer program) for the size of a general branch-and-bound\ntree for a particular class of (compact) integer programs, namely\n$2^{\\Omega(L^{1/12 -\\epsilon})}$ for every $\\epsilon >0$. This is achieved by\nshowing that general branch-and-bound admits quasi-feasible monotone real\ninterpolation, which allows us to utilize sub-exponential lower-bounds for\nmonotone real circuits separating the so-called clique-coloring pair. One\nimportant ingredient of the proof is that for every general branch-and-bound\ntree proving integer-freeness of a product $P\\times Q$ of two polytopes $P$ and\n$Q$, there exists a closely related branch-and-bound tree for showing\ninteger-freeness of $P$ or one showing integer-freeness of $Q$. Moreover, we\nprove that monotone real circuits can perform binary search efficiently.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:14:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gl\u00e4ser","Max",""],["Pfetsch","Marc E.",""]]}
{"id":"2308.04321","submitter":"Weixuan Sun","authors":"Weixuan Sun, Yanhao Zhang, Zhen Qin, Zheyuan Liu, Lin Cheng, Fanyi\n  Wang, Yiran Zhong, Nick Barnes","title":"All-pairs Consistency Learning for Weakly Supervised Semantic\n  Segmentation","comments":"ICCV 2023 workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we propose a new transformer-based regularization to better\nlocalize objects for Weakly supervised semantic segmentation (WSSS). In\nimage-level WSSS, Class Activation Map (CAM) is adopted to generate object\nlocalization as pseudo segmentation labels. To address the partial activation\nissue of the CAMs, consistency regularization is employed to maintain\nactivation intensity invariance across various image augmentations. However,\nsuch methods ignore pair-wise relations among regions within each CAM, which\ncapture context and should also be invariant across image views. To this end,\nwe propose a new all-pairs consistency regularization (ACR). Given a pair of\naugmented views, our approach regularizes the activation intensities between a\npair of augmented views, while also ensuring that the affinity across regions\nwithin each view remains consistent. We adopt vision transformers as the\nself-attention mechanism naturally embeds pair-wise affinity. This enables us\nto simply regularize the distance between the attention matrices of augmented\nimage pairs. Additionally, we introduce a novel class-wise localization method\nthat leverages the gradients of the class token. Our method can be seamlessly\nintegrated into existing WSSS methods using transformers without modifying the\narchitectures. We evaluate our method on PASCAL VOC and MS COCO datasets. Our\nmethod produces noticeably better class localization maps (67.3% mIoU on PASCAL\nVOC train), resulting in superior WSSS performances.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:14:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sun","Weixuan",""],["Zhang","Yanhao",""],["Qin","Zhen",""],["Liu","Zheyuan",""],["Cheng","Lin",""],["Wang","Fanyi",""],["Zhong","Yiran",""],["Barnes","Nick",""]]}
{"id":"2308.04322","submitter":"Huibing Wang","authors":"Huibing Wang, Tianxiang Cui, Mingze Yao, Huijuan Pang, Yushan Du","title":"Domain Adaptive Person Search via GAN-based Scene Synthesis for\n  Cross-scene Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Person search has recently been a challenging task in the computer vision\ndomain, which aims to search specific pedestrians from real\ncameras.Nevertheless, most surveillance videos comprise only a handful of\nimages of each pedestrian, which often feature identical backgrounds and\nclothing. Hence, it is difficult to learn more discriminative features for\nperson search in real scenes. To tackle this challenge, we draw on Generative\nAdversarial Networks (GAN) to synthesize data from surveillance videos. GAN has\nthrived in computer vision problems because it produces high-quality images\nefficiently. We merely alter the popular Fast R-CNN model, which is capable of\nprocessing videos and yielding accurate detection outcomes. In order to\nappropriately relieve the pressure brought by the two-stage model, we design an\nAssisted-Identity Query Module (AIDQ) to provide positive images for the behind\npart. Besides, the proposed novel GAN-based Scene Synthesis model that can\nsynthesize high-quality cross-id person images for person search tasks. In\norder to facilitate the feature learning of the GAN-based Scene Synthesis\nmodel, we adopt an online learning strategy that collaboratively learns the\nsynthesized images and original images. Extensive experiments on two widely\nused person search benchmarks, CUHK-SYSU and PRW, have shown that our method\nhas achieved great performance, and the extensive ablation study further\njustifies our GAN-synthetic data can effectively increase the variability of\nthe datasets and be more realistic.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:15:51 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Huibing",""],["Cui","Tianxiang",""],["Yao","Mingze",""],["Pang","Huijuan",""],["Du","Yushan",""]]}
{"id":"2308.04323","submitter":"Miguel Zamora","authors":"Zhaoting Li, Miguel Zamora, Hehui Zheng, Stelian Coros","title":"Embracing Safe Contacts with Contact-aware Planning and Control","comments":"RSS 2023. Workshop: Experiment-oriented Locomotion and Manipulation\n  Research","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unlike human beings that can employ the entire surface of their limbs as a\nmeans to establish contact with their environment, robots are typically\nprogrammed to interact with their environments via their end-effectors, in a\ncollision-free fashion, to avoid damaging their environment. In a departure\nfrom such a traditional approach, this work presents a contact-aware controller\nfor reference tracking that maintains interaction forces on the surface of the\nrobot below a safety threshold in the presence of both rigid and soft contacts.\nFurthermore, we leveraged the proposed controller to extend the BiTRRT\nsample-based planning method to be contact-aware, using a simplified contact\nmodel. The effectiveness of our framework is demonstrated in hardware\nexperiments using a Franka robot in a setup inspired by the Amazon stowing\ntask. A demo video of our results can be seen here:\nhttps://youtu.be/2WeYytauhNg\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:16:51 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Zhaoting",""],["Zamora","Miguel",""],["Zheng","Hehui",""],["Coros","Stelian",""]]}
{"id":"2308.04324","submitter":"Sourav Chowdhury Dr","authors":"Sourav Chowdhury, Supriyo Majumder, Rajan Mishra, Arup Kumar Mandal,\n  Anita Bagri, Satish Yadav, Suman Karmarkar, D. M. Phase, and R. J. Choudhary","title":"Room temperature reversible colossal volto-magnetic effect in all-oxide\n  metallicmagnet/topotactic-phase-transition material heterostructures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multiferroic materials have undergone extensive research in the past two\ndecades in an effort to produce a sizable room-temperature magneto-electric\n(ME) effect in either exclusive or composite materials for use in a variety of\nelectronic or spintronic devices. These studies have looked into the ME effect\nby switching the electric polarization by the magnetic field or switching the\nmagnetism by the electric field. Here, an innovative way is developed to knot\nthe functional properties based on the tremendous modulation of electronics and\nmagnetization by the electric field of the topotactic phase transitions (TPT)\nin heterostructures composed of metallic-magnet/TPT-material. It is divulged\nthat application of a nominal potential difference of 2-3 Volts induces\ngigantic changes in magnetization by 100-250% leading to colossal Voltomagnetic\neffect, which would be tremendously beneficial for low-power consumption\napplications in spintronics. Switching electronics and magnetism by inducing\nTPT through applying an electric field requires much less energy, making such\nTPT-based systems promising for energy-efficient memory and logic applications\nas well as opening a plethora of tremendous opportunities for applications in\ndifferent domains.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:17:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chowdhury","Sourav",""],["Majumder","Supriyo",""],["Mishra","Rajan",""],["Mandal","Arup Kumar",""],["Bagri","Anita",""],["Yadav","Satish",""],["Karmarkar","Suman",""],["Phase","D. M.",""],["Choudhary","R. J.",""]]}
{"id":"2308.04325","submitter":"Sjoerd Hermes","authors":"Sjoerd Hermes, Joost van Heerwaarden, Pariya Behrouzi","title":"A Spatial Autoregressive Graphical Model with Applications in\n  Intercropping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Within the statistical literature, there is a lack of methods that allow for\nasymmetric multivariate spatial effects to model relations underlying complex\nspatial phenomena. Intercropping is one such phenomenon. In this ancient\nagricultural practice multiple crop species or varieties are cultivated\ntogether in close proximity and are subject to mutual competition. To properly\nanalyse such a system, it is necessary to account for both within- and\nbetween-plot effects, where between-plot effects are asymmetric. Building on\nthe multivariate spatial autoregressive model and the Gaussian graphical model,\nthe proposed method takes asymmetric spatial relations into account, thereby\nremoving some of the limiting factors of spatial analyses and giving\nresearchers a better indication of the existence and extend of spatial\nrelationships. Using a Bayesian-estimation framework, the model shows promising\nresults in the simulation study. The model is applied on intercropping data\nconsisting of Belgian endive and beetroot, illustrating the usage of the\nproposed methodology. An R package containing the proposed methodology can be\nfound on https:// CRAN.R-project.org/package=SAGM.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:17:33 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 09:53:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hermes","Sjoerd",""],["van Heerwaarden","Joost",""],["Behrouzi","Pariya",""]]}
{"id":"2308.04326","submitter":"Young Min Park","authors":"Young Min Park and Solkeun Jee","title":"Numerical Study on Interactional Aerodynamics of a Quadcopter in Hover\n  with Overset Mesh in OpenFOAM","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":"  Interactional aerodynamics of a quadcopter in hover is numerically\ninvestigated in this study. The main objective is to understand major flow\nstructures associated with unsteady airloads on multirotor aircraft. The\noverset mesh approach is used to resolve flow structures in unsteady simulation\nusing the flow solver OpenFOAM. The current computational study demonstrates\nthat aerodynamic interaction between quadcopter components strongly affects the\nrotor wake, generating interesting vortical structures. Multiple rotors in\nclose proximity generate $\\Omega$-shaped vortical structures merged from\nrotor-tip vortices. The fuselage of the current quadcopter deflects the wake\nflow of the four rotors towards the center of the vehicle. Such interactional\naerodynamics, i.e., rotor-rotor and rotor-fuselage interaction, varies the\ninflow condition of a rotor blade during the rotor revolution. Therefore, the\nquadcopter experiences unsteady airloads per rotor revolution. Our study\nindicates that a typical quadcopter would experience 8/rev thrust variations,\nwhich are a combined outcome from 4/rev thrust variations on the rotor and\n2/rev fluctuations on the fuselage. The current understanding of interactional\naerodynamics could help to design reliable and efficient multicopter aircraft.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:17:53 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Park","Young Min",""],["Jee","Solkeun",""]]}
{"id":"2308.04327","submitter":"Wenbin Li","authors":"Xiaoping Yao, Yechen Xun, Ziye Zhu, Shu Zhao, Wenbin Li","title":"Unraveling the unusually high electrical conductivity of the delafossite\n  metal PdCoO$_2$","comments":"6 pages, 3 figures","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 prototypical delafossite metal PdCoO$_2$ has been the subject of intense\ninterest for hosting exotic transport properties. Using first-principles\ntransport calculations and theoretical modeling, we reveal that the high\nelectrical conductivity of PdCoO$_2$ at room temperature originates from the\ncontributions of both high Fermi velocities, enabled by Pd $4d_{z^2}-5s$\nhybridization, and exceptionally weak electron-phonon coupling, which leads to\na coupling strength ($\\lambda=0.057$) that is nearly an order of magnitude\nsmaller than those of common metals. The abnormally weak electron-phonon\ncoupling in PdCoO$_2$ results from a low electronic density of states at the\nFermi level, as well as the large and strongly facetted Fermi surface with\nsuppressed Umklapp electron-phonon matrix elements. We anticipate that our work\nwill inform the design of unconventional metals with superior transport\nproperties.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:18:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Yao","Xiaoping",""],["Xun","Yechen",""],["Zhu","Ziye",""],["Zhao","Shu",""],["Li","Wenbin",""]]}
{"id":"2308.04328","submitter":"Nadia Nahar","authors":"Nadia Nahar, Haoran Zhang, Grace Lewis, Shurui Zhou, Christian\n  K\\\"astner","title":"A Dataset and Analysis of Open-Source Machine Learning Products","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) components are increasingly incorporated into software\nproducts, yet developers face challenges in transitioning from ML prototypes to\nproducts. Academic researchers struggle to propose solutions to these\nchallenges and evaluate interventions because they often do not have access to\nclose-sourced ML products from industry. In this study, we define and identify\nopen-source ML products, curating a dataset of 262 repositories from GitHub, to\nfacilitate further research and education. As a start, we explore six broad\nresearch questions related to different development activities and report 21\nfindings from a sample of 30 ML products from the dataset. Our findings reveal\na variety of development practices and architectural decisions surrounding\ndifferent types and uses of ML models that offer ample opportunities for future\nresearch innovations. We also find very little evidence of industry best\npractices such as model testing and pipeline automation within the open-source\nML products, which leaves room for further investigation to understand its\npotential impact on the development and eventual end-user experience for the\nproducts.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:19:13 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nahar","Nadia",""],["Zhang","Haoran",""],["Lewis","Grace",""],["Zhou","Shurui",""],["K\u00e4stner","Christian",""]]}
{"id":"2308.04329","submitter":"Noam Soker","authors":"Noam Soker (Technion, Israel)","title":"Predicting gravitational waves from jittering-jets-driven core collapse\n  supernovae","comments":"Will be submitted in two days to allow for comments","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I estimate the frequencies of gravitational waves from jittering jets that\nexplode core collapse supernovae (CCSNe) to crudely be 5-30 Hz, and with\nstrains that might allow detection of Galactic CCSNe. The jittering jets\nexplosion mechanism (JJEM) asserts that most CCSNe are exploded by jittering\njets that the newly born neutron star (NS) launches within few seconds.\nAccording to the JJEM, instabilities in the accreted gas lead to the formation\nof intermittent accretion disks that launch the jittering jets. Earlier studies\nthat did not include jets calculated the gravitational frequencies that\ninstabilities around the NS emit to have a peak in the crude frequency range of\n100-2000 Hz. Based on a recent study, I take the source of the gravitational\nwaves of jittering jets to be the turbulent bubbles (cocoons) that the jets\ninflate as they interact with the outer layers of the core of the star at\nthousands of kilometres from the NS. The lower frequencies and larger strain\nthan those of gravitational waves from instabilities in CCSNe allow future, and\nmaybe present, detectors to identify the gravitational wave signals of\njittering jets. Detection of gravitational waves from local CCSNe might\ndistinguish between the neutrino-driven explosion mechanism and the JJEM.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:19:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Soker","Noam","","Technion, Israel"]]}
{"id":"2308.04330","submitter":"Xurong Chi","authors":"Xurong Chi, Jingrun Chen, Zhouwang Yang","title":"The Random Feature Method for Solving Interface Problems","comments":"Due to the limitation \"The abstract field cannot be longer than 1,920\n  characters\", the abstract appearing here is slightly shorter than that in the\n  PDF file","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interface problems have long been a major focus of scientific computing,\nleading to the development of various numerical methods. Traditional mesh-based\nmethods often employ time-consuming body-fitted meshes with standard\ndiscretization schemes or unfitted meshes with tailored schemes to achieve\ncontrollable accuracy and convergence rate. Along another line, mesh-free\nmethods bypass mesh generation but lack robustness in terms of convergence and\naccuracy due to the low regularity of solutions. In this study, we propose a\nnovel method for solving interface problems within the framework of the random\nfeature method. This approach utilizes random feature functions in conjunction\nwith a partition of unity as approximation functions. It evaluates partial\ndifferential equations, boundary conditions, and interface conditions on\ncollocation points in equal footing, and solves a linear least-squares system\nto obtain the approximate solution. To address the issue of low regularity, two\nsets of random feature functions are used to approximate the solution on each\nside of the interface, which are then coupled together via interface\nconditions. We validate our method through a series of increasingly complex\nnumerical examples. Our findings show that despite the solution often being\nonly continuous or even discontinuous, our method not only eliminates the need\nfor mesh generation but also maintains high accuracy, akin to the spectral\ncollocation method for smooth solutions. Remarkably, for the same accuracy\nrequirement, our method requires two to three orders of magnitude fewer degrees\nof freedom than traditional methods, demonstrating its significant potential\nfor solving interface problems with complex geometries.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:19:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chi","Xurong",""],["Chen","Jingrun",""],["Yang","Zhouwang",""]]}
{"id":"2308.04331","submitter":"Anindya Bijoy Das","authors":"Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love and Christopher\n  G. Brinton","title":"Preserving Sparsity and Privacy in Straggler-Resilient Distributed\n  Matrix Computations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CR math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing approaches to distributed matrix computations involve allocating\ncoded combinations of submatrices to worker nodes, to build resilience to\nstragglers and/or enhance privacy. In this study, we consider the challenge of\npreserving input sparsity in such approaches to retain the associated\ncomputational efficiency enhancements. First, we find a lower bound on the\nweight of coding, i.e., the number of submatrices to be combined to obtain\ncoded submatrices to provide the resilience to the maximum possible number of\nstragglers (for given number of nodes and their storage constraints). Next we\npropose a distributed matrix computation scheme which meets this exact lower\nbound on the weight of the coding. Further, we develop controllable trade-off\nbetween worker computation time and the privacy constraint for sparse input\nmatrices in settings where the worker nodes are honest but curious. Numerical\nexperiments conducted in Amazon Web Services (AWS) validate our assertions\nregarding straggler mitigation and computation speed for sparse matrices.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:21:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Das","Anindya Bijoy",""],["Ramamoorthy","Aditya",""],["Love","David J.",""],["Brinton","Christopher G.",""]]}
{"id":"2308.04332","submitter":"Yannick Metz","authors":"Yannick Metz, David Lindner, Rapha\\\"el Baur, Daniel Keim, Mennatallah\n  El-Assady","title":"RLHF-Blender: A Configurable Interactive Interface for Learning from\n  Diverse Human Feedback","comments":"14 pages, 3 figures","journal-ref":"ICML2023 Interactive Learning from Implicit Human Feedback\n  Workshop","doi":null,"report-no":null,"categories":"cs.LG cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To use reinforcement learning from human feedback (RLHF) in practical\napplications, it is crucial to learn reward models from diverse sources of\nhuman feedback and to consider human factors involved in providing feedback of\ndifferent types. However, the systematic study of learning from diverse types\nof feedback is held back by limited standardized tooling available to\nresearchers. To bridge this gap, we propose RLHF-Blender, a configurable,\ninteractive interface for learning from human feedback. RLHF-Blender provides a\nmodular experimentation framework and implementation that enables researchers\nto systematically investigate the properties and qualities of human feedback\nfor reward learning. The system facilitates the exploration of various feedback\ntypes, including demonstrations, rankings, comparisons, and natural language\ninstructions, as well as studies considering the impact of human factors on\ntheir effectiveness. We discuss a set of concrete research opportunities\nenabled by RLHF-Blender. More information is available at\nhttps://rlhfblender.info/.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:21:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Metz","Yannick",""],["Lindner","David",""],["Baur","Rapha\u00ebl",""],["Keim","Daniel",""],["El-Assady","Mennatallah",""]]}
{"id":"2308.04333","submitter":"George Boateng","authors":"George Boateng, Jonathan Abrefah Mensah, Kevin Takyi Yeboah, William\n  Edor, Andrew Kojo Mensah-Onumah, Naafi Dasana Ibrahim, Nana Sam Yeboah","title":"Towards an AI to Win Ghana's National Science and Maths Quiz","comments":"7 pages. Under review at Deep Learning Indaba and Black in AI\n  Workshop @NeurIPS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL cs.CY cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Can an AI win Ghana's National Science and Maths Quiz (NSMQ)? That is the\nquestion we seek to answer in the NSMQ AI project, an open-source project that\nis building AI to compete live in the NSMQ and win. The NSMQ is an annual live\nscience and mathematics competition for senior secondary school students in\nGhana in which 3 teams of 2 students compete by answering questions across\nbiology, chemistry, physics, and math in 5 rounds over 5 progressive stages\nuntil a winning team is crowned for that year. The NSMQ is an exciting live\nquiz competition with interesting technical challenges across speech-to-text,\ntext-to-speech, question-answering, and human-computer interaction. In this\nongoing work that began in January 2023, we give an overview of the project,\ndescribe each of the teams, progress made thus far, and the next steps toward\nour planned launch and debut of the AI in October for NSMQ 2023. An AI that\nconquers this grand challenge can have real-world impact on education such as\nenabling millions of students across Africa to have one-on-one learning support\nfrom this AI.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:26:58 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Boateng","George",""],["Mensah","Jonathan Abrefah",""],["Yeboah","Kevin Takyi",""],["Edor","William",""],["Mensah-Onumah","Andrew Kojo",""],["Ibrahim","Naafi Dasana",""],["Yeboah","Nana Sam",""]]}
{"id":"2308.04334","submitter":"Claudiu Raicu","authors":"Zhao Gao, Claudiu Raicu and Keller VandeBogert","title":"Some questions arising from the study of cohomology on flag varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A fundamental problem at the confluence of algebraic geometry and\nrepresentation theory is to describe the cohomology of line bundles on flag\nvarieties over a field of characteristic p. When p=0, the solution is given by\nthe celebrated Borel-Weil-Bott Theorem, while for p>0 the problem is widely\nopen. In this note we describe a collection of open questions that arise from\nthe study of particular cases of the general theory, focusing on their\ncombinatorial and commutative algebra aspects.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:28:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gao","Zhao",""],["Raicu","Claudiu",""],["VandeBogert","Keller",""]]}
{"id":"2308.04335","submitter":"Thorsten Balduin","authors":"Thorsten Balduin, Peter Woitke, Wing-Fai Thi, Uffe Gr{\\aa}e\n  J{\\o}rgensen, Yasuhito Narita","title":"Size-dependent charging of dust particles in protoplanetary disks Can\n  turbulence cause charge separation and lightning?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Protoplanetary disk are the foundation of planet formation. Lightning can\nhave a profound impact on the chemistry of planetary atmospheres. The emergence\nof lightning in a similar manner in protoplanetary disks, would substantially\nalter the chemistry of protoplanetary disks. We aim to study under which\nconditions lightning could emerge within protoplanetary disks. We employ the\nProDiMo code to make 2D thermo-chemical models of protoplanetary disks. We\nincluded a new way of how the code handles dust grains, which allows the\nconsideration of dust grains of different sizes. We investigate the chemical\ncomposition, dust charging behaviour and charge balance of these models, to\ndetermine which regions could be most sufficient for lightning. We identify 6\nregions within the disks where the charge balance is dominated by different\nradiation processes and find that the emergence of lightning is most probable\nin the lower and warmer regions of the midplane. This is due to the low\nelectron abundance ($n_{\\rm e}/n_{\\rm\\langle H \\rangle}<10^{-15}$) in these\nregions and dust grains being the most abundant negative charge carriers ($\nn_{\\rm Z}/n_{\\rm\\langle H \\rangle}> 10^{-13}$). We find that $\\rm NH4^+$ is the\nmost abundant positive charge carrier in those regions at the same abundances\nas the dust grains. We then develop a method of inducing electric fields via\nturbulence within this mix of dust grains and $\\rm NH_4^+$. The electric fields\ngenerated with this mechanism are however several orders of magnitude weaker\nthan required to overcome the critical electric field.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:28:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Balduin","Thorsten",""],["Woitke","Peter",""],["Thi","Wing-Fai",""],["J\u00f8rgensen","Uffe Gr\u00e5e",""],["Narita","Yasuhito",""]]}
{"id":"2308.04336","submitter":"Krzysztof Turowski","authors":"Alan Frieze and Krzysztof Turowski and Wojciech Szpankowski","title":"On the concentration of the maximum degree in the duplication-divergence\n  models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a rigorous and precise analysis of the maximum degree and the\naverage degree in a dynamic duplication-divergence graph model introduced by\nSol\\'e, Pastor-Satorras et al. in which the graph grows according to a\nduplication-divergence mechanism, i.e. by iteratively creating a copy of some\nnode and then randomly alternating the neighborhood of a new node with\nprobability $p$. This model captures the growth of some real-world processes\ne.g. biological or social networks.\n  In this paper, we prove that for some $0 < p < 1$ the maximum degree and the\naverage degree of a duplication-divergence graph on $t$ vertices are\nasymptotically concentrated with high probability around $t^p$ and $\\max\\{t^{2\np - 1}, 1\\}$, respectively, i.e. they are within at most a polylogarithmic\nfactor from these values with probability at least $1 - t^{-A}$ for any\nconstant $A > 0$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:30:07 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Frieze","Alan",""],["Turowski","Krzysztof",""],["Szpankowski","Wojciech",""]]}
{"id":"2308.04337","submitter":"Fadhil Muhammad","authors":"Fadhil Muhammad, Alif Bintang Elfandra, Iqbal Pahlevi Amin, Alfan\n  Farizki Wicaksono","title":"Pengembangan Model untuk Mendeteksi Kerusakan pada Terumbu Karang dengan\n  Klasifikasi Citra","comments":"in Indonesian language","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The abundant biodiversity of coral reefs in Indonesian waters is a valuable\nasset that needs to be preserved. Rapid climate change and uncontrolled human\nactivities have led to the degradation of coral reef ecosystems, including\ncoral bleaching, which is a critical indicator of coral health conditions.\nTherefore, this research aims to develop an accurate classification model to\ndistinguish between healthy corals and corals experiencing bleaching. This\nstudy utilizes a specialized dataset consisting of 923 images collected from\nFlickr using the Flickr API. The dataset comprises two distinct classes:\nhealthy corals (438 images) and bleached corals (485 images). These images have\nbeen resized to a maximum of 300 pixels in width or height, whichever is\nlarger, to maintain consistent sizes across the dataset.\n  The method employed in this research involves the use of machine learning\nmodels, particularly convolutional neural networks (CNN), to recognize and\ndifferentiate visual patterns associated with healthy and bleached corals. In\nthis context, the dataset can be used to train and test various classification\nmodels to achieve optimal results. By leveraging the ResNet model, it was found\nthat a from-scratch ResNet model can outperform pretrained models in terms of\nprecision and accuracy. The success in developing accurate classification\nmodels will greatly benefit researchers and marine biologists in gaining a\nbetter understanding of coral reef health. These models can also be employed to\nmonitor changes in the coral reef environment, thereby making a significant\ncontribution to conservation and ecosystem restoration efforts that have\nfar-reaching impacts on life.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:30:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Muhammad","Fadhil",""],["Elfandra","Alif Bintang",""],["Amin","Iqbal Pahlevi",""],["Wicaksono","Alfan Farizki",""]]}
{"id":"2308.04338","submitter":"Kundan Kumar","authors":"Maarten V. de Hoop, Kundan Kumar","title":"Coupling of flow, contact mechanics and friction, generating waves in a\n  fractured porous medium","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a mixed dimensional model for a fractured poro-elasic medium\nincluding contact mechanics. The fracture is a lower dimensional surface\nembedded in a bulk poro-elastic matrix. The flow equation on the fracture is a\nDarcy type model that follows the cubic law for permeability. The bulk\nporo-elasticity is governed by fully dynamic Biot equations. The resulting\nmodel is a mixed dimensional type where the fracture flow on a surface is\ncoupled to a bulk flow and geomechanics model. The particularity of the work\nhere is in considering fully dynamic Biot equation, that is, including an\ninertia term, and the contact mechanics including friction for the fracture\nsurface. We prove the well-posedness of the continuous model.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:31:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["de Hoop","Maarten V.",""],["Kumar","Kundan",""]]}
{"id":"2308.04339","submitter":"Pierre de la Harpe","authors":"Pierre de la Harpe","title":"Spectral multiplicity functions of adjacency operators of graphs and\n  cospectral infinite graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The adjacency operator of a graph has a spectrum and a class of scalar-valued\nspectral measures which have been systematically analyzed; it also has a\nspectral multiplicity function which has been less studied. The first purpose\nof this article is to review a small number of examples of infinite graphs $G =\n(V,E)$ for which the spectral multiplicity function of the adjacency operator\n$A_G$ of $G$ has been determined. The second purpose of this article is to show\nexplicit examples of infinite connected graphs which are cospectral, i.e.,\nwhich have unitarily equivalent adjacency operators.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:36:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["de la Harpe","Pierre",""]]}
{"id":"2308.04340","submitter":"Hewei Yu","authors":"Baozhu Liu, Hewei Yu","title":"A Lightweight and Accurate Face Detection Algorithm Based on Retinaface","comments":"14 pages, 5 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a lightweight and accurate face detection algorithm\nLAFD (Light and accurate face detection) based on Retinaface. Backbone network\nin the algorithm is a modified MobileNetV3 network which adjusts the size of\nthe convolution kernel, the channel expansion multiplier of the inverted\nresiduals block and the use of the SE attention mechanism. Deformable\nconvolution network(DCN) is introduced in the context module and the algorithm\nuses focal loss function instead of cross-entropy loss function as the\nclassification loss function of the model. The test results on the WIDERFACE\ndataset indicate that the average accuracy of LAFD is 94.1%, 92.2% and 82.1%\nfor the \"easy\", \"medium\" and \"hard\" validation subsets respectively with an\nimprovement of 3.4%, 4.0% and 8.3% compared to Retinaface and 3.1%, 4.1% and\n4.1% higher than the well-performing lightweight model, LFFD. If the input\nimage is pre-processed and scaled to 1560px in length or 1200px in width, the\nmodel achieves an average accuracy of 86.2% on the 'hard' validation subset.\nThe model is lightweight, with a size of only 10.2MB.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:36:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liu","Baozhu",""],["Yu","Hewei",""]]}
{"id":"2308.04341","submitter":"Chelse Swoopes","authors":"Catherine Huang, Chelse Swoopes, Christina Xiao, Jiaqi Ma, Himabindu\n  Lakkaraju","title":"Accurate, Explainable, and Private Models: Providing Recourse While\n  Minimizing Training Data Leakage","comments":"Proceedings of The Second Workshop on New Frontiers in Adversarial\n  Machine Learning (AdvML-Frontiers @ ICML 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning models are increasingly utilized across impactful domains to\npredict individual outcomes. As such, many models provide algorithmic recourse\nto individuals who receive negative outcomes. However, recourse can be\nleveraged by adversaries to disclose private information. This work presents\nthe first attempt at mitigating such attacks. We present two novel methods to\ngenerate differentially private recourse: Differentially Private Model (DPM)\nand Laplace Recourse (LR). Using logistic regression classifiers and real world\nand synthetic datasets, we find that DPM and LR perform well in reducing what\nan adversary can infer, especially at low FPR. When training dataset size is\nlarge enough, we find particular success in preventing privacy leakage while\nmaintaining model and recourse accuracy with our novel LR method.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:38:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Huang","Catherine",""],["Swoopes","Chelse",""],["Xiao","Christina",""],["Ma","Jiaqi",""],["Lakkaraju","Himabindu",""]]}
{"id":"2308.04342","submitter":"Ignacio Taboada","authors":"Pranav Dave, Ignacio Taboada (for the IceCube Collaboration)","title":"A time variability test for neutrino sources identified by IceCube","comments":null,"journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-973","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  IceCube has reported evidence for neutrino emission from the Seyfert-II\ngalaxy NGC 1068 and the blazar TXS 0506+056. The former was identified in a\ntime-integrated search, and the latter using time-dependent and multi-messenger\nmethods. A natural question is: are sources identified in time-integrated\nsearches consistent with a steady neutrino source? We present a non-parametric\nmethod, TAUNTON, to answer this question. Motivated by the Cram\\'er-von Mises\ntest, TAUNTON is an unbinned single-hypothesis method to identify deviations in\nneutrino data from the steady hypothesis. An advantage of TAUNTON is that it is\nsensitive to arbitrary deviations from the steady hypothesis. Here we present\nresults of TAUNTON applied to a 8.7 year data-set of muon neutrino track\nevents; the same data used to identify NGC 1068 at 4.2$\\sigma$. We use TAUNTON\non 51 objects, a subset (with >4 signal neutrinos) of the 110 objects studied\nin the NGC 1068 publication. We set a threshold of 3$\\sigma$ pre-trial to\nidentify sources inconsistent with the steady hypothesis. TAUNTON reports a\np-value of 0.9 for NGC 1068, consistent with the steady hypothesis. Using the\ntime integrated fit, data for TXS 0506+056 is consistent with the steady\nhypothesis at 1.7$\\sigma$. Time variability is not identified for TXS 0506+056\nbecause there are few neutrino events.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:43:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dave","Pranav","","for the IceCube Collaboration"],["Taboada","Ignacio","","for the IceCube Collaboration"]]}
{"id":"2308.04343","submitter":"Yi Bin","authors":"Yi Bin, Haoxuan Li, Yahui Xu, Xing Xu, Yang Yang, Heng Tao Shen","title":"Unifying Two-Stream Encoders with Transformers for Cross-Modal Retrieval","comments":"Accepted at ACM Multimedia 2023","journal-ref":null,"doi":"10.1145/3581783.3612427","report-no":null,"categories":"cs.CV cs.IR cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most existing cross-modal retrieval methods employ two-stream encoders with\ndifferent architectures for images and texts, \\textit{e.g.}, CNN for images and\nRNN/Transformer for texts. Such discrepancy in architectures may induce\ndifferent semantic distribution spaces and limit the interactions between\nimages and texts, and further result in inferior alignment between images and\ntexts. To fill this research gap, inspired by recent advances of Transformers\nin vision tasks, we propose to unify the encoder architectures with\nTransformers for both modalities. Specifically, we design a cross-modal\nretrieval framework purely based on two-stream Transformers, dubbed\n\\textbf{Hierarchical Alignment Transformers (HAT)}, which consists of an image\nTransformer, a text Transformer, and a hierarchical alignment module. With such\nidentical architectures, the encoders could produce representations with more\nsimilar characteristics for images and texts, and make the interactions and\nalignments between them much easier. Besides, to leverage the rich semantics,\nwe devise a hierarchical alignment scheme to explore multi-level\ncorrespondences of different layers between images and texts. To evaluate the\neffectiveness of the proposed HAT, we conduct extensive experiments on two\nbenchmark datasets, MSCOCO and Flickr30K. Experimental results demonstrate that\nHAT outperforms SOTA baselines by a large margin. Specifically, on two key\ntasks, \\textit{i.e.}, image-to-text and text-to-image retrieval, HAT achieves\n7.6\\% and 16.7\\% relative score improvement of Recall@1 on MSCOCO, and 4.4\\%\nand 11.6\\% on Flickr30k respectively. The code is available at\n\\url{https://github.com/LuminosityX/HAT}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:43:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bin","Yi",""],["Li","Haoxuan",""],["Xu","Yahui",""],["Xu","Xing",""],["Yang","Yang",""],["Shen","Heng Tao",""]]}
{"id":"2308.04344","submitter":"Xun-Wang Yan","authors":"Jianfeng Zhang, Huazhen Li, Ming Yan, Miao Gao, Fengjie Ma, Xun-Wang\n  Yan, and Z. Y. Xie","title":"Structural, electronic, magnetic properties of Cu-doped lead-apatite\n  Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O","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://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent report of superconductivity in the Cu-doped PbPO compound\nstimulates the extensive researches on its physical properties. Herein, the\ndetailed atomic and electronic structures of this compound are investigated,\nwhich are the necessary information to explain the physical properties,\nincluding possible superconductivity. By the first-principles electronic\nstructure calculations, we find that the partial replacement of Pb at $4f$ site\nby Cu atom, instead of Pb at $6h$ site, plays a crucial role in dominating the\nelectronic state at Fermi energy. The $3d$ electronic orbitals of Cu atom\nemerge near the Fermi energy and exhibit strong spin-polarization, resulting in\nthe local moment around the doped Cu atom. Particularly, the ground state of\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O (x = 1) is determined to be a semiconducting\nphase, in good agreement with the experimental measurements.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:45:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Jianfeng",""],["Li","Huazhen",""],["Yan","Ming",""],["Gao","Miao",""],["Ma","Fengjie",""],["Yan","Xun-Wang",""],["Xie","Z. Y.",""]]}
{"id":"2308.04345","submitter":"Thomas Wellings Dr","authors":"Thomas Welling, Fatemeh Banaie Heravan, Abhinav Sharma, Lodewijk\n  Gelauff, Regula Haenggli, Evangelos Pournaras","title":"Fair and Inclusive Participatory Budgeting: Voter Experience with\n  Cumulative and Quadratic Voting Interfaces","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cumulative and quadratic voting are two distributional voting methods that\nare expressive, promoting fairness and inclusion, particularly in the realm of\nparticipatory budgeting. Despite these benefits, graphical voter interfaces for\ncumulative and quadratic voting are complex to implement and use effectively.\nAs a result, such methods have not seen yet widespread adoption on digital\nvoting platforms. This paper addresses the challenge by introducing an\nimplementation and evaluation of cumulative and quadratic voting within a\nstate-of-the-art voting platform: Stanford Participatory Budgeting. The\nfindings of the study show that while voters prefer simple methods, the more\nexpressive (and complex) cumulative voting becomes the preferred one compared\nto k-ranking voting that is simpler but less expressive. The implemented voting\ninterface elements are found useful and support the observed voters'\npreferences for more expressive voting methods. *\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:45:55 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Welling","Thomas",""],["Heravan","Fatemeh Banaie",""],["Sharma","Abhinav",""],["Gelauff","Lodewijk",""],["Haenggli","Regula",""],["Pournaras","Evangelos",""]]}
{"id":"2308.04346","submitter":"Pranav Narayanan Venkit","authors":"Pranav Narayanan Venkit, Sanjana Gautam, Ruchi Panchanadikar, Ting-Hao\n  `Kenneth' Huang and Shomir Wilson","title":"Unmasking Nationality Bias: A Study of Human Perception of Nationalities\n  in AI-Generated Articles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We investigate the potential for nationality biases in natural language\nprocessing (NLP) models using human evaluation methods. Biased NLP models can\nperpetuate stereotypes and lead to algorithmic discrimination, posing a\nsignificant challenge to the fairness and justice of AI systems. Our study\nemploys a two-step mixed-methods approach that includes both quantitative and\nqualitative analysis to identify and understand the impact of nationality bias\nin a text generation model. Through our human-centered quantitative analysis,\nwe measure the extent of nationality bias in articles generated by AI sources.\nWe then conduct open-ended interviews with participants, performing qualitative\ncoding and thematic analysis to understand the implications of these biases on\nhuman readers. Our findings reveal that biased NLP models tend to replicate and\namplify existing societal biases, which can translate to harm if used in a\nsociotechnical setting. The qualitative analysis from our interviews offers\ninsights into the experience readers have when encountering such articles,\nhighlighting the potential to shift a reader's perception of a country. These\nfindings emphasize the critical role of public perception in shaping AI's\nimpact on society and the need to correct biases in AI systems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:46:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Venkit","Pranav Narayanan",""],["Gautam","Sanjana",""],["Panchanadikar","Ruchi",""],["Huang","Ting-Hao `Kenneth'",""],["Wilson","Shomir",""]]}
{"id":"2308.04347","submitter":"Carolina Bolognani","authors":"Carolina Bolognani, Danny van Dyk, K. Keri Vos","title":"New determination of $|V_{ub}/V_{cb}|$ from $B_s^0\\to \\lbrace K^-, D_s^-\n  \\rbrace \\mu^+\\nu$","comments":"21 pages, 5 figures, 3 tables, and supplementary material","journal-ref":null,"doi":null,"report-no":"EOS-2023-03, IPPP/23/42, Nikhef-2023-08","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We update the full set of $\\bar{B}_s\\rightarrow K$ form factors using\nlight-cone sum rules with an on-shell kaon. Our approach determines the\nrelevant sum rule parameters -- the duality thresholds -- from a Bayesian fit\nfor the first time. Using a modified version of the Boyd-Grinstein-Lebed\nparametrisation, we combine our sum rule results at low momentum transfer $q^2$\nwith more precise lattice QCD results at large $q^2$. We obtain a consistent\ndescription of the form factors in the full $q^2$ range. Applying these results\nto a recent LHCb measurement of branching ratios for the decays $B_s^0 \\to\n\\lbrace K^-, D_s^-\\rbrace \\mu^+\\nu_\\mu$, we determine the ratio of\nCabibbo-Kobayashi-Maskawa elements $$ \\notag\n\\left|\\frac{V_{ub}}{V_{cb}}\\right|_{q^2<7\\; \\textrm{GeV}^2} = 0.0681\\pm 0.0040\n\\quad \\text{and} \\quad \\left|\\frac{V_{ub}}{V_{cb}}\\right|_{q^2>7\n\\;\\textrm{GeV}^2} = 0.0801\\pm 0.0047 \\ , $$ which are mutually compatible at\nthe $1.9\\sigma$ level. We further comment on the sensitivity to Beyond the\nStandard Model effects through measurements of the shape of $B_s^0 \\to K^-\n\\mu^+\\nu_\\mu$ decays, in light of recent limits on such effects from other\nexclusive $b\\to u\\ell\\nu$ processes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:50:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bolognani","Carolina",""],["van Dyk","Danny",""],["Vos","K. Keri",""]]}
{"id":"2308.04348","submitter":"James Sellers","authors":"Shane Chern and James A. Sellers","title":"An infinite family of internal congruences modulo powers of 2 for\n  partitions into odd parts with designated summands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects\nwhich they called \\emph{partitions with designated summands}. These are built\nby taking unrestricted integer partitions and designating exactly one of each\noccurrence of a part. In that same work, Andrews, Lewis, and Lovejoy also\nstudied such partitions wherein all parts must be odd, and they denoted the\nnumber of such partitions of size $n$ by the function $PDO(n)$. Since then,\nnumerous authors have proven a variety of divisibility properties satisfied by\n$PDO(n)$. Recently, the second author proved the following internal congruences\nsatisfied by $PDO(n)$: For all $n\\geq 0$, \\begin{align*} PDO(4n) &\\equiv PDO(n)\n\\pmod{4},\\\\ PDO(16n) &\\equiv PDO(4n) \\pmod{8}. \\end{align*} In this work, we\nsignificantly extend these internal congruence results by proving the following\nnew infinite family of congruences: For all $k\\geq 0$ and all $n\\geq 0$,\n$$PDO(2^{2k+3}n) \\equiv PDO(2^{2k+1}n) \\pmod{2^{2k+3}}.$$ We utilize several\nclassical tools to prove this family, including generating function dissections\nvia the unitizing operator of degree two, various modular relations and\nrecurrences involving a Hauptmodul on the classical modular curve $X_0(6)$, and\nan induction argument which provides the final step in proving the necessary\ndivisibilities. It is notable that the construction of each $2$-dissection\nslice of our generating function bears an entirely different nature to those\nstudied in the past literature.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:51:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chern","Shane",""],["Sellers","James A.",""]]}
{"id":"2308.04349","submitter":"Thomas Fl\\\"oss","authors":"Thomas Fl\\\"oss, Diederik Roest, Tom Westerdijk","title":"Non-linear Electrodynamics from Massive Gravity","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a counterpart to the four-fermion interaction, which describes massive\nvector exchange at low energies, we investigate the low energy effective action\nof photons under exchange of a massive graviton. We show how integrating out a\nmassive graviton leads to the most general duality-invariant vector\ninteractions in 4D or, vice versa, how any such interactions have a natural\ninterpretation within massive gravity. Moreover, we demonstrate how the special\ncase of Born-Infeld theory arises from arguably the simplest graviton potential\nwithin ghost-free dRGT massive gravity.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:53:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Fl\u00f6ss","Thomas",""],["Roest","Diederik",""],["Westerdijk","Tom",""]]}
{"id":"2308.04350","submitter":"Wenbin Li","authors":"Shu Zhao, Jiaming Hu, Ziye Zhu, Xiaoping Yao, Wenbin Li","title":"Chirality-induced spin splitting in 1D InSeI","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Spin-orbit coupling (SOC) in chiral materials can induce chirality-dependent\nspin splitting, enabling electrical manipulation of spin polarization. Here, we\nuse first-principles calculations to investigate the electronic states of\nchiral one-dimensional (1D) InSeI, which has two enantiomorphic configurations\nwith left- and right-handedness. We find that opposite spin states exist in the\nleft- and right-handed 1D InSeI with significant spin splitting. Although the\nspin states at the conduction band minimum (CBM) and valence band maximum (VBM)\nare both degenerate, a direct-to-indirect bandgap transition occurs when a\nmoderate tensile strain ($\\sim$4%) is applied along the 1D chain direction,\nleading to chirality-dependent and collinear spin-momentum locking at the CBM.\nThese findings indicate that 1D InSeI is a promising material for chiral\nspintronics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:55:29 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhao","Shu",""],["Hu","Jiaming",""],["Zhu","Ziye",""],["Yao","Xiaoping",""],["Li","Wenbin",""]]}
{"id":"2308.04351","submitter":"Marks Ruziboev","authors":"Andrew Larkin and Marks Ruziboev","title":"Quenched decay of correlations for random contracting Lorenz maps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we consider i.i.d. random perturbations of contracting Lorenz\nmaps sufficiently close to a Rovella parameter. We prove that the quenched\ncorrelations of the random dynamical system decay exponentially.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:58:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Larkin","Andrew",""],["Ruziboev","Marks",""]]}
{"id":"2308.04352","submitter":"Ziyu Zhu","authors":"Ziyu Zhu, Xiaojian Ma, Yixin Chen, Zhidong Deng, Siyuan Huang, Qing Li","title":"3D-VisTA: Pre-trained Transformer for 3D Vision and Text Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  3D vision-language grounding (3D-VL) is an emerging field that aims to\nconnect the 3D physical world with natural language, which is crucial for\nachieving embodied intelligence. Current 3D-VL models rely heavily on\nsophisticated modules, auxiliary losses, and optimization tricks, which calls\nfor a simple and unified model. In this paper, we propose 3D-VisTA, a\npre-trained Transformer for 3D Vision and Text Alignment that can be easily\nadapted to various downstream tasks. 3D-VisTA simply utilizes self-attention\nlayers for both single-modal modeling and multi-modal fusion without any\nsophisticated task-specific design. To further enhance its performance on 3D-VL\ntasks, we construct ScanScribe, the first large-scale 3D scene-text pairs\ndataset for 3D-VL pre-training. ScanScribe contains 2,995 RGB-D scans for 1,185\nunique indoor scenes originating from ScanNet and 3R-Scan datasets, along with\npaired 278K scene descriptions generated from existing 3D-VL tasks, templates,\nand GPT-3. 3D-VisTA is pre-trained on ScanScribe via masked language/object\nmodeling and scene-text matching. It achieves state-of-the-art results on\nvarious 3D-VL tasks, ranging from visual grounding and dense captioning to\nquestion answering and situated reasoning. Moreover, 3D-VisTA demonstrates\nsuperior data efficiency, obtaining strong performance even with limited\nannotations during downstream task fine-tuning.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:59:17 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhu","Ziyu",""],["Ma","Xiaojian",""],["Chen","Yixin",""],["Deng","Zhidong",""],["Huang","Siyuan",""],["Li","Qing",""]]}
{"id":"2308.04353","submitter":"Wei Wu","authors":"Shilin Zhu, Wei Wu, Zheng Li, Jianlin Luo","title":"First order transition in Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O ($0.9<x<1.1$)\n  containing Cu$_2$S","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":"  Lee et al. reported that the compound LK99, with a chemical formula of\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O ($0.9<x<1.1$), exhibits room-temperature\nsuperconductivity under ambient pressure. In this study, we investigated the\ntransport and magnetic properties of pure Cu$_2$S and LK-99 containing Cu$_2$S.\nWe observed a sharp superconducting-like transition and a thermal hysteresis\nbehavior in the resistivity and magnetic susceptibility. However, we did not\nobserve zero-resistivity below the transition temperature. We argue that the\nso-called superconducting behavior in LK-99 is most likely due to a reduction\nin resistivity caused by the first order structural phase transition of Cu$_2$S\nat around 385 K, from the $\\beta$ phase at high temperature to the $\\gamma$\nphase at low temperature.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:59:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhu","Shilin",""],["Wu","Wei",""],["Li","Zheng",""],["Luo","Jianlin",""]]}
{"id":"2308.04354","submitter":"Martin Kr\\v{s}\\v{s}\\'ak","authors":"Martin Kr\\v{s}\\v{s}\\'ak","title":"Bulk Action Growth for Holographic Complexity","comments":"6 pages, 1 Figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The action growth proposal relates the holographic complexity to the value of\nthe action on the Wheeler-de Witt patch. We introduce a new method of\ncalculating the gravitational action using the \"bulk\" term, i.e. the part of\nthe Einstein-Hilbert action quadratic in connection coefficients. We\ndemonstrate how to address the issue of non-covariance of the bulk action and\nevaluate it using the tetrad formalism. Due to the boundary term-free nature of\nthe bulk action, we can gain further insights into the spatial structure of the\naction on the Wheeler-de Witt patch. We then argue that our entire scheme can\nbe naturally covariantized within the framework of teleparallel geometry.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:00:16 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 18:01:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kr\u0161\u0161\u00e1k","Martin",""]]}
{"id":"2308.04355","submitter":"Muhammad Mahboob Ur Rahman","authors":"S. Anas Ali, M. Saqib Niaz, Mubashir Rehman, Ahsan Mehmood, M. Mahboob\n  Ur Rahman, Kashif Riaz","title":"Vascular Ageing and Smoking Habit Prediction via a Low-Cost Single-Lead\n  ECG Module","comments":"8 pages, 7 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a novel low-cost method to predict: i) the vascular age\nof a healthy young person, ii) whether or not a person is a smoker, using only\nthe lead-I of the electrocardiogram (ECG). We begin by collecting (lead-I) ECG\ndata from 42 healthy subjects (male, female, smoker, non-smoker) aged 18 to 30\nyears, using our custom-built low-cost single-lead ECG module, and\nanthropometric data, e.g., body mass index, smoking status, blood pressure etc.\nUnder our proposed method, we first pre-process our dataset by denoising the\nECG traces, followed by baseline drift removal, followed by z-score\nnormalization. Next, we divide ECG traces into overlapping segments of\nfive-second duration, which leads to a 145-fold increase in the size of the\ndataset. We then feed our dataset to a number of machine learning models, a 1D\nconvolutional neural network, a multi-layer perceptron (MLP), and ResNet18\ntransfer learning model. For vascular ageing prediction problem, Random Forest\nmethod outperforms all other methods with an R2 score of 0.99, and mean squared\nerror of 0.07. For the binary classification problem that aims to differentiate\nbetween a smoker and a non-smoker, XGBoost method stands out with an accuracy\nof 96.5%. Finally, for the 4-class classification problem that aims to\ndifferentiate between male smoker, female smoker, male non-smoker, and female\nnon-smoker, MLP method achieves the best accuracy of 97.5%. This work is\naligned with the sustainable development goals of the United Nations which aim\nto provide low-cost but quality healthcare solutions to the unprivileged\npopulation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:00:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Ali","S. Anas",""],["Niaz","M. Saqib",""],["Rehman","Mubashir",""],["Mehmood","Ahsan",""],["Rahman","M. Mahboob Ur",""],["Riaz","Kashif",""]]}
{"id":"2308.04356","submitter":"Soheyla Amirian","authors":"Nickolas Littlefield, Johannes F. Plate, Kurt R. Weiss, Ines Lohse,\n  Avani Chhabra, Ismaeel A. Siddiqui, Zoe Menezes, George Mastorakos, Sakshi\n  Mehul Thakar, Mehrnaz Abedian, Matthew F. Gong, Luke A. Carlson, Hamidreza\n  Moradi, Soheyla Amirian, and Ahmad P. Tafti","title":"Learning Unbiased Image Segmentation: A Case Study with Plain Knee\n  Radiographs","comments":"This paper has been accepted by IEEE BHI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic segmentation of knee bony anatomy is essential in orthopedics, and\nit has been around for several years in both pre-operative and post-operative\nsettings. While deep learning algorithms have demonstrated exceptional\nperformance in medical image analysis, the assessment of fairness and potential\nbiases within these models remains limited. This study aims to revisit deep\nlearning-powered knee-bony anatomy segmentation using plain radiographs to\nuncover visible gender and racial biases. The current contribution offers the\npotential to advance our understanding of biases, and it provides practical\ninsights for researchers and practitioners in medical imaging. The proposed\nmitigation strategies mitigate gender and racial biases, ensuring fair and\nunbiased segmentation results. Furthermore, this work promotes equal access to\naccurate diagnoses and treatment outcomes for diverse patient populations,\nfostering equitable and inclusive healthcare provision.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:01:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Littlefield","Nickolas",""],["Plate","Johannes F.",""],["Weiss","Kurt R.",""],["Lohse","Ines",""],["Chhabra","Avani",""],["Siddiqui","Ismaeel A.",""],["Menezes","Zoe",""],["Mastorakos","George",""],["Thakar","Sakshi Mehul",""],["Abedian","Mehrnaz",""],["Gong","Matthew F.",""],["Carlson","Luke A.",""],["Moradi","Hamidreza",""],["Amirian","Soheyla",""],["Tafti","Ahmad P.",""]]}
{"id":"2308.04357","submitter":"Lior Gishboliner","authors":"Lior Gishboliner, Zhihan Jin, Benny Sudakov","title":"Ramsey problems for monotone paths in graphs and 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 study of ordered Ramsey numbers of monotone paths for graphs and\nhypergraphs has a long history, going back to the celebrated work by Erd\\H{o}s\nand Szekeres in the early days of Ramsey theory. In this paper we obtain\nseveral results in this area, establishing two conjectures of Mubayi and Suk\nand improving bounds due to Balko, Cibulka, Kr\\'al and Kyn\\v{c}l. We also\nobtain a color-monotone version of the well-known Canonical Ramsey Theorem of\nErd\\H{o}s and Rado, which could be of independent interest.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:01:39 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gishboliner","Lior",""],["Jin","Zhihan",""],["Sudakov","Benny",""]]}
{"id":"2308.04358","submitter":"Yantao Wu","authors":"Yannick Sire, Yantao Wu, Yifu Zhou","title":"Global Existence of Weak Solutions to the Two Dimensional Nematic Liquid\n  Crystal Flow with Partially Free Boundary","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a nematic liquid crystal flow with partially free boundary in a\nsmooth bounded domain in $\\mathbb{R}^2$. We prove regularity estimates and the\nglobal existence of weak solutions enjoying partial regularity properties, and\na uniqueness result.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:01:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sire","Yannick",""],["Wu","Yantao",""],["Zhou","Yifu",""]]}
{"id":"2308.04359","submitter":"Sanjoy Chatterjee","authors":"Sanjoy Chatterjee, Golam Mostafa Mondal","title":"A characterization of bounded balanced convex domains in $\\mathbb{C}^n$","comments":"Preliminary draft, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the characterization of balanced bounded convex\ndomains in $\\mathbb{C}^n$ in terms of the squeezing function. As an\napplication, we provide a characterization of the polydisc in $\\mathbb{C}^n$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:01:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chatterjee","Sanjoy",""],["Mondal","Golam Mostafa",""]]}
{"id":"2308.04360","submitter":"Coen Del Valle","authors":"Coen del Valle and Colva M. Roney-Dougal","title":"The base size of the symmetric group acting on subsets","comments":"7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A base for a permutation group $G$ acting on a set $\\Omega$ is a subset\n$\\mathcal{B}$ of $\\Omega$ such that the pointwise stabiliser\n$G_{(\\mathcal{B})}$ is trivial. Let $n$ and $r$ be positive integers with\n$n>2r$. The symmetric and alternating groups $\\mathrm{S}_n$ and $\\mathrm{A}_n$\nadmit natural primitive actions on the set of $r$-element subsets of\n$\\{1,2,\\dots, n\\}$. Building on work of Halasi [6], we provide explicit\nexpressions for the base sizes of all of these actions, and hence determine the\nbase size of all primitive actions of $\\mathrm{S}_n$ and $\\mathrm{A}_n$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:03:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["del Valle","Coen",""],["Roney-Dougal","Colva M.",""]]}
{"id":"2308.04361","submitter":"Pasquale Dario Serpico","authors":"Pasquale Dario Serpico","title":"Cosmic ray interactions with matter and radiation","comments":"40 pages (including 4 appendices), 11 figures. To appear in\n  \"Foundations of Cosmic Ray Astrophysics\", Proceedings of the International\n  School of Physics \"Enrico Fermi\", Course 208, Varenna, 24-29 June 2022,\n  edited by F. Aharonian, E. Amato, and P. Blasi","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The main goal of the present lectures is to outline the key particle\ninteractions and energy loss mechanisms in the Galactic medium that high-energy\nparticles are subject to. These interactions are an important ingredient\nentering the cosmic ray propagation equation, contributing to shape cosmic ray\nspectra. They also source the so-called secondary species, like gamma rays,\nneutrinos, \"fragile\" nuclei not synthesised in stars, and antiparticles, all\nroutinely used as diagnostic tools in a multi-messenger context. These lectures\nare complementary to Denise Boncioli's ones, focusing instead on processes\nhappening at ultra-high energies in the extragalactic environment. They include\npropaedeutic material to Felix Aharonian's and, to some extent, Stefano\nGabici's and Carmelo Evoli's lectures.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:03:57 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Serpico","Pasquale Dario",""]]}
{"id":"2308.04362","submitter":"Abdulhafeez Abdulsalam Ayinde","authors":"Abdulhafeez A. Abdulsalam","title":"New closed forms for a class of digamma series and integrals","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The pursuit of closed forms for infinite series has long been a focal point\nof research. In this paper, we contribute to this endeavor by presenting closed\nforms for the class of digamma series: \\[\\sum_{k=1}^\\infty\n\\frac{\\psi\\left(\\frac{2k+2n+5}{4}\\right) -\n\\psi\\left(\\frac{2k+2n+3}{4}\\right)}{(2k + \\alpha)^2}, \\quad \\sum_{k=1}^\\infty\n(-1)^k \\frac{\\psi\\left(\\frac{2k+2n+5}{4}\\right) -\n\\psi\\left(\\frac{2k+2n+3}{4}\\right)}{(2k + \\alpha)^2},\\] for all non-negative\nintegers $\\alpha$ and $n$. In addition to providing closed forms for these\nseries, we unveil new identities for various generalized digamma series in the\nelegant form $a_0 + a_1 \\pi + a_2 \\pi^2 + a_3 \\pi^3$, where $a_0, \\ldots, a_3$\nare real-valued constants determined by our formulas. Furthermore, we present\nten definite integrals over the interval $(0, 1)$ that have not been previously\nstudied in the literature and appear to be nearly impossible to evaluate.\nCombining these series and integrals can lead to the discovery of even more new\nresults. Our findings contribute to the study of closed forms for infinite\nseries and integrals, offering novel results and potential avenues for further\nexploration.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:04:06 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Abdulsalam","Abdulhafeez A.",""]]}
{"id":"2308.04363","submitter":"Sushrut Ghonge","authors":"Zhuoming Zhang, Sushrut Ghonge, Yang Ding, Shubin Zhang, Mona Berciu,\n  Richard D. Schaller, Boldizs\\'ar Jank\\'o, Masaru Kuno","title":"Resonant multiple-phonon-assisted single-photon anti-Stokes\n  photoluminescence in CsPbBr3 nanocrystals","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":"  Lead-halide perovskite nanocrystals have attracted intense scrutiny due to\ntheir unusual interactions with light. They exhibit near-unity\nphotoluminescence quantum yields, cooperative superfluorescence in colloidal\nsuperlattices, and possibly refrigerate optically when excited below gap. For\nthe latter, multiple-phonon-assisted energy up-conversion to the band edge is\nfollowed by emission of higher energy, band gap photons. Unexpectedly strong\nelectron-phonon interactions, however, are needed to explain near-unity\nup-conversion efficiencies wherein multiple-phonon absorption rates become\ncompetitive with multiple-phonon-emission mediated non-radiative relaxation.\nHere, we resolve this seeming contradiction to rationalize near-unity\nanti-Stokes photoluminescence efficiencies ($\\eta_{ASPL}$) in CsPbBr3\nnanocrystals as the consequence of resonant multiple-phonon absorption by\npolarons. The theory self-consistently explains paradoxically large\nefficiencies for intrinsically-disfavored, multiple-phonon-assisted anti-Stokes\nphotoluminescence in nanocrystals. It also explains observed non-Arrhenius\n$\\eta_{ASPL}$ temperature and energy detuning dependencies. Beyond this, the\ndeveloped microscopic mechanism has immediate and important implications for\napplications of anti-Stokes photoluminescence towards condensed phase optical\nrefrigeration, radiation-balanced lasers, and the development of ultra-stable\noptical cavities.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:04:12 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Zhuoming",""],["Ghonge","Sushrut",""],["Ding","Yang",""],["Zhang","Shubin",""],["Berciu","Mona",""],["Schaller","Richard D.",""],["Jank\u00f3","Boldizs\u00e1r",""],["Kuno","Masaru",""]]}
{"id":"2308.04364","submitter":"W. A. Zuniga-Galindo","authors":"L. F. Chac\\'on-Cort\\'es, C. A. Garcia-Bibiano, W. A.\n  Z\\'u\\~niga-Galindo","title":"Turing patterns in a p-adic FitzHugh-Nagumo system on the unit ball","comments":"Final version accepted in p-Adic Numbers, Ultrametric Analysis and\n  Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce discrete and p-adic continuous versions of the FitzHugh-Nagumo\nsystem on the one-dimensional p-adic unit ball. We provide criteria for the\nexistence of Turing patterns. We present extensive simulations of some of these\nsystems. The simulations show that the Turing patterns are traveling waves in\nthe p-adic unit ball.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:04:24 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 13:36:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chac\u00f3n-Cort\u00e9s","L. F.",""],["Garcia-Bibiano","C. A.",""],["Z\u00fa\u00f1iga-Galindo","W. A.",""]]}
{"id":"2308.04365","submitter":"Matthew Vowels","authors":"Matthew J. Vowels","title":"SLEM: Machine Learning for Path Modeling and Causal Inference with Super\n  Learner Equation Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Causal inference is a crucial goal of science, enabling researchers to arrive\nat meaningful conclusions regarding the predictions of hypothetical\ninterventions using observational data. Path models, Structural Equation Models\n(SEMs), and, more generally, Directed Acyclic Graphs (DAGs), provide a means to\nunambiguously specify assumptions regarding the causal structure underlying a\nphenomenon. Unlike DAGs, which make very few assumptions about the functional\nand parametric form, SEM assumes linearity. This can result in functional\nmisspecification which prevents researchers from undertaking reliable effect\nsize estimation. In contrast, we propose Super Learner Equation Modeling, a\npath modeling technique integrating machine learning Super Learner ensembles.\nWe empirically demonstrate its ability to provide consistent and unbiased\nestimates of causal effects, its competitive performance for linear models when\ncompared with SEM, and highlight its superiority over SEM when dealing with\nnon-linear relationships. We provide open-source code, and a tutorial notebook\nwith example usage, accentuating the easy-to-use nature of the method.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:04:42 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 11:33:19 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 07:44:19 GMT"},{"version":"v4","created":"Fri, 11 Aug 2023 16:40:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Vowels","Matthew J.",""]]}
{"id":"2308.04366","submitter":"Valentin Zieglmeier","authors":"Valentin Zieglmeier","title":"The Inverse Transparency Toolchain: A Fully Integrated and Quickly\n  Deployable Data Usage Logging Infrastructure","comments":"Peer-reviewed version published in Software Impacts","journal-ref":"Software Impacts 17 (Sept. 2023), Article 100554","doi":"10.1016/j.simpa.2023.100554%20","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inverse transparency is created by making all usages of employee data visible\nto them. This requires tools that handle the logging and storage of usage\ninformation, and making logged data visible to data owners. For research and\nteaching contexts that integrate inverse transparency, creating this required\ninfrastructure can be challenging. The Inverse Transparency Toolchain presents\na flexible solution for such scenarios. It can be easily deployed and is\ntightly integrated. With it, we successfully handled use cases covering\nempirical studies with users, prototyping in university courses, and\nexperimentation with our industry partner.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:04:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zieglmeier","Valentin",""]]}
{"id":"2308.04367","submitter":"Courtney Watson","authors":"Courtney B. Watson, Elizabeth L. Blanton, Scott W. Randall, Craig L.\n  Sarazin, Arnab Sarkar, John A. ZuHone, E. M. Douglass","title":"Chandra X-Ray Observations of Abell 119: Cold Fronts And A Shock In An\n  Evolved Off-Axis Merger","comments":"Accepted for publication in The Astrophysical Journal on 08/07/2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present Chandra X-ray observations of the dynamically complex galaxy\ncluster Abell 119 ($z = 0.044$). A119 is host to two NAT radio sources\n(0053-015 & 0053-016) whose tails are oriented parallel to each other despite\northogonally oriented jet axes. Imaging and spectral analysis reveal X-ray\nemission elongated along the NE-SW axis along with the presence of complex\nstructures, including surface brightness discontinuities, which suggest\npossible merger activity along this axis. From radial profiles of the X-ray\nsurface brightness, temperature, pressure, and density, we identify two surface\nbrightness edges which are found to be cold fronts, possibly associated with\nlarge-scale sloshing of ICM gas. We also identify a brightness edge to the\nsouth which is found to be a shock front with Mach number $M = 1.21 \\pm 0.11$,\nconsistent with a merger shock. In addition, previous optical studies show\nalignment of optical substructures along the north-south direction. The\nelongated X-ray emission, orientations of the NAT tails, and alignment of\noptical substructure all suggest recent or on-going merger activity in the\nNE-SW direction.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:05:35 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:51:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Watson","Courtney B.",""],["Blanton","Elizabeth L.",""],["Randall","Scott W.",""],["Sarazin","Craig L.",""],["Sarkar","Arnab",""],["ZuHone","John A.",""],["Douglass","E. M.",""]]}
{"id":"2308.04368","submitter":"Zhibing He","authors":"Zhibing He, Dan Cheng and Yunpeng Zhao","title":"Multiple Testing of Local Extrema for Detection of Structural Breaks in\n  Piecewise Linear Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a new generic method for detecting the number and\nlocations of structural breaks or change points in piecewise linear models\nunder stationary Gaussian noise. Our method transforms the change point\ndetection problem into identifying local extrema (local maxima and local\nminima) through kernel smoothing and differentiation of the data sequence. By\ncomputing p-values for all local extrema based on peak height distributions of\nsmooth Gaussian processes, we utilize the Benjamini-Hochberg procedure to\nidentify significant local extrema as the detected change points. Our method\ncan distinguish between two types of change points: continuous breaks (Type I)\nand jumps (Type II). We study three scenarios of piecewise linear signals,\nnamely pure Type I, pure Type II and a mixture of Type I and Type II change\npoints. The results demonstrate that our proposed method ensures asymptotic\ncontrol of the False Discover Rate (FDR) and power consistency, as sequence\nlength, slope changes, and jump size increase. Furthermore, compared to\ntraditional change point detection methods based on recursive segmentation, our\napproach only requires a single test for all candidate local extrema, thereby\nachieving the smallest computational complexity proportionate to the data\nsequence length. Additionally, numerical studies illustrate that our method\nmaintains FDR control and power consistency, even in non-asymptotic cases when\nthe size of slope changes or jumps is not large. We have implemented our method\nin the R package \"dSTEM\" (available from\nhttps://cran.r-project.org/web/packages/dSTEM).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:08:54 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 23:57:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["He","Zhibing",""],["Cheng","Dan",""],["Zhao","Yunpeng",""]]}
{"id":"2308.04369","submitter":"Xiao Wang","authors":"Xiao Wang, Zongzhen Wu, Yao Rong, Lin Zhu, Bo Jiang, Jin Tang,\n  Yonghong Tian","title":"SSTFormer: Bridging Spiking Neural Network and Memory Support\n  Transformer for Frame-Event based Recognition","comments":"In Peer Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Event camera-based pattern recognition is a newly arising research topic in\nrecent years. Current researchers usually transform the event streams into\nimages, graphs, or voxels, and adopt deep neural networks for event-based\nclassification. Although good performance can be achieved on simple event\nrecognition datasets, however, their results may be still limited due to the\nfollowing two issues. Firstly, they adopt spatial sparse event streams for\nrecognition only, which may fail to capture the color and detailed texture\ninformation well. Secondly, they adopt either Spiking Neural Networks (SNN) for\nenergy-efficient recognition with suboptimal results, or Artificial Neural\nNetworks (ANN) for energy-intensive, high-performance recognition. However,\nseldom of them consider achieving a balance between these two aspects. In this\npaper, we formally propose to recognize patterns by fusing RGB frames and event\nstreams simultaneously and propose a new RGB frame-event recognition framework\nto address the aforementioned issues. The proposed method contains four main\nmodules, i.e., memory support Transformer network for RGB frame encoding,\nspiking neural network for raw event stream encoding, multi-modal bottleneck\nfusion module for RGB-Event feature aggregation, and prediction head. Due to\nthe scarce of RGB-Event based classification dataset, we also propose a\nlarge-scale PokerEvent dataset which contains 114 classes, and 27102\nframe-event pairs recorded using a DVS346 event camera. Extensive experiments\non two RGB-Event based classification datasets fully validated the\neffectiveness of our proposed framework. We hope this work will boost the\ndevelopment of pattern recognition by fusing RGB frames and event streams. Both\nour dataset and source code of this work will be released at\nhttps://github.com/Event-AHU/SSTFormer.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:15:35 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Xiao",""],["Wu","Zongzhen",""],["Rong","Yao",""],["Zhu","Lin",""],["Jiang","Bo",""],["Tang","Jin",""],["Tian","Yonghong",""]]}
{"id":"2308.04370","submitter":"Juan Wen","authors":"Juan Wen, Shupeng Cheng, Peng Xu, Bowen Zhou, Radu Timofte, Weiyan\n  Hou, Luc Van Gool","title":"When Super-Resolution Meets Camouflaged Object Detection: A Comparison\n  Study","comments":"23 pages with 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Super Resolution (SR) and Camouflaged Object Detection (COD) are two hot\ntopics in computer vision with various joint applications. For instance,\nlow-resolution surveillance images can be successively processed by\nsuper-resolution techniques and camouflaged object detection. However, in\nprevious work, these two areas are always studied in isolation. In this paper,\nwe, for the first time, conduct an integrated comparative evaluation for both.\nSpecifically, we benchmark different super-resolution methods on commonly used\nCOD datasets, and meanwhile, we evaluate the robustness of different COD models\nby using COD data processed by SR methods. Our goal is to bridge these two\ndomains, discover novel experimental phenomena, summarize new experim.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:17:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wen","Juan",""],["Cheng","Shupeng",""],["Xu","Peng",""],["Zhou","Bowen",""],["Timofte","Radu",""],["Hou","Weiyan",""],["Van Gool","Luc",""]]}
{"id":"2308.04371","submitter":"Jingqin Yang","authors":"Yifan Zhang, Jingqin Yang, Yang Yuan, Andrew Chi-Chih Yao","title":"Cumulative Reasoning with 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":"  While language models are powerful and versatile, they often fail to address\nhighly complex problems. This is because solving complex problems requires\ndeliberate thinking, which has been only minimally guided during training. In\nthis paper, we propose a new method called Cumulative Reasoning (CR), which\nemploys language models in a cumulative and iterative manner to emulate human\nthought processes. By decomposing tasks into smaller components, CR streamlines\nthe problem-solving process, rendering it both more manageable and effective.\nFor logical inference tasks, CR consistently outperforms existing methods with\nan improvement up to 9.3%, and achieves the astonishing accuracy of 98.04% on\nthe curated FOLIO wiki dataset. In the context of the Game of 24, CR achieves\nan accuracy of 98%, which signifies a substantial enhancement of 24% over the\nprevious state-of-the-art method. Finally, on the MATH dataset, we establish\nnew state-of-the-art results with 58.0% overall accuracy, surpassing the\nprevious best approach by a margin of 4.2%, and achieving 43% relative\nimprovement on the hardest level 5 problems (22.4% to 32.1%). Code is available\nat https://github.com/iiis-ai/cumulative-reasoning.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:18:20 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 14:37:37 GMT"},{"version":"v3","created":"Thu, 10 Aug 2023 08:24:09 GMT"},{"version":"v4","created":"Fri, 25 Aug 2023 02:40:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Yifan",""],["Yang","Jingqin",""],["Yuan","Yang",""],["Yao","Andrew Chi-Chih",""]]}
{"id":"2308.04372","submitter":"Anthony Hunter","authors":"Anthony Hunter","title":"Some Options for Instantiation of Bipolar Argument Graphs with Deductive\n  Arguments","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Argument graphs provide an abstract representation of an argumentative\nsituation. A bipolar argument graph is a directed graph where each node denotes\nan argument, and each arc denotes the influence of one argument on another.\nHere we assume that the influence is supporting, attacking, or ambiguous. In a\nbipolar argument graph, each argument is atomic and so it has no internal\nstructure. Yet to better understand the nature of the individual arguments, and\nhow they interact, it is important to consider their internal structure. To\naddress this need, this paper presents a framework based on the use of logical\narguments to instantiate bipolar argument graphs, and a set of possible\nconstraints on instantiating arguments that take into account the internal\nstructure of the arguments, and the types of relationship between arguments.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:22:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Hunter","Anthony",""]]}
{"id":"2308.04373","submitter":"Simon Queyrut","authors":"Simon Queyrut, Y\\'erom-David Bromberg, Valerio Schiavoni","title":"Pelta: Shielding Transformers to Mitigate Evasion Attacks in Federated\n  Learning","comments":null,"journal-ref":"DistributedML '22: Proceedings of the 3rd International Workshop\n  on Distributed Machine Learning, December 2022","doi":"10.1145/3565010.3569064","report-no":null,"categories":"cs.LG cs.CR cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main premise of federated learning is that machine learning model updates\nare computed locally, in particular to preserve user data privacy, as those\nnever leave the perimeter of their device. This mechanism supposes the general\nmodel, once aggregated, to be broadcast to collaborating and non malicious\nnodes. However, without proper defenses, compromised clients can easily probe\nthe model inside their local memory in search of adversarial examples. For\ninstance, considering image-based applications, adversarial examples consist of\nimperceptibly perturbed images (to the human eye) misclassified by the local\nmodel, which can be later presented to a victim node's counterpart model to\nreplicate the attack. To mitigate such malicious probing, we introduce Pelta, a\nnovel shielding mechanism leveraging trusted hardware. By harnessing the\ncapabilities of Trusted Execution Environments (TEEs), Pelta masks part of the\nback-propagation chain rule, otherwise typically exploited by attackers for the\ndesign of malicious samples. We evaluate Pelta on a state of the art ensemble\nmodel and demonstrate its effectiveness against the Self Attention Gradient\nadversarial Attack.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:22:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Queyrut","Simon",""],["Bromberg","Y\u00e9rom-David",""],["Schiavoni","Valerio",""]]}
{"id":"2308.04374","submitter":"Bruno Remillard","authors":"Bouchra R Nasri and Bruno N R\\'emillard and Mamadou Y Thioub","title":"Are Information criteria good enough to choose the right the number of\n  regimes in Hidden Markov Models?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Selecting the number of regimes in Hidden Markov models is an important\nproblem. There are many criteria that are used to select this number, such as\nAkaike information criterion (AIC), Bayesian information criterion (BIC),\nintegrated completed likelihood (ICL), deviance information criterion (DIC),\nand Watanabe-Akaike information criterion (WAIC), to name a few. In this\narticle, we introduced goodness-of-fit tests for general Hidden Markov models\nwith covariates, where the distribution of the observations is arbitrary, i.e.,\ncontinuous, discrete, or a mixture of both. Then, a selection procedure is\nproposed based on this goodness-of-fit test. The main aim of this article is to\ncompare the classical information criterion with the new criterion, when the\noutcome is either continuous, discrete or zero-inflated. Numerical experiments\nassess the finite sample performance of the goodness-of-fit tests, and\ncomparisons between the different criteria are made.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:23:27 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Nasri","Bouchra R",""],["R\u00e9millard","Bruno N",""],["Thioub","Mamadou Y",""]]}
{"id":"2308.04375","submitter":"Min Hun Lee","authors":"Min Hun Lee, Chong Jun Chew","title":"Understanding the Effect of Counterfactual Explanations on Trust and\n  Reliance on AI for Human-AI Collaborative Clinical Decision Making","comments":"ACM CSCW 2023","journal-ref":null,"doi":"10.1145/3610218","report-no":null,"categories":"cs.HC cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Artificial intelligence (AI) is increasingly being considered to assist human\ndecision-making in high-stake domains (e.g. health). However, researchers have\ndiscussed an issue that humans can over-rely on wrong suggestions of the AI\nmodel instead of achieving human AI complementary performance. In this work, we\nutilized salient feature explanations along with what-if, counterfactual\nexplanations to make humans review AI suggestions more analytically to reduce\noverreliance on AI and explored the effect of these explanations on trust and\nreliance on AI during clinical decision-making. We conducted an experiment with\nseven therapists and ten laypersons on the task of assessing post-stroke\nsurvivors' quality of motion, and analyzed their performance, agreement level\non the task, and reliance on AI without and with two types of AI explanations.\nOur results showed that the AI model with both salient features and\ncounterfactual explanations assisted therapists and laypersons to improve their\nperformance and agreement level on the task when `right' AI outputs are\npresented. While both therapists and laypersons over-relied on `wrong' AI\noutputs, counterfactual explanations assisted both therapists and laypersons to\nreduce their over-reliance on `wrong' AI outputs by 21\\% compared to salient\nfeature explanations. Specifically, laypersons had higher performance degrades\nby 18.0 f1-score with salient feature explanations and 14.0 f1-score with\ncounterfactual explanations than therapists with performance degrades of 8.6\nand 2.8 f1-scores respectively. Our work discusses the potential of\ncounterfactual explanations to better estimate the accuracy of an AI model and\nreduce over-reliance on `wrong' AI outputs and implications for improving\nhuman-AI collaborative decision-making.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:23:46 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lee","Min Hun",""],["Chew","Chong Jun",""]]}
{"id":"2308.04376","submitter":"Eduardo Dias DSc.","authors":"Eduardo O. Dias","title":"Space-time-symmetric quantum mechanics in 3+1 dimensions","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In conventional quantum mechanics (QM), time is treated as a parameter, $t$,\nand the evolution of the quantum state with respect to time is described by\n${\\hat {H}}|\\psi(t)\\rangle=i\\hbar \\frac{d}{dt}|\\psi(t)\\rangle$. In a recently\nproposed space-time-symmetric (STS) extension of QM, position becomes the\nparameter and a new quantum state, $|\\phi(x)\\rangle$, is introduced. This state\ndescribes the particle's arrival time at position $x$, and the way the arrival\ntime changes with respect to $x$ is governed by ${\\hat\n{P}}|\\phi(x)\\rangle=-i\\hbar \\frac{d}{dx} |\\phi(x)\\rangle$. In this work, we\ngeneralize the STS extension to a particle moving in three-dimensional space.\nBy combining the conventional QM with the three-dimensional STS extension, we\nhave a ``full'' STS QM given by the dynamic equation ${\\hat { P}}^{\\mu}|{\\phi\n}^\\mu(x^{\\mu})\\rangle=- i \\hbar~\\eta^{\\mu\\nu}\\frac{d}{dx^{\\nu}}|{\\phi}^\\mu\n(x^{\\mu})\\rangle$, where $x^{\\mu}$ is the coordinate chosen as the parameter of\nthe state. Depending on the choice of $x^\\mu$, we can recover either the\nSchr\\\"odinger equation (with $x^\\mu=x^0=t$) or the three-dimensional STS\nextension (with $x^\\mu=x^i=$ either $x$, $y$, or $z$). By selecting $x^\\mu=x$,\nwe solve the dynamic equation of the STS QM for a free particle and calculate\nthe wave function $\\langle t,y,z|\\phi^1(x)\\rangle$. This wave function\nrepresents the probability amplitude of the particle arriving at position\n($y$,$z$) at instant $t$, given that the detector occupies the entire\n$yz$-plane located at position $x$. Remarkably, we find that the integral of\n$|\\langle t,y,z|\\phi (x)\\rangle|^2$ in $y$ and $z$ takes the form of the\nthree-dimensional version of the axiomatic Kijowski distribution.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:27:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Dias","Eduardo O.",""]]}
{"id":"2308.04377","submitter":"Yanan Zhang","authors":"Yanan Zhang, Dajun Su, Zhaoyang Shan, Zihan Yang, Jiawen Zhang, Rui\n  Li, Michael Smidman, Huiqiu Yuan","title":"Superconductivity of cerium under pressures up to 54GPa","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":"  Cerium is a fascinating element due to its diverse physical properties, which\ninclude forming various crystal structures ($\\gamma$, $\\alpha$, $\\alpha^{'}$,\n$\\alpha^{''}$ and $\\epsilon$), mixed valence behavior and superconductivity,\nmaking it an ideal platform for investigating the interplay between different\nelectronic states. Here, we present a comprehensive transport study of cerium\nunder hydrostatic pressures up to 54 GPa. Upon applying pressure, cerium\nundergoes the $\\alpha$ $\\rightarrow$ $\\alpha^{''}$ transition at around 4.9\nGPa, which is accompanied by the appearance of superconductivity with $T_{\\rm\nc}$ of 0.4 K, and $T_{\\rm c}$ slightly increases to 0.5 K at 11.4 GPa. At 14.3\nGPa, $T_{\\rm c}$ suddenly increases when the $\\alpha^{''}$ phase transforms\ninto the $\\epsilon$ phase, reaching a maximum value of 1.25 K at around 17.2\nGPa. Upon further increasing the pressure, $T_{\\rm c}$ monotonically decreases.\nTogether with the results of previous studies, our findings suggest that the\nevolution of superconductivity in cerium is closely correlated with the\nmultiple pressure-induced structural transitions and corresponding unusual\nelectronic structures.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:28:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Yanan",""],["Su","Dajun",""],["Shan","Zhaoyang",""],["Yang","Zihan",""],["Zhang","Jiawen",""],["Li","Rui",""],["Smidman","Michael",""],["Yuan","Huiqiu",""]]}
{"id":"2308.04378","submitter":"Ulrich Horst","authors":"Robert Denkert and Ulrich Horst","title":"Extended mean-field control problems with multi-dimensional singular\n  controls","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider extended mean-field control problems with multi-dimensional\nsingular controls. A key challenge when analysing singular controls are jump\ncosts. When controls are one-dimensional, jump costs are most naturally\ncomputed by linear interpolation. When the controls are multi-dimensional the\nsituation is more complex, especially when the model parameters depend on an\nadditional mean-field interaction term, in which case one needs to \"jointly\"\nand \"consistently\" interpolate jumps both on a distributional and a pathwise\nlevel. This is achieved by introducing the novel concept of two-layer\nparametrisations of stochastic processes. Two-layer parametrisations allow us\nto equivalently rewrite rewards in terms of continuous functions of\nparametrisations of the control process and to derive an explicit\nrepresentation of rewards in terms of minimal jump costs. From this we derive a\nDPP for extended mean-field control problems with multi-dimensional singular\ncontrols. Under the additional assumption that the value function is continuous\nwe characterise the value function as the minimal super-solution to a certain\nquasi-variational inequality in the Wasserstein space.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:30:02 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Denkert","Robert",""],["Horst","Ulrich",""]]}
{"id":"2308.04379","submitter":"Geoff Krause","authors":"Geoff Krause, Madelaine Hare, Mike Smit, Philippe Mongeon","title":"Who Re-Uses Data? A Bibliometric Analysis of Dataset Citations","comments":"36 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Open data is receiving increased attention and support in academic\nenvironments, with one justification being that shared data may be re-used in\nfurther research. But what evidence exists for such re-use, and what is the\nrelationship between the producers of shared datasets and researchers who use\nthem? Using a sample of data citations from OpenAlex, this study investigates\nthe relationship between creators and citers of datasets at the individual,\ninstitutional, and national levels. We find that the vast majority of datasets\nhave no recorded citations, and that most cited datasets only have a single\ncitation. Rates of self-citation by individuals and institutions tend towards\nthe low end of previous findings and vary widely across disciplines. At the\ncountry level, the United States is by far the most prominent exporter of\nre-used datasets, while importation is more evenly distributed. Understanding\nwhere and how the sharing of data between researchers, institutions, and\ncountries takes place is essential to developing open research practices.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:30:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Krause","Geoff",""],["Hare","Madelaine",""],["Smit","Mike",""],["Mongeon","Philippe",""]]}
{"id":"2308.04380","submitter":"Yi Bin","authors":"Haoxuan Li, Yi Bin, Junrong Liao, Yang Yang, Heng Tao Shen","title":"Your Negative May not Be True Negative: Boosting Image-Text Matching\n  with False Negative Elimination","comments":"Accepted at ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612101","report-no":null,"categories":"cs.CV cs.IR cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most existing image-text matching methods adopt triplet loss as the\noptimization objective, and choosing a proper negative sample for the triplet\nof <anchor, positive, negative> is important for effectively training the\nmodel, e.g., hard negatives make the model learn efficiently and effectively.\nHowever, we observe that existing methods mainly employ the most similar\nsamples as hard negatives, which may not be true negatives. In other words, the\nsamples with high similarity but not paired with the anchor may reserve\npositive semantic associations, and we call them false negatives. Repelling\nthese false negatives in triplet loss would mislead the semantic representation\nlearning and result in inferior retrieval performance. In this paper, we\npropose a novel False Negative Elimination (FNE) strategy to select negatives\nvia sampling, which could alleviate the problem introduced by false negatives.\nSpecifically, we first construct the distributions of positive and negative\nsamples separately via their similarities with the anchor, based on the\nfeatures extracted from image and text encoders. Then we calculate the false\nnegative probability of a given sample based on its similarity with the anchor\nand the above distributions via the Bayes' rule, which is employed as the\nsampling weight during negative sampling process. Since there may not exist any\nfalse negative in a small batch size, we design a memory module with momentum\nto retain a large negative buffer and implement our negative sampling strategy\nspanning over the buffer. In addition, to make the model focus on hard\nnegatives, we reassign the sampling weights for the simple negatives with a\ncut-down strategy. The extensive experiments are conducted on Flickr30K and\nMS-COCO, and the results demonstrate the superiority of our proposed false\nnegative elimination strategy. The code is available at\nhttps://github.com/LuminosityX/FNE.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:31:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Li","Haoxuan",""],["Bin","Yi",""],["Liao","Junrong",""],["Yang","Yang",""],["Shen","Heng Tao",""]]}
{"id":"2308.04381","submitter":"Genji Kawakita","authors":"Genji Kawakita, Ariel Zeleznikow-Johnston, Naotsugu Tsuchiya, Masafumi\n  Oizumi","title":"Comparing Color Similarity Structures between Humans and LLMs via\n  Unsupervised Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs), such as the General Pre-trained Transformer\n(GPT), have shown remarkable performance in various cognitive tasks. However,\nit remains unclear whether these models have the ability to accurately infer\nhuman perceptual representations. Previous research has addressed this question\nby quantifying correlations between similarity response patterns from humans\nand LLMs. Although it has been shown that the correlation between humans and\nLLMs is reasonably high, simple correlation analysis is inadequate to reveal\nthe degree of detailed structural correspondence between humans and LLMs. Here,\nwe use an unsupervised alignment method based on Gromov-Wasserstein optimal\ntransport to assess the equivalence of similarity structures between humans and\nLLMs in a more detailed manner. As a tractable study, we compare the color\nsimilarity structures of humans (color-neurotypical and color-atypical\nparticipants) and two GPT models (GPT-3.5 and GPT-4) by examining the\nsimilarity structures of 93 colors. Our results show that the similarity\nstructures of color-neurotypical humans can be remarkably well-aligned to that\nof GPT-4 and, to a lesser extent, to that of GPT-3.5. These results contribute\nto our understanding of the ability of LLMs to accurately infer human\nperception, and highlight the potential of unsupervised alignment methods to\nreveal detailed structural equivalence or differences that cannot be detected\nby simple correlation analysis.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:32:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Kawakita","Genji",""],["Zeleznikow-Johnston","Ariel",""],["Tsuchiya","Naotsugu",""],["Oizumi","Masafumi",""]]}
{"id":"2308.04382","submitter":"Kazuaki Takasan","authors":"Kazuaki Takasan, Kyosuke Adachi, Kyogo Kawaguchi","title":"Activity-induced ferromagnetism in one-dimensional quantum many-body\n  systems","comments":"12 pages, 7 figure, the first two authors contributed equally","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"cond-mat.quant-gas cond-mat.soft cond-mat.stat-mech quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Active matter, an ensemble of self-propelled entities, exhibits various\nnonequilibrium phase transitions. In this paper, we construct a non-Hermitian\nquantum many-body model in one dimension analogous to the Vicsek model, a\nprototypical model of active matter, and investigate its quantum phase\ntransitions. The model consists of two-component hard-core bosons undergoing\nferromagnetic interactions and with activity: spin-dependent asymmetric\nhopping. Numerical results show the emergence of a ferromagnetic order induced\nby the activity, which is a quantum counterpart of flocking in classical\nexamples, and it even survives without the ferromagnetic interaction. We find\nthrough perturbation theory and solving the two-particle case that the\nnon-Hermitian skin effect at the two-particle level is crucial for this\nflocking phase. To take this effect into account, we employ a two-site\nmean-field theory and qualitatively reproduce the numerically obtained phase\ndiagram. We further numerically study a variant of our model, where the\nhard-core condition is relaxed, and confirm the robustness of the ferromagnetic\norder.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:35:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Takasan","Kazuaki",""],["Adachi","Kyosuke",""],["Kawaguchi","Kyogo",""]]}
{"id":"2308.04383","submitter":"Chensheng Peng","authors":"Chensheng Peng, Guangming Wang, Xian Wan Lo, Xinrui Wu, Chenfeng Xu,\n  Masayoshi Tomizuka, Wei Zhan, Hesheng Wang","title":"DELFlow: Dense Efficient Learning of Scene Flow for Large-Scale Point\n  Clouds","comments":"Accepted by ICCV2023. Codes will be released at\n  https://github.com/IRMVLab/DELFlow","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Point clouds are naturally sparse, while image pixels are dense. The\ninconsistency limits feature fusion from both modalities for point-wise scene\nflow estimation. Previous methods rarely predict scene flow from the entire\npoint clouds of the scene with one-time inference due to the memory\ninefficiency and heavy overhead from distance calculation and sorting involved\nin commonly used farthest point sampling, KNN, and ball query algorithms for\nlocal feature aggregation. To mitigate these issues in scene flow learning, we\nregularize raw points to a dense format by storing 3D coordinates in 2D grids.\nUnlike the sampling operation commonly used in existing works, the dense 2D\nrepresentation 1) preserves most points in the given scene, 2) brings in a\nsignificant boost of efficiency, and 3) eliminates the density gap between\npoints and pixels, allowing us to perform effective feature fusion. We also\npresent a novel warping projection technique to alleviate the information loss\nproblem resulting from the fact that multiple points could be mapped into one\ngrid during projection when computing cost volume. Sufficient experiments\ndemonstrate the efficiency and effectiveness of our method, outperforming the\nprior-arts on the FlyingThings3D and KITTI dataset.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:37:24 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 13:21:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Peng","Chensheng",""],["Wang","Guangming",""],["Lo","Xian Wan",""],["Wu","Xinrui",""],["Xu","Chenfeng",""],["Tomizuka","Masayoshi",""],["Zhan","Wei",""],["Wang","Hesheng",""]]}
{"id":"2308.04384","submitter":"Bertrand Lods","authors":"R. J. Alonso, V. Bagland, B. Lods","title":"The Landau equation with moderate soft potentials: An approach using\n  $\\varepsilon$-Poincar\\'e inequality and Lorentz spaces","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":"  This document presents an elementary approach using $\\varepsilon$-Poincar\\'e\ninequality to prove generation of $L^{p}$-bounds, $p\\in(1,\\infty)$, for the\nhomogeneous Landau equation with moderate soft potentials $\\gamma\\in[-2,0)$.\nThe critical case $\\gamma=-2$ uses an interpolation approach in the realm of\nLorentz spaces and entropy. Alternatively, a direct approach using the\nHardy-Littlewood-Sobolev (HLS) inequality and entropy is also presented. On\nthis basis, the generation of pointwise bounds $p=\\infty$ is deduced from a De\nGiorgi argument.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:37:26 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Alonso","R. J.",""],["Bagland","V.",""],["Lods","B.",""]]}
{"id":"2308.04385","submitter":"Nadine Bradbury","authors":"Nadine Bradbury, Raphael Ribeiro, Justin R. Caram, Daniel Neuhauser","title":"Polaritons in Large Stochastic Simulations of 2D Molecular Aggregates","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce stochastic techniques for simulating polaritons resulting from\nlarge molecular aggregate crystals ($10^8$ dyes) in realistic cavities. This\nenables the study of 2D polaritons that are derived from systems with internal\nexcitonic structure and interact with many modes of cavity light due to their\nlarge size, achieving thermodynamic convergence in both the molecular and\nphotonic subsystems. We demonstrate cases where cavity coupling may induce\nemergent delocalization not present outside of the cavity. Such examples\ndemonstrate the nontrivial role the internal aggregate Hamiltonian can play in\npolariton properties.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:40:23 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 16:26:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bradbury","Nadine",""],["Ribeiro","Raphael",""],["Caram","Justin R.",""],["Neuhauser","Daniel",""]]}
{"id":"2308.04386","submitter":"Chenglong Wang","authors":"Chenglong Wang, Hang Zhou, Kaiyan Chang, Tongran Liu, Chunliang Zhang,\n  Quan Du, Tong Xiao, Jingbo Zhu","title":"Learning Evaluation Models from Large Language Models for Sequence\n  Generation","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 achieve state-of-the-art performance on sequence\ngeneration evaluation, but typically have a large number of parameters. This is\na computational challenge as presented by applying their evaluation capability\nat scale. To overcome the challenge, in this paper, we propose \\textbf{ECT}, an\n\\textbf{e}valuation \\textbf{c}apability \\textbf{t}ransfer method, to transfer\nthe evaluation capability from LLMs to relatively lightweight language models.\nBased on the proposed ECT, we learn various evaluation models from ChatGPT, and\nemploy them as reward models to improve sequence generation models via\nreinforcement learning and reranking approaches. Experimental results on\nmachine translation, text style transfer, and summarization tasks demonstrate\nthe effectiveness of our ECT. Notably, applying the learned evaluation models\nto sequence generation models results in better generated sequences as\nevaluated by commonly used metrics and ChatGPT.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:41:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Chenglong",""],["Zhou","Hang",""],["Chang","Kaiyan",""],["Liu","Tongran",""],["Zhang","Chunliang",""],["Du","Quan",""],["Xiao","Tong",""],["Zhu","Jingbo",""]]}
{"id":"2308.04387","submitter":"Ricardo Henriques Prof","authors":"Estibaliz G\\'omez-de-Mariscal, Mario Del Rosario, Joanna W\n  Pylv\\\"an\\\"ainen, Guillaume Jacquemet, Ricardo Henriques","title":"Harnessing Artificial Intelligence To Reduce Phototoxicity in Live\n  Imaging","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fluorescence microscopy, widely used in the study of living cells, tissues,\nand organisms, often faces the challenge of photodamage. This is primarily\ncaused by the interaction between light and biochemical components during the\nimaging process, leading to compromised accuracy and reliability of biological\nresults. Methods necessitating extended high-intensity illumination, such as\nsuper-resolution microscopy or thick sample imaging, are particularly\nsusceptible to this issue. As part of the solution to these problems, advanced\nimaging approaches involving artificial intelligence (AI) have been developed.\nHere we underscore the necessity of establishing constraints to maintain\nlight-induced damage at levels that permit cells to sustain their live\nbehaviour. From this perspective, data-driven live-cell imaging bears\nsignificant potential in aiding the development of AI-enhanced\nphotodamage-aware microscopy. These technologies could streamline precise\nobservations of natural biological dynamics while minimising phototoxicity\nrisks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:41:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["G\u00f3mez-de-Mariscal","Estibaliz",""],["Del Rosario","Mario",""],["Pylv\u00e4n\u00e4inen","Joanna W",""],["Jacquemet","Guillaume",""],["Henriques","Ricardo",""]]}
{"id":"2308.04388","submitter":"Gustav Uhre Jakobsen","authors":"Gustav Uhre Jakobsen","title":"Gravitational Scattering of Compact Bodies from Worldline Quantum Field\n  Theory","comments":"PhD Thesis, 174 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"HU-EP-23/45-RTG","categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work the worldline quantum field theory (WQFT) approach to computing\nobservables of the classical general relativistic two-body system is presented.\nCompact bodies such as black holes or neutron stars are described in an\neffective field theory by worldline fields with spin degrees of freedom\nefficiently described by anti-commuting Grassmann variables. Novel results of\nthe WQFT include the gravitational bremsstrahlung at second post-Minkowskian\norder and the impulse and spin kick at third post-Minkowskian order all at\nquadratic order in spins.\n  Next, the WQFT is presented with a comprehensive discussion of its in-in\nSchwinger-Keldysh formulation, its Feynman rules and graph generation and its\non-shell one-point functions which are directly related to the scattering\nobservables of unbound motion. Here, we present the second post-Minkowskian\nquadratic-in-spin contributions to its free energy from which the impulse and\nspin kick may be derived to the corresponding order.\n  The computation of scattering observables requires the evaluation of\nmulti-loop integrals and for the computation of observables at the third\npost-Minkowskian order we analyze the required two-loop integrals. Our\ndiscussion uses retarded propagators which impose causal boundary conditions of\nthe observables.\n  Finally we turn to results of the WQFT starting with the gravitational\nbremsstrahlung of the scattering of two spinning bodies. This waveform is\ndiscussed together with its radiative information of linear and angular\nmomentum fluxes.\n  Lastly we present the conservative and radiative impulse and spin kick at\nthird post-Minkowskian order and quadratic order in spins together with the a\nconservative Hamiltonian at the corresponding perturbative order. The results\nobey a generalized Bini-Damour radiation-reaction relation and their\nconservative parts can be parametrized in terms of a single scalar.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:42:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jakobsen","Gustav Uhre",""]]}
{"id":"2308.04389","submitter":"Felix Raith","authors":"Felix Raith and Baldwin Nsonga and Gerik Scheuermann and Christian\n  Heine","title":"Fast Fiber Line Extraction for 2D Bivariate Scalar Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extracting level sets from scalar data is a fundamental operation in\nvisualization with many applications. Recently, the concept of level set\nextraction has been extended to bivariate scalar fields. Prior work on vector\nfield equivalence, wherein an analyst marks a region in the domain and is shown\nother regions in the domain with similar vector values, pointed out the need to\nmake this extraction operation fast, so that analysts can work interactively.\nTo date, the fast extraction of level sets from bivariate scalar fields has not\nbeen researched as extensively as for the univariate case. In this paper, we\npresent a novel algorithm that extracts fiber lines, i.e., the preimages of so\ncalled control polygons (FSCP), for bivariate 2D data by joint traversal of\nbounding volume hierarchies for both grid and FSCP elements. We performed an\nextensive evaluation, comparing our method to a two-dimensional adaptation of\nthe method proposed by Klacansky et al., as well as to the naive approach for\nfiber line extraction. The evaluation incorporates a vast array of\nconfigurations in several datasets. We found that our method provides a speedup\nof several orders of magnitudes compared to the naive algorithm and requires\ntwo thirds of the computation time compared to Klacansky et al. adapted for 2D.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:48:08 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Raith","Felix",""],["Nsonga","Baldwin",""],["Scheuermann","Gerik",""],["Heine","Christian",""]]}
{"id":"2308.04390","submitter":"Anders Martinsson","authors":"Anders Martinsson","title":"On the approximability of the burning number","comments":"7 pages, no figures. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The burning number of a graph $G$ is the smallest number $b$ such that the\nvertices of $G$ can be covered by balls of radii $0, 1, \\dots, b-1$. As\ncomputing the burning number of a graph is known to be NP-hard, even on trees,\nit is natural to consider polynomial time approximation algorithms for the\nquantity. The best known approximation factor in the literature is $3$ for\ngeneral graphs and $2$ for trees. In this note we give a\n$2/(1-e^{-2})+\\varepsilon=2.313\\dots$-approximation algorithm for the burning\nnumber of general graphs, and a PTAS for the burning number of trees and\nforests. Moreover, we show that computing a\n$(\\frac53-\\varepsilon)$-approximation of the burning number of a general graph\n$G$ is NP-hard.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:48:39 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 17:24:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Martinsson","Anders",""]]}
{"id":"2308.04391","submitter":"Matthew Bonas","authors":"Matthew Bonas, Christopher K. Wikle and Stefano Castruccio","title":"Calibrated Forecasts of Quasi-Periodic Climate Processes with Deep Echo\n  State Networks and Penalized Quantile Regression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Among the most relevant processes in the Earth system for human habitability\nare quasi-periodic, ocean-driven multi-year events whose dynamics are currently\nincompletely characterized by physical models, and hence poorly predictable.\nThis work aims at showing how 1) data-driven, stochastic machine learning\napproaches provide an affordable yet flexible means to forecast these\nprocesses; 2) the associated uncertainty can be properly calibrated with fast\nensemble-based approaches. While the methodology introduced and discussed in\nthis work pertains to synoptic scale events, the principle of augmenting\nincomplete or highly sensitive physical systems with data-driven models to\nimprove predictability is far more general and can be extended to environmental\nproblems of any scale in time or space.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:51:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bonas","Matthew",""],["Wikle","Christopher K.",""],["Castruccio","Stefano",""]]}
{"id":"2308.04392","submitter":"Zhongzheng Xu","authors":"Zhongzheng Xu, Kristin Williams, Emily Wall","title":"Let's Get Vysical: Perceptual Accuracy In Visual and Tactile Encodings","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":"  In this paper, we explore the effectiveness of tactile data encodings using\nswell paper in comparison to visual encodings displayed with SVGs for data\nperception tasks. By replicating and adapting Cleveland and McGill's graphical\nperception study for the tactile modality, we establish a novel tactile\nencoding hierarchy. In a study with 12 university students, we found that\nparticipants perceived visual encodings more accurately when comparing values,\njudging their ratios with lower cognitive load, and better self-evaluated\nperformance than tactile encodings. However, tactile encodings differed from\ntheir visual counterparts in terms of how accurately values could be decoded\nfrom them. This suggests that data physicalizations will require different\ndesign guidance than that developed for visual encodings. By providing\nempirical evidence for the perceptual accuracy of tactile encodings, our work\ncontributes to foundational research on forms of data representation that\nprioritize tactile perception such as tactile graphics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:52:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Xu","Zhongzheng",""],["Williams","Kristin",""],["Wall","Emily",""]]}
{"id":"2308.04393","submitter":"Sophia Flury","authors":"Sophia R. Flury (1), Edward C. Moran (2), Miriam Eleazer (1 and 2)\n  ((1) University of Massachusetts Amherst, (2) Wesleyan University)","title":"Galactic Outflow Emission Line Profiles: Evidence for Dusty,\n  Radiatively-Driven Ionized Winds in Mrk 462","comments":"MNRAS accepted, 12 pages, 9 figures, software available at\n  https://github.com/sflury/OutLines","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past half century, gas outflows and winds have been observed as\nasymmetric emission lines in a wide range of astrophysical contexts, including\ngalaxies and early-type stars. While P Cygni lines are modeled and understood\nwith physically-motivated profiles under the Sobolev approximation, asymmetric\nnebular lines are not. Previous studies of galactic outflows using nebular\nemission lines have made physically unjustified assumptions about the shape of\nthe line profile. These approaches limit assessment of outflow properties and\ndo not connect observations to the underlying physics. The physical complexity\nof galactic outflows requires a more robust approach. In response to this need,\nwe present a novel profile for modeling nebular emission lines which is\ngeneralized yet physically motivated and provides insight into the underlying\nmechanisms of galactic outflows. To demonstrate the usefulness of this profile,\nwe fit it to the asymmetric nebular lines observed in the nuclear region of Mrk\n462, a starburst-AGN composite galaxy. From analysis of the best-fit profile,\nwe conclude that the observed profile arises from a dusty\nradiation-pressure-driven outflow with a terminal velocity of 750 km s-1. This\noutflow, while weak by some standards, is still sufficiently strong to regulate\nstar formation and black hole growth in the host galaxy by removing gas from\nthe inner few kiloparsecs. Outflows like the one we observe and characterize in\nMrk 462 are crucial to our understanding of episodic gas-fueled activity in\ngalactic nuclei, which undoubtedly plays a pivotal role in galaxy evolution.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:56:00 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Flury","Sophia R.","","University of Massachusetts Amherst"],["Moran","Edward C.","","Wesleyan University"],["Eleazer","Miriam","","1 and 2"]]}
{"id":"2308.04394","submitter":"Steven R. Cranmer","authors":"Steven R. Cranmer (CU Boulder), Momchil E. Molnar (CU Boulder,\n  HAO/NCAR)","title":"Magnetohydrodynamic Mode Conversion in the Solar Corona: Insights from\n  Fresnel-like Models of Waves at Sharp Interfaces","comments":"Accepted for publication in the Astrophysical Journal. 19 pages, 10\n  figures, 1 table","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":"  The solar atmosphere is known to contain many different types of wavelike\noscillation. Waves and other fluctuations (e.g., turbulent eddies) are believed\nto be responsible for at least some of the energy transport and dissipation\nthat heats the corona and accelerates the solar wind. Thus, it is important to\nunderstand the behavior of magnetohydrodynamic (MHD) waves as they propagate\nand evolve in different regions of the Sun's atmosphere. In this paper, we\ninvestigate how MHD waves can affect the overall plasma state when they reflect\nand refract at sharp, planar interfaces in density. First, we correct an error\nin a foundational paper (Stein 1971) that affects the calculation of wave\nenergy-flux conservation. Second, we apply this model to reflection-driven MHD\nturbulence in the solar wind, where the presence of density fluctuations can\nenhance the generation of inward-propagating Alfven waves. This model\nreproduces the time-averaged Elsasser imbalance fraction (i.e., ratio of inward\nto outward Alfvenic power) from several published numerical simulations.\nLastly, we model how the complex magnetic field threading the transition region\nbetween the chromosphere and corona helps convert a fraction of\nupward-propagating Alfven waves into fast-mode and slow-mode MHD waves. These\nmagnetosonic waves dissipate in a narrow region around the transition region\nand produce a sharp peak in the heating rate. This newly found source of\nheating sometimes exceeds the expected heating rate from Alfvenic turbulence by\nan order of magnitude. It may explain why some earlier models seemed to require\nan additional ad-hoc heat source at this location.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:57:56 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cranmer","Steven R.","","CU Boulder"],["Molnar","Momchil E.","","CU Boulder,\n  HAO/NCAR"]]}
{"id":"2308.04395","submitter":"Mostafa Mehdipour Ghazi","authors":"Sebastian N{\\o}rgaard Llambias, Mads Nielsen, Mostafa Mehdipour Ghazi","title":"Data Augmentation-Based Unsupervised Domain Adaptation In Medical\n  Imaging","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":"  Deep learning-based models in medical imaging often struggle to generalize\neffectively to new scans due to data heterogeneity arising from differences in\nhardware, acquisition parameters, population, and artifacts. This limitation\npresents a significant challenge in adopting machine learning models for\nclinical practice. We propose an unsupervised method for robust domain\nadaptation in brain MRI segmentation by leveraging MRI-specific augmentation\ntechniques. To evaluate the effectiveness of our method, we conduct extensive\nexperiments across diverse datasets, modalities, and segmentation tasks,\ncomparing against the state-of-the-art methods. The results show that our\nproposed approach achieves high accuracy, exhibits broad applicability, and\nshowcases remarkable robustness against domain shift in various tasks,\nsurpassing the state-of-the-art performance in the majority of cases.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:00:11 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Llambias","Sebastian N\u00f8rgaard",""],["Nielsen","Mads",""],["Ghazi","Mostafa Mehdipour",""]]}
{"id":"2308.04396","submitter":"Jonas Blatt","authors":"Jonas Blatt, Patrick Delfmann, Petra Schubert","title":"Event Abstraction for Enterprise Collaboration Systems to Support Social\n  Process Mining","comments":"8 pages, 1 figure, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One aim of Process Mining (PM) is the discovery of process models from event\nlogs of information systems. PM has been successfully applied to\nprocess-oriented enterprise systems but is less suited for communication- and\ndocument-oriented Enterprise Collaboration Systems (ECS). ECS event logs are\nvery fine-granular and PM applied to their logs results in spaghetti models. A\ncommon solution for this is event abstraction, i.e., converting low-level logs\ninto more abstract high-level logs before running discovery algorithms. ECS\nlogs come with special characteristics that have so far not been fully\naddressed by existing event abstraction approaches. We aim to close this gap\nwith a tailored ECS event abstraction (ECSEA) approach that trains a model by\ncomparing recorded actual user activities (high-level traces) with the\nsystem-generated low-level traces (extracted from the ECS). The model allows us\nto automatically convert future low-level traces into an abstracted high-level\nlog that can be used for PM. Our evaluation shows that the algorithm produces\naccurate results. ECSEA is a preprocessing method that is essential for the\ninterpretation of collaborative work activity in ECS, which we call Social\nProcess Mining.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:00:30 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 13:56:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Blatt","Jonas",""],["Delfmann","Patrick",""],["Schubert","Petra",""]]}
{"id":"2308.04397","submitter":"Xuechao Zou","authors":"Ben Chen, Xuechao Zou, Yu Zhang, Jiayu Li, Kai Li, Pin Tao","title":"LEFormer: A Hybrid CNN-Transformer Architecture for Accurate Lake\n  Extraction from Remote Sensing Imagery","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":"  Lake extraction from remote sensing imagery is challenging due to the complex\nshapes of lakes and the presence of noise. Existing methods suffer from blurred\nsegmentation boundaries and poor foreground modeling. In this paper, we propose\na hybrid CNN-Transformer architecture, called LEFormer, for accurate lake\nextraction. LEFormer contains four main modules: CNN encoder, Transformer\nencoder, cross-encoder fusion, and lightweight decoder. The CNN encoder\nrecovers local spatial information and improves fine-scale details.\nSimultaneously, the Transformer encoder captures long-range dependencies\nbetween sequences of any length, allowing them to obtain global features and\ncontext information better. Finally, a lightweight decoder is employed for mask\nprediction. We evaluate the performance and efficiency of LEFormer on two\ndatasets, the Surface Water (SW) and the Qinghai-Tibet Plateau Lake (QTPL).\nExperimental results show that LEFormer consistently achieves state-of-the-art\n(SOTA) performance and efficiency on these two datasets, outperforming existing\nmethods. Specifically, LEFormer achieves 90.86% and 97.42% mIoU on the SW and\nQTPL datasets with a parameter count of 3.61M, respectively, while being 20x\nminor than the previous SOTA method.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:01:33 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chen","Ben",""],["Zou","Xuechao",""],["Zhang","Yu",""],["Li","Jiayu",""],["Li","Kai",""],["Tao","Pin",""]]}
{"id":"2308.04398","submitter":"Josef Jon","authors":"Josef Jon and Ond\\v{r}ej Bojar","title":"Character-level NMT and language similarity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the effectiveness of character-level neural machine translation\nusing Transformer architecture for various levels of language similarity and\nsize of the training dataset on translation between Czech and Croatian, German,\nHungarian, Slovak, and Spanish. We evaluate the models using automatic MT\nmetrics and show that translation between similar languages benefits from\ncharacter-level input segmentation, while for less related languages,\ncharacter-level vanilla Transformer-base often lags behind subword-level\nsegmentation. We confirm previous findings that it is possible to close the gap\nby finetuning the already trained subword-level models to character-level.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:01:42 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Jon","Josef",""],["Bojar","Ond\u0159ej",""]]}
{"id":"2308.04399","submitter":"Benjamin Laufer","authors":"Benjamin Laufer and Jon Kleinberg and Hoda Heidari","title":"Fine-Tuning Games: Bargaining and Adaptation for General-Purpose Models","comments":"36 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.AI econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Major advances in Machine Learning (ML) and Artificial Intelligence (AI)\nincreasingly take the form of developing and releasing general-purpose models.\nThese models are designed to be adapted by other businesses and agencies to\nperform a particular, domain-specific function. This process has become known\nas adaptation or fine-tuning. This paper offers a model of the fine-tuning\nprocess where a Generalist brings the technological product (here an ML model)\nto a certain level of performance, and one or more Domain-specialist(s) adapts\nit for use in a particular domain. Both entities are profit-seeking and incur\ncosts when they invest in the technology, and they must reach a bargaining\nagreement on how to share the revenue for the technology to reach the market.\nFor a relatively general class of cost and revenue functions, we characterize\nthe conditions under which the fine-tuning game yields a profit-sharing\nsolution. We observe that any potential domain-specialization will either\ncontribute, free-ride, or abstain in their uptake of the technology, and we\nprovide conditions yielding these different strategies. We show how methods\nbased on bargaining solutions and sub-game perfect equilibria provide insights\ninto the strategic behavior of firms in these types of interactions, and we\nfind that profit-sharing can still arise even when one firm has significantly\nhigher costs than another. We also provide methods for identifying\nPareto-optimal bargaining arrangements for a general set of utility functions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:01:42 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 20:39:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Laufer","Benjamin",""],["Kleinberg","Jon",""],["Heidari","Hoda",""]]}
{"id":"2308.04400","submitter":"Moritz Drupp A.","authors":"Moritz A. Drupp, Zachary M. Turk, Ben Groom, Jonas Heckenhahn","title":"Limited substitutability, relative price changes and the uplifting of\n  public natural capital values","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":"  As the global economy continues to grow, ecosystem services tend to stagnate\nor degrow. Economic theory has shown how such shifts in relative scarcities can\nbe reflected in the appraisal of public projects and environmental-economic\naccounting, but empirical evidence has been lacking to put the theory into\npractice. To estimate the relative price change in ecosystem services that can\nbe used to make such adjustments, we perform a global meta-analysis of\nenvironmental valuation studies to derive income elasticities of willingness to\npay (WTP) for ecosystem services as a proxy for the degree of limited\nsubstitutability. Based on 749 income-WTP pairs, we estimate an income\nelasticity of WTP of around 0.78 (95-CI: 0.6 to 1.0). Combining these results\nwith a global data set on shifts in the relative scarcity of ecosystem\nservices, we estimate relative price change of ecosystem services of around 2.2\npercent per year. In an application to natural capital valuation of non-timber\nforest ecosystem services by the World Bank, we show that their natural capital\nvalue should be uplifted by more than 50 percent (95-CI: 32 to 78 percent),\nmaterially elevating the role of public natural capital. We discuss\nimplications for relative price adjustments in policy appraisal and for\nimproving estimates of comprehensive national accounts.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:01:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Drupp","Moritz A.",""],["Turk","Zachary M.",""],["Groom","Ben",""],["Heckenhahn","Jonas",""]]}
{"id":"2308.04401","submitter":"Eleanor Sayre","authors":"Shams El-Adawy, Cydney Alexis, Eleanor C. Sayre","title":"Emerging STEM education researchers' positioning and perception of\n  discipline-based education research","comments":"18pp","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Various motivations bring researchers to discipline-based education research\n(DBER), but there is little research on their conceptualization of and\nnavigation into this new-to-them area of research. We use phenomenography to\nanalyze interview data collected from twenty-eight emerging STEM education\nresearchers to gain a better understanding of how they perceive themselves\nwithin DBER and what they perceive it to be. Grounded in the figured worlds\ntheoretical framework, we identify the spectrum of ways emerging STEM education\nresearchers identify or project themselves into this new space: to improve\ntheir teaching, to make it their new primary research field, and/or to\nnegotiate how it will fit with their primary one. We also highlight salient\nnegotiations that emerge because of the close ties between DBER and\ndisciplinary science, which provides us with a better understanding of emerging\nresearchers' perceptions. This work generates insight into the kinds of\nprofessional development opportunities that would support emerging education\nresearchers within STEM departments and the broader DBER community.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:04:38 GMT"}],"update_date":"2023-08-09","authors_parsed":[["El-Adawy","Shams",""],["Alexis","Cydney",""],["Sayre","Eleanor C.",""]]}
{"id":"2308.04402","submitter":"Shafiq Ahmad","authors":"Shafiq Ahmad, Pietro Morerio, Alessio Del Bue","title":"Person Re-Identification without Identification via Event Anonymization","comments":"Accepted at International Conference on Computer Vision (ICCV), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wide-scale use of visual surveillance in public spaces puts individual\nprivacy at stake while increasing resource consumption (energy, bandwidth, and\ncomputation). Neuromorphic vision sensors (event-cameras) have been recently\nconsidered a valid solution to the privacy issue because they do not capture\ndetailed RGB visual information of the subjects in the scene. However, recent\ndeep learning architectures have been able to reconstruct images from event\ncameras with high fidelity, reintroducing a potential threat to privacy for\nevent-based vision applications. In this paper, we aim to anonymize\nevent-streams to protect the identity of human subjects against such image\nreconstruction attacks. To achieve this, we propose an end-to-end network\narchitecture jointly optimized for the twofold objective of preserving privacy\nand performing a downstream task such as person ReId. Our network learns to\nscramble events, enforcing the degradation of images recovered from the privacy\nattacker. In this work, we also bring to the community the first ever\nevent-based person ReId dataset gathered to evaluate the performance of our\napproach. We validate our approach with extensive experiments and report\nresults on the synthetic event data simulated from the publicly available\nSoftBio dataset and our proposed Event-ReId dataset.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:04:53 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 13:15:37 GMT"},{"version":"v3","created":"Fri, 11 Aug 2023 01:21:44 GMT"},{"version":"v4","created":"Thu, 17 Aug 2023 23:00:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ahmad","Shafiq",""],["Morerio","Pietro",""],["Del Bue","Alessio",""]]}
{"id":"2308.04403","submitter":"Giorgi Tutberidze","authors":"L-E. Persson, V. Tsagareishvili and G. Tutberidze","title":"Properties of sequence of linear functionals on $BV$ with applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is devoted to investigating the sequence of some linear\nfunctionals in the space $BV$ of finite variation functions. We prove that\nunder certain conditions this sequence is bounded. We also prove that this\nresult is sharp. In particular, the obtained results can be used to study\nconvergence of some general Fourier series. Moreover, the obtained conditions\nseem to be new and useful also for classical orthonormal systems.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 06:24:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Persson","L-E.",""],["Tsagareishvili","V.",""],["Tutberidze","G.",""]]}
{"id":"2308.04404","submitter":"Sajjad Emdadi Mahdimahalleh","authors":"Sajjad Emdadi Mahdimahalleh","title":"Revolutionizing Wireless Networks with Federated Learning: A\n  Comprehensive Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  These days with the rising computational capabilities of wireless user\nequipment such as smart phones, tablets, and vehicles, along with growing\nconcerns about sharing private data, a novel machine learning model called\nfederated learning (FL) has emerged. FL enables the separation of data\nacquisition and computation at the central unit, which is different from\ncentralized learning that occurs in a data center. FL is typically used in a\nwireless edge network where communication resources are limited and unreliable.\nBandwidth constraints necessitate scheduling only a subset of UEs for updates\nin each iteration, and because the wireless medium is shared, transmissions are\nsusceptible to interference and are not assured. The article discusses the\nsignificance of Machine Learning in wireless communication and highlights\nFederated Learning (FL) as a novel approach that could play a vital role in\nfuture mobile networks, particularly 6G and beyond.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 22:32:10 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Mahdimahalleh","Sajjad Emdadi",""]]}
{"id":"2308.04405","submitter":"Cassio Machiaveli Oishi","authors":"Cassio M. Oishi and Alan A. Kaptanoglu and J. Nathan Kutz and Steven\n  L. Brunton","title":"Nonlinear parametric models of viscoelastic fluid flows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.NA math.NA physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reduced-order models have been widely adopted in fluid mechanics,\nparticularly in the context of Newtonian fluid flows. These models offer the\nability to predict complex dynamics, such as instabilities and oscillations, at\na considerably reduced computational cost. In contrast, the reduced-order\nmodeling of non-Newtonian viscoelastic fluid flows remains relatively\nunexplored. This work leverages the sparse identification of nonlinear dynamics\n(SINDy) algorithm to develop interpretable reduced-order models for a broad\nclass of viscoelastic flows. In particular, we explore a benchmark oscillatory\nviscoelastic flow on the four-roll mill geometry using the classical Oldroyd-B\nfluid. This flow exemplifies many canonical challenges associated with\nnon-Newtonian flows, including transitions, asymmetries, instabilities, and\nbifurcations arising from the interplay of viscous and elastic forces, all of\nwhich require expensive computations in order to resolve the fast timescales\nand long transients characteristic of such flows. First, we demonstrate the\neffectiveness of our data-driven surrogate model in predicting the transient\nevolution on a simplified representation of the dynamical system. We then\ndescribe the ability of the reduced-order model to accurately reconstruct\nspatial flow field in a basis obtained via proper orthogonal decomposition.\nFinally, we develop a fully parametric, nonlinear model that captures the\ndominant variations of the dynamics with the relevant nondimensional\nWeissenberg number. This work illustrates the potential to reduce computational\ncosts and improve design, optimization, and control of a large class of\nnon-Newtonian fluid flows with modern machine learning and reduced-order\nmodeling techniques.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:06:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Oishi","Cassio M.",""],["Kaptanoglu","Alan A.",""],["Kutz","J. Nathan",""],["Brunton","Steven L.",""]]}
{"id":"2308.04406","submitter":"Zihan Guan","authors":"Zihan Guan, Mengnan Du, Ninghao Liu","title":"XGBD: Explanation-Guided Graph Backdoor Detection","comments":"8 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Backdoor attacks pose a significant security risk to graph learning models.\nBackdoors can be embedded into the target model by inserting backdoor triggers\ninto the training dataset, causing the model to make incorrect predictions when\nthe trigger is present. To counter backdoor attacks, backdoor detection has\nbeen proposed. An emerging detection strategy in the vision and NLP domains is\nbased on an intriguing phenomenon: when training models on a mixture of\nbackdoor and clean samples, the loss on backdoor samples drops significantly\nfaster than on clean samples, allowing backdoor samples to be easily detected\nby selecting samples with the lowest loss values. However, the ignorance of\ntopological feature information on graph data limits its detection\neffectiveness when applied directly to the graph domain. To this end, we\npropose an explanation-guided backdoor detection method to take advantage of\nthe topological information. Specifically, we train a helper model on the graph\ndataset, feed graph samples into the model, and then adopt explanation methods\nto attribute model prediction to an important subgraph. We observe that\nbackdoor samples have distinct attribution distribution than clean samples, so\nthe explanatory subgraph could serve as more discriminative features for\ndetecting backdoor samples. Comprehensive experiments on multiple popular\ndatasets and attack methods demonstrate the effectiveness and explainability of\nour method. Our code is available:\nhttps://github.com/GuanZihan/GNN_backdoor_detection.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:10:23 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Guan","Zihan",""],["Du","Mengnan",""],["Liu","Ninghao",""]]}
{"id":"2308.04407","submitter":"Subhra Mazumdar","authors":"Diptendu Chatterjee, Prabal Banerjee and Subhra Mazumdar","title":"Chrisimos: A useful Proof-of-Work for finding Minimal Dominating Set of\n  a graph","comments":"20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hash-based Proof-of-Work (PoW) used in the Bitcoin Blockchain leads to high\nenergy consumption and resource wastage. In this paper, we aim to re-purpose\nthe energy by replacing the hash function with real-life problems having\ncommercial utility. We propose Chrisimos, a useful Proof-of-Work where miners\nare required to find a minimal dominating set for real-life graph instances. A\nminer who is able to output the smallest dominating set for the given graph\nwithin the block interval time wins the mining game. We also propose a new\nchain selection rule that ensures the security of the scheme. Thus our protocol\nalso realizes a decentralized minimal dominating set solver for any graph\ninstance. We provide formal proof of correctness and show via experimental\nresults that the block interval time is within feasible bounds of hash-based\nPoW.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:13:09 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Chatterjee","Diptendu",""],["Banerjee","Prabal",""],["Mazumdar","Subhra",""]]}
{"id":"2308.04408","submitter":"Denis Osin","authors":"P.-E. Caprace, A. Minasyan, D. Osin","title":"Simple $p$-adic Lie groups with abelian Lie algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For each prime $p$ and each positive integer $d$, we construct the first\nexamples of second countable, topologically simple, $p$-adic Lie groups of\ndimension $d$ whose Lie algebras are abelian. This answers several questions of\nGl\\\"ockner and Caprace-Monod. The proof relies on a generalization of small\ncancellation methods that applies to central extensions of acylindrically\nhyperbolic groups.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:13:41 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Caprace","P. -E.",""],["Minasyan","A.",""],["Osin","D.",""]]}
{"id":"2308.04409","submitter":"Yichao Shen","authors":"Yichao Shen, Zigang Geng, Yuhui Yuan, Yutong Lin, Ze Liu, Chunyu Wang,\n  Han Hu, Nanning Zheng, Baining Guo","title":"V-DETR: DETR with Vertex Relative Position Encoding for 3D Object\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":"  We introduce a highly performant 3D object detector for point clouds using\nthe DETR framework. The prior attempts all end up with suboptimal results\nbecause they fail to learn accurate inductive biases from the limited scale of\ntraining data. In particular, the queries often attend to points that are far\naway from the target objects, violating the locality principle in object\ndetection. To address the limitation, we introduce a novel 3D Vertex Relative\nPosition Encoding (3DV-RPE) method which computes position encoding for each\npoint based on its relative position to the 3D boxes predicted by the queries\nin each decoder layer, thus providing clear information to guide the model to\nfocus on points near the objects, in accordance with the principle of locality.\nIn addition, we systematically improve the pipeline from various aspects such\nas data normalization based on our understanding of the task. We show\nexceptional results on the challenging ScanNetV2 benchmark, achieving\nsignificant improvements over the previous 3DETR in\n$\\rm{AP}_{25}$/$\\rm{AP}_{50}$ from 65.0\\%/47.0\\% to 77.8\\%/66.0\\%,\nrespectively. In addition, our method sets a new record on ScanNetV2 and SUN\nRGB-D datasets.Code will be released at http://github.com/yichaoshen-MS/V-DETR.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:14:14 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Shen","Yichao",""],["Geng","Zigang",""],["Yuan","Yuhui",""],["Lin","Yutong",""],["Liu","Ze",""],["Wang","Chunyu",""],["Hu","Han",""],["Zheng","Nanning",""],["Guo","Baining",""]]}
{"id":"2308.04410","submitter":"Najmul Haque","authors":"Jobin Sebastian, Lata Thakur, Hiranmaya Mishra, and Najmul Haque","title":"Heavy quarkonia in QGP medium in an arbitrary magnetic field","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the heavy quarkonium complex potential in an arbitrary magnetic\nfield strength generated in the relativistic heavy-ion collision. First, the\none-loop gluon polarization tensor is obtained in the presence of an external,\nconstant, and homogeneous magnetic field using the Schwinger proper time\nformalism in Euclidean space. The gluon propagator is computed from the gluon\npolarization tensor, and it is used to calculate the dielectric permittivity in\nthe presence of the magnetic field in the static limit. The modified dielectric\npermittivity is then used to compute the heavy quarkonium complex potential. We\nfind that the heavy quarkonium complex potential is anisotropic in nature,\nwhich depends on the angle between the quark-antiquark ($Q\\bar{Q}$) dipole axis\nand the direction of the magnetic field. We discuss the effect of the magnetic\nfield strength and the angular orientation of the dipole on the heavy\nquarkonium potential. We discuss how the magnetic field influences the thermal\nwidths of quarkonium states. Further, we also discuss the limitation of the\nstrong-field approximation as done in literature in the light of heavy-ion\nobservables, as the effect of the magnetic field is very nominal to the\nquarkonium potential.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:14:16 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Sebastian","Jobin",""],["Thakur","Lata",""],["Mishra","Hiranmaya",""],["Haque","Najmul",""]]}
{"id":"2308.04411","submitter":"Dinesh Khurana","authors":"Dinesh Khurana and T. Y. Lam","title":"A New Determinantal Formula for Three Matrices","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For any three $\\,n\\times n\\,$ matrices $\\,A,B,X\\,$ over a commutative ring\n$\\,S$, we prove that $\\,{\\rm det}\\,(A+B-AXB)={\\rm det}\\,(A+B-BXA) \\in S$. This\napparently new formula may be regarded as a ``ternary generalization'' of\nSylvester's classical determinantal formula $\\,{\\rm det}\\,(I_n-AB)={\\rm\ndet}\\,(I_n-BA)\\,$ for any pair of $\\,n\\times n\\,$ matrices $\\,A,B\\,$ over\n$\\,S$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:16:40 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Khurana","Dinesh",""],["Lam","T. Y.",""]]}
{"id":"2308.04412","submitter":"Leonardo Cotta","authors":"Leonardo Cotta, Gal Yehuda, Assaf Schuster, Chris J. Maddison","title":"Probabilistic Invariant Learning with Randomized Linear Classifiers","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":"  Designing models that are both expressive and preserve known invariances of\ntasks is an increasingly hard problem. Existing solutions tradeoff invariance\nfor computational or memory resources. In this work, we show how to leverage\nrandomness and design models that are both expressive and invariant but use\nless resources. Inspired by randomized algorithms, our key insight is that\naccepting probabilistic notions of universal approximation and invariance can\nreduce our resource requirements. More specifically, we propose a class of\nbinary classification models called Randomized Linear Classifiers (RLCs). We\ngive parameter and sample size conditions in which RLCs can, with high\nprobability, approximate any (smooth) function while preserving invariance to\ncompact group transformations. Leveraging this result, we design three RLCs\nthat are provably probabilistic invariant for classification tasks over sets,\ngraphs, and spherical data. We show how these models can achieve probabilistic\ninvariance and universality using less resources than (deterministic) neural\nnetworks and their invariant counterparts. Finally, we empirically demonstrate\nthe benefits of this new class of models on invariant tasks where deterministic\ninvariant neural networks are known to struggle.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:18:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Cotta","Leonardo",""],["Yehuda","Gal",""],["Schuster","Assaf",""],["Maddison","Chris J.",""]]}
{"id":"2308.04413","submitter":"Chen Wang","authors":"Chen Wang, Jiadai Sun, Lina Liu, Chenming Wu, Zhelun Shen, Dayan Wu,\n  Yuchao Dai, Liangjun Zhang","title":"Digging into Depth Priors for Outdoor Neural Radiance Fields","comments":"Accepted to ACM MM 2023. Project Page:\n  https://cwchenwang.github.io/outdoor-nerf-depth","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural Radiance Fields (NeRF) have demonstrated impressive performance in\nvision and graphics tasks, such as novel view synthesis and immersive reality.\nHowever, the shape-radiance ambiguity of radiance fields remains a challenge,\nespecially in the sparse viewpoints setting. Recent work resorts to integrating\ndepth priors into outdoor NeRF training to alleviate the issue. However, the\ncriteria for selecting depth priors and the relative merits of different priors\nhave not been thoroughly investigated. Moreover, the relative merits of\nselecting different approaches to use the depth priors is also an unexplored\nproblem. In this paper, we provide a comprehensive study and evaluation of\nemploying depth priors to outdoor neural radiance fields, covering common depth\nsensing technologies and most application ways. Specifically, we conduct\nextensive experiments with two representative NeRF methods equipped with four\ncommonly-used depth priors and different depth usages on two widely used\noutdoor datasets. Our experimental results reveal several interesting findings\nthat can potentially benefit practitioners and researchers in training their\nNeRF models with depth priors. Project Page:\nhttps://cwchenwang.github.io/outdoor-nerf-depth\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:18:59 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Wang","Chen",""],["Sun","Jiadai",""],["Liu","Lina",""],["Wu","Chenming",""],["Shen","Zhelun",""],["Wu","Dayan",""],["Dai","Yuchao",""],["Zhang","Liangjun",""]]}
{"id":"2308.04414","submitter":"Brian R Williams","authors":"Niklas Garner, Brian R. Williams","title":"Raviolo vertex algebras","comments":"78 pages. Comments and feedback are welcomed!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA hep-th math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop an algebraic structure modeling local operators in a\nthree-dimensional quantum field theory which is partially holomorphic and\npartially topological. The geometric space organizing our algebraic structure\nis called the raviolo (or bubble) and replaces the punctured disk underlying\nvertex algebras; we refer to this structure as a raviolo vertex algebra. The\nraviolo has appeared in many contexts related to three-dimensional\nsupersymmetric gauge theory, especially in work on the affine Grassmannian. We\nprove a number of structure theorems for raviolo vertex algebras and provide\nsimple examples that share many similarities with their vertex algebra\ncounterparts.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:22:44 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Garner","Niklas",""],["Williams","Brian R.",""]]}
{"id":"2308.04415","submitter":"Nicol\\`o Piccione Mr.","authors":"Nicol\\`o Piccione","title":"A proposal for a new kind of spontaneous collapse model","comments":"5 pages plus appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spontaneous collapse models are modifications of standard quantum mechanics\nin which a physical mechanism is responsible for the collapse of the\nwavefunction, thus providing a way to solve the so-called \"measurement\nproblem\". However, they present great challenges when one tries to make them\nrelativistic. Here, we propose a new kind of non-relativistic spontaneous\ncollapse model whose relativistic version could be easier to obtain. In the\nnon-relativistic regime, we show that this model can lead to a dynamics quite\nsimilar to that of the Ghirardi-Rimini-Weber model, by also naturally solving\nthe problem of indistinguishable particles. Moreover, we can also obtain the\nsame master equation of the well-known Continuous Spontaneous Localization\nmodels. Finally, we show how our proposed model solves the measurement problem\nin a manner conceptually similar to the Ghirardi-Rimini-Weber model.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:25:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Piccione","Nicol\u00f2",""]]}
{"id":"2308.04416","submitter":"Giuseppe Pisano","authors":"Thiago Dal Pont and Federico Galli and Andrea Loreggia and Giuseppe\n  Pisano and Riccardo Rovatti and Giovanni Sartor","title":"Legal Summarisation through LLMs: The PRODIGIT Project","comments":"arXiv admin note: substantial text overlap with arXiv:2303.09136 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present some initial results of a large-scale Italian project called\nPRODIGIT which aims to support tax judges and lawyers through digital\ntechnology, focusing on AI. We have focused on generation of summaries of\njudicial decisions and on the extraction of related information, such as the\nidentification of legal issues and decision-making criteria, and the\nspecification of keywords. To this end, we have deployed and evaluated\ndifferent tools and approaches to extractive and abstractive summarisation. We\nhave applied LLMs, and particularly on GPT4, which has enabled us to obtain\nresults that proved satisfactory, according to an evaluation by expert tax\njudges and lawyers. On this basis, a prototype application is being built which\nwill be made publicly available.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:59:48 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pont","Thiago Dal",""],["Galli","Federico",""],["Loreggia","Andrea",""],["Pisano","Giuseppe",""],["Rovatti","Riccardo",""],["Sartor","Giovanni",""]]}
{"id":"2308.04417","submitter":"Xuechao Zou","authors":"Xuechao Zou, Kai Li, Junliang Xing, Yu Zhang, Shiying Wang, Lei Jin,\n  and Pin Tao","title":"DiffCR: A Fast Conditional Diffusion Framework for Cloud Removal from\n  Optical Satellite Images","comments":"13 pages, 7 figures","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":"  Optical satellite images are a critical data source; however, cloud cover\noften compromises their quality, hindering image applications and analysis.\nConsequently, effectively removing clouds from optical satellite images has\nemerged as a prominent research direction. While recent advancements in cloud\nremoval primarily rely on generative adversarial networks, which may yield\nsuboptimal image quality, diffusion models have demonstrated remarkable success\nin diverse image-generation tasks, showcasing their potential in addressing\nthis challenge. This paper presents a novel framework called DiffCR, which\nleverages conditional guided diffusion with deep convolutional networks for\nhigh-performance cloud removal for optical satellite imagery. Specifically, we\nintroduce a decoupled encoder for conditional image feature extraction,\nproviding a robust color representation to ensure the close similarity of\nappearance information between the conditional input and the synthesized\noutput. Moreover, we propose a novel and efficient time and condition fusion\nblock within the cloud removal model to accurately simulate the correspondence\nbetween the appearance in the conditional image and the target image at a low\ncomputational cost. Extensive experimental evaluations on two commonly used\nbenchmark datasets demonstrate that DiffCR consistently achieves\nstate-of-the-art performance on all metrics, with parameter and computational\ncomplexities amounting to only 5.1% and 5.4%, respectively, of those previous\nbest methods. The source code, pre-trained models, and all the experimental\nresults will be publicly available at https://github.com/XavierJiezou/DiffCR\nupon the paper's acceptance of this work.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:34:28 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zou","Xuechao",""],["Li","Kai",""],["Xing","Junliang",""],["Zhang","Yu",""],["Wang","Shiying",""],["Jin","Lei",""],["Tao","Pin",""]]}
{"id":"2308.04418","submitter":"Vitaly Petrov","authors":"Vitaly Petrov, Josep Miquel Jornet, and Arjun Singh","title":"Near-field 6G Networks: Why Mobile Terahertz Communications MUST Operate\n  in the Near Field","comments":"Accepted to IEEE Globecom, 2023. Copyright 2023 IEEE. Personal use of\n  this material is permitted. Permission from IEEE must be obtained for all\n  other uses, in any current or future media, including reprinting/republishing\n  this material, creating new works, for resale or redistribution to servers or\n  lists, or reuse of any copyrighted component of this work in other works","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Near-field mobile terahertz (THz) communications is one of the candidate\nenablers for high-rate wireless data exchange in sixth-generation (6G)\nnetworks. However, operating in the THz near field brings both attractive\nopportunities and severe challenges. Hence, it becomes of interest to explore\nif it is possible to design a realistic mobile THz communication system without\nworking in the THz near field. To answer this question, a mathematical\nframework is presented modeling a mobile THz link that works exclusively in the\nfar field. The study leads to an interesting theoretical conclusion: while the\nactual frequency is of (almost) no interest, such a system must operate over a\nlimited bandwidth not exceeding a certain threshold. It is then numerically\nshown that operating only in the far field imposes stringent limitations on\nmobile THz communications, thus making them less attractive to prospective\nhigh-rate services. In contrast, it is shown that a stationary THz link can\nstill be broadband even when staying exclusively in the THz far field. Hence,\nbroadband mobile THz communications MUST be near-field, while broadband\nstationary THz links do not have to.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:34:50 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Petrov","Vitaly",""],["Jornet","Josep Miquel",""],["Singh","Arjun",""]]}
{"id":"2308.04419","submitter":"Sukhpal Singh Gill","authors":"Karan Pardeshi, Sukhpal Singh Gill, Ahmed M. Abdelmoniem","title":"Stock Market Price Prediction: A Hybrid LSTM and Sequential\n  Self-Attention based Approach","comments":"13 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  One of the most enticing research areas is the stock market, and projecting\nstock prices may help investors profit by making the best decisions at the\ncorrect time. Deep learning strategies have emerged as a critical technique in\nthe field of the financial market. The stock market is impacted due to two\naspects, one is the geo-political, social and global events on the bases of\nwhich the price trends could be affected. Meanwhile, the second aspect purely\nfocuses on historical price trends and seasonality, allowing us to forecast\nstock prices. In this paper, our aim is to focus on the second aspect and build\na model that predicts future prices with minimal errors. In order to provide\nbetter prediction results of stock price, we propose a new model named Long\nShort-Term Memory (LSTM) with Sequential Self-Attention Mechanism (LSTM-SSAM).\nFinally, we conduct extensive experiments on the three stock datasets: SBIN,\nHDFCBANK, and BANKBARODA. The experimental results prove the effectiveness and\nfeasibility of the proposed model compared to existing models. The experimental\nfindings demonstrate that the root-mean-squared error (RMSE), and R-square (R2)\nevaluation indicators are giving the best results.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:21:05 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Pardeshi","Karan",""],["Gill","Sukhpal Singh",""],["Abdelmoniem","Ahmed M.",""]]}
{"id":"2308.04420","submitter":"Annie S. Booth","authors":"Annie S. Booth, S. Ashwin Renganathan, Robert B. Gramacy","title":"Contour Location for Reliability in Airfoil Simulation Experiments using\n  Deep Gaussian Processes","comments":"19 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bayesian deep Gaussian processes (DGPs) outperform ordinary GPs as surrogate\nmodels of complex computer experiments when response surface dynamics are\nnon-stationary, which is especially prevalent in aerospace simulations. Yet DGP\nsurrogates have not been deployed for the canonical downstream task in that\nsetting: reliability analysis through contour location (CL). Level sets\nseparating passable vs. failable operating conditions are best learned through\nstrategic sequential design. There are two limitations to modern CL methodology\nwhich hinder DGP integration in this setting. First, derivative-based\noptimization underlying acquisition functions is thwarted by sampling-based\nBayesian (i.e., MCMC) inference, which is essential for DGP posterior\nintegration. Second, canonical acquisition criteria, such as entropy, are\nfamously myopic to the extent that optimization may even be undesirable. Here\nwe tackle both of these limitations at once, proposing a hybrid criteria that\nexplores along the Pareto front of entropy and (predictive) uncertainty,\nrequiring evaluation only at strategically located \"triangulation\" candidates.\nWe showcase DGP CL performance in several synthetic benchmark exercises and on\na real-world RAE-2822 transonic airfoil simulation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:36:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Booth","Annie S.",""],["Renganathan","S. Ashwin",""],["Gramacy","Robert B.",""]]}
{"id":"2308.04421","submitter":"David Stapleton","authors":"Audric Lebovitz and David Stapleton","title":"The minimal fibering degree of a toric variety equals the lattice width\n  of its polytope","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this paper is to compute the minimal fibering degree of an\narbitrary projective toric variety. We prove that it equals the lattice width\nof the associated polytope. This gives a complete answer to a question asked in\na recent paper of Levinson, Ullery and the second author. The minimal fibering\ndegree of a polarized projective variety was introduced in that paper in order\nto compute the degree of irrationality (a generalization of gonality) of high\ndegree divisors. From this perspective, our paper gives a higher dimensional\nanalogue of results of Kawaguchi and others who computed the gonality of curves\nin toric surfaces in terms of lattice widths.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:40:49 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Lebovitz","Audric",""],["Stapleton","David",""]]}
{"id":"2308.04422","submitter":"Florian Kanitschar","authors":"Alexandra Bergmayr, Florian Kanitschar, Matej Pivoluska, Marcus Huber","title":"How to harness high-dimensional temporal entanglement, using limited\n  interferometry setups","comments":"6+10 Pages, 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-dimensional entanglement has shown to have significant advantages in\nquantum communication. It is available in many degrees of freedom and in\nparticular in the time-domain routinely produced in down-conversion (SPDC).\nWhile advantageous in the sense that only a single detector channel is needed\nlocally, it is notoriously hard to analyze, especially in an assumption-free\nmanner that is required for quantum key distribution applications. We develop\nthe first complete analysis of high-dimensional entanglement in the\npolarization-time-domain and show how to efficiently certify relevant density\nmatrix elements and security parameters for Quantum Key Distribution (QKD). In\naddition to putting past experiments on rigorous footing, we also develop\nphysical noise models and propose a novel setup that can further enhance the\nnoise resistance of free-space quantum communication.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:44:43 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Bergmayr","Alexandra",""],["Kanitschar","Florian",""],["Pivoluska","Matej",""],["Huber","Marcus",""]]}
{"id":"2308.04423","submitter":"Siddhansh Agarwal","authors":"Siddhansh Agarwal, Gaurav Upadhyay, Yashraj Bhosale, Mattia Gazzola\n  and Sascha Hilgenfeldt","title":"Density-contrast induced inertial forces on particles in oscillatory\n  flows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Oscillatory flows have become an indispensable tool in microfluidics,\ninducing inertial effects for displacing and manipulating fluid-borne objects\nin a reliable, controllable, and label-free fashion. However, the quantitative\ndescription of such effects has been confined to limit cases and specialized\nscenarios. Here we develop an analytical formalism yielding the equation of\nmotion of density-mismatched spherical particles in arbitrary background flows,\ngeneralizing previous work. Inertial force terms are systematically derived\nfrom the geometry of the flow field together with analytically known Stokes\nnumber dependences. Supported by independent, first-principles direct numerical\nsimulations, we find that these forces are important even for nearly\ndensity-matched objects such as cells or bacteria, enabling their fast\ndisplacement and separation. Our formalism thus generalizes the Maxey--Riley\nequation, encompassing not only particle inertia, but consistently recovering,\nin the limit of large Stokes numbers, the Auton modification to added mass as\nwell as the far-field acoustofluidic secondary radiation force.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:49:24 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Agarwal","Siddhansh",""],["Upadhyay","Gaurav",""],["Bhosale","Yashraj",""],["Gazzola","Mattia",""],["Hilgenfeldt","Sascha",""]]}
{"id":"2308.04424","submitter":"Hao Fei","authors":"Li Zheng, Fei Li, Yuyang Chai, Chong Teng, Donghong Ji","title":"A Bi-directional Multi-hop Inference Model for Joint Dialog Sentiment\n  Classification and Act Recognition","comments":"Accepted by NLPCC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The joint task of Dialog Sentiment Classification (DSC) and Act Recognition\n(DAR) aims to predict the sentiment label and act label for each utterance in a\ndialog simultaneously. However, current methods encode the dialog context in\nonly one direction, which limits their ability to thoroughly comprehend the\ncontext. Moreover, these methods overlook the explicit correlations between\nsentiment and act labels, which leads to an insufficient ability to capture\nrich sentiment and act clues and hinders effective and accurate reasoning. To\naddress these issues, we propose a Bi-directional Multi-hop Inference Model\n(BMIM) that leverages a feature selection network and a bi-directional\nmulti-hop inference network to iteratively extract and integrate rich sentiment\nand act clues in a bi-directional manner. We also employ contrastive learning\nand dual learning to explicitly model the correlations of sentiment and act\nlabels. Our experiments on two widely-used datasets show that BMIM outperforms\nstate-of-the-art baselines by at least 2.6% on F1 score in DAR and 1.4% on F1\nscore in DSC. Additionally, Our proposed model not only improves the\nperformance but also enhances the interpretability of the joint sentiment and\nact prediction task.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:53:24 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 06:17:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zheng","Li",""],["Li","Fei",""],["Chai","Yuyang",""],["Teng","Chong",""],["Ji","Donghong",""]]}
{"id":"2308.04425","submitter":"Pavel Gevorgyan","authors":"Pavel S. Gevorgyan and I. Pop","title":"Uniformly Movable Categories And Uniform Movability Of Topological\n  Spaces","comments":"12 pages","journal-ref":"Bulletin of the Polish Academy of Sciences. Mathematics, 55:3,\n  229--242 (2007)","doi":"10.4064/ba55-3-5","report-no":null,"categories":"math.AT math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A categorical generalization of the notion of movability from the inverse\nsystems and shape theory was given by the first author who defined the notion\nof movable category and interpreted by this the movability of topological\nspaces. In this paper the authors define the notion of uniformly movable\ncategory and prove that a topological space is uniformly movable in the sense\nof the shape theory if and only if its comma category in the homotopy category\nHTop over the subcategory HPol of polyhedra is a uniformly movable category.\nThis is a weakened version of the categorical notion of uniform movability\nintroduced by the second author.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:53:36 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Gevorgyan","Pavel S.",""],["Pop","I.",""]]}
{"id":"2308.04426","submitter":"Yikun Liu","authors":"Yikun Liu and Yuning Wang and Cheng Liu","title":"A Deep-Learning Method Using Auto-encoder and Generative Adversarial\n  Network for Anomaly Detection on Ancient Stone Stele Surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate detection of natural deterioration and man-made damage on the\nsurfaces of ancient stele in the first instance is essential for their\npreventive conservation. Existing methods for cultural heritage preservation\nare not able to achieve this goal perfectly due to the difficulty of balancing\naccuracy, efficiency, timeliness, and cost. This paper presents a deep-learning\nmethod to automatically detect above mentioned emergencies on ancient stone\nstele in real time, employing autoencoder (AE) and generative adversarial\nnetwork (GAN). The proposed method overcomes the limitations of existing\nmethods by requiring no extensive anomaly samples while enabling comprehensive\ndetection of unpredictable anomalies. the method includes stages of monitoring,\ndata acquisition, pre-processing, model structuring, and post-processing.\nTaking the Longmen Grottoes' stone steles as a case study, an unsupervised\nlearning model based on AE and GAN architectures is proposed and validated with\na reconstruction accuracy of 99.74\\%. The method's evaluation revealed the\nproficient detection of seven artificially designed anomalies and demonstrated\nprecision and reliability without false alarms. This research provides novel\nideas and possibilities for the application of deep learning in the field of\ncultural heritage.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:55:30 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Liu","Yikun",""],["Wang","Yuning",""],["Liu","Cheng",""]]}
{"id":"2308.04427","submitter":"Liang Si","authors":"Liang Si, Markus Wallerberger, Andriy Smolyanyuk, Simone di Cataldo,\n  Jan M. Tomczak, and Karsten Held","title":"Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O: a Mott or charge transfer insulator in\n  need of further doping for (super)conductivity","comments":"7 figures, 9 pages, 2 tables. Version 2 is the same as version 1\n  except for additional DMFT and DFT+U results in Secs. IV and V","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 briefly review the status quo of research on the putative superconductor\nPb$_9$Cu(PO$_4$)$_6$O also known as LK-99. Further, we provide {\\em ab initio}\nderived tight-binding parameters for a two- and five-band model, and solve\nthese in dynamical-mean-field theory. The ratio interaction-to-bandwidth makes\nLK-99 a Mott or charge transfer insulator. Electron or hole doping (which is\ndifferent from substituting Pb by Cu and thus differs from LK-99) is required\nto make it metallic and potentially superconducting.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:56:13 GMT"},{"version":"v2","created":"Wed, 9 Aug 2023 17:50:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Si","Liang",""],["Wallerberger","Markus",""],["Smolyanyuk","Andriy",""],["di Cataldo","Simone",""],["Tomczak","Jan M.",""],["Held","Karsten",""]]}
{"id":"2308.04428","submitter":"Thomas Zhang","authors":"Thomas T.C.K. Zhang, Leonardo F. Toso, James Anderson, Nikolai Matni","title":"Meta-Learning Operators to Optimality from Multi-Task Non-IID Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A powerful concept behind much of the recent progress in machine learning is\nthe extraction of common features across data from heterogeneous sources or\ntasks. Intuitively, using all of one's data to learn a common representation\nfunction benefits both computational effort and statistical generalization by\nleaving a smaller number of parameters to fine-tune on a given task. Toward\ntheoretically grounding these merits, we propose a general setting of\nrecovering linear operators $M$ from noisy vector measurements $y = Mx + w$,\nwhere the covariates $x$ may be both non-i.i.d. and non-isotropic. We\ndemonstrate that existing isotropy-agnostic meta-learning approaches incur\nbiases on the representation update, which causes the scaling of the noise\nterms to lose favorable dependence on the number of source tasks. This in turn\ncan cause the sample complexity of representation learning to be bottlenecked\nby the single-task data size. We introduce an adaptation, $\\texttt{De-bias &\nFeature-Whiten}$ ($\\texttt{DFW}$), of the popular alternating\nminimization-descent (AMD) scheme proposed in Collins et al., (2021), and\nestablish linear convergence to the optimal representation with noise level\nscaling down with the $\\textit{total}$ source data size. This leads to\ngeneralization bounds on the same order as an oracle empirical risk minimizer.\nWe verify the vital importance of $\\texttt{DFW}$ on various numerical\nsimulations. In particular, we show that vanilla alternating-minimization\ndescent fails catastrophically even for iid, but mildly non-isotropic data. Our\nanalysis unifies and generalizes prior work, and provides a flexible framework\nfor a wider range of applications, such as in controls and dynamical systems.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:56:20 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Zhang","Thomas T. C. K.",""],["Toso","Leonardo F.",""],["Anderson","James",""],["Matni","Nikolai",""]]}
{"id":"2308.04429","submitter":"Adarsh Vasista","authors":"Adarsh B Vasista, Bernard Ciraulo, Jaime Ortega Arroyo, Romain Quidant","title":"Non steady-state thermometry with optical diffraction tomography","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Measurement of local temperature using label-free optical methods has gained\nimportance as a pivotal tool in both fundamental and applied research. Yet,\nmost of these approaches are limited to steady-state measurements of planar\nheat sources. However, the time taken to reach steady-state is a complex\nfunction of the volume of the heated system, the size of the heat source, and\nthe thermal conductivity of the surroundings. As such, said time can be\nsignificantly longer than expected and many relevant systems involve 3D heat\nsources, thus compromising reliable temperature retrieval. Here, we\nsystematically study the thermal landscape in a model system consisting of\noptically excited gold nanorods (AuNRs) in a microchamber using optical\ndiffraction tomography (ODT) thermometry. We experimentally unravel the effect\nof thermal conductivity of the surroundings, microchamber height, and pump\npulse duration on the thermodynamics of the microchamber. We benchmark our\nexperimental observations against 2D numerical sumulations and quantitative\nphase imaging (QPI) thermometry. We also demonstrate the advantage of ODT\nthermometry by measuring thermal landscapes inaccessible by QPI thermometry in\nthe form of non-planar heat sources embedded in complex environments such as\nbiological cells. Finally, we apply ODT thermometry to a complex dynamic system\nconsisting of colloidal AuNRs in a microchamber.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:58:04 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Vasista","Adarsh B",""],["Ciraulo","Bernard",""],["Arroyo","Jaime Ortega",""],["Quidant","Romain",""]]}
{"id":"2308.04430","submitter":"Sewon Min","authors":"Sewon Min, Suchin Gururangan, Eric Wallace, Hannaneh Hajishirzi, Noah\n  A. Smith, Luke Zettlemoyer","title":"SILO Language Models: Isolating Legal Risk In a Nonparametric Datastore","comments":"27 pages; 6 figures. Code, models, and data available at\n  https://github.com/kernelmachine/silo-lm","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 legality of training language models (LMs) on copyrighted or otherwise\nrestricted data is under intense debate. However, as we show, model performance\nsignificantly degrades if trained only on low-risk text (e.g., out-of-copyright\nbooks or government documents), due to its limited size and domain coverage. We\npresent SILO, a new language model that manages this risk-performance tradeoff\nduring inference. SILO is built by (1) training a parametric LM on Open License\nCorpus (OLC), a new corpus we curate with 228B tokens of public domain and\npermissively licensed text and (2) augmenting it with a more general and easily\nmodifiable nonparametric datastore (e.g., containing copyrighted books or news)\nthat is only queried during inference. The datastore allows use of high-risk\ndata without training on it, supports sentence-level data attribution, and\nenables data producers to opt out from the model by removing content from the\nstore. These capabilities can foster compliance with data-use regulations such\nas the fair use doctrine in the United States and the GDPR in the European\nUnion. Our experiments show that the parametric LM struggles on domains not\ncovered by OLC. However, access to the datastore greatly improves out of domain\nperformance, closing 90% of the performance gap with an LM trained on the Pile,\na more diverse corpus with mostly high-risk text. We also analyze which\nnonparametric approach works best, where the remaining errors lie, and how\nperformance scales with datastore size. Our results suggest that it is possible\nto build high quality language models while mitigating their legal risk.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:58:15 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Min","Sewon",""],["Gururangan","Suchin",""],["Wallace","Eric",""],["Hajishirzi","Hannaneh",""],["Smith","Noah A.",""],["Zettlemoyer","Luke",""]]}
{"id":"2308.04431","submitter":"Rhys Compton","authors":"Rhys Compton, Lily Zhang, Aahlad Puli, Rajesh Ranganath","title":"When More is Less: Incorporating Additional Datasets Can Hurt\n  Performance By Introducing Spurious Correlations","comments":"Accepted at MLHC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In machine learning, incorporating more data is often seen as a reliable\nstrategy for improving model performance; this work challenges that notion by\ndemonstrating that the addition of external datasets in many cases can hurt the\nresulting model's performance. In a large-scale empirical study across\ncombinations of four different open-source chest x-ray datasets and 9 different\nlabels, we demonstrate that in 43% of settings, a model trained on data from\ntwo hospitals has poorer worst group accuracy over both hospitals than a model\ntrained on just a single hospital's data. This surprising result occurs even\nthough the added hospital makes the training distribution more similar to the\ntest distribution. We explain that this phenomenon arises from the spurious\ncorrelation that emerges between the disease and hospital, due to\nhospital-specific image artifacts. We highlight the trade-off one encounters\nwhen training on multiple datasets, between the obvious benefit of additional\ndata and insidious cost of the introduced spurious correlation. In some cases,\nbalancing the dataset can remove the spurious correlation and improve\nperformance, but it is not always an effective strategy. We contextualize our\nresults within the literature on spurious correlations to help explain these\noutcomes. Our experiments underscore the importance of exercising caution when\nselecting training data for machine learning models, especially in settings\nwhere there is a risk of spurious correlations such as with medical imaging.\nThe risks outlined highlight the need for careful data selection and model\nevaluation in future research and practice.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:58:45 GMT"}],"update_date":"2023-08-09","authors_parsed":[["Compton","Rhys",""],["Zhang","Lily",""],["Puli","Aahlad",""],["Ranganath","Rajesh",""]]}
{"id":"2308.04446","submitter":"Daniel Becker","authors":"Daniel Becker and Guido K\\\"uppers and Lutz Eckstein","title":"Simulative Performance Analysis of an AD Function with Road Network\n  Variation","comments":"15th ITS European Congress, Lisbon, Portugal, 22-24 May-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automated driving functions (ADFs) have become increasingly popular in recent\nyears. However, their safety must be assured. Thus, the verification and\nvalidation of these functions is still an important open issue in research and\ndevelopment. To achieve this efficiently, scenario-based testing has been\nestablished as a valuable methodology among researchers, industry, as well as\nauthorities. Simulations are a powerful way to test those scenarios\nreproducibly. In this paper, we propose a method to automatically test a set of\nscenarios in many variations. In contrast to related approaches, those\nvariations are not applied to traffic participants around the ADF, but to the\nroad network to show that parameters regarding the road topology also influence\nthe performance of such an ADF. We present a continuous tool chain to set up\nscenarios, variate them, run simulations and finally, evaluate the performance\nwith a set of key performance indicators (KPIs).\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:25:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Becker","Daniel",""],["K\u00fcppers","Guido",""],["Eckstein","Lutz",""]]}
{"id":"2308.04447","submitter":"Rawlings Fiberesima Bsc.","authors":"Rawlings Fiberesima","title":"Assessment of POS Owners Awareness of Cybersecurity and Insider Threats\n  in POS Kiosks Related Financial Crimes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The introduction of point of sales POS technologies as a payment system was\nwelcoming and constitutes one of the major breakthroughs in the efforts made to\nrejuvenate the global financial systems. However, like other information\ntechnology IT based financial systems, the POS also poses some cybersecurity\nsecurity threats. The unique thing about the POS is that the main cybersecurity\nthreats it poses to most users are not IT based which refers to unauthorized\naccess and gaining information without the knowledge of the user. The threats\nare rather connected to the mode of operation of POS kiosks, particularly as\nexperienced in most parts of Nigeria. The mode of operation exposes users cards\nto possible cloning.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:43:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Fiberesima","Rawlings",""]]}
{"id":"2308.04448","submitter":"Avijit Ghosh","authors":"Avijit Ghosh, Dhanya Lakshmi","title":"Dual Governance: The intersection of centralized regulation and\n  crowdsourced safety mechanisms for Generative AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generative Artificial Intelligence (AI) has seen mainstream adoption lately,\nespecially in the form of consumer-facing, open-ended, text and image\ngenerating models. However, the use of such systems raises significant ethical\nand safety concerns, including privacy violations, misinformation and\nintellectual property theft. The potential for generative AI to displace human\ncreativity and livelihoods has also been under intense scrutiny. To mitigate\nthese risks, there is an urgent need of policies and regulations responsible\nand ethical development in the field of generative AI. Existing and proposed\ncentralized regulations by governments to rein in AI face criticisms such as\nnot having sufficient clarity or uniformity, lack of interoperability across\nlines of jurisdictions, restricting innovation, and hindering free market\ncompetition. Decentralized protections via crowdsourced safety tools and\nmechanisms are a potential alternative. However, they have clear deficiencies\nin terms of lack of adequacy of oversight and difficulty of enforcement of\nethical and safety standards, and are thus not enough by themselves as a\nregulation mechanism. We propose a marriage of these two strategies via a\nframework we call Dual Governance. This framework proposes a cooperative\nsynergy between centralized government regulations in a U.S. specific context\nand safety mechanisms developed by the community to protect stakeholders from\nthe harms of generative AI. By implementing the Dual Governance framework, we\nposit that innovation and creativity can be promoted while ensuring safe and\nethical deployment of generative AI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:25:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ghosh","Avijit",""],["Lakshmi","Dhanya",""]]}
{"id":"2308.04449","submitter":"Joshua Grossman","authors":"Joshua Grossman, Sabina Tomkins, Lindsay Page, Sharad Goel","title":"The Disparate Impacts of College Admissions Policies on Asian American\n  Applicants","comments":"14 pages, 4 figures, 1 table + appendix: 42 pages, 5 figures, 21\n  tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is debate over whether Asian American students are admitted to\nselective colleges and universities at lower rates than white students with\nsimilar academic qualifications. However, there have been few empirical\ninvestigations of this issue, in large part due to a dearth of data. Here we\npresent the results from analyzing 685,709 applications from Asian American and\nwhite students to a subset of selective U.S. institutions over five application\ncycles, beginning with the 2015-2016 cycle. The dataset does not include\nadmissions decisions, and so we construct a proxy based in part on enrollment\nchoices. Based on this proxy, we estimate the odds that Asian American\napplicants were admitted to at least one of the schools we consider were 28%\nlower than the odds for white students with similar test scores, grade-point\naverages, and extracurricular activities. The gap was particularly pronounced\nfor students of South Asian descent (49% lower odds). We trace this pattern in\npart to two factors. First, many selective colleges openly give preference to\nthe children of alumni, and we find that white applicants were substantially\nmore likely to have such legacy status than Asian applicants, especially South\nAsian applicants. Second, after adjusting for observed student characteristics,\nthe institutions we consider appear less likely to admit students from\ngeographic regions with relatively high shares of applicants who are Asian. We\nhope these results inform ongoing discussions on the equity of college\nadmissions policies.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 22:41:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Grossman","Joshua",""],["Tomkins","Sabina",""],["Page","Lindsay",""],["Goel","Sharad",""]]}
{"id":"2308.04450","submitter":"Xue Han","authors":"Kaizhu Liu, Hsiang-Chen Chui, Changsen Sun, and Xue Han","title":"High-Accuracy Prediction of Metal-Insulator-Metal Metasurface with Deep\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.comp-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning prediction of electromagnetic software calculation results has\nbeen a widely discussed issue in recent years. But the prediction accuracy was\nstill one of the challenges to be solved. In this work, we proposed that the\nResNets-10 model was used for predicting plasmonic metasurface S11 parameters.\nThe two-stage training was performed by the k-fold cross-validation and small\nlearning rate. After the training was completed, the prediction loss for\naluminum, gold, and silver metal-insulator-metal metasurfaces was -48.45,\n-46.47, and -35.54, respectively. Due to the ultralow error value, the proposed\nnetwork can replace the traditional electromagnetic computing method for\ncalculation within a certain structural range. Besides, this network can finish\nthe training process less than 1,100 epochs. This means that the network\ntraining process can effectively lower the design process time. The ResNets-10\nmodel we proposed can also be used to design meta-diffractive devices and\nbiosensors, thereby reducing the time required for the calculation process. The\nultralow error of the network indicates that this work contributes to the\ndevelopment of future artificial intelligence electromagnetic computing\nsoftware.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 07:04:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Kaizhu",""],["Chui","Hsiang-Chen",""],["Sun","Changsen",""],["Han","Xue",""]]}
{"id":"2308.04451","submitter":"Pietro Liguori","authors":"Domenico Cotroneo, Cristina Improta, Pietro Liguori, Roberto Natella","title":"Vulnerabilities in AI Code Generators: Exploring Targeted Data Poisoning\n  Attacks","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 this work, we assess the security of AI code generators via data\npoisoning, i.e., an attack that injects malicious samples into the training\ndata to generate vulnerable code. We poison the training data by injecting\nincreasing amounts of code containing security vulnerabilities and assess the\nattack's success on different state-of-the-art models for code generation. Our\nanalysis shows that AI code generators are vulnerable to even a small amount of\ndata poisoning. Moreover, the attack does not impact the correctness of code\ngenerated by pre-trained models, making it hard to detect.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:23:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cotroneo","Domenico",""],["Improta","Cristina",""],["Liguori","Pietro",""],["Natella","Roberto",""]]}
{"id":"2308.04452","submitter":"Faisal Haque Bappy","authors":"Mirza Kamrul Bashar Shuhan, Tariqul Islam, Enam Ahmed Shuvo, Faisal\n  Haque Bappy, Kamrul Hasan, Carlos Caicedo","title":"Quarks: A Secure and Decentralized Blockchain-Based Messaging Network","comments":null,"journal-ref":null,"doi":"10.1109/CSCloud-EdgeCom58631.2023.00053","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In last two decades, messaging systems have gained widespread popularity both\nin the enterprise and consumer sectors. Many of these systems used secure\nprotocols like end-to-end encryption to ensure strong security in one-to-one\ncommunication. However, the majority of them rely on centralized servers, which\nallows them to use their users' personal data. Also, it allows the government\nto track and regulate their citizens' activities, which poses significant\nthreats to \"digital freedom\". Also, these systems have failed to achieve\nsecurity attributes like confidentiality, integrity, and privacy for group\ncommunications. In this paper, we present a novel blockchain-based secure\nmessaging system named Quarks that overcomes the security pitfalls of the\nexisting systems and eliminates centralized control. We have analyzed our\narchitecture with security models to demonstrate the system's reliability and\nusability. We have developed a Proof of Concept (PoC) of the Quarks system\nleveraging Distributed Ledger Technology (DLT) and conducted load testing on\nthat. We noticed that our PoC system achieves all the desired attributes that\nare prevalent in a traditional centralized messaging scheme despite the limited\ncapacity of the development and testing environment. Therefore, this assures us\nof the applicability of such systems in the near future if scaled up properly.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:24:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shuhan","Mirza Kamrul Bashar",""],["Islam","Tariqul",""],["Shuvo","Enam Ahmed",""],["Bappy","Faisal Haque",""],["Hasan","Kamrul",""],["Caicedo","Carlos",""]]}
{"id":"2308.04453","submitter":"Faisal Haque Bappy","authors":"Faisal Haque Bappy, Saklain Zaman, Tariqul Islam, Redwan Ahmed Rizvee,\n  Joon S. Park, Kamrul Hasan","title":"Towards Immutability: A Secure and Efficient Auditing Framework for\n  Cloud Supporting Data Integrity and File Version Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although wide-scale integration of cloud services with myriad applications\nincreases quality of services (QoS) for enterprise users, verifying the\nexistence and manipulation of stored cloud information remains an open research\nproblem. Decentralized blockchain-based solutions are becoming more appealing\nfor cloud auditing environments because of the immutable nature of blockchain.\nHowever, the decentralized structure of blockchain results in considerable\nsynchronization and communication overhead, which increases maintenance costs\nfor cloud service providers (CSP). This paper proposes a Merkle Hash Tree based\narchitecture named Entangled Merkle Forest to support version control and\ndynamic auditing of information in centralized cloud environments. We utilized\na semi-trusted third-party auditor to conduct the auditing tasks with minimal\nprivacy-preserving file metadata. To the best of our knowledge, we are the\nfirst to design a node sharing Merkle Forest to offer a cost-effective auditing\nframework for centralized cloud infrastructures while achieving the immutable\nfeature of blockchain, mitigating the synchronization and performance\nchallenges of the decentralized architectures. Our proposed scheme outperforms\nit's equivalent Blockchain-based schemes by ensuring time and storage\nefficiency with minimum overhead as evidenced by performance analysis.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 03:41:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bappy","Faisal Haque",""],["Zaman","Saklain",""],["Islam","Tariqul",""],["Rizvee","Redwan Ahmed",""],["Park","Joon S.",""],["Hasan","Kamrul",""]]}
{"id":"2308.04454","submitter":"Xianghong Li","authors":"Huimin Qi, Xianghong Li, Kai Yin, Xiangnan Song, Xufei Fang","title":"Sustainable development-oriented campus bike-sharing site evaluation\n  model: A case study of Henan Polytechnic University","comments":"The result part of this work needs further study","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Promoting sustainable transportation options is increasingly crucial in the\npursuit of environmentally friendly and efficient campus mobility systems.\nAmong these options, bike-sharing programs have garnered substantial attention\nfor their capacity to mitigate traffic congestion, decrease carbon emissions,\nand enhance overall campus sustainability. However, improper selection of\nbike-sharing sites has led to the growing problems of unsustainable practices\nin campus, including the disorderly parking and indiscriminate placement of\nbike-sharing. To this end, this paper proposes a novel sustainable\ndevelopment-oriented campus bike-sharing site evaluation model integrating the\nimproved Delphi and fuzzy comprehensive evaluation approaches. Fourteen\nevaluation metrics are firstly selected from four dimensions: the user\nfeatures, implementation and usage characteristics of parking spots,\nenvironmental sustainability, and social sustainability, through the\ncombination of expert experience and the improved Delphi method. Then, the\nanalytic hierarchy process and the entropy weight method are employed to\ndetermine the weights of the evaluation indices, ensuring a robust and\nobjective assessment framework. The fuzzy comprehensive evaluation method is\nfinally implemented to evaluate the quality of location selection. South Campus\nof Henan Polytechnic University is selected as a case study using the proposed\nevaluation system. This work contributes to the existing body of knowledge by\npresenting a comprehensive location selection evaluation system for campus\nbike-sharing, informed by the principles of sustainable development.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:31:28 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 00:16:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qi","Huimin",""],["Li","Xianghong",""],["Yin","Kai",""],["Song","Xiangnan",""],["Fang","Xufei",""]]}
{"id":"2308.04455","submitter":"Pierre Champion","authors":"Pierre Champion","title":"Anonymizing Speech: Evaluating and Designing Speaker Anonymization\n  Techniques","comments":"PhD Thesis Pierre Champion | Universit\\'e de Lorraine - INRIA Nancy |\n  for associated source code file, see\n  https://github.com/deep-privacy/SA-toolkit","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The growing use of voice user interfaces has led to a surge in the collection\nand storage of speech data. While data collection allows for the development of\nefficient tools powering most speech services, it also poses serious privacy\nissues for users as centralized storage makes private personal speech data\nvulnerable to cyber threats. With the increasing use of voice-based digital\nassistants like Amazon's Alexa, Google's Home, and Apple's Siri, and with the\nincreasing ease with which personal speech data can be collected, the risk of\nmalicious use of voice-cloning and speaker/gender/pathological/etc. recognition\nhas increased.\n  This thesis proposes solutions for anonymizing speech and evaluating the\ndegree of the anonymization. In this work, anonymization refers to making\npersonal speech data unlinkable to an identity while maintaining the usefulness\n(utility) of the speech signal (e.g., access to linguistic content). We start\nby identifying several challenges that evaluation protocols need to consider to\nevaluate the degree of privacy protection properly. We clarify how\nanonymization systems must be configured for evaluation purposes and highlight\nthat many practical deployment configurations do not permit privacy evaluation.\nFurthermore, we study and examine the most common voice conversion-based\nanonymization system and identify its weak points before suggesting new methods\nto overcome some limitations. We isolate all components of the anonymization\nsystem to evaluate the degree of speaker PPI associated with each of them.\nThen, we propose several transformation methods for each component to reduce as\nmuch as possible speaker PPI while maintaining utility. We promote\nanonymization algorithms based on quantization-based transformation as an\nalternative to the most-used and well-known noise-based approach. Finally, we\nendeavor a new attack method to invert anonymization.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 16:14:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Champion","Pierre",""]]}
{"id":"2308.04456","submitter":"Rosaria Del Toro","authors":"Rosaria Del Toro (1), Maria Laura De Bellis (1), Marcello Vasta (1),\n  Andrea Bacigalupo (2) ((1) University of Chieti-Pescara, Department INGEO,\n  Pescara, Italy, (2) University of Genova, Department DICCA, Genova, Italy)","title":"Multifield asymptotic homogenization scheme for periodic Cauchy\n  materials in non-standard thermoelasticity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This article presents a multifield asymptotic homogenization scheme for the\nanalysis of Bloch wave propagation in non-standard thermoelastic periodic\nmaterials, leveraging on the Green-Linsdsay theory that accounts for two\nrelaxation times. The procedure involves several steps. Firstly, an asymptotic\nexpansion of the micro-fields is performed, considering the characteristic size\nof the microstructure. By utilizing the derived microscale field equations and\nasymptotic expansions, a series of recursive differential problems are solved\nwithin the repetitive unit cell Q. These problems are then expressed in terms\nof perturbation functions, which incorporate the material's geometric,\nphysical, and mechanical properties, as well as the microstructural\nheterogeneities. The down-scaling relation, which connects the microscopic and\nmacroscopic fields along with their gradients through the perturbation\nfunctions, is then established in a consistent manner. Subsequently, the\naverage field equations of infinite order are obtained by substituting the\ndown-scaling relation into the microscale field equations. To solve these\naverage field equations, an asymptotic expansion of the macroscopic fields is\nperformed based on the microstructural size, resulting in a sequence of\nmacroscopic recursive problems. To illustrate the methodology, a bi-phase\nlayered material is introduced as an example. The dispersion curves obtained\nfrom the non-local homogenization scheme are compared with those obtained from\nthe Floquet-Bloch theory. This analysis helps validate the effectiveness and\naccuracy of the proposed approach in predicting the wave propagation behavior\nin the considered non-standard thermoelastic periodic materials.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:12:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Del Toro","Rosaria",""],["De Bellis","Maria Laura",""],["Vasta","Marcello",""],["Bacigalupo","Andrea",""]]}
{"id":"2308.04457","submitter":"Abdeldjalil Latrach","authors":"Abdeldjalil Latrach, Mohamed Lamine Malki, Misael Morales, Mohamed\n  Mehana, Minou Rabiei","title":"A Critical Review of Physics-Informed Machine Learning Applications in\n  Subsurface Energy Systems","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":"  Machine learning has emerged as a powerful tool in various fields, including\ncomputer vision, natural language processing, and speech recognition. It can\nunravel hidden patterns within large data sets and reveal unparalleled\ninsights, revolutionizing many industries and disciplines. However, machine and\ndeep learning models lack interpretability and limited domain-specific\nknowledge, especially in applications such as physics and engineering.\nAlternatively, physics-informed machine learning (PIML) techniques integrate\nphysics principles into data-driven models. By combining deep learning with\ndomain knowledge, PIML improves the generalization of the model, abidance by\nthe governing physical laws, and interpretability. This paper comprehensively\nreviews PIML applications related to subsurface energy systems, mainly in the\noil and gas industry. The review highlights the successful utilization of PIML\nfor tasks such as seismic applications, reservoir simulation, hydrocarbons\nproduction forecasting, and intelligent decision-making in the exploration and\nproduction stages. Additionally, it demonstrates PIML's capabilities to\nrevolutionize the oil and gas industry and other emerging areas of interest,\nsuch as carbon and hydrogen storage; and geothermal systems by providing more\naccurate and reliable predictions for resource management and operational\nefficiency.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 18:20:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Latrach","Abdeldjalil",""],["Malki","Mohamed Lamine",""],["Morales","Misael",""],["Mehana","Mohamed",""],["Rabiei","Minou",""]]}
{"id":"2308.04458","submitter":"Runbo Li","authors":"Runbo Li","title":"On the lower bound of the number of solutions of some Goldbach type\n  problems","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  For every even integer $N$, denote by $D_{1,r}(N)$ the number of\nrepresentations of $N$ as a sum of a prime and an integer having at most $r$\nprime factors, where $r \\geqslant 2$. In this paper, we give a new lower bound\nfor $D_{1,r}(N)$.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 08:05:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Runbo",""]]}
{"id":"2308.04459","submitter":"Akshay Hebbar","authors":"Akshay Hebbar","title":"MCTS guided Genetic Algorithm for optimization of neural network weights","comments":"5 Pages, 7 Figures, 1 Table, 1 Equation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this research, we investigate the possibility of applying a search\nstrategy to genetic algorithms to explore the entire genetic tree structure.\nSeveral methods aid in performing tree searches; however, simpler algorithms\nsuch as breadth-first, depth-first, and iterative techniques are\ncomputation-heavy and often result in a long execution time. Adversarial\ntechniques are often the preferred mechanism when performing a probabilistic\nsearch, yielding optimal results more quickly. The problem we are trying to\ntackle in this paper is the optimization of neural networks using genetic\nalgorithms. Genetic algorithms (GA) form a tree of possible states and provide\na mechanism for rewards via the fitness function. Monte Carlo Tree Search\n(MCTS) has proven to be an effective tree search strategy given states and\nrewards; therefore, we will combine these approaches to optimally search for\nthe best result generated with genetic algorithms.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:11:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hebbar","Akshay",""]]}
{"id":"2308.04460","submitter":"Wencong Cheng","authors":"Wencong Cheng, Yan Yan, Jiangjiang Xia, Qi Liu, Chang Qu, Zhigang Wang","title":"The Compatibility between the Pangu Weather Forecasting Model and\n  Meteorological Operational Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, multiple data-driven models based on machine learning for weather\nforecasting have emerged. These models are highly competitive in terms of\naccuracy compared to traditional numerical weather prediction (NWP) systems. In\nparticular, the Pangu-Weather model, which is open source for non-commercial\nuse, has been validated for its forecasting performance by the European Centre\nfor Medium-Range Weather Forecasts (ECMWF) and has recently been published in\nthe journal \"Nature\". In this paper, we evaluate the compatibility of the\nPangu-Weather model with several commonly used NWP operational analyses through\ncase studies. The results indicate that the Pangu-Weather model is compatible\nwith different operational analyses from various NWP systems as the model\ninitial conditions, and it exhibits a relatively stable forecasting capability.\nFurthermore, we have verified that improving the quality of global or local\ninitial conditions significantly contributes to enhancing the forecasting\nperformance of the Pangu-Weather model.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:10:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cheng","Wencong",""],["Yan","Yan",""],["Xia","Jiangjiang",""],["Liu","Qi",""],["Qu","Chang",""],["Wang","Zhigang",""]]}
{"id":"2308.04461","submitter":"Jinjin Gu","authors":"Yi Yang, Chenxi Zhang, Xinlei Wang, Jing Qiu, Jinjin Gu, Junhua Zhao","title":"The 2023 Development of Room-Temperature Ambient-Pressure\n  Superconductor: Vision and Future Trend of Power Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Room-Temperature Ambient-Pressure Superconductor (RTAPS) can achieve\nsuperconducting properties at room temperature and normal atmospheric pressure,\neliminating the power system's transmission loss and enhancing power systems\nefficiency. This paper investigates the comprehensive implications and\nprospective applications of the recently discovered RTAPS, LK-99, in modern\npower systems. It explores the potential of RTAPS in reshaping modern power\nsystems paradigms, providing the vision of future RTAPS-based power systems.\nAlthough debate surrounds its industrial implementations, RTAPS's benefits for\nelectricity transmission, grid flexibility, improved energy storage, and\nrenewable energy integration could be unprecedented. The paper delves into\nunderlying opportunities and challenges, including RTAPS-based power flow\nmethods evolution, security redefinition, computational efficiency, cost\nimplications, and innovative market transaction forms to facilitate renewable\nenergy competitiveness.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 23:55:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yang","Yi",""],["Zhang","Chenxi",""],["Wang","Xinlei",""],["Qiu","Jing",""],["Gu","Jinjin",""],["Zhao","Junhua",""]]}
{"id":"2308.04462","submitter":"Xianlian Zhou","authors":"K\\\"ubra Akba\\c{s}, Carlotta Mummolo, Xianlian Zhou","title":"Characterization of Human Balance through a Reinforcement Learning-based\n  Muscle Controller","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Balance assessment during physical rehabilitation often relies on\nrubric-oriented battery tests to score a patient's physical capabilities,\nleading to subjectivity. While some objective balance assessments exist, they\nare often limited to tracking the center of pressure (COP), which does not\nfully capture the whole-body postural stability. This study explores the use of\nthe center of mass (COM) state space and presents a promising avenue for\nmonitoring the balance capabilities in humans. We employ a musculoskeletal\nmodel integrated with a balance controller, trained through reinforcement\nlearning (RL), to investigate balancing capabilities. The RL framework consists\nof two interconnected neural networks governing balance recovery and muscle\ncoordination respectively, trained using Proximal Policy Optimization (PPO)\nwith reference state initialization, early termination, and multiple training\nstrategies. By exploring recovery from random initial COM states (position and\nvelocity) space for a trained controller, we obtain the final BR enclosing\nsuccessful balance recovery trajectories. Comparing the BRs with analytical\npostural stability limits from a linear inverted pendulum model, we observe a\nsimilar trend in successful COM states but more limited ranges in the\nrecoverable areas. We further investigate the effect of muscle weakness and\nneural excitation delay on the BRs, revealing reduced balancing capability in\ndifferent regions. Overall, our approach of learning muscular balance\ncontrollers presents a promising new method for establishing balance recovery\nlimits and objectively assessing balance capability in bipedal systems,\nparticularly in humans.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:53:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Akba\u015f","K\u00fcbra",""],["Mummolo","Carlotta",""],["Zhou","Xianlian",""]]}
{"id":"2308.04463","submitter":"Li Chen","authors":"Jiahong Ouyang, Li Chen, Gary Y. Li, Naveen Balaraju, Shubham Patil,\n  Courosh Mehanian, Sourabh Kulhare, Rachel Millin, Kenton W. Gregory, Cynthia\n  R. Gregory, Meihua Zhu, David O. Kessler, Laurie Malia, Almaz Dessie, Joni\n  Rabiner, Di Coneybeare, Bo Shopsin, Andrew Hersh, Cristian Madar, Jeffrey\n  Shupp, Laura S. Johnson, Jacob Avila, Kristin Dwyer, Peter Weimersheimer,\n  Balasundar Raju, Jochen Kruecker, and Alvin Chen","title":"Weakly Semi-Supervised Detection in Lung Ultrasound Videos","comments":"IPMI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Frame-by-frame annotation of bounding boxes by clinical experts is often\nrequired to train fully supervised object detection models on medical video\ndata. We propose a method for improving object detection in medical videos\nthrough weak supervision from video-level labels. More concretely, we aggregate\nindividual detection predictions into video-level predictions and extend a\nteacher-student training strategy to provide additional supervision via a\nvideo-level loss. We also introduce improvements to the underlying\nteacher-student framework, including methods to improve the quality of\npseudo-labels based on weak supervision and adaptive schemes to optimize\nknowledge transfer between the student and teacher networks. We apply this\napproach to the clinically important task of detecting lung consolidations\n(seen in respiratory infections such as COVID-19 pneumonia) in medical\nultrasound videos. Experiments reveal that our framework improves detection\naccuracy and robustness compared to baseline semi-supervised models, and\nimproves efficiency in data and annotation usage.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:36:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ouyang","Jiahong",""],["Chen","Li",""],["Li","Gary Y.",""],["Balaraju","Naveen",""],["Patil","Shubham",""],["Mehanian","Courosh",""],["Kulhare","Sourabh",""],["Millin","Rachel",""],["Gregory","Kenton W.",""],["Gregory","Cynthia R.",""],["Zhu","Meihua",""],["Kessler","David O.",""],["Malia","Laurie",""],["Dessie","Almaz",""],["Rabiner","Joni",""],["Coneybeare","Di",""],["Shopsin","Bo",""],["Hersh","Andrew",""],["Madar","Cristian",""],["Shupp","Jeffrey",""],["Johnson","Laura S.",""],["Avila","Jacob",""],["Dwyer","Kristin",""],["Weimersheimer","Peter",""],["Raju","Balasundar",""],["Kruecker","Jochen",""],["Chen","Alvin",""]]}
{"id":"2308.04464","submitter":"Mohammad Heydari","authors":"Ali Bayat, Mohammad Heydari, Amir Albadvi","title":"Analysis of Insect-Plant Interactions Affected by Mining Operations, A\n  Graph Mining Approach","comments":"9 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The decline in ecological connections signifies the potential extinction of\nspecies, which can be attributed to disruptions and alterations. The decrease\nin interconnections among species reflects their susceptibility to changes. For\nexample, certain insects and plants that rely on exclusive interactions with a\nlimited number of species, or even a specific species, face the risk of\nextinction if they lose these crucial connections. Currently, mining activities\npose significant harm to natural ecosystems, resulting in various adverse\nenvironmental impacts. In this study, we utilized network science techniques to\nanalyze the ecosystem in a graph-based structure, aiming to conserve the\necosystem affected by mining operations in the northern region of Scotland. The\nresearch encompasses identifying the most vital members of the network,\nestablishing criteria for identifying communities within the network,\ncomparing, and evaluating them, using models to predict secondary extinctions\nthat occur when a species is removed from the network, and assessing the extent\nof network damage. Our study's novelty is utilizing network science approaches\nto investigate the biological data related to interactions between insects and\nplants.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 02:53:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bayat","Ali",""],["Heydari","Mohammad",""],["Albadvi","Amir",""]]}
{"id":"2308.04465","submitter":"Qingxiang Li Prof.","authors":"Qingxiang Li, Zichen Li, Xuqian Li, Zengyun Hu, Aiguo Dai, Wenjie\n  Dong, Boyin Huang, Zhihong Jiang, Panmao Zhai, Tianjun Zhou, Phil Jones","title":"Constraining the global mean surface temperature during 1850-1880 with\n  new statistical physical model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As IPCC ARs stated, global warming is estimated based on the average from\n1850 to 1900 (global average temperature of preindustrialization estimated from\nrelatively sparse observations). Given the impossibility of massive increasing\nobservation data in the early stages, accurately constraining this baseline has\nbecome an unresolved issue. Here we developed a new statistical physical model\nto quantify the contribution of external forcings to global warming as a\n\"deterministic trend\" of the surface temperature series (instead of as\nnon-stationary processes that yield a stochastic trend) and constrained the\nreconstruction of the early time series (1850-1880). We find that the existing\ndatasets slightly overestimated the temperature anomalies in this period, thus\nthe speed of global warming since pre-industrialization is still\nunderestimated.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:08:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Qingxiang",""],["Li","Zichen",""],["Li","Xuqian",""],["Hu","Zengyun",""],["Dai","Aiguo",""],["Dong","Wenjie",""],["Huang","Boyin",""],["Jiang","Zhihong",""],["Zhai","Panmao",""],["Zhou","Tianjun",""],["Jones","Phil",""]]}
{"id":"2308.04466","submitter":"Haomin Zhuang","authors":"Haomin Zhuang, Mingxian Yu, Hao Wang, Yang Hua, Jian Li, and Xu Yuan","title":"Backdoor Federated Learning by Poisoning Backdoor-Critical Layers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) has been widely deployed to enable machine learning\ntraining on sensitive data across distributed devices. However, the\ndecentralized learning paradigm and heterogeneity of FL further extend the\nattack surface for backdoor attacks. Existing FL attack and defense\nmethodologies typically focus on the whole model. None of them recognizes the\nexistence of backdoor-critical (BC) layers-a small subset of layers that\ndominate the model vulnerabilities. Attacking the BC layers achieves equivalent\neffects as attacking the whole model but at a far smaller chance of being\ndetected by state-of-the-art (SOTA) defenses. This paper proposes a general\nin-situ approach that identifies and verifies BC layers from the perspective of\nattackers. Based on the identified BC layers, we carefully craft a new backdoor\nattack methodology that adaptively seeks a fundamental balance between\nattacking effects and stealthiness under various defense strategies. Extensive\nexperiments show that our BC layer-aware backdoor attacks can successfully\nbackdoor FL under seven SOTA defenses with only 10% malicious clients and\noutperform the latest backdoor attack methods.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:46:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhuang","Haomin",""],["Yu","Mingxian",""],["Wang","Hao",""],["Hua","Yang",""],["Li","Jian",""],["Yuan","Xu",""]]}
{"id":"2308.04467","submitter":"Bechir Hamdaoui","authors":"Abdurrahman Elmaghbub and Bechir Hamdaoui","title":"EPS: Distinguishable IQ Data Representation for Domain-Adaptation\n  Learning of Device Fingerprints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Deep learning (DL)-based RF fingerprinting (RFFP) technology has emerged as a\npowerful physical-layer security mechanism, enabling device identification and\nauthentication based on unique device-specific signatures that can be extracted\nfrom the received RF signals. However, DL-based RFFP methods face major\nchallenges concerning their ability to adapt to domain (e.g., day/time,\nlocation, channel, etc.) changes and variability. This work proposes a novel IQ\ndata representation and feature design, termed Double-Sided Envelope Power\nSpectrum or EPS, that is proven to overcome the domain adaptation problems\nsignificantly. By accurately capturing device hardware impairments while\nsuppressing irrelevant domain information, EPS offers improved feature\nselection for DL models in RFFP. Experimental evaluations demonstrate its\neffectiveness, achieving over 99% testing accuracy in same-day/channel/location\nevaluations and 93% accuracy in cross-day evaluations, outperforming the\ntraditional IQ representation. Additionally, EPS excels in cross-location\nevaluations, achieving a 95% accuracy. The proposed representation\nsignificantly enhances the robustness and generalizability of DL-based RFFP\nmethods, thereby presenting a transformative solution to IQ data-based device\nfingerprinting.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:48:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Elmaghbub","Abdurrahman",""],["Hamdaoui","Bechir",""]]}
{"id":"2308.04468","submitter":"Mohammad Naanaa","authors":"Mohammad Naanaa, Katharina Schmid, Yinyu Nie","title":"3D Scene Diffusion Guidance using Scene Graphs","comments":"5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Guided synthesis of high-quality 3D scenes is a challenging task. Diffusion\nmodels have shown promise in generating diverse data, including 3D scenes.\nHowever, current methods rely directly on text embeddings for controlling the\ngeneration, limiting the incorporation of complex spatial relationships between\nobjects. We propose a novel approach for 3D scene diffusion guidance using\nscene graphs. To leverage the relative spatial information the scene graphs\nprovide, we make use of relational graph convolutional blocks within our\ndenoising network. We show that our approach significantly improves the\nalignment between scene description and generated scene.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:16:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Naanaa","Mohammad",""],["Schmid","Katharina",""],["Nie","Yinyu",""]]}
{"id":"2308.04469","submitter":"Jayanthi Vajiram Mrs","authors":"Jayanthi Vajiram, Negha Senthil, Nean Adhith.P","title":"Correlating Medi-Claim Service by Deep Learning Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Medical insurance claims are of organized crimes related to patients,\nphysicians, diagnostic centers, and insurance providers, forming a chain\nreaction that must be monitored constantly. These kinds of frauds affect the\nfinancial growth of both insured people and health insurance companies. The\nConvolution Neural Network architecture is used to detect fraudulent claims\nthrough a correlation study of regression models, which helps to detect money\nlaundering on different claims given by different providers. Supervised and\nunsupervised classifiers are used to detect fraud and non-fraud claims.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:40:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vajiram","Jayanthi",""],["Senthil","Negha",""],["P","Nean Adhith.",""]]}
{"id":"2308.04470","submitter":"Doyoung Park","authors":"Doyoung Park, Jinsoo Kim, Jina Nam, Jooyoung Chang, Sang Min Park","title":"D-Score: A Synapse-Inspired Approach for Filter Pruning","comments":"9 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper introduces a new aspect for determining the rank of the\nunimportant filters for filter pruning on convolutional neural networks (CNNs).\nIn the human synaptic system, there are two important channels known as\nexcitatory and inhibitory neurotransmitters that transmit a signal from a\nneuron to a cell. Adopting the neuroscientific perspective, we propose a\nsynapse-inspired filter pruning method, namely Dynamic Score (D-Score). D-Score\nanalyzes the independent importance of positive and negative weights in the\nfilters and ranks the independent importance by assigning scores. Filters\nhaving low overall scores, and thus low impact on the accuracy of neural\nnetworks are pruned. The experimental results on CIFAR-10 and ImageNet datasets\ndemonstrate the effectiveness of our proposed method by reducing notable\namounts of FLOPs and Params without significant Acc. Drop.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 08:45:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Park","Doyoung",""],["Kim","Jinsoo",""],["Nam","Jina",""],["Chang","Jooyoung",""],["Park","Sang Min",""]]}
{"id":"2308.04471","submitter":"Miko{\\l}aj Rogalski","authors":"Miko{\\l}aj Rogalski, Piotr Arcab, Luiza Stanaszek, Vicente Mic\\'o,\n  Chao Zuo, Maciej Trusiak","title":"Physics-driven universal twin-image removal network for digital in-line\n  holographic microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Digital in-line holographic microscopy (DIHM) enables efficient and\ncost-effective computational quantitative phase imaging with a large field of\nview, making it valuable for studying cell motility, migration, and\nbio-microfluidics. However, the quality of DIHM reconstructions is compromised\nby twin-image noise, posing a significant challenge. Conventional methods for\nmitigating this noise involve complex hardware setups or time-consuming\nalgorithms with often limited effectiveness. In this work, we propose UTIRnet,\na deep learning solution for fast, robust, and universally applicable\ntwin-image suppression, trained exclusively on numerically generated datasets.\nThe availability of open-source UTIRnet codes facilitates its implementation in\nvarious DIHM systems without the need for extensive experimental training data.\nNotably, our network ensures the consistency of reconstruction results with\ninput holograms, imparting a physics-based foundation and enhancing reliability\ncompared to conventional deep learning approaches. Experimental verification\nwas conducted among others on live neural glial cell culture migration sensing,\nwhich is crucial for neurodegenerative disease research.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 09:06:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rogalski","Miko\u0142aj",""],["Arcab","Piotr",""],["Stanaszek","Luiza",""],["Mic\u00f3","Vicente",""],["Zuo","Chao",""],["Trusiak","Maciej",""]]}
{"id":"2308.04472","submitter":"Arnaldo Spalvieri","authors":"Arnaldo Spalvieri","title":"Entropy of the Canonical Occupancy (Macro) State in the Quantum\n  Measurement Theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper analyzes the entropy of a system composed by an arbitrary number of\nindistinguishable particles at the equilibrium, defining entropy as a function\nof the quantum state of the system, not of its phase space representation. Our\ncrucial observation is that the entropy of the system is the Shannon entropy of\nthe random occupancy numbers of the quantum states allowed to system's\nparticles. We consider the information-theoretic approach, which is based on\nJaynes' maximum entropy principle, and the empirical approach, which leads to\ncanonical typicality in modern quantum thermodynamics. In the\ninformation-theoretic approach, the occupancy numbers of particles' quantum\nstates are multinomially distributed, while in the empirical approach their\ndistribution is multivariate hypergeometric. As the number of samples of the\nempirical probability tends to infinity, the multivariate hypergeometric\ndistribution tends to the multinomial distribution. This reconciles, at least\nin the limit, the two approaches. When regarded from the perspective of quantum\nmeasurement, our analysis suggests the existence of another kind of\nsubjectivism than the well-known subjectivism that characterizes the maximum\nentropy approach. This form of subjectivity is responsible for the collapse of\nentropy to zero after the quantum measurement, both in the\ninformation-theoretic and in the empirical approaches.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 10:26:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Spalvieri","Arnaldo",""]]}
{"id":"2308.04473","submitter":"Alesya Sokolova","authors":"Alesya Sokolova","title":"Opponents and proponents of the war in Ukraine in Russian social media:\n  who are they?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the personality of Russians who support the war in Ukraine is\none of the key steps to understanding how this war became possible. However,\nduring the war, traditional sociological methods are not always applicable.\nSocial media provides an alternative source of what is inside people's heads.\nIn this paper, I compare the political identities, values, and interests of\nsocial media users in Russia who hold a strong position for or against the war\nin Ukraine. I collect data from VK, the most popular Russian social media\nplatform, and analyze self-filled profile information as well as the groups\nthat the users subscribed to. I found that proponents of the war tend to have a\nweaker political identity (self-identified as \"moderate\") compared to\nopponents, who specify it more precisely (often, but not limited to,\n\"liberal\"). Additionally, the values of the proponents more frequently align\nwith those promoted by the Russian government, such as orthodoxy and family.\nDespite these differences, pro-war and anti-war users share many common\ninterests, as evidenced by their subscriptions to the same groups focused on\nmusic, history, and sport. When asked to state the most important trait in\npeople (a field users can fill in VK), the most frequent answer for both groups\nis \"kindness and honesty\". The analysis results, in addition to contributing to\nthe understanding of public opinion in Russia, can be utilized for predicting\none's position on the war based on their social media profile.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:21:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sokolova","Alesya",""]]}
{"id":"2308.04474","submitter":"Martin Klazar","authors":"Martin Klazar","title":"HMC real numbers in Countable Mathematical Analysis","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a theory of real numbers as rational Cauchy sequences, in which\nany two of them, $(a_n)$ and $(b_n)$, are equal iff $\\lim\\,(a_n-b_n)=0$. We\nneed such reals in the Countable Mathematical Analysis ([4]) which allows to\nuse only hereditarily at most countable (HMC) sets.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:17:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Klazar","Martin",""]]}
{"id":"2308.04475","submitter":"Thom\\'as Jung Spier","authors":"Gabriel Coutinho, Thom\\'as Jung Spier","title":"Sums of squares of eigenvalues and the vector chromatic number","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this short paper we prove that the sum of the squares of negative (or\npositive) eigenvalues of the adjacency matrix of a graph is lower bounded by\nthe sum of the degrees divided by the vector chromatic number, resolving a\nconjecture by Wocjan, Elphick and Anekstein (2018).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:37:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Coutinho","Gabriel",""],["Spier","Thom\u00e1s Jung",""]]}
{"id":"2308.04476","submitter":"Katherine Dale","authors":"K. I. Dale, D. C. Rubie, M. Nakajima, S. Jacobson, G. Nathan, G. J.\n  Golabek, S. Cambioni, A. Morbidelli","title":"An improved model of metal/silicate differentiation during Earth's\n  accretion","comments":"Accepted in Icarus","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We improved the algorithm presented in Rubie et al. (2015) to model the\nchemical evolution of Earth driven by iron/silicate differentiation during the\nplanet's accretion. The pressure at which the equilibration occurs during a\ngiant impact is no longer a free parameter but is determined by the smooth\nparticle hydrodynamic (SPH) simulations of Nakajima et al. (2021). Moreover,\nimpacting planetesimals are now assumed to be too small to cause melting and\ndifferentiation and thus their materials are stored in the crystalline upper\nmantle of the growing planet until a hydrostatically relaxed global magma ocean\nforms in the aftermath of a giant impact, whose depth is also estimated from\nNakajima et al. (2021). With these changes, not all dynamical simulations lead\nto a satisfactory reproduction of the chemical composition of the bulk silicate\nEarth (BSE). Thus, the latter becomes diagnostic of the success of dynamical\nmodels. In the successful cases also the BSE abundances of W and Mo can be\nreproduced, that were previously hard to fit (Jennings et al., 2021).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:41:34 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dale","K. I.",""],["Rubie","D. C.",""],["Nakajima","M.",""],["Jacobson","S.",""],["Nathan","G.",""],["Golabek","G. J.",""],["Cambioni","S.",""],["Morbidelli","A.",""]]}
{"id":"2308.04477","submitter":"Alessio Buscemi","authors":"Alessio Buscemi","title":"A Comparative Study of Code Generation using ChatGPT 3.5 across 10\n  Programming Languages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) are advanced Artificial Intelligence (AI)\nsystems that have undergone extensive training using large datasets in order to\nunderstand and produce language that closely resembles that of humans. These\nmodels have reached a level of proficiency where they are capable of\nsuccessfully completing university exams across several disciplines and\ngenerating functional code to handle novel problems. This research investigates\nthe coding proficiency of ChatGPT 3.5, a LLM released by OpenAI in November\n2022, which has gained significant recognition for its impressive text\ngenerating and code creation capabilities. The skill of the model in creating\ncode snippets is evaluated across 10 various programming languages and 4\ndifferent software domains. Based on the findings derived from this research,\nmajor unexpected behaviors and limitations of the model have been identified.\nThis study aims to identify potential areas for development and examine the\nramifications of automated code generation on the evolution of programming\nlanguages and on the tech industry.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:02:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Buscemi","Alessio",""]]}
{"id":"2308.04478","submitter":"Ziyu Zhu","authors":"Ziyu Zhu and Ximing Xu","title":"EasyMergeR: an interactive Shiny application to manipulate multiple XLSX\n  files of multiple sheets","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The integration of sequencing data with clinical information is a widely\naccepted strategy in bioinformatics and health informatics. Despite advanced\ndatabases and sophisticated tools for processing omics data, challenges remain\nin handling the raw clinical data (typically in XLSX format with multiple\nsheets inside), either exported from health information system (HIS) or\nmanually collected by investigators. This is particularly difficult for\ntime-constrained medical staff with little or no programming background, and it\nis typically the first bottleneck in many clinical-oriented studies. To fill\nthis gap, we developed EasyMergeR, a simple, user-friendly, code-free R Shiny\napplication that allows interactive manipulation of multiple XLSX files with\nmultiple sheets and provides basic data manipulation capabilities based on the\ntidyverse and other handy R packages.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:08:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Ziyu",""],["Xu","Ximing",""]]}
{"id":"2308.04479","submitter":"Sergey Korotin","authors":"S. M. Andrievsky, S. A. Korotin, K. Werner","title":"Abundance of radioactive technetium in Przybylski's star revisited","comments":"4 pages, 3 figures","journal-ref":null,"doi":"10.1002/asna.20230077","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have searched for lines of the radioactive element technetium (Tc) in the\nspectrum of Przybylski's star (HD101065). The nuclei of this chemical element\nare formed in the slow process of capturing thermalized neutrons. The possible\nlines of Tc~I are heavily blended. We have synthesized the profile of one\nresonance line at 4297.06 \\AA~, which is also a part of the complex blend, and\nwe arrived at a decision that it is not visible in the spectrum (as was first\nnoted by Ryabchikova), casting doubt on the existence of technetium in the\natmosphere of the Przybylski's star. Therefore, based on our calculated\ncombined profile, which has been adjusted to the observed blend profile at\n~4297.2 A (that may possibly contain the resonance technetium line 4297.06 A),\nwe reduce the maximum technetium abundance to $\\log\\epsilon$(Tc/H) = 2.5. This\nvalue can be considered only as an upper limit of the technetium abundance in\nthe Przybylski's star.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:32:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Andrievsky","S. M.",""],["Korotin","S. A.",""],["Werner","K.",""]]}
{"id":"2308.04480","submitter":"Patrick A. Lee","authors":"Patrick A. Lee and Zhehao Dai","title":"Effective model for Pb$_9$Cu(PO$_4$)$_6$O","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The copper substituted Pb-apatite has attracted a great deal of attention\nrecently, due to the claim of the observation of room temperature\nsuperconductivity. Based on LDA calculations in the literature, we propose an\neffective model that describe the low energy physics. It consists of stacks of\nbuckled honeycomb lattices, with Cu and O occupying the A and B sites\nrespectively. In addition to the narrow Cu bands that have been emphasized, we\ncall attention to the relatively small energy separation between the Cu and O\norbitals. Thus despite the small hoping energies, the model may be in an\ninteresting regime near the metal insulator transition driven by the charge\ntransfer mechanism. Relationship with cuprates and the organic superconductors\nare discussed.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:42:22 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 21:46:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lee","Patrick A.",""],["Dai","Zhehao",""]]}
{"id":"2308.04481","submitter":"Roland Farrell","authors":"Roland C. Farrell, Marc Illa, Anthony N. Ciavarella, Martin J. Savage","title":"Scalable Circuits for Preparing Ground States on Digital Quantum\n  Computers: The Schwinger Model Vacuum on 100 Qubits","comments":"14 pages + appendices. 14 figures, 12 tables","journal-ref":null,"doi":null,"report-no":"IQuS@UW-21-060, NT@UW-23-13","categories":"quant-ph hep-lat hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The vacuum of the lattice Schwinger model is prepared on up to 100 qubits of\nIBM's Eagle-processor quantum computers. A new algorithm to prepare the ground\nstate of a gapped translationally-invariant system on a quantum computer is\npresented, which we call Scalable Circuits ADAPT-VQE (SC-ADAPT-VQE). This\nalgorithm uses the exponential decay of correlations between distant regions of\nthe ground state, together with ADAPT-VQE, to construct quantum circuits for\nstate preparation that can be scaled to arbitrarily large systems. SC-ADAPT-VQE\nis applied to the Schwinger model, and shown to be systematically improvable,\nwith an accuracy that converges exponentially with circuit depth. Both the\nstructure of the circuits and the deviations of prepared wavefunctions are\nfound to become independent of the number of spatial sites, $L$. This allows\nfor a controlled extrapolation of the circuits, determined using small or\nmodest-sized systems, to arbitrarily large $L$. The circuits for the Schwinger\nmodel are determined on lattices up to $L=14$ (28 qubits) with the qiskit\nclassical simulator, and subsequently scaled up to prepare the $L=50$ (100\nqubits) vacuum on IBM's 127 superconducting-qubit quantum computers\nibm_brisbane and ibm_cusco. After applying an improved error-mitigation\ntechnique, which we call Operator Decoherence Renormalization, the chiral\ncondensate and charge-charge correlators obtained from the quantum computers\nare found to be in good agreement with classical Matrix Product State\nsimulations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Farrell","Roland C.",""],["Illa","Marc",""],["Ciavarella","Anthony N.",""],["Savage","Martin J.",""]]}
{"id":"2308.04482","submitter":"Camila De S\\'a-Freitas","authors":"Camila de S\\'a-Freitas, Dimitri A. Gadotti, Francesca Fragkoudi,\n  Lodovico Coccato, Paula Coelho, Adriana de Lorenzo-C\\'aceres, Jes\\'us\n  Falc\\'on-Barroso, Tutku Kolcu, Ignacio Mart\\'in-Navarro, Jairo Mendez-Abreu,\n  Justus Neumann, Patricia Sanchez Blazquez, Miguel Querejeta, and Glenn van de\n  Ven","title":"Disc galaxies are still settling: The discovery of the smallest nuclear\n  discs and their young stellar bars","comments":"Accepted in A&A (in press), 13 pages, 5 figures, 2 tabels","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When galactic discs settle and become massive enough, they are able to form\nstellar bars. These non-axisymmetric structures induce shocks in the gas,\ncausing it to flow to the centre where nuclear structures, such as nuclear\ndiscs and rings, are formed. Previous theoretical and observational studies\nhave hinted at the co-evolution of bars and nuclear discs, suggesting that\nnuclear discs grow \"inside-out\", thereby proposing that smaller discs live in\nyounger bars. Nevertheless, it remains unclear how the bar and the nuclear\nstructures form and evolve with time. The smallest nuclear discs discovered to\ndate tend to be larger than $\\sim200~\\rm{pc}$, even though some theoretical\nstudies find that when nuclear discs form they can be much smaller. Using MUSE\narchival data, we report for the first time two extragalactic nuclear discs\nwith radius sizes below $100~\\rm{pc}$. Additionally, our estimations reveal the\nyoungest bars found to date. We estimate that the bars in these galaxies formed\n$4.50^{+1.60}_{-1.10}\\rm{(sys)}^{+1.00}_{-0.75}\\rm{(stat)}$ and\n$0.7^{+2.60}\\rm{(sys)}^{+0.05}_{-0.05}\\rm{(stat)}~\\rm{Gyr}$ ago, for NGC\\,289\nand NGC\\,1566, respectively. This suggests that at least some disc galaxies in\nthe Local Universe may still be dynamically settling. By adding these results\nto previous findings in the literature, we retrieve a stronger correlation\nbetween nuclear disc size and bar length and we derive a tentative exponential\ngrowth scenario for nuclear discs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["de S\u00e1-Freitas","Camila",""],["Gadotti","Dimitri A.",""],["Fragkoudi","Francesca",""],["Coccato","Lodovico",""],["Coelho","Paula",""],["de Lorenzo-C\u00e1ceres","Adriana",""],["Falc\u00f3n-Barroso","Jes\u00fas",""],["Kolcu","Tutku",""],["Mart\u00edn-Navarro","Ignacio",""],["Mendez-Abreu","Jairo",""],["Neumann","Justus",""],["Blazquez","Patricia Sanchez",""],["Querejeta","Miguel",""],["van de Ven","Glenn",""]]}
{"id":"2308.04483","submitter":"Hector Afonso Cruz","authors":"Hector Afonso G. Cruz, Tal Adi, Jordan Flitter, Marc Kamionkowski, Ely\n  D. Kovetz","title":"21-cm fluctuations from primordial magnetic fields","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fluid forces associated with primordial magnetic fields (PMFs) generate\nsmall-scale fluctuations in the primordial density field, which add to the\n$\\mathrm{\\Lambda CDM}$ linear matter power spectrum on small scales. These\nenhanced small-scale fluctuations lead to earlier formation of galactic halos\nand stars and thus affect cosmic reionization. We study the consequences of\nthese effects on 21 cm observables using the semi-numerical code 21cmFAST\nv3.1.3. We find the excess small-scale structure generates strong stellar\nradiation backgrounds in the early Universe, resulting in altered 21 cm global\nsignals and power spectra commensurate with earlier reionization. We restrict\nthe allowed PMF models using the CMB optical depth to reionization. Lastly, we\nprobe parameter degeneracies and forecast experimental sensitivities with an\ninformation matrix analysis subject to the CMB optical depth bound. Our\nforecasts show that interferometers like HERA are sensitive to PMFs of order\n$\\sim \\mathrm{pG}$, nearly an order of magnitude stronger than existing and\nnext-generation experiments.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cruz","Hector Afonso G.",""],["Adi","Tal",""],["Flitter","Jordan",""],["Kamionkowski","Marc",""],["Kovetz","Ely D.",""]]}
{"id":"2308.04484","submitter":"Jeffrey Rau","authors":"Paul A. McClarty and Jeffrey G. Rau","title":"Landau Theory of Altermagnetism","comments":"5+ pages, 2 figures","journal-ref":null,"doi":null,"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":"  We formulate a Landau theory for altermagnets, a class of colinear\ncompensated magnets with spin-split bands. Starting from the non-relativistic\nlimit, this Landau theory goes beyond a conventional analysis by including\nspin-space symmetries, providing a simple framework for understanding the key\nfeatures of this family of materials. We find a set of multipolar secondary\norder parameters connecting existing ideas about the spin symmetries of these\nsystems, their order parameters and the effect of non-zero spin-orbit coupling.\nWe account for several features of canonical altermagnets such as RuO$_2$, MnTe\nand CuF$_2$ that go beyond symmetry alone, relating the order parameter to key\nobservables such as magnetization, anomalous Hall conductivity and\nmagneto-elastic and magneto-optical probes. Finally, we comment on\ngeneralizations of our framework to a wider family of exotic magnetic systems\nderiving from the zero spin-orbit coupled limit.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["McClarty","Paul A.",""],["Rau","Jeffrey G.",""]]}
{"id":"2308.04485","submitter":"Eric Burns","authors":"Eric Burns, Michael Coughlin, Kendall Ackley, Igor Andreoni,\n  Marie-Anne Bizouard, Floor Broekgaarden, Nelson L. Christensen, Filippo\n  D'Ammando, James DeLaunay, Henrike Fleischhack, Raymond Frey, Chris L. Fryer,\n  Adam Goldstein, Bruce Grossan, Rachel Hamburg, Dieter H. Hartmann, Anna Y. Q.\n  Ho, Eric J. Howell, C. Michelle Hui, Leah Jenks, Alyson Joens, Stephen\n  Lesage, Andrew J. Levan, Amy Lien, Athina Meli, Michela Negro, Tyler\n  Parsotan, Oliver J. Roberts, Marcos Santander, Jacob R. Smith, Aaron\n  Tohuvavohu, John A. Tomsick, Zorawar Wadiasingh, Peter Veres, Ashley V.\n  Villar, Haocheng Zhang, and Sylvia J. Zhu","title":"Gamma-ray Transient Network Science Analysis Group Report","comments":"Terms of Reference and additional information on the Science Analysis\n  Group are available at https://pcos.gsfc.nasa.gov/sags/gtn-sag.php","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Interplanetary Network (IPN) is a detection, localization and alert\nsystem that utilizes the arrival time of transient signals in gamma-ray\ndetectors on spacecraft separated by planetary baselines to geometrically\nlocate the origin of these transients. Due to the changing astrophysical\nlandscape and the new emphasis on time domain and multi-messenger astrophysics\n(TDAMM) from the Pathways to Discovery in Astronomy and Astrophysics for the\n2020s, this Gamma-ray Transient Network Science Analysis Group was tasked to\nunderstand the role of the IPN and high-energy monitors in this new era. The\ncharge includes describing the science made possible with these facilities,\ntracing the corresponding requirements and capabilities, and highlighting where\nimproved operations of existing instruments and the IPN would enhance TDAMM\nscience. While this study considers the full multiwavelength and multimessenger\ncontext, the findings are specific to space-based high-energy monitors. These\nfacilities are important both for full characterization of these transients as\nwell as facilitating follow-up observations through discovery and localization.\nThe full document reports a brief history of this field, followed by our\ndetailed analyses and findings in some 68 pages, providing a holistic overview\nof the role of the IPN and high-energy monitors in the coming decades.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Burns","Eric",""],["Coughlin","Michael",""],["Ackley","Kendall",""],["Andreoni","Igor",""],["Bizouard","Marie-Anne",""],["Broekgaarden","Floor",""],["Christensen","Nelson L.",""],["D'Ammando","Filippo",""],["DeLaunay","James",""],["Fleischhack","Henrike",""],["Frey","Raymond",""],["Fryer","Chris L.",""],["Goldstein","Adam",""],["Grossan","Bruce",""],["Hamburg","Rachel",""],["Hartmann","Dieter H.",""],["Ho","Anna Y. Q.",""],["Howell","Eric J.",""],["Hui","C. Michelle",""],["Jenks","Leah",""],["Joens","Alyson",""],["Lesage","Stephen",""],["Levan","Andrew J.",""],["Lien","Amy",""],["Meli","Athina",""],["Negro","Michela",""],["Parsotan","Tyler",""],["Roberts","Oliver J.",""],["Santander","Marcos",""],["Smith","Jacob R.",""],["Tohuvavohu","Aaron",""],["Tomsick","John A.",""],["Wadiasingh","Zorawar",""],["Veres","Peter",""],["Villar","Ashley V.",""],["Zhang","Haocheng",""],["Zhu","Sylvia J.",""]]}
{"id":"2308.04486","submitter":"Eric Coughlin","authors":"Eric R. Coughlin","title":"The division between weak and strong explosions from failed supernovae","comments":"23 pages, 17 figures, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Some massive stars likely fail to produce core-collapse supernovae, but these\nfailed supernovae (FSNe) can generate an electromagnetic outburst prior to the\ndisappearance of the star, as the mass lost to neutrinos during the stellar\ncore-collapse results in the formation and breakout of a second shock. We show\nthat when the mass lost to neutrinos is sufficiently small, there are two\nself-similar solutions that describe the propagation of a weak shock into a\nhydrodynamically expanding envelope that simultaneously yield accretion onto\nthe black hole. The larger-Mach number solution is unstable and yields the\nminimum Mach number that a shock must have to strengthen into the\nenergy-conserving regime. Above a critical mass loss there are no weak-shock\nsolutions, implying that there are only strong explosions if the neutrino mass\nloss is above a critical value, and this value is a few percent of the mass of\nthe star (and is physically achievable) for typical parameters. Our results\nimply that the fate of the explosion from a FSN -- weak with little to no mass\nejection or strong with the expulsion of the majority of the envelope -- is a\nsensitive function of the stellar properties and the neutrino mass loss. We\nalso show that there is a second type of self-similar solution for the shock\nthat results in the ``settling'' of the gas near the compact object, which may\nbe applicable to non-terminal stellar eruptions and the response of a gaseous\ndisc to gravitational-wave induced mass loss from a binary black hole merger.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Coughlin","Eric R.",""]]}
{"id":"2308.04487","submitter":"Jan Drewniok","authors":"Jan Drewniok and Marcel Walter and Robert Wille","title":"The Need for Speed: Efficient Exact Simulation of Silicon Dangling Bond\n  Logic","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Silicon Dangling Bond (SiDB) logic platform, an emerging computational\nbeyond-CMOS nanotechnology, is a promising competitor due to its ability to\nachieve integration density and clock speed values that are several orders of\nmagnitude higher compared to current CMOS fabrication nodes. However, the exact\nphysical simulation of SiDB layouts, which is an essential component of any\ndesign validation workflow, is computationally expensive. In this paper, we\npropose a novel algorithm called QuickExact, which aims to be both, efficient\nand exact. To this end, we are introducing three techniques, namely 1)\nPhysically-informed Search Space Pruning, 2) Partial Solution Caching, and 3)\nEffective State Enumeration. Extensive experimental evaluations confirm that,\ncompared to the state-of-the-art algorithm, the resulting approach leads to a\nparamount runtime advantage of more than a factor of 5000 on randomly generated\nlayouts and more than a factor of 2000 on an established gate library.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Drewniok","Jan",""],["Walter","Marcel",""],["Wille","Robert",""]]}
{"id":"2308.04488","submitter":"Marco Rigobello","authors":"Marco Rigobello, Giuseppe Magnifico, Pietro Silvi, Simone Montangero","title":"Hadrons in (1+1)D Hamiltonian hardcore lattice QCD","comments":"8+5 pages, 12 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat cond-mat.str-el hep-ph physics.comp-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study 2-flavor Hamiltonian lattice QCD in (1+1)D with hardcore gluons, at\nzero and finite density, by means of matrix product states. We introduce a\nformulation of the theory where gauge redundancy is absent and construct a\ngauge invariant tensor network ansatz. We show that the model is critical in an\nextended subregion of parameter space and identify at least two distinct\nphases, one of which embeds the continuum limit location. We reconstruct a\nsubset of the particle spectrum in each phase, identifying edge and bulk\ngapless modes. We thereby show that the studied model provides a minimal SU(3)\ngauge theory whilst reproducing known phenomena of (3+1)D QCD. Most notably,\nits particle spectrum features charged pions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rigobello","Marco",""],["Magnifico","Giuseppe",""],["Silvi","Pietro",""],["Montangero","Simone",""]]}
{"id":"2308.04489","submitter":"Ananth Malladi","authors":"Po-Shen Hsin, Zhu-Xi Luo and Ananth Malladi","title":"Gapped Interfaces in Fracton Models and Foliated Fields","comments":"36 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work investigates the gapped interfaces of 3+1d fracton phases of matter\nusing foliated gauge theories and lattice models. We analyze the gapped\nboundaries and gapped interfaces in X cube model, and the gapped interfaces\nbetween the X-cube model and the toric code. The gapped interfaces are either\n\"undecorated\" or \"decorated\", where the \"decorated\" interfaces have additional\nChern-Simons like actions for foliated gauge fields. We discover many new\ngapped boundaries and interfaces, such as (1) a gapped boundary for X-cube\nmodel where the electric lineons orthogonal to the interface become the\nmagnetic lineons, the latter are the composite of magnetic planons; (2) a\nKramers-Wannier-duality type gapped interface between the X-cube model and the\ntoric code model from gauging planar subsystem one-form symmetry; and (3) an\nelectromagnetic duality interface in the X-cube model that exchanges the\nelectric and magnetic lineons.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hsin","Po-Shen",""],["Luo","Zhu-Xi",""],["Malladi","Ananth",""]]}
{"id":"2308.04490","submitter":"Dhruva K.S","authors":"Sachin Jain and Dhruva K.S","title":"A Spin on the Bulk Locality of Slightly Broken Higher Spin Theories","comments":"55 pages including appendices, 1 figure","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 investigate if it is possible to express correlation\nfunctions in Large N Chern-Simons (CS) matter theories/ Slightly Broken Higher\nSpin (SBHS) theories purely in terms of single trace twist conformal blocks\n(TCBs). For this, we first develop the machinery for spinning TCBs. We do this\nboth by explicitly solving the spinning TCB eigenvalue equation taking into\naccount consistency with the operator product expansion (OPE) and crossing\nsymmetry, and also by employing weight shifting and spin raising operators and\nacting with them on scalar seeds. Using these results we show that spinning\ncorrelators in theories with exact higher spin symmetry can be entirely\nexpressed in terms of single trace TCBs. However, when the higher spin symmetry\nis slightly broken at large- N, even though the scalar four-point function is\ngiven by single-trace TCBs, the spinning correlators in general, are not. Our\nresults suggest that it may be possible to identify a sub-sector of SBHS theory\nwhich has a local bulk dual.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jain","Sachin",""],["S","Dhruva K.",""]]}
{"id":"2308.04491","submitter":"Stephan Ochsenfeld","authors":"Stephan Ochsenfeld and S\\\"oren Schlichting","title":"Hydrodynamic and Non-hydrodynamic Excitations in Kinetic Theory -- A\n  Numerical Analysis in Scalar Field Theory","comments":"30 pages and 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Viscous hydrodynamics serves as a successful mesoscopic description of the\nQuark-Gluon Plasma produced in relativistic heavy-ion collisions. In order to\ninvestigate, how such an effective description emerges from the underlying\nmicroscopic dynamics we calculate the hydrodynamic and non-hydrodynamic modes\nof linear response in the sound channel from a first-principle calculation in\nkinetic theory. We do this with a new approach wherein we discretize the\ncollision kernel to directly calculate eigenvalues and eigenmodes of the\nevolution operator. This allows us to study the Green's functions at any point\nin the complex frequency space. Our study focuses on scalar theory with quartic\ninteraction and we find that the analytic structure of Green's functions in the\ncomplex plane is far more complicated than just poles or cuts which is a first\nstep towards an equivalent study in QCD kinetic theory.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ochsenfeld","Stephan",""],["Schlichting","S\u00f6ren",""]]}
{"id":"2308.04492","submitter":"Sang Yun Kwon","authors":"Sang Yun Kwon, Gagan Bhatia, El Moatez Billah Nagoud, Muhammad\n  Abdul-Mageed","title":"ChatGPT for Arabic Grammatical Error Correction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, large language models (LLMs) fine-tuned to follow human instruction\nhave exhibited significant capabilities in various English NLP tasks. However,\ntheir performance in grammatical error correction (GEC) tasks, particularly in\nnon-English languages, remains significantly unexplored. In this paper, we\ndelve into abilities of instruction fine-tuned LLMs in Arabic GEC, a task made\ncomplex due to Arabic's rich morphology. Our findings suggest that various\nprompting methods, coupled with (in-context) few-shot learning, demonstrate\nconsiderable effectiveness, with GPT-4 achieving up to $65.49$\nF\\textsubscript{1} score under expert prompting (approximately $5$ points\nhigher than our established baseline). This highlights the potential of LLMs in\nlow-resource settings, offering a viable approach for generating useful\nsynthetic data for model training. Despite these positive results, we find that\ninstruction fine-tuned models, regardless of their size, significantly\nunderperform compared to fully fine-tuned models of significantly smaller\nsizes. This disparity highlights a substantial room for improvements for LLMs.\nInspired by methods from low-resource machine translation, we also develop a\nmethod exploiting synthetic data that significantly outperforms previous models\non two standard Arabic benchmarks. Our work sets new SoTA for Arabic GEC, with\n$72.19\\%$ and $73.26$ F$_{1}$ on the 2014 and 2015 QALB datasets, respectively.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:00:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kwon","Sang Yun",""],["Bhatia","Gagan",""],["Nagoud","El Moatez Billah",""],["Abdul-Mageed","Muhammad",""]]}
{"id":"2308.04493","submitter":"Sergi Ramos-Calderer","authors":"Hui Zhang, Lingxiao Wan, Sergi Ramos-Calderer, Yuancheng Zhan,\n  Wai-Keong Mok, Hong Cai, Feng Gao, Xianshu Luo, Guo-Qiang Lo, Leong Chuan\n  Kwek, Jos\\'e Ignacio Latorre and Ai Qun Liu","title":"Efficient option pricing with unary-based photonic computing chip and\n  generative adversarial learning","comments":"11 pages, 7 figures","journal-ref":"Photonics Research 10.1364/PRJ.493865 (2023)","doi":"10.1364/PRJ.493865","report-no":null,"categories":"quant-ph cs.LG q-fin.CP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the modern financial industry system, the structure of products has become\nmore and more complex, and the bottleneck constraint of classical computing\npower has already restricted the development of the financial industry. Here,\nwe present a photonic chip that implements the unary approach to European\noption pricing, in combination with the quantum amplitude estimation algorithm,\nto achieve a quadratic speedup compared to classical Monte Carlo methods. The\ncircuit consists of three modules: a module loading the distribution of asset\nprices, a module computing the expected payoff, and a module performing the\nquantum amplitude estimation algorithm to introduce speed-ups. In the\ndistribution module, a generative adversarial network is embedded for efficient\nlearning and loading of asset distributions, which precisely capture the market\ntrends. This work is a step forward in the development of specialized photonic\nprocessors for applications in finance, with the potential to improve the\nefficiency and quality of financial services.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:01:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Hui",""],["Wan","Lingxiao",""],["Ramos-Calderer","Sergi",""],["Zhan","Yuancheng",""],["Mok","Wai-Keong",""],["Cai","Hong",""],["Gao","Feng",""],["Luo","Xianshu",""],["Lo","Guo-Qiang",""],["Kwek","Leong Chuan",""],["Latorre","Jos\u00e9 Ignacio",""],["Liu","Ai Qun",""]]}
{"id":"2308.04494","submitter":"Jordan Taylor","authors":"Jordan K. Taylor, Ian P. McCulloch","title":"Wavefunction branching: when you can't tell pure states from mixed\n  states","comments":"18 pages, 8 figures; Added more references on quantum error\n  correction with symmetries","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 propose a definition of wavefunction \"branchings\": quantum superpositions\nwhich can't be feasibly distinguished from the corresponding mixed state, even\nunder time evolution. Our definition is largely independent of interpretations,\nrequiring only that it takes many more local gates to swap branches than to\ndistinguish them. We give several examples of states admitting such branch\ndecompositions. Under our definition, we show that attempts to get\nrelative-phase information between branches will fail without frequent active\nerror correction, that branches are effectively the opposite of good\nerror-correcting codes, that branches effectively only grow further apart in\ntime under natural evolution, that branches tend to absorb spatial\nentanglement, that branching is stronger in the presence of conserved\nquantities, and that branching implies effective irreversibility. Identifying\nthese branch decompositions in many-body quantum states could shed light on the\nemergence of classicality, provide a metric for experimental tests at the\nquantum/ classical boundary, and allow for longer numerical time evolution\nsimulations. We see this work as a generalization of the basic ideas of\nenvironmentally-induced decoherence to situations with no clear system/\nenvironment split.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:02:22 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 02:45:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Taylor","Jordan K.",""],["McCulloch","Ian P.",""]]}
{"id":"2308.04495","submitter":"Stefano Longhi","authors":"Stefano Longhi","title":"Phase transitions and bunching of correlated particles in a\n  non-Hermitian quasicrystal","comments":"Editors' Suggestion","journal-ref":"Phys. Rev. B 108, 075121 (2023)","doi":"10.1103/PhysRevB.108.075121","report-no":null,"categories":"quant-ph cond-mat.str-el physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-interacting particles in non-Hermitian quasi crystals display\nlocalization-delocalization and spectral phase transitions in complex energy\nplane, that can be characterized by point-gap topology. Here we investigate the\nspectral and dynamical features of two interacting particles in a non-Hermitian\nquasi crystal, described by an effective Hubbard model in an incommensurate\nsinusoidal potential with a complex phase, and unravel some intriguing effects\nwithout any Hermitian counterpart. Owing to the effective decrease of\ncorrelated hopping introduced by particle interaction, doublon states, i.e.\nbound particle states, display a much lower threshold for spectral and\nlocalization-delocalization transitions than single-particle states, leading to\nthe emergence of mobility edges. Remarkably, since doublons display longer\nlifetimes, two particles initially placed in distant sites tend to bunch and\nstick together, forming a doublon state in the long time limit of evolution, a\nphenomenon that can be dubbed {\\em non-Hermitian particle bunching}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:02:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Longhi","Stefano",""]]}
{"id":"2308.04496","submitter":"Cody Schimming","authors":"Cody D. Schimming and Jorge Vi\\~nals","title":"A tensor density measure of topological charge in three dimensional\n  nematic phases","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A path independent measure in order parameter space is introduced such that,\nwhen integrated along any closed contour in a three dimensional nematic phase,\nit yields the topological charge of any line defects encircled by the contour.\nA related measure, when integrated over either closed or open surfaces, reduces\nto known results for the charge associated with point defects (hedgehogs) or\nSkyrmions. We further define a tensor density, the disclination density tensor\n$\\mathbf{D}$, from which the location of a disclination line can be determined.\nThis tensor density has a dyadic decomposition near the line into its tangent\nand its rotation vector, allowing a convenient determination of both. The\ntensor $\\mathbf{D}$ may be nonzero in special configurations in which there are\nno defects (double-splay or double-twist configurations), and its behavior\nthere is provided. The special cases of Skyrmions and hedgehog defects are also\nexamined, including the computation of their topological charge from $\n\\mathbf{D}$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:02:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Schimming","Cody D.",""],["Vi\u00f1als","Jorge",""]]}
{"id":"2308.04497","submitter":"Ajay Kaladharan","authors":"Ajay Kaladharan and Shaikh Saad","title":"Fermion mass, Axion dark matter, and Leptogenesis in SO(10) GUT","comments":"14 pages+references, 1 figure, 1 table: Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  SO(10) grand unified theory with minimum parameters in the Yukawa sector\nemploys the Peccei-Quinn symmetry that solves the strong CP problem. Such an\neconomical Yukawa sector is highly appealing and has been extensively studied\nin the literature. However, when the running of the renormalization group\nequations of the Yukawa couplings are considered, this scenario shows somewhat\ntension with the observed fermion masses and mixing. In this work, we propose\nan extension of the minimal framework that alleviates this tension by\nintroducing only a few new parameters. The proposed model consists of a fermion\nin the fundamental and a scalar in the spinorial representations. While the\nlatter is needed to implement the Peccei-Quinn symmetry successfully, the\npresence of both is essential in obtaining an excellent fit to the fermion mass\nspectrum. In our model, axions serve the role of dark matter, and the\nout-of-equilibrium decays of the right-handed neutrinos successfully generate\nthe matter-antimatter symmetry of the Universe.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:02:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kaladharan","Ajay",""],["Saad","Shaikh",""]]}
{"id":"2308.04498","submitter":"Hao Fei","authors":"Yiyun Xiong, Mengwei Dai, Fei Li, Hao Fei, Bobo Li, Shengqiong Wu,\n  Donghong Ji, Chong Teng","title":"DialogRE^C+: An Extension of DialogRE to Investigate How Much\n  Coreference Helps Relation Extraction in Dialogs","comments":"Accepted by NLPCC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dialogue relation extraction (DRE) that identifies the relations between\nargument pairs in dialogue text, suffers much from the frequent occurrence of\npersonal pronouns, or entity and speaker coreference. This work introduces a\nnew benchmark dataset DialogRE^C+, introducing coreference resolution into the\nDRE scenario. With the aid of high-quality coreference knowledge, the reasoning\nof argument relations is expected to be enhanced. In DialogRE^C+ dataset, we\nmanually annotate total 5,068 coreference chains over 36,369 argument mentions\nbased on the existing DialogRE data, where four different coreference chain\ntypes namely speaker chain, person chain, location chain and organization chain\nare explicitly marked. We further develop 4 coreference-enhanced graph-based\nDRE models, which learn effective coreference representations for improving the\nDRE task. We also train a coreference resolution model based on our annotations\nand evaluate the effect of automatically extracted coreference chains\ndemonstrating the practicality of our dataset and its potential to other\ndomains and tasks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:03:29 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 06:12:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xiong","Yiyun",""],["Dai","Mengwei",""],["Li","Fei",""],["Fei","Hao",""],["Li","Bobo",""],["Wu","Shengqiong",""],["Ji","Donghong",""],["Teng","Chong",""]]}
{"id":"2308.04499","submitter":"Steven J. van Enk","authors":"S.J. van Enk","title":"Quantum Partial Information Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Partial Information Decomposition (PID) takes one step beyond Shannon's\ntheory in decomposing the information two variables $A,B$ possess about a third\nvariable $T$ into distinct parts: unique, shared (or redundant) and synergistic\ninformation. Here we show how these concepts can be defined in a quantum\nsetting. We apply a quantum PID to scrambling in quantum many-body systems, for\nwhich a quantum-theoretic description has been proven productive. Unique\ninformation in particular provides a finer description of scrambling than does\nthe so-called tri-information.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:06:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["van Enk","S. J.",""]]}
{"id":"2308.04502","submitter":"Hao Fei","authors":"Bobo Li, Hao Fei, Lizi Liao, Yu Zhao, Chong Teng, Tat-Seng Chua,\n  Donghong Ji, Fei Li","title":"Revisiting Disentanglement and Fusion on Modality and Context in\n  Conversational Multimodal Emotion Recognition","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  It has been a hot research topic to enable machines to understand human\nemotions in multimodal contexts under dialogue scenarios, which is tasked with\nmultimodal emotion analysis in conversation (MM-ERC). MM-ERC has received\nconsistent attention in recent years, where a diverse range of methods has been\nproposed for securing better task performance. Most existing works treat MM-ERC\nas a standard multimodal classification problem and perform multimodal feature\ndisentanglement and fusion for maximizing feature utility. Yet after revisiting\nthe characteristic of MM-ERC, we argue that both the feature multimodality and\nconversational contextualization should be properly modeled simultaneously\nduring the feature disentanglement and fusion steps. In this work, we target\nfurther pushing the task performance by taking full consideration of the above\ninsights. On the one hand, during feature disentanglement, based on the\ncontrastive learning technique, we devise a Dual-level Disentanglement\nMechanism (DDM) to decouple the features into both the modality space and\nutterance space. On the other hand, during the feature fusion stage, we propose\na Contribution-aware Fusion Mechanism (CFM) and a Context Refusion Mechanism\n(CRM) for multimodal and context integration, respectively. They together\nschedule the proper integrations of multimodal and context features.\nSpecifically, CFM explicitly manages the multimodal feature contributions\ndynamically, while CRM flexibly coordinates the introduction of dialogue\ncontexts. On two public MM-ERC datasets, our system achieves new\nstate-of-the-art performance consistently. Further analyses demonstrate that\nall our proposed mechanisms greatly facilitate the MM-ERC task by making full\nuse of the multimodal and context features adaptively. Note that our proposed\nmethods have the great potential to facilitate a broader range of other\nconversational multimodal tasks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:11:27 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 06:05:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Bobo",""],["Fei","Hao",""],["Liao","Lizi",""],["Zhao","Yu",""],["Teng","Chong",""],["Chua","Tat-Seng",""],["Ji","Donghong",""],["Li","Fei",""]]}
{"id":"2308.04503","submitter":"Santanu Das","authors":"Santanu Das","title":"Aspects of Machian Gravity (I): A Mathematical Formulation for Mach's\n  Principle","comments":"33 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Einstein formulated the general theory of relativity (GR) with an aim to\nmathematically incorporate Mach's principle. Despite early hopes, it became\nevident that GR did not follow Mach's proposition. Nevertheless, due to its\naccurate explanation of various observational results, Einstein refrained from\nfurther attempts to formulate Mach's principle. Over time, multiple researchers\nattempted to develop gravity theories aligned with the Machian model of\ninertia. However, each of these theories possessed its own strengths and\nweaknesses. This paper presents a novel theory of gravity that fully embraces\nMach's principle. This metric-based theory, termed as Machian Gravity (MG), can\nbe derived from the action principle, ensuring compliance with all conservation\nlaws. The theory demonstrates its efficacy by providing precise explanations\nfor galactic rotation curves. Moreover, it effectively resolves the discrepancy\nbetween dynamic mass and photometric mass in galaxy clusters without resorting\nto dark matter. It also presents a resolution for the expansion history of the\nuniverse without requiring any dark matter and dark energy. Consequently, MG\npresents a viable and compelling alternative to the standard gravity theory.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:11:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Das","Santanu",""]]}
{"id":"2308.04504","submitter":"Donovan Buterakos","authors":"Donovan Buterakos and Sankar Das Sarma","title":"Magnetic Phases of Bilayer Quantum-Dot Hubbard Model Plaquettes","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":"  It has been demonstrated that small plaquettes of quantum dot spin qubits are\ncapable of simulating condensed matter phenomena which arise from the Hubbard\nmodel, such as the collective Coulomb blockade and Nagaoka ferromagnetism.\nMotivated by recent materials developments, we investigate a bilayer\narrangement of quantum dots with four dots in each layer which exhibits a\ncomplex ground state behavior. We find using a generalized Hubbard model with\nlong-range Coulomb interactions, several distinct magnetic phases occur as the\nCoulomb interaction strength is varied, with possible ground states that are\nferromagnetic, antiferromagnetic, or having both one antiferromagnetic and one\nferromagnetic layer. We map out the full phase diagram of the system as it\ndepends on the inter- and intra-layer Coulomb interaction strengths, and find\nthat for a single layer, a similar but simpler effect occurs. We also predict\ninteresting contrasts among electron, hole, and electron-hole bilayer systems\narising from complex correlation physics. Observing the predicted magnetic\nconfiguration in already-existing few-dot semiconductor bilayer structures\ncould prove to be an important assessment of current experimental quantum dot\ndevices, particularly in the context of spin-qubit-based analog quantum\nsimulations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:11:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Buterakos","Donovan",""],["Sarma","Sankar Das",""]]}
{"id":"2308.04505","submitter":"Stefano Longhi","authors":"Stefano Longhi","title":"Spectral structure and doublon dissociation in the two-particle\n  non-Hermitian Hubbard model","comments":"13 pages, 6 figures, to appear in Annalen der Physik (Wiley)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Strongly-correlated systems in non-Hermitian models are an emergent area of\nresearch. Here we consider a non-Hermitian Hubbard model, where the\nsingle-particle hopping amplitudes on the lattice are not reciprocal, and\nprovide exact analytical results of the spectral structure in the two-particle\nsector of Hilbert space under different boundary conditions. The analysis\nunveils some interesting spectral and dynamical effects of purely non-Hermitian\nnature and that deviate from the usual scenario found in the single-particle\nregime. Specifically, we predict a spectral phase transition of the\nMott-Hubbard band on the infinite lattice as the interaction energy is\nincreased above a critical value, from an open to a closed loop in complex\nenergy plane, and the dynamical dissociation of doublons, i.e. instability of\ntwo-particle bound states, in the bulk of the lattice, with a sudden revival of\nthe doublon state when the two particles reach the lattice edge. Particle\ndissociation observed in the bulk of the lattice is a clear manifestation of\nnon-Hermitian dynamics arising from the different lifetimes of single-particle\nand two-particle states, whereas the sudden revival of the doublon state at the\nboundaries is a striking burst edge dynamical effect peculiar to non-Hermitian\nsystems with boundary-dependent energy spectra, here predicted for the first\ntime for correlated particles.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:12:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Longhi","Stefano",""]]}
{"id":"2308.04507","submitter":"Canan Nurhan Karahan","authors":"Nilay Bostan, Canan Karahan, Ozan Sarg{\\i}n","title":"Inflation in Symmergent Metric-Palatini Gravity","comments":"14 pages, 5 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":"  In this paper, we study the cosmological inflation phenomenon in symmergent\ngravity theory. Symmergent gravity is a novel framework which merges gravity\nand the standard model (SM) so that the gravity emerges from the matter loops\nand restores the broken gauge symmetries along the way. Symmergent gravity is\ncapable of inducing the gravitational constant $G$ and the quadratic curvature\ncoefficient $c_O$ from the loop corrections of the matter sector in a flat\nspace-time. In the event that all the matter fields, including the beyond the\nstandard model (BSM) sector, are mass degenerate, the vacuum energy can be\nexpressed in terms of $G$ and $c_O$. The parameter which measures the deviation\nfrom the mass degeneracy is dubbed $\\hat{\\alpha}$. The parameters, $c_O$ and\n$\\hat{\\alpha}$, of symmergent gravity convey the information about the fermion\nand boson balance in the matter (SM+BSM) sector in number and in mass,\nrespectively. In our analysis, we have investigated the space of the symmergent\nparameters $c_O$ and $\\hat{\\alpha}$ wherein they produce results that comply\nwith the inflationary observables $n_s$, $r$, and $\\mathrm{d}n_s/\\mathrm{d}\\ln\nk$.\n  We have shown that the vacuum energy together with the quadratic curvature\nterm arising in the symmergent gravity prescription are capable of inflating\nthe universe provided that the quadratic curvature coefficient $c_O$ is\nnegative (which corresponds to fermion dominance in number in the matter\nsector) and the deviation from the mass degeneracy in the matter sector is\nminute for both boson mass dominance and fermion mass dominance cases.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:15:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bostan","Nilay",""],["Karahan","Canan",""],["Sarg\u0131n","Ozan",""]]}
{"id":"2308.04508","submitter":"Alexander Zyuzin","authors":"Alexander A. Zyuzin and A. Yu. Zyuzin","title":"Superconductivity from incoherent Cooper pairs in strong-coupling regime","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a scenario for superconductivity at strong electron-electron\nattractive interaction, in the situation when the increase of interaction\nstrength promotes the nucleation of the local Cooper pairs and forms a state\nwith a spatially phase incoherent Cooper pair order parameter. We show that\nthis state can be characterized by a pseudogap and a scattering rate, which are\ndetermined by the self-energy due to electron scattering on phase fluctuations.\nAt low temperatures, however, long-range correlations between the regions with\ndifferent phases become important and establish global phase coherence hence\nsuperconductivity in the system. We develop a mean-field theory to describe a\nphase transition between the preformed Cooper pair and superconducting states.\nThis scenario of superconductivity applies not only to conductors with\nparabolic bands but also to the flat-band systems in which flat and dispersive\nbands coexist and responsible for the Cooper pair formation as well as their\nphase synchronization.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:15:29 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 08:32:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zyuzin","Alexander A.",""],["Zyuzin","A. Yu.",""]]}
{"id":"2308.04509","submitter":"Mina Nahvi","authors":"Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin","title":"Acyclic graphs with at least $2\\ell+1$ vertices are $\\ell$-recognizable","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $(n-\\ell)$-deck of an $n$-vertex graph is the multiset of subgraphs\nobtained from it by deleting $\\ell$ vertices. A family of $n$-vertex graphs is\n$\\ell$-recognizable if every graph having the same $(n-\\ell)$-deck as a graph\nin the family is also in the family. We prove that the family of $n$-vertex\ngraphs with no cycles is $\\ell$-recognizable when $n\\ge2\\ell+1$ (except for\n$(n,\\ell)=(5,2)$). As a consequence, the family of $n$-vertex trees is\n$\\ell$-recognizable when $n\\ge2\\ell+1$ and $\\ell\\ne2$. It is known that this\nfails when $n=2\\ell$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:17:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kostochka","Alexandr V.",""],["Nahvi","Mina",""],["West","Douglas B.",""],["Zirlin","Dara",""]]}
{"id":"2308.04510","submitter":"Andr\\'es Ahumada G\\'omez","authors":"Andr\\'es Ahumada G\\'omez (1) and Mauricio Che (2) ((1) Facultad de\n  Ciencias, Universidad Nacional Aut\\'onoma de M\\'exico, (2) Department of\n  Mathematical Sciences, Durham University)","title":"Gromov-Hausdorff convergence of metric pairs and metric tuples","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.AT math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the Gromov-Hausdorff convergence of metric pairs and metric tuples\nand prove the equivalence of different natural definitions of this concept. We\nalso prove embedding, completeness and compactness theorems in this setting.\nFinally, we get a relative version of Fukaya's theorem about quotient spaces\nunder Gromov--Hausdorff equivariant convergence and a version of\nGrove-Petersen--Wu's finiteness theorem for stratified spaces.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:17:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["G\u00f3mez","Andr\u00e9s Ahumada",""],["Che","Mauricio",""]]}
{"id":"2308.04511","submitter":"Sahara Ali","authors":"Sahara Ali, Jianwu Wang","title":"MT-IceNet -- A Spatial and Multi-Temporal Deep Learning Model for Arctic\n  Sea Ice Forecasting","comments":"Published at IEEE BDCAT 2022. This version includes minor updates\n  made in the text after original publication","journal-ref":"IEEE Xplore pp. 1-10 (2022)","doi":"10.1109/BDCAT56447.2022.00009","report-no":null,"categories":"physics.ao-ph cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Arctic amplification has altered the climate patterns both regionally and\nglobally, resulting in more frequent and more intense extreme weather events in\nthe past few decades. The essential part of Arctic amplification is the\nunprecedented sea ice loss as demonstrated by satellite observations.\nAccurately forecasting Arctic sea ice from sub-seasonal to seasonal scales has\nbeen a major research question with fundamental challenges at play. In addition\nto physics-based Earth system models, researchers have been applying multiple\nstatistical and machine learning models for sea ice forecasting. Looking at the\npotential of data-driven approaches to study sea ice variations, we propose\nMT-IceNet - a UNet based spatial and multi-temporal (MT) deep learning model\nfor forecasting Arctic sea ice concentration (SIC). The model uses an\nencoder-decoder architecture with skip connections and processes multi-temporal\ninput streams to regenerate spatial maps at future timesteps. Using bi-monthly\nand monthly satellite retrieved sea ice data from NSIDC as well as atmospheric\nand oceanic variables from ERA5 reanalysis product during 1979-2021, we show\nthat our proposed model provides promising predictive performance for per-pixel\nSIC forecasting with up to 60% decrease in prediction error for a lead time of\n6 months as compared to its state-of-the-art counterparts.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:18:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ali","Sahara",""],["Wang","Jianwu",""]]}
{"id":"2308.04512","submitter":"Darij Grinberg","authors":"Darij Grinberg","title":"An introduction to graph theory","comments":"422 pages, 200+ figures. Comments are welcome! The version at\n  https://www.cip.ifi.lmu.de/~grinberg/t/22s/graphs.pdf will be updated more\n  frequently. Some older materials are included as ancillary files, but can\n  also be found at https://www.cip.ifi.lmu.de/~grinberg/t/17s","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This is a graduate-level introduction to graph theory, corresponding to a\nquarter-long course. It covers simple graphs, multigraphs as well as their\ndirected analogues, and more restrictive classes such as tournaments, trees and\narborescences. Among the features discussed are Eulerian circuits, Hamiltonian\ncycles, spanning trees, the matrix-tree and BEST theorems, proper colorings,\nTuran's theorem, bipartite matching and the Menger and Gallai--Milgram\ntheorems. The basics of network flows are introduced in order to prove Hall's\nmarriage theorem.\n  Around a hundred exercises are included (without solutions).\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 23:24:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Grinberg","Darij",""]]}
{"id":"2308.04513","submitter":"Ran Gutin","authors":"Ran Gutin","title":"A conjecture concerning *-algebras that unifies some matrix\n  decompositions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.KT math.RT math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note, we propose a simple-looking but broad conjecture about\nstar-algebras over the field of real numbers. The conjecture enables many\nmatrix decompositions to be represented by star-algebras and star-ideals. This\npaper is written for people with a background in representation theory and\nmodule theory. The motivation for investigating this is the possibility of\nexpressing polymorphic algorithms in numerical and theoretical linear algebra.\nThis is similar to but different from algebraic (semiring based) approaches to\ndynamic programming. We prove certain cases of the conjecture.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:19:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gutin","Ran",""]]}
{"id":"2308.04514","submitter":"Vidya Setlur","authors":"Vidya Setlur, Michael Correll, Arvind Satyanarayan, Melanie Tory","title":"Heuristics for Supporting Cooperative Dashboard Design","comments":"11 pages, 3 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dashboards are no longer mere static displays of metrics; through\nfunctionality such as interaction and storytelling, they have evolved to\nsupport analytic and communicative goals like monitoring and reporting.\nExisting dashboard design guidelines, however, are often unable to account for\nthis expanded scope as they largely focus on best practices for visual design.\nIn contrast, we frame dashboard design as facilitating an analytical\nconversation: a cooperative, interactive experience where a user may interact\nwith, reason about, or freely query the underlying data. By drawing on\nestablished principles of conversational flow and communication, we define the\nconcept of a cooperative dashboard as one that enables a fruitful and\nproductive analytical conversation, and derive a set of 39 dashboard design\nheuristics to support effective analytical conversations. To assess the utility\nof this framing, we asked 52 computer science and engineering graduate students\nto apply our heuristics to critique and design dashboards as part of an\nungraded, opt-in homework assignment. Feedback from participants demonstrates\nthat our heuristics surface new reasons dashboards may fail, and encourage a\nmore fluid, supportive, and responsive style of dashboard design. Our approach\nsuggests several compelling directions for future work, including dashboard\nauthoring tools that better anticipate conversational turn-taking, repair, and\nrefinement and extending cooperative principles to other analytical workflows.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:23:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Setlur","Vidya",""],["Correll","Michael",""],["Satyanarayan","Arvind",""],["Tory","Melanie",""]]}
{"id":"2308.04515","submitter":"Joao Paulo Silva do Monte Lima","authors":"Jo\\~ao Paulo Lima, Diego Thomas, Hideaki Uchiyama, Veronica Teichrieb","title":"Toward unlabeled multi-view 3D pedestrian detection by generalizable AI:\n  techniques and performance analysis","comments":"Accepted to SIBGRAPI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We unveil how generalizable AI can be used to improve multi-view 3D\npedestrian detection in unlabeled target scenes. One way to increase\ngeneralization to new scenes is to automatically label target data, which can\nthen be used for training a detector model. In this context, we investigate two\napproaches for automatically labeling target data: pseudo-labeling using a\nsupervised detector and automatic labeling using an untrained detector (that\ncan be applied out of the box without any training). We adopt a training\nframework for optimizing detector models using automatic labeling procedures.\nThis framework encompasses different training sets/modes and multi-round\nautomatic labeling strategies. We conduct our analyses on the\npublicly-available WILDTRACK and MultiviewX datasets. We show that, by using\nthe automatic labeling approach based on an untrained detector, we can obtain\nsuperior results than directly using the untrained detector or a detector\ntrained with an existing labeled source dataset. It achieved a MODA about 4%\nand 1% better than the best existing unlabeled method when using WILDTRACK and\nMultiviewX as target datasets, respectively.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:24:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lima","Jo\u00e3o Paulo",""],["Thomas","Diego",""],["Uchiyama","Hideaki",""],["Teichrieb","Veronica",""]]}
{"id":"2308.04516","submitter":"Pedro Neto","authors":"Samuel Alves, Mihail Babcinschi, Afonso Silva, Diogo Neto, Diogo\n  Fonseca, Pedro Neto","title":"Integrated Design Fabrication and Control of a Bioinspired Multimaterial\n  Soft Robotic Hand","comments":null,"journal-ref":"Cyborg Bionic Syst. 2023;4:Article 0051","doi":"10.34133/cbsystems.0051","report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machines that mimic humans have inspired scientists for centuries.\nBio-inspired soft robotic hands are a good example of such an endeavor,\nfeaturing intrinsic material compliance and continuous motion to deal with\nuncertainty and adapt to unstructured environments. Recent research led to\nimpactful achievements in functional designs, modeling, fabrication, and\ncontrol of soft robots. Nevertheless, the full realization of life-like\nmovements is still challenging to achieve, often based on trial-and-error\nconsiderations from design to fabrication, consuming time and resources. In\nthis study, a soft robotic hand is proposed, composed of soft actuator cores\nand an exoskeleton, featuring a multi-material design aided by finite element\nanalysis (FEA) to define the hand geometry and promote finger's bendability.\nThe actuators are fabricated using molding and the exoskeleton is 3D-printed in\na single step. An ON-OFF controller keeps the set fingers' inner pressures\nrelated to specific bending angles, even in the presence of leaks. The FEA\nnumerical results were validated by experimental tests, as well as the ability\nof the hand to grasp objects with different shapes, weights and sizes. This\nintegrated solution will make soft robotic hands more available to people, at a\nreduced cost, avoiding the time-consuming design-fabrication trial-and-error\nprocesses.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:25:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Alves","Samuel",""],["Babcinschi","Mihail",""],["Silva","Afonso",""],["Neto","Diogo",""],["Fonseca","Diogo",""],["Neto","Pedro",""]]}
{"id":"2308.04517","submitter":"Samiul Islam","authors":"Samiul Islam, Md. Maksudul Haque, Abu Jobayer Md. Sadat","title":"Capturing Spectral and Long-term Contextual Information for Speech\n  Emotion Recognition Using Deep Learning Techniques","comments":"the research paper is still in progress","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":"  Traditional approaches in speech emotion recognition, such as LSTM, CNN, RNN,\nSVM, and MLP, have limitations such as difficulty capturing long-term\ndependencies in sequential data, capturing the temporal dynamics, and\nstruggling to capture complex patterns and relationships in multimodal data.\nThis research addresses these shortcomings by proposing an ensemble model that\ncombines Graph Convolutional Networks (GCN) for processing textual data and the\nHuBERT transformer for analyzing audio signals. We found that GCNs excel at\ncapturing Long-term contextual dependencies and relationships within textual\ndata by leveraging graph-based representations of text and thus detecting the\ncontextual meaning and semantic relationships between words. On the other hand,\nHuBERT utilizes self-attention mechanisms to capture long-range dependencies,\nenabling the modeling of temporal dynamics present in speech and capturing\nsubtle nuances and variations that contribute to emotion recognition. By\ncombining GCN and HuBERT, our ensemble model can leverage the strengths of both\napproaches. This allows for the simultaneous analysis of multimodal data, and\nthe fusion of these modalities enables the extraction of complementary\ninformation, enhancing the discriminative power of the emotion recognition\nsystem. The results indicate that the combined model can overcome the\nlimitations of traditional methods, leading to enhanced accuracy in recognizing\nemotions from speech.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 06:20:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Islam","Samiul",""],["Haque","Md. Maksudul",""],["Sadat","Abu Jobayer Md.",""]]}
{"id":"2308.04518","submitter":"EPTCS","authors":"Andrew Lewis-Smith (University of Sheffield)","title":"A Kripke Semantics for Hajek's BL","comments":"In Proceedings AMSLO 2023, arXiv:2308.03679","journal-ref":"EPTCS 381, 2023, pp. 20-31","doi":"10.4204/EPTCS.381.4","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide a generalisation of Kripke semantics for Petr Hajek's Basic Logic\nand prove soundness and completeness of the same with respect to our semantics.\nWe find this semantics easily specialises to the linearly-ordered Kripke frames\nfor Godel-Dummett logic, which BL properly contains. Our soundness, deduction\ntheorem and completeness arguments further strengthen this analogy. This paper\nextends the insights of our previous paper, \"A Kripke Semantics for\nIntuitionistic Lukasiewicz logic,\" to the case of Hajeks' BL.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:35:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lewis-Smith","Andrew","","University of Sheffield"]]}
{"id":"2308.04519","submitter":"EPTCS","authors":"Lachlan McPheat (University College London), Daphne Wang (University\n  College London)","title":"DisCoCat for Donkey Sentences","comments":"In Proceedings AMSLO 2023, arXiv:2308.03679","journal-ref":"EPTCS 381, 2023, pp. 32-45","doi":"10.4204/EPTCS.381.5","report-no":null,"categories":"cs.CL cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate how to parse Geach's Donkey sentences in a compositional\ndistributional model of meaning. We build on previous work on the DisCoCat\n(Distributional Compositional Categorical) framework, including extensions that\nmodel discourse, determiners, and relative pronouns. We present a type-logical\nsyntax for parsing donkey sentences, for which we define both relational and\nvector space semantics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:35:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["McPheat","Lachlan","","University College London"],["Wang","Daphne","","University\n  College London"]]}
{"id":"2308.04520","submitter":"EPTCS","authors":"Tikhon Pshenitsyn","title":"Multimodality in the Hypergraph Lambek Calculus","comments":"In Proceedings AMSLO 2023, arXiv:2308.03679","journal-ref":"EPTCS 381, 2023, pp. 46-59","doi":"10.4204/EPTCS.381.6","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The multimodal Lambek calculus is an extension of the Lambek calculus that\nincludes several product operations (some of them being commutative or/and\nassociative), unary modalities, and corresponding residual implications. In\nthis work, we relate this calculus to the hypergraph Lambek calculus HL. The\nlatter is a general pure logic of residuation defined in a sequent form;\nantecedents of its sequents are hypergraphs, and the rules of HL involve\nhypergraph transformation. Our main result is the embedding of the multimodal\nLambek calculus (with at most one associative product) in HL. It justifies that\nHL is a very general Lambek-style logic and also provides a novel syntactic\ninterface for the multimodal Lambek calculus: antecedents of sequents of the\nmultimodal Lambek calculus are represented as tree-like hypergraphs in HL, and\nthey are derived from each other by means of hyperedge replacement. The\nadvantage of this embedding is that commutativity and associativity are\nincorporated in the sequent structure rather than added as separate rules.\nBesides, modalities of the multimodal Lambek calculus are represented in HL\nusing the product and the division of HL, which explicitizes their residual\nnature.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:35:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pshenitsyn","Tikhon",""]]}
{"id":"2308.04521","submitter":"EPTCS","authors":"Daniel Rogozin (University College London)","title":"Semantic Analysis of Subexponential Modalities in Distributive\n  Non-commutative Linear Logic","comments":"In Proceedings AMSLO 2023, arXiv:2308.03679","journal-ref":"EPTCS 381, 2023, pp. 60-70","doi":"10.4204/EPTCS.381.7","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider the full Lambek calculus enriched with\nsubexponential modalities in a distributive setting. We show that the\ndistributive Lambek calculus with subexponentials is complete with respect to\nits Kripke frames via canonical extensions. In this approach, we consider\nsubexponentials as S4-like modalities and each modality is interpreted with a\nreflexive and transitive relation similarly to usual Kripke semantics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:36:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rogozin","Daniel","","University College London"]]}
{"id":"2308.04522","submitter":"Hamza Kheddar","authors":"Hamza Kheddar, Mustapha Hemis, Yassine Himeur, David Meg\\'ias, Abbes\n  Amira","title":"Deep Learning for Diverse Data Types Steganalysis: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.LG cs.MM cs.SD eess.AS eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Steganography and steganalysis are two interrelated aspects of the field of\ninformation security. Steganography seeks to conceal communications, whereas\nsteganalysis is aimed to either find them or even, if possible, recover the\ndata they contain. Steganography and steganalysis have attracted a great deal\nof interest, particularly from law enforcement. Steganography is often used by\ncybercriminals and even terrorists to avoid being captured while in possession\nof incriminating evidence, even encrypted, since cryptography is prohibited or\nrestricted in many countries. Therefore, knowledge of cutting-edge techniques\nto uncover concealed information is crucial in exposing illegal acts. Over the\nlast few years, a number of strong and reliable steganography and steganalysis\ntechniques have been introduced in the literature. This review paper provides a\ncomprehensive overview of deep learning-based steganalysis techniques used to\ndetect hidden information within digital media. The paper covers all types of\ncover in steganalysis, including image, audio, and video, and discusses the\nmost commonly used deep learning techniques. In addition, the paper explores\nthe use of more advanced deep learning techniques, such as deep transfer\nlearning (DTL) and deep reinforcement learning (DRL), to enhance the\nperformance of steganalysis systems. The paper provides a systematic review of\nrecent research in the field, including data sets and evaluation metrics used\nin recent studies. It also presents a detailed analysis of DTL-based\nsteganalysis approaches and their performance on different data sets. The\nreview concludes with a discussion on the current state of deep learning-based\nsteganalysis, challenges, and future research directions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:37:24 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 15:39:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kheddar","Hamza",""],["Hemis","Mustapha",""],["Himeur","Yassine",""],["Meg\u00edas","David",""],["Amira","Abbes",""]]}
{"id":"2308.04523","submitter":"Bibiana Prinoth","authors":"Bibiana Prinoth, H. Jens Hoeijmakers, Stefan Pelletier, Daniel\n  Kitzmann, Brett M. Morris, Andreas Seifahrt, David Kasper, Heidi H. Korhonen,\n  Madeleine Burheim, Jacob L. Bean, Bj\\\"orn Benneke, Nicholas W. Borsato,\n  Madison Brady, Simon L. Grimm, Rafael Luque, Julian St\\\"urmer, and Brian\n  Thorsbro","title":"Time-resolved transmission spectroscopy of the ultra-hot Jupiter\n  WASP-189 b","comments":"38 pages, 34 figures, accepted for publication in A&A on August 4,\n  2023 (Abstract abbreviated)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultra-hot Jupiters are tidally locked with their host stars dividing their\natmospheres into a hot dayside and a colder nightside. As the planet moves\nthrough transit, different regions of the atmosphere rotate into view revealing\ndifferent chemical regimes. High-resolution spectrographs can observe\nasymmetries and velocity shifts, and offer the possibility for time-resolved\nspectroscopy. In this study, we search for other atoms and molecules in the\nplanet`s transmission spectrum and investigate asymmetric signals. We analyse\nand combine eight transits of the ultra-hot Jupiter WASP-189 b taken with the\nHARPS, HARPS-N, ESPRESSO and MAROON-X high-resolution spectrographs. Using the\ncross-correlation technique, we search for neutral and ionised atoms, and\noxides and compare the obtained signals to model predictions. We report\nsignificant detections for H, Na, Mg, Ca, Ca+, Ti, Ti+, TiO, V, Cr, Mn, Fe,\nFe+, Ni, Sr, Sr+, and Ba+. Of these, Sr, Sr+, and Ba+ are detected for the\nfirst time in the transmission spectrum of WASP-189 b. In addition, we robustly\nconfirm the detection of titanium oxide based on observations with HARPS and\nHARPS-N using the follow-up observations performed with MAROON-X and ESPRESSO.\nBy fitting the orbital traces of the detected species by means of time-resolved\nspectroscopy using a Bayesian framework, we infer posterior distributions for\norbital parameters as well as lineshapes. Our results indicate that different\nspecies must originate from different regions of the atmosphere to be able to\nexplain the observed time dependence of the signals. Throughout the course of\nthe transit, most signal strengths are expected to increase due to the larger\natmospheric scale height at the hotter trailing terminator. For some species,\nhowever, the signals are instead observed to weaken due to ionisation for atoms\nand their ions, or the dissociation of molecules on the dayside.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:40:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Prinoth","Bibiana",""],["Hoeijmakers","H. Jens",""],["Pelletier","Stefan",""],["Kitzmann","Daniel",""],["Morris","Brett M.",""],["Seifahrt","Andreas",""],["Kasper","David",""],["Korhonen","Heidi H.",""],["Burheim","Madeleine",""],["Bean","Jacob L.",""],["Benneke","Bj\u00f6rn",""],["Borsato","Nicholas W.",""],["Brady","Madison",""],["Grimm","Simon L.",""],["Luque","Rafael",""],["St\u00fcrmer","Julian",""],["Thorsbro","Brian",""]]}
{"id":"2308.04525","submitter":"Ioannis Karafyllidis G.","authors":"G. D. Varsamis, I. G. Karafyllidis, K. M. Gilkes, U. Arranz, R.\n  Martin-Cuevas, G. Calleja, P. Dimitrakis, P. Kolovos, R. Sandaltzopoulos, H.\n  C. Jessen, J. Wong","title":"Quantum gate algorithm for reference-guided DNA sequence alignment","comments":"19 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Reference-guided DNA sequencing and alignment is an important process in\ncomputational molecular biology. The amount of DNA data grows very fast, and\nmany new genomes are waiting to be sequenced while millions of private genomes\nneed to be re-sequenced. Each human genome has 3.2 B base pairs, and each one\ncould be stored with 2 bits of information, so one human genome would take 6.4\nB bits or about 760 MB of storage (National Institute of General Medical\nSciences). Today most powerful tensor processing units cannot handle the volume\nof DNA data necessitating a major leap in computing power. It is, therefore,\nimportant to investigate the usefulness of quantum computers in genomic data\nanalysis, especially in DNA sequence alignment. Quantum computers are expected\nto be involved in DNA sequencing, initially as parts of classical systems,\nacting as quantum accelerators. The number of available qubits is increasing\nannually, and future quantum computers could conduct DNA sequencing, taking the\nplace of classical computing systems. We present a novel quantum algorithm for\nreference-guided DNA sequence alignment modeled with gate-based quantum\ncomputing. The algorithm is scalable, can be integrated into existing classical\nDNA sequencing systems and is intentionally structured to limit computational\nerrors. The quantum algorithm has been tested using the quantum processing\nunits and simulators provided by IBM Quantum, and its correctness has been\nconfirmed.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:41:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Varsamis","G. D.",""],["Karafyllidis","I. G.",""],["Gilkes","K. M.",""],["Arranz","U.",""],["Martin-Cuevas","R.",""],["Calleja","G.",""],["Dimitrakis","P.",""],["Kolovos","P.",""],["Sandaltzopoulos","R.",""],["Jessen","H. C.",""],["Wong","J.",""]]}
{"id":"2308.04526","submitter":"Jord\\~ao Bragantini","authors":"Jord\\~ao Bragantini, Merlin Lange, Lo\\\"ic Royer","title":"Large-Scale Multi-Hypotheses Cell Tracking Using Ultrametric Contours\n  Maps","comments":"13 pages, 7 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we describe a method for large-scale 3D cell-tracking through a\nsegmentation selection approach. The proposed method is effective at tracking\ncells across large microscopy datasets on two fronts: (i) It can solve problems\ncontaining millions of segmentation instances in terabyte-scale 3D+t datasets;\n(ii) It achieves competitive results with or without deep learning, which\nrequires 3D annotated data, that is scarce in the fluorescence microscopy\nfield. The proposed method computes cell tracks and segments using a hierarchy\nof segmentation hypotheses and selects disjoint segments by maximizing the\noverlap between adjacent frames. We show that this method achieves\nstate-of-the-art results in 3D images from the cell tracking challenge and has\na faster integer linear programming formulation. Moreover, our framework is\nflexible and supports segmentations from off-the-shelf cell segmentation models\nand can combine them into an ensemble that improves tracking. The code is\navailable https://github.com/royerlab/ultrack.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:41:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bragantini","Jord\u00e3o",""],["Lange","Merlin",""],["Royer","Lo\u00efc",""]]}
{"id":"2308.04527","submitter":"Vitaly Moroz","authors":"Riccardo Molle, Vitaly Moroz, Giuseppe Riey","title":"Normalised solutions and limit profiles of the defocusing\n  Gross-Pitaevskii-Poisson equation","comments":"42 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study normalised solutions of the stationary Gross-Pitaevskii-Poisson\n(GPP) equation with a defocusing local nonlinear term, $$-\\Delta u+\\lambda\nu+|u|^2u =(I_\\alpha*|u|^2)u\\quad\\text{in $\\mathbb R^3$},\\qquad\\int_{\\mathbb\nR^3}u^2dx=\\rho^2,$$ where $\\rho>0$ is the prescribed mass of the solutions,\n$\\lambda=\\lambda_\\rho\\in\\mathbb R$ is an a-priori unknown Lagrange multiplier,\nand $I_\\alpha(x)=A_\\alpha|x|^{3-\\alpha}$ is the Riesz potential of order\n$\\alpha\\in(0,3)$. When $\\alpha=2$ this problem appears in the study of\nself-gravitating Bose-Einstein condensates, which were proposed in cosmology\nand astrophysics to describe Cold Dark Matter and Boson Stars.\n  We investigate the existence of normalized solutions to the GPP equation,\npaying special attention to the shape and the asymptotic behaviour of the\nassociated mass-energy relation and $\\lambda_\\rho$ curves and to the limit\nprofiles of solutions at the endpoints of these curves. In particular, we show\nthat after appropriate rescalings, the constructed normalized solutions\nconverge either to a ground state of the Choquard equation, or to a compactly\nsupported radial ground state of the integral Thomas-Fermi equation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:45:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Molle","Riccardo",""],["Moroz","Vitaly",""],["Riey","Giuseppe",""]]}
{"id":"2308.04528","submitter":"Jun-Pu (Yi) Zhang","authors":"Yi Zhang, Chengyi Wu","title":"Unsupervised Camouflaged Object Segmentation as Domain Adaptation","comments":"12 pages, 6 figures, 3 tables; Project Page:\n  https://github.com/Jun-Pu/UCOS-DA ; Accepted to ICCV 2023 Workshop on OOD-CV","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning for unsupervised image segmentation remains challenging due to\nthe absence of human labels. The common idea is to train a segmentation head,\nwith the supervision of pixel-wise pseudo-labels generated based on the\nrepresentation of self-supervised backbones. By doing so, the model performance\ndepends much on the distance between the distributions of target datasets and\nthe pre-training dataset (e.g., ImageNet). In this work, we investigate a new\ntask, namely unsupervised camouflaged object segmentation (UCOS), where the\ntarget objects own a common rarely-seen attribute, i.e., camouflage.\nUnsurprisingly, we find that the state-of-the-art unsupervised models struggle\nin adapting UCOS, due to the domain gap between the properties of generic and\ncamouflaged objects. To this end, we formulate the UCOS as a source-free\nunsupervised domain adaptation task (UCOS-DA), where both source labels and\ntarget labels are absent during the whole model training process. Specifically,\nwe define a source model consisting of self-supervised vision transformers\npre-trained on ImageNet. On the other hand, the target domain includes a simple\nlinear layer (i.e., our target model) and unlabeled camouflaged objects. We\nthen design a pipeline for foreground-background-contrastive self-adversarial\ndomain adaptation, to achieve robust UCOS. As a result, our baseline model\nachieves superior segmentation performance when compared with competing\nunsupervised models on the UCOS benchmark, with the training set which's scale\nis only one tenth of the supervised COS counterpart.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:46:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Yi",""],["Wu","Chengyi",""]]}
{"id":"2308.04529","submitter":"Dorsa Rahmatian","authors":"Dorsa Rahmatian, Monireh Moshavash, Mahdi Eftekhari, and Kamran\n  Hoseinkhani","title":"Generating Modern Persian Carpet Map by Style-transfer","comments":null,"journal-ref":null,"doi":"10.22103/jmmr.2023.20648.13","report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Today, the great performance of Deep Neural Networks(DNN) has been proven in\nvarious fields. One of its most attractive applications is to produce artistic\ndesigns. A carpet that is known as a piece of art is one of the most important\nitems in a house, which has many enthusiasts all over the world. The first\nstage of producing a carpet is to prepare its map, which is a difficult,\ntime-consuming, and expensive task. In this research work, our purpose is to\nuse DNN for generating a Modern Persian Carpet Map. To reach this aim, three\ndifferent DNN style transfer methods are proposed and compared against each\nother. In the proposed methods, the Style-Swap method is utilized to create the\ninitial carpet map, and in the following, to generate more diverse designs,\nmethods Clip-Styler, Gatys, and Style-Swap are used separately. In addition,\nsome methods are examined and introduced for coloring the produced carpet maps.\nThe designed maps are evaluated via the results of filled questionnaires where\nthe outcomes of user evaluations confirm the popularity of generated carpet\nmaps. Eventually, for the first time, intelligent methods are used in producing\ncarpet maps, and it reduces human intervention. The proposed methods can\nsuccessfully produce diverse carpet designs, and at a higher speed than\ntraditional ways.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:47:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rahmatian","Dorsa",""],["Moshavash","Monireh",""],["Eftekhari","Mahdi",""],["Hoseinkhani","Kamran",""]]}
{"id":"2308.04530","submitter":"Marc Wagner","authors":"Marc Wagner","title":"Spectroscopy of heavy exotic mesons using lattice QCD static potentials\n  and the Born-Oppenheimer approximation","comments":"6 pages, 1 figure, talk given at \"MESON2023\", 22-27 June 2023,\n  Krakow, Poland","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  I discuss the investigation of heavy exotic mesons using lattice QCD static\npotentials and the Born-Oppenheimer approximation. I summarize selected recent\nresults for $\\bar{b} \\bar{b} q q$ tetraquarks, for $I = 0$ bottomonium and for\n$I = 1$ bottomonium.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:54:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wagner","Marc",""]]}
{"id":"2308.04531","submitter":"Jason Parker","authors":"Jason Parker","title":"Free algebras of topologically enriched multi-sorted equational theories","comments":"51 pages plus six page Appendix. Revised to include more discussion\n  of enrichment of categories of algebras (expanded Remarks 3.1.4 and 4.1.6;\n  added more details to Section 6; expanded item 6.9; added an extra item to\n  Theorem 6.10; shortened Remark 6.11)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT cs.LO math.GN math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classical multi-sorted equational theories and their free algebras have been\nfundamental in mathematics and computer science. In this paper, we present a\ngeneralization of multi-sorted equational theories from the classical\n($Set$-enriched) context to the context of enrichment in a symmetric monoidal\ncategory $V$ that is topological over $Set$. Prominent examples of such\ncategories include: various categories of topological and measurable spaces;\nthe categories of models of relational Horn theories without equality,\nincluding the categories of preordered sets and (extended) pseudo-metric\nspaces; and the categories of quasispaces (a.k.a. concrete sheaves) on concrete\nsites, which have recently attracted interest in the study of programming\nlanguage semantics.\n  Given such a category $V$, we define a notion of $V$-enriched multi-sorted\nequational theory. We show that every $V$-enriched multi-sorted equational\ntheory $T$ has an underlying classical multi-sorted equational theory $|T|$,\nand that free $T$-algebras may be obtained as suitable liftings of free\n$|T|$-algebras. We establish explicit and concrete descriptions of free\n$T$-algebras, which have a convenient inductive character when $V$ is cartesian\nclosed. We provide several examples of $V$-enriched multi-sorted equational\ntheories, and we also discuss the close connection between these theories and\nthe presentations of $V$-enriched algebraic theories and monads studied in\nrecent papers by the author and Lucyshyn-Wright.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:54:40 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 17:18:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Parker","Jason",""]]}
{"id":"2308.04532","submitter":"Paolo Lipparini Ric.","authors":"Paolo Lipparini","title":"Best values for the distributivity spectrum","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide optimal bounds for $\\alpha (\\beta \\circ \\gamma \\circ \\dots )$ in\n$4$-distributive varieties, as well as some further partial generalizations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:55:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lipparini","Paolo",""]]}
{"id":"2308.04533","submitter":"Qihan Liu","authors":"Zefan Shao, Qihan Liu","title":"Independent characterization of the elastic and the mixing parts of\n  hydrogel osmotic pressure","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":"  Osmotic pressure is the driving force for the swelling of hydrogels. The\nhydrogel osmotic pressure can be decomposed into two parts: the mixing part due\nto polymer-solvent interaction and the elastic part due to polymer chain\nstretching. While the two components are distinguished in existing constitutive\nmodels, they have not been independently characterized in experiments. This\npaper reports a novel method to independently measure these two components\nusing a fully constrained swelling test. The test allows the crosslink density\nto be varied at a fixed polymer content, thus varying the elastic part\nindependently of the mixing part. Our measurement shows that the widely used\nFlory-Rehner model predicts the mixing part accurately for polyacrylamide\nhydrogel of a wide range of swelling ratios but predicts the elastic part with\norders-of-magnitude error.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:56:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shao","Zefan",""],["Liu","Qihan",""]]}
{"id":"2308.04534","submitter":"Stefan Pasch","authors":"Stefan Pasch, Dimitrios Petridis","title":"Ahead of the Text: Leveraging Entity Preposition for Financial Relation\n  Extraction","comments":"Stefan Pasch, Dimitrios Petridis 2023. Ahead of the Text: Leveraging\n  Entity Preposition for Financial Relation Extraction. ACM SIGIR: The 4th\n  Workshop on Knowledge Discovery from Unstructured Data in Financial Services\n  (SIGIR-KDF '23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the context of the ACM KDF-SIGIR 2023 competition, we undertook an entity\nrelation task on a dataset of financial entity relations called REFind. Our\ntop-performing solution involved a multi-step approach. Initially, we inserted\nthe provided entities at their corresponding locations within the text.\nSubsequently, we fine-tuned the transformer-based language model roberta-large\nfor text classification by utilizing a labeled training set to predict the\nentity relations. Lastly, we implemented a post-processing phase to identify\nand handle improbable predictions generated by the model. As a result of our\nmethodology, we achieved the 1st place ranking on the competition's public\nleaderboard.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:56:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pasch","Stefan",""],["Petridis","Dimitrios",""]]}
{"id":"2308.04535","submitter":"Tomoki Arai","authors":"Tomoki Arai, Kenji Iwata, Kensho Hara, Yutaka Satoh","title":"Estimation of Human Condition at Disaster Site Using Aerial Drone Images","comments":"In submission to the ICCV 2023 Artificial Intelligence for\n  Humanitarian Assistance and Disaster Response Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Drones are being used to assess the situation in various disasters. In this\nstudy, we investigate a method to automatically estimate the damage status of\npeople based on their actions in aerial drone images in order to understand\ndisaster sites faster and save labor. We constructed a new dataset of aerial\nimages of human actions in a hypothetical disaster that occurred in an urban\narea, and classified the human damage status using 3D ResNet. The results\nshowed that the status with characteristic human actions could be classified\nwith a recall rate of more than 80%, while other statuses with similar human\nactions could only be classified with a recall rate of about 50%. In addition,\na cloud-based VR presentation application suggested the effectiveness of using\ndrones to understand the disaster site and estimate the human condition.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:57:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Arai","Tomoki",""],["Iwata","Kenji",""],["Hara","Kensho",""],["Satoh","Yutaka",""]]}
{"id":"2308.04536","submitter":"Youjun Zhao","authors":"Yi Zhang, Youjun Zhao, Yuhang Wen, Zixuan Tang, Xinhua Xu, Mengyuan\n  Liu","title":"Facial Prior Based First Order Motion Model for Micro-expression\n  Generation","comments":"ACM Multimedia 2021","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spotting facial micro-expression from videos finds various potential\napplications in fields including clinical diagnosis and interrogation,\nmeanwhile this task is still difficult due to the limited scale of training\ndata. To solve this problem, this paper tries to formulate a new task called\nmicro-expression generation and then presents a strong baseline which combines\nthe first order motion model with facial prior knowledge. Given a target face,\nwe intend to drive the face to generate micro-expression videos according to\nthe motion patterns of source videos. Specifically, our new model involves\nthree modules. First, we extract facial prior features from a region focusing\nmodule. Second, we estimate facial motion using key points and local affine\ntransformations with a motion prediction module. Third, expression generation\nmodule is used to drive the target face to generate videos. We train our model\non public CASME II, SAMM and SMIC datasets and then use the model to generate\nnew micro-expression videos for evaluation. Our model achieves the first place\nin the Facial Micro-Expression Challenge 2021 (MEGC2021), where our superior\nperformance is verified by three experts with Facial Action Coding System\ncertification. Source code is provided in\nhttps://github.com/Necolizer/Facial-Prior-Based-FOMM.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:57:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Yi",""],["Zhao","Youjun",""],["Wen","Yuhang",""],["Tang","Zixuan",""],["Xu","Xinhua",""],["Liu","Mengyuan",""]]}
{"id":"2308.04537","submitter":"Bill Kay","authors":"Jurgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez, Ilya\n  Amburg, Jessalyn Bolkema, Thomas Grubb, Fangfei Lan, Sepideh Maleki, Phil\n  Chodrow, Bill Kay","title":"Community Detection in Hypergraphs via Mutual Information Maximization","comments":"Submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM cs.SI math.CO math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hypergraph community detection problem seeks to identify groups of\nrelated nodes in hypergraph data. We propose an information-theoretic\nhypergraph community detection algorithm which compresses the observed data in\nterms of community labels and community-edge intersections. This algorithm can\nalso be viewed as maximum-likelihood inference in a degree-corrected\nmicrocanonical stochastic blockmodel. We perform the inference/compression step\nvia simulated annealing. Unlike several recent algorithms based on canonical\nmodels, our microcanonical algorithm does not require inference of statistical\nparameters such as node degrees or pairwise group connection rates. Through\nsynthetic experiments, we find that our algorithm succeeds down to\nrecently-conjectured thresholds for sparse random hypergraphs. We also find\ncompetitive performance in cluster recovery tasks on several hypergraph data\nsets.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:08:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kritschgau","Jurgen",""],["Kaiser","Daniel",""],["Rodriguez","Oliver Alvarado",""],["Amburg","Ilya",""],["Bolkema","Jessalyn",""],["Grubb","Thomas",""],["Lan","Fangfei",""],["Maleki","Sepideh",""],["Chodrow","Phil",""],["Kay","Bill",""]]}
{"id":"2308.04538","submitter":"David Saintillan","authors":"David Saintillan","title":"Dispersion of run-and-tumble microswimmers through disordered media","comments":"14 pages, 13 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":"  Understanding the transport properties of microorganisms and self-propelled\nparticles in porous media has important implications for human health as well\nas microbial ecology. In free space, most microswimmers perform diffusive\nrandom walks as a result of the interplay of self-propulsion and orientation\ndecorrelation mechanisms such as run-and-tumble dynamics or rotational\ndiffusion. In an unstructured porous medium, collisions with the microstructure\nresult in a decrease in the effective spatial diffusivity of the particles from\nits free-space value. Here, we analyze this problem for a simple model system\nconsisting of non-interacting point particles performing run-and-tumble\ndynamics through a two-dimensional disordered medium composed of a random\ndistribution of circular obstacles, in the absence of Brownian diffusion or\nhydrodynamic interactions. The particles are assumed to collide with the\nobstacles as hard spheres and subsequently slide on the obstacle surface with\nno frictional resistance while maintaining their orientation, until they either\nescape or tumble. We show that the variations in the long-time diffusivity can\nbe described by a universal dimensionless hindrance function\n$f(\\phi,\\mathrm{Pe})$ of the obstacle area fraction $\\phi$ and P\\'eclet number\n$\\mathrm{Pe}$, or ratio of the swimmer run length to the obstacle size. We\nanalytically derive an asymptotic expression for the hindrance function valid\nfor dilute media ($\\mathrm{Pe}\\,\\phi\\ll 1$), and its extension to denser media\nis obtained using stochastic simulations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:11:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Saintillan","David",""]]}
{"id":"2308.04539","submitter":"Sandeep Madireddy","authors":"Sandeep Madireddy, Angel Yanguas-Gil, Prasanna Balaprakash","title":"Improving Performance in Continual Learning Tasks using Bio-Inspired\n  Architectures","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 ability to learn continuously from an incoming data stream without\ncatastrophic forgetting is critical to designing intelligent systems. Many\napproaches to continual learning rely on stochastic gradient descent and its\nvariants that employ global error updates, and hence need to adopt strategies\nsuch as memory buffers or replay to circumvent its stability, greed, and\nshort-term memory limitations. To address this limitation, we have developed a\nbiologically inspired lightweight neural network architecture that incorporates\nsynaptic plasticity mechanisms and neuromodulation and hence learns through\nlocal error signals to enable online continual learning without stochastic\ngradient descent.\n  Our approach leads to superior online continual learning performance on\nSplit-MNIST, Split-CIFAR-10, and Split-CIFAR-100 datasets compared to other\nmemory-constrained learning approaches and matches that of the state-of-the-art\nmemory-intensive replay-based approaches. We further demonstrate the\neffectiveness of our approach by integrating key design concepts into other\nbackpropagation-based continual learning algorithms, significantly improving\ntheir accuracy. Our results provide compelling evidence for the importance of\nincorporating biological principles into machine learning models and offer\ninsights into how we can leverage them to design more efficient and robust\nsystems for online continual learning.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:12:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Madireddy","Sandeep",""],["Yanguas-Gil","Angel",""],["Balaprakash","Prasanna",""]]}
{"id":"2308.04540","submitter":"Tomasz Downarowicz","authors":"Tomasz Downarowicz and Benjamin Weiss","title":"Lifting generic points","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $(X,T)$ and $(Y,S)$ be two topological dynamical systems, where $(X,T)$\nhas the weak specification property. Let $\\xi$ be an invariant measure on the\nproduct system $(X\\times Y, T\\times S)$ with marginals $\\mu$ on $X$ and $\\nu$\non $Y$, with $\\mu$ ergodic. Let $y\\in Y$ be quasi-generic for $\\nu$. Then there\nexists a point $x\\in X$ generic for $\\mu$ such that the pair $(x,y)$ is\nquasi-generic for $\\xi$. This is a generalization of a similar theorem by T.\\\nKamae, in which $(X,T)$ and $(Y,S)$ are full shifts on finite alphabets.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:16:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Downarowicz","Tomasz",""],["Weiss","Benjamin",""]]}
{"id":"2308.04541","submitter":"Changmin Lee","authors":"Chang-Min Lee, Fariba Islam, Samuel Harper, Mustafa Atabey Buyukkaya,\n  Daniel Higginbottom, Stephanie Simmons, Edo Waks","title":"High-efficiency single photon emission from a silicon T-center in a\n  nanobeam","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Color centers in Si could serve as both efficient quantum emitters and\nquantum memories with long coherence times in an all-silicon platform. Of the\nvarious known color centers, the T center holds particular promise because it\npossesses a spin ground state that has long coherence times. But this color\ncenter exhibits a long excited state lifetime which results in a low photon\nemission rate, requiring methods to extract photon emission with high\nefficiency. We demonstrate high-efficiency single photon emission from a single\nT center using a nanobeam. The nanobeam efficiently radiates light in a mode\nthat is well-matched to a lensed fiber, enabling us to collect over 70% of the\nT center emission directly into a single mode fiber. This efficiency enables us\nto directly demonstrate single photon emission from the zero phonon line, which\nrepresents the coherent emission from the T center. Our results represent an\nimportant step towards silicon-integrated spin-photon interfaces for quantum\ncomputing and quantum networks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:17:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lee","Chang-Min",""],["Islam","Fariba",""],["Harper","Samuel",""],["Buyukkaya","Mustafa Atabey",""],["Higginbottom","Daniel",""],["Simmons","Stephanie",""],["Waks","Edo",""]]}
{"id":"2308.04542","submitter":"{\\DJ}or{\\dj}e Nedeljkovi\\'c","authors":"{\\DJ}or{\\dj}e Nedeljkovi\\'c","title":"YUDO: YOLO for Uniform Directed Object Detection","comments":"The Paper is accepted in 25th Irish Machine Vision and Image\n  Processing Conference (IMVIP23)","journal-ref":null,"doi":"10.5281/zenodo.8209337","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an efficient way of detecting directed objects by\npredicting their center coordinates and direction angle. Since the objects are\nof uniform size, the proposed model works without predicting the object's width\nand height. The dataset used for this problem is presented in Honeybee\nSegmentation and Tracking Datasets project. One of the contributions of this\nwork is an examination of the ability of the standard real-time object\ndetection architecture like YoloV7 to be customized for position and direction\ndetection. A very efficient, tiny version of the architecture is used in this\napproach. Moreover, only one of three detection heads without anchors is\nsufficient for this task. We also introduce the extended Skew Intersection over\nUnion (SkewIoU) calculation for rotated boxes - directed IoU (DirIoU), which\nincludes an absolute angle difference. DirIoU is used both in the matching\nprocedure of target and predicted bounding boxes for mAP calculation, and in\nthe NMS filtering procedure. The code and models are available at\nhttps://github.com/djordjened92/yudo.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:18:20 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nedeljkovi\u0107","\u0110or\u0111e",""]]}
{"id":"2308.04543","submitter":"Fabio Sciarrino","authors":"Alessia Suprano, Danilo Zia, Luca Innocenti, Salvatore Lorenzo,\n  Valeria Cimini, Taira Giordani, Ivan Palmisano, Emanuele Polino, Nicol\\`o\n  Spagnolo, Fabio Sciarrino, G. Massimo Palma, Alessandro Ferraro and Mauro\n  Paternostro","title":"Experimental property-reconstruction in a photonic quantum extreme\n  learning machine","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent developments have led to the possibility of embedding machine learning\ntools into experimental platforms to address key problems, including the\ncharacterization of the properties of quantum states. Leveraging on this, we\nimplement a quantum extreme learning machine in a photonic platform to achieve\nresource-efficient and accurate characterization of the polarization state of a\nphoton. The underlying reservoir dynamics through which such input state\nevolves is implemented using the coined quantum walk of high-dimensional\nphotonic orbital angular momentum, and performing projective measurements over\na fixed basis. We demonstrate how the reconstruction of an unknown polarization\nstate does not need a careful characterization of the measurement apparatus and\nis robust to experimental imperfections, thus representing a promising route\nfor resource-economic state characterisation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:22:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Suprano","Alessia",""],["Zia","Danilo",""],["Innocenti","Luca",""],["Lorenzo","Salvatore",""],["Cimini","Valeria",""],["Giordani","Taira",""],["Palmisano","Ivan",""],["Polino","Emanuele",""],["Spagnolo","Nicol\u00f2",""],["Sciarrino","Fabio",""],["Palma","G. Massimo",""],["Ferraro","Alessandro",""],["Paternostro","Mauro",""]]}
{"id":"2308.04544","submitter":"Yuta Mizuno","authors":"Yuta Mizuno and Tamiki Komatsuzaki","title":"Finding Optimal Pathways in Chemical Reaction Networks Using Ising\n  Machines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Finding optimal pathways in chemical reaction networks is essential for\nelucidating and designing chemical processes, with significant applications\nsuch as synthesis planning and metabolic pathway analysis. Such a chemical\npathway-finding problem can be formulated as a constrained combinatorial\noptimization problem, aiming to find an optimal combination of chemical\nreactions connecting starting materials to target materials in a given network.\nDue to combinatorial explosion, the computation time required to find an\noptimal pathway increases exponentially with the network size. Ising machines,\nincluding quantum and simulated annealing devices, are promising novel\ncomputers dedicated to such hard combinatorial optimization. However, to the\nbest of our knowledge, there has yet to be an attempt to apply Ising machines\nto chemical pathway-finding problems. In this article, we present the first\nIsing/quantum computing application for chemical pathway-finding problems. The\nIsing model, translated from a chemical pathway-finding problem, involves\nseveral types of penalty terms for violating constraints. It is not obvious how\nto set appropriate penalty strengths of different types. To address this\nchallenge, we employ Bayesian optimization for parameter tuning. Furthermore,\nwe introduce a novel technique that enhances tuning performance by grouping\npenalty terms according to the underlying problem structure. The performance\nevaluation and analysis of the proposed algorithm were conducted using a D-Wave\nAdvantage system and simulated annealing. The benchmark results reveal\nchallenges in finding exact optimal pathways. Concurrently, the results\nindicate the feasibility of finding approximate optimal pathways, provided that\na certain degree of relative error in cost value is acceptable.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:22:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mizuno","Yuta",""],["Komatsuzaki","Tamiki",""]]}
{"id":"2308.04545","submitter":"Andrew Toivonen","authors":"Sushant Sharma Chaudhary, Andrew Toivonen, Gaurav Waratkar, Geoffrey\n  Mo, Deep Chatterjee, Sarah Antier, Patrick Brockill, Michael W. Coughlin,\n  Reed Essick, Shaon Ghosh, Soichiro Morisaki, Pratyusava Baral, Amanda Baylor,\n  Naresh Adhikari, Patrick Brady, Gareth Cabourn Davies, Tito Dal Canton, Marco\n  Cavagli\\`a, Jolien Creighton, Sunil Choudahry, Yu-Kuang Chu, Patrick\n  Clearwater, Luke Davis, Thomas Dent, Marco Drago, Becca Ewing, Patrick\n  Godwin, Weichangfeng Guo, Chad Hanna, Rachel Huxford, Ian Harry, Erik\n  Katsavounidis, Manoj Kovalam, Alvin K.Y. Li, Ryan Magee, Ethan Marx, Duncan\n  Meacher, Cody Messick, Xan Morice-Atkinson, Alexander Pace, Roberto De\n  Pietri, Brandon Piotrzkowski, Soumen Roy, Surabhi Sachdev, Leo P. Singer,\n  Divya Singh, Marek Szczepanczyk, Daniel Tang, Max Trevor, Leo Tsukada,\n  Ver\\'onica Villa-Ortega, Linqing Wen, Daniel Wysocki","title":"Low-latency gravitational wave alert products and their performance in\n  anticipation of the fourth LIGO-Virgo-KAGRA observing run","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-messenger searches for binary neutron star (BNS) and neutron star-black\nhole (NSBH) mergers are currently one of the most exciting areas of astronomy.\nThe search for joint electromagnetic and neutrino counterparts to gravitational\nwave (GW)s has resumed with Advanced LIGO (aLIGO)'s, Advanced Virgo (AdVirgo)'s\nand KAGRA's fourth observing run (O4). To support this effort, public\nsemi-automated data products are sent in near real-time and include\nlocalization and source properties to guide complementary observations.\nSubsequent refinements, as and when available, are also relayed as updates. In\npreparation for O4, we have conducted a study using a simulated population of\ncompact binaries and a Mock Data Challenge (MDC) in the form of a real-time\nreplay to optimize and profile the software infrastructure and scientific\ndeliverables. End-to-end performance was tested, including data ingestion,\nrunning online search pipelines, performing annotations, and issuing alerts to\nthe astrophysics community. In this paper, we present an overview of the\nlow-latency infrastructure as well as an overview of the performance of the\ndata products to be released during O4 based on a MDC. We report on expected\nmedian latencies for the preliminary alert of full bandwidth searches (29.5 s)\nand for the creation of early warning triggers (-3.1 s), and show consistency\nand accuracy of released data products using the MDC. This paper provides a\nperformance overview for LVK low-latency alert structure and data products\nusing the MDC in anticipation of O4.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:31:58 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 17:35:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chaudhary","Sushant Sharma",""],["Toivonen","Andrew",""],["Waratkar","Gaurav",""],["Mo","Geoffrey",""],["Chatterjee","Deep",""],["Antier","Sarah",""],["Brockill","Patrick",""],["Coughlin","Michael W.",""],["Essick","Reed",""],["Ghosh","Shaon",""],["Morisaki","Soichiro",""],["Baral","Pratyusava",""],["Baylor","Amanda",""],["Adhikari","Naresh",""],["Brady","Patrick",""],["Davies","Gareth Cabourn",""],["Canton","Tito Dal",""],["Cavagli\u00e0","Marco",""],["Creighton","Jolien",""],["Choudahry","Sunil",""],["Chu","Yu-Kuang",""],["Clearwater","Patrick",""],["Davis","Luke",""],["Dent","Thomas",""],["Drago","Marco",""],["Ewing","Becca",""],["Godwin","Patrick",""],["Guo","Weichangfeng",""],["Hanna","Chad",""],["Huxford","Rachel",""],["Harry","Ian",""],["Katsavounidis","Erik",""],["Kovalam","Manoj",""],["Li","Alvin K. Y.",""],["Magee","Ryan",""],["Marx","Ethan",""],["Meacher","Duncan",""],["Messick","Cody",""],["Morice-Atkinson","Xan",""],["Pace","Alexander",""],["De Pietri","Roberto",""],["Piotrzkowski","Brandon",""],["Roy","Soumen",""],["Sachdev","Surabhi",""],["Singer","Leo P.",""],["Singh","Divya",""],["Szczepanczyk","Marek",""],["Tang","Daniel",""],["Trevor","Max",""],["Tsukada","Leo",""],["Villa-Ortega","Ver\u00f3nica",""],["Wen","Linqing",""],["Wysocki","Daniel",""]]}
{"id":"2308.04546","submitter":"Gabriel Perren Ph.D.","authors":"G. I. Perren, M. S. Pera, H. D. Navone, R. A. V\\'azquez","title":"The Unified Cluster Catalogue: towards a comprehensive and homogeneous\n  database of stellar 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 present the Unified Cluster Catalogue, the largest catalogue of stellar\nclusters with almost 14000 objects listed to date. In this initial version only\nMilky Way open clusters are present, but other objects will be included in the\nfuture. Each cluster is processed with a new probability membership algorithm\ndesigned to incorporate each star's coordinates, parallax, proper motions, and\ntheir uncertainties into the probability assignment process. We employ Gaia DR3\ndata up to a G magnitude of 20, resulting in more than a million probable\nmembers identified. The catalogue is accompanied by a public web site aimed at\nfacilitating the search and data exploration of stellar clusters.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:33:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Perren","G. I.",""],["Pera","M. S.",""],["Navone","H. D.",""],["V\u00e1zquez","R. A.",""]]}
{"id":"2308.04547","submitter":"Andrzej Ptok","authors":"Agnieszka Cichy, Konrad J. Kapcia, Andrzej Ptok","title":"Spin-polarized superconducting phase in semiconducting system with\n  next-nearest-neighbor hopping on the honeycomb lattice","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.quant-gas cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The particles in the honeycomb lattice with on-site $s$-wave pairing exhibit\nmany interesting behaviors, which can be described in the framework of the\nHubbard model. Among others, at the half-filling, some critical value $|U_c|$\nof pairing interaction $U<0$ exists that, for $U<U_c$, the superconducting\nphase becomes unstable. Introduction of the nonzero hopping $t'$ between\nnext-nearest-neighbor sites strongly modifies the physical properties of the\nsystem. Here, we discuss the behavior of the system for $t' \\neq 0$ (at the\nground state), where the hopping between next-nearest neighbors leads to change\nof the order of phase transition between superconducting and normal phases from\ndiscontinuous to continuous one in the external magnetic field $h$. We show\nthat this behavior is strongly dependent on $t'$ and associated with the Dirac\ncones in the non-interacting band structure of the system. For non-zero\nmagnetic field and for some range of $t'$, a spin-polarized superconducting\nphase occurs in the ground state phase diagram (only at the half-filling and\nfor $h\\neq 0$).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:34:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cichy","Agnieszka",""],["Kapcia","Konrad J.",""],["Ptok","Andrzej",""]]}
{"id":"2308.04548","submitter":"Neeldhara Misra","authors":"Neeldhara Misra and Saraswati Girish Nanoti","title":"Spartan Bipartite Graphs are Essentially Elementary","comments":"21 pages, 12 figures. A preliminary version accepted for presentation\n  at MFCS 2023","journal-ref":null,"doi":"10.4230/LIPIcs.MFCS.2023.68","report-no":null,"categories":"cs.DM math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a two-player game on a graph between an attacker and a defender. To\nbegin with, the defender places guards on a subset of vertices. In each move,\nthe attacker attacks an edge. The defender must move at least one guard across\nthe attacked edge to defend the attack. The defender wins if and only if the\ndefender can defend an infinite sequence of attacks. The smallest number of\nguards with which the defender has a winning strategy is called the eternal\nvertex cover number of a graph $G$ and is denoted by $evc(G)$. It is clear that\n$evc(G)$ is at least $mvc(G)$, the size of a minimum vertex cover of $G$. We\nsay that $G$ is Spartan if $evc(G) = mvc(G)$. The characterization of Spartan\ngraphs has been largely open. In the setting of bipartite graphs on $2n$\nvertices where every edge belongs to a perfect matching, an easy strategy is to\nhave $n$ guards that always move along perfect matchings in response to\nattacks. We show that these are essentially the only Spartan bipartite graphs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:37:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Misra","Neeldhara",""],["Nanoti","Saraswati Girish",""]]}
{"id":"2308.04549","submitter":"Shuangrui Ding","authors":"Shuangrui Ding, Peisen Zhao, Xiaopeng Zhang, Rui Qian, Hongkai Xiong,\n  Qi Tian","title":"Prune Spatio-temporal Tokens by Semantic-aware Temporal Accumulation","comments":"ICCV 2023 camera ready","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transformers have become the primary backbone of the computer vision\ncommunity due to their impressive performance. However, the unfriendly\ncomputation cost impedes their potential in the video recognition domain. To\noptimize the speed-accuracy trade-off, we propose Semantic-aware Temporal\nAccumulation score (STA) to prune spatio-temporal tokens integrally. STA score\nconsiders two critical factors: temporal redundancy and semantic importance.\nThe former depicts a specific region based on whether it is a new occurrence or\na seen entity by aggregating token-to-token similarity in consecutive frames\nwhile the latter evaluates each token based on its contribution to the overall\nprediction. As a result, tokens with higher scores of STA carry more temporal\nredundancy as well as lower semantics thus being pruned. Based on the STA\nscore, we are able to progressively prune the tokens without introducing any\nadditional parameters or requiring further re-training. We directly apply the\nSTA module to off-the-shelf ViT and VideoSwin backbones, and the empirical\nresults on Kinetics-400 and Something-Something V2 achieve over 30% computation\nreduction with a negligible ~0.2% accuracy drop. The code is released at\nhttps://github.com/Mark12Ding/STA.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:38:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ding","Shuangrui",""],["Zhao","Peisen",""],["Zhang","Xiaopeng",""],["Qian","Rui",""],["Xiong","Hongkai",""],["Tian","Qi",""]]}
{"id":"2308.04550","submitter":"Modesto Montoya","authors":"Modesto Montoya","title":"Simulation of the 2E Technique on neutron multiplicity measurement as a\n  function of fragment mass in spontaneous fission of 252Cf","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Monte Carlo simulation algorithm to investigate the measurement of the\naverage prompt neutron multiplicity as a function of pre-neutron mass, for\nfragments from the spontaneous fission of 252Cf is presented. The input data\nconsist of experimental measurements of the kinetic energy and mass\ndistributions obtained by Gook et al. and the values calculated using the\nFIFRELIN model by Piau et al. We analyze the output curve obtained by\nsimulation of the 2E technique, which should ideally match the theoretical\ncurve. However, we find that the simulated as experiential curve exhibits a\nmaximum value at A=122, close to mass symmetry, while the pre-neutron curve has\na maximum at A=118. Additionally, we observe that que the simulated as pre\nneutron values are higher than the theoretical values for A<90 and A>162,\nrespectively. We attribute this discrepancy to inaccuracies in the relationship\nbetween provisional mass and the pre-neutron mass used in the 2E technique for\ndata processing in each fission event.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:38:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Montoya","Modesto",""]]}
{"id":"2308.04551","submitter":"Bidur Khanal","authors":"Bidur Khanal, Binod Bhattarai, Bishesh Khanal, Cristian A. Linte","title":"Improving Medical Image Classification in Noisy Labels Using Only\n  Self-supervised Pretraining","comments":"Accepted at MICCAI 2023 DEMI Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Noisy labels hurt deep learning-based supervised image classification\nperformance as the models may overfit the noise and learn corrupted feature\nextractors. For natural image classification training with noisy labeled data,\nmodel initialization with contrastive self-supervised pretrained weights has\nshown to reduce feature corruption and improve classification performance.\nHowever, no works have explored: i) how other self-supervised approaches, such\nas pretext task-based pretraining, impact the learning with noisy label, and\nii) any self-supervised pretraining methods alone for medical images in noisy\nlabel settings. Medical images often feature smaller datasets and subtle inter\nclass variations, requiring human expertise to ensure correct classification.\nThus, it is not clear if the methods improving learning with noisy labels in\nnatural image datasets such as CIFAR would also help with medical images. In\nthis work, we explore contrastive and pretext task-based self-supervised\npretraining to initialize the weights of a deep learning classification model\nfor two medical datasets with self-induced noisy labels -- NCT-CRC-HE-100K\ntissue histological images and COVID-QU-Ex chest X-ray images. Our results show\nthat models initialized with pretrained weights obtained from self-supervised\nlearning can effectively learn better features and improve robustness against\nnoisy labels.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:45:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Khanal","Bidur",""],["Bhattarai","Binod",""],["Khanal","Bishesh",""],["Linte","Cristian A.",""]]}
{"id":"2308.04552","submitter":"Ameya Patil","authors":"Ameya Patil, Zoe Rand, Trevor Branch, Leilani Battle","title":"WhaleVis: Visualizing the History of Commercial Whaling","comments":"5 pages including references, 2 figures. Dashboard served live at\n  https://observablehq.com/@whales/whale-vis-dashboard-expedition-routes. To be\n  published in the October issue of TVCG 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Whales are an important part of the oceanic ecosystem. Although historic\ncommercial whale hunting a.k.a. whaling has severely threatened whale\npopulations, whale researchers are looking at historical whaling data to inform\ncurrent whale status and future conservation efforts. To facilitate this, we\nworked with experts in aquatic and fishery sciences to create WhaleVis -- an\ninteractive dashboard for the commercial whaling dataset maintained by the\nInternational Whaling Commission (IWC). We characterize key analysis tasks\namong whale researchers for this database, most important of which is inferring\nspatial distribution of whale populations over time. In addition to\nfacilitating analysis of whale catches based on the spatio-temporal attributes,\nwe use whaling expedition details to plot the search routes of expeditions. We\npropose a model of the catch data as a graph, where nodes represent catch\nlocations, and edges represent whaling expedition routes. This model\nfacilitates visual estimation of whale search effort and in turn the spatial\ndistribution of whale populations normalized by the search effort -- a well\nknown problem in fisheries research. It further opens up new avenues for graph\nanalysis on the data, including more rigorous computation of spatial\ndistribution of whales normalized by the search effort, and enabling new\ninsight generation. We demonstrate the use of our dashboard through a real life\nuse case.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:48:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Patil","Ameya",""],["Rand","Zoe",""],["Branch","Trevor",""],["Battle","Leilani",""]]}
{"id":"2308.04553","submitter":"Maan Qraitem","authors":"Maan Qraitem, Kate Saenko, Bryan A. Plummer","title":"From Fake to Real (FFR): A two-stage training pipeline for mitigating\n  spurious correlations with synthetic data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual recognition models are prone to learning spurious correlations induced\nby an imbalanced training set where certain groups (\\eg Females) are\nunder-represented in certain classes (\\eg Programmers). Generative models offer\na promising direction in mitigating this bias by generating synthetic data for\nthe minority samples and thus balancing the training set. However, prior work\nthat uses these approaches overlooks that visual recognition models could often\nlearn to differentiate between real and synthetic images and thus fail to\nunlearn the bias in the original dataset. In our work, we propose a novel\ntwo-stage pipeline to mitigate this issue where 1) we pre-train a model on a\nbalanced synthetic dataset and then 2) fine-tune on the real data. Using this\npipeline, we avoid training on both real and synthetic data, thus avoiding the\nbias between real and synthetic data. Moreover, we learn robust features\nagainst the bias in the first step that mitigate the bias in the second step.\nMoreover, our pipeline naturally integrates with bias mitigation methods; they\ncan be simply applied to the fine-tuning step. As our experiments prove, our\npipeline can further improve the performance of bias mitigation methods\nobtaining state-of-the-art performance on three large-scale datasets.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:52:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Qraitem","Maan",""],["Saenko","Kate",""],["Plummer","Bryan A.",""]]}
{"id":"2308.04554","submitter":"Ghansham Rajendrasingh Chandel","authors":"Ghansham Rajendrasingh Chandel, Vishal Sankar Sivasankar, and\n  Siddhartha Das","title":"Evaporation of Active Drops: Dynamics of Punctured Drops and Particle\n  Deposits of Ring Galaxy Patterns","comments":"3 Figs","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Active drops refer to drops with the ability to self-migrate: these drops\ntypically attain this ability by virtue of containing of active particles that\nderive energy from their environment and undergo directed motion inside the\ndrops, thereby creating intricate stress distribution within these drops. Here\nwe describe the evaporation dynamics of a slender active nematic drop. The\nstresses induced by active nematic particles present within the drop enables\nfascinating drop evaporation dynamics, consisting of an initial pinned stage\nand a late runaway stage. Unlike regular drops, during the pinned stage (for\nextensile drops) the drops encounter puncturing at their centers, followed by a\nreceding motion of the newly formed inner contact line with the liquid flux\npushing the (nematic) particles towards the inner and the outer contact lines:\nthe result is the formation of a unique ring-galaxy-like particle deposition\npattern. We identify three non-dimensional parameters, representing the\nactivity, the aspect ratio, and the receding contact angle, which dictate the\noccurrence of puncturing, the overall evaporation time, and the possible\ndeposit patterns for the extensile drops and the contractile drops. Finally, we\nargue that such unique evaporation and particle deposition dynamics can be\nleveraged for altering lifetime of drops for cooling and bio-applications and\ncreating customized thin film deposits with potential 3D printing applications.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:56:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chandel","Ghansham Rajendrasingh",""],["Sivasankar","Vishal Sankar",""],["Das","Siddhartha",""]]}
{"id":"2308.04555","submitter":"Denimara Dias Dos Santos","authors":"Denimara Dias dos Santos, Alberto Rodr\\'iguez-Ardila, Swayamtrupta\n  Panda, Murilo Marinello","title":"First observation of double-peaked O I emission in the near-infrared\n  spectrum of an active galaxy","comments":"8 pages, 3 figures, 1 table, published in ApJ Letters","journal-ref":"The Astrophysical Journal Letters, 953:L3 (6pp), 2023 August 10","doi":"10.3847/2041-8213/ace974","report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Double-peaked profiles associated with the broad-line region (BLR) of active\ngalactic nuclei (AGNs) are regarded as the clearest evidence of the presence of\nan accretion disk. They are most commonly detected by means of optical\nspectroscopy in the Balmer lines and in the Mg II $\\lambda$2798 ultraviolet\nline. Here, we report the first unambiguous detection of a double-peak broad\nemission line associated with the O I $\\lambda$11297 emission line in the\nnear-infrared (NIR) in the local Seyfert 1 galaxy III Zw 002. Additionally, we\ndetect simultaneously in the spectrum the double-peak emission in the\nPa$\\alpha$ line and very likely in the He II $\\lambda$10830. This is the first\ntime that several broad double-peaked NIR emission lines have been detected\nsimultaneously. The double-peaked profiles are fit using a disk-based model,\nwith an additional Gaussian component attributed to nondisk clouds, which\nrepresents the classical BLR. Our results obtained from the fits reveal\nimportant parameters, such as disk inclination and geometry. From the\ndouble-peaked profile fits, we suggest that the BLR in III Zw 002 has a\ndisk-like geometry, as it extends up to the outer edge of the BLR.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:00:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Santos","Denimara Dias dos",""],["Rodr\u00edguez-Ardila","Alberto",""],["Panda","Swayamtrupta",""],["Marinello","Murilo",""]]}
{"id":"2308.04556","submitter":"Yilun Chen","authors":"Yilun Chen, Zhiding Yu, Yukang Chen, Shiyi Lan, Animashree Anandkumar,\n  Jiaya Jia, Jose Alvarez","title":"FocalFormer3D : Focusing on Hard Instance for 3D Object Detection","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  False negatives (FN) in 3D object detection, {\\em e.g.}, missing predictions\nof pedestrians, vehicles, or other obstacles, can lead to potentially dangerous\nsituations in autonomous driving. While being fatal, this issue is understudied\nin many current 3D detection methods. In this work, we propose Hard Instance\nProbing (HIP), a general pipeline that identifies \\textit{FN} in a multi-stage\nmanner and guides the models to focus on excavating difficult instances. For 3D\nobject detection, we instantiate this method as FocalFormer3D, a simple yet\neffective detector that excels at excavating difficult objects and improving\nprediction recall. FocalFormer3D features a multi-stage query generation to\ndiscover hard objects and a box-level transformer decoder to efficiently\ndistinguish objects from massive object candidates. Experimental results on the\nnuScenes and Waymo datasets validate the superior performance of FocalFormer3D.\nThe advantage leads to strong performance on both detection and tracking, in\nboth LiDAR and multi-modal settings. Notably, FocalFormer3D achieves a 70.5 mAP\nand 73.9 NDS on nuScenes detection benchmark, while the nuScenes tracking\nbenchmark shows 72.1 AMOTA, both ranking 1st place on the nuScenes LiDAR\nleaderboard. Our code is available at\n\\url{https://github.com/NVlabs/FocalFormer3D}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:06:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Yilun",""],["Yu","Zhiding",""],["Chen","Yukang",""],["Lan","Shiyi",""],["Anandkumar","Animashree",""],["Jia","Jiaya",""],["Alvarez","Jose",""]]}
{"id":"2308.04557","submitter":"Marija Vucelja","authors":"Saikat Bera, Matthew R. Walker and Marija Vucelja","title":"Effect of dynamics on anomalous thermal relaxations and information\n  exchange","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Mpemba effect, an example of anomalous thermal relaxations, occurs when a\nsystem prepared at a hot temperature overtakes an identical system prepared at\na warm temperature and cools down faster to the environment's temperature. We\nstudy the Mpemba effect in Markov jump processes on linear reaction networks as\na function of the relaxation dynamics. The dynamics are characterized by a load\ndistribution factor introduced to control the transition rates in a manner that\nobeys detailed balance. We provide analytical results and insights on when the\nMpemba effect happens in the unimolecular reactions of three species as a\nfunction of the dynamics. In particular, we derive that the regions of the\nStrong Mpemba effect in cooling and heating are non-overlapping and that there\nis, at most, a single Strong Mpemba temperature. Next, we illustrate our\nresults on a Maxwell demon setup, where we show that one can utilize the strong\nvariant of the Mpemba effect to have shorter cycles of the Maxwell demon\ndevice, leading to increased power output, and stable device operation, without\nsacrificing efficiency.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:06:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bera","Saikat",""],["Walker","Matthew R.",""],["Vucelja","Marija",""]]}
{"id":"2308.04558","submitter":"Linus Kautzsch","authors":"Linus Kautzsch, Alexandru B. Georgescu, Danilo Puggioni, Greggory\n  Kent, Keith M. Taddei, Aiden Reilly, Ram Seshadri, James M. Rondinelli,\n  Stephen D. Wilson","title":"Canted Antiferromagnetism in Polar MnSiN$_2$ with High N\\'eel\n  Temperature","comments":"9 pages, 6 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":"  MnSiN$_2$ is a transition metal nitride with Mn and Si ions displaying an\nordered distribution on the cation sites of a distorted wurtzite-derived\nstructure. The Mn$^{2+}$ ions reside on a 3D diamond-like covalent network with\nstrong superexchange pathways. We simulate its electronic structure and find\nthat the N anions in MnSiN$_2$ act as $\\sigma$- and $\\pi$-donors, which serve\nto enhance the N-mediated superexchange, leading to the high N\\'{e}el ordering\ntemperature of $T_N$ = 443 K. Polycrystalline samples of MnSiN$_2$ were\nprepared to reexamine the magnetic structure and resolve previously reported\ndiscrepancies. An additional magnetic canting transition is observed at\n$T_\\mathrm{cant}$ = 433 K and the precise canted ground state magnetic\nstructure has been resolved using a combination of DFT calculations and powder\nneutron diffraction. The calculations favor a $G$-type antiferromagnetic spin\norder with lowering to $Pc^\\prime$. Irreducible representation analysis of the\nmagnetic Bragg peaks supports the lowering of the magnetic symmetry. The\ncomputed model includes a 10$^\\circ$ rotation of the magnetic spins away from\nthe crystallographic $c$-axis consistent with measured powder neutron\ndiffraction data modeling and a small canting of 0.6$^\\circ$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:07:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kautzsch","Linus",""],["Georgescu","Alexandru B.",""],["Puggioni","Danilo",""],["Kent","Greggory",""],["Taddei","Keith M.",""],["Reilly","Aiden",""],["Seshadri","Ram",""],["Rondinelli","James M.",""],["Wilson","Stephen D.",""]]}
{"id":"2308.04559","submitter":"Ken Shen","authors":"Ken J. Shen, Simon Blouin, and Katelyn Breivik","title":"The Q Branch Cooling Anomaly Can Be Explained by Mergers of White Dwarfs\n  and Subgiant Stars","comments":"Submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gaia's exquisite parallax measurements allowed for the discovery and\ncharacterization of the Q branch in the Hertzsprung-Russell diagram, where\nmassive C/O white dwarfs (WDs) pause their dimming due to energy released\nduring crystallization. Interestingly, the fraction of old stars on the Q\nbranch is significantly higher than in the population of WDs that will become Q\nbranch stars or that were Q branch stars in the past. From this, Cheng et al.\ninferred that ~6% of WDs passing through the Q branch experience a much longer\ncooling delay than that of standard crystallizing WDs. Previous attempts to\nexplain this cooling anomaly have invoked mechanisms involving super-solar\ninitial metallicities. In this paper, we describe a novel scenario in which a\nstandard composition WD merges with a subgiant star. The evolution of the\nresulting merger remnant leads to the creation of a large amount of 26Mg,\nwhich, along with the existing 22Ne, undergoes a distillation process that can\nrelease enough energy to explain the Q branch cooling problem without the need\nfor atypical initial abundances. The anomalously high number of old stars on\nthe Q branch may thus be evidence that mass transfer from subgiants to WDs\nleads to unstable mergers.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:10:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shen","Ken J.",""],["Blouin","Simon",""],["Breivik","Katelyn",""]]}
{"id":"2308.04560","submitter":"Nasrallah Nasrallah","authors":"Nasrallah F. Nasrallah, Karl Schilcher","title":"Nucleon Resonance Masses from QCD Sum Rules","comments":"9 pages, 1 figure. arXiv admin note: text overlap with\n  arXiv:2207.07718","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Abstract We present a calculation of the masses of the established nucleon\nrecurrence N+(1440), N-(1535), N-(1650), N+(1710), N+(1880), N-(1895), N+(2100)\nusing a new method of finite energy QCD sum rules. The method is based on the\nidea of choosing a suitable integration kernel which minimizes the occurring\nintegral over the cut in the complex energy (squared) plane. We obtain\nremarkably stable results in a wide range R, where R is the radius of the\nintegration contour. The sum rule predictions agree with the experimental\nvalues within the expected accuracy showing that QCD describes single nucleon\nresonances\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:10:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nasrallah","Nasrallah F.",""],["Schilcher","Karl",""]]}
{"id":"2308.04561","submitter":"Omar Hagrass","authors":"Omar Hagrass, Bharath K. Sriperumbudur, Bing Li","title":"Spectral Regularized Kernel Goodness-of-Fit Tests","comments":"44 pages. arXiv admin note: text overlap with arXiv:2212.09201","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":"  Maximum mean discrepancy (MMD) has enjoyed a lot of success in many machine\nlearning and statistical applications, including non-parametric hypothesis\ntesting, because of its ability to handle non-Euclidean data. Recently, it has\nbeen demonstrated in Balasubramanian et al.(2021) that the goodness-of-fit test\nbased on MMD is not minimax optimal while a Tikhonov regularized version of it\nis, for an appropriate choice of the regularization parameter. However, the\nresults in Balasubramanian et al. (2021) are obtained under the restrictive\nassumptions of the mean element being zero, and the uniform boundedness\ncondition on the eigenfunctions of the integral operator. Moreover, the test\nproposed in Balasubramanian et al. (2021) is not practical as it is not\ncomputable for many kernels. In this paper, we address these shortcomings and\nextend the results to general spectral regularizers that include Tikhonov\nregularization.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:18:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hagrass","Omar",""],["Sriperumbudur","Bharath K.",""],["Li","Bing",""]]}
{"id":"2308.04562","submitter":"Alireza Nikzamir","authors":"Alireza Nikzamir and Filippo Capolino","title":"Exceptional Point Degeneracy as Desirable Operation Point of Oscillator\n  Array with Discrete Nonlinear Gain and Radiating Elements","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":"  An oscillator array prefers to operate at an exceptional point of degeneracy\n(EPD) occurring in a waveguide periodically loaded with discrete nonlinear gain\nand radiating elements. The system maintains a steady-state degenerate mode of\noscillation at a frequency of 3 GHz, even when the small-signal nonlinear gain\nvalues are nonuniform along the array. Contrarily to the original expectation\nof zero phase shift associated to the designed EPD using small-signal gain,\nafter reaching saturation, the time domain signal in consecutive unit cells\ndisplays a $\\pi$ phase shift. Hence, we demonstrate that the saturated system\noscillates at a distinct EPD, associated to a $\\pi$ phase shift between\nconsecutive cells, than the one at which the system was originally designed\nusing small-signal gain. This new EPD at which the nonlinear system is landing\nis associated to higher power efficiency. Finally, we demonstrate that the\noscillation frequency is independent of the length of the array, contrarily to\nwhat happens ordinary oscillating systems based on one-dimensional cavity\nresonances. These findings may have a high impact on high-power radiating\narrays with distributed active elements.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:21:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nikzamir","Alireza",""],["Capolino","Filippo",""]]}
{"id":"2308.04563","submitter":"Fran\\c{c}ois Greer","authors":"Philip Engel, Fran\\c{c}ois Greer, Abigail Ward","title":"Periods of elliptic surfaces with $p_g=q=1$","comments":"19 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that the period mapping is dominant for elliptic surfaces over an\nelliptic curve with 12 nodal fibers, and that its degree is larger than 1.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:23:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Engel","Philip",""],["Greer","Fran\u00e7ois",""],["Ward","Abigail",""]]}
{"id":"2308.04564","submitter":"Beiran Chen","authors":"Beiran Chen, Marco Ruffini","title":"Resource Cooperation in MEC and SDN based Vehicular Networks","comments":"2023 IEEE 34th Annual International Symposium on Personal, Indoor and\n  Mobile Radio Communications (PIMRC)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Internet of Things (IoT) systems require highly scalable infrastructure to\nadaptively provide services to meet various performance requirements. Combining\nSoftware-Defined Networking (SDN) with Mobile Edge Cloud (MEC) technology\nbrings more flexibility for IoT systems. We present a four-tier task processing\narchitecture for MEC and vehicular networks, which includes processing tasks\nlocally within a vehicle, on neighboring vehicles, on an edge cloud, and on a\nremote cloud. The flexible network connection is controlled by SDN. We propose\na CPU resource allocation algorithm, called Partial Idle Resource Strategy\n(PIRS) with Vehicle to Vehicle (V2V) communications, based on Asymmetric Nash\nBargaining Solution (ANBS) in Game Theory. PIRS encourages vehicles in the same\nlocation to cooperate by sharing part of their spare CPU resources. In our\nsimulations, we adopt four applications running on the vehicles to generate\nworkload. We compare the proposed algorithm with Non-Cooperation Strategy (NCS)\nand All Idle Resource Strategy (AIRS). In NCS, the vehicles execute tasks\ngenerated by the applications in their own On-Board Units (OBU), while in AIRS\nvehicles provide all their CPU resources to help other vehicles offloading\nrequests. Our simulation results show that our PIRS strategy can execute more\ntasks on the V2V layer and lead to fewer number of task (and their length) to\nbe offloaded to the cloud, reaching up to 28% improvement compared to NCS and\nup to 10% improvement compared to AIRS.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:24:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Beiran",""],["Ruffini","Marco",""]]}
{"id":"2308.04565","submitter":"Antonio De Rosa","authors":"Antonio De Rosa, Robin Neumayer","title":"Local Minimizers of the Anisotropic Isoperimetric Problem on Closed\n  Manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Local minimizers for the anisotropic isoperimetric problem in the\nsmall-volume regime on closed Riemannian manifolds are shown to be geodesically\nconvex and small smooth perturbations of tangent Wulff shapes, quantitatively\nin terms of the volume.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:28:27 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 06:02:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["De Rosa","Antonio",""],["Neumayer","Robin",""]]}
{"id":"2308.04566","submitter":"Son Tran","authors":"Son Quoc Tran and Matt Kretchmar","title":"Single-Sentence Reader: A Novel Approach for Addressing Answer Position\n  Bias","comments":"We need to revise our paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Machine Reading Comprehension (MRC) models tend to take advantage of spurious\ncorrelations (also known as dataset bias or annotation artifacts in the\nresearch community). Consequently, these models may perform the MRC task\nwithout fully comprehending the given context and question, which is\nundesirable since it may result in low robustness against distribution shift.\nThis paper delves into the concept of answer-position bias, where a significant\npercentage of training questions have answers located solely in the first\nsentence of the context. We propose a Single-Sentence Reader as a new approach\nfor addressing answer position bias in MRC. We implement this approach using\nsix different models and thoroughly analyze their performance. Remarkably, our\nproposed Single-Sentence Readers achieve results that nearly match those of\nmodels trained on conventional training sets, proving their effectiveness. Our\nstudy also discusses several challenges our Single-Sentence Readers encounter\nand proposes a potential solution.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:29:13 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 19:21:45 GMT"},{"version":"v3","created":"Sat, 19 Aug 2023 02:20:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tran","Son Quoc",""],["Kretchmar","Matt",""]]}
{"id":"2308.04567","submitter":"Taras Goy","authors":"Kunle Adegoke, Robert Frontczak, Taras Goy","title":"Binomial Fibonacci sums from Chebyshev polynomials","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore new types of binomial sums with Fibonacci and Lucas numbers. The\nbinomial coefficients under consideration are $\\frac{n}{n+k}\\binom{n+k}{n-k}$\nand $\\frac{k}{n+k}\\binom{n+k}{n-k}$. The identities are derived by relating the\nunderlying sums to Chebyshev polynomials. Finally, some combinatorial sums are\nstudied and a connection to a recent paper by Chu and Guo from 2022 is derived.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 15:44:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Adegoke","Kunle",""],["Frontczak","Robert",""],["Goy","Taras",""]]}
{"id":"2308.04569","submitter":"Pieter Allaart","authors":"Pieter Allaart, Taylor Jones","title":"Random subsets of Cantor sets generated by trees of coin flips","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a natural way to construct a random subset of a homogeneous\nCantor set $C$ in $[0,1]$ via random labelings of an infinite binary tree. For\na fixed parameter $p\\in(0,1)$, each edge in the tree is independently labeled\n$0$ with probability $p$, or $1$ with probability $1-p$. Each infinite labeled\npath down the tree thus determines a unique point in $C$, and the collective of\nall these points is our random subset. When $p=1/2$, we show that the random\nsubset is almost surely of full Hausdorff dimension in $C$ but of zero\nHausdorff measure. For $p\\neq 1/2$ we prove non-trivial upper and lower bounds\nfor the Hausdorff dimension. We also consider deterministic labelings of the\ntree where, for a fixed integer $m\\geq 2$, every $m$th edge is labeled $1$, and\ncompute the exact Hausdorff dimension of the resulting subset of $C$.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:35:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Allaart","Pieter",""],["Jones","Taylor",""]]}
{"id":"2308.04570","submitter":"Michal Bathory","authors":"Michal Bathory, Miroslav Bul\\'i\\v{c}ek, Josef M\\'alek","title":"Coupling the Navier-Stokes-Fourier equations with the Johnson-Segalman\n  stress-diffusive viscoelastic model: Global-in-time and large-data analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that there exists a~large-data and global-in-time weak solution to\na~system of partial differential equations describing an unsteady flow of an\nincompressible heat-conducting rate-type viscoelastic stress-diffusive fluid\nfilling up a~mechanically and thermally isolated container of any dimension. To\novercome the~principle difficulties connected with ill-posedness of\nthe~diffusive Oldroyd-B model in three dimensions, we assume that the~fluid\nadmits a~strengthened dissipation mechanism, at least for excessive elastic\ndeformations. All the~relevant material coefficients are allowed to depend\ncontinuously on the~temperature, whose evolution is captured by\na~thermodynamically consistent equation. In fact, the~studied model is derived\nfrom scratch using only the~balance equations for linear momentum and energy,\nthe~formulation of the~second law of thermodynamics and the~constitutive\nequation for the~internal energy. The~latter is assumed to be a~linear function\nof temperature, which simplifies the~model. The~concept of our weak solution\nincorporates both the~temperature and entropy inequalities, and also the~local\nbalance of total energy provided that the~pressure function exists.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:35:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bathory","Michal",""],["Bul\u00ed\u010dek","Miroslav",""],["M\u00e1lek","Josef",""]]}
{"id":"2308.04571","submitter":"Leonid Keselman","authors":"Leonid Keselman, Katherine Shih, Martial Hebert, Aaron Steinfeld","title":"Optimizing Algorithms From Pairwise User Preferences","comments":"Accepted at IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Typical black-box optimization approaches in robotics focus on learning from\nmetric scores. However, that is not always possible, as not all developers have\nground truth available. Learning appropriate robot behavior in human-centric\ncontexts often requires querying users, who typically cannot provide precise\nmetric scores. Existing approaches leverage human feedback in an attempt to\nmodel an implicit reward function; however, this reward may be difficult or\nimpossible to effectively capture. In this work, we introduce SortCMA to\noptimize algorithm parameter configurations in high dimensions based on\npairwise user preferences. SortCMA efficiently and robustly leverages user\ninput to find parameter sets without directly modeling a reward. We apply this\nmethod to tuning a commercial depth sensor without ground truth, and to robot\nsocial navigation, which involves highly complex preferences over robot\nbehavior. We show that our method succeeds in optimizing for the user's goals\nand perform a user study to evaluate social navigation results.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:36:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Keselman","Leonid",""],["Shih","Katherine",""],["Hebert","Martial",""],["Steinfeld","Aaron",""]]}
{"id":"2308.04572","submitter":"Guangfu Luo","authors":"Zhibin Yi, Liangyu Li, Cheuk Kai Chan, Yaxin Tang, Zhouguang Lu,\n  Chunyi Zhi, Qing Chen, and Guangfu Luo","title":"Decoding the Mechanisms of Reversibility Loss in Rechargeable Zinc-Air\n  Batteries","comments":null,"journal-ref":null,"doi":"10.1021/acs.nanolett.3c02244","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Attaining high reversibility of electrodes and electrolyte is essential for\nthe longevity of secondary batteries. Rechargeable zinc-air batteries (RZABs),\nhowever, encounter drastic irreversible changes in the zinc anodes and air\ncathodes during cycling. To uncover the mechanisms of reversibility loss in\nRZABs, we investigate the evolution of zinc anode, alkaline electrolyte, and\nair electrode through experiments and first-principles calculations. Morphology\ndiagrams of zinc anodes under versatile operating conditions reveal that the\nnano-sized mossy zinc dominates the later cycling stage. Such anodic change is\ninduced by the increased zincate concentration due to hydrogen evolution, which\nis catalyzed by the mossy structure and results in oxide passivation on\nelectrodes, and eventually leads to low true Coulombic efficiencies and short\nlifespans of batteries. Inspired by these findings, we finally present a novel\novercharge-cycling protocol to compensate the Coulombic efficiency loss caused\nby hydrogen evolution and significantly extend the battery life.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:37:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yi","Zhibin",""],["Li","Liangyu",""],["Chan","Cheuk Kai",""],["Tang","Yaxin",""],["Lu","Zhouguang",""],["Zhi","Chunyi",""],["Chen","Qing",""],["Luo","Guangfu",""]]}
{"id":"2308.04573","submitter":"Alexander Tsirlin","authors":"Vera P. Bader, Clemens Ritter, Elias Papke, Philipp Gegenwart, and\n  Alexander A. Tsirlin","title":"Geometrical frustration and incommensurate magnetic order in\n  Na$_3$RuO$_4$ with two triangular motifs","comments":"8 pages, 8 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":"  Incommensurate magnetic order in the spin-3/2 antiferromagnet Na$_3$RuO$_4$\nis uncovered by neutron diffraction combined with ab initio calculations. The\ncrystal structure of Na$_3$RuO$_4$ contains two triangular motifs on different\nlength scales. The magnetic Ru$^{5+}$ ions form a lozenge (diamond)\nconfiguration, with tetramers composed of two isosceles triangles. These\ntetramers are further arranged in layers, such that an effective triangular\nlattice is formed. The tetramers are nearly antiferromagnetic but frustration\nbetween them leads to an incommensurately modulated magnetic structure\ndescribed by the propagation vector $\\vec{k}=(0.242(1), 0, 0.313(1))$. We show\nthat the long-range Ru-O-O-Ru couplings between the tetramers play a major role\nin Na$_3$RuO$_4$ and suggest an effective description in terms of the spatially\nanisotropic triangular lattice if the tetramers are treated as single sites.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:43:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bader","Vera P.",""],["Ritter","Clemens",""],["Papke","Elias",""],["Gegenwart","Philipp",""],["Tsirlin","Alexander A.",""]]}
{"id":"2308.04574","submitter":"Daniel Gustavo Suarez Forero","authors":"Daniel G. Su\\'arez-Forero, Ruihao Ni, Supratik Sarkar, Mahmoud Jalali\n  Mehrabad, Erik Mechtel, Valery Simonyan, Andrey Grankin, Kenji Watanabe,\n  Takashi Taniguchi, Suji Park, Houk Jang, Mohammad Hafezi and You Zhou","title":"Chiral Optical Nano-Cavity with Atomically Thin Mirrors","comments":"Main text: 8 pages, 4 figures. Supplementary Material: 4 pages, 10\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A fundamental requirement for photonic technologies is the ability to control\nthe confinement and propagation of light. Widely utilized platforms include\ntwo-dimensional (2D) optical microcavities in which electromagnetic waves are\nconfined between either metallic or multi-layer dielectric distributed Bragg\nreflectors. However, the fabrication complexities of thick Bragg reflectors and\nhigh losses in metallic mirrors have motivated the quest for efficient and\ncompact mirrors. Recently, 2D transition metal dichalcogenides hosting tightly\nbound excitons with high optical quality have emerged as promising atomically\nthin mirrors. In this work, we propose and experimentally demonstrate a\nsub-wavelength 2D nano-cavity using two atomically thin mirrors with degenerate\nresonances. Remarkably, we show how the excitonic nature of the mirrors enables\nthe formation of chiral and tunable optical modes upon the application of an\nexternal magnetic field. Moreover, temperature-dependent reflectance\nmeasurements indicate robustness and tunability up to $\\approx\\!100$ K for the\ndevice. Our work establishes a new regime for engineering intrinsically chiral\nsub-wavelength optical cavities and opens avenues for realizing spin-photon\ninterfaces and exploring chiral many-body cavity electrodynamics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:45:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Su\u00e1rez-Forero","Daniel G.",""],["Ni","Ruihao",""],["Sarkar","Supratik",""],["Mehrabad","Mahmoud Jalali",""],["Mechtel","Erik",""],["Simonyan","Valery",""],["Grankin","Andrey",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Park","Suji",""],["Jang","Houk",""],["Hafezi","Mohammad",""],["Zhou","You",""]]}
{"id":"2308.04575","submitter":"Frank Sommer","authors":"Matthias Bentert, Jannik Schestag, and Frank Sommer","title":"On the Complexity of Finding a Sparse Connected Spanning Subgraph in a\n  non-Uniform Failure Model","comments":"Accepted at IPEC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a generalization of the classic Spanning Tree problem that allows\nfor a non-uniform failure model. More precisely, edges are either \\emph{safe}\nor \\emph{unsafe} and we assume that failures only affect unsafe edges. In\nUnweighted Flexible Graph Connectivity we are given an undirected graph $G =\n(V,E)$ in which the edge set $E$ is partitioned into a set $S$ of safe edges\nand a set $U$ of unsafe edges and the task is to find a set $T$ of at most $k$\nedges such that $T - \\{u\\}$ is connected and spans $V$ for any unsafe edge $u\n\\in T$. Unweighted Flexible Graph Connectivity generalizes both Spanning Tree\nand Hamiltonian Cycle. We study Unweighted Flexible Graph Connectivity in terms\nof fixed-parameter tractability (FPT). We show an almost complete dichotomy on\nwhich parameters lead to fixed-parameter tractability and which lead to\nhardness. To this end, we obtain FPT-time algorithms with respect to the vertex\ndeletion distance to cluster graphs and with respect to the treewidth. By\nexploiting the close relationship to Hamiltonian Cycle, we show that FPT-time\nalgorithms for many smaller parameters are unlikely under standard\nparameterized complexity assumptions. Regarding problem-specific parameters, we\nobserve that Unweighted Flexible Graph Connectivity} admits an FPT-time\nalgorithm when parameterized by the number of unsafe edges. Furthermore, we\ninvestigate a below-upper-bound parameter for the number of edges of a\nsolution. We show that this parameter also leads to an FPT-time algorithm.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:50:02 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 06:45:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bentert","Matthias",""],["Schestag","Jannik",""],["Sommer","Frank",""]]}
{"id":"2308.04576","submitter":"Tadahiro Oh","authors":"Tadahiro Oh, Jeremy Quastel, and Philippe Sosoe","title":"Global dynamics for the stochastic KdV equation with white noise as\n  initial data","comments":"40 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 study the stochastic Korteweg-de Vries equation (SKdV) with an additive\nspace-time white noise forcing, posed on the one-dimensional torus. In\nparticular, we construct global-in-time solutions to SKdV with spatial white\nnoise initial data. Due to the lack of an invariant measure, Bourgain's\ninvariant measure argument is not applicable to this problem. In order to\novercome this difficulty, we implement a variant of Bourgain's argument in the\ncontext of an evolution system of measures and construct global-in-time\ndynamics. Moreover, we show that the white noise measure with variance $1+t$ is\nan evolution system of measures for SKdV with the white noise initial data.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:50:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Oh","Tadahiro",""],["Quastel","Jeremy",""],["Sosoe","Philippe",""]]}
{"id":"2308.04577","submitter":"M. Bel\\'en Mari","authors":"M. Bel\\'en Mari, Stavros Akras and Denise R. Gon\\c{c}alves","title":"Low-ionization structures in planetary nebulae -- III. The statistical\n  analysis of physico-chemical parameters and excitation mechanisms","comments":"17 pages, 10 figures","journal-ref":null,"doi":"10.1093/mnras/stad2256","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Nearly 30 years after the first detailed studies of low-ionization structures\n(LISs) in planetary nebulae (PNe), we perform a statistical analysis of their\nphysical, chemical and excitation properties, by collecting published data in\nthe literature. The analysis was made through the contrast between LISs and\nhigh-ionization structures -- rims or shells -- for a large sample of PNe, in\norder to highlight significant differences between these structures. Our\nmotivation was to find robust results based on the largest sample of LISs\ngathered so far. (i) Indeed, LISs have lower electron densities (N$_{e}$[S~II])\nthan the rims/shells. (ii) The nitrogen electron temperatures (T$_{e}$[N~II])\nare similar between the two groups, while a bimodal distribution is observed\nfor the T$_{e}$ based on [O~III] of the rims/shells, although the high- and\nlow-ionization structures have T$_{e}$[O~III] of similar median values. (iii)\nNo significant variations are observed in total abundances of He, N, O, Ne, Ar,\nCl and S between the two groups. (iv) Through the analysis of several\ndiagnostic diagrams, LISs are separated from rims/shells in terms of\nexcitation. From two large grids of photoionization and shock models, we show\nthat there is an important overlap between both mechanisms, particularly when\nlow-ionization line-ratios are concerned. We found a good tracer of\nhigh-velocity shocks, as well as an indicator of high- and low-velocity shocks\nthat depends on temperature-sensitive line ratios. In conclusion, both\nexcitation mechanisms could be present, however shocks cannot be the main\nsource of excitation for most of the LISs of PNe.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:51:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mari","M. Bel\u00e9n",""],["Akras","Stavros",""],["Gon\u00e7alves","Denise R.",""]]}
{"id":"2308.04578","submitter":"Sourya Sengupta","authors":"Zhuchen Shao, Sourya Sengupta, Hua Li and Mark A. Anastasio","title":"Semi-Supervised Semantic Segmentation of Cell Nuclei via Diffusion-based\n  Large-Scale Pre-Training and Collaborative Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automated semantic segmentation of cell nuclei in microscopic images is\ncrucial for disease diagnosis and tissue microenvironment analysis.\nNonetheless, this task presents challenges due to the complexity and\nheterogeneity of cells. While supervised deep learning methods are promising,\nthey necessitate large annotated datasets that are time-consuming and\nerror-prone to acquire. Semi-supervised approaches could provide feasible\nalternatives to this issue. However, the limited annotated data may lead to\nsubpar performance of semi-supervised methods, regardless of the abundance of\nunlabeled data. In this paper, we introduce a novel unsupervised\npre-training-based semi-supervised framework for cell-nuclei segmentation. Our\nframework is comprised of three main components. Firstly, we pretrain a\ndiffusion model on a large-scale unlabeled dataset. The diffusion model's\nexplicit modeling capability facilitates the learning of semantic feature\nrepresentation from the unlabeled data. Secondly, we achieve semantic feature\naggregation using a transformer-based decoder, where the pretrained diffusion\nmodel acts as the feature extractor, enabling us to fully utilize the small\namount of labeled data. Finally, we implement a collaborative learning\nframework between the diffusion-based segmentation model and a supervised\nsegmentation model to further enhance segmentation performance. Experiments\nwere conducted on four publicly available datasets to demonstrate significant\nimprovements compared to competitive semi-supervised segmentation methods and\nsupervised baselines. A series of out-of-distribution tests further confirmed\nthe generality of our framework. Furthermore, thorough ablation experiments and\nvisual analysis confirmed the superiority of our proposed method.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:53:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shao","Zhuchen",""],["Sengupta","Sourya",""],["Li","Hua",""],["Anastasio","Mark A.",""]]}
{"id":"2308.04579","submitter":"Ali Pesaranghader","authors":"Ali Pesaranghader, Touqir Sajed","title":"RECipe: Does a Multi-Modal Recipe Knowledge Graph Fit a Multi-Purpose\n  Recommendation System?","comments":"19 pages, 8 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over the past two decades, recommendation systems (RSs) have used machine\nlearning (ML) solutions to recommend items, e.g., movies, books, and\nrestaurants, to clients of a business or an online platform. Recipe\nrecommendation, however, has not yet received much attention compared to those\napplications. We introduce RECipe as a multi-purpose recipe recommendation\nframework with a multi-modal knowledge graph (MMKG) backbone. The motivation\nbehind RECipe is to go beyond (deep) neural collaborative filtering (NCF) by\nrecommending recipes to users when they query in natural language or by\nproviding an image. RECipe consists of 3 subsystems: (1) behavior-based\nrecommender, (2) review-based recommender, and (3) image-based recommender.\nEach subsystem relies on the embedding representations of entities and\nrelations in the graph. We first obtain (pre-trained) embedding representations\nof textual entities, such as reviews or ingredients, from a fine-tuned model of\nMicrosoft's MPNet. We initialize the weights of the entities with these\nembeddings to train our knowledge graph embedding (KGE) model. For the visual\ncomponent, i.e., recipe images, we develop a KGE-Guided variational autoencoder\n(KG-VAE) to learn the distribution of images and their latent representations.\nOnce KGE and KG-VAE models are fully trained, we use them as a multi-purpose\nrecommendation framework. For benchmarking, we created two knowledge graphs\n(KGs) from public datasets on Kaggle for recipe recommendation. Our experiments\nshow that the KGE models have comparable performance to the neural solutions.\nWe also present pre-trained NLP embeddings to address important applications\nsuch as zero-shot inference for new users (or the cold start problem) and\nconditional recommendation with respect to recipe categories. We eventually\ndemonstrate the application of RECipe in a multi-purpose recommendation\nsetting.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:54:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pesaranghader","Ali",""],["Sajed","Touqir",""]]}
{"id":"2308.04580","submitter":"Carlos Handrey A. Ferraz","authors":"Carlos Handrey Araujo Ferraz","title":"Random packing dynamics of $\\Sigma_{2v}(2\\pi/3)$-triplets","comments":"9 pages, 12 figures. arXiv admin note: text overlap with\n  arXiv:2004.13718","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this letter, we used a combination of DEM and the multi-sphere method to\ninvestigate the random packing dynamics of $\\Sigma_{2v}(2\\pi/3)$-triplets.\nThese triplets consist of three overlapping primary spheres, forming a bent\nstructure with a bond angle of $2\\pi/3$ and belonging to the $C_{2v}$ symmetry\ngroup. The selection of this specific structure was motivated by its similarity\nto molecules such as water, which displays crucial physicochemical properties\nand finds extensive application in various fields. To ensure non-overlapping\nparticles at the beginning of the simulations, the rectangular confinement box\nwas divided into basic cells. Each triplet was then inserted into a basic cell\nwith a random orientation. After that, the system is allowed to settle under\ngravity towards the bottom of the box. An implicit leapfrog algorithm with\nquaternion acceleration was used to numerically integrate the rotational motion\nequations. By assuming a molecular approach, we account for the long-range\ncohesive forces using a Lennard-Jones (LJ)-like potential. The packing\nprocesses are studied assuming different long-range interaction strengths. We\nperformed statistical calculations of the different quantities studied\nincluding packing density, radial distribution function, and orientation pair\ncorrelation function. In addition, the force probability distributions in the\nrandom packing structures have been analyzed.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:55:20 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ferraz","Carlos Handrey Araujo",""]]}
{"id":"2308.04581","submitter":"David Cameron","authors":"David Cameron, Emily Collins, Stevienna de Saille, James Law","title":"The Social Triad model of Human-Robot Interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the increasing interest in trust in human-robot interaction (HRI),\nthere is still relatively little exploration of trust as a social construct in\nHRI. We propose that integration of useful models of human-human trust from\npsychology, highlight a potentially overlooked aspect of trust in HRI: a\nrobot's apparent trustworthiness may indirectly relate to the user's\nrelationship with, and opinion of, the individual or organisation deploying the\nrobot. Our Social Triad for HRI model (User, Robot, Deployer), identifies areas\nfor consideration in co-creating trustworthy robotics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:02:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cameron","David",""],["Collins","Emily",""],["de Saille","Stevienna",""],["Law","James",""]]}
{"id":"2308.04582","submitter":"Jesse Osborn","authors":"Manuel Silva, Sarah Mancina, Jesse Osborn (for the IceCube\n  Collaboration)","title":"Measurement of the Cosmic Neutrino Flux from the Southern Sky using 10\n  years of IceCube Starting Track Events","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-1008","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The measurement of a diffuse astrophysical neutrino flux using starting track\nevents marks the first time IceCube has observed and subsequently measured the\nastrophysical diffuse flux using a dataset composed primarily of starting track\nevents. Starting tracks combine an excellent angular and energy resolution.\nThis enables us to take advantage of the self-veto effect in the southern sky\nreducing the atmospheric neutrino rate allowing us to detect astrophysical\nneutrinos to energies well below 100 TeV. We measure the astrophysical flux as\n$\\phi^{per-flavor}_{Astro}=1.68^{+0.19}_{-0.22}$(at 100 TeV) and\n$\\gamma_{Astro} = 2.58^{+0.10}_{-0.09}$ assuming a single power law flux. The\nastrophysical flux 90% sensitive energy range is 3 TeV to 500 TeV, extending\nIceCube's reach to the low energy astrophysical flux by an order of magnitude.\nA brief summary of tests performed to search for neutrinos from the galactic\nplane using this dataset is also provided. With this sample, we did not find\nstatistically significant evidence for emission from the galactic plane. We\nthen tested the impact of these galactic plane neutrinos on the isotropic\ndiffuse flux, with at most 10% effect on the overall normalization and\nnegligible impact to the spectral index.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:07:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Silva","Manuel","","for the IceCube\n  Collaboration"],["Mancina","Sarah","","for the IceCube\n  Collaboration"],["Osborn","Jesse","","for the IceCube\n  Collaboration"]]}
{"id":"2308.04583","submitter":"Yueru Luo","authors":"Yueru Luo, Chaoda Zheng, Xu Yan, Tang Kun, Chao Zheng, Shuguang Cui,\n  Zhen Li","title":"LATR: 3D Lane Detection from Monocular Images with Transformer","comments":"Accepted by ICCV2023 (Oral)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D lane detection from monocular images is a fundamental yet challenging task\nin autonomous driving. Recent advances primarily rely on structural 3D\nsurrogates (e.g., bird's eye view) built from front-view image features and\ncamera parameters. However, the depth ambiguity in monocular images inevitably\ncauses misalignment between the constructed surrogate feature map and the\noriginal image, posing a great challenge for accurate lane detection. To\naddress the above issue, we present a novel LATR model, an end-to-end 3D lane\ndetector that uses 3D-aware front-view features without transformed view\nrepresentation. Specifically, LATR detects 3D lanes via cross-attention based\non query and key-value pairs, constructed using our lane-aware query generator\nand dynamic 3D ground positional embedding. On the one hand, each query is\ngenerated based on 2D lane-aware features and adopts a hybrid embedding to\nenhance lane information. On the other hand, 3D space information is injected\nas positional embedding from an iteratively-updated 3D ground plane. LATR\noutperforms previous state-of-the-art methods on both synthetic Apollo,\nrealistic OpenLane and ONCE-3DLanes by large margins (e.g., 11.4 gain in terms\nof F1 score on OpenLane). Code will be released at\nhttps://github.com/JMoonr/LATR .\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:08:42 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 13:31:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Yueru",""],["Zheng","Chaoda",""],["Yan","Xu",""],["Kun","Tang",""],["Zheng","Chao",""],["Cui","Shuguang",""],["Li","Zhen",""]]}
{"id":"2308.04584","submitter":"Mat\\'ias Menni","authors":"Mat\\'i as Menni","title":"The successive dimension, without elegance","comments":"Accepted for publication in the Proc. of the AMS","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT math.LO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Experience shows that the poset of levels (or dimensions) of the topos of\npresheaves on some elegant Reedy categories may be equipped with a monotone\nincreasing `successor' function which, as the case of simplicial sets shows, is\ndifferent from Lawvere's Aufhebung in general. We prove that a similar result\nholds for the topos of presheaves on a small category with split-epi/mono\nfactorizations; a typical feature of categories that are Reedy elegant, or\nskeletal, or graphic (von Neumann-)regular, but more general. In fact, we show\nthat the more general `successor' may be described as a function on the poset\nof full subcategories of the site that are closed under subobjects.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:10:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Menni","Mat\u00ed as",""]]}
{"id":"2308.04585","submitter":"Liyuan Xu","authors":"Liyuan Xu, Arthur Gretton","title":"Kernel Single Proxy Control for Deterministic Confounding","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 consider the problem of causal effect estimation with an unobserved\nconfounder, where we observe a proxy variable that is associated with the\nconfounder. Although Proxy Causal Learning (PCL) uses two proxy variables to\nrecover the true causal effect, we show that a single proxy variable is\nsufficient for causal estimation if the outcome is generated deterministically,\ngeneralizing Control Outcome Calibration Approach (COCA). We propose two\nkernel-based methods for this setting: the first based on the two-stage\nregression approach, and the second based on a maximum moment restriction\napproach. We prove that both approaches can consistently estimate the causal\neffect, and we empirically demonstrate that we can successfully recover the\ncausal effect on a synthetic dataset.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:11:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xu","Liyuan",""],["Gretton","Arthur",""]]}
{"id":"2308.04586","submitter":"Mark Stefik","authors":"Mark Stefik and Robert Price","title":"Bootstrapping Developmental AIs: From Simple Competences to Intelligent\n  Human-Compatible AIs","comments":"103 pages, 29 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although some AIs surpass human abilities in closed artificial worlds such as\nboard games, in the real world they make strange mistakes and do not notice\nthem. They cannot be instructed easily, fail to use common sense, and lack\ncuriosity. Mainstream approaches for creating AIs include the traditional\nmanually-constructed symbolic AI approach and the generative and deep learning\nAI approaches including large language models (LLMs). Although it is outside of\nthe mainstream, the developmental bootstrapping approach may have more\npotential. In developmental bootstrapping, AIs develop competences like human\nchildren do. They start with innate competences. They interact with the\nenvironment and learn from their interactions. They incrementally extend their\ninnate competences with self-developed competences. They interact and learn\nfrom people and establish perceptual, cognitive, and common grounding. They\nacquire the competences they need through competence bootstrapping. However,\ndevelopmental robotics has not yet produced AIs with robust adult-level\ncompetences. Projects have typically stopped before reaching the Toddler\nBarrier. This corresponds to human infant development at about two years of\nage, before infant speech becomes fluent. They also do not bridge the Reading\nBarrier, where they could skillfully and skeptically draw on the socially\ndeveloped online information resources that power LLMs. The next competences in\nhuman cognitive development involve intrinsic motivation, imitation learning,\nimagination, coordination, and communication. This position paper lays out the\nlogic, prospects, gaps, and challenges for extending the practice of\ndevelopmental bootstrapping to create robust, trustworthy, and human-compatible\nAIs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:14:21 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 15:33:28 GMT"},{"version":"v3","created":"Thu, 17 Aug 2023 16:31:33 GMT"},{"version":"v4","created":"Wed, 23 Aug 2023 18:38:29 GMT"},{"version":"v5","created":"Tue, 29 Aug 2023 21:41:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Stefik","Mark",""],["Price","Robert",""]]}
{"id":"2308.04587","submitter":"Brian Jackson","authors":"Brian Jackson, Elisabeth R. Adams, and Jeffrey P. Morgenthaler","title":"Metrics for Optimizing Searches for Tidally Decaying Exoplanets","comments":"Accepted to AJ; 17 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tidal interactions between short-period exoplanets and their host stars drive\norbital decay and have likely led to engulfment of planets by their stars.\nPrecise transit timing surveys, with baselines now spanning decades for some\nplanets, are directly detecting orbital decay for a handful of planets, with\ncorroboration for planetary engulfment coming from independent lines of\nevidence. More than that, recent observations have perhaps even caught the\nmoment of engulfment for one unfortunate planet. These portentous signs bolster\nprospects for ongoing surveys, but optimizing such a survey requires\nconsidering the astrophysical parameters that give rise to robust timing\nconstraints and large tidal decay rates, as well as how best to schedule\nobservations conducted over many years. The large number of possible targets\nmeans it is not feasible to continually observe all planets that might exhibit\ndetectable tidal decay. In this study, we explore astrophysical and\nobservational properties for a short-period exoplanet system that can maximize\nthe likelihood for observing tidally driven transit-timing variations. We\nconsider several fiducial observational strategies and real exoplanet systems\nreported to exhibit decay. We show that moderately frequent (a few transits per\nyear) observations may suffice to detect tidal decay within just a few years.\nTidally driven timing variations take time to grow to detectable levels, and so\nwe estimate how long that growth takes as a function of timing uncertainties\nand tidal decay rate and provide thresholds for deciding that tidal decay has\nbeen detected.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:15:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jackson","Brian",""],["Adams","Elisabeth R.",""],["Morgenthaler","Jeffrey P.",""]]}
{"id":"2308.04588","submitter":"Harry Li","authors":"Harry Li, Steven Jorgensen, John Holodnak and Allan Wollaber","title":"ScatterUQ: Interactive Uncertainty Visualizations for Multiclass Deep\n  Learning Problems","comments":"5 pages, 4 figures, accepted to IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, uncertainty-aware deep learning methods for multiclass labeling\nproblems have been developed that provide calibrated class prediction\nprobabilities and out-of-distribution (OOD) indicators, letting machine\nlearning (ML) consumers and engineers gauge a model's confidence in its\npredictions. However, this extra neural network prediction information is\nchallenging to scalably convey visually for arbitrary data sources under\nmultiple uncertainty contexts. To address these challenges, we present\nScatterUQ, an interactive system that provides targeted visualizations to allow\nusers to better understand model performance in context-driven uncertainty\nsettings. ScatterUQ leverages recent advances in distance-aware neural\nnetworks, together with dimensionality reduction techniques, to construct\nrobust, 2-D scatter plots explaining why a model predicts a test example to be\n(1) in-distribution and of a particular class, (2) in-distribution but unsure\nof the class, and (3) out-of-distribution. ML consumers and engineers can\nvisually compare the salient features of test samples with training examples\nthrough the use of a ``hover callback'' to understand model uncertainty\nperformance and decide follow up courses of action. We demonstrate the\neffectiveness of ScatterUQ to explain model uncertainty for a multiclass image\nclassification on a distance-aware neural network trained on Fashion-MNIST and\ntested on Fashion-MNIST (in distribution) and MNIST digits (out of\ndistribution), as well as a deep learning model for a cyber dataset. We\nquantitatively evaluate dimensionality reduction techniques to optimize our\ncontextually driven UQ visualizations. Our results indicate that the ScatterUQ\nsystem should scale to arbitrary, multiclass datasets. Our code is available at\nhttps://github.com/mit-ll-responsible-ai/equine-webapp\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:17:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Harry",""],["Jorgensen","Steven",""],["Holodnak","John",""],["Wollaber","Allan",""]]}
{"id":"2308.04589","submitter":"Izzeddin Teeti","authors":"Izzeddin Teeti, Rongali Sai Bhargav, Vivek Singh, Andrew Bradley,\n  Biplab Banerjee, Fabio Cuzzolin","title":"Temporal DINO: A Self-supervised Video Strategy to Enhance Action\n  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":"  The emerging field of action prediction plays a vital role in various\ncomputer vision applications such as autonomous driving, activity analysis and\nhuman-computer interaction. Despite significant advancements, accurately\npredicting future actions remains a challenging problem due to high\ndimensionality, complex dynamics and uncertainties inherent in video data.\nTraditional supervised approaches require large amounts of labelled data, which\nis expensive and time-consuming to obtain. This paper introduces a novel\nself-supervised video strategy for enhancing action prediction inspired by DINO\n(self-distillation with no labels). The Temporal-DINO approach employs two\nmodels; a 'student' processing past frames; and a 'teacher' processing both\npast and future frames, enabling a broader temporal context. During training,\nthe teacher guides the student to learn future context by only observing past\nframes. The strategy is evaluated on ROAD dataset for the action prediction\ndownstream task using 3D-ResNet, Transformer, and LSTM architectures. The\nexperimental results showcase significant improvements in prediction\nperformance across these architectures, with our method achieving an average\nenhancement of 9.9% Precision Points (PP), highlighting its effectiveness in\nenhancing the backbones' capabilities of capturing long-term dependencies.\nFurthermore, our approach demonstrates efficiency regarding the pretraining\ndataset size and the number of epochs required. This method overcomes\nlimitations present in other approaches, including considering various backbone\narchitectures, addressing multiple prediction horizons, reducing reliance on\nhand-crafted augmentations, and streamlining the pretraining process into a\nsingle stage. These findings highlight the potential of our approach in diverse\nvideo-based tasks such as activity recognition, motion planning, and scene\nunderstanding.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:18:23 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 11:05:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Teeti","Izzeddin",""],["Bhargav","Rongali Sai",""],["Singh","Vivek",""],["Bradley","Andrew",""],["Banerjee","Biplab",""],["Cuzzolin","Fabio",""]]}
{"id":"2308.04590","submitter":"Alessandro Dondarini","authors":"Mohammad Aghaie, Giovanni Armando, Alessandro Dondarini, Paolo Panci","title":"Bounds on Ultralight Dark Matter from NANOGrav","comments":"8 pages + appendices, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The detection of the stochastic gravitational wave background by NANOGrav\nimposes constraints on the mass of compact cores of ultralight dark matter,\nalso known as \"solitons\", surrounding supermassive black holes found at the\ncenters of large galaxies. The strong dynamical friction between the rotating\nblack holes and the solitons competes with gravitational wave emission,\nresulting in a suppression of the characteristic strain in the nHz frequency\nrange. Our findings rule out solitons arising from the condensation of\nultralight dark matter particles with masses ranging from $1.3\\times 10^{-21}$\neV to $1.4\\times 10^{-20}$ eV.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:18:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Aghaie","Mohammad",""],["Armando","Giovanni",""],["Dondarini","Alessandro",""],["Panci","Paolo",""]]}
{"id":"2308.04591","submitter":"David Goluskin","authors":"Qi Wang, David Goluskin, Detlef Lohse","title":"Lifetimes of metastable windy states in two-dimensional\n  Rayleigh-B\\'enard convection with stress-free 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":"  Two-dimensional horizontally periodic Rayleigh-B\\'enard convection between\nstress-free boundaries displays two distinct types of states, depending on the\ninitial conditions. Roll states are composed of pairs of counter-rotating\nconvection rolls. Windy states are dominated by strong horizontal wind (also\ncalled zonal flow) that is vertically sheared, precludes convection rolls, and\nsuppresses heat transport. Windy states occur only when the Rayleigh number Ra\nis sufficiently above the onset of convection. At intermediate Ra values, windy\nstates can be induced by suitable initial conditions, but they undergo a\ntransition to roll states after finite lifetimes. At larger Ra values, where\nwindy states have been observed for the full duration of simulations, it is\nunknown whether they represent chaotic attractors or only metastable states\nthat would eventually undergo a transition to roll states. We study this\nquestion using direct numerical simulations of a fluid with a Prandtl number of\n10 in a layer whose horizontal period is 8 times its height. At each of seven\nRa values between $9\\times10^6$ and $2.25\\times10^7$ we have carried out 200 or\nmore simulations, all from initial conditions leading to windy convection with\nfinite lifetimes. The lifetime statistics at each Ra indicate a memoryless\nprocess with survival probability decreasing exponentially in time. The mean\nlifetimes grow with Ra approximately as $Ra^4$. This analysis provides no Ra\nvalue at which windy convection becomes stable; it might remain metastable at\nlarger Ra with extremely long lifetimes.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:21:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Qi",""],["Goluskin","David",""],["Lohse","Detlef",""]]}
{"id":"2308.04592","submitter":"Tianlu Wang","authors":"Tianlu Wang, Ping Yu, Xiaoqing Ellen Tan, Sean O'Brien, Ramakanth\n  Pasunuru, Jane Dwivedi-Yu, Olga Golovneva, Luke Zettlemoyer, Maryam\n  Fazel-Zarandi, Asli Celikyilmaz","title":"Shepherd: A Critic for Language Model Generation","comments":"7 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As large language models improve, there is increasing interest in techniques\nthat leverage these models' capabilities to refine their own outputs. In this\nwork, we introduce Shepherd, a language model specifically tuned to critique\nresponses and suggest refinements, extending beyond the capabilities of an\nuntuned model to identify diverse errors and provide suggestions to remedy\nthem. At the core of our approach is a high quality feedback dataset, which we\ncurate from community feedback and human annotations. Even though Shepherd is\nsmall (7B parameters), its critiques are either equivalent or preferred to\nthose from established models including ChatGPT. Using GPT-4 for evaluation,\nShepherd reaches an average win-rate of 53-87% compared to competitive\nalternatives. In human evaluation, Shepherd strictly outperforms other models\nand on average closely ties with ChatGPT.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:23:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Tianlu",""],["Yu","Ping",""],["Tan","Xiaoqing Ellen",""],["O'Brien","Sean",""],["Pasunuru","Ramakanth",""],["Dwivedi-Yu","Jane",""],["Golovneva","Olga",""],["Zettlemoyer","Luke",""],["Fazel-Zarandi","Maryam",""],["Celikyilmaz","Asli",""]]}
{"id":"2308.04593","submitter":"Jacob Goeree","authors":"Nicholas C. Bedard and Jacob K. Goeree","title":"Tropical Analysis: With an Application to Indivisible Goods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish the Subgradient Theorem for monotone correspondences -- a\nmonotone correspondence is equal to the subdifferential of a potential if and\nonly if it is conservative, i.e. its integral along a closed path vanishes\nirrespective of the selection from the correspondence along the path. We prove\ntwo attendant results: the Potential Theorem, whereby a conservative monotone\ncorrespondence can be integrated up to a potential, and the Duality Theorem,\nwhereby the potential has a Fenchel dual whose subdifferential is another\nconservative monotone correspondence. We use these results to reinterpret and\nextend Baldwin and Klemperer's (2019) characterization of demand in economies\nwith indivisible goods. We introduce a simple test for existence of Walrasian\nequilibrium in quasi-linear economies. Fenchel's Duality Theorem implies this\ntest is met when the aggregate utility is concave, which is not necessarily the\ncase with indivisible goods even if all consumers have concave utilities.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:29:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bedard","Nicholas C.",""],["Goeree","Jacob K.",""]]}
{"id":"2308.04594","submitter":"Churna Bhandari","authors":"Churna Bhandari, Durga Paudyal","title":"Giant magnetic and optical anisotropy in cerium-substituted M-type\n  strontium hexaferrite driven by 4$f$ electrons","comments":"10 pages, 6 figures","journal-ref":"Phys. Rev. Applied 20, 024016 (2023)","doi":"10.1103/PhysRevApplied.20.024016","report-no":null,"categories":"cond-mat.mtrl-sci quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By performing density functional calculations, we find a giant\nmagnetocrystalline anisotropy (MCA) constant in abundant element cerium (Ce)\nsubstituted M-type hexaferrite, in the energetically favorable strontium site,\nassisted by a quantum confined electron transfer from Ce to specific iron (2a)\nsite. Remarkably, the calculated electronic structure shows that the electron\ntransfer leads to the formation of Ce$^{3+}$ and Fe$^{2+}$ at the $2a$ site\nproducing an occupied Ce($4f^1$) state below the Fermi level that adds a\nsignificant contribution to MCA and magnetic moment. A half Ce-substitution\nforms a metallic state, while a full substitution retains the semiconducting\nstate of the strontium-hexaferrite (host). In the latter, the band gap is\nreduced due to the formation of charge transferred states in the gap region of\nthe host. The optical absorption coefficient shows an enhanced anisotropy\nbetween light polarization in parallel and perpendicular directions. Calculated\nformation energies, including the analysis of probable competing phases, and\nelastic constants confirm that both compositions are chemically and\nmechanically stable. With successful synthesis, the Ce-hexaferrite can be a new\nhigh-performing critical-element-free permanent magnet material adapted for use\nin devices such as automotive traction drive motors.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:37:30 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 15:45:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhandari","Churna",""],["Paudyal","Durga",""]]}
{"id":"2308.04595","submitter":"Daria Cherniuk","authors":"Daria Cherniuk, Stanislav Abukhovich, Anh-Huy Phan, Ivan Oseledets,\n  Andrzej Cichocki, Julia Gusak","title":"Quantization Aware Factorization for Deep Neural Network Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Tensor decomposition of convolutional and fully-connected layers is an\neffective way to reduce parameters and FLOP in neural networks. Due to memory\nand power consumption limitations of mobile or embedded devices, the\nquantization step is usually necessary when pre-trained models are deployed. A\nconventional post-training quantization approach applied to networks with\ndecomposed weights yields a drop in accuracy. This motivated us to develop an\nalgorithm that finds tensor approximation directly with quantized factors and\nthus benefit from both compression techniques while keeping the prediction\nquality of the model. Namely, we propose to use Alternating Direction Method of\nMultipliers (ADMM) for Canonical Polyadic (CP) decomposition with factors whose\nelements lie on a specified quantization grid. We compress neural network\nweights with a devised algorithm and evaluate it's prediction quality and\nperformance. We compare our approach to state-of-the-art post-training\nquantization methods and demonstrate competitive results and high flexibility\nin achiving a desirable quality-performance tradeoff.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:38:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cherniuk","Daria",""],["Abukhovich","Stanislav",""],["Phan","Anh-Huy",""],["Oseledets","Ivan",""],["Cichocki","Andrzej",""],["Gusak","Julia",""]]}
{"id":"2308.04596","submitter":"Andre Alves Lima","authors":"Ulysses Camara da Silva, Andre Alves Lima, Carlos F.S. Pereira","title":"Renormalization and spectra of the P\\\"oschl-Teller potential","comments":"39 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the energy eigenfunctions and spectrum of the P\\\"oschl-Teller\npotential for every value of its two dimensionless parameters. The potential\nhas a singularity at the origin which, in some regions of parameter space,\nmakes boundary conditions of the eigenfunctions ill-defined. We apply a\nrenormalization procedure to obtain a family of well-defined solutions, and\nstudy the associated renormalization group (RG) flow. Renormalization\nintroduces an anomalous length scale by ``dimensional transmutation''. In the\nregions of coupling space where this scale cannot be set to zero, it\nspontaneously breaks the asymptotic conformal symmetry near the singularity.\nThe symmetry is also explicitly broken by a dimensionful parameter in the\npotential. The existence of these two competing ways of breaking conformal\nsymmetry gives the RG flow an interesting structure. We show that supersymmetry\nof the potential, when present, allows one to prevent spontaneous breaking of\nthe asymptotic conformal symmetry. We use the family of eigenfunctions to\ncompute the S-matrix in all regions of parameter space, for any value of\nanomalous scale. Then we systematically study the poles of the S-matrix to\nclassify all bound, anti-bound and metastable states.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:44:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["da Silva","Ulysses Camara",""],["Lima","Andre Alves",""],["Pereira","Carlos F. S.",""]]}
{"id":"2308.04597","submitter":"Alexander Kolbin Ivanovich","authors":"A. I. Kolbin, M. V. Suslikov, V. Yu. Kochkina, N. V. Borisov, A. N.\n  Burenkov, D. V. Oparin","title":"SDSS J085414.02+390537.3 -- a new asynchronous polar","comments":null,"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":"  The asynchrony of the polar SDSS~J085414.02+390537.3 was revealed using the\ndata of ZTF photometric survey. The light curves show a beat period $P_{beat} =\n24.6 \\pm 0.1$~days. During this period the system changes its brightness by\n$\\sim 3^m$. The periodograms show power peaks at the white dwarf's rotation\nperiod $P_{spin} = 113.197 \\pm 0.001$~min and orbital period $P_{orb} = 113.560\n\\pm 0.001$~min with the corresponding polar asynchrony $1-P_{orb}/P_{spin} =\n0.3\\%$. The photometric behavior of the polar indicates a change of the main\naccreting pole during the beat period. Based on the Zeeman splitting of the\nH$\\beta$ line, an estimate of the mean magnetic field strength of the white\ndwarf is found to be $B = 28.5\\pm 1.5$~MG. The magnetic field strength $B\n\\approx 34$~MG near the magnetic pole was found by modeling cyclotron spectra.\nDoppler tomograms in the H$\\beta$ line demonstrate the distribution of emission\nsources typical for polars.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:50:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kolbin","A. I.",""],["Suslikov","M. V.",""],["Kochkina","V. Yu.",""],["Borisov","N. V.",""],["Burenkov","A. N.",""],["Oparin","D. V.",""]]}
{"id":"2308.04598","submitter":"Kaer Huang Carl","authors":"Kaer Huang","title":"1st Place Solution for CVPR2023 BURST Long Tail and Open World\n  Challenges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Currently, Video Instance Segmentation (VIS) aims at segmenting and\ncategorizing objects in videos from a closed set of training categories that\ncontain only a few dozen of categories, lacking the ability to handle diverse\nobjects in real-world videos. As TAO and BURST datasets release, we have the\nopportunity to research VIS in long-tailed and open-world scenarios.\nTraditional VIS methods are evaluated on benchmarks limited to a small number\nof common classes, But practical applications require trackers that go beyond\nthese common classes, detecting and tracking rare and even never-before-seen\nobjects. Inspired by the latest MOT paper for the long tail task (Tracking\nEvery Thing in the Wild, Siyuan Li et), for the BURST long tail challenge, we\ntrain our model on a combination of LVISv0.5 and the COCO dataset using repeat\nfactor sampling. First, train the detector with segmentation and CEM on\nLVISv0.5 + COCO dataset. And then, train the instance appearance similarity\nhead on the TAO dataset. at last, our method (LeTracker) gets 14.9 HOTAall in\nthe BURST test set, ranking 1st in the benchmark. for the open-world\nchallenges, we only use 64 classes (Intersection classes of BURST Train subset\nand COCO dataset, without LVIS dataset) annotations data training, and testing\non BURST test set data and get 61.4 OWTAall, ranking 1st in the benchmark. Our\ncode will be released to facilitate future research.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:52:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Huang","Kaer",""]]}
{"id":"2308.04599","submitter":"Abhranil Chatterjee","authors":"Abhranil Chatterjee, Mrinal Kumar, and Ben Lee Volk","title":"Determinants vs. Algebraic Branching Programs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We show that for every homogeneous polynomial of degree $d$, if it has\ndeterminantal complexity at most $s$, then it can be computed by a homogeneous\nalgebraic branching program (ABP) of size at most $O(d^5s)$. Moreover, we show\nthat for $\\textit{most}$ homogeneous polynomials, the width of the resulting\nhomogeneous ABP is just $s-1$ and the size is at most $O(ds)$.\n  Thus, for constant degree homogeneous polynomials, their determinantal\ncomplexity and ABP complexity are within a constant factor of each other and\nhence, a super-linear lower bound for ABPs for any constant degree polynomial\nimplies a super-linear lower bound on determinantal complexity; this relates\ntwo open problems of great interest in algebraic complexity. As of now,\nsuper-linear lower bounds for ABPs are known only for polynomials of growing\ndegree, and for determinantal complexity the best lower bounds are larger than\nthe number of variables only by a constant factor.\n  While determinantal complexity and ABP complexity are classically known to be\npolynomially equivalent, the standard transformation from the former to the\nlatter incurs a polynomial blow up in size in the process, and thus, it was\nunclear if a super-linear lower bound for ABPs implies a super-linear lower\nbound on determinantal complexity. In particular, a size preserving\ntransformation from determinantal complexity to ABPs does not appear to have\nbeen known prior to this work, even for constant degree polynomials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:56:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chatterjee","Abhranil",""],["Kumar","Mrinal",""],["Volk","Ben Lee",""]]}
{"id":"2308.04600","submitter":"Shimon Komarovsky","authors":"Shimon Komarovsky","title":"Model of models -- Part 1","comments":"arXiv admin note: text overlap with arXiv:2301.13556","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO cs.SC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper proposes a new cognitive model, acting as the main component of an\nAGI agent. The model is introduced in its mature intelligence state, and as an\nextension of previous models, DENN, and especially AKREM, by including\noperational models (frames/classes) and will. This model's core assumption is\nthat cognition is about operating on accumulated knowledge, with the guidance\nof an appropriate will. Also, we assume that the actions, part of knowledge,\nare learning to be aligned with will, during the evolution phase that precedes\nthe mature intelligence state. In addition, this model is mainly based on the\nduality principle in every known intelligent aspect, such as exhibiting both\ntop-down and bottom-up model learning, generalization verse specialization, and\nmore. Furthermore, a holistic approach is advocated for AGI designing, and\ncognition under constraints or efficiency is proposed, in the form of\nreusability and simplicity. Finally, reaching this mature state is described\nvia a cognitive evolution from infancy to adulthood, utilizing a consolidation\nprinciple. The final product of this cognitive model is a dynamic operational\nmemory of models and instances. Lastly, some examples and preliminary ideas for\nthe evolution phase to reach the mature state are presented.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:56:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Komarovsky","Shimon",""]]}
{"id":"2308.04601","submitter":"Subham Roy","authors":"Subham Roy","title":"Generalized Mahler measure of Laurent polynomials","comments":"43 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Following the work of Lal\\'in and Mittal on the Mahler measure over arbitrary\ntori, we investigate the definition of the generalized Mahler measure for all\nLaurent polynomials in two variables when they do not vanish on the integration\ntorus. We establish certain relations between the standard Mahler measure and\nthe generalized Mahler measure of such polynomials. Later we focus our\ninvestigation on a tempered family of polynomials originally studied by Boyd,\nnamely $Q_{r}(x, y) = x + \\frac{1}{x} + y + \\frac{1}{y} + r$ with $r \\in\n\\mathbb{C},$ and apply our results to this family. For the $r = 4$ case, we\nexplicitly calculate the generalized Mahler measure of $Q_4$ over any arbitrary\ntorus in terms of special values of the Bloch-Wigner dilogarithm. Finally, we\nextend our results to the several variable setting.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:57:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Roy","Subham",""]]}
{"id":"2308.04602","submitter":"Abby Stevens","authors":"Abby Stevens, Jonathan Ozik, Kyle Chard, Jaline Gerardin, Justin M.\n  Wozniak","title":"NSF RESUME HPC Workshop: High-Performance Computing and Large-Scale Data\n  Management in Service of Epidemiological Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The NSF-funded Robust Epidemic Surveillance and Modeling (RESUME) project\nsuccessfully convened a workshop entitled \"High-performance computing and\nlarge-scale data management in service of epidemiological modeling\" at the\nUniversity of Chicago on May 1-2, 2023. This was part of a series of workshops\ndesigned to foster sustainable and interdisciplinary co-design for predictive\nintelligence and pandemic prevention. The event brought together 31 experts in\nepidemiological modeling, high-performance computing (HPC), HPC workflows, and\nlarge-scale data management to develop a shared vision for capabilities needed\nfor computational epidemiology to better support pandemic prevention. Through\nthe workshop, participants identified key areas in which HPC capabilities could\nbe used to improve epidemiological modeling, particularly in supporting public\nhealth decision-making, with an emphasis on HPC workflows, data integration,\nand HPC access. The workshop explored nascent HPC workflow and large-scale data\nmanagement approaches currently in use for epidemiological modeling and sought\nto draw from approaches used in other domains to determine which practices\ncould be best adapted for use in epidemiological modeling. This report\ndocuments the key findings and takeaways from the workshop.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:01:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Stevens","Abby",""],["Ozik","Jonathan",""],["Chard","Kyle",""],["Gerardin","Jaline",""],["Wozniak","Justin M.",""]]}
{"id":"2308.04603","submitter":"Xin Zhong","authors":"Xin Zhong, Arjon Das, Fahad Alrasheedi, Abdullah Tanvir","title":"Deep Learning based Image Watermarking: A Brief Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The act of secretly embedding and extracting a watermark on a cover image to\nprotect it is known as image watermarking. In recent years, deep learning-based\nimage watermarking techniques have been emerging one after another. To study\nthe state-of-the-art, this survey categorizes cutting-edge deep learning-based\nimage watermarking techniques into Embedder-Extractor Joint Training, Deep\nNetworks as a Feature Transformation, and Hybrid schemes. Research directions\nin each category are also analyzed and summarized. Additionally, potential\nfuture research directions are discussed to envision future studies.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:06:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhong","Xin",""],["Das","Arjon",""],["Alrasheedi","Fahad",""],["Tanvir","Abdullah",""]]}
{"id":"2308.04604","submitter":"Gabriele Tolomei","authors":"Edoardo Gabrielli, Giovanni Pica, Gabriele Tolomei","title":"A Survey on Decentralized Federated 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":"  In recent years, federated learning (FL) has become a very popular paradigm\nfor training distributed, large-scale, and privacy-preserving machine learning\n(ML) systems. In contrast to standard ML, where data must be collected at the\nexact location where training is performed, FL takes advantage of the\ncomputational capabilities of millions of edge devices to collaboratively train\na shared, global model without disclosing their local private data.\nSpecifically, in a typical FL system, the central server acts only as an\norchestrator; it iteratively gathers and aggregates all the local models\ntrained by each client on its private data until convergence. Although FL\nundoubtedly has several benefits over traditional ML (e.g., it protects private\ndata ownership by design), it suffers from several weaknesses. One of the most\ncritical challenges is to overcome the centralized orchestration of the\nclassical FL client-server architecture, which is known to be vulnerable to\nsingle-point-of-failure risks and man-in-the-middle attacks, among others. To\nmitigate such exposure, decentralized FL solutions have emerged where all FL\nclients cooperate and communicate without a central server. This survey\ncomprehensively summarizes and reviews existing decentralized FL approaches\nproposed in the literature. Furthermore, it identifies emerging challenges and\nsuggests promising research directions in this under-explored domain.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:07:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gabrielli","Edoardo",""],["Pica","Giovanni",""],["Tolomei","Gabriele",""]]}
{"id":"2308.04605","submitter":"Jingyi Shen","authors":"Jingyi Shen and Han-Wei Shen","title":"PSRFlow: Probabilistic Super Resolution with Flow-Based Models for\n  Scientific Data","comments":"To be published in Proc. IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.GR cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Although many deep-learning-based super-resolution approaches have been\nproposed in recent years, because no ground truth is available in the inference\nstage, few can quantify the errors and uncertainties of the super-resolved\nresults. For scientific visualization applications, however, conveying\nuncertainties of the results to scientists is crucial to avoid generating\nmisleading or incorrect information. In this paper, we propose PSRFlow, a novel\nnormalizing flow-based generative model for scientific data super-resolution\nthat incorporates uncertainty quantification into the super-resolution process.\nPSRFlow learns the conditional distribution of the high-resolution data based\non the low-resolution counterpart. By sampling from a Gaussian latent space\nthat captures the missing information in the high-resolution data, one can\ngenerate different plausible super-resolution outputs. The efficient sampling\nin the Gaussian latent space allows our model to perform uncertainty\nquantification for the super-resolved results. During model training, we\naugment the training data with samples across various scales to make the model\nadaptable to data of different scales, achieving flexible super-resolution for\na given input. Our results demonstrate superior performance and robust\nuncertainty quantification compared with existing methods such as interpolation\nand GAN-based super-resolution networks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:10:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shen","Jingyi",""],["Shen","Han-Wei",""]]}
{"id":"2308.04606","submitter":"M. Mehdi Asadi","authors":"M. Mehdi Asadi, Mohammad Khosravi, Hesam Mosalli, Stephane Blouin and\n  Amir G. Aghdam","title":"Generalized Power Iteration with Application to Distributed Connectivity\n  Estimation of Asymmetric Networks","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The problem of connectivity assessment in an asymmetric network represented\nby a weighted directed graph is investigated in this article. A power iteration\nalgorithm in a centralized implementation is developed first to compute the\ngeneralized algebraic connectivity of asymmetric networks. After properly\ntransforming the Laplacian matrix of the network, two sequences of\none-dimensional and two-dimensional subspaces are generated iteratively, one of\nwhich converges to the desired subspace spanned by the eigenvector(s)\nassociated with the eigenvalue(s) representing the network's generalized\nalgebraic connectivity. A distributed implementation of the proposed power\niteration algorithm is then developed to compute the generalized algebraic\nconnectivity from the viewpoint of each node, which is scalable to any\nasymmetric network of any size with a fixed message length per node. The\nconvergence analysis of these algorithms is subsequently provided under some\nweak assumptions. The efficiency of the developed algorithms in computing the\nnetwork connectivity is then demonstrated by simulations.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:12:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Asadi","M. Mehdi",""],["Khosravi","Mohammad",""],["Mosalli","Hesam",""],["Blouin","Stephane",""],["Aghdam","Amir G.",""]]}
{"id":"2308.04607","submitter":"Mohammad Radhi Aziz","authors":"Mohammad Aziz and Ali Saeed Alfoudi","title":"Different Mechanisms of Machine Learning and Optimization Algorithms\n  Utilized in Intrusion Detection Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Malicious software is an integral part of cybercrime defense. Due to the\ngrowing number of malicious attacks and their target sources, detecting and\npreventing the attack becomes more challenging due to the assault's changing\nbehavior. The bulk of classic malware detection systems is based on statistics,\nanalytic techniques, or machine learning. Virus signature methods are widely\nused to identify malware. The bulk of anti-malware systems categorizes malware\nusing regular expressions and patterns. While antivirus software is less likely\nto update its databases to identify and block malware, file features must be\nupdated to detect and prevent newly generated malware. Creating attack\nsignatures requires practically all of a human being's work. The purpose of\nthis study is to undertake a review of the current research on intrusion\ndetection models and the datasets that support them. In this article, we\ndiscuss the state-of-the-art, focusing on the strategy that was devised and\nexecuted, the dataset that was utilized, the findings, and the assessment that\nwas undertaken. Additionally, the surveyed articles undergo critical analysis\nand statements in order to give a thorough comparative review. Machine learning\nand deep learning methods, as well as new classification and feature selection\nmethodologies, are studied and researched. Thus far, each technique has proved\nthe capability of constructing very accurate intrusion detection models. The\nsurvey findings reveal that Clearly, the MultiTree and adaptive voting\nalgorithms surpassed all other models in terms of persistency and performance,\naveraging 99.98 percent accuracy on average.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:13:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Aziz","Mohammad",""],["Alfoudi","Ali Saeed",""]]}
{"id":"2308.04608","submitter":"Stefan Schoder","authors":"Stefan Schoder","title":"Offline coupling of segregated multi-physical simulations with\n  consistent boundary conditions and source terms based on scattered data","comments":"3 pages, v0.1 working paper","journal-ref":null,"doi":null,"report-no":"A100.208","categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article presents the openCFS submodule scattered data reader for\ncoupling multi-physical simulations performed in different simulation programs.\nFor instance, by considering a forward-coupling of a surface vibration\nsimulation (mechanical system) to an acoustic propagation simulation using\ntime-dependent acoustic absorbing material as a noise mitigation measure. The\nnearest-neighbor search of the target and source points from the interpolation\nis performed using the FLANN or the CGAL library. In doing so, the coupled\nfield (e.g., surface velocity) is interpolated from a source representation\nconsisting of field values physically stored and organized in a file directory\nto a target representation being the quadrature points in the case of the\nfinite element method. A test case of the functionality is presented in the\n\"testsuite\" module of the openCFS software called \"Abc2dcsvt\". This scattered\ndata reader module was successfully applied in numerous studies on flow-induced\nsound generation. Within this short article, the functionality, and usability\nof this module are described.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:20:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Schoder","Stefan",""]]}
{"id":"2308.04609","submitter":"Amri Nayyeri","authors":"Willow Barkan-Vered, Huck Bennett, Amir Nayyeri","title":"Topological $k$-metrics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Metric spaces $(X, d)$ are ubiquitous objects in mathematics and computer\nscience that allow for capturing (pairwise) distance relationships $d(x, y)$\nbetween points $x, y \\in X$. Because of this, it is natural to ask what useful\ngeneralizations there are of metric spaces for capturing \"$k$-wise distance\nrelationships\" $d(x_1, \\ldots, x_k)$ among points $x_1, \\ldots, x_k \\in X$ for\n$k > 2$. To that end, G\\\"{a}hler (Math. Nachr., 1963) (and perhaps others even\nearlier) defined $k$-metric spaces, which generalize metric spaces, and most\nnotably generalize the triangle inequality $d(x_1, x_2) \\leq d(x_1, y) + d(y,\nx_2)$ to the \"simplex inequality\" $d(x_1, \\ldots, x_k) \\leq \\sum_{i=1}^k d(x_1,\n\\ldots, x_{i-1}, y, x_{i+1}, \\ldots, x_k)$. (The definition holds for any fixed\n$k \\geq 2$, and a $2$-metric space is just a (standard) metric space.)\n  In this work, we introduce strong $k$-metric spaces, $k$-metric spaces that\nsatisfy a topological condition stronger than the simplex inequality, which\nmakes them \"behave nicely.\" We also introduce coboundary $k$-metrics, which\ngeneralize $\\ell_p$ metrics (and in fact all finite metric spaces induced by\nnorms) and minimum bounding chain $k$-metrics, which generalize shortest path\nmetrics (and capture all strong $k$-metrics). Using these definitions, we prove\nanalogs of a number of fundamental results about embedding finite metric spaces\nincluding Fr\\'{e}chet embedding (isometric embedding into $\\ell_{\\infty}$) and\nisometric embedding of all tree metrics into $\\ell_1$. We also study\nrelationships between families of (strong) $k$-metrics, and show that natural\nquantities, like simplex volume, are strong $k$-metrics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:21:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Barkan-Vered","Willow",""],["Bennett","Huck",""],["Nayyeri","Amir",""]]}
{"id":"2308.04610","submitter":"Hiba Kobeissi","authors":"Hiba Kobeissi, Javiera Jilberto, M. \\c{C}a\\u{g}atay Karakan, Xining\n  Gao, Samuel J. DePalma, Shoshana L. Das, Lani Quach, Jonathan Urquia, Brendon\n  M. Baker, Christopher S. Chen, David Nordsletten, Emma Lejeune","title":"MicroBundleCompute: Automated segmentation, tracking, and analysis of\n  subdomain deformation in cardiac microbundles","comments":"16 main pages, 7 main figures, Supplementary Information included as\n  appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Advancing human induced pluripotent stem cell derived cardiomyocyte\n(hiPSC-CM) technology will lead to significant progress ranging from disease\nmodeling, to drug discovery, to regenerative tissue engineering. Yet, alongside\nthese potential opportunities comes a critical challenge: attaining mature\nhiPSC-CM tissues. At present, there are multiple techniques to promote maturity\nof hiPSC-CMs including physical platforms and cell culture protocols. However,\nwhen it comes to making quantitative comparisons of functional behavior, there\nare limited options for reliably and reproducibly computing functional metrics\nthat are suitable for direct cross-system comparison. In addition, the current\nstandard functional metrics obtained from time-lapse images of cardiac\nmicrobundle contraction reported in the field (i.e., post forces, average\ntissue stress) do not take full advantage of the available information present\nin these data (i.e., full-field tissue displacements and strains). Thus, we\npresent \"MicroBundleCompute,\" a computational framework for automatic\nquantification of morphology-based mechanical metrics from movies of cardiac\nmicrobundles. Briefly, this computational framework offers tools for automatic\ntissue segmentation, tracking, and analysis of brightfield and phase contrast\nmovies of beating cardiac microbundles. It is straightforward to implement,\nrequires little to no parameter tuning, and runs quickly on a personal\ncomputer. In this paper, we describe the methods underlying this computational\nframework, show the results of our extensive validation studies, and\ndemonstrate the utility of exploring heterogeneous tissue deformations and\nstrains as functional metrics. With this manuscript, we disseminate\n\"MicroBundleCompute\" as an open-source computational tool with the aim of\nmaking automated quantitative analysis of beating cardiac microbundles more\naccessible to the community.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:27:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kobeissi","Hiba",""],["Jilberto","Javiera",""],["Karakan","M. \u00c7a\u011fatay",""],["Gao","Xining",""],["DePalma","Samuel J.",""],["Das","Shoshana L.",""],["Quach","Lani",""],["Urquia","Jonathan",""],["Baker","Brendon M.",""],["Chen","Christopher S.",""],["Nordsletten","David",""],["Lejeune","Emma",""]]}
{"id":"2308.04611","submitter":"Michela Ravanelli","authors":"Valentino Constantinou, Michela Ravanelli, Hamlin Liu, Jacob Bortnik","title":"Deep Learning Driven Detection of Tsunami Related Internal GravityWaves:\n  a path towards open-ocean natural hazards detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.ao-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Tsunamis can trigger internal gravity waves (IGWs) in the ionosphere,\nperturbing the Total Electron Content (TEC) - referred to as Traveling\nIonospheric Disturbances (TIDs) that are detectable through the Global\nNavigation Satellite System (GNSS). The GNSS are constellations of satellites\nproviding signals from Earth orbit - Europe's Galileo, the United States'\nGlobal Positioning System (GPS), Russia's Global'naya Navigatsionnaya\nSputnikovaya Sistema (GLONASS) and China's BeiDou. The real-time detection of\nTIDs provides an approach for tsunami detection, enhancing early warning\nsystems by providing open-ocean coverage in geographic areas not serviceable by\nbuoy-based warning systems. Large volumes of the GNSS data is leveraged by deep\nlearning, which effectively handles complex non-linear relationships across\nthousands of data streams. We describe a framework leveraging slant total\nelectron content (sTEC) from the VARION (Variometric Approach for Real-Time\nIonosphere Observation) algorithm by Gramian Angular Difference Fields (from\nComputer Vision) and Convolutional Neural Networks (CNNs) to detect TIDs in\nnear-real-time. Historical data from the 2010 Maule, 2011 Tohoku and the 2012\nHaida-Gwaii earthquakes and tsunamis are used in model training, and the\nlater-occurring 2015 Illapel earthquake and tsunami in Chile for out-of-sample\nmodel validation. Using the experimental framework described in the paper, we\nachieved a 91.7% F1 score. Source code is available at:\nhttps://github.com/vc1492a/tidd. Our work represents a new frontier in\ndetecting tsunami-driven IGWs in open-ocean, dramatically improving the\npotential for natural hazards detection for coastal communities.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:30:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Constantinou","Valentino",""],["Ravanelli","Michela",""],["Liu","Hamlin",""],["Bortnik","Jacob",""]]}
{"id":"2308.04612","submitter":"Mauricio Gomez Lopez","authors":"Mauricio Gomez Lopez","title":"The homotopy type of the PL cobordism category. II","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we prove the PL analogue of the theorem of Galatius, Madsen,\nTillmann, and Weiss which describes the homotopy type of the smooth cobordism\ncategory. More specifically, we introduce the Madsen-Tillmann spectrum\n$\\mathbf{MT}PL(d)$ and prove that there is a weak homotopy equivalence of the\nform $B\\mathsf{Cob}^{\\mathrm{PL}}_d \\simeq \\Omega^{\\infty-1}\\mathbf{MT}PL(d)$.\nWe also discuss how to adjust the methods of this paper to obtain the\ntopological version of our main result.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:37:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lopez","Mauricio Gomez",""]]}
{"id":"2308.04613","submitter":"Rodolfo Batista Negri","authors":"Rodolfo Batista Negri and Ant\\^onio Fernando Bertachini de Almeida\n  Prado","title":"Effects of Planetary Approximations on Asteroid Deflection Previsibility\n  for Trajectory Design","comments":"Currently under review","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research investigates the influence of distant encounters between an\nasteroid and perturbing bodies on the deflection process, aiming to provide\nvaluable guidelines for the trajectory design of a deflecting spacecraft.\nAnalytical approximations are commonly used in the preliminary design phase to\nquickly explore a large design space. However, the dynamics involved in\nasteroid deflection are intricate, and simple models may not capture the full\ncomplexity of the system. We examine the accuracy and limitations of analytical\nmodels compared to more accurate numerical simulations. The study reveals that\nencounters with perturbing bodies, even at considerable distances (of dozens of\nradii of the sphere of influence), can significantly perturb the asteroid's\ntrajectory, leading to discrepancies between analytical and numerical\npredictions. To address this, we propose a heuristic rule to guide trajectory\ndesigners in determining the suitability of analytical models for specific\ndeflection scenarios. By understanding the impact of distant encounters on\ndeflection, our study equips designers with the knowledge to make informed\ndecisions during the trajectory planning process, facilitating efficient and\neffective asteroid deflection missions.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:39:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Negri","Rodolfo Batista",""],["Prado","Ant\u00f4nio Fernando Bertachini de Almeida",""]]}
{"id":"2308.04614","submitter":"Yongda Zhu","authors":"Yongda Zhu, George D. Becker, Holly M. Christenson, Anson D'Aloisio,\n  Sarah E. I. Bosman, Tom Bakx, Valentina D'Odorico, Manuela Bischetti,\n  Christopher Cain, Frederick B. Davies, Rebecca L. Davies, Anna-Christina\n  Eilers, Xiaohui Fan, Prakash Gaikwad, Martin G. Haehnelt, Laura C. Keating,\n  Girish Kulkarni, Samuel Lai, Hai-Xia Ma, Andrei Mesinger, Yuxiang Qin, Sindhu\n  Satyavolu, Tsutomu T. Takeuchi, Hideki Umehata, Jinyi Yang","title":"Probing Ultra-late Reionization: Direct Measurements of the Mean Free\n  Path over $5<z<6$","comments":"17 pages, 6 figures, 2 tables; accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The mean free path of ionizing photons, $\\lambda_{\\rm mfp}$, is a critical\nparameter for modeling the intergalactic medium (IGM) both during and after\nreionization. We present direct measurements of $\\lambda_{\\rm mfp}$ from QSO\nspectra over the redshift range $5<z<6$, including the first measurements at\n$z\\simeq5.3$ and 5.6. Our sample includes data from the XQR-30 VLT large\nprogram, as well as new Keck/ESI observations of QSOs near $z \\sim 5.5$, for\nwhich we also acquire new [C II] 158$\\mu$m redshifts with ALMA. By measuring\nthe Lyman continuum transmission profile in stacked QSO spectra, we find\n$\\lambda_{\\rm mfp} = 9.33_{-1.80}^{+2.06}$, $5.40_{-1.40}^{+1.47}$,\n$3.31_{-1.34}^{+2.74}$, and $0.81_{-0.48}^{+0.73}$ pMpc at $z=5.08$, 5.31,\n5.65, and 5.93, respectively. Our results demonstrate that $\\lambda_{\\rm mfp}$\nincreases steadily and rapidly with time over $5<z<6$. Notably, we find that\n$\\lambda_{\\rm mfp}$ deviates significantly from predictions based on a fully\nionized and relaxed IGM as late as $z=5.3$. By comparing our results to model\npredictions and indirect $\\lambda_{\\rm mfp}$ constraints based on IGM\nLy$\\alpha$ opacity, we find that the $\\lambda_{\\rm mfp}$ evolution is\nconsistent with scenarios wherein the IGM is still undergoing reionization\nand/or retains large fluctuations in the ionizing UV background well below\nredshift six.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:40:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Yongda",""],["Becker","George D.",""],["Christenson","Holly M.",""],["D'Aloisio","Anson",""],["Bosman","Sarah E. I.",""],["Bakx","Tom",""],["D'Odorico","Valentina",""],["Bischetti","Manuela",""],["Cain","Christopher",""],["Davies","Frederick B.",""],["Davies","Rebecca L.",""],["Eilers","Anna-Christina",""],["Fan","Xiaohui",""],["Gaikwad","Prakash",""],["Haehnelt","Martin G.",""],["Keating","Laura C.",""],["Kulkarni","Girish",""],["Lai","Samuel",""],["Ma","Hai-Xia",""],["Mesinger","Andrei",""],["Qin","Yuxiang",""],["Satyavolu","Sindhu",""],["Takeuchi","Tsutomu T.",""],["Umehata","Hideki",""],["Yang","Jinyi",""]]}
{"id":"2308.04615","submitter":"Kumar Vijay Mishra","authors":"Kumar Vijay Mishra, Ahmet M. Elbir and Koichi Ichige","title":"Sparse Array Design for Direction Finding using Deep Learning","comments":"Book chapter, 39 pages, 20 figures, 4 tables. arXiv admin note:\n  substantial text overlap with arXiv:2004.11637","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the past few years, deep learning (DL) techniques have been introduced for\ndesigning sparse arrays. These methods offer the advantages of feature\nengineering and low prediction-stage complexity, which is helpful in tackling\nthe combinatorial search inherent to finding a sparse array. In this chapter,\nwe provide a synopsis of several direction finding applications of DL-based\nsparse arrays. We begin by examining supervised and transfer learning\ntechniques that have applications in selecting sparse arrays for a cognitive\nradar application. Here, we also discuss the use of meta-heuristic learning\nalgorithms such as simulated annealing for the case of designing\ntwo-dimensional sparse arrays. Next, we consider DL-based antenna selection for\nwireless communications, wherein sparse array problem may also be combined with\nchannel estimation, beamforming, or localization. Finally, we provide an\nexample of deep sparse array technique for integrated sensing and\ncommunications (ISAC) application, wherein a trade-off of radar and\ncommunications performance makes ISAC sparse array problem very challenging.\nFor each setting, we illustrate the performance of model-based optimization and\nDL techniques through several numerical experiments. We discuss additional\nconsiderations required to ensure robustness of DL-based algorithms against\nvarious imperfections in array data.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:45:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mishra","Kumar Vijay",""],["Elbir","Ahmet M.",""],["Ichige","Koichi",""]]}
{"id":"2308.04616","submitter":"Moein Razavi","authors":"Moein Razavi, Samira Ziyadidegan, Reza Jahromi, Saber Kazeminasab,\n  Vahid Janfaza, Ahmadreza Mahmoudzadeh, Elaheh Baharlouei, Farzan Sasangohar","title":"Machine Learning, Deep Learning and Data Preprocessing Techniques for\n  Detection, Prediction, and Monitoring of Stress and Stress-related Mental\n  Disorders: A Scoping Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This comprehensive review systematically evaluates Machine Learning (ML)\nmethodologies employed in the detection, prediction, and analysis of mental\nstress and its consequent mental disorders (MDs). Utilizing a rigorous scoping\nreview process, the investigation delves into the latest ML algorithms,\npreprocessing techniques, and data types employed in the context of stress and\nstress-related MDs. The findings highlight that Support Vector Machine (SVM),\nNeural Network (NN), and Random Forest (RF) models consistently exhibit\nsuperior accuracy and robustness among all machine learning algorithms\nexamined. Furthermore, the review underscores that physiological parameters,\nsuch as heart rate measurements and skin response, are prevalently used as\nstress predictors in ML algorithms. This is attributed to their rich\nexplanatory information concerning stress and stress-related MDs, as well as\nthe relative ease of data acquisition. Additionally, the application of\ndimensionality reduction techniques, including mappings, feature selection,\nfiltering, and noise reduction, is frequently observed as a crucial step\npreceding the training of ML algorithms. The synthesis of this review\nidentifies significant research gaps and outlines future directions for the\nfield. These encompass areas such as model interpretability, model\npersonalization, the incorporation of naturalistic settings, and real-time\nprocessing capabilities for detection and prediction of stress and\nstress-related MDs.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:47:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Razavi","Moein",""],["Ziyadidegan","Samira",""],["Jahromi","Reza",""],["Kazeminasab","Saber",""],["Janfaza","Vahid",""],["Mahmoudzadeh","Ahmadreza",""],["Baharlouei","Elaheh",""],["Sasangohar","Farzan",""]]}
{"id":"2308.04617","submitter":"George Kesidis","authors":"Hang Wang, Zhen Xiang, David J. Miller, George Kesidis","title":"Improved Activation Clipping for Universal Backdoor Mitigation and\n  Test-Time Detection","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 are vulnerable to backdoor attacks (Trojans), where an\nattacker poisons the training set with backdoor triggers so that the neural\nnetwork learns to classify test-time triggers to the attacker's designated\ntarget class. Recent work shows that backdoor poisoning induces over-fitting\n(abnormally large activations) in the attacked model, which motivates a\ngeneral, post-training clipping method for backdoor mitigation, i.e., with\nbounds on internal-layer activations learned using a small set of clean\nsamples. We devise a new such approach, choosing the activation bounds to\nexplicitly limit classification margins. This method gives superior performance\nagainst peer methods for CIFAR-10 image classification. We also show that this\nmethod has strong robustness against adaptive attacks, X2X attacks, and on\ndifferent datasets. Finally, we demonstrate a method extension for test-time\ndetection and correction based on the output differences between the original\nand activation-bounded networks. The code of our method is online available.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:47:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Hang",""],["Xiang","Zhen",""],["Miller","David J.",""],["Kesidis","George",""]]}
{"id":"2308.04618","submitter":"Keng Wiboonton","authors":"Korkeat Korkeathikhun, Borworn Khuhirun, Songpon Sriwongsa, Keng\n  Wiboonton","title":"More on characteristic polynomials of Lie algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, the notion of characteristic polynomial of representations\nof Lie algebras has been widely studied. This paper provides more properties of\nthese characteristic polynomials. For simple Lie algebras, we characterize the\nlinearization of characteristic polynomials. Additionally, we characterize\nnilpotent Lie algebras via characteristic polynomials of the adjoint\nrepresentation.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:48:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Korkeathikhun","Korkeat",""],["Khuhirun","Borworn",""],["Sriwongsa","Songpon",""],["Wiboonton","Keng",""]]}
{"id":"2308.04619","submitter":"Bayan Al-Nahhas","authors":"Bayan Al-Nahhas, Qurrat-UI-Ain Nadeem, Aryan Kaushik, Anas Chaaban","title":"Reconfigurable Intelligent Surfaces Assisted Communication Under\n  Different CSI Assumptions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work studies the net sum-rate performance of a distributed\nreconfigurable intelligent surfaces (RISs)-assisted multi-user\nmultiple-input-single-output (MISO) downlink communication system under\nimperfect instantaneous-channel state information (I-CSI) to implement\nprecoding at the base station (BS) and statistical-CSI (S-CSI) to design the\nRISs phase-shifts. Two channel estimation (CE) protocols are considered for\nI-CSI acquisition: (i) a full CE protocol that estimates all direct and\nRISs-assisted channels over multiple training sub-phases, and (ii) a\nlow-overhead direct estimation (DE) protocol that estimates the end-to-end\nchannel in a single sub-phase. We derive the asymptotic equivalents of\nsignal-to-interference-plus-noise ratio (SINR) and ergodic net sum-rate under\nboth protocols for given RISs phase-shifts, which are then optimized based on\nS-CSI. Simulation results reveal that the low-complexity DE protocol yields\nbetter net sum-rate than the full CE protocol when used to obtain CSI for\nprecoding. A benchmark full I-CSI based RISs design is also outlined and shown\nto yield higher SINR but lower net sum-rate than the S-CSI based RISs design.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:49:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Al-Nahhas","Bayan",""],["Nadeem","Qurrat-UI-Ain",""],["Kaushik","Aryan",""],["Chaaban","Anas",""]]}
{"id":"2308.04620","submitter":"Vinod Raman","authors":"Ananth Raman, Vinod Raman, Unique Subedi, Ambuj Tewari","title":"Multiclass Online Learnability under Bandit Feedback","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study online multiclass classification under bandit feedback. We extend\nthe results of (daniely2013price) by showing that the finiteness of the Bandit\nLittlestone dimension is necessary and sufficient for bandit online multiclass\nlearnability even when the label space is unbounded. Our result complements the\nrecent work by (hanneke2023multiclass) who show that the Littlestone dimension\ncharacterizes online multiclass learnability in the full-information setting\nwhen the label space is unbounded.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 22:54:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Raman","Ananth",""],["Raman","Vinod",""],["Subedi","Unique",""],["Tewari","Ambuj",""]]}
{"id":"2308.04621","submitter":"Robert Antonucci","authors":"Robert R. J. Antonucci","title":"A Walk-Through of AGN Country -- for the somewhat initiated!","comments":"24 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Some key issues in AGN and galaxy formation are discussed. Very successful\nUnified Models explain much of the variety of AGN with orientation effects;\ningredients are shadowing by a dusty \"torus\" and relativistic beaming. A\nspinoff result is described which is important for the formation of massive\nelliptical galaxies. It's the most spectacular and unequivocal AGN feedback\nphenomenon known. This is the so-called \"alignment effect\" in powerful radio\ngalaxies at z>~1. One of them is a BAL radio galaxy! I explain a very robust\nderivation of the reddening law for nuclear dust, which reveals a dearth of\nsmall grains. Then the quasistatic thin accretion disk model, thought by many\nto explain the energetically dominant optical/UV continuum, is thoroughly\ndebunked. Much of this was known when the model was proposed 35 years ago. A\nnew argument is given that trivially falsifies a huge superset of such models.\nIt's possible to see the central engine spectrum with the atomic and dust\nemission surgically removed! Few noticed this breakthrough work. The far IR\ndust emission in Cygnus A is 10% polarized, and so far high nuclear dust\npolarization is seen in all radio loud objects, but no radio quiet ones.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:04:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Antonucci","Robert R. J.",""]]}
{"id":"2308.04622","submitter":"Tiange Xiang","authors":"Tiange Xiang, Adam Sun, Jiajun Wu, Ehsan Adeli, Li Fei-Fei","title":"Rendering Humans from Object-Occluded Monocular Videos","comments":"ICCV 2023, project page:\n  https://cs.stanford.edu/~xtiange/projects/occnerf/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  3D understanding and rendering of moving humans from monocular videos is a\nchallenging task. Despite recent progress, the task remains difficult in\nreal-world scenarios, where obstacles may block the camera view and cause\npartial occlusions in the captured videos. Existing methods cannot handle such\ndefects due to two reasons. First, the standard rendering strategy relies on\npoint-point mapping, which could lead to dramatic disparities between the\nvisible and occluded areas of the body. Second, the naive direct regression\napproach does not consider any feasibility criteria (ie, prior information) for\nrendering under occlusions. To tackle the above drawbacks, we present OccNeRF,\na neural rendering method that achieves better rendering of humans in severely\noccluded scenes. As direct solutions to the two drawbacks, we propose\nsurface-based rendering by integrating geometry and visibility priors. We\nvalidate our method on both simulated and real-world occlusions and demonstrate\nour method's superiority.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:12:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xiang","Tiange",""],["Sun","Adam",""],["Wu","Jiajun",""],["Adeli","Ehsan",""],["Fei-Fei","Li",""]]}
{"id":"2308.04623","submitter":"Benjamin Spector","authors":"Benjamin Spector and Chris Re","title":"Accelerating LLM Inference with Staged Speculative Decoding","comments":"Published at ES-FOMO at ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances with large language models (LLM) illustrate their diverse\ncapabilities. We propose a novel algorithm, staged speculative decoding, to\naccelerate LLM inference in small-batch, on-device scenarios. We address the\nlow arithmetic intensity of small-batch inference by improving upon previous\nwork in speculative decoding. First, we restructure the speculative batch as a\ntree, which reduces generation costs and increases the expected tokens per\nbatch. Second, we add a second stage of speculative decoding. Taken together,\nwe reduce single-batch decoding latency by 3.16x with a 762M parameter GPT-2-L\nmodel while perfectly preserving output quality.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:29:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Spector","Benjamin",""],["Re","Chris",""]]}
{"id":"2308.04624","submitter":"Debarag Banerjee","authors":"Debarag Banerjee, Pooja Singh, Arjun Avadhanam, Saksham Srivastava","title":"Benchmarking LLM powered Chatbots: Methods and Metrics","comments":"8 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous conversational agents, i.e. chatbots, are becoming an increasingly\ncommon mechanism for enterprises to provide support to customers and partners.\nIn order to rate chatbots, especially ones powered by Generative AI tools like\nLarge Language Models (LLMs) we need to be able to accurately assess their\nperformance. This is where chatbot benchmarking becomes important. In this\npaper, we propose the use of a novel benchmark that we call the E2E (End to\nEnd) benchmark, and show how the E2E benchmark can be used to evaluate accuracy\nand usefulness of the answers provided by chatbots, especially ones powered by\nLLMs. We evaluate an example chatbot at different levels of sophistication\nbased on both our E2E benchmark, as well as other available metrics commonly\nused in the state of art, and observe that the proposed benchmark show better\nresults compared to others. In addition, while some metrics proved to be\nunpredictable, the metric associated with the E2E benchmark, which uses cosine\nsimilarity performed well in evaluating chatbots. The performance of our best\nmodels shows that there are several benefits of using the cosine similarity\nscore as a metric in the E2E benchmark.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:30:20 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Banerjee","Debarag",""],["Singh","Pooja",""],["Avadhanam","Arjun",""],["Srivastava","Saksham",""]]}
{"id":"2308.04625","submitter":"Ali Minai","authors":"Deven M. Mistry and Ali A. Minai","title":"A Comparative Study of Sentence Embedding Models for Assessing Semantic\n  Variation","comments":"12 pages, 6 figures, Accepted for publication in the Proceedings of\n  the 2023 International Conference on Artificial Neural Networks, Heraklion,,\n  Greece, September 26-29, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analyzing the pattern of semantic variation in long real-world texts such as\nbooks or transcripts is interesting from the stylistic, cognitive, and\nlinguistic perspectives. It is also useful for applications such as text\nsegmentation, document summarization, and detection of semantic novelty. The\nrecent emergence of several vector-space methods for sentence embedding has\nmade such analysis feasible. However, this raises the issue of how consistent\nand meaningful the semantic representations produced by various methods are in\nthemselves. In this paper, we compare several recent sentence embedding methods\nvia time-series of semantic similarity between successive sentences and\nmatrices of pairwise sentence similarity for multiple books of literature. In\ncontrast to previous work using target tasks and curated datasets to compare\nsentence embedding methods, our approach provides an evaluation of the methods\n'in the wild'. We find that most of the sentence embedding methods considered\ndo infer highly correlated patterns of semantic similarity in a given document,\nbut show interesting differences.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:31:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mistry","Deven M.",""],["Minai","Ali A.",""]]}
{"id":"2308.04626","submitter":"Murray Batchelor","authors":"Eve Cheng, Murray T. Batchelor and Danny Cocks","title":"Topological analysis of the complex SSH model","comments":"10 pages, 5 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":"  This paper presents the topological analysis of the complex\nSu-Schrieffer-Heeger (SSH) model using two methods: Berry phase and topological\ndata analysis. We demonstrate how both methods can effectively generate\ntopological phase diagrams for the model, revealing two distinct regions based\non the relative magnitudes of the parameters $|v|$ and $|w|$. Specifically,\nwhen $|v| > |w|$, the system is found to be topologically trivial, whereas for\n$|v| < |w|$, it exhibits topologically non-trivial behaviour. Our results\ncontribute to building the groundwork for topological analysis of more\ncomplicated SSH-type models.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:32:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cheng","Eve",""],["Batchelor","Murray T.",""],["Cocks","Danny",""]]}
{"id":"2308.04627","submitter":"Frank Oertel P","authors":"Frank Oertel","title":"Hilbert-Schmidt operators and the conjugate of a complex Hilbert space:\n  Dirac's bra-ket formalism revisited","comments":"Reference [6] looks very different (and quite odd) after compiling\n  the TeX file in arXiv, compared to my original version before","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We reveal in detail how the definition of the inner product on a given\ncomplex Hilbert space - usually used in mathematics (where linearity is assumed\nin the first component and semilinearity in the second) - directly links to\nDirac's powerful bra-ket formalism in quantum physics. To this end, we just\nhave to make use of the conjugate of a complex Hilbert space (by which an\nanalysis of semilinear operators can be handled by means of linear operator\ntheory) and re-apply the theorem of Fr\\'{e}chet-Riesz accordingly. Applications\nare specified, including a self-contained and simple description of the tensor\nproduct of two complex Hilbert spaces $H \\otimes K$ (answering a related\nquestion of B. K. Driver) and a purely linear algebraic description of the\nquantum teleportation process (Example 3.8). In doing so, we provide an\nexplicit construction of a canonical isometric isomorphism between the Hilbert\nspaces $H \\otimes (K \\otimes L)$ and $(H \\otimes K) \\otimes L$ (Theorem 3.7).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:37:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Oertel","Frank",""]]}
{"id":"2308.04628","submitter":"Ian Doust","authors":"Ian Doust and Alan Stoneham","title":"Tietze type extensions for absolutely continuous functions in the plane","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is an open problem whether one can always extend an absolutely continuous\nfunction (in the sense of Ashton and Doust) on a compact subset of the plane to\na larger compact set. In this paper we show that this can be done for a large\nfamily of initial domains whose components consist of polygons and convex\ncurves. An application is given to the spectral theory of $AC(\\sigma)$\noperators.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:40:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Doust","Ian",""],["Stoneham","Alan",""]]}
{"id":"2308.04629","submitter":"Fabien Le Floc'h","authors":"Fabien Le Floc'h","title":"Instabilities of explicit finite difference schemes with ghost points on\n  the diffusion equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA q-fin.CP q-fin.MF q-fin.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ghost, or fictitious points allow to capture boundary conditions that are not\nlocated on the finite difference grid discretization. We explore in this paper\nthe impact of ghost points on the stability of the explicit Euler finite\ndifference scheme in the context of the diffusion equation. In particular, we\nconsider the case of a one-touch option under the Black-Scholes model. The\nobservations and results are however valid for a much wider range of financial\ncontracts and models.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:41:15 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 13:22:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Floc'h","Fabien Le",""]]}
{"id":"2308.04630","submitter":"Keisuke Watanabe","authors":"Keisuke Watanabe, Hemam Rachna Devi, Masanobu Iwanaga, Tadaaki Nagao","title":"Vibrational coupling to quasi-bound states in the continuum under\n  tailored coupling conditions","comments":"15 pages, 5 main figures + 3 supporting fgures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Photonic resonance modes can be spectrally coupled to the vibrational modes\nof molecules in the mid-infrared regime through interactions between localized\nelectric fields and nearby molecules. According to recent studies, radiative\nloss engineering of coupled systems is a promising approach for tailoring\ncoupling conditions and enhancing the molecular signals. However, this strategy\nhas only been realized using the localized surface plasmon resonances of metal\nnanostructures, which suffer from increased ohmic loss in the mid-infrared\nregion and face serious limitations in achieving high quality (Q) factors. In\nthis study, we adopt silicon-based metasurfaces formed on silicon-on-insulator\nwafers to achieve high Q factors and tune the coupling conditions between the\nquasi-bound states in the continuum (qBICs) and molecular vibrations. The\ncoupling between the resonance mode and polymethyl methacrylate molecules is\ntailored from weak to strong coupling regimes by simply changing the structural\nasymmetry parameter and utilizing the intrinsically high Q factors of the qBIC\nmodes. In addition, we identify the optimal asymmetry parameter that maximizes\nthe enhanced molecular signal, opening a route toward realizing highly\nsensitive surface-enhanced infrared spectroscopy using complementary\nmetal-oxide semiconductor compatible all-dielectric materials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:42:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Watanabe","Keisuke",""],["Devi","Hemam Rachna",""],["Iwanaga","Masanobu",""],["Nagao","Tadaaki",""]]}
{"id":"2308.04631","submitter":"Camilo Graados Dr.","authors":"C. Granados, Ching-Ling Hsiao, Marcelo F. Ciappina and Khadga J. Karki","title":"Decoding phase and time-dependent interferograms of high-order harmonics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interferometric measurements of high-harmonics induced by multiple laser\nfields in an emerging field of research that promises optimized yield of\nharmonics, and time and space-resolved nonlinear spectroscopy. Most of the\nmeasurements have been done by controlling the time-delay between the pulses.\nHere, we show that by changing one additional parameter, i.e. the\nphase-difference between the fields, together with the time-delay, one can, on\nthe one hand, enhance the harmonic yield and, on the other hand, obtain\nin-depth information about the physical mechanisms that control the electron\ntrajectories contributing to the high-harmonic generation. The two-dimensional\ninterferograms obtained from such investigations can be used to find the values\nof time-delay and phase between the laser fields that maximize the yield of a\nparticular harmonic. Results show that maximum yields of certain harmonics can\nbe orders of magnitude larger than when using a single field or two fields with\nzero time-delay and phase difference. Our high-harmonics two-dimensional\ninterferograms-based method paves the way for a simpler analysis of the\nattosecond electron dynamics in complex molecules and solids.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:51:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Granados","C.",""],["Hsiao","Ching-Ling",""],["Ciappina","Marcelo F.",""],["Karki","Khadga J.",""]]}
{"id":"2308.04632","submitter":"Filippos Tzortzoglou","authors":"Filippos N. Tzortzoglou, Dionysios Theodosis, Andreas Malikopoulos","title":"An Approach for Optimizing Acceleration in Connected and Automated\n  Vehicles","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":"  Vehicle automation technology has made significant progress, laying the\ngroundwork for a future of fully automated vehicles. This paper delves into the\noperation of connected and automated vehicles (CAVs). In prior work, we\ndeveloped a controller that includes a tunable gain whose value significantly\ninfluences CAV performance and, in particular, its acceleration. By varying\nthis gain, CAV acceleration is associated with different values depending on\nsome initial conditions. Thus, our goal in this paper is to identify the\noptimal value of this gain in terms of acceleration for any group of initial\nconditions. To this end, we formulate an optimization problem where the\ndecision variable is the gain value, and the objective function includes the\nacceleration of the vehicles. The complexity of this problem prohibits\nreal-time solutions. To address this challenge, we train a neural network to\nmap different initial conditions to the optimal gain values efficiently. We\nshowcase the proposed approach to deriving the optimal gains in a merging\nscenario with an on-ramp.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:53:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tzortzoglou","Filippos N.",""],["Theodosis","Dionysios",""],["Malikopoulos","Andreas",""]]}
{"id":"2308.04633","submitter":"Wei Luo","authors":"Wei Luo, Yang Zhong, Hongyu Yu, Muting Xie, Yingwei Chen, Hongjun\n  Xiang and Laurent Bellaiche","title":"Topological interfacial states in ferroelectric domain walls of\n  two-dimensional bismuth","comments":"15 pages, 4 figs","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall physics.app-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using machine learning method, we investigate various domain walls for the\nrecently discovered single-element ferroelectrics bismuth monolayer (Nature\n617, 67 (2023)). We find the charged domain wall configuration has a lower\nenergy than the uncharged domain wall structure due to its low electrostatic\nrepusion potential. Two stable charged domain wall configurations exhibit\ntopological interfacial states near their domain walls, which is caused by the\nchange of the Z_2 number between ferroelectric and paraelectric states.\nInterestingly, different from the edge states of topological insulators, the\nenergies of topological interfacial states for these two structure are splited\ndue to the build-in electric fields in ferroelectrics. We also find a stable\nuncharged domain wall configutation can reduce band gap which is caused by the\ndomain wall. Our works indicate that domain walls in two-dimensional bismuth\nmay be a good platform for ferroelectric domain wall devices.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 23:55:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Luo","Wei",""],["Zhong","Yang",""],["Yu","Hongyu",""],["Xie","Muting",""],["Chen","Yingwei",""],["Xiang","Hongjun",""],["Bellaiche","Laurent",""]]}
{"id":"2308.04634","submitter":"Stefan Oberd\\\"orster","authors":"Nawaf Bou-Rabee, Stefan Oberd\\\"orster","title":"Mixing of Metropolis-Adjusted Markov Chains via Couplings: The High\n  Acceptance Regime","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a coupling framework to upper bound the total variation mixing\ntime of various Metropolis-adjusted, gradient-based Markov kernels in the `high\nacceptance regime'. The approach uses a localization argument to boost local\nmixing of the underlying unadjusted kernel to mixing of the adjusted kernel\nwhen the acceptance rate is suitably high. As an application, mixing time\nguarantees are developed for a non-reversible, adjusted Markov chain based on\nthe kinetic Langevin diffusion, where little is currently understood.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:06:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bou-Rabee","Nawaf",""],["Oberd\u00f6rster","Stefan",""]]}
{"id":"2308.04635","submitter":"Peter Henderson","authors":"Peter Henderson, Tatsunori Hashimoto, Mark Lemley","title":"Where's the Liability in Harmful AI Speech?","comments":"Published in the Journal of Free Speech Law (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generative AI, in particular text-based \"foundation models\" (large models\ntrained on a huge variety of information including the internet), can generate\nspeech that could be problematic under a wide range of liability regimes.\nMachine learning practitioners regularly \"red team\" models to identify and\nmitigate such problematic speech: from \"hallucinations\" falsely accusing people\nof serious misconduct to recipes for constructing an atomic bomb. A key\nquestion is whether these red-teamed behaviors actually present any liability\nrisk for model creators and deployers under U.S. law, incentivizing investments\nin safety mechanisms. We examine three liability regimes, tying them to common\nexamples of red-teamed model behaviors: defamation, speech integral to criminal\nconduct, and wrongful death. We find that any Section 230 immunity analysis or\ndownstream liability analysis is intimately wrapped up in the technical details\nof algorithm design. And there are many roadblocks to truly finding models (and\ntheir associated parties) liable for generated speech. We argue that AI should\nnot be categorically immune from liability in these scenarios and that as\ncourts grapple with the already fine-grained complexities of platform\nalgorithms, the technical details of generative AI loom above with thornier\nquestions. Courts and policymakers should think carefully about what technical\ndesign incentives they create as they evaluate these issues.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:13:00 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 20:44:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Henderson","Peter",""],["Hashimoto","Tatsunori",""],["Lemley","Mark",""]]}
{"id":"2308.04636","submitter":"Nur Umaisara Rashid","authors":"Nur Umaisara Rashid and Kar Tim Chan","title":"A Review on Transportation Network based on Complex Network Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Complex network theory is being widely used to study many real-life systems.\nOne of the fields that can benefit from complex network theory approach is\ntransportation network. In this paper, we briefly review the complex network\ntheory method assimilated into transportation network research and the analysis\nit provided. It is irrefutable that complex network theory is capable to\nexplain the structure, dynamic, node significance, performance as well as\nevolution of the transportation network.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:16:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rashid","Nur Umaisara",""],["Chan","Kar Tim",""]]}
{"id":"2308.04637","submitter":"Matt Gorbett","authors":"Matt Gorbett, Hossein Shirazi, Indrakshi Ray","title":"Sparse Binary Transformers for Multivariate Time Series Modeling","comments":"Published at KDD '23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compressed Neural Networks have the potential to enable deep learning across\nnew applications and smaller computational environments. However, understanding\nthe range of learning tasks in which such models can succeed is not well\nstudied. In this work, we apply sparse and binary-weighted Transformers to\nmultivariate time series problems, showing that the lightweight models achieve\naccuracy comparable to that of dense floating-point Transformers of the same\nstructure. Our model achieves favorable results across three time series\nlearning tasks: classification, anomaly detection, and single-step forecasting.\nAdditionally, to reduce the computational complexity of the attention\nmechanism, we apply two modifications, which show little to no decline in model\nperformance: 1) in the classification task, we apply a fixed mask to the query,\nkey, and value activations, and 2) for forecasting and anomaly detection, which\nrely on predicting outputs at a single point in time, we propose an attention\nmask to allow computation only at the current time step. Together, each\ncompression technique and attention modification substantially reduces the\nnumber of non-zero operations necessary in the Transformer. We measure the\ncomputational savings of our approach over a range of metrics including\nparameter count, bit size, and floating point operation (FLOPs) count, showing\nup to a 53x reduction in storage size and up to 10.5x reduction in FLOPs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:23:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gorbett","Matt",""],["Shirazi","Hossein",""],["Ray","Indrakshi",""]]}
{"id":"2308.04638","submitter":"Joshua Knights Mr","authors":"Joshua Knights, Stephen Hausler, Sridha Sridharan, Clinton Fookes,\n  Peyman Moghadam","title":"GeoAdapt: Self-Supervised Test-Time Adaption in LiDAR Place Recognition\n  Using Geometric Priors","comments":"Submitted to RA-L","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LiDAR place recognition approaches based on deep learning suffer a\nsignificant degradation in performance when there is a shift between the\ndistribution of the training and testing datasets, with re-training often\nrequired to achieve top performance. However, obtaining accurate ground truth\non new environments can be prohibitively expensive, especially in complex or\nGPS-deprived environments. To address this issue we propose GeoAdapt, which\nintroduces a novel auxiliary classification head to generate pseudo-labels for\nre-training on unseen environments in a self-supervised manner. GeoAdapt uses\ngeometric consistency as a prior to improve the robustness of our generated\npseudo-labels against domain shift, improving the performance and reliability\nof our Test-Time Adaptation approach. Comprehensive experiments show that\nGeoAdapt significantly boosts place recognition performance across moderate to\nsevere domain shifts, and is competitive with fully supervised test-time\nadaptation approaches. Our code will be available at\nhttps://github.com/csiro-robotics/GeoAdapt.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:40:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Knights","Joshua",""],["Hausler","Stephen",""],["Sridharan","Sridha",""],["Fookes","Clinton",""],["Moghadam","Peyman",""]]}
{"id":"2308.04639","submitter":"Tianshu Yu","authors":"Zhang-Hua Fu, Sipeng Sun, Jintong Ren, Tianshu Yu, Haoyu Zhang,\n  Yuanyuan Liu, Lingxiao Huang, Xiang Yan, Pinyan Lu","title":"A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale\n  Travelling Salesman Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For prohibitively large-scale Travelling Salesman Problems (TSPs), existing\nalgorithms face big challenges in terms of both computational efficiency and\nsolution quality. To address this issue, we propose a hierarchical\ndestroy-and-repair (HDR) approach, which attempts to improve an initial\nsolution by applying a series of carefully designed destroy-and-repair\noperations. A key innovative concept is the hierarchical search framework,\nwhich recursively fixes partial edges and compresses the input instance into a\nsmall-scale TSP under some equivalence guarantee. This neat search framework is\nable to deliver highly competitive solutions within a reasonable time. Fair\ncomparisons based on nineteen famous large-scale instances (with 10,000 to\n10,000,000 cities) show that HDR is highly competitive against existing\nstate-of-the-art TSP algorithms, in terms of both efficiency and solution\nquality. Notably, on two large instances with 3,162,278 and 10,000,000 cities,\nHDR breaks the world records (i.e., best-known results regardless of\ncomputation time), which were previously achieved by LKH and its variants,\nwhile HDR is completely independent of LKH. Finally, ablation studies are\nperformed to certify the importance and validity of the hierarchical search\nframework.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:44:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Fu","Zhang-Hua",""],["Sun","Sipeng",""],["Ren","Jintong",""],["Yu","Tianshu",""],["Zhang","Haoyu",""],["Liu","Yuanyuan",""],["Huang","Lingxiao",""],["Yan","Xiang",""],["Lu","Pinyan",""]]}
{"id":"2308.04640","submitter":"Steve Raj Prabu","authors":"S. Prabu, P. Hancock, X. Xiang, and S. J. Tingay","title":"Demonstration of Orbit Determination for LEO Objects using the Murchison\n  Widefield Array","comments":"Accepted in Advances in Space Research. 7 figures and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rapidly increasing number of satellites in Earth's orbit motivates the\ndevelopment of Space Domain Awareness (SDA) capabilities using wide\nfield-of-view sensor systems that can perform simultaneous detections. This\nwork demonstrates preliminary orbit determination capability for Low Earth\nOrbit objects using the Murchison Widefield Array (MWA) at commercial FM\nfrequencies. The developed method was tested on observations of 32 satellite\npasses and the extracted measurements were used to perform orbit determination\nfor the targets using a least-squares fitting approach. The target satellites\nspan a range in altitude and Radar Cross Section, providing examples of both\nhigh and low signal-to-noise detections. The estimated orbital elements for the\nsatellites are validated against the publicly available TLE updates provided by\nthe Space Surveillance Network (SSN) and the preliminary estimates are found to\nbe in close agreement. The work successfully test for re-acquisition using the\ndetermined orbital elements and finds the prediction to improve when multiple\norbits are used for orbit determination. The median uncertainty in the angular\nposition for objects in LEO (range less than 1000 km) is found to be 860 m in\nthe cross-track direction and 780 m in the in-track direction, which are\ncomparable to the typical uncertainty of 1 km in the publicly available TLE.\nThe techniques, therefore, demonstrate the MWA to be capable of being a\nvaluable contributor to the global SDA community. Based on the understanding of\nthe MWA SDA system, this paper also briefly describes methods to mitigate the\nimpact of FM-reflecting LEO satellites on radio astronomy observations, and how\nmaintaining a catalog of FM-reflecting LEO objects is in the best interests of\nboth SDA and radio astronomy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:50:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Prabu","S.",""],["Hancock","P.",""],["Xiang","X.",""],["Tingay","S. J.",""]]}
{"id":"2308.04641","submitter":"Yanbo Song","authors":"Yanbo Song, Tao Feng, Chungang Yang, Xinru Mi, Shanqing Jiang, Mohsen\n  Guizani","title":"IS2N: Intent-Driven Security Software-Defined Network with Blockchain","comments":"Published in: IEEE Network ( Early Access )","journal-ref":null,"doi":"10.1109/MNET.138.2200539","report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software-defined network (SDN) is characterized by its programmability,\nflexibility, and the separation of control and data planes. However, SDN still\nhave many challenges, particularly concerning the security of network\ninformation synchronization and network element registration. Blockchain and\nintent-driven networks are recent technologies to establish secure and\nintelligent SDN. This article investigates the blockchain-based architecture\nand intent-driven mechanisms to implement intent-driven security\nsoftware-defined networks (IS2N). Specifically, we propose a novel four-layer\narchitecture of the IS2N with security capabilities. We integrate an\nintent-driven security management mechanism in the IS2N to achieve automate\nnetwork security management. Finally, we develop an IS2N platform with\nblockchain middle-layer to achieve security capabilities and security store\nnetwork-level snapshots, such as device registration and OpenFlow messages. Our\nsimulations show that IS2N is more flexible than conventional strategies at\nresolving problems during network operations and has a minimal effect on the\nSDN.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:53:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Song","Yanbo",""],["Feng","Tao",""],["Yang","Chungang",""],["Mi","Xinru",""],["Jiang","Shanqing",""],["Guizani","Mohsen",""]]}
{"id":"2308.04642","submitter":"Luis Enrique Padilla Abores","authors":"Tadeo D. Gomez-Aguilar, Luis E. Padilla, Encieh Erfani, and Juan\n  Carlos Hidalgo","title":"Constraints on primordial black holes for nonstandard cosmologies","comments":"9 figures.Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study how the bounds on the abundance of Primordial Black Holes (PBHs) and\nthe constraints to the power spectrum (PS) are modified if a non-standard\nevolution phase takes place between the end of inflation and the Standard Big\nBang (SBB). The constraints on PBH abundance and PS are computed using the new,\nfreely available, PBHBeta library, which accounts for the effects of\nnon-standard expansion and specific criteria for PBH formation. As working\nexamples, we consider three different scenarios: a pure matter-dominated (MD)\nphase, a scalar field-dominated (SFD) universe, and a stiff fluid-dominated\n(SD) scenario. While the background expansion is the same for the MD and SFD\nscenarios, the PBH formation criteria lead to different constraints to the PS.\nAdditionally, the duration of the non-standard expansion phase alters the\nbounds, with longer MD periods resulting in weaker constraints on the PS, and\nlonger SD scenarios leading to an enhanced abundance due to the dust-like\nredshifting of PBHs. The modifications to the constraints are reported in all\ncases, and we highlight those where the PS may be significantly more\nconstrained.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:53:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gomez-Aguilar","Tadeo D.",""],["Padilla","Luis E.",""],["Erfani","Encieh",""],["Hidalgo","Juan Carlos",""]]}
{"id":"2308.04643","submitter":"Shubhang Bhatnagar","authors":"Shubhang Bhatnagar, Sharath Gopal, Narendra Ahuja, Liu Ren","title":"Long-Distance Gesture Recognition using Dynamic Neural Networks","comments":"Accepted to IEEE/RSJ International Conference on Intelligent Robots\n  and Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC cs.RO eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gestures form an important medium of communication between humans and\nmachines. An overwhelming majority of existing gesture recognition methods are\ntailored to a scenario where humans and machines are located very close to each\nother. This short-distance assumption does not hold true for several types of\ninteractions, for example gesture-based interactions with a floor cleaning\nrobot or with a drone. Methods made for short-distance recognition are unable\nto perform well on long-distance recognition due to gestures occupying only a\nsmall portion of the input data. Their performance is especially worse in\nresource constrained settings where they are not able to effectively focus\ntheir limited compute on the gesturing subject. We propose a novel, accurate\nand efficient method for the recognition of gestures from longer distances. It\nuses a dynamic neural network to select features from gesture-containing\nspatial regions of the input sensor data for further processing. This helps the\nnetwork focus on features important for gesture recognition while discarding\nbackground features early on, thus making it more compute efficient compared to\nother techniques. We demonstrate the performance of our method on the LD-ConGR\nlong-distance dataset where it outperforms previous state-of-the-art methods on\nrecognition accuracy and compute efficiency.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:56:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bhatnagar","Shubhang",""],["Gopal","Sharath",""],["Ahuja","Narendra",""],["Ren","Liu",""]]}
{"id":"2308.04644","submitter":"Xiao-Yun Wang","authors":"Xiao-Yun Wang, Fancong Zeng","title":"Gravitational form factors of the proton from near-threshold vector\n  meson photoproduction","comments":"6 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 embark on a systematical analysis of the quark and gluon gravitational\nform factors (GFFs) of the proton, by connecting energy-momentum tensor and the\nnear-threshold vector meson photoproduction (NTVMP). Concretely, the quark\ncontributions of GFFs are determined unprecedentedly by global fitting the\ncross section of the lightest vector meson $\\rho^0$ photoproduction. Combined\nwith the gluon GFFs achieved from heavy quarkonium $J/\\psi$ photoproduction\ndata, the complete GFFs are obtained and compared with the deeply virtual\nCompton scattering experimental results and LQCD determinations. The profound\nimplications of this finding cannot be overstated, as it opens new avenues for\nobtaining comprehensive information on GFFs. Naturally, this work is not only\nan important basis for delving the proton enigmatic properties, % unraveling\nthe secrets of the proton internal nature but also have significance\ntheoretical guiding for future JLab and EICs experimental measurements.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:59:20 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Xiao-Yun",""],["Zeng","Fancong",""]]}
{"id":"2308.04645","submitter":"Ercong Nie","authors":"Ercong Nie, Helmut Schmid, Hinrich Sch\\\"utze","title":"Cross-Lingual Constituency Parsing for Middle High German: A\n  Delexicalized Approach","comments":"Accepted to ALP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Constituency parsing plays a fundamental role in advancing natural language\nprocessing (NLP) tasks. However, training an automatic syntactic analysis\nsystem for ancient languages solely relying on annotated parse data is a\nformidable task due to the inherent challenges in building treebanks for such\nlanguages. It demands extensive linguistic expertise, leading to a scarcity of\navailable resources. To overcome this hurdle, cross-lingual transfer techniques\nwhich require minimal or even no annotated data for low-resource target\nlanguages offer a promising solution. In this study, we focus on building a\nconstituency parser for $\\mathbf{M}$iddle $\\mathbf{H}$igh $\\mathbf{G}$erman\n($\\mathbf{MHG}$) under realistic conditions, where no annotated MHG treebank is\navailable for training. In our approach, we leverage the linguistic continuity\nand structural similarity between MHG and $\\mathbf{M}$odern $\\mathbf{G}$erman\n($\\mathbf{MG}$), along with the abundance of MG treebank resources.\nSpecifically, by employing the $\\mathit{delexicalization}$ method, we train a\nconstituency parser on MG parse datasets and perform cross-lingual transfer to\nMHG parsing. Our delexicalized constituency parser demonstrates remarkable\nperformance on the MHG test set, achieving an F1-score of 67.3%. It outperforms\nthe best zero-shot cross-lingual baseline by a margin of 28.6% points. These\nencouraging results underscore the practicality and potential for automatic\nsyntactic analysis in other ancient languages that face similar challenges as\nMHG.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:02:06 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:09:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nie","Ercong",""],["Schmid","Helmut",""],["Sch\u00fctze","Hinrich",""]]}
{"id":"2308.04646","submitter":"Jennifer Welch","authors":"Hagit Attiya, Jennifer L. Welch","title":"Multi-Valued Connected Consensus: A New Perspective on Crusader\n  Agreement and Adopt-Commit","comments":"38 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Algorithms to solve fault-tolerant consensus in asynchronous systems often\nrely on primitives such as crusader agreement, adopt-commit, and graded\nbroadcast, which provide weaker agreement properties than consensus. Although\nthese primitives have a similar flavor, they have been defined and implemented\nseparately in ad hoc ways. We propose a new problem called connected consensus\nthat has as special cases crusader agreement, adopt-commit, and graded\nbroadcast, and generalizes them to handle multi-valued inputs. The\ngeneralization is accomplished by relating the problem to approximate agreement\non graphs.\n  We present three algorithms for multi-valued connected consensus in\nasynchronous message-passing systems, one tolerating crash failures and two\ntolerating malicious (unauthenticated Byzantine) failures. We extend the\ndefinition of binding, a desirable property recently identified as supporting\nbinary consensus algorithms that are correct against adaptive adversaries, to\nthe multi-valued input case and show that all our algorithms satisfy the\nproperty. Our crash-resilient algorithm has failure-resilience and time\ncomplexity that we show are optimal. When restricted to the case of binary\ninputs, the algorithm has improved time complexity over prior algorithms. Our\ntwo algorithms for malicious failures trade off failure resilience and time\ncomplexity. The first algorithm has time complexity that we prove is optimal\nbut worse failure-resilience, while the second has failure-resilience that we\nprove is optimal but worse time complexity. When restricted to the case of\nbinary inputs, the time complexity (as well as resilience) of the second\nalgorithm matches that of prior algorithms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:08:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Attiya","Hagit",""],["Welch","Jennifer L.",""]]}
{"id":"2308.04647","submitter":"Ritesh Patel","authors":"Purvi Udhwani, Arpit Kumar Shrivastav, Ritesh Patel","title":"SITCoM: SiRGraF Integrated Tool for Coronal dynaMics","comments":"17 pages, 9 figure, To appear in Frontiers in Astronomy and Space\n  Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  SiRGraF Integrated Tool for Coronal dynaMics (SITCoM) is based on Simple\nRadial Gradient Filter (SiRGraF) used to filter the radial gradient in the\nwhite-light coronagraph images and bring out dynamic structures. SITCoM has\nbeen developed in Python and integrated with SunPy and can be installed by\nusers with the command pip install sitcom. This enables the user to pass the\nwhite-light coronagraph data to the tool and generate radially filtered output\nwith an option to save in various formats as required. We have implemented the\nfunctionality of tracking the transients such as coronal mass ejections (CMEs),\noutflows, plasma blobs, etc., using height-time plots and deriving their\nkinematics. In addition, SITCoM also supports oscillation and waves studies\nsuch as for streamer waves. This is done by creating a distance-time plot at a\nuser-defined location (artificial slice) and fitting a sinusoidal function to\nderive the properties of waves, such as time period, amplitude, and damping\ntime (if any). We provide the provision to manually or automatically select the\ndata points to be used for fitting. SITCoM is a tool to analyze some properties\nof coronal dynamics quickly. We present an overview of the SITCoM with the\napplications for deriving coronal dynamics' kinematics and oscillation\nproperties. We discuss the limitations of this tool along with prospects for\nfuture improvement.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:20:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Udhwani","Purvi",""],["Shrivastav","Arpit Kumar",""],["Patel","Ritesh",""]]}
{"id":"2308.04648","submitter":"Dongfang Zhao","authors":"Dongfang Zhao","title":"Communication-Efficient Search under Fully Homomorphic Encryption for\n  Federated Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Homomorphic encryption (HE) has found extensive utilization in federated\nlearning (FL) systems, capitalizing on its dual advantages: (i) ensuring the\nconfidentiality of shared models contributed by participating entities, and\n(ii) enabling algebraic operations directly on ciphertexts representing\nencrypted models. Particularly, the approximate fully homomorphic encryption\n(FHE) scheme, known as CKKS, has emerged as the de facto encryption scheme,\nnotably supporting decimal numbers. While recent research predominantly focuses\non enhancing CKKS's encryption rate and evaluation speed in the context of FL,\nthe search operation has been relatively disregarded due to the tendency of\nsome applications to discard intermediate encrypted models. Yet, emerging\nstudies emphasize the importance of managing and searching intermediate models\nfor specific applications like large-scale scientific computing, necessitating\nrobust data provenance and auditing support. To address this, our paper\nintroduces an innovative approach that efficiently searches for a target\nencrypted value, incurring only a logarithmic number of network interactions.\nThe proposed method capitalizes on CKKS's additive and multiplicative\nproperties on encrypted models, propagating equality comparisons between values\nthrough a balanced binary tree structure to ultimately reach a single\naggregate. A comprehensive analysis of the proposed algorithm underscores its\npotential to significantly broaden FL's applicability and impact.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:24:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhao","Dongfang",""]]}
{"id":"2308.04649","submitter":"Kin Fai Wong","authors":"Benny Wong","title":"Enhancing Optimization Performance: A Novel Hybridization of Gaussian\n  Crunching Search and Powell's Method for Derivative-Free Optimization","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research paper presents a novel approach to enhance optimization\nperformance through the hybridization of Gaussian Crunching Search (GCS) and\nPowell's Method for derivative-free optimization. While GCS has shown promise\nin overcoming challenges faced by traditional derivative-free optimization\nmethods [1], it may not always excel in finding the local minimum. On the other\nhand, some traditional methods may have better performance in this regard.\nHowever, GCS demonstrates its strength in escaping the trap of local minima and\napproaching the global minima. Through experimentation, we discovered that by\ncombining GCS with certain traditional derivative-free optimization methods, we\ncan significantly boost performance while retaining the respective advantages\nof each method. This hybrid approach opens up new possibilities for optimizing\ncomplex systems and finding optimal solutions in a range of applications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:27:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wong","Benny",""]]}
{"id":"2308.04650","submitter":"Hyewon Jeong","authors":"Hyewon Jeong, Collin M. Stultz, Marzyeh Ghassemi","title":"Deep Metric Learning for the Hemodynamics Inference with\n  Electrocardiogram Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Heart failure is a debilitating condition that affects millions of people\nworldwide and has a significant impact on their quality of life and mortality\nrates. An objective assessment of cardiac pressures remains an important method\nfor the diagnosis and treatment prognostication for patients with heart\nfailure. Although cardiac catheterization is the gold standard for estimating\ncentral hemodynamic pressures, it is an invasive procedure that carries\ninherent risks, making it a potentially dangerous procedure for some patients.\nApproaches that leverage non-invasive signals - such as electrocardiogram (ECG)\n- have the promise to make the routine estimation of cardiac pressures feasible\nin both inpatient and outpatient settings. Prior models trained to estimate\nintracardiac pressures (e.g., mean pulmonary capillary wedge pressure (mPCWP))\nin a supervised fashion have shown good discriminatory ability but have been\nlimited to the labeled dataset from the heart failure cohort. To address this\nissue and build a robust representation, we apply deep metric learning (DML)\nand propose a novel self-supervised DML with distance-based mining that\nimproves the performance of a model with limited labels. We use a dataset that\ncontains over 5.4 million ECGs without concomitant central pressure labels to\npre-train a self-supervised DML model which showed improved classification of\nelevated mPCWP compared to self-supervised contrastive baselines. Additionally,\nthe supervised DML model that is using ECGs with access to 8,172 mPCWP labels\ndemonstrated significantly better performance on the mPCWP regression task\ncompared to the supervised baseline. Moreover, our data suggest that DML yields\nmodels that are performant across patient subgroups, even when some patient\nsubgroups are under-represented in the dataset. Our code is available at\nhttps://github.com/mandiehyewon/ssldml\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:30:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jeong","Hyewon",""],["Stultz","Collin M.",""],["Ghassemi","Marzyeh",""]]}
{"id":"2308.04651","submitter":"Kota Mitsumoto","authors":"Kota Mitsumoto and Kyohei Takae","title":"Adsorption superlattice stabilized by elastic interactions in a soft\n  porous crystal","comments":"9 pages, 5 figures. arXiv admin note: text overlap with\n  arXiv:2211.03370","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We numerically show that molecules adsorbed in a soft porous crystal form a\nsuperlattice (SL) stabilized by elastic interactions. In a mechanically\nflexible honeycomb lattice model, when the elastic interactions between the\nnext nearest neighboring lattice sites are strong, a long-range ordered\n1/3-filling SL state emerges. By calculating the thermodynamic stability, it is\nfound that the SL state is robust against thermal fluctuation. Our results\nprovide a mechanism of elasticity-driven SL formation, which can be utilized\nfor controlling the distribution of adsorbed molecules.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:30:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mitsumoto","Kota",""],["Takae","Kyohei",""]]}
{"id":"2308.04652","submitter":"Varun Kulkarni","authors":"K. R. Rajesh, V. Kulkarni, S. Vankeswaram, R. Sakthikumar, S.\n  Deivandren","title":"Drop size characteristics of sprays emanating from circular and\n  non-circular orifices in the atomization regime","comments":null,"journal-ref":null,"doi":"10.1016/j.jaerosci.2023.106245","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traditionally, circular orifices have been used for generating aerosols,\nhowever in recent times non-circular orifices are being considered due to their\nsuperior atomization and mixing features. In this work, we experimentally\ninvestigate spray morphology and drop size characteristics of kerosene (Jet\nA-1) jets issuing from three non-circular orifices geometries (elliptic,\ntriangular and, square) and one circular orifice with the same exit cross\nsectional area. Our results show an unexpected and yet unreported coarsening of\natomization for non-circular orifice jets quantified by an increase in the\nSauter Mean Diameter (SMD) at all tested exit velocities represented by the\nliquid Weber number, $We_l$. We attribute this to two distinct spray\nmorphologies: filament and core breakup which generate large size liquid\nstructures identified as filaments and ligaments, noticeable in non-circular\norifices jets compared to circular orifice jets. On exploring this further by\nundertaking an examination of the drop size volume probability distribution at\nlower $We_l$ corresponding to the location marking the end of primary breakup\nwe see a bimodality due to a dominant distribution of fragments of small and\nlarger sizes owing to the spray morphology. At higher $We_l$ and larger\ndistances from the injector exit we observe the bimodality converts to a\nunimodal distribution for all orifice jets with a single peak situated at lower\ndrop diameters. Filament breakup is reasoned to be the cause of higher number\nof smaller drop sizes in triangular sprays among all non-circular orifice jets\nwhile thinner filaments in circular orifice sprays lead to smaller drop sizes\ncompared to their triangular counterparts showing the same breakup morphology.\nWe expect our results to help applications as diverse as engine fuel\ncombustion, pharmaceutical sprays and CO$_2$ capture by NaOH sprays.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:37:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rajesh","K. R.",""],["Kulkarni","V.",""],["Vankeswaram","S.",""],["Sakthikumar","R.",""],["Deivandren","S.",""]]}
{"id":"2308.04653","submitter":"Gilberto Ochoa-Ruiz","authors":"Pablo Cesar Quihui-Rubio and Daniel Flores-Araiza and Gilberto\n  Ochoa-Ruiz and Miguel Gonzalez-Mendoza and Christian Mata","title":"Assessing the performance of deep learning-based models for prostate\n  cancer segmentation using uncertainty scores","comments":"Article accepted at Cancer Prevention through early detecTion\n  (CaPtTion) workshop at MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on comparing deep learning methods for the segmentation\nand quantification of uncertainty in prostate segmentation from MRI images. The\naim is to improve the workflow of prostate cancer detection and diagnosis.\nSeven different U-Net-based architectures, augmented with Monte-Carlo dropout,\nare evaluated for automatic segmentation of the central zone, peripheral zone,\ntransition zone, and tumor, with uncertainty estimation. The top-performing\nmodel in this study is the Attention R2U-Net, achieving a mean Intersection\nover Union (IoU) of 76.3% and Dice Similarity Coefficient (DSC) of 85% for\nsegmenting all zones. Additionally, Attention R2U-Net exhibits the lowest\nuncertainty values, particularly in the boundaries of the transition zone and\ntumor, when compared to the other models.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:38:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Quihui-Rubio","Pablo Cesar",""],["Flores-Araiza","Daniel",""],["Ochoa-Ruiz","Gilberto",""],["Gonzalez-Mendoza","Miguel",""],["Mata","Christian",""]]}
{"id":"2308.04654","submitter":"Ryan Grady","authors":"Heather Abramson, Eric Chesebro, Vivian Cummins, Cory Emlen, Kenton\n  Ke, and Ryan Grady","title":"Continued fractions and lines across the Stern--Brocot diagram","comments":"11 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper concerns the relationships between continued fractions and the\ngeometry of the Stern-Brocot diagram. Each rational number can be expressed as\na continued fraction $[a_0; a_1, \\ldots, a_n]$ whose terms $a_i$ are integers\nand are positive if $i \\geq 1$. Select an index $i \\in \\{ 1, \\ldots, n \\}$ and\nreplace $a_i$ with an integer $m$ to obtain a continued fraction expansion for\nan extended rational $\\alpha_m \\in \\mathbb{Q} \\cup \\{ \\infty \\}$. This paper\nshows that the vertices of the Stern-Brocot diagram corresponding to the\nnumbers $\\{ \\alpha_m \\}_{m \\in \\mathbb{Z}}$ lie on a pair of (extended)\nEuclidean lines across the diagram. The slopes of these two lines differ only\nby a sign change and they meet at the point $L=\\left([a_0; a_1, \\ldots,\na_{i-1}], 0\\right) \\in \\mathbb{R}^2$. Moreover, as $\\lvert m \\rvert \\to\n\\infty$, the associated vertices move down these lines and converge to $L$.\nThis paper concludes with a discussion which interprets this result in the\ncontext of 2-bridge link complements and Thurston's work on hyperbolic Dehn\nsurgery.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:43:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Abramson","Heather",""],["Chesebro","Eric",""],["Cummins","Vivian",""],["Emlen","Cory",""],["Ke","Kenton",""],["Grady","Ryan",""]]}
{"id":"2308.04655","submitter":"Gabriel Lando","authors":"Gabriel M. Lando, Olivier Giraud, Denis Ullmo","title":"Computing Quantum Mean Values in the Deep Chaotic Regime","comments":"5+7 pages, 3+3 figures. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the time evolution of mean values of quantum operators in a regime\nplagued by two difficulties: The smallness of $\\hbar$ and the presence of\nstrong and ubiquitous classical chaos. While numerics become too\ncomputationally expensive for purely quantum calculations as $\\hbar \\to 0$,\nmethods that take advantage of the smallness of $\\hbar$ -- that is,\nsemiclassical methods -- suffer from both conceptual and practical difficulties\nin the deep chaotic regime. We implement an approach which addresses these\nconceptual problems, leading to a deeper understanding of the origin of the\ninterference contributions to the operator's mean value. We show that in the\ndeep chaotic regime our approach is capable of unprecedented accuracy, while a\ntypical semiclassical method (the Herman-Kluk propagator) produces only\nnumerical noise. Our work paves the way to the development and employment of\nmore efficient and accurate methods for quantum simulations of systems with\nstrongly chaotic classical limits.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:45:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lando","Gabriel M.",""],["Giraud","Olivier",""],["Ullmo","Denis",""]]}
{"id":"2308.04656","submitter":"Ulrich Jentschura","authors":"Ulrich D. Jentschura","title":"Revisiting the Divergent Multipole Expansion of Atom--Surface\n  Interactions with an Emphasis on alpha-Quartz, Hydrogen and Positronium","comments":"11 pages; RevTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the derivation of multipole contributions to the atom-wall\ninteraction previously presented in [G. Lach et al., Phys.Rev.A 81 (2010)\n052507]. A careful reconsideration of the angular-momentum decomposition of the\nsecond-, third- and fourth-rank tensors composed of the derivatives of the\nelectric-field modes leads to a modification for the results for the\nquadrupole, octupole and hexadecupole contributions to the atom-wall\ninteraction. Asymptotic results are given for the asymptotic long-range forms\nof the multipole terms, in both the short-range and long-range limits.\nCalculations are carried out for hydrogen and positronium in contact with\n$\\alpha$-quartz; a reanalysis of analytic models of the dielectric function of\n$\\alpha$-quartz is performed. Analytic results are provided for the multipole\npolarizabilities of hydrogen and positronium. The quadrupole correction is\nshown to be numerically significant for the atom-surface interaction of\npositronium, both for a perfect conductor as well as for interactions with\nalpha-quartz. The expansion into multipoles is shown to constitute a divergent,\nasymptotic series.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:48:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jentschura","Ulrich D.",""]]}
{"id":"2308.04657","submitter":"Joakim Bruslund Haurum","authors":"Joakim Bruslund Haurum, Sergio Escalera, Graham W. Taylor, Thomas B.\n  Moeslund","title":"Which Tokens to Use? Investigating Token Reduction in Vision\n  Transformers","comments":"ICCV 2023 NIVT Workshop. Project webpage https://vap.aau.dk/tokens","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the introduction of the Vision Transformer (ViT), researchers have\nsought to make ViTs more efficient by removing redundant information in the\nprocessed tokens. While different methods have been explored to achieve this\ngoal, we still lack understanding of the resulting reduction patterns and how\nthose patterns differ across token reduction methods and datasets. To close\nthis gap, we set out to understand the reduction patterns of 10 different token\nreduction methods using four image classification datasets. By systematically\ncomparing these methods on the different classification tasks, we find that the\nTop-K pruning method is a surprisingly strong baseline. Through in-depth\nanalysis of the different methods, we determine that: the reduction patterns\nare generally not consistent when varying the capacity of the backbone model,\nthe reduction patterns of pruning-based methods significantly differ from fixed\nradial patterns, and the reduction patterns of pruning-based methods are\ncorrelated across classification datasets. Finally we report that the\nsimilarity of reduction patterns is a moderate-to-strong proxy for model\nperformance. Project page at https://vap.aau.dk/tokens.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:51:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Haurum","Joakim Bruslund",""],["Escalera","Sergio",""],["Taylor","Graham W.",""],["Moeslund","Thomas B.",""]]}
{"id":"2308.04658","submitter":"Benjamin Lowe","authors":"Benjamin Lowe, Jack Hellerstedt, Adam Mat\\v{e}j, Pingo Mutombo,\n  Dhaneesh Kumar, Martin Ondr\\'a\\v{c}ek, Pavel Jelinek, and Agustin Schiffrin","title":"Selective Activation of Aromatic C-H Bonds Catalyzed by Single Gold\n  Atoms at Room Temperature","comments":"Main: 28 pages, 5 figures, 1 TOC figure and SI: 32 pages, 16 figures","journal-ref":"J. Am. Chem. Soc. 2022, 144, 46, 21389-21397","doi":"10.1021/jacs.2c10154","report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Selective activation and controlled functionalization of C-H bonds in organic\nmolecules is one of the most desirable processes in synthetic chemistry.\nDespite progress in heterogeneous catalysis using metal surfaces, this goal\nremains challenging due to the stability of C-H bonds and their ubiquity in\nprecursor molecules, hampering regioselectivity. Here, we examine the\ninteraction between 9,10-dicyanoanthracene (DCA) molecules and Au adatoms on a\nAg(111) surface at room temperature (RT). Characterization via low-temperature\nscanning tunneling microscopy, spectroscopy, and noncontact atomic force\nmicroscopy, supported by theoretical calculations, revealed the formation of\norganometallic DCA-Au-DCA dimers, where C atoms at the ends of the anthracene\nmoieties are bonded covalently to single Au atoms. The formation of this\norganometallic compound is initiated by a regioselective cleaving of C-H bonds\nat RT. Hybrid quantum mechanics/molecular mechanics calculations show that this\nregioselective C-H bond cleaving is enabled by an intermediate metal-organic\ncomplex which significantly reduces the dissociation barrier of a specific C-H\nbond. Harnessing the catalytic activity of single metal atoms, this\nregioselective on-surface C-H activation reaction at RT offers promising routes\nfor future synthesis of functional organic and organometallic materials.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:52:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lowe","Benjamin",""],["Hellerstedt","Jack",""],["Mat\u011bj","Adam",""],["Mutombo","Pingo",""],["Kumar","Dhaneesh",""],["Ondr\u00e1\u010dek","Martin",""],["Jelinek","Pavel",""],["Schiffrin","Agustin",""]]}
{"id":"2308.04659","submitter":"Xiu-Xiu Zhan","authors":"Tao Xu, Xiaowen Xie, Zi-Ke Zhang, Chuang Liu, Xiu-Xiu Zhan","title":"A hyper-distance-based method for hypernetwork comparison","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hypernetwork is a useful way to depict multiple connections between nodes,\nmaking it an ideal tool for representing complex relationships in network\nscience. In recent years, there has been a marked increase in studies on\nhypernetworks, however, the comparison of the difference between two\nhypernetworks has been given less attention. This paper proposes a\nhyper-distance-based method (HD) for comparing hypernetworks. This method takes\ninto account high-order information, such as the high-order distance between\nnodes. The experiments carried out on synthetic hypernetworks have shown that\nHD is capable of distinguishing between hypernetworks generated with different\nparameters, and it is successful in the classification of hypernetworks.\nFurthermore, HD outperforms current state-of-the-art baselines to distinguish\nempirical hypernetworks when hyperedges are disrupted.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:54:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xu","Tao",""],["Xie","Xiaowen",""],["Zhang","Zi-Ke",""],["Liu","Chuang",""],["Zhan","Xiu-Xiu",""]]}
{"id":"2308.04660","submitter":"Wenlong Lyu","authors":"Wenlong Lyu, Shoubo Hu, Jie Chuai, Zhitang Chen","title":"Efficient Bayesian Optimization with Deep Kernel Learning and\n  Transformer Pre-trained on Multiple Heterogeneous Datasets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bayesian optimization (BO) is widely adopted in black-box optimization\nproblems and it relies on a surrogate model to approximate the black-box\nresponse function. With the increasing number of black-box optimization tasks\nsolved and even more to solve, the ability to learn from multiple prior tasks\nto jointly pre-train a surrogate model is long-awaited to further boost\noptimization efficiency. In this paper, we propose a simple approach to\npre-train a surrogate, which is a Gaussian process (GP) with a kernel defined\non deep features learned from a Transformer-based encoder, using datasets from\nprior tasks with possibly heterogeneous input spaces. In addition, we provide a\nsimple yet effective mix-up initialization strategy for input tokens\ncorresponding to unseen input variables and therefore accelerate new tasks'\nconvergence. Experiments on both synthetic and real benchmark problems\ndemonstrate the effectiveness of our proposed pre-training and transfer BO\nstrategy over existing methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:56:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lyu","Wenlong",""],["Hu","Shoubo",""],["Chuai","Jie",""],["Chen","Zhitang",""]]}
{"id":"2308.04661","submitter":"Shangde Gao","authors":"Shangde Gao, Ke Liu, Yichao Fu","title":"Unified Matrix Factorization with Dynamic Multi-view Clustering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Matrix factorization (MF) is a classical collaborative filtering algorithm\nfor recommender systems. It decomposes the user-item interaction matrix into a\nproduct of low-dimensional user representation matrix and item representation\nmatrix. In typical recommendation scenarios, the user-item interaction paradigm\nis usually a two-stage process and requires static clustering analysis of the\nobtained user and item representations. The above process, however, is time and\ncomputationally intensive, making it difficult to apply in real-time to\ne-commerce or Internet of Things environments with billions of users and\ntrillions of items. To address this, we propose a unified matrix factorization\nmethod based on dynamic multi-view clustering (MFDMC) that employs an\nend-to-end training paradigm. Specifically, in each view, a user/item\nrepresentation is regarded as a weighted projection of all clusters. The\nrepresentation of each cluster is learnable, enabling the dynamic discarding of\nbad clusters. Furthermore, we employ multi-view clustering to represent\nmultiple roles of users/items, effectively utilizing the representation space\nand improving the interpretability of the user/item representations for\ndownstream tasks. Extensive experiments show that our proposed MFDMC achieves\nstate-of-the-art performance on real-world recommendation datasets.\nAdditionally, comprehensive visualization and ablation studies interpretably\nconfirm that our method provides meaningful representations for downstream\ntasks of users/items.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:58:28 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 03:30:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gao","Shangde",""],["Liu","Ke",""],["Fu","Yichao",""]]}
{"id":"2308.04662","submitter":"Tianyu Chen","authors":"Tianyu Chen, Lin Li, Liuchuan Zhu, Zongyang Li, Guangtai Liang, Ding\n  Li, Qianxiang Wang, Tao Xie","title":"VulLibGen: Identifying Vulnerable Third-Party Libraries via Generative\n  Pre-Trained Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To avoid potential risks posed by vulnerabilities in third-party libraries,\nsecurity researchers maintain vulnerability databases (e.g., NVD) containing\nvulnerability reports, each of which records the description of a vulnerability\nand the name list of libraries affected by the vulnerability (a.k.a. vulnerable\nlibraries). However, recent studies on about 200,000 vulnerability reports in\nNVD show that 53.3% of these reports do not include the name list of vulnerable\nlibraries, and 59.82% of the included name lists of vulnerable libraries are\nincomplete or incorrect.\n  To address the preceding issue, in this paper, we propose the first\ngenerative approach named VulLibGen to generate the name list of vulnerable\nlibraries (out of all the existing libraries) for the given vulnerability by\nutilizing recent enormous advances in Large Language Models (LLMs), in order to\nachieve high accuracy. VulLibGen takes only the description of a vulnerability\nas input and achieves high identification accuracy based on LLMs' prior\nknowledge of all the existing libraries. VulLibGen also includes the input\naugmentation technique to help identify zero-shot vulnerable libraries (those\nnot occurring during training) and the post-processing technique to help\naddress VulLibGen's hallucinations. We evaluate VulLibGen using three\nstate-of-the-art/practice approaches (LightXML, Chronos, and VulLibMiner) that\nidentify vulnerable libraries on an open-source dataset (VulLib). Our\nevaluation results show that VulLibGen can accurately identify vulnerable\nlibraries with an average F1 score of 0.626 while the state-of-the-art/practice\napproaches achieve only 0.561. The post-processing technique helps VulLibGen\nachieve an average improvement of F1@1 by 9.3%. The input augmentation\ntechnique helps VulLibGen achieve an average improvement of F1@1 by 39% in\nidentifying zero-shot libraries.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:02:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Tianyu",""],["Li","Lin",""],["Zhu","Liuchuan",""],["Li","Zongyang",""],["Liang","Guangtai",""],["Li","Ding",""],["Wang","Qianxiang",""],["Xie","Tao",""]]}
{"id":"2308.04663","submitter":"Yuan Jin","authors":"Wentao Zhu and Yuan Jin and Gege Ma and Geng Chen and Jan Egger and\n  Shaoting Zhang and Dimitris N. Metaxas","title":"Classification of lung cancer subtypes on CT images with synthetic\n  pathological priors","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The accurate diagnosis on pathological subtypes for lung cancer is of\nsignificant importance for the follow-up treatments and prognosis managements.\nIn this paper, we propose self-generating hybrid feature network (SGHF-Net) for\naccurately classifying lung cancer subtypes on computed tomography (CT) images.\nInspired by studies stating that cross-scale associations exist in the image\npatterns between the same case's CT images and its pathological images, we\ninnovatively developed a pathological feature synthetic module (PFSM), which\nquantitatively maps cross-modality associations through deep neural networks,\nto derive the \"gold standard\" information contained in the corresponding\npathological images from CT images. Additionally, we designed a radiological\nfeature extraction module (RFEM) to directly acquire CT image information and\nintegrated it with the pathological priors under an effective feature fusion\nframework, enabling the entire classification model to generate more indicative\nand specific pathologically related features and eventually output more\naccurate predictions. The superiority of the proposed model lies in its ability\nto self-generate hybrid features that contain multi-modality image information\nbased on a single-modality input. To evaluate the effectiveness, adaptability,\nand generalization ability of our model, we performed extensive experiments on\na large-scale multi-center dataset (i.e., 829 cases from three hospitals) to\ncompare our model and a series of state-of-the-art (SOTA) classification\nmodels. The experimental results demonstrated the superiority of our model for\nlung cancer subtypes classification with significant accuracy improvements in\nterms of accuracy (ACC), area under the curve (AUC), and F1 score.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:04:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Wentao",""],["Jin","Yuan",""],["Ma","Gege",""],["Chen","Geng",""],["Egger","Jan",""],["Zhang","Shaoting",""],["Metaxas","Dimitris N.",""]]}
{"id":"2308.04664","submitter":"Yoh Yamamoto","authors":"Selim Romero, Yoh Yamamoto, Tunna Baruah, Rajendra R. Zope","title":"Complexity reduction in self-interaction-free density functional\n  calculations using the Fermi-L\\\"owdin self-interaction correction method","comments":"14 pages, 5 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fermi-L\\\"owdin (FLO) self-interaction-correction (SIC) (FLOSIC) method uses\nsymmetric orthogonalized Fermi orbitals as localized orbitals in one-electron\nSIC schemes resulting in a formal reduction in the scaling of SIC methods (e.g.\nPerdew-Zunger SIC (PZSIC) method) but requires a set of Fermi orbital\ndescriptors used to define the FLOs which can be computationally taxing. Here,\nwe propose to simplify the SIC calculations using a selective orbital scaling\nself-interaction correction (SOSIC) by removing SIE from a select set of\norbitals that are of interest. We illustrate the approach by choosing a valence\nset of orbitals as active orbitals in the SOSIC approach. The results obtained\nusing the vSOSIC scheme are compared with those obtained with PZSIC which\ncorrects for SIE of all orbitals. The comparison is made for atomization\nenergies, barrier heights, ionization energies (absolute highest occupied\norbital [HOO] eigenvalues), exchange coupling constant and spin densities of\nCu-containing complexes, and vertical detachment energies (VDE) of water\ncluster anions. The agreement between the two methods is within a few percent\nfor the majority of the properties. The MAE in the VDE (absolute HOO\neigenvalue) of water cluster anions with vSOSIC-PBE with respect to benchmark\nCCSD(T) results is only 15 meV making vSOSIC-PBE an excellent alternative to\nthe CCSD(T) to obtain the VDE of water cluster anions. The vSOSIC calculation\non [Cu$_2$Cl$_6$]$^{2-}$ complex demonstrates that, in addition to the cost\nsavings from using fewer orbitals to account for SIC, the FOD optimization in\nvSOSIC is also substantially smoother and faster.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:11:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Romero","Selim",""],["Yamamoto","Yoh",""],["Baruah","Tunna",""],["Zope","Rajendra R.",""]]}
{"id":"2308.04665","submitter":"Yongzhu Chang","authors":"Yongzhu Chang, Rongsheng Zhang, Lin Jiang, Qihang Chen, Le Zhang,\n  Jiashu Pu","title":"Sudowoodo: a Chinese Lyric Imitation System with Source Lyrics","comments":"7 pages,3 figures, submit to emnlp 2023 demo track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lyrics generation is a well-known application in natural language generation\nresearch, with several previous studies focusing on generating accurate lyrics\nusing precise control such as keywords, rhymes, etc. However, lyrics imitation,\nwhich involves writing new lyrics by imitating the style and content of the\nsource lyrics, remains a challenging task due to the lack of a parallel corpus.\nIn this paper, we introduce \\textbf{\\textit{Sudowoodo}}, a Chinese lyrics\nimitation system that can generate new lyrics based on the text of source\nlyrics. To address the issue of lacking a parallel training corpus for lyrics\nimitation, we propose a novel framework to construct a parallel corpus based on\na keyword-based lyrics model from source lyrics. Then the pairs \\textit{(new\nlyrics, source lyrics)} are used to train the lyrics imitation model. During\nthe inference process, we utilize a post-processing module to filter and rank\nthe generated lyrics, selecting the highest-quality ones. We incorporated audio\ninformation and aligned the lyrics with the audio to form the songs as a bonus.\nThe human evaluation results show that our framework can perform better lyric\nimitation. Meanwhile, the \\textit{Sudowoodo} system and demo video of the\nsystem is available at\n\\href{https://Sudowoodo.apps-hp.danlu.netease.com/}{Sudowoodo} and\n\\href{https://youtu.be/u5BBT_j1L5M}{https://youtu.be/u5BBT\\_j1L5M}.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:12:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chang","Yongzhu",""],["Zhang","Rongsheng",""],["Jiang","Lin",""],["Chen","Qihang",""],["Zhang","Le",""],["Pu","Jiashu",""]]}
{"id":"2308.04666","submitter":"Zirui Ge","authors":"Zirui Ge, Xinzhou Xu, Haiyan Guo, Tingting Wang, Zhen Yang","title":"Speaker Recognition Using Isomorphic Graph Attention Network Based\n  Pooling on Self-Supervised Representation","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The emergence of self-supervised representation (i.e., wav2vec 2.0) allows\nspeaker-recognition approaches to process spoken signals through foundation\nmodels built on speech data. Nevertheless, effective fusion on the\nrepresentation requires further investigating, due to the inclusion of fixed or\nsub-optimal temporal pooling strategies. Despite of improved strategies\nconsidering graph learning and graph attention factors, non-injective\naggregation still exists in the approaches, which may influence the performance\nfor speaker recognition. In this regard, we propose a speaker recognition\napproach using Isomorphic Graph ATtention network (IsoGAT) on self-supervised\nrepresentation. The proposed approach contains three modules of representation\nlearning, graph attention, and aggregation, jointly considering learning on the\nself-supervised representation and the IsoGAT. Then, we perform experiments for\nspeaker recognition tasks on VoxCeleb1\\&2 datasets, with the corresponding\nexperimental results demonstrating the recognition performance for the proposed\napproach, compared with existing pooling approaches on the self-supervised\nrepresentation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:14:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ge","Zirui",""],["Xu","Xinzhou",""],["Guo","Haiyan",""],["Wang","Tingting",""],["Yang","Zhen",""]]}
{"id":"2308.04667","submitter":"Yuanze Wu","authors":"Juncheng Wei and Yuanze Wu","title":"Stability of the Caffarelli-Kohn-Nirenberg inequality: the existence of\n  minimizers","comments":"This is the third version of the preprint arXiv:2205.08937 and any\n  comments are welcome!","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 following variational problem:\n\\begin{eqnarray*} \\inf_{u\\in\nD^{1,2}_a(\\bbr^N)\\backslash\\mathcal{Z}}\\frac{\\|u\\|^2_{D^{1,2}_a(\\bbr^N)}-C_{a,b,N}^{-1}\\|u\\|^2_{L^{p+1}(|x|^{-b(p+1)},\\bbr^N)}}{dist_{D^{1,2}_{a}}^2(u,\n\\mathcal{Z})}:=c_{BE}, \\end{eqnarray*} where $N\\geq2$, $b_{FS}(a)<b<a+1$ for\n$a<0$ and $a\\leq b<a+1$ for $a\\geq0$ and $a+b>0$ with $b_{FS}(a)$ being the\nFelli-Schneider curve, $a<a_c:=\\frac{N-2}{2}$,\n$p=\\frac{N+2(1+a-b)}{N-2(1+a-b)}$, $\\mathcal{Z}= \\{ c\n\\tau^{\\frac{N-2-2a}{2}}W(\\tau x)\\mid c\\in\\bbr\\backslash\\{0\\}, \\tau>0\\}$ and up\nto dilations and scalar multiplications (also up to translations in the special\ncase $a=b=0$), $W(x)$, which is positive and radially symmetric, is the unique\nextremal function of the following classical Caffarelli-Kohn-Nirenberg (CKN for\nshort) inequality \\begin{eqnarray*}\n\\bigg(\\int_{\\bbr^N}|x|^{-b(p+1)}|u|^{p+1}dx\\bigg)^{\\frac{2}{p+1}}\\leq\nC_{a,b,N}\\int_{\\bbr^N}|x|^{-2a}|\\nabla u|^2dx \\end{eqnarray*} with $C_{a,b,N}$\nbeing the optimal constant. It is known in \\cite{WW2022} that $c_{BE}>0$. In\nthis paper, we prove that the above variational problem has a minimizer for\n$N\\geq3$ under the following two assumptions: \\begin{enumerate}\n\\item[$(i)$]\\quad $a_c^*\\leq a<a_c$ and $a\\leq b<a+1$, \\item[$(ii)$]\\quad\n$a<a_c^*$ and $b_{FS}^*(a)\\leq b<a+1$, \\end{enumerate} where\n$a_c^*=\\bigg(1-\\sqrt{\\frac{N-1}{N}}\\bigg)a_c$ and \\begin{eqnarray*}\nb_{FS}^*(a)=\\frac{(a_c-a)N}{a_c-a+\\sqrt{(a_c-a)^2+N-1}}+a-a_c. \\end{eqnarray*}\nOur results extend that of Konig in \\cite{K2023} for the Sobolev inequality to\nthe CKN inequality. Moreover, we believe that our assumptions~$(i)$ and $(ii)$\nare optimal for the existence of minimizers of the above variational problem.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:20:35 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 06:21:25 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 03:18:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wei","Juncheng",""],["Wu","Yuanze",""]]}
{"id":"2308.04668","submitter":"Kunning Tang","authors":"Kunning Tang, Zhenkai Bo, Zhe Li, Ying Da Wang, James McClure, Hongli\n  Su, Peyman Mostaghimi, Ryan Armstrong","title":"Controlled Ion Transport in the Subsurface: A Coupled\n  Advection-Diffusion-Electromigration System","comments":"23 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Groundwater pollution poses a significant threat to environmental\nsustainability during urbanization. Existing remediation methods like\npump-and-treat and electrokinetics have limited ion transport control. This\nstudy introduces a coupled advection-diffusion-electromigration system for\ncontrolled ion transport in the subsurface. Using the Lattice-Boltzmann-Poisson\nmethod, we simulate ion transport in various two- and three-dimensional porous\nmedia. We establish an ion transport regime classification based on the Peclet\nnumber (Pe) and a novel Electrodiffusivity index (EDI). By manipulating the\nelectric potential, hydrostatic pressure, and ion concentration, we identify\nfour transport regimes: large channeling, uniform flow, small channeling, and\nno flow. Large channeling occurs when advection dominates, while uniform flow\narises when diffusion and electromigration are more prevalent. Small channeling\nhappens when the advection opposes electromigration and diffusion, and no flow\noccurs when the advection or electromigration impedes ion transport via\ndiffusion. Simulations in heterogeneous models confirm these transport regimes,\nhighlighting the influence of pore size variation on transport regimes.\nConsequently, $Pe$ and $EDI$ must be tailored for optimal transport control.\nThese findings enable better control over ion transport, optimizing processes\nsuch as heavy metal removal, bioremediation, and contaminant degradation in\ngroundwater management.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:22:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tang","Kunning",""],["Bo","Zhenkai",""],["Li","Zhe",""],["Da Wang","Ying",""],["McClure","James",""],["Su","Hongli",""],["Mostaghimi","Peyman",""],["Armstrong","Ryan",""]]}
{"id":"2308.04669","submitter":"Xinyu Gao","authors":"Xinyu Gao, Ziyi Yang, Yunlu Zhao, Yuxiang Sun, Xiaogang Jin, Changqing\n  Zou","title":"A General Implicit Framework for Fast NeRF Composition and Rendering","comments":"7 pages for main content","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":"  A variety of Neural Radiance Fields (NeRF) methods have recently achieved\nremarkable success in high render speed. However, current accelerating methods\nare specialized and incompatible with various implicit methods, preventing\nreal-time composition over various types of NeRF works. Because NeRF relies on\nsampling along rays, it is possible to provide general guidance for\nacceleration. To that end, we propose a general implicit pipeline for composing\nNeRF objects quickly. Our method enables the casting of dynamic shadows within\nor between objects using analytical light sources while allowing multiple NeRF\nobjects to be seamlessly placed and rendered together with any arbitrary rigid\ntransformations. Mainly, our work introduces a new surface representation known\nas Neural Depth Fields (NeDF) that quickly determines the spatial relationship\nbetween objects by allowing direct intersection computation between rays and\nimplicit surfaces. It leverages an intersection neural network to query NeRF\nfor acceleration instead of depending on an explicit spatial structure.Our\nproposed method is the first to enable both the progressive and interactive\ncomposition of NeRF objects. Additionally, it also serves as a previewing\nplugin for a range of existing NeRF works.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:27:23 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 02:52:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gao","Xinyu",""],["Yang","Ziyi",""],["Zhao","Yunlu",""],["Sun","Yuxiang",""],["Jin","Xiaogang",""],["Zou","Changqing",""]]}
{"id":"2308.04670","submitter":"Miguel Zamora","authors":"Wenbo Wang, Gen Li, Miguel Zamora, and Stelian Coros","title":"TRTM: Template-based Reconstruction and Target-oriented Manipulation of\n  Crumpled Cloths","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precisely reconstructing and manipulating crumpled cloths is challenging due\nto the high dimensionality of the cloth model, as well as the limited\nobservation at self-occluded regions. We leverage the recent progress in the\nfield of single-view human body reconstruction to template-based reconstruct\nthe crumpled cloths from their top-view depth observations only, with our\nproposed sim-real registration protocols. In contrast to previous implicit\ncloth representations, our reconstruction mesh explicitly indicates the\npositions and visibilities of the entire cloth mesh vertices, enabling more\nefficient dual-arm and single-arm target-oriented manipulations. Experiments\ndemonstrate that our template-based reconstruction and target-oriented\nmanipulation (TRTM) system can be applied to daily cloths with similar\ntopologies as our template mesh, but have different shapes, sizes, patterns,\nand physical properties. Videos, datasets, pre-trained models, and code can be\ndownloaded from our project website: https://wenbwa.github.io/TRTM/.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:33:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Wenbo",""],["Li","Gen",""],["Zamora","Miguel",""],["Coros","Stelian",""]]}
{"id":"2308.04671","submitter":"Mingyu Zhu","authors":"Shanshan Song, Mingyu Zhu, Hongcheng Ni, Jian Wu","title":"PyStructureFactor: A Python code for the molecular structure factor in\n  tunneling ionization rates","comments":"26 pages, 9 figures and 2 tables. Repository link:\n  https://github.com/TheStarAlight/PyStructureFactor Licensing provisions:\n  Apache-2.0","journal-ref":"Comput. Phys. Commun., 108882 (2023)","doi":"10.1016/j.cpc.2023.108882","report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Tunneling ionization is at the core of strong-field and attosecond science.\nIn this paper, we present PyStructureFactor - a general Python code towards the\ncalculation of the structure factor in the tunneling ionization rate of common\nmolecules under intense laser fields. The numerical implementation is based on\nthe well-developed weak-field asymptotic theory in the integral representation.\nThe information of the electronic structure of the molecules is obtained via\nthe PySCF quantum chemistry package. PyStructureFactor is a general\ncomputational framework that can be utilized to compute the molecular structure\nfactor of various types of molecules, including polar and non-polar diatomic\nmolecules, degenerate molecules, and open-shell molecules. Examples are given\nthat are benchmarked against known results with good agreements. The present\nPyStructureFactor is implemented in an efficient manner and is easily\napplicable towards larger molecules.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:34:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Song","Shanshan",""],["Zhu","Mingyu",""],["Ni","Hongcheng",""],["Wu","Jian",""]]}
{"id":"2308.04672","submitter":"Jianchao Tan","authors":"Jue Chen, Huan Yuan, Jianchao Tan, Bin Chen, Chengru Song, Di Zhang","title":"Resource Constrained Model Compression via Minimax Optimization for\n  Spiking Neural Networks","comments":"ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Brain-inspired Spiking Neural Networks (SNNs) have the characteristics of\nevent-driven and high energy-efficient, which are different from traditional\nArtificial Neural Networks (ANNs) when deployed on edge devices such as\nneuromorphic chips. Most previous work focuses on SNNs training strategies to\nimprove model performance and brings larger and deeper network architectures.\nIt is difficult to deploy these complex networks on resource-limited edge\ndevices directly. To meet such demand, people compress SNNs very cautiously to\nbalance the performance and the computation efficiency. Existing compression\nmethods either iteratively pruned SNNs using weights norm magnitude or\nformulated the problem as a sparse learning optimization. We propose an\nimproved end-to-end Minimax optimization method for this sparse learning\nproblem to better balance the model performance and the computation efficiency.\nWe also demonstrate that jointly applying compression and finetuning on SNNs is\nbetter than sequentially, especially for extreme compression ratios. The\ncompressed SNN models achieved state-of-the-art (SOTA) performance on various\nbenchmark datasets and architectures. Our code is available at\nhttps://github.com/chenjallen/Resource-Constrained-Compression-on-SNN.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:50:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Jue",""],["Yuan","Huan",""],["Tan","Jianchao",""],["Chen","Bin",""],["Song","Chengru",""],["Zhang","Di",""]]}
{"id":"2308.04673","submitter":"Xiaobei Li","authors":"Xiaobei Li, Changchun Yin, Liming Fang, Run Wang, Chenhao Lin","title":"SSL-Auth: An Authentication Framework by Fragile Watermarking for\n  Pre-trained Encoders in Self-supervised Learning","comments":"Submitted to AAAI2024. 9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised learning (SSL), utilizing unlabeled datasets for training\npowerful encoders, has achieved significant success recently. These encoders\nserve as feature extractors for downstream tasks, requiring substantial\nresources. However, the challenge of protecting the intellectual property of\nencoder trainers and ensuring the trustworthiness of deployed encoders remains\na significant gap in SSL. Moreover, recent researches highlight threats to\npre-trained encoders, such as backdoor and adversarial attacks. To address\nthese gaps, we propose SSL-Auth, the first authentication framework designed\nspecifically for pre-trained encoders. In particular, SSL-Auth utilizes\nselected key samples as watermark information and trains a verification network\nto reconstruct the watermark information, thereby verifying the integrity of\nthe encoder without compromising model performance. By comparing the\nreconstruction results of the key samples, malicious alterations can be\ndetected, as modified encoders won't mimic the original reconstruction.\nComprehensive evaluations on various encoders and diverse downstream tasks\ndemonstrate the effectiveness and fragility of our proposed SSL-Auth.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:54:11 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 09:27:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Xiaobei",""],["Yin","Changchun",""],["Fang","Liming",""],["Wang","Run",""],["Lin","Chenhao",""]]}
{"id":"2308.04674","submitter":"Alex Fan","authors":"Alex Fan, Xingshuo Xiao, Peter Washington","title":"Addressing Racial Bias in Facial Emotion Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fairness in deep learning models trained with high-dimensional inputs and\nsubjective labels remains a complex and understudied area. Facial emotion\nrecognition, a domain where datasets are often racially imbalanced, can lead to\nmodels that yield disparate outcomes across racial groups. This study focuses\non analyzing racial bias by sub-sampling training sets with varied racial\ndistributions and assessing test performance across these simulations. Our\nfindings indicate that smaller datasets with posed faces improve on both\nfairness and performance metrics as the simulations approach racial balance.\nNotably, the F1-score increases by $27.2\\%$ points, and demographic parity\nincreases by $15.7\\%$ points on average across the simulations. However, in\nlarger datasets with greater facial variation, fairness metrics generally\nremain constant, suggesting that racial balance by itself is insufficient to\nachieve parity in test performance across different racial groups.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:03:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Fan","Alex",""],["Xiao","Xingshuo",""],["Washington","Peter",""]]}
{"id":"2308.04675","submitter":"Mohammed S. Al-Abiad","authors":"Mohammed S. Al-Abiad, Mohammad Javad-Kalbasi, and Shahrokh Valaee","title":"Maximizing Network Connectivity for UAV Communications via\n  Reconfigurable Intelligent Surfaces","comments":"7 pages, 5 figures, conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is anticipated that integrating unmanned aerial vehicles (UAVs) with\nreconfigurable intelligent surfaces (RISs), resulting in RIS-assisted UAV\nnetworks, will offer improved network connectivity against node failures for\nthe beyond 5G networks. In this context, we utilize a RIS to provide path\ndiversity and alternative connectivity options for information flow from user\nequipment (UE) to UAVs by adding more links to the network, thereby maximizing\nits connectivity. This paper employs the algebraic connectivity metric, which\nis adjusted by the reflected links of the RIS, to formulate the problem of\nmaximizing the network connectivity in two cases. First, we consider\nformulating the problem for one UE, which is solved optimally using a linear\nsearch. Then, we consider the problem of a more general case of multiple UEs,\nwhich has high computational complexity. To tackle this problem, we formulate\nthe problem of maximizing the network connectivity as a semi-definite\nprogramming (SDP) optimization problem that can be solved efficiently in\npolynomial time. In both cases, our proposed solutions find the best\ncombination between UE(s) and UAVs through the RIS. As a result, it tunes the\nphase shifts of the RIS to direct the signals of the UEs to the appropriate\nUAVs, thus maximizing the network connectivity. Simulation results are\nconducted to assess the performance of the proposed solutions compared to the\nexisting solutions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:06:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Al-Abiad","Mohammed S.",""],["Javad-Kalbasi","Mohammad",""],["Valaee","Shahrokh",""]]}
{"id":"2308.04676","submitter":"Hongyang Xiao","authors":"Hongyang Xiao, Xiwang Cao","title":"New Constructions of Mutually Orthogonal Complementary Sets and\n  Z-Complementary Code Sets Based on Extended Boolean Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mutually orthogonal complementary sets (MOCSs) and Z-complementary code sets\n(ZCCSs) have many applications in practical scenarios such as synthetic\naperture imaging systems and multi-carrier code division multiple access\n(MC-CDMA) systems. With the aid of extended Boolean functions (EBFs), in this\npaper, we first propose a direct construction of MOCSs with flexible lengths,\nand then propose a new construction of ZCCSs. The proposed MOCSs cover many\nexisting lengths and have non-power-of-two lengths when q = 2. Our presented\nsecond construction can generate optimal ZCCSs meeting the set size upper\nbound. Note that the proposed two constructions are direct without the aid of\nany special sequence, which is suitable for rapid hardware generation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:07:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xiao","Hongyang",""],["Cao","Xiwang",""]]}
{"id":"2308.04677","submitter":"Zexi Niu","authors":"Ze-Xi Niu, Ning-Chen Sun, Justyn R. Maund, Yu Zhang, Rui-Ning Zhao,\n  and Ji-Feng Liu","title":"The dusty red supergiant progenitor and the local environment of the\n  Type II SN 2023ixf in M101","comments":"12 pages, 5 figures, accepted by ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As one of the closest supernovae (SNe) in the last decade, SN 2023ixf is an\nunprecedented target to investigate the progenitor star that exploded. However,\nthere is still significant uncertainty in the reported progenitor properties.\nIn this work, we present a detailed study of the progenitor of SN 2023ixf with\ntwo independent analyses. We first modelled its spectral energy distribution\n(SED) based on Hubble Space Telescope optical, Spitzer mid-infrared (IR), and\nground-based near-IR data. We find that stellar pulsation and circumstellar\nextinction have great impacts on SED fitting, and the result suggests a\nrelatively massive red supergiant (RSG) surrounded by C-rich dust with an\ninitial mass of 16.2--17.4 Msun. The corresponding rate of mass-loss occurring\nat least 3 years before the SN explosion is about $2 \\times 10^{-4}\nM_\\odot$yr$^{-1}$. We also derived the star formation history of the SN\nenvironment based on resolved stellar populations, and the most recent\nstar-forming epoch corresponds to a progenitor initial mass of 17--19 Msun, in\nagreement with that from our SED fitting. Therefore, we conclude that the\nprogenitor of SN 2023ixf is close to the high-mass end for Type II SN\nprogenitors.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:13:34 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 04:38:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Niu","Ze-Xi",""],["Sun","Ning-Chen",""],["Maund","Justyn R.",""],["Zhang","Yu",""],["Zhao","Rui-Ning",""],["Liu","Ji-Feng",""]]}
{"id":"2308.04678","submitter":"Henlen W.J. Zhang","authors":"Yi Peng, Helen W. J. Zhang and Ying Zhong","title":"Inequalities for the $k$-Regular Overpartitions","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bessenrodt and Ono, Chen, Wang and Jia, DeSalvo and Pak were the first to\ndiscover the log-subadditivity, log-concavity, and the third-order Tur\\'{a}n\ninequality of partition function, respectively. Many other important partition\nstatistics are proved to enjoy similar properties. This paper focuses on the\npartition function $\\overline{p}_k(n)$, which counts the number of\noverpartitions of $n$ with no parts divisible by $k$. We provide a\ncombinatorial proof to establish that for any $k\\geq2$, the partition function\n$\\overline{p}_k(n)$ exhibits strict log-subadditivity. Specifically, we show\nthat $\\overline{p}_k(a)\\overline{p}_k(b)>\\overline{p}_k(a+b)$ for integers\n$a\\geq b\\geq1$ and $a+b\\geq k$. Furthermore, we investigate the log-concavity\nand the satisfaction of the third-order Tur\\'{a}n inequality for\n$\\overline{p}_k(n)$, where $2\\leq k\\leq9$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:14:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Peng","Yi",""],["Zhang","Helen W. J.",""],["Zhong","Ying",""]]}
{"id":"2308.04679","submitter":"Yuhan Ma","authors":"Yuhan Ma and Haiqi Jiang and Chenyou Fan","title":"Sci-CoT: Leveraging Large Language Models for Enhanced Knowledge\n  Distillation in Small Models for Scientific QA","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":"  Large Language Models (LLMs) have shown outstanding performance across wide\nrange of downstream tasks. This competency is attributed to their substantial\nparameter size and pre-training on extensive corpus. Moreover, LLMs have\nexhibited enhanced reasoning capabilities in tackling complex reasoning tasks,\nowing to the utilization of a method named ``Chain-of-Thought (CoT)\nprompting''. This method is designed to generate intermediate reasoning steps\nthat guide the inference of the final answer. However, it is essential to\nhighlight that these advanced reasoning abilities appear to emerge in models\nwith a minimum of 10 billion parameters, thereby limiting its efficacy in\nsituations where computational resources are constrained. In this paper, we\ninvestigate the possibility of transferring the reasoning capabilities of LLMs\nto smaller models via knowledge distillation. Specifically, we propose Sci-CoT,\na two-stage framework that separates the processes of generating rationales and\ninferring answers. This method enables a more efficient use of rationales\nduring the answer inference stage, leading to improved performance on\nscientific question-answering tasks. Utilizing Sci-CoT, our 80-million\nparameter model is able to exceed the performance of BLOOM-176B in the ARC-Easy\ndataset under the few shot setting.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:18:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ma","Yuhan",""],["Jiang","Haiqi",""],["Fan","Chenyou",""]]}
{"id":"2308.04680","submitter":"Liliana Peralta","authors":"Jorge A. Le\\'on, Liliana Peralta, Iv\\'an Ridr\\'iguez","title":"HJB equation for maximization of wealth under insider trading","comments":"16 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, we combine the techniques of enlargement of filtrations and\nstochastic control theory to establish an extension of the verification\ntheorem, where the coefficients of the stochastic controlled equation are\nadapted to the underlying filtration and the controls are adapted to a bigger\nfiltration $\\mathbf{G}$ than the one generated by the corresponding Brownian\nmotion $B$. Using the forward integral defined by Russo and Vallois\n\\cite{RV1993}, we show that there is a $\\mathbf{G}$-adapted optimal control\nwith respect to a certain cost functional if and only if the Brownian motion\n$B$ is a $\\mathbf{G}$-semimartingale. The extended verification theorem allows\nus to study a financial market with an insider in order to take advantage of\nthe extra information that the insider has from the beginning. Finally, we\nconsider two examples throughout the extended verification theorem. These\nproblems appear in financial markets with an insider.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:22:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Le\u00f3n","Jorge A.",""],["Peralta","Liliana",""],["Ridr\u00edguez","Iv\u00e1n",""]]}
{"id":"2308.04681","submitter":"Qianhe Qin","authors":"Qianhe Qin","title":"An RBG construction of integral surgery homeomorphisms","comments":"17 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the RBG construction of Manolescu and Piccirillo to produce\npairs of knots with the same $n$-surgery, and investigate the possibility of\nconstructing exotic definite four-manifolds using $n$-surgery homeomorphisms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:23:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Qin","Qianhe",""]]}
{"id":"2308.04682","submitter":"Jun Cheng","authors":"Jun Cheng, Tao Liu, Shan Tan","title":"Score Priors Guided Deep Variational Inference for Unsupervised\n  Real-World Single Image Denoising","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":"  Real-world single image denoising is crucial and practical in computer\nvision. Bayesian inversions combined with score priors now have proven\neffective for single image denoising but are limited to white Gaussian noise.\nMoreover, applying existing score-based methods for real-world denoising\nrequires not only the explicit train of score priors on the target domain but\nalso the careful design of sampling procedures for posterior inference, which\nis complicated and impractical. To address these limitations, we propose a\nscore priors-guided deep variational inference, namely ScoreDVI, for practical\nreal-world denoising. By considering the deep variational image posterior with\na Gaussian form, score priors are extracted based on easily accessible minimum\nMSE Non-$i.i.d$ Gaussian denoisers and variational samples, which in turn\nfacilitate optimizing the variational image posterior. Such a procedure\nadaptively applies cheap score priors to denoising. Additionally, we exploit a\nNon-$i.i.d$ Gaussian mixture model and variational noise posterior to model the\nreal-world noise. This scheme also enables the pixel-wise fusion of multiple\nimage priors and variational image posteriors. Besides, we develop a\nnoise-aware prior assignment strategy that dynamically adjusts the weight of\nimage priors in the optimization. Our method outperforms other single\nimage-based real-world denoising methods and achieves comparable performance to\ndataset-based unsupervised methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:26:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cheng","Jun",""],["Liu","Tao",""],["Tan","Shan",""]]}
{"id":"2308.04683","submitter":"Zhongyao Luo","authors":"Zhongyao Luo, Zhao Ge, Hao Wu, Ming Tang","title":"Real-time FPGA Implementation of CNN-based Distributed Fiber Optic\n  Vibration Event Recognition Method","comments":"5 pages, 6 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":"  Utilizing optical fibers to detect and pinpoint vibrations, Distributed\nOptical Fiber Vibration Sensing (DVS) technology provides real-time monitoring\nand surveillance of wide-reaching areas. This field has been leveraging\nConvolutional Neural Networks (CNN). Recently, a study has accomplished\nend-to-end vibration event recognition, enabling utilization of CNN-based DVS\nalgorithms as real-time embedded system for edge computing in practical\napplication situations. Considering the power consumption of central processing\nunit (CPU) and graphics processing unit (GPU), and the inflexibility of\napplication-specific integrated circuit (ASIC), field-Programmable gate array\n(FPGA) is the optimal computing platform for the system. This paper proposes to\ncompress pre-trained network and adopt a novel hardware structure, to design a\nfully on-chip, pipelined inference accelerator for CNN-based DVS algorithm,\nwithout fine tuning or re-training. This design allows for real-time processing\nwith low power consumption and system requirement.An examination has been\nexecuted on an existing DVS algorithm based on a 40-layer CNN model comprising\n2.7 million parameters. It is completely implemented on-chip, pipelined, with\nno reduction in accuracy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:32:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Luo","Zhongyao",""],["Ge","Zhao",""],["Wu","Hao",""],["Tang","Ming",""]]}
{"id":"2308.04684","submitter":"Jin Xu","authors":"Young Myoung Ko and Jamol Pender and Jin Xu","title":"The Number of Overlapping Customers in Erlang-A Queues: An Asymptotic\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the number of customers that overlap or\ncoincide with a virtual customer in an Erlang-A queue. Our study provides a\nnovel approach that exploits fluid and diffusion limits for the queue to\napproximate the mean and variance of the number of overlapping customers. We\nconduct a detailed analysis of the fluid and diffusion limit differential\nequations to derive these approximations. We also construct new accurate\napproximations for the mean and variance of the waiting time in the Erlang-A\nqueue by combining fluid limits with the polygamma function. Our findings have\nimportant implications for queueing theory and evaluating the overlap risk of\nmore complicated service systems.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:41:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ko","Young Myoung",""],["Pender","Jamol",""],["Xu","Jin",""]]}
{"id":"2308.04685","submitter":"Hongyu Cheng","authors":"Jiawei He and Hongyu Cheng","title":"Construction of finite differentiable quasi-periodic Schr\\\"odinger\n  operators with cantor spectrum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we present an approach for explicitly constructing\nquasi-periodic Schr\\\"odinger operators with Cantor spectrum with $C^k$\npotential. Additionally, we provide polynomial asymptotics on the size of\nspectral gaps.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:46:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["He","Jiawei",""],["Cheng","Hongyu",""]]}
{"id":"2308.04686","submitter":"Zhengrong Zhu","authors":"Zheng-Rong Zhu, Bin Shao, Jian Zou, Lian-Ao Wu","title":"Orthogonality catastrophe and quantum speed limit for dynamical quantum\n  phase transition","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the orthogonality catastrophe and quantum speed limit in the\nCreutz model for dynamical quantum phase transitions. We demonstrate that exact\nzeros of the Loschmidt echo can exist in finite-size systems for specific\ndiscrete values. We highlight the role of the zero-energy mode when analyzing\nquench dynamics near the critical point. We also examine the behavior of the\ntime for the first exact zeros of the Loschmidt echo and the corresponding\nquantum speed limit time as the system size increases. While the bound is not\ntight, it can be attributed to the scaling properties of the band gap and\nenergy variance with respect to system size. As such, we establish a relation\nbetween the orthogonality catastrophe and quantum speed limit by referencing\nthe full form of the Loschmidt echo. Significantly, we find the possibility of\nusing the quantum speed limit to detect the critical point of a static quantum\nphase transition, along with a decrease in the amplitude of noise induced\nquantum speed limit.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:48:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Zheng-Rong",""],["Shao","Bin",""],["Zou","Jian",""],["Wu","Lian-Ao",""]]}
{"id":"2308.04687","submitter":"Sarthak Gupta","authors":"Abhishek Kushwaha, Sarthak Gupta, Anish Bhanushali, Tathagato Rai\n  Dastidar","title":"Rapid Training Data Creation by Synthesizing Medical Images for\n  Classification and Localization","comments":"https://openaccess.thecvf.com/content_CVPRW_2020/html/w57/Kushwaha_Rapid_Training_Data_Creation_by_Synthesizing_Medical_Images_for_Classification_CVPRW_2020_paper.html","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While the use of artificial intelligence (AI) for medical image analysis is\ngaining wide acceptance, the expertise, time and cost required to generate\nannotated data in the medical field are significantly high, due to limited\navailability of both data and expert annotation. Strongly supervised object\nlocalization models require data that is exhaustively annotated, meaning all\nobjects of interest in an image are identified. This is difficult to achieve\nand verify for medical images. We present a method for the transformation of\nreal data to train any Deep Neural Network to solve the above problems. We show\nthe efficacy of this approach on both a weakly supervised localization model\nand a strongly supervised localization model. For the weakly supervised model,\nwe show that the localization accuracy increases significantly using the\ngenerated data. For the strongly supervised model, this approach overcomes the\nneed for exhaustive annotation on real images. In the latter model, we show\nthat the accuracy, when trained with generated images, closely parallels the\naccuracy when trained with exhaustively annotated real images. The results are\ndemonstrated on images of human urine samples obtained using microscopy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:49:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kushwaha","Abhishek",""],["Gupta","Sarthak",""],["Bhanushali","Anish",""],["Dastidar","Tathagato Rai",""]]}
{"id":"2308.04688","submitter":"Shotaro Ishihara","authors":"Kaito Majima, Shotaro Ishihara","title":"Generating News-Centric Crossword Puzzles As A Constraint Satisfaction\n  and Optimization Problem","comments":"32nd ACM International Conference on Information and Knowledge\n  Management (short paper track)","journal-ref":null,"doi":"10.1145/3583780.3615151","report-no":null,"categories":"cs.CL cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Crossword puzzles have traditionally served not only as entertainment but\nalso as an educational tool that can be used to acquire vocabulary and language\nproficiency. One strategy to enhance the educational purpose is\npersonalization, such as including more words on a particular topic. This paper\nfocuses on the case of encouraging people's interest in news and proposes a\nframework for automatically generating news-centric crossword puzzles. We\ndesigned possible scenarios and built a prototype as a constraint satisfaction\nand optimization problem, that is, containing as many news-derived words as\npossible. Our experiments reported the generation probabilities and time\nrequired under several conditions. The results showed that news-centric\ncrossword puzzles can be generated even with few news-derived words. We\nsummarize the current issues and future research directions through a\nqualitative evaluation of the prototype. This is the first proposal that a\nformulation of a constraint satisfaction and optimization problem can be\nbeneficial as an educational application.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:50:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Majima","Kaito",""],["Ishihara","Shotaro",""]]}
{"id":"2308.04689","submitter":"Piyush Vyas","authors":"Piyush Vyas, Akhilesh Chauhan, Tushar Mandge, Surbhi Hardikar","title":"web crawler strategies for web pages under robot.txt restriction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present time, all know about World Wide Web and work over the Internet\ndaily. In this paper, we introduce the search engines working for keywords that\nare entered by users to find something. The search engine uses different search\nalgorithms for convenient results for providing to the net surfer. Net surfers\ngo with the top search results but how did the results of web pages get higher\nranks over search engines? how the search engine got that all the web pages in\nthe database? This paper gives the answers to all these kinds of basic\nquestions. Web crawlers working for search engines and robot exclusion protocol\nrules for web crawlers are also addressed in this research paper. Webmaster\nuses different restriction facts in robot.txt file to instruct web crawler,\nsome basic formats of robot.txt are also mentioned in this paper.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:52:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Vyas","Piyush",""],["Chauhan","Akhilesh",""],["Mandge","Tushar",""],["Hardikar","Surbhi",""]]}
{"id":"2308.04690","submitter":"Jae Yong Lee","authors":"Jae Yong Lee, Seungchan Ko, Youngjoon Hong","title":"Finite Element Operator Network for Solving Parametric PDEs","comments":"25 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.AI cs.LG cs.NA physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Partial differential equations (PDEs) underlie our understanding and\nprediction of natural phenomena across numerous fields, including physics,\nengineering, and finance. However, solving parametric PDEs is a complex task\nthat necessitates efficient numerical methods. In this paper, we propose a\nnovel approach for solving parametric PDEs using a Finite Element Operator\nNetwork (FEONet). Our proposed method leverages the power of deep learning in\nconjunction with traditional numerical methods, specifically the finite element\nmethod, to solve parametric PDEs in the absence of any paired input-output\ntraining data. We demonstrate the effectiveness of our approach on several\nbenchmark problems and show that it outperforms existing state-of-the-art\nmethods in terms of accuracy, generalization, and computational flexibility.\nOur FEONet framework shows potential for application in various fields where\nPDEs play a crucial role in modeling complex domains with diverse boundary\nconditions and singular behavior. Furthermore, we provide theoretical\nconvergence analysis to support our approach, utilizing finite element\napproximation in numerical analysis.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:56:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lee","Jae Yong",""],["Ko","Seungchan",""],["Hong","Youngjoon",""]]}
{"id":"2308.04691","submitter":"Ming Lyu","authors":"Ming Lyu, Guobao Zhang, H. G. Wang, Federico Garc\\'ia","title":"Investigation into the reflection properties of the neutron star\n  low-mass X-ray binary 4U 1636-53","comments":"Accepted by Astronomy & Astrophysics, 15 pages, 7 figures","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 spectroscopy of the neutron star low-mass X-ray binary 4U\n1636-53 using six simultaneous XMM-Newton and Rossi X-ray Timing Explorer\nobservations. We applied different self-consistent reflection models to explore\nthe features when the disk is illuminated by either the corona or the neutron\nstar surface. We found that the spectra could be well fitted by these two types\nof models, with the derived emissivity index below a typical value of 3. The\nrelative low emissivity can be explained if the neutron star and the corona,\nworking together as an extended illuminator, simultaneously illuminate and\nionize the disk. Additionally, the derived ionization parameter in the lamppost\ngeometry is larger than the theoretical prediction. This inconsistency likely\nsuggests that the corona does not emit isotropically in a realistic context.\nFurthermore, we also found that there is a possible trend between the height of\nthe corona and the normalization of the disk emission. This could be understood\neither as a variation in the reflected radiation pressure or in the context of\na jet base. Finally, we found that the disk is less ionized if it is\nilluminated by the neutron star, indicating that the illuminating source has\nsignificant influence on the physical properties of the disk.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:02:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lyu","Ming",""],["Zhang","Guobao",""],["Wang","H. G.",""],["Garc\u00eda","Federico",""]]}
{"id":"2308.04692","submitter":"Marica Minucci","authors":"Marica Minucci","title":"Conformal geodesics and the evolution of spacetimes with positive\n  Cosmological constant","comments":"23 pages, 4 figures. Submitted to Philosophical Transactions A issue:\n  \"At the interface of asymptotics, conformal methods and analysis in general\n  relativity\". arXiv admin note: substantial text overlap with arXiv:2302.04004","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article provides a discussion on the construction of conformal Gaussian\ngauge systems to study the evolution of solutions to the Einstein field\nequations with positive Cosmological constant. This is done by means of a gauge\nbased on the properties of conformal geodesics. The use of this gauge, combined\nwith the extended conformal Einstein field equations, yields evolution\nequations in the form of a symmetric hyperbolic system for which standard\nCauchy stability results can be employed. This strategy is used to study the\nglobal properties of de Sitter-like spacetimes with constant negative scalar\ncurvature. It is then adapted to study the evolution of the Schwarzschild-de\nSitter spacetime in the static region near the conformal boundary. This review\nis based on Class. Quantum Grav. 38 145026 and Class. Quantum Grav. 40 145005.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:05:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Minucci","Marica",""]]}
{"id":"2308.04693","submitter":"Hung Phan D","authors":"Hung Phan and Ali Jannesari","title":"Evaluating and Optimizing the Effectiveness of Neural Machine\n  Translation in Supporting Code Retrieval Models: A Study on the CAT Benchmark","comments":"Accepted as Full Paper in Proceedings of the 32nd ACM International\n  Conference on Information and Knowledge Management (CIKM), Birmingham, UK,\n  October 2023","journal-ref":null,"doi":"10.1145/3583780.3614869","report-no":null,"categories":"cs.SE cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural Machine Translation (NMT) is widely applied in software engineering\ntasks. The effectiveness of NMT for code retrieval relies on the ability to\nlearn from the sequence of tokens in the source language to the sequence of\ntokens in the target language. While NMT performs well in pseudocode-to-code\ntranslation, it might have challenges in learning to translate from natural\nlanguage query to source code in newly curated real-world code documentation/\nimplementation datasets. In this work, we analyze the performance of NMT in\nnatural language-to-code translation in the newly curated CAT benchmark that\nincludes the optimized versions of three Java datasets TLCodeSum,\nCodeSearchNet, Funcom, and a Python dataset PCSD. Our evaluation shows that NMT\nhas low accuracy, measured by CrystalBLEU and Meteor metrics in this task. To\nalleviate the duty of NMT in learning complex representation of source code, we\npropose ASTTrans Representation, a tailored representation of an Abstract\nSyntax Tree (AST) using a subset of non-terminal nodes. We show that the\nclassical approach NMT performs significantly better in learning ASTTrans\nRepresentation over code tokens with up to 36% improvement on Meteor score.\nMoreover, we leverage ASTTrans Representation to conduct combined code search\nprocesses from the state-of-the-art code search processes using GraphCodeBERT\nand UniXcoder. Our NMT models of learning ASTTrans Representation can boost the\nMean Reciprocal Rank of these state-of-the-art code search processes by up to\n3.08% and improve 23.08% of queries' results over the CAT benchmark.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:06:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Phan","Hung",""],["Jannesari","Ali",""]]}
{"id":"2308.04694","submitter":"Myoungjean Bae","authors":"Myoungjean Bae, Ben Duan, Chunjing Xie","title":"The steady Euler-Poisson system and accelerating flows with transonic\n  $C^1$-transitions","comments":"70 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we prove the existence of two-dimensional solutions to the\nsteady Euler-Poisson system with continuous transonic transitions across sonic\ninterfaces of codimension 1. First, we establish the well-posedness of a\nboundary value problem for a linear second order system that consists of an\nelliptic-hyperbolic mixed type equation with a degeneracy occurring on an\ninterface of codimension 1, and an elliptic equation weakly coupled together.\nThen we apply the Schauder fixed point theorem to prove the existence of\ntwo-dimensional solutions to the potential flow model of the steady\nEuler-Poisson system with continuous transonic transitions across sonic\ninterfaces. With the aid of Helmholtz decomposition, established in [6], we\nextend the existence result to the full Euler-Poisson system for the case of\nnonzero vorticity. Most importantly, the solutions constructed in this paper\nare classical solutions to Euler-Poisson system, thus their sonic interfaces\nare not weak discontinuities in the sense that all the flow variables are $C^1$\nacross the interfaces.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:06:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bae","Myoungjean",""],["Duan","Ben",""],["Xie","Chunjing",""]]}
{"id":"2308.04695","submitter":"Chaitanya Nalam","authors":"Chaitanya Nalam, Thatchaphol Saranurak and Sorrachai\n  Yingchareonthawornchai","title":"Deterministic $k$-Vertex Connectivity in $k^2$ Max-flows","comments":"21 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An $n$-vertex $m$-edge graph is \\emph{$k$-vertex connected} if it cannot be\ndisconnected by deleting less than $k$ vertices. After more than half a century\nof intensive research, the result by [Li et al. STOC'21] finally gave a\n\\emph{randomized} algorithm for checking $k$-connectivity in near-optimal\n$\\widehat{O}(m)$ time. (We use $\\widehat{O}(\\cdot)$ to hide an $n^{o(1)}$\nfactor.) Deterministic algorithms, unfortunately, have remained much slower\neven if we assume a linear-time max-flow algorithm: they either require at\nleast $\\Omega(mn)$ time [Even'75; Henzinger Rao and Gabow, FOCS'96; Gabow,\nFOCS'00] or assume that $k=o(\\sqrt{\\log n})$ [Saranurak and\nYingchareonthawornchai, FOCS'22]. We show a \\emph{deterministic} algorithm for\nchecking $k$-vertex connectivity in time proportional to making\n$\\widehat{O}(k^{2})$ max-flow calls, and, hence, in $\\widehat{O}(mk^{2})$ time\nusing the deterministic max-flow algorithm by [Brand et al. FOCS'23]. Our\nalgorithm gives the first almost-linear-time bound for all $k$ where\n$\\sqrt{\\log n}\\le k\\le n^{o(1)}$ and subsumes up to a sub polynomial factor the\nlong-standing state-of-the-art algorithm by [Even'75] which requires\n$O(n+k^{2})$ max-flow calls. Our key technique is a deterministic algorithm for\nterminal reduction for vertex connectivity: given a terminal set separated by a\nvertex mincut, output either a vertex mincut or a smaller terminal set that\nremains separated by a vertex mincut. We also show a deterministic\n$(1+\\epsilon)$-approximation algorithm for vertex connectivity that makes\n$O(n/\\epsilon^2)$ max-flow calls, improving the bound of $O(n^{1.5})$ max-flow\ncalls in the exact algorithm of [Gabow, FOCS'00]. The technique is based on\nRamanujan graphs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:07:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nalam","Chaitanya",""],["Saranurak","Thatchaphol",""],["Yingchareonthawornchai","Sorrachai",""]]}
{"id":"2308.04696","submitter":"Soheyla Amirian","authors":"Soheyla Amirian, Luke A. Carlson, Matthew F. Gong, Ines Lohse, Kurt R.\n  Weiss, Johannes F. Plate, and Ahmad P. Tafti","title":"Explainable AI in Orthopedics: Challenges, Opportunities, and Prospects","comments":"This paper was accepted at The 2023 World Congress in Computer\n  Science, Computer Engineering, and Applied Computing (CSCE'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While artificial intelligence (AI) has made many successful applications in\nvarious domains, its adoption in healthcare lags a little bit behind other\nhigh-stakes settings. Several factors contribute to this slower uptake,\nincluding regulatory frameworks, patient privacy concerns, and data\nheterogeneity. However, one significant challenge that impedes the\nimplementation of AI in healthcare, particularly in orthopedics, is the lack of\nexplainability and interpretability around AI models. Addressing the challenge\nof explainable AI (XAI) in orthopedics requires developing AI models and\nalgorithms that prioritize transparency and interpretability, allowing\nclinicians, surgeons, and patients to understand the contributing factors\nbehind any AI-powered predictive or descriptive models. The current\ncontribution outlines several key challenges and opportunities that manifest in\nXAI in orthopedic practice. This work emphasizes the need for interdisciplinary\ncollaborations between AI practitioners, orthopedic specialists, and regulatory\nentities to establish standards and guidelines for the adoption of XAI in\northopedics.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:15:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Amirian","Soheyla",""],["Carlson","Luke A.",""],["Gong","Matthew F.",""],["Lohse","Ines",""],["Weiss","Kurt R.",""],["Plate","Johannes F.",""],["Tafti","Ahmad P.",""]]}
{"id":"2308.04697","submitter":"Mamata Das","authors":"Mamata Das, P.J.A. Alphonse, Selvakumar K","title":"An Analytical Study of Covid-19 Dataset using Graph-Based Clustering\n  Algorithms","comments":"9 pages, 28 figures, Fifth International Conference on Smart\n  Computing and Informatics (SCI 2021)","journal-ref":"Smart Intelligent Computing and Applications, Volume 1, SCI 2021","doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Corona VIrus Disease abbreviated as COVID-19 is a novel virus which is\ninitially identified in Wuhan of China in December of 2019 and now this deadly\ndisease has spread all over the world. According to World Health Organization\n(WHO), a total of 3,124,905 people died from 2019 to 2021, April. In this case,\nmany methods, AI base techniques, and machine learning algorithms have been\nresearched and are being used to save people from this pandemic. The SARS-CoV\nand the 2019-nCoV, SARS-CoV-2 virus invade our bodies, causing some differences\nin the structure of cell proteins. Protein-protein interaction (PPI) is an\nessential process in our cells and plays a very important role in the\ndevelopment of medicines and gives ideas about the disease. In this study, we\nperformed clustering on PPI networks generated from 92 genes of the Covi-19\ndataset. We have used three graph-based clustering algorithms to give intuition\nto the analysis of clusters.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:16:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Das","Mamata",""],["Alphonse","P. J. A.",""],["K","Selvakumar",""]]}
{"id":"2308.04698","submitter":"Hugo Le Roy","authors":"Hugo Le Roy and M. Mert Terzi and Martin lenz","title":"Collective deformation modes promote fibrous self-assembly in\n  protein-like particles","comments":"21 pages, 12 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 self-assembly of particles into organized structures is a key feature of\nliving organisms and a major engineering challenge. While it may proceed\nthrough the binding of perfectly matched, puzzle-pieces-like particles, many\nother instances involve ill-fitting particles that must deform to fit together.\nThese include some pathological proteins, which have a known propensity to form\nfibrous aggregates. Despite this observation, the general relationship between\nthe individual characteristics of the particles and the overall structure of\nthe aggregate is not understood. To elucidate it, we analytically and\nnumerically study the self-assembly of two-dimensional, deformable ill-fitting\nparticles. We find that moderately sticky particles tend to form equilibrium\nself-limited aggregates whose size is set by an elastic boundary layer\nassociated with collective deformations that may extend over many particles.\nParticles with a soft internal deformation mode thus give rise to large\naggregates. Besides, when the particles are incompressible, their aggregates\ntend to be anisotropic and fiber-like. Our results are preserved in a more\ncomplex particle model with randomly chosen elastic properties. This indicates\nthat generic protein characteristics such as allostery and incompressibility\ncould favor the formation of fibers in protein aggregation, and suggests design\nprinciples for artificial self-assembling structures.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:21:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Roy","Hugo Le",""],["Terzi","M. Mert",""],["lenz","Martin",""]]}
{"id":"2308.04699","submitter":"Bin Chen","authors":"Hao Fang, Bin Chen, Xuan Wang, Zhi Wang, Shu-Tao Xia","title":"GIFD: A Generative Gradient Inversion Method with Feature Domain\n  Optimization","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Federated Learning (FL) has recently emerged as a promising distributed\nmachine learning framework to preserve clients' privacy, by allowing multiple\nclients to upload the gradients calculated from their local data to a central\nserver. Recent studies find that the exchanged gradients also take the risk of\nprivacy leakage, e.g., an attacker can invert the shared gradients and recover\nsensitive data against an FL system by leveraging pre-trained generative\nadversarial networks (GAN) as prior knowledge. However, performing gradient\ninversion attacks in the latent space of the GAN model limits their expression\nability and generalizability. To tackle these challenges, we propose\n\\textbf{G}radient \\textbf{I}nversion over \\textbf{F}eature \\textbf{D}omains\n(GIFD), which disassembles the GAN model and searches the feature domains of\nthe intermediate layers. Instead of optimizing only over the initial latent\ncode, we progressively change the optimized layer, from the initial latent\nspace to intermediate layers closer to the output images. In addition, we\ndesign a regularizer to avoid unreal image generation by adding a small ${l_1}$\nball constraint to the searching range. We also extend GIFD to the\nout-of-distribution (OOD) setting, which weakens the assumption that the\ntraining sets of GANs and FL tasks obey the same data distribution. Extensive\nexperiments demonstrate that our method can achieve pixel-level reconstruction\nand is superior to the existing methods. Notably, GIFD also shows great\ngeneralizability under different defense strategy settings and batch sizes.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:34:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Fang","Hao",""],["Chen","Bin",""],["Wang","Xuan",""],["Wang","Zhi",""],["Xia","Shu-Tao",""]]}
{"id":"2308.04700","submitter":"Eric Yanchenko","authors":"Eric Yanchenko","title":"BOPIM: Bayesian Optimization for influence maximization on temporal\n  networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of influence maximization (IM) is to select a small set of seed\nnodes which maximize the spread of influence on a network. In this work, we\npropose BOPIM, a Bayesian Optimization (BO) algorithm for IM on temporal\nnetworks. The IM task is well-suited for a BO solution due to its expensive and\ncomplicated objective function. We propose a simple surrogate function to model\nthe objective function and leverage Gaussian Process regression with shrinkage\npriors to fit the model. An acquisition function based on the median of the\nposterior distribution leads to a straightforward procedure to select the next\nsampling point. In numerical experiments on real-world networks, we find that,\non average, the surrogate function estimates the true influence spread within a\nfew nodes. Additionally, we show that BOPIM yields comparable influence spreads\nto a gold-standard greedy algorithm while being as much as seventeen times\nfaster. We also use these experiments to demonstrate the proposed method's\nability to quantify uncertainty in optimal seed sets. To the knowledge of the\nauthor, this is the first attempt to look at uncertainty in the seed sets for\nIM, as well as the first application of BO to a constrained, combinatorial\noptimization problem.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:35:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yanchenko","Eric",""]]}
{"id":"2308.04701","submitter":"Yaobin Xu","authors":"Xiaofei Yu, Stefany Angarita-Gomez, Yaobin Xu, Peiyuan Gao, Jun-Gang\n  Wang, Xin Zhang, Hao Jia, Wu Xu, Xiaolin Li, Yingge Du, Zhijie Xu, Janet S.\n  Ho, Kang Xu, Perla B. Balbuena, Chongmin Wang, Zihua Zhu","title":"Direct and in situ examination of Li+ transport kinetics in isotope\n  labelled solid electrolyte interphase","comments":"25 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":"  Here, using unique in-situ liquid secondary ion mass spectroscopy on\nisotope-labelled solid-electrolyte-interphase (SEI), assisted by cryogenic\ntransmission electron microscopy and constrained ab initio molecular dynamics\nsimulation, for the first time we answer the question regarding Li+ transport\nmechanism across SEI, and quantitatively determine the Li+-mobility therein. We\nunequivocally unveil that Li+ transport in SEI follows a mechanism of\nsuccessive displacement, rather than \"direct-hopping\". We further reveal, in\naccordance with spatial-dependence of SEI structure across the thickness, the\napparent Li+ self-diffusivity varies from 6.7*10-19 m2/s to 1.0*10-20 m2/s,\nsetting a quantitative gauging of ionic transport behavior of SEI layer against\nthe underlining electrode as well as the rate limiting step of battery\noperation. This direct study on Li+ kinetics in SEI fills part of the\ndecade-long knowledge gap about the most important component in advanced\nbatteries and provides more precise guidelines to the tailoring of interphasial\nchemistries for future battery chemistries.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:45:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yu","Xiaofei",""],["Angarita-Gomez","Stefany",""],["Xu","Yaobin",""],["Gao","Peiyuan",""],["Wang","Jun-Gang",""],["Zhang","Xin",""],["Jia","Hao",""],["Xu","Wu",""],["Li","Xiaolin",""],["Du","Yingge",""],["Xu","Zhijie",""],["Ho","Janet S.",""],["Xu","Kang",""],["Balbuena","Perla B.",""],["Wang","Chongmin",""],["Zhu","Zihua",""]]}
{"id":"2308.04702","submitter":"Francesco Barbato","authors":"Francesco Barbato, Elena Camuffo, Simone Milani, Pietro Zanuttigh","title":"Continual Road-Scene Semantic Segmentation via Feature-Aligned Symmetric\n  Multi-Modal Network","comments":"10 pages, 6 figures, 2 tables, 8 equations","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  State-of-the-art multimodal semantic segmentation approaches combining LiDAR\nand color data are usually designed on top of asymmetric information-sharing\nschemes and assume that both modalities are always available. Regrettably, this\nstrong assumption may not hold in real-world scenarios, where sensors are prone\nto failure or can face adverse conditions (night-time, rain, fog, etc.) that\nmake the acquired information unreliable. Moreover, these architectures tend to\nfail in continual learning scenarios. In this work, we re-frame the task of\nmultimodal semantic segmentation by enforcing a tightly-coupled feature\nrepresentation and a symmetric information-sharing scheme, which allows our\napproach to work even when one of the input modalities is missing. This makes\nour model reliable even in safety-critical settings, as is the case of\nautonomous driving. We evaluate our approach on the SemanticKITTI dataset,\ncomparing it with our closest competitor. We also introduce an ad-hoc continual\nlearning scheme and show results in a class-incremental continual learning\nscenario that prove the effectiveness of the approach also in this setting.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:46:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Barbato","Francesco",""],["Camuffo","Elena",""],["Milani","Simone",""],["Zanuttigh","Pietro",""]]}
{"id":"2308.04703","submitter":"Leixian Shen","authors":"Leixian Shen, Yizhi Zhang, Haidong Zhang, Yun Wang","title":"Data Player: Automatic Generation of Data Videos with\n  Narration-Animation Interplay","comments":"11 pages, 5 figures, accepted by IEEE Transactions on Visualization\n  and Computer Graphics (Proc. IEEE VIS'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Data visualizations and narratives are often integrated to convey data\nstories effectively. Among various data storytelling formats, data videos have\nbeen garnering increasing attention. These videos provide an intuitive\ninterpretation of data charts while vividly articulating the underlying data\ninsights. However, the production of data videos demands a diverse set of\nprofessional skills and considerable manual labor, including understanding\nnarratives, linking visual elements with narration segments, designing and\ncrafting animations, recording audio narrations, and synchronizing audio with\nvisual animations. To simplify this process, our paper introduces a novel\nmethod, referred to as Data Player, capable of automatically generating dynamic\ndata videos with narration-animation interplay. This approach lowers the\ntechnical barriers associated with creating data videos rich in narration. To\nenable narration-animation interplay, Data Player constructs references between\nvisualizations and text input. Specifically, it first extracts data into tables\nfrom the visualizations. Subsequently, it utilizes large language models to\nform semantic connections between text and visuals. Finally, Data Player\nencodes animation design knowledge as computational low-level constraints,\nallowing for the recommendation of suitable animation presets that align with\nthe audio narration produced by text-to-speech technologies. We assessed Data\nPlayer's efficacy through an example gallery, a user study, and expert\ninterviews. The evaluation results demonstrated that Data Player can generate\nhigh-quality data videos that are comparable to human-composed ones.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:49:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shen","Leixian",""],["Zhang","Yizhi",""],["Zhang","Haidong",""],["Wang","Yun",""]]}
{"id":"2308.04704","submitter":"Ran Liu","authors":"Ran Liu and Charles Nicholas","title":"A Feature Set of Small Size for the PDF Malware Detection","comments":"Accepted for publication at the ACM SIGKDD & Annual KDD Conference\n  workshop on Knowledge-infused Machine Learning, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML)-based malware detection systems are becoming\nincreasingly important as malware threats increase and get more sophisticated.\nPDF files are often used as vectors for phishing attacks because they are\nwidely regarded as trustworthy data resources, and are accessible across\ndifferent platforms. Therefore, researchers have developed many different PDF\nmalware detection methods. Performance in detecting PDF malware is greatly\ninfluenced by feature selection. In this research, we propose a small features\nset that don't require too much domain knowledge of the PDF file. We evaluate\nproposed features with six different machine learning models. We report the\nbest accuracy of 99.75% when using Random Forest model. Our proposed feature\nset, which consists of just 12 features, is one of the most conciseness in the\nfield of PDF malware detection. Despite its modest size, we obtain comparable\nresults to state-of-the-art that employ a much larger set of features.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:51:28 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 03:08:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Ran",""],["Nicholas","Charles",""]]}
{"id":"2308.04705","submitter":"Ramakrishna Nanduri Dr","authors":"Manohar Kumar and Ramakrishna Nanduri","title":"Regularity comparison of symbolic and ordinary powers of weighted\n  oriented graphs","comments":"Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we compare the regularities of symbolic and ordinary powers of\nedge ideals of weighted oriented graphs. For a weighted oriented graph $D$, we\ngive a lower bound for $\\reg(I(D)^{k})$, if $V^+$ are sinks. If $D$ has an\ninduced directed path $(x_i,x_j),(x_j,x_r) \\in E(D)$ of length $2$ with\n$w(x_j)\\geq 2$, then we show that $\\reg(I(D)^{k})\\leq \\reg(I(D)^{k})$ for all\n$k\\geq 2$. In particular, if $D$ is bipartite, then the above inequality holds\nfor all $k\\geq 2$. For any weighted oriented graph $D$, if $V^+$ are sink\nvertices, then we show that $\\reg(I(D)^{k}) \\leq \\reg(I(D)^{k})$ with $k=2,3$.\nWe further study when these regularities are equal. As a consequence, we give\nsharp upper bounds for regularity of symbolic powers of certain class of\nweighted oriented graphs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:51:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kumar","Manohar",""],["Nanduri","Ramakrishna",""]]}
{"id":"2308.04706","submitter":"Haoxuan Li","authors":"Shanshan Huang, Haoxuan Li, Qingsong Li, Chunyuan Zheng, Li Liu","title":"Pareto Invariant Representation Learning for Multimedia Recommendation","comments":"ACM MM 2023 full paper","journal-ref":null,"doi":"10.1145/3581783.3612591","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multimedia recommendation involves personalized ranking tasks, where\nmultimedia content is usually represented using a generic encoder. However,\nthese generic representations introduce spurious correlations that fail to\nreveal users' true preferences. Existing works attempt to alleviate this\nproblem by learning invariant representations, but overlook the balance between\nindependent and identically distributed (IID) and out-of-distribution (OOD)\ngeneralization. In this paper, we propose a framework called Pareto Invariant\nRepresentation Learning (PaInvRL) to mitigate the impact of spurious\ncorrelations from an IID-OOD multi-objective optimization perspective, by\nlearning invariant representations (intrinsic factors that attract user\nattention) and variant representations (other factors) simultaneously.\nSpecifically, PaInvRL includes three iteratively executed modules: (i)\nheterogeneous identification module, which identifies the heterogeneous\nenvironments to reflect distributional shifts for user-item interactions; (ii)\ninvariant mask generation module, which learns invariant masks based on the\nPareto-optimal solutions that minimize the adaptive weighted Invariant Risk\nMinimization (IRM) and Empirical Risk (ERM) losses; (iii) convert module, which\ngenerates both variant representations and item-invariant representations for\ntraining a multi-modal recommendation model that mitigates spurious\ncorrelations and balances the generalization performance within and cross the\nenvironmental distributions. We compare the proposed PaInvRL with\nstate-of-the-art recommendation models on three public multimedia\nrecommendation datasets (Movielens, Tiktok, and Kwai), and the experimental\nresults validate the effectiveness of PaInvRL for both within- and\ncross-environmental learning.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:57:56 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 18:47:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Huang","Shanshan",""],["Li","Haoxuan",""],["Li","Qingsong",""],["Zheng","Chunyuan",""],["Liu","Li",""]]}
{"id":"2308.04707","submitter":"Nobuyuki Kudomi","authors":"Nobuyuki Kudomi and Yukito Maeda","title":"Applicability test for reducing noise on PET dynamic images using\n  phantom applying deep image prior","comments":"22 pages, 2 tables, and 5 figures, and supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Objective Positron emission tomography (PET) allows imaging of\npatho-physiological information as a form of rate constants from a dynamic\nimage. The rate constant image(s) may be affected from noise on the dynamic\nimage. We introduced an artificial intelligence technique of deep image prior\n(DIP) to reduce noise on dynamic images. Method We utilized a phantom filled\nwith 18F-F- and 11C-flumazenil solutions in the main and sub-cylinders,\nrespectively. The phantom was scanned by a Biograph mCT and dynamic images were\nobtained. DIP was applied to all slices involved in the dynamic images while\nintroducing an index for choosing an optimal epoch with minimize the degree of\nnoise. Then, decay rate images were generated and quantitative accuracy and\nquality were measured in the images. Results The obtained decay rates on images\nwere not significantly different from those of the reference values.\nCoefficient of variances (CV) were smaller using DIP-based images than those\nfrom original images for the reconstructed and decay rate images, both in the\n11C and 18F filled regions. Conclusion The present method for choosing a\ngenerated image during DIP is feasible for noise reduction in dynamic PET\nimages, and for obtaining rate constant images with less noise.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:58:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kudomi","Nobuyuki",""],["Maeda","Yukito",""]]}
{"id":"2308.04708","submitter":"Tsuyoshi Id\\'e","authors":"Tsuyoshi Id\\'e and Naoki Abe","title":"Generative Perturbation Analysis for Probabilistic Black-Box Anomaly\n  Attribution","comments":null,"journal-ref":"KDD '23: Proceedings of the 29th ACM SIGKDD Conference on\n  Knowledge Discovery and Data Mining, August 2023, pp.845-856","doi":"10.1145/3580305.3599365","report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We address the task of probabilistic anomaly attribution in the black-box\nregression setting, where the goal is to compute the probability distribution\nof the attribution score of each input variable, given an observed anomaly. The\ntraining dataset is assumed to be unavailable. This task differs from the\nstandard XAI (explainable AI) scenario, since we wish to explain the anomalous\ndeviation from a black-box prediction rather than the black-box model itself.\n  We begin by showing that mainstream model-agnostic explanation methods, such\nas the Shapley values, are not suitable for this task because of their\n``deviation-agnostic property.'' We then propose a novel framework for\nprobabilistic anomaly attribution that allows us to not only compute\nattribution scores as the predictive mean but also quantify the uncertainty of\nthose scores. This is done by considering a generative process for\nperturbations that counter-factually bring the observed anomalous observation\nback to normalcy. We introduce a variational Bayes algorithm for deriving the\ndistributions of per variable attribution scores. To the best of our knowledge,\nthis is the first probabilistic anomaly attribution framework that is free from\nbeing deviation-agnostic.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:59:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Id\u00e9","Tsuyoshi",""],["Abe","Naoki",""]]}
{"id":"2308.04709","submitter":"Sean Wu","authors":"Sean Wu, Michael Koo, Lesley Blum, Andy Black, Liyo Kao, Fabien\n  Scalzo, Ira Kurtz","title":"A Comparative Study of Open-Source Large Language Models, GPT-4 and\n  Claude 2: Multiple-Choice Test Taking in Nephrology","comments":"7 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, there have been significant breakthroughs in the field of\nnatural language processing, particularly with the development of large\nlanguage models (LLMs). These LLMs have showcased remarkable capabilities on\nvarious benchmarks. In the healthcare field, the exact role LLMs and other\nfuture AI models will play remains unclear. There is a potential for these\nmodels in the future to be used as part of adaptive physician training, medical\nco-pilot applications, and digital patient interaction scenarios. The ability\nof AI models to participate in medical training and patient care will depend in\npart on their mastery of the knowledge content of specific medical fields. This\nstudy investigated the medical knowledge capability of LLMs, specifically in\nthe context of internal medicine subspecialty multiple-choice test-taking\nability. We compared the performance of several open-source LLMs (Koala 7B,\nFalcon 7B, Stable-Vicuna 13B, and Orca Mini 13B), to GPT-4 and Claude 2 on\nmultiple-choice questions in the field of Nephrology. Nephrology was chosen as\nan example of a particularly conceptually complex subspecialty field within\ninternal medicine. The study was conducted to evaluate the ability of LLM\nmodels to provide correct answers to nephSAP (Nephrology Self-Assessment\nProgram) multiple-choice questions. The overall success of open-sourced LLMs in\nanswering the 858 nephSAP multiple-choice questions correctly was 17.1% -\n25.5%. In contrast, Claude 2 answered 54.4% of the questions correctly, whereas\nGPT-4 achieved a score of 73.3%. We show that current widely used open-sourced\nLLMs do poorly in their ability for zero-shot reasoning when compared to GPT-4\nand Claude 2. The findings of this study potentially have significant\nimplications for the future of subspecialty medical training and patient care.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:01:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wu","Sean",""],["Koo","Michael",""],["Blum","Lesley",""],["Black","Andy",""],["Kao","Liyo",""],["Scalzo","Fabien",""],["Kurtz","Ira",""]]}
{"id":"2308.04710","submitter":"Xuesong Geng","authors":"Xuesong Geng, Liangliang Ji, Baifei Shen","title":"Overcoming the Limitation of Long Focal Length with Plasma Telescope for\n  Laser Wakefield Acceleration Beyond Petawatt","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.acc-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The compactness of laser wakefield acceleration (LWFA) is limited by its long\nfocal length for high power lasers, e.g., more than 10 meters for 1-peatawatt\n(PW) laser pulse and up to hundreds of meters for 10-100 PW lasers. The long\nfocal length originates from the low damage threshold of the optical off-axial\nparabolic (OAP) mirror and consequent large spot size. We propose implementing\nan OAP plasma mirror (PM) to form a telescope geometry, reducing the beam size\nand hence constraining the focal length to meter-range for LWFA driven by\nlasers beyond 1PW. Three-dimensional particle-in-cell simulations are performed\nto characterize the reflection of a 1-PW laser by the plasma OAP and find that\noptimal condition is achieved within only 1-m optical length. The new method\nsuccessfully generates 9GeV electron bunch in the subsequent LWFA stage with\nconsistent acceleration gradients to that of the 1-PW laser via ordinary\nfocusing. The proposed geometry provides a solution of compact LWFAs available\nfor even 100-PW laser systems.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:04:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Geng","Xuesong",""],["Ji","Liangliang",""],["Shen","Baifei",""]]}
{"id":"2308.04711","submitter":"Tim Hartill","authors":"Tim Hartill, Diana Benavides-Prado, Michael Witbrock, Patricia J.\n  Riddle","title":"Answering Unseen Questions With Smaller Language Models Using Rationale\n  Generation and Dense Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When provided with sufficient explanatory context, smaller Language Models\nhave been shown to exhibit strong reasoning ability on challenging short-answer\nquestion-answering tasks where the questions are unseen in training. We\nevaluate two methods for further improvement in this setting. Both methods\nfocus on combining rationales generated by a larger Language Model with longer\ncontexts created from a multi-hop dense retrieval system. The first method\n($\\textit{RR}$) involves training a Rationale Ranking model to score both\ngenerated rationales and retrieved contexts with respect to relevance and\ntruthfulness. We then use the scores to derive combined contexts from both\nknowledge sources using a number of combinatory strategies. For the second\nmethod ($\\textit{RATD}$) we train a smaller Reasoning model using\nretrieval-augmented training datasets such that it becomes proficient at\nutilising relevant information from longer text sequences that may be only\npartially evidential and frequently contain many irrelevant sentences.\nGenerally we find that both methods are effective but that the $\\textit{RATD}$\nmethod is more straightforward to apply and produces the strongest results in\nthe unseen setting on which we focus. Our single best Reasoning model using\nonly 440 million parameters materially improves upon strong comparable prior\nbaselines for unseen evaluation datasets (StrategyQA 58.9 $\\rightarrow$ 61.7\nacc., CommonsenseQA 63.6 $\\rightarrow$ 72.7 acc., ARC-DA 31.6 $\\rightarrow$\n52.1 F1, IIRC 25.5 $\\rightarrow$ 27.3 F1) and a version utilising our prior\nknowledge of each type of question in selecting a context combination strategy\ndoes even better. Our proposed models also generally outperform direct prompts\nagainst much larger models (BLOOM 175B and StableVicuna 13B) in both few-shot\nchain-of-thought and few-shot answer-only settings.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:06:39 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 00:02:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hartill","Tim",""],["Benavides-Prado","Diana",""],["Witbrock","Michael",""],["Riddle","Patricia J.",""]]}
{"id":"2308.04712","submitter":"Hoang Nguyen","authors":"Hoang H. Nguyen, Chenwei Zhang, Ye Liu, Philip S. Yu","title":"Slot Induction via Pre-trained Language Model Probing and Multi-level\n  Contrastive Learning","comments":"Accepted at SIGDIAL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advanced methods in Natural Language Understanding for Task-oriented\nDialogue (TOD) Systems (e.g., intent detection and slot filling) require a\nlarge amount of annotated data to achieve competitive performance. In reality,\ntoken-level annotations (slot labels) are time-consuming and difficult to\nacquire. In this work, we study the Slot Induction (SI) task whose objective is\nto induce slot boundaries without explicit knowledge of token-level slot\nannotations. We propose leveraging Unsupervised Pre-trained Language Model\n(PLM) Probing and Contrastive Learning mechanism to exploit (1) unsupervised\nsemantic knowledge extracted from PLM, and (2) additional sentence-level intent\nlabel signals available from TOD. Our approach is shown to be effective in SI\ntask and capable of bridging the gaps with token-level supervised models on two\nNLU benchmark datasets. When generalized to emerging intents, our SI objectives\nalso provide enhanced slot label representations, leading to improved\nperformance on the Slot Filling tasks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:08:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nguyen","Hoang H.",""],["Zhang","Chenwei",""],["Liu","Ye",""],["Yu","Philip S.",""]]}
{"id":"2308.04713","submitter":"Mudassar Sabir","authors":"Arshad Ali, Ya-Peng Hu, Mudassar Sabir, Taotao Sui","title":"On the gauge dependence of scalar induced secondary gravitational waves\n  during radiation and matter domination eras","comments":"19 pages, 6 figures, SCPMA in press","journal-ref":"Sci.China Phys.Mech.Astron. 66 (2023) 290411","doi":"10.1007/s11433-022-2118-5","report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the vital issue of gauge dependence in the scalar-induced\nsecondary gravitational waves (SIGWs), focusing on the radiation domination\n(RD) and matter domination (MD) eras. The energy density spectrum is the main\nphysical observable in such induced gravitational waves. For various gauge\nchoices, there has been a divergence in the energy density,\n$\\Omega_{\\text{GW}}$, of SIGWs. We calculate SIGWs in different gauges to\nquantify this divergence to address the gauge-dependent problem. In our\nprevious studies, we had found that the energy density diverges in the\npolynomial power of conformal time (e.g., $\\eta^6$ in uniform density gauge).\nWe try to fix this discrepancy by adding a counter-term that removes the\nfictitious terms in secondary tensor perturbations. We graphically compare the\ncalculations in various gauges and also comment on the physical origin of the\nobserved gauge dependence.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:11:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ali","Arshad",""],["Hu","Ya-Peng",""],["Sabir","Mudassar",""],["Sui","Taotao",""]]}
{"id":"2308.04714","submitter":"S. Sandra Bae","authors":"S. Sandra Bae, Takanori Fujiwara, Anders Ynnerman, Ellen Yi-Luen Do,\n  Michael L. Rivera, and Danielle Albers Szafir","title":"A Computational Design Pipeline to Fabricate Sensing Network\n  Physicalizations","comments":"11 pages, 8 figures; to be published in Proceedings of IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interaction is critical for data analysis and sensemaking. However, designing\ninteractive physicalizations is challenging as it requires cross-disciplinary\nknowledge in visualization, fabrication, and electronics. Interactive\nphysicalizations are typically produced in an unstructured manner, resulting in\nunique solutions for a specific dataset, problem, or interaction that cannot be\neasily extended or adapted to new scenarios or future physicalizations. To\nmitigate these challenges, we introduce a computational design pipeline to 3D\nprint network physicalizations with integrated sensing capabilities. Networks\nare ubiquitous, yet their complex geometry also requires significant\nengineering considerations to provide intuitive, effective interactions for\nexploration. Using our pipeline, designers can readily produce network\nphysicalizations supporting selection-the most critical atomic operation for\ninteraction-by touch through capacitive sensing and computational inference.\nOur computational design pipeline introduces a new design paradigm by\nconcurrently considering the form and interactivity of a physicalization into\none cohesive fabrication workflow. We evaluate our approach using (i)\ncomputational evaluations, (ii) three usage scenarios focusing on general\nvisualization tasks, and (iii) expert interviews. The design paradigm\nintroduced by our pipeline can lower barriers to physicalization research,\ncreation, and adoption.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:26:02 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 22:39:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bae","S. Sandra",""],["Fujiwara","Takanori",""],["Ynnerman","Anders",""],["Do","Ellen Yi-Luen",""],["Rivera","Michael L.",""],["Szafir","Danielle Albers",""]]}
{"id":"2308.04715","submitter":"Baldwin Nsonga","authors":"Baldwin Nsonga and Gerik Scheuermann","title":"Visualizing Similarity of Pathline Dynamics in 2D Flow Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Even though the analysis of unsteady 2D flow fields is challenging, fluid\nmechanics experts generally have an intuition on where in the simulation domain\nspecific features are expected. Using this intuition, showing similar regions\nenables the user to discover flow patterns within the simulation data. When\nfocusing on similarity, a solid mathematical framework for a specific flow\npattern is not required. We propose a technique that visualizes similar and\ndissimilar regions with respect to a region selected by the user. Using\ninfinitesimal strain theory, we capture the strain and rotation progression and\ntherefore the dynamics of fluid parcels along pathlines, which we encode as\ndistributions. We then apply the Jensen-Shannon divergence to compute the\n(dis)similarity between pathline dynamics originating in a user-defined flow\nregion and the pathline dynamics of the flow field. We validate our method by\napplying it to two simulation datasets of two-dimensional unsteady flows. Our\nresults show that our approach is suitable for analyzing the similarity of\ntime-dependent flow fields.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:26:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nsonga","Baldwin",""],["Scheuermann","Gerik",""]]}
{"id":"2308.04716","submitter":"Ken Mochizuki","authors":"Ken Mochizuki and Ryusuke Hamazaki","title":"Absorption to Fluctuating Bunching States in Non-Unitary Boson Dynamics","comments":"8 pages, 4 figures, and supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech physics.atm-clus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that noisy non-unitary dynamics of bosons drives arbitrary initial\nstates into a novel fluctuating bunching state, where all bosons occupy one\ntime-dependent mode. We propose a concept of the noisy spectral gap, a\ngeneralization of the spectral gap in noiseless systems, and demonstrate that\nexponentially fast absorption to the fluctuating bunching state takes place\nasymptotically. The fluctuating bunching state is unique to noisy non-unitary\ndynamics with no counterpart in any unitary dynamics and non-unitary dynamics\ndescribed by a time-independent generator. We also argue that the times of\nrelaxation to the fluctuating bunching state obey a universal power law as\nfunctions of the noise parameter in generic noisy non-unitary dynamics.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:35:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mochizuki","Ken",""],["Hamazaki","Ryusuke",""]]}
{"id":"2308.04717","submitter":"Hien Doan Thanh","authors":"Hien Thanh Doan, Truong Hoang Bao Huy, Daehee Kim, and Hongseok Kim","title":"Fully Decentralized Peer-to-Peer Community Grid with Dynamic and\n  Congestion Pricing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Peer-to-peer (P2P) electricity markets enable prosumers to minimize their\ncosts, which has been extensively studied in recent research. However, there\nare several challenges with P2P trading when physical network constraints are\nalso included. Moreover, most studies use fixed prices for grid power prices\nwithout considering dynamic grid pricing, and equity for all participants. This\npolicy may negatively affect the long-term development of the market if\nprosumers with low demand are not treated fairly. An initial step towards\naddressing these problems is the design of a new decentralized P2P electricity\nmarket with two dynamic grid pricing schemes that are determined by consumer\ndemand. Futhermore, we consider a decentralized system with physical\nconstraints for optimizing power flow in networks without compromising privacy.\nWe propose a dynamic congestion price to effectively address congestion and\nthen prove the convergence and global optimality of the proposed method. Our\nexperiments show that P2P energy trade decreases generation cost of main grid\nby 56.9% compared with previous works. Consumers reduce grid trading by 57.3%\nwhile the social welfare of consumers is barely affected by the increase of\ngrid price.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:43:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Doan","Hien Thanh",""],["Huy","Truong Hoang Bao",""],["Kim","Daehee",""],["Kim","Hongseok",""]]}
{"id":"2308.04718","submitter":"Huanwen Wang","authors":"Huan-Wen Wang, Bo Fu, and Shun-Qing Shen","title":"Signature of Parity Anomaly: Crossover from One Half to Integer\n  Quantized Hall Conductance in a Finite Magnetic Field","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The pursuit of understanding parity anomaly in condensed matter systems has\nled to significant advancements in both theoretical and experimental research\nin recent years. In this study, we explore the parity anomaly of massless Dirac\nfermions in a semimagnetic topological insulator (TI) thin film subjected to a\nfinite magnetic field. Our findings reveal an anomalous half-quantized Hall\nconductance arising from the occupied electronic states far below the Fermi\nlevel, which is directly associated with the parity anomaly. This observation\ndemonstrates a crossover from one-half quantized Hall conductance in a metallic\nphase at zero field to one or zero quantized Hall conductance in the insulating\nphase at a strong field in the presence of disorders, serving as a key\nindicator for confirming parity anomaly. Our work provides valuable insights\ninto the intricate relationship between band topology in condensed matter\nsystems and quantum anomaly in quantum field theory.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:48:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Huan-Wen",""],["Fu","Bo",""],["Shen","Shun-Qing",""]]}
{"id":"2308.04719","submitter":"Yang Li","authors":"Yang Li and Kun Xiong and Yingping Zhang and Jiangcheng Zhu and\n  Stephen Mcaleer and Wei Pan and Jun Wang and Zonghong Dai and Yaodong Yang","title":"JiangJun: Mastering Xiangqi by Tackling Non-Transitivity in Two-Player\n  Zero-Sum Games","comments":"28 pages, accepted by Transactions on Machine Learning Research\n  (TMLR)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an empirical exploration of non-transitivity in\nperfect-information games, specifically focusing on Xiangqi, a traditional\nChinese board game comparable in game-tree complexity to chess and shogi. By\nanalyzing over 10,000 records of human Xiangqi play, we highlight the existence\nof both transitive and non-transitive elements within the game's strategic\nstructure. To address non-transitivity, we introduce the JiangJun algorithm, an\ninnovative combination of Monte-Carlo Tree Search (MCTS) and Policy Space\nResponse Oracles (PSRO) designed to approximate a Nash equilibrium. We evaluate\nthe algorithm empirically using a WeChat mini program and achieve a Master\nlevel with a 99.41\\% win rate against human players. The algorithm's\neffectiveness in overcoming non-transitivity is confirmed by a plethora of\nmetrics, such as relative population performance and visualization results. Our\nproject site is available at\n\\url{https://sites.google.com/view/jiangjun-site/}.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:48:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Yang",""],["Xiong","Kun",""],["Zhang","Yingping",""],["Zhu","Jiangcheng",""],["Mcaleer","Stephen",""],["Pan","Wei",""],["Wang","Jun",""],["Dai","Zonghong",""],["Yang","Yaodong",""]]}
{"id":"2308.04720","submitter":"Daejun Kim","authors":"Jangwon Ju, Daejun Kim, Kyoungmin Kim, Mingyu Kim, Byeong-Kweon Oh","title":"Isolations of the sum of two squares from its proper subforms","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a (positive definite and integral) quadratic form $f$, a quadratic form\nis said to be {\\it an isolation of $f$ from its proper subforms} if it\nrepresents all proper subforms of $f$, but not $f$ itself. It was proved that\nthe minimal rank of isolations of the square quadratic form $x^2$ is three, and\nthere are exactly $15$ ternary diagonal isolations of $x^2$. Recently, it was\nproved that any quaternary quadratic form cannot be an isolation of the sum of\ntwo squares $I_2=x^2+y^2$, and there are quinary isolations of $I_2$. In this\narticle, we prove that there are at most $231$ quinary isolations of $I_2$,\nwhich are listed in Table $1$. Moreover, we prove that $14$ quinary quadratic\nforms with dagger mark in Table $1$ are isolations of $I_2$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:51:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ju","Jangwon",""],["Kim","Daejun",""],["Kim","Kyoungmin",""],["Kim","Mingyu",""],["Oh","Byeong-Kweon",""]]}
{"id":"2308.04721","submitter":"Esa Ollila","authors":"Esa Ollila","title":"Linear shrinkage of sample covariance matrix or matrices under\n  elliptical distributions: a review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This chapter reviews methods for linear shrinkage of the sample covariance\nmatrix (SCM) and matrices (SCM-s) under elliptical distributions in single and\nmultiple populations settings, respectively. In the single sample setting a\npopular linear shrinkage estimator is defined as a linear combination of the\nsample covariance matrix (SCM) with a scaled identity matrix. The optimal\nshrinkage coefficients minimizing the mean squared error (MSE) under elliptical\nsampling are shown to be functions of few key parameters only, such as\nelliptical kurtosis and sphericity parameter. Similar results and estimators\nare derived for multiple population setting and applications of the studied\nshrinkage estimators are illustrated in portfolio optimization.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:52:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ollila","Esa",""]]}
{"id":"2308.04722","submitter":"S. Farokh Atashzar","authors":"Jacqueline Libby, Aniket A. Somwanshi, Federico Stancati, Gayatri\n  Tyagi, Sarmad Mehrdad, JohnRoss Rizzo, S. Farokh Atashzar","title":"How Does the Inner Geometry of Soft Actuators Modulate the Dynamic and\n  Hysteretic Response?","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":"  This paper investigates the influence of the internal geometrical structure\nof soft pneu-nets on the dynamic response and hysteresis of the actuators. The\nresearch findings indicate that by strategically manipulating the stress\ndistribution within soft robots, it is possible to enhance the dynamic response\nwhile reducing hysteresis. The study utilizes the Finite Element Method (FEM)\nand includes experimental validation through markerless motion tracking of the\nsoft robot. In particular, the study examines actuator bending angles up to\n500% strain while achieving 95% accuracy in predicting the bending angle. The\nresults demonstrate that the particular design with the minimum air chamber\nwidth in the center significantly improves both high- and low-frequency\nhysteresis behavior by 21.5% while also enhancing dynamic response by 60% to\n112% across various frequencies and peak-to-peak pressures. Consequently, the\npaper evaluates the effectiveness of \"mechanically programming\" stress\ndistribution and distributed energy storage within soft robots to maximize\ntheir dynamic performance, offering direct benefits for control.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:53:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Libby","Jacqueline",""],["Somwanshi","Aniket A.",""],["Stancati","Federico",""],["Tyagi","Gayatri",""],["Mehrdad","Sarmad",""],["Rizzo","JohnRoss",""],["Atashzar","S. Farokh",""]]}
{"id":"2308.04723","submitter":"Jiwon Lee","authors":"Jiwon Lee, Seungjae Jeon, Yunji Park, Jaehyun Chung, Doowon Jeong","title":"A Forensic Methodology for Detecting Image Manipulations","comments":null,"journal-ref":"Journal of The Korea Institute of Information Security and\n  Cryptology (2023)","doi":"10.13089/JKIISC.2023.33.4.671","report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By applying artificial intelligence to image editing technology, it has\nbecome possible to generate high-quality images with minimal traces of\nmanipulation. However, since these technologies can be misused for criminal\nactivities such as dissemination of false information, destruction of evidence,\nand denial of facts, it is crucial to implement strong countermeasures. In this\nstudy, image file and mobile forensic artifacts analysis were conducted for\ndetecting image manipulation. Image file analysis involves parsing the metadata\nof manipulated images (e.g., Exif, DQT, and Filename Signature) and comparing\nthem with a Reference DB to detect manipulation. The Reference DB is a database\nthat collects manipulation-related traces left in image metadata, which serves\nas a criterion for detecting image manipulation. In the mobile forensic\nartifacts analysis, packages related to image editing tools were extracted and\nanalyzed to aid the detection of image manipulation. The proposed methodology\novercomes the limitations of existing graphic feature-based analysis and\ncombines with image processing techniques, providing the advantage of reducing\nfalse positives. The research results demonstrate the significant role of such\nmethodology in digital forensic investigation and analysis. Additionally, We\nprovide the code for parsing image metadata and the Reference DB along with the\ndataset of manipulated images, aiming to contribute to related research.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:58:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Jiwon",""],["Jeon","Seungjae",""],["Park","Yunji",""],["Chung","Jaehyun",""],["Jeong","Doowon",""]]}
{"id":"2308.04724","submitter":"Quan Li","authors":"Laixin Xie, Chenyang Zhang, Ruofei Ma, Xing Jiang, Xingxing Xing, Wei\n  Wan, and Quan Li","title":"Understanding Auto-Scheduling Optimizations for Model Deployment via\n  Visualizations","comments":"Accepted by IEEE VIS 2023 Poster Track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  After completing the design and training phases, deploying a deep learning\nmodel onto specific hardware is essential before practical implementation.\nTargeted optimizations are necessary to enhance the model's performance by\nreducing inference latency. Auto-scheduling, an automated technique offering\nvarious optimization options, proves to be a viable solution for large-scale\nauto-deployment. However, the low-level code generated by auto-scheduling\nresembles hardware coding, potentially hindering human comprehension and\nimpeding manual optimization efforts. In this ongoing study, we aim to develop\nan enhanced visualization that effectively addresses the extensive profiling\nmetrics associated with auto-scheduling. This visualization will illuminate the\nintricate scheduling process, enabling further advancements in latency\noptimization through insights derived from the schedule.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 05:59:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xie","Laixin",""],["Zhang","Chenyang",""],["Ma","Ruofei",""],["Jiang","Xing",""],["Xing","Xingxing",""],["Wan","Wei",""],["Li","Quan",""]]}
{"id":"2308.04725","submitter":"Takahiko Furuya","authors":"Takahiko Furuya, Zhoujie Chen, Ryutarou Ohbuchi, Zhenzhong Kuang","title":"Self-supervised Learning of Rotation-invariant 3D Point Set Features\n  using Transformer and its Self-distillation","comments":"Currently under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Invariance against rotations of 3D objects is an important property in\nanalyzing 3D point set data. Conventional 3D point set DNNs having rotation\ninvariance typically obtain accurate 3D shape features via supervised learning\nby using labeled 3D point sets as training samples. However, due to the rapid\nincrease in 3D point set data and the high cost of labeling, a framework to\nlearn rotation-invariant 3D shape features from numerous unlabeled 3D point\nsets is required. This paper proposes a novel self-supervised learning\nframework for acquiring accurate and rotation-invariant 3D point set features\nat object-level. Our proposed lightweight DNN architecture decomposes an input\n3D point set into multiple global-scale regions, called tokens, that preserve\nthe spatial layout of partial shapes composing the 3D object. We employ a\nself-attention mechanism to refine the tokens and aggregate them into an\nexpressive rotation-invariant feature per 3D point set. Our DNN is effectively\ntrained by using pseudo-labels generated by a self-distillation framework. To\nfacilitate the learning of accurate features, we propose to combine multi-crop\nand cut-mix data augmentation techniques to diversify 3D point sets for\ntraining. Through a comprehensive evaluation, we empirically demonstrate that,\n(1) existing rotation-invariant DNN architectures designed for supervised\nlearning do not necessarily learn accurate 3D shape features under a\nself-supervised learning scenario, and (2) our proposed algorithm learns\nrotation-invariant 3D point set features that are more accurate than those\nlearned by existing algorithms. Code will be available at\nhttps://github.com/takahikof/RIPT_SDMM\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:03:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Furuya","Takahiko",""],["Chen","Zhoujie",""],["Ohbuchi","Ryutarou",""],["Kuang","Zhenzhong",""]]}
{"id":"2308.04726","submitter":"Hibatallah Alwazani","authors":"Hibatallah Alwazani and Anas Chaaban","title":"Enhancing Secret Key Generation in Block Fading Channels using\n  Reconfigurable Intelligent Surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physical layer security (PLS) is superior to classical cryptography\ntechniques due to its notion of perfect secrecy and independence to an\neavesdropper's computational power. One form of PLS arises when Alice and Bob\n(the legitimate users) exchange signals to extract a common key from the random\ncommon channels. The drawback of extracting keys from wireless channels is the\nample dependence on the dynamicity and fluctuations of the radio channel.\nHowever, some radio channels are constant such as line of sight (LoS) and can\nbe estimated by Eve (an illegitimate user), or can be quite static in behaviour\ndue to the presence low-mobility users thus restricting the amount of\nrandomness. This in turn lowers the secret key rate (SKR) defined as the number\nof bits of key generated per channel use. In this work, we aim to address this\nchallenge by using a reconfigurable intelligent surface (RIS) to produce random\nphases at certain carefully curated intervals such that it disrupts the channel\nin low entropy environments. We propose an RIS assisted key generation method,\nstudy its performance, and compare with benchmarks to observe the benefit of\nusing an RIS while considering various important metrics such as key mismatch\nrate and average secret key throughput. Simulations are made to validate our\ntheoretical findings showing an improvement in performance when an RIS is\ndeployed.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:11:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Alwazani","Hibatallah",""],["Chaaban","Anas",""]]}
{"id":"2308.04727","submitter":"Saugat Pandey","authors":"Saugat Pandey, Oen G. McKinley, R. Jordan Crouser, Alvitta Ottley","title":"Do You Trust What You See? Toward A Multidimensional Measure of Trust in\n  Visualization","comments":"5 pages, IEEE visualization conference (VIS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Few concepts are as ubiquitous in computational fields as trust. However, in\nthe case of information visualization, there are several unique and complex\nchallenges, chief among them: defining and measuring trust. In this paper, we\ninvestigate the factors that influence trust in visualizations. We draw on the\nliterature to identify five factors likely to affect trust: credibility,\nclarity, reliability, familiarity, and confidence. We then conduct two studies\ninvestigating these factors' relationship with visualization design features.\nIn the first study, participants' credibility, understanding, and reliability\nratings depended on the visualization design and its source. In the second\nstudy, we find these factors also align with subjective trust rankings. Our\nfindings suggest that these five factors are important considerations for the\ndesign of trustworthy visualizations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:18:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pandey","Saugat",""],["McKinley","Oen G.",""],["Crouser","R. Jordan",""],["Ottley","Alvitta",""]]}
{"id":"2308.04728","submitter":"Wei Chen","authors":"Weixiao Wan, Wei Chen, Shiyue Wang, Geoffrey Ye Li, Bo Ai","title":"Deep Plug-and-Play Prior for Massive MIMO Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scalability is a major concern in implementing deep learning (DL) based\nmethods in wireless communication systems. Given various communication tasks,\napplying one DL model for one specific task is costly in both model training\nand model storage. In this paper, we propose a novel deep plug-and-play prior\nmethod for three communication tasks in the downlink of massive multiple-input\nmultiple-output (MIMO) systems, including channel estimation, antenna\nextrapolation and channel state information (CSI) feedback. The proposed method\ncorresponding to these three communication tasks employs a common DL model,\nwhich greatly reduces the overhead of model training and storage. Unlike\ngeneral multitask learning, the DL model of the proposed method does not\nrequire further fine-tuning for specific communication tasks, but is\nplug-and-play. Extensive experiments are conducted on the DeepMIMO dataset to\ndemonstrate the convergence, performance, and storage overhead of the proposed\nmethod for the three communication tasks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:19:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wan","Weixiao",""],["Chen","Wei",""],["Wang","Shiyue",""],["Li","Geoffrey Ye",""],["Ai","Bo",""]]}
{"id":"2308.04729","submitter":"Peike Li","authors":"Peike Li, Boyu Chen, Yao Yao, Yikai Wang, Allen Wang, Alex Wang","title":"JEN-1: Text-Guided Universal Music Generation with Omnidirectional\n  Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.LG cs.MM eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Music generation has attracted growing interest with the advancement of deep\ngenerative models. However, generating music conditioned on textual\ndescriptions, known as text-to-music, remains challenging due to the complexity\nof musical structures and high sampling rate requirements. Despite the task's\nsignificance, prevailing generative models exhibit limitations in music\nquality, computational efficiency, and generalization. This paper introduces\nJEN-1, a universal high-fidelity model for text-to-music generation. JEN-1 is a\ndiffusion model incorporating both autoregressive and non-autoregressive\ntraining. Through in-context learning, JEN-1 performs various generation tasks\nincluding text-guided music generation, music inpainting, and continuation.\nEvaluations demonstrate JEN-1's superior performance over state-of-the-art\nmethods in text-music alignment and music quality while maintaining\ncomputational efficiency. Our demos are available at\nhttp://futureverse.com/research/jen/demos/jen1\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:27:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Peike",""],["Chen","Boyu",""],["Yao","Yao",""],["Wang","Yikai",""],["Wang","Allen",""],["Wang","Alex",""]]}
{"id":"2308.04730","submitter":"Marcus Waurick","authors":"Johanna Frohberg and Marcus Waurick","title":"State-dependent Delay Differential Equations on $H^1$","comments":"27 pages; references added, typos removed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.DS math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Classically, solution theories for state-dependent delay equations are\ndeveloped in spaces of continuous or continuously differentiable functions. In\napplications, these two approaches naturally offer some limitations. The former\ncan be technically challenging to apply in as much as suitably Lipschitz\ncontinuous extensions of mappings onto (open subsets of) the space of\ncontinuous functions are required; whereas the latter approach leads to\npotentially undue restrictions on the class of initial pre-histories. Here, we\nestablish a solution theory (i.e., unique existence) for state-dependent delay\nequations for arbitrary Lipschitz continuous pre-histories and suitably\nLipschitz continuous right-hand sides on the Sobolev space $H^1$. The provided\nsolution theory is independent of previous ones and is based on the contraction\nmapping principle on exponentially weighted spaces yielding global in time\nwell-posedness right away. In particular, initial pre-histories are not\nrequired to belong to certain solution manifolds and the generality of the\napproach permits the consideration of a large class of functional differential\nequations even when the continuity of the right-hand side has constraints on\nthe derivative. The solution theory provided implies the classical\nPicard--Lindel\\\"of theorem as a special case.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:40:51 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 08:10:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Frohberg","Johanna",""],["Waurick","Marcus",""]]}
{"id":"2308.04731","submitter":"Zexuan Li","authors":"Zexuan Li","title":"A High-efficient Battery Charging System for Electric Vehicle","comments":"9 pages 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nowadays, automobile is facing the trend of electrification. Lithium-ion\nbatteries is widely used as their power supplies. Lithium-ion battery has\ncomplex characteristics, as a result, Lithium-ion battery needs optimal\ncharging strategies to make sure it is charged safely and efficiently. This\npaper focuses on development of a high-efficient charging method for\nlithium-ion battery. To test different charging strategies, the electric\nvehicle charging system consisting of a dual active bridge DC-DC converter and\na Thevenin battery model is implemented. Multistage constant current charging\n(MSCC) and multistage constant current reflex charging (MSCC with reflex\ncharging) were proposed. Compared with the traditional constant voltage\nconstant current (CC-CV) charging method, MSCC can reduce 12% of the charging\ntime and 1.1% of the battery loss; MSCC with reflex charging has a 10.45% and a\n1.54% reduction of charging time and battery loss separately.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:43:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Zexuan",""]]}
{"id":"2308.04732","submitter":"Yuichiro Tada","authors":"Yuichiro Tada, Takahiro Terada, Junsei Tokuda","title":"Cancellation of quantum corrections on the soft curvature perturbations","comments":"23 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"CTPU-PTC-23-31","categories":"hep-th astro-ph.CO gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the cancellation of quantum corrections on the superhorizon\ncurvature perturbations from subhorizon physics beyond the single-clock\ninflation from the viewpoint of the cosmological soft theorem. As an example,\nwe focus on the transient ultra-slow-roll inflation scenario and compute the\none-loop quantum corrections to the power spectrum of curvature perturbations\ntaking into account nontrivial surface terms in the action. We find that\nMaldacena's consistency relation is satisfied and guarantees the cancellation\nof contributions from the short-scale modes. As a corollary, primordial black\nhole production in single-field inflation scenarios is not excluded by\nperturbativity breakdown even for the sharp transition case in contrast to some\nrecent claims in the literature. We also comment on the relation between the\ntadpole diagram in the in-in formalism and the shift of the elapsed time in the\nstochastic-$\\delta N$ formalism. We find our argument is not directly\ngeneralisable to the tensor perturbations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:54:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tada","Yuichiro",""],["Terada","Takahiro",""],["Tokuda","Junsei",""]]}
{"id":"2308.04733","submitter":"Yifan Gao","authors":"Yifan Gao, Jinpeng Lin, Min Zhou, Chuanbin Liu, Hongtao Xie, Tiezheng\n  Ge, Yuning Jiang","title":"TextPainter: Multimodal Text Image Generation with Visual-harmony and\n  Text-comprehension for Poster Design","comments":"Accepted to ACM MM 2023. Dataset Link:\n  https://tianchi.aliyun.com/dataset/160034","journal-ref":null,"doi":"10.1145/3581783.3611929","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text design is one of the most critical procedures in poster design, as it\nrelies heavily on the creativity and expertise of humans to design text images\nconsidering the visual harmony and text-semantic. This study introduces\nTextPainter, a novel multimodal approach that leverages contextual visual\ninformation and corresponding text semantics to generate text images.\nSpecifically, TextPainter takes the global-local background image as a hint of\nstyle and guides the text image generation with visual harmony. Furthermore, we\nleverage the language model and introduce a text comprehension module to\nachieve both sentence-level and word-level style variations. Besides, we\nconstruct the PosterT80K dataset, consisting of about 80K posters annotated\nwith sentence-level bounding boxes and text contents. We hope this dataset will\npave the way for further research on multimodal text image generation.\nExtensive quantitative and qualitative experiments demonstrate that TextPainter\ncan generate visually-and-semantically-harmonious text images for posters.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:59:29 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 01:51:55 GMT"},{"version":"v3","created":"Sun, 13 Aug 2023 03:11:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gao","Yifan",""],["Lin","Jinpeng",""],["Zhou","Min",""],["Liu","Chuanbin",""],["Xie","Hongtao",""],["Ge","Tiezheng",""],["Jiang","Yuning",""]]}
{"id":"2308.04734","submitter":"Lindon Roberts","authors":"Warren Hare, Lindon Roberts, Cl\\'ement W. Royer","title":"Expected decrease for derivative-free algorithms using random subspaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Derivative-free algorithms seek the minimum of a given function based only on\nfunction values queried at appropriate points. Although these methods are\nwidely used in practice, their performance is known to worsen as the problem\ndimension increases. Recent advances in developing randomized derivative-free\ntechniques have tackled this issue by working in low-dimensional subspaces that\nare drawn at random in an iterative fashion. The connection between the\ndimension of these random subspaces and the algorithmic guarantees has yet to\nbe fully understood. In this paper, we develop an analysis for derivative-free\nalgorithms (both direct-search and model-based approaches) employing random\nsubspaces. Our results leverage linear local approximations of smooth functions\nto obtain understanding of the expected decrease achieved per function\nevaluation. Although the quantities of interest involve multidimensional\nintegrals with no closed-form expression, a relative comparison for different\nsubspace dimensions suggest that low dimension is preferable. Numerical\ncomputation of the quantities of interest confirm the benefit of operating in\nlow-dimensional subspaces.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:00:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hare","Warren",""],["Roberts","Lindon",""],["Royer","Cl\u00e9ment W.",""]]}
{"id":"2308.04735","submitter":"Yongho Kim","authors":"Yongho Kim, Yongho Choi","title":"Going Deeper with Five-point Stencil Convolutions for Reaction-Diffusion\n  Equations","comments":"1 table, 6 figures","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":"  Physics-informed neural networks have been widely applied to partial\ndifferential equations with great success because the physics-informed loss\nessentially requires no observations or discretization. However, it is\ndifficult to optimize model parameters, and these parameters must be trained\nfor each distinct initial condition. To overcome these challenges in\nsecond-order reaction-diffusion type equations, a possible way is to use\nfive-point stencil convolutional neural networks (FCNNs). FCNNs are trained\nusing two consecutive snapshots, where the time step corresponds to the step\nsize of the given snapshots. Thus, the time evolution of FCNNs depends on the\ntime step, and the time step must satisfy its CFL condition to avoid blow-up\nsolutions. In this work, we propose deep FCNNs that have large receptive fields\nto predict time evolutions with a time step larger than the threshold of the\nCFL condition. To evaluate our models, we consider the heat, Fisher's, and\nAllen-Cahn equations with diverse initial conditions. We demonstrate that deep\nFCNNs retain certain accuracies, in contrast to FDMs that blow up.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:00:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kim","Yongho",""],["Choi","Yongho",""]]}
{"id":"2308.04736","submitter":"Mircea Vasiliniuc","authors":"Mircea-Serban Vasiliniuc, Adrian Groza","title":"Case Study: Using AI-Assisted Code Generation In Mobile Teams","comments":"8 pages, 10 figures, 1 table, ICCP conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The aim of this study is to evaluate the performance of AI-assisted\nprogramming in actual mobile development teams that are focused on native\nmobile languages like Kotlin and Swift. The extensive case study involves 16\nparticipants and 2 technical reviewers, from a software development department\ndesigned to understand the impact of using LLMs trained for code generation in\nspecific phases of the team, more specifically, technical onboarding and\ntechnical stack switch. The study uses technical problems dedicated to each\nphase and requests solutions from the participants with and without using\nAI-Code generators. It measures time, correctness, and technical integration\nusing ReviewerScore, a metric specific to the paper and extracted from actual\nindustry standards, the code reviewers of merge requests. The output is\nconverted and analyzed together with feedback from the participants in an\nattempt to determine if using AI-assisted programming tools will have an impact\non getting developers onboard in a project or helping them with a smooth\ntransition between the two native development environments of mobile\ndevelopment, Android and iOS. The study was performed between May and June 2023\nwith members of the mobile department of a software development company based\nin Cluj-Napoca, with Romanian ownership and management.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:02:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Vasiliniuc","Mircea-Serban",""],["Groza","Adrian",""]]}
{"id":"2308.04737","submitter":"Yixin Guo","authors":"Yixin Guo, Hiroyuki Tajima","title":"One-dimensional spinless fermions with attractive two- and three-body\n  forces","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"cond-mat.quant-gas cond-mat.str-el cond-mat.supr-con nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We theoretically investigate in-medium three-body correlations in\none-dimensional spinless fermions with antisymmetrized two- and three-body\nattractive interactions. By investigating the variational problem of three-body\nstates above the Fermi sea, we illuminate the fate of the in-medium three-body\ncluster states both in the special case with pure attractive three-body\ninteraction as well as in the case with the coexistence of two- and three-body\ninteractions. Our results testify that the fermion-dimer repulsion is canceled\nby including the three-body interactions, and stable three-body clusters can be\nformed. We further feature a phase diagram consisting of the $p$-wave Cooper\npairing and Cooper tripling phases in a plane of $p$-wave two- and three-body\ncoupling strengths.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:03:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Guo","Yixin",""],["Tajima","Hiroyuki",""]]}
{"id":"2308.04738","submitter":"Yixin Guo","authors":"Yixin Guo, Hiroyuki Tajima","title":"Medium-induced bosonic clusters in a Bose-Fermi mixture: Towards\n  simulating cluster formations in neutron-rich matter","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"cond-mat.quant-gas cond-mat.str-el cond-mat.supr-con nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Considering bosonic atoms immersed in a dilute Fermi gas, we theoretically\ninvestigate medium-induced bosonic clusters associated with fermion-mediated\ntwo- and three-body interactions. Using the variational approach combined with\nthe fermion-mediated interactions, we numerically calculate the binding\nenergies of two- and three-body bosonic clusters in a one-dimensional system.\nIt is found that the bosonic clusters can be formed even with a repulsive\nboson-boson interaction due to the fermion-mediated interactions. Our results\nwould be relevant for ultracold atomic systems as well as analogue quantum\nsimulations of alpha clusters in neutron-rich matter.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:03:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Guo","Yixin",""],["Tajima","Hiroyuki",""]]}
{"id":"2308.04739","submitter":"Randy Harsuko","authors":"Randy Harsuko and Tariq Alkhalifah","title":"Optimizing a Transformer-based network for a deep learning seismic\n  processing workflow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  StorSeismic is a recently introduced model based on the Transformer to adapt\nto various seismic processing tasks through its pretraining and fine-tuning\ntraining strategy. In the original implementation, StorSeismic utilized a\nsinusoidal positional encoding and a conventional self-attention mechanism,\nboth borrowed from the natural language processing (NLP) applications. For\nseismic processing they admitted good results, but also hinted to limitations\nin efficiency and expressiveness. We propose modifications to these two key\ncomponents, by utilizing relative positional encoding and low-rank attention\nmatrices as replacements to the vanilla ones. The proposed changes are tested\non processing tasks applied to a realistic Marmousi and offshore field data as\na sequential strategy, starting from denoising, direct arrival removal,\nmultiple attenuation, and finally root-mean-squared velocity ($V_{RMS}$)\nprediction for normal moveout (NMO) correction. We observe faster pretraining\nand competitive results on the fine-tuning tasks and, additionally, fewer\nparameters to train compared to the vanilla model.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:11:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Harsuko","Randy",""],["Alkhalifah","Tariq",""]]}
{"id":"2308.04740","submitter":"Yadong Wu","authors":"Yadong Wu, Juan Yao, Pengfei Zhang and Xiaopeng Li","title":"Randomness-enhanced expressivity of quantum neural networks","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a hybrid of artificial intelligence and quantum computing, quantum neural\nnetworks (QNNs) have gained significant attention as a promising application on\nnear-term, noisy intermediate-scale quantum (NISQ) devices. Conventional QNNs\nare described by parametrized quantum circuits, which perform unitary\noperations and measurements on quantum states. In this work, we propose a novel\napproach to enhance the expressivity of QNNs by incorporating randomness into\nquantum circuits. Specifically, we introduce a random layer, which contains\nsingle-qubit gates sampled from an trainable ensemble pooling. The prediction\nof QNN is then represented by an ensemble average over a classical function of\nmeasurement outcomes. We prove that our approach can accurately approximate\narbitrary target operators using Uhlmann's theorem for majorization, which\nenables observable learning. Our proposal is demonstrated with extensive\nnumerical experiments, including observable learning, R\\'enyi entropy\nmeasurement, and image recognition. We find the expressivity of QNNS is\nenhanced by introducing randomness for multiple learning tasks, which could\nhave broad application in quantum machine learning.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:17:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wu","Yadong",""],["Yao","Juan",""],["Zhang","Pengfei",""],["Li","Xiaopeng",""]]}
{"id":"2308.04741","submitter":"Yuxin Deng","authors":"Yuxin Deng, Huiling Wu, Ming Xu","title":"Local Reasoning about Probabilistic Behaviour for Classical-Quantum\n  Programs","comments":"27 pages. arXiv admin note: text overlap with arXiv:2107.00804","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Verifying the functional correctness of programs with both classical and\nquantum constructs is a challenging task. The presence of probabilistic\nbehaviour entailed by quantum measurements and unbounded while loops complicate\nthe verification task greatly. We propose a new quantum Hoare logic for local\nreasoning about probabilistic behaviour by introducing distribution formulas to\nspecify probabilistic properties. We show that the proof rules in the logic are\nsound with respect to a denotational semantics. To demonstrate the\neffectiveness of the logic, we formally verify the correctness of non-trivial\nquantum algorithms including the HHL and Shor's algorithms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:23:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Deng","Yuxin",""],["Wu","Huiling",""],["Xu","Ming",""]]}
{"id":"2308.04742","submitter":"Ji Zeng","authors":"Ji Zeng","title":"Note on disjoint faces in simple topological graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that every $n$-vertex complete simple topological graph generates at\nleast $\\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent\nresult by Hubard and Suk. As an immediate corollary, every $n$-vertex complete\nsimple topological graph drawn in the unit square generates a $4$-face with\narea at most $O(1/n)$. This can be seen as a topological variant of Heilbronn's\nproblem for $4$-faces. We construct examples showing that our result is\nasymptotically tight. We also discuss the similar problem for $k$-faces with\narbitrary $k\\geq 3$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:23:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zeng","Ji",""]]}
{"id":"2308.04743","submitter":"Nianhao Xie","authors":"Yuanhe Liu, Nianhao Xie, Kebo Li, Yangang Liang","title":"Missile guidance law design based on free-time convergent error dynamics","comments":"13 pages, 6 figures, accepted by Journal of Systems Engineering and\n  Electronics","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.RO cs.SY math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The design of guidance law can be considered a kind of finite-time\nerror-tracking problem. A unified free-time convergent guidance law design\napproach based on the error dynamics and the free-time convergence method is\nproposed in this paper. Firstly, the desired free-time convergent error\ndynamics approach is proposed, and its convergent time can be set freely, which\nis independent of the initial states and the guidance parameters. Then, the\nillustrative guidance laws considering the leading angle constraint, impact\nangle constraint, and impact time constraint are derived based on the proposed\nfree-time convergent error dynamics respectively. The connection and\ndistinction between the proposed and the existing guidance laws are analyzed\ntheoretically. Finally, the performance of the proposed guidance laws is\nverified by simulation comparison.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:24:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Yuanhe",""],["Xie","Nianhao",""],["Li","Kebo",""],["Liang","Yangang",""]]}
{"id":"2308.04744","submitter":"Chen Chen","authors":"Chen Chen, Jun-Yong Yan, Hans-Georg Babin, Xing Lin, Wei Fang, Run-Ze\n  Liu, Yong-Heng Huo, Wei E. I. Sha, Jiaxiang Zhang, Christian Heyn, Andreas D.\n  Wieck, Arne Ludwig, Da-Wei Wang, Chao-Yuan Jin, Feng Liu","title":"Wavelength-tunable high-fidelity entangled photon sources enabled by\n  dual Stark effects","comments":"Main text: 10 pages, 5 figures, Supplementary information: 7 pages, 6\n  figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The construction of a large-scale quantum internet requires quantum repeaters\ncontaining multiple entangled photon sources with identical wavelengths.\nSemiconductor quantum dots can generate entangled photon pairs\ndeterministically with high fidelity. However, realizing quantum dot-based\nquantum repeaters faces two difficulties: the non-uniformity of emission\nwavelength and exciton fine-structure splitting induced fidelity reduction.\nTypically, these two factors are not independently tunable, making it\nchallenging to achieve simultaneous improvement. In this work, we demonstrate\nwavelength-tunable entangled photon sources based on droplet-etched GaAs\nquantum dots through the combined use of the AC and quantum-confined Stark\neffects. The emission wavelength can be tuned by ~1 meV while preserving\nentanglement fidelity above 0.955(1) across the entire tuning range. Our work\npaves a way towards robust and scalable on-demand entangled photon sources for\nlarge-scale quantum internet and integrated quantum optical circuits.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:26:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Chen",""],["Yan","Jun-Yong",""],["Babin","Hans-Georg",""],["Lin","Xing",""],["Fang","Wei",""],["Liu","Run-Ze",""],["Huo","Yong-Heng",""],["Sha","Wei E. I.",""],["Zhang","Jiaxiang",""],["Heyn","Christian",""],["Wieck","Andreas D.",""],["Ludwig","Arne",""],["Wang","Da-Wei",""],["Jin","Chao-Yuan",""],["Liu","Feng",""]]}
{"id":"2308.04745","submitter":"Axel Huebl","authors":"Marco Garten, Stepan S. Bulanov, Sahel Hakimi, Lieselotte Obst-Huebl,\n  Chad E. Mitchell, Carl Schroeder, Eric Esarey, Cameron G. R. Geddes, Jean-Luc\n  Vay, Axel Huebl","title":"A Laser-Plasma Ion Beam Booster Based on Hollow-Channel Magnetic Vortex\n  Acceleration","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.comp-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Laser-driven ion acceleration can provide ultra-short, high-charge,\nlow-emittance beams. Although undergoing extensive research, demonstrated\nmaximum energies for laser-ion sources are non-relativistic, complicating\ninjection into high-$\\beta$ accelerator elements and stopping short of\ndesirable energies for pivotal applications, such as proton tumor therapy. In\nthis work, we decouple the efforts towards relativistic beam energies from a\nsingle laser-plasma source via a proof-of-principle concept, boosting the beam\ninto this regime through only a few plasma stages. We employ full 3D\nparticle-in-cell simulations to demonstrate the capability for capture of\nhigh-charge beams as produced by laser-driven sources, where both source and\nbooster stages utilize readily available laser pulse parameters.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:27:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Garten","Marco",""],["Bulanov","Stepan S.",""],["Hakimi","Sahel",""],["Obst-Huebl","Lieselotte",""],["Mitchell","Chad E.",""],["Schroeder","Carl",""],["Esarey","Eric",""],["Geddes","Cameron G. R.",""],["Vay","Jean-Luc",""],["Huebl","Axel",""]]}
{"id":"2308.04746","submitter":"Vadim Guzey","authors":"V. Guzey (Jyvaskyla U. and Helsinki U.)","title":"UPCs as probes of partonic structure -- exclusive and inclusive\n  processes","comments":"10 pages, 2 figures. Proceedings for Hard Probes 2023, Aschaffenburg,\n  Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultraperipheral collisions (UPCs) at the LHC and RHIC provide important new\ninformation on the partonic structure of the proton and nuclei and small-$x$\ndynamics in QCD. We review phenomenological applications of the collinear\nfactorization at leading and next-to-leading orders of perturbative QCD and the\ndipole model to coherent and incoherent $J/\\psi$ photoproduction in Pb-Pb UPCs\nat the LHC emphasizing the strong leading twist gluon nuclear shadowing, the\nrole of quark-antiquark-gluon dipoles, and a possible onset the gluon\nsaturation in nuclei. We also discuss inclusive and diffractive dijet\nphotoproduction in UPCs, which give complementary constraints on nuclear parton\ndistributions and the pattern of factorization breaking in diffraction.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:30:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Guzey","V.","","Jyvaskyla U. and Helsinki U."]]}
{"id":"2308.04747","submitter":"Dali Zangurashvili","authors":"Guram Samsonadze and Dali Zangurashvili","title":"Descent in the dual category of ternary rings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is shown that, in the variety of ternary rings, the elements of\namalgamated free products have unique normal forms, and, moreover, this variety\nsatisfies the strong amalgamation property. Applying these statements,\neffective codescent morphisms of ternary rings are characterized. In view of\nthe fact that the category of ternary rings contains the category of\ncommutative associative unitary rings as a full subcategory, the class of\neffective codescent morphisms in the latter category (which, according to the\nwell-known Joyal-Tierney's criterion, are precisely monomorphisms\n$R\\rightarrowtail S$ which are pure as monomorphisms of $R$-modules) is\ncompared with that of morphisms between commutative associative unitary rings\nwhich are effective codescent in the category of ternary rings. It turns out\nthat the former class is contained in the latter one, but does not coincide\nwith it.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:33:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Samsonadze","Guram",""],["Zangurashvili","Dali",""]]}
{"id":"2308.04748","submitter":"Chunqiu Steven Xia","authors":"Chunqiu Steven Xia, Matteo Paltenghi, Jia Le Tian, Michael Pradel,\n  Lingming Zhang","title":"Universal Fuzzing via Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fuzzing has achieved tremendous success in discovering bugs and\nvulnerabilities in various software systems. Systems under test (SUTs) that\ntake in programming or formal language as inputs, e.g., compilers, runtime\nengines, constraint solvers, and software libraries with accessible APIs, are\nespecially important as they are fundamental building blocks of software\ndevelopment. However, existing fuzzers for such systems often target a specific\nlanguage, and thus cannot be easily applied to other languages or even other\nversions of the same language. Moreover, the inputs generated by existing\nfuzzers are often limited to specific features of the input language, and thus\ncan hardly reveal bugs related to other or new features. This paper presents\nFuzz4All, the first fuzzer that is universal in the sense that it can target\nmany different input languages and many different features of these languages.\nThe key idea behind Fuzz4All is to leverage large language models (LLMs) as an\ninput generation and mutation engine, which enables the approach to produce\ndiverse and realistic inputs for any practically relevant language. To realize\nthis potential, we present a novel autoprompting technique, which creates LLM\nprompts that are wellsuited for fuzzing, and a novel LLM-powered fuzzing loop,\nwhich iteratively updates the prompt to create new fuzzing inputs. We evaluate\nFuzz4All on nine systems under test that take in six different languages (C,\nC++, Go, SMT2, Java and Python) as inputs. The evaluation shows, across all six\nlanguages, that universal fuzzing achieves higher coverage than existing,\nlanguage-specific fuzzers. Furthermore, Fuzz4All has identified 76 bugs in\nwidely used systems, such as GCC, Clang, Z3, CVC5, OpenJDK, and the Qiskit\nquantum computing platform, with 47 bugs already confirmed by developers as\npreviously unknown.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:36:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xia","Chunqiu Steven",""],["Paltenghi","Matteo",""],["Tian","Jia Le",""],["Pradel","Michael",""],["Zhang","Lingming",""]]}
{"id":"2308.04749","submitter":"Bing Han","authors":"Bing Han, Feifei Zhao, Yi Zeng, Wenxuan Pan, Guobin Shen","title":"Enhancing Efficient Continual Learning with Dynamic Structure\n  Development of Spiking Neural Networks","comments":null,"journal-ref":"IJCAI2023 Camera ready","doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Children possess the ability to learn multiple cognitive tasks sequentially,\nwhich is a major challenge toward the long-term goal of artificial general\nintelligence. Existing continual learning frameworks are usually applicable to\nDeep Neural Networks (DNNs) and lack the exploration on more brain-inspired,\nenergy-efficient Spiking Neural Networks (SNNs). Drawing on continual learning\nmechanisms during child growth and development, we propose Dynamic Structure\nDevelopment of Spiking Neural Networks (DSD-SNN) for efficient and adaptive\ncontinual learning. When learning a sequence of tasks, the DSD-SNN dynamically\nassigns and grows new neurons to new tasks and prunes redundant neurons,\nthereby increasing memory capacity and reducing computational overhead. In\naddition, the overlapping shared structure helps to quickly leverage all\nacquired knowledge to new tasks, empowering a single network capable of\nsupporting multiple incremental tasks (without the separate sub-network mask\nfor each task). We validate the effectiveness of the proposed model on multiple\nclass incremental learning and task incremental learning benchmarks. Extensive\nexperiments demonstrated that our model could significantly improve\nperformance, learning speed and memory capacity, and reduce computational\noverhead. Besides, our DSD-SNN model achieves comparable performance with the\nDNNs-based methods, and significantly outperforms the state-of-the-art (SOTA)\nperformance for existing SNNs-based continual learning methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:36:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Han","Bing",""],["Zhao","Feifei",""],["Zeng","Yi",""],["Pan","Wenxuan",""],["Shen","Guobin",""]]}
{"id":"2308.04750","submitter":"Tatsu-Hiko Miura","authors":"Tatsu-Hiko Miura","title":"Approximation of a solution to the stationary Navier-Stokes equations in\n  a curved thin domain by a solution to thin-film limit equations","comments":"32 pages, Literature overview revised and References [6,7] added","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the stationary Navier-Stokes equations in a three-dimensional\ncurved thin domain around a given closed surface under the slip boundary\nconditions. Our aim is to show that a solution to the bulk equations is\napproximated by a solution to limit equations on the surface appearing in the\nthin-film limit of the bulk equations. To this end, we take the average of the\nbulk solution in the thin direction and estimate the difference of the averaged\nbulk solution and the surface solution. Then we combine an obtained difference\nestimate on the surface with an estimate for the difference of the bulk\nsolution and its average to get a difference estimate for the bulk and surface\nsolutions in the thin domain, which shows that the bulk solution is\napproximated by the surface one when the thickness of the thin domain is\nsufficiently small.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:43:03 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 00:47:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Miura","Tatsu-Hiko",""]]}
{"id":"2308.04751","submitter":"Theo Douvropoulos","authors":"Theo Douvropoulos, Joel Brewster Lewis, Alejandro H. Morales","title":"Hurwitz numbers for reflection groups III: Uniform formulas","comments":"36 pages, comments very much welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give uniform formulas for the number of full reflection factorizations of\na parabolic quasi-Coxeter element in a Weyl group or complex reflection group,\ngeneralizing the formula for the genus-0 Hurwitz numbers. This paper is the\nculmination of a series of three.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:43:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Douvropoulos","Theo",""],["Lewis","Joel Brewster",""],["Morales","Alejandro H.",""]]}
{"id":"2308.04752","submitter":"Qiyang Zheng","authors":"Qi-Yang Zheng","title":"New congruences for 4,6-regular partitions modulo primes","comments":"13 pages. v2: Append results for b_4(n) modulo 2, b_6(n) modulo 5","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main result of the paper is the existence of an infinitely many families\nof Ramanujan-type congruences for $b_4(n)$ and $b_6(n)$ modulo primes $m \\geq\n2$ and $m \\geq 5$, respectively. We provide new examples of congruences for\n$b_4(n)$ and $b_6(n)$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:45:37 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 15:29:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zheng","Qi-Yang",""]]}
{"id":"2308.04753","submitter":"Edouard Yvinec","authors":"Edouard Yvinec, Arnaud Dapogny, Kevin Bailly","title":"SAfER: Layer-Level Sensitivity Assessment for Efficient and Robust\n  Neural Network Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks (DNNs) demonstrate outstanding performance across most\ncomputer vision tasks. Some critical applications, such as autonomous driving\nor medical imaging, also require investigation into their behavior and the\nreasons behind the decisions they make. In this vein, DNN attribution consists\nin studying the relationship between the predictions of a DNN and its inputs.\nAttribution methods have been adapted to highlight the most relevant weights or\nneurons in a DNN, allowing to more efficiently select which weights or neurons\ncan be pruned. However, a limitation of these approaches is that weights are\ntypically compared within each layer separately, while some layers might appear\nas more critical than others. In this work, we propose to investigate DNN layer\nimportance, i.e. to estimate the sensitivity of the accuracy w.r.t.\nperturbations applied at the layer level. To do so, we propose a novel dataset\nto evaluate our method as well as future works. We benchmark a number of\ncriteria and draw conclusions regarding how to assess DNN layer importance and,\nconsequently, how to budgetize layers for increased DNN efficiency (with\napplications for DNN pruning and quantization), as well as robustness to\nhardware failure (e.g. bit swaps).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:45:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yvinec","Edouard",""],["Dapogny","Arnaud",""],["Bailly","Kevin",""]]}
{"id":"2308.04754","submitter":"Yuki Ueda Dr.","authors":"Yoshikazu Giga and Yuki Ueda","title":"On a diffusion equation with rupture","comments":"18 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a model to describe an evolution of a bubble cluster with rupture.\nIn a special case, the equation is reduced to a single parabolic equation with\nevaporation for the thickness of a liquid layer covering bubbles. We postulate\nthat a bubble collapses if this liquid layer becomes thin. We call this\ncollapse a rupture. We prove for our model that there is a periodic-in-time\nsolution if the place of rupture occurs only in the largest bubble. Numerical\ntests indicate that there may not exist a periodic solution if such an\nassumption is violated.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:45:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Giga","Yoshikazu",""],["Ueda","Yuki",""]]}
{"id":"2308.04755","submitter":"Lukas Prediger","authors":"Lukas Prediger, Joonas J\\\"alk\\\"o, Antti Honkela, Samuel Kaski","title":"Collaborative Learning From Distributed Data With Differentially Private\n  Synthetic Twin Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Consider a setting where multiple parties holding sensitive data aim to\ncollaboratively learn population level statistics, but pooling the sensitive\ndata sets is not possible. We propose a framework in which each party shares a\ndifferentially private synthetic twin of their data. We study the feasibility\nof combining such synthetic twin data sets for collaborative learning on\nreal-world health data from the UK Biobank. We discover that parties engaging\nin the collaborative learning via shared synthetic data obtain more accurate\nestimates of target statistics compared to using only their local data. This\nfinding extends to the difficult case of small heterogeneous data sets.\nFurthermore, the more parties participate, the larger and more consistent the\nimprovements become. Finally, we find that data sharing can especially help\nparties whose data contain underrepresented groups to perform better-adjusted\nanalysis for said groups. Based on our results we conclude that sharing of\nsynthetic twins is a viable method for enabling learning from sensitive data\nwithout violating privacy constraints even if individual data sets are small or\ndo not represent the overall population well. The setting of distributed\nsensitive data is often a bottleneck in biomedical research, which our study\nshows can be alleviated with privacy-preserving collaborative learning methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:47:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Prediger","Lukas",""],["J\u00e4lk\u00f6","Joonas",""],["Honkela","Antti",""],["Kaski","Samuel",""]]}
{"id":"2308.04756","submitter":"Xiaodong Yu","authors":"Xiaodong Yu, Ben Zhou, Dan Roth","title":"Building Interpretable and Reliable Open Information Retriever for New\n  Domains Overnight","comments":"Submission of ACL 2023. Rejected","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Information retrieval (IR) or knowledge retrieval, is a critical component\nfor many down-stream tasks such as open-domain question answering (QA). It is\nalso very challenging, as it requires succinctness, completeness, and\ncorrectness. In recent works, dense retrieval models have achieved\nstate-of-the-art (SOTA) performance on in-domain IR and QA benchmarks by\nrepresenting queries and knowledge passages with dense vectors and learning the\nlexical and semantic similarity. However, using single dense vectors and\nend-to-end supervision are not always optimal because queries may require\nattention to multiple aspects and event implicit knowledge. In this work, we\npropose an information retrieval pipeline that uses entity/event linking model\nand query decomposition model to focus more accurately on different information\nunits of the query. We show that, while being more interpretable and reliable,\nour proposed pipeline significantly improves passage coverages and denotation\naccuracies across five IR and QA benchmarks. It will be the go-to system to use\nfor applications that need to perform IR on a new domain without much dedicated\neffort, because of its superior interpretability and cross-domain performance.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:47:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yu","Xiaodong",""],["Zhou","Ben",""],["Roth","Dan",""]]}
{"id":"2308.04757","submitter":"Daniel Bartl","authors":"Daniel Bartl and Shahar Mendelson","title":"On a variance dependent Dvoretzky-Kiefer-Wolfowitz inequality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be a real-valued random variable with distribution function $F$. Set\n$X_1,\\dots, X_m$ to be independent copies of $X$ and let $F_m$ be the\ncorresponding empirical distribution function. We show that there are absolute\nconstants $c_0$ and $c_1$ such that if $\\Delta \\geq c_0\\frac{\\log\\log m}{m}$,\nthen with probability at least $1-2\\exp(-c_1\\Delta m)$, for every\n$t\\in\\mathbb{R}$ that satisfies $F(t)\\in[\\Delta,1-\\Delta]$, \\[ |F_m(t) - F(t) |\n\\leq \\sqrt{\\Delta \\min\\{F(t),1-F(t)\\} } .\\] Moreover, this estimate is optimal\nup to the multiplicative constants $c_0$ and $c_1$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:48:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bartl","Daniel",""],["Mendelson","Shahar",""]]}
{"id":"2308.04758","submitter":"Wenguan Wang","authors":"Rui Liu, Xiaohan Wang, Wenguan Wang, Yi Yang","title":"Bird's-Eye-View Scene Graph for Vision-Language Navigation","comments":"Accepted at ICCV 2023; Project page:\n  https://github.com/DefaultRui/BEV-Scene-Graph","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision-language navigation (VLN), which entails an agent to navigate 3D\nenvironments following human instructions, has shown great advances. However,\ncurrent agents are built upon panoramic observations, which hinders their\nability to perceive 3D scene geometry and easily leads to ambiguous selection\nof panoramic view. To address these limitations, we present a BEV Scene Graph\n(BSG), which leverages multi-step BEV representations to encode scene layouts\nand geometric cues of indoor environment under the supervision of 3D detection.\nDuring navigation, BSG builds a local BEV representation at each step and\nmaintains a BEV-based global scene map, which stores and organizes all the\nonline collected local BEV representations according to their topological\nrelations. Based on BSG, the agent predicts a local BEV grid-level decision\nscore and a global graph-level decision score, combined with a sub-view\nselection score on panoramic views, for more accurate action prediction. Our\napproach significantly outperforms state-of-the-art methods on REVERIE, R2R,\nand R4R, showing the potential of BEV perception in VLN.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:48:20 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 08:29:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Rui",""],["Wang","Xiaohan",""],["Wang","Wenguan",""],["Yang","Yi",""]]}
{"id":"2308.04759","submitter":"Yusaku Nishimura","authors":"Yusaku Nishimura","title":"Pancyclic property of Paley graph","comments":"Corrected the formatting of the references. Corrected the \"Cref\"\n  behavior, which is latex command. Add another proof of the pancyclicity of\n  Paley graph, which is already known. Change the title","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be an undirected graph of order $n$ and let $C_i$ be an $i$-cycle\ngraph. $G$ is called pancyclic if $G$ contains a $C_i$ for any $i\\in\n\\{3,4,\\ldots,n\\}$. The Paley graph of order $q$ is a graph whose vertex set is\nthe finite field $\\mathbb{F}_q$, where $q\\equiv 1\\pmod{4}$. In this graph, two\nvertices, $a$ and $b$, are adjacent if and only if $a-b$ is nonzero square in\n$\\mathbb{F}_q$. We prove that Paley graph of order $q$ is pancyclic for any $q\n\\neq 5$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:49:03 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 05:20:18 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 11:27:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nishimura","Yusaku",""]]}
{"id":"2308.04760","submitter":"Nelson de Moura Martins Gomes","authors":"Katherine Evans (IRCAI), Nelson de Moura (ASTRA), Raja Chatila (ISIR),\n  St\\'ephane Chauvier (SND)","title":"Automated Driving Without Ethics: Meaning, Design and Real-World\n  Implementation","comments":"Chapter 7 of the book Connected and Automated Vehicles: Integrating\n  Engineering and Ethics (https://link.springer.com/book/9783031399909)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ethics of automated vehicles (AV) has received a great amount of\nattention in recent years, specifically in regard to their decisional policies\nin accident situations in which human harm is a likely consequence. After a\ndiscussion about the pertinence and cogency of the term 'artificial moral\nagent' to describe AVs that would accomplish these sorts of decisions, and\nstarting from the assumption that human harm is unavoidable in some situations,\na strategy for AV decision making is proposed using only pre-defined parameters\nto characterize the risk of possible accidents and also integrating the Ethical\nValence Theory, which paints AV decision-making as a type of claim mitigation,\ninto multiple possible decision rules to determine the most suitable action\ngiven the specific environment and decision context. The goal of this approach\nis not to define how moral theory requires vehicles to behave, but rather to\nprovide a computational approach that is flexible enough to accommodate a\nnumber of human 'moral positions' concerning what morality demands and what\nroad users may expect, offering an evaluation tool for the social acceptability\nof an automated vehicle's decision making.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:49:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Evans","Katherine","","IRCAI"],["de Moura","Nelson","","ASTRA"],["Chatila","Raja","","ISIR"],["Chauvier","St\u00e9phane","","SND"]]}
{"id":"2308.04761","submitter":"Zijian Li","authors":"Zijian Li, Yuchang Sun, Jiawei Shao, Yuyi Mao, Jessie Hui Wang, Jun\n  Zhang","title":"Feature Matching Data Synthesis for Non-IID Federated Learning","comments":"16 pages","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) has emerged as a privacy-preserving paradigm that\ntrains neural networks on edge devices without collecting data at a central\nserver. However, FL encounters an inherent challenge in dealing with\nnon-independent and identically distributed (non-IID) data among devices. To\naddress this challenge, this paper proposes a hard feature matching data\nsynthesis (HFMDS) method to share auxiliary data besides local models.\nSpecifically, synthetic data are generated by learning the essential\nclass-relevant features of real samples and discarding the redundant features,\nwhich helps to effectively tackle the non-IID issue. For better privacy\npreservation, we propose a hard feature augmentation method to transfer real\nfeatures towards the decision boundary, with which the synthetic data not only\nimprove the model generalization but also erase the information of real\nfeatures. By integrating the proposed HFMDS method with FL, we present a novel\nFL framework with data augmentation to relieve data heterogeneity. The\ntheoretical analysis highlights the effectiveness of our proposed data\nsynthesis method in solving the non-IID challenge. Simulation results further\ndemonstrate that our proposed HFMDS-FL algorithm outperforms the baselines in\nterms of accuracy, privacy preservation, and computational cost on various\nbenchmark datasets.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:49:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Zijian",""],["Sun","Yuchang",""],["Shao","Jiawei",""],["Mao","Yuyi",""],["Wang","Jessie Hui",""],["Zhang","Jun",""]]}
{"id":"2308.04762","submitter":"Kota Maejima","authors":"Kota Maejima, Takayuki Nishio, Asato Yamazaki, and Yuko Hara-Azumi","title":"Tram-FL: Routing-based Model Training for Decentralized Federated\n  Learning","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.DC cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In decentralized federated learning (DFL), substantial traffic from frequent\ninter-node communication and non-independent and identically distributed\n(non-IID) data challenges high-accuracy model acquisition. We propose Tram-FL,\na novel DFL method, which progressively refines a global model by transferring\nit sequentially amongst nodes, rather than by exchanging and aggregating local\nmodels. We also introduce a dynamic model routing algorithm for optimal route\nselection, aimed at enhancing model precision with minimal forwarding. Our\nexperiments using MNIST, CIFAR-10, and IMDb datasets demonstrate that Tram-FL\nwith the proposed routing delivers high model accuracy under non-IID\nconditions, outperforming baselines while reducing communication costs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:51:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Maejima","Kota",""],["Nishio","Takayuki",""],["Yamazaki","Asato",""],["Hara-Azumi","Yuko",""]]}
{"id":"2308.04763","submitter":"Lionel Fontan","authors":"Lionel Fontan, Typhanie Prince (Praxiling, LNPL), Aleksandra\n  Nowakowska (Praxiling), Halima Sahraoui (LNPL), Silvia Martinez-Ferreiro","title":"Automatically measuring speech fluency in people with aphasia: first\n  achievements using read-speech data","comments":"Aphasiology, (2023)","journal-ref":null,"doi":"10.1080/02687038.2023.2244728","report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Background: Speech and language pathologists (SLPs) often relyon judgements\nof speech fluency for diagnosing or monitoringpatients with aphasia. However,\nsuch subjective methods havebeen criticised for their lack of reliability and\ntheir clinical cost interms of time. Aims: This study aims at assessing the\nrelevance of a signalprocessingalgorithm, initially developed in the field of\nlanguage acquisition, for the automatic measurement of speech fluency in people\nwith aphasia (PWA). Methods & Procedures: Twenty-nine PWA and five control\nparticipantswere recruited via non-profit organizations and SLP networks. All\nparticipants were recorded while reading out loud a set ofsentences taken from\nthe French version of the Boston Diagnostic Aphasia Examination. Three trained\nSLPs assessed the fluency of each sentence on a five-point qualitative scale. A\nforward-backward divergence segmentation and a clustering algorithm were used\nto compute, for each sentence, four automatic predictors of speech fluency:\npseudo-syllable rate, speech ratio, rate of silent breaks, and standard\ndeviation of pseudo-syllable length. The four predictors were finally combined\ninto multivariate regression models (a multiplelinear regression - MLR, and two\nnon-linear models) to predict the average SLP ratings of speech fluency, using\na leave-one speaker-out validation scheme. Outcomes & Results: All models\nachieved accurate predictions of speech fluency ratings, with average\nroot-mean-square errors as low as 0.5. The MLR yielded a correlation\ncoefficient of 0.87 with reference ratings at the sentence level, and of 0.93\nwhen aggregating the data for each participant. The inclusion of an additional\npredictor sensitive to repetitions improved further the predictions with a\ncorrelation coefficient of 0.91 at the sentence level, and of 0.96 at the\nparticipant level. Conclusions: The algorithms used in this study can\nconstitute a cost-effective and reliable tool for the assessment of the speech\nfluency of patients with aphasia in read-aloud tasks. Perspectives for the\nassessment of spontaneous speech are discussed.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:51:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Fontan","Lionel","","Praxiling, LNPL"],["Prince","Typhanie","","Praxiling, LNPL"],["Nowakowska","Aleksandra","","Praxiling"],["Sahraoui","Halima","","LNPL"],["Martinez-Ferreiro","Silvia",""]]}
{"id":"2308.04764","submitter":"Georges Gras","authors":"Georges Gras (LMB)","title":"Exceptional case of the non semi-simple Real Abelian Main Conjecture","comments":"Complements to arXiv:2306.12836 and arXiv:2207.13911 when $K$\n  contains a field of $p$-power conductor","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the papers: \"The Chevalley--Herbrand formula and the real abelian Main\nConjecture (New criterion using capitulation of the class group),J. Number\nTheory 248 (2023)\" and \"On the real abelian main conjecture in the non\nsemi-simple case, arXiv (2023)\", we consider real cyclic fields $K$ and primes\n$\\ell \\equiv 1 \\pmod {2p^N}$ totally inert in $K$, implying implicitly, $K \\cap\n\\mathbb{Q}(\\mu_{p^\\infty}^{})^+ = \\mathbb{Q}$. In this complementary work, we\nexamine the non linearly disjoint case.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:53:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gras","Georges","","LMB"]]}
{"id":"2308.04765","submitter":"Qiushi Guo","authors":"Qiushi Guo, Shisha Liao","title":"FaceSkin: A Privacy Preserving Facial skin patch Dataset for multi\n  Attributes classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human facial skin images contain abundant textural information that can serve\nas valuable features for attribute classification, such as age, race, and\ngender. Additionally, facial skin images offer the advantages of easy\ncollection and minimal privacy concerns. However, the availability of\nwell-labeled human skin datasets with a sufficient number of images is limited.\nTo address this issue, we introduce a dataset called FaceSkin, which\nencompasses a diverse range of ages and races. Furthermore, to broaden the\napplication scenarios, we incorporate synthetic skin-patches obtained from 2D\nand 3D attack images, including printed paper, replays, and 3D masks. We\nevaluate the FaceSkin dataset across distinct categories and present\nexperimental results demonstrating its effectiveness in attribute\nclassification, as well as its potential for various downstream tasks, such as\nFace anti-spoofing and Age estimation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:53:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Guo","Qiushi",""],["Liao","Shisha",""]]}
{"id":"2308.04766","submitter":"Johan Lin{\\aa}ker","authors":"Johan Lin{\\aa}ker, Gregorio Robles, Deborah Bryant, Sachiko Muto","title":"Open Source Software in the Public Sector: 25 years and still in its\n  infancy","comments":null,"journal-ref":"IEEE Software, 40(4), 39-44 (2023)","doi":"10.1109/MS.2023.3266105","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proliferation of Open Source Software (OSS) adoption and collaboration\nhas surged within industry, resulting in its ubiquitous presence in commercial\nofferings and shared digital infrastructure. However, in the public sector,\nboth awareness and adoption of OSS is still in its infancy due to a number of\nobstacles including regulatory, cultural, and capacity-related challenges. This\nspecial issue is a call for action, highlighting the necessity for both\nresearch and practice to narrow the gap, selectively transfer and adapt\nexisting knowledge, as well as generate new knowledge to enable the public\nsector to fully harness the potential benefits OSS has to offer.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:54:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lin\u00e5ker","Johan",""],["Robles","Gregorio",""],["Bryant","Deborah",""],["Muto","Sachiko",""]]}
{"id":"2308.04767","submitter":"Tianyu Liu","authors":"Tianyu Liu, Peng Zhang, Wei Huang, Yufei Zha, Tao You, Yanning Zhang","title":"Induction Network: Audio-Visual Modality Gap-Bridging for\n  Self-Supervised Sound Source Localization","comments":"Accepted to ACM Multimedia 2023","journal-ref":null,"doi":"10.1145/3581783.3612502","report-no":null,"categories":"cs.CV cs.AI cs.MM cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised sound source localization is usually challenged by the\nmodality inconsistency. In recent studies, contrastive learning based\nstrategies have shown promising to establish such a consistent correspondence\nbetween audio and sound sources in visual scenarios. Unfortunately, the\ninsufficient attention to the heterogeneity influence in the different modality\nfeatures still limits this scheme to be further improved, which also becomes\nthe motivation of our work. In this study, an Induction Network is proposed to\nbridge the modality gap more effectively. By decoupling the gradients of visual\nand audio modalities, the discriminative visual representations of sound\nsources can be learned with the designed Induction Vector in a bootstrap\nmanner, which also enables the audio modality to be aligned with the visual\nmodality consistently. In addition to a visual weighted contrastive loss, an\nadaptive threshold selection strategy is introduced to enhance the robustness\nof the Induction Network. Substantial experiments conducted on SoundNet-Flickr\nand VGG-Sound Source datasets have demonstrated a superior performance compared\nto other state-of-the-art works in different challenging scenarios. The code is\navailable at https://github.com/Tahy1/AVIN\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:55:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Tianyu",""],["Zhang","Peng",""],["Huang","Wei",""],["Zha","Yufei",""],["You","Tao",""],["Zhang","Yanning",""]]}
{"id":"2308.04768","submitter":"Guoxian Yu","authors":"Yunfeng Zhao, Xu Yan, Xiaoqiang Gui, Shuguang Han, Xiang-Rong Sheng,\n  Guoxian Yu, Jufeng Chen, Zhao Xu, Bo Zheng","title":"Entire Space Cascade Delayed Feedback Modeling for Effective Conversion\n  Rate Prediction","comments":"Accepted to CIKM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conversion rate (CVR) prediction is an essential task for large-scale\ne-commerce platforms. However, refund behaviors frequently occur after\nconversion in online shopping systems, which drives us to pay attention to\neffective conversion for building healthier shopping services. This paper\ndefines the probability of item purchasing without any subsequent refund as an\neffective conversion rate (ECVR). A simple paradigm for ECVR prediction is to\ndecompose it into two sub-tasks: CVR prediction and post-conversion refund rate\n(RFR) prediction. However, RFR prediction suffers from data sparsity (DS) and\nsample selection bias (SSB) issues, as the refund behaviors are only available\nafter user purchase. Furthermore, there is delayed feedback in both conversion\nand refund events and they are sequentially dependent, named cascade delayed\nfeedback (CDF), which significantly harms data freshness for model training.\nPrevious studies mainly focus on tackling DS and SSB or delayed feedback for a\nsingle event. To jointly tackle these issues in ECVR prediction, we propose an\nEntire space CAscade Delayed feedback modeling (ECAD) method. Specifically,\nECAD deals with DS and SSB by constructing two tasks including CVR prediction\nand conversion \\& refund rate (CVRFR) prediction using the entire space\nmodeling framework. In addition, it carefully schedules auxiliary tasks to\nleverage both conversion and refund time within data to alleviate CDF.\nExperimental results on the offline industrial dataset and online A/B testing\ndemonstrate the effectiveness of ECAD. In addition, ECAD has been deployed in\none of the recommender systems in Alibaba, contributing to a significant\nimprovement of ECVR.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:56:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhao","Yunfeng",""],["Yan","Xu",""],["Gui","Xiaoqiang",""],["Han","Shuguang",""],["Sheng","Xiang-Rong",""],["Yu","Guoxian",""],["Chen","Jufeng",""],["Xu","Zhao",""],["Zheng","Bo",""]]}
{"id":"2308.04769","submitter":"Ryo Hidaka","authors":"Ryo Hidaka, Yohei Hamakawa, Jun Nakayama, and Kosuke Tatsumura","title":"Correlation-diversified portfolio construction by finding maximum\n  independent set in large-scale market graph","comments":"14 pages, 9 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET cs.CE q-fin.PM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Correlation-diversified portfolios can be constructed by finding the maximum\nindependent sets (MISs) in market graphs with edges corresponding to\ncorrelations between two stocks. The computational complexity to find the MIS\nincreases exponentially as the size of the market graph increases, making the\nMIS selection in a large-scale market graph difficult. Here we construct a\ndiversified portfolio by solving the MIS problem for a large-scale market graph\nwith a combinatorial optimization solver (an Ising machine) based on a\nquantum-inspired algorithm called simulated bifurcation (SB) and investigate\nthe investment performance of the constructed portfolio using long-term\nhistorical market data. Comparisons using stock universes of various sizes\n[TOPIX 100, Nikkei 225, TOPIX 1000, and TOPIX (including approximately 2,000\nconstituents)] show that the SB-based solver outperforms conventional MIS\nsolvers in terms of computation-time and solution-accuracy. By using the\nSB-based solver, we optimized the parameters of a MIS portfolio strategy\nthrough iteration of the backcast simulation that calculates the performance of\nthe MIS portfolio strategy based on a large-scale universe covering more than\n1,700 Japanese stocks for a long period of 10 years. It has been found that the\nbest MIS portfolio strategy (Sharpe ratio = 1.16, annualized return/risk =\n16.3%/14.0%) outperforms the major indices such as TOPIX (0.66, 10.0%/15.2%)\nand MSCI Japan Minimum Volatility Index (0.64, 7.7%/12.1%) for the period from\n2013 to 2023.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:57:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hidaka","Ryo",""],["Hamakawa","Yohei",""],["Nakayama","Jun",""],["Tatsumura","Kosuke",""]]}
{"id":"2308.04770","submitter":"Xin Liu","authors":"Xin Liu, Fatemeh Karimi Nejadasl, Jan C. van Gemert, Olaf Booij,\n  Silvia L. Pintea","title":"Objects do not disappear: Video object detection by single-frame object\n  location anticipation","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Objects in videos are typically characterized by continuous smooth motion. We\nexploit continuous smooth motion in three ways. 1) Improved accuracy by using\nobject motion as an additional source of supervision, which we obtain by\nanticipating object locations from a static keyframe. 2) Improved efficiency by\nonly doing the expensive feature computations on a small subset of all frames.\nBecause neighboring video frames are often redundant, we only compute features\nfor a single static keyframe and predict object locations in subsequent frames.\n3) Reduced annotation cost, where we only annotate the keyframe and use smooth\npseudo-motion between keyframes. We demonstrate computational efficiency,\nannotation efficiency, and improved mean average precision compared to the\nstate-of-the-art on four datasets: ImageNet VID, EPIC KITCHENS-55,\nYouTube-BoundingBoxes, and Waymo Open dataset. Our source code is available at\nhttps://github.com/L-KID/Videoobject-detection-by-location-anticipation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:57:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Xin",""],["Nejadasl","Fatemeh Karimi",""],["van Gemert","Jan C.",""],["Booij","Olaf",""],["Pintea","Silvia L.",""]]}
{"id":"2308.04771","submitter":"Alexandre Zouaoui","authors":"Behnood Rasti (HZDR), Alexandre Zouaoui (Thoth), Julien Mairal\n  (Thoth), Jocelyn Chanussot (Thoth)","title":"SUnAA: Sparse Unmixing using Archetypal Analysis","comments":null,"journal-ref":"IEEE Geoscience and Remote Sensing Letters, 2023, 20, pp.1-5","doi":"10.1109/LGRS.2023.3284221","report-no":null,"categories":"cs.CV cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a new sparse unmixing technique using archetypal\nanalysis (SUnAA). First, we design a new model based on archetypal analysis. We\nassume that the endmembers of interest are a convex combination of endmembers\nprovided by a spectral library and that the number of endmembers of interest is\nknown. Then, we propose a minimization problem. Unlike most conventional sparse\nunmixing methods, here the minimization problem is non-convex. We minimize the\noptimization objective iteratively using an active set algorithm. Our method is\nrobust to the initialization and only requires the number of endmembers of\ninterest. SUnAA is evaluated using two simulated datasets for which results\nconfirm its better performance over other conventional and advanced techniques\nin terms of signal-to-reconstruction error. SUnAA is also applied to Cuprite\ndataset and the results are compared visually with the available geological map\nprovided for this dataset. The qualitative assessment demonstrates the\nsuccessful estimation of the minerals abundances and significantly improves the\ndetection of dominant minerals compared to the conventional regression-based\nsparse unmixing methods. The Python implementation of SUnAA can be found at:\nhttps://github.com/BehnoodRasti/SUnAA.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:58:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rasti","Behnood","","HZDR"],["Zouaoui","Alexandre","","Thoth"],["Mairal","Julien","","Thoth"],["Chanussot","Jocelyn","","Thoth"]]}
{"id":"2308.04772","submitter":"Pieremanuele Canepa","authors":"Ziliang Wang, Tara P. Mishra, Weihang Xie, Zeyu Deng, Gopalakrishnan\n  Sai Gautam, Anthony K. Cheetham and Pieremanuele Canepa","title":"Kinetic Monte Carlo Simulations of Sodium Ion Transport in NaSICON\n  Electrodes","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":"  The development of high-performance sodium (Na) ion batteries requires\nimproved electrode materials. The energy and power densities of Na superionic\nconductor (NaSICON) electrode materials are promising for large-scale energy\nstorage applications. However, several practical issues limit the full\nutilization of the theoretical energy densities of NaSICON electrodes. A\npressing challenge lies in the limited sodium extraction in low Na content\nNaSICONs, e.g., $\\rm Na_1V^{IV}V^{IV}(PO_4)_3 \\leftrightarrow\nV^{V}V^{IV}(PO_4)_3 + 1e^- + 1Na^+$. Hence, it is important to quantify the\nNa-ion mobility in a broad range of NaSICON electrodes. Using a kinetic Monte\nCarlo approach bearing the accuracy of first-principles calculations, we\nelucidate the variability of Na-ion transport vs. Na content in three important\nNaSICON electrodes, Na$_{\\rm x}$Ti$_{2}$(PO$_{4}$)$_{3}$, Na$_{\\rm\nx}$V$_{2}$(PO$_{4}$)$_{3}$, and Na$_{\\rm x}$Cr$_{2}$(PO$_{4}$)$_{3}$. Our study\nsuggests that Na$^+$ transport in NaSICON electrodes is almost entirely\ndetermined by the local electrostatic and chemical environment set by the\ntransition metal and the polyanionic scaffold. The competition with the\nordering-disordering phenomena of Na-vacancies also plays a role in influencing\nNa-transport. We link the variations in the Na$^+$ kinetic properties by\nanalyzing the competition of ligand field stabilization transition metal ions\nand their ionic radii. We interpret the limited Na-extraction at $x = 1$\nobserved experimentally by gaining insights into the local Na-vacancy\ninterplay. We propose that targeted chemical substitutions of transition metals\ndisrupting local charge arrangements will be critical to reducing the\noccurrence of strong Na$^+$-vacancy orderings at low Na concentrations, thus,\nexpanding the accessible capacities of these electrode materials.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 07:58:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Ziliang",""],["Mishra","Tara P.",""],["Xie","Weihang",""],["Deng","Zeyu",""],["Gautam","Gopalakrishnan Sai",""],["Cheetham","Anthony K.",""],["Canepa","Pieremanuele",""]]}
{"id":"2308.04773","submitter":"Gilberto Ramalho","authors":"G. Ramalho and K. Tsushima","title":"Meson cloud contributions to the Dalitz decays of decuplet to octet\n  baryons","comments":"29 pages, 8 figures, 11 tables","journal-ref":null,"doi":null,"report-no":"LFTC-23-5/78","categories":"hep-ph hep-ex hep-lat nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the role of the meson cloud on the electromagnetic transitions from\ndecuplet ($B'$) to octet ($B$) baryons in terms of the squared four-momentum\ntransfer $q^2$. In the quark model framework, the meson cloud dressing of the\nquark cores gives important contributions to the $\\gamma^\\ast N \\to\n\\Delta(1232)$ transition form factors. In the present work, we estimate the\nmeson cloud contributions of all decuplet to octet baryon transitions\n($\\gamma^\\ast B \\to B'$ or $B' \\to \\gamma^\\ast B$). Models that combine valence\nquark effects with pion and kaon cloud dressing provide a fair description of\nthe radiative decays of decuplet to octet baryons, namely the $\\Sigma^0(1385)\n\\to \\gamma \\Lambda (1116)$ and $\\Sigma^+(1385) \\to \\gamma \\Sigma^+ (1193)$\ndecays. Previous studies indicated the relevance of the pion cloud effects on\nthe $B^\\prime \\to \\gamma^\\ast B$ transition, but also suggested that the kaon\ncloud contributions may be important in the timelike region. We combine then\nthe contributions of the bare core, estimated by a covariant quark model, with\n$q^2$-dependent contributions of pion and kaon clouds. We use the framework to\ncalculate the Dalitz decay rates and the Dalitz decay widths of decuplet\nbaryons in octet baryons with di-electrons ($B' \\to e^+ e^- B$) or di-muons\n($B' \\to \\mu^+ \\mu^- B$). We conclude, based on the magnitude of our results,\nthat most estimates of the $B' \\to e^+ e^- B$ Dalitz decay widths may be tested\nat HADES and PANDA (GSI) in a near future. We discuss also the possibility of\nmeasuring the $\\Delta (1232) \\to \\mu^+ \\mu^- N$ and $\\Sigma^0 (1385) \\to \\mu^+\n\\mu^- \\Lambda (1116)$ decay widths in some facilities, based on the estimated\nbranching ratios.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:01:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ramalho","G.",""],["Tsushima","K.",""]]}
{"id":"2308.04774","submitter":"Jiashun Suo","authors":"Jiashun Suo, Xingzhou Zhang, Weisong Shi, Wei Zhou","title":"E3-UAV: An Edge-based Energy-Efficient Object Detection System for\n  Unmanned Aerial Vehicles","comments":"16 pages, 8 figures","journal-ref":"IEEE Internet of Things Journal, Early Access 1-1 (2023)","doi":"10.1109/JIOT.2023.3301623","report-no":null,"categories":"cs.RO cs.AI cs.CV cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the advances in deep learning techniques, the application of\nUnmanned Aerial Vehicle (UAV)-based object detection has proliferated across a\nrange of fields, including vehicle counting, fire detection, and city\nmonitoring. While most existing research studies only a subset of the\nchallenges inherent to UAV-based object detection, there are few studies that\nbalance various aspects to design a practical system for energy consumption\nreduction. In response, we present the E3-UAV, an edge-based energy-efficient\nobject detection system for UAVs. The system is designed to dynamically support\nvarious UAV devices, edge devices, and detection algorithms, with the aim of\nminimizing energy consumption by deciding the most energy-efficient flight\nparameters (including flight altitude, flight speed, detection algorithm, and\nsampling rate) required to fulfill the detection requirements of the task. We\nfirst present an effective evaluation metric for actual tasks and construct a\ntransparent energy consumption model based on hundreds of actual flight data to\nformalize the relationship between energy consumption and flight parameters.\nThen we present a lightweight energy-efficient priority decision algorithm\nbased on a large quantity of actual flight data to assist the system in\ndeciding flight parameters. Finally, we evaluate the performance of the system,\nand our experimental results demonstrate that it can significantly decrease\nenergy consumption in real-world scenarios. Additionally, we provide four\ninsights that can assist researchers and engineers in their efforts to study\nUAV-based object detection further.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:02:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Suo","Jiashun",""],["Zhang","Xingzhou",""],["Shi","Weisong",""],["Zhou","Wei",""]]}
{"id":"2308.04775","submitter":"The ATLAS Collaboration","authors":"The ATLAS Collaboration","title":"Combined measurement of the Higgs boson mass from the $H\\to\\gamma\\gamma$\n  and $H\\to ZZ^{*} \\to 4\\ell$ decay channels with the ATLAS detector using\n  $\\sqrt{s}$ = 7, 8 and 13 TeV $pp$ collision data","comments":"28 pages in total, author list starting page 10, 2 figures, 1 table,\n  submitted to Phys. Rev. Lett. All figures including auxiliary figures will be\n  available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/HIGG-2022-20/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-156","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A measurement of the mass of the Higgs boson combining the $H\\to ZZ^{*} \\to\n4\\ell$ and $H\\to\\gamma\\gamma$ decay channels is presented. The result is based\non 140 fb$^{-1}$ of proton-proton collision data collected by the ATLAS\ndetector during LHC Run 2 at a centre-of-mass energy of 13 TeV combined with\nthe Run 1 ATLAS mass measurement, yielding a Higgs boson mass of 125.11 $\\pm$\n0.09 (stat.) $\\pm$ 0.06 (syst.) = 125.11 $\\pm$ 0.11 GeV. This corresponds to a\n0.09 % precision achieved on this fundamental parameter of the Standard Model\nof particle physics.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:03:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["The ATLAS Collaboration","",""]]}
{"id":"2308.04776","submitter":"Shaohua Guan","authors":"Shaohua Guan, Zhichao Zhang, Zihan Zhang, Hualin Shi","title":"Universal scaling relation and criticality in bacterial metabolism and\n  growth","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The metabolic network plays a crucial role in regulating bacterial metabolism\nand growth, but it is subject to inherent molecular stochasticity. Previous\nstudies have utilized flux balance analysis and the maximum entropy method to\npredict metabolic fluxes and growth rates, while the underlying principles\ngoverning bacterial metabolism and growth, especially the criticality\nhypothesis, remain unclear. In this study, we employ a maximum entropy approach\nto investigate the universality in various constraint-based metabolic networks\nof Escherichia coli. Our findings reveal the existence of universal scaling\nrelations across different nutritional environments and metabolic network\nmodels, similar to the universality observed in physics. By analyzing\nsingle-cell data, we confirm that bacterial metabolism operates close to the\nstate with maximum Fisher information, which serves as a signature of\ncriticality. This critical state provides functional advantages such as high\nsensitivity and long-range correlation. Moreover, we demonstrate that a\nmetabolic system operating at criticality achieves an optimal balance between\ngrowth and adaptation, thereby serving as a survival strategy in fluctuating\nenvironments.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:03:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Guan","Shaohua",""],["Zhang","Zhichao",""],["Zhang","Zihan",""],["Shi","Hualin",""]]}
{"id":"2308.04777","submitter":"Jino George Dr.","authors":"Akhila Kadyan (1), Monu P. Suresh (1), Ben Johns (1) and Jino George\n  (1), ((1) Department of Chemical Sciences, Indian Institute of Science\n  Education and Research (IISER) Mohali, Punjab, India)","title":"Understanding the Nature of Vibro-Polaritonic States in Water and Heavy\n  Water","comments":"20 Pages, 5 figures in the main text","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  One of the most popular subjects now being researched in molecular science is\nstrong light-matter coupling. The introduction of vibrational strong coupling\nand the formation vibro-polaritonic states tend to modify chemical reactivity,\nenergy transfer, and many other physical properties of the coupled system. This\nis achieved without external stimuli and is very sensitive to the vibrational\nenvelope of the molecular transition. Water is an excellent vibrational\noscillator, which is being used for similar experiments. However, the\ninhomogeneously broad OH/OD stretching vibrational band make it complicated to\ncharacterize the vibro-polaritonic states spectroscopically. In this paper, we\nperformed vibrational strong coupling and mapped the evolution of\nvibro-polaritonic branches from low to high concentration of H2O and measured\nthe on-set of strong coupling. The refractive index dispersion is correlated\nwith the cavity tuning experiments. These results are further compared with\ntransfer matrix simulations. Simulated data deviate as noted in the dispersion\nspectra as the system enters into ultra-strong coupling condition. A simple\noscillator strength correction is made to include the self-dipolar interaction.\nHopfield coefficients are also calculated, showing that even at 400 cm-1\ndetuning, the vibro-polaritonic states still possess light and matter\ncomponents. Here, we systematically varied the concentration of H2O and mapped\nthe weak, intermediate, and strong coupling regimes to understand the role of\ninhomogeneously broad OH/OD stretching vibrational band. Our finding may help\nto better understand the role of H2O/D2O strong coupling in the recent\npolaritonic chemistry experiments.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:05:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kadyan","Akhila",""],["Suresh","Monu P.",""],["Johns","Ben",""],["George","Jino",""]]}
{"id":"2308.04778","submitter":"Yasser KHALAFAOUI","authors":"Yasser Khalafaoui (Alteca, ETIS - UMR 8051, CY), Nistor Grozavu (ETIS\n  - UMR 8051, CY), Basarab Matei (LIPN), Laurent-Walter Goix","title":"Multi-modal Multi-view Clustering based on Non-negative Matrix\n  Factorization","comments":null,"journal-ref":"2022 IEEE Symposium Series on Computational Intelligence (SSCI),\n  Dec 2022, Singapore, Singapore. pp.1386-1391","doi":"10.1109/SSCI51031.2022.10022129","report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By combining related objects, unsupervised machine learning techniques aim to\nreveal the underlying patterns in a data set. Non-negative Matrix Factorization\n(NMF) is a data mining technique that splits data matrices by imposing\nrestrictions on the elements' non-negativity into two matrices: one\nrepresenting the data partitions and the other to represent the cluster\nprototypes of the data set. This method has attracted a lot of attention and is\nused in a wide range of applications, including text mining, clustering,\nlanguage modeling, music transcription, and neuroscience (gene separation). The\ninterpretation of the generated matrices is made simpler by the absence of\nnegative values. In this article, we propose a study on multi-modal clustering\nalgorithms and present a novel method called multi-modal multi-view\nnon-negative matrix factorization, in which we analyze the collaboration of\nseveral local NMF models. The experimental results show the value of the\nproposed approach, which was evaluated using a variety of data sets, and the\nobtained results are very promising compared to state of art methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:06:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Khalafaoui","Yasser","","Alteca, ETIS - UMR 8051, CY"],["Grozavu","Nistor","","ETIS\n  - UMR 8051, CY"],["Matei","Basarab","","LIPN"],["Goix","Laurent-Walter",""]]}
{"id":"2308.04779","submitter":"Chunpeng Zhou","authors":"Chunpeng Zhou, Kangjie Ning, Haishuai Wang, Zhi Yu, Sheng Zhou, Jiajun\n  Bu","title":"Multi-View Fusion and Distillation for Subgrade Distresses Detection\n  based on 3D-GPR","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 application of 3D ground-penetrating radar (3D-GPR) for subgrade distress\ndetection has gained widespread popularity. To enhance the efficiency and\naccuracy of detection, pioneering studies have attempted to adopt automatic\ndetection techniques, particularly deep learning. However, existing works\ntypically rely on traditional 1D A-scan, 2D B-scan or 3D C-scan data of the\nGPR, resulting in either insufficient spatial information or high computational\ncomplexity. To address these challenges, we introduce a novel methodology for\nthe subgrade distress detection task by leveraging the multi-view information\nfrom 3D-GPR data. Moreover, we construct a real multi-view image dataset\nderived from the original 3D-GPR data for the detection task, which provides\nricher spatial information compared to A-scan and B-scan data, while reducing\ncomputational complexity compared to C-scan data. Subsequently, we develop a\nnovel \\textbf{M}ulti-\\textbf{V}iew \\textbf{V}usion and \\textbf{D}istillation\nframework, \\textbf{GPR-MVFD}, specifically designed to optimally utilize the\nmulti-view GPR dataset. This framework ingeniously incorporates multi-view\ndistillation and attention-based fusion to facilitate significant feature\nextraction for subgrade distresses. In addition, a self-adaptive learning\nmechanism is adopted to stabilize the model training and prevent performance\ndegeneration in each branch. Extensive experiments conducted on this new GPR\nbenchmark demonstrate the effectiveness and efficiency of our proposed\nframework. Our framework outperforms not only the existing GPR baselines, but\nalso the state-of-the-art methods in the fields of multi-view learning,\nmulti-modal learning, and knowledge distillation. We will release the\nconstructed multi-view GPR dataset with expert-annotated labels and the source\ncodes of the proposed framework.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:06:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhou","Chunpeng",""],["Ning","Kangjie",""],["Wang","Haishuai",""],["Yu","Zhi",""],["Zhou","Sheng",""],["Bu","Jiajun",""]]}
{"id":"2308.04780","submitter":"Yasunori Okumura","authors":"Minoru Kitahara, Yasunori Okumura","title":"School Choice with Multiple Priorities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This study considers a model where schools may have multiple priority orders\non students, which may be inconsistent with each other. For example, in school\nchoice systems, since the sibling priority and the walk zone priority coexist,\nthe priority orders based on them would be conflicting. In that case, there may\nbe no matching that respect to all priority orders. We introduce a novel\nfairness notion called M-fairness to examine such markets. Further, we focus on\na more specific situation where all schools have two priority orders, and for a\ncertain group of students, a priority order of each school is an improvement of\nthe other priority order of the school. An illustrative example is the school\nchoice matching market with a priority-based affirmative action policy. We\nintroduce a mechanism that utilizes the efficiency adjusted deferred acceptance\nalgorithm and show that the mechanism is student optimally M-stable,\nimproved-group optimally M-stable and responsive to improvements.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:11:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kitahara","Minoru",""],["Okumura","Yasunori",""]]}
{"id":"2308.04781","submitter":"Valentin Zieglmeier","authors":"Valentin Zieglmeier","title":"Appending Data to Blockchain is not Sufficient for Non-repudiation of\n  Receipt","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exchanging data while ensuring non-repudiation is a challenge, especially if\nno trusted third party exists. Blockchain promises to provide many of the\nrequired guarantees, which is why it has been used in many non-repudiable data\nexchange protocols. Specifically, some authors propose to append data to\nblockchain to achieve non-repudiation of receipt.\n  In this position paper, we show that this approach is insufficient. While\nappending data to blockchain can guarantee non-repudiation of origin in some\ncases, it is not sufficient for non-repudiation of receipt. For confidential\ndata, we find a catch-22 that makes it impossible. For non-confidential data,\nmeanwhile, plausible deniability remains. We discuss potential solutions and\nsuggest smart contracts as a promising approach.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:11:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zieglmeier","Valentin",""]]}
{"id":"2308.04782","submitter":"Mingzhi Yuan","authors":"Mingzhi Yuan, Kexue Fu, Zhihao Li, Yucong Meng, Manning Wang","title":"PointMBF: A Multi-scale Bidirectional Fusion Network for Unsupervised\n  RGB-D Point Cloud Registration","comments":"Accepted to the ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Point cloud registration is a task to estimate the rigid transformation\nbetween two unaligned scans, which plays an important role in many computer\nvision applications. Previous learning-based works commonly focus on supervised\nregistration, which have limitations in practice. Recently, with the advance of\ninexpensive RGB-D sensors, several learning-based works utilize RGB-D data to\nachieve unsupervised registration. However, most of existing unsupervised\nmethods follow a cascaded design or fuse RGB-D data in a unidirectional manner,\nwhich do not fully exploit the complementary information in the RGB-D data. To\nleverage the complementary information more effectively, we propose a network\nimplementing multi-scale bidirectional fusion between RGB images and point\nclouds generated from depth images. By bidirectionally fusing visual and\ngeometric features in multi-scales, more distinctive deep features for\ncorrespondence estimation can be obtained, making our registration more\naccurate. Extensive experiments on ScanNet and 3DMatch demonstrate that our\nmethod achieves new state-of-the-art performance. Code will be released at\nhttps://github.com/phdymz/PointMBF\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:13:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yuan","Mingzhi",""],["Fu","Kexue",""],["Li","Zhihao",""],["Meng","Yucong",""],["Wang","Manning",""]]}
{"id":"2308.04783","submitter":"Alfonso Garc\\'ia-Parrado G\\'omez-Lobo Dr.","authors":"A. Garc\\'ia-Parrado","title":"An ideal covariant characterization of the Kerr conformal structure","comments":"8 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an ideal characterization of the family of four dimensional\nLorentzian spacetimes that are conformally related to the Kerr vacuum solution.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:15:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Garc\u00eda-Parrado","A.",""]]}
{"id":"2308.04784","submitter":"Luis Robledo","authors":"R. Rodriguez-Guzman and L. M. Robledo","title":"Beyond-mean-field description of octupolarity in dysprosium isotopes\n  with the Gogny-D1M energy density functional","comments":"13 pages, 7 figures, published in Phys Rev C. arXiv admin note: text\n  overlap with arXiv:2104.08063","journal-ref":"Phys. Rev. C108, 024301 (2023)","doi":"10.1103/PhysRevC.108.024301","report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emergence and stability of (static) octupole deformation effects in Dy\nisotopes from dripline to dripline ($72 \\le N \\le 142$) is analyzed in this\npaper using mean-field and beyond-mean-field techniques often used for this\npurpose. We find static octupole deformations at the Hartree-Fock-Bogoliubov\n(HFB) level with the Gogny D1M force for $N \\approx 134$ isotopes, while nuclei\nwith $N \\approx 88$ exhibit reflection-symmetric ground states. It is shown\nthat, given the softness found in the mean-field and parity-projected potential\nenergy surfaces along the octupole direction, neither of these two levels of\napproximation is suficcient to extract conclusions about the (permanent and/or\nvibrational) nature of octupole dynamic in Dy isotopes. From the analysis of\nthe collective wave functions as well as the excitation energies of the first\nnegative-parity states and $B(E3)$ strengths, obtained within the framework of\na two-dimensional symmetry-conserving generator coordinate method (2D-GCM), it\nis concluded that the increased octupole collectivity in Dy isotopes with $N\n\\approx 88$ and $N \\approx 134$ is a vibrational-like effect that is not\ndirectly related to permanent mean-field octupole deformation in the considered\nnuclei. A pronounced suppression of the $B(E1)$ strengths is predicted for\nisotopes with $N \\approx 82$ and $N \\approx 126$. The comparison of results\nobtained with other parametrizations, show the robustness of the predicted\ntrends with respect to the underlying Gogny energy density functional.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:15:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Rodriguez-Guzman","R.",""],["Robledo","L. M.",""]]}
{"id":"2308.04785","submitter":"Mohan Cui","authors":"Mohan Cui, Suran Sun, Hui Xu, Yangfan Zhou","title":"Is unsafe an Achilles' Heel? A Comprehensive Study of Safety\n  Requirements in Unsafe Rust Programming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rust is an emerging, strongly-typed programming language focusing on\nefficiency and memory safety. With increasing projects adopting Rust, knowing\nhow to use Unsafe Rust is crucial for Rust security. We observed that the\ndescription of safety requirements needs to be unified in Unsafe Rust\nprogramming. Current unsafe API documents in the standard library exhibited\nvariations, including inconsistency and insufficiency. To enhance Rust\nsecurity, we suggest unsafe API documents to list systematic descriptions of\nsafety requirements for users to follow. In this paper, we conducted the first\ncomprehensive empirical study on safety requirements across unsafe boundaries.\nWe studied unsafe API documents in the standard library and defined 19 safety\nproperties (SP). We then completed the data labeling on 416 unsafe APIs while\nanalyzing their correlation to find interpretable results. To validate the\npractical usability and SP coverage, we categorized existing Rust CVEs until\n2023-07-08 and performed a statistical analysis of std unsafe API usage toward\nthe crates.io ecosystem. In addition, we conducted a user survey to gain\ninsights into four aspects from experienced Rust programmers. We finally\nreceived 50 valid responses and confirmed our classification with statistical\nsignificance.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:16:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cui","Mohan",""],["Sun","Suran",""],["Xu","Hui",""],["Zhou","Yangfan",""]]}
{"id":"2308.04786","submitter":"Fernando Galaz-Garcia","authors":"Luis Atzin Franco Reyna, Fernando Galaz-Garc\\'ia, Jos\\'e Carlos\n  G\\'omez-Larra\\~naga, Luis Guijarro, Wolfgang Heil","title":"Decompositions of three-dimensional Alexandrov spaces","comments":"24 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DG math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend basic results in $3$-manifold topology to general three-dimensional\nAlexandrov spaces (or Alexandrov $3$-spaces for short), providing a unified\nframework for manifold and non-manifold spaces. We generalize the connected sum\nto non-manifold $3$-spaces and prove a prime decomposition theorem, exhibit an\ninfinite family of closed, prime non-manifold $3$-spaces which are not\nirreducible, and establish a conjecture of Mitsuishi and Yamaguchi on the\nstructure of closed, simply-connected Alexandrov $3$-spaces with non-negative\ncurvature. Additionally, we define a notion of generalized Dehn surgery for\nAlexandrov $3$-spaces and show that any closed Alexandrov $3$-space may be\nobtained by performing generalized Dehn surgery on a link in $S^3$ or the\nnon-trivial $S^2$-bundle over $S^1$. As an application of this result, we show\nthat every closed Alexandrov $3$-space is homeomorphic to the boundary of a\n$4$-dimensional Alexandrov space.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:16:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Reyna","Luis Atzin Franco",""],["Galaz-Garc\u00eda","Fernando",""],["G\u00f3mez-Larra\u00f1aga","Jos\u00e9 Carlos",""],["Guijarro","Luis",""],["Heil","Wolfgang",""]]}
{"id":"2308.04787","submitter":"Mohan Cui","authors":"Mohan Cui, Suran Sun, Hui Xu, Yangfan Zhou","title":"rCanary: Detecting Memory Leaks Across Semi-automated Memory Management\n  Boundary in Rust","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rust is an effective system programming language that guarantees memory\nsafety via compile-time verifications. It employs a novel ownership-based\nresource management model to facilitate automated resource deallocation. It is\nanticipated that this model will eliminate memory leaks. However, we observed\nthat user intervention driving semi-automated management is prone to\nintroducing leaks. In contrast to violating memory-safety guarantees via the\nunsafe keyword, the leak breached boundary is implicit with no compiler\nalerting. In this paper, we present rCanary, a static, non-intrusive, and fully\nautomated model checker to detect leaks across the semi-automated boundary. It\nadopts a precise encoder to abstract data with heap allocation and formalizes a\nrefined leak-free memory model based on Boolean satisfiability. rCanary is\nimplemented as an external component of Cargo and can generate constraints via\nMIR data flow. We evaluate it using flawed package benchmarks collected from\nthe pull requests of prominent Rust packages. The results indicate it is\npossible to recall all these defects with acceptable false positives. We also\napply our tool to more than 1,200 real-world crates from crates.io and GitHub,\nidentifying 19 crates with potentially vulnerable leaks in 8.4 seconds per\npackage.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:26:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cui","Mohan",""],["Sun","Suran",""],["Xu","Hui",""],["Zhou","Yangfan",""]]}
{"id":"2308.04788","submitter":"Yishun Wu","authors":"Qing Huang, Yishun Wu, Zhenchang Xing, He Jiang, Yu Cheng and Huan Jin","title":"Adaptive Intellect Unleashed: The Feasibility of Knowledge Transfer in\n  Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We conduct the first empirical study on using knowledge transfer to improve\nthe generalization ability of large language models (LLMs) in software\nengineering tasks, which often require LLMs to generalize beyond their training\ndata. Our proposed general knowledge transfer approach guides the LLM towards a\nsimilar and familiar API or code snippet it has encountered before, improving\nthe model's generalization ability for unseen knowledge. We apply this approach\nto three software engineering tasks: API inference, code example generation,\nand FQN inference, and find transfer span, transfer strategy, and transfer\narchitecture as key factors affecting the method. Our findings demonstrate the\nfeasibility of knowledge transfer and its potential to enhance LLMs'\nperformance in various software engineering tasks. The effectiveness of\nknowledge transfer varies depending on the target domain and task, with the\nhierarchical strategy being more effective than direct transfer, and AI-Chain\noutperforming CoT in prompt design. The implications of these findings extend\nbeyond software engineering tasks and suggest that knowledge transfer can\nenhance LLMs' ability to handle unknowns in any natural language task.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:26:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Huang","Qing",""],["Wu","Yishun",""],["Xing","Zhenchang",""],["Jiang","He",""],["Cheng","Yu",""],["Jin","Huan",""]]}
{"id":"2308.04789","submitter":"Chaoqin Huang","authors":"Chaoqin Huang, Aofan Jiang, Ya Zhang, Yanfeng Wang","title":"Multi-Scale Memory Comparison for Zero-/Few-Shot Anomaly Detection","comments":"VAND Runner-up Winner in CVPR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomaly detection has gained considerable attention due to its broad range of\napplications, particularly in industrial defect detection. To address the\nchallenges of data collection, researchers have introduced zero-/few-shot\nanomaly detection techniques that require minimal normal images for each\ncategory. However, complex industrial scenarios often involve multiple objects,\npresenting a significant challenge. In light of this, we propose a\nstraightforward yet powerful multi-scale memory comparison framework for\nzero-/few-shot anomaly detection. Our approach employs a global memory bank to\ncapture features across the entire image, while an individual memory bank\nfocuses on simplified scenes containing a single object. The efficacy of our\nmethod is validated by its remarkable achievement of 4th place in the zero-shot\ntrack and 2nd place in the few-shot track of the Visual Anomaly and Novelty\nDetection (VAND) competition.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:28:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Huang","Chaoqin",""],["Jiang","Aofan",""],["Zhang","Ya",""],["Wang","Yanfeng",""]]}
{"id":"2308.04790","submitter":"Christian J\\\"akle ChJ","authors":"Christian J\\\"akle, Lena Reichle, Stefan Volkwein","title":"Modelling and Simulation of District Heating Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the present paper a detailed mathematical model is derived for district\nheating networks. After semidiscretization of the convective heat equation and\nintroducing coupling conditions at the nodes of the network one gets a\nhigh-dimensional system of differential-algebraic equations (DAEs). Neglecting\ntemporal changes of the water velocity in the pipes, the numerical solutions do\nnot change significantly and the DAEs have index one. Numerical experiments\nillustrate that the model describes the real situation very well.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:29:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["J\u00e4kle","Christian",""],["Reichle","Lena",""],["Volkwein","Stefan",""]]}
{"id":"2308.04791","submitter":"Shengsheng Lin","authors":"Shengsheng Lin, Weiwei Lin, Wentai Wu, Songbo Wang, Yongxiang Wang,","title":"PETformer: Long-term Time Series Forecasting via Placeholder-enhanced\n  Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Transformer-based models have shown remarkable performance in\nlong-term time series forecasting (LTSF) tasks due to their ability to model\nlong-term dependencies. However, the validity of Transformers for LTSF tasks\nremains debatable, particularly since recent work has shown that simple linear\nmodels can outperform numerous Transformer-based approaches. This suggests that\nthere are limitations to the application of Transformer in LTSF. Therefore,\nthis paper investigates three key issues when applying Transformer to LTSF:\ntemporal continuity, information density, and multi-channel relationships.\nAccordingly, we propose three innovative solutions, including Placeholder\nEnhancement Technique (PET), Long Sub-sequence Division (LSD), and\nMulti-channel Separation and Interaction (MSI), which together form a novel\nmodel called PETformer. These three key designs introduce prior biases suitable\nfor LTSF tasks. Extensive experiments have demonstrated that PETformer achieves\nstate-of-the-art (SOTA) performance on eight commonly used public datasets for\nLTSF, outperforming all other models currently available. This demonstrates\nthat Transformer still possesses powerful capabilities in LTSF.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:30:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lin","Shengsheng",""],["Lin","Weiwei",""],["Wu","Wentai",""],["Wang","Songbo",""],["Wang","Yongxiang",""]]}
{"id":"2308.04792","submitter":"Yiming Ji","authors":"Yiming Ji, Yang Liu, Guanghu Xie, Zongwu Xie, Baoshi Cao","title":"A Fast and Optimal Learning-based Path Planning Method for Planetary\n  Rovers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intelligent autonomous path planning is crucial to improve the exploration\nefficiency of planetary rovers. In this paper, we propose a learning-based\nmethod to quickly search for optimal paths in an elevation map, which is called\nNNPP. The NNPP model learns semantic information about start and goal\nlocations, as well as map representations, from numerous pre-annotated optimal\npath demonstrations, and produces a probabilistic distribution over each pixel\nrepresenting the likelihood of it belonging to an optimal path on the map. More\nspecifically, the paper computes the traversal cost for each grid cell from the\nslope, roughness and elevation difference obtained from the DEM. Subsequently,\nthe start and goal locations are encoded using a Gaussian distribution and\ndifferent location encoding parameters are analyzed for their effect on model\nperformance. After training, the NNPP model is able to perform path planning on\nnovel maps. Experiments show that the guidance field generated by the NNPP\nmodel can significantly reduce the search time for optimal paths under the same\nhardware conditions, and the advantage of NNPP increases with the scale of the\nmap.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:31:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ji","Yiming",""],["Liu","Yang",""],["Xie","Guanghu",""],["Xie","Zongwu",""],["Cao","Baoshi",""]]}
{"id":"2308.04793","submitter":"Ellis Owen","authors":"Ellis R. Owen, Albert K. H. Kong, Kuo-Chuan Pan","title":"Cosmic ray calorimetry in star-forming galaxy populations and\n  implications for their contribution to the extra-galactic $\\gamma$-ray\n  background","comments":"8 pages, 4 figures, 1 table. Presented at the 38th International\n  Cosmic Ray Conference (ICRC2023)","journal-ref":"PoS (ICRC2023), 554","doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Star-forming galaxies (SFGs) have been established as an important source\npopulation in the extra-galactic $\\gamma$-ray background (EGB). Their intensive\nstar-formation creates an abundance of environments able to accelerate\nparticles, and these build-up a rich sea of cosmic rays (CRs). Above GeV\nenergies, CR protons can undergo hadronic interactions with their environment\nto produce $\\gamma$-rays. SFGs can operate as CR proton \"calorimeters\", where a\nlarge fraction of the CR energy is converted to $\\gamma$-rays. However, CRs\nalso deposit energy and momentum to modify the thermal and hydrodynamic\nconditions of the gas in SFGs, and can become a powerful driver of outflows.\nSuch outflows are ubiquitous among some types of SFGs, and have the potential\nto severely degrade their CR proton calorimetry. This diminishes their\ncontribution to the EGB. In this work, we adopt a self-consistent treatment of\nparticle transport in outflows from SFGs to assess their calorimetry. We use 1D\nnumerical treatments of galactic outflows driven by CRs and thermal gas\npressure, accounting for the dynamical effects and interactions of CRs. We show\nthe impact CR-driven flows have on the relative contribution of SFG populations\nto the EGB, and investigate the properties of SFGs that contribute most\nstrongly.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:31:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Owen","Ellis R.",""],["Kong","Albert K. H.",""],["Pan","Kuo-Chuan",""]]}
{"id":"2308.04794","submitter":"Rajashekhar Vachiravelu Saminathan","authors":"J Krishna Kant, Mahankali Sripaad, Anand Bharadwaj, Rajashekhar V S\n  and Suresh Sundaram","title":"An Autonomous Hybrid Drone-Rover Vehicle for Weed Removal and Spraying\n  Applications in Agriculture","comments":"6 pages, 9 figures, accepted for AGRETA2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The usage of drones and rovers helps to overcome the limitations of\ntraditional agriculture which has been predominantly human-intensive, for\ncarrying out tasks such as removal of weeds and spraying of fertilizers and\npesticides. Drones and rovers are helping to realize precision agriculture and\nfarmers with improved monitoring and surveying at affordable costs. Major\nbenefits have come for vertical farming and fields with irrigation canals.\nHowever, drones have a limitation of flight time due to payload constraints.\nRovers have limitations in vertical farming and obstacles like canals in\nagricultural fields. To meet the different requirements of multiple terrains\nand vertical farming in agriculture, we propose an autonomous hybrid\ndrone-rover vehicle that combines the advantages of both rovers and drones. The\nprototype is described along with experimental results regarding its ability to\navoid obstacles, pluck weeds and spray pesticides.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:32:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kant","J Krishna",""],["Sripaad","Mahankali",""],["Bharadwaj","Anand",""],["S","Rajashekhar V",""],["Sundaram","Suresh",""]]}
{"id":"2308.04795","submitter":"Tuukka Korhonen","authors":"Tuukka Korhonen, Daniel Lokshtanov","title":"Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms,\n  and Improved Hardness of Recognition","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A graph $G$ contains a graph $H$ as an induced minor if $H$ can be obtained\nfrom $G$ by vertex deletions and edge contractions. The class of\n$H$-induced-minor-free graphs generalizes the class of $H$-minor-free graphs,\nbut unlike $H$-minor-free graphs, it can contain dense graphs. We show that if\nan $n$-vertex $m$-edge graph $G$ does not contain a graph $H$ as an induced\nminor, then it has a balanced vertex separator of size $O_{H}(\\sqrt{m})$, where\nthe $O_{H}(\\cdot)$-notation hides factors depending on $H$. More precisely, our\nupper bound for the size of the balanced separator is $O(\\min(|V(H)|^2, \\log n)\n\\cdot \\sqrt{|V(H)|+|E(H)|} \\cdot \\sqrt{m})$. We give an algorithm for finding\neither an induced minor model of $H$ in $G$ or such a separator in randomized\npolynomial-time. We apply this to obtain subexponential $2^{O_{H}(n^{2/3} \\log\nn)}$ time algorithms on $H$-induced-minor-free graphs for a large class of\nproblems including maximum independent set, minimum feedback vertex set,\n3-coloring, and planarization.\n  For graphs $H$ where every edge is incident to a vertex of degree at most 2,\nour results imply a $2^{O_{H}(n^{2/3} \\log n)}$ time algorithm for testing if\n$G$ contains $H$ as an induced minor. Our second main result is that there\nexists a fixed tree $T$, so that there is no $2^{o(n/\\log^3 n)}$ time algorithm\nfor testing if a given $n$-vertex graph contains $T$ as an induced minor unless\nthe Exponential Time Hypothesis (ETH) fails. Our reduction also gives\nNP-hardness, which solves an open problem asked by Fellows, Kratochv\\'il,\nMiddendorf, and Pfeiffer [Algorithmica, 1995], who asked if there exists a\nfixed planar graph $H$ so that testing for $H$ as an induced minor is NP-hard.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:34:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Korhonen","Tuukka",""],["Lokshtanov","Daniel",""]]}
{"id":"2308.04796","submitter":"Mateusz Pabian","authors":"Miros{\\l}aw Pawlak, Mateusz Pabian, Dominik Rzepka","title":"Bayes Risk Consistency of Nonparametric Classification Rules for Spike\n  Trains Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.LG math.IT q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spike trains data find a growing list of applications in computational\nneuroscience, imaging, streaming data and finance. Machine learning strategies\nfor spike trains are based on various neural network and probabilistic models.\nThe probabilistic approach is relying on parametric or nonparametric\nspecifications of the underlying spike generation model. In this paper we\nconsider the two-class statistical classification problem for a class of spike\ntrain data characterized by nonparametrically specified intensity functions. We\nderive the optimal Bayes rule and next form the plug-in nonparametric kernel\nclassifier. Asymptotical properties of the rules are established including the\nlimit with respect to the increasing recording time interval and the size of a\ntraining set. In particular the convergence of the kernel classifier to the\nBayes rule is proved. The obtained results are supported by a finite sample\nsimulation studies.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:34:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pawlak","Miros\u0142aw",""],["Pabian","Mateusz",""],["Rzepka","Dominik",""]]}
{"id":"2308.04797","submitter":"Abbas Mirzaei","authors":"Abbas Mirzaei, Shahram Zandiyan","title":"A Novel Approach for Establishing Connectivity in Partitioned Mobile\n  Sensor Networks Using Beamforming Techniques","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Network connectivity is one of the major design issues in the context of\nmobile sensor networks. Due to diverse communication patterns, some nodes lying\nin high-traffic zones may consume more energy and eventually die out resulting\nin network partitioning. This phenomenon may deprive a large number of alive\nnodes of sending their important time critical data to the sink. The\napplication of data caching in mobile sensor networks is exponentially\nincreasing as a high-speed data storage layer. This paper presents a deep\nlearning-based beamforming approach to find the optimal transmission strategies\nfor cache-enabled backhaul networks. In the proposed scheme, the sensor nodes\nin isolated partitions work together to form a directional beam which\nsignificantly increases their overall communication range to reach out a\ndistant relay node connected to the main part of the network. The proposed\nmethodology of cooperative beamforming-based partition connectivity works\nefficiently if an isolated cluster gets partitioned with a favorably large\nnumber of nodes. We also present a new cross-layer method for link cost that\nmakes a balance between the energy used by the relay. By directly adding the\naccessible auxiliary nodes to the set of routing links, the algorithm chooses\npaths which provide maximum dynamic beamforming usage for the intermediate\nnodes. The proposed approach is then evaluated through simulation results. The\nsimulation results show that the proposed mechanism achieves up to 30% energy\nconsumption reduction through beamforming as partition healing in addition to\nguarantee user throughput.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:35:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mirzaei","Abbas",""],["Zandiyan","Shahram",""]]}
{"id":"2308.04798","submitter":"Qiushi Guo","authors":"Qiushi Guo","title":"Enhancing Mobile Privacy and Security: A Face Skin Patch-Based\n  Anti-Spoofing Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As Facial Recognition System(FRS) is widely applied in areas such as access\ncontrol and mobile payments due to its convenience and high accuracy. The\nsecurity of facial recognition is also highly regarded. The Face anti-spoofing\nsystem(FAS) for face recognition is an important component used to enhance the\nsecurity of face recognition systems. Traditional FAS used images containing\nidentity information to detect spoofing traces, however there is a risk of\nprivacy leakage during the transmission and storage of these images. Besides,\nthe encryption and decryption of these privacy-sensitive data takes too long\ncompared to inference time by FAS model. To address the above issues, we\npropose a face anti-spoofing algorithm based on facial skin patches leveraging\npure facial skin patch images as input, which contain no privacy information,\nno encryption or decryption is needed for these images. We conduct experiments\non several public datasets, the results prove that our algorithm has\ndemonstrated superiority in both accuracy and speed.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:36:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Guo","Qiushi",""]]}
{"id":"2308.04799","submitter":"Igor Solovyev","authors":"I. V. Solovyev","title":"Linear response theories for interatomic exchange interactions","comments":"Topical Review, submitted to J. Phys.: Condens. Matter","journal-ref":null,"doi":null,"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":"  In 1987, Liechtenstein et al. came up with the idea to formulate the problem\nof interatomic exchange interactions, which would describe the energy change\ncaused by the infinitesimal rotations of spins, in terms of the magnetic\nsusceptibility. The formulation appears to be very generic and, for isotropic\nsystems, expresses the energy change in the form of the Heisenberg model,\nirrespectively on which microscopic mechanism stands behind the interaction\nparameters. Moreover, this approach establishes the relationship between the\nexchange interactions and the electronic structure obtained, for instance, in\nthe first-principles calculations based on the density functional theory. The\npurpose of this review is to elaborate basic ideas of the linear response\ntheories for the exchange interactions as well as more resent developments. The\nspecial attention is paid to the approximations underlying the original method\nof Liechtenstein et al. in comparison with its more recent and more rigorous\nextensions, the roles of the on-site Coulomb interactions and the ligand\nstates, and calculations of antisymmetric Dzyaloshinskii-Moriya interactions,\nwhich can be performed alongside with the isotropic exchange, within one\ncomputational scheme. The abilities of the linear response theories as well as\nmany theoretical nuances, which may arise in the analysis of interatomic\nexchange interactions, are illustrated on magnetic van der Walls materials\nCr$X_3$ ($X$$=$ Cl, I), half-metallic ferromagnet CrO$_2$, ferromagnetic Weyl\nsemimetal Co$_3$Sn$_2$S$_2$, and orthorhombic manganites $A$MnO$_3$ ($A$$=$ La,\nHo), known for the peculiar interplay of the lattice distortion, spin, and\norbital ordering.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:41:24 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 07:31:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Solovyev","I. V.",""]]}
{"id":"2308.04800","submitter":"Yanzeng Li","authors":"Yirui Zhan, Yanzeng Li, Minhao Zhang, Lei Zou","title":"ADMUS: A Progressive Question Answering Framework Adaptable to Multiple\n  Knowledge Sources","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the introduction of deep learning models, semantic parsingbased\nknowledge base question answering (KBQA) systems have achieved high performance\nin handling complex questions. However, most existing approaches primarily\nfocus on enhancing the model's effectiveness on individual benchmark datasets,\ndisregarding the high costs of adapting the system to disparate datasets in\nreal-world scenarios (e.g., multi-tenant platform). Therefore, we present\nADMUS, a progressive knowledge base question answering framework designed to\naccommodate a wide variety of datasets, including multiple languages, diverse\nbackbone knowledge bases, and disparate question answering datasets. To\naccomplish the purpose, we decouple the architecture of conventional KBQA\nsystems and propose this dataset-independent framework. Our framework supports\nthe seamless integration of new datasets with minimal effort, only requiring\ncreating a dataset-related micro-service at a negligible cost. To enhance the\nusability of ADUMS, we design a progressive framework consisting of three\nstages, ranges from executing exact queries, generating approximate queries and\nretrieving open-domain knowledge referring from large language models. An\nonline demonstration of ADUMS is available at:\nhttps://answer.gstore.cn/pc/index.html\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:46:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhan","Yirui",""],["Li","Yanzeng",""],["Zhang","Minhao",""],["Zou","Lei",""]]}
{"id":"2308.04801","submitter":"Nihar Ranjan Sahoo","authors":"Nihar Ranjan Sahoo (for the STAR Collaboration)","title":"STAR Experimental Highlights at Hard Probes 2023","comments":"Hard Probes 2023 Conference, Aschaffenburg, Germany, STAR highlights\n  plenary talk on hard probes, 10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex hep-ex hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We highlight the STAR experiment's hard probes results, including jets and\nheavy flavor production in heavy-ion collisions to study the properties of the\nquark-gluon plasma. Various jet-substructure observables in proton-proton\ncollisions are presented to explore both perturbative and non-perturbative\nregimes of quantum chromodynamics. Finally, we discuss the STAR experiment's\nhard probes physics program for ongoing data taking.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:48:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sahoo","Nihar Ranjan","","for the STAR Collaboration"]]}
{"id":"2308.04802","submitter":"Xinyu Lyu","authors":"Xinyu Lyu, Lianli Gao, Junlin Xie, Pengpeng Zeng, Yulu Tian, Jie Shao,\n  Heng Tao Shen","title":"Generalized Unbiased Scene Graph Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing Unbiased Scene Graph Generation (USGG) methods only focus on\naddressing the predicate-level imbalance that high-frequency classes dominate\npredictions of rare ones, while overlooking the concept-level imbalance.\nActually, even if predicates themselves are balanced, there is still a\nsignificant concept-imbalance within them due to the long-tailed distribution\nof contexts (i.e., subject-object combinations). This concept-level imbalance\nposes a more pervasive and challenging issue compared to the predicate-level\nimbalance since subject-object pairs are inherently complex in combinations.\nHence, we introduce a novel research problem: Generalized Unbiased Scene Graph\nGeneration (G-USGG), which takes into account both predicate-level and\nconcept-level imbalance. To the end, we propose the Multi-Concept Learning\n(MCL) framework, which ensures a balanced learning process across rare/\nuncommon/ common concepts. MCL first quantifies the concept-level imbalance\nacross predicates in terms of different amounts of concepts, representing as\nmultiple concept-prototypes within the same class. It then effectively learns\nconcept-prototypes by applying the Concept Regularization (CR) technique.\nFurthermore, to achieve balanced learning over different concepts, we introduce\nthe Balanced Prototypical Memory (BPM), which guides SGG models to generate\nbalanced representations for concept-prototypes. Extensive experiments\ndemonstrate the remarkable efficacy of our model-agnostic strategy in enhancing\nthe performance of benchmark models on both VG-SGG and OI-SGG datasets, leading\nto new state-of-the-art achievements in two key aspects: predicate-level\nunbiased relation recognition and concept-level compositional generability.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:51:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lyu","Xinyu",""],["Gao","Lianli",""],["Xie","Junlin",""],["Zeng","Pengpeng",""],["Tian","Yulu",""],["Shao","Jie",""],["Shen","Heng Tao",""]]}
{"id":"2308.04803","submitter":"Dian Echevarr\\'ia P\\'erez","authors":"Dian Echevarr\\'ia P\\'erez, Onel L. Alcaraz L\\'opez, Hirley Alves","title":"Extreme Value Theory-based Robust Minimum-Power Precoding for URLLC","comments":"11 pages, 9 figures, submitted to TWC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Channel state information (CSI) is crucial for achieving ultra-reliable\nlow-latency communication (URLLC) in wireless networks. The main associated\nproblems are the CSI acquisition time, which impacts the delay requirements of\ntime-critical applications, and the estimation accuracy, which degrades the\nsignal-to-interference-plus-noise ratio (SINR), thus, reducing reliability. In\nthis work, we formulate and solve a minimum-power precoding design problem\nsimultaneously serving multiple URLLC users in the downlink with imperfect CSI\navailability. Specifically, we develop an algorithm that exploits\nstate-of-the-art precoding schemes such as the maximal ratio transmission (MRT)\nand zero-forcing (ZF), and adjust the power of the precoders to compensate for\nthe channel estimation error uncertainty based on the extreme value theory\n(EVT) framework. Finally, we evaluate the performance of our method and show\nits superiority concerning worst-case robust precoding, which is used as a\nbenchmark.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:53:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["P\u00e9rez","Dian Echevarr\u00eda",""],["L\u00f3pez","Onel L. Alcaraz",""],["Alves","Hirley",""]]}
{"id":"2308.04804","submitter":"Yevgeniia Yevgenieva PhD","authors":"Yevgeniia Yevgenieva, Alexander Zuyev, Peter Benner, Andreas\n  Seidel-Morgenstern","title":"Periodic optimal control of a plug flow reactor model with an\n  isoperimetric constraint","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a class of nonlinear hyperbolic partial differential equations with\nboundary control. This class describes chemical reactions of the type ``$A \\to$\nproduct'' carried out in a plug flow reactor (PFR) in the presence of an inert\ncomponent. An isoperimetric optimal control problem with periodic boundary\nconditions and input constraints is formulated for the considered mathematical\nmodel in order to maximize the mean amount of product over the period. For the\nsingle-input system, the optimality of a bang-bang control strategy is proved\nin the class of bounded measurable inputs. The case of controlled flow rate\ninput is also analyzed by exploiting the method of characteristics. A case\nstudy is performed to illustrate the performance of the reaction model under\ndifferent control strategies.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:58:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yevgenieva","Yevgeniia",""],["Zuyev","Alexander",""],["Benner","Peter",""],["Seidel-Morgenstern","Andreas",""]]}
{"id":"2308.04805","submitter":"Jingyao Liu","authors":"Hongru Liang (1), Jingyao Liu (1), Yuanxin Xiang (1), Jiachen Du (2),\n  Lanjun Zhou (2), Shushen Pan (2) and Wenqiang Lei (1) ((1) Sichuan\n  University, (2) Tencent Music Entertainment)","title":"DiVa: An Iterative Framework to Harvest More Diverse and Valid Labels\n  from User Comments for Music","comments":"11 pages, 5 figures, published to ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3613750","report-no":null,"categories":"cs.IR cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Towards sufficient music searching, it is vital to form a complete set of\nlabels for each song. However, current solutions fail to resolve it as they\ncannot produce diverse enough mappings to make up for the information missed by\nthe gold labels. Based on the observation that such missing information may\nalready be presented in user comments, we propose to study the automated music\nlabeling in an essential but under-explored setting, where the model is\nrequired to harvest more diverse and valid labels from the users' comments\ngiven limited gold labels. To this end, we design an iterative framework (DiVa)\nto harvest more $\\underline{\\text{Di}}$verse and $\\underline{\\text{Va}}$lid\nlabels from user comments for music. The framework makes a classifier able to\nform complete sets of labels for songs via pseudo-labels inferred from\npre-trained classifiers and a novel joint score function. The experiment on a\ndensely annotated testing set reveals the superiority of the Diva over\nstate-of-the-art solutions in producing more diverse labels missed by the gold\nlabels. We hope our work can inspire future research on automated music\nlabeling.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:59:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liang","Hongru",""],["Liu","Jingyao",""],["Xiang","Yuanxin",""],["Du","Jiachen",""],["Zhou","Lanjun",""],["Pan","Shushen",""],["Lei","Wenqiang",""]]}
{"id":"2308.04806","submitter":"Dimitri Loutchko","authors":"Dimitri Loutchko, Yuki Sughiyama, Tetsuya J. Kobayashi","title":"The Geometry of Thermodynamic Uncertainty Relations in Chemical Reaction\n  Networks","comments":"3 figures, 6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Hessian geometry - an extension of information geometry - has\nemerged as a framework to naturally connect the geometries appearing in the\ntheory of chemical reaction networks (CRN) to their inherent thermodynamical\nand kinetic properties. This framework is used in this letter to derive\nmultivariate thermodynamic uncertainty relations (TUR) for CRN. The matrices\nfeatured in the TUR are shown to be representations of Riemmanian metric\ntensors, whereby one tensor characterizes the pseudo entropy production rate\nand the other the current fluctuations. It is shown that the latter tensor is a\nrestriction of the former one to a linear subspace in the flux tangent space.\nTherefore, in addition to clarifying the geometric origin of TUR in CRN, the\nHessian geometric setup yields a characterization of the error term in the TUR\nas the norm of a linear subspace component of the flux vector and thus\ncharacterizes the fluxes where TUR become equalities.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:59:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Loutchko","Dimitri",""],["Sughiyama","Yuki",""],["Kobayashi","Tetsuya J.",""]]}
{"id":"2308.04807","submitter":"Chang Meng","authors":"Chang Meng, Chenhao Zhai, Yu Yang, Hengyu Zhang and Xiu Li","title":"Parallel Knowledge Enhancement based Framework for Multi-behavior\n  Recommendation","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3615004","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-behavior recommendation algorithms aim to leverage the multiplex\ninteractions between users and items to learn users' latent preferences. Recent\nmulti-behavior recommendation frameworks contain two steps: fusion and\nprediction. In the fusion step, advanced neural networks are used to model the\nhierarchical correlations between user behaviors. In the prediction step,\nmultiple signals are utilized to jointly optimize the model with a multi-task\nlearning (MTL) paradigm. However, recent approaches have not addressed the\nissue caused by imbalanced data distribution in the fusion step, resulting in\nthe learned relationships being dominated by high-frequency behaviors. In the\nprediction step, the existing methods use a gate mechanism to directly\naggregate expert information generated by coupling input, leading to negative\ninformation transfer. To tackle these issues, we propose a Parallel Knowledge\nEnhancement Framework (PKEF) for multi-behavior recommendation. Specifically,\nwe enhance the hierarchical information propagation in the fusion step using\nparallel knowledge (PKF). Meanwhile, in the prediction step, we decouple the\nrepresentations to generate expert information and introduce a projection\nmechanism during aggregation to eliminate gradient conflicts and alleviate\nnegative transfer (PME). We conduct comprehensive experiments on three\nreal-world datasets to validate the effectiveness of our model. The results\nfurther demonstrate the rationality and effectiveness of the designed PKF and\nPME modules. The source code and datasets are available at\nhttps://github.com/MC-CV/PKEF.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:01:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Meng","Chang",""],["Zhai","Chenhao",""],["Yang","Yu",""],["Zhang","Hengyu",""],["Li","Xiu",""]]}
{"id":"2308.04808","submitter":"Qingyao Xu","authors":"Qingyao Xu, Weibo Mao, Jingze Gong, Chenxin Xu, Siheng Chen, Weidi\n  Xie, Ya Zhang, Yanfeng Wang","title":"Joint-Relation Transformer for Multi-Person Motion Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-person motion prediction is a challenging problem due to the dependency\nof motion on both individual past movements and interactions with other people.\nTransformer-based methods have shown promising results on this task, but they\nmiss the explicit relation representation between joints, such as skeleton\nstructure and pairwise distance, which is crucial for accurate interaction\nmodeling. In this paper, we propose the Joint-Relation Transformer, which\nutilizes relation information to enhance interaction modeling and improve\nfuture motion prediction. Our relation information contains the relative\ndistance and the intra-/inter-person physical constraints. To fuse relation and\njoint information, we design a novel joint-relation fusion layer with\nrelation-aware attention to update both features. Additionally, we supervise\nthe relation information by forecasting future distance. Experiments show that\nour method achieves a 13.4% improvement of 900ms VIM on 3DPW-SoMoF/RC and\n17.8%/12.0% improvement of 3s MPJPE on CMU-Mpcap/MuPoTS-3D dataset.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:02:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xu","Qingyao",""],["Mao","Weibo",""],["Gong","Jingze",""],["Xu","Chenxin",""],["Chen","Siheng",""],["Xie","Weidi",""],["Zhang","Ya",""],["Wang","Yanfeng",""]]}
{"id":"2308.04809","submitter":"Prince Romeo Mensah","authors":"Dominic Breit and Prince Romeo Mensah","title":"Existence of a local strong solution to the beam-polymeric fluid\n  interaction system","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a unique local strong solution to the finitely extensible\nnonlinear elastic (FENE) dumbbell model of Warner-type for an incompressible\npolymer fluid (described by the Navier-Stokes-Fokker-Planck equations)\ninteracting with a flexible elastic shell. The latter occupies the flexible\nboundary of the polymer fluid domain and is modeled by a beam equation coupled\nthrough kinematic boundary conditions and the balance of forces.\n  A main step in our approach is the proof of local well-posedness for just the\nsolvent-structure system in higher-order topologies which is of independent\ninterest. Different from most of the previous results in the literature, the\nreference spatial domain is an arbitrary smooth subset of $\\mathbb{R}^3$,\nrather than a flat one. That is, we cover viscoelastic shells rather than\nelastic plates. Our result also supplements the existing literature on the\nNavier-Stokes-Fokker-Planck equations posed on a fixed bounded domain.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:05:06 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 13:52:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Breit","Dominic",""],["Mensah","Prince Romeo",""]]}
{"id":"2308.04810","submitter":"Friedrich Wagemann","authors":"Ziwendtaor\\'e Hermann Bamogo, Friedrich Wagemann","title":"On the Gabriel quiver of extensions of Leibniz algebras","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.KT math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the Gabriel quiver of simple objects in the category of bimodules\nover a simple Leibniz algebra and over the trivial $1$-dimensional Leibniz\nalgebra. Vertices of the quiver are the classes of simple objects, arrows are\ngiven by the dimensions of Ext$^1$-groups.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:07:33 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bamogo","Ziwendtaor\u00e9 Hermann",""],["Wagemann","Friedrich",""]]}
{"id":"2308.04811","submitter":"Kailai Yang","authors":"Kailai Yang, Tianlin Zhang, Shaoxiong Ji, Sophia Ananiadou","title":"A Bipartite Graph is All We Need for Enhancing Emotional Reasoning with\n  Commonsense Knowledge","comments":"Accepted by CIKM 2023 as a long paper","journal-ref":null,"doi":"10.1145/3583780.3614758","report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The context-aware emotional reasoning ability of AI systems, especially in\nconversations, is of vital importance in applications such as online opinion\nmining from social media and empathetic dialogue systems. Due to the implicit\nnature of conveying emotions in many scenarios, commonsense knowledge is widely\nutilized to enrich utterance semantics and enhance conversation modeling.\nHowever, most previous knowledge infusion methods perform empirical knowledge\nfiltering and design highly customized architectures for knowledge interaction\nwith the utterances, which can discard useful knowledge aspects and limit their\ngeneralizability to different knowledge sources. Based on these observations,\nwe propose a Bipartite Heterogeneous Graph (BHG) method for enhancing emotional\nreasoning with commonsense knowledge. In BHG, the extracted context-aware\nutterance representations and knowledge representations are modeled as\nheterogeneous nodes. Two more knowledge aggregation node types are proposed to\nperform automatic knowledge filtering and interaction. BHG-based knowledge\ninfusion can be directly generalized to multi-type and multi-grained knowledge\nsources. In addition, we propose a Multi-dimensional Heterogeneous Graph\nTransformer (MHGT) to perform graph reasoning, which can retain unchanged\nfeature spaces and unequal dimensions for heterogeneous node types during\ninference to prevent unnecessary loss of information. Experiments show that\nBHG-based methods significantly outperform state-of-the-art knowledge infusion\nmethods and show generalized knowledge infusion ability with higher efficiency.\nFurther analysis proves that previous empirical knowledge filtering methods do\nnot guarantee to provide the most useful knowledge information. Our code is\navailable at: https://github.com/SteveKGYang/BHG.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:09:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yang","Kailai",""],["Zhang","Tianlin",""],["Ji","Shaoxiong",""],["Ananiadou","Sophia",""]]}
{"id":"2308.04812","submitter":"Hiroaki Shishido","authors":"Hiroaki Shishido, The Dang Vu, Kazuya Aizawa, Kenji M. Kojima, Tomio\n  Koyama, Kenichi Oikawa, Masahide Harada, Takayuki Oku, Kazuhiko Soyama,\n  Shigeyuki Miyajima, Mutsuo Hidaka, Soh Y. Suzuki, Manobu M. Tanaka, Shuichi\n  Kawamata, Takekazu Ishida","title":"Orientation mapping of YbSn$_3$ single crystals based on Bragg-dip\n  analysis using a delay-line superconducting sensor","comments":"18 pages, 6 figures","journal-ref":"Journal of Applied Crystallography 56, 1108-1113 (2023)","doi":"10.1107/S1600576723005204","report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent progress in high-power pulsed neutron sources has stimulated the\ndevelopment of the Bragg-dip and Bragg-edge analysis methods using a\ntwo-dimensional neutron detector with high temporal resolution to resolve the\nneutron energy by the time-of-flight method. The delay-line current-biased\nkinetic-inductance detector (CB-KID) is a two-dimensional superconducting\nsensor with a high temporal resolution and multi-hit capability. We demonstrate\nthat the delay-line CB-KID with a $^{10}$B neutron conversion layer can be\napplied to high-spatial-resolution neutron transmission imaging and\nspectroscopy up to 100\\,eV. Dip structures in the transmission spectrum induced\nby Bragg diffraction and nuclear resonance absorption in YbSn$_3$ single\ncrystals. We successfully drew the orientation mapping of YbSn$_3$ crystals\nbased on the analysis of observed Bragg-dip positions in the transmission\nspectrum.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:10:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shishido","Hiroaki",""],["Vu","The Dang",""],["Aizawa","Kazuya",""],["Kojima","Kenji M.",""],["Koyama","Tomio",""],["Oikawa","Kenichi",""],["Harada","Masahide",""],["Oku","Takayuki",""],["Soyama","Kazuhiko",""],["Miyajima","Shigeyuki",""],["Hidaka","Mutsuo",""],["Suzuki","Soh Y.",""],["Tanaka","Manobu M.",""],["Kawamata","Shuichi",""],["Ishida","Takekazu",""]]}
{"id":"2308.04813","submitter":"Jianqiao Zhao","authors":"Yanyang Li, Jianqiao Zhao, Duo Zheng, Zi-Yuan Hu, Zhi Chen, Xiaohui\n  Su, Yongfeng Huang, Shijia Huang, Dahua Lin, Michael R. Lyu, Liwei Wang","title":"CLEVA: Chinese Language Models EVAluation Platform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the continuous emergence of Chinese Large Language Models (LLMs), how to\nevaluate a model's capabilities has become an increasingly significant issue.\nThe absence of a comprehensive Chinese benchmark that thoroughly assesses a\nmodel's performance, the unstandardized and incomparable prompting procedure,\nand the prevalent risk of contamination pose major challenges in the current\nevaluation of Chinese LLMs. We present CLEVA, a user-friendly platform crafted\nto holistically evaluate Chinese LLMs. Our platform employs a standardized\nworkflow to assess LLMs' performance across various dimensions, regularly\nupdating a competitive leaderboard. To alleviate contamination, CLEVA curates a\nsignificant proportion of new data and develops a sampling strategy that\nguarantees a unique subset for each leaderboard round. Empowered by an\neasy-to-use interface that requires just a few mouse clicks and a model API,\nusers can conduct a thorough evaluation with minimal coding. Large-scale\nexperiments featuring 23 influential Chinese LLMs have validated CLEVA's\nefficacy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:11:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Yanyang",""],["Zhao","Jianqiao",""],["Zheng","Duo",""],["Hu","Zi-Yuan",""],["Chen","Zhi",""],["Su","Xiaohui",""],["Huang","Yongfeng",""],["Huang","Shijia",""],["Lin","Dahua",""],["Lyu","Michael R.",""],["Wang","Liwei",""]]}
{"id":"2308.04814","submitter":"Gunjan Singh","authors":"Gunjan Singh, Sumit Bhatia, Raghava Mutharaju","title":"Neuro-Symbolic RDF and Description Logic Reasoners: The State-Of-The-Art\n  and Challenges","comments":"This paper is a part of the book titled Compendium of Neuro-Symbolic\n  Artificial Intelligence which can be found at the following link:\n  https://www.iospress.com/\n  catalog/books/compendium-of-neurosymbolic-artificial-intelligence","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ontologies are used in various domains, with RDF and OWL being prominent\nstandards for ontology development. RDF is favored for its simplicity and\nflexibility, while OWL enables detailed domain knowledge representation.\nHowever, as ontologies grow larger and more expressive, reasoning complexity\nincreases, and traditional reasoners struggle to perform efficiently. Despite\noptimization efforts, scalability remains an issue. Additionally, advancements\nin automated knowledge base construction have created large and expressive\nontologies that are often noisy and inconsistent, posing further challenges for\nconventional reasoners. To address these challenges, researchers have explored\nneuro-symbolic approaches that combine neural networks' learning capabilities\nwith symbolic systems' reasoning abilities. In this chapter,we provide an\noverview of the existing literature in the field of neuro-symbolic deductive\nreasoning supported by RDF(S), the description logics EL and ALC, and OWL 2 RL,\ndiscussing the techniques employed, the tasks they address, and other relevant\nefforts in this area.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:12:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Singh","Gunjan",""],["Bhatia","Sumit",""],["Mutharaju","Raghava",""]]}
{"id":"2308.04815","submitter":"Lebing Chen","authors":"Lebing Chen, Xiaokun Teng, Hengxin Tan, Barry L. Winn, Garrett E.\n  Granorth, Feng Ye, D. H. Yu, R. A. Mole, Bin Gao, Binghai Yan, Ming Yi, and\n  Pengcheng Dai","title":"Competing itinerant and local spin interactions in kagome metal FeGe","comments":"Submitted for publication in April 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two-dimensional kagome metals consisting of corner-sharing triangles offer a\nunique platform for studying strong electron correlations and band topology due\nto its geometrically frustrated lattice structure. The similar energy scales\nbetween spin, lattice, and electronic degrees of freedom in these systems give\nrise to competing quantum phases such as charge density wave (CDW), magnetic\norder, and superconductivity. For example, kagome metal FeGe first exhibits\nA-type collinear antiferromagnetic (AFM) order at T_N ~ 400 K, then establishes\na CDW phase coupled with AFM ordered moment below T_CDW ~ 100 K, and finally\nforms a $c$-axis double cone AFM structure around T_Canting ~ 60 K. Here we use\nneutron scattering to demonstrate the presence of gapless incommensurate spin\nexcitations associated with the double cone AFM structure at temperatures well\nabove T_Canting and T_CDW that merge into gapped commensurate spin waves from\nthe A-type AFM order. While commensurate spin waves follow the Bose population\nfactor and can be well described by a local moment Heisenberg Hamiltonian, the\nincommensurate spin excitations first appear below T_N where AFM order is\ncommensurate, start to deviate from the Bose population factor around T_CDW,\nand peaks at T_Canting, consistent with a critical scattering of a second order\nmagnetic phase transition, as a function of decreasing temperature. By\ncomparing these results with density functional theory calculations, we\nconclude that the incommensurate magnetic structure arises from the nested\nFermi surfaces of itinerant electrons and the formation of a spin density wave\norder. The temperature dependence of the incommensurate spin excitations\nsuggests a coupling between spin density wave and CDW order, likely due to flat\nelectronic bands near the Fermi level around T_N and associated electron\ncorrelation effects.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:13:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Lebing",""],["Teng","Xiaokun",""],["Tan","Hengxin",""],["Winn","Barry L.",""],["Granorth","Garrett E.",""],["Ye","Feng",""],["Yu","D. H.",""],["Mole","R. A.",""],["Gao","Bin",""],["Yan","Binghai",""],["Yi","Ming",""],["Dai","Pengcheng",""]]}
{"id":"2308.04816","submitter":"Samuel Schmidt","authors":"Andrej Keksel, Samuel Schmidt, Dietrich Beck, J\\\"org Seewig","title":"Scientific modeling of Optical 3D Measuring Devices based on\n  GPU-accelerated Ray Tracing using the NVIDIA OptiX Engine","comments":"conference","journal-ref":"Proceedings of SPIE - Modeling Aspects in Optical Metrology IX -\n  2023","doi":"10.1117/12.2673777","report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Scientific optical 3D modeling requires the possibility to implement highly\nflexible and customizable mathematical models as well as high computing power.\nHowever, established ray tracing software for optical design and modeling\npurposes often has limitations in terms of access to underlying mathematical\nmodels and the possibility of accelerating the mostly CPU-based computation. To\naddress these limitations, we propose the use of NVIDIA's OptiX Ray Tracing\nEngine as a highly flexible and high-performing alternative. OptiX offers a\nhighly customizable ray tracing framework with onboard GPU support for parallel\ncomputing, as well as access to optimized ray tracing algorithms for\naccelerated computation. To demonstrate the capabilities of our approach, a\nrealistic focus variation instrument is modeled, describing optical instrument\ncomponents (light sources, lenses, detector, etc.) as well as the measuring\nsample surface mathematically or as meshed files. Using this focus variation\ninstrument model, exemplary virtual measurements of arbitrary and standardized\nsample surfaces are carried out, generating image stacks of more than 100\nimages and tracing more than 1E9 light rays per image. The performance and\naccuracy of the simulations are qualitatively evaluated, and virtually\ngenerated detector images are compared with images acquired by a respective\nphysical measuring device.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:13:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Keksel","Andrej",""],["Schmidt","Samuel",""],["Beck","Dietrich",""],["Seewig","J\u00f6rg",""]]}
{"id":"2308.04817","submitter":"Richard Gerhard Hess","authors":"Richard Hess, Henry F. Legg, Daniel Loss, and Jelena Klinovaja","title":"Josephson transistor from the superconducting diode effect in domain\n  wall and skyrmion magnetic racetracks","comments":"16 pages, 11 figures, 1 table","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":"  In superconductors, the combination of broken time-reversal and broken\ninversion symmetries can result in a critical current being dependent on the\ndirection of current flow. This phenomenon is known as superconducting diode\neffect (SDE) and has great potential for applications in future low-temperature\nelectronics. Here, we investigate how magnetic textures such as domain walls or\nskyrmions on a racetrack can be used to control the SDE in a Josephson junction\nand how the SDE can be used as a low-temperature read-out of the data in\nracetrack memory devices. First, we consider a two-dimensional electron gas\n(2DEG) with strong spin-orbit-interaction (SOI) coupled to a magnetic\nracetrack, which forms the weak-link in a Josephson junction. In this setup,\nthe exchange coupling between the magnetic texture and the itinerant electrons\nin the 2DEG breaks time-reversal symmetry and enables the SDE. When a magnetic\ntexture, such as a domain wall or skyrmion enters the Josephson junction, the\nlocal exchange field within the junction is changed and, consequently, the\nstrength of the SDE is altered. In particular, depending on the position and\nform of the magnetic texture, moving the magnetic texture can cause the SDE\ncoefficient to change its sign, enabling a Josephson transistor effect with\npotentially fast switching frequencies. Further, we find that the SDE is\nenhanced if the junction length-scales are comparable with the length-scale of\nthe magnetic texture. Furthermore, we show that, under certain circumstances,\nthe symmetry breaking provided by particular magnetic textures, such as\nskyrmions, can lead to an SDE even in the absence of Rashba SOI in the 2DEG.\nOur results provide a basis for new forms of readout in low-temperature memory\ndevices as well as demonstrating how a Josephson transistor effect can be\nachieved even in the absence of an external magnetic field and intrinsic Rashba\nSOI.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:14:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hess","Richard",""],["Legg","Henry F.",""],["Loss","Daniel",""],["Klinovaja","Jelena",""]]}
{"id":"2308.04818","submitter":"Zhuoao Xu","authors":"Zhuoao Xu, Yue Gao, Gaojie Chen, Ryan Fernandez, Vedaprabhu\n  Basavarajappa, Rahim Tafazolli","title":"Enhancement of Satellite-to-Phone Link Budget by Using Distributed\n  Beamforming","comments":"8 pages, 6 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Small satellites in Low Earth Orbit (LEO) attract much attention from both\nindustry and academia. The latest production and launch technologies constantly\ndrive the development of LEO constellations. However, the wideband signal,\nexcept text messages, cannot be transmitted directly from an LEO satellite to a\nstandard mobile cellular phone due to the insufficient link budget. The current\nLEO constellation network has to use an extra ground device to receive the\nsignal from the satellite first and then forward the signal to the User\nEquipment (UE). To achieve direct network communications between LEO satellites\nand UE, we propose a novel distributed beamforming technology based on the\nsuperposition of electromagnetic (EM) waves radiated from multiple satellites\nthat can significantly enhance the link budget in this paper. EM full-wave\nsimulation and Monte Carlo simulation results are provided to verify the\neffectiveness of the proposed method. The simulation results show a nearly 6 dB\nenhancement using two radiation sources and an almost 12 dB enhancement using\nfour sources. The received power enhancement could be doubled compared to the\ndiversity gain in Multiple-Input and Single-Output (MISO). Furthermore, other\npractical application challenges, such as the synchronization and Doppler\neffect, are also presented.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:16:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xu","Zhuoao",""],["Gao","Yue",""],["Chen","Gaojie",""],["Fernandez","Ryan",""],["Basavarajappa","Vedaprabhu",""],["Tafazolli","Rahim",""]]}
{"id":"2308.04819","submitter":"Lukas Daniel Klausner","authors":"Gabriela Viale Pereira, Lukas Daniel Klausner, Lucy Temple, Thomas\n  Delissen, Thomas Lampoltshammer, Torsten Priebe","title":"\"This (Smart) Town Ain't Big Enough\": Smart Small Towns and Digital\n  Twins for Sustainable Urban and Regional Development","comments":"6 pages, 1 figure","journal-ref":"Joint Proceedings of Ongoing Research, Practitioners, Posters,\n  Workshops, and Projects at EGOV-CeDEM-ePart 2023 (EGOV 2023), 2023","doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the major challenges today lies in the creation of governance concepts\nfor regional development that not only promote growth but, at the same time,\nensure promotion of inclusiveness, fairness, and resilience. Digital twins can\nsupport policymakers in developing smart, sustainable solutions for cities and\nregions and, therefore, urban and non-urban environments. The project SCiNDTiLA\n(Smart Cities aNd Digital Twins in Lower Austria) aims to define the\nstate-of-the-art in the field of smart cities, identify interdependencies,\ncritical components and stakeholders, and provide a roadmap for smart cities\nwith application to both smaller-scale urban and non-urban environments.\nSCiNDTiLA uses the foundations of complexity theory and computational social\nscience methods to model Austrian towns and regions as smart cities/regions and\nthus as systems of socio-technical interaction to guide policy decision-making\ntoward sustainable development.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:20:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pereira","Gabriela Viale",""],["Klausner","Lukas Daniel",""],["Temple","Lucy",""],["Delissen","Thomas",""],["Lampoltshammer","Thomas",""],["Priebe","Torsten",""]]}
{"id":"2308.04820","submitter":"Gioele Zardini","authors":"Gioele Zardini, Nicolas Lanzetti, Giuseppe Belgioioso, Christian\n  Hartnik, Saverio Bolognani, Florian D\\\"orfler, Emilio Frazzoli","title":"Strategic Interactions in Multi-modal Mobility Systems: A Game-Theoretic\n  Perspective","comments":"8 pages, 5 figures, to appear in the proceedings of the 2023 IEEE\n  26th International Conference on Intelligent Transportation Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.SY eess.SY math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The evolution of existing transportation systems,mainly driven by\nurbanization and increased availability of mobility options, such as private,\nprofit-maximizing ride-hailing companies, calls for tools to reason about their\ndesign and regulation. To study this complex socio-technical problem, one needs\nto account for the strategic interactions of the heterogeneous stakeholders\ninvolved in the mobility ecosystem and analyze how they influence the system.\nIn this paper, we focus on the interactions between citizens who compete for\nthe limited resources of a mobility system to complete their desired trip.\nSpecifically, we present a game-theoretic framework for multi-modal mobility\nsystems, where citizens, characterized by heterogeneous preferences, have\naccess to various mobility options and seek individually-optimal decisions. We\nstudy the arising game and prove the existence of an equilibrium, which can be\nefficiently computed via a convex optimization problem. Through both an\nanalytical and a numerical case study for the classic scenario of Sioux Falls,\nUSA, we illustrate the capabilities of our model and perform sensitivity\nanalyses. Importantly, we show how to embed our framework into a \"larger\" game\namong stakeholders of the mobility ecosystem (e.g., municipality, Mobility\nService Providers, and citizens), effectively giving rise to tools to inform\nstrategic interventions and policy-making in the mobility ecosystem.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:22:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zardini","Gioele",""],["Lanzetti","Nicolas",""],["Belgioioso","Giuseppe",""],["Hartnik","Christian",""],["Bolognani","Saverio",""],["D\u00f6rfler","Florian",""],["Frazzoli","Emilio",""]]}
{"id":"2308.04821","submitter":"Sriprabha Ramanarayanan","authors":"Sriprabha Ramanarayanan, Mohammad Al Fahim, Rahul G.S., Amrit Kumar\n  Jethi, Keerthi Ram, Mohanasankar Sivaprakasam","title":"HyperCoil-Recon: A Hypernetwork-based Adaptive Coil Configuration Task\n  Switching Network for MRI Reconstruction","comments":"Accepted at the ICCV 2023 Workshop on Computer Vision for Automated\n  Medical Diagnosis (CVAMD), 8 pages, 2 columns","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Parallel imaging, a fast MRI technique, involves dynamic adjustments based on\nthe configuration i.e. number, positioning, and sensitivity of the coils with\nrespect to the anatomy under study. Conventional deep learning-based image\nreconstruction models have to be trained or fine-tuned for each configuration,\nposing a barrier to clinical translation, given the lack of computational\nresources and machine learning expertise for clinicians to train models at\ndeployment. Joint training on diverse datasets learns a single weight set that\nmight underfit to deviated configurations. We propose, HyperCoil-Recon, a\nhypernetwork-based coil configuration task-switching network for multi-coil MRI\nreconstruction that encodes varying configurations of the numbers of coils in a\nmulti-tasking perspective, posing each configuration as a task. The\nhypernetworks infer and embed task-specific weights into the reconstruction\nnetwork, 1) effectively utilizing the contextual knowledge of common and\nvarying image features among the various fields-of-view of the coils, and 2)\nenabling generality to unseen configurations at test time. Experiments reveal\nthat our approach 1) adapts on the fly to various unseen configurations up to\n32 coils when trained on lower numbers (i.e. 7 to 11) of randomly varying\ncoils, and to 120 deviated unseen configurations when trained on 18\nconfigurations in a single model, 2) matches the performance of coil\nconfiguration-specific models, and 3) outperforms configuration-invariant\nmodels with improvement margins of around 1 dB / 0.03 and 0.3 dB / 0.02 in PSNR\n/ SSIM for knee and brain data. Our code is available at\nhttps://github.com/sriprabhar/HyperCoil-Recon\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:22:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ramanarayanan","Sriprabha",""],["Fahim","Mohammad Al",""],["S.","Rahul G.",""],["Jethi","Amrit Kumar",""],["Ram","Keerthi",""],["Sivaprakasam","Mohanasankar",""]]}
{"id":"2308.04822","submitter":"Xingjuan Li","authors":"Zhaoxia Heng, Xingjuan Li, Liangliang Shang","title":"Properties of Heavy Higgs Bosons and Dark Matter under Current\n  Experimental Limits in the $\\mu$NMSSM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Searches for new particles beyond the Standard Model (SM) are an important\ntask for the Large Hadron Collider (LHC). In this paper, we investigate the\nproperties of the heavy non-SM Higgs bosons in the $\\mu$-term extended\nNext-to-Minimal Supersymmetric Standard Model ($\\mu$NMSSM). We scan the\nparameter space of the $\\mu$NMSSM considering the basic constraints from Higgs\ndata, dark matter (DM) relic density, and LHC searches for sparticles. And we\nalso consider the constraints from the LZ2022 experiment and the muon anomaly\nconstraint at 2$\\sigma$ level.\n  We find that the LZ2022 experiment has a strict constraint on the parameter\nspace of the $\\mu$NMSSM, and the limits from the DM-nucleon spin-independent\n(SI) and spin-dependent (SD) cross-sections are complementary. Then we discuss\nthe exotic decay modes of heavy Higgs bosons decaying into SM-like Higgs boson.\nWe find that for doublet-dominated Higgs $h_3$ and $A_2$, the main exotic decay\nchannels are $h_3\\rightarrow Z A_1$, $h_3\\rightarrow h_1 h_2$, $A_2\\rightarrow\nA_1 h_1$ and $A_2\\rightarrow Z h_2$, and the branching ratio can reach to about\n23$\\%$, 10$\\%$, 35$\\%$ and 10$\\%$ respectively. At the 13 TeV LHC, the\nproduction cross-section of $ggF\\rightarrow h_3\\rightarrow h_1 h_2$ and\n$ggF\\rightarrow A_2\\rightarrow A_1 h_1$ can reach to about $10^{-11}$pb and\n$10^{-10}$pb, respectively.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:22:50 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 10:57:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Heng","Zhaoxia",""],["Li","Xingjuan",""],["Shang","Liangliang",""]]}
{"id":"2308.04823","submitter":"Hui Zeng","authors":"Hui Zeng, Jingyuan Xue, Meng Hao, Chen Sun, Bin Ning, Na Zhang","title":"Evaluating the Generation Capabilities of Large Chinese Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents CG-Eval, the first comprehensive evaluation of the\ngeneration capabilities of large Chinese language models across a wide range of\nacademic disciplines. The models' performance was assessed based on their\nability to generate accurate and relevant responses to different types of\nquestions in six disciplines, namely, Science and Engineering, Humanities and\nSocial Sciences, Mathematical Calculations, Medical Practitioner Qualification\nExamination, Judicial Examination, and Certified Public Accountant Examination.\nThis paper also presents Gscore, a composite index derived from the weighted\nsum of multiple metrics to measure the quality of model's generation against a\nreference. The test data and test results can be found at\nhttp://cgeval.besteasy.com/.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:22:56 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 04:17:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zeng","Hui",""],["Xue","Jingyuan",""],["Hao","Meng",""],["Sun","Chen",""],["Ning","Bin",""],["Zhang","Na",""]]}
{"id":"2308.04824","submitter":"Qian Wang","authors":"Qian Wang and Marko Robnik","title":"Power-law decay of the fraction of the mixed eigenstates in kicked top\n  model with mixed-type classical phase space","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 properties of mixed eigenstates in a generic quantum system with\nclassical counterpart that has mixed-type phase space, although important to\nunderstand several fundamental questions that arise in both theoretical and\nexperimental studies, are still not clear. Here, following a recent work\n[\\v{C}.~Lozej {\\it et al}. Phys. Rev. E {\\bf 106}, 054203 (2022)], we perform\nan analysis of the features of mixed eigenstates in a time-dependent\nHamiltonian system, the celebrated kicked top model. As a paradigmatic model\nfor studying quantum chaos, kicked top model is known to exhibit both classical\nand quantum chaos. The types of eigenstates are identified by means of the\nphase space overlap index, which is defined as the overlap of the Husimi\nfunction with regular and chaotic regions in classical phase space. We show\nthat the mixed eigenstates appear due to various tunneling precesses between\ndifferent phase space structures, while the regular and chaotic eigenstates\nare, respectively, associated with invariant tori and chaotic component in\nphase space. We examine how the probability distribution of the phase space\noverlap index evolves with increasing system size for different kicking\nstrengths. In particular, we find that the relative fraction of mixed states\nexhibits a power-law decay as the system size increases, indicating that only\npurely regular and chaotic eigenstates are left in the strict semiclassical\nlimit. We thus provide further verification of the principle of uniform\nsemiclassical condensation of Husimi functions and confirm the correctness of\nthe Berry-Robnik picture.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:23:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Qian",""],["Robnik","Marko",""]]}
{"id":"2308.04825","submitter":"Diala Hawat","authors":"Diala Hawat, R\\'emi Bardenet, Rapha\\\"el Lachi\\`eze-Rey","title":"Repelled point processes with application to numerical integration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear statistics of point processes yield Monte Carlo estimators of\nintegrals. While the simplest approach relies on a homogeneous Poisson point\nprocess, more regularly spread point processes, such as scrambled\nlow-discrepancy sequences or determinantal point processes, can yield Monte\nCarlo estimators with fast-decaying mean square error. Following the intuition\nthat more regular configurations result in lower integration error, we\nintroduce the repulsion operator, which reduces clustering by slightly pushing\nthe points of a configuration away from each other. Our main theoretical result\nis that applying the repulsion operator to a homogeneous Poisson point process\nyields an unbiased Monte Carlo estimator with lower variance than under the\noriginal point process. On the computational side, the evaluation of our\nestimator is only quadratic in the number of integrand evaluations and can be\neasily parallelized without any communication across tasks. We illustrate our\nvariance reduction result with numerical experiments and compare it to popular\nMonte Carlo methods. Finally, we numerically investigate a few open questions\non the repulsion operator. In particular, the experiments suggest that the\nvariance reduction also holds when the operator is applied to other\nmotion-invariant point processes.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:24:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hawat","Diala",""],["Bardenet","R\u00e9mi",""],["Lachi\u00e8ze-Rey","Rapha\u00ebl",""]]}
{"id":"2308.04826","submitter":"Muyu Xu","authors":"Muyu Xu, Fangneng Zhan, Jiahui Zhang, Yingchen Yu, Xiaoqin Zhang,\n  Christian Theobalt, Ling Shao and Shijian Lu","title":"WaveNeRF: Wavelet-based Generalizable Neural Radiance Fields","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":"  Neural Radiance Field (NeRF) has shown impressive performance in novel view\nsynthesis via implicit scene representation. However, it usually suffers from\npoor scalability as requiring densely sampled images for each new scene.\nSeveral studies have attempted to mitigate this problem by integrating\nMulti-View Stereo (MVS) technique into NeRF while they still entail a\ncumbersome fine-tuning process for new scenes. Notably, the rendering quality\nwill drop severely without this fine-tuning process and the errors mainly\nappear around the high-frequency features. In the light of this observation, we\ndesign WaveNeRF, which integrates wavelet frequency decomposition into MVS and\nNeRF to achieve generalizable yet high-quality synthesis without any per-scene\noptimization. To preserve high-frequency information when generating 3D feature\nvolumes, WaveNeRF builds Multi-View Stereo in the Wavelet domain by integrating\nthe discrete wavelet transform into the classical cascade MVS, which\ndisentangles high-frequency information explicitly. With that, disentangled\nfrequency features can be injected into classic NeRF via a novel hybrid neural\nrenderer to yield faithful high-frequency details, and an intuitive\nfrequency-guided sampling strategy can be designed to suppress artifacts around\nhigh-frequency regions. Extensive experiments over three widely studied\nbenchmarks show that WaveNeRF achieves superior generalizable radiance field\nmodeling when only given three images as input.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:24:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xu","Muyu",""],["Zhan","Fangneng",""],["Zhang","Jiahui",""],["Yu","Yingchen",""],["Zhang","Xiaoqin",""],["Theobalt","Christian",""],["Shao","Ling",""],["Lu","Shijian",""]]}
{"id":"2308.04827","submitter":"Nydia Roxana Varela-Rosales","authors":"Nydia Roxana Varela-Rosales, Michael Engel","title":"Tuning the Stability of a Model Quasicrystal and its Approximants with a\n  Periodic Substrate","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quasicrystals and their periodic approximants are complex phases, which have\nby now been observed in many metallic alloys, soft matter systems, and particle\nsimulations. In recent experiments of thin-film perovskites on solid\nsubstrates, the type of complex phase was found to change depending on\nthermodynamic conditions and the type of substrate used. Here, we investigate\nthe effect of a substrate on the relative stability of a two-dimensional model\nquasicrystal and its approximants. Our numerical methods are molecular dynamics\nsimulations and free energy calculations that take into account phason flips\nexplicitly. For weak substrates, we observe an incommensurate-commensurate\ntransition, in which a continuous series of QC approximants locks into a\ndiscrete number of approximants. For stronger substrates, an enhancement of the\nstability of the dodecagonal quasicrystal and a variants of square lattices\nwere found. All phenomena can be explained by the interplay of the model system\nwith the substrate. Our results demonstrate that designing novel complex\nperiodic and quasiperiodic structures by choice of suitable substrates is a\npromising strategy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:26:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Varela-Rosales","Nydia Roxana",""],["Engel","Michael",""]]}
{"id":"2308.04828","submitter":"Qiang Wang","authors":"Qiang Wang, Junlong Du, Ke Yan, Shouhong Ding","title":"Seeing in Flowing: Adapting CLIP for Action Recognition with Motion\n  Prompts Learning","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":"  The Contrastive Language-Image Pre-training (CLIP) has recently shown\nremarkable generalization on \"zero-shot\" training and has applied to many\ndownstream tasks. We explore the adaptation of CLIP to achieve a more efficient\nand generalized action recognition method. We propose that the key lies in\nexplicitly modeling the motion cues flowing in video frames. To that end, we\ndesign a two-stream motion modeling block to capture motion and spatial\ninformation at the same time. And then, the obtained motion cues are utilized\nto drive a dynamic prompts learner to generate motion-aware prompts, which\ncontain much semantic information concerning human actions. In addition, we\npropose a multimodal communication block to achieve a collaborative learning\nand further improve the performance. We conduct extensive experiments on\nHMDB-51, UCF-101, and Kinetics-400 datasets. Our method outperforms most\nexisting state-of-the-art methods by a significant margin on \"few-shot\" and\n\"zero-shot\" training. We also achieve competitive performance on \"closed-set\"\ntraining with extremely few trainable parameters and additional computational\ncosts.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:33:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Qiang",""],["Du","Junlong",""],["Yan","Ke",""],["Ding","Shouhong",""]]}
{"id":"2308.04829","submitter":"Kaixin Cai","authors":"Kaixin Cai, Pengzhen Ren, Yi Zhu, Hang Xu, Jianzhuang Liu, Changlin\n  Li, Guangrun Wang, Xiaodan Liang","title":"MixReorg: Cross-Modal Mixed Patch Reorganization is a Good Mask Learner\n  for Open-World 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":"  Recently, semantic segmentation models trained with image-level text\nsupervision have shown promising results in challenging open-world scenarios.\nHowever, these models still face difficulties in learning fine-grained semantic\nalignment at the pixel level and predicting accurate object masks. To address\nthis issue, we propose MixReorg, a novel and straightforward pre-training\nparadigm for semantic segmentation that enhances a model's ability to\nreorganize patches mixed across images, exploring both local visual relevance\nand global semantic coherence. Our approach involves generating fine-grained\npatch-text pairs data by mixing image patches while preserving the\ncorrespondence between patches and text. The model is then trained to minimize\nthe segmentation loss of the mixed images and the two contrastive losses of the\noriginal and restored features. With MixReorg as a mask learner, conventional\ntext-supervised semantic segmentation models can achieve highly generalizable\npixel-semantic alignment ability, which is crucial for open-world segmentation.\nAfter training with large-scale image-text data, MixReorg models can be applied\ndirectly to segment visual objects of arbitrary categories, without the need\nfor further fine-tuning. Our proposed framework demonstrates strong performance\non popular zero-shot semantic segmentation benchmarks, outperforming GroupViT\nby significant margins of 5.0%, 6.2%, 2.5%, and 3.4% mIoU on PASCAL VOC2012,\nPASCAL Context, MS COCO, and ADE20K, respectively.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:35:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cai","Kaixin",""],["Ren","Pengzhen",""],["Zhu","Yi",""],["Xu","Hang",""],["Liu","Jianzhuang",""],["Li","Changlin",""],["Wang","Guangrun",""],["Liang","Xiaodan",""]]}
{"id":"2308.04830","submitter":"Liyang Chen","authors":"Liyang Chen, Zhiyong Wu, Runnan Li, Weihong Bao, Jun Ling, Xu Tan,\n  Sheng Zhao","title":"VAST: Vivify Your Talking Avatar via Zero-Shot Expressive Facial Style\n  Transfer","comments":"Accepted by ICCV2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current talking face generation methods mainly focus on speech-lip\nsynchronization. However, insufficient investigation on the facial talking\nstyle leads to a lifeless and monotonous avatar. Most previous works fail to\nimitate expressive styles from arbitrary video prompts and ensure the\nauthenticity of the generated video. This paper proposes an unsupervised\nvariational style transfer model (VAST) to vivify the neutral photo-realistic\navatars. Our model consists of three key components: a style encoder that\nextracts facial style representations from the given video prompts; a hybrid\nfacial expression decoder to model accurate speech-related movements; a\nvariational style enhancer that enhances the style space to be highly\nexpressive and meaningful. With our essential designs on facial style learning,\nour model is able to flexibly capture the expressive facial style from\narbitrary video prompts and transfer it onto a personalized image renderer in a\nzero-shot manner. Experimental results demonstrate the proposed approach\ncontributes to a more vivid talking avatar with higher authenticity and richer\nexpressiveness.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:38:14 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 05:56:35 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Liyang",""],["Wu","Zhiyong",""],["Li","Runnan",""],["Bao","Weihong",""],["Ling","Jun",""],["Tan","Xu",""],["Zhao","Sheng",""]]}
{"id":"2308.04831","submitter":"Mayank Raikwar","authors":"Mayank Raikwar, Nikita Polyanskii, Sebastian M\\\"uller","title":"Fairness Notions in DAG-based DLTs","comments":"8 Pages, Accepted in 5th Conference on Blockchain Research &\n  Applications for Innovative Networks and Services (BRAINS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the issue of fairness in Distributed Ledger\nTechnology (DLT), specifically focusing on the shortcomings observed in current\nblockchain systems due to Miner Extractable Value (MEV) phenomena and systemic\ncentralization. We explore the potential of Directed Acyclic Graphs (DAGs) as a\nsolution to address or mitigate these fairness concerns. Our objective is to\ngain a comprehensive understanding of fairness in DAG-based DLTs by examining\nits different aspects and measurement metrics. We aim to establish a shared\nknowledge base that facilitates accurate fairness assessment and allows for an\nevaluation of whether DAG-based DLTs offer a more equitable design. We describe\nthe various dimensions of fairness and conduct a comparative analysis to\nexamine how they relate to different components of DLTs. This analysis serves\nas a catalyst for further research, encouraging the development of\ncryptographic systems that promote fairness.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:40:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Raikwar","Mayank",""],["Polyanskii","Nikita",""],["M\u00fcller","Sebastian",""]]}
{"id":"2308.04832","submitter":"Yuanhao Gong","authors":"Yuanhao Gong","title":"TSSR: A Truncated and Signed Square Root Activation Function for Neural\n  Networks","comments":"arXiv admin note: substantial text overlap with arXiv:2307.16389","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.LG cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Activation functions are essential components of neural networks. In this\npaper, we introduce a new activation function called the Truncated and Signed\nSquare Root (TSSR) function. This function is distinctive because it is odd,\nnonlinear, monotone and differentiable. Its gradient is continuous and always\npositive. Thanks to these properties, it has the potential to improve the\nnumerical stability of neural networks. Several experiments confirm that the\nproposed TSSR has better performance than other stat-of-the-art activation\nfunctions. The proposed function has significant implications for the\ndevelopment of neural network models and can be applied to a wide range of\napplications in fields such as computer vision, natural language processing,\nand speech recognition.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:40:34 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gong","Yuanhao",""]]}
{"id":"2308.04833","submitter":"Minjin Jeong","authors":"Minjin Jeong, Carsten Rott (for the IceCube Collaboration)","title":"Search for Dark Matter Decay in Nearby Galaxy Clusters and Galaxies with\n  IceCube","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-1378","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dark matter could decay into Standard Model particles producing neutrinos\ndirectly or indirectly. The resulting flux of neutrinos from these decays could\nbe detectable at neutrino telescopes and would be associated with massive\ncelestial objects where dark matter is expected to be accumulated. Recent\nobservations of high-energy astrophysical neutrinos at IceCube might hint at a\nsignal produced by the decay of TeV to PeV scale dark matter. This analysis\nsearches for neutrinos from decaying dark matter in nearby galaxy clusters and\ngalaxies. We focus on dark matter masses from 10 TeV to 1 EeV and four decay\nchannels: $\\nu\\bar{\\nu}$, $\\tau^{+}\\tau^{-}$, $W^{+}W^{-}$, $b\\bar{b}$. Three\ngalaxy clusters, seven dwarf galaxies, and the Andromeda galaxy are chosen as\ntargets and stacked within the same source class. A well-established IceCube\ndata sample is used, which contains 11 years of upward-going track-like events.\nIn this contribution, we present preliminary results of the analysis.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:45:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jeong","Minjin","","for the IceCube Collaboration"],["Rott","Carsten","","for the IceCube Collaboration"]]}
{"id":"2308.04834","submitter":"Mengyu Yang","authors":"Ye Tian, Mengyu Yang, Lanshan Zhang, Zhizhen Zhang, Yang Liu, Xiaohui\n  Xie, Xirong Que, Wendong Wang","title":"View while Moving: Efficient Video Recognition in Long-untrimmed Videos","comments":"Accepted at ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent adaptive methods for efficient video recognition mostly follow the\ntwo-stage paradigm of \"preview-then-recognition\" and have achieved great\nsuccess on multiple video benchmarks. However, this two-stage paradigm involves\ntwo visits of raw frames from coarse-grained to fine-grained during inference\n(cannot be parallelized), and the captured spatiotemporal features cannot be\nreused in the second stage (due to varying granularity), being not friendly to\nefficiency and computation optimization. To this end, inspired by human\ncognition, we propose a novel recognition paradigm of \"View while Moving\" for\nefficient long-untrimmed video recognition. In contrast to the two-stage\nparadigm, our paradigm only needs to access the raw frame once. The two phases\nof coarse-grained sampling and fine-grained recognition are combined into\nunified spatiotemporal modeling, showing great performance. Moreover, we\ninvestigate the properties of semantic units in video and propose a\nhierarchical mechanism to efficiently capture and reason about the unit-level\nand video-level temporal semantics in long-untrimmed videos respectively.\nExtensive experiments on both long-untrimmed and short-trimmed videos\ndemonstrate that our approach outperforms state-of-the-art methods in terms of\naccuracy as well as efficiency, yielding new efficiency and accuracy trade-offs\nfor video spatiotemporal modeling.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:46:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tian","Ye",""],["Yang","Mengyu",""],["Zhang","Lanshan",""],["Zhang","Zhizhen",""],["Liu","Yang",""],["Xie","Xiaohui",""],["Que","Xirong",""],["Wang","Wendong",""]]}
{"id":"2308.04835","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Search for magnetic monopoles and stable particles with high electric\n  charges in $\\sqrt{s}=$13 TeV $pp$ collisions with the ATLAS detector","comments":"51 pages in total, author list starting page 24, 22 figures, 3\n  tables, submitted to JHEP. All figures including auxiliary figures are\n  available at\n  http://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/EXOT-2019-33","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-150","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a search for magnetic monopoles and high-electric-charge objects\nusing LHC Run 2 $\\sqrt{s} =$13 TeV proton$-$proton collisions recorded by the\nATLAS detector. A total integrated luminosity of 138 fb$^{-1}$ was collected by\na specialized trigger. No highly ionizing particle candidate was observed.\nConsidering the Drell-Yan and photon-fusion pair production mechanisms as\nbenchmark models, cross-section upper limits are presented for spin-0 and\nspin-$\\frac{1}{2}$ magnetic monopoles of magnetic charge $1g_\\textrm{D}$ and\n$2g_\\textrm{D}$ and for high-electric-charge objects of electric charge $20\n\\leq |z| \\leq 100$, for masses between 200 GeV and 4000 GeV. The search\nimproves by approximately a factor of three the previous cross-section limits\non the Drell-Yan production of magnetic monopoles and high-electric charge\nobjects. Also, the first ATLAS limits on the photon-fusion pair production\nmechanism of magnetic monopoles and high-electric-charge objects have been\nobtained.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:55:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.04836","submitter":"Thai Hung Le","authors":"Hung Le, Kien Do, Dung Nguyen, Svetha Venkatesh","title":"Intrinsic Motivation via Surprise Memory","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new computing model for intrinsic rewards in reinforcement\nlearning that addresses the limitations of existing surprise-driven\nexplorations. The reward is the novelty of the surprise rather than the\nsurprise norm. We estimate the surprise novelty as retrieval errors of a memory\nnetwork wherein the memory stores and reconstructs surprises. Our surprise\nmemory (SM) augments the capability of surprise-based intrinsic motivators,\nmaintaining the agent's interest in exciting exploration while reducing\nunwanted attraction to unpredictable or noisy observations. Our experiments\ndemonstrate that the SM combined with various surprise predictors exhibits\nefficient exploring behaviors and significantly boosts the final performance in\nsparse reward environments, including Noisy-TV, navigation and challenging\nAtari games.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:58:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Le","Hung",""],["Do","Kien",""],["Nguyen","Dung",""],["Venkatesh","Svetha",""]]}
{"id":"2308.04837","submitter":"Dan Zhang","authors":"Dan Zhang and Staal A. Vinterbo","title":"A New Family of Perfect Polyphase Sequences with Low Cross-Correlation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spread spectrum multiple access systems demand minimum possible\ncross-correlation between the sequences within a set of sequences having good\nauto-correlation properties. Through a connection between generalised Frank\nsequences and Florentine arrays, we present a family of perfect sequences with\nlow cross-correlation having a larger family size, compared with previous\nworks. In particular, the family size can be equal to the square root of the\nperiod when the period of the perfect sequences is even. In contrast, the\nnumber of the perfect sequences of even period with low cross-correlation is\nequal to one in all previous works.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:59:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Dan",""],["Vinterbo","Staal A.",""]]}
{"id":"2308.04838","submitter":"Zhijie Liu","authors":"Zhijie Liu, Yutian Tang, Xiapu Luo, Yuming Zhou, and Liang Feng Zhang","title":"No Need to Lift a Finger Anymore? Assessing the Quality of Code\n  Generation by ChatGPT","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 demonstrated impressive capabilities across\nvarious natural language processing (NLP) tasks, such as machine translation,\nquestion answering, summarization, and so on. Additionally, LLMs are also\nhighly valuable in supporting software engineering tasks, particularly in the\nfield of code generation. Automatic code generation is a process of\nautomatically generating source code or executable code based on given\nspecifications or requirements, improving developer productivity. In this\nstudy, we perform a systematic empirical assessment of code generation using\nChatGPT, a recent and popular LLM. Our evaluation encompasses a comprehensive\nanalysis of code snippets generated by ChatGPT, focusing on three critical\naspects: correctness, understandability, and security. We also specifically\ninvestigate ChatGPT's ability to engage in multi-round process (i.e., ChatGPT's\ndialog ability) of facilitating code generation. By delving into the generated\ncode and examining the experimental results, this work provides valuable\ninsights into the performance of ChatGPT in tackling code generation tasks.\nOverall, our findings uncover potential issues and limitations that arise in\nthe ChatGPT-based code generation and lay the groundwork for improving AI and\nLLM-based code generation techniques.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:01:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Zhijie",""],["Tang","Yutian",""],["Luo","Xiapu",""],["Zhou","Yuming",""],["Zhang","Liang Feng",""]]}
{"id":"2308.04839","submitter":"Tenri Jinno","authors":"Tenri Jinno, Takayuki R. Saitoh, Yota Ishigaki and Junichiro Makino","title":"$N$-body simulation of planetary formation through pebble accretion in a\n  radially structured protoplanetary disk","comments":"19 pages, 19 figures, accepted for publication in PASJ (Publications\n  of the Astronomical Society of Japan). The paper is the same as v1, but\n  comments on the paper status added","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the conventional theory of planet formation, it is assumed that\nprotoplanetary disks are axisymmetric and have a smooth radial profile.\nHowever, recent radio observations of protoplanetary disks have revealed that\nmany of them have complex radial structures. In this study, we perform a series\nof $N$-body simulations to investigate how planets are formed in protoplanetary\ndisks with radial structures. For this purpose, we consider the effect of\ncontinuous pebble accretion onto the discontinuity boundary within the\nterrestrial planet-forming region ($\\sim0.6$ AU). We found that protoplanets\ngrow efficiently at the discontinuity boundary, reaching the Earth mass within\n$\\sim10^4$ years. We confirmed that giant collisions of protoplanets occur\nuniversally in our model. Moreover, we found that multiple planet-sized bodies\nform at regular intervals in the vicinity of the discontinuity boundary. These\nresults indicate the possibility of the formation of solar system-like\nplanetary systems in radially structured protoplanetary disks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:02:27 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 04:18:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jinno","Tenri",""],["Saitoh","Takayuki R.",""],["Ishigaki","Yota",""],["Makino","Junichiro",""]]}
{"id":"2308.04840","submitter":"Jun Sun","authors":"Li-Wei Li, Jun Sun, Chao Li, Wei Fang, Vasile Palade, Xiao-Jun Wu","title":"Analyzing and controlling diversity in quantum-behaved particle swarm\n  optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the issues of controlling and analyzing the population\ndiversity in quantum-behaved particle swarm optimization (QPSO), which is an\noptimization approach motivated by concepts in quantum mechanics and PSO. In\norder to gain an in-depth understanding of the role the diversity plays in the\nevolving process, we first define the genotype diversity by the distance to the\naverage point of the particles' positions and the phenotype diversity by the\nfitness values for the QPSO. Then, the correlations between the two types of\ndiversities and the search performance are tested and analyzed on several\nbenchmark functions, and the distance-to-average-point diversity is showed to\nhave stronger association with the search performance during the evolving\nprocesses. Finally, in the light of the performed diversity analyses, two\nstrategies for controlling the distance-to-average-point diversities are\nproposed for the purpose of improving the search ability of the QPSO algorithm.\nEmpirical studies on the QPSO with the introduced diversity control methods are\nperformed on a set of benchmark functions from the CEC 2005 benchmark suite.\nThe performance of the proposed methods are evaluated and compared with the\noriginal QPSO and other PSO variants.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:02:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Li-Wei",""],["Sun","Jun",""],["Li","Chao",""],["Fang","Wei",""],["Palade","Vasile",""],["Wu","Xiao-Jun",""]]}
{"id":"2308.04841","submitter":"Sven Teunissen","authors":"Wei-Shu Hou, Girish Kumar, Sven Teunissen","title":"Discovery Prospects for Electron and Neutron Electric Dipole Moments in\n  the General Two Higgs Doublet Model","comments":"4 pages, 4 labeled figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Baryon asymmetry of the Universe offers one of the strongest hints for\nphysics Beyond the Standard Model (BSM). Remarkably, in the general two Higgs\nDoublet Model (g2HDM) that possesses a second set of Yukawa matrices, one can\nhave electroweak baryogenesis (EWBG) while the electron electric dipole moment\n(eEDM) is evaded by a natural flavor tuning that echoes SM. We show that eEDM\nmay first emerge around $10^{-30}\\,e$ cm or so, followed by neutron EDM (nEDM)\ndown to $10^{-27}\\,e$ cm. We illustrate a cancellation mechanism for nEDM\nitself, which in turn can be probed when a facility capable of pushing down to\n$10^{-28}\\,e$ cm becomes available.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:03:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hou","Wei-Shu",""],["Kumar","Girish",""],["Teunissen","Sven",""]]}
{"id":"2308.04842","submitter":"Olger Siebinga","authors":"Olger Siebinga, Arkady Zgonnikov, David A. Abbink","title":"Merging in a Coupled Driving Simulator: How do drivers resolve\n  conflicts?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traffic interactions between merging and highway vehicles are a major topic\nof research, yielding many empirical studies and models of driver behaviour.\nMost of these studies on merging use naturalistic data. Although this provides\ninsight into human gap acceptance and traffic flow effects, it obscures the\noperational inputs of interacting drivers. Besides that, researchers have no\ncontrol over the vehicle kinematics (i.e., positions and velocities) at the\nstart of the interactions. Therefore the relationship between initial\nkinematics and the outcome of the interaction is difficult to investigate. To\naddress these gaps, we conducted an experiment in a coupled driving simulator\nwith a simplified, top-down view, merging scenario with two vehicles. We found\nthat kinematics can explain the outcome (i.e., which driver merges first) and\nthe duration of the merging conflict. Furthermore, our results show that\ndrivers use key decision moments combined with constant acceleration inputs\n(intermittent piecewise-constant control) during merging. This indicates that\nthey do not continuously optimize their expected utility. Therefore, these\nresults advocate the development of interaction models based on intermittent\npiecewise-constant control. We hope our work can contribute to this development\nand to the fundamental knowledge of interactive driver behaviour.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:04:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Siebinga","Olger",""],["Zgonnikov","Arkady",""],["Abbink","David A.",""]]}
{"id":"2308.04843","submitter":"Sahil Kundu","authors":"Sahil Kundu, Surya Narayan Maharana, Manoranjan Mishra (Department of\n  Mathematics, Indian Institute of Technology Ropar, Rupnagar, India)","title":"Existence and Uniqueness of Solution to Unsteady Darcy-Brinkman Problem\n  with Korteweg Stress for Modelling Miscible Porous Media Flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The work investigates a model in the first half that combines a\nconvection-diffusion equation for solute concentration with an unsteady\nDarcy-Brinkman equation for the flow field, including the Kortweg stress. Such\nmodels are used to describe flows in porous mediums such as fractured karst\nreservoirs, mineral wool, industrial foam, coastal mud, etc. The system of\nequations has Neumann boundary conditions for the solute concentration and\nno-flow conditions for the velocity field, and the well-posedness of the model\nis discussed for a wide range of initial data. In the second half, the study\nextends the model to include reactive solute transport under a forced flow\nfield and precipitated flow where permeability varies with solute\nconcentration. The existence and uniqueness of weak solutions are analyzed for\nthese cases. Specifically, the study proves the existence and uniqueness of\nweak solutions for precipitated flow without reaction or body force, but the\ntechniques used can be extended to the reactive precipitated and forced flow\ncases.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:06:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kundu","Sahil","","Department of\n  Mathematics, Indian Institute of Technology Ropar, Rupnagar, India"],["Maharana","Surya Narayan","","Department of\n  Mathematics, Indian Institute of Technology Ropar, Rupnagar, India"],["Mishra","Manoranjan","","Department of\n  Mathematics, Indian Institute of Technology Ropar, Rupnagar, India"]]}
{"id":"2308.04844","submitter":"Astrid Vanneste","authors":"Astrid Vanneste, Thomas Somers, Simon Vanneste, Kevin Mets, Tom De\n  Schepper, Siegfried Mercelis, Peter Hellinckx","title":"Scalability of Message Encoding Techniques for Continuous Communication\n  Learned with Multi-Agent Reinforcement Learning","comments":"Paper accepted to the BNAIC/BeNeLearn 2022 conference","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":"  Many multi-agent systems require inter-agent communication to properly\nachieve their goal. By learning the communication protocol alongside the action\nprotocol using multi-agent reinforcement learning techniques, the agents gain\nthe flexibility to determine which information should be shared. However, when\nthe number of agents increases we need to create an encoding of the information\ncontained in these messages. In this paper, we investigate the effect of\nincreasing the amount of information that should be contained in a message and\nincreasing the number of agents. We evaluate these effects on two different\nmessage encoding methods, the mean message encoder and the attention message\nencoder. We perform our experiments on a matrix environment. Surprisingly, our\nresults show that the mean message encoder consistently outperforms the\nattention message encoder. Therefore, we analyse the communication protocol\nused by the agents that use the mean message encoder and can conclude that the\nagents use a combination of an exponential and a logarithmic function in their\ncommunication policy to avoid the loss of important information after applying\nthe mean message encoder.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:08:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Vanneste","Astrid",""],["Somers","Thomas",""],["Vanneste","Simon",""],["Mets","Kevin",""],["De Schepper","Tom",""],["Mercelis","Siegfried",""],["Hellinckx","Peter",""]]}
{"id":"2308.04845","submitter":"Helena Dr\\\"ueke","authors":"Helena Dr\\\"ueke and Dieter Bauer","title":"Interaction-induced directional transport on periodically driven chains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a driven system in which interaction between particles causes their\ndirectional, coupled movement. In that model system, two particles move\nalternatingly in time on two coupled chains. Without interaction, both\nparticles diffuse along their respective chains, independent from one another.\nInteraction between them, no matter if attractive or repellent, leads to an\nenergetic separation of configurations where the particles are close to each\nother and those where they are farther separated. The energy difference causes\nclose-by particles to remain bound together, forming a doublon. Their relative\nposition in the starting configuration determines whether the doublon moves to\nthe left or right or remains stationary due to the periodic driving.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:12:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dr\u00fceke","Helena",""],["Bauer","Dieter",""]]}
{"id":"2308.04846","submitter":"Varun Suriyanarayana","authors":"Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David\n  Shmoys","title":"Improved Approximation Algorithms for the Joint Replenishment Problem\n  with Outliers, and with Fairness Constraints","comments":"43 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The joint replenishment problem (JRP) is a classical inventory management\nproblem. We consider a natural generalization with outliers, where we are\nallowed to reject (that is, not service) a subset of demand points. In this\npaper, we are motivated by issues of fairness - if we do not serve all of the\ndemands, we wish to ``spread out the pain'' in a balanced way among customers,\ncommunities, or any specified market segmentation. One approach is to constrain\nthe rejections allowed, and to have separate bounds for each given customer. In\nour most general setting, we consider a set of C features, where each demand\npoint has an associated rejection cost for each feature, and we have a given\nbound on the allowed rejection cost incurred in total for each feature. This\ngeneralizes a model of fairness introduced in earlier work on the Colorful\nk-Center problem in which (analogously) each demand point has a given color,\nand we bound the number of rejections of each color class.\n  We give the first constant approximation algorithms for the\nfairness-constrained JRP with a constant number of features; specifically, we\ngive a 2.86-approximation algorithm in this case. Even for the special case in\nwhich we bound the total (weighted) number of outliers, this performance\nguarantee improves upon bounds previously known for this case. Our approach is\nan LP-based algorithm that splits the instance into two subinstances. One is\nsolved by a novel iterative rounding approach and the other by pipage-based\nrounding. The standard LP relaxation has an unbounded integrality gap, and\nhence another key element of our algorithm is to strengthen the relaxation by\ncorrectly guessing key attributes of the optimal solution, which are\nsufficiently concise, so that we can enumerate over all possible guesses in\npolynomial time - albeit exponential in C, the number of features.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:15:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Suriyanarayana","Varun",""],["Sivashankar","Varun",""],["Gollapudi","Siddharth",""],["Shmoys","David",""]]}
{"id":"2308.04847","submitter":"Pragyan Dahal","authors":"Pragyan Dahal, Jai Prakash, Stefano Arrigoni, Francesco Braghin","title":"Vehicle State Estimation through Modular Factor Graph-based Fusion of\n  Multiple Sensors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on the critical aspect of robust state estimation for the\nsafe navigation of an Autonomous Vehicle (AV). Existing literature primarily\nemploys two prevalent techniques for state estimation, namely filtering-based\nand graph-based approaches. Factor Graph (FG) is a graph-based approach,\nconstructed using Values and Factors for Maximum Aposteriori (MAP) estimation,\nthat offers a modular architecture that facilitates the integration of inputs\nfrom diverse sensors. However, most FG-based architectures in current use\nrequire explicit knowledge of sensor parameters and are designed for single\nsetups. To address these limitations, this research introduces a novel\nplug-and-play FG-based state estimator capable of operating without predefined\nsensor parameters. This estimator is suitable for deployment in multiple sensor\nsetups, offering convenience and providing comprehensive state estimation at a\nhigh frequency, including mean and covariances. The proposed algorithm\nundergoes rigorous validation using various sensor setups on two different\nvehicles: a quadricycle and a shuttle bus. The algorithm provides accurate and\nrobust state estimation across diverse scenarios, even when faced with degraded\nGlobal Navigation Satellite System (GNSS) measurements or complete outages.\nThese findings highlight the efficacy and reliability of the algorithm in\nreal-world AV applications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:21:34 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dahal","Pragyan",""],["Prakash","Jai",""],["Arrigoni","Stefano",""],["Braghin","Francesco",""]]}
{"id":"2308.04848","submitter":"Matthieu Labousse","authors":"Samuel Hidalgo-Caballero, Alvaro Cassinelli, Emmanuel Fort, Matthieu\n  Labousse","title":"Frugal random exploration strategy for shape recognition using\n  statistical geometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Very distinct strategies can be deployed to recognize and characterize an\nunknown environment or a shape. A recent and promising approach, especially in\nrobotics, is to reduce the complexity of the exploratory units to a minimum.\nHere, we show that this frugal strategy can be taken to the extreme by\nexploiting the power of statistical geometry and introducing new invariant\nfeatures. We show that an elementary robot devoid of any orientation or\nobservation system, exploring randomly, can access global information about an\nenvironment such as the values of the explored area and perimeter. The explored\nshapes are of arbitrary geometry and may even non-connected. From a dictionary,\nthis most simple robot can thus identify various shapes such as famous\nmonuments and even read a text.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:21:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hidalgo-Caballero","Samuel",""],["Cassinelli","Alvaro",""],["Fort","Emmanuel",""],["Labousse","Matthieu",""]]}
{"id":"2308.04849","submitter":"Nishikanta Mohanty","authors":"Nishikanta Mohanty, Bikash K. Behera, and Christopher Ferrie","title":"Solving The Vehicle Routing Problem via Quantum Support Vector Machines","comments":"13 pages, 7 figures, and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Vehicle Routing Problem (VRP) is an example of a combinatorial\noptimization problem that has attracted academic attention due to its potential\nuse in various contexts. VRP aims to arrange vehicle deliveries to several\nsites in the most efficient and economical manner possible. Quantum machine\nlearning offers a new way to obtain solutions by harnessing the natural\nspeedups of quantum effects, although many solutions and methodologies are\nmodified using classical tools to provide excellent approximations of the VRP.\nIn this paper, we implement and test hybrid quantum machine learning methods\nfor solving VRP of 3 and 4-city scenarios, which use 6 and 12 qubit circuits,\nrespectively. The proposed method is based on quantum support vector machines\n(QSVMs) with a variational quantum eigensolver on a fixed or variable ansatz.\nDifferent encoding strategies are used in the experiment to transform the VRP\nformulation into a QSVM and solve it. Multiple optimizers from the IBM Qiskit\nframework are also evaluated and compared.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:24:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mohanty","Nishikanta",""],["Behera","Bikash K.",""],["Ferrie","Christopher",""]]}
{"id":"2308.04850","submitter":"Christopher P. Rock","authors":"Gary Froyland and Christopher P. Rock","title":"Higher Cheeger ratios of features in Laplace-Beltrami eigenfunctions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates links between the eigenvalues and eigenfunctions of\nthe Laplace-Beltrami operator, and the higher Cheeger constants of smooth\nRiemannian manifolds, possibly weighted and/or with boundary. The higher\nCheeger constants give a loose description of the major geometric features of a\nmanifold. We give a constructive upper bound on the higher Cheeger constants,\nin terms of the eigenvalue of any eigenfunction with the corresponding number\nof nodal domains. Specifically, we show that for each such eigenfunction, a\npositive-measure collection of its superlevel sets have their Cheeger ratios\nbounded above in terms of the corresponding eigenvalue.\n  Some manifolds have their major features entwined across several\neigenfunctions, and no single eigenfunction contains all the major features. In\nthis case, there may exist carefully chosen linear combinations of the\neigenfunctions, each with large values on a single feature, and small values\nelsewhere. We can then apply a soft-thresholding operator to these linear\ncombinations to obtain new functions, each supported on a single feature. We\nshow that the Cheeger ratios of the level sets of these functions also give an\nupper bound on the Laplace-Beltrami eigenvalues. We extend these level set\nresults to nonautonomous dynamical systems, and show that the dynamic Laplacian\neigenfunctions reveal sets with small dynamic Cheeger ratios.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:26:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Froyland","Gary",""],["Rock","Christopher P.",""]]}
{"id":"2308.04851","submitter":"Manuela Temmer","authors":"M. Temmer, C. Scolini, I. G. Richardson, S. G. Heinemann, E. Paouris,\n  A. Vourlidas, M. M. Bisi, and writing teams: N. Al-Haddad, T. Amerstorfer, L.\n  Barnard, D. Buresova, S. J. Hofmeister, K. Iwai, B. V. Jackson, R. Jarolim,\n  L. K. Jian, J. A. Linker, N. Lugaz, P. K. Manoharan, M. L. Mays, W. Mishra,\n  M. J. Owens, E. Palmerio, B. Perri, J. Pomoell, R. F. Pinto, E. Samara, T.\n  Singh, D. Sur, C. Verbeke, A. M. Veronig, B. Zhuang","title":"CME Propagation Through the Heliosphere: Status and Future of\n  Observations and Model Development","comments":"Accepted for publication in Advances in Space Research","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ISWAT clusters H1+H2 have a focus on interplanetary space and its\ncharacteristics, especially on the large-scale co-rotating and transient\nstructures impacting Earth. SIRs, generated by the interaction between\nhigh-speed solar wind originating in large-scale open coronal magnetic fields\nand slower solar wind from closed magnetic fields, are regions of compressed\nplasma and magnetic field followed by high-speed streams that recur at the ca.\n27 day solar rotation period. Short-term reconfigurations of the lower coronal\nmagnetic field generate flare emissions and provide the energy to accelerate\nenormous amounts of magnetised plasma and particles in the form of CMEs into\ninterplanetary space. The dynamic interplay between these phenomena changes the\nconfiguration of interplanetary space on various temporal and spatial scales\nwhich in turn influences the propagation of individual structures. While\nconsiderable efforts have been made to model the solar wind, we outline the\nlimitations arising from the rather large uncertainties in parameters inferred\nfrom observations that make reliable predictions of the structures impacting\nEarth difficult. Moreover, the increased complexity of interplanetary space as\nsolar activity rises in cycle 25 is likely to pose a challenge to these models.\nCombining observational and modeling expertise will extend our knowledge of the\nrelationship between these different phenomena and the underlying physical\nprocesses, leading to improved models and scientific understanding and\nmore-reliable space-weather forecasting. The current paper summarizes the\nefforts and progress achieved in recent years, identifies open questions, and\ngives an outlook for the next 5-10 years. It acts as basis for updating the\nexisting COSPAR roadmap by Schrijver+ (2015), as well as providing a useful and\npractical guide for peer-users and the next generation of space weather\nscientists.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:26:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Temmer","M.",""],["Scolini","C.",""],["Richardson","I. G.",""],["Heinemann","S. G.",""],["Paouris","E.",""],["Vourlidas","A.",""],["Bisi","M. M.",""],["teams","writing",""],[":","",""],["Al-Haddad","N.",""],["Amerstorfer","T.",""],["Barnard","L.",""],["Buresova","D.",""],["Hofmeister","S. J.",""],["Iwai","K.",""],["Jackson","B. V.",""],["Jarolim","R.",""],["Jian","L. K.",""],["Linker","J. A.",""],["Lugaz","N.",""],["Manoharan","P. K.",""],["Mays","M. L.",""],["Mishra","W.",""],["Owens","M. J.",""],["Palmerio","E.",""],["Perri","B.",""],["Pomoell","J.",""],["Pinto","R. F.",""],["Samara","E.",""],["Singh","T.",""],["Sur","D.",""],["Verbeke","C.",""],["Veronig","A. M.",""],["Zhuang","B.",""]]}
{"id":"2308.04852","submitter":"Zhaoqing Feng","authors":"Hui-Gan Cheng, Zhao-Qing Feng","title":"Preequilibrium cluster emission and fragmentation reactions in heavy-ion\n  collisions","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A new method is proposed by incorporating the cluster correlation into the\ndynamical evolution of the standard quantum molecular dynamics (QMD) model. We\ndemonstrate for the first time, the potential of the transport model in the\ndescription of light cluster production including the deuteron, triton,\n$^{3}$He and $\\alpha$ in fermi-energy heavy-ion collisions. Both the\nexperimental multiplicities of light clusters and the charge distributions of\nheavier fragments are reasonably reproduced in the broad energy regime. The\npreequilibrium clusters via the multinucleon correlation dominate the yields in\nthe fragmentation reactions, which are influenced by the multinucleon\ncollisions, Mott effect, rescattering and rebounding between the nucleons and\nclusters. The enhancement of $\\alpha$ production at the Fermi energies is\ncaused by the larger binding energy and fermionic properties.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:27:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cheng","Hui-Gan",""],["Feng","Zhao-Qing",""]]}
{"id":"2308.04853","submitter":"Alejandro Mart\\'in-Crespo","authors":"Alejandro Mart\\'in-Crespo, Enrique Baeyens, Sergio Saludes-Rodil,\n  Fernando Frechoso-Escudero","title":"Aggregated demand flexibility prediction of residential thermostatically\n  controlled loads and participation in electricity balance markets","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":"  The aggregate demand flexibility of a set of thermostatically controlled\nresidential loads (TCLs) can be represented by a virtual battery (VB) in order\nto manage their participation in the electricity markets. For this purpose, it\nis necessary to know in advance and with a high level of reliability the\nmaximum power that can be supplied by the aggregation of TCLs. A probability\nfunction of the power that can be supplied by a VB is introduced. This\nprobability function is used to predict the demand flexibility using a new\nexperimental probabilistic method based on a combination of Monte Carlo\nsimulation and extremum search by bisection algorithm (MC\\&ESB). As a result,\nthe maximum flexibility power that a VB can provide with a certain guaranteed\nprobability is obtained. The performance and validity of the proposed method\nare demonstrated in three different case studies where a VB bids its aggregate\npower in the Spanish electricity balancing markets (SEBM).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:32:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mart\u00edn-Crespo","Alejandro",""],["Baeyens","Enrique",""],["Saludes-Rodil","Sergio",""],["Frechoso-Escudero","Fernando",""]]}
{"id":"2308.04854","submitter":"Abhranil Chatterjee","authors":"V. Arvind and Abhranil Chatterjee","title":"On Lifting Lower Bounds for Noncommutative Circuits using Automata","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We revisit the main result of Carmosino et al \\cite{CILM18} which shows that\nan $\\Omega(n^{\\omega/2+\\epsilon})$ size noncommutative arithmetic circuit size\nlower bound (where $\\omega$ is the matrix multiplication exponent) for a\nconstant-degree $n$-variate polynomial family $(g_n)_n$, where each $g_n$ is a\nnoncommutative polynomial, can be ``lifted'' to an exponential size circuit\nsize lower bound for another polynomial family $(f_n)$ obtained from $(g_n)$ by\na lifting process. In this paper, we present a simpler and more conceptual\nautomata-theoretic proof of their result.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:32:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Arvind","V.",""],["Chatterjee","Abhranil",""]]}
{"id":"2308.04855","submitter":"Victor Oknyansky","authors":"V. L. Oknyansky, M. S. Brotherton, S. S. Tsygankov, A. V. Dodin, A. M.\n  Tatarnikov, P. Du, D. -W. Bao, M. A. Burlak, N. P. Ikonnikova, V. M. Lipunov,\n  E. S. Gorbovskoy, V. G. Metlov, A. A. Belinski, N. I. Shatsky, S. G.\n  Zheltouhov, N. A. Maslennikova, J. -M. Wang, S. Zhai, F. -N. Fang, Y. -X. Fu,\n  H. -R. Bai, D. Kasper, N. A. Huseynov, J. N. McLane, J. Maithil, T. E.\n  Zastrocky, K. A. Olson, X. Chen, D. Chelouche, R.S. Oknyansky, D. A. H.\n  Buckley, N. V. Tyurina, A. S. Kuznetsov, R. L. Rebolo, B. -X. Zhao","title":"Long-term multiwavelength monitoring and reverberation mapping of NGC\n  2617 during a changing-look event","comments":"14 pages, 15 figures, accepted by the MNRAS","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 results of photometric and spectroscopic monitoring campaigns\nof the changing look AGN NGC~2617 carried out from 2016 until 2022 and covering\nthe wavelength range from the X-ray to the near-IR. The facilities included the\ntelescopes of the SAI MSU, MASTER Global Robotic Net, the 2.3-m WIRO telescope,\nSwift, and others. We found significant variability at all wavelengths and,\nspecifically, in the intensities and profiles of the broad Balmer lines. We\nmeasured time delays of ~ 6 days (~ 8 days) in the responses of the H-beta\n(H-alpha) line to continuum variations. We found the X-ray variations to\ncorrelate well with the UV and optical (with a small time delay of a few days\nfor longer wavelengths). The K-band lagged the B band by 14 +- 4 days during\nthe last 3 seasons, which is significantly shorter than the delays reported\npreviously by the 2016 and 2017--2019 campaigns. Near-IR variability arises\nfrom two different emission regions: the outer part of the accretion disc and a\nmore distant dust component. The HK-band variability is governed primarily by\ndust. The Balmer decrement of the broad-line components is inversely correlated\nwith the UV flux. The change of the object's type, from Sy1 to Sy1.8, was\nrecorded over a period of ~ 8 years. We interpret these changes as a\ncombination of two factors: changes in the accretion rate and dust recovery\nalong the line of sight.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:34:28 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 12:13:11 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 11:18:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Oknyansky","V. L.",""],["Brotherton","M. S.",""],["Tsygankov","S. S.",""],["Dodin","A. V.",""],["Tatarnikov","A. M.",""],["Du","P.",""],["Bao","D. -W.",""],["Burlak","M. A.",""],["Ikonnikova","N. P.",""],["Lipunov","V. M.",""],["Gorbovskoy","E. S.",""],["Metlov","V. G.",""],["Belinski","A. A.",""],["Shatsky","N. I.",""],["Zheltouhov","S. G.",""],["Maslennikova","N. A.",""],["Wang","J. -M.",""],["Zhai","S.",""],["Fang","F. -N.",""],["Fu","Y. -X.",""],["Bai","H. -R.",""],["Kasper","D.",""],["Huseynov","N. A.",""],["McLane","J. N.",""],["Maithil","J.",""],["Zastrocky","T. E.",""],["Olson","K. A.",""],["Chen","X.",""],["Chelouche","D.",""],["Oknyansky","R. S.",""],["Buckley","D. A. H.",""],["Tyurina","N. V.",""],["Kuznetsov","A. S.",""],["Rebolo","R. L.",""],["Zhao","B. -X.",""]]}
{"id":"2308.04856","submitter":"Andrea Moro","authors":"Andrea Moro","title":"Functional Formalism for Algebraic Classical and Quantum Field Theories","comments":"PhD Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the first part of this thesis we study the generalization of the recent\nalgebraic approach to classical field theory by proposing a more general\nsetting based on the manifold of smooth sections of a non-trivial fiber bundle.\nCentral is the notion of observables/functionals over such sections,\n\\textit{i.e.} appropriate smooth functions on them. The kinematic will be\nfurther specified by means of Peierls brackets, which in turn are defined via\nthe causal propagators of linearized field equations. In the second part we\nimplement deformation quantization of the algebras obtained above in the\nsimpler setting of scalar field theory. Wick powers and time ordered products\nfor quantum field theories in curved spacetimes are defined by giving a set of\naxioms which, when implemented, defines uniquely, up to some classifiable\nambiguities, the aforementioned quantities. Those ambiguities are known to be\ntightly restrained by locality, covariance and other regularity conditions. One\nof the additional constraints used was to require continuous and analytic\ndependence on the metric and coupling parameters. It was recently shown that\nthis rather strong requirement could be weakened, in the case of Wick powers,\nto the so-called parametrized microlocal spectrum condition. We therefore show\nthe existence of Wick powers satisfying the above condition and extend this\naxiom to time ordered products, while reestablishing the usual uniqueness and\nexistence results in light of the new constraint.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:39:26 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Moro","Andrea",""]]}
{"id":"2308.04857","submitter":"Yarik Menchaca Resendiz","authors":"Yarik Menchaca Resendiz and Roman Klinger","title":"Emotion-Conditioned Text Generation through Automatic Prompt\n  Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Conditional natural language generation methods often require either\nexpensive fine-tuning or training a large language model from scratch. Both are\nunlikely to lead to good results without a substantial amount of data and\ncomputational resources. Prompt learning without changing the parameters of a\nlarge language model presents a promising alternative. It is a cost-effective\napproach, while still achieving competitive results. While this procedure is\nnow established for zero- and few-shot text classification and structured\nprediction, it has received limited attention in conditional text generation.\nWe present the first automatic prompt optimization approach for\nemotion-conditioned text generation with instruction-fine-tuned models. Our\nmethod uses an iterative optimization procedure that changes the prompt by\nadding, removing, or replacing tokens. As objective function, we only require a\ntext classifier that measures the realization of the conditional variable in\nthe generated text. We evaluate the method on emotion-conditioned text\ngeneration with a focus on event reports and compare it to manually designed\nprompts that also act as the seed for the optimization procedure. The optimized\nprompts achieve 0.75 macro-average F1 to fulfill the emotion condition in\ncontrast to manually designed seed prompts with only 0.22 macro-average F1.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:42:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Resendiz","Yarik Menchaca",""],["Klinger","Roman",""]]}
{"id":"2308.04858","submitter":"Vinod Bhardwaj Dr.","authors":"Vinod Kumar Bhardwaj, Priyanka Garg","title":"Exploring the Cosmological Model in $f(R,T^\\phi)$ Gravity with\n  Observational Constraints","comments":"18 pages, 12 figures","journal-ref":"New Astronomy, Volume 105, (2024)","doi":"10.1016/j.newast.2023.102101","report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We have investigated an isotropic and homogeneous cosmological model of the\nuniverse in $f(R, T^{\\phi})$ gravity, where $T^{\\phi}$ is the trace of the\nenergy-momentum tensor and $R$ is the Ricci scalar. We developed and presented\nexact solutions of field equations of the proposed model by taking the\nparametrization $q(z) =\\alpha + \\frac{\\beta z}{1+z}$, where $\\alpha$ and\n$\\beta$ are arbitrary constants. The best possible values of the model's free\nparameters are estimated using the latest observational data sets of OHD, BAO,\nand Pantheon by applying the MCMC statistical technique. Some kinematic\nproperties like density parameter $\\rho_{\\phi}$, pressure $p_{\\phi}$, and\nequation of state parameter $\\omega_{\\phi}$ are derived. We have also discussed\nthe behavior of the scalar potential $V(\\phi)$ in the $f(R, T^{\\phi})$ gravity\ntheory. The behaviors of scalar fields for quintessence and phantom models are\nexplored. Furthermore, we have discussed the behavior of energy conditions and\nsound speed in $f(R, T^{\\phi})$ cosmology.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:47:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bhardwaj","Vinod Kumar",""],["Garg","Priyanka",""]]}
{"id":"2308.04859","submitter":"Adri\\'an Llinares","authors":"Alberto Dayan, Adri\\'an Llinares and Karl-Mikael Perfekt","title":"Restrictions of B\\'ekoll\\'e--Bonami weights and Bloch functions","comments":"Some minor changes have been made","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CV math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We characterize the restrictions of B\\'ekoll\\'e--Bonami weights of bounded\nhyperbolic oscillation, to subsets of the unit disc, thus proving an analogue\nof Wolff's restriction theorem for Muckenhoupt weights. Sundberg proved a\ndiscrete version of Wolff's original theorem, by characterizing the trace of\n$BMO$-functions onto interpolating sequences. We consider an analogous question\nin our setting, by studying the trace of Bloch functions. Through Makarov's\nprobabilistic approach to the Bloch space, our question can be recast as a\nrestriction problem for dyadic martingales with uniformly bounded increments.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:47:57 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 08:22:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dayan","Alberto",""],["Llinares","Adri\u00e1n",""],["Perfekt","Karl-Mikael",""]]}
{"id":"2308.04860","submitter":"Christodoulos Santorinaios","authors":"Evangelos Markakis and Christodoulos Santorinaios","title":"Improved EFX Approximation Guarantees under Ordinal-based Assumptions","comments":"13 pages, 4 figures","journal-ref":"In Proceedings of the 22nd International Conference on Autonomous\n  Agents and Multiagent Systems, pp. 591-599. 2023","doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our work studies the fair allocation of indivisible items to a set of agents,\nand falls within the scope of establishing improved approximation guarantees.\nIt is well known by now that the classic solution concepts in fair division,\nsuch as envy-freeness and proportionality, fail to exist in the presence of\nindivisible items. Unfortunately, the lack of existence remains unresolved even\nfor some relaxations of envy-freeness, and most notably for the notion of EFX,\nwhich has attracted significant attention in the relevant literature. This in\nturn has motivated the quest for approximation algorithms, resulting in the\ncurrently best known $(\\phi-1)$-approximation guarantee by Amanatidis et al\n(2020), where $\\phi$ equals the golden ratio. So far, it has been notoriously\nhard to obtain any further advancements beyond this factor. Our main\ncontribution is that we achieve better approximations, for certain special\ncases, where the agents agree on their perception of some items in terms of\ntheir worth. In particular, we first provide an algorithm with a\n$2/3$-approximation, when the agents agree on what are the top $n$ items (but\nnot necessarily on their exact ranking), with $n$ being the number of agents.\nTo do so, we also study a general framework that can be of independent interest\nfor obtaining further guarantees.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:49:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Markakis","Evangelos",""],["Santorinaios","Christodoulos",""]]}
{"id":"2308.04861","submitter":"Cristina Gena","authors":"Federica Bertel, Cristina Gena, Matteo Nazzario, Irene Borgini","title":"Behavioural analysis of interaction between individuals and a robot in\n  the window (cAESAR2023 workshop)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of the current research is to analyse and discover, in a real\ncontext, behaviours, reactions and modes of interaction of social actors\n(people) with the humanoid robot Pepper. Indeed, we wanted to observe in a\nreal, highly frequented context, the reactions and interactions of people with\nPepper, placed in a shop window, through a systematic observation approach. The\nmost interesting aspects of this research will be illustrated, bearing in mind\nthat this is a preliminary analysis, therefore, not yet definitively concluded.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:49:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bertel","Federica",""],["Gena","Cristina",""],["Nazzario","Matteo",""],["Borgini","Irene",""]]}
{"id":"2308.04862","submitter":"Navinder Singh","authors":"Navinder Singh","title":"Review cuprates -- Anderson's unhappy electrons and their fate","comments":"6 pages and 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In cuprates, as doping $p$ is reduced from the overdoped side through the\nquantum critical point $p^*$, a transition in Hall number density of carriers\nis observed, in which this number of carriers reduces from $1+p$ holes per\ncopper site to $p$ holes per copper site. The connection of this $1+p$ to $p$\ntransition with pseudogap and with superconductivity is discussed. A\n\"panoramic\" view or a \"broad-brush\" discussion is presented in which Anderson's\n\"unhappy\" electrons take on a central stage.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:51:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Singh","Navinder",""]]}
{"id":"2308.04863","submitter":"Jamie Dumayne","authors":"J. Dumayne, I. M. Hook, S. C. Williams, G. A. Lowes, D. Head, A.\n  Fritz, O. Graur, B. Holwerda, A. Humphrey, A. Milligan, M. Nicholl, B. F.\n  Roukema, P. Wiseman","title":"Using 4MOST to refine the measurement of galaxy properties: A case study\n  of Supernova hosts","comments":"To be published in RASTI. 18 pages. 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Rubin Observatory's 10-year Legacy Survey of Space and Time will observe\nnear to 20 billion galaxies. For each galaxy the properties can be inferred.\nApproximately $10^5$ galaxies observed per year will contain Type Ia supernovae\n(SNe), allowing SN host-galaxy properties to be calculated on a large scale.\nMeasuring the properties of SN host-galaxies serves two main purposes. The\nfirst is that there are known correlations between host-galaxy type and\nsupernova type, which can be used to aid in the classification of SNe.\nSecondly, Type Ia SNe exhibit correlations between host-galaxy properties and\nthe peak luminosities of the SNe, which has implications for their use as\nstandardisable candles in cosmology. We have used simulations to quantify the\nimprovement in host-galaxy stellar mass ($M_\\ast$) measurements when\nsupplementing photometry from Rubin with spectroscopy from the 4-metre\nMulti-Object Spectroscopic Telescope (4MOST) instrument. We provide results in\nthe form of expected uncertainties in $M_\\ast$ for galaxies with 0.1 < $z$ <\n0.9 and 18 < $r_{AB}$ < 25. We show that for galaxies mag 22 and brighter,\ncombining Rubin and 4MOST data reduces the uncertainty measurements of galaxy\n$M_\\ast$ by more than a factor of 2 compared with Rubin data alone. This\napplies for elliptical and Sc type hosts. We demonstrate that the reduced\nuncertainties in $M_\\ast$ lead to an improvement of 7\\% in the precision of the\n\"mass step\" correction. We expect our improved measurements of host-galaxy\nproperties to aid in the photometric classification of SNe observed by Rubin.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:54:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dumayne","J.",""],["Hook","I. M.",""],["Williams","S. C.",""],["Lowes","G. A.",""],["Head","D.",""],["Fritz","A.",""],["Graur","O.",""],["Holwerda","B.",""],["Humphrey","A.",""],["Milligan","A.",""],["Nicholl","M.",""],["Roukema","B. F.",""],["Wiseman","P.",""]]}
{"id":"2308.04864","submitter":"Geoffroy Kremer","authors":"Geoffroy Kremer, Aymen Mahmoudi, Adel M'Foukh, Meryem Bouaziz, Mehrdad\n  Rahimi, Maria Luisa Della Rocca, Patrick Le F\\`evre, Jean-Francois Dayen,\n  Fran\\c{c}ois Bertran, Sylvia Matzen, Marco Pala, Julien Chaste, Fabrice\n  Oehler, and Abdelkarim Ouerghi","title":"Quantum Confinement and Electronic Structure at the Surface of van der\n  Waals Ferroelectric {\\alpha}-In$_{2}$Se$_{3}$","comments":"20 pages, 12 figures","journal-ref":null,"doi":"10.1021/acsnano.3c04186","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two-dimensional (2D) ferroelectric (FE) materials are promising compounds for\nnext-generation nonvolatile memories, due to their low energy consumption and\nhigh endurance. Among them, {\\alpha}-In$_{2}$Se$_{3}$ has drawn particular\nattention due to its in- and out-of-plane ferroelectricity, whose robustness\nhas been demonstrated down to the monolayer limit. This is a relatively\nuncommon behavior since most bulk FE materials lose their ferroelectric\ncharacter at the 2D limit due to depolarization field. Using angle resolved\nphotoemission spectroscopy (ARPES), we unveil another unusual 2D phenomena\nappearing in 2H \\alpha-In$_{2}$Se$_{3}$ single crystals, the occurrence of a\nhighly metallic two-dimensional electron gas (2DEG) at the surface of\nvacuum-cleaved crystals. This 2DEG exhibits two confined states which\ncorrespond to an electron density of approximatively 10$^{13}$\nelectrons/cm$^{3}$, also confirmed by thermoelectric measurements. Combination\nof ARPES and density functional theory (DFT) calculations reveals a direct band\ngap of energy equal to 1.3 +/- 0.1 eV, with the bottom of the conduction band\nlocalized at the center of the Brillouin zone, just below the Fermi level. Such\nstrong n-type doping further supports the quantum confinement of electrons and\nthe formation of the 2DEG.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:55:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kremer","Geoffroy",""],["Mahmoudi","Aymen",""],["M'Foukh","Adel",""],["Bouaziz","Meryem",""],["Rahimi","Mehrdad",""],["Della Rocca","Maria Luisa",""],["F\u00e8vre","Patrick Le",""],["Dayen","Jean-Francois",""],["Bertran","Fran\u00e7ois",""],["Matzen","Sylvia",""],["Pala","Marco",""],["Chaste","Julien",""],["Oehler","Fabrice",""],["Ouerghi","Abdelkarim",""]]}
{"id":"2308.04865","submitter":"Salvatore Floccari","authors":"Salvatore Floccari and Mauro Varesco","title":"Algebraic cycles on hyper-K\\\"ahler varieties of generalized Kummer type","comments":"10 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove the conjectures of Hodge and Tate for any four-dimensional\nhyper-K\\\"ahler variety of generalized Kummer type. For an arbitrary variety $X$\nof generalized Kummer type, we show that all Hodge classes in the subalgebra of\nthe rational cohomology generated by $H^2(X,\\mathbb{Q})$ are algebraic.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:56:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Floccari","Salvatore",""],["Varesco","Mauro",""]]}
{"id":"2308.04866","submitter":"Dominic Tobias Schickentanz","authors":"Frank Aurzada, Martin Kolb, Dominic T. Schickentanz","title":"Brownian motion conditioned to spend limited time outside a bounded\n  interval -- an extreme example of entropic repulsion","comments":"19 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 a Brownian motion on $\\mathbb{R}_{\\ge 0}$ which is allowed to\nspend a total of $s > 0$ time units outside a bounded interval does not leave\nthe interval at all. This can be seen as an extreme example of entropic\nrepulsion. Moreover, we explicitly determine the exact asymptotic behaviour of\nthe probability that a Brownian motion on $[0,T]$ spends limited time outside a\nbounded interval, as $T \\to \\infty$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:57:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Aurzada","Frank",""],["Kolb","Martin",""],["Schickentanz","Dominic T.",""]]}
{"id":"2308.04867","submitter":"Daniel Tanneberg","authors":"Daniel Tanneberg, Michael Gienger","title":"Learning Type-Generalized Actions for Symbolic Planning","comments":"IEEE/RSJ International Conference on Intelligent Robots and Systems\n  (IROS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Symbolic planning is a powerful technique to solve complex tasks that require\nlong sequences of actions and can equip an intelligent agent with complex\nbehavior. The downside of this approach is the necessity for suitable symbolic\nrepresentations describing the state of the environment as well as the actions\nthat can change it. Traditionally such representations are carefully\nhand-designed by experts for distinct problem domains, which limits their\ntransferability to different problems and environment complexities. In this\npaper, we propose a novel concept to generalize symbolic actions using a given\nentity hierarchy and observed similar behavior. In a simulated grid-based\nkitchen environment, we show that type-generalized actions can be learned from\nfew observations and generalize to novel situations. Incorporating an\nadditional on-the-fly generalization mechanism during planning, unseen task\ncombinations, involving longer sequences, novel entities and unexpected\nenvironment behavior, can be solved.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:01:46 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tanneberg","Daniel",""],["Gienger","Michael",""]]}
{"id":"2308.04868","submitter":"Antonio Canela","authors":"Antonio Canela, Pol Caselles, Ibrar Malik, Eduard Ramon, Jaime\n  Garc\\'ia, Jordi S\\'anchez-Riera, Gil Triginer, Francesc Moreno-Noguer","title":"InstantAvatar: Efficient 3D Head Reconstruction via Surface Rendering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in full-head reconstruction have been obtained by optimizing\na neural field through differentiable surface or volume rendering to represent\na single scene. While these techniques achieve an unprecedented accuracy, they\ntake several minutes, or even hours, due to the expensive optimization process\nrequired. In this work, we introduce InstantAvatar, a method that recovers\nfull-head avatars from few images (down to just one) in a few seconds on\ncommodity hardware. In order to speed up the reconstruction process, we propose\na system that combines, for the first time, a voxel-grid neural field\nrepresentation with a surface renderer. Notably, a naive combination of these\ntwo techniques leads to unstable optimizations that do not converge to valid\nsolutions. In order to overcome this limitation, we present a novel statistical\nmodel that learns a prior distribution over 3D head signed distance functions\nusing a voxel-grid based architecture. The use of this prior model, in\ncombination with other design choices, results into a system that achieves 3D\nhead reconstructions with comparable accuracy as the state-of-the-art with a\n100x speed-up.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:02:00 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 11:27:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Canela","Antonio",""],["Caselles","Pol",""],["Malik","Ibrar",""],["Ramon","Eduard",""],["Garc\u00eda","Jaime",""],["S\u00e1nchez-Riera","Jordi",""],["Triginer","Gil",""],["Moreno-Noguer","Francesc",""]]}
{"id":"2308.04869","submitter":"Jun-Jie Zhang","authors":"Ming-Yan Sun and Peng Xu and Jun-Jie Zhang and Qun Wang and Tai-Jiao\n  Du and Jian-Guo Wang","title":"RBG-Maxwell Framework: Simulation of Collisional Plasma Systems via\n  Coupled Boltzmann-Maxwell equations on GPU","comments":"21 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.comp-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This paper presents the RBG-Maxwell framework, a relativistic collisional\nplasma simulator on GPUs. We provide detailed discussions on the fundamental\nequations, numerical algorithms, implementation specifics, and key testing\noutcomes. The RBG-Maxwell framework is a robust numerical code designed for\nsimulating the evolution of plasma systems through a kinetic approach on\nlarge-scale GPUs. It offers easy adaptability to a wide range of physical\nsystems. Given the appropriate initial distributions, particle masses, charges,\ndifferential cross-sections, and external forces (which are not confined to\nelectromagnetic forces), the RBG-Maxwell framework can direct the evolution of\na particle system from a non-equilibrium state to a thermal state.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:02:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sun","Ming-Yan",""],["Xu","Peng",""],["Zhang","Jun-Jie",""],["Wang","Qun",""],["Du","Tai-Jiao",""],["Wang","Jian-Guo",""]]}
{"id":"2308.04870","submitter":"Rub\\'en Ballester","authors":"Rub\\'en Ballester, Carles Casacuberta, Sergio Escalera","title":"Decorrelating neurons using persistence","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.AT stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel way to improve the generalisation capacity of deep\nlearning models by reducing high correlations between neurons. For this, we\npresent two regularisation terms computed from the weights of a minimum\nspanning tree of the clique whose vertices are the neurons of a given network\n(or a sample of those), where weights on edges are correlation dissimilarities.\nWe provide an extensive set of experiments to validate the effectiveness of our\nterms, showing that they outperform popular ones. Also, we demonstrate that\nnaive minimisation of all correlations between neurons obtains lower accuracies\nthan our regularisation terms, suggesting that redundancies play a significant\nrole in artificial neural networks, as evidenced by some studies in\nneuroscience for real networks. We include a proof of differentiability of our\nregularisers, thus developing the first effective topological persistence-based\nregularisation terms that consider the whole set of neurons and that can be\napplied to a feedforward architecture in any deep learning task such as\nclassification, data generation, or regression.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:09:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ballester","Rub\u00e9n",""],["Casacuberta","Carles",""],["Escalera","Sergio",""]]}
{"id":"2308.04871","submitter":"Dennis M\\\"uller","authors":"Dennis M\\\"uller, Maurice Chiodo","title":"Mathematical Artifacts Have Politics: The Journey from Examples to\n  Embedded Ethics","comments":"23 pages; keywords: artifacts have politics, embedded ethics,\n  mathematics in society, ethics in mathematics, mathematics education","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO cs.CY physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We extend Langdon Winner's idea that artifacts have politics into the realm\nof mathematics. To do so, we first provide a list of examples showing the\nexistence of mathematical artifacts that have politics. In the second step, we\nprovide an argument that shows that all mathematical artifacts have politics.\nWe conclude by showing the implications for embedding ethics into mathematical\ncurricula. We show how acknowledging that mathematical artifacts have politics\ncan help mathematicians design better exercises for their mathematics students.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:09:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["M\u00fcller","Dennis",""],["Chiodo","Maurice",""]]}
{"id":"2308.04872","submitter":"Young-Ching Chou","authors":"Young-Ching Chou, Shen-Ru Zhang, Bo-Wei Chen, Hong-Qi Chen, Cheng-Kuan\n  Lin and Yu-Chee Tseng","title":"Tracking Players in a Badminton Court by Two Cameras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study proposes a simple method for multi-object tracking (MOT) of\nplayers in a badminton court. We leverage two off-the-shelf cameras, one on the\ntop of the court and the other on the side of the court. The one on the top is\nto track players' trajectories, while the one on the side is to analyze the\npixel features of players. By computing the correlations between adjacent\nframes and engaging the information of the two cameras, MOT of badminton\nplayers is obtained. This two-camera approach addresses the challenge of player\nocclusion and overlapping in a badminton court, providing player trajectory\ntracking and multi-angle analysis. The presented system offers insights into\nthe positions and movements of badminton players, thus serving as a coaching or\nself-training tool for badminton players to improve their gaming strategies.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:10:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chou","Young-Ching",""],["Zhang","Shen-Ru",""],["Chen","Bo-Wei",""],["Chen","Hong-Qi",""],["Lin","Cheng-Kuan",""],["Tseng","Yu-Chee",""]]}
{"id":"2308.04873","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Study of flavor dependence of the baryon-to-meson ratio in proton-proton\n  collisions at $\\sqrt{s} = 13$ TeV","comments":"26 pages, 6 captioned figures, 2 tables, authors from page 20,\n  submitted to PRD, figures at http://alice-publications.web.cern.ch/node/9559","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-159","categories":"hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The production cross sections of ${\\rm D^0}$ and $\\Lambda^+_{\\rm c}$ hadrons\noriginating from beauty-hadron decays (i.e. non-prompt) were measured for the\nfirst time at midrapidity ($|y|<0.5$) by the ALICE Collaboration in\nproton-proton collisions at a center-of-mass energy $\\sqrt{s}=13$ TeV. They are\ndescribed within uncertainties by perturbative QCD calculations employing the\nfragmentation fractions of beauty quarks to baryons measured at forward\nrapidity by the LHCb Collaboration. The ${\\rm b\\overline{b}}$ production cross\nsection per unit of rapidity at midrapidity, estimated from these measurements,\nis ${\\rm d}\\sigma_{\\rm b\\overline{b}}/{\\rm d}y|_{|y|<0.5} = 83.1 \\pm 3.5\n(\\mathrm{stat.}) \\pm 5.4(\\mathrm{syst.}) ^{+12.3}_{-3.2}\n(\\mathrm{extrap.})\\,\\mu$b. The baryon-to-meson ratios are computed to\ninvestigate the hadronization mechanism of beauty quarks. The non-prompt\n$\\Lambda^+_{\\rm c}/{\\rm D^0}$ production ratio has a similar trend to the one\nmeasured for the promptly produced charmed particles and to the p$/\\pi^+$ and\n$\\Lambda/{\\rm K^0_S}$ ratios, suggesting a similar baryon-formation mechanism\namong light, strange, charm, and beauty hadrons. The $p_{\\rm T}$-integrated\nnon-prompt $\\Lambda_{\\rm c}/{\\rm D^0}$ ratio is found to be significantly\nhigher than the one measured in e$^+$e$^-$ collisions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:13:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.04874","submitter":"Paolo Lipparini Ric.","authors":"Paolo Lipparini","title":"Multicontact semilattices","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We characterize those join semilattices with a multicontact relation which\ncan be multicontact- and semilattice-embedded into a Boolean algebra with the\nmulticontact given by overlap, equivalently, into a distributive lattice with\nadditive multicontact, still equivalently, into the multicontact semilattice\nassociated to some topological space. A similar characterization is presented\nfor embeddability into Boolean algebras or distributive lattices with a not\nnecessarily overlap nor additive multicontact.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:15:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lipparini","Paolo",""]]}
{"id":"2308.04875","submitter":"Paul Frampton","authors":"Paul H. Frampton","title":"Kerr-Newman and Electromagnetic acceleration","comments":"7 pages LaTeX","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":"  Previous discussions of charged dark matter neglected PBH spin and employed\nthe Reissner-Nordstrom metric. In Nature we expect the PBHs to possess spin\nwhich require use of the technically more challenging Kerr-Newman metric. It is\nshown that the use of K-N metric retains the principal properties already\nobtained using the R-N metric, in particular the dominance of Coulomb repulsion\nrequires super-extremality and the presence of naked singularities. In this\nsense, the spin of the PBHs is not an essential complication.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:53:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Frampton","Paul H.",""]]}
{"id":"2308.04876","submitter":"Hendrik Ranocha","authors":"Hendrik Ranocha and Jochen Sch\\\"utz and Eleni Theodosiou","title":"Functional-preserving predictor-corrector multiderivative schemes","comments":"Submitted to the Proceedings in Applied Mathematics and Mechanic\n  (GAMM Annual Meeting 2023)","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 develop a class of high-order multiderivative time\nintegration methods that is able to preserve certain functionals discretely.\nImportant ingredients are the recently developed\nHermite-Birkhoff-Predictor-Corrector methods and the technique of relaxation\nfor numerical methods of ODEs. We explain the algorithm in detail and show\nnumerical results for two- and three-derivative methods, comparing relaxed and\nunrelaxed methods. The numerical results demonstrate that, at the slight cost\nof the relaxation, an improved scheme is obtained.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:18:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ranocha","Hendrik",""],["Sch\u00fctz","Jochen",""],["Theodosiou","Eleni",""]]}
{"id":"2308.04877","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Charm production and fragmentation fractions at midrapidity in pp\n  collisions at $\\sqrt{s} = 13$ TeV","comments":"46 pages, 13 captioned figures, 7 tables, authors from page 41,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9560","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-162","categories":"hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measurements of the production cross sections of prompt ${\\rm D^0}$, ${\\rm\nD^+}$, ${\\rm D^{\\ast +}}$, ${\\rm D_s^+}$, ${\\rm \\Lambda_{c}^{+}}$, and ${\\rm\n\\Xi_{c}^{+}}$ charm hadrons at midrapidity in proton$-$proton collisions at\n$\\sqrt{s}=13$ TeV with the ALICE detector are presented. The D-meson cross\nsections as a function of transverse momentum ($p_{\\rm T}$) are provided with\nimproved precision and granularity. The ratios of $p_{\\rm T}$-differential\nmeson production cross sections based on this publication and on measurements\nat different rapidity and collision energy provide a constraint on gluon parton\ndistribution functions at low values of Bjorken-$x$ ($10^{-5}-10^{-4}$). The\nmeasurements of ${\\rm \\Lambda_{c}^{+}}$ (${\\rm \\Xi_{c}^{+}}$) baryon production\nextend the measured $p_{\\rm T}$ intervals down to $p_{\\rm T}=0(3)$~GeV$/c$.\nThese measurements are used to determine the charm-quark fragmentation\nfractions and the ${\\rm c\\overline{c}}$ production cross section at midrapidity\n($|y|<0.5$) based on the sum of the cross sections of the weakly-decaying\nground-state charm hadrons ${\\rm D^0}$, ${\\rm D^+}$, ${\\rm D_s^+}$, ${\\rm\n\\Lambda_{c}^{+}}$, ${\\rm \\Xi_{c}^{0}}$ and, for the first time, ${\\rm\n\\Xi_{c}^{+}}$, and of the strongly-decaying J/$psi$ mesons. The first\nmeasurements of ${\\rm \\Xi_{c}^{+}}$ and ${\\rm \\Sigma_{c}^{0,++}}$ fragmentation\nfractions at midrapidity are also reported. A significantly larger fraction of\ncharm quarks hadronising to baryons is found compared to e$^+$e$^-$ and ep\ncollisions. The ${\\rm c\\overline{c}}$ production cross section at midrapidity\nis found to be at the upper bound of state-of-the-art perturbative QCD\ncalculations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:20:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.04878","submitter":"David Hokken","authors":"Lior Bary-Soroker, David Hokken, Gady Kozma","title":"Irreducibility of Littlewood polynomials of special degrees","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $f =\\sum_{i=0}^n \\pm X^i$ be a polynomial sampled uniformly at random\namongst the degree-$n$ polynomials all of whose coefficients lie in $\\{ \\pm\n1\\}$. A folklore conjecture, known to hold under GRH, states that $f$ is\nirreducible with probability tending to $1$ as $n$ goes to infinity. Here, we\nprove unconditionally that $$\\limsup_{n \\to \\infty} \\mathbb{P}(f \\text{ is\nirreducible}) = 1.$$\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:21:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bary-Soroker","Lior",""],["Hokken","David",""],["Kozma","Gady",""]]}
{"id":"2308.04879","submitter":"Samuel Rhys Cox","authors":"Samuel Rhys Cox and Yi-Chieh Lee and Wei Tsang Ooi","title":"Comparing How a Chatbot References User Utterances from Previous\n  Chatting Sessions: An Investigation of Users' Privacy Concerns and\n  Perceptions","comments":"10 pages, 3 figures, to be published in Proceedings of the 11th\n  International Conference on Human-Agent Interaction (ACM HAI'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chatbots are capable of remembering and referencing previous conversations,\nbut does this enhance user engagement or infringe on privacy? To explore this\ntrade-off, we investigated the format of how a chatbot references previous\nconversations with a user and its effects on a user's perceptions and privacy\nconcerns. In a three-week longitudinal between-subjects study, 169 participants\ntalked about their dental flossing habits to a chatbot that either, (1-None):\ndid not explicitly reference previous user utterances, (2-Verbatim): referenced\nprevious utterances verbatim, or (3-Paraphrase): used paraphrases to reference\nprevious utterances. Participants perceived Verbatim and Paraphrase chatbots as\nmore intelligent and engaging. However, the Verbatim chatbot also raised\nprivacy concerns with participants. To gain insights as to why people prefer\ncertain conditions or had privacy concerns, we conducted semi-structured\ninterviews with 15 participants. We discuss implications from our findings that\ncan help designers choose an appropriate format to reference previous user\nutterances and inform in the design of longitudinal dialogue scripting.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:21:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cox","Samuel Rhys",""],["Lee","Yi-Chieh",""],["Ooi","Wei Tsang",""]]}
{"id":"2308.04880","submitter":"Yanping Li","authors":"Xiuwei Zhang, Yanping Li, Zhaoshuai Qi, Yi Sun, Yanning Zhang","title":"Learning multi-domain feature relation for visible and Long-wave\n  Infrared image patch matching","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, learning-based algorithms have achieved promising performance on\ncross-spectral image patch matching, which, however, is still far from\nsatisfactory for practical application. On the one hand, a lack of large-scale\ndataset with diverse scenes haunts its further improvement for learning-based\nalgorithms, whose performances and generalization rely heavily on the dataset\nsize and diversity. On the other hand, more emphasis has been put on feature\nrelation in the spatial domain whereas the scale dependency between features\nhas often been ignored, leading to performance degeneration especially when\nencountering significant appearance variations for cross-spectral patches. To\naddress these issues, we publish, to be best of our knowledge, the largest\nvisible and Long-wave Infrared (LWIR) image patch matching dataset, termed\nVL-CMIM, which contains 1300 pairs of strictly aligned visible and LWIR images\nand over 2 million patch pairs covering diverse scenes such as asteroid, field,\ncountry, build, street and water.In addition, a multi-domain feature relation\nlearning network (MD-FRN) is proposed. Input by the features extracted from a\nfour-branch network, both feature relations in spatial and scale domains are\nlearned via a spatial correlation module (SCM) and multi-scale adaptive\naggregation module (MSAG), respectively. To further aggregate the multi-domain\nrelations, a deep domain interactive mechanism (DIM) is applied, where the\nlearnt spatial-relation and scale-relation features are exchanged and further\ninput into MSCRM and SCM. This mechanism allows our model to learn interactive\ncross-domain feature relations, leading to improved robustness to significant\nappearance changes due to different modality.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:23:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Xiuwei",""],["Li","Yanping",""],["Qi","Zhaoshuai",""],["Sun","Yi",""],["Zhang","Yanning",""]]}
{"id":"2308.04881","submitter":"Galina Weinstein Dr","authors":"Galina Weinstein","title":"Revisiting Nancy Cartwright's Notion of Reliability: Addressing Quantum\n  Devices' Noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper serves as an addendum to my previously published work, which\ndelves into the experimentation with the Google Sycamore quantum processor\nunder the title \"Debating the Reliability and Robustness of the Learned\nHamiltonian in the Traversable Wormhole Experiment.\" In the preceding\npublication, I extensively discussed the quantum system functioning as a dual\nto a traversable wormhole and the ongoing efforts to discover a sparse model\nthat accurately depicts the dynamics of this intriguing phenomenon. In this\npaper, I bring to light an important insight regarding applying Nancy\nCartwright's ideas about reliability and reproducibility, which are deeply\nrooted in classical scientific practices and experiments. I show that when\napplied to the realm of quantum devices, such as Google's Sycamore quantum\nprocessor and other Noisy Intermediate-Scale Quantum (NISQ) devices, these\nwell-established notions demand careful adaptation and consideration. These\nsystems' inherent noise and quantum nature introduce complexities that\nnecessitate rethinking traditional perspectives on reliability and\nreproducibility. In light of these complexities, I propose the term \"noisy\nreliability\" as a means to effectively capture the nuanced nature of assessing\nthe reliability of quantum devices, particularly in the presence of inherent\nquantum noise. This addendum seeks to enrich the discussion by highlighting the\nchallenges and implications of assessing quantum device reliability, thereby\ncontributing to a deeper understanding of quantum experimentation and its\npotential applications in various domains.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:24:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Weinstein","Galina",""]]}
{"id":"2308.04882","submitter":"Sk Samim Islam","authors":"Sandip Das and Sk Samim Islam","title":"Approximation algorithm for finding multipacking on Cactus","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For a graph $G = (V, E)$ with vertex set $V$ and edge set $E$, a function $ f\n: V \\rightarrow \\{0, 1, 2, . . . , diam(G)\\} $ is called a $\\textit{broadcast}$\non $G$. For each vertex $u \\in V$, if there exists a vertex $v$ in $G$\n(possibly, $u = v$) such that $f (v) > 0$ and $d(u, v) \\leq f (v)$, then $f$ is\ncalled a $\\textit{dominating broadcast}$ on $G$. The $\\textit{cost}$ of the\ndominating broadcast $f$ is the quantity $ \\sum_{v\\in V}f(v)$. The minimum cost\nof a dominating broadcast is the \\textit{broadcast domination number} of $G$,\ndenoted by $ \\gamma_{b}(G) $. A $\\textit{multipacking}$ is a set $S \\subseteq\nV$ in a graph $G = (V, E)$ such that for every vertex $v \\in V$ and for every\ninteger $r \\geq 1$, the ball of radius $r$ around $v$ contains at most $r$\nvertices of $S$, that is, there are at most $r$ vertices in $S$ at a distance\nat most $r$ from $v$ in $G$. The $\\textit{multipacking number}$ of $G$ is the\nmaximum cardinality of a multipacking of $ G $ and is denoted by $ mp(G) $. We\nshow that, for any cactus graph $G$, $\\gamma_b(G)\\leq\n\\frac{3}{2}mp(G)+\\frac{11}{2}$. We also show that $\\gamma_b(G)-mp(G)$ can be\narbitrarily large for cactus graphs by constructing an infinite family of\ncactus graphs such that the ratio $\\gamma_b(G)/mp(G)=4/3$, with $mp(G)$\narbitrarily large. This result shows that, for cactus graphs, we cannot improve\nthe bound $\\gamma_b(G)\\leq \\frac{3}{2}mp(G)+\\frac{11}{2}$ to a bound in the\nform $\\gamma_b(G)\\leq c_1\\cdot mp(G)+c_2$, for any constant $c_1<4/3$ and\n$c_2$. Moreover, we provide an $O(n)$-time algorithm to construct a\nmultipacking of $G$ of size at least $\\frac{2}{3}mp(G)-\\frac{11}{3}$, where $n$\nis the number of vertices of the graph $G$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:26:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Das","Sandip",""],["Islam","Sk Samim",""]]}
{"id":"2308.04883","submitter":"Kamil Kwarciak","authors":"Kamil Kwarciak and Marek Wodzinski","title":"Deep Generative Networks for Heterogeneous Augmentation of Cranial\n  Defects","comments":"9 pages, 5 figures, upcoming ICCV2023 LIMIT2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The design of personalized cranial implants is a challenging and tremendous\ntask that has become a hot topic in terms of process automation with the use of\ndeep learning techniques. The main challenge is associated with the high\ndiversity of possible cranial defects. The lack of appropriate data sources\nnegatively influences the data-driven nature of deep learning algorithms.\nHence, one of the possible solutions to overcome this problem is to rely on\nsynthetic data. In this work, we propose three volumetric variations of deep\ngenerative models to augment the dataset by generating synthetic skulls, i.e.\nWasserstein Generative Adversarial Network with Gradient Penalty (WGAN-GP),\nWGAN-GP hybrid with Variational Autoencoder pretraining (VAE/WGAN-GP) and\nIntrospective Variational Autoencoder (IntroVAE). We show that it is possible\nto generate dozens of thousands of defective skulls with compatible defects\nthat achieve a trade-off between defect heterogeneity and the realistic shape\nof the skull. We evaluate obtained synthetic data quantitatively by defect\nsegmentation with the use of V-Net and qualitatively by their latent space\nexploration. We show that the synthetically generated skulls highly improve the\nsegmentation process compared to using only the original unaugmented data. The\ngenerated skulls may improve the automatic design of personalized cranial\nimplants for real medical cases.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:29:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kwarciak","Kamil",""],["Wodzinski","Marek",""]]}
{"id":"2308.04884","submitter":"Cristina Gena","authors":"Linda Pigureddu and Cristina Gena","title":"Using the power of memes: The Pepper Robot as a communicative\n  facilitator for autistic children (cAESAR2023 workshop)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article describes the preliminary qualitative results of a therapeutic\nlaboratory involving the Pepper robot, as a facilitator, to promote autonomy\nand functional acquisition in autistic children with low support needs (level 1\nsupport). The lab, designed and led by a multidisciplinary team, involved 4\nchildren, aged 11 to 13 years, and was organized in weekly meetings for the\nduration of four months. The following is the result of an in-depth qualitative\nevaluation of the interactions that took place between the children and the\nPepper robot, with the aim of analyzing their effectiveness for the purpose of\npromoting the development of social and communication skills in the\nparticipants. The observations and analyses conducted during the interactions\nprovided valuable insights into the dialogue and communication style employed\nand paved the way for possible strategies to make the robot more empathetic and\nengaging for autistic children.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:30:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pigureddu","Linda",""],["Gena","Cristina",""]]}
{"id":"2308.04885","submitter":"Julius Steuer","authors":"Julius Steuer and Badr Abdullah and Johann-Mattis List and Dietrich\n  Klakow","title":"Information-Theoretic Characterization of Vowel Harmony: A\n  Cross-Linguistic Study on Word Lists","comments":"Presented at SIGTYP at EACL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a cross-linguistic study that aims to quantify vowel harmony using\ndata-driven computational modeling. Concretely, we define an\ninformation-theoretic measure of harmonicity based on the predictability of\nvowels in a natural language lexicon, which we estimate using phoneme-level\nlanguage models (PLMs). Prior quantitative studies have relied heavily on\ninflected word-forms in the analysis of vowel harmony. We instead train our\nmodels using cross-linguistically comparable lemma forms with little or no\ninflection, which enables us to cover more under-studied languages. Training\ndata for our PLMs consists of word lists with a maximum of 1000 entries per\nlanguage. Despite the fact that the data we employ are substantially smaller\nthan previously used corpora, our experiments demonstrate the neural PLMs\ncapture vowel harmony patterns in a set of languages that exhibit this\nphenomenon. Our work also demonstrates that word lists are a valuable resource\nfor typological research, and offers new possibilities for future studies on\nlow-resource, under-studied languages.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:32:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Steuer","Julius",""],["Abdullah","Badr",""],["List","Johann-Mattis",""],["Klakow","Dietrich",""]]}
{"id":"2308.04886","submitter":"Sourya Das","authors":"Sourya Dipta Das, Yash Vadi, Abhishek Unnam, Kuldeep Yadav","title":"Unsupervised Out-of-Distribution Dialect Detection with Mahalanobis\n  Distance","comments":"Accepted in Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dialect classification is used in a variety of applications, such as machine\ntranslation and speech recognition, to improve the overall performance of the\nsystem. In a real-world scenario, a deployed dialect classification model can\nencounter anomalous inputs that differ from the training data distribution,\nalso called out-of-distribution (OOD) samples. Those OOD samples can lead to\nunexpected outputs, as dialects of those samples are unseen during model\ntraining. Out-of-distribution detection is a new research area that has\nreceived little attention in the context of dialect classification. Towards\nthis, we proposed a simple yet effective unsupervised Mahalanobis distance\nfeature-based method to detect out-of-distribution samples. We utilize the\nlatent embeddings from all intermediate layers of a wav2vec 2.0\ntransformer-based dialect classifier model for multi-task learning. Our\nproposed approach outperforms other state-of-the-art OOD detection methods\nsignificantly.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:33:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Das","Sourya Dipta",""],["Vadi","Yash",""],["Unnam","Abhishek",""],["Yadav","Kuldeep",""]]}
{"id":"2308.04887","submitter":"Zahra Moti","authors":"Zahra Moti, Asuman Senol, Hamid Bostani, Frederik Zuiderveen\n  Borgesius, Veelasha Moonsamy, Arunesh Mathur, Gunes Acar","title":"Targeted and Troublesome: Tracking and Advertising on Children's\n  Websites","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  On the modern web, trackers and advertisers frequently construct and monetize\nusers' detailed behavioral profiles without consent. Despite various studies on\nweb tracking mechanisms and advertisements, there has been no rigorous study\nfocusing on websites targeted at children. To address this gap, we present a\nmeasurement of tracking and (targeted) advertising on websites directed at\nchildren. Motivated by lacking a comprehensive list of child-directed (i.e.,\ntargeted at children) websites, we first build a multilingual classifier based\non web page titles and descriptions. Applying this classifier to over two\nmillion pages, we compile a list of two thousand child-directed websites.\nCrawling these sites from five vantage points, we measure the prevalence of\ntrackers, fingerprinting scripts, and advertisements. Our crawler detects ads\ndisplayed on child-directed websites and determines if ad targeting is enabled\nby scraping ad disclosure pages whenever available. Our results show that\naround 90% of child-directed websites embed one or more trackers, and about 27%\ncontain targeted advertisements--a practice that should require verifiable\nparental consent. Next, we identify improper ads on child-directed websites by\ndeveloping an ML pipeline that processes both images and text extracted from\nads. The pipeline allows us to run semantic similarity queries for arbitrary\nsearch terms, revealing ads that promote services related to dating, weight\nloss, and mental health; as well as ads for sex toys and flirting chat\nservices. Some of these ads feature repulsive and sexually explicit imagery. In\nsummary, our findings indicate a trend of non-compliance with privacy\nregulations and troubling ad safety practices among many advertisers and\nchild-directed websites. To protect children and create a safer online\nenvironment, regulators and stakeholders must adopt and enforce more stringent\nmeasures.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:37:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Moti","Zahra",""],["Senol","Asuman",""],["Bostani","Hamid",""],["Borgesius","Frederik Zuiderveen",""],["Moonsamy","Veelasha",""],["Mathur","Arunesh",""],["Acar","Gunes",""]]}
{"id":"2308.04888","submitter":"Amine Othmane","authors":"Amine Othmane and Joachim Rudolph","title":"AlgDiff: An open source toolbox for the design, analysis and\n  discretisation of algebraic differentiators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Algebraic differentiators have attracted much interest in recent years. Their\nsimple implementation as classical finite impulse response digital filters and\nsystematic tuning guidelines may help to solve challenging problems, including,\nbut not limited to, nonlinear feedback control, model-free control, and fault\ndiagnosis. This contribution introduces the open source toolbox AlgDiff for the\ndesign, analysis and discretisation of algebraic differentiators.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:39:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Othmane","Amine",""],["Rudolph","Joachim",""]]}
{"id":"2308.04890","submitter":"Jung Ho Ahn","authors":"Sangpyo Kim and Jongmin Kim and Jaeyoung Choi and Jung Ho Ahn","title":"CiFHER: A Chiplet-Based FHE Accelerator with a Resizable Structure","comments":"15 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fully homomorphic encryption (FHE) is in the spotlight as a definitive\nsolution for privacy, but the high computational overhead of FHE poses a\nchallenge to its practical adoption. Although prior studies have attempted to\ndesign ASIC accelerators to mitigate the overhead, their designs require\nexcessive amounts of chip resources (e.g., areas) to contain and process\nmassive data for FHE operations.\n  We propose CiFHER, a chiplet-based FHE accelerator with a resizable\nstructure, to tackle the challenge with a cost-effective multi-chip module\n(MCM) design. First, we devise a flexible architecture of a chiplet core whose\nconfiguration can be adjusted to conform to the global organization of chiplets\nand design constraints. The distinctive feature of our core is a recomposable\nfunctional unit providing varying computational throughput for number-theoretic\ntransform (NTT), the most dominant function in FHE. Then, we establish\ngeneralized data mapping methodologies to minimize the network overhead when\norganizing the chips into the MCM package in a tiled manner, which becomes a\nsignificant bottleneck due to the technology constraints of MCMs. Also, we\nanalyze the effectiveness of various algorithms, including a novel limb\nduplication algorithm, on the MCM architecture. A detailed evaluation shows\nthat a CiFHER package composed of 4 to 64 compact chiplets provides performance\ncomparable to state-of-the-art monolithic ASIC FHE accelerators with\nsignificantly lower package-wide power consumption while reducing the area of a\nsingle core to as small as 4.28mm$^2$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:41:56 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 13:43:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kim","Sangpyo",""],["Kim","Jongmin",""],["Choi","Jaeyoung",""],["Ahn","Jung Ho",""]]}
{"id":"2308.04891","submitter":"Alceste Bonanos","authors":"A. Z. Bonanos, G. Maravelias, M. Yang, F. Tramper, S. de Wit, E.\n  Zapartas, K. Antoniadis, E. Christodoulou, G. Munoz-Sanchez","title":"Introducing the ASSESS project: Episodic Mass Loss in Evolved Massive\n  Stars -- Key to Understanding the Explosive Early Universe","comments":"To appear in the proceedings of IAU Symposium 361: Massive stars near\n  and far; 6 pages, 1 figure","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":"  Episodic mass loss is not understood theoretically, neither accounted for in\nstate-of-the-art models of stellar evolution, which has far-reaching\nconsequences for many areas of astronomy. We introduce the ERC-funded ASSESS\nproject (2018-2024), which aims to determine whether episodic mass loss is a\ndominant process in the evolution of the most massive stars, by conducting the\nfirst extensive, multi-wavelength survey of evolved massive stars in the nearby\nUniverse. It hinges on the fact that mass-losing stars form dust and are bright\nin the mid-infrared. We aim to derive physical parameters of $\\sim$1000 dusty,\nevolved massive stars in $\\sim$25 nearby galaxies and estimate the amount of\nejected mass, which will constrain evolutionary models, and quantify the\nduration and frequency of episodic mass loss as a function of metallicity. The\napproach involves applying machine-learning algorithms to select dusty,\nluminous targets from existing multi-band photometry of nearby galaxies. We\npresent the first results of the project, including the machine-learning\nmethodology for target selection and results from our spectroscopic\nobservations so far. The emerging trend for the ubiquity of episodic mass loss,\nif confirmed, will be key to understanding the explosive early Universe and\nwill have profound consequences for low-metallicity stars, reionization, and\nthe chemical evolution of galaxies.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:42:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bonanos","A. Z.",""],["Maravelias","G.",""],["Yang","M.",""],["Tramper","F.",""],["de Wit","S.",""],["Zapartas","E.",""],["Antoniadis","K.",""],["Christodoulou","E.",""],["Munoz-Sanchez","G.",""]]}
{"id":"2308.04892","submitter":"Pan Mu","authors":"Pan Mu, Jing Fang, Haotian Qian, Cong Bai","title":"Transmission and Color-guided Network for Underwater Image Enhancement","comments":"6 pages; Accepted at IEEE ICME","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, with the continuous development of the marine industry,\nunderwater image enhancement has attracted plenty of attention. Unfortunately,\nthe propagation of light in water will be absorbed by water bodies and\nscattered by suspended particles, resulting in color deviation and low\ncontrast. To solve these two problems, we propose an Adaptive Transmission and\nDynamic Color guided network (named ATDCnet) for underwater image enhancement.\nIn particular, to exploit the knowledge of physics, we design an Adaptive\nTransmission-directed Module (ATM) to better guide the network. To deal with\nthe color deviation problem, we design a Dynamic Color-guided Module (DCM) to\npost-process the enhanced image color. Further, we design an\nEncoder-Decoder-based Compensation (EDC) structure with attention and a\nmulti-stage feature fusion mechanism to perform color restoration and contrast\nenhancement simultaneously. Extensive experiments demonstrate the\nstate-of-the-art performance of the ATDCnet on multiple benchmark datasets.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:43:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mu","Pan",""],["Fang","Jing",""],["Qian","Haotian",""],["Bai","Cong",""]]}
{"id":"2308.04893","submitter":"Fausto Martelli","authors":"Giuseppe Cassone and Fausto Martelli","title":"Electrofreezing of Liquid Water at Ambient Conditions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Water is routinely exposed to external electric fields (EFs). Whether, e.g.,\nat physiological conditions, in contact with biological systems, or at the\ninterface of polar surfaces in countless technological and industrial settings,\nwater responds to EFs on the order of a few V/{\\AA} in a manner that is still\nunder intense investigation. Dating back to the $19^{th}$ century, the\npossibility of solidifying water upon applying an EF instead of adjusting\ntemperature and pressure -- a process known as electrofreezing -- is an\nalluring promise that has canalized major efforts since, with uncertain\noutcomes. In this work, we perform long \\emph{ab initio} molecular dynamics\nsimulations \\textcolor{black}{of water at ambient conditions exposed at EFs of\ndifferent intensities. While the response of single water molecules is almost\ninstantaneous, the cooperativity of the hydrogen bonds induces slower\nreorganizations that can be captured by dividing the trajectories in disjoint\ntime windows and by performing analysis on each of them separately. Upon\nadopting this approach, we find} that EFs of $0.10\\leq$EFs$\\leq0.15$~V/{\\AA}\ninduce electrofreezing \\textcolor{black}{occurring after $\\sim150$~ps. We\nobserve a continuous transition to a disordered state characterized by frozen\ndynamical properties, damped oscillations, lower energy, and enhanced local\nstructural properties. Therefore, we ascribe this state to} a new ferroelectric\namorphous phase, which we term f-GW (ferroelectric glassy water). Our work\nrepresents the first evidence of electrofreezing of liquid water at ambient\nconditions and therefore impacts several fields, from\n\\textcolor{black}{fundamental chemical physics to} biology\n\\textcolor{black}{and} catalysis.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:48:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cassone","Giuseppe",""],["Martelli","Fausto",""]]}
{"id":"2308.04894","submitter":"Ian Morris","authors":"Ian D. Morris","title":"Exceptional projections of self-affine sets with strong irreducibility","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CA math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a sufficient condition for a self-affine set to admit exceptional\northogonal projections in the sense of the projection theorems of Marstrand,\nKaufman and Mattila. Using this condition we construct an affine iterated\nfunction system in four dimensions which satisfies strong irreducibility,\nproximality of all orders and the strong separation condition, but whose\nattractor admits a one-dimensional family of exceptional orthogonal projections\nonto planes. This example complements a recent result of A. Rapaport which\nshows that exceptional projections onto planes cannot exist when a further\nirreducibility hypothesis is also satisfied.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:51:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Morris","Ian D.",""]]}
{"id":"2308.04895","submitter":"Shengqiang Zhou","authors":"Kaiman Lin, Xiaoxiao Sun, Florian Dirnberger, Yi Li, Jiang Qu, Peiting\n  Wen, Zdenek Sofer, Aljoscha S\\\"oll, Stephan Winnerl, Manfred Helm, Shengqiang\n  Zhou, Yaping Dan, Slawomir Prucnal","title":"Strong Exciton-Phonon Coupling as a Fingerprint of Magnetic Ordering in\n  van der Waals Layered CrSBr","comments":"18 pages, submitted to ACS Nano","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The layered, air-stable van der Waals antiferromagnetic compound CrSBr\nexhibits pronounced coupling between its optical, electronic, and magnetic\nproperties. As an example, exciton dynamics can be significantly influenced by\nlattice vibrations through exciton-phonon coupling. Using low-temperature\nphotoluminescence spectroscopy, we demonstrate the effective coupling between\nexcitons and phonons in nanometer-thick CrSBr. By careful analysis, we identify\nthat the satellite peaks predominantly arise from the interaction between the\nexciton and an optical phonon with a frequency of 118 cm-1 (~14.6 meV) due to\nthe out-of-plane vibration of Br atoms. Power-dependent and\ntemperature-dependent photoluminescence measurements support exciton-phonon\ncoupling and indicate a coupling between magnetic and optical properties,\nsuggesting the possibility of carrier localization in the material. The\npresence of strong coupling between the exciton and the lattice may have\nimportant implications for the design of light-matter interactions in magnetic\nsemiconductors and provides new insights into the exciton dynamics in CrSBr.\nThis highlights the potential for exploiting exciton-phonon coupling to control\nthe optical properties of layered antiferromagnetic materials.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:56:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lin","Kaiman",""],["Sun","Xiaoxiao",""],["Dirnberger","Florian",""],["Li","Yi",""],["Qu","Jiang",""],["Wen","Peiting",""],["Sofer","Zdenek",""],["S\u00f6ll","Aljoscha",""],["Winnerl","Stephan",""],["Helm","Manfred",""],["Zhou","Shengqiang",""],["Dan","Yaping",""],["Prucnal","Slawomir",""]]}
{"id":"2308.04896","submitter":"Balaram Panda","authors":"Balaram Panda (The University of Auckland)","title":"Why Data Science Projects Fail","comments":"Proposed Enhanced Approach for Advancing Data Science Excellence","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY cs.DB stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data Science is a modern Data Intelligence practice, which is the core of\nmany businesses and helps businesses build smart strategies around to deal with\nbusinesses challenges more efficiently. Data Science practice also helps in\nautomating business processes using the algorithm, and it has several other\nbenefits, which also deliver in a non-profitable framework. In regards to data\nscience, three key components primarily influence the effective outcome of a\ndata science project. Those are 1.Availability of Data 2.Algorithm 3.Processing\npower or infrastructure\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:45:15 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Panda","Balaram","","The University of Auckland"]]}
{"id":"2308.04897","submitter":"Kristina Frizyuk","authors":"Sergei Gladyshev, Olesia Pashina, Alexey Proskurin, Anna Nikolaeva,\n  Zarina Sadrieva, Andrey Bogdanov, Mihail Petrov, Kristina Frizyuk","title":"Fast simulation of light scattering and harmonic generation in axially\n  symmetric structures in COMSOL","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the field of optics and nanophotonics, simulation of electromagnetic\nscattering plays a major role in the study of complex nanostructures and\noptical devices. The numerical analysis of scattering spectra, even for\nnanocavities with simple geometry, is associated with significant computational\ndifficulties. However, when the system exhibits certain symmetries, it becomes\npossible to simplify the problem through the process of separation of\nvariables, which leads to a decrease in its dimension. In this paper, we aim to\nprovide a practical guide to a fast simulation of linear and non-linear\nscattering problems in COMSOL Multiphysics for axisymmetric objects including\ncomputation of scattering cross-section as well as its multipolar\ndecomposition, optical forces, and second harmonic generation. We also\naccompany the provided guide with the ready-to-run COMSOL models.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:57:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gladyshev","Sergei",""],["Pashina","Olesia",""],["Proskurin","Alexey",""],["Nikolaeva","Anna",""],["Sadrieva","Zarina",""],["Bogdanov","Andrey",""],["Petrov","Mihail",""],["Frizyuk","Kristina",""]]}
{"id":"2308.04898","submitter":"Tanmay Singla","authors":"Tanmay Singla, Dharun Anandayuvaraj, Kelechi G. Kalu, Taylor R.\n  Schorlemmer, James C. Davis","title":"An Empirical Study on Using Large Language Models to Analyze Software\n  Supply Chain Security Failures","comments":"22 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As we increasingly depend on software systems, the consequences of breaches\nin the software supply chain become more severe. High-profile cyber attacks\nlike those on SolarWinds and ShadowHammer have resulted in significant\nfinancial and data losses, underlining the need for stronger cybersecurity. One\nway to prevent future breaches is by studying past failures. However,\ntraditional methods of analyzing these failures require manually reading and\nsummarizing reports about them. Automated support could reduce costs and allow\nanalysis of more failures. Natural Language Processing (NLP) techniques such as\nLarge Language Models (LLMs) could be leveraged to assist the analysis of\nfailures. In this study, we assessed the ability of Large Language Models\n(LLMs) to analyze historical software supply chain breaches. We used LLMs to\nreplicate the manual analysis of 69 software supply chain security failures\nperformed by members of the Cloud Native Computing Foundation (CNCF). We\ndeveloped prompts for LLMs to categorize these by four dimensions: type of\ncompromise, intent, nature, and impact. GPT 3.5s categorizations had an average\naccuracy of 68% and Bard had an accuracy of 58% over these dimensions. We\nreport that LLMs effectively characterize software supply chain failures when\nthe source articles are detailed enough for consensus among manual analysts,\nbut cannot yet replace human analysts. Future work can improve LLM performance\nin this context, and study a broader range of articles and failures.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:35:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Singla","Tanmay",""],["Anandayuvaraj","Dharun",""],["Kalu","Kelechi G.",""],["Schorlemmer","Taylor R.",""],["Davis","James C.",""]]}
{"id":"2308.04899","submitter":"Pan Mu","authors":"Zheyuan Liu, Pan Mu, Hanning Xu, Cong Bai","title":"Histogram-guided Video Colorization Structure with Spatial-Temporal\n  Connection","comments":"6 pages; Accepted at IEEE ICME","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Video colorization, aiming at obtaining colorful and plausible results from\ngrayish frames, has aroused a lot of interest recently. Nevertheless, how to\nmaintain temporal consistency while keeping the quality of colorized results\nremains challenging. To tackle the above problems, we present a\nHistogram-guided Video Colorization with Spatial-Temporal connection structure\n(named ST-HVC). To fully exploit the chroma and motion information, the joint\nflow and histogram module is tailored to integrate the histogram and flow\nfeatures. To manage the blurred and artifact, we design a combination scheme\nattending to temporal detail and flow feature combination. We further recombine\nthe histogram, flow and sharpness features via a U-shape network. Extensive\ncomparisons are conducted with several state-of-the-art image and video-based\nmethods, demonstrating that the developed method achieves excellent performance\nboth quantitatively and qualitatively in two video datasets.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:59:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Zheyuan",""],["Mu","Pan",""],["Xu","Hanning",""],["Bai","Cong",""]]}
{"id":"2308.04900","submitter":"Mahsa Lezgi","authors":"Mohammad Ali-Akbari and Mahsa Lezgi","title":"Two Concepts of Holographic Complexity under Thermal and Electromagnetic\n  Quenches","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the evolution of holographic subregion complexity (HSC) in a\nthermally and magnetically quenched strongly coupled quantum field theory in\n2+1 dimension. We illustrate two concepts of complexity in this theory, (1):\nhow much information it takes to specify a state by studying the behavior of\nthe final value of HSC in terms of the final temperature and magnetic field and\n(2): how long it takes to reach the state, by considering the time it takes for\nHSC to relax as a function of the final temperature and magnetic field. In the\nfirst concept, we observe that the effect of temperature and magnetic field on\nHSC is decreasing until the energy of the probe is comparable to the final\ntemperature and magnetic field. We present an argue based on an ensemble of\nmicrostates corresponding to a given mixed macrostate. In the second concept,\nwe show that the time of relaxation of HSC decreases with the increase of\ntemperature and magnetic field for fixed value of the energy of the probe. We\nalso compare the time evolution of HSC for two quenches, in the first concept.\nWe observe that the absolute value of the ratio of the final value of HSC for\ntwo kinds of quenches depends on the energy of the probe.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:01:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ali-Akbari","Mohammad",""],["Lezgi","Mahsa",""]]}
{"id":"2308.04901","submitter":"Alexander Hvatov","authors":"Alexander Hvatov and Roman Titov","title":"Towards true discovery of the differential equations","comments":"Knowledge and Logical Reasoning in the Era of Data-driven Learning\n  workshop at ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Differential equation discovery, a machine learning subfield, is used to\ndevelop interpretable models, particularly in nature-related applications. By\nexpertly incorporating the general parametric form of the equation of motion\nand appropriate differential terms, algorithms can autonomously uncover\nequations from data. This paper explores the prerequisites and tools for\nindependent equation discovery without expert input, eliminating the need for\nequation form assumptions. We focus on addressing the challenge of assessing\nthe adequacy of discovered equations when the correct equation is unknown, with\nthe aim of providing insights for reliable equation discovery without prior\nknowledge of the equation form.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:03:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hvatov","Alexander",""],["Titov","Roman",""]]}
{"id":"2308.04902","submitter":"Adriano Tiribocchi","authors":"A. Tiribocchi, M. Durve, M. Lauricella, A. Montessori, S. Succi","title":"Spontaneous motion of a passive fluid droplet in an active microchannel","comments":"Accepted on Soft Matter","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We numerically study the dynamics of a passive fluid droplet confined within\na microchannel whose walls are covered with a thin layer of active gel. The\nlatter represents a fluid of extensile material modelling, for example, a\nsuspension of cytoskeletal filaments and molecular motors. Our results show\nthat the layer is capable of producing a spontaneous flow triggering a\nrectilinear motion of the passive droplet. For a hybrid design (a single wall\ncovered by the active layer), at the steady state the droplet attains an\nelliptical shape, resulting from an asymmetric saw-toothed structure of the\nvelocity field. On the contrary, if the active gel covers both walls, the\nvelocity field exhibits a fully symmetric pattern considerably mitigating\nmorphological deformations. We further show that the structure of the\nspontaneous flow in the microchannel can be controlled by the anchoring\nconditions of the active gel at the wall. These findings are also confirmed by\nselected 3D simulations. Our results may stimulate further research addressed\nto design novel microfludic devices whose functioning relies on the collective\nproperties of active gels.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:04:03 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tiribocchi","A.",""],["Durve","M.",""],["Lauricella","M.",""],["Montessori","A.",""],["Succi","S.",""]]}
{"id":"2308.04903","submitter":"Kelly Payette","authors":"Kelly Payette, Alena Uus, Jordina Aviles Verdera, Carla Avena\n  Zampieri, Megan Hall, Lisa Story, Maria Deprez, Mary A. Rutherford, Joseph V.\n  Hajnal, Sebastien Ourselin, Raphael Tomi-Tricot, Jana Hutter","title":"An automated pipeline for quantitative T2* fetal body MRI and\n  segmentation at low field","comments":"Accepted by MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fetal Magnetic Resonance Imaging at low field strengths is emerging as an\nexciting direction in perinatal health. Clinical low field (0.55T) scanners are\nbeneficial for fetal imaging due to their reduced susceptibility-induced\nartefacts, increased T2* values, and wider bore (widening access for the\nincreasingly obese pregnant population). However, the lack of standard\nautomated image processing tools such as segmentation and reconstruction\nhampers wider clinical use. In this study, we introduce a semi-automatic\npipeline using quantitative MRI for the fetal body at low field strength\nresulting in fast and detailed quantitative T2* relaxometry analysis of all\nmajor fetal body organs. Multi-echo dynamic sequences of the fetal body were\nacquired and reconstructed into a single high-resolution volume using\ndeformable slice-to-volume reconstruction, generating both structural and\nquantitative T2* 3D volumes. A neural network trained using a semi-supervised\napproach was created to automatically segment these fetal body 3D volumes into\nten different organs (resulting in dice values > 0.74 for 8 out of 10 organs).\nThe T2* values revealed a strong relationship with GA in the lungs, liver, and\nkidney parenchyma (R^2>0.5). This pipeline was used successfully for a wide\nrange of GAs (17-40 weeks), and is robust to motion artefacts. Low field fetal\nMRI can be used to perform advanced MRI analysis, and is a viable option for\nclinical scanning.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:04:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Payette","Kelly",""],["Uus","Alena",""],["Verdera","Jordina Aviles",""],["Zampieri","Carla Avena",""],["Hall","Megan",""],["Story","Lisa",""],["Deprez","Maria",""],["Rutherford","Mary A.",""],["Hajnal","Joseph V.",""],["Ourselin","Sebastien",""],["Tomi-Tricot","Raphael",""],["Hutter","Jana",""]]}
{"id":"2308.04904","submitter":"Tengchuan Kou","authors":"Tengchuan Kou, Xiaohong Liu, Wei Sun, Jun Jia, Xiongkuo Min, Guangtao\n  Zhai, Ning Liu","title":"StableVQA: A Deep No-Reference Quality Assessment Model for Video\n  Stability","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":"  Video shakiness is an unpleasant distortion of User Generated Content (UGC)\nvideos, which is usually caused by the unstable hold of cameras. In recent\nyears, many video stabilization algorithms have been proposed, yet no specific\nand accurate metric enables comprehensively evaluating the stability of videos.\nIndeed, most existing quality assessment models evaluate video quality as a\nwhole without specifically taking the subjective experience of video stability\ninto consideration. Therefore, these models cannot measure the video stability\nexplicitly and precisely when severe shakes are present. In addition, there is\nno large-scale video database in public that includes various degrees of shaky\nvideos with the corresponding subjective scores available, which hinders the\ndevelopment of Video Quality Assessment for Stability (VQA-S). To this end, we\nbuild a new database named StableDB that contains 1,952 diversely-shaky UGC\nvideos, where each video has a Mean Opinion Score (MOS) on the degree of video\nstability rated by 34 subjects. Moreover, we elaborately design a novel VQA-S\nmodel named StableVQA, which consists of three feature extractors to acquire\nthe optical flow, semantic, and blur features respectively, and a regression\nlayer to predict the final stability score. Extensive experiments demonstrate\nthat the StableVQA achieves a higher correlation with subjective opinions than\nthe existing VQA-S models and generic VQA models. The database and codes are\navailable at https://github.com/QMME/StableVQA.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:04:36 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 03:52:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kou","Tengchuan",""],["Liu","Xiaohong",""],["Sun","Wei",""],["Jia","Jun",""],["Min","Xiongkuo",""],["Zhai","Guangtao",""],["Liu","Ning",""]]}
{"id":"2308.04905","submitter":"Guillermo Bern\\'ardez","authors":"Guillermo Bern\\'ardez, Jos\\'e Su\\'arez-Varela, Xiang Shi, Shihan Xiao,\n  Xiangle Cheng, Pere Barlet-Ros, Albert Cabellos-Aparicio","title":"GraphCC: A Practical Graph Learning-based Approach to Congestion Control\n  in Datacenters","comments":"11 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI cs.LG cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Congestion Control (CC) plays a fundamental role in optimizing traffic in\nData Center Networks (DCN). Currently, DCNs mainly implement two main CC\nprotocols: DCTCP and DCQCN. Both protocols -- and their main variants -- are\nbased on Explicit Congestion Notification (ECN), where intermediate switches\nmark packets when they detect congestion. The ECN configuration is thus a\ncrucial aspect on the performance of CC protocols. Nowadays, network experts\nset static ECN parameters carefully selected to optimize the average network\nperformance. However, today's high-speed DCNs experience quick and abrupt\nchanges that severely change the network state (e.g., dynamic traffic\nworkloads, incast events, failures). This leads to under-utilization and\nsub-optimal performance. This paper presents GraphCC, a novel Machine\nLearning-based framework for in-network CC optimization. Our distributed\nsolution relies on a novel combination of Multi-agent Reinforcement Learning\n(MARL) and Graph Neural Networks (GNN), and it is compatible with widely\ndeployed ECN-based CC protocols. GraphCC deploys distributed agents on switches\nthat communicate with their neighbors to cooperate and optimize the global ECN\nconfiguration. In our evaluation, we test the performance of GraphCC under a\nwide variety of scenarios, focusing on the capability of this solution to adapt\nto new scenarios unseen during training (e.g., new traffic workloads, failures,\nupgrades). We compare GraphCC with a state-of-the-art MARL-based solution for\nECN tuning -- ACC -- and observe that our proposed solution outperforms the\nstate-of-the-art baseline in all of the evaluation scenarios, showing\nimprovements up to $20\\%$ in Flow Completion Time as well as significant\nreductions in buffer occupancy ($38.0-85.7\\%$).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:04:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bern\u00e1rdez","Guillermo",""],["Su\u00e1rez-Varela","Jos\u00e9",""],["Shi","Xiang",""],["Xiao","Shihan",""],["Cheng","Xiangle",""],["Barlet-Ros","Pere",""],["Cabellos-Aparicio","Albert",""]]}
{"id":"2308.04906","submitter":"Enrique Zuazua","authors":"E. Zuazua","title":"Fourier series and sidewise profile control of 1-d waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We discuss the sidewise control properties of 1-d waves. In analogy with\nclassical control and inverse problems for wave propagation, the problem\nconsists on controlling the behaviour of waves on part of the boundary of the\ndomain where they propagate, by means of control actions localised on a\ndifferent subset of the boundary. In contrast with classical problems, the goal\nis not to control the dynamics of the waves on the interior of the domain, but\nrather their boundary traces. It is therefore a goal oriented controllability\nproblem. We propose a duality method that reduces the problem to suitable new\nobservability inequalities, which consist of estimating the boundary traces of\nwaves on part of the boundary from boundary measurements done on another subset\nof the boundary. These inequalities lead to novel questions that do not seem to\nbe treatable by the classical techniques employed in the field, such as\nCarleman inequalities, non-harmonic Fourier series, microlocal analysis and\nmultipliers. We propose a genuinely 1-d solution method, based on sidewise\nenergy propagation estimates yielding a complete sharp solution. The obtained\nobservability results can be reinterpreted in terms of Fourier series. This\nleads to new non-standard questions in the context of non-harmonic Fourier\nseries.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:04:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zuazua","E.",""]]}
{"id":"2308.04907","submitter":"Micha{\\l} Lesiuk","authors":"Mariusz Puchalski, Micha{\\l} Lesiuk, Bogumi{\\l} Jeziorski","title":"Relativistic treatment of diamagnetic susceptibility of helium","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report theoretical calculations of the diamagnetic susceptibility,\n$\\chi_0$, of helium atom. We determined the complete relativistic correction to\n$\\chi_0$ of the order of $\\alpha^4$, where $\\alpha$ is the fine structure\nconstant, by including all $\\alpha^4$ terms originating from the Dirac and\nBreit equations for a helium atom in a static magnetic field. Finite nuclear\nmass corrections to $\\chi_0$ was also evaluated. To obtain very accurate\nresults and reliable uncertainty estimates we used a sequence of explicitly\ncorrelated basis sets of fully optimized Slater geminals. We found that\n$\\chi_0=-2.119\\,106(34)\\cdot10^{-5}$ $a_0^3$ and\n$\\chi_0=-2.119\\,400(34)\\cdot10^{-5}$ $a_0^3$ for $^4$He and $^3$He isotopes,\nrespectively, where $a_0$ is the Bohr radius and the uncertainties shown in the\nparentheses are due entirely to the very conservative estimate of the neglected\nQED corrections of the order of $\\alpha^5$. Our results are compared with the\navailable experimental data and with previous, incomplete theoretical\ndeterminations of the $\\alpha^4$ contributions to the diamagnetic\nsusceptibility of helium.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:08:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Puchalski","Mariusz",""],["Lesiuk","Micha\u0142",""],["Jeziorski","Bogumi\u0142",""]]}
{"id":"2308.04908","submitter":"Santtu S\\\"oderholm","authors":"Santtu S\\\"oderholm, Joonas Lahtinen, Carsten H. Wolters, Sampsa\n  Pursiainen","title":"The Effects of Peeling on Finite Element Method -based EEG Source\n  Reconstruction","comments":"13 pages, submitted to Biomedical Signal Processing and Control. v2:\n  Correct affiliation information for Carsten H. Wolters to be more specific","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":"  The problem of reconstructing brain activity from electric potential\nmeasurements performed on the surface of a human head is not an easy task: not\njust because the solution of the related inverse problem is fundamentally\nill-posed (not unique), but because the methods utilized in constructing a\nsynthetic forward solution themselves contain many inaccuracies. One of these\nis the fact that the usual method of modelling primary currents in the human\nhead via dipoles brings about at least 2 modelling errors: one from the\nsingularity introduced by the dipole, and one from placing such dipoles near\nconductivity discontinuities in the active brain layer boundaries.\n  In this article we observe how the removal of possible source locations from\nthe surfaces of active brain layers affects the localisation accuracy of two\ninverse methods, sLORETA and Dipole Scan, at different signal-to-noise ratios\n(SNR), when the H(div) source model is used. We also describe the finite\nelement forward solver used to construct the synthetic EEG data, that was fed\nto the inverse methods as input, in addition to the meshes that were used as\nthe domains of the forward and inverse solvers. Our results suggest that there\nis a slight general improvement in the localisation results, especially at\nlower noise levels. The applied inverse algorithm and brain compartment under\nobservation also affect the accuracy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:12:24 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 12:03:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["S\u00f6derholm","Santtu",""],["Lahtinen","Joonas",""],["Wolters","Carsten H.",""],["Pursiainen","Sampsa",""]]}
{"id":"2308.04909","submitter":"Luke Borchjes Mr","authors":"Luke Borchjes, Clement Nyirenda, Louise Leenen","title":"Adversarial Deep Reinforcement Learning for Cyber Security in Software\n  Defined Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper focuses on the impact of leveraging autonomous offensive\napproaches in Deep Reinforcement Learning (DRL) to train more robust agents by\nexploring the impact of applying adversarial learning to DRL for autonomous\nsecurity in Software Defined Networks (SDN). Two algorithms, Double Deep\nQ-Networks (DDQN) and Neural Episodic Control to Deep Q-Network (NEC2DQN or\nN2D), are compared. NEC2DQN was proposed in 2018 and is a new member of the\ndeep q-network (DQN) family of algorithms. The attacker has full observability\nof the environment and access to a causative attack that uses state\nmanipulation in an attempt to poison the learning process. The implementation\nof the attack is done under a white-box setting, in which the attacker has\naccess to the defender's model and experiences. Two games are played; in the\nfirst game, DDQN is a defender and N2D is an attacker, and in second game, the\nroles are reversed. The games are played twice; first, without an active\ncausative attack and secondly, with an active causative attack. For execution,\nthree sets of game results are recorded in which a single set consists of 10\ngame runs. The before and after results are then compared in order to see if\nthere was actually an improvement or degradation. The results show that with\nminute parameter changes made to the algorithms, there was growth in the\nattacker's role, since it is able to win games. Implementation of the\nadversarial learning by the introduction of the causative attack showed the\nalgorithms are still able to defend the network according to their strengths.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:16:10 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 20:20:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Borchjes","Luke",""],["Nyirenda","Clement",""],["Leenen","Louise",""]]}
{"id":"2308.04910","submitter":"Erich Gr\\\"adel","authors":"Sophie Brinke, Erich Gr\\\"adel, Lovro Mrkonji\\'c","title":"Ehrenfeucht-Fra\\\"iss\\'e Games in Semiring Semantics","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.DB math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ehrenfeucht-Fra\\\"iss\\'e games provide a fundamental method for proving\nelementary equivalence (and equivalence up to a certain quantifier rank) of\nrelational structures. We investigate the soundness and completeness of this\nmethod in the more general context of semiring semantics. Motivated originally\nby provenance analysis of database queries, semiring semantics evaluates\nlogical statements not just by true or false, but by values in some commutative\nsemiring; this can provide much more detailed information, for instance\nconcerning the combinations of atomic facts that imply the truth of a\nstatement, or practical information about evaluation costs, confidence scores,\naccess levels or the number of successful evaluation strategies. There is a\nwide variety of different semirings that are relevant for provenance analysis,\nand the applicability of classical logical methods in semiring semantics may\nstrongly depend on the algebraic properties of the underlying semiring.\n  While Ehrenfeucht-Fra\\\"iss\\'e games are sound and complete for logical\nequivalences in classical semantics, and thus on the Boolean semiring, this is\nin general not the case for other semirings. We provide a detailed analysis of\nthe soundness and completeness of model comparison games on specific semirings,\nnot just for classical Ehrenfeucht-Fra\\\"iss\\'e games but also for other\nvariants based on bijections or counting.\n  Finally we propose a new kind of games, called homomorphism games, which are\nbased on the fact that there exist certain rather simple semiring\ninterpretations that are locally very different and can be separated even in a\none-move game, but which can be proved to be elementarily equivalent via\nseparating sets of homomorphisms into the Boolean semiring. We prove that these\nhomomorphism games provide a sound and complete method for logical equivalences\non finite and infinite lattice semirings.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:18:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Brinke","Sophie",""],["Gr\u00e4del","Erich",""],["Mrkonji\u0107","Lovro",""]]}
{"id":"2308.04911","submitter":"Fan Bai","authors":"Fan Bai, Ke Yan, Xiaoyu Bai, Xinyu Mao, Xiaoli Yin, Jingren Zhou, Yu\n  Shi, Le Lu, Max Q.-H. Meng","title":"SLPT: Selective Labeling Meets Prompt Tuning on Label-Limited Lesion\n  Segmentation","comments":"accepted by 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":"  Medical image analysis using deep learning is often challenged by limited\nlabeled data and high annotation costs. Fine-tuning the entire network in\nlabel-limited scenarios can lead to overfitting and suboptimal performance.\nRecently, prompt tuning has emerged as a more promising technique that\nintroduces a few additional tunable parameters as prompts to a task-agnostic\npre-trained model, and updates only these parameters using supervision from\nlimited labeled data while keeping the pre-trained model unchanged. However,\nprevious work has overlooked the importance of selective labeling in downstream\ntasks, which aims to select the most valuable downstream samples for annotation\nto achieve the best performance with minimum annotation cost. To address this,\nwe propose a framework that combines selective labeling with prompt tuning\n(SLPT) to boost performance in limited labels. Specifically, we introduce a\nfeature-aware prompt updater to guide prompt tuning and a TandEm Selective\nLAbeling (TESLA) strategy. TESLA includes unsupervised diversity selection and\nsupervised selection using prompt-based uncertainty. In addition, we propose a\ndiversified visual prompt tuning strategy to provide multi-prompt-based\ndiscrepant predictions for TESLA. We evaluate our method on liver tumor\nsegmentation and achieve state-of-the-art performance, outperforming\ntraditional fine-tuning with only 6% of tunable parameters, also achieving 94%\nof full-data performance by labeling only 5% of the data.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:22:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bai","Fan",""],["Yan","Ke",""],["Bai","Xiaoyu",""],["Mao","Xinyu",""],["Yin","Xiaoli",""],["Zhou","Jingren",""],["Shi","Yu",""],["Lu","Le",""],["Meng","Max Q. -H.",""]]}
{"id":"2308.04912","submitter":"Wenjie Yang","authors":"Wenjie Yang, Yiyi Chen, Yan Li, Yanhua Cheng, Xudong Liu, Quan Chen,\n  Han Li","title":"Cross-view Semantic Alignment for Livestreaming Product Recognition","comments":"Accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Live commerce is the act of selling products online through live streaming.\nThe customer's diverse demands for online products introduce more challenges to\nLivestreaming Product Recognition. Previous works have primarily focused on\nfashion clothing data or utilize single-modal input, which does not reflect the\nreal-world scenario where multimodal data from various categories are present.\nIn this paper, we present LPR4M, a large-scale multimodal dataset that covers\n34 categories, comprises 3 modalities (image, video, and text), and is 50x\nlarger than the largest publicly available dataset. LPR4M contains diverse\nvideos and noise modality pairs while exhibiting a long-tailed distribution,\nresembling real-world problems. Moreover, a cRoss-vIew semantiC alignmEnt\n(RICE) model is proposed to learn discriminative instance features from the\nimage and video views of the products. This is achieved through instance-level\ncontrastive learning and cross-view patch-level feature propagation. A novel\nPatch Feature Reconstruction loss is proposed to penalize the semantic\nmisalignment between cross-view patches. Extensive experiments demonstrate the\neffectiveness of RICE and provide insights into the importance of dataset\ndiversity and expressivity. The dataset and code are available at\nhttps://github.com/adxcreative/RICE\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:23:41 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 02:00:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Wenjie",""],["Chen","Yiyi",""],["Li","Yan",""],["Cheng","Yanhua",""],["Liu","Xudong",""],["Chen","Quan",""],["Li","Han",""]]}
{"id":"2308.04913","submitter":"Kaize Shi","authors":"Kaize Shi, Xueyao Sun, Dingxian Wang, Yinlin Fu, Guandong Xu, Qing Li","title":"LLaMA-E: Empowering E-commerce Authoring with Multi-Aspect Instruction\n  Following","comments":null,"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":"  E-commerce authoring involves creating attractive, abundant, and targeted\npromotional content to drive product sales. The emergence of large language\nmodels (LLMs) introduces an innovative paradigm, offering a unified solution to\naddress various authoring tasks within this scenario. However, mainstream LLMs\ntrained on general corpora with common sense knowledge reveal limitations in\nfitting complex and personalized features unique to e-commerce products and\ncustomers. Furthermore, LLMs like GPT-3.5 necessitate remote accessibility,\nraising concerns about safeguarding voluminous customer privacy data during\ntransmission. This paper proposes the LLaMA-E, the unified and customized\ninstruction-following language models focusing on diverse e-commerce authoring\ntasks. Specifically, the domain experts create the seed instruction set from\nthe tasks of ads generation, query-enhanced product title rewriting, product\nclassification, purchase intent speculation, and general Q&A. These tasks\nenable the models to comprehensively understand precise e-commerce authoring\nknowledge by interleaving features covering typical service aspects of\ncustomers, sellers, and platforms. The GPT-3.5 is introduced as a teacher\nmodel, which expands the seed instructions to form a training set for the\nLLaMA-E models with various scales. The experimental results show that the\nproposed LLaMA-E models achieve state-of-the-art results in quantitative and\nqualitative evaluations, also exhibiting the advantage in zero-shot scenes. To\nthe best of our knowledge, this study is the first to serve the LLMs to\nspecific e-commerce authoring scenarios.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:26:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shi","Kaize",""],["Sun","Xueyao",""],["Wang","Dingxian",""],["Fu","Yinlin",""],["Xu","Guandong",""],["Li","Qing",""]]}
{"id":"2308.04914","submitter":"Jiawen Kang","authors":"Xumin Huang, Yuan Wu, Jiawen Kang, Jiangtian Nie, Weifeng Zhong, Dong\n  In Kim, and Shengli Xie","title":"Service Reservation and Pricing for Green Metaverses: A Stackelberg Game\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Metaverse enables users to communicate, collaborate and socialize with each\nother through their digital avatars. Due to the spatio-temporal\ncharacteristics, co-located users are served well by performing their software\ncomponents in a collaborative manner such that a Metaverse service provider\n(MSP) eliminates redundant data transmission and processing, ultimately\nreducing the total energy consumption. The energyefficient service provision is\ncrucial for enabling the green and sustainable Metaverse. In this article, we\ntake an augmented reality (AR) application as an example to achieve this goal.\nMoreover, we study an economic issue on how the users reserve offloading\nservices from the MSP and how the MSP determines an optimal charging price\nsince each user is rational to decide whether to accept the offloading service\nby taking into account the monetary cost. A single-leader multi-follower\nStackelberg game is formulated between the MSP and users while each user\noptimizes an offloading probability to minimize the weighted sum of time,\nenergy consumption and monetary cost. Numerical results show that our scheme\nachieves energy savings and satisfies individual rationality simultaneously\ncompared with the conventional schemes. Finally, we identify and discuss open\ndirections on how several emerging technologies are combined with the\nsustainable green Metaverse.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:27:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Huang","Xumin",""],["Wu","Yuan",""],["Kang","Jiawen",""],["Nie","Jiangtian",""],["Zhong","Weifeng",""],["Kim","Dong In",""],["Xie","Shengli",""]]}
{"id":"2308.04915","submitter":"Sergey Krivovichev","authors":"Sergey V. Krivovichev","title":"The crystal structure of Pb$_{10}$(PO$_4$)$_6$O revisited: the evidence\n  of superstructure","comments":"12 pages, 6 figures","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":"  The crystal structure of Pb$_{10}$(PO$_4$)$_6$O, the proposed matrix for the\npotential room-temperature superconductor LK-99, Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O\n($x = 0.9-1.0$), has been reinvestigated by single-crystal X-ray diffraction\nusing crystals prepared by Merker and Wondratschek (Z. Anorg. Allg. Chem. 1960,\n306, 25-29). The crystal structure is trigonal, P-3, a = 9.8109(6), c =\n14.8403(12) A, V = 1237.06(15) A3, R1 = 0.0413 using 3456 unique observed\nreflections. The crystal structure of Pb$_{10}$(PO$_4$)$_6$O is a\nsuperstructure with regard to the standard P63/m apatite structure type. The\ndoubling of the c parameter is induced by the ordering of additional O atoms\nwithin the structure channels running parallel to the c axis and centered at\n(00z). The O atoms form short bonds to the Pb1 atoms, resulting in splitting\nthe Pb1 site into two, Pb1A and Pb1B. The structural distortions are further\ntransmitted to the Pb phosphate framework formed by four Pb2 sites and PO$_4$\ngroups. The structure data previously reported by Krivovichev and Burns (Z.\nKristallogr. 2003, 218, 357-365) may either correspond to the\nPb$_{10}$(PO$_4$)$_6$O$_x$(OH)$_{2-x}$ ($x = 0.4$) member of the\nPb$_{10}$(PO$_4$)$_6$O-Pb$_{10}$(PO$_4$)$_6$(OH)$_2$ solid solution series, or\nto the high-temperature polymorph of Pb$_{10}$(PO$_4$)$_6$O (with the phase\nwith doubled c parameter being the low-temperature polymorph).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:27:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Krivovichev","Sergey V.",""]]}
{"id":"2308.04916","submitter":"Sergios Agapiou","authors":"Sergios Agapiou and Isma\\\"el Castillo","title":"Heavy-tailed Bayesian nonparametric adaptation","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":"  We propose a new Bayesian strategy for adaptation to smoothness in\nnonparametric models based on heavy tailed series priors. We illustrate it in a\nvariety of settings, showing in particular that the corresponding Bayesian\nposterior distributions achieve adaptive rates of contraction in the minimax\nsense (up to logarithmic factors) without the need to sample hyperparameters.\nUnlike many existing procedures, where a form of direct model (or estimator)\nselection is performed, the method can be seen as performing a soft selection\nthrough the prior tail. In Gaussian regression, such heavy tailed priors are\nshown to lead to (near-)optimal simultaneous adaptation both in the $L^2$- and\n$L^\\infty$-sense. Results are also derived for linear inverse problems, for\nanisotropic Besov classes, and for certain losses in more general models\nthrough the use of tempered posterior distributions. We present numerical\nsimulations corroborating the theory.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:30:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Agapiou","Sergios",""],["Castillo","Isma\u00ebl",""]]}
{"id":"2308.04917","submitter":"Longfei Li","authors":"Longfei Li, Zihao Sun, Mingcheng Yang","title":"Surface Tension Between Coexisting Phases of Active Brownian Particles","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The confliction between the stable interface in phase-separated active\nBrownian particles and its negative surface tension, obtained mechanically via\nthe active pressure, has sparked considerable debate about the formula of\nactive surface tension. Based on the intrinsic pressure of active system, we\nhere derive a proper mechanical expression of active surface tension by\ncalculating the work required to create a differential interface area, while\nremaining interfacial profile invariant (not considered previously). Our\nexpression yields a significantly positive surface tension that increases with\nthe particle actvity, which is supported by mechanical analysis on the\ninterface. Our results thus fundamentally resolve the contradiction related to\nactive surface tension.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:33:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Longfei",""],["Sun","Zihao",""],["Yang","Mingcheng",""]]}
{"id":"2308.04918","submitter":"Meng Zhao","authors":"Vahagn Nersesyan, Meng Zhao","title":"Exponential mixing for the white-forced complex Ginzburg--Landau\n  equation in the whole space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last two decades, there has been a significant progress in the\nunderstanding of ergodic properties of white-forced dissipative PDEs. The\nprevious studies mostly focus on equations posed on bounded domains since they\nrely on different compactness properties and the discreteness of the spectrum\nof the Laplacian. In the present paper, we consider the damped complex\nGinzburg--Landau equation on the real line driven by a white-in-time noise.\nUnder the assumption that the noise is sufficiently non-degenerate, we\nestablish the uniqueness of stationary measure and exponential mixing in the\ndual-Lipschitz metric. The proof is based on coupling techniques combined with\na generalization of Foia\\c{s}--Prodi estimate to the case of the real line and\nspecial space-time weighted estimates which help to handle the behavior of\nsolutions at infinity.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:35:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nersesyan","Vahagn",""],["Zhao","Meng",""]]}
{"id":"2308.04919","submitter":"Michael Hartz","authors":"Kenneth R. Davidson, Michael Hartz","title":"On boundary representations","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $S$ be an operator system sitting in its C*-envelope\n$C^*_{\\mathrm{min}}(S)$. Starting with a pure state on $S$, let $F$ be the face\nof state extensions to $C^*_{\\mathrm{min}}(S)$. The dilation theorem of\nDavidson-Kennedy shows that the GNS representations corresponding to some of\nthe extreme states of $F$ are boundary representations. We construct an\nexplicit example in which $F$ is an interval and only one of the two extreme\npoints yields a boundary representation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:36:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Davidson","Kenneth R.",""],["Hartz","Michael",""]]}
{"id":"2308.04920","submitter":"Kwangmin Oh","authors":"Kwangmin Oh, C. Y. Hui, Jongsuk Hong, J. Takata, A. K. H. Kong,\n  Pak-Hin Thomas Tam, Kwan-Lok Li, and K. S. Cheng","title":"Influences of dynamical disruptions on the evolution of pulsars in\n  globular clusters","comments":"9 pages, 8 figures, 3 tables, Accepted in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2383","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By comparing the physical properties of pulsars hosted by core-collapsed\n(CCed) and non-core-collapsed (Non-CCed) globular clusters (GCs), we find that\npulsars in CCed GCs rotate significantly slower than their counterparts in\nNon-CCed GCs. Additionally, radio luminosities at 1.4 GHz in CCed GCs are\nhigher. These findings are consistent with the scenario that dynamical\ninteractions in GCs can interrupt angular momentum transfer processes and\nsurface magnetic field decay during the recycling phase. Our results suggest\nthat such effects in CCed GCs are stronger due to more frequent disruptions of\ncompact binaries. This is further supported by the observation that both\nestimated disruption rates and the fraction of isolated pulsars are\npredominantly higher in CCed GCs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:38:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Oh","Kwangmin",""],["Hui","C. Y.",""],["Hong","Jongsuk",""],["Takata","J.",""],["Kong","A. K. H.",""],["Tam","Pak-Hin Thomas",""],["Li","Kwan-Lok",""],["Cheng","K. S.",""]]}
{"id":"2308.04921","submitter":"Johannes Maly","authors":"Hung-Hsu Chou, Johannes Maly, and Dominik St\\\"oger","title":"How to induce regularization in generalized linear models: A guide to\n  reparametrizing gradient flow","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":"  In this work, we analyze the relation between reparametrizations of gradient\nflow and the induced implicit bias on general linear models, which encompass\nvarious basic classification and regression tasks. In particular, we aim at\nunderstanding the influence of the model parameters - reparametrization, loss,\nand link function - on the convergence behavior of gradient flow. Our results\nprovide user-friendly conditions under which the implicit bias can be\nwell-described and convergence of the flow is guaranteed. We furthermore show\nhow to use these insights for designing reparametrization functions that lead\nto specific implicit biases like $\\ell_p$- or trigonometric regularizers.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:39:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chou","Hung-Hsu",""],["Maly","Johannes",""],["St\u00f6ger","Dominik",""]]}
{"id":"2308.04922","submitter":"Zhengyuan Zhang","authors":"Zhengyuan Zhang, Haoran Jin, Zesheng Zheng, Wenwen Zhang, Wenhao Lu,\n  Feng Qin, Arunima Sharma, Manojit Pramanik, Yuanjin Zheng","title":"HSD-PAM: High Speed Super Resolution Deep Penetration Photoacoustic\n  Microscopy Imaging Boosted by Dual Branch Fusion Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.med-ph physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Photoacoustic microscopy (PAM) is a novel implementation of photoacoustic\nimaging (PAI) for visualizing the 3D bio-structure, which is realized by raster\nscanning of the tissue. However, as three involved critical imaging parameters,\nimaging speed, lateral resolution, and penetration depth have mutual effect to\none the other. The improvement of one parameter results in the degradation of\nother two parameters, which constrains the overall performance of the PAM\nsystem. Here, we propose to break these limitations by hardware and software\nco-design. Starting with low lateral resolution, low sampling rate AR-PAM\nimaging which possesses the deep penetration capability, we aim to enhance the\nlateral resolution and up sampling the images, so that high speed, super\nresolution, and deep penetration for the PAM system (HSD-PAM) can be achieved.\nData-driven based algorithm is a promising approach to solve this issue,\nthereby a dedicated novel dual branch fusion network is proposed, which\nincludes a high resolution branch and a high speed branch. Since the\navailability of switchable AR-OR-PAM imaging system, the corresponding low\nresolution, undersample AR-PAM and high resolution, full sampled OR-PAM image\npairs are utilized for training the network. Extensive simulation and in vivo\nexperiments have been conducted to validate the trained model, enhancement\nresults have proved the proposed algorithm achieved the best perceptual and\nquantitative image quality. As a result, the imaging speed is increased 16\ntimes and the imaging lateral resolution is improved 5 times, while the deep\npenetration merit of AR-PAM modality is still reserved.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:39:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Zhengyuan",""],["Jin","Haoran",""],["Zheng","Zesheng",""],["Zhang","Wenwen",""],["Lu","Wenhao",""],["Qin","Feng",""],["Sharma","Arunima",""],["Pramanik","Manojit",""],["Zheng","Yuanjin",""]]}
{"id":"2308.04923","submitter":"Nils Hampe","authors":"Nils Hampe, Sanne G. M. van Velzen, Jean-Paul Aben, Carlos Collet,\n  Ivana I\\v{s}gum","title":"Deep Learning-Based Prediction of Fractional Flow Reserve along the\n  Coronary Artery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG physics.med-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Functionally significant coronary artery disease (CAD) is caused by plaque\nbuildup in the coronary arteries, potentially leading to narrowing of the\narterial lumen, i.e. coronary stenosis, that significantly obstructs blood flow\nto the myocardium. The current reference for establishing the presence of a\nfunctionally significant stenosis is invasive fractional flow reserve (FFR)\nmeasurement. To avoid invasive measurements, non-invasive prediction of FFR\nfrom coronary CT angiography (CCTA) has emerged. For this, machine learning\napproaches, characterized by fast inference, are increasingly developed.\nHowever, these methods predict a single FFR value per artery i.e. they don't\nprovide information about the stenosis location or treatment strategy. We\npropose a deep learning-based method to predict the FFR along the artery from\nCCTA scans. This study includes CCTA images of 110 patients who underwent\ninvasive FFR pullback measurement in 112 arteries. First, a multi planar\nreconstruction (MPR) of the artery is fed to a variational autoencoder to\ncharacterize the artery, i.e. through the lumen area and unsupervised artery\nencodings. Thereafter, a convolutional neural network (CNN) predicts the FFR\nalong the artery. The CNN is supervised by multiple loss functions, notably a\nloss function inspired by the Earth Mover's Distance (EMD) to predict the\ncorrect location of FFR drops and a histogram-based loss to explicitly\nsupervise the slope of the FFR curve. To train and evaluate our model,\neight-fold cross-validation was performed. The resulting FFR curves show good\nagreement with the reference allowing the distinction between diffuse and focal\nCAD distributions in most cases. Quantitative evaluation yielded a mean\nabsolute difference in the area under the FFR pullback curve (AUPC) of 1.7. The\nmethod may pave the way towards fast, accurate, automatic prediction of FFR\nalong the artery from CCTA.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:45:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hampe","Nils",""],["van Velzen","Sanne G. M.",""],["Aben","Jean-Paul",""],["Collet","Carlos",""],["I\u0161gum","Ivana",""]]}
{"id":"2308.04924","submitter":"Xinkai Bian","authors":"Xinkai Bian, Chaowei Jiang, Xueshang Feng, Pingbing Zuo, Yi Wang","title":"A fundamental mechanism of solar eruption initiation in multipolar\n  magnetic field","comments":"21 pages, 12 figures, 4 animations","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recently we established a fundamental mechanism of solar eruption initiation,\nin which an eruption can be initiated from a bipolar field through magnetic\nreconnection in the current sheet (CS) that is formed slowly in the core field\nas driven by photospheric shearing motion. Here using a series of fully 3D MHD\nsimulations with a range of different photospheric magnetic flux distributions,\nwe extended this fundamental mechanism to the quadrupolar magnetic field\ncontaining a null point above the core field, which is the basic configuration\nof the classical breakout model. As is commonly believed, in such multipolar\nconfiguration, the reconnection triggered in the CS originated at the null\npoint (namely, the breakout reconnection) plays the key role in eruption\ninitiation by establishing a positive feedback-loop between the breakout\nreconnection and the expansion of the core field. However, our simulation\nshowed that the key of eruption initiation in such multipolar configuration\nremains to be the slow formation of the CS in the sheared core rather than the\nonset of fast breakout reconnection. The breakout reconnection only helps the\nformation of the core CS by letting the core field expand faster, but the\neruption cannot occur when the bottom surface driving is stopped well before\nthe core CS is formed, even though the fast reconnection has already been\ntriggered in the breakout CS. This study clarified the role of breakout\nreconnection and confirmed formation of the core CS as the key to the eruption\ninitiation in a multipolar magnetic field.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:46:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bian","Xinkai",""],["Jiang","Chaowei",""],["Feng","Xueshang",""],["Zuo","Pingbing",""],["Wang","Yi",""]]}
{"id":"2308.04925","submitter":"Soham Sen","authors":"Soham Sen, Arnab Mukherjee, and Sunandan Gangopadhyay","title":"Entanglement degradation as a tool to detect signatures of quantum\n  gravity","comments":"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":"  We investigate entanglement degradation in the vicinity of a quantum\ncorrected black hole. We consider a biprtite system (Alice-Rob) with Alice\nfreely falling (radially) into the event horizon of a quantum corrected black\nhole and Rob being in the vicinity of the event horizon of the black hole. We\nconsider a maximally entangled state (in the Fock basis) and start with the\nbasic assumption that Rob is an uniformly accelerated observer. We then give a\npedagogical analysis of the relation involving the Minkowski vaccum state and\nRindler number states. Following the analogy given in\nhttps://link.aps.org/doi/10.1103/PhysRevD.82.064006 {Phys. Rev. D 82 (2010)\n064006}, we establish the relation between the Hartle-Hawking vacuum state and\nBoulware and Anti-Bouware number states from the Minkowski-Rindler relation. We\nthen write down the quantum corrected black hole metric by making use of the\nnear horizon approximation in an appropriate form. Next, we obtain the\nanalytical forms of logarithmic negativity and mutual information and plot as a\nfunction of Rob's distance from the $r=0$ point. We observe that the\nentanglement degradation slows down due to the incorporation of quantum gravity\ncorrections in the Schwarzschild black hole. This observation may lead to\nidentification of quantum gravity signatures in future generation of advanced\nobservational scenarios. We can also interpret this effect as a noisy quantum\nchannel with an operator sum representation of a completely positive and trace\npreserving (CPTP) map. We then finally obtain the entanglement fidelity using\nthis operator sum representation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:48:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sen","Soham",""],["Mukherjee","Arnab",""],["Gangopadhyay","Sunandan",""]]}
{"id":"2308.04926","submitter":"Oph\\'elia Miralles","authors":"Oph\\'elia Miralles and Anthony C. Davison and Timo Schmid","title":"Bayesian modeling of insurance claims for hail damage","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite its importance for insurance, there is almost no literature on\nstatistical hail damage modeling. Statistical models for hailstorms exist,\nthough they are generally not open-source, but no study appears to have\ndeveloped a stochastic hail impact function. In this paper, we use hail-related\ninsurance claim data to build a Gaussian line process with extreme marks to\nmodel both the geographical footprint of a hailstorm and the damage to\nbuildings that hailstones can cause. We build a model for the claim counts and\nclaim values, and compare it to the use of a benchmark deterministic hail\nimpact function. Our model proves to be better than the benchmark at capturing\nhail spatial patterns and allows for localized and extreme damage, which is\nseen in the insurance data. The evaluation of both the claim counts and value\npredictions shows that performance is improved compared to the benchmark,\nespecially for extreme damage. Our model appears to be the first to provide\nrealistic estimates for hail damage to individual buildings.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:49:49 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Miralles","Oph\u00e9lia",""],["Davison","Anthony C.",""],["Schmid","Timo",""]]}
{"id":"2308.04927","submitter":"Gabjin Yun Mr","authors":"Seungsu Hwang and Gabjin Yun","title":"Vacuum static spaces and Conformal vector fields","comments":"13","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we show that if a compact $n$-dimensional vacuum static space\n$(M^n, g, f)$ admits a non-trivial closed conformal vector field $V$, then $(M,\ng)$ is isometric to a standard sphere ${\\Bbb S}^n(c)$. We also prove that if a\npair $(g, f)$ of a Riemannian metric and a function defined on a compact\n$n$-dimensional manifold $M^n$ satisfies the critical point equation and $(M,\ng)$ admits a non-trivial closed conformal vector field $V$, we have the same\nresult. Finally, we prove a criterion for a nontrivial conformal vector field\nto be closed.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:51:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hwang","Seungsu",""],["Yun","Gabjin",""]]}
{"id":"2308.04928","submitter":"Qi Yang","authors":"Qi Yang, Joel Jung, Xiaozhong Xu, and Shan Liu","title":"GeodesicPSIM: Predicting the Quality of Static Mesh with Texture Map via\n  Geodesic Patch Similarity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Static meshes with texture maps have attracted considerable attention in both\nindustrial manufacturing and academic research, leading to an urgent\nrequirement for effective and robust objective quality evaluation. However,\ncurrent model-based static mesh quality metrics have obvious limitations: most\nof them only consider geometry information, while color information is ignored,\nand they have strict constraints for the meshes' geometrical topology. Other\nmetrics, such as image-based and point-based metrics, are easily influenced by\nthe prepossessing algorithms, e.g., projection and sampling, hampering their\nability to perform at their best. In this paper, we propose Geodesic Patch\nSimilarity (GeodesicPSIM), a novel model-based metric to accurately predict\nhuman perception quality for static meshes. After selecting a group keypoints,\n1-hop geodesic patches are constructed based on both the reference and\ndistorted meshes cleaned by an effective mesh cleaning algorithm. A two-step\npatch cropping algorithm and a patch texture mapping module refine the size of\n1-hop geodesic patches and build the relationship between the mesh geometry and\ncolor information, resulting in the generation of 1-hop textured geodesic\npatches. Three types of features are extracted to quantify the distortion:\npatch color smoothness, patch discrete mean curvature, and patch pixel color\naverage and variance. To the best of our knowledge, GeodesicPSIM is the first\nmodel-based metric especially designed for static meshes with texture maps.\nGeodesicPSIM provides state-of-the-art performance in comparison with\nimage-based, point-based, and video-based metrics on a newly created and\nchallenging database. We also prove the robustness of GeodesicPSIM by\nintroducing different settings of hyperparameters. Ablation studies also\nexhibit the effectiveness of three proposed features and the patch cropping\nalgorithm.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:54:27 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 02:11:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Qi",""],["Jung","Joel",""],["Xu","Xiaozhong",""],["Liu","Shan",""]]}
{"id":"2308.04929","submitter":"Federico Quin","authors":"Federico Quin and Danny Weyns and Matthias Galster and Camila Costa\n  Silva","title":"A/B Testing: A Systematic Literature Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In A/B testing two variants of a piece of software are compared in the field\nfrom an end user's point of view, enabling data-driven decision making. While\nwidely used in practice, no comprehensive study has been conducted on the\nstate-of-the-art in A/B testing. This paper reports the results of a systematic\nliterature review that analyzed 141 primary studies. The results shows that the\nmain targets of A/B testing are algorithms and visual elements. Single classic\nA/B tests are the dominating type of tests. Stakeholders have three main roles\nin the design of A/B tests: concept designer, experiment architect, and setup\ntechnician. The primary types of data collected during the execution of A/B\ntests are product/system data and user-centric data. The dominating use of the\ntest results are feature selection, feature rollout, and continued feature\ndevelopment. Stakeholders have two main roles during A/B test execution:\nexperiment coordinator and experiment assessor. The main reported open problems\nare enhancement of proposed approaches and their usability. Interesting lines\nfor future research include: strengthen the adoption of statistical methods in\nA/B testing, improving the process of A/B testing, and enhancing the automation\nof A/B testing.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:55:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Quin","Federico",""],["Weyns","Danny",""],["Galster","Matthias",""],["Silva","Camila Costa",""]]}
{"id":"2308.04930","submitter":"Siyuan Li","authors":"Siyuan Li, Lei Cheng, Ting Zhang, Hangfang Zhao and Jianlong Li","title":"Striking The Right Balance: Three-Dimensional Ocean Sound Speed Field\n  Reconstruction Using Tensor Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately reconstructing a three-dimensional ocean sound speed field (3D\nSSF) is essential for various ocean acoustic applications, but the sparsity and\nuncertainty of sound speed samples across a vast ocean region make it a\nchallenging task. To tackle this challenge, a large body of reconstruction\nmethods has been developed, including spline interpolation, matrix/tensor-based\ncompletion, and deep neural networks-based reconstruction. However, a\nprincipled analysis of their effectiveness in 3D SSF reconstruction is still\nlacking. This paper performs a thorough analysis of the reconstruction error\nand highlights the need for a balanced representation model that integrates\nboth expressiveness and conciseness. To meet this requirement, a 3D\nSSF-tailored tensor deep neural network is proposed, which utilizes tensor\ncomputations and deep neural network architectures to achieve remarkable 3D SSF\nreconstruction. The proposed model not only includes the previous tensor-based\nSSF representation model as a special case, but also has a natural ability to\nreject noise. The numerical results using the South China Sea 3D SSF data\ndemonstrate that the proposed method outperforms state-of-the-art methods. The\ncode is available at https://github.com/OceanSTARLab/Tensor-Neural-Network.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:58:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Siyuan",""],["Cheng","Lei",""],["Zhang","Ting",""],["Zhao","Hangfang",""],["Li","Jianlong",""]]}
{"id":"2308.04931","submitter":"Xuelei Chen","authors":"Kaifeng Yu, Fengquan Wu, Shifan Zuo, Jixia Li, Shijie Sun, Yougang\n  Wang, Xuelei Chen","title":"A simulation of calibration and map-making errors of the Tianlai\n  cylinder pathfinder array","comments":"25 pages, 18 figures, RAA accepted","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":"  The Tianlai cylinder array is a pathfinder for developing and testing 21cm\nintensity mapping techniques. In this paper, we use numerical simulation to\nassess how its measurement is affected by thermal noise and the errors in\ncalibration and map-making process, and the error in the sky map reconstructed\nfrom a drift scan survey. Here we consider only the single frequency,\nunpolarized case. The beam is modelled by fitting to the electromagnetic\nsimulation of the antenna, and the variations of the complex gains of the array\nelements are modelled by Gaussian processes. Mock visibility data is generated\nand run through our data processing pipeline. We find that the accuracy of the\ncurrent calibration is limited primarily by the absolute calibration, where the\nerror comes mainly from the approximation of a single dominating point source.\nWe then studied the $m$-mode map-making with the help of Moore-Penrose inverse.\nWe find that discarding modes with singular values smaller than a threshold\ncould generate visible artifacts in the map. The impacts of the residue\nvariation of the complex gain and thermal noise are also investigated. The\nthermal noise in the map varies with latitude, being minimum at the latitude\npassing through the zenith of the telescope. The angular power spectrum of the\nreconstructed map show that the current Tianlai cylinder pathfinder, which has\na shorter maximum baseline length in the North-South direction, can measure\nmodes up to $l \\lesssim 2\\pi b_{\\rm NS}/\\lambda \\sim 200$ very well, but would\nlose a significant fraction of higher angular modes when noise is present.\nThese results help us to identify the main limiting factors in our current\narray configuration and data analysis procedure, and suggest that the\nperformance can be improved by reconfiguration of the array feed positions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:04:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yu","Kaifeng",""],["Wu","Fengquan",""],["Zuo","Shifan",""],["Li","Jixia",""],["Sun","Shijie",""],["Wang","Yougang",""],["Chen","Xuelei",""]]}
{"id":"2308.04932","submitter":"Lan Tran","authors":"Lan Nguyen Tran, Eric Neuscamman","title":"Exploring Ligand-to-Metal Charge-transfer States in the\n  Photo-Ferrioxalate System using Excited-State Specific Optimization","comments":"20 pages, 7 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.atm-clus","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The photo-ferrioxalate system (PFS), [Fe(III)(C$_2$O$_4$)]$^{3-}$, more than\nan exact chemical actinometer, has been extensively applied in wastewater and\nenvironment treatment. Despite many experimental efforts to improve clarity,\nimportant aspects of the mechanism of ferrioxalate photolysis are still under\ndebate. In this paper, we employ the recently developed W$\\Gamma$-CASSCF to\ninvestigate the ligand-to-metal charge-transfer states key to the ferrioxalate\nphotolysis. This investigation provides a qualitative picture of these states\nand key potential energy surface features related to the photolysis. Our\ntheoretical results are consistent with the prompt charge transfer picture seen\nin recent experiments and clarify some features that are not visible in\nexperiments. Two ligand-to-metal charge-transfer states contribute to the\nphotolysis of ferrioxalate, and the avoided crossing barrier between them is\nlow compared to the initial photoexcitation energy. Our data also clarify that\none Fe-O bond cleaves first, followed by the C-C bond and the other Fe-O bond.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:05:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tran","Lan Nguyen",""],["Neuscamman","Eric",""]]}
{"id":"2308.04933","submitter":"Bartlomiej Surma","authors":"Bartlomiej Surma and Tahleen Rahman, Monique Breteler, Michael Backes\n  and Yang Zhang","title":"You Are How You Walk: Quantifying Privacy Risks in Step Count Data","comments":"13 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wearable devices have gained huge popularity in today's world. These devices\ncollect large-scale health data from their users, such as heart rate and step\ncount data, that is privacy sensitive, however it has not yet received the\nnecessary attention in the academia. In this paper, we perform the first\nsystematic study on quantifying privacy risks stemming from step count data. In\nparticular, we propose two attacks including attribute inference for gender,\nage and education and temporal linkability. We demonstrate the severity of the\nprivacy attacks by performing extensive evaluation on a real life dataset and\nderive key insights. We believe our results can serve as a step stone for\nderiving a privacy-preserving ecosystem for wearable devices in the future.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:06:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Surma","Bartlomiej",""],["Rahman","Tahleen",""],["Breteler","Monique",""],["Backes","Michael",""],["Zhang","Yang",""]]}
{"id":"2308.04934","submitter":"Radu Tudor Ionescu","authors":"Lucian Bicsi, Bogdan Alexe, Radu Tudor Ionescu, Marius Leordeanu","title":"JEDI: Joint Expert Distillation in a Semi-Supervised Multi-Dataset\n  Student-Teacher Scenario for Video Action Recognition","comments":"Accepted in ICCV 2023 Workshops","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose JEDI, a multi-dataset semi-supervised learning method, which\nefficiently combines knowledge from multiple experts, learned on different\ndatasets, to train and improve the performance of individual, per dataset,\nstudent models. Our approach achieves this by addressing two important problems\nin current machine learning research: generalization across datasets and\nlimitations of supervised training due to scarcity of labeled data. We start\nwith an arbitrary number of experts, pretrained on their own specific dataset,\nwhich form the initial set of student models. The teachers are immediately\nderived by concatenating the feature representations from the penultimate\nlayers of the students. We then train all models in a student-teacher\nsemi-supervised learning scenario until convergence. In our efficient approach,\nstudent-teacher training is carried out jointly and end-to-end, showing that\nboth students and teachers improve their generalization capacity during\ntraining. We validate our approach on four video action recognition datasets.\nBy simultaneously considering all datasets within a unified semi-supervised\nsetting, we demonstrate significant improvements over the initial experts.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:09:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bicsi","Lucian",""],["Alexe","Bogdan",""],["Ionescu","Radu Tudor",""],["Leordeanu","Marius",""]]}
{"id":"2308.04935","submitter":"Ruediger Klingeler","authors":"Ning Yuan, Ahmed Elghandour, Waldemar Hergett, Rahel Ohlendorf, Lukas\n  Gries, R\\\"udiger Klingeler","title":"1/3 plateau and 3/5 discontinuity in the magnetization and the magnetic\n  phase diagram of hexagonal GdInO$_3$","comments":null,"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":"  We report the high-pressure optical floating-zone growth of GdInO$_3$ single\ncrystals and show its magnetic phase diagram down to the mK-regime as\ndetermined by magnetization measurements. The centered-honeycomb lattice\nstructure shows considerable magnetic frustration ($\\lvert\\Theta\\rvert /T_{\\rm\nN}\\simeq 5$) and develops long-range magnetic order below $T_{\\rm N}$~=~2.1 K\nfrom a short-range ordered paramagnetic phase. Concomitantly, a small net\nmagnetic moment evolves at $T_{\\rm N}$ which points along the crystallographic\n$c$ direction. Upon cooling, the net moment reorients at $T^{**}\\simeq 1.7$ K\nand $T^{*}\\simeq 1$ K. A broad 1/3 plateau indicative of the up-up-down ($uud$)\nspin configuration appears for $B||c$ but is absent for $B||ab$, thereby\nsuggesting easy axis anisotropy. At $T=0.4$ K, a jump in magnetization at\n$\\simeq 3/5$ of the saturation magnetization signals a discontinuous transition\nto a high field phase and we find evidence for a possible tricritical point.\nSmall energy and field scales in the accessible regimes render GdInO$_3$ a\nprime example to study the phase diagram of a semiclassical frustrated\nhexagonal lattice in the presence of weak easy axis anisotropy of mainly\ndipolar origin.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:11:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yuan","Ning",""],["Elghandour","Ahmed",""],["Hergett","Waldemar",""],["Ohlendorf","Rahel",""],["Gries","Lukas",""],["Klingeler","R\u00fcdiger",""]]}
{"id":"2308.04936","submitter":"Tatiana Demidova","authors":"Tatiana V. Demidova and Vladimir P. Grinin","title":"3-D SPH simulations of the FUOR flares in the clumpy accretion model","comments":"11 pages, 9 figures","journal-ref":"The Astrophysical Journal, Volume 953, Number 1 (2023)","doi":"10.3847/1538-4357/acdf5f","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the early hypotheses about the origin of FUOR outbursts explains them\nby the fall of gas clumps from the remnants of protostellar clouds onto\nprotoplanetary disks surrounding young stars (Hartmann and Kenyon 1985). To\ncalculate the consequences of such an event we make 3D hydrodynamic simulations\nby SPH method. It is shown that the fall of the clump on the disk in the\nvicinity of the star actually causes a burst of the star's accretion activity,\nresembling in its characteristics the flares of known FUORs. In the region of\nincidence, an inhomogeneous gas ring is formed, which is inclined relative to\nthe outer disk. During several revolutions around the star, this ring combines\nwith the inner disk and forms a tilted disk. In the process of evolution, the\ninner disk expands, and its inclination relative to the outer disk decreases.\nAfter 100 revolutions, the angle of inclination is a few degrees. This result\nis of interest in connection with the discovery in recent years of\nprotoplanetary disks, the inner region of which is inclined relative to the\nouter one. Such structures are usually associated with the existence in the\nvicinity of a star of a massive body (planet or brown dwarf), whose orbit is\ninclined relative to the plane of the disk. The results of our modeling\nindicate the possibility of an alternative explanation for this phenomenon.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:11:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Demidova","Tatiana V.",""],["Grinin","Vladimir P.",""]]}
{"id":"2308.04937","submitter":"Bhaskaran Muralidharan","authors":"Anuranan Das, Adil Khan, Ankan Mukherjee and Bhaskaran Muralidharan","title":"Machine learning unveils multiple Pauli blockades in the transport\n  spectroscopy of bilayer graphene double-quantum dots","comments":"11 pages, 7 figures, Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent breakthroughs in the transport spectroscopy of 2-D material\nquantum-dot platforms have engendered a fervent interest in spin-valley qubits.\nIn this context, Pauli blockades in double quantum dot structures form an\nimportant basis for multi-qubit initialization and manipulation. Focusing on\ndouble quantum dot structures, and the experimental results, we first build\ntheoretical models to capture the intricate interplay between externally fed\ngate voltages and the physical properties of the 2-D system in such an\narchitecture, allowing us to effectively simulate Pauli blockades. Employing\nthe master equations for transport and considering extrinsic factors such as\nelectron-photon interactions, we thoroughly investigate all potential\noccurrences of Pauli blockades. Notably, our research reveals two remarkable\nphenomena: (i) the existence of multiple resonances within a bias triangle, and\n(ii) the occurrence of multiple Pauli blockades. Leveraging our model to train\na machine learning algorithm, we successfully develop an automated method for\nreal-time detection of multiple Pauli blockade regimes. Through numerical\npredictions and validations against test data, we identify where and how many\nPauli blockades are likely to occur. We propose that our model can effectively\ndetect the generic class of Pauli blockades in practical experimental setups\nand hence serves as the foundation for future experiments on qubits that\nutilize 2-D material platforms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:12:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Das","Anuranan",""],["Khan","Adil",""],["Mukherjee","Ankan",""],["Muralidharan","Bhaskaran",""]]}
{"id":"2308.04938","submitter":"Astrid Vanneste","authors":"Astrid Vanneste, Simon Vanneste, Kevin Mets, Tom De Schepper,\n  Siegfried Mercelis, Peter Hellinckx","title":"An In-Depth Analysis of Discretization Methods for Communication\n  Learning using Backpropagation with Multi-Agent Reinforcement Learning","comments":"arXiv admin note: substantial text overlap with arXiv:2204.05669","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":"  Communication is crucial in multi-agent reinforcement learning when agents\nare not able to observe the full state of the environment. The most common\napproach to allow learned communication between agents is the use of a\ndifferentiable communication channel that allows gradients to flow between\nagents as a form of feedback. However, this is challenging when we want to use\ndiscrete messages to reduce the message size, since gradients cannot flow\nthrough a discrete communication channel. Previous work proposed methods to\ndeal with this problem. However, these methods are tested in different\ncommunication learning architectures and environments, making it hard to\ncompare them. In this paper, we compare several state-of-the-art discretization\nmethods as well as a novel approach. We do this comparison in the context of\ncommunication learning using gradients from other agents and perform tests on\nseveral environments. In addition, we present COMA-DIAL, a communication\nlearning approach based on DIAL and COMA extended with learning rate scaling\nand adapted exploration. Using COMA-DIAL allows us to perform experiments on\nmore complex environments. Our results show that the novel ST-DRU method,\nproposed in this paper, achieves the best results out of all discretization\nmethods across the different environments. It achieves the best or close to the\nbest performance in each of the experiments and is the only method that does\nnot fail on any of the tested environments.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:13:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Vanneste","Astrid",""],["Vanneste","Simon",""],["Mets","Kevin",""],["De Schepper","Tom",""],["Mercelis","Siegfried",""],["Hellinckx","Peter",""]]}
{"id":"2308.04939","submitter":"Adailton Ara\\'ujo Filho","authors":"A. A. Ara\\'ujo Filho","title":"Implications of a Simpson-Visser solution in Verlinde's framework","comments":"32 pages and 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":"  This study focuses on investigating a regular black hole within the framework\nof Verlinde's emergent gravity. In particular, we explore the classical aspects\nof the modified Simpson--Visser solution. Our analysis reveals the presence of\na unique physical event horizon. Moreover, we study the thermodynamic\nproperties, including the \\textit{Hawking} temperature, the entropy, and the\nheat capacity. Based on these quantities, our results show several phase\ntransitions. Geodesic trajectories for photon--like particles, encompassing\nphoton spheres and the formation of black hole shadows, are also calculated to\ncomprehend the behavior of light in the vicinity of the black hole.\nFurthermore, we investigate the quasinormal modes using third--order WKB\napproximation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:14:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Filho","A. A. Ara\u00fajo",""]]}
{"id":"2308.04940","submitter":"Kushal Lodha","authors":"Kushal Lodha, Lucas Pinol, Savvas Nesseris, Arman Shafieloo, Wuhyun\n  Sohn and Matteo Fasiello","title":"Searching for Local Features in Primordial Power Spectrum using Genetic\n  Algorithms","comments":"12 pages, 7 figures, 4 tables. Comments are 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 present a novel methodology for exploring local features directly in the\nprimordial power spectrum using a genetic algorithm (GA) pipeline coupled with\na Boltzmann solver and Cosmic Microwave Background data (CMB). After testing\nthe robustness of our pipeline using mock data, we apply it to the latest CMB\ndata, including Planck 2018 and CamSpec PR4. Our model-independent approach\nprovides an analytical reconstruction of the power spectra that best fits the\ndata, with the unsupervised machine learning algorithm exploring a functional\nspace built off simple ``grammar'' functions. We find significant improvements\nupon the simple power-law behaviour, by $\\Delta \\chi^2 \\lesssim -21$,\nconsistently with more traditional model-based approaches. These best-fits\nalways address both the low$\\ell$ anomaly in the TT spectrum and the residual\nhigh$\\ell$ oscillations in the TT, TE and EE spectra. The proposed pipeline\nprovides an adaptable tool for exploring features in the primordial power\nspectrum in a model-independent way, providing valuable hints to theorists for\nconstructing viable inflationary models that are consistent with the current\nand upcoming CMB surveys.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:15:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lodha","Kushal",""],["Pinol","Lucas",""],["Nesseris","Savvas",""],["Shafieloo","Arman",""],["Sohn","Wuhyun",""],["Fasiello","Matteo",""]]}
{"id":"2308.04941","submitter":"Francesco Donnarumma","authors":"Francesco Donnarumma, Mirco Frosolone and Giovanni Pezzulo","title":"Integrating large language models and active inference to understand eye\n  movements in reading and dyslexia","comments":"23 pages, 1 Appendix, 11 Tables, 9 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a novel computational model employing hierarchical active\ninference to simulate reading and eye movements. The model characterizes\nlinguistic processing as inference over a hierarchical generative model,\nfacilitating predictions and inferences at various levels of granularity, from\nsyllables to sentences.\n  Our approach combines the strengths of large language models for realistic\ntextual predictions and active inference for guiding eye movements to\ninformative textual information, enabling the testing of predictions. The model\nexhibits proficiency in reading both known and unknown words and sentences,\nadhering to the distinction between lexical and nonlexical routes in dual-route\ntheories of reading. Notably, our model permits the exploration of maladaptive\ninference effects on eye movements during reading, such as in dyslexia. To\nsimulate this condition, we attenuate the contribution of priors during the\nreading process, leading to incorrect inferences and a more fragmented reading\nstyle, characterized by a greater number of shorter saccades. This alignment\nwith empirical findings regarding eye movements in dyslexic individuals\nhighlights the model's potential to aid in understanding the cognitive\nprocesses underlying reading and eye movements, as well as how reading deficits\nassociated with dyslexia may emerge from maladaptive predictive processing.\n  In summary, our model represents a significant advancement in comprehending\nthe intricate cognitive processes involved in reading and eye movements, with\npotential implications for understanding and addressing dyslexia through the\nsimulation of maladaptive inference. It may offer valuable insights into this\ncondition and contribute to the development of more effective interventions for\ntreatment.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:16:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Donnarumma","Francesco",""],["Frosolone","Mirco",""],["Pezzulo","Giovanni",""]]}
{"id":"2308.04942","submitter":"Guangyuan Liu","authors":"Guangyuan Liu, Hongyang Du, Dusit Niyato, Jiawen Kang, Zehui Xiong,\n  Dong In Kim, and Xuemin (Sherman) Shen","title":"Semantic Communications for Artificial Intelligence Generated Content\n  (AIGC) Toward Effective Content Creation","comments":"8 pages,5figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial Intelligence Generated Content (AIGC) Services have significant\npotential in digital content creation. The distinctive abilities of AIGC, such\nas content generation based on minimal input, hold huge potential, especially\nwhen integrating with semantic communication (SemCom). In this paper, a novel\ncomprehensive conceptual model for the integration of AIGC and SemCom is\ndeveloped. Particularly, a content generation level is introduced on top of the\nsemantic level that provides a clear outline of how AIGC and SemCom interact\nwith each other to produce meaningful and effective content. Moreover, a novel\nframework that employs AIGC technology is proposed as an encoder and decoder\nfor semantic information, considering the joint optimization of semantic\nextraction and evaluation metrics tailored to AIGC services. The framework can\nadapt to different types of content generated, the required quality, and the\nsemantic information utilized. By employing a Deep Q Network (DQN), a case\nstudy is presented that provides useful insights into the feasibility of the\noptimization problem and its convergence characteristics.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:17:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Guangyuan","","Sherman"],["Du","Hongyang","","Sherman"],["Niyato","Dusit","","Sherman"],["Kang","Jiawen","","Sherman"],["Xiong","Zehui","","Sherman"],["Kim","Dong In","","Sherman"],["Xuemin","","","Sherman"],["Shen","",""]]}
{"id":"2308.04943","submitter":"Yuxin Qi","authors":"Yuxin Qi, Xi Lin, Jun Wu","title":"Differentially Private Graph Neural Network with Importance-Grained\n  Noise Adaption","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":"  Graph Neural Networks (GNNs) with differential privacy have been proposed to\npreserve graph privacy when nodes represent personal and sensitive information.\nHowever, the existing methods ignore that nodes with different importance may\nyield diverse privacy demands, which may lead to over-protect some nodes and\ndecrease model utility. In this paper, we study the problem of\nimportance-grained privacy, where nodes contain personal data that need to be\nkept private but are critical for training a GNN. We propose NAP-GNN, a\nnode-importance-grained privacy-preserving GNN algorithm with privacy\nguarantees based on adaptive differential privacy to safeguard node\ninformation. First, we propose a Topology-based Node Importance Estimation\n(TNIE) method to infer unknown node importance with neighborhood and centrality\nawareness. Second, an adaptive private aggregation method is proposed to\nperturb neighborhood aggregation from node-importance-grain. Third, we propose\nto privately train a graph learning algorithm on perturbed aggregations in\nadaptive residual connection mode over multi-layers convolution for node-wise\ntasks. Theoretically analysis shows that NAP-GNN satisfies privacy guarantees.\nEmpirical experiments over real-world graph datasets show that NAP-GNN achieves\na better trade-off between privacy and accuracy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:18:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Qi","Yuxin",""],["Lin","Xi",""],["Wu","Jun",""]]}
{"id":"2308.04944","submitter":"Tetiana Gula","authors":"Tetiana Gula, Jo\\~ao P C Bertoldo","title":"Gaussian Image Anomaly Detection with Greedy Eigencomponent Selection","comments":"28 pages, 14 figures, accepted to 2023 official workshop of the\n  LatinX in Computer Vision (LXCV) at ICCV","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Anomaly detection (AD) in images, identifying significant deviations from\nnormality, is a critical issue in computer vision. This paper introduces a\nnovel approach to dimensionality reduction for AD using pre-trained\nconvolutional neural network (CNN) that incorporate EfficientNet models. We\ninvestigate the importance of component selection and propose two types of tree\nsearch approaches, both employing a greedy strategy, for optimal eigencomponent\nselection. Our study conducts three main experiments to evaluate the\neffectiveness of our approach. The first experiment explores the influence of\ntest set performance on component choice, the second experiment examines the\nperformance when we train on one anomaly type and evaluate on all other types,\nand the third experiment investigates the impact of using a minimum number of\nimages for training and selecting them based on anomaly types. Our approach\naims to find the optimal subset of components that deliver the highest\nperformance score, instead of focusing solely on the proportion of variance\nexplained by each component and also understand the components behaviour in\ndifferent settings. Our results indicate that the proposed method surpasses\nboth Principal Component Analysis (PCA) and Negated Principal Component\nAnalysis (NPCA) in terms of detection accuracy, even when using fewer\ncomponents. Thus, our approach provides a promising alternative to conventional\ndimensionality reduction techniques in AD, and holds potential to enhance the\nefficiency and effectiveness of AD systems.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:19:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gula","Tetiana",""],["Bertoldo","Jo\u00e3o P C",""]]}
{"id":"2308.04945","submitter":"Firoj Alam","authors":"Fahim Dalvi, Maram Hasanain, Sabri Boughorbel, Basel Mousi, Samir\n  Abdaljalil, Nizi Nazar, Ahmed Abdelali, Shammur Absar Chowdhury, Hamdy\n  Mubarak, Ahmed Ali, Majd Hawasly, Nadir Durrani, Firoj Alam","title":"LLMeBench: A Flexible Framework for Accelerating LLMs Benchmarking","comments":"Foundation Models, Large Language Models, NLP, CHatGPT Evaluation,\n  LLMs Benchmark","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The recent development and success of Large Language Models (LLMs)\nnecessitate an evaluation of their performance across diverse NLP tasks in\ndifferent languages. Although several frameworks have been developed and made\npublicly available, their customization capabilities for specific tasks and\ndatasets are often complex for different users. In this study, we introduce the\nLLMeBench framework. Initially developed to evaluate Arabic NLP tasks using\nOpenAI's GPT and BLOOM models; it can be seamlessly customized for any NLP task\nand model, regardless of language. The framework also features zero- and\nfew-shot learning settings. A new custom dataset can be added in less than 10\nminutes, and users can use their own model API keys to evaluate the task at\nhand. The developed framework has been already tested on 31 unique NLP tasks\nusing 53 publicly available datasets within 90 experimental setups, involving\napproximately 296K data points. We plan to open-source the framework for the\ncommunity (https://github.com/qcri/LLMeBench/). A video demonstrating the\nframework is available online (https://youtu.be/FkQn4UjYA0s).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:22:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dalvi","Fahim",""],["Hasanain","Maram",""],["Boughorbel","Sabri",""],["Mousi","Basel",""],["Abdaljalil","Samir",""],["Nazar","Nizi",""],["Abdelali","Ahmed",""],["Chowdhury","Shammur Absar",""],["Mubarak","Hamdy",""],["Ali","Ahmed",""],["Hawasly","Majd",""],["Durrani","Nadir",""],["Alam","Firoj",""]]}
{"id":"2308.04946","submitter":"Youssef Dawoud","authors":"Youssef Dawoud, Gustavo Carneiro, and Vasileios Belagiannis","title":"SelectNAdapt: Support Set Selection for Few-Shot Domain Adaptation","comments":"Accepted to ICCV Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generalisation of deep neural networks becomes vulnerable when distribution\nshifts are encountered between train (source) and test (target) domain data.\nFew-shot domain adaptation mitigates this issue by adapting deep neural\nnetworks pre-trained on the source domain to the target domain using a randomly\nselected and annotated support set from the target domain. This paper argues\nthat randomly selecting the support set can be further improved for effectively\nadapting the pre-trained source models to the target domain. Alternatively, we\npropose SelectNAdapt, an algorithm to curate the selection of the target domain\nsamples, which are then annotated and included in the support set. In\nparticular, for the K-shot adaptation problem, we first leverage\nself-supervision to learn features of the target domain data. Then, we propose\na per-class clustering scheme of the learned target domain features and select\nK representative target samples using a distance-based scoring function.\nFinally, we bring our selection setup towards a practical ground by relying on\npseudo-labels for clustering semantically similar target domain samples. Our\nexperiments show promising results on three few-shot domain adaptation\nbenchmarks for image recognition compared to related approaches and the\nstandard random selection.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:24:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dawoud","Youssef",""],["Carneiro","Gustavo",""],["Belagiannis","Vasileios",""]]}
{"id":"2308.04947","submitter":"Liping Wang","authors":"Liping Wang, Jiawei Li, Lifan Zhao, Zhizhuo Kou, Xiaohan Wang, Xinyi\n  Zhu, Hao Wang, Yanyan Shen and Lei Chen","title":"Methods for Acquiring and Incorporating Knowledge into Stock Price\n  Prediction: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting stock prices presents a challenging research problem due to the\ninherent volatility and non-linear nature of the stock market. In recent years,\nknowledge-enhanced stock price prediction methods have shown groundbreaking\nresults by utilizing external knowledge to understand the stock market. Despite\nthe importance of these methods, there is a scarcity of scholarly works that\nsystematically synthesize previous studies from the perspective of external\nknowledge types. Specifically, the external knowledge can be modeled in\ndifferent data structures, which we group into non-graph-based formats and\ngraph-based formats: 1) non-graph-based knowledge captures contextual\ninformation and multimedia descriptions specifically associated with an\nindividual stock; 2) graph-based knowledge captures interconnected and\ninterdependent information in the stock market. This survey paper aims to\nprovide a systematic and comprehensive description of methods for acquiring\nexternal knowledge from various unstructured data sources and then\nincorporating it into stock price prediction models. We also explore fusion\nmethods for combining external knowledge with historical price features.\nMoreover, this paper includes a compilation of relevant datasets and delves\ninto potential future research directions in this domain.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:28:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Liping",""],["Li","Jiawei",""],["Zhao","Lifan",""],["Kou","Zhizhuo",""],["Wang","Xiaohan",""],["Zhu","Xinyi",""],["Wang","Hao",""],["Shen","Yanyan",""],["Chen","Lei",""]]}
{"id":"2308.04948","submitter":"Wenhao Zhu","authors":"Wenhao Zhu, Yunzhe Lv, Qingxiu Dong, Fei Yuan, Jingjing Xu, Shujian\n  Huang, Lingpeng Kong, Jiajun Chen, Lei Li","title":"Extrapolating Large Language Models to Non-English by Aligning Languages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the unbalanced training data distribution, the language ability of\nlarge language models (LLMs) is often biased towards English. In this paper, we\npropose to empower pre-trained LLMs on non-English languages by building\nsemantic alignment across languages. We perform instruction-tuning on LLaMA\nwith both translation task data and cross-lingual general task data to obtain\ncross-lingual models (x-LLaMA). Experiment results on cross-lingual benchmark\nXQUAD and MLQA show that x-LLaMA models outperform the English\ninstruction-tuned counterpart (Alpaca) by 42.50% on average on six non-English\nlanguages. Further experiments on Chinese benchmark C-Eval show that x-LLaMA\nachieves significant improvement on Chinese humanities tasks, outperforming\nAlpaca by 8.2%. We also discover that incorporating non-English text on the\ntarget side of translation data is particularly effective for boosting\nnon-English ability. Besides, we find that semantic alignment within LLM can be\nfurther strengthened as translation task data scales up and we present the\nformulation of the underlying scaling law. Evaluation results on translation\ndataset Flores-101 show that \\method outperforms previous LLaMA-based models in\nall evaluated directions. Code and data will be available at:\nhttps://github.com/OwenNJU/x-LLM.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:32:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Wenhao",""],["Lv","Yunzhe",""],["Dong","Qingxiu",""],["Yuan","Fei",""],["Xu","Jingjing",""],["Huang","Shujian",""],["Kong","Lingpeng",""],["Chen","Jiajun",""],["Li","Lei",""]]}
{"id":"2308.04949","submitter":"Lei Zhu","authors":"Lei Zhu, Hangzhou He, Xinliang Zhang, Qian Chen, Shuang Zeng, Qiushi\n  Ren, Yanye Lu","title":"Branches Mutual Promotion for End-to-End Weakly Supervised 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":"  End-to-end weakly supervised semantic segmentation aims at optimizing a\nsegmentation model in a single-stage training process based on only image\nannotations. Existing methods adopt an online-trained classification branch to\nprovide pseudo annotations for supervising the segmentation branch. However,\nthis strategy makes the classification branch dominate the whole concurrent\ntraining process, hindering these two branches from assisting each other. In\nour work, we treat these two branches equally by viewing them as diverse ways\nto generate the segmentation map, and add interactions on both their\nsupervision and operation to achieve mutual promotion. For this purpose, a\nbidirectional supervision mechanism is elaborated to force the consistency\nbetween the outputs of these two branches. Thus, the segmentation branch can\nalso give feedback to the classification branch to enhance the quality of\nlocalization seeds. Moreover, our method also designs interaction operations\nbetween these two branches to exchange their knowledge to assist each other.\nExperiments indicate our work outperforms existing end-to-end weakly supervised\nsegmentation methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:32:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Lei",""],["He","Hangzhou",""],["Zhang","Xinliang",""],["Chen","Qian",""],["Zeng","Shuang",""],["Ren","Qiushi",""],["Lu","Yanye",""]]}
{"id":"2308.04950","submitter":"Shafna Fitria Nur Azizah","authors":"Shafna Fitria Nur Azizah, Hasan Dwi Cahyono, Sari Widya Sihwi, Wisnu\n  Widiarto","title":"Performance Analysis of Transformer Based Models (BERT, ALBERT and\n  RoBERTa) in Fake News Detection","comments":"6 pages, 4 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fake news is fake material in a news media format but is not processed\nproperly by news agencies. The fake material can provoke or defame significant\nentities or individuals or potentially even for the personal interests of the\ncreators, causing problems for society. Distinguishing fake news and real news\nis challenging due to limited of domain knowledge and time constraints.\nAccording to the survey, the top three areas most exposed to hoaxes and\nmisinformation by residents are in Banten, DKI Jakarta and West Java. The model\nof transformers is referring to an approach in the field of artificial\nintelligence (AI) in natural language processing utilizing the deep learning\narchitectures. Transformers exercise a powerful attention mechanism to process\ntext in parallel and produce rich and contextual word representations. A\nprevious study indicates a superior performance of a transformer model known as\nBERT over and above non transformer approach. However, some studies suggest the\nperformance can be improved with the use of improved BERT models known as\nALBERT and RoBERTa. However, the modified BERT models are not well explored for\ndetecting fake news in Bahasa Indonesia. In this research, we explore those\ntransformer models and found that ALBERT outperformed other models with 87.6%\naccuracy, 86.9% precision, 86.9% F1-score, and 174.5 run-time (s/epoch)\nrespectively. Source code available at:\nhttps://github.com/Shafna81/fakenewsdetection.git\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:33:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Azizah","Shafna Fitria Nur",""],["Cahyono","Hasan Dwi",""],["Sihwi","Sari Widya",""],["Widiarto","Wisnu",""]]}
{"id":"2308.04951","submitter":"Sebastian Deffner","authors":"Akira Sone, Kanu Sinha, and Sebastian Deffner","title":"Thermodynamic perspective on quantum fluctuations","comments":"32 pages, 9 figures; Chapter to be submitted for Encyclopedia of\n  Mathematical Physics 2nd edition","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  What is the major difference between large and small systems? At small\nlength-scales the dynamics is dominated by fluctuations, whereas at large\nscales fluctuations are irrelevant. Therefore, any thermodynamically consistent\ndescription of quantum systems necessitates a thorough understanding of the\nnature and consequences of fluctuations. In this chapter, we outline two\nclosely related fields of research that are commonly considered separately --\nfluctuation forces and fluctuation theorems. Focusing on the main gist of these\nexciting and vivid fields of modern research, we seek to provide a instructive\nentry point for both communities of researchers interested in learning about\nthe other.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:37:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sone","Akira",""],["Sinha","Kanu",""],["Deffner","Sebastian",""]]}
{"id":"2308.04952","submitter":"Kai Huang","authors":"Kai Huang, Feigege Wang, Ye Xi, Yutao Gao","title":"Prototypical Kernel Learning and Open-set Foreground Perception for\n  Generalized Few-shot Semantic Segmentation","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generalized Few-shot Semantic Segmentation (GFSS) extends Few-shot Semantic\nSegmentation (FSS) to simultaneously segment unseen classes and seen classes\nduring evaluation. Previous works leverage additional branch or prototypical\naggregation to eliminate the constrained setting of FSS. However,\nrepresentation division and embedding prejudice, which heavily results in poor\nperformance of GFSS, have not been synthetical considered. We address the\naforementioned problems by jointing the prototypical kernel learning and\nopen-set foreground perception. Specifically, a group of learnable kernels is\nproposed to perform segmentation with each kernel in charge of a stuff class.\nThen, we explore to merge the prototypical learning to the update of base-class\nkernels, which is consistent with the prototype knowledge aggregation of\nfew-shot novel classes. In addition, a foreground contextual perception module\ncooperating with conditional bias based inference is adopted to perform\nclass-agnostic as well as open-set foreground detection, thus to mitigate the\nembedding prejudice and prevent novel targets from being misclassified as\nbackground. Moreover, we also adjust our method to the Class Incremental\nFew-shot Semantic Segmentation (CIFSS) which takes the knowledge of novel\nclasses in a incremental stream. Extensive experiments on PASCAL-5i and\nCOCO-20i datasets demonstrate that our method performs better than previous\nstate-of-the-art.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:38:52 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 01:59:23 GMT"},{"version":"v3","created":"Sat, 19 Aug 2023 03:22:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Kai",""],["Wang","Feigege",""],["Xi","Ye",""],["Gao","Yutao",""]]}
{"id":"2308.04953","submitter":"Viet Quoc Pham","authors":"Mai Le and Dinh Thai Hoang and Diep N. Nguyen and Won-Joo Hwang and\n  Quoc-Viet Pham","title":"Wirelessly Powered Federated Learning Networks: Joint Power Transfer,\n  Data Sensing, Model Training, and Resource Allocation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) has found many successes in wireless networks;\nhowever, the implementation of FL has been hindered by the energy limitation of\nmobile devices (MDs) and the availability of training data at MDs. How to\nintegrate wireless power transfer and mobile crowdsensing towards sustainable\nFL solutions is a research topic entirely missing from the open literature.\nThis work for the first time investigates a resource allocation problem in\ncollaborative sensing-assisted sustainable FL (S2FL) networks with the goal of\nminimizing the total completion time. We investigate a practical\nharvesting-sensing-training-transmitting protocol in which energy-limited MDs\nfirst harvest energy from RF signals, use it to gain a reward for user\nparticipation, sense the training data from the environment, train the local\nmodels at MDs, and transmit the model updates to the server. The total\ncompletion time minimization problem of jointly optimizing power transfer,\ntransmit power allocation, data sensing, bandwidth allocation, local model\ntraining, and data transmission is complicated due to the non-convex objective\nfunction, highly non-convex constraints, and strongly coupled variables. We\npropose a computationally-efficient path-following algorithm to obtain the\noptimal solution via the decomposition technique. In particular, inner convex\napproximations are developed for the resource allocation subproblem, and the\nsubproblems are performed alternatively in an iterative fashion. Simulation\nresults are provided to evaluate the effectiveness of the proposed S2FL\nalgorithm in reducing the completion time up to 21.45% in comparison with other\nbenchmark schemes. Further, we investigate an extension of our work from\nfrequency division multiple access (FDMA) to non-orthogonal multiple access\n(NOMA) and show that NOMA can speed up the total completion time 8.36% on\naverage of the considered FL system.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:38:58 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Le","Mai",""],["Hoang","Dinh Thai",""],["Nguyen","Diep N.",""],["Hwang","Won-Joo",""],["Pham","Quoc-Viet",""]]}
{"id":"2308.04954","submitter":"Christian Alig","authors":"C. Alig, A. Prieto, M. Bla\\~na, M. Frischman, C. Metzl, A. Burkert, O.\n  Zier, A. Streblyanska","title":"The Accretion Mode in Sub-Eddington Supermassive Black Holes: Getting\n  into the Central Parsecs of Andromeda","comments":"13 pages, 11 figures","journal-ref":"The Astrophysical Journal, 2023 August 9, Volume 953, Number 1","doi":"10.3847/1538-4357/ace2c3","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The inner kiloparsec regions surrounding sub-Eddington (luminosity less than\n10$^{-3}$ in Eddington units, L$_{Edd}$) supermassive black holes (BHs) often\nshow a characteristic network of dust filaments that terminate in a nuclear\nspiral in the central parsecs. Here we study the role and fate of these\nfilaments in one of the least accreting BHs known, M31 (10$^{-7}$ L$_{Edd}$)\nusing hydrodynamical simulations. The evolution of a streamer of gas particles\nmoving under the barred potential of M31 is followed from kiloparsec distance\nto the central parsecs. After an exploratory study of initial conditions, a\ncompelling fit to the observed dust/ionized gas morphologies and line-of-sight\nvelocities in the inner hundreds of parsecs is produced. After several million\nyears of streamer evolution, during which friction, thermal dissipation, and\nself-collisions have taken place, the gas settles into a disk tens of parsecs\nwide. This is fed by numerous filaments that arise from an outer circumnuclear\nring and spiral toward the center. The final configuration is tightly\nconstrained by a critical input mass in the streamer of several 10$^3$\nM$_{\\odot}$ (at an injection rate of 10$^{-4}$ M$_{\\odot}$ yr$^{-1}$); values\nabove or below this lead to filament fragmentation or dispersion respectively,\nwhich are not observed. The creation of a hot gas atmosphere in the region of\n$\\sim$10$^6$ K is key to the development of a nuclear spiral during the\nsimulation. The final inflow rate at 1pc from the center is $\\sim$1.7 $\\times$\n10$^{-7}$ M$_{\\odot}$ yr$^{-1}$, consistent with the quiescent state of the M31\nBH.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:39:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Alig","C.",""],["Prieto","A.",""],["Bla\u00f1a","M.",""],["Frischman","M.",""],["Metzl","C.",""],["Burkert","A.",""],["Zier","O.",""],["Streblyanska","A.",""]]}
{"id":"2308.04955","submitter":"Debarun Paul","authors":"Debarun Paul, Antara Dey, Amit Dutta Banik, Supratik Pal","title":"Confronting global 21-cm signal with $\\mathbb{Z}_3$ symmetric dark\n  matter models","comments":"21 pages, 11 sets of figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While the $\\mathbb{Z}_3$ symmetric dark matter models have shown tremendous\nprospects in addressing a number of (astro-)particle physics problems, they can\nleave interesting imprints on cosmological observations as well. We consider\ntwo such promising models: semi-annihilating dark matter (SADM) and Co-SIMP\n$2\\rightarrow 3$ interaction, and investigate their effects on the global 21-cm\nsignal. SADM is found to address the EDGES observation with the aid of an\nexcess radio background, whereas Co-SIMP can explain the EDGES dip by virtue of\nan intrinsic cooling effect without invoking any such excess radiation. Hence,\nthe latter model turns out to be a rare model within the domain of CDM, that\nuses leptophilic interaction to achieve the EDGES dip. Further, keeping in mind\nthe ongoing debate between EDGES and SARAS 3 on the global 21-cm signal, we\ndemonstrate that our chosen models can still remain viable in this context,\neven if the EDGES data requires reassessment in future. We then extend our\ninvestigation to possible reflections on the Dark Ages, followed by a\nconsistency check with the CMB and BAO observations via Planck 2018(+BAO)\ndatasets. This work thus presents a compelling case of exploring these\ninteresting particle physics models in the light of different cosmological\nobservations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:40:20 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Paul","Debarun",""],["Dey","Antara",""],["Banik","Amit Dutta",""],["Pal","Supratik",""]]}
{"id":"2308.04956","submitter":"Yuhang Wang","authors":"Weijie Chen, Lin Yao, Zeqing Xia, Yuhang Wang","title":"ACE-HetEM for ab initio Heterogenous Cryo-EM 3D Reconstruction","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV q-bio.BM q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Due to the extremely low signal-to-noise ratio (SNR) and unknown poses\n(projection angles and image translation) in cryo-EM experiments,\nreconstructing 3D structures from 2D images is very challenging. On top of\nthese challenges, heterogeneous cryo-EM reconstruction also has an additional\nrequirement: conformation classification. An emerging solution to this problem\nis called amortized inference, implemented using the autoencoder architecture\nor its variants. Instead of searching for the correct\nimage-to-pose/conformation mapping for every image in the dataset as in\nnon-amortized methods, amortized inference only needs to train an encoder that\nmaps images to appropriate latent spaces representing poses or conformations.\nUnfortunately, standard amortized-inference-based methods with entangled latent\nspaces have difficulty learning the distribution of conformations and poses\nfrom cryo-EM images. In this paper, we propose an unsupervised deep learning\narchitecture called \"ACE-HetEM\" based on amortized inference. To explicitly\nenforce the disentanglement of conformation classifications and pose\nestimations, we designed two alternating training tasks in our method:\nimage-to-image task and pose-to-pose task. Results on simulated datasets show\nthat ACE-HetEM has comparable accuracy in pose estimation and produces even\nbetter reconstruction resolution than non-amortized methods. Furthermore, we\nshow that ACE-HetEM is also applicable to real experimental datasets.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:41:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Weijie",""],["Yao","Lin",""],["Xia","Zeqing",""],["Wang","Yuhang",""]]}
{"id":"2308.04957","submitter":"Federico Bonetto","authors":"Gian Marco Marin, Federico Bonetto, Livia Corsi","title":"Analiticity of the Lyapunov exponent of perturbed toral automorphisms","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 a dynamical system generated by an analytic perturbation of a\nlinear toral automorphism of $\\TTT^d$. We construct $d$ independent and\ninvariant vector fields associated with the Lyapunov directions and show that\nthe Lyapunov exponents are analytic functions of the perturbation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:42:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Marin","Gian Marco",""],["Bonetto","Federico",""],["Corsi","Livia",""]]}
{"id":"2308.04958","submitter":"Marc Brittain","authors":"Marc W. Brittain, Luis E. Alvarez, Kara Breeden","title":"Improving Autonomous Separation Assurance through Distributed\n  Reinforcement Learning with Attention Networks","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advanced Air Mobility (AAM) introduces a new, efficient mode of\ntransportation with the use of vehicle autonomy and electrified aircraft to\nprovide increasingly autonomous transportation between previously underserved\nmarkets. Safe and efficient navigation of low altitude aircraft through highly\ndense environments requires the integration of a multitude of complex\nobservations, such as surveillance, knowledge of vehicle dynamics, and weather.\nThe processing and reasoning on these observations pose challenges due to the\nvarious sources of uncertainty in the information while ensuring cooperation\nwith a variable number of aircraft in the airspace. These challenges coupled\nwith the requirement to make safety-critical decisions in real-time rule out\nthe use of conventional separation assurance techniques. We present a\ndecentralized reinforcement learning framework to provide autonomous\nself-separation capabilities within AAM corridors with the use of speed and\nvertical maneuvers. The problem is formulated as a Markov Decision Process and\nsolved by developing a novel extension to the sample-efficient, off-policy soft\nactor-critic (SAC) algorithm. We introduce the use of attention networks for\nvariable-length observation processing and a distributed computing architecture\nto achieve high training sample throughput as compared to existing approaches.\nA comprehensive numerical study shows that the proposed framework can ensure\nsafe and efficient separation of aircraft in high density, dynamic environments\nwith various sources of uncertainty.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:44:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Brittain","Marc W.",""],["Alvarez","Luis E.",""],["Breeden","Kara",""]]}
{"id":"2308.04959","submitter":"Mitsuru Kokubo","authors":"Mitsuru Kokubo (NAOJ)","title":"Rayleigh and Raman scattering cross-sections and phase matrices of the\n  ground-state hydrogen atom, and their astrophysical implications","comments":"28 pages, 8 figures, 2 tables, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present explicit expressions for Rayleigh and Raman scattering\ncross-sections and phase matrices of the ground $1s$ state hydrogen atom based\non the Kramers-Heisenberg dispersion formula. The Rayleigh scattering leaves\nthe hydrogen atom in the ground-state while the Raman scattering leaves the\nhydrogen atom in either $ns$ ($n\\geq2$; $s$-branch) or $nd$ ($n\\geq3$;\n$d$-branch) excited state, and the Raman scattering converts incident\nultraviolet (UV) photons around the Lyman resonance lines into optical-infrared\n(IR) photons. We show that this Raman wavelength conversion of incident flat UV\ncontinuum in dense hydrogen gas with a column density of $N_{\\text{H}} >\n10^{21}~\\text{cm}^{-2}$ can produce broad emission features centred at Balmer,\nPaschen, and higher-level lines, which would mimic Doppler-broadened hydrogen\nlines with the velocity width of $\\gtrsim 1,000~\\text{km}~\\text{s}^{-1}$ that\ncould be misinterpreted as signatures of Active Galactic Nuclei, supernovae, or\nfast stellar winds. We show that the phase matrix of the Rayleigh and Raman\n$s$-branch scatterings is identical to that of the Thomson scattering while the\nRaman $d$-branch scattering is more isotropic, thus the Paschen and\nhigher-level Raman features are depolarized compared to the Balmer features due\nto the flux contribution from the Raman $d$-branch. We argue that observations\nof the line widths, line flux ratios, and linear polarization of multiple\noptical/IR hydrogen lines are crucial to discriminate between the\nRaman-scattered broad emission features and Doppler-broadened emission lines.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:44:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kokubo","Mitsuru","","NAOJ"]]}
{"id":"2308.04960","submitter":"Diep Luong","authors":"Diep Luong, Minh Tran, Shayan Gharib, Konstantinos Drossos, Tuomas\n  Virtanen","title":"Representation Learning for Audio Privacy Preservation using Source\n  Separation and Robust Adversarial Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CR cs.LG eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Privacy preservation has long been a concern in smart acoustic monitoring\nsystems, where speech can be passively recorded along with a target signal in\nthe system's operating environment. In this study, we propose the integration\nof two commonly used approaches in privacy preservation: source separation and\nadversarial representation learning. The proposed system learns the latent\nrepresentation of audio recordings such that it prevents differentiating\nbetween speech and non-speech recordings. Initially, the source separation\nnetwork filters out some of the privacy-sensitive data, and during the\nadversarial learning process, the system will learn privacy-preserving\nrepresentation on the filtered signal. We demonstrate the effectiveness of our\nproposed method by comparing our method against systems without source\nseparation, without adversarial learning, and without both. Overall, our\nresults suggest that the proposed system can significantly improve speech\nprivacy preservation compared to that of using source separation or adversarial\nlearning solely while maintaining good performance in the acoustic monitoring\ntask.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:50:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Luong","Diep",""],["Tran","Minh",""],["Gharib","Shayan",""],["Drossos","Konstantinos",""],["Virtanen","Tuomas",""]]}
{"id":"2308.04961","submitter":"Hongjun Zhu","authors":"Hongjun Zhu, Shun Yuan, Xin Liu, Kuo Chen, Chaolong Jia and Ying Qian","title":"CasCIFF: A Cross-Domain Information Fusion Framework Tailored for\n  Cascade Prediction in Social Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Existing approaches for information cascade prediction fall into three main\ncategories: feature-driven methods, point process-based methods, and deep\nlearning-based methods. Among them, deep learning-based methods, characterized\nby its superior learning and representation capabilities, mitigates the\nshortcomings inherent of the other methods. However, current deep learning\nmethods still face several persistent challenges. In particular, accurate\nrepresentation of user attributes remains problematic due to factors such as\nfake followers and complex network configurations. Previous algorithms that\nfocus on the sequential order of user activations often neglect the rich\ninsights offered by activation timing. Furthermore, these techniques often fail\nto holistically integrate temporal and structural aspects, thus missing the\nnuanced propagation trends inherent in information cascades.To address these\nissues, we propose the Cross-Domain Information Fusion Framework (CasCIFF),\nwhich is tailored for information cascade prediction. This framework exploits\nmulti-hop neighborhood information to make user embeddings robust. When\nembedding cascades, the framework intentionally incorporates timestamps,\nendowing it with the ability to capture evolving patterns of information\ndiffusion. In particular, the CasCIFF seamlessly integrates the tasks of user\nclassification and cascade prediction into a consolidated framework, thereby\nallowing the extraction of common features that prove useful for all tasks, a\nstrategy anchored in the principles of multi-task learning.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:52:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhu","Hongjun",""],["Yuan","Shun",""],["Liu","Xin",""],["Chen","Kuo",""],["Jia","Chaolong",""],["Qian","Ying",""]]}
{"id":"2308.04962","submitter":"Mikhail Borovoi","authors":"Mikhail Borovoi and Willem A. de Graaf","title":"Computing Galois cohomology of a real linear algebraic group","comments":"41 pages, comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.AG math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let G be a linear algebraic group, not necessarily connected or reductive,\nover the field of real numbers R. We describe a method, implemented on\ncomputer, to find the first Galois cohomology set H^1(R,G). The output is a\nlist of 1-cocycles in G. Moreover, we have an implemented algorithm that, given\na 1-cocycle z in Z^1(R,G), finds the cocycle in the computed list to which z is\nequivalent, together with an element of G(C) realizing the equivalence.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:52:43 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 15:20:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Borovoi","Mikhail",""],["de Graaf","Willem A.",""]]}
{"id":"2308.04963","submitter":"Phillip Heiler","authors":"Simon Calmar Andersen, Louise Beuchert, Phillip Heiler, Helena Skyt\n  Nielsen","title":"A Guide to Impact Evaluation under Sample Selection and Missing Data:\n  Teacher's Aides and Adolescent Mental Health","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper is concerned with identification, estimation, and specification\ntesting in causal evaluation problems when data is selective and/or missing. We\nleverage recent advances in the literature on graphical methods to provide a\nunifying framework for guiding empirical practice. The approach integrates and\nconnects to prominent identification and testing strategies in the literature\non missing data, causal machine learning, panel data analysis, and more. We\ndemonstrate its utility in the context of identification and specification\ntesting in sample selection models and field experiments with attrition. We\nprovide a novel analysis of a large-scale cluster-randomized controlled\nteacher's aide trial in Danish schools at grade 6. Even with detailed\nadministrative data, the handling of missing data crucially affects broader\nconclusions about effects on mental health. Results suggest that teaching\nassistants provide an effective way of improving internalizing behavior for\nlarge parts of the student population.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:53:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Andersen","Simon Calmar",""],["Beuchert","Louise",""],["Heiler","Phillip",""],["Nielsen","Helena Skyt",""]]}
{"id":"2308.04964","submitter":"Biagio Montaruli","authors":"Biagio Montaruli, Luca Demetrio, Andrea Valenza, Luca Compagna, Davide\n  Ariu, Luca Piras, Davide Balzarotti, Battista Biggio","title":"Adversarial ModSecurity: Countering Adversarial SQL Injections with\n  Robust Machine Learning","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":"  ModSecurity is widely recognized as the standard open-source Web Application\nFirewall (WAF), maintained by the OWASP Foundation. It detects malicious\nrequests by matching them against the Core Rule Set, identifying well-known\nattack patterns. Each rule in the CRS is manually assigned a weight, based on\nthe severity of the corresponding attack, and a request is detected as\nmalicious if the sum of the weights of the firing rules exceeds a given\nthreshold. In this work, we show that this simple strategy is largely\nineffective for detecting SQL injection (SQLi) attacks, as it tends to block\nmany legitimate requests, while also being vulnerable to adversarial SQLi\nattacks, i.e., attacks intentionally manipulated to evade detection. To\novercome these issues, we design a robust machine learning model, named\nAdvModSec, which uses the CRS rules as input features, and it is trained to\ndetect adversarial SQLi attacks. Our experiments show that AdvModSec, being\ntrained on the traffic directed towards the protected web services, achieves a\nbetter trade-off between detection and false positive rates, improving the\ndetection rate of the vanilla version of ModSecurity with CRS by 21%. Moreover,\nour approach is able to improve its adversarial robustness against adversarial\nSQLi attacks by 42%, thereby taking a step forward towards building more robust\nand trustworthy WAFs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:58:03 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 09:08:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Montaruli","Biagio",""],["Demetrio","Luca",""],["Valenza","Andrea",""],["Compagna","Luca",""],["Ariu","Davide",""],["Piras","Luca",""],["Balzarotti","Davide",""],["Biggio","Battista",""]]}
{"id":"2308.04965","submitter":"Henrique Becker","authors":"Henrique Becker, Mateus Martin, Olinto Araujo, Luciana S. Buriol, and\n  Reinaldo Morabito","title":"Comparative analysis of mathematical formulations for the\n  two-dimensional guillotine cutting problem","comments":"23 pages, 7 tables, 3 figures","journal-ref":null,"doi":"10.1111/itor.13358","report-no":null,"categories":"math.OC cs.DM cs.DS cs.MS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  About ten years ago, a paper proposed the first integer linear programming\nformulation for the constrained two-dimensional guillotine cutting problem\n(with unlimited cutting stages). Since, six other formulations followed, five\nof them in the last two years. This spike of interest gave no opportunity for a\ncomprehensive comparison between the formulations. We review each formulation\nand compare their empirical results over instance datasets of the literature.\nWe adapt most formulations to allow for piece rotation. The possibility of\nadaptation was already predicted but not realized by the prior work. The\nresults show the dominance of pseudo-polynomial formulations until the point\ninstances become intractable by them, while more compact formulations keep\nachieving good primal solutions. Our study also reveals a small but consistent\nadvantage of the Gurobi solver over the CPLEX solver in our context; that the\nchoice of solver hardly benefits one formulation over another; and a mistake in\nthe generation of the T instances, which should have the same optima with or\nwithout guillotine cuts. Our study also proposes hybridising the most recent\nformulation with a prior formulation for a restricted version of the problem.\nThe hybridisations show a reduction of about 20% of the branch-and-bound time\nthanks to the symmetries broken by the hybridisation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:01:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Becker","Henrique",""],["Martin","Mateus",""],["Araujo","Olinto",""],["Buriol","Luciana S.",""],["Morabito","Reinaldo",""]]}
{"id":"2308.04966","submitter":"Burkhard Militzer","authors":"Sean M. Wahl, Daniel Thorngren, Tiger Lu, Burkhard Militzer","title":"Tidal Response and Shape of Hot Jupiters","comments":"17 pages, 13 figures, 3 tables","journal-ref":"Astrophysical J. 921 (2021) 105","doi":"10.3847/1538-4357/ac1a72","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the response of hot Jupiters to a static tidal perturbation using\nthe Concentric MacLaurin Spheroid (CMS) method. For strongly irradiated\nplanets, we first performed radiative transfer calculations to relate the\nplanet's equilibrium temperature, T_eq, to its interior entropy. We then\ndetermined the gravity harmonics, shape, moment of inertia, and the static Love\nnumbers for a range of two-layer interior models that assume a rocky core plus\na homogeneous and isentropic envelope composed of hydrogen, helium, and heavier\nelements. We identify general trends and then study HAT-P-13b, the WASP planets\n4b, 12b, 18b, 103b, and 121b, as well as Kepler-75b and CoRot-3b. We compute\nthe Love numbers, k_nm, and transit radius correction, Delta R, which we\ncompare with predictions in the literature. We find that the Love number, k_22,\nof tidally locked giant planets cannot exceed the value 0.6, and that the high\nT_eq consistent with strongly irradiated hot Jupiters tend %lead to further\nlower k_22. While most tidally locked planets are well described by a\nlinear-regime response of k_22 = 3 J_2/q_0 (where q_0 is the rotation parameter\nof the gravitational potential), for extreme cases such as WASP-12b, WASP-103b\nand WASP-121b, nonlinear effects can account for over 10% of the predicted\nk_22. k_22 values larger than 0.6, as they have been reported for planets\nWASP-4b and HAT-P13B, cannot result from a static tidal response without\nextremely rapid rotation, and thus are inconsistent with their expected\ntidally-locked state.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:07:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wahl","Sean M.",""],["Thorngren","Daniel",""],["Lu","Tiger",""],["Militzer","Burkhard",""]]}
{"id":"2308.04967","submitter":"Yulei Liao","authors":"Xiang Li, Yulei Liao, Pingbing Ming","title":"A pre-training deep learning method for simulating the large bending\n  deformation of bilayer plates","comments":"24 pages, 20 figures, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a deep learning based method for simulating the large bending\ndeformation of bilayer plates. Inspired by the greedy algorithm, we propose a\npre-training method on a series of nested domains, which can accelerate the\nconvergence of training and find the absolute minimizer more effectively. The\nproposed method exhibits the capability to converge to an absolute minimizer,\novercoming the limitation of gradient flow methods getting trapped in local\nminimizer basins. We showcase better performance for the relative energy errors\nand relative $L^2$-errors of the minimizer through several numerical\nexperiments. Furthermore, our method successfully maintains the $L^2$-norm of\nthe isometric constraint, leading to improved solution accuracy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:08:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Xiang",""],["Liao","Yulei",""],["Ming","Pingbing",""]]}
{"id":"2308.04968","submitter":"Aleksy Tralle","authors":"Aleksy Tralle","title":"Some topics in Sasakian geometry, a survey","comments":"21 pages. arXiv admin note: substantial text overlap with\n  arXiv:2007.08597","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the seminal book of Boyer and Galicki \"Sasakian Geometry\" the authors\nformulated a research program of studying topological properties and answering\nquestions about the existence of Sasakian structures. We survey recent progress\nin this topic.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:09:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tralle","Aleksy",""]]}
{"id":"2308.04969","submitter":"Majda Smole","authors":"Majda Smole, Miroslav Micic","title":"Statistical analysis of kicked black holes from TNG300 simulation","comments":"Accepted for publication in PASA","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Asymmetric emission of gravitational waves during mergers of black holes\n(BHs) produces a recoil kick, which can set a newly formed BH on a bound orbit\naround the center of its host galaxy, or even completely eject it. To study\nthis population of recoiling BHs we extract properties of galaxies with merging\nBHs from Illustris TNG300 simulation and then employ both analytical and\nnumerical techniques to model unresolved process of BH recoil.\n  This comparative analysis between analytical and numerical models shows that,\non cosmological scales, numerically modeled recoiling BHs have a higher escape\nprobability and predict a greater number of offset active galactic nuclei\n(AGN). BH escaped probability $>40~ \\%$ is expected in 25 $\\%$ of merger\nremnants in numerical models, compared to 8$\\%$ in analytical models. At the\nsame time, the predicted number of offset AGN at separations $>5$ kpc changes\nfrom 58 $\\%$ for numerical models to 3 $\\%$ for analytical models. Since BH\nejections in major merger remnants occur in non-virialized systems, static\nanalytical models cannot provide an accurate description. Thus we argue that\nnumerical models should be used to estimate the expected number density of\nescaped BHs and offset AGN.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:09:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Smole","Majda",""],["Micic","Miroslav",""]]}
{"id":"2308.04970","submitter":"Ali Al-Sharadqah","authors":"Ali Al-Sharadqah and Giulano Piga","title":"Fitting Concentric Elliptical Shapes Under General Model","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of fitting concentric ellipses is a vital problem in image\nprocessing, pattern recognition, and astronomy. Several methods have been\ndeveloped but all address very special cases. In this paper, this problem has\nbeen investigated under a more general setting, and two estimators for\nestimating the parameters have been proposed. Since both estimators are\nobtained iterative fashion, several numerical schemes are investigated and the\nbest initial guess is determined. Furthermore, the constraint Cram\\'{e} Rao\nlower bound for this problem is derived and it is compared with the variance of\neach estimator. Finally, our theory is assessed and validated by a series of\nnumerical experiments on both real and synthetic data.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:10:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Al-Sharadqah","Ali",""],["Piga","Giulano",""]]}
{"id":"2308.04971","submitter":"Max Ehre","authors":"Max Ehre, Iason Papaioannou, Daniel Straub","title":"Stein Variational Rare Event Simulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rare event simulation and rare event probability estimation are important\ntasks within the analysis of systems subject to uncertainty and randomness.\nSimultaneously, accurately estimating rare event probabilities is an inherently\ndifficult task that calls for dedicated tools and methods. One way to improve\nestimation efficiency on difficult rare event estimation problems is to\nleverage gradients of the computational model representing the system in\nconsideration, e.g., to explore the rare event faster and more reliably. We\npresent a novel approach for estimating rare event probabilities using such\nmodel gradients by drawing on a technique to generate samples from\nnon-normalized posterior distributions in Bayesian inference - the Stein\nvariational gradient descent. We propagate samples generated from a tractable\ninput distribution towards a near-optimal rare event importance sampling\ndistribution by exploiting a similarity of the latter with Bayesian posterior\ndistributions. Sample propagation takes the shape of passing samples through a\nsequence of invertible transforms such that their densities can be tracked and\nused to construct an unbiased importance sampling estimate of the rare event\nprobability - the Stein variational rare event estimator. We discuss settings\nand parametric choices of the algorithm and suggest a method for balancing\nconvergence speed with stability by choosing the step width or base learning\nrate adaptively. We analyze the method's performance on several analytical test\nfunctions and two engineering examples in low to high stochastic dimensions ($d\n= 2 - 869$) and find that it consistently outperforms other state-of-the-art\ngradient-based rare event simulation methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:10:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ehre","Max",""],["Papaioannou","Iason",""],["Straub","Daniel",""]]}
{"id":"2308.04972","submitter":"Brooke Lampe","authors":"Brooke Lampe, Weizhi Meng","title":"can-train-and-test: A Curated CAN Dataset for Automotive Intrusion\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When it comes to in-vehicle networks (IVNs), the controller area network --\nCAN -- bus dominates the market; automobiles manufactured and sold around the\nworld depend on the CAN bus for safety-critical communications between various\ncomponents of the vehicle (e.g., the engine, the transmission, the steering\ncolumn). Unfortunately, the CAN bus is inherently insecure; in fact, it\ncompletely lacks controls such as authentication, authorization, and\nconfidentiality (i.e., encryption). Therefore, researchers have travailed to\ndevelop automotive security enhancements. The automotive intrusion detection\nsystem (IDS) is especially popular in the literature -- due to its relatively\nlow cost in terms of money, resource utilization, and implementation effort.\nThat said, developing and evaluating an automotive IDS is often challenging; if\nresearchers do not have access to a test vehicle, then they are forced to\ndepend on publicly available CAN data -- which is not without limitations. Lack\nof access to adequate CAN data, then, becomes a barrier to entry into\nautomotive security research.\n  We seek to lower that barrier to entry by introducing a new CAN dataset to\nfacilitate the development and evaluation of automotive IDSs. Our dataset,\ndubbed can-train-and-test, provides CAN data from four different vehicles\nproduced by two different manufacturers. The attack captures for each vehicle\nmodel are equivalent, enabling researchers to assess the ability of a given IDS\nto generalize to different vehicle models and even different vehicle\nmanufacturers. Our dataset contains replayable .log files as well as labeled\nand unlabeled .csv files, thereby meeting a variety of development and\nevaluation needs. Furthermore, can-train-and-test offers nine unique attacks,\nranging from denial of service (DoS) to gear spoofing to standstill...\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:14:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lampe","Brooke",""],["Meng","Weizhi",""]]}
{"id":"2308.04973","submitter":"Allister Loder","authors":"Allister Loder and Fabienne Cantner and Victoria Dahmen and Klaus\n  Bogenberger","title":"The Mobilit\\\"at.Leben Study: a Year-Long Mobility-Tracking Panel","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Mobilit\\\"at.Leben study investigated travel behavior effects of a natural\nexperiment in Germany. In response to the 2022 cost-of-living crisis, two\npolicy measures to reduce travel costs for the population in June, July, and\nAugust 2022 were introduced: a fuel excise tax cut and almost fare-free public\ntransport with the so-called 9-Euro-Ticket. The announcement of a successor\nticket to the 9-Euro-Ticket, the so-called Deutschlandticket, led to the\nimmediate decision to continue the study. The Mobilit\\\"at.Leben study has two\nperiods, the 9-Euro-Ticket period and the Deutschlandticket period, and\ncomprises two elements: several questionnaires and a smartphone-based passive\nwaypoint tracking. The entire duration of the study was almost thirteen months.\n  In this paper, we report on the study design, the recruitment strategy, the\nstudy participation in the survey, and the tracking parts, and we share our\nexperience in conducting such large-scale panel studies. Overall, 3,080 people\nregistered for our study of which 1,420 decided to use the smartphone tracking\napp. While the relevant questionnaires in both phases have been completed by\n818 participants, we have 170 study participants who completed the tracking in\nboth phases and all relevant questionnaires. We find that providing a study\ncompensation increases participation performance. It can be concluded that\nconducting year-long panel studies is possible, providing rich information on\nthe heterogeneity in travel behavior between and within travelers.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:16:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Loder","Allister",""],["Cantner","Fabienne",""],["Dahmen","Victoria",""],["Bogenberger","Klaus",""]]}
{"id":"2308.04974","submitter":"Xiao-Xiao Zhang","authors":"Xin Cong, Parisa Ali Mohammadi, Mingyang Zheng, Kenji Watanabe,\n  Takashi Taniguchi, Daniel Rhodes, Xiao-Xiao Zhang","title":"Interplay of valley polarized dark trion and dark exciton-polaron in\n  monolayer WSe2","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":"  The interactions between charges and excitons involve complex many-body\ninteractions at high densities. The exciton-polaron model has been adopted to\nunderstand the Fermi sea screening of charged excitons in monolayer transition\nmetal dichalcogenides. The results provide good agreement with absorption\nmeasurements, which are dominated by dilute bright exciton responses. Here we\ninvestigate the Fermi sea dressing of spin-forbidden dark excitons in monolayer\nWSe2. With a Zeeman field, the valley-polarized dark excitons show distinct\np-doping dependence in photoluminescence when the carriers reach a critical\ndensity. This density can be interpreted as the onset of strongly modified\nFermi sea interactions and shifts with increasing exciton density. Through\nvalley-selective excitation and dynamics measurements, we also infer an\nintervalley coupling between the dark trions and exciton-polarons mediated by\nthe many-body interactions. Our results reveal the evolution of Fermi sea\nscreening with increasing exciton density and the impacts of polaron-polaron\ninteractions, which lay the foundation for understanding electronic\ncorrelations and many-body interactions in 2D systems.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:16:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cong","Xin",""],["Mohammadi","Parisa Ali",""],["Zheng","Mingyang",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Rhodes","Daniel",""],["Zhang","Xiao-Xiao",""]]}
{"id":"2308.04975","submitter":"Sanket Biswas","authors":"Sanket Biswas, Harshita Tiwari, Sujata Verma, and Kamlesh Kumari","title":"High Accuracy Determination of Rheological Properties of Drilling Fluids\n  Using the Marsh Funnel","comments":"57 pages, 1 figure, and 10 tables. Funding for this research work was\n  provided through the IIChE Research Grant for the academic year 2022-23,\n  granted by the Indian Institute of Chemical Engineers (IIChE)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Efficient and safe drilling operations require precise determination of\nrheological properties in drilling fluids, encompassing dynamic viscosity for\nNewtonian fluids, and apparent viscosity, plastic viscosity, and yield point\nfor non-Newtonian fluids. Conventional viscometers like vibrating wire, ZNN-D6,\nand Fann-35 offer high accuracy but are limited by cost and complexity in\nsmall-scale industries and labs. To address this, our research presents a novel\nmathematical model based on the Herschel-Bulkley model, aiming to accurately\ncharacterise drilling fluids' rheological properties using the Marsh funnel as\nan alternative device -- an economical, operator-friendly, and\npower-independent equipment. Drawing inspiration from seminal works by Li et\nal. (2020), Sedaghat (2017), and Guria et al. (2013), this innovative framework\nestablishes a universal inverse linear relationship between a fluid's flow\nfactor and final discharge time. For any fluid, it utilises its density and\nflow factor (or final discharge time) to determine all its rheological\nproperties. Specifically, it evaluates dynamic viscosity for Newtonian fluids,\napparent viscosity, plastic viscosity, and yield point for weighted\nnon-Newtonian fluids, and apparent viscosity for non-weighted non-Newtonian\nfluids, with average systematic errors (against Fann-35 measurements) of 0.39%,\n3.52%, 2.17%, 18.38%, and 5.84%, respectively, surpassing the precision of\nalternative mathematical models found in the aforementioned literature.\nFurthermore, while our framework's precision in plastic viscosity and yield\npoint assessment of non-weighted non-Newtonian fluids slightly lags behind the\nframework of Li et al. (2020), it outperforms the model of Sedaghat (2017). In\nconclusion, despite minor limitations, our proposed mathematical model holds\nhuge promise for drilling fluid rheology in petroleum, drilling, and related\nindustries.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:16:47 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 18:23:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Biswas","Sanket",""],["Tiwari","Harshita",""],["Verma","Sujata",""],["Kumari","Kamlesh",""]]}
{"id":"2308.04976","submitter":"Changming Yue Doctor","authors":"Changming Yue, Viktor Christiansson, Philipp Werner","title":"Correlated electronic structure of Pb$_{10-x}$Cu$_x$(PO4)$_6$O","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recently, above-room temperature superconductivity was reported in the Cu\ndoped lead apatite Pb$_{10-x}$Cu$_x$(PO4)$_6$O, dubbed LK-99. By relaxing the\nstructure with Cu substitution, we derive a four-band low-energy model with two\n3/4 filled bands of predominantly Cu $d_{xz}$ and $d_{yz}$ character and two\nfilled O $p_x$ and $p_y$ bands. This model is further downfolded to a two-band\nCu-$d_{xz/yz}$ model. Using {\\it ab-initio} derived interaction parameters, we\nperform dynamical mean field theory calculations to determine the correlated\nelectronic structure in the normal state. These calculations yield a Mott\ninsulator at $x=1$ and a strongly correlated non-Fermi liquid metal upon\ndoping. The very large interaction versus bandwidth ratio $U/W\\approx 30$-$50$\nand the local moment paramagnetic behavior in the relevant filling regime are\nhard to reconcile with diamagnetism and high-temperature superconductivity.\nHence, our calculations suggest that this behavior should come from a component\nwith a different stoichiometry.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:21:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yue","Changming",""],["Christiansson","Viktor",""],["Werner","Philipp",""]]}
{"id":"2308.04977","submitter":"Shota Shigetomi","authors":"Shizuo Kaji, Kenji Kajiwara, Shota Shigetomi","title":"An explicit construction of Kaleidocycles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI cs.RO math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We model a family of closed kinematic chains, known as Kaleidocycles, with\nthe theory of discrete spatial curves. By leveraging the connection between the\ndeformation of discrete curves and the semi-discrete integrable systems, we\ndescribe the motion of a Kaleidocycle by elliptic theta functions. This study\nshowcases an interesting example in which an integrable system generates an\norbit in the space of the real solutions of polynomial equations defined by\ngeometric constraints.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:22:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kaji","Shizuo",""],["Kajiwara","Kenji",""],["Shigetomi","Shota",""]]}
{"id":"2308.04978","submitter":"David Robinson","authors":"David Robinson, Adelaide Robinson, Lily Akrapongpisak","title":"Transferable Models for Bioacoustics with Human Language Supervision","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SD eess.AS q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Passive acoustic monitoring offers a scalable, non-invasive method for\ntracking global biodiversity and anthropogenic impacts on species. Although\ndeep learning has become a vital tool for processing this data, current models\nare inflexible, typically cover only a handful of species, and are limited by\ndata scarcity. In this work, we propose BioLingual, a new model for\nbioacoustics based on contrastive language-audio pretraining. We first\naggregate bioacoustic archives into a language-audio dataset, called\nAnimalSpeak, with over a million audio-caption pairs holding information on\nspecies, vocalization context, and animal behavior. After training on this\ndataset to connect language and audio representations, our model can identify\nover a thousand species' calls across taxa, complete bioacoustic tasks\nzero-shot, and retrieve animal vocalization recordings from natural text\nqueries. When fine-tuned, BioLingual sets a new state-of-the-art on nine tasks\nin the Benchmark of Animal Sounds. Given its broad taxa coverage and ability to\nbe flexibly queried in human language, we believe this model opens new\nparadigms in ecological monitoring and research, including free-text search on\nthe world's acoustic monitoring archives. We open-source our models, dataset,\nand code.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:22:18 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Robinson","David",""],["Robinson","Adelaide",""],["Akrapongpisak","Lily",""]]}
{"id":"2308.04979","submitter":"Amir Mafi","authors":"Mozhgan Koolani and Amir Mafi","title":"A remark on sequentially Cohen-Macaulay monomial ideals","comments":"6 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $R=K[x_1,\\ldots,x_n]$ be the polynomial ring in $n$ variables over a\nfield $K$. We show that if $G$ is a connected graph with a basic $5$-cycle $C$,\nthen $G$ is a sequentially Cohen-Macaulay graph if and only if there exists a\nshedding vertex $x$ of $C$ such that $G\\setminus x$ and $G\\setminus N[x]$ are\nsequentially Cohen-Macaulay graphs. Furthermore, we study the sequentially\nCohen-Macaulay and Castelnuovo-Mumford regularity of square-free monomial\nideals in some special cases.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:26:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Koolani","Mozhgan",""],["Mafi","Amir",""]]}
{"id":"2308.04980","submitter":"Fernando Cruz Aguirre","authors":"F. Cruz Aguirre, K. France, N. Nell, N. Kruczek, B. Fleming, P. C.\n  Hinton, S. Ulrich, P. R. Behr","title":"The Radiation Environments of Middle-Aged F-Type Stars","comments":"22 Pages, 13 Figures, 3 Tables, to be published in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Far ultraviolet (FUV) emission lines from dwarf stars are important driving\nsources of photochemistry in planetary atmospheres. Properly interpreting\nspectral features of planetary atmospheres critically depends on the emission\nof its host star. While the spectral energy distributions (SEDs) of K- and\nM-type stars have been extensively characterized by previous observational\nprograms, the full X-ray to infrared SED of F-type stars has not been assembled\nto support atmospheric modeling. On the second flight of the Suborbital Imaging\nSpectrograph for Transition-region Irradiance from Nearby Exoplanet host stars\n(SISTINE-2) rocket-borne spectrograph, we successfully captured the FUV\nspectrum of Procyon A (F5 IV-V) and made the first simultaneous observation of\nseveral emission features across the FUV bandpass (1010 - 1270 and 1300 - 1565\n\\r{A}) of any cool star. We combine flight data with stellar models and\narchival observations to develop the first SED of a mid-F star. We model the\nresponse of a modern Earth-like exoplanet's upper atmosphere to the heightened\nX-ray and extreme ultraviolet radiation within the habitable zone of Procyon A.\nThese models indicate that this planet would not experience significant\natmospheric escape. We simulate observations of the Ly$\\alpha$ transit signal\nof this exoplanet with the Hubble Space Telescope (HST) and the Habitable\nWorlds Observatory (HWO). While marginally detectable with HST, we find that H\nI Ly$\\alpha$ transits of potentially habitable exoplanets orbiting high radial\nvelocity F-type stars could be observed with HWO for targets up to 150 pc away.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:27:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Aguirre","F. Cruz",""],["France","K.",""],["Nell","N.",""],["Kruczek","N.",""],["Fleming","B.",""],["Hinton","P. C.",""],["Ulrich","S.",""],["Behr","P. R.",""]]}
{"id":"2308.04981","submitter":"Arnaud Demortiere Dr.","authors":"Kevyn Gallegos Moncayo, Nicolas Folastre, Milan Toledo, H\\'el\\`ene\n  Tonnoir, Fran\\c{c}ois Rabuel, Gr\\'egory Gachot, Da Huo, Arnaud Demorti\\`ere","title":"Coupling liquid electrochemical TEM and mass-spectrometry to investigate\n  electrochemical reactions occurring in a Na-ion battery anode","comments":"8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this study, we propose a novel approach for investigating the formation of\nsolid electrolyte interphase (SEI) in Na-ion batteries (NIB) through the\ncoupling of in situ liquid electrochemical transmission electron microscopy\n(ec-TEM) and gas-chromatography mass-spectrometry (GC/MS). To optimize this\ncoupling, we conducted experiments on the sodiation of hard carbon materials\n(HC) using two different setups: in situ ec-TEM holder (operating in an \"anode\nfree\" configuration, referred to as $\\mu$-battery) and ex-situ setup (Swagelok\nbattery configuration). In the in situ TEM experiments, we intentionally\ndegraded the electrolyte (NP30) using cyclic voltammetry (CV) and analyzed the\nrecovered liquid product using GC/MS, while the solid product ($\\mu$-chip) was\nanalyzed using TEM techniques in a post-mortem analysis. The ex-situ\nexperiments served as a reference to observe and detect the insertion of Na+\nions in the HC, SEI size (389 nm), SEI composition (P, Na, F, and O), and Na\nplating. Furthermore, the TEM analysis revealed a cyclability limitation in our\nin situ TEM system. This issue appears to be caused by the deposition of Na in\nthe form of a \"foam\" structure, resulting from the gas release during the\nreaction of Na with DMC/EC electrolyte. The foam structure, subsequently\ntransforms into a second SEI, is electrochemically inactive and reduce the\ncyclability of the battery. Overall, our results demonstrate the powerful\nsynergy achieved by coupling in situ ec-TEM and GC/MS techniques, which\nprovides a deeper understanding of the dynamics and behavior of SEI.\nConsequently, this knowledge contributes to the advancement of the new\ngeneration of NIB.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:29:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Moncayo","Kevyn Gallegos",""],["Folastre","Nicolas",""],["Toledo","Milan",""],["Tonnoir","H\u00e9l\u00e8ne",""],["Rabuel","Fran\u00e7ois",""],["Gachot","Gr\u00e9gory",""],["Huo","Da",""],["Demorti\u00e8re","Arnaud",""]]}
{"id":"2308.04982","submitter":"Shivam Sahni","authors":"Shivam Sahni, Harsh Patel","title":"Exploring Multilingual Text Data Distillation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the rise of deep learning, large datasets and complex models have become\ncommon, requiring significant computing power. To address this, data\ndistillation has emerged as a technique to quickly train models with lower\nmemory and time requirements. However, data distillation on text-based datasets\nhasn't been explored much because of the challenges rising due to its discrete\nnature. Additionally, existing dataset distillation methods often struggle to\ngeneralize to new architectures. In the paper, we propose several data\ndistillation techniques for multilingual text classification datasets using\nlanguage-model-based learning methods. We conduct experiments to analyze their\nperformance in terms of classification strength, and cross-architecture\ngeneralization. Furthermore, we investigate the language-specific fairness of\nthe data summaries generated by these methods. Our approach builds upon\nexisting techniques, enhancing cross-architecture generalization in the text\ndata distillation domain.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:31:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sahni","Shivam",""],["Patel","Harsh",""]]}
{"id":"2308.04983","submitter":"Lorena Pohl","authors":"Lorena Pohl (Universit\\\"at Bonn, Germany) and Barbara Niethammer\n  (Universit\\\"at Bonn, Germany)","title":"A Becker-D\\\"oring type model for cell polarization","comments":"24 pages","journal-ref":"J Stat Phys 190, 133 (2023)","doi":"10.1007/s10955-023-03144-0","report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a model for cell polarization based on the Becker-D\\\"oring\nequations with the first coagulation coefficient equal to zero. We show\nconvergence to equilibrium for power-law coagulation and fragmentation rates\nand obtain a loss of mass in the limit $t \\rightarrow \\infty$ depending on the\ninitial mass and the relative strengths of the coagulation and fragmentation\nprocesses. In the case of linear rates, we further show that large clusters\nevolve in a self-similar manner at large times by comparing limits of\nappropriately rescaled solutions in different spaces.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:32:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Pohl","Lorena","","Universit\u00e4t Bonn, Germany"],["Niethammer","Barbara","","Universit\u00e4t Bonn, Germany"]]}
{"id":"2308.04984","submitter":"Alexander Reshetnyak","authors":"Alexander A. Reshetnyak and Varvara V. Shamshutdinova","title":"Towards the Distribution of a Class of Polycrystalline Materials with an\n  Equilibrium Defect Structure by Grain Diameters: Temperature Behavior of the\n  Yield Strength","comments":"8 pages, 1 figure, 2 tables, contribution to the Proceedings of the\n  International Conference Physical mesomechanics of condensed matter: Physical\n  principles of multiscale structure formation and the mechanisms of nonlinear\n  behavior, 5-8, September, 2022, Tomsk, Russia","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We modify a theory of flow stress introduced in\n[arXiv:1803.08247[cond-mat.mtrl-sci]], [arXiv:1809.03628[cond-mat.mes-hall]],\n[arXiv:1908.09338[cond-mat.mtrl-sci]] for a class of polycrystalline materials\nwith equilibrium and quasy-equilibrium defect structure under quasi-static\nplastic deformations. We suggest, in addition to modified Bose-Einstein\ndistribution, Maxwell-like distribution law for defects (within\ndislocation-disclination mechanism) in the grains of polycrystalline samples\nwith respect to grain's diameter. Polycrystalline aggregates are considered\nwithin single- and two-phase models that correspond to the presence of\ncrystalline and grain-boundary (porous) phases. The scalar dislocation density\nis derived. Analytic and graphic forms of the generalized Hall-Petch relations\nfor yield strength are produced for single-mode samples with BCC ($\\alpha$-Fe),\nFCC (Cu, Al, Ni) and HCP ($\\alpha$-Ti, Zr) crystal lattices at T=300 K with\ndifferent values of the grain-boundary phase. We derived new form of the\ntemperature-dimensional effect. The values of extremal grain and maximum of\nyield strength are decreased with raising the temperature in accordance with\nexperiments up to NC region.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:33:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Reshetnyak","Alexander A.",""],["Shamshutdinova","Varvara V.",""]]}
{"id":"2308.04985","submitter":"Simon Halvdansson","authors":"Hans G. Feichtinger, Simon Halvdansson, Franz Luef","title":"Measure-operator convolutions and applications to mixed-state Gabor\n  multipliers","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For the Weyl-Heisenberg group, convolutions between functions and operators\nwere defined by Werner as a part of a framework called quantum harmonic\nanalysis. We show how recent results by Feichtinger can be used to extend this\ndefinition to include convolutions between measures and operators. Many\nproperties of function-operator convolutions carry over to this setting and\nallow us to prove novel results on the distribution of eigenvalues of\nmixed-state Gabor multipliers and derive a version of the Berezin-Lieb\ninequality for lattices. New results on the continuity of Gabor multipliers\nwith respect to lattice parameters, masks and windows as well as their ability\nto approximate localization operators are also derived using this framework.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:37:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Feichtinger","Hans G.",""],["Halvdansson","Simon",""],["Luef","Franz",""]]}
{"id":"2308.04986","submitter":"Burkhard Militzer","authors":"Burkhard Militzer, William B. Hubbard","title":"Relation of Gravity, Winds, and the Moment of Inertia of Jupiter and\n  Saturn","comments":"21 pages, 19 figures, 3 tables","journal-ref":"Planet. Sci. J. 4 (2023) 95","doi":"10.3847/PSJ/acd2cd","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the relationship of zonal gravity coefficients, J_2n, zonal winds,\nand axial moment of inertia (MoI) by constructing models for the interiors of\ngiant planets. We employ the nonperturbative concentric Maclaurin spheroid\n(CMS) method to construct both physical (realistic equation of state and\nbarotropes) and abstract (small number of constant-density spheroids) interior\nmodels. We find that accurate gravity measurements of Jupiter's and Saturn's\nJ_2, J_4, and J_6 by Juno and Cassini spacecrafts do not uniquely determine the\nMoI of either planet but do constrain it to better than 1%. Zonal winds (or\ndifferential rotation, DR) then emerge as the leading source of uncertainty.\nFor Saturn, they are predicted to decrease the MoI by 0.4% because they reach a\ndepth of ~9000 km while on Jupiter, they appear to reach only ~3000 km. We thus\npredict DR to affect Jupiter's MoI by only 0.01%, too small by one order of\nmagnitude to be detectable by the Juno spacecraft. We find winds primarily\naffect the MoI indirectly via the gravity harmonic J_6 while direct\ncontributions are much smaller because the effects of pro- and retrograde winds\ncancel. DR contributes +6% and -0.8% to Saturn's and Jupiter's J_6 value,\nrespectively. This changes the J_6 contribution that comes from the uniformly\nrotating bulk of the planet that correlates most strongly with the predicted\nMoI. With our physical models, we predict Jupiter's MoI to be 0.26393+-0.00001.\nFor Saturn, we predict 0.2181+-0.0002, assuming a rotation period of 10:33:34 h\nthat matches the observed polar radius.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:39:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Militzer","Burkhard",""],["Hubbard","William B.",""]]}
{"id":"2308.04987","submitter":"Chun-Hung Chao","authors":"Chun-Hung Chao and Marc Niethammer","title":"Self-supervised Landmark Learning with Deformation Reconstruction and\n  Cross-subject Consistency Objectives","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A Point Distribution Model (PDM) is the basis of a Statistical Shape Model\n(SSM) that relies on a set of landmark points to represent a shape and\ncharacterize the shape variation. In this work, we present a self-supervised\napproach to extract landmark points from a given registration model for the\nPDMs. Based on the assumption that the landmarks are the points that have the\nmost influence on registration, existing works learn a point-based registration\nmodel with a small number of points to estimate the landmark points that\ninfluence the deformation the most. However, such approaches assume that the\ndeformation can be captured by point-based registration and quality landmarks\ncan be learned solely with the deformation capturing objective. We argue that\ndata with complicated deformations can not easily be modeled with point-based\nregistration when only a limited number of points is used to extract\ninfluential landmark points. Further, landmark consistency is not assured in\nexisting approaches In contrast, we propose to extract landmarks based on a\ngiven registration model, which is tailored for the target data, so we can\nobtain more accurate correspondences. Secondly, to establish the anatomical\nconsistency of the predicted landmarks, we introduce a landmark discovery loss\nto explicitly encourage the model to predict the landmarks that are\nanatomically consistent across subjects. We conduct experiments on an\nosteoarthritis progression prediction task and show our method outperforms\nexisting image-based and point-based approaches.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:40:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chao","Chun-Hung",""],["Niethammer","Marc",""]]}
{"id":"2308.04988","submitter":"Colin Bredenberg","authors":"Colin Bredenberg, Cristina Savin","title":"Desiderata for normative models of synaptic plasticity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Normative models of synaptic plasticity use a combination of mathematics and\ncomputational simulations to arrive at predictions of behavioral and\nnetwork-level adaptive phenomena. In recent years, there has been an explosion\nof theoretical work on these models, but experimental confirmation is\nrelatively limited. In this review, we organize work on normative plasticity\nmodels in terms of a set of desiderata which, when satisfied, are designed to\nguarantee that a model has a clear link between plasticity and adaptive\nbehavior, consistency with known biological evidence about neural plasticity,\nand specific testable predictions. We then discuss how new models have begun to\nimprove on these criteria and suggest avenues for further development. As\nprototypes, we provide detailed analyses of two specific models -- REINFORCE\nand the Wake-Sleep algorithm. We provide a conceptual guide to help develop\nneural learning theories that are precise, powerful, and experimentally\ntestable.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:42:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bredenberg","Colin",""],["Savin","Cristina",""]]}
{"id":"2308.04989","submitter":"Artur Hakobyan","authors":"A. A. Hakobyan, A. G. Karapetyan, L. V. Barkhudaryan","title":"Constraining Supernova Ia Progenitors by their Locations in Host\n  Galactic Disc","comments":"10 pages, 5 figures, 3 tables. Paper presented at the Fifth Zeldovich\n  meeting, an international conference in honor of Ya. B. Zeldovich held in\n  Yerevan, Armenia on June 12-16, 2023. Submitted to Astronomy Reports for\n  publication","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Among the diverse progenitor channels leading to Type Ia Supernovae (SNe Ia),\nthere are explosions originating from white dwarfs with sub-Chandrasekhar\nmasses. These white dwarfs undergo detonation and explosion triggered by\nprimary detonation in the helium shell, which has been accreted from a\ncompanion star. The double-detonation model predicts a correlation between the\nage of the progenitor system and the near peak brightness: the younger the\nexploding progenitors, the brighter the SNe. In this paper, we present our\nrecent achievements on the study of SNe Ia properties in different locations\nwithin host galactic discs and the estimation of their progenitor population\nages. Observationally, we confirm the validity of the anticipated correlation\nbetween the SN photometry and the age of their progenitors.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:43:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hakobyan","A. A.",""],["Karapetyan","A. G.",""],["Barkhudaryan","L. V.",""]]}
{"id":"2308.04990","submitter":"Bo Zhang","authors":"Bo Zhang and Jiacheng Sui and Li Niu","title":"Foreground Object Search by Distilling Composite Image Feature","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":"  Foreground object search (FOS) aims to find compatible foreground objects for\na given background image, producing realistic composite image. We observe that\ncompetitive retrieval performance could be achieved by using a discriminator to\npredict the compatibility of composite image, but this approach has\nunaffordable time cost. To this end, we propose a novel FOS method via\ndistilling composite feature (DiscoFOS). Specifically, the abovementioned\ndiscriminator serves as teacher network. The student network employs two\nencoders to extract foreground feature and background feature. Their\ninteraction output is enforced to match the composite image feature from the\nteacher network. Additionally, previous works did not release their datasets,\nso we contribute two datasets for FOS task: S-FOSD dataset with synthetic\ncomposite images and R-FOSD dataset with real composite images. Extensive\nexperiments on our two datasets demonstrate the superiority of the proposed\nmethod over previous approaches. The dataset and code are available at\nhttps://github.com/bcmi/Foreground-Object-Search-Dataset-FOSD.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:43:10 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Bo",""],["Sui","Jiacheng",""],["Niu","Li",""]]}
{"id":"2308.04991","submitter":"Giulia Janzen","authors":"Giulia Janzen and Liesbeth M. C. Janssen","title":"Rejuvenation and memory effects in active glasses induced by thermal and\n  active cycling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has recently been shown that thermal active glasses can display physical\naging behavior comparable to that of passive glasses, although there are some\nnotable distinctions due to the intrinsic non-equilibrium nature of active\nmatter. The question whether active disordered materials can also exhibit\nrejuvenation and memory effects, akin to the phenomenology of e.g.\\ spin\nglasses, has thus far remained unexplored. Here we address this question by\nnumerical simulations of active glasses composed of active Brownian particles\nthat are subjected to a thermal or active cycling protocol. We find that an\nactive system undergoing thermal cycling indeed shows rejuvenation and memory\neffects, with the strength of rejuvenation depending on the persistence time.\nIn contrast, however, a passive Brownian system subjected to the same thermal\ncycle lacks the rejuvenation effect. We attribute this to the enhanced motility\nof active particles, which enables them to escape from their cages and restart\naging at the new temperature, thus rejuvenating the material. Finally, we also\ndemonstrate that both rejuvenation and memory effects can be induced by an\nactivity cycle which quenches the material from an active to passive glass and\nback, providing a unique means to rejuvenate active matter.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:45:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Janzen","Giulia",""],["Janssen","Liesbeth M. C.",""]]}
{"id":"2308.04992","submitter":"Jiaan Wang","authors":"Jingdan Zhang, Jiaan Wang, Xiaodan Wang, Zhixu Li, Yanghua Xiao","title":"AspectMMKG: A Multi-modal Knowledge Graph with Aspect-aware Entities","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modal knowledge graphs (MMKGs) combine different modal data (e.g., text\nand image) for a comprehensive understanding of entities. Despite the recent\nprogress of large-scale MMKGs, existing MMKGs neglect the multi-aspect nature\nof entities, limiting the ability to comprehend entities from various\nperspectives. In this paper, we construct AspectMMKG, the first MMKG with\naspect-related images by matching images to different entity aspects.\nSpecifically, we collect aspect-related images from a knowledge base, and\nfurther extract aspect-related sentences from the knowledge base as queries to\nretrieve a large number of aspect-related images via an online image search\nengine. Finally, AspectMMKG contains 2,380 entities, 18,139 entity aspects, and\n645,383 aspect-related images. We demonstrate the usability of AspectMMKG in\nentity aspect linking (EAL) downstream task and show that previous EAL models\nachieve a new state-of-the-art performance with the help of AspectMMKG. To\nfacilitate the research on aspect-related MMKG, we further propose an\naspect-related image retrieval (AIR) model, that aims to correct and expand\naspect-related images in AspectMMKG. We train an AIR model to learn the\nrelationship between entity image and entity aspect-related images by\nincorporating entity image, aspect, and aspect image information. Experimental\nresults indicate that the AIR model could retrieve suitable images for a given\nentity w.r.t different aspects.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:45:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhang","Jingdan",""],["Wang","Jiaan",""],["Wang","Xiaodan",""],["Li","Zhixu",""],["Xiao","Yanghua",""]]}
{"id":"2308.04993","submitter":"Hao Li","authors":"Hao Li","title":"Quasi-lisse vertex (super)algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the twisted arc spaces and the vertex superalgebras. We obtain new\nfiniteness conditions for the convergence of genus-0 and genus-1 $n$-point\ncorrelation functions of quasi-lisse vertex (super)algebras.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:46:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Hao",""]]}
{"id":"2308.04994","submitter":"Tomas Ort\\'in","authors":"Romina Ballesteros and Tom\\'as Ort\\'in","title":"Hairy black holes, scalar charges and extended thermodynamics","comments":"author name corrected","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-088","categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the use of the recently defined scalar charge which satisfies a\nGauss law in stationary spacetimes, in the context of theories with a scalar\npotential. We find new conditions that this potential has to satisfy in order\nto allow for static, asymptotically-flat black-hole solutions with regular\nhorizons and non-trivial scalar field. These conditions are equivalent to some\nof the known ``no-hair'' theorems (such as Bekenstein's). We study the extended\nthermodynamics of these systems, deriving a first law and a Smarr formula. As\nan example, we study the Anabal\\'on-Oliva hairy black hole\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:46:22 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 10:00:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ballesteros","Romina",""],["Ort\u00edn","Tom\u00e1s",""]]}
{"id":"2308.04995","submitter":"Fadi Boutros","authors":"Fadi Boutros, Jonas Henry Grebe, Arjan Kuijper, Naser Damer","title":"IDiff-Face: Synthetic-based Face Recognition through Fizzy\n  Identity-Conditioned Diffusion Models","comments":"Accepted at ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The availability of large-scale authentic face databases has been crucial to\nthe significant advances made in face recognition research over the past\ndecade. However, legal and ethical concerns led to the recent retraction of\nmany of these databases by their creators, raising questions about the\ncontinuity of future face recognition research without one of its key\nresources. Synthetic datasets have emerged as a promising alternative to\nprivacy-sensitive authentic data for face recognition development. However,\nrecent synthetic datasets that are used to train face recognition models suffer\neither from limitations in intra-class diversity or cross-class (identity)\ndiscrimination, leading to less optimal accuracies, far away from the\naccuracies achieved by models trained on authentic data. This paper targets\nthis issue by proposing IDiff-Face, a novel approach based on conditional\nlatent diffusion models for synthetic identity generation with realistic\nidentity variations for face recognition training. Through extensive\nevaluations, our proposed synthetic-based face recognition approach pushed the\nlimits of state-of-the-art performances, achieving, for example, 98.00%\naccuracy on the Labeled Faces in the Wild (LFW) benchmark, far ahead from the\nrecent synthetic-based face recognition solutions with 95.40% and bridging the\ngap to authentic-based face recognition with 99.82% accuracy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:48:31 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 10:43:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Boutros","Fadi",""],["Grebe","Jonas Henry",""],["Kuijper","Arjan",""],["Damer","Naser",""]]}
{"id":"2308.04996","submitter":"Alexander Hvatov","authors":"Elizaveta Ivanchik and Alexander Hvatov","title":"Directed differential equation discovery using modified mutation and\n  cross-over operators","comments":"IEEECEC 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The discovery of equations with knowledge of the process origin is a tempting\nprospect. However, most equation discovery tools rely on gradient methods,\nwhich offer limited control over parameters. An alternative approach is the\nevolutionary equation discovery, which allows modification of almost every\noptimization stage. In this paper, we examine the modifications that can be\nintroduced into the evolutionary operators of the equation discovery algorithm,\ntaking inspiration from directed evolution techniques employed in fields such\nas chemistry and biology. The resulting approach, dubbed directed equation\ndiscovery, demonstrates a greater ability to converge towards accurate\nsolutions than the conventional method. To support our findings, we present\nexperiments based on Burgers', wave, and Korteweg--de Vries equations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:50:02 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ivanchik","Elizaveta",""],["Hvatov","Alexander",""]]}
{"id":"2308.04997","submitter":"Riccardo Tione","authors":"Jonas Hirsch, Connor Mooney, Riccardo Tione","title":"On the Lawson-Osserman conjecture","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that if $u : B_1 \\subset \\mathbb{R}^2 \\rightarrow \\mathbb{R}^n$ is a\nLipschitz critical point of the area functional with respect to outer\nvariations, then $u$ is smooth. This solves a conjecture of Lawson and Osserman\nfrom 1977 in the planar case.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:53:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hirsch","Jonas",""],["Mooney","Connor",""],["Tione","Riccardo",""]]}
{"id":"2308.04998","submitter":"Kazuya Kawasetsu","authors":"Kazuya Kawasetsu","title":"On the commutant of the principal subalgebra in the $A_1$ lattice vertex\n  algebra","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The coset (commutant) construction is a fundamental tool to construct vertex\noperator algebras from known vertex operator algebras. The aim of this paper is\nto provide a fundamental example of the commutants of vertex algebras ouside\nvertex operator algebras. Namely, the commutant $C$ of the principal subalgebra\n$W$ of the $A_1$ lattice vertex operator algebra $V_{A_1}$ is investigated. An\nexplicit minimal set of generators of $C$, which consists of infinitely many\nelements and strongly generates $C$, is introduced. It implies that the algebra\n$C$ is not finitely generated. Furthermore, Zhu's Poisson algebra of $C$ is\nshown to be isomorphic to an infinite-dimensional algebra\n$\\mathbb{C}[x_1,x_2,\\ldots]/(x_ix_j\\,|\\,i,j=1,2,\\ldots)$. In particular, the\nassociated variety of $C$ consists of a point. Moreover, $W$ and $C$ are\nverified to form a dual pair in $V_{A_1}$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:55:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kawasetsu","Kazuya",""]]}
{"id":"2308.04999","submitter":"Yuchuan Yang","authors":"Yuchuan Yang","title":"Generalized curvature for the optimal transport problem induced by a\n  Tonelli Lagrangian","comments":"24 pages","journal-ref":"Calculus of Variations and Partial Differential Equations 62,\n  Article number: 206 (2023)","doi":"10.1007/s00526-023-02550-2","report-no":null,"categories":"math.AP math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a generalized curvature that is motivated by the optimal transport\nproblem on $\\mathbb{R}^d$ with cost induced by a Tonelli Lagrangian $L$. We\nshow that non-negativity of the generalized curvature implies displacement\nconvexity of the generalized entropy functional on the $L-$Wasserstein space\nalong $C^2$ displacement interpolants.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:56:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yang","Yuchuan",""]]}
{"id":"2308.05000","submitter":"Istv\\'an Szanyi","authors":"T. Cs\\\"org\\H{o}, S. Hegyi, I. Szanyi","title":"L\\'evy $\\alpha$-stable model for the non-exponential low-$|t|$\n  proton-proton differential cross section","comments":"13 pages, 2 figures","journal-ref":"Universe 2023, 9(8), 361","doi":"10.3390/universe9080361","report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is known that the Real Extended Bialas-Bzdak (ReBB) model describes the\nproton-proton ($pp$) and proton-antiproton ($p\\bar p$) differential\ncross-section data in a statistically non-excludible way,\\linebreak i.e., with\na confidence level greater than or equal to 0.1\\% in the center of mass energy\nrange \\linebreak 546 GeV $\\leq\\sqrt{s}\\leq$ 8 TeV and in the squared\nfour-momentum transfer range 0.37 GeV$^2$ $\\leq -t\\leq$ 1.2 GeV$^2$.\nConsidering, instead of Gaussian, a more general L\\'evy $\\alpha$-stable shape\nfor the parton distributions of the constituent quark and diquark inside the\nproton and for the relative separation between them, a generalized description\nof data is obtained, where the ReBB model corresponds to the $\\alpha =$ 2\nspecial case. Extending the model to $\\alpha <$ 2, we conjecture that the\nvalidity of the model can be extended to a wider kinematic range, in\nparticular, to lower values of the four-momentum transfer $-t$. We present the\nformal L\\'evy $\\alpha$-stable generalization of the Bialas-Bzdak model and show\nthat a simplified version of this model can be successfully fitted, with\n$\\alpha<$ 2, to the non-exponential, low $-t$ differential cross-section data\nof elastic proton-proton scattering at $\\sqrt{s} =$ 8 TeV.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:58:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cs\u00f6rg\u0151","T.",""],["Hegyi","S.",""],["Szanyi","I.",""]]}
{"id":"2308.05001","submitter":"Haixin Chang","authors":"Hao Wu, Li Yang, Jie Yu, Gaojie Zhang, Bichen Xiao, Haixin Chang","title":"Observation of abnormal resistance-temperature behavior along with\n  diamagnetic transition in Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O-based composite","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, Sukbae Lee et al.reported that material\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O (LK-99) has a series of characteristics of room\ntemperature superconductors, including diamagnetic transition, resistance jump,\nnearly zero-resistance, magnetic field-dependent IV characteristics and so on\n(10.6111/JKCGCT.2023.33.2.061, arXiv:2307.12008, arXiv:2307.12037). However,\nwhether LK-99 is really a room temperature superconductor is still\ncontroversial. On the one hand, some people think that the relatively weak\ndiamagnetism of LK-99 reported by Sukbae Lee et al. is not the Meissner effect.\nOn the other hand, there are doubts about the authenticity of its\nzero-resistance test results. Global replication studies have shown that LK-99\ndoes have a large diamagnetic (arXiv:2308.01516), and also found a\nzero-resistance behavior at a low temperature of 110 $^\\circ$K\n(arXiv:2308.01192). However, up to now, there is still no direct reproducible\nevidence to support Sukbae Lee et al.'s conclusion that LK-99 is a room\ntemperature superconductor. Here, a distinct resistance jump was observed at\nabout 387 $^\\circ$K under ambient pressure in our experiment for unclear reason\nincluding possible impurity's contribution. The overall resistance of the test\nLK-99 sample still shows semiconductivity, and the resistance cannot really\ndrop to zero. Our findings indicate that to identify the true potential of\nLK-99, high quality crystals without impurity are very important.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:00:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wu","Hao",""],["Yang","Li",""],["Yu","Jie",""],["Zhang","Gaojie",""],["Xiao","Bichen",""],["Chang","Haixin",""]]}
{"id":"2308.05002","submitter":"Fr\\'ed\\'eric Ouimet","authors":"Fr\\'ed\\'eric Ouimet","title":"Deficiency bounds for the multivariate inverse hypergeometric\n  distribution","comments":"9 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.CO stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The multivariate inverse hypergeometric (MIH) distribution is an extension of\nthe negative multinomial (NM) model that accounts for sampling without\nreplacement in a finite population. Even though most studies on longitudinal\ncount data with a specific number of `failures' occur in a finite setting, the\nNM model is typically chosen over the more accurate MIH model. This raises the\nquestion: How much information is lost when inferring with the approximate NM\nmodel instead of the true MIH model? The loss is quantified by a measure called\ndeficiency in statistics. In this paper, asymptotic bounds for the deficiencies\nbetween MIH and NM experiments are derived, as well as between MIH and the\ncorresponding multivariate normal experiments with the same mean-covariance\nstructure. The findings are supported by a local approximation for the\nlog-ratio of the MIH and NM probability mass functions, and by Hellinger\ndistance bounds.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:00:53 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ouimet","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.05003","submitter":"Wayne Falk","authors":"Wayne M Falk and William Q Meeker","title":"Heart Valve Component Fatigue Demonstration Testing Attribute and\n  Variables Demonstration Test Planning and Sample Size Determination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The fatigue demonstration test program may be carried out using either the\nattribute or variables approach. For either approach, a robust test program\nfulfills the objective of unambiguously demonstrating reliability, as well as,\ndemonstrating understanding of when and how the components could fracture. To\nthis end, it is recommended that a robust test program should aim to produce\ndata for both surviving units and fractured units.\n  Test planning is needed to determine sample sizes and test levels of strain\nto prove that the component meets the target reliability. The two risks that\nmust be addressed by the test plan are 1) the risk that an unreliable component\nwill pass the test, i.e., Type 1 error, or 2) the risk of a test failing for a\nsufficiently reliable component, i.e., Type 2 error.\n  Test planning methods are described to design a test plan that efficiently\nmeets these objectives for attribute and variable approaches. The attribute\napproach offers the advantage of straight forward planning and a simple output.\nSample size is calculated using a well-known formula. Testing to fracture is\nrecommended to complement the traditional attribute testing approach to\nidentify the test failure modes. The variables approach is more complex to plan\nand analyze, however it enables a greater understanding of reliability. Sample\nsizes and test levels of strain are determined using a simulated data strategy\nto provide a clear picture of possible outcomes of the test.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:07:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Falk","Wayne M",""],["Meeker","William Q",""]]}
{"id":"2308.05004","submitter":"Simone Ferrari","authors":"Davide A. Bignamini, Simone Ferrari, Simona Fornaro and Margherita\n  Zanella","title":"Differentiability in infinite dimension and the Malliavin calculus","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we study two notions of differentiability introduced by G.\nCannarsa and G. Da Prato (see [20]) and L. Gross (see [41]) in both the\nframework of infinite dimensional analysis and the framework of Malliavin\ncalculus.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:03:54 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bignamini","Davide A.",""],["Ferrari","Simone",""],["Fornaro","Simona",""],["Zanella","Margherita",""]]}
{"id":"2308.05005","submitter":"Shaojia Ge","authors":"Shaojia Ge, Oleg Antropov, Tuomas H\\\"ame, Ronald E. McRoberts, Jukka\n  Miettinen","title":"Deep Learning Model Transfer in Forest Mapping using Multi-source\n  Satellite SAR and Optical Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning (DL) models are gaining popularity in forest variable\nprediction using Earth Observation images. However, in practical forest\ninventories, reference datasets are often represented by plot- or stand-level\nmeasurements, while high-quality representative wall-to-wall reference data for\nend-to-end training of DL models are rarely available. Transfer learning\nfacilitates expansion of the use of deep learning models into areas with\nsub-optimal training data by allowing pretraining of the model in areas where\nhigh-quality teaching data are available. In this study, we perform a \"model\ntransfer\" (or domain adaptation) of a pretrained DL model into a target area\nusing plot-level measurements and compare performance versus other machine\nlearning models. We use an earlier developed UNet based model (SeUNet) to\ndemonstrate the approach on two distinct taiga sites with varying forest\nstructure and composition. Multisource Earth Observation (EO) data are\nrepresented by a combination of Copernicus Sentinel-1 C-band SAR and Sentinel-2\nmultispectral images, JAXA ALOS-2 PALSAR-2 SAR mosaic and TanDEM-X bistatic\ninterferometric radar data. The training study site is located in Finnish\nLapland, while the target site is located in Southern Finland. By leveraging\ntransfer learning, the prediction of SeUNet achieved root mean squared error\n(RMSE) of 2.70 m and R$^2$ of 0.882, considerably more accurate than\ntraditional benchmark methods. We expect such forest-specific DL model transfer\ncan be suitable also for other forest variables and other EO data sources that\nare sensitive to forest structure.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:05:41 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ge","Shaojia",""],["Antropov","Oleg",""],["H\u00e4me","Tuomas",""],["McRoberts","Ronald E.",""],["Miettinen","Jukka",""]]}
{"id":"2308.05006","submitter":"David Meer","authors":"David J Meer, Eric R. Weeks","title":"Bounded Distributions place Limits on Skewness and Larger Moments","comments":"8 pages, 2 figures. Submitted to Statistical Science","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Distributions of strictly positive numbers are common and can be\ncharacterized by standard statistical measures such as mean, standard\ndeviation, and skewness. We demonstrate that for these distributions the\nskewness $D_3$ is bounded from below by a function of the coefficient of\nvariation (CoV) $\\delta$ as $D_3 \\geq \\delta-1/\\delta$. The results are\nextended to any distribution that is bounded with minimum value $x_{\\rm min}$\nand/or bounded with maximum value $x_{\\rm max}$. We build on the results to\nprovide bounds for kurtosis $D_4$, and conjecture analogous bounds exists for\nhigher statistical moments.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:08:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Meer","David J",""],["Weeks","Eric R.",""]]}
{"id":"2308.05007","submitter":"Yifeng Zhao","authors":"Yifeng Zhao, Pei Zhang, Stan Z. Li, S.A. Galindo-Torres","title":"Random-Walk Metaball-Imaging Discrete Element Lattice Boltzmann Method\n  for 3D Solute Transport in Fluid-Particle Systems with Complex Granular\n  Morphologies","comments":"Pei Zhang, Stan Z. Li and S.A. Galindo-Torres are all cooresponding\n  authors of this paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Solute transport in fluid-particle systems is a fundamental process in\nnumerous scientific and engineering disciplines. The simulation of it\nnecessitates the consideration of solid particles with intricate shapes and\nsizes. To address this challenge, this study proposes the Random-Walk\nMetaball-Imaging Discrete Element Lattice Boltzmann Method (RW-MI-DELBM). In\nthis model, we reconstruct particle geometries with the Metaball-Imaging\nalgorithm, capture the particle behavior using the Discrete Element Method\n(DEM), simulate fluid behavior by the Lattice Boltzmann Method (LBM), and\nrepresent solute behavior through the Random Walk Method (RWM). Through the\nintegration of these techniques with specially designed boundary conditions, we\nachieve to simulate the solute transport in fluid-particle systems comprising\ncomplex particle morphologies. Thorough validations, including analytical\nsoluutions and experiments, are performed to assess the robustness and accuracy\nof this framework. The results demonstrate that the proposed framework can\naccurately capture the complex dynamics of solute transport under strict mass\nconservation. In particular, an investigation is carried out to assess the\ninfluence of particle morphologies on solute transport in a 3D oscillator, with\na focus on identifying correlations between shape features and dispersion\ncoefficients. Notably, all selected shape features exhibited strong\ncorrelations with the dispersion coefficient, indicating the significant\ninfluence of particle shapes on transport phenomena. However, due to the\ncomplexity of the relationship and the limited number of simulations, no clear\npatterns could be observed. Further comprehensive analyses incorporating a\nbroader range of shape features and varying conditions are necessary to fully\ncomprehend their collective influence on the dispersion coefficient.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:08:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Zhao","Yifeng",""],["Zhang","Pei",""],["Li","Stan Z.",""],["Galindo-Torres","S. A.",""]]}
{"id":"2308.05008","submitter":"Burkhard Militzer","authors":"Burkhard Militzer","title":"Study of Jupiter's Interior with Quadratic Monte Carlo Simulations","comments":"27 pages, 9 figures, 2 tables","journal-ref":"ApJ 953 (2023) 111","doi":"10.3847/1538-4357/ace1f1","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct models for Jupiter's interior that match the gravity data\nobtained by the Juno and Galileo spacecrafts. To generate ensembles of models,\nwe introduce a novel quadratic Monte Carlo technique that is more efficient in\nconfining fitness landscapes than affine invariant method that relies on linear\nstretch moves. We compare how long it takes the ensembles of walkers in both\nmethods to travel to the most relevant parameter region. Once there, we compare\nthe autocorrelation time and error bars of the two methods. For a ring\npotential and the 2d Rosenbrock function, we find that our quadratic Monte\nCarlo technique is significantly more efficient. Furthermore we modified the\nwalk moves by adding a scaling factor. We provide the source code and examples\nso that this method can be applied elsewhere. Here we employ our method to\ngenerate five-layer models for Jupiter's interior that include winds and a\nprominent dilute core, which allows us to match the planet's even and odd\ngravity harmonics. We compare predictions from the different model ensembles\nand analyze how much an increase of the temperature at 1 bar and ad hoc change\nto the equation of state affects the inferred amount of heavy elements in\natmosphere and in the planet overall.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:08:34 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Militzer","Burkhard",""]]}
{"id":"2308.05009","submitter":"Yoshinori Matsuo","authors":"Yoshinori Matsuo","title":"Quantum focusing conjecture and the Page curve","comments":"41 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The focusing theorem fails for evaporating black holes because the null\nenergy condition is violated by quantum effects. The quantum focusing\nconjecture is proposed so that it is satisfied even if the null energy\ncondition is violated. The conjecture states that the derivative of the sum of\nthe area of a cross-section of the null geodesic congruence and the\nentanglement entropy of matters outside it is non-increasing. Naively, it is\nexpected that the quantum focusing conjecture is violated after the Page time\nas both the area of the horizon and the entanglement entropy of the Hawking\nradiation are decreasing. We calculate the entanglement entropy after the Page\ntime by using the island rule, and find the following results: (i) the page\ntime is given by an approximately null surface, (ii) the entanglement entropy\nis increasing along the outgoing null geodesic even after the Page time, and\n(iii) the quantum focusing conjecture is not violated.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:09:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Matsuo","Yoshinori",""]]}
{"id":"2308.05010","submitter":"Jacek Pawelczyk","authors":"Jacek Pawelczyk","title":"Low temperature TBA and GHD for simple integrable QFT","comments":"12 pages, 3 figures. v2: 13 pages, an appendix added, simplified GHD\n  equations","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.quant-gas nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive the low temperature thermodynamic equations corrected by virtual\nprocesses for integrable QFT on large but finite size space circle. Obtained\nTBA's are solved numerically for the sinh-Gordon model. We also derive\ncorresponding Euler scale generalized hydrodynamics (GHD) equations.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 10:17:46 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 13:56:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pawelczyk","Jacek",""]]}
{"id":"2308.05011","submitter":"Manuel P\\'erez-Carrasco","authors":"Manuel P\\'erez-Carrasco, Guillermo Cabrera-Vives, Lorena\n  Hern\\'andez-Garc\\'ia, Francisco Forster, Paula S\\'anchez-S\\'aez, Alejandra\n  Mu\\~noz Arancibia, Nicol\\'as Astorga, Franz Bauer, Amelia Bayo, Martina\n  C\\'adiz-Leyton, Marcio Catelan","title":"Multi-Class Deep SVDD: Anomaly Detection Approach in Astronomy with\n  Distinct Inlier Categories","comments":"Accepted to ICML 2023 Workshop on Machine Learning for Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the increasing volume of astronomical data generated by modern survey\ntelescopes, automated pipelines and machine learning techniques have become\ncrucial for analyzing and extracting knowledge from these datasets. Anomaly\ndetection, i.e. the task of identifying irregular or unexpected patterns in the\ndata, is a complex challenge in astronomy. In this paper, we propose\nMulti-Class Deep Support Vector Data Description (MCDSVDD), an extension of the\nstate-of-the-art anomaly detection algorithm One-Class Deep SVDD, specifically\ndesigned to handle different inlier categories with distinct data\ndistributions. MCDSVDD uses a neural network to map the data into hyperspheres,\nwhere each hypersphere represents a specific inlier category. The distance of\neach sample from the centers of these hyperspheres determines the anomaly\nscore. We evaluate the effectiveness of MCDSVDD by comparing its performance\nwith several anomaly detection algorithms on a large dataset of astronomical\nlight-curves obtained from the Zwicky Transient Facility. Our results\ndemonstrate the efficacy of MCDSVDD in detecting anomalous sources while\nleveraging the presence of different inlier categories. The code and the data\nneeded to reproduce our results are publicly available at\nhttps://github.com/mperezcarrasco/AnomalyALeRCE.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:10:53 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 14:08:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["P\u00e9rez-Carrasco","Manuel",""],["Cabrera-Vives","Guillermo",""],["Hern\u00e1ndez-Garc\u00eda","Lorena",""],["Forster","Francisco",""],["S\u00e1nchez-S\u00e1ez","Paula",""],["Arancibia","Alejandra Mu\u00f1oz",""],["Astorga","Nicol\u00e1s",""],["Bauer","Franz",""],["Bayo","Amelia",""],["C\u00e1diz-Leyton","Martina",""],["Catelan","Marcio",""]]}
{"id":"2308.05012","submitter":"Awad Abdelhalim","authors":"Michael Leong, Awad Abdelhalim, Jude Ha, Dianne Patterson, Gabriel L.\n  Pincus, Anthony B. Harris, Michael Eichler, Jinhua Zhao","title":"MetRoBERTa: Leveraging Traditional Customer Relationship Management Data\n  to Develop a Transit-Topic-Aware Language Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transit riders' feedback provided in ridership surveys, customer relationship\nmanagement (CRM) channels, and in more recent times, through social media is\nkey for transit agencies to better gauge the efficacy of their services and\ninitiatives. Getting a holistic understanding of riders' experience through the\nfeedback shared in those instruments is often challenging, mostly due to the\nopen-ended, unstructured nature of text feedback. In this paper, we propose\nleveraging traditional transit CRM feedback to develop and deploy a\ntransit-topic-aware large language model (LLM) capable of classifying\nopen-ended text feedback to relevant transit-specific topics. First, we utilize\nsemi-supervised learning to engineer a training dataset of 11 broad transit\ntopics detected in a corpus of 6 years of customer feedback provided to the\nWashington Metropolitan Area Transit Authority (WMATA). We then use this\ndataset to train and thoroughly evaluate a language model based on the RoBERTa\narchitecture. We compare our LLM, MetRoBERTa, to classical machine learning\napproaches utilizing keyword-based and lexicon representations. Our model\noutperforms those methods across all evaluation metrics, providing an average\ntopic classification accuracy of 90%. Finally, we provide a value proposition\nof this work demonstrating how the language model, alongside additional text\nprocessing tools, can be applied to add structure to open-ended text sources of\nfeedback like Twitter. The framework and results we present provide a pathway\nfor an automated, generalizable approach for ingesting, visualizing, and\nreporting transit riders' feedback at scale, enabling agencies to better\nunderstand and improve customer experience.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:11:37 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Leong","Michael",""],["Abdelhalim","Awad",""],["Ha","Jude",""],["Patterson","Dianne",""],["Pincus","Gabriel L.",""],["Harris","Anthony B.",""],["Eichler","Michael",""],["Zhao","Jinhua",""]]}
{"id":"2308.05013","submitter":"Xixi Wu","authors":"Xixi Wu, Yun Xiong, Yao Zhang, Yizhu Jiao, and Jiawei Zhang","title":"Dual Intents Graph Modeling for User-centric Group Discovery","comments":"Accepted by CIKM'23 as Long Paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Online groups have become increasingly prevalent, providing users with space\nto share experiences and explore interests. Therefore, user-centric group\ndiscovery task, i.e., recommending groups to users can help both users' online\nexperiences and platforms' long-term developments. Existing recommender methods\ncan not deal with this task as modeling user-group participation into a\nbipartite graph overlooks their item-side interests. Although there exist a few\nworks attempting to address this task, they still fall short in fully\npreserving the social context and ensuring effective interest representation\nlearning.\n  In this paper, we focus on exploring the intents that motivate users to\nparticipate in groups, which can be categorized into different types, like the\nsocial-intent and the personal interest-intent. The former refers to users\njoining a group affected by their social links, while the latter relates to\nusers joining groups with like-minded people for self-enjoyment. To comprehend\ndifferent intents, we propose a novel model, DiRec, that first models each\nintent separately and then fuses them together for predictions. Specifically,\nfor social-intent, we introduce the hypergraph structure to model the\nrelationship between groups and members, leading to a richer understanding of\nthe social context. As for interest-intent, we employ novel structural\nrefinement on the interactive graph to uncover more intricate user behaviors\nand group interests, realizing better representation learning of interests.\nFurthermore, we also observe the intent overlapping in real-world scenarios and\ndevise a novel self-supervised learning loss that encourages such alignment for\nfinal recommendations. Extensive experiments on three public datasets show the\nsignificant improvement of DiRec over the state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:11:46 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 02:30:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wu","Xixi",""],["Xiong","Yun",""],["Zhang","Yao",""],["Jiao","Yizhu",""],["Zhang","Jiawei",""]]}
{"id":"2308.05014","submitter":"Fu Song","authors":"Weijie Shao and Yuyang Gao and Fu Song and Sen Chen and Lingling Fan","title":"An Empirical Study of Bugs in Open-Source Federated Learning Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL), as a decentralized machine learning solution to the\nprotection of users' private data, has become an important learning paradigm in\nrecent years, especially since the enforcement of stricter laws and regulations\nin most countries. Therefore, a variety of FL frameworks are released to\nfacilitate the development and application of federated learning. Despite the\nconsiderable amount of research on the security and privacy of FL models and\nsystems, the security issues in FL frameworks have not been systematically\nstudied yet. In this paper, we conduct the first empirical study on 1,112 FL\nframework bugs to investigate their characteristics. These bugs are manually\ncollected, classified, and labeled from 12 open-source FL frameworks on GitHub.\nIn detail, we construct taxonomies of 15 symptoms, 12 root causes, and 20 fix\npatterns of these bugs and investigate their correlations and distributions on\n23 logical components and two main application scenarios. From the results of\nour study, we present nine findings, discuss their implications, and propound\nseveral suggestions to FL framework developers and security researchers on the\nFL frameworks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:14:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Shao","Weijie",""],["Gao","Yuyang",""],["Song","Fu",""],["Chen","Sen",""],["Fan","Lingling",""]]}
{"id":"2308.05015","submitter":"Sylwester Arabas","authors":"Sylwester Arabas, Jeffrey H. Curtis, Israel Silber, Ann Fridlind,\n  Daniel A. Knopf, Matthew West and Nicole Riemer","title":"Immersion freezing in particle-based aerosol-cloud microphysics: a\n  probabilistic perspective on singular and time-dependent models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloud droplets containing ice-nucleating particles (INPs) may freeze at\ntemperatures above than the homogeneous freezing threshold. This process,\nreferred to as immersion freezing, is one of the major modulator of\naerosol-cloud interactions in the Earth's atmosphere that impacts cloud\nradiative properties, and thus, climate. In modeling studies, immersion\nfreezing is often implemented using either so-called \"singular\" or\n\"time-dependent\" parameterizations. In this paper, we juxtapose both approaches\nand discuss them in the context of probabilistic particle-based cloud\nmicrophysics modeling, referred to as the super-particle or super-droplet\ntechniques. These techniques work by populating the particle-attribute phase\nspace with large numbers of computational particles and tracking the evolution\nof particle attributes. We outline the congruence of the singular and\ntime-dependent approaches with Poissonian process description and point to\nlimitations pertinent to the singular approach. Simulations with both box and\ntwo-dimensional kinematic models focus on the following aspects of immersion\nfreezing modeling. First, we contrast how both parameterizations respond to\ndifferent idealized ambient cooling rate profiles. Second, we quantify how the\npolydispersity of the immersed surface spectrum impacts macroscopic features of\nthe system. Third, we illustrate the implications of applying the singular\nmodel in simulations with flow regimes relevant to ambient cloud conditions\nrather than to the cloud-chamber experiments on which these parameterizations\nare built upon. We discuss the critical role of the attribute-space sampling\nstrategy for particle-based model simulations in modeling heterogeneous ice\nnucleation which is contingent on the presence of relatively sparse immersed\nINPs.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 20:15:28 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Arabas","Sylwester",""],["Curtis","Jeffrey H.",""],["Silber","Israel",""],["Fridlind","Ann",""],["Knopf","Daniel A.",""],["West","Matthew",""],["Riemer","Nicole",""]]}
{"id":"2308.05016","submitter":"Laurence Mayther","authors":"Laurence H. Mayther","title":"A general collapsing result for families of stratified Riemannian\n  metrics on orbifolds","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.GT math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proves a general collapsing result for families of stratified\nRiemannian metrics $\\widehat{g}^\\mu$ on a compact orbifold $E$, subject to\nsuitable limiting conditions on the metrics $\\widehat{g}^\\mu$ as $\\mu \\to\n\\infty$. The result is distinct from similar theorems in the literature since\nit does not require bounds on curvature or injectivity radius of\n$\\left(E,\\widehat{g}^\\mu\\right)$ and thus allows for Gromov-Hausdorff limits of\n$\\left(E,\\widehat{g}^\\mu\\right)$ which have strictly lower dimension than $E$.\nThe paper also introduces and studies a new class of stratified fibrations\nbetween orbifolds, termed weak submersions, and new classes of geometric\nstructures on orbifolds, termed stratified Riemannian metrics, stratified\nRiemannian semi-metrics and stratified quasi-Finslerian structures, all of\nwhich play a key role in the proof of the main theorem.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:19:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Mayther","Laurence H.",""]]}
{"id":"2308.05017","submitter":"Yiyou Sun","authors":"Yiyou Sun, Zhenmei Shi, Yingyu Liang, Yixuan Li","title":"When and How Does Known Class Help Discover Unknown Ones? Provable\n  Understanding Through Spectral Analysis","comments":"ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Novel Class Discovery (NCD) aims at inferring novel classes in an unlabeled\nset by leveraging prior knowledge from a labeled set with known classes.\nDespite its importance, there is a lack of theoretical foundations for NCD.\nThis paper bridges the gap by providing an analytical framework to formalize\nand investigate when and how known classes can help discover novel classes.\nTailored to the NCD problem, we introduce a graph-theoretic representation that\ncan be learned by a novel NCD Spectral Contrastive Loss (NSCL). Minimizing this\nobjective is equivalent to factorizing the graph's adjacency matrix, which\nallows us to derive a provable error bound and provide the sufficient and\nnecessary condition for NCD. Empirically, NSCL can match or outperform several\nstrong baselines on common benchmark datasets, which is appealing for practical\nusage while enjoying theoretical guarantees.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:27:21 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sun","Yiyou",""],["Shi","Zhenmei",""],["Liang","Yingyu",""],["Li","Yixuan",""]]}
{"id":"2308.05018","submitter":"Takahiro Morishita","authors":"Takahiro Morishita, Massimo Stiavelli, Ranga-Ram Chary, Michele\n  Trenti, Pietro Bergamini, Marco Chiaberge, Nicha Leethochawalit, Guido\n  Roberts-Borsani, Xuejian Shen, Tommaso Treu","title":"Enhanced Sub-kpc Scale Star-formation: Results From A JWST Size Analysis\n  of 339 Galaxies At 5<z<14","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 present a comprehensive search and analysis of high-redshift galaxies in a\nsuite of nine public JWST extragalactic fields taken in Cycle 1, covering a\ntotal effective search area of $\\sim358{\\rm arcmin^2}$. Through conservative\n($8\\sigma$) photometric selection, we identify 339 galaxies at $5<z<14$, with\n109 having spectroscopic redshift measurements from the literature, including\nrecent JWST NIRSpec observations. Our regression analysis reveals that the\nrest-frame UV size-stellar mass relation follows $R_{\\rm eff}\\propto\nM_*^{0.20\\pm0.03}$, similar to that of star-forming galaxies at $z\\sim3$, but\nscaled down in size by $\\sim0.7$dex. We find a much slower rate for the average\nsize evolution over the redshift range, $R_{\\rm eff}\\propto(1+z)^{-0.4\\pm0.2}$,\nthan that derived in the literature. A fraction ($\\sim13\\,\\%$) of our sample\nare marginally resolved even in the NIRCam imaging ($<100$pc), located at\n$>1.5\\,\\sigma$ below the derived size-mass slope. These compact sources exhibit\na high star formation surface density $\\Sigma_{\\rm SFR}>10\\,M_\\odot\\,{\\rm\nyr^{-1}\\,kpc^{-2}}$, a range in which only $<0.01\\,\\%$ of the local\nstar-forming galaxy sample is found. For those with available NIRSpec data, no\nevidence of ongoing supermassive black hole accretion is observed. A potential\nexplanation for the observed high [OIII]-to-Hbeta ratios could be high shock\nvelocities, likely originating within intense star-forming regions\ncharacterized by high $\\Sigma_{\\rm SFR}$. Lastly, we find that the rest-frame\nUV and optical sizes of our sample are comparable. Our results are consistent\nwith these early galaxies building up their structures inside-out and yet to\nexhibit the strong color gradient seen at lower redshift.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:28:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Morishita","Takahiro",""],["Stiavelli","Massimo",""],["Chary","Ranga-Ram",""],["Trenti","Michele",""],["Bergamini","Pietro",""],["Chiaberge","Marco",""],["Leethochawalit","Nicha",""],["Roberts-Borsani","Guido",""],["Shen","Xuejian",""],["Treu","Tommaso",""]]}
{"id":"2308.05019","submitter":"Fabio Miranda","authors":"Carolina Veiga Ferreira de Souza, Suzanna Maria Bonnet, Daniel de\n  Oliveira, Marcio Cataldi, Fabio Miranda, Marcos Lage","title":"ProWis: A Visual Approach for Building, Managing, and Analyzing Weather\n  Simulation Ensembles at Runtime","comments":"Accepted at IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weather forecasting is essential for decision-making and is usually performed\nusing numerical modeling. Numerical weather models, in turn, are complex tools\nthat require specialized training and laborious setup and are challenging even\nfor weather experts. Moreover, weather simulations are data-intensive\ncomputations and may take hours to days to complete. When the simulation is\nfinished, the experts face challenges analyzing its outputs, a large mass of\nspatiotemporal and multivariate data. From the simulation setup to the analysis\nof results, working with weather simulations involves several manual and\nerror-prone steps. The complexity of the problem increases exponentially when\nthe experts must deal with ensembles of simulations, a frequent task in their\ndaily duties. To tackle these challenges, we propose ProWis: an interactive and\nprovenance-oriented system to help weather experts build, manage, and analyze\nsimulation ensembles at runtime. Our system follows a human-in-the-loop\napproach to enable the exploration of multiple atmospheric variables and\nweather scenarios. ProWis was built in close collaboration with weather\nexperts, and we demonstrate its effectiveness by presenting two case studies of\nrainfall events in Brazil.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:30:48 GMT"}],"update_date":"2023-08-10","authors_parsed":[["de Souza","Carolina Veiga Ferreira",""],["Bonnet","Suzanna Maria",""],["de Oliveira","Daniel",""],["Cataldi","Marcio",""],["Miranda","Fabio",""],["Lage","Marcos",""]]}
{"id":"2308.05020","submitter":"Cong Minh Nguyen","authors":"Ly Thi Kieu Diem, Nguyen Cong Minh, Thanh Vu","title":"The sequentially Cohen-Macaulay property of edge ideals of edge-weighted\n  graphs","comments":"8 pages, submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $I(G_{\\mathbf{w}})$ be the edge ideal of an edge-weighted graph\n$(G,\\mathbf{w})$. We prove that $I(G_{\\mathbf{w}})$ is sequentially\nCohen-Macaulay for all weight functions $w$ if and only if $G$ is a Woodroofe\ngraph.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:31:01 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Diem","Ly Thi Kieu",""],["Minh","Nguyen Cong",""],["Vu","Thanh",""]]}
{"id":"2308.05021","submitter":"Yangming Li","authors":"Yangming Li, Zhaozhi Qian, Mihaela van der Schaar","title":"Do Diffusion Models Suffer Error Propagation? Theoretical Analysis and\n  Consistency Regularization","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":"  While diffusion models have achieved promising performances in data\nsynthesis, they might suffer error propagation because of their cascade\nstructure, where the distributional mismatch spreads and magnifies through the\nchain of denoising modules. However, a strict analysis is expected since many\nsequential models such as Conditional Random Field (CRF) are free from error\npropagation. In this paper, we empirically and theoretically verify that\ndiffusion models are indeed affected by error propagation and we then propose a\nregularization to address this problem. Our theoretical analysis reveals that\nthe question can be reduced to whether every denoising module of the diffusion\nmodel is fault-tolerant. We derive insightful transition equations, indicating\nthat the module can't recover from input errors and even propagates additional\nerrors to the next module. Our analysis directly leads to a consistency\nregularization scheme for diffusion models, which explicitly reduces the\ndistribution gap between forward and backward processes. We further introduce a\nbootstrapping algorithm to reduce the computation cost of the regularizer. Our\nexperimental results on multiple image datasets show that our regularization\neffectively handles error propagation and significantly improves the\nperformance of vanilla diffusion models.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:31:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Yangming",""],["Qian","Zhaozhi",""],["van der Schaar","Mihaela",""]]}
{"id":"2308.05022","submitter":"Ao Li","authors":"Ao Li, Le Zhang, Yun Liu, Ce Zhu","title":"Feature Modulation Transformer: Cross-Refinement of Global\n  Representation via High-Frequency Prior for Image Super-Resolution","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":"  Transformer-based methods have exhibited remarkable potential in single image\nsuper-resolution (SISR) by effectively extracting long-range dependencies.\nHowever, most of the current research in this area has prioritized the design\nof transformer blocks to capture global information, while overlooking the\nimportance of incorporating high-frequency priors, which we believe could be\nbeneficial. In our study, we conducted a series of experiments and found that\ntransformer structures are more adept at capturing low-frequency information,\nbut have limited capacity in constructing high-frequency representations when\ncompared to their convolutional counterparts. Our proposed solution, the\ncross-refinement adaptive feature modulation transformer (CRAFT), integrates\nthe strengths of both convolutional and transformer structures. It comprises\nthree key components: the high-frequency enhancement residual block (HFERB) for\nextracting high-frequency information, the shift rectangle window attention\nblock (SRWAB) for capturing global information, and the hybrid fusion block\n(HFB) for refining the global representation. Our experiments on multiple\ndatasets demonstrate that CRAFT outperforms state-of-the-art methods by up to\n0.29dB while using fewer parameters. The source code will be made available at:\nhttps://github.com/AVC2-UESTC/CRAFT-SR.git.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:38:36 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 10:38:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Ao",""],["Zhang","Le",""],["Liu","Yun",""],["Zhu","Ce",""]]}
{"id":"2308.05023","submitter":"Zhigang Wang","authors":"Zhen Gong, Rui Wang, Famin Yu, Chenxi Wan, Xinrui Yang, Zhigang Wang","title":"High-energy nitrogen rings stabilized by superatom properties","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.atom-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  How to stabilize nitrogen-rich high-energy-density molecules under\nconventional conditions is particularly important for the energy storage and\nconversion of such systems and has attracted extensive attention. In this work,\nour theoretical study showed for the first time that the stabilization\nmechanism of the nitrogen ring conformed to the superatomic properties at the\natomic level. This result occurred because the stabilized anionic nitrogen\nrings generally showed planar high symmetry and the injected electrons occupied\nthe superatomic molecular orbitals (SAMOs) of the nitrogen rings. According to\nthese results, we identified the typical stabilized anionic nitrogen ring\nstructures N64-, N5- and N42-, and their superatomic electronic configurations\nwere 1S21P41D41F22S21P21F21D42P41G41F4, 1S21P41D41P22S21F41D42P4 and\n1S21P41D21P21D22S22P41D4, respectively. On this basis, we further designed a\npathway to stabilize nitrogen rings by introducing metal atoms as electron\ndonors to form neutral ThN6, LiN5 and MgN4 structures, thereby replacing the\nanionization of systems. Our study highlights the importance of developing\nnitrogen-rich energetic materials from the perspective of superatoms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:38:45 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gong","Zhen",""],["Wang","Rui",""],["Yu","Famin",""],["Wan","Chenxi",""],["Yang","Xinrui",""],["Wang","Zhigang",""]]}
{"id":"2308.05024","submitter":"Kenny De Commer","authors":"K. De Commer and J. De Ro","title":"Approximation properties for dynamical W*-correspondences","comments":"42 pages. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathbb{G}$ be a locally compact quantum group, and $A,B$ von Neumann\nalgebras with an action by $\\mathbb{G}$. We refer to these as\n$\\mathbb{G}$-dynamical W$^*$-algebras. We make a study of\n$\\mathbb{G}$-equivariant $A$-$B$-correspondences, that is, Hilbert spaces\n$\\mathcal{H}$ with an $A$-$B$-bimodule structure by $*$-preserving normal maps,\nand equipped with a unitary representation of $\\mathbb{G}$ which is equivariant\nwith respect to the above bimodule structure. Such structures are a Hilbert\nspace version of the theory of $\\mathbb{G}$-equivariant Hilbert\nC$^*$-bimodules. We show that there is a well-defined Fell topology on\nequivariant correspondences, and use this to formulate approximation properties\nfor them. Within this formalism, we then characterize amenability of the action\nof a locally compact group on a von Neumann algebra, using recent results due\nto Bearden and Crann. We further consider natural operations on equivariant\ncorrespondences such as taking opposites, composites and crossed products, and\nexamine the continuity of these operations with respect to the Fell topology.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:39:09 GMT"}],"update_date":"2023-08-10","authors_parsed":[["De Commer","K.",""],["De Ro","J.",""]]}
{"id":"2308.05025","submitter":"Tanisha Joshi","authors":"Tanisha Joshi, S.D Pathak","title":"Evolution of Entropy with Cosmic Time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the evolution of entropy in the universe is a fundamental\naspect of cosmology. This paper investigates the evolution of entropy in a\nspatially flat $K=0$ universe, focusing on the contributions of matter,\nradiation, and dark energy components. The study derives the rate of change of\nentropy with respect to cosmic time, taking into account the scaling relations\nof energy densities and temperatures for different components. The analysis\nreveals the dominance of radiation entropy at early times, transitioning to\nmatter dominance as the universe expands. The constant contribution of dark\nenergy entropy throughout cosmic time is also considered. The paper\nacknowledges the limitations of the simplified model and the omission of\nentropy generation processes, emphasizing the importance of future research to\nincorporate these aspects. The results highlight the complex interplay between\ndifferent components and provide insights into the dynamics of entropy in the\nexpanding universe. This study lays the foundation for further investigations\ninto entropy evolution, urging the consideration of more comprehensive models\nand numerical techniques to achieve a deeper understanding of the universe's\nthermodynamic behavior.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:44:38 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Joshi","Tanisha",""],["Pathak","S. D",""]]}
{"id":"2308.05026","submitter":"Hao Cheng","authors":"Hao Cheng, Mengmeng liu, Lin Chen","title":"An End-to-End Framework of Road User Detection, Tracking, and Prediction\n  from Monocular 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":"  Perception that involves multi-object detection and tracking, and trajectory\nprediction are two major tasks of autonomous driving. However, they are\ncurrently mostly studied separately, which results in most trajectory\nprediction modules being developed based on ground truth trajectories without\ntaking into account that trajectories extracted from the detection and tracking\nmodules in real-world scenarios are noisy. These noisy trajectories can have a\nsignificant impact on the performance of the trajectory predictor and can lead\nto serious prediction errors. In this paper, we build an end-to-end framework\nfor detection, tracking, and trajectory prediction called ODTP (Online\nDetection, Tracking and Prediction). It adopts the state-of-the-art online\nmulti-object tracking model, QD-3DT, for perception and trains the trajectory\npredictor, DCENet++, directly based on the detection results without purely\nrelying on ground truth trajectories. We evaluate the performance of ODTP on\nthe widely used nuScenes dataset for autonomous driving. Extensive experiments\nshow that ODPT achieves high performance end-to-end trajectory prediction.\nDCENet++, with the enhanced dynamic maps, predicts more accurate trajectories\nthan its base model. It is also more robust when compared with other generative\nand deterministic trajectory prediction models trained on noisy detection\nresults.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:46:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cheng","Hao",""],["liu","Mengmeng",""],["Chen","Lin",""]]}
{"id":"2308.05028","submitter":"Giulio Crisanti","authors":"Taushif Ahmed, Giulio Crisanti, Federico Gasparotto, Syed Mehedi\n  Hasan, Pierpaolo Mastrolia","title":"Two-loop Vertices with Vacuum Polarization Insertion","comments":"20 pages, 3 figures, 2 ancillary files","journal-ref":null,"doi":null,"report-no":"MITP-23-041","categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the analytic evaluation of the second-order corrections to the\nmassive form factors, due to two-loop vertex diagrams with a vacuum\npolarization insertion, with exact dependence on the external and internal\nfermion masses, and on the squared momentum transfer. We consider vector,\naxial-vector, scalar and pseudoscalar interactions between the external fermion\nand the external field. After renormalization, the finite expressions of the\nform factors are expressed in terms of polylogarithms up to weight three.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:52:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ahmed","Taushif",""],["Crisanti","Giulio",""],["Gasparotto","Federico",""],["Hasan","Syed Mehedi",""],["Mastrolia","Pierpaolo",""]]}
{"id":"2308.05029","submitter":"Ra\\'ul Alonso Rodr\\'iguez","authors":"Ra\\'ul Alonso, Qiao He, Mishty Ray, Mart\\'i Roset","title":"Dihedral long root A-packets of $p$-adic $G_2$ via theta correspondence","comments":"41 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct local Arthur packets associated with a dihedral long root\n$A$-parameter of a split reductive group of type $G_2$ over a nonarchimedian\nlocal field of characteristic zero. The construction relies on an exceptional\ncorrespondence for the pair $(\\mathrm{PU}_3\\rtimes \\mathbb{Z}/2\\mathbb{Z},\nG_2)$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:55:14 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Alonso","Ra\u00fal",""],["He","Qiao",""],["Ray","Mishty",""],["Roset","Mart\u00ed",""]]}
{"id":"2308.05030","submitter":"Yuri Makeenko","authors":"Yuri Makeenko","title":"Exact solution of higher-derivative conformal theory and minimal models","comments":"11 pages. arXiv admin note: text overlap with arXiv:2307.06295; v2:\n  polished","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-lat math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  I investigate the two-dimensional four-derivative conformal theory that\nemerges from the Nambu-Goto string after the path-integration over all fields\nbut the metric tensor. Using the method of singular products which accounts for\ntremendous cancellations in perturbation theory, I show the (intelligent)\none-loop approximation to give an exact solution. It is conveniently described\nthrough the minimal models where the central charge $c$ in the Kac spectrum\ndepends on the parameters of the four-derivative action. The relation is\nnonlinear so the domain of physical parameters is mapped onto $c<1$ thus\nbypassing the KPZ barrier of the Liouville action.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:59:02 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 13:19:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Makeenko","Yuri",""]]}
{"id":"2308.05031","submitter":"David Reger","authors":"David Reger and Elia Merzari and Saya Lee and Paolo Balestra and\n  Yassin Hassan","title":"High-fidelity simulation of pebble beds: Toward an improved\n  understanding of the wall channeling effect","comments":"12 pages, 10 figures, part of the NURETH-20 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wall channeling is a phenomena of interest for Pebble Bed Reactors (PBRs)\nwhere flow is diverted into high-porosity regions near the wall. This diversion\nof flow can have a significant impact on maximum fuel temperatures and core\nbypass flow. Porous media models that are currently used to model PBRs for\ndesign scoping and transient simulation are lacking in their capabilities to\nmodel the wall channel effect. Recent efforts at Penn State have produced an\nimproved porous media pressure drop equation that is more capable of modeling\nthe velocity variations caused by the wall channel effect in a porous media\nmodel. Several pebble beds were divided into concentric rings of $0.05D_{peb}$,\nand average flow quantities and porosities were extracted for the ring. A\ncorrelation between the form loss coefficient and the local ring porosity was\nfound, allowing for the addition of a correction factor to the form loss term\nof the KTA equation. The developed correlation was purely empirical, and thus a\nmore thorough understanding of the underlying flow phenomena is desired. This\nstudy investigates geometric and flow features that can explain the observed\ncorrelation between the form coefficient and the local porosity that was used\nto generate the improved pressure drop equation. The solid surface area to\nvolume ratio $S_v$ along with the production of Turbulent Kinetic Energy (TKE)\nis analyzed. A relationship between $S_v$ and the local porosity and an inverse\nrelationship between the negative TKE production and the local porosity were\nfound, pointing to the idea that inertial effects caused by different pore\ngeometry in each ring contribute to the variation of the form constant with the\nlocal porosity.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:59:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Reger","David",""],["Merzari","Elia",""],["Lee","Saya",""],["Balestra","Paolo",""],["Hassan","Yassin",""]]}
{"id":"2308.05032","submitter":"Akhil Meethal","authors":"Akhil Meethal, Eric Granger, Marco Pedersoli","title":"Density Crop-guided Semi-supervised Object Detection in Aerial Images","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  One of the important bottlenecks in training modern object detectors is the\nneed for labeled images where bounding box annotations have to be produced for\neach object present in the image. This bottleneck is further exacerbated in\naerial images where the annotators have to label small objects often\ndistributed in clusters on high-resolution images. In recent days, the\nmean-teacher approach trained with pseudo-labels and weak-strong augmentation\nconsistency is gaining popularity for semi-supervised object detection.\nHowever, a direct adaptation of such semi-supervised detectors for aerial\nimages where small clustered objects are often present, might not lead to\noptimal results. In this paper, we propose a density crop-guided\nsemi-supervised detector that identifies the cluster of small objects during\ntraining and also exploits them to improve performance at inference. During\ntraining, image crops of clusters identified from labeled and unlabeled images\nare used to augment the training set, which in turn increases the chance of\ndetecting small objects and creating good pseudo-labels for small objects on\nthe unlabeled images. During inference, the detector is not only able to detect\nthe objects of interest but also regions with a high density of small objects\n(density crops) so that detections from the input image and detections from\nimage crops are combined, resulting in an overall more accurate object\nprediction, especially for small objects. Empirical studies on the popular\nbenchmarks of VisDrone and DOTA datasets show the effectiveness of our density\ncrop-guided semi-supervised detector with an average improvement of more than\n2\\% over the basic mean-teacher method in COCO style AP. Our code is available\nat: https://github.com/akhilpm/DroneSSOD.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:59:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Meethal","Akhil",""],["Granger","Eric",""],["Pedersoli","Marco",""]]}
{"id":"2308.05033","submitter":"Aalok Misra","authors":"Aalok Misra, Gopal Yadav","title":"QCD-Compatible Supermassive Inert Top-Down Holographic Mesinos at\n  Intermediate Coupling","comments":"LaTeX; 1+25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A longstanding problem with the popular Sakai-Sugimoto holographic dual of\nthermal QCD is that the ``mesinos'', the (non-supersymmetric) fermionic\npartners of the mesons, are nearly isospectral with mesons and have an\nunsuppressed mesino-meson interaction, both being in contradiction with actual\nQCD. We solve this problem in a UV-complete (and ${\\it different}$) type IIA\nstring dual ${\\it at\\ intermediate\\ coupling}$ of realistic thermal QCD, in\nwhich the mesinos are shown to be much heavier than and non-interacting with\nmesons (the wave-function/mass/interaction terms receiving no ${\\cal M}$-theory\n${\\cal O}(R^4)$ corrections).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:02:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Misra","Aalok",""],["Yadav","Gopal",""]]}
{"id":"2308.05034","submitter":"Thomas Pasquier","authors":"Zijun Cheng, Qiujian Lv, Jinyuan Liang, Yan Wang, Degang Sun, Thomas\n  Pasquier, Xueyuan Han","title":"Kairos: Practical Intrusion Detection and Investigation using\n  Whole-system Provenance","comments":"23 pages, 16 figures, to appear in the 45th IEEE Symposium on\n  Security and Privacy (S&P'24)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Provenance graphs are structured audit logs that describe the history of a\nsystem's execution. Recent studies have explored a variety of techniques to\nanalyze provenance graphs for automated host intrusion detection, focusing\nparticularly on advanced persistent threats. Sifting through their design\ndocuments, we identify four common dimensions that drive the development of\nprovenance-based intrusion detection systems (PIDSes): scope (can PIDSes detect\nmodern attacks that infiltrate across application boundaries?), attack\nagnosticity (can PIDSes detect novel attacks without a priori knowledge of\nattack characteristics?), timeliness (can PIDSes efficiently monitor host\nsystems as they run?), and attack reconstruction (can PIDSes distill attack\nactivity from large provenance graphs so that sysadmins can easily understand\nand quickly respond to system intrusion?). We present KAIROS, the first PIDS\nthat simultaneously satisfies the desiderata in all four dimensions, whereas\nexisting approaches sacrifice at least one and struggle to achieve comparable\ndetection performance.\n  Kairos leverages a novel graph neural network-based encoder-decoder\narchitecture that learns the temporal evolution of a provenance graph's\nstructural changes to quantify the degree of anomalousness for each system\nevent. Then, based on this fine-grained information, Kairos reconstructs attack\nfootprints, generating compact summary graphs that accurately describe\nmalicious activity over a stream of system audit logs. Using state-of-the-art\nbenchmark datasets, we demonstrate that Kairos outperforms previous approaches.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:04:55 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 06:36:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cheng","Zijun",""],["Lv","Qiujian",""],["Liang","Jinyuan",""],["Wang","Yan",""],["Sun","Degang",""],["Pasquier","Thomas",""],["Han","Xueyuan",""]]}
{"id":"2308.05035","submitter":"Sara Sangalli","authors":"Sara Sangalli, Ertunc Erdil, Ender Konukoglu","title":"Expert load matters: operating networks at high accuracy and low manual\n  effort","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In human-AI collaboration systems for critical applications, in order to\nensure minimal error, users should set an operating point based on model\nconfidence to determine when the decision should be delegated to human experts.\nSamples for which model confidence is lower than the operating point would be\nmanually analysed by experts to avoid mistakes. Such systems can become truly\nuseful only if they consider two aspects: models should be confident only for\nsamples for which they are accurate, and the number of samples delegated to\nexperts should be minimized. The latter aspect is especially crucial for\napplications where available expert time is limited and expensive, such as\nhealthcare. The trade-off between the model accuracy and the number of samples\ndelegated to experts can be represented by a curve that is similar to an ROC\ncurve, which we refer to as confidence operating characteristic (COC) curve. In\nthis paper, we argue that deep neural networks should be trained by taking into\naccount both accuracy and expert load and, to that end, propose a new\ncomplementary loss function for classification that maximizes the area under\nthis COC curve. This promotes simultaneously the increase in network accuracy\nand the reduction in number of samples delegated to humans. We perform\nexperiments on multiple computer vision and medical image datasets for\nclassification. Our results demonstrate that the proposed loss improves\nclassification accuracy and delegates less number of decisions to experts,\nachieves better out-of-distribution samples detection and on par calibration\nperformance compared to existing loss functions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:08:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sangalli","Sara",""],["Erdil","Ertunc",""],["Konukoglu","Ender",""]]}
{"id":"2308.05036","submitter":"Sravan Reddy Chintareddy","authors":"Sravan Reddy Chintareddy, Keenan Roach, Kenny Cheung, Morteza Hashemi","title":"Collaborative Wideband Spectrum Sensing and Scheduling for Networked\n  UAVs in UTM Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG cs.MA cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a data-driven framework for collaborative wideband\nspectrum sensing and scheduling for networked unmanned aerial vehicles (UAVs),\nwhich act as the secondary users to opportunistically utilize detected spectrum\nholes. To this end, we propose a multi-class classification problem for\nwideband spectrum sensing to detect vacant spectrum spots based on collected\nI/Q samples. To enhance the accuracy of the spectrum sensing module, the\noutputs from the multi-class classification by each individual UAV are fused at\na server in the unmanned aircraft system traffic management (UTM) ecosystem. In\nthe spectrum scheduling phase, we leverage reinforcement learning (RL)\nsolutions to dynamically allocate the detected spectrum holes to the secondary\nusers (i.e., UAVs). To evaluate the proposed methods, we establish a\ncomprehensive simulation framework that generates a near-realistic synthetic\ndataset using MATLAB LTE toolbox by incorporating base-station~(BS) locations\nin a chosen area of interest, performing ray-tracing, and emulating the primary\nusers channel usage in terms of I/Q samples. This evaluation methodology\nprovides a flexible framework to generate large spectrum datasets that could be\nused for developing ML/AI-based spectrum management solutions for aerial\ndevices.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:08:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chintareddy","Sravan Reddy",""],["Roach","Keenan",""],["Cheung","Kenny",""],["Hashemi","Morteza",""]]}
{"id":"2308.05037","submitter":"Xubo Liu","authors":"Xubo Liu, Qiuqiang Kong, Yan Zhao, Haohe Liu, Yi Yuan, Yuzhuo Liu, Rui\n  Xia, Yuxuan Wang, Mark D. Plumbley, Wenwu Wang","title":"Separate Anything You Describe","comments":"Project Page:\n  https://audio-agi.github.io/Separate-Anything-You-Describe; Code:\n  https://github.com/Audio-AGI/AudioSep","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.AI cs.MM cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Language-queried audio source separation (LASS) is a new paradigm for\ncomputational auditory scene analysis (CASA). LASS aims to separate a target\nsound from an audio mixture given a natural language query, which provides a\nnatural and scalable interface for digital audio applications. Recent works on\nLASS, despite attaining promising separation performance on specific sources\n(e.g., musical instruments, limited classes of audio events), are unable to\nseparate audio concepts in the open domain. In this work, we introduce\nAudioSep, a foundation model for open-domain audio source separation with\nnatural language queries. We train AudioSep on large-scale multimodal datasets\nand extensively evaluate its capabilities on numerous tasks including audio\nevent separation, musical instrument separation, and speech enhancement.\nAudioSep demonstrates strong separation performance and impressive zero-shot\ngeneralization ability using audio captions or text labels as queries,\nsubstantially outperforming previous audio-queried and language-queried sound\nseparation models. For reproducibility of this work, we will release the source\ncode, evaluation benchmark and pre-trained model at:\nhttps://github.com/Audio-AGI/AudioSep.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:09:44 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Liu","Xubo",""],["Kong","Qiuqiang",""],["Zhao","Yan",""],["Liu","Haohe",""],["Yuan","Yi",""],["Liu","Yuzhuo",""],["Xia","Rui",""],["Wang","Yuxuan",""],["Plumbley","Mark D.",""],["Wang","Wenwu",""]]}
{"id":"2308.05038","submitter":"Himarsha R Jayanetti","authors":"Himarsha R. Jayanetti, Erika Frydenlund, Michele C. Weigle","title":"Xenophobic Events vs. Refugee Population -- Using GDELT to Identify\n  Countries with Disproportionate Coverage","comments":"10 pages, 2 figures, accepted as a Working Paper at SBP-BRiMS 2023.\n  arXiv admin note: text overlap with arXiv:2305.01708","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this preliminary study, we used the Global Database of Events, Language,\nand Tone (GDELT) database to examine xenophobic events reported in the media\nduring 2022. We collected a dataset of 2,778 unique events and created a\nchoropleth map illustrating the frequency of events scaled by the refugee\npopulation's proportion in each host country. We identified the top 10\ncountries with the highest scaled event frequencies among those with more than\n50,000 refugees. Contrary to the belief that hosting a significant number of\nforced migrants results in higher xenophobic incidents, our findings indicate a\npotential connection to political factors. We also categorized the 20 root\nevent codes in the CAMEO event data as either \"Direct\" or \"Indirect\". Almost\n90% of the events related to refugees in 2022 were classified as \"Indirect\".\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:10:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Jayanetti","Himarsha R.",""],["Frydenlund","Erika",""],["Weigle","Michele C.",""]]}
{"id":"2308.05039","submitter":"Lewis Hill","authors":"Lewis Hill, Eva-Maria Hirmer, Graeme Campbell, Toby Bi, Alekhya Ghosh,\n  Pascal Del'Haye and Gian-Luca Oppo","title":"Symmetry Broken Vectorial Kerr Frequency Combs from Fabry-P\\'erot\n  Resonators","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical frequency combs find many applications in metrology, frequency\nstandards, communications and photonic devices. We consider field polarization\nproperties and describe a vector comb generation through the spontaneous\nsymmetry breaking of temporal cavity solitons within coherently driven,\npassive, Fabry-P\\'erot cavities with Kerr nonlinearity. Global coupling effects\ndue to the interactions of counter-propagating light restrict the maximum\nnumber of soliton pairs within the cavity - even down to a single soliton pair\n- and force long range polarization conformity in trains of vector solitons.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:10:30 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 15:19:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hill","Lewis",""],["Hirmer","Eva-Maria",""],["Campbell","Graeme",""],["Bi","Toby",""],["Ghosh","Alekhya",""],["Del'Haye","Pascal",""],["Oppo","Gian-Luca",""]]}
{"id":"2308.05040","submitter":"Ahmet Ercan Tekden","authors":"Ahmet Tekden, Marc Peter Deisenroth, Yasemin Bekiroglu","title":"Neural Field Movement Primitives for Joint Modelling of Scenes and\n  Motions","comments":"Accepted to IROS 2023. 8 pages, 7 figures, 2 tables. Project Page:\n  https://fzaero.github.io/NFMP/","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 novel Learning from Demonstration (LfD) method that\nuses neural fields to learn new skills efficiently and accurately. It achieves\nthis by utilizing a shared embedding to learn both scene and motion\nrepresentations in a generative way. Our method smoothly maps each expert\ndemonstration to a scene-motion embedding and learns to model them without\nrequiring hand-crafted task parameters or large datasets. It achieves data\nefficiency by enforcing scene and motion generation to be smooth with respect\nto changes in the embedding space. At inference time, our method can retrieve\nscene-motion embeddings using test time optimization, and generate precise\nmotion trajectories for novel scenes. The proposed method is versatile and can\nemploy images, 3D shapes, and any other scene representations that can be\nmodeled using neural fields. Additionally, it can generate both end-effector\npositions and joint angle-based trajectories. Our method is evaluated on tasks\nthat require accurate motion trajectory generation, where the underlying task\nparametrization is based on object positions and geometric scene changes.\nExperimental results demonstrate that the proposed method outperforms the\nbaseline approaches and generalizes to novel scenes. Furthermore, in real-world\nexperiments, we show that our method can successfully model multi-valued\ntrajectories, it is robust to the distractor objects introduced at inference\ntime, and it can generate 6D motions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:14:19 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 14:21:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tekden","Ahmet",""],["Deisenroth","Marc Peter",""],["Bekiroglu","Yasemin",""]]}
{"id":"2308.05041","submitter":"Simone Baldassarri","authors":"Simone Baldassarri, Vanessa Jacquier, Alessandro Zocca","title":"Critical configurations of the hard-core model on square grid graphs","comments":"42 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.stat-mech math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the hard-core model on a finite square grid graph with stochastic\nGlauber dynamics parametrized by the inverse temperature $\\beta$. We\ninvestigate how the transition between its two maximum-occupancy configurations\ntakes place in the low-temperature regime $\\beta\\to\\infty$ in the case of\nperiodic boundary conditions. The hard-core constraints and the grid symmetry\nmake the structure of the critical configurations, also known as essential\nsaddles, for this transition very rich and complex. We provide a comprehensive\ngeometrical characterization of the set of critical configurations that are\nasymptotically visited with probability one. In particular, we develop a novel\nisoperimetric inequality for hard-core configurations with a fixed number of\nparticles and we show how not only their size but also their shape determines\nthe characterization of the saddles.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:16:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Baldassarri","Simone",""],["Jacquier","Vanessa",""],["Zocca","Alessandro",""]]}
{"id":"2308.05042","submitter":"Haim Grebel","authors":"H. Grebel","title":"An Electrical Grid with Discrete Energy Levels","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Minimizing both power fluctuations and energy waste in an electrical grid is\na central challenge to energy policy. Any discrepancy between power production\nand loads may lead to inefficiencies and instability in the system. While\nsensors and predictive models, which are based on historical data, have been\nimplemented to make the grid more responsive to instabilities, they have\ndifficulty addressing fluctuations in real time. Here we explore a model of an\nelectrical grid which delivers discrete energy to the nodes and is supported by\nshort-term energy storage units (STESU). The model is analyzed within the\nframework of randomly perturbed Markovian chain. We show that under reasonable\nassumptions the averaged energy in the grid maintains stability under randomly\nfluctuating energy conditions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:17:30 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Grebel","H.",""]]}
{"id":"2308.05043","submitter":"Peter Oliver","authors":"Peter Oliver, Eugene Zhang, Yue Zhang","title":"Scalable Hypergraph Visualization","comments":"15 pages, 19 figures, to be published in VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hypergraph visualization has many applications in network data analysis.\nRecently, a polygon-based representation for hypergraphs has been proposed with\ndemonstrated benefits. However, the polygon-based layout often suffers from\nexcessive self-intersections when the input dataset is relatively large. In\nthis paper, we propose a framework in which the hypergraph is iteratively\nsimplified through a set of atomic operations. Then, the layout of the simplest\nhypergraph is optimized and used as the foundation for a reverse process that\nbrings the simplest hypergraph back to the original one, but with an improved\nlayout. At the core of our approach is the set of atomic simplification\noperations and an operation priority measure to guide the simplification\nprocess. In addition, we introduce necessary definitions and conditions for\nhypergraph planarity within the polygon representation. We extend our approach\nto handle simultaneous simplification and layout optimization for both the\nhypergraph and its dual. We demonstrate the utility of our approach with\ndatasets from a number of real-world applications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:17:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Oliver","Peter",""],["Zhang","Eugene",""],["Zhang","Yue",""]]}
{"id":"2308.05044","submitter":"Oliver Schlotterer","authors":"Eric D'Hoker, Martijn Hidding and Oliver Schlotterer","title":"Cyclic products of higher-genus Szeg\\\"o kernels, modular tensors and\n  polylogarithms","comments":"5.5 + 1.5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A wealth of information on multiloop string amplitudes is encoded in\ntwo-point functions of worldsheet fermions known as Szeg\\\"o kernels. Cyclic\nproducts of an arbitrary number of Szeg\\\"o kernels for any even spin structure\n$\\delta$ on a Riemann surface of arbitrary genus are decomposed into linear\ncombinations of modular tensors on moduli space that carry all the dependence\non the spin structure $\\delta$. The coefficients in these linear combinations\nare independent of $\\delta$, carry all the dependence on the marked points and\nare composed of the integration kernels of higher-genus polylogarithms\nconstructed in arXiv:2306.08644. The conditions under which these modular\ntensors are locally holomorphic on moduli space are determined and explicit\nformulas for the special case of genus two are presented.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:18:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["D'Hoker","Eric",""],["Hidding","Martijn",""],["Schlotterer","Oliver",""]]}
{"id":"2308.05045","submitter":"Hong Ye Tan","authors":"Hong Ye Tan, Subhadip Mukherjee, Junqi Tang, Carola-Bibiane\n  Sch\\\"onlieb","title":"Boosting Data-Driven Mirror Descent with Randomization, Equivariance,\n  and Acceleration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning-to-optimize (L2O) is an emerging research area in large-scale\noptimization for data science applications. Very recently, researchers have\nproposed a novel L2O framework called learned mirror descent (LMD), based on\nthe classical mirror descent (MD) algorithm, with learnable mirror maps\nparameterized by input-convex neural networks. The LMD approach has been shown\nto significantly accelerate convex solvers while inheriting the convergence\nproperties of the classical MD algorithm. Despite the initial successes in\nsmall-/mid-scale optimization problems demonstrating the potential of this\nframework, there is still a long way to go to make this scheme scalable and\npractical for high-dimensional problems. In this work, we provide several\npractical extensions of the LMD algorithm. We first propose accelerated and\nstochastic variants of LMD, leveraging classical momentum-based acceleration\nand stochastic optimization techniques for improving the convergence rate and\nper-iteration complexity. Moreover, for the particular application of training\nneural networks, we derive and propose a novel and efficient parameterization\nfor the mirror potential, exploiting the equivariant structure of the training\nproblems to significantly reduce the dimensionality of the underlying problem.\nWe provide theoretical convergence guarantees for our schemes under standard\nassumptions, and demonstrate their effectiveness in various computational\nimaging and machine learning applications such as image inpainting and the\ntraining of SVMs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:19:13 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tan","Hong Ye",""],["Mukherjee","Subhadip",""],["Tang","Junqi",""],["Sch\u00f6nlieb","Carola-Bibiane",""]]}
{"id":"2308.05046","submitter":"Sameer Khanna","authors":"Sameer Khanna, Adam Dejl, Kibo Yoon, Quoc Hung Truong, Hanh Duong,\n  Agustina Saenz, Pranav Rajpurkar","title":"RadGraph2: Modeling Disease Progression in Radiology Reports via\n  Hierarchical Information Extraction","comments":"Accepted at Machine Learning for Healthcare 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present RadGraph2, a novel dataset for extracting information from\nradiology reports that focuses on capturing changes in disease state and device\nplacement over time. We introduce a hierarchical schema that organizes entities\nbased on their relationships and show that using this hierarchy during training\nimproves the performance of an information extraction model. Specifically, we\npropose a modification to the DyGIE++ framework, resulting in our model HGIE,\nwhich outperforms previous models in entity and relation extraction tasks. We\ndemonstrate that RadGraph2 enables models to capture a wider variety of\nfindings and perform better at relation extraction compared to those trained on\nthe original RadGraph dataset. Our work provides the foundation for developing\nautomated systems that can track disease progression over time and develop\ninformation extraction models that leverage the natural hierarchy of labels in\nthe medical domain.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:19:43 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Khanna","Sameer",""],["Dejl","Adam",""],["Yoon","Kibo",""],["Truong","Quoc Hung",""],["Duong","Hanh",""],["Saenz","Agustina",""],["Rajpurkar","Pranav",""]]}
{"id":"2308.05047","submitter":"Dennis Willsch","authors":"Dennis Willsch, Madita Willsch, Fengping Jin, Hans De Raedt, Kristel\n  Michielsen","title":"Large-scale simulation of Shor's quantum factoring algorithm","comments":"open source code available at https://jugit.fz-juelich.de/qip/shorgpu","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shor's factoring algorithm is one of the most anticipated applications of\nquantum computing. However, the limited capabilities of today's quantum\ncomputers only permit a study of Shor's algorithm for very small numbers. Here\nwe show how large GPU-based supercomputers can be used to assess the\nperformance of Shor's algorithm for numbers that are out of reach for current\nand near-term quantum hardware. First, we study Shor's original factoring\nalgorithm. While theoretical bounds suggest success probabilities of only 3-4\n%, we find average success probabilities above 50 %, due to a high frequency of\n\"lucky\" cases, defined as successful factorizations despite unmet sufficient\nconditions. Second, we investigate a powerful post-processing procedure, by\nwhich the success probability can be brought arbitrarily close to one, with\nonly a single run of Shor's quantum algorithm. Finally, we study the\neffectiveness of this post-processing procedure in the presence of typical\nerrors in quantum processing hardware. We find that the quantum factoring\nalgorithm exhibits a particular form of universality and resilience against the\ndifferent types of errors. The largest semiprime that we have factored by\nexecuting Shor's algorithm on a GPU-based supercomputer, without exploiting\nprior knowledge of the solution, is 549755813701 = 712321 * 771781. We put\nforward the challenge of factoring, without oversimplification, a non-trivial\nsemiprime larger than this number on any quantum computing device.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:19:52 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Willsch","Dennis",""],["Willsch","Madita",""],["Jin","Fengping",""],["De Raedt","Hans",""],["Michielsen","Kristel",""]]}
{"id":"2308.05048","submitter":"Yi Zhang","authors":"The Belle and Belle II Collaborations: I. Adachi, L. Aggarwal, H.\n  Aihara, N. Akopov, A. Aloisio, N. Anh Ky, D. M. Asner, H. Atmacan, T. Aushev,\n  V. Aushev, M. Aversano, R. Ayad, V. Babu, H. Bae, S. Bahinipati, P. Bambade,\n  Sw. Banerjee, M. Barrett, J. Baudot, M. Bauer, A. Baur, A. Beaubien, F.\n  Becherer, J. Becker, P. K. Behera, K. Belous, J. V. Bennett, F. U.\n  Bernlochner, V. Bertacchi, M. Bertemes, E. Bertholet, M. Bessner, S.\n  Bettarini, B. Bhuyan, F. Bianchi, T. Bilka, D. Biswas, A. Bobrov, D. Bodrov,\n  A. Bolz, A. Bondar, J. Borah, A. Bozek, M. Bra\\v{c}ko, P. Branchini, R. A.\n  Briere, T. E. Browder, A. Budano, S. Bussino, M. Campajola, L. Cao, G.\n  Casarosa, C. Cecchi, J. Cerasoli, M.-C. Chang, P. Chang, P. Cheema, V.\n  Chekelian, B. G. Cheon, K. Chilikin, K. Chirapatpimol, H.-E. Cho, K. Cho,\n  S.-K. Choi, Y. Choi, S. Choudhury, J. Cochran, L. Corona, L. M. Cremaldi, T.\n  Czank, S. Das, F. Dattola, E. De La Cruz-Burelo, S. A. De La Motte, G. de\n  Marino, G. De Nardo, M. De Nuccio, G. De Pietro, R. de Sangro, M. Destefanis,\n  S. Dey, A. De Yta-Hernandez, R. Dhamija, A. Di Canto, F. Di Capua, J.\n  Dingfelder, Z. Dole\\v{z}al, I. Dom\\'inguez Jim\\'enez, T. V. Dong, M. Dorigo,\n  K. Dort, D. Dossett, S. Dreyer, S. Dubey, G. Dujany, P. Ecker, M.\n  Eliachevitch, P. Feichtinger, T. Ferber, D. Ferlewicz, T. Fillinger, C.\n  Finck, G. Finocchiaro, A. Fodor, F. Forti, A. Frey, B. G. Fulsom, A.\n  Gabrielli, E. Ganiev, M. Garcia-Hernandez, R. Garg, A. Garmash, G. Gaudino,\n  V. Gaur, A. Gaz, A. Gellrich, G. Ghevondyan, D. Ghosh, H. Ghumaryan, G.\n  Giakoustidis, R. Giordano, A. Giri, B. Gobbo, R. Godang, O. Gogota, P.\n  Goldenzweig, W. Gradl, S. Granderath, E. Graziani, D. Greenwald, Z.\n  Gruberov\\'a, T. Gu, Y. Guan, K. Gudkova, S. Halder, Y. Han, T. Hara, K.\n  Hayasaka, H. Hayashii, S. Hazra, C. Hearty, M. T. Hedges, A. Heidelbach, I.\n  Heredia de la Cruz, M. Hern\\'andez Villanueva, A. Hershenhorn, T. Higuchi, E.\n  C. Hill, M. Hoek, M. Hohmann, P. Horak, W.-S. Hou, C.-L. Hsu, T. Iijima, K.\n  Inami, N. Ipsita, A. Ishikawa, S. Ito, R. Itoh, M. Iwasaki, P. Jackson, W. W.\n  Jacobs, E.-J. Jang, Q. P. Ji, S. Jia, Y. Jin, A. Johnson, H. Junkerkalefeld,\n  H. Kakuno, A. B. Kaliyar, J. Kandra, K. H. Kang, G. Karyan, T. Kawasaki, F.\n  Keil, C. Ketter, C. Kiesling, C.-H. Kim, D. Y. Kim, K.-H. Kim, Y.-K. Kim, H.\n  Kindo, K. Kinoshita, P. Kody\\v{s}, T. Koga, S. Kohani, K. Kojima, A. Korobov,\n  S. Korpar, E. Kovalenko, R. Kowalewski, T. M. G. Kraetzschmar, P. Kri\\v{z}an,\n  P. Krokovny, T. Kuhr, M. Kumar, R. Kumar, K. Kumara, T. Kunigo, A. Kuzmin,\n  Y.-J. Kwon, S. Lacaprara, Y.-T. Lai, T. Lam, L. Lanceri, J. S. Lange, M.\n  Laurenza, R. Leboucher, F. R. Le Diberder, M. J. Lee, P. Leitl, D. Levit, P.\n  M. Lewis, C. Li, J. Li, L. K. Li, Y. Li, J. Libby, Q. Y. Liu, Z. Q. Liu, D.\n  Liventsev, S. Longo, T. Lueck, T. Luo, C. Lyu, Y. Ma, M. Maggiora, S. P.\n  Maharana, R. Maiti, S. Maity, G. Mancinelli, R. Manfredi, E. Manoni, M.\n  Mantovano, D. Marcantonio, S. Marcello, C. Marinas, L. Martel, C. Martellini,\n  A. Martini, T. Martinov, L. Massaccesi, M. Masuda, T. Matsuda, D. Matvienko,\n  S. K. Maurya, J. A. McKenna, R. Mehta, F. Meier, M. Merola, F. Metzner, M.\n  Milesi, C. Miller, M. Mirra, K. Miyabayashi, R. Mizuk, G. B. Mohanty, N.\n  Molina-Gonzalez, S. Mondal, S. Moneta, H.-G. Moser, M. Mrvar, R. Mussa, I.\n  Nakamura, T. Nakano, Y. Nakazawa, A. Narimani Charan, M. Naruki, Z.\n  Natkaniec, A. Natochii, L. Nayak, G. Nazaryan, N. K. Nisar, S. Nishida, S.\n  Ogawa, H. Ono, Y. Onuki, P. Oskin, F. Otani, P. Pakhlov, G. Pakhlova, A.\n  Paladino, A. Panta, E. Paoloni, S. Pardi, K. Parham, H. Park, S.-H. Park, B.\n  Paschen, A. Passeri, S. Patra, S. Paul, T. K. Pedlar, I. Peruzzi, R. Peschke,\n  R. Pestotnik, F. Pham, M. Piccolo, L. E. Piilonen, P. L. M. Podesta-Lerma, T.\n  Podobnik, S. Pokharel, C. Praz, S. Prell, E. Prencipe, M. T. Prim, H. Purwar,\n  N. Rad, P. Rados, G. Raeuber, S. Raiz, M. Reif, S. Reiter, M. Remnev, I.\n  Ripp-Baudot, G. Rizzo, L. B. Rizzuto, S. H. Robertson, M. Roehrken, J. M.\n  Roney, A. Rostomyan, N. Rout, G. Russo, D. Sahoo, S. Sandilya, A. Sangal, L.\n  Santelj, Y. Sato, V. Savinov, B. Scavino, C. Schmitt, G. Schnell, C.\n  Schwanda, A. J. Schwartz, Y. Seino, A. Selce, K. Senyo, J. Serrano, M. E.\n  Sevior, C. Sfienti, W. Shan, C. Sharma, X. D. Shi, T. Shillington, J.-G.\n  Shiu, D. Shtol, A. Sibidanov, F. Simon, J. B. Singh, J. Skorupa, R. J. Sobie,\n  M. Sobotzik, A. Soffer, A. Sokolov, E. Solovieva, S. Spataro, B. Spruck, M.\n  Stari\\v{c}, P. Stavroulakis, S. Stefkova, Z. S. Stottler, R. Stroili, J.\n  Strube, M. Sumihama, K. Sumisawa, W. Sutcliffe, H. Svidras, M. Takahashi, M.\n  Takizawa, U. Tamponi, K. Tanida, F. Tenchini, A. Thaller, O. Tittel, R.\n  Tiwary, D. Tonelli, E. Torassa, N. Toutounji, K. Trabelsi, I. Tsaklidis, M.\n  Uchida, I. Ueda, S. Uehara, Y. Uematsu, T. Uglov, K. Unger, Y. Unno, K. Uno,\n  S. Uno, P. Urquijo, Y. Ushiroda, S. E. Vahsen, R. van Tonder, G. S. Varner,\n  K. E. Varvell, A. Vinokurova, V. S. Vismaya, L. Vitale, V. Vobbilisetti, R.\n  Volpe, B. Wach, M. Wakai, S. Wallner, D. Wang, E. Wang, M.-Z. Wang, Z. Wang,\n  A. Warburton, M. Watanabe, S. Watanuki, M. Welsch, C. Wessel, X. P. Xu, B. D.\n  Yabsley, S. Yamada, W. Yan, S. B. Yang, J. H. Yin, K. Yoshihara, C. Z. Yuan,\n  L. Zani, Y. Zhang, V. Zhilich, J. S. Zhou, Q. D. Zhou, V. I. Zhukova, R.\n  \\v{Z}leb\\v{c}\\'ik","title":"Measurement of branching-fraction ratios and $CP$ asymmetries in\n  $B^{\\pm} \\to D_{CP\\pm}K^{\\pm}$ decays at Belle and Belle II","comments":null,"journal-ref":null,"doi":null,"report-no":"Belle II Preprint 2023-011;KEK Preprint 2023-9","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report results from a study of $B^\\pm \\rightarrow DK^\\pm$ decays followed\nby $D$ decaying to $CP$~eigenstates, where $D$ indicates a $D^0$ or\n$\\bar{D}^{0}$ meson. These decays are sensitive to the\nCabibbo-Kobayashi-Maskawa unitarity-triangle angle $\\phi_{3}$. The results are\nbased on a combined analysis of the final data set of $772 \\times\n10^6~B\\bar{B}$ pairs collected by the Belle experiment and a data set of $198\n\\times 10^6~B\\bar{B}$ pairs collected by the Belle~II experiment, both in\nelectron-positron collisions at the $\\Upsilon(4S)$ resonance. We measure the\n$CP$ asymmetries to be $\\mathcal{ A}_{CP +} =~(+12.5 \\pm 5.8 \\pm 1.4)\\% $ and\n$\\mathcal{ A}_{CP -} =~(-16.7 \\pm 5.7 \\pm 0.6)\\%$, and the ratios of branching\nfractions to be $\\mathcal{ R}_{CP+}=~1.164 \\pm 0.081 \\pm 0.036 $ and $\\mathcal{\nR}_{CP-} =~1.151 \\pm 0.074 \\pm 0.019$. The first contribution to the\nuncertainties is statistical, and the second is systematic. The asymmetries\n$\\mathcal{A}_{CP +}$ and $\\mathcal{A}_{CP -}$ have similar magnitudes and\nopposite signs; their difference corresponds to 3.5~standard deviations. From\nthese values we calculate 68.3\\% confidence intervals of\n($8.5^{\\circ}<\\phi_{3}<16.5^{\\circ}$) or ($84.5^{\\circ}<\\phi_{3}<95.5^{\\circ}$)\nor ($163.3^{\\circ}<\\phi_{3}<171.5^{\\circ}$) and $0.321<r_{B}<0.465$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:20:05 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 03:40:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Belle","The",""],["Collaborations","Belle II",""],[":","",""],["Adachi","I.",""],["Aggarwal","L.",""],["Aihara","H.",""],["Akopov","N.",""],["Aloisio","A.",""],["Ky","N. Anh",""],["Asner","D. M.",""],["Atmacan","H.",""],["Aushev","T.",""],["Aushev","V.",""],["Aversano","M.",""],["Ayad","R.",""],["Babu","V.",""],["Bae","H.",""],["Bahinipati","S.",""],["Bambade","P.",""],["Banerjee","Sw.",""],["Barrett","M.",""],["Baudot","J.",""],["Bauer","M.",""],["Baur","A.",""],["Beaubien","A.",""],["Becherer","F.",""],["Becker","J.",""],["Behera","P. K.",""],["Belous","K.",""],["Bennett","J. V.",""],["Bernlochner","F. U.",""],["Bertacchi","V.",""],["Bertemes","M.",""],["Bertholet","E.",""],["Bessner","M.",""],["Bettarini","S.",""],["Bhuyan","B.",""],["Bianchi","F.",""],["Bilka","T.",""],["Biswas","D.",""],["Bobrov","A.",""],["Bodrov","D.",""],["Bolz","A.",""],["Bondar","A.",""],["Borah","J.",""],["Bozek","A.",""],["Bra\u010dko","M.",""],["Branchini","P.",""],["Briere","R. A.",""],["Browder","T. E.",""],["Budano","A.",""],["Bussino","S.",""],["Campajola","M.",""],["Cao","L.",""],["Casarosa","G.",""],["Cecchi","C.",""],["Cerasoli","J.",""],["Chang","M. -C.",""],["Chang","P.",""],["Cheema","P.",""],["Chekelian","V.",""],["Cheon","B. G.",""],["Chilikin","K.",""],["Chirapatpimol","K.",""],["Cho","H. -E.",""],["Cho","K.",""],["Choi","S. -K.",""],["Choi","Y.",""],["Choudhury","S.",""],["Cochran","J.",""],["Corona","L.",""],["Cremaldi","L. M.",""],["Czank","T.",""],["Das","S.",""],["Dattola","F.",""],["De La Cruz-Burelo","E.",""],["De La Motte","S. A.",""],["de Marino","G.",""],["De Nardo","G.",""],["De Nuccio","M.",""],["De Pietro","G.",""],["de Sangro","R.",""],["Destefanis","M.",""],["Dey","S.",""],["De Yta-Hernandez","A.",""],["Dhamija","R.",""],["Di Canto","A.",""],["Di Capua","F.",""],["Dingfelder","J.",""],["Dole\u017eal","Z.",""],["Jim\u00e9nez","I. Dom\u00ednguez",""],["Dong","T. V.",""],["Dorigo","M.",""],["Dort","K.",""],["Dossett","D.",""],["Dreyer","S.",""],["Dubey","S.",""],["Dujany","G.",""],["Ecker","P.",""],["Eliachevitch","M.",""],["Feichtinger","P.",""],["Ferber","T.",""],["Ferlewicz","D.",""],["Fillinger","T.",""],["Finck","C.",""],["Finocchiaro","G.",""],["Fodor","A.",""],["Forti","F.",""],["Frey","A.",""],["Fulsom","B. G.",""],["Gabrielli","A.",""],["Ganiev","E.",""],["Garcia-Hernandez","M.",""],["Garg","R.",""],["Garmash","A.",""],["Gaudino","G.",""],["Gaur","V.",""],["Gaz","A.",""],["Gellrich","A.",""],["Ghevondyan","G.",""],["Ghosh","D.",""],["Ghumaryan","H.",""],["Giakoustidis","G.",""],["Giordano","R.",""],["Giri","A.",""],["Gobbo","B.",""],["Godang","R.",""],["Gogota","O.",""],["Goldenzweig","P.",""],["Gradl","W.",""],["Granderath","S.",""],["Graziani","E.",""],["Greenwald","D.",""],["Gruberov\u00e1","Z.",""],["Gu","T.",""],["Guan","Y.",""],["Gudkova","K.",""],["Halder","S.",""],["Han","Y.",""],["Hara","T.",""],["Hayasaka","K.",""],["Hayashii","H.",""],["Hazra","S.",""],["Hearty","C.",""],["Hedges","M. T.",""],["Heidelbach","A.",""],["de la Cruz","I. Heredia",""],["Villanueva","M. Hern\u00e1ndez",""],["Hershenhorn","A.",""],["Higuchi","T.",""],["Hill","E. C.",""],["Hoek","M.",""],["Hohmann","M.",""],["Horak","P.",""],["Hou","W. -S.",""],["Hsu","C. -L.",""],["Iijima","T.",""],["Inami","K.",""],["Ipsita","N.",""],["Ishikawa","A.",""],["Ito","S.",""],["Itoh","R.",""],["Iwasaki","M.",""],["Jackson","P.",""],["Jacobs","W. W.",""],["Jang","E. -J.",""],["Ji","Q. P.",""],["Jia","S.",""],["Jin","Y.",""],["Johnson","A.",""],["Junkerkalefeld","H.",""],["Kakuno","H.",""],["Kaliyar","A. B.",""],["Kandra","J.",""],["Kang","K. H.",""],["Karyan","G.",""],["Kawasaki","T.",""],["Keil","F.",""],["Ketter","C.",""],["Kiesling","C.",""],["Kim","C. -H.",""],["Kim","D. Y.",""],["Kim","K. -H.",""],["Kim","Y. -K.",""],["Kindo","H.",""],["Kinoshita","K.",""],["Kody\u0161","P.",""],["Koga","T.",""],["Kohani","S.",""],["Kojima","K.",""],["Korobov","A.",""],["Korpar","S.",""],["Kovalenko","E.",""],["Kowalewski","R.",""],["Kraetzschmar","T. M. G.",""],["Kri\u017ean","P.",""],["Krokovny","P.",""],["Kuhr","T.",""],["Kumar","M.",""],["Kumar","R.",""],["Kumara","K.",""],["Kunigo","T.",""],["Kuzmin","A.",""],["Kwon","Y. -J.",""],["Lacaprara","S.",""],["Lai","Y. -T.",""],["Lam","T.",""],["Lanceri","L.",""],["Lange","J. S.",""],["Laurenza","M.",""],["Leboucher","R.",""],["Diberder","F. R. Le",""],["Lee","M. J.",""],["Leitl","P.",""],["Levit","D.",""],["Lewis","P. M.",""],["Li","C.",""],["Li","J.",""],["Li","L. K.",""],["Li","Y.",""],["Libby","J.",""],["Liu","Q. Y.",""],["Liu","Z. Q.",""],["Liventsev","D.",""],["Longo","S.",""],["Lueck","T.",""],["Luo","T.",""],["Lyu","C.",""],["Ma","Y.",""],["Maggiora","M.",""],["Maharana","S. P.",""],["Maiti","R.",""],["Maity","S.",""],["Mancinelli","G.",""],["Manfredi","R.",""],["Manoni","E.",""],["Mantovano","M.",""],["Marcantonio","D.",""],["Marcello","S.",""],["Marinas","C.",""],["Martel","L.",""],["Martellini","C.",""],["Martini","A.",""],["Martinov","T.",""],["Massaccesi","L.",""],["Masuda","M.",""],["Matsuda","T.",""],["Matvienko","D.",""],["Maurya","S. K.",""],["McKenna","J. A.",""],["Mehta","R.",""],["Meier","F.",""],["Merola","M.",""],["Metzner","F.",""],["Milesi","M.",""],["Miller","C.",""],["Mirra","M.",""],["Miyabayashi","K.",""],["Mizuk","R.",""],["Mohanty","G. B.",""],["Molina-Gonzalez","N.",""],["Mondal","S.",""],["Moneta","S.",""],["Moser","H. -G.",""],["Mrvar","M.",""],["Mussa","R.",""],["Nakamura","I.",""],["Nakano","T.",""],["Nakazawa","Y.",""],["Charan","A. Narimani",""],["Naruki","M.",""],["Natkaniec","Z.",""],["Natochii","A.",""],["Nayak","L.",""],["Nazaryan","G.",""],["Nisar","N. K.",""],["Nishida","S.",""],["Ogawa","S.",""],["Ono","H.",""],["Onuki","Y.",""],["Oskin","P.",""],["Otani","F.",""],["Pakhlov","P.",""],["Pakhlova","G.",""],["Paladino","A.",""],["Panta","A.",""],["Paoloni","E.",""],["Pardi","S.",""],["Parham","K.",""],["Park","H.",""],["Park","S. -H.",""],["Paschen","B.",""],["Passeri","A.",""],["Patra","S.",""],["Paul","S.",""],["Pedlar","T. K.",""],["Peruzzi","I.",""],["Peschke","R.",""],["Pestotnik","R.",""],["Pham","F.",""],["Piccolo","M.",""],["Piilonen","L. E.",""],["Podesta-Lerma","P. L. M.",""],["Podobnik","T.",""],["Pokharel","S.",""],["Praz","C.",""],["Prell","S.",""],["Prencipe","E.",""],["Prim","M. T.",""],["Purwar","H.",""],["Rad","N.",""],["Rados","P.",""],["Raeuber","G.",""],["Raiz","S.",""],["Reif","M.",""],["Reiter","S.",""],["Remnev","M.",""],["Ripp-Baudot","I.",""],["Rizzo","G.",""],["Rizzuto","L. B.",""],["Robertson","S. H.",""],["Roehrken","M.",""],["Roney","J. M.",""],["Rostomyan","A.",""],["Rout","N.",""],["Russo","G.",""],["Sahoo","D.",""],["Sandilya","S.",""],["Sangal","A.",""],["Santelj","L.",""],["Sato","Y.",""],["Savinov","V.",""],["Scavino","B.",""],["Schmitt","C.",""],["Schnell","G.",""],["Schwanda","C.",""],["Schwartz","A. J.",""],["Seino","Y.",""],["Selce","A.",""],["Senyo","K.",""],["Serrano","J.",""],["Sevior","M. E.",""],["Sfienti","C.",""],["Shan","W.",""],["Sharma","C.",""],["Shi","X. D.",""],["Shillington","T.",""],["Shiu","J. -G.",""],["Shtol","D.",""],["Sibidanov","A.",""],["Simon","F.",""],["Singh","J. B.",""],["Skorupa","J.",""],["Sobie","R. J.",""],["Sobotzik","M.",""],["Soffer","A.",""],["Sokolov","A.",""],["Solovieva","E.",""],["Spataro","S.",""],["Spruck","B.",""],["Stari\u010d","M.",""],["Stavroulakis","P.",""],["Stefkova","S.",""],["Stottler","Z. S.",""],["Stroili","R.",""],["Strube","J.",""],["Sumihama","M.",""],["Sumisawa","K.",""],["Sutcliffe","W.",""],["Svidras","H.",""],["Takahashi","M.",""],["Takizawa","M.",""],["Tamponi","U.",""],["Tanida","K.",""],["Tenchini","F.",""],["Thaller","A.",""],["Tittel","O.",""],["Tiwary","R.",""],["Tonelli","D.",""],["Torassa","E.",""],["Toutounji","N.",""],["Trabelsi","K.",""],["Tsaklidis","I.",""],["Uchida","M.",""],["Ueda","I.",""],["Uehara","S.",""],["Uematsu","Y.",""],["Uglov","T.",""],["Unger","K.",""],["Unno","Y.",""],["Uno","K.",""],["Uno","S.",""],["Urquijo","P.",""],["Ushiroda","Y.",""],["Vahsen","S. E.",""],["van Tonder","R.",""],["Varner","G. S.",""],["Varvell","K. E.",""],["Vinokurova","A.",""],["Vismaya","V. S.",""],["Vitale","L.",""],["Vobbilisetti","V.",""],["Volpe","R.",""],["Wach","B.",""],["Wakai","M.",""],["Wallner","S.",""],["Wang","D.",""],["Wang","E.",""],["Wang","M. -Z.",""],["Wang","Z.",""],["Warburton","A.",""],["Watanabe","M.",""],["Watanuki","S.",""],["Welsch","M.",""],["Wessel","C.",""],["Xu","X. P.",""],["Yabsley","B. D.",""],["Yamada","S.",""],["Yan","W.",""],["Yang","S. B.",""],["Yin","J. H.",""],["Yoshihara","K.",""],["Yuan","C. Z.",""],["Zani","L.",""],["Zhang","Y.",""],["Zhilich","V.",""],["Zhou","J. S.",""],["Zhou","Q. D.",""],["Zhukova","V. I.",""],["\u017dleb\u010d\u00edk","R.",""]]}
{"id":"2308.05049","submitter":"Martin Hairer","authors":"Martin Hairer and Harprit Singh","title":"Regularity Structures on Manifolds and Vector Bundles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a generalisation of the original theory of regularity structures,\n[Hai14], which is able to treat SPDEs on manifolds with values in vector\nbundles. Assume $M$ is a Riemannian manifold and $E\\to M$ and $F^i\\to M$ are\nvector bundles (with a metric and connection), this theory allows to solve\nsubcritical equations of the form $$ \\partial_t u + \\mathcal{L}u = \\sum_{i=0}^m\nG_i(u, \\nabla u,\\ldots, \\nabla^n u)\\xi_i\\ , $$ where $u$ is a (generalised)\nsection of $E$, $\\mathcal{L}$ is a uniformly elliptic operator on $E$ of order\nstrictly greater than $n$, the $\\xi_i$ are $F^i$-valued random distributions\n(e.g. $F^i$-valued white noises), and the $G_i:E\\times TM^*\\otimes E\n\\times\\ldots\\times (TM^*)^{\\otimes n} \\otimes E \\to L(F^i ,E)$ are local\nfunctions.\n  We apply our framework to three example equations which illustrate that when\n$\\mathcal{L}$ is a Laplacian it is possible in most cases to renormalise such\nequations by adding spatially homogeneous counterterms and we discuss in which\ncases more sophisticated renormalisation procedures (involving the curvature of\nthe underlying manifold) are required.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:22:16 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hairer","Martin",""],["Singh","Harprit",""]]}
{"id":"2308.05050","submitter":"Himangsu Bhaumik","authors":"Himangsu Bhaumik and Daniel Hexner","title":"Mechanical regularization","comments":"main + SI, total 15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Training materials through periodic drive allows to endow materials and\nstructures with complex elastic functions. As a result of the driving, the\nsystem explores the high dimensional space of structures, ultimately converging\nto a structure with the desired response. However, increasing the complexity of\nthe desired response results in ultra-slow convergence and degradation. Here,\nwe show that by constraining the search space we are able to increase\nrobustness, extend the maximal capacity, train responses that previously did\nnot converge, and in some cases to accelerate convergence by many orders of\nmagnitude. We identify the geometrical constraints that prevent the formation\nof spurious low-frequency modes, which are responsible for failure. We argue\nthat these constraints are analogous to regularization used in machine\nlearning. Our results present a unified understanding of the relations between\ncomplexity, degradation, convergence, and robustness.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:24:34 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bhaumik","Himangsu",""],["Hexner","Daniel",""]]}
{"id":"2308.05051","submitter":"Faegheh Sardari","authors":"Faegheh Sardari, Armin Mustafa, Philip J. B. Jackson, and Adrian\n  Hilton","title":"PAT: Position-Aware Transformer for Dense Multi-Label Action 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 PAT, a transformer-based network that learns complex temporal\nco-occurrence action dependencies in a video by exploiting multi-scale temporal\nfeatures. In existing methods, the self-attention mechanism in transformers\nloses the temporal positional information, which is essential for robust action\ndetection. To address this issue, we (i) embed relative positional encoding in\nthe self-attention mechanism and (ii) exploit multi-scale temporal\nrelationships by designing a novel non hierarchical network, in contrast to the\nrecent transformer-based approaches that use a hierarchical structure. We argue\nthat joining the self-attention mechanism with multiple sub-sampling processes\nin the hierarchical approaches results in increased loss of positional\ninformation. We evaluate the performance of our proposed approach on two\nchallenging dense multi-label benchmark datasets, and show that PAT improves\nthe current state-of-the-art result by 1.1% and 0.6% mAP on the Charades and\nMultiTHUMOS datasets, respectively, thereby achieving the new state-of-the-art\nmAP at 26.5% and 44.6%, respectively. We also perform extensive ablation\nstudies to examine the impact of the different components of our proposed\nnetwork.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:29:31 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Sardari","Faegheh",""],["Mustafa","Armin",""],["Jackson","Philip J. B.",""],["Hilton","Adrian",""]]}
{"id":"2308.05052","submitter":"Mohamed Benzaghta","authors":"Mohamed Benzaghta, Giovanni Geraci, David Lopez-Perez, and Alvaro\n  Valcarce","title":"Designing Cellular Networks for UAV Corridors via Bayesian Optimization","comments":"to be published in IEEE Global Communications Conference (GLOBECOM)\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As traditional cellular base stations (BSs) are optimized for 2D ground\nservice, providing 3D connectivity to uncrewed aerial vehicles (UAVs) requires\nre-engineering of the existing infrastructure. In this paper, we propose a new\nmethodology for designing cellular networks that cater for both ground users\nand UAV corridors based on Bayesian optimization. We present a case study in\nwhich we maximize the signal-to-interference-plus-noise ratio (SINR) for both\npopulations of users by optimizing the electrical antenna tilts and the\ntransmit power employed at each BS. Our proposed optimized network\nsignificantly boosts the UAV performance, with a 23.4dB gain in mean SINR\ncompared to an all-downtilt, full-power baseline. At the same time, this\noptimal tradeoff nearly preserves the performance on the ground, even attaining\na gain of 1.3dB in mean SINR with respect to said baseline. Thanks to its\nability to optimize black-box stochastic functions, the proposed framework is\namenable to maximize any desired function of the SINR or even the capacity per\narea.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:32:39 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Benzaghta","Mohamed",""],["Geraci","Giovanni",""],["Lopez-Perez","David",""],["Valcarce","Alvaro",""]]}
{"id":"2308.05053","submitter":"Yen-An Chen","authors":"Chih-Wei Chang and Yen-An Chen","title":"On toric foliations","comments":"27 pages. Comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we provide toric descriptions for the various foliation\nsingularities on toric varieties, especially for non-dicritical sigularities\nand F-dlt singularities. We then show the toric foliated minimal model program\nworks by demonstrating non-dicritical singularities and F-dlt singularities are\npreserved, respectively.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:32:42 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chang","Chih-Wei",""],["Chen","Yen-An",""]]}
{"id":"2308.05054","submitter":"Liwei Wang","authors":"Liwei Wang, Yilong Chang, Shuai Wu, Ruike Renee Zhao, Wei Chen","title":"Physics-aware differentiable design of magnetically actuated kirigami\n  for shape morphing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cs.CE cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Shape morphing that transforms morphologies in response to stimuli is crucial\nfor future multifunctional systems. While kirigami holds great promise in\nenhancing shape-morphing, existing designs primarily focus on kinematics and\noverlook the underlying physics. This study introduces a differentiable inverse\ndesign framework that considers the physical interplay between geometry,\nmaterials, and stimuli of active kirigami, made by soft material embedded with\nmagnetic particles, to realize target shape-morphing upon magnetic excitation.\nWe achieve this by combining differentiable kinematics and energy models into a\nconstrained optimization, simultaneously designing the cuts and magnetization\norientations to ensure kinematic and physical feasibility. Complex kirigami\ndesigns are obtained automatically with unparallel efficiency, which can be\nremotely controlled to morph into intricate target shapes and even multiple\nstates. The proposed framework can be extended to accommodate various active\nsystems, bridging geometry and physics to push the frontiers in shape-morphing\napplications, like flexible electronics and minimally invasive surgery.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:32:51 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Wang","Liwei",""],["Chang","Yilong",""],["Wu","Shuai",""],["Zhao","Ruike Renee",""],["Chen","Wei",""]]}
{"id":"2308.05055","submitter":"Zhuoao Xu","authors":"Zhuoao Xu, Gaojie Chen, Ryan Fernandez, Yue Gao, Rahim Tafazolli","title":"Enhancement of Direct LEO Satellite-to-Smartphone Communications by\n  Distributed Beamforming","comments":"11 pages, 14 figures, 2 tables","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":"  The low earth orbit (LEO) satellite network is undergoing rapid development\nwith the maturing of satellite communications and rocket launch technologies,\nand the demand for a global coverage network. However, current satellite\ncommunication networks are constrained by limited transmitting signal power,\nresulting in the use of large-size and energy-consuming ground terminals to\nprovide additional gain. This paper proposes a novel technology called\ndistributed beamforming to address such challenges and support direct\ncommunications from LEO satellites to smartphones. The proposed distributed\nbeamforming technique is based on the superposition of electromagnetic (EM)\nwaves and aims to enhance the received signal strength. Furthermore, we utilize\nEM wave superposition to increase the link budget and provide the coverage\npattern formed by the distributed antenna array, which will be affected by the\narray structure and the transmitter parameters. In addition, the impact of\nDoppler frequency shift and time misalignment on the performance of distributed\nbeamforming is investigated. Numerical results show that the enhancement of the\nreceived power depends on the angle formed by those radiated beams and can be\nup to the square of the number of beams; namely, a maximum enhancement of 6 dB\ncould be obtained by using two satellites and a maximum of 12 dB increase\nthrough four satellites, which provide a clear guideline for the design of\ndistributed beamforming for future satellite communications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:34:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Xu","Zhuoao",""],["Chen","Gaojie",""],["Fernandez","Ryan",""],["Gao","Yue",""],["Tafazolli","Rahim",""]]}
{"id":"2308.05056","submitter":"Szil\\'ard Csaba L\\'aszl\\'o Ph.D.","authors":"Mikhail Karapetyants, Szil\\'ard Csaba L\\'aszl\\'o","title":"A Nesterov type algorithm with double Tikhonov regularization: fast\n  convergence of the function values and strong convergence to the minimal norm\n  solution","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the strong convergence properties of a Nesterov type algorithm\nwith two Tikhonov regularization terms in connection to the minimization\nproblem of a smooth convex function $f.$ We show that the generated sequences\nconverge strongly to the minimal norm element from $\\argmin f$. We also show\nthat from a practical point of view the Tikhonov regularization does not affect\nNesterov's optimal convergence rate of order $\\mathcal{O}(n^{-2})$ for the\npotential energies $f(x_n)-\\min f$ and $f(y_n)-\\min f$, where $(x_n),\\,(y_n)$\nare the sequences generated by our algorithm. Further, we obtain fast\nconvergence to zero of the discrete velocity, but also some estimates\nconcerning the value of the gradient of the objective function in the generated\nsequences.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:36:43 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Karapetyants","Mikhail",""],["L\u00e1szl\u00f3","Szil\u00e1rd Csaba",""]]}
{"id":"2308.05057","submitter":"Pin-Gao Gu","authors":"Pin-Gao Gu, Howard Chen","title":"Deuterium Escape on Photoevaporating Sub-Neptunes","comments":"Accepted for publication in Astrophysical Journal 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":"  We investigate the evolution of the deuterium-to-hydrogen (D/H) mass ratio\ndriven by EUV photoevaporation of hydrogen-rich atmospheres of close-in\nsub-Neptunes around solar-type stars. For the first time, the diffusion-limited\napproach in conjunction with energy-limited photoevaporation is considered in\nevaluating deuterium escape from evolving exoplanet H/He envelopes. We find\nthat the planets with smaller initial gas envelopes and thus smaller sizes can\nlead to weaker atmospheric escape, which facilitates hydrogen-deuterium\nfractionation. Specifically, in our grid of simulations with a low envelope\nmass fraction less than 0.005, a low-mass sub-Neptune (4-$5M_\\oplus$) at about\n0.25-0.4 au or a high-mass sub-Neptune (10-$15M_\\oplus$) at about 0.1-0.25 au\ncan increase the D/H values by greater than 20% over 7.5 Gyr. Akin to the\nhelium-enhanced envelopes of sub-Neptunes due to photoevaporating escape, the\nplanets along the upper boundary of the radius valley are the best targets to\ndetect high D/H ratios. The ratio can rise by a factor of $\\lesssim$ 1.65\nwithin 7.5 Gyrs in our grid of evolutionary calculations. The D/H ratio is\nexpected to be higher in thinner envelopes as long as the planets do not become\nbare rocky cores.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:37:03 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 15:15:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gu","Pin-Gao",""],["Chen","Howard",""]]}
{"id":"2308.05058","submitter":"A. S. Lemos","authors":"A. S. Lemos, A. S. Pereira, F. A. Brito, Joao R. L. Santos","title":"Emergence of squeezed coherent states in Kaluza-Klein cosmology","comments":"22 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":"  In this work, we consider a propagating scalar field on Kaluza-Klein-type\ncosmological background. It is shown that this geometrical description of the\nUniverse resembles - from a Hamiltonian standpoint - a damped harmonic\noscillator with mass and frequency, both time-dependents. In this scenario, we\nconstruct the squeezed coherent states (SCSs) for the quantized scalar field by\nemploying the invariant operator method of Lewis-Riesenfeld (non-Hermitian) in\na non-unitary approach. The non-classicality of SCSs has been discussed by\nexamining the quadrature squeezing properties from the uncertainty principle.\nMoreover, we compute the probability density, which allows us to investigate\nwhether SCSs can be used to seek traces of extra dimensions. We then analyze\nthe effects of the existence of supplementary space on cosmological particle\nproduction in SCSs by considering different cosmological eras.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:37:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lemos","A. S.",""],["Pereira","A. S.",""],["Brito","F. A.",""],["Santos","Joao R. L.",""]]}
{"id":"2308.05059","submitter":"Gokulprasath R","authors":"Gokulprasath R","title":"A Novel Method for improving accuracy in neural network by reinstating\n  traditional back propagation technique","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":"  Deep learning has revolutionized industries like computer vision, natural\nlanguage processing, and speech recognition. However, back propagation, the\nmain method for training deep neural networks, faces challenges like\ncomputational overhead and vanishing gradients. In this paper, we propose a\nnovel instant parameter update methodology that eliminates the need for\ncomputing gradients at each layer. Our approach accelerates learning, avoids\nthe vanishing gradient problem, and outperforms state-of-the-art methods on\nbenchmark data sets. This research presents a promising direction for efficient\nand effective deep neural network training.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:41:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["R","Gokulprasath",""]]}
{"id":"2308.05060","submitter":"Yunbo Lyu","authors":"Yunbo Lyu, Hong Jin Kang, Ratnadira Widyasari, Julia Lawall, David Lo","title":"Evaluating SZZ Implementations: An Empirical Study on the Linux Kernel","comments":"Under review of IEEE Transactions on Software Engineering","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The SZZ algorithm is used to connect bug-fixing commits to the earlier\ncommits that introduced bugs. This algorithm has many applications and many\nvariants have been devised. However, there are some types of commits that\ncannot be traced by the SZZ algorithm, referred to as \"ghost commits\". The\nevaluation of how these ghost commits impact the SZZ algorithm remains limited.\nMoreover, these algorithms have been evaluated on datasets created by software\nengineering researchers from information in bug trackers and version controlled\nhistories. Since Oct 2013, the Linux kernel developers have started labelling\nbug-fixing patches with the commit identifiers of the corresponding\nbug-inducing commit(s) as a standard practice. As of v6.1-rc5, 76,046 pairs of\nbug-fixing patches and bug-inducing commits are available. This provides a\nunique opportunity to evaluate the SZZ algorithm on a large dataset that has\nbeen created and reviewed by project developers, entirely independently of the\nbiases of software engineering researchers.\n  In this paper, we apply six SZZ algorithms to 76,046 pairs of bug-fixing\npatches and bug-introducing commits from the Linux kernel. Our findings reveal\nthat SZZ algorithms experience a more significant decline in recall on our\ndataset (13.8%) as compared to prior findings reported by Rosa et al., and the\ndisparities between the individual SZZ algorithms diminish. Moreover, we find\nthat 17.47% of bug-fixing commits are ghost commits. Finally, we propose\nTracing-Commit SZZ (TC-SZZ), that traces all commits in the change history of\nlines modified or deleted in bug-fixing commits. Applying TC-SZZ to all failure\ncases, excluding ghost commits, we found that TC-SZZ could identify 17.7% of\nthem. Our further analysis found that 34.6% of bug-inducing commits were in the\nfunction history, 27.5% in the file history (but not in the function history),\nand...\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:41:27 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lyu","Yunbo",""],["Kang","Hong Jin",""],["Widyasari","Ratnadira",""],["Lawall","Julia",""],["Lo","David",""]]}
{"id":"2308.05061","submitter":"Liu Yang","authors":"Liu Yang, Tingwei Meng, Siting Liu, Stanley J. Osher","title":"Prompting In-Context Operator Learning with Sensor Data, Equations, and\n  Natural Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the growing domain of scientific machine learning, in-context operator\nlearning has demonstrated notable potential in learning operators from prompted\ndata during inference stage without weight updates. However, the current\nmodel's overdependence on sensor data, may inadvertently overlook the\ninvaluable human insight into the operator. To address this, we present a\ntransformation of in-context operator learning into a multi-modal paradigm. We\npropose the use of \"captions\" to integrate human knowledge about the operator,\nexpressed through natural language descriptions and equations. We illustrate\nhow this method not only broadens the flexibility and generality of\nphysics-informed learning, but also significantly boosts learning performance\nand reduces data needs. Furthermore, we introduce a more efficient neural\nnetwork architecture for multi-modal in-context operator learning, referred to\nas \"ICON-LM\", based on a language-model-like architecture. We demonstrate the\nviability of \"ICON-LM\" for scientific machine learning tasks, which creates a\nnew path for the application of language models.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:44:25 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Yang","Liu",""],["Meng","Tingwei",""],["Liu","Siting",""],["Osher","Stanley J.",""]]}
{"id":"2308.05062","submitter":"Holger Hoos","authors":"Chris Fawcett, Mauro Vallati, Holger H. Hoos, Alfonso E. Gerevini","title":"Competitions in AI -- Robustly Ranking Solvers Using Statistical\n  Resampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Solver competitions play a prominent role in assessing and advancing the\nstate of the art for solving many problems in AI and beyond. Notably, in many\nareas of AI, competitions have had substantial impact in guiding research and\napplications for many years, and for a solver to be ranked highly in a\ncompetition carries considerable weight. But to which extent can we expect\ncompetition results to generalise to sets of problem instances different from\nthose used in a particular competition? This is the question we investigate\nhere, using statistical resampling techniques. We show that the rankings\nresulting from the standard interpretation of competition results can be very\nsensitive to even minor changes in the benchmark instance set used as the basis\nfor assessment and can therefore not be expected to carry over to other samples\nfrom the same underlying instance distribution. To address this problem, we\nintroduce a novel approach to statistically meaningful analysis of competition\nresults based on resampling performance data. Our approach produces confidence\nintervals of competition scores as well as statistically robust solver rankings\nwith bounded error. Applied to recent SAT, AI planning and computer vision\ncompetitions, our analysis reveals frequent statistical ties in solver\nperformance as well as some inversions of ranks compared to the official\nresults based on simple scoring.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:47:04 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Fawcett","Chris",""],["Vallati","Mauro",""],["Hoos","Holger H.",""],["Gerevini","Alfonso E.",""]]}
{"id":"2308.05063","submitter":"Vipindev Adat Vasudevan","authors":"Jongchan Woo, Vipindev Adat Vasudevan, Benjamin Kim, Alejandro Cohen,\n  Rafael G. L. D'Oliveira, Thomas Stahlbuhk, and Muriel M\\'edard","title":"CERMET: Coding for Energy Reduction with Multiple Encryption Techniques\n  -- $It's\\ easy\\ being\\ green$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR cs.IT cs.SY eess.SY math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper presents CERMET, an energy-efficient hardware architecture\ndesigned for hardware-constrained cryptosystems. CERMET employs a base\ncryptosystem in conjunction with network coding to provide both\ninformation-theoretic and computational security while reducing energy\nconsumption per bit. This paper introduces the hardware architecture for the\nsystem and explores various optimizations to enhance its performance. The\nuniversality of the approach is demonstrated by designing the architecture to\naccommodate both asymmetric and symmetric cryptosystems. The analysis reveals\nthat the benefits of this proposed approach are multifold, reducing energy per\nbit and area without compromising security or throughput. The optimized\nhardware architectures can achieve below 1 pJ/bit operations for AES-256.\nFurthermore, for a public key cryptosystem based on Elliptic Curve Cryptography\n(ECC), a remarkable 14.6X reduction in energy per bit and a 9.3X reduction in\narea are observed, bringing it to less than 1 nJ/bit.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:47:35 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Woo","Jongchan",""],["Vasudevan","Vipindev Adat",""],["Kim","Benjamin",""],["Cohen","Alejandro",""],["D'Oliveira","Rafael G. L.",""],["Stahlbuhk","Thomas",""],["M\u00e9dard","Muriel",""]]}
{"id":"2308.05064","submitter":"Juan I. Collar","authors":"J. I. Collar, P. S. Cooper, and C. M. Lewis","title":"Search for a Non-Relativistic Boson in Two-Body Antimuon Decay","comments":"5 pages, 5 figures. V.2 includes a comparison with future sensitivity\n  of Mu3e in final figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.GA hep-ex nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate the feasibility of probing the charged lepton flavor violating\ndecay $\\mu^{+}\\!\\!\\rightarrow \\!e^{+} X^{0}$ for the presence of a slow-moving\nneutral boson $X^{0}$ capable of undergoing gravitational binding to large\nstructures, and as such able to participate in some cosmological scenarios. A\nshort exposure to surface antimuons from beamline M20 at TRIUMF generates a\nbranching ratio limit of $\\lesssim 10^{-5}$. This is comparable or better than\nprevious searches for this channel, although in a thus-far unexplored region of\n$X^{0}$ phase space very close to the kinematic limit of the decay. The future\nimproved sensitivity of the method using a customized p-type point contact\ngermanium detector is described.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:49:02 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 15:42:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Collar","J. I.",""],["Cooper","P. S.",""],["Lewis","C. M.",""]]}
{"id":"2308.05065","submitter":"D\\'aniel Virosztek","authors":"Gy\\\"orgy P\\'al Geh\\'er, Aranka Hru\\v{s}kov\\'a, Tam\\'as Titkos,\n  D\\'aniel Virosztek","title":"Isometric rigidity of Wasserstein spaces over Euclidean spheres","comments":"16 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math-ph math.FA math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the structure of isometries of the quadratic Wasserstein space\n$\\mathcal{W}_2\\left(\\mathbb{S}^n,\\varrho_{\\|\\cdot\\|}\\right)$ over the sphere\nendowed with the distance inherited from the norm of $\\mathbb{R}^{n+1}$. We\nprove that $\\mathcal{W}_2\\left(\\mathbb{S}^n,\\varrho_{\\|\\cdot\\|}\\right)$ is\nisometrically rigid, meaning that its isometry group is isomorphic to that of\n$\\left(\\mathbb{S}^n,\\varrho_{\\|\\cdot\\|}\\right)$. This is in striking contrast\nto the non-rigidity of its ambient space\n$\\mathcal{W}_2\\left(\\mathbb{R}^{n+1},\\varrho_{\\|\\cdot\\|}\\right)$ but in line\nwith the rigidity of the geodesic space\n$\\mathcal{W}_2\\left(\\mathbb{S}^n,\\sphericalangle\\right)$. One of the key steps\nof the proof is the use of mean squared error functions to mimic displacement\ninterpolation in $\\mathcal{W}_2\\left(\\mathbb{S}^n,\\varrho_{\\|\\cdot\\|}\\right)$.\nA major difficulty in proving rigidity for quadratic Wasserstein spaces is that\none cannot use the Wasserstein potential technique. To illustrate its general\npower, we use it to prove the isometric rigidity of\n$\\mathcal{W}_p\\left(\\mathbb{S}^1, \\varrho_{\\|\\cdot\\|}\\right)$ for $1 \\leq p<2.$\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:49:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Geh\u00e9r","Gy\u00f6rgy P\u00e1l",""],["Hru\u0161kov\u00e1","Aranka",""],["Titkos","Tam\u00e1s",""],["Virosztek","D\u00e1niel",""]]}
{"id":"2308.05066","submitter":"Daniel Daigle","authors":"Daniel Daigle","title":"Rigidity of Graded Integral Domains and of their Veronese Subrings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A ring R is said to be rigid if the only locally nilpotent derivation of R is\nthe zero derivation. Let B = (direct sum of B_n for n in Z) be a Z-graded\ncommutative integral domain of characteristic 0. For each positive integer d,\nconsider the Veronese subring B(d) of B, defined by B(d) = (direct sum of the\nB_n for n in dZ). We study the properties of the set of positive integers d\nsuch that B(d) is non-rigid, and give some applications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:52:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Daigle","Daniel",""]]}
{"id":"2308.05067","submitter":"Michael Dinitz","authors":"Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei\n  Vassilvitskii","title":"Controlling Tail Risk in Online Ski-Rental","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The classical ski-rental problem admits a textbook 2-competitive\ndeterministic algorithm, and a simple randomized algorithm that is\n$\\frac{e}{e-1}$-competitive in expectation. The randomized algorithm, while\noptimal in expectation, has a large variance in its performance: it has more\nthan a 37% chance of competitive ratio exceeding 2, and a $\\Theta(1/n)$ chance\nof the competitive ratio exceeding $n$!\n  We ask what happens to the optimal solution if we insist that the tail risk,\ni.e., the chance of the competitive ratio exceeding a specific value, is\nbounded by some constant $\\delta$. We find that this additional modification\nsignificantly changes the structure of the optimal solution. The probability of\npurchasing skis on a given day becomes non-monotone, discontinuous, and\narbitrarily large (for sufficiently small tail risk $\\delta$ and large purchase\ncost $n$).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:57:32 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Dinitz","Michael",""],["Im","Sungjin",""],["Lavastida","Thomas",""],["Moseley","Benjamin",""],["Vassilvitskii","Sergei",""]]}
{"id":"2308.05068","submitter":"Mohammad Al Fahim","authors":"Sneha Sree C, Mohammad Al Fahim, Keerthi Ram, Mohanasankar\n  Sivaprakasam","title":"Geometric Learning-Based Transformer Network for Estimation of\n  Segmentation Errors","comments":"Accepted in MICCAI workshop on ShapeMI, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Many segmentation networks have been proposed for 3D volumetric segmentation\nof tumors and organs at risk. Hospitals and clinical institutions seek to\naccelerate and minimize the efforts of specialists in image segmentation.\nStill, in case of errors generated by these networks, clinicians would have to\nmanually edit the generated segmentation maps. Given a 3D volume and its\nputative segmentation map, we propose an approach to identify and measure\nerroneous regions in the segmentation map. Our method can estimate error at any\npoint or node in a 3D mesh generated from a possibly erroneous volumetric\nsegmentation map, serving as a Quality Assurance tool. We propose a graph\nneural network-based transformer based on the Nodeformer architecture to\nmeasure and classify the segmentation errors at any point. We have evaluated\nour network on a high-resolution micro-CT dataset of the human inner-ear bony\nlabyrinth structure by simulating erroneous 3D segmentation maps. Our network\nincorporates a convolutional encoder to compute node-centric features from the\ninput micro-CT data, the Nodeformer to learn the latent graph embeddings, and a\nMulti-Layer Perceptron (MLP) to compute and classify the node-wise errors. Our\nnetwork achieves a mean absolute error of ~0.042 over other Graph Neural\nNetworks (GNN) and an accuracy of 79.53% over other GNNs in estimating and\nclassifying the node-wise errors, respectively. We also put forth vertex-normal\nprediction as a custom pretext task for pre-training the CNN encoder to improve\nthe network's overall performance. Qualitative analysis shows the efficiency of\nour network in correctly classifying errors and reducing misclassifications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:58:03 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 04:26:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["C","Sneha Sree",""],["Fahim","Mohammad Al",""],["Ram","Keerthi",""],["Sivaprakasam","Mohanasankar",""]]}
{"id":"2308.05069","submitter":"Marco Squassina","authors":"Sunra Mosconi, Giuseppe Riey, Marco Squassina","title":"Concave solutions to Finsler $p$-Laplace type equations","comments":"28 pages, typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove concavity properties for solutions to anisotropic quasi-linear\nequations, extending previous results known in the Euclidean case. We focus the\nattention on nonsmooth anisotropies and in particular we also allow the\nfunctions describing the anisotropies to be not even.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:59:45 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 07:56:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mosconi","Sunra",""],["Riey","Giuseppe",""],["Squassina","Marco",""]]}
{"id":"2308.05070","submitter":"Silvia Cascianelli PhD","authors":"Fabio Quattrini, Vittorio Pippi, Silvia Cascianelli, Rita Cucchiara","title":"Volumetric Fast Fourier Convolution for Detecting Ink on the Carbonized\n  Herculaneum Papyri","comments":"Accepted at the 4th ICCV Workshop on e-Heritage (in conjunction with\n  ICCV 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advancements in Digital Document Restoration (DDR) have led to\nsignificant breakthroughs in analyzing highly damaged written artifacts. Among\nthose, there has been an increasing interest in applying Artificial\nIntelligence techniques for virtually unwrapping and automatically detecting\nink on the Herculaneum papyri collection. This collection consists of\ncarbonized scrolls and fragments of documents, which have been digitized via\nX-ray tomography to allow the development of ad-hoc deep learning-based DDR\nsolutions. In this work, we propose a modification of the Fast Fourier\nConvolution operator for volumetric data and apply it in a segmentation\narchitecture for ink detection on the challenging Herculaneum papyri,\ndemonstrating its suitability via deep experimental analysis. To encourage the\nresearch on this task and the application of the proposed operator to other\ntasks involving volumetric data, we will release our implementation\n(https://github.com/aimagelab/vffc)\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:00:43 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Quattrini","Fabio",""],["Pippi","Vittorio",""],["Cascianelli","Silvia",""],["Cucchiara","Rita",""]]}
{"id":"2308.05071","submitter":"John Gamble","authors":"Jwo-Sy Chen, Erik Nielsen, Matthew Ebert, Volkan Inlek, Kenneth\n  Wright, Vandiver Chaplin, Andrii Maksymov, Eduardo P\\'aez, Amrit Poudel,\n  Peter Maunz, John Gamble","title":"Benchmarking a trapped-ion quantum computer with 29 algorithmic qubits","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computers are rapidly becoming more capable, with dramatic increases\nin both qubit count and quality. Among different hardware approaches,\ntrapped-ion quantum processors are a leading technology for quantum computing,\nwith established high-fidelity operations and architectures with promising\nscaling. Here, we demonstrate and thoroughly benchmark the IonQ Forte system:\nconfigured here as a single-chain 30-qubit trapped-ion quantum computer with\nall-to-all operations. We assess the performance of our quantum computer\noperation at the component level via direct randomized benchmarking (DRB)\nacross all 30 choose 2 = 435 gate pairs. We then show the results of\napplication-oriented benchmarks, indicating that the system passes the suite of\nalgorithmic qubit (AQ) benchmarks up to #AQ 29. Finally, we use our\ncomponent-level benchmarking to build a system-level model to predict the\napplication benchmarking data through direct simulation, including error\nmitigation. We find that the system-level model correlates well with the\nobservations in many cases, though in some cases out-of-model errors lead to\nhigher predicted performance than is observed. This highlights that as quantum\ncomputers move toward larger and higher-quality devices, characterization\nbecomes more challenging, suggesting future work required to push performance\nfurther.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:02:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Chen","Jwo-Sy",""],["Nielsen","Erik",""],["Ebert","Matthew",""],["Inlek","Volkan",""],["Wright","Kenneth",""],["Chaplin","Vandiver",""],["Maksymov","Andrii",""],["P\u00e1ez","Eduardo",""],["Poudel","Amrit",""],["Maunz","Peter",""],["Gamble","John",""]]}
{"id":"2308.05072","submitter":"Paul Stevenson","authors":"P. M. Stevenson","title":"`Maximal conformality' is nonsense","comments":"10 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The so-called \"principle of maximal conformality\" is nonsense and does\nnothing to resolve the renormalization-scheme-dependence problem. Some\nessential facts about that problem are summarized. It is stressed that RG\ninvariance is a symmetry and that any viable method for resolving the\nscheme-dependence problem should be formulatable in terms of the invariants of\nthat symmetry.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:04:08 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Stevenson","P. M.",""]]}
{"id":"2308.05073","submitter":"Daniel Schwartz","authors":"Daniel Schwartz, Riddhiman Saha, Steffen Ventz, Lorenzo Trippa","title":"Harmonized Estimation of Subgroup-Specific Treatment Effects in\n  Randomized Trials: The Use of External Control Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Subgroup analysis of randomized controlled trials (RCTs) constitutes an\nimportant component of the drug development process in precision medicine. In\nparticular, subgroup analysis of early phase trials often influences the design\nand eligibility criteria of subsequent confirmatory trials and ultimately\nimpacts which subpopulations will receive the treatment after regulatory\napproval. However, subgroup analysis is typically complicated by small sample\nsizes, which lead to substantial uncertainty about the subgroup-specific\ntreatment effects. In this work we explore the use of external control (EC)\ndata to augment an RCT's subgroup analysis. We define and discuss harmonized\nestimators of subgroup-specific treatment effects to leverage EC data while\nensuring that the subgroup analysis is coherent with a primary analysis using\nRCT data alone. Our approach modifies subgroup-specific treatment effect\nestimators obtained through popular methods (e.g., linear regression) applied\njointly to the RCT and EC datasets. We shrink these estimates so that their\nweighted average is close to a robust estimate of the average treatment effect\nin the overall trial population based on the RCT data alone. We study the\nproposed harmonized estimators with analytic results and simulations, and\ninvestigate standard performance metrics. The method is illustrated with a case\nstudy in glioblastoma.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:07:17 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Schwartz","Daniel",""],["Saha","Riddhiman",""],["Ventz","Steffen",""],["Trippa","Lorenzo",""]]}
{"id":"2308.05074","submitter":"Nina Merkle","authors":"Nina Merkle, Reza Bahmanyar, Corentin Henry, Seyed Majid Azimi,\n  Xiangtian Yuan, Simon Schopferer, Veronika Gstaiger, Stefan Auer, Anne\n  Schneibel, Marc Wieland, Thomas Kraft","title":"Drones4Good: Supporting Disaster Relief Through Remote Sensing and AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In order to respond effectively in the aftermath of a disaster, emergency\nservices and relief organizations rely on timely and accurate information about\nthe affected areas. Remote sensing has the potential to significantly reduce\nthe time and effort required to collect such information by enabling a rapid\nsurvey of large areas. To achieve this, the main challenge is the automatic\nextraction of relevant information from remotely sensed data. In this work, we\nshow how the combination of drone-based data with deep learning methods enables\nautomated and large-scale situation assessment. In addition, we demonstrate the\nintegration of onboard image processing techniques for the deployment of\nautonomous drone-based aid delivery. The results show the feasibility of a\nrapid and large-scale image analysis in the field, and that onboard image\nprocessing can increase the safety of drone-based aid deliveries.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:07:20 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Merkle","Nina",""],["Bahmanyar","Reza",""],["Henry","Corentin",""],["Azimi","Seyed Majid",""],["Yuan","Xiangtian",""],["Schopferer","Simon",""],["Gstaiger","Veronika",""],["Auer","Stefan",""],["Schneibel","Anne",""],["Wieland","Marc",""],["Kraft","Thomas",""]]}
{"id":"2308.05075","submitter":"Leo Benac","authors":"Leo Benac, Sonali Parbhoo, Finale Doshi-Velez","title":"Bayesian Inverse Transition Learning for Offline Settings","comments":"8 pages, 1 plots, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Offline Reinforcement learning is commonly used for sequential\ndecision-making in domains such as healthcare and education, where the rewards\nare known and the transition dynamics $T$ must be estimated on the basis of\nbatch data. A key challenge for all tasks is how to learn a reliable estimate\nof the transition dynamics $T$ that produce near-optimal policies that are safe\nenough so that they never take actions that are far away from the best action\nwith respect to their value functions and informative enough so that they\ncommunicate the uncertainties they have. Using data from an expert, we propose\na new constraint-based approach that captures our desiderata for reliably\nlearning a posterior distribution of the transition dynamics $T$ that is free\nfrom gradients. Our results demonstrate that by using our constraints, we learn\na high-performing policy, while considerably reducing the policy's variance\nover different datasets. We also explain how combining uncertainty estimation\nwith these constraints can help us infer a partial ranking of actions that\nproduce higher returns, and helps us infer safer and more informative policies\nfor planning.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:08:29 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Benac","Leo",""],["Parbhoo","Sonali",""],["Doshi-Velez","Finale",""]]}
{"id":"2308.05076","submitter":"Jeremy Singer","authors":"Duncan Lowther, Dejice Jacob, Jeremy Singer","title":"CHERI Performance Enhancement for the MicroPython Interpreter","comments":"9 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  During our port of the MicroPython bytecode interpreter to the CHERI-based\nArm Morello platform, we encountered a number of serious performance\ndegradations. This paper explores several of these of these performance issues\nin detail, in each case characterizing the cause of the problem, the fix, and\nthe corresponding performance improvement over a set of standard Python\nbenchmarks.\n  While we recognize that Morello is a prototypical physical instantiation of\nthe CHERI concept, we show that it is possible to eliminate certain kinds of\nsoftware-induced runtime overhead that occur due to the larger size of\narchitectural capabilities relative to native pointers. In our case, we reduce\na geometric mean benchmark slowdown from 5x (before optimization) to 2x (after\noptimization) relative to AArch64 execution. The worst-case slowdowns are\ngreatly improved, from 100x (before optimization) to 2x (after optimization).\n  The key insight is that pointer size assumptions pervade systems code;\nwhereas previous CHERI porting projects highlighted compile-time and\nexecution-time errors exposed by pointer size assumptions, we instead focus on\nthe performance implications of such assumptions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:12:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Lowther","Duncan",""],["Jacob","Dejice",""],["Singer","Jeremy",""]]}
{"id":"2308.05077","submitter":"Tomislav Begu\\v{s}i\\'c","authors":"Tomislav Begu\\v{s}i\\'c, Johnnie Gray, Garnet Kin-Lic Chan","title":"Fast and converged classical simulations of evidence for the utility of\n  quantum computing before fault tolerance","comments":"This can be regarded as the full version of the preliminary note in\n  arXiv:2306.16372","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A recent quantum simulation of observables of the kicked Ising model on 127\nqubits [Nature 618, 500 (2023)] implemented circuits that exceed the\ncapabilities of exact classical simulation. We show that several approximate\nclassical methods, based on sparse Pauli dynamics and tensor network\nalgorithms, can simulate these observables orders of magnitude faster than the\nquantum experiment, and can also be systematically converged beyond the\nexperimental accuracy. Our most accurate technique combines a mixed\nSchr\\\"odinger and Heisenberg tensor network representation with the Bethe free\nentropy relation of belief propagation to compute expectation values with an\neffective wavefunction-operator sandwich bond dimension ${>}16,000,000$,\nachieving an absolute accuracy, without extrapolation, in the observables of\n${<}0.01$, which is converged for many practical purposes. We thereby identify\ninaccuracies in the experimental extrapolations and suggest how future\nexperiments can be implemented to increase the classical hardness.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:15:17 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 06:01:53 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Begu\u0161i\u0107","Tomislav",""],["Gray","Johnnie",""],["Chan","Garnet Kin-Lic",""]]}
{"id":"2308.05078","submitter":"Kamal Singh","authors":"Kamal Singh, Sumit Roy","title":"Ergodic Capacity of Dyadic Fading Channels in Ultra Low-SNR Regime","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 a mobile wireless channel, the small-scale multipath fading induces\ntemporal channel fluctuations in the form of peaks and deep fades. The channel\ncapacity degradation with fading severity in the high signal-to-noise ratio\n(SNR) regime is well known in the wireless communication literature: the\nprobability of deep fades increases significantly with higher fading severity\nresulting in poor performance. In this paper, we focus on double-fading pinhole\nchannels under perfect CSIT to show a very counter-intuitive result that -\nhigher fading severity enables higher ergodic capacity at sufficiently low SNR.\nThe underlying reason is that at low SNRs, ergodic capacity depends crucially\non the probability distribution of channel peaks (simply tail distribution);\nfor the pinhole channel, the tail distribution improves with increased fading\nseverity. This allows a transmitter operating at low SNR to exploit channel\npeaks more efficiently resulting in a net improvement in achievable spectral\nefficiency. We derive a new key result quantifying the above dependence for the\ndouble-Nakagami-$m$ fading pinhole channel - that is, the ergodic capacity ${C}\n\\propto (m_T m_R)^{-1}$ at low SNR, where $m_T m_R$ is the product of fading\n(severity) parameters of the two independent Nakagami-$m$ fadings involved.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:15:24 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Singh","Kamal",""],["Roy","Sumit",""]]}
{"id":"2308.05079","submitter":"Yupan Liu","authors":"Fran\\c{c}ois Le Gall, Yupan Liu, Qisheng Wang","title":"Space-bounded quantum state testing via space-efficient quantum singular\n  value transformation","comments":"60 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Driven by exploring the power of quantum computation with a limited number of\nqubits, we present a novel complete characterization for space-bounded quantum\ncomputation, which encompasses settings with one-sided error (unitary coRQL)\nand two-sided error (BQL), approached from a quantum state testing perspective:\n  - The first family of natural complete problems for unitary coRQL, i.e.,\nspace-bounded quantum state certification for trace distance and\nHilbert-Schmidt distance;\n  - A new family of natural complete problems for BQL, i.e., space-bounded\nquantum state testing for trace distance, Hilbert-Schmidt distance, and quantum\nentropy difference.\n  In the space-bounded quantum state testing problem, we consider two\nlogarithmic-qubit quantum circuits (devices) denoted as $Q_0$ and $Q_1$, which\nprepare quantum states $\\rho_0$ and $\\rho_1$, respectively, with access to\ntheir ``source code''. Our goal is to decide whether $\\rho_0$ is\n$\\epsilon_1$-close to or $\\epsilon_2$-far from $\\rho_1$ with respect to a\nspecified distance-like measure. Interestingly, unlike time-bounded state\ntesting problems, which exhibit computational hardness depending on the chosen\ndistance-like measure (either QSZK-complete or BQP-complete), our results\nreveal that the space-bounded state testing problems, considering all three\nmeasures, are computationally as easy as preparing quantum states.\n  Our results primarily build upon a space-efficient variant of the quantum\nsingular value transformation (QSVT) introduced by Gily\\'en, Su, Low, and Wiebe\n(STOC 2019), which is of independent interest. Our technique provides a unified\napproach for designing space-bounded quantum algorithms. Specifically, we show\nthat implementing QSVT for any bounded polynomial that approximates a\npiecewise-smooth function incurs only a constant overhead in terms of the space\nrequired for special forms of the projected unitary encoding.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:16:19 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Gall","Fran\u00e7ois Le",""],["Liu","Yupan",""],["Wang","Qisheng",""]]}
{"id":"2308.05080","submitter":"Thomas Bernhardt","authors":"Dirk Becherer, Thomas Bernhardt, Pavel Gapeev","title":"On Watanabe's characterisation and change of intensity \\`{a} la Girsanov\n  for Cox processes","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider Girsanov changes of measures that alter the intensity of point\nprocesses in a suitable way, e.g., for the probability reference approach in\nfiltering. Such change of measure exists if a suitably related stochastic\nexponential involving the intended new target intensity process is a proper\nmartingale. We show that the stochastic exponential is always a martingale when\nthe point process is a Cox process. In doing so, we show how Watanabe's\ncharacterisation for conditional Poisson processes in terms of local\nmartingales can be formulated as a necessary and sufficient condition.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:19:55 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Becherer","Dirk",""],["Bernhardt","Thomas",""],["Gapeev","Pavel",""]]}
{"id":"2308.05081","submitter":"Hao Fei","authors":"Yu Zhao, Hao Fei, Yixin Cao, Bobo Li, Meishan Zhang, Jianguo Wei, Min\n  Zhang, Tat-Seng Chua","title":"Constructing Holistic Spatio-Temporal Scene Graph for Video Semantic\n  Role Labeling","comments":"Accepted by ACM MM 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":"  Video Semantic Role Labeling (VidSRL) aims to detect the salient events from\ngiven videos, by recognizing the predict-argument event structures and the\ninterrelationships between events. While recent endeavors have put forth\nmethods for VidSRL, they can be mostly subject to two key drawbacks, including\nthe lack of fine-grained spatial scene perception and the insufficiently\nmodeling of video temporality. Towards this end, this work explores a novel\nholistic spatio-temporal scene graph (namely HostSG) representation based on\nthe existing dynamic scene graph structures, which well model both the\nfine-grained spatial semantics and temporal dynamics of videos for VidSRL.\nBuilt upon the HostSG, we present a nichetargeting VidSRL framework. A\nscene-event mapping mechanism is first designed to bridge the gap between the\nunderlying scene structure and the high-level event semantic structure,\nresulting in an overall hierarchical scene-event (termed ICE) graph structure.\nWe further perform iterative structure refinement to optimize the ICE graph,\nsuch that the overall structure representation can best coincide with end task\ndemand. Finally, three subtask predictions of VidSRL are jointly decoded, where\nthe end-to-end paradigm effectively avoids error propagation. On the benchmark\ndataset, our framework boosts significantly over the current best-performing\nmodel. Further analyses are shown for a better understanding of the advances of\nour methods.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:20:14 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 06:02:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","Yu",""],["Fei","Hao",""],["Cao","Yixin",""],["Li","Bobo",""],["Zhang","Meishan",""],["Wei","Jianguo",""],["Zhang","Min",""],["Chua","Tat-Seng",""]]}
{"id":"2308.05082","submitter":"Christian Offen","authors":"Christian Offen and Sina Ober-Bl\\\"obaum","title":"Learning of discrete models of variational PDEs from data","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 show how to learn discrete field theories from observational data of\nfields on a space-time lattice. For this, we train a neural network model of a\ndiscrete Lagrangian density such that the discrete Euler--Lagrange equations\nare consistent with the given training data. We, thus, obtain a\nstructure-preserving machine learning architecture. Lagrangian densities are\nnot uniquely defined by the solutions of a field theory. We introduce a\ntechnique to derive regularisers for the training process which optimise\nnumerical regularity of the discrete field theory. Minimisation of the\nregularisers guarantees that close to the training data the discrete field\ntheory behaves robust and efficient when used in numerical simulations.\nFurther, we show how to identify structurally simple solutions of the\nunderlying continuous field theory such as travelling waves. This is possible\neven when travelling waves are not present in the training data. This is\ncompared to data-driven model order reduction based approaches, which struggle\nto identify suitable latent spaces containing structurally simple solutions\nwhen these are not present in the training data. Ideas are demonstrated on\nexamples based on the wave equation and the Schr\\\"odinger equation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:20:22 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Offen","Christian",""],["Ober-Bl\u00f6baum","Sina",""]]}
{"id":"2308.05083","submitter":"Zoran \\v{S}koda","authors":"Zoran \\v{S}koda, Martina Stoji\\'c","title":"Comment on \"Twisted bialgebroids versus bialgebroids from Drinfeld\n  twist\"","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A class of left bialgebroids whose underlying algebra $A\\sharp H$ is a smash\nproduct of a bialgebra $H$ with a braided commutative Yetter--Drinfeld\n$H$-algebra $A$ has recently been studied in relation to models of field\ntheories on noncommutative spaces. In [A. Borowiec, A. Pachol, ``Twisted\nbialgebroids versus bialgebroids from Drinfeld twist'', J. Phys. A50 (2017)\n055205] a proof has been presented that the bialgebroid $A_F\\sharp H^F$ where\n$H^F$ and $A_F$ are twists of $H$ and $A$ by a Drinfeld 2-cocycle $F = \\sum\nF^1\\otimes F^2$ is isomorphic to the twist of bialgebroid $A\\sharp H$ by the\nbialgebroid 2-cocycle $\\sum 1\\sharp F^1\\otimes 1\\sharp F^2$ induced by $F$.\nThey assume $H$ is quasitriangular, which is reasonable for many physical\napplications. However the proof and the entire paper take for granted that the\ncoaction and the prebraiding are both given by special formulas involving the\nR-matrix. There are counterexamples of Yetter--Drinfeld modules over\nquasitriangular Hopf algebras which are not of this special form. Nevertheless,\nthe main result essentially survives. We present a proof with general coaction\nand the correct prebraiding, and even without the assumption of\nquasitriangularity.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:24:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["\u0160koda","Zoran",""],["Stoji\u0107","Martina",""]]}
{"id":"2308.05084","submitter":"Fernando Carneiro","authors":"S. C. Ulhoa, F. L. Carneiro and J. W. Maluf","title":"On the Thermodynamics of Gravitational Radiation","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article deals with the thermodynamics of gravitational radiation arising\nfrom the Bondi-Sachs space-time. The equation of state found allows us to\nconclude that the dependence of the energy density on the temperature is a\nquadratic power of the latter. Such a conclusion is possible once the\nconsequences of the first law of thermodynamics are analyzed. Then, in analogy\nto electromagnetic radiation, the same approach as used by Planck to obtain the\nquantum of energy of the gravitational radiation is proposed. An energy for the\ngraviton proportional to the cubic frequency is found. The graviton is here\nunderstood as the quantum of gravitational energy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:27:07 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Ulhoa","S. C.",""],["Carneiro","F. L.",""],["Maluf","J. W.",""]]}
{"id":"2308.05085","submitter":"Ruoyan Kong","authors":"Ruoyan Kong, Haiyi Zhu, Joseph A. Konstan","title":"Organizational Bulk Email Systems: Their Role and Performance in Remote\n  Work","comments":"arXiv admin note: text overlap with arXiv:2006.16508","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The COVID-19 pandemic has forced many employees to work from home.\nOrganizational bulk emails now play a critical role to reach employees with\ncentral information in this work-from-home environment. However, we know from\nour own recent work that organizational bulk email has problems: recipients\nfail to retain the bulk messages they received from the organization;\nrecipients and senders have different opinions on which bulk messages were\nimportant; and communicators lack technology support to better target and\ndesign messages. In this position paper, first we review the prior work on\nevaluating, designing, and prototyping organizational communication systems.\nSecond we review our recent findings and some research techniques we found\nuseful in studying organizational communication. Last we propose a research\nagenda to study organizational communications in remote work environment and\nsuggest some key questions and potential study directions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:27:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kong","Ruoyan",""],["Zhu","Haiyi",""],["Konstan","Joseph A.",""]]}
{"id":"2308.05086","submitter":"Yin Li","authors":"Yin Li","title":"Aspherical Lagrangian submanifolds, Audin's conjecture and cyclic\n  dilations","comments":"75 pages, 6 figures. v2: slightly simplified the argument, references\n  added","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a closed, oriented Lagrangian submanifold $L$ in a Liouville domain\n$\\overline{M}$, one can define a Maurer-Cartan element with respect to a\ncertain $L_\\infty$-structure on the string homology\n$\\widehat{H}_\\ast^{S^1}(\\mathcal{L}L;\\mathbb{R})$, completed with respect to\nthe action filtration. When the first Gutt-Hutchings capacity of $\\overline{M}$\nis finite, and $L$ is a $K(\\pi,1)$ space, it leads to interesting geometric\nimplications. In particular, we show that $L$ bounds a non-constant\npseudoholomorphic disc of Maslov index 2. This confirms a general form of\nAudin's conjecture and generalizes the works of Fukaya and Irie in the case of\n$\\mathbb{C}^n$ to a wide class of Liouville manifolds. In particular, when\n$\\dim_\\mathbb{R}(\\overline{M})=6$, every closed, orientable, prime Lagrangian\n3-manifold $L\\subset\\overline{M}$ is diffeomorphic to a spherical space form,\nor $S^1\\times\\Sigma_g$, where $\\Sigma_g$ is a closed oriented surface.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:28:54 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 18:10:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yin",""]]}
{"id":"2308.05087","submitter":"John Sylvester","authors":"Dimitrios Los, Thomas Sauerwald, John Sylvester","title":"Mean-Biased Processes for Balanced Allocations","comments":"This paper refines and extends the content on non-filling processes\n  in arXiv:2110.10759. It consists of 65 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.DM cs.DS math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a new class of balanced allocation processes which bias towards\nunderloaded bins (those with load below the mean load) either by skewing the\nprobability by which a bin is chosen for an allocation (probability bias), or\nalternatively, by adding more balls to an underloaded bin (weight bias). A\nprototypical process satisfying the probability bias condition is\nMean-Thinning: At each round, we sample one bin and if it is underloaded, we\nallocate one ball; otherwise, we allocate one ball to a second bin sample.\nVersions of this process have been in use since at least 1986. An example of a\nprocess, introduced by us, which satisfies the weight bias condition is\nTwinning: At each round, we only sample one bin. If the bin is underloaded,\nthen we allocate two balls; otherwise, we allocate only one ball.\n  Our main result is that for any process with a probability or weight bias,\nwith high probability the gap between maximum and minimum load is logarithmic\nin the number of bins. This result holds for any number of allocated balls\n(heavily loaded case), covers many natural processes that relax the Two-Choice\nprocess, and we also prove it is tight for many such processes, including\nMean-Thinning and Twinning.\n  Our analysis employs a delicate interplay between linear, quadratic and\nexponential potential functions. It also hinges on a phenomenon we call ``mean\nquantile stabilization'', which holds in greater generality than our framework\nand may be of independent interest.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:29:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Los","Dimitrios",""],["Sauerwald","Thomas",""],["Sylvester","John",""]]}
{"id":"2308.05088","submitter":"Austin Hopkins","authors":"Austin Hopkins, Benjamin Loewe, Michael Chiang, Davide Marenduzzo and\n  M. Cristina Marchetti","title":"Motility induced phase separation of deformable cells","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using a multi-phase field model, we examine how particle deformability, which\nis a proxy for cell stiffness, affects motility induced phase separation\n(MIPS). We show that purely repulsive deformable, i.e., squishy, cells phase\nseparate more effectively than their rigid counterparts. This can be understood\nas due to the fact that deformability increases the effective duration of\ncollisions. In addition, the dense regions become increasingly disordered as\ndeformability increases. Our results contextualize the applicability of MIPS to\nbiological systems and have implications for how cells in biological systems\nmay self-organize\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:30:40 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Hopkins","Austin",""],["Loewe","Benjamin",""],["Chiang","Michael",""],["Marenduzzo","Davide",""],["Marchetti","M. Cristina",""]]}
{"id":"2308.05089","submitter":"Wenyuan Li","authors":"Wenyuan Li","title":"Lagrangian cobordism functor in microlocal sheaf theory II","comments":"44 pages, 4 figures. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For an exact Lagrangian cobordism $L$ between Legendrians in $J^1(M)$ from\n$\\Lambda_-$ to $\\Lambda_+$ whose Legendrian lift is $\\widetilde{L}$, we prove\nthat sheaves in $Sh_{\\widetilde{L}}(M \\times \\mathbb{R} \\times\n\\mathbb{R}_{>0})$ are equivalent to sheaves at the negative end\n$Sh_{\\Lambda_-}(M \\times \\mathbb{R})$ together with the data of local systems\n$Loc({L})$ by studying sheaf quantizations for general noncompact Lagrangians.\nThus we interpret the Lagrangian cobordism functor between $Sh_{\\Lambda_\\pm}(M\n\\times \\mathbb{R})$ as a correspondence parametrized by $Loc({L})$. This\nenables one to consider generalizations to immersed Lagrangian cobordisms. We\nalso prove that the Lagrangian cobordism functor is action decreasing and\nrecover results on the lengths of embedded Lagrangian cobordisms. Finally,\nusing the construction of Courte-Ekholm, we obtain a family of Legendrians with\nsheaf categories Morita equivalent to chains of based loop spaces of the\nLagrangian fillings.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:32:05 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Li","Wenyuan",""]]}
{"id":"2308.05090","submitter":"Fernanda P\\'erez-Verdugo","authors":"Fernanda P\\'erez-Verdugo and Rodrigo Soto","title":"Continuum description of confluent tissues with spatial heterogeneous\n  activity","comments":"12 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A continuum description is built to characterize the stationary and transient\ndeformations of confluent tissues subject to heterogeneous activities. By\ndefining a coarse-grained texture matrix field to represent the shape and size\nof cells, we derive the coarse-grained stress tensor for the vertex model.\nActivity in the tissue takes the form of inhomogeneous apical contractions,\nwhich can be modeled as reductions of the vertex model reference areas or\nperimeters representing activity in the medial and perimeter regions of the\ncells, respectively. For medial activity, the extra stress is just an isotropic\npressure, while for perimeter activity, it also has a deviatoric component,\nwhich is aligned with the texture matrix. The predictions of the continuum\ndescription are compared with the average spatiotemporal deformations obtained\nin simulations of the vertex model subject to localized apical contractions,\nshowing an excellent agreement, even if the active patch is as small as one\ncell. The fluctuations around the average are more prominent when the activity\nis in the medial region due to the lack of negative active shape feedback,\nwhich, coupled with the confluent property, increases cellular shape and size\nvariations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:33:57 GMT"}],"update_date":"2023-08-10","authors_parsed":[["P\u00e9rez-Verdugo","Fernanda",""],["Soto","Rodrigo",""]]}
{"id":"2308.05091","submitter":"Luis Felipe Bueno","authors":"Lu\\'is Felipe Bueno, Andr\\'e Luiz Diniz, Rafael Durbano Lobato,\n  Claudia Sagastiz\\'abal and Kenny Vinente","title":"Impact of environmental constraints in hydrothermal energy planning","comments":"39 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a follow-up of the industrial problems dealt with in 2018, 2019, 2021 and\n2022, in partnership with CCEE and CEPEL, in 2023 the study group Energy\nplanning and environmental constraints focused on the impact that prioritizing\nmultiple uses of water has on the electric energy production systems, specially\nin predominantly hydro systems, which is the case of Brazil. In order to model\nenvironmental constraints in the long-term hydrothermal generation planning\nproblem, the resulting large-scale multi-stage linear programming problem was\nmodelled in JuMP and solved by stochastic dual dynamic programming. To assess\nif the development represented well the behavior of the Brazilian power system,\nthe Julia formulation first was benchmarked with Brazil s official model,\nNewave. Environmental constraints were introduced in this problem by two\ndifferent approaches, one that represents the multiple uses of water by means\nof 0-1 variables, and another one that makes piecewise linear approximations of\nthe relevant constraints. Numerical results show that penalties of slack\nvariables strongly affect the obtained water values.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:38:11 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Bueno","Lu\u00eds Felipe",""],["Diniz","Andr\u00e9 Luiz",""],["Lobato","Rafael Durbano",""],["Sagastiz\u00e1bal","Claudia",""],["Vinente","Kenny",""]]}
{"id":"2308.05092","submitter":"Prateek Y J","authors":"Prateek Y J","title":"A degree of image identification at sub-human scales could be possible\n  with more advanced clusters","comments":"6 pages, 5 figures, public code and model:\n  https://github.com/PrateekJannu/imagescale2","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The purpose of the research is to determine if currently available\nself-supervised learning techniques can accomplish human level comprehension of\nvisual images using the same degree and amount of sensory input that people\nacquire from. Initial research on this topic solely considered data volume\nscaling. Here, we scale both the volume of data and the quality of the image.\nThis scaling experiment is a self-supervised learning method that may be done\nwithout any outside financing. We find that scaling up data volume and picture\nresolution at the same time enables human-level item detection performance at\nsub-human sizes.We run a scaling experiment with vision transformers trained on\nup to 200000 images up to 256 ppi.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:40:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["J","Prateek Y",""]]}
{"id":"2308.05093","submitter":"Saurabh Gupta","authors":"Ansha S Nair, Saurabh Gupta","title":"On the Quantization of FLPR Model","comments":"LaTeX file, 16 pages, No figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We quantize the Friedberg-Lee-Pang-Ren (FLPR) model, using an admissible\ngauge condition, within the framework of modified Faddeev-Jackiw formalism.\nFurther, we deduce the gauge symmetries and establish off-shell nilpotent and\nabsolutely anti-commuting (anti-)BRST symmetries. We also show that the\nphysical states of the theory are annihilated by the first class constraints\nwhich is consistent \\textit{\\`{a} la} Dirac formalism.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:44:47 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Nair","Ansha S",""],["Gupta","Saurabh",""]]}
{"id":"2308.05094","submitter":"Hunter Dinkins","authors":"Hunter Dinkins","title":"On the vertex functions of type A quiver varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG hep-th math-ph math.MP math.QA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of this paper is to better understand the quasimap vertex functions\nof type $A$ Nakajima quiver varieties. To that end, we construct an explicit\nembedding of any type $A$ quiver variety into a type $A$ quiver variety with\nall framings at the rightmost vertex of the quiver. Then we consider quasimap\ncounts, showing that the map induced by this embedding on equivariant\n$K$-theory preserves vertex functions.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:44:49 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 16:12:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dinkins","Hunter",""]]}
{"id":"2308.05095","submitter":"Hao Fei","authors":"Leigang Qu, Shengqiong Wu, Hao Fei, Liqiang Nie, Tat-Seng Chua","title":"LayoutLLM-T2I: Eliciting Layout Guidance from LLM for Text-to-Image\n  Generation","comments":"Accepted by ACM MM 2023","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 the text-to-image generation field, recent remarkable progress in Stable\nDiffusion makes it possible to generate rich kinds of novel photorealistic\nimages. However, current models still face misalignment issues (e.g.,\nproblematic spatial relation understanding and numeration failure) in complex\nnatural scenes, which impedes the high-faithfulness text-to-image generation.\nAlthough recent efforts have been made to improve controllability by giving\nfine-grained guidance (e.g., sketch and scribbles), this issue has not been\nfundamentally tackled since users have to provide such guidance information\nmanually. In this work, we strive to synthesize high-fidelity images that are\nsemantically aligned with a given textual prompt without any guidance. Toward\nthis end, we propose a coarse-to-fine paradigm to achieve layout planning and\nimage generation. Concretely, we first generate the coarse-grained layout\nconditioned on a given textual prompt via in-context learning based on Large\nLanguage Models. Afterward, we propose a fine-grained object-interaction\ndiffusion method to synthesize high-faithfulness images conditioned on the\nprompt and the automatically generated layout. Extensive experiments\ndemonstrate that our proposed method outperforms the state-of-the-art models in\nterms of layout and image generation. Our code and settings are available at\nhttps://layoutllm-t2i.github.io.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:45:04 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 05:36:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qu","Leigang",""],["Wu","Shengqiong",""],["Fei","Hao",""],["Nie","Liqiang",""],["Chua","Tat-Seng",""]]}
{"id":"2308.05096","submitter":"Srivatsan Sridhar","authors":"Joachim Neu, Srivatsan Sridhar, Lei Yang, David Tse","title":"Optimal Flexible Consensus and its Application to Ethereum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classic BFT consensus protocols guarantee safety and liveness for all clients\nif fewer than one-third of replicas are faulty. However, in applications such\nas high-value payments, some clients may want to prioritize safety over\nliveness. Flexible consensus allows each client to opt for a higher safety\nresilience, albeit at the expense of reduced liveness resilience. We present\nthe first construction that allows optimal safety--liveness tradeoff for every\nclient simultaneously. This construction is modular and is realized as an\nadd-on applied on top of an existing consensus protocol. The add-on consists of\nan additional round of voting and permanent locking done by the replicas, to\nsidestep a sub-optimal quorum-intersection-based constraint present in previous\nsolutions. We adapt our construction to the existing Ethereum protocol to\nderive optimal flexible confirmation rules that clients can adopt unilaterally\nwithout requiring system-wide changes. This is possible because existing\nEthereum protocol features can double as the extra voting and locking. We\ndemonstrate an implementation using Ethereum's consensus API.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:46:01 GMT"},{"version":"v2","created":"Thu, 10 Aug 2023 02:28:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Neu","Joachim",""],["Sridhar","Srivatsan",""],["Yang","Lei",""],["Tse","David",""]]}
{"id":"2308.05097","submitter":"Pallavi Saraf","authors":"Pallavi Saraf (IIA), Thirupathi Sivarani (IIA)","title":"Chemodynamic analysis of four $r$-process enhanced stars observed with\n  GTC","comments":"13 pages, 3 figures, Accepted for publication in Bulletin of Li\\`ege\n  Royal Society of Sciences (proceedings of the 3rd BINA workshop)","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":"  Here, we delineate a comprehensive abundance analysis of four $r$-process\nenhanced metal-poor stars observed with HORuS spectrograph on a 10-m class\ntelescope, GTC. The high signal-to-noise ratio at $R \\approx 25000$ spectral\nresolution allowed us to detect 16 light and 20 neutron-capture elements along\nwith Th in two stars. Four of our program stars show signatures of mixing in\ntheir atmosphere. Through detailed abundance analysis of four $r$-process\nenhanced stars together with already identified $r$-process-rich stars in\nliterature, we probe the production sites of neutron-capture elements. The\n[Zr/Eu] ratio as a function of metallicity shows the evidence of multiple\nchannels for the production of $r$-process. Thorium to first and second\n$r$-process peak elements ratios also support the similar non-universality of\nneutron-capture elements. An increased sample of $r$-process enhanced stars\nwill enable us understand different formation channels of neutron capture\nelements. Using the kinematic analysis, we found the clues of accretion for two\nof our program stars.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:47:12 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Saraf","Pallavi","","IIA"],["Sivarani","Thirupathi","","IIA"]]}
{"id":"2308.05098","submitter":"Sumeet Kulkarni","authors":"Sumeet Kulkarni, Nathan K. Johnson-McDaniel, Khun Sang Phukon, N. V.\n  Krishnendu, Anuradha Gupta","title":"Inferring spin tilts of binary black holes at formation with plus-era\n  gravitational wave detectors","comments":"18 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"LIGO-P2300128","categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spin orientations of spinning binary black hole (BBH) mergers detected by\nground-based gravitational wave detectors such as LIGO and Virgo can provide\nimportant clues about the formation of such binaries. However, these spin\ntilts, i.e., the angles between the spin vector of each black hole and the\nbinary's orbital angular momentum vector, can change due to precessional\neffects as the black holes evolve from a large separation to their merger. The\ntilts inferred at a frequency in the sensitive band of the detectors by\ncomparing the signal with theoretical waveforms can thus be significantly\ndifferent from the tilts when the binary originally formed. These tilts at the\nbinary's formation are well approximated in many scenarios by evolving the BBH\nbackwards in time to a formally infinite separation. Using the tilts at\ninfinite separation also places all binaries on an equal footing in analyzing\ntheir population properties. In this paper, we perform parameter estimation for\nsimulated BBHs and investigate the differences between the tilts one infers\ndirectly close to merger and those obtained by evolving back to infinite\nseparation. We select simulated observations such that their configurations\nshow particularly large differences in their orientations close to merger and\nat infinity. While these differences may be buried in the statistical noise for\ncurrent detections, we show that in future plus-era (A$+$ and Virgo$+$)\ndetectors, they can be easily distinguished in some cases. We also consider the\ntilts at infinity for BBHs in various spin morphologies and at the endpoint of\nthe up-down instability. In particular, we find that we are able to easily\nidentify the up-down instability cases as such from the tilts at infinity.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:49:06 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Kulkarni","Sumeet",""],["Johnson-McDaniel","Nathan K.",""],["Phukon","Khun Sang",""],["Krishnendu","N. V.",""],["Gupta","Anuradha",""]]}
{"id":"2308.05099","submitter":"Daniel Tamayo Jim\\'enez","authors":"Daniel Tamayo Jim\\'enez","title":"Inversion and Cubic Vectors for Permutrees","comments":"17 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce two generalizations of bracket vectors from binary trees to\npermutrees. These new vectors help describe algebraic and geometric properties\nof the rotation lattice of permutrees defined by Pilaud and Pons. The first\ngeneralization serves the role of an inversion vector for permutrees allowing\nus to define an explicit meet operation and provide a new constructive proof of\nthe lattice property for permutree rotation lattices. The second\ngeneralization, which we call cubic vectors, allows for the construction of a\ncubic realization of these lattices which is proven to form a cubical embedding\nof the corresponding permutreehedra. These results specialize to those known\nabout permutahedra and associahedra.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:49:32 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 13:51:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jim\u00e9nez","Daniel Tamayo",""]]}
{"id":"2308.05100","submitter":"Hassan Alnatah","authors":"Hassan Alnatah, Qi Yao, Jonathan Beaumariage, Shouvik Mukherjee, Man\n  Chun Tam, Zbigniew Wasilewski, Ken West, Kirk Baldwin, Loren N. Pfeiffer, and\n  David W. Snoke","title":"Coherence measurements of polaritons in thermal equilibrium reveal a new\n  power law for two-dimensional condensates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have created a spatially homogeneous polariton condensate in thermal\nequilibrium, up to very high condensate fraction. Under these conditions, we\nhave measured the coherence as a function of momentum, and determined the total\ncoherent fraction of this boson system from very low density up to density well\nabove the condensation transition. These measurements reveal a consistent power\nlaw for the coherent fraction over nearly three orders of magnitude of density\nvariation. The same power law is seen in numerical simulations solving the\ntwo-dimensional Gross-Pitaevskii equation for the equilibrium coherence. This\npower law has not been predicted by prior analytical theories.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:51:59 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Alnatah","Hassan",""],["Yao","Qi",""],["Beaumariage","Jonathan",""],["Mukherjee","Shouvik",""],["Tam","Man Chun",""],["Wasilewski","Zbigniew",""],["West","Ken",""],["Baldwin","Kirk",""],["Pfeiffer","Loren N.",""],["Snoke","David W.",""]]}
{"id":"2308.05101","submitter":"Soumadeep Saha","authors":"Soumadeep Saha, Utpal Garain, Arijit Ukil, Arpan Pal, Sundeep\n  Khandelwal","title":"DOST -- Domain Obedient Self-supervised Training for Multi Label\n  Classification with Noisy Labels","comments":"Submitted to IEEE TNNLS on March 7th 2023. 8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The enormous demand for annotated data brought forth by deep learning\ntechniques has been accompanied by the problem of annotation noise. Although\nthis issue has been widely discussed in machine learning literature, it has\nbeen relatively unexplored in the context of \"multi-label classification\" (MLC)\ntasks which feature more complicated kinds of noise. Additionally, when the\ndomain in question has certain logical constraints, noisy annotations often\nexacerbate their violations, making such a system unacceptable to an expert.\nThis paper studies the effect of label noise on domain rule violation incidents\nin the MLC task, and incorporates domain rules into our learning algorithm to\nmitigate the effect of noise. We propose the Domain Obedient Self-supervised\nTraining (DOST) paradigm which not only makes deep learning models more aligned\nto domain rules, but also improves learning performance in key metrics and\nminimizes the effect of annotation noise. This novel approach uses domain\nguidance to detect offending annotations and deter rule-violating predictions\nin a self-supervised manner, thus making it more \"data efficient\" and domain\ncompliant. Empirical studies, performed over two large scale multi-label\nclassification datasets, demonstrate that our method results in improvement\nacross the board, and often entirely counteracts the effect of noise.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:53:36 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Saha","Soumadeep",""],["Garain","Utpal",""],["Ukil","Arijit",""],["Pal","Arpan",""],["Khandelwal","Sundeep",""]]}
{"id":"2308.05102","submitter":"Amanda Farah","authors":"Amanda M. Farah, Maya Fishbach, Daniel E. Holz","title":"Two of a Kind: Comparing big and small black holes in binaries with\n  gravitational waves","comments":"Main text: 11 pages, 6 figures. Total: 23 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When modeling the population of merging binary black holes, analyses\ngenerally focus on characterizing the distribution of primary (i.e. more\nmassive) black holes in the binary, while simplistic prescriptions are used for\nthe distribution of secondary masses. However, the secondary mass distribution\nprovides a fundamental observational constraint on the formation history of\ncoalescing binary black holes. If both black holes experience similar stellar\nevolutionary processes prior to collapse, as might be expected in dynamical\nformation channels, the primary and secondary mass distributions would show\nsimilar features. If they follow distinct evolutionary pathways (for example,\ndue to binary interactions that break symmetry between the initially more\nmassive and less massive star), their mass distributions may differ. We\nexplicitly fit the secondary mass distribution, finding that if the primary and\nsecondary mass distributions are different, the previously-identified peak in\nthe primary mass distribution may be driven by an even larger peak in the\nsecondary mass distribution. Alternatively, if we assume that the two masses\nare drawn from the same underlying distribution, they both show a peak at\n$31.4_{-2.6}^{+2.3} \\, M_{\\odot}$. This value is shifted lower than that\nobtained when assuming the peak only exists in the marginal primary mass\ndistribution, placing this feature in further tension with expectations from a\npulsational pair-instability supernova pileup. We anticipate that by the end of\nthe fifth LIGO-Virgo-KAGRA observing run, we will be able to determine whether\nthe data prefer distinct or identical component mass distributions to\n$>4\\sigma$, providing important clues to the formation history of coalescing\nbinary black holes.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:54:00 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Farah","Amanda M.",""],["Fishbach","Maya",""],["Holz","Daniel E.",""]]}
{"id":"2308.05103","submitter":"Jaejin Cho","authors":"Jaejin Cho, Yohan Jun, Xiaoqing Wang, Caique Kobayashi, Berkin Bilgic","title":"Improved Multi-Shot Diffusion-Weighted MRI with Zero-Shot\n  Self-Supervised Learning Reconstruction","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion MRI is commonly performed using echo-planar imaging (EPI) due to\nits rapid acquisition time. However, the resolution of diffusion-weighted\nimages is often limited by magnetic field inhomogeneity-related artifacts and\nblurring induced by T2- and T2*-relaxation effects. To address these\nlimitations, multi-shot EPI (msEPI) combined with parallel imaging techniques\nis frequently employed. Nevertheless, reconstructing msEPI can be challenging\ndue to phase variation between multiple shots. In this study, we introduce a\nnovel msEPI reconstruction approach called zero-MIRID (zero-shot\nself-supervised learning of Multi-shot Image Reconstruction for Improved\nDiffusion MRI). This method jointly reconstructs msEPI data by incorporating\ndeep learning-based image regularization techniques. The network incorporates\nCNN denoisers in both k- and image-spaces, while leveraging virtual coils to\nenhance image reconstruction conditioning. By employing a self-supervised\nlearning technique and dividing sampled data into three groups, the proposed\napproach achieves superior results compared to the state-of-the-art parallel\nimaging method, as demonstrated in an in-vivo experiment.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:54:56 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Cho","Jaejin",""],["Jun","Yohan",""],["Wang","Xiaoqing",""],["Kobayashi","Caique",""],["Bilgic","Berkin",""]]}
{"id":"2308.05104","submitter":"Songlin Tang","authors":"Songlin Tang, Wenjie Pei, Xin Tao, Tanghui Jia, Guangming Lu, Yu-Wing\n  Tai","title":"Scene-Generalizable Interactive Segmentation of Radiance Fields","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 for interactive segmentation in radiance fields entail\nscene-specific optimization and thus cannot generalize across different scenes,\nwhich greatly limits their applicability. In this work we make the first\nattempt at Scene-Generalizable Interactive Segmentation in Radiance Fields\n(SGISRF) and propose a novel SGISRF method, which can perform 3D object\nsegmentation for novel (unseen) scenes represented by radiance fields, guided\nby only a few interactive user clicks in a given set of multi-view 2D images.\nIn particular, the proposed SGISRF focuses on addressing three crucial\nchallenges with three specially designed techniques. First, we devise the\nCross-Dimension Guidance Propagation to encode the scarce 2D user clicks into\ninformative 3D guidance representations. Second, the Uncertainty-Eliminated 3D\nSegmentation module is designed to achieve efficient yet effective 3D\nsegmentation. Third, Concealment-Revealed Supervised Learning scheme is\nproposed to reveal and correct the concealed 3D segmentation errors resulted\nfrom the supervision in 2D space with only 2D mask annotations. Extensive\nexperiments on two real-world challenging benchmarks covering diverse scenes\ndemonstrate 1) effectiveness and scene-generalizability of the proposed method,\n2) favorable performance compared to classical method requiring scene-specific\noptimization.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:55:50 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Tang","Songlin",""],["Pei","Wenjie",""],["Tao","Xin",""],["Jia","Tanghui",""],["Lu","Guangming",""],["Tai","Yu-Wing",""]]}
{"id":"2308.05105","submitter":"Yohana Herrero Alonso","authors":"Yohana Herrero Alonso, L. Wisotzki, T. Miyaji, J. Schaye, J. Pharo and\n  M. Krumpe","title":"The contribution of faint Lyman-$\\alpha$ emitters to extended\n  Lyman-$\\alpha$ halos constrained by MUSE clustering measurements","comments":"13 pages, 10 figures, 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-sa/4.0/","abstract":"  Detections of extended Ly$\\alpha$ halos (LAHs) around Ly$\\alpha$ emitters\n(LAEs) have lately been reported on a regular basis, but their origin is still\nunder investigation. Simulation studies predict that the outer regions of the\nextended LAHs contain a major contribution from the Ly$\\alpha$ emission of\nfaint, individually undetected LAEs. To address this matter from an\nobservational angle, we use halo occupation distribution (HOD) modeling to\nreproduce the clustering of a spectroscopic sample of 1265 LAEs at $3<z<5$ from\nthe MUSE-Wide survey. We integrate the Ly$\\alpha$ luminosity function (LF) to\nestimate the background surface brightness due to discrete faint LAEs. We then\nextend the HOD statistics inwards towards small separations and compute the\nfactor by which the measured Ly$\\alpha$ surface brightness (SB) is enhanced by\nundetected close physical neighbors. We consider various clustering scenarios\nfor the undetected sources and compare the corresponding radial profiles. The\nresulting inferred Ly$\\alpha$ SB of faint LAEs ranges between\n$(0.4-2)\\times10^{20}\\;\\rm{erg}\\;\\rm{s}^{-1}~\\rm{cm}^{-2}~\\rm{arcsec}^{-2}$,\nwith a very slow radial decline outwards. Our results suggest that the outer\nregions of observed LAHs ($R\\gtrsim50$~pkpc) could indeed contain a strong\ncomponent from external (but physically associated) LAEs, possibly even be\ndominated by them. Only for a relatively shallow faint-end slope of the\nLy$\\alpha$ LF would this contribution from clustered LAEs become unimportant.\nWe also confirm that the observed emission from the inner regions\n($R\\le20-30$~pkpc) is too bright to be significantly affected by clustering. We\ncompare our findings with predicted profiles from simulations and find good\noverall agreement. We outline possible future measurements to further constrain\nthe impact of discrete undetected LAEs on observed extended LAHs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:59:23 GMT"}],"update_date":"2023-08-10","authors_parsed":[["Alonso","Yohana Herrero",""],["Wisotzki","L.",""],["Miyaji","T.",""],["Schaye","J.",""],["Pharo","J.",""],["Krumpe","M.",""]]}
{"id":"2308.05109","submitter":"Zi-Wei Chen","authors":"Zi-Wei Chen, Bang-Hui Hua and Xiang-Song Chen","title":"Arbitrariness and Usefulness of the Expressions of Elastic wave's\n  Energy, Momentum and Angular Momentum","comments":"This paper has been submitted to Physical Review E","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Elastic angular momentum is an emerging field, with some controversies on the\ncorrect field-theory expressions and the decomposition of longitudinal and\ntransverse components. Motivated by the recent two papers [Phys.Rev.Lett. 128,\n064301(2022), Phys.Rev.Lett. 129, 204303(2022)] on this issue, we\nsystematically analyze by Noether's theorem the canonical and Belinfante\nenergy-momentem and angular momentum, then explain why the two familiar\nexpressions, together with other various conservered currents, are all correct\nfor elastic wave. Remarkbly, to illustrate the usefullness of different\nexpressions, we give an example on earthquake energy measurement with a new\nenergy density expression which is more advantageous in practical measurement.\nMoreover, since the elastic wave is distinct from a quantum one, we suggest\nthat the decomposition of longitudinal and transverse components, in fact,\nmakes sense and can be clearly expressed by the observable displacement field.\nWe hope that this paper would clarify the controversies, and finally we give\nprospect of future work on the Geometric Spin Hall Effect of elastic wave,\nwhere the various expressions of conserved currents would exhibit different\napplications.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 15:45:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Zi-Wei",""],["Hua","Bang-Hui",""],["Chen","Xiang-Song",""]]}
{"id":"2308.05110","submitter":"Jiayi Yuan","authors":"Qizhang Feng, Jiayi Yuan, Forhan Bin Emdad, Karim Hanna, Xia Hu, Zhe\n  He","title":"Can Attention Be Used to Explain EHR-Based Mortality Prediction Tasks: A\n  Case Study on Hemorrhagic Stroke","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stroke is a significant cause of mortality and morbidity, necessitating early\npredictive strategies to minimize risks. Traditional methods for evaluating\npatients, such as Acute Physiology and Chronic Health Evaluation (APACHE II,\nIV) and Simplified Acute Physiology Score III (SAPS III), have limited accuracy\nand interpretability. This paper proposes a novel approach: an interpretable,\nattention-based transformer model for early stroke mortality prediction. This\nmodel seeks to address the limitations of previous predictive models, providing\nboth interpretability (providing clear, understandable explanations of the\nmodel) and fidelity (giving a truthful explanation of the model's dynamics from\ninput to output). Furthermore, the study explores and compares fidelity and\ninterpretability scores using Shapley values and attention-based scores to\nimprove model explainability. The research objectives include designing an\ninterpretable attention-based transformer model, evaluating its performance\ncompared to existing models, and providing feature importance derived from the\nmodel.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 04:28:07 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Feng","Qizhang",""],["Yuan","Jiayi",""],["Emdad","Forhan Bin",""],["Hanna","Karim",""],["Hu","Xia",""],["He","Zhe",""]]}
{"id":"2308.05111","submitter":"Paulo Sad","authors":"Paulo Sad","title":"Example of a foliation for Ueda type one","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give an example of a regular 2-dimensional foliation along a curve of\ngenus 3 whose Ueda type is one and normal bundle is of order two\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:42:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sad","Paulo",""]]}
{"id":"2308.05112","submitter":"Ruiqi Zhang","authors":"Ruiqi Zhang and Jie Chen and Qiang Wang","title":"Explicifying Neural Implicit Fields for Efficient Dynamic Human Avatar\n  Modeling via a Neural Explicit Surface","comments":"8 pages, accepted by ACMMM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a technique for efficiently modeling dynamic humans by\nexplicifying the implicit neural fields via a Neural Explicit Surface (NES).\nImplicit neural fields have advantages over traditional explicit\nrepresentations in modeling dynamic 3D content from sparse observations and\neffectively representing complex geometries and appearances. Implicit neural\nfields defined in 3D space, however, are expensive to render due to the need\nfor dense sampling during volumetric rendering. Moreover, their memory\nefficiency can be further optimized when modeling sparse 3D space. To overcome\nthese issues, the paper proposes utilizing Neural Explicit Surface (NES) to\nexplicitly represent implicit neural fields, facilitating memory and\ncomputational efficiency. To achieve this, the paper creates a fully\ndifferentiable conversion between the implicit neural fields and the explicit\nrendering interface of NES, leveraging the strengths of both implicit and\nexplicit approaches. This conversion enables effective training of the hybrid\nrepresentation using implicit methods and efficient rendering by integrating\nthe explicit rendering interface with a newly proposed rasterization-based\nneural renderer that only incurs a texture color query once for the initial ray\ninteraction with the explicit surface, resulting in improved inference\nefficiency. NES describes dynamic human geometries with pose-dependent neural\nimplicit surface deformation fields and their dynamic neural textures both in\n2D space, which is a more memory-efficient alternative to traditional 3D\nmethods, reducing redundancy and computational load. The comprehensive\nexperiments show that NES performs similarly to previous 3D approaches, with\ngreatly improved rendering speed and reduced memory cost.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:17:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhang","Ruiqi",""],["Chen","Jie",""],["Wang","Qiang",""]]}
{"id":"2308.05113","submitter":"Ingmar Boesing","authors":"Ingmar B\\\"osing, Jorg Th\\\"oming, Fabio La Mantia","title":"Modeling of electrochemical oxide film growth -- impact of band-to-band\n  tunneling","comments":null,"journal-ref":"Electrochimica Acta 406 (2022)","doi":"10.1016/j.electacta.2022.139848","report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Point Defect Model (PDM) describes the corrosion resistance properties of\noxide films based on interfacial reactions and defect transport, which are\naffected by the electric field inside the oxide film. The PDM assumes a\nconstant electric field strength due to band-to-band tunneling (BTBT) of\nelectrons and the separation of electrons and holes by high electric fields. In\nthis manuscript we present a more complex expansion of the common models to\nsimulate steady state oxide films to test this assumption. The R-PDM was\nextended by including the transport of electrons and holes and BTBT. It could\nbe shown that BTBT only occurs in very rare cases of narrow band gaps and high\nelectric fields and the impact of electrons and holes does indeed lead to a\nbuffering effect on the electric field, but does not lead to a constant\nelectric field strength. Modeling the transport of electrons and holes on the\noxide film allows to specifically estimate their potential impact on the film\ngrowth. Especially during modeling of oxide films with narrow band gap and/or\nelectrochemical reactions at the film/solution interface the electrons and\nholes needs to be included to the model.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:58:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["B\u00f6sing","Ingmar",""],["Th\u00f6ming","Jorg",""],["La Mantia","Fabio",""]]}
{"id":"2308.05114","submitter":"Partha Goswami","authors":"Partha Goswami, Udai Prakash Tyagi","title":"Some information on acoustic topological insulator","comments":"5 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this exceedingly short review article, we have provided some information\non acoustic topological insulator for pedagogical purpose. Since, intrinsically\nacoustic systems do not have Kramers doublets due to spin-zero status,\nartificially acoustic spin-half states could be engineered as reported in refs.\n5-26 maintaining time reversal symmetry. The high point of this article is an\nexplanation of emergent Dirac physics in acoustic topological insulators.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 05:43:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Goswami","Partha",""],["Tyagi","Udai Prakash",""]]}
{"id":"2308.05115","submitter":"Ziyang Xu","authors":"Ziyang Xu and Haitian Zhong","title":"PTransIPs: Identification of phosphorylation sites based on protein\n  pretrained language model and Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phosphorylation is central to numerous fundamental cellular processes,\ninfluencing the onset and progression of a variety of diseases. The correct\nidentification of these phosphorylation sites is of great importance to unravel\nthe intricate molecular mechanisms within cells and during viral infections,\npotentially leading to the discovery of new therapeutic targets. In this study,\nwe introduce PTransIPs, a novel deep learning model for the identification of\nphosphorylation sites. PTransIPs treat amino acids within protein sequences as\nwords, extracting unique encodings based on their type and sequential position.\nThe model also incorporates embeddings from large pretrained protein models as\nadditional data inputs. PTransIPS is further trained on a combination model of\nconvolutional neural network with residual connections and Transformer model\nequipped with multi-head attention mechanisms. At last, the model outputs\nclassification results through a fully connected layer. The results of\nindependent testing reveal that PTransIPs outperforms existing\nstate-of-the-art(SOTA) methods, achieving AUROCs of 0.9232 and 0.9660 for\nidentifying phosphorylated S/T and Y sites respectively. In addition, ablation\nstudies prove that pretrained model embeddings contribute to the performance of\nPTransIPs. Furthermore, PTransIPs has interpretable amino acid preference,\nvisible training process and shows generalizability on other bioactivity\nclassification tasks. To facilitate usage, our code and data are publicly\naccessible at \\url{https://github.com/StatXzy7/PTransIPs}.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 07:50:38 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 06:35:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Ziyang",""],["Zhong","Haitian",""]]}
{"id":"2308.05116","submitter":"Jie Liu","authors":"Jie Liu, Tao Zhang and Shuyu Sun","title":"Absorption of Carbon Dioxide in Kerogen Nanopores: A Mechanism Study\n  using the Molecular Dynamics Monte Carlo Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Carbon capture and storage (CCS) technology has been applied successfully in\nrecent decades to reduce carbon emissions and alleviate global warming. In this\nregard, shale reservoirs present tremendous potential for carbon dioxide (CO2)\nsequestration as they have a large number of nanopores. Molecular dynamics (MD)\nand MD-Monte Carlo (MDMC) methods were employed in this work to study the\nabsorption behavior of CO2 in shale organic porous media. The MDMC method is\nused to analyze the spatial states of CO2, and the results are in good\nagreement with MD results, and it also performs well in the acceleration\ncompared to the classical MD. With regard to the kerogen matrix, its\nproperties, such as the pore size distribution (PSD), pore volume, and surface\narea, are determined to describe its different compression states and the\neffects of CO2 absorption on it. The potential energy distribution and\npotential of mean force are analyzed to verify the spatial distribution of CO2\nmolecules. The heterogeneity of the pore structure resulted in heterogeneous\ndistributions of CO2 molecules in kerogen porous media. Moreover, strong\ncompression of the matrix reduces the number of large pores, and the PSD is\nmainly between 0 and 15 Angstrom. Despite the high interaction force of the\nkerogen matrix, the high-potential-energy region induced by the kerogen\nskeleton also contributes to the formation of low-energy regions that encourage\nthe entry of CO2. An increase in temperature facilitates the absorption\nprocess, allowing CO2 molecules to enter the isolated pores with stronger\nthermal motion, thereby increasing the storage capacity for CO2. However, the\ndevelopment of geothermal energy may not be suitable for CO2 sequestration.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 11:40:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Jie",""],["Zhang","Tao",""],["Sun","Shuyu",""]]}
{"id":"2308.05117","submitter":"Mohsen Sadr","authors":"Mohsen Sadr and M. Hossein Gorji","title":"A Continuous Stochastic Model for Non-Equilibrium Dense Gases","comments":null,"journal-ref":"Physics of Fluids 29, no. 12 (2017)","doi":"10.1063/1.5004409","report-no":null,"categories":"physics.comp-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  While accurate simulations of dense gas flows far from the equilibrium can be\nachieved by Direct Simulation adapted to the Enskog equation, the significant\ncomputational demand required for collisions appears as a major constraint. In\norder to cope with that, an efficient yet accurate solution algorithm based on\nthe Fokker-Planck approximation of the Enskog equation is devised in this\npaper; the approximation is very much associated with the Fokker-Planck model\nderived from the Boltzmann equation [J. Comput. Phys., 229, 1077 (2010)]-[J.\nFluid Mech., 680, 574 (2011)]. The idea behind these Fokker-Planck descriptions\nis to project the dynamics of discrete collisions implied by the molecular\nencounters into a set of continuous Markovian processes subject to the drift\nand diffusion. Thereby, the evolution of particles representing the governing\nstochastic process becomes independent from each-other and thus very efficient\nnumerical schemes can be constructed. By close inspection of the Enskog\noperator, it is observed that the dense gas effects contribute further to the\nadvection of molecular quantities. That motivates a modelling approach where\nthe dense gas corrections can be cast in the extra advection of particles.\nTherefore, the corresponding Fokker-Planck approximation is derived such that\nthe evolution in the physical space accounts for the dense effects present in\nthe pressure, stress tensor and heat fluxes. Hence the consistency between the\ndevised Fokker-Planck approximation and the Enskog operator is shown for the\nvelocity moments up to the heat fluxes. For validation studies, a homogeneous\ngas inside a box besides Fourier, Couette and lid-driven cavity flow setups are\nconsidered. The results based on the Fokker-Planck model are compared with\nrespect to benchmark simulations, where good agreements are found for the flow\nfield along with the transport properties.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:04:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sadr","Mohsen",""],["Gorji","M. Hossein",""]]}
{"id":"2308.05118","submitter":"Daniel Um","authors":"Daniel H. Um, David A. Knowles, Gail E. Kaiser","title":"Vector Embeddings by Sequence Similarity and Context for Improved\n  Compression, Similarity Search, Clustering, Organization, and Manipulation of\n  cDNA Libraries","comments":"15 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper demonstrates the utility of organized numerical representations of\ngenes in research involving flat string gene formats (i.e., FASTA/FASTQ5).\nFASTA/FASTQ files have several current limitations, such as their large file\nsizes, slow processing speeds for mapping and alignment, and contextual\ndependencies. These challenges significantly hinder investigations and tasks\nthat involve finding similar sequences. The solution lies in transforming\nsequences into an alternative representation that facilitates easier clustering\ninto similar groups compared to the raw sequences themselves. By assigning a\nunique vector embedding to each short sequence, it is possible to more\nefficiently cluster and improve upon compression performance for the string\nrepresentations of cDNA libraries. Furthermore, through learning alternative\ncoordinate vector embeddings based on the contexts of codon triplets, we can\ndemonstrate clustering based on amino acid properties. Finally, using this\nsequence embedding method to encode barcodes and cDNA sequences, we can improve\nthe time complexity of the similarity search by coupling vector embeddings with\nan algorithm that determines the proximity of vectors in Euclidean space; this\nallows us to perform sequence similarity searches in a quicker and more modular\nfashion.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:31:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Um","Daniel H.",""],["Knowles","David A.",""],["Kaiser","Gail E.",""]]}
{"id":"2308.05119","submitter":"John Baez","authors":"John C. Baez","title":"Ho\\`ang Xu\\^an S\\'inh's Thesis: Categorifying Group Theory","comments":"22 pages with xypic figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.HO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During what Vietnamese call the American War, Alexander Grothendieck spent\nthree weeks teaching mathematics in and near Hanoi. Ho\\`ang Xu\\^an S\\'inh took\nnotes on his lectures and later did her thesis work with him by correspondence.\nIn her thesis she developed the theory of \"Gr-categories\", which are monoidal\ncategories in which all objects and morphisms have inverses. Now often called\n\"2-groups\", these structures allow the study of symmetries that themselves have\nsymmetries. After a brief account of how Ho\\`ang Xu\\^an S\\'inh wrote her\nthesis, we explain some of its main results, and its context in the history of\nmathematics.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 17:43:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Baez","John C.",""]]}
{"id":"2308.05120","submitter":"Edward Chen","authors":"Edward Chen, Han Bao, Nam Dinh","title":"Dynamic Model Agnostic Reliability Evaluation of Machine-Learning\n  Methods Integrated in Instrumentation & Control Systems","comments":"This paper was originally presented at the 13th Nuclear Plant\n  Instrumentation, Control & Human-Machine Interface Technologies conference\n  and was awarded best student paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, the field of data-driven neural network-based machine\nlearning (ML) algorithms has grown significantly and spurred research in its\napplicability to instrumentation and control systems. While they are promising\nin operational contexts, the trustworthiness of such algorithms is not\nadequately assessed. Failures of ML-integrated systems are poorly understood;\nthe lack of comprehensive risk modeling can degrade the trustworthiness of\nthese systems. In recent reports by the National Institute for Standards and\nTechnology, trustworthiness in ML is a critical barrier to adoption and will\nplay a vital role in intelligent systems' safe and accountable operation. Thus,\nin this work, we demonstrate a real-time model-agnostic method to evaluate the\nrelative reliability of ML predictions by incorporating out-of-distribution\ndetection on the training dataset. It is well documented that ML algorithms\nexcel at interpolation (or near-interpolation) tasks but significantly degrade\nat extrapolation. This occurs when new samples are \"far\" from training samples.\nThe method, referred to as the Laplacian distributed decay for reliability\n(LADDR), determines the difference between the operational and training\ndatasets, which is used to calculate a prediction's relative reliability. LADDR\nis demonstrated on a feedforward neural network-based model used to predict\nsafety significant factors during different loss-of-flow transients. LADDR is\nintended as a \"data supervisor\" and determines the appropriateness of\nwell-trained ML models in the context of operational conditions. Ultimately,\nLADDR illustrates how training data can be used as evidence to support the\ntrustworthiness of ML predictions when utilized for conventional interpolation\ntasks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:25:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Edward",""],["Bao","Han",""],["Dinh","Nam",""]]}
{"id":"2308.05121","submitter":"Christophe BOTELLA","authors":"Christophe Botella (ZENITH), Benjamin Deneu (ZENITH), Diego Marcos\n  (ZENITH), Maximilien Servajean (ADVANSE, UPVM), Joaquim Estopinan (ZENITH),\n  Th\\'eo Larcher (ZENITH), C\\'esar Leblanc (ZENITH), Pierre Bonnet (UMR AMAP,\n  Cirad-BIOS), Alexis Joly (ZENITH)","title":"The GeoLifeCLEF 2023 Dataset to evaluate plant species distribution\n  models at high spatial resolution across Europe","comments":"The full dataset is freely available at the link below (perennial\n  repository) for academic use or other non-commercial use:\n  https://lab.plantnet.org/seafile/d/936fe4298a5a4f4c8dbd/","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The difficulty to measure or predict species community composition at fine\nspatio-temporal resolution and over large spatial scales severely hampers our\nability to understand species assemblages and take appropriate conservation\nmeasures. Despite the progress in species distribution modeling (SDM) over the\npast decades, SDM have just begun to integrate high resolution remote sensing\ndata and their predictions are still entailed by many biases due to\nheterogeneity of the available biodiversity observations, most often\nopportunistic presence only data. We designed a European scale dataset covering\naround ten thousand plant species to calibrate and evaluate SDM predictions of\nspecies composition in space and time at high spatial resolution (~ten meters),\nand their spatial transferability. For model training, we extracted and\nharmonized five million heterogeneous presence-only records from selected GBIF\ndatasets and 6 thousand exhaustive presence-absence surveys both sampled during\n2017-2021. We associated species observations to diverse environmental rasters\nclassically used in SDMs, as well as to 10 m resolution RGB and Near-Infra-Red\nsatellite images and 20 years-time series of climatic variables and satellite\npoint values. The evaluation dataset is based on 22 thousand standardized\npresence-absence surveys separated from the training set with a spatial block\nhold out procedure. The GeoLifeCLEF 2023 dataset is open access and the first\nbenchmark for researchers aiming to improve the prediction of plant species\ncomposition at a very fine spatial grain and at continental scale. It is a\nspace to explore new ways of combining massive and diverse species observations\nand environmental information at various scales. Innovative AI-based\napproaches, in particular, should be among the most interesting methods to\nexperiment with on the GeoLifeCLEF 2023 dataset.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 07:55:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Botella","Christophe","","ZENITH"],["Deneu","Benjamin","","ZENITH"],["Marcos","Diego","","ZENITH"],["Servajean","Maximilien","","ADVANSE, UPVM"],["Estopinan","Joaquim","","ZENITH"],["Larcher","Th\u00e9o","","ZENITH"],["Leblanc","C\u00e9sar","","ZENITH"],["Bonnet","Pierre","","UMR AMAP,\n  Cirad-BIOS"],["Joly","Alexis","","ZENITH"]]}
{"id":"2308.05122","submitter":"Nicha Dvornek","authors":"Nicha C. Dvornek, Catherine Sullivan, James S. Duncan, Abha R. Gupta","title":"Copy Number Variation Informs fMRI-based Prediction of Autism Spectrum\n  Disorder","comments":"Accepted by Machine Learning in Clinical Neuroimaging 2023 (MICCAI\n  workshop), preprint version","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.CV cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The multifactorial etiology of autism spectrum disorder (ASD) suggests that\nits study would benefit greatly from multimodal approaches that combine data\nfrom widely varying platforms, e.g., neuroimaging, genetics, and clinical\ncharacterization. Prior neuroimaging-genetic analyses often apply naive feature\nconcatenation approaches in data-driven work or use the findings from one\nmodality to guide posthoc analysis of another, missing the opportunity to\nanalyze the paired multimodal data in a truly unified approach. In this paper,\nwe develop a more integrative model for combining genetic, demographic, and\nneuroimaging data. Inspired by the influence of genotype on phenotype, we\npropose using an attention-based approach where the genetic data guides\nattention to neuroimaging features of importance for model prediction. The\ngenetic data is derived from copy number variation parameters, while the\nneuroimaging data is from functional magnetic resonance imaging. We evaluate\nthe proposed approach on ASD classification and severity prediction tasks,\nusing a sex-balanced dataset of 228 ASD and typically developing subjects in a\n10-fold cross-validation framework. We demonstrate that our attention-based\nmodel combining genetic information, demographic data, and functional magnetic\nresonance imaging results in superior prediction performance compared to other\nmultimodal approaches.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:53:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dvornek","Nicha C.",""],["Sullivan","Catherine",""],["Duncan","James S.",""],["Gupta","Abha R.",""]]}
{"id":"2308.05123","submitter":"Yuanhan Mo","authors":"Yuanhan Mo and Yao Chen and Aimee Readie and Gregory Ligozio and\n  Thibaud Coroller and Bart{\\l}omiej W. Papie\\.z","title":"Towards Automatic Scoring of Spinal X-ray for Ankylosing Spondylitis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Manually grading structural changes with the modified Stoke Ankylosing\nSpondylitis Spinal Score (mSASSS) on spinal X-ray imaging is costly and\ntime-consuming due to bone shape complexity and image quality variations. In\nthis study, we address this challenge by prototyping a 2-step auto-grading\npipeline, called VertXGradeNet, to automatically predict mSASSS scores for the\ncervical and lumbar vertebral units (VUs) in X-ray spinal imaging. The\nVertXGradeNet utilizes VUs generated by our previously developed VU extraction\npipeline (VertXNet) as input and predicts mSASSS based on those VUs.\nVertXGradeNet was evaluated on an in-house dataset of lateral cervical and\nlumbar X-ray images for axial spondylarthritis patients. Our results show that\nVertXGradeNet can predict the mSASSS score for each VU when the data is limited\nin quantity and imbalanced. Overall, it can achieve a balanced accuracy of 0.56\nand 0.51 for 4 different mSASSS scores (i.e., a score of 0, 1, 2, 3) on two\ntest datasets. The accuracy of the presented method shows the potential to\nstreamline the spinal radiograph readings and therefore reduce the cost of\nfuture clinical trials.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:59:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mo","Yuanhan",""],["Chen","Yao",""],["Readie","Aimee",""],["Ligozio","Gregory",""],["Coroller","Thibaud",""],["Papie\u017c","Bart\u0142omiej W.",""]]}
{"id":"2308.05124","submitter":"Wei Chen","authors":"Wei Chen","title":"Berry curvature and quantum metric in copper-substituted lead phosphate\n  apatite","comments":"5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent discovery of copper-substituted lead phosphate apatite, also known\nas LK-99, has caught much attention owing to certain experimental evidence of\nroom-temperature superconductivity, although this claim is currently under\nintensive debate. Be it superconducting or not, we show that the normal state\nof this material has peculiar quantum geometrical properties that may be\nrelated to the magnetism and the mechanism for flat band superconductivity.\nBased on a recently proposed spinless two-band tight-binding model for the\nPb-Cu hexagonal lattice subset of the crystalline structure, which\nqualitatively captures the two flat bands in the band structure, we elaborate\nthe highly anisotropic Berry curvature and quantum metric in the regions of\nBrillouin zone where one flat band is above and the other below the Fermi\nsurface. In these regions, the Berry curvature has a pattern in the planar\nmomentum that remains unchanged along the out-of-plane momentum. Moreover, the\nnet orbital magnetization contributed from the Berry curvature is zero,\nsignifying that the magnetism in this material should come from other sources.\nThe quantum metric has a similar momentum dependence, and its two planar\ncomponents are found to be roughly the same but the out-of-plane component\nvanishes, hinting that the superfluid stiffness of the flat band\nsuperconductivity, shall it occur, may be quite anisotropic.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:43:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Wei",""]]}
{"id":"2308.05125","submitter":"Mamata Das","authors":"Mamata Das, Selvakumar K., P.J.A. Alphonse","title":"Two Novel Approaches to Detect Community: A Case Study of Omicron\n  Lineage Variants PPI Network","comments":"23 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The capacity to identify and analyze protein-protein interactions, along with\ntheir internal modular organization, plays a crucial role in comprehending the\nintricate mechanisms underlying biological processes at the molecular level. We\ncan learn a lot about the structure and dynamics of these interactions by using\nnetwork analysis. We can improve our understanding of the biological roots of\ndisease pathogenesis by recognizing network communities. This knowledge, in\nturn, holds significant potential for driving advancements in drug discovery\nand facilitating personalized medicine approaches for disease treatment. In\nthis study, we aimed to uncover the communities within the variant B.1.1.529\n(Omicron virus) using two proposed novel algorithm (ABCDE and ALCDE) and four\nwidely recognized algorithms: Girvan-Newman, Louvain, Leiden, and Label\nPropagation algorithm. Each of these algorithms has established prominence in\nthe field and offers unique perspectives on identifying communities within\ncomplex networks. We also compare the networks by the global properties,\nstatistic summary, subgraph count, graphlet and validate by the modulaity. By\nemploying these approaches, we sought to gain deeper insights into the\nstructural organization and interconnections present within the Omicron virus\nnetwork.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:51:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Das","Mamata",""],["K.","Selvakumar",""],["Alphonse","P. J. A.",""]]}
{"id":"2308.05126","submitter":"Iqbal H. Sarker","authors":"Iqbal H. Sarker, Helge Janicke, Leandros Maglaras and Seyit Camtepe","title":"Data-Driven Intelligence can Revolutionize Today's Cybersecurity World:\n  A Position Paper","comments":"15 pages, Springer","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As cyber threats evolve and grow progressively more sophisticated, cyber\nsecurity is becoming a more significant concern in today's digital era.\nTraditional security measures tend to be insufficient to defend against these\npersistent and dynamic threats because they are mainly intuitional. One of the\nmost promising ways to handle this ongoing problem is utilizing the potential\nof data-driven intelligence, by leveraging AI and machine learning techniques.\nIt can improve operational efficiency and saves response times by automating\nrepetitive operations, enabling real-time threat detection, and facilitating\nincident response. In addition, it augments human expertise with insightful\ninformation, predictive analytics, and enhanced decision-making, enabling them\nto better understand and address evolving problems. Thus, data-driven\nintelligence could significantly improve real-world cybersecurity solutions in\na wide range of application areas like critical infrastructure, smart cities,\ndigital twin, industrial control systems and so on. In this position paper, we\nargue that data-driven intelligence can revolutionize the realm of\ncybersecurity, offering not only large-scale task automation but also assist\nhuman experts for better situation awareness and decision-making in real-world\nscenarios.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:48:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sarker","Iqbal H.",""],["Janicke","Helge",""],["Maglaras","Leandros",""],["Camtepe","Seyit",""]]}
{"id":"2308.05127","submitter":"Pavan Kulkarni","authors":"Harshit Shah, Aravindhan G, Pavan Kulkarni, Yuvaraj Govidarajulu,\n  Manojkumar Parmar","title":"Data-Free Model Extraction Attacks in the Context of Object Detection","comments":"Submitted to The 14th International Conference on Computer Vision\n  Systems (ICVS 2023), to be published in Springer, Lecture Notes in Computer\n  Science","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A significant number of machine learning models are vulnerable to model\nextraction attacks, which focus on stealing the models by using specially\ncurated queries against the target model. This task is well accomplished by\nusing part of the training data or a surrogate dataset to train a new model\nthat mimics a target model in a white-box environment. In pragmatic situations,\nhowever, the target models are trained on private datasets that are\ninaccessible to the adversary. The data-free model extraction technique\nreplaces this problem when it comes to using queries artificially curated by a\ngenerator similar to that used in Generative Adversarial Nets. We propose for\nthe first time, to the best of our knowledge, an adversary black box attack\nextending to a regression problem for predicting bounding box coordinates in\nobject detection. As part of our study, we found that defining a loss function\nand using a novel generator setup is one of the key aspects in extracting the\ntarget model. We find that the proposed model extraction method achieves\nsignificant results by using reasonable queries. The discovery of this object\ndetection vulnerability will support future prospects for securing such models.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 06:23:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shah","Harshit",""],["G","Aravindhan",""],["Kulkarni","Pavan",""],["Govidarajulu","Yuvaraj",""],["Parmar","Manojkumar",""]]}
{"id":"2308.05128","submitter":"Andre Kelm","authors":"Andr\\'e Peter Kelm, Lucas Schmidt, Tim Rolff, Christian Wilms, Ehsan\n  Yaghoubi, Simone Frintrop","title":"High-Level Features Parallelization for Inference Cost Reduction Through\n  Selective Attention","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 parallelize high-level features in deep networks to\nselectively skip or select class-specific features to reduce inference costs.\nThis challenges most deep learning methods due to their limited ability to\nefficiently and effectively focus on selected class-specific features without\nretraining. We propose a serial-parallel hybrid architecture with serial\ngeneric low-level features and parallel high-level features. This accounts for\nthe fact that many high-level features are class-specific rather than generic,\nand has connections to recent neuroscientific findings that observe spatially\nand contextually separated neural activations in the human brain. Our approach\nprovides the unique functionality of cutouts: selecting parts of the network to\nfocus on only relevant subsets of classes without requiring retraining. High\nperformance is maintained, but the cost of inference can be significantly\nreduced. In some of our examples, up to $75\\,\\%$ of parameters are skipped and\n$35\\,\\%$ fewer GMACs (Giga multiply-accumulate) operations are used as the\napproach adapts to a change in task complexity. This is important for mobile,\nindustrial, and robotic applications where reducing the number of parameters,\nthe computational complexity, and thus the power consumption can be paramount.\nAnother unique functionality is that it allows processing to be directly\ninfluenced by enhancing or inhibiting high-level class-specific features,\nsimilar to the mechanism of selective attention in the human brain. This can be\nrelevant for cross-modal applications, the use of semantic prior knowledge,\nand/or context-aware processing.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:49:29 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kelm","Andr\u00e9 Peter",""],["Schmidt","Lucas",""],["Rolff","Tim",""],["Wilms","Christian",""],["Yaghoubi","Ehsan",""],["Frintrop","Simone",""]]}
{"id":"2308.05129","submitter":"Nina Weng","authors":"Nina Weng, Siavash Bigdeli, Eike Petersen, Aasa Feragen","title":"Are Sex-based Physiological Differences the Cause of Gender Bias for\n  Chest X-ray Diagnosis?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While many studies have assessed the fairness of AI algorithms in the medical\nfield, the causes of differences in prediction performance are often unknown.\nThis lack of knowledge about the causes of bias hampers the efficacy of bias\nmitigation, as evidenced by the fact that simple dataset balancing still often\nperforms best in reducing performance gaps but is unable to resolve all\nperformance differences. In this work, we investigate the causes of gender bias\nin machine learning-based chest X-ray diagnosis. In particular, we explore the\nhypothesis that breast tissue leads to underexposure of the lungs and causes\nlower model performance. Methodologically, we propose a new sampling method\nwhich addresses the highly skewed distribution of recordings per patient in two\nwidely used public datasets, while at the same time reducing the impact of\nlabel errors. Our comprehensive analysis of gender differences across diseases,\ndatasets, and gender representations in the training set shows that dataset\nimbalance is not the sole cause of performance differences. Moreover, relative\ngroup performance differs strongly between datasets, indicating important\ndataset-specific factors influencing male/female group performance. Finally, we\ninvestigate the effect of breast tissue more specifically, by cropping out the\nbreasts from recordings, finding that this does not resolve the observed\nperformance gaps. In conclusion, our results indicate that dataset-specific\nfactors, not fundamental physiological differences, are the main drivers of\nmale--female performance gaps in chest X-ray analyses on widely used NIH and\nCheXpert Dataset.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:19:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Weng","Nina",""],["Bigdeli","Siavash",""],["Petersen","Eike",""],["Feragen","Aasa",""]]}
{"id":"2308.05130","submitter":"Alireza Amani","authors":"Alireza Amani, A. S. Kubeka, and E. Mahichi","title":"Bouncing cosmology and dynamical analysis of stability with non-minimal\n  kinetic coupled gravity","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we model the bounce phase, stability and the reconstruction of\nthe universe by non-minimal kinetic coupling. In the process, we obtained\nimportance information about the energy density and the matter pressure of the\nuniverse in relation to the previous universe through the bounce quantum phase.\nThe novelty of the work is that the scale factor is obtained directly from the\nmodel and is fitted with an exponential function, with this view we explore the\nprocess of the early universe even the bounce phase. After that, we plot the\ncosmological parameters in terms of time evolution. In what follows, we\ninvestigate the stability of the model by the dynamical system analysis in a\nphase plane. Finally, the phase space trajectories examine the stability of the\nuniverse, especially in the inflationary period.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:56:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Amani","Alireza",""],["Kubeka","A. S.",""],["Mahichi","E.",""]]}
{"id":"2308.05131","submitter":"Rosalia Ferraro","authors":"Rosalia Ferraro, Sergio Caserta, Stefano Guido","title":"A low-cost, user-friendly rheo-optical compression assay to measure\n  mechanical properties of cell spheroids in standard cell culture plates","comments":"32 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM physics.bio-ph q-bio.CB","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The mechanical characterization of cell spheroids, one of the most widely\nused 3D biology models in vitro, is a hotspot of current research on the role\nplayed by the mechanical response of cells and tissues. The techniques proposed\nso far in the literature, while providing important scientific insights,\nrequire a specialized equipment and technical skills which are not usually\navailable in cell biology facilities. Here, we present an innovative\nrheo-optical compression assay based on microscopy glass coverslips as the load\napplied to cell spheroids in standard cell culture plates and on image\nacquisition with an optical microscope or even a smartphone equipped with\nadequate magnification lenses. Mechanical properties can be simply obtained by\ncorrelating the applied load to the deformation of cell spheroids measured by\nimage analysis. The low-cost, user-friendly features of the proposed technique\ncan boost mechanobiology research making it easily affordable to any biomedical\nlab equipped with cell culture facilities.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 12:40:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ferraro","Rosalia",""],["Caserta","Sergio",""],["Guido","Stefano",""]]}
{"id":"2308.05132","submitter":"Rabia Saleem","authors":"Xin-Yun Hu, M. Israr Aslam, Rabia Saleem and Xiao-Xiong Zeng","title":"Holographic Einstein Rings of an AdS Black Hole in Massive Gravity","comments":"15 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the context of holography, the Einstein ring of an AdS black hole (BH) in\nmassive gravity (MG) is depicted. An oscillating Gaussian source on one side of\nthe AdS boundary propagates in bulk, and we impose a response function to\nexplain it. Using a wave optics imaging system, we obtain the optical\nappearance of the Einstein ring. Our research reveals that the ring can change\ninto a luminosity-deformed ring or light spots depending on the variation of\nparameters and observational positions. When observers are positioned at the\nnorth pole, the holographic profiles always appear as a ring with concentric\nstripe surroundings, and a bright ring appears at the location of the photon\nsphere of the BH. These findings are consistent with the radius of the photon\nsphere of the BH, which is calculated in geometrical optics. Our study\ncontributes to a better understanding of the analytical studies of holographic\ntheory, which can be used to evaluate different types of BHs for a fixed wave\nsource and optical system.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:00:56 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 12:11:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Xin-Yun",""],["Aslam","M. Israr",""],["Saleem","Rabia",""],["Zeng","Xiao-Xiong",""]]}
{"id":"2308.05133","submitter":"Rohan Kumar Gupta","authors":"Rohan Kumar Gupta and Rohit Sinha","title":"Analyzing the Effect of Data Impurity on the Detection Performances of\n  Mental Disorders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.LG cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The primary method for identifying mental disorders automatically has\ntraditionally involved using binary classifiers. These classifiers are trained\nusing behavioral data obtained from an interview setup. In this training\nprocess, data from individuals with the specific disorder under consideration\nare categorized as the positive class, while data from all other participants\nconstitute the negative class. In practice, it is widely recognized that\ncertain mental disorders share similar symptoms, causing the collected\nbehavioral data to encompass a variety of attributes associated with multiple\ndisorders. Consequently, attributes linked to the targeted mental disorder\nmight also be present within the negative class. This data impurity may lead to\nsub-optimal training of the classifier for a mental disorder of interest. In\nthis study, we investigate this hypothesis in the context of major depressive\ndisorder (MDD) and post-traumatic stress disorder detection (PTSD). The results\nshow that upon removal of such data impurity, MDD and PTSD detection\nperformances are significantly improved.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:13:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gupta","Rohan Kumar",""],["Sinha","Rohit",""]]}
{"id":"2308.05134","submitter":"Hua Bai","authors":"Hua Bai, Lei Gao, Jianrong Ye, Chunhua Zeng, Wuming Liu","title":"Magnetic Properties and Spin-orbit Coupling induced Semiconductivity in\n  LK-99","comments":"24 pages, 11 figures. Supporting information is included","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent reports of a possible room-temperature superconductor called LK-99\nhave generated a lot of attention worldwide. In just a few days, a large amount\nof experimental works attempted to reproduce this sample and verify its\nproperties. At the same time a large amount of theoretical works have also been\nreported. However, many experiments have drawn different conclusions, and many\ntheoretical results are not consistent with experimental results. For one of\nthe structures of LK-99 with the chemical formula as Pb9Cu(PO4)6O, many\nfirst-principles calculations did not consider spin-orbit coupling and\nconcluded that it is a flat band metal. However, spin-orbit coupling is often\nnot negligible in systems with heavy elements, and LK-99 contains a large\namount of heavy element Pb. We performed calculations of electronic structure\nof Pb9Cu(PO4)6O with spin-orbit coupling, and the results show that it's not a\nmetal but a semiconductor. This is consistent with many experimental results.\nIn the ferromagnetic state Pb9Cu(PO4)6O is an indirect-bandgap semiconductor\nwith a bandgap of 292 meV. Moreover, its conduction band is a flat band. At an\nelectron doping level of 0.5 e/unit cell, Pb9Cu(PO4)6O becomes metallic and has\na flat band with a width of only 25 meV at the Fermi level in the ferromagnetic\nstate. While in the antiferromagnetic-A state, Pb9Cu(PO4)6O is a direct-bandgap\nsemiconductor with a bandgap of 300 meV. As a magnetic narrowband\nsemiconductor, Pb9Cu(PO4)6O may have potential application value in the field\nof optoelectronic device, photocatalytic, photodetector and spintronics device.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:05:31 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 06:01:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bai","Hua",""],["Gao","Lei",""],["Ye","Jianrong",""],["Zeng","Chunhua",""],["Liu","Wuming",""]]}
{"id":"2308.05135","submitter":"Pawan Kumar","authors":"Pawan Kumar, Paul Mulvaney and Dalton J. E. Harvie","title":"Predicting Contact Angle Hysteresis on Surfaces with Randomly and\n  Periodically Distributed Cylindrical Pillars via Energy Dissipation","comments":"20 pages, 11 figures in the main paper and 17 pages, 12 figures in\n  the supplementary material. Submitted to the Journal of Colloid and Interface\n  Science","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hypothesis: Understanding contact angle hysteresis on rough surfaces is\nimportant as most industrially relevant and naturally occurring surfaces\npossess some form of random or structured roughness. We hypothesise that\nhysteresis originates from the energy dissipation during the\n$\\textit{stick-slip}$ motion of the contact line and that this energy\ndissipation is key to developing a predictive equation for hysteresis.\n  Experiments: We measured hysteresis on surfaces with randomly distributed and\nperiodically arranged microscopic cylindrical pillars for a variety of\ndifferent liquids in air. The inherent (flat surface) contact angles tested\nrange from lyophilic ($\\theta_{\\rm{e}}=33.8^{\\circ}$) to lyophobic\n($\\theta_{\\rm{e}} = 112.0^{\\circ}$).\n  Findings: A new methodology for calculating the average advancing and\nreceding contact angles on random surfaces is presented. Also, the correlations\nfor roughness-induced energy dissipation were derived, and a predictive\nequation for the advancing and receding contact angles during homogeneous\n(Wenzel) wetting on random surfaces is presented. Significantly, equations that\npredict the onset of the alternate wetting conditions of hemiwicking,\nsplit-advancing, split-receding and heterogeneous (Cassie) wetting are also\nderived, thus defining the range of validity for the derived homogeneous\nwetting equation. A novel feature 'cluster' concept is introduced which\nexplains the measurably higher hysteresis exhibited by structured surfaces\ncompared to random surfaces observed experimentally.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:10:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kumar","Pawan",""],["Mulvaney","Paul",""],["Harvie","Dalton J. E.",""]]}
{"id":"2308.05136","submitter":"Hyeok Kim","authors":"Hyeok Kim, Ryan Rossi, Jessica Hullman, Jane Hoffswell","title":"Dupo: A Mixed-Initiative Authoring Tool for Responsive Visualization","comments":"10 pages, 5 figures, accepted to IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Designing responsive visualizations for various screen types can be tedious\nas authors must manage multiple chart~versions across design iterations.\nAutomated approaches for responsive visualization must take into account the\nuser's need for agency in exploring possible design ideas and applying\ncustomizations based on their own goals. We design and implement Dupo, a\nmixed-initiative approach to creating responsive visualizations that combines\nthe agency afforded by a manual interface with automation provided by a\nrecommender system. Given an initial design, users can browse automated design\nsuggestions for a different screen type and make edits to a chosen design,\nthereby supporting quick prototyping and customizability. Dupo employs a\ntwo-step recommender pipeline that first suggests significant design changes\n(Exploration) followed by more subtle changes (Alteration). We evaluated Dupo\nwith six expert responsive visualization authors. While creating responsive\nversions of a source design in Dupo, participants could reason about different\ndesign suggestions without having to manually prototype them, and thus avoid\nprematurely fixating on a particular design. This process led participants to\ncreate designs that they were satisfied with but which they had previously\noverlooked.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:03:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kim","Hyeok",""],["Rossi","Ryan",""],["Hullman","Jessica",""],["Hoffswell","Jane",""]]}
{"id":"2308.05137","submitter":"Fan Bai","authors":"Fan Bai, Xiaohan Xing, Yutian Shen, Han Ma, Max Q.-H. Meng","title":"Discrepancy-based Active Learning for Weakly Supervised Bleeding\n  Segmentation in Wireless Capsule Endoscopy Images","comments":"accepted by MICCAI 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weakly supervised methods, such as class activation maps (CAM) based, have\nbeen applied to achieve bleeding segmentation with low annotation efforts in\nWireless Capsule Endoscopy (WCE) images. However, the CAM labels tend to be\nextremely noisy, and there is an irreparable gap between CAM labels and ground\ntruths for medical images. This paper proposes a new Discrepancy-basEd Active\nLearning (DEAL) approach to bridge the gap between CAMs and ground truths with\na few annotations. Specifically, to liberate labor, we design a novel\ndiscrepancy decoder model and a CAMPUS (CAM, Pseudo-label and groUnd-truth\nSelection) criterion to replace the noisy CAMs with accurate model predictions\nand a few human labels. The discrepancy decoder model is trained with a unique\nscheme to generate standard, coarse and fine predictions. And the CAMPUS\ncriterion is proposed to predict the gaps between CAMs and ground truths based\non model divergence and CAM divergence. We evaluate our method on the WCE\ndataset and results show that our method outperforms the state-of-the-art\nactive learning methods and reaches comparable performance to those trained\nwith full annotated datasets with only 10% of the training data labeled.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:04:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bai","Fan",""],["Xing","Xiaohan",""],["Shen","Yutian",""],["Ma","Han",""],["Meng","Max Q. -H.",""]]}
{"id":"2308.05138","submitter":"Yichen Qin","authors":"Yichen Qin, Daxin Xu","title":"Irregular Hodge filtration of hypergeometric differential equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fedorov and Sabbah--Yu calculated the (irregular) Hodge numbers of\nhypergeometric connections. In this paper, we study the irregular Hodge\nfiltrations on hypergeometric connections defined by rational parameters, and\nprovide a new proof of the aforementioned results. Our approach is based on a\ngeometric interpretation of hypergeometric connections, which enables us to\nshow that certain hypergeometric sums are everywhere ordinary on\n$|\\mathbb{G}_{m,\\mathbb{F}_p}|$ (i.e. \"Frobenius Newton polygon equals to\nirregular Hodge polygon\").\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:11:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Qin","Yichen",""],["Xu","Daxin",""]]}
{"id":"2308.05139","submitter":"Konrad Waldorf","authors":"Peter Kristel and Matthias Ludewig and Konrad Waldorf","title":"A representation of the string 2-group","comments":"25 pages. This is an excerpt from our paper \"The stringor bundle\"\n  (arxiv:2206.09797), which we intend to split","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math-ph math.DG math.MP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a representation of the string 2-group on a 2-vector space,\naiming to establish it as the categorification of the spinor representation.\nOur model for 2-vector spaces is based on the Morita bicategory of von Neumann\nalgebras, and we specifically represent the string 2-group on the hyperfinite\ntype III_1 factor.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:19:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kristel","Peter",""],["Ludewig","Matthias",""],["Waldorf","Konrad",""]]}
{"id":"2308.05140","submitter":"Yidong Cai","authors":"Yidong Cai, Jie Liu, Jie Tang, Gangshan Wu","title":"Robust Object Modeling for Visual Tracking","comments":"Accepted by ICCV2023. 19 pages. Code is available at\n  https://github.com/dawnyc/ROMTrack","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Object modeling has become a core part of recent tracking frameworks. Current\npopular tackers use Transformer attention to extract the template feature\nseparately or interactively with the search region. However, separate template\nlearning lacks communication between the template and search regions, which\nbrings difficulty in extracting discriminative target-oriented features. On the\nother hand, interactive template learning produces hybrid template features,\nwhich may introduce potential distractors to the template via the cluttered\nsearch regions. To enjoy the merits of both methods, we propose a robust object\nmodeling framework for visual tracking (ROMTrack), which simultaneously models\nthe inherent template and the hybrid template features. As a result, harmful\ndistractors can be suppressed by combining the inherent features of target\nobjects with search regions' guidance. Target-related features can also be\nextracted using the hybrid template, thus resulting in a more robust object\nmodeling framework. To further enhance robustness, we present novel variation\ntokens to depict the ever-changing appearance of target objects. Variation\ntokens are adaptable to object deformation and appearance variations, which can\nboost overall performance with negligible computation. Experiments show that\nour ROMTrack sets a new state-of-the-art on multiple benchmarks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 15:32:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cai","Yidong",""],["Liu","Jie",""],["Tang","Jie",""],["Wu","Gangshan",""]]}
{"id":"2308.05141","submitter":"Nikolas Borrel-Jensen","authors":"Nikolas Borrel-Jensen, Somdatta Goswami, Allan P. Engsig-Karup, George\n  Em Karniadakis, Cheol-Ho Jeong","title":"Sound propagation in realistic interactive 3D scenes with parameterized\n  sources using deep neural operators","comments":"25 pages, 10 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We address the challenge of sound propagation simulations in $3$D virtual\nrooms with moving sources, which have applications in virtual/augmented\nreality, game audio, and spatial computing. Solutions to the wave equation can\ndescribe wave phenomena such as diffraction and interference. However,\nsimulating them using conventional numerical discretization methods with\nhundreds of source and receiver positions is intractable, making stimulating a\nsound field with moving sources impractical. To overcome this limitation, we\npropose using deep operator networks to approximate linear wave-equation\noperators. This enables the rapid prediction of sound propagation in realistic\n3D acoustic scenes with moving sources, achieving millisecond-scale\ncomputations. By learning a compact surrogate model, we avoid the offline\ncalculation and storage of impulse responses for all relevant source/listener\npairs. Our experiments, including various complex scene geometries, show good\nagreement with reference solutions, with root mean squared errors ranging from\n0.02 Pa to 0.10 Pa. Notably, our method signifies a paradigm shift as no prior\nmachine learning approach has achieved precise predictions of complete wave\nfields within realistic domains. We anticipate that our findings will drive\nfurther exploration of deep neural operator methods, advancing research in\nimmersive user experiences within virtual environments.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:32:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Borrel-Jensen","Nikolas",""],["Goswami","Somdatta",""],["Engsig-Karup","Allan P.",""],["Karniadakis","George Em",""],["Jeong","Cheol-Ho",""]]}
{"id":"2308.05142","submitter":"Alejandro Hern\\'andez-Mart\\'inez","authors":"Alejandro Hern\\'andez-Mart\\'inez, Adri\\'an David Garc\\'ia-Soto, Hugo\n  Hern\\'andez-Barrios and Jes\\'us Gerardo Vald\\'es-V\\'azquez","title":"Inconsistencies between the forces from code live load models and real\n  traffic on truss bridges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The forces acting on bridge structural elements caused by live loads are\ncomputed by live load models defined in design codes. In most cases, such live\nload models are defined by studies performed on girder bridges, where extreme\nvalues of shear forces and bending moment are intended to be predicted. This\npaper shows that when code live load models are applied to truss bridges, the\nestimated forces in some structural elements may not be representative of those\ncaused by actual traffic. Three WIM (weigh-in-motion) databases, which are\nrecorded on roads in Mexico, are used as real traffic data. The results suggest\nthat current code live load models are not entirely adequate to estimate forces\nin structural elements of truss bridges.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:54:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hern\u00e1ndez-Mart\u00ednez","Alejandro",""],["Garc\u00eda-Soto","Adri\u00e1n David",""],["Hern\u00e1ndez-Barrios","Hugo",""],["Vald\u00e9s-V\u00e1zquez","Jes\u00fas Gerardo",""]]}
{"id":"2308.05143","submitter":"Jonah Herzog-Arbeitman","authors":"Yi Jiang, Scott B. Lee, Jonah Herzog-Arbeitman, Jiabin Yu, Xiaolong\n  Feng, Haoyu Hu, Dumitru C\\u{a}lug\\u{a}ru, Parker S. Brodale, Eoghan L.\n  Gormley, Maia Garcia Vergniory, Claudia Felser, S. Blanco-Canosa, Christopher\n  H. Hendon, Leslie M. Schoop, B. Andrei Bernevig","title":"Pb$_9$Cu(PO4)$_6$(OH)$_2$: Phonon bands, Localized Flat Band Magnetism,\n  Models, and Chemical Analysis","comments":"39 pages including appendices. Updated defect calculations and\n  energy-dispersive X-ray spectroscopy data","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a series of recent reports, doped lead apatite (LK-99) has been proposed\nas a candidate ambient temperature and pressure superconductor. However, from\nboth an experimental and theoretical perspective, these claims are largely\nunsubstantiated. To this end, our synthesis and subsequent analysis of an LK-99\nsample reveals a multiphase material that does not exhibit high-temperature\nsuperconductivity. We study the structure of this phase with single-crystal\nX-ray diffraction (SXRD) and find a structure consistent with doped\n$\\text{Pb}_{10}(\\text{PO}_4)_6(\\text{OH})_2$. However, the material is\ntransparent which rules out a superconducting nature. From ab initio defect\nformation energy calculations, we find that the material likely hosts\n$\\text{OH}^-$ anions, rather than divalent $\\text{O}^{2-}$ anions, within the\nhexagonal channels and that Cu substitution is highly thermodynamically\ndisfavored. Phonon spectra on the equilibrium structures reveal numerous\nunstable phonon modes. Together, these calculations suggest it is doubtful that\nCu enters the structure in meaningful concentrations, despite initial attempts\nto model LK-99 in this way. However for the sake of completeness, we perform ab\ninitio calculations of the topology, quantum geometry, and Wannier function\nlocalization in the Cu-dominated flat bands of four separate doped structures.\nIn all cases, we find they are atomically localized by irreps, Wilson loops,\nand the Fubini-Study metric. It is unlikely that such bands can support strong\nsuperfluidity, and instead are susceptible to ferromagnetism (or out-of-plane\nantiferromagnetism) at low temperatures, which we find in ab initio studies. In\nsum, $\\text{Pb}_{9}\\text{Cu}(\\text{PO}_4)_6(\\text{OH})_2$ could more likely be\na magnet, rather than an ambient temperature and pressure superconductor.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:41:05 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 17:03:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jiang","Yi",""],["Lee","Scott B.",""],["Herzog-Arbeitman","Jonah",""],["Yu","Jiabin",""],["Feng","Xiaolong",""],["Hu","Haoyu",""],["C\u0103lug\u0103ru","Dumitru",""],["Brodale","Parker S.",""],["Gormley","Eoghan L.",""],["Vergniory","Maia Garcia",""],["Felser","Claudia",""],["Blanco-Canosa","S.",""],["Hendon","Christopher H.",""],["Schoop","Leslie M.",""],["Bernevig","B. Andrei",""]]}
{"id":"2308.05144","submitter":"Mario Lino da Silva","authors":"\\'Elio Pereira, Jorge Loureiro, and M\\'ario Lino da Silva","title":"Vibronic State-Specific Modelling of High-Speed Nitrogen Shocked Flows.\n  Part I: Kinetic Database","comments":"88 pages, 19 figures, 12 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A database of kinetic processes for nitrogen shocked flows was built using\nvibronic-specific state-to-state models. The Forced-Harmonic-Oscillator model\n(FHO), which is more physically accurate in the high temperature regime than\nthe popular Schwartz-Slawsky-Herzfeld model (SSH), was implemented in the\ncomputation of rate coefficients for vibrational transition and dissociation of\n$\\textrm{N}_2$ and $\\textrm{N}_2^+$ by heavy particle impact. Thermal\ndissociation rate coefficients of\n$\\textrm{N}_2(\\textrm{X}^1\\Sigma_\\textrm{g}^+)$ by collisions with\n$\\textrm{N}_2(\\textrm{X}^1\\Sigma_\\textrm{g}^+)$ and\n$\\textrm{N}(^4\\textrm{S}_\\textrm{u})$ were in their turn obtained, which were\nshown to agree reasonably well with state-of-the-art experimental values. The\npossibility of extending the well known Landau--Zener and Rosen--Zener--Demkov\nmodels (for heavy particle impact excitation of atomic particles) to heavy\nparticle impact vibronic excitation of diatomic particles was ascertained to be\nimpractical. As an alternative, an exponential gap law was considered. By\nfitting the curve that represents the law to experimentally obtained values for\nrate coefficients values of several vibronic transitions of $\\textrm{N}_2$\nreported in the literature, discrepancies of as much as one order of magnitude\nwere obtained, evidencing some crudeness of the model. Reactions such as\nionisation of $\\textrm{N}_2$ by electron impact, charge exchange and\ndissociative recombination of $\\textrm{N}_2^+$ were modeled using process cross\nsections or rate coefficients from the literature. A companion article\ndescribes the application of this model to nitrogen shocked flows.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 17:58:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pereira","\u00c9lio",""],["Loureiro","Jorge",""],["da Silva","M\u00e1rio Lino",""]]}
{"id":"2308.05145","submitter":"Tri Nguyen","authors":"Tri Nguyen, Chirag Modi, L. Y. Aaron Yung, Rachel S. Somerville","title":"FLORAH: A generative model for halo assembly histories","comments":"Submitted to MNRAS; 18 pages, 13 + 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":"  The mass assembly history (MAH) of dark matter halos plays a crucial role in\nshaping the formation and evolution of galaxies. MAHs are used extensively in\nsemi-analytic and empirical models of galaxy formation, yet current analytic\nmethods to generate them are inaccurate and unable to capture their\nrelationship with the halo internal structure and large-scale environment. This\npaper introduces FLORAH, a machine-learning framework for generating assembly\nhistories of ensembles of dark matter halos. We train FLORAH on the assembly\nhistories from the GUREFT and VSMDPL N-body simulations and demonstrate its\nability to recover key properties such as the time evolution of mass and\nconcentration. We obtain similar results for the galaxy stellar mass versus\nhalo mass relation and its residuals when we run the Santa Cruz semi-analytic\nmodel on FLORAH-generated assembly histories and halo formation histories\nextracted from an N-body simulation. We further show that FLORAH also\nreproduces the dependence of clustering on properties other than mass (assembly\nbias), which is not captured by other analytic methods. By combining multiple\nnetworks trained on a suite of simulations with different redshift ranges and\nmass resolutions, we are able to construct accurate main progenitor branches\n(MPBs) with a wide dynamic mass range from $z = 0$ up to an ultra-high redshift\n$z \\approx 20$, currently far beyond that of a single N-body simulation. FLORAH\nis the first step towards a machine learning-based framework for planting full\nmerger trees; this will enable the exploration of different galaxy formation\nscenarios with great computational efficiency at unprecedented accuracy.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nguyen","Tri",""],["Modi","Chirag",""],["Yung","L. Y. Aaron",""],["Somerville","Rachel S.",""]]}
{"id":"2308.05146","submitter":"Thomas Williams","authors":"Thomas G. Williams, Martin Bureau, Timothy A. Davis, Michele\n  Cappellari, Woorak Choi, Jacob S. Elford, Satoru Iguchi, Jindra Gensior,\n  Fu-Heng Liang, Anan Lu, Ilaria Ruffa, Hengyue Zhang","title":"WISDOM Project -- XVII. Beam-by-beam Properties of the Molecular Gas in\n  Early-type Galaxies","comments":"32 pages (16 of Appendices), 39 Figures (27 in Appendices). Accepted\n  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 present a study of the molecular gas of seven early-type galaxies with\nhigh angular resolution data obtained as part of the mm-Wave Interferometric\nSurvey of Dark Object Masses (WISDOM) project with the Atacama Large\nMillimeter/submillimeter Array. Using a fixed spatial scale approach, we study\nthe mass surface density ($\\Sigma$) and velocity dispersion ($\\sigma$) of the\nmolecular gas on spatial scales ranging from $60$ to $120$pc. Given the spatial\nresolution of our data ($20$ - $70$pc), we characterise these properties across\nmany thousands of individual sight lines ($\\approx50,000$ at our highest\nphysical resolution). The molecular gas along these sight lines has a large\nrange ($\\approx2$dex) of mass surface densities and velocity dispersions\n$\\approx40\\%$ higher than those of star-forming spiral galaxies. It has virial\nparameters $\\alpha_\\mathrm{vir}$ that depend weakly on the physical scale\nobserved, likely due to beam smearing of the bulk galactic rotation, and is\ngenerally super-virial. Comparing the internal turbulent pressure\n($P_\\mathrm{turb}$) to the pressure required for dynamic equilibrium\n($P_\\mathrm{DE}$), the ratio $P_\\mathrm{turb}$/$P_\\mathrm{DE}$ is significantly\nless than unity in all galaxies, indicating that the gas is not in dynamic\nequilibrium and is strongly compressed, in apparent contradiction to the virial\nparameters. This may be due to our neglect of shear and tidal forces, and/or\nthe combination of three-dimensional and vertical diagnostics. Both\n$\\alpha_\\mathrm{vir}$ and $P_\\mathrm{turb}$ anti-correlate with the global\nstar-formation rate of our galaxies. We therefore conclude that the molecular\ngas in early-type galaxies is likely unbound, and that large-scale dynamics\nlikely plays a critical role in its regulation. This contrasts to the giant\nmolecular clouds in the discs of late-type galaxies, that are much closer to\ndynamical equilibrium.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Williams","Thomas G.",""],["Bureau","Martin",""],["Davis","Timothy A.",""],["Cappellari","Michele",""],["Choi","Woorak",""],["Elford","Jacob S.",""],["Iguchi","Satoru",""],["Gensior","Jindra",""],["Liang","Fu-Heng",""],["Lu","Anan",""],["Ruffa","Ilaria",""],["Zhang","Hengyue",""]]}
{"id":"2308.05147","submitter":"Yuber F. Perez-Gonzalez","authors":"Yuber F. Perez-Gonzalez, Manibrata Sen","title":"From Dirac to Majorana: the Cosmic Neutrino Background capture rate in\n  the minimally extended Standard Model","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the capture rate of the cosmic neutrino background on tritium\nwithin the Standard Model, extended to incorporate three right-handed singlet\nneutrinos with explicit lepton-number violation. We consider a scenario where\nthe $6 \\times 6$ neutrino mixing matrix factorizes into three independent $2\n\\times 2$ pairs and analyze the states produced from weak interactions just\nbefore neutrino decoupling. Taking into account the unrestricted Majorana mass\nscale associated with lepton number violation, spanning from the Grand\nUnification scale to Planck-suppressed values, we observe a gradual transition\nin the capture rate from a purely Majorana neutrino to a purely (pseudo) Dirac\nneutrino. We demonstrate that the capture rate is modified if the lightest\nactive neutrino is relativistic, and this can be used to constrain the tiniest\nvalue of mass-squared difference $\\sim 10^{-35}\\,{\\rm eV}^2$, between the\nactive-sterile pair, probed so far. Consequently, the cosmic neutrino capture\nrate could become a promising probe for discerning the underlying mechanism\nresponsible for generating neutrino masses.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Perez-Gonzalez","Yuber F.",""],["Sen","Manibrata",""]]}
{"id":"2308.05148","submitter":"Rahul Jayaraman","authors":"Rahul Jayaraman, Michael Fausnaugh, George R. Ricker, and Roland\n  Vanderspek (MIT)","title":"Gamma-Ray Bursts Observed by the Transiting Exoplanet Survey Satellite:\n  Prompt Optical Counterparts and Afterglows of Swift-XRT Localized GRBs","comments":"20 pages, 8 figures, 3 tables, to be submitted to AAS Journals","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Throughout the past three decades, only a few tens of observations have been\nmade of optical flashes contemporaneous with gamma-ray bursts (GRBs), despite\nthe thousands of GRBs that have been detected during that same timeframe. In\nthis work, we present light curves from the Transiting Exoplanet Survey\nSatellite (TESS) for a sample of 7 GRBs that were localized to within 10\" by\nthe Swift X-ray Telescope. For each burst, we characterize both the prompt\nemission, if it exists, and the afterglow, and conduct searches for late-time\nemission from a supernova or kilonova component. We also constrain the physical\nparameters of the burst based on the TESS light curve, and present a novel\nmethod to account for the effects of TESS's cosmic ray mitigation strategy on\nthe observed flux from these GRBs. This allows us to establish upper limits on\nthe true magnitude of any GRB-associated optical flash. Finally, we discuss how\nTESS's continuous monitoring and new weekly downlink schedule are proving\ninvaluable in the rapid follow-up and characterization of short-duration\ntransients, including GRBs; these could potentially enable TESS to detect\nelectromagnetic counterparts to gravitational-wave events.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jayaraman","Rahul","","MIT"],["Fausnaugh","Michael","","MIT"],["Ricker","George R.","","MIT"],["Vanderspek","Roland","","MIT"]]}
{"id":"2308.05149","submitter":"Nicholas Borsato","authors":"N. W. Borsato, H. J. Hoeijmakers, D. Cont, D. Kitzmann, J. Ehrhardt,\n  C. G\\\"ossl, C. Ries, B. Prinoth, K. Molaverdikhani, B. Ercolano, H.\n  Kellerman, Kevin Heng","title":"Small but mighty: High-resolution spectroscopy of ultra-hot Jupiter\n  atmospheres with compact telescopes. KELT-9 b's transmission spectrum with\n  Wendelstein's FOCES Spectrograph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When observing transmission spectra produced by atmospheres of ultra-hot\nJupiters, large telescopes are typically the instrument of choice due to the\nvery weak signal of the planet's atmosphere. This study aims to alleviate the\ndesire for large telescopes by illustrating that the same science is possible\nwith smaller telescope classes. We use the cross-correlation technique to\nshowcase the potential of the high-resolution spectrograph FOCES at Wendelstein\nObservatory and demonstrate its potential to resolve the atmosphere of the\nultra-hot Jupiter, KELT-9 b. A performance comparison is conducted between\nFOCES and HARPS-N spectrographs, considering both single transit and combined\nobservations over three nights. With FOCES, we have detected seven species in\nKELT-9 b's atmosphere: Ti II, Fe I, Fe II, Na I, Mg I, Na II, Cr II, Sc II.\nAlthough HARPS-N surpasses FOCES in performance, our results reveal that\nsmaller telescope classes are capable of resolving ultra-hot Jupiter\natmospheres. This broadens the scope of potential studies, allowing for\ninvestigations into phenomena like temporal variations in atmospheric signals\nand the atmospheric loss characteristics of these close-in planets.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Borsato","N. W.",""],["Hoeijmakers","H. J.",""],["Cont","D.",""],["Kitzmann","D.",""],["Ehrhardt","J.",""],["G\u00f6ssl","C.",""],["Ries","C.",""],["Prinoth","B.",""],["Molaverdikhani","K.",""],["Ercolano","B.",""],["Kellerman","H.",""],["Heng","Kevin",""]]}
{"id":"2308.05150","submitter":"Amir Dalal","authors":"Amir Dalal, Jonathan Ruhman, Vladyslav Kozii","title":"The field theory of a superconductor with repulsion","comments":"23 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A superconductor emerges as a condensate of electron pairs, which bind\ndespite their strong Coulomb repulsion. Eliashberg's theory elucidates the\nmechanisms enabling them to overcome this repulsion and predicts the transition\ntemperature and pairing correlations. However, a comprehensive understanding of\nhow repulsion impacts the phenomenology of the resulting superconductor remains\nelusive. We present a formalism that addresses this challenge by applying the\nHubbard-Stratonovich transformation to an interaction including instantaneous\nrepulsion and retarded attraction. We first decompose the interaction into\nfrequency scattering channels and then integrate out the fermions. The\nresulting bosonic action is complex and the saddle point corresponding to\nEliashberg's equations generally extends into the complex plane and away from\nthe physical axis. We numerically determine this saddle point using the\ngradient descent method, which is particularly well-suited for the case of\nstrong repulsion. We then turn to consider fluctuations around this complex\nsaddle point. The matrix controlling fluctuations about the saddle point is\nfound to be a non-Hermitian symmetric matrix, which generally suffers from\nexceptional points that are tuned by different parameters. These exceptional\npoints may influence the thermodynamics of the superconductor. For example,\nwithin the quadratic approximation the upper critical field sharply peaks at a\ncritical value of the repulsion strength related to an exceptional point\nappearing at $T_c$. Our work facilitates the mapping between microscopic and\nphenomenological theories of superconductivity, particularly in the presence of\nstrong repulsion. It has the potential to enhance the accuracy of theoretical\npredictions for experiments in systems where the pairing mechanism is unknown.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:01 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 18:21:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dalal","Amir",""],["Ruhman","Jonathan",""],["Kozii","Vladyslav",""]]}
{"id":"2308.05151","submitter":"Sahand Seifnashri","authors":"Sahand Seifnashri","title":"Lieb-Schultz-Mattis anomalies as obstructions to gauging (non-on-site)\n  symmetries","comments":"76 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el hep-lat hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study 't Hooft anomalies of global symmetries in 1+1d lattice Hamiltonian\nsystems. We consider anomalies in internal and lattice translation symmetries.\nWe derive a microscopic formula for the \"anomaly cocycle\" using topological\ndefects implementing twisted boundary conditions. The anomaly takes value in\nthe cohomology group $H^3(G,U(1)) \\times H^2(G,U(1))$. The first factor\ncaptures the anomaly in the internal symmetry group $G$, and the second factor\ncorresponds to a generalized Lieb-Schultz-Mattis anomaly involving $G$ and\nlattice translation. We present a systematic procedure to gauge internal\nsymmetries (that may not act on-site) on the lattice. We show that the anomaly\ncocycle is the obstruction to gauging the internal symmetry while preserving\nthe lattice translation symmetry. As an application, we construct anomaly-free\nchiral lattice gauge theories. We demonstrate a one-to-one correspondence\nbetween (locality-preserving) symmetry operators and topological defects, which\nis essential for the results we prove. We also discuss the generalization to\nfermionic theories. Finally, we construct non-invertible lattice translation\nsymmetries by gauging internal symmetries with a Lieb-Schultz-Mattis anomaly.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Seifnashri","Sahand",""]]}
{"id":"2308.05152","submitter":"ChunJun Cao","authors":"ChunJun Cao, Michael J. Gullans, Brad Lackey, Zitao Wang","title":"Quantum Lego Expansion Pack: Enumerators from Tensor Networks","comments":"47 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide the first tensor network method for computing quantum weight\nenumerator polynomials in the most general form. As a corollary, if a quantum\ncode has a known tensor network construction of its encoding map, our method\nproduces an algorithm that computes its distance. For non-(Pauli)-stabilizer\ncodes, this constitutes the current best algorithm for computing the code\ndistance. For degenerate stabilizer codes, it can provide up to an exponential\nspeed up compared to the current methods. We also introduce a few novel\napplications of different weight enumerators. In particular, for any code built\nfrom the quantum lego method, we use enumerators to construct its (optimal)\ndecoders under any i.i.d. single qubit or qudit error channels and discuss\ntheir applications for computing logical error rates. As a proof of principle,\nwe perform exact analyses of the deformed surface codes, the holographic\npentagon code, and the 2d Bacon-Shor code under (biased) Pauli noise and\nlimited instances of coherent error at sizes that are inaccessible by brute\nforce.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cao","ChunJun",""],["Gullans","Michael J.",""],["Lackey","Brad",""],["Wang","Zitao",""]]}
{"id":"2308.05153","submitter":"Benjamin Pottie","authors":"Ben Pottie, Luigi Gallo, Adam Gonzalez, Jon Miller","title":"A Colourful Analysis: Probing the Eclipse of the Black Hole and Central\n  Engine in NGC 6814 Using X-ray Colour-Colour Grids","comments":"12 pages, 8 figures, accepted for publication in MNRAS, Animation for\n  Figure 2 available at\n  http://www.ap.smu.ca/~lgallo/Luigi_C._Gallo/N6814/NGC6814_Subplot_FullLoop.gif","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Eclipsing of the X-ray emitting region in active galactic nuclei (AGN) is a\npotentially powerful probe to examine the AGN environment and absorber\nproperties. Here we study the eclipse data from the 2016 XMM-Newton observation\nof NGC 6814 using a colour-colour analysis. Colours (i.e. hardness ratios) can\nprovide the advantage of better time-resolution over spectral analysis alone.\nColour-colour grids are constructed to examine the effects of different\nparameters on the observed spectral variability during the eclipse. Consistent\nwith previous spectral analysis, the variations are dominated by changes in the\ncolumn density and covering fraction of the absorber. However, during maximum\neclipse the behaviour of the absorber changes. Just after ingress, the eclipse\nis described by changes in column density and covering fraction, but prior to\negress, the variations are dominated by changes in column density alone.\nSimulations are carried out to consider possible absorber geometries that might\nproduce this behaviour. The behaviour is inconsistent with a single,\nhomogeneous cloud, but simulations suggest that multiple clouds, perhaps\nembedded in a highly ionised halo, could reproduce the results. In addition, we\ndetermine the orbital covering factor (fraction of orbital path-length) based\non evidence of several eclipses in the 2016, 64-day Swift light curve. We\nestimate that ~ 2-4 per cent of the orbit is covered by obscuring clouds and\nthat the distribution of clouds is not isotropic.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pottie","Ben",""],["Gallo","Luigi",""],["Gonzalez","Adam",""],["Miller","Jon",""]]}
{"id":"2308.05154","submitter":"G\\'abor Hal\\'asz","authors":"G\\'abor B. Hal\\'asz","title":"Gate-controlled anyon generation and detection in Kitaev spin liquids","comments":"6+2 pages, 2+2 figures","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":"  Reliable manipulation of non-Abelian Ising anyons supported by Kitaev spin\nliquids may enable intrinsically fault-tolerant quantum computation. Here, we\nintroduce a standalone scheme for both generating and detecting individual\nIsing anyons using tunable gate voltages in a heterostructure containing a\nnon-Abelian Kitaev spin liquid and a monolayer semiconductor. The key\ningredients of our setup are a Kondo coupling to stabilize an Ising anyon in\nthe spin liquid around each electron in the semiconductor, and a large charging\nenergy to allow control over the electron numbers in distinct gate-defined\nregions of the semiconductor. In particular, a single Ising anyon can be\ngenerated at a disk-shaped region by gate tuning its electron number to one,\nwhile it can be interferometrically detected by measuring the electrical\nconductance of a ring-shaped region around it whose electron number is allowed\nto fluctuate between zero and one. We provide concrete experimental guidelines\nfor implementing our proposal in promising candidate materials like\n$\\alpha$-RuCl$_3$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hal\u00e1sz","G\u00e1bor B.",""]]}
{"id":"2308.05155","submitter":"Chao-Jung Lee","authors":"Chao-Jung Lee, Michael Mulligan","title":"Universal conductivity at a 2d superconductor-insulator transition: the\n  effects of quenched disorder and Coulomb interaction","comments":"16 pages + three appendices, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.dis-nn cond-mat.supr-con hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculate the zero-temperature universal electrical conductivity at a\nsuperconductor-insulator transition in two spatial dimensions. We focus on\ntransitions in the universality class of the dirty 3d XY model. We use a dual\nmodel consisting of a single Dirac fermion at zero density coupled to a\nChern-Simons gauge field in the presence of a quenched random mass, with or\nwithout an unscreened Coulomb interaction. Our calculation is performed in a\n$1/N_f$ expansion, where $N_f$ is the number of Dirac fermions. At zeroth\norder, the model exhibits particle-vortex self-dual electrical transport with\n$\\sigma_{xx} \\lesssim (2e)^2/h$ and small, but finite $\\sigma_{xy}$.\nCorrections of $\\mathcal{O}(1/N_f)$ due to fluctuations in the Chern-Simons\ngauge field and disorder produce violations of self-duality. We find these\nviolations to be milder when the Coulomb interaction is present.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lee","Chao-Jung",""],["Mulligan","Michael",""]]}
{"id":"2308.05156","submitter":"David Nidever","authors":"David L. Nidever","title":"Discovery of a Split Stellar Stream In the Periphery of the Small\n  Magellanic Cloud","comments":"8 pages, 10 figures, 1 table. Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I report the discovery of a stellar stream (Sutlej) using Gaia DR3 proper\nmotions and XP metallicities located ~15 degrees north of the Small Magellanic\nCloud (SMC). The stream is composed of two parallel linear components\n(\"branches\") approximately ~8 x 0.6 degrees in size and separated by 2.5\ndegrees. The stars have a mean proper motion of (pmra,pmdec)=(+0.08\nmas/yr,-1.41 mas/yr) which is quite similar to the proper motion of stars on\nthe western side of the SMC. The color magnitude diagram of the stream stars\nhas a clear red giant branch, horizontal branch, and main sequence turnoff that\nis well-matched by a PARSEC isochrone of 10 Gyr, [Fe/H]=-1.8 at 32 kpc and a\ntotal stellar mass of ~33,000 Msun. The stream is spread out over an area of\n9.6 square degrees and has a surface brightness of 32.5 mag/arcsec^2. The\nmetallicity of the stream stars from Gaia XP spectra extend over -2.5 < [M/H] <\n-1.0 with a median of [M/H]=-1.8. The tangential velocity of the stream stars\nis 214 km/s compared to the values of 448 km/s for the Large Magellanic Cloud\nand 428 km/s for the SMC. While the radial velocity of the stream is not yet\nknown, a comparison of the space velocities using a range of assumed radial\nvelocities, shows that the stream is unlikely to be associated with the\nMagellanic Clouds. The tangential velocity vector is misaligned with the stream\nby ~25 degrees which might indicate an important gravitational influence from\nthe nearby Magellanic Clouds.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nidever","David L.",""]]}
{"id":"2308.05157","submitter":"Bohdan Bidenko","authors":"Bohdan Bidenko, L\\'eon V. E. Koopmans, P. Daniel Meerburg","title":"No evidence for missing covariance in the Pantheon+ SuperNova sample\n  distance moduli","comments":"16 pages, 6 figures, prepared for submission to JCAP","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inspired by the discussion in the community on possible hidden systematic\nerrors in late universe cosmological probes and non-trivial physical models\ndeveloped to reduce the Hubble tension, we investigate the Pantheon and\nPantheon+ SNe samples for possible deviations from the original $\\Lambda$CDM\nanalysis. To simultaneously account for possible systematics or deviations from\n$\\Lambda$CDM, we adopt Gaussian processes to model additional covariance while\nmaking no further assumptions on their origin. We explore both stationary and\nnon-stationarity corrections to the covariance. While small changes in the\ninferred cosmological parameters $H_0$ and $\\Omega_{m}$ can occur, we find no\nstatistically significant evidence for missing covariance. We find an upper\nlimit for the Gaussian processes amplitude $\\sigma < 0.031$ mag with $95\\%$\nconfidence, which corresponds to $20\\%$ of the average statistical error in the\nPantheon+ sample. The strongest effect we find on the inferred cosmological\nparameter posterior can reduce the statistical significance of the Hubble\ntension between Pantheon+ and Planck estimates from 5.3$\\sigma$ to 4.5$\\sigma$.\nTherefore, we conclude that the SN cosmological parameter inference is robust\nagainst the analysis modifications studied in this work.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bidenko","Bohdan",""],["Koopmans","L\u00e9on V. E.",""],["Meerburg","P. Daniel",""]]}
{"id":"2308.05158","submitter":"Panyu Hou","authors":"Pan-Yu Hou, Jenny J. Wu, Stephen D. Erickson, Giorgio Zarantonello,\n  Adam D. Brandt, Daniel C. Cole, Andrew C. Wilson, Daniel H. Slichter,\n  Dietrich Leibfried","title":"Indirect Cooling of Weakly Coupled Trapped-Ion Mechanical Oscillators","comments":"16 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cooling the motion of trapped ions to near the quantum ground state is\ncrucial for many applications in quantum information processing and quantum\nmetrology. However, certain motional modes of trapped-ion crystals can be\ndifficult to cool due to weak or zero interaction between the modes and the\ncooling radiation, typically laser beams. We overcome this challenge by\ncoupling a mode with weak cooling radiation interaction to one with strong\ncooling radiation interaction using parametric modulation of the trapping\npotential, thereby enabling indirect cooling of the former. In this way, we\ndemonstrate near-ground-state cooling of motional modes with weak or zero\ncooling radiation interaction in multi-ion crystals of the same and mixed ion\nspecies, specifically $^9$Be$^+$-$^9$Be$^+$, $^9$Be$^+$-$^{25}$Mg$^+$, and\n$^9$Be$^+$-$^{25}$Mg$^+$-$^9$Be$^+$ crystals. This approach can be generally\napplied to any Coulomb crystal where certain motional modes cannot be directly\ncooled efficiently, including crystals containing molecular ions,\nhighly-charged ions, charged fundamental particles, or charged macroscopic\nobjects.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:00:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hou","Pan-Yu",""],["Wu","Jenny J.",""],["Erickson","Stephen D.",""],["Zarantonello","Giorgio",""],["Brandt","Adam D.",""],["Cole","Daniel C.",""],["Wilson","Andrew C.",""],["Slichter","Daniel H.",""],["Leibfried","Dietrich",""]]}
{"id":"2308.05159","submitter":"S. N Sajadi","authors":"S. N. Sajadi, H. R. Safari","title":"Strongly-Coupled Anisotropic Gauge Theories and Holography in 5D\n  Einstien-Gauss-Bonnet Gravity","comments":"20 pages, 9 figures, Accepted for publication in EPJC","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study uncharged, non-conformal, and anisotropic systems\nwith strong interactions using the gauge-gravity duality by considering\nEinstein-Quadratic-Axion-Dilaton action in five dimensions. In fact, we would\nlike to gain insight into the influence of higher derivative gravity on the QCD\nsystem. At finite temperature, we obtain an anisotropic black brane solution to\na 5D Einstein-Gauss-Bonnet-Axion-Dilaton system. The system has been\ninvestigated and the effect of the parameter of theory has been considered. The\nblackening function supports the thermodynamical phase transition between\nsmall/large and AdS/large black brane for suitable parameters. We also study\ntransport and diffusion properties and observe in particular that the butterfly\nvelocity that characterizes both diffusion and growth of chaos transverse to\nthe anisotropic direction saturates a constant value in the IR which can exceed\nthe bound given by the conformal value. We also determine the imaginary part of\nthe heavy quark potential in a strongly coupled plasma dual to Gauss-Bonnet\ngravity.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:02:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sajadi","S. N.",""],["Safari","H. R.",""]]}
{"id":"2308.05160","submitter":"Luka Medic","authors":"Luka Medic, Anton Ram\\v{s}ak, Toma\\v{z} Prosen","title":"Extending third quantization with commuting observables: a dissipative\n  spin-boson model","comments":"10 pages, 3 figures, submitted to J. Phys. A","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 consider the spectral and initial value problem for the\nLindblad-Gorini-Kossakowski-Sudarshan master equation describing an open\nquantum system of bosons and spins, where the bosonic parts of the Hamiltonian\nand Lindblad jump operators are quadratic and linear respectively, while the\nspins couple to bosons via mutually commuting spin operators. Needless to say,\nthe spin degrees of freedom can be replaced by any set of finite-level quantum\nsystems. A simple, yet non-trivial example of a single open spin-boson model is\nworked out in some detail.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:02:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Medic","Luka",""],["Ram\u0161ak","Anton",""],["Prosen","Toma\u017e",""]]}
{"id":"2308.05161","submitter":"Odelia Teboul","authors":"Odelia Teboul and Brian D. Metzger","title":"A Unified Theory of Jetted Tidal Disruption Events: From Promptly\n  Escaping Relativistic to Delayed Transrelativistic Jets","comments":"17 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Only a tiny fraction ~ 1% of stellar tidal disruption events (TDE) generate\npowerful relativistic jets evidenced by luminous hard X-ray and radio\nemissions. We propose that a key property responsible for both this\nsurprisingly low rate and a variety of other observations is the typically\nlarge misalignment {\\psi} between the orbital plane of the star and the spin\naxis of the supermassive black hole (SMBH). Such misaligned disk/jet systems\nundergo Lense-Thirring precession together about the SMBH spin axis. We find\nthat TDE disks precess sufficiently rapidly that winds from the accretion disk\nwill encase the system on large scales in a quasi-spherical outflow. We derive\nthe critical jet efficiency {\\eta} > {\\eta}crit for both aligned and misaligned\nprecessing jets to successfully escape from the disk-wind ejecta. As {\\eta}crit\nis higher for precessing jets, less powerful jets only escape after alignment\nwith the SMBH spin. Alignment can occur through magneto-spin or hydrodynamic\nmechanisms, which we estimate occur on typical timescales of weeks and years,\nrespectively. The dominant mechanism depends on {\\eta} and the orbital\npenetration factor \\b{eta}. Hence depending only on intrinsic parameters of the\nevent {{\\psi},{\\eta},\\b{eta}}, we propose that each TDE jet can either escape\nprior to alignment, thus exhibiting erratic X-ray light curve and two-component\nradio afterglow (e.g., Swift J1644+57) or escape after alignment. Relatively\nrapid magneto-spin alignments produce relativistic jets exhibiting X-ray\npower-law decay and bright afterglows (e.g., AT2022cmc), while long\nhydrodynamic alignments give rise to late jet escape and delayed radio flares\n(e.g., AT2018hyz).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:05:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Teboul","Odelia",""],["Metzger","Brian D.",""]]}
{"id":"2308.05162","submitter":"Prajeet Bajpai","authors":"Prajeet Bajpai and Michael A. Bennett","title":"Effective $S$-unit Equations Beyond 3 Terms : Newman's Conjecture","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 how to effectively solve 5-term $S$-unit equations when the set of\nprimes $S$ has cardinality at most 3, and use this to provide an explicit\nanswer to an old question of D.J. Newman on representations of integers as sums\nof $S$-units.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:08:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bajpai","Prajeet",""],["Bennett","Michael A.",""]]}
{"id":"2308.05163","submitter":"Akram Ibrahim","authors":"Akram Ibrahim, Daniel Wines, and Can Ataca","title":"Neural network potentials for modeling nonstoichiometric materials: a\n  case of Chromium Sulfides Cr$_{(1-x)}$S","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.dis-nn physics.app-ph physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deviation from stoichiometry can yield a diverse range of stable phases with\ndistinct physical and chemical properties. To comprehensively explore\nnonstoichiometric materials, it is crucial to investigate their compositional\nand structural domains with precision and cost-effectiveness. However, the\nextensive diversity in these domains render first-principles methods, such as\ndensity functional theory (DFT), inappropriate for such endeavors. In this\nstudy, we propose a generic framework that utilizes neural network potentials\n(NNPs) to model nonstoichiometric materials with chemical accuracy at realistic\nlength and time scales. We apply our framework to analyze nonstoichiometric\nCr$_{(1-x)}$S materials, a compelling material category with significant\npotential in the field of two-dimensional (2D) magnetic materials applications.\nThe efficacy of the NNP model is shown to outperform the conventional cluster\nexpansion (CE) model, exhibiting near-DFT accuracy and robust transferability\nto unexplored crystal structures and compositions. Furthermore, we employ the\nNNP model in simulated annealing (SA) optimizations to predict the low-energy\nCr$_{(1-x)}$S structures across diverse compositions. A notable structural\ntransition is discerned at the Cr$_{0.5}$S composition, characterized by a\npreferential migration of half of the Cr atoms to the van der Waals (vdW) gaps.\nThis highlights the experimentally observed non-vdW nature of CrS$_2$ and\nemphasizes the pivotal role of excess Cr atoms beyond the composition ratio of\nCr/S = $1/2$ in stabilizing the vdW gaps. Additionally, we employ the NNP model\nin a large-scale vacancy diffusion Monte Carlo (MC) simulation to emphasize the\nimpact of lateral compressive strains in catalyzing the formation of vdW gaps\nwithin 2D CrS$_2$ slabs. This provides a direct pathway for more facile\nexfoliation of ultrathin CrS$_2$ nanosheets through strain engineering.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:08:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ibrahim","Akram",""],["Wines","Daniel",""],["Ataca","Can",""]]}
{"id":"2308.05164","submitter":"Mario Lino da Silva","authors":"\\'Elio Pereira, Jorge Loureiro, and M\\'ario Lino da Silva","title":"Vibronic State-Specific Modelling of High-Speed Nitrogen Shocked Flows.\n  Part II: Shock Tube Simulations","comments":"62 pages, 37 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.chem-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The conditions of thermochemical and radiative non-equilibrium attained in\nnitrogen shocked flows were quantified using a vibronic state-specific model.\nThis model, being described in a companion paper, was implemented in Euler\none-dimensional simulations for shots $19$, $20$ and $40$ of the EAST's\n$62^{\\textrm{th}}$ campaign. It was found that the peak values of the\ninstrumental radiative intensities were underestimated by one to two orders of\nmagnitude, and sensitivity tests performed on several parameters of the\nsimulations were not successful in getting a reasonable agreement. The shapes\nof the instrumental radiative intensities' profiles obtained in the low speed\nshot were correctly predicted, unlike the ones of the medium and high speed\nshots which revealed non-null plateaus proceeding or coalescing with peaks.\nThese plateaus were not predicted at all. It is suspected that such\ndiscrepancies may have resulted from neglecting other shock tube related\nphenomena, as pointed out by other researchers in the literature: the\nabsorption of radiation emitted by the driver gas and the EAST electric arc,\nand/or the conduction of heat due to downstream plasma being subjected to a\nstronger shock wave.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:09:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pereira","\u00c9lio",""],["Loureiro","Jorge",""],["da Silva","M\u00e1rio Lino",""]]}
{"id":"2308.05165","submitter":"Rodrigo Holanda","authors":"Z. C. Santana, R. F. L. Holanda, R. Silva","title":"Non-Parametric Analysis for the Dark Matter Density Evolution","comments":"8 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate a potential departure in the standard dark\nmatter density evolution law, $\\rho_{dm} = \\rho_{dm,0}(1+z)^3$. The method\ninvolves considering a deformed evolution model, denoted as $\\rho_{dm} =\n\\rho_{dm,0}(1+z)^3f(z)$, and searching the presence of any deviation ($f(z)\\neq\n1$). As one may see, $f(z)$ is a general function that parametrizes a\ndigression from the standard law. We use data of baryon acoustic oscillations,\ntype I Supernovae luminosity distances, and galaxy cluster gas mass fraction\nobservations to reconstruct $f(z)$ by Gaussian process regression. Unlike\nprevious works, it enables us to investigate a possible deviation without using\na specific function to describe it. We have obtained $f(z)=1$, the standard\nmodel scenario, within $2\\sigma$ c.l. in all the considered cases.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:09:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Santana","Z. C.",""],["Holanda","R. F. L.",""],["Silva","R.",""]]}
{"id":"2308.05166","submitter":"Nikhel Gupta","authors":"Nikhel Gupta, Zeeshan Hayder, Ray P. Norris, Minh Huynh, Lars\n  Petersson, X. Rosalind Wang, Heinz Andernach, B\\\"arbel S. Koribalski, Miranda\n  Yew, and Evan J. Crawford","title":"Deep Learning for Morphological Identification of Extended Radio\n  Galaxies using Weak Labels","comments":"14 pages, 6 figues, accepted for publication in PASA","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO astro-ph.GA cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The present work discusses the use of a weakly-supervised deep learning\nalgorithm that reduces the cost of labelling pixel-level masks for complex\nradio galaxies with multiple components. The algorithm is trained on weak\nclass-level labels of radio galaxies to get class activation maps (CAMs). The\nCAMs are further refined using an inter-pixel relations network (IRNet) to get\ninstance segmentation masks over radio galaxies and the positions of their\ninfrared hosts. We use data from the Australian Square Kilometre Array\nPathfinder (ASKAP) telescope, specifically the Evolutionary Map of the Universe\n(EMU) Pilot Survey, which covered a sky area of 270 square degrees with an RMS\nsensitivity of 25-35 $\\mu$Jy/beam. We demonstrate that weakly-supervised deep\nlearning algorithms can achieve high accuracy in predicting pixel-level\ninformation, including masks for the extended radio emission encapsulating all\ngalaxy components and the positions of the infrared host galaxies. We evaluate\nthe performance of our method using mean Average Precision (mAP) across\nmultiple classes at a standard intersection over union (IoU) threshold of 0.5.\nWe show that the model achieves a mAP$_{50}$ of 67.5\\% and 76.8\\% for radio\nmasks and infrared host positions, respectively. The network architecture can\nbe found at the following link: https://github.com/Nikhel1/Gal-CAM\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:10:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gupta","Nikhel",""],["Hayder","Zeeshan",""],["Norris","Ray P.",""],["Huynh","Minh",""],["Petersson","Lars",""],["Wang","X. Rosalind",""],["Andernach","Heinz",""],["Koribalski","B\u00e4rbel S.",""],["Yew","Miranda",""],["Crawford","Evan J.",""]]}
{"id":"2308.05167","submitter":"Bao-Xuan Zhu","authors":"Yu-Jie Cui, Bao-Xuan Zhu","title":"Total positivity from a kind of lattice paths","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Total positivity of matrices is deeply studied and plays an important role in\nvarious branches of mathematics. The main purpose of this paper is to study\ntotal positivity of a matrix $M=[M_{n,k}]_{n,k}$ generated by the weighted\nlattice paths in $\\mathbb{N}^2$ from the origin $(0,0)$ to the point $(k,n)$\nconsisting of types of steps: $(0,1)$ and $(1,t+i)$ for $0\\leq i\\leq \\ell$,\nwhere each step $(0,1)$ from height~$n-1$ gets the weight~$b_n(\\textbf{y})$ and\neach step $(1,t+i)$ from height~$n-t-i$ gets the weight\n$a_n^{(i)}(\\textbf{x})$.\n  Using an algebraic method, we prove that the $\\textbf{x}$-total positivity of\nthe weight matrix $[a_i^{(i-j)}(\\textbf{x})]_{i,j}$ implies that of $M$.\nFurthermore, using the Lindstr\\\"{o}m-Gessel-Viennot lemma, we obtain that both\n$M$ and the Toeplitz matrix of each row sequence of $M$ with $t\\geq1$ are\n$\\textbf{x}$-totally positive under the following three cases respectively: (1)\n$\\ell=1$, (2) $\\ell=2$ and restrictions for $a_n^{(i)}$, (3) general $\\ell$ and\nboth $a^{(i)}_n$ and $b_n$ are independent of $n$. In addition, for the case\n(3), we show that the matrix $M$ is a Riordan array, present its explicit\nformula and prove total positivity of the Toeplitz matrix of the each column of\n$M$. In particular, from the results for Toeplitz-total positivity, we also\nobtain the P\\'olya frequency and log-concavity of the corresponding sequence.\n  Finally, as applications, we in a unified manner establish total positivity\nand the Toeplitz-total positivity for many well-known combinatorial triangles,\nincluding the Pascal triangle, the Pascal square, the Delannoy triangle, the\nDelannoy square, the signless Stirling triangle of the first kind, the\nLegendre-Stirling triangle of the first kind, the Jacobi-Stirling triangle of\nthe first kind, the Brenti's recursive matrix, and so on.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:11:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cui","Yu-Jie",""],["Zhu","Bao-Xuan",""]]}
{"id":"2308.05168","submitter":"Yukai Guo","authors":"Changjian Chen, Yukai Guo, Fengyuan Tian, Shilong Liu, Weikai Yang,\n  Zhaowei Wang, Jing Wu, Hang Su, Hanspeter Pfister, Shixia Liu","title":"A Unified Interactive Model Evaluation for Classification, Object\n  Detection, and Instance Segmentation in Computer Vision","comments":"Accepted to IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing model evaluation tools mainly focus on evaluating classification\nmodels, leaving a gap in evaluating more complex models, such as object\ndetection. In this paper, we develop an open-source visual analysis tool,\nUni-Evaluator, to support a unified model evaluation for classification, object\ndetection, and instance segmentation in computer vision. The key idea behind\nour method is to formulate both discrete and continuous predictions in\ndifferent tasks as unified probability distributions. Based on these\ndistributions, we develop 1) a matrix-based visualization to provide an\noverview of model performance; 2) a table visualization to identify the\nproblematic data subsets where the model performs poorly; 3) a grid\nvisualization to display the samples of interest. These visualizations work\ntogether to facilitate the model evaluation from a global overview to\nindividual samples. Two case studies demonstrate the effectiveness of\nUni-Evaluator in evaluating model performance and making informed improvements.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:11:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Changjian",""],["Guo","Yukai",""],["Tian","Fengyuan",""],["Liu","Shilong",""],["Yang","Weikai",""],["Wang","Zhaowei",""],["Wu","Jing",""],["Su","Hang",""],["Pfister","Hanspeter",""],["Liu","Shixia",""]]}
{"id":"2308.05169","submitter":"Daniel Miravet","authors":"Daniel Miravet and Abdulmenaf Alt{\\i}nta\\c{s} and Alina Wania\n  Rodrigues and Maciej Bieniek and Marek Korkusinski and Pawe{\\l} Hawrylak","title":"Interacting holes in gated WSe$_2$ quantum dots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop here a theory of the electronic properties of a finite number of\nvalence holes in gated WSe$_2$ quantum dots, considering the influence of spin,\nvalley, electronic orbitals, and many-body interactions. The single-particle\nwave functions are constructed by combining the spin-up and down states of the\nhighest valence bulk bands employing a multi-million atom ab-initio based\ntight-binding model solved in the wave-vector space, allowing to study up to\n100 nm radius quantum dots atomistically. The effects of the many-body\ninteractions are determined using the configuration interaction (CI) technique,\napplied up to $N = 6$ holes occupying up to 6 electronic shells with 42\norbitals. Our results show that N=2 holes are in valley and spin\nanti-ferromagnetic ground state, independent of the interaction strength and\nthe quantum dot size. However, we predict that higher number of holes can\nundergo a transition to spontaneously broken symmetry valley and spin polarized\nferromagnetic phases, highlighting the interplay between the many-body effects\nand the quantum dot lateral size and confining potential depth.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:12:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Miravet","Daniel",""],["Alt\u0131nta\u015f","Abdulmenaf",""],["Rodrigues","Alina Wania",""],["Bieniek","Maciej",""],["Korkusinski","Marek",""],["Hawrylak","Pawe\u0142",""]]}
{"id":"2308.05170","submitter":"Benjamin Ramhorst","authors":"Benjamin Ramhorst (Imperial College London), George A. Constantinides\n  (Imperial College London), Vladimir Loncar (Massachusetts Institute of\n  Technology)","title":"FPGA Resource-aware Structured Pruning for Real-Time Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural networks achieve state-of-the-art performance in image classification,\nspeech recognition, scientific analysis and many more application areas. With\nthe ever-increasing need for faster computation and lower power consumption,\ndriven by real-time systems and Internet-of-Things (IoT) devices, FPGAs have\nemerged as suitable devices for deep learning inference. Due to the high\ncomputational complexity and memory footprint of neural networks, various\ncompression techniques, such as pruning, quantization and knowledge\ndistillation, have been proposed in literature. Pruning sparsifies a neural\nnetwork, reducing the number of multiplications and memory. However, pruning\noften fails to capture properties of the underlying hardware, causing\nunstructured sparsity and load-balance inefficiency, thus bottlenecking\nresource improvements. We propose a hardware-centric formulation of pruning, by\nformulating it as a knapsack problem with resource-aware tensor structures. The\nprimary emphasis is on real-time inference, with latencies in the order of\n1$\\mu$s, accelerated with hls4ml, an open-source framework for deep learning\ninference on FPGAs. Evaluated on a range of tasks, including real-time particle\nclassification at CERN's Large Hadron Collider and fast image classification,\nthe proposed method achieves a reduction ranging between 55% and 92% in the\nutilization of digital signal processing blocks (DSP) and up to 81% in block\nmemory (BRAM) utilization.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:14:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ramhorst","Benjamin","","Imperial College London"],["Constantinides","George A.","","Imperial College London"],["Loncar","Vladimir","","Massachusetts Institute of\n  Technology"]]}
{"id":"2308.05171","submitter":"Aleksey Tetenov","authors":"Charles F. Manski and Aleksey Tetenov","title":"Statistical Decision Theory Respecting Stochastic Dominance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The statistical decision theory pioneered by Wald (1950) has used\nstate-dependent mean loss (risk) to measure the performance of statistical\ndecision functions across potential samples. We think it evident that\nevaluation of performance should respect stochastic dominance, but we do not\nsee a compelling reason to focus exclusively on mean loss. We think it\ninstructive to also measure performance by other functionals that respect\nstochastic dominance, such as quantiles of the distribution of loss. This paper\ndevelops general principles and illustrative applications for statistical\ndecision theory respecting stochastic dominance. We modify the Wald definition\nof admissibility to an analogous concept of stochastic dominance (SD)\nadmissibility, which uses stochastic dominance rather than mean sampling\nperformance to compare alternative decision rules. We study SD admissibility in\ntwo relatively simple classes of decision problems that arise in treatment\nchoice. We reevaluate the relationship between the MLE, James-Stein, and\nJames-Stein positive part estimators from the perspective of SD admissibility.\nWe consider alternative criteria for choice among SD-admissible rules. We\njuxtapose traditional criteria based on risk, regret, or Bayes risk with\nanalogous ones based on quantiles of state-dependent sampling distributions or\nthe Bayes distribution of loss.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:15:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Manski","Charles F.",""],["Tetenov","Aleksey",""]]}
{"id":"2308.05172","submitter":"Victor Pozsgay","authors":"Victor Pozsgay","title":"Consistency of Scalar and Vector Effective Field Theories","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the absence of a theory of everything, modern physicists need to rely on\nother predictive tools and turned to Effective Field Theories (EFTs) in a\nnumber of fields, including but not limited to statistical mechanics, condensed\nmatter, particle physics, cosmology and gravity. The coefficients of an EFT can\nbe constrained with high precision by experiments, which can involve\nhigh-energy particle colliders for instance but are generally left free from\nthe theoretical point of view. The focus of this thesis is to use various\nconsistency criteria to get theoretical constraints on the low-energy\ncoefficients of EFTs. In particular, we construct a new model of massive spin-1\nfield by requiring that the theory is free of any ghostly degree of freedom. We\nthen study its cosmological perturbations and ask that all propagating modes\nare stable and subluminal, reducing the space of viable cosmological solutions.\nFinally, we implement a method to get 'causality bounds', which are obtained by\nrequiring infrared causality. This is imposed by forbidding any resolvable time\nadvance in the EFT. We derive such 'causality bounds' for shift-symmetric and\nGalileon scalar EFTs, before turning to gauge-symmetric vector fields. We prove\nthat our causality bounds can be competitive with positivity bounds and can\neven be used in scenarios that are out of reach of the positivity approach. The\nresult of this thesis, by exploring several consistency criteria, is to provide\ncompact causality bounds for low-energy EFT coefficients, in addition to\nconstraints coming from the absence of ghosts, stability and cosmological\nviability.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:16:08 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 14:55:06 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pozsgay","Victor",""]]}
{"id":"2308.05173","submitter":"Mikhail Kozlov","authors":"M. G. Kozlov, A. V. Oleynichenko, D. Budker, D. A. Glazov, Y. V.\n  Lomachuk, V. M. Shabaev, A. V. Titov, I. I. Tupitsyn, and A. V. Volotka","title":"Excitation of the $^{229}$Th nucleus by the hole in the inner electronic\n  shells","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The $^{229}$Th nucleus has a long-lived isomeric state $A^*$ at 8.338(24) eV\n[Kraemer et al, Nature, \\textbf{617}, 706 (2023)]. This state is connected to\nthe ground state by an M1 transition. For a hydrogenlike Th ion in the $1s$\nstate the hyperfine structure splitting is about 0.7 eV. This means that the\nhyperfine interaction can mix the nuclear ground state with the isomeric state\nwith a mixing coefficient $\\beta$ about 0.03. If the electron is suddenly\nremoved from this system, the nucleus will be left in the mixed state. The\nprobability to find the nucleus in the isomeric state $A^*$ is equal to\n$\\beta^2\\sim 10^{-3}$. For the $2s$ state the effect is roughly two orders of\nmagnitude smaller. An atom with a hole in the $1s$ or $2s$ shell is similar to\nthe hydrogenlike atom, only the hole has a short lifetime $\\tau$. After the\nhole is filled, there is a non-zero probability to find the nucleus in the\n$A^*$ state. Estimates of this probability are presented along with a\ndiscussion of possible experiments on Th-doped xenotime-type orthophosphate\ncrystals and other broad band gap materials.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:20:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kozlov","M. G.",""],["Oleynichenko","A. V.",""],["Budker","D.",""],["Glazov","D. A.",""],["Lomachuk","Y. V.",""],["Shabaev","V. M.",""],["Titov","A. V.",""],["Tupitsyn","I. I.",""],["Volotka","A. V.",""]]}
{"id":"2308.05174","submitter":"Michael Calkins","authors":"Justin A. Nicoski and Anne R. O'Connor and Michael A. Calkins","title":"Asymptotic scaling relations for rotating spherical convection with\n  strong zonal flows","comments":"36 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyse the results of direct numerical simulations of rotating convection\nin spherical shell geometries with stress-free boundary conditions, which\ndevelop strong zonal flows. Both the Ekman number and the Rayleigh number are\nvaried. We find that the asymptotic theory for rapidly rotating convection can\nbe used to predict the Ekman number dependence of each term in the governing\nequations, along with the convective flow speeds and the dominant length\nscales. Using a balance between the Reynolds stress and the viscous stress,\ntogether with the asymptotic scaling for the convective velocity, we derive an\nasymptotic prediction for the scaling behaviour of the zonal flow with respect\nto the Ekman number, which is supported by the numerical simulations. We do not\nfind evidence of distinct asymptotic scalings for the buoyancy and viscous\nforces and, in agreement with previous results from asymptotic plane layer\nmodels, we find that the ratio of the viscous force to the buoyancy force\nincreases with Rayleigh number. Thus, viscosity remains non-negligible and we\ndo not observe a trend towards a diffusion-free scaling behaviour within the\nrapidly rotating regime.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:29:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nicoski","Justin A.",""],["O'Connor","Anne R.",""],["Calkins","Michael A.",""]]}
{"id":"2308.05175","submitter":"Arkadiy Skopenkov","authors":"E. Alkin, S. Dzhenzher, O. Nikitenko, A. Skopenkov, A. Voropaev","title":"Cycles in graphs and in hypergraphs","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO cs.DM math.AT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is an expository paper. A $1$-cycle in a graph is a set $C$ of edges\nsuch that every vertex is contained in an even number of edges from $C$. E.g.,\na cycle in the sense of graph theory is a $1$-cycle, but not vice versa. It is\neasy to check that the sum (modulo $2$) of $1$-cycles is a $1$-cycle. In this\ntext we study the following problems: to find\n  $\\bullet$ the number of all 1-cycles in a given graph;\n  $\\bullet$ a small number of 1-cycles in a given graph such that any 1-cycle\nis the sum of some of them.\n  We also consider generalizations (of these problems) to graphs with symmetry,\nand to $2$-cycles in $2$-dimensional hypergraphs.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:29:25 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Alkin","E.",""],["Dzhenzher","S.",""],["Nikitenko","O.",""],["Skopenkov","A.",""],["Voropaev","A.",""]]}
{"id":"2308.05176","submitter":"Md Simul Hasan Talukder","authors":"Md. Simul Hasan Talukder, Rejwan Bin Sulaiman","title":"Comparative Analysis of Epileptic Seizure Prediction: Exploring Diverse\n  Pre-Processing Techniques and Machine Learning Models","comments":"14 pages, 4 Tables and 5 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":"  Epilepsy is a prevalent neurological disorder characterized by recurrent and\nunpredictable seizures, necessitating accurate prediction for effective\nmanagement and patient care. Application of machine learning (ML) on\nelectroencephalogram (EEG) recordings, along with its ability to provide\nvaluable insights into brain activity during seizures, is able to make accurate\nand robust seizure prediction an indispensable component in relevant studies.\nIn this research, we present a comprehensive comparative analysis of five\nmachine learning models - Random Forest (RF), Decision Tree (DT), Extra Trees\n(ET), Logistic Regression (LR), and Gradient Boosting (GB) - for the prediction\nof epileptic seizures using EEG data. The dataset underwent meticulous\npreprocessing, including cleaning, normalization, outlier handling, and\noversampling, ensuring data quality and facilitating accurate model training.\nThese preprocessing techniques played a crucial role in enhancing the models'\nperformance. The results of our analysis demonstrate the performance of each\nmodel in terms of accuracy. The LR classifier achieved an accuracy of 56.95%,\nwhile GB and DT both attained 97.17% accuracy. RT achieved a higher accuracy of\n98.99%, while the ET model exhibited the best performance with an accuracy of\n99.29%. Our findings reveal that the ET model outperformed not only the other\nmodels in the comparative analysis but also surpassed the state-of-the-art\nresults from previous research. The superior performance of the ET model makes\nit a compelling choice for accurate and robust epileptic seizure prediction\nusing EEG data.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:50:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Talukder","Md. Simul Hasan",""],["Sulaiman","Rejwan Bin",""]]}
{"id":"2308.05177","submitter":"Pantazis Deligiannis","authors":"Pantazis Deligiannis, Akash Lal, Nikita Mehrotra, Aseem Rastogi","title":"Fixing Rust Compilation Errors using LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Rust programming language, with its safety guarantees, has established\nitself as a viable choice for low-level systems programming language over the\ntraditional, unsafe alternatives like C/C++. These guarantees come from a\nstrong ownership-based type system, as well as primitive support for features\nlike closures, pattern matching, etc., that make the code more concise and\namenable to reasoning. These unique Rust features also pose a steep learning\ncurve for programmers.\n  This paper presents a tool called RustAssistant that leverages the emergent\ncapabilities of Large Language Models (LLMs) to automatically suggest fixes for\nRust compilation errors. RustAssistant uses a careful combination of prompting\ntechniques as well as iteration with an LLM to deliver high accuracy of fixes.\nRustAssistant is able to achieve an impressive peak accuracy of roughly 74% on\nreal-world compilation errors in popular open-source Rust repositories. We plan\nto release our dataset of Rust compilation errors to enable further research.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:30:27 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Deligiannis","Pantazis",""],["Lal","Akash",""],["Mehrotra","Nikita",""],["Rastogi","Aseem",""]]}
{"id":"2308.05180","submitter":"James Scott","authors":"James M. Scott, Qiang Du","title":"Nonlocal problems with local boundary conditions II: Green's identities\n  and regularity of solutions","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 nonlocal integral equations on bounded domains with finite-range\nnonlocal interactions that are localized at the boundary. We establish a\nGreen's identity for the nonlocal operator that recovers the classical boundary\nintegral, which, along with the variational analysis established previously,\nleads to the well-posedness of these nonlocal problems with various types of\nclassical local boundary conditions. We continue our analysis via\nboundary-localized convolutions, using them to analyze the Euler-Lagrange\nequations, which permits us to establish global regularity properties and\nclassical Sobolev convergence to their classical local counterparts.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:32:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Scott","James M.",""],["Du","Qiang",""]]}
{"id":"2308.05181","submitter":"Sebastian Ertl","authors":"S. Ertl, S. Schuldt, S. H. Suyu, P. L. Schechter, A. Halkola, J.\n  Wagner","title":"The missing quasar image in the gravitationally lensed quasar\n  HE0230$-$2130: implications on dark satellites and the cored lens mass\n  distribution","comments":"20 pages, 12 figures, 7 tables; submitted to 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":"  The quasar HE0230$-$2130 is lensed by two galaxies at similar redshifts into\nfour observed images. Using modeled quasar positions from fitting the\nbrightness of the quasar images in ground-based imaging data from the Magellan\ntelescope, we find that lens mass models where both galaxies are each\nparametrized with a singular power-law (PL) profile predict five quasar images.\nOne of the predicted images is unobserved even though it is distinctively\noffset from the lensing galaxies and is bright enough to be observable. This\nmissing image gives rise to new opportunities to study the galaxies' mass\ndistribution. To interpret the quad configuration of this system, we test\ndifferent profile assumption with the aim to obtain lens mass models that\npredicts correctly only four observed images. We test the effect of adopting\ncored profiles for the lensing galaxies, of external shear, and of additional\nprofiles to represent a dark matter clump. By comparing the Bayesian evidence\nof different model parametrizations, we favor the model class that consists of\ntwo singular PL profiles for the lensing galaxies and a cored isothermal sphere\nin the region of the previously predicted fifth images (rNIS profile). We\nestimate the mass of the rNIS clumps inside its Einstein radius and find that\n18\\% are in the range $10^6 M_{\\odot} \\leq M_{\\rm rNIS}\\leq 10^9 M_{\\odot}$,\nwhich is the predicted mass range of dark matter subhalos in cold dark matter\nsimulations, or the mass of low-mass dark matter satellite galaxies. The second\nmost likely model class, with a relative probability of 94\\%, is the model\nwhere the smaller lensing galaxy is described by a cored PL profile with\nexternal shear. Our study demonstrates that lensed quasar images are sensitive\nto dark matter structure in the gravitational lens.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:36:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ertl","S.",""],["Schuldt","S.",""],["Suyu","S. H.",""],["Schechter","P. L.",""],["Halkola","A.",""],["Wagner","J.",""]]}
{"id":"2308.05182","submitter":"Jose Xavier","authors":"J. C. Xavier and Jos\\'e A. Hoyos","title":"Effect of long-range interaction on dynamic quantum phase transitions of\n  an exactly solvable free-fermion model: non-analyticities at almost all times","comments":"9 pages, 7 figures, 1 table, further discussions were added in the\n  section Conclusions","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":"  In this work, we investigate quenches in a free-fermion chain with long-range\nhopping which decay with the distance with an exponent $\\nu$ and has range $D$.\nBy exploring the exact solution of the model, we found that the dynamic free\nenergy is non-analytical, in the thermodynamic limit, whenever the sudden\nquench crosses the equilibrium quantum critical point. We were able to\ndetermine the non-analyticities of dynamic free energy $f(t)$ at some critical\ntimes $t^{c}$ by solving nonlinear equations. We also show that the\nYang-Lee-Fisher (YLF) zeros cross the real-time axis at those critical times.\nWe found that the number of nontrivial critical times, $N_{s},$ depends on\n$\\nu$ and $D$. In particular, we show that for small $\\nu$ and large $D$ the\ndynamic free energy presents non-analyticities in any time interval $\\Delta\nt\\sim1/D\\ll1$, i.e., there are \\emph{non-analyticities at almost all times}.\nFor the spacial case $\\nu=0$, we obtain the critical times in terms of a simple\nexpression of the model parameters and also show that $f(t)$ is non-analytical\neven for finite system under anti-periodic boundary condition, when we consider\nsome special values of quench parameters. We also show that, generically, the\nfirst derivative of the dynamic free energy is discontinuous at the critical\ntime instant when the YLF zeros are non-degenerate. On the other hand, when\nthey become degenerate, all derivatives of $f(t)$ exist at the associated\ncritical instant.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:37:04 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 11:47:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xavier","J. C.",""],["Hoyos","Jos\u00e9 A.",""]]}
{"id":"2308.05183","submitter":"Sergey Yekimov","authors":"Yekimov Sergey","title":"Interpolation of numerical series by the Fermat-Torricelli point\n  construction method on the example of the numerical series of inflation in\n  the Czech Republic in 2011-2021","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The use of regression analysis for processing experimental data is fraught\nwith certain difficulties, which, when models are constructed, are associated\nwith assumptions, and there is a normal law of error distribution and variables\nare statistically independent. In practice , these conditions do not always\ntake place . This may cause the constructed economic and mathematical model to\nhave no practical value. As an alternative approach to the study of numerical\nseries, according to the author, smoothing of numerical series using\nFermat-Torricelli points with subsequent interpolation of these points by\nseries of exponents could be used. The use of exponential series for\ninterpolating numerical series makes it possible to achieve the accuracy of\nmodel construction no worse than regression analysis . At the same time, the\ninterpolation by series of exponents does not require the statistical material\nthat the errors of the numerical series obey the normal distribution law, and\nstatistical independence of variables is also not required. Interpolation of\nnumerical series by exponential series represents a \"black box\" type model,\nthat is, only input parameters and output parameters matter.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:40:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sergey","Yekimov",""]]}
{"id":"2308.05184","submitter":"John Chung","authors":"John Joon Young Chung, Eytan Adar","title":"PromptPaint: Steering Text-to-Image Generation Through Paint Medium-like\n  Interactions","comments":"Accepted to UIST2023","journal-ref":null,"doi":"10.1145/3586183.3606777","report-no":null,"categories":"cs.HC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While diffusion-based text-to-image (T2I) models provide a simple and\npowerful way to generate images, guiding this generation remains a challenge.\nFor concepts that are difficult to describe through language, users may\nstruggle to create prompts. Moreover, many of these models are built as\nend-to-end systems, lacking support for iterative shaping of the image. In\nresponse, we introduce PromptPaint, which combines T2I generation with\ninteractions that model how we use colored paints. PromptPaint allows users to\ngo beyond language to mix prompts that express challenging concepts. Just as we\niteratively tune colors through layered placements of paint on a physical\ncanvas, PromptPaint similarly allows users to apply different prompts to\ndifferent canvas areas and times of the generative process. Through a set of\nstudies, we characterize different approaches for mixing prompts, design\ntrade-offs, and socio-technical challenges for generative models. With\nPromptPaint we provide insight into future steerable generative tools.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:41:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chung","John Joon Young",""],["Adar","Eytan",""]]}
{"id":"2308.05185","submitter":"Francesco G. Russo","authors":"Fabio Bagarello (University of Palermo, Italy), Yanga Bavuma\n  (University of Cape Town, South Africa) and Francesco G. Russo (University of\n  Cape Town, South Africa)","title":"On the Pauli group on 2-qubits in dynamical systems with pseudofermions","comments":"Version of December 2022; 12pp; accepted for publication in Forum\n  Math. after changes due to the report","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.DS math.GR math.MP math.OA math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The group of matrices $P_1$ of Pauli is a finite 2-group of order 16 and\nplays a fundamental role in quantum information theory, since it is related to\nthe quantum information on the 1-qubit. Here we show that both $P_1$ and the\nPauli 2-group $P_2$ of order 64 on 2-qubits, other than in quantum computing,\ncan also appear in dynamical systems which are described by non self-adjoint\nHamiltonians. This will allow us to represent $P_1$ and $P_2$ in terms of\npseudofermionic operators.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:42:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bagarello","Fabio","","University of Palermo, Italy"],["Bavuma","Yanga","","University of Cape Town, South Africa"],["Russo","Francesco G.","","University of\n  Cape Town, South Africa"]]}
{"id":"2308.05186","submitter":"River Robles","authors":"River R. Robles, Aliaksei Halavanau, Gabriel Marcus, Zhirong Huang","title":"Fast modeling of high-gain cavity-based x-ray free-electron lasers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.comp-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cavity-based x-ray free-electron lasers (CBXFELs) are expected to be a\ndramatic leap ahead in x-ray source brightness and coherence properties\ncompared to single pass XFELs, unlocking previously impossible experimental\ncapabilities. One particular challenge of the CBXFEL is electron-optical\noverlap due to its relatively large (hundreds of meters) footprint. Numerical\nmodeling of CBXFELs with angular and positional errors is critical for\ndesigning stable cavities, as well as to predict signatures of specific\nmisalignment effects. Full-scale simulations of CBXFELs are incredibly\ntime-consuming, making large-scale parameter searches intractable on reasonable\ntimescales. In this paper, we present a semi-analytical model that allows to\ninvestigate realistic scenarios - x-ray cavity without gain (\"cold cavity\"),\nx-ray cavity with a high gain XFEL amplifier, and an x-ray cavity with an\noscillating e-beam trajectory in an XFEL - all in the presence of angular and\npositional errors. We especially focus on fast modeling of the XFEL process and\nx-ray optics, while capturing effects pertaining to actual experimental setups\nat the Linac Coherent Light Source (LCLS) at SLAC.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:44:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Robles","River R.",""],["Halavanau","Aliaksei",""],["Marcus","Gabriel",""],["Huang","Zhirong",""]]}
{"id":"2308.05187","submitter":"Masoud Ghazikor","authors":"Masoud Ghazikor, Keenan Roach, Kenny Cheung, Morteza Hashemi","title":"Exploring the Interplay of Interference and Queues in Unlicensed\n  Spectrum Bands for UAV Networks","comments":"Asilomar Conference on Signals, Systems, and Computers","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 present an analytical framework to explore the interplay of\nsignal interference and transmission queue management, and their impacts on the\nperformance of unmanned aerial vehicles (UAVs) when operating in the unlicensed\nspectrum bands. In particular, we develop a comprehensive framework to\ninvestigate the impact of other interference links on the UAV as it\ncommunicates with the ground users. To this end, we provide closed-form\nexpressions for packet drop probabilities in the queue due to buffer overflow\nor large queuing delay, which are expressed in terms of a transmission policy\nas a function of the channel fading threshold $\\beta$. The overall packet loss\ncaused either by interference signals or queuing packet drop is obtained,\nwhich, in turn, yields in obtaining the expected throughput performance.\nThrough extensive numerical results, we investigate the impact of the channel\nfading threshold $\\beta$, which plays an important role in balancing the\ntrade-offs between packet loss due to queue drop or transmission error due to\nlarge interference levels.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:44:36 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ghazikor","Masoud",""],["Roach","Keenan",""],["Cheung","Kenny",""],["Hashemi","Morteza",""]]}
{"id":"2308.05188","submitter":"Widmer Martin","authors":"Murray Child and Martin Widmer","title":"On Mahler's inequality and small integral generators of totally complex\n  number fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We improve Mahler's lower bound for the Mahler measure in terms of the\ndiscriminant and degree for a specific class of polynomials: complex monic\npolynomials of degree $d\\geq 2$ such that all roots with modulus greater than\nsome fixed value $r\\geq1$ occur in equal modulus pairs. We improve Mahler's\nexponent $\\frac{1}{2d-2}$ on the discriminant to $\\frac{1}{2d-3}$. Moreover, we\nshow that this value is sharp, even when restricting to minimal polynomials of\nintegral generators of a fixed not totally real number field.\n  An immediate consequence of this new lower bound is an improved lower bound\nfor integral generators of number fields, generalising a simple observation of\nRuppert from imaginary quadratic to totally complex number fields of arbitrary\ndegree.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:49:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Child","Murray",""],["Widmer","Martin",""]]}
{"id":"2308.05189","submitter":"Miguel-\\'Angel Fern\\'andez-Torres","authors":"Miguel-\\'Angel Fern\\'andez-Torres","title":"Hierarchical Representations for Spatio-Temporal Visual Attention\n  Modeling and Understanding","comments":"PhD thesis","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":"  This PhD. Thesis concerns the study and development of hierarchical\nrepresentations for spatio-temporal visual attention modeling and understanding\nin video sequences. More specifically, we propose two computational models for\nvisual attention. First, we present a generative probabilistic model for\ncontext-aware visual attention modeling and understanding. Secondly, we develop\na deep network architecture for visual attention modeling, which first\nestimates top-down spatio-temporal visual attention, and ultimately serves for\nmodeling attention in the temporal domain.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:49:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fern\u00e1ndez-Torres","Miguel-\u00c1ngel",""]]}
{"id":"2308.05190","submitter":"Sanjukta Roy","authors":"Shovan Kanti Barik, Silpa B S, M Venkat Ramana, Shovan Dutta, and\n  Sanjukta Roy","title":"Doppler-Enhanced Quantum Magnetometry with thermal Rydberg atoms","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 experimental measurements showing how one can combine quantum\ninterference and thermal Doppler shifts at room temperature to detect weak\nmagnetic fields. We pump ${}^{87}$Rb atoms to a highly-excited, Rydberg level\nusing a probe and a coupling laser, leading to narrow transmission peaks of the\nprobe due to destructive interference of transition amplitudes, known as\nElectromagnetically Induced Transparency (EIT). While it is customary in such\nsetups to use counterpropagating lasers to minimize the effect of Doppler\nshifts, here we show, on the contrary, that one can harness Doppler shifts in a\ncopropagating arrangement to produce an enhanced response to a magnetic field.\nIn particular, we demonstrate an order-of-magnitude bigger splitting in the\ntransmission spectrum as compared to the counterpropagating case. We explain\nand generalize our findings with theoretical modelling and simulations based on\na Lindblad master equation. Our results pave the way to using quantum effects\nfor magnetometry in readily deployable room-temperature platforms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:58:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Barik","Shovan Kanti",""],["S","Silpa B",""],["Ramana","M Venkat",""],["Dutta","Shovan",""],["Roy","Sanjukta",""]]}
{"id":"2308.05191","submitter":"Alejandro Cabo-Bizet","authors":"Matteo Beccaria and Alejandro Cabo-Bizet","title":"Large black hole entropy from the giant brane expansion","comments":"55 pp, 1 fig","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the Bekenstein-Hawking entropy of large supersymmetric black\nholes in AdS$_5\\times S^5$ emerges from remarkable cancellations in the giant\ngraviton expansions recently proposed by Imamura, and Gaiotto and Lee,\nindependently. A similar cancellation mechanism is shown to happen in the exact\nexpansion in terms of free fermions recently put-forward by Murthy. These two\nrepresentations can be understood as sums over independent systems of giant\nD3-branes and free fermions, respectively. At large charges, the free energy of\neach independent system localizes to its asymptotic expansion near the leading\nsingularity. The sum over the independent systems maps their localized free\nenergy to the localized free energy of the superconformal index of $U(N)$\n$\\mathcal{N}=4$ SYM. This result constitutes a non-perturbative test of the\ngiant graviton expansion valid at any value of $N$.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:02:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Beccaria","Matteo",""],["Cabo-Bizet","Alejandro",""]]}
{"id":"2308.05192","submitter":"Akriti Sinha","authors":"Akriti Sinha, Sarvesh Mangla, Abhirup Datta","title":"The spectral study of the faint radio sources in the ELAIS N1 field","comments":"18 pages, 11 Figures. Accepted for publication in JoAA","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the spectral properties of sources is crucial for the\ncharacterization of the radio source population. In this work, we have\nextensively studied the ELAIS N1 field using various low-frequency radio\nobservations. For the first time, we present the 1250\\,MHz observations of the\nfield using the upgraded Giant Meterwave Radio Telescope (uGMRT) that reach a\ncentral off-source RMS noise of $\\sim 12\\,\\mu$Jy\\,beam$^{-1}$. A source\ncatalogue of 1086 sources is compiled at $5\\sigma$ threshold ($>60\\,\\mu$Jy) to\nderive the normalized differential source counts at this frequency that is\nconsistent with existing observations and simulations. We present the spectral\nindices derived in two ways: two-point spectral indices and by fitting a\npower-law. The latter yielded a median $\\alpha = -0.57\\pm 0.14$, and we\nidentified nine ultra-steep spectrum sources using these spectral indices.\nFurther, using a radio colour diagram, we identify the three mega-hertz peaked\nspectrum (MPS) sources, while three other MPS sources are identified from the\nvisual inspection of the spectra, the properties of which are discussed. In our\nstudy of the classified sources in the ELAIS N1 field, we present the\nrelationship between $\\alpha$ and $z$. We find no evidence of an inverse\ncorrelation between these two quantities and suggest that the nature of the\nradio spectrum remains independent of the large-scale properties of the\ngalaxies that vary with redshifts.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:08:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sinha","Akriti",""],["Mangla","Sarvesh",""],["Datta","Abhirup",""]]}
{"id":"2308.05193","submitter":"Gabriel Pana","authors":"Gabriel Tiberiu Pan\\u{a}, Alexandru Nicolin","title":"Motifs in seismic networks: Romania, Italy, United States of America,\n  and Japan","comments":"11 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.geo-ph physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a detailed description of seismic activity in Romania, Italy, and\nJapan, as well as the California seismic zone in the United States of America,\nbased on the statistical analysis of the underlying seismic networks used to\nmodel the aforementioned zones. Our results on network connectivity and simple\nnetwork motifs allow for a complex description of seismic zones, while at the\nsame time reinforcing the current understanding of seismicity as a critical\nphenomenon. The reported distributions on node connectivity, three-, and\nfour-event motifs are consistent with power-law, i.e., scale-free,\ndistributions over large intervals and are robust across seismic networks\nobtained from different discretizations of the seismic zones of interest. In\nour analysis of the distributions of node connectivity and simple motifs, we\ndistinguish between the global distribution and the power-law part of it with\nthe help of maximum likelihood estimation (MLE) method and complementary\ncumulative distribution functions (CCDF). The main message is that the\ndistributions reported for the aforementioned seismic zones are not\nintrinsically power laws, but have large power-law components, extending over\nsome orders of magnitude, independent of discretization. All the results were\nobtained using publicly-available databases and open-source software, as well\nas a new toolbox available on GitHub, specifically designed to automatically\nanalyze earthquake databases.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:11:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pan\u0103","Gabriel Tiberiu",""],["Nicolin","Alexandru",""]]}
{"id":"2308.05194","submitter":"Nico Uhlemann","authors":"Nico Uhlemann, Felix Fent, Markus Lienkamp","title":"Evaluating Pedestrian Trajectory Prediction Methods for the Application\n  in Autonomous Driving","comments":"Submitted to the IEEE Transactions on Intelligent Transportation\n  Systems (T-ITS); 9 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, the state of the art in the field of pedestrian trajectory\nprediction is evaluated alongside the constant velocity model (CVM) with\nrespect to its applicability in autonomous vehicles. The evaluation is\nconducted on the widely-used ETH/UCY dataset where the Average Displacement\nError (ADE) and the Final Displacement Error (FDE) are reported. To align with\nrequirements in real-world applications, modifications are made to the input\nfeatures of the initially proposed models. An ablation study is conducted to\nexamine the influence of the observed motion history on the prediction\nperformance, thereby establishing a better understanding of its impact.\nAdditionally, the inference time of each model is measured to evaluate the\nscalability of each model when confronted with varying amounts of agents. The\nresults demonstrate that simple models remain competitive when generating\nsingle trajectories, and certain features commonly thought of as useful have\nlittle impact on the overall performance across different architectures. Based\non these findings, recommendations are proposed to guide the future development\nof trajectory prediction algorithms.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:21:50 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Uhlemann","Nico",""],["Fent","Felix",""],["Lienkamp","Markus",""]]}
{"id":"2308.05195","submitter":"Michael Maroun PhD","authors":"Michael Maroun","title":"The Exact Point Spectrum and Eigenvector of the Unique Continuous\n  L$^2(\\mathbb{R}^2)$ Bound State Solution to the Dirac Delta Schrodinger\n  Potential in Two Dimensions","comments":"13 pages total, 12 pages of content, 1 page of references","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.AP math.FA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Analyzing the point spectrum, i.e. bound state energy eigenvalue, of the\nDirac delta function in two and three dimensions is notoriously difficult\nwithout recourse to regularization or renormalization, typically both. The\nreason for this in two dimensions is two fold; 1) the coupling constant,\ntogether with the mass and Planck's constant form an unitless quantity. This\ncauses there to be a missing anomalous length scale. 2) The immediately obvious\nL$^2$ solution is divergent at the origin, where the Dirac Delta potential has\nits important point of support as a measure. Due to the uniqueness of the\nsolution presented here, it is immediate that the linear operator (the two\ndimensional Laplace operator on all of $\\mathbb{R}^2$), with the specialized\ndomain constructed here, ensures that the point spectrum has exactly one\nelement. This element is determined precisely, and a natural mathematically\nrigorous resolution to the anomalous length scale arises. In this work, there\nis no recourse to renormalization or regularization of any kind.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 01:31:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Maroun","Michael",""]]}
{"id":"2308.05196","submitter":"Pheerawich Chitnelawong","authors":"Pheerawich Chitnelawong, Andrei A. Klishin, Norman MacKay, David J.\n  Singer, Greg van Anders","title":"No Free Lunch for Avoiding Clustering Vulnerabilities in Distributed\n  Systems","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emergent design failures are ubiquitous in complex systems, and often arise\nwhen system elements cluster. Approaches to systematically reduce clustering\ncould improve a design's resilience, but reducing clustering is difficult if it\nis driven by collective interactions among design elements. Here, we use\ntechniques from statistical physics to identify mechanisms by which spatial\nclusters of design elements emerge in complex systems modelled by heterogeneous\nnetworks. We find that, in addition to naive, attraction-driven clustering,\nheterogeneous networks can exhibit emergent, repulsion-driven clustering. We\ndraw quantitative connections between our results on a model system in naval\nengineering to entropy-driven phenomena in nanoscale self-assembly, and give a\ngeneral argument that the clustering phenomena we observe should arise in many\ndistributed systems. We identify circumstances under which generic design\nproblems will exhibit trade-offs between clustering and uncertainty in design\nobjectives, and we present a framework to identify and quantify trade-offs to\nmanage clustering vulnerabilities.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:32:53 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 19:28:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chitnelawong","Pheerawich",""],["Klishin","Andrei A.",""],["MacKay","Norman",""],["Singer","David J.",""],["van Anders","Greg",""]]}
{"id":"2308.05197","submitter":"Juan M. Z\\'arate Pretel","authors":"Juan M. Z. Pretel, Takol Tangphati and Ayan Banerjee","title":"Relativistic structure of charged quark stars in energy-momentum squared\n  gravity","comments":"15 pages, 6 figures, 2 tables. Version accepted in Annals of Physics","journal-ref":"Ann. Phys. 458 (2023) 169440","doi":"10.1016/j.aop.2023.169440","report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Within the context of energy-momentum squared gravity (EMSG), where\nnon-linear matter contributions appear in the gravitational action, we derive\nthe modified TOV equations describing the hydrostatic equilibrium of charged\ncompact stars. We adopt two different choices for the matter Lagrangian density\n($\\mathcal{L}_m= p$ versus $\\mathcal{L}_m= -\\rho$) and investigate the impact\nof each one on stellar structure. Furthermore, considering a charge profile\nwhere the electric charge density $\\rho_{\\rm ch}$ is proportional to the\nstandard energy density $\\rho$, we solve numerically the stellar structure\nequations in order to obtain the mass-radius diagrams for the MIT bag model\nequation of state (EoS). For $\\mathcal{L}_m= p$ and given a specific value of\n$\\beta$ (including the uncharged case when $\\beta= 0$), the maximum-mass values\nincrease (decrease) substantially as the gravity model parameter $\\alpha$\nbecomes more negative (positive). However, for uncharged configurations and\nconsidering $\\mathcal{L}_m= -\\rho$, our numerical results reveal that when we\nincrease $\\alpha$ (from a negative value) the maximum mass first increases and\nafter reaching a maximum value it starts to decrease. Remarkably, this makes it\na less trivial behavior than that caused by the first choice when we take into\naccount the presence of electric charge ($\\beta \\neq 0$).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:34:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pretel","Juan M. Z.",""],["Tangphati","Takol",""],["Banerjee","Ayan",""]]}
{"id":"2308.05198","submitter":"Mohammad Ali","authors":"Mohammad Ali and Ximeng Liu","title":"Federated Online/Offline Remote Data Inspection for Distributed Edge\n  Computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In edge computing environments, app vendors can cache their data to be shared\nwith their users in many geographically distributed edge servers. However, the\ncached data is particularly vulnerable to several intentional attacks or\nunintentional events. Given the limited resources of edge servers and\nprohibitive storage costs incurred by app vendors, designing an efficient\napproach to inspect and maintain the data over tremendous edge servers is a\ncritical issue. To tackle the problem, we design a novel data inspection\napproach, named ${\\text{O}^2\\text{DI}}$, that provides the following services:\ni) using ${\\text{O}^2\\text{DI}}$, app vendors can inspect the data cached in\nedge servers without having the original data, which reduces the incurred I/O\nand storage overhead significantly; ii) computational operations conducted by\nboth edge servers and app vendors are highly efficient because of a novel\nonline/offline technique; iii) many data files cached in different edge servers\ncan be verified quickly and at once by using a novel batch verification method;\niv) corrupted data in edge servers can be localized and repaired efficiently.\nWe analyze the security and performance of ${\\text{O}^2\\text{DI}}$. We see that\nit is secure in the random oracle model, much faster, and more cost-effective\ncompared to state-of-the-art approaches.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:38:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ali","Mohammad",""],["Liu","Ximeng",""]]}
{"id":"2308.05199","submitter":"Jiajun Huang","authors":"Jiajun Huang, Sheng Di, Xiaodong Yu, Yujia Zhai, Jinyang Liu, Yafan\n  Huang, Ken Raffenetti, Hui Zhou, Kai Zhao, Zizhong Chen, Franck Cappello,\n  Yanfei Guo, Rajeev Thakur","title":"gZCCL: Compression-Accelerated Collective Communication Framework for\n  GPU Clusters","comments":"12 pages, 13 figures, and 2 tables. Submitted to PPoPP '24","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  GPU-aware collective communication has become a major bottleneck for modern\ncomputing platforms as GPU computing power rapidly rises. To address this\nissue, traditional approaches integrate lossy compression directly into\nGPU-aware collectives, which still suffer from serious issues such as\nunderutilized GPU devices and uncontrolled data distortion. In this paper, we\npropose gZCCL, a general framework that designs and optimizes GPU-aware,\ncompression-enabled collectives with an accuracy-aware design to control error\npropagation. To validate our framework, we evaluate the performance on up to\n512 NVIDIA A100 GPUs with real-world applications and datasets. Experimental\nresults demonstrate that our gZCCL-accelerated collectives, including both\ncollective computation (Allreduce) and collective data movement (Scatter), can\noutperform NCCL as well as Cray MPI by up to 4.5X and 28.7X, respectively.\nFurthermore, our accuracy evaluation with an image-stacking application\nconfirms the high reconstructed data quality of our accuracy-aware framework.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:38:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Huang","Jiajun",""],["Di","Sheng",""],["Yu","Xiaodong",""],["Zhai","Yujia",""],["Liu","Jinyang",""],["Huang","Yafan",""],["Raffenetti","Ken",""],["Zhou","Hui",""],["Zhao","Kai",""],["Chen","Zizhong",""],["Cappello","Franck",""],["Guo","Yanfei",""],["Thakur","Rajeev",""]]}
{"id":"2308.05200","submitter":"Luca Herranz-Celotti","authors":"Calvet, Emmanuel, Herranz-Celotti, Luca, and Valimamode, Karim","title":"SmartDCA superiority","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dollar-Cost Averaging (DCA) is a widely used technique to mitigate volatility\nin long-term investments of appreciating assets. However, the inefficiency of\nDCA arises from fixing the investment amount regardless of market conditions.\nIn this paper, we present a more efficient approach that we name SmartDCA,\nwhich consists in adjusting asset purchases based on price levels. The\nsimplicity of SmartDCA allows for rigorous mathematical analysis, enabling us\nto establish its superiority through the application of Cauchy-Schwartz\ninequality and Lehmer means. We further extend our analysis to what we refer to\nas $\\rho$-SmartDCA, where the invested amount is raised to the power of $\\rho$.\nWe demonstrate that higher values of $\\rho$ lead to enhanced performance.\nHowever, this approach may result in unbounded investments. To address this\nconcern, we introduce a bounded version of SmartDCA, taking advantage of two\nnovel mean definitions that we name quasi-Lehmer means. The bounded SmartDCA is\nspecifically designed to retain its superiority to DCA. To support our claims,\nwe provide rigorous mathematical proofs and conduct numerical analyses across\nvarious scenarios. The performance gain of different SmartDCA alternatives is\ncompared against DCA using data from S\\&P500 and Bitcoin. The results\nconsistently demonstrate that all SmartDCA variations yield higher long-term\ninvestment returns compared to DCA.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:43:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Calvet","",""],["Emmanuel","",""],["Herranz-Celotti","",""],["Luca","",""],["Valimamode","",""],["Karim","",""]]}
{"id":"2308.05201","submitter":"Xingchen Xu","authors":"Jin Liu (1), Xingchen Xu (2), Yongjun Li (1) and Yong Tan (2) ((1)\n  University of Science and Technology of China, (2) University of Washington)","title":"\"Generate\" the Future of Work through AI: Empirical Evidence from Online\n  Labor Markets","comments":"32 pages, 2 figures, 13 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the advent of general-purpose Generative AI, the interest in discerning\nits impact on the labor market escalates. In an attempt to bridge the extant\nempirical void, we interpret the launch of ChatGPT as an exogenous shock, and\nimplement a Difference-in-Differences (DID) approach to quantify its influence\non text-related jobs and freelancers within an online labor marketplace. Our\nresults reveal a significant decrease in transaction volume for gigs and\nfreelancers directly exposed to ChatGPT. Additionally, this decline is\nparticularly marked in units of relatively higher past transaction volume or\nlower quality standards. Yet, the negative effect is not universally\nexperienced among service providers. Subsequent analyses illustrate that\nfreelancers proficiently adapting to novel advancements and offering services\nthat augment AI technologies can yield substantial benefits amidst this\ntransformative period. Consequently, even though the advent of ChatGPT could\nconceivably substitute existing occupations, it also unfolds immense\nopportunities and carries the potential to reconfigure the future of work. This\nresearch contributes to the limited empirical repository exploring the profound\ninfluence of LLM-based generative AI on the labor market, furnishing invaluable\ninsights for workers, job intermediaries, and regulatory bodies navigating this\nevolving landscape.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:45:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Jin",""],["Xu","Xingchen",""],["Li","Yongjun",""],["Tan","Yong",""]]}
{"id":"2308.05202","submitter":"Fu Wang","authors":"Fu Wang, Tariq Alkhalifah","title":"Learnable Gabor kernels in convolutional neural networks for seismic\n  interpretation tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The use of convolutional neural networks (CNNs) in seismic interpretation\ntasks, like facies classification, has garnered a lot of attention for its high\naccuracy. However, its drawback is usually poor generalization when trained\nwith limited training data pairs, especially for noisy data. Seismic images are\ndominated by diverse wavelet textures corresponding to seismic facies with\nvarious petrophysical parameters, which can be suitably represented by Gabor\nfunctions. Inspired by this fact, we propose using learnable Gabor\nconvolutional kernels in the first layer of a CNN network to improve its\ngeneralization. The modified network combines the interpretability features of\nGabor filters and the reliable learning ability of original CNN. More\nimportantly, it replaces the pixel nature of conventional CNN filters with a\nconstrained function form that depends on 5 parameters that are more in line\nwith seismic signatures. Further, we constrain the angle and wavelength of the\nGabor kernels to certain ranges in the training process based on what we expect\nin the seismic images. The experiments on the Netherland F3 dataset show the\neffectiveness of the proposed method in a seismic facies classification task,\nespecially when applied to testing data with lower signal-to-noise ratios.\nBesides, we also test this modified CNN using different kernels on\nsalt$\\&$pepper and speckle noise. The results show that we obtain the best\ngeneralization and robustness of the CNN to noise when Gabor kernels are used\nin the first layer.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:46:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Fu",""],["Alkhalifah","Tariq",""]]}
{"id":"2308.05203","submitter":"Zhiyuan Wang","authors":"Zhiyuan Wang and Kaden R. A. Hazzard","title":"Free particles beyond fermions and bosons","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is commonly believed that there are only two types of particle exchange\nstatistics in quantum mechanics, fermions and bosons, with the exception of\nanyons in two dimension. In principle, a second exception known as\nparastatistics, which extends outside of two dimensions, has been considered\nbut was believed to be physically equivalent to fermions and bosons. In this\npaper we show that nontrivial parastatistics inequivalent to either fermions or\nbosons can exist in physical systems. These new types of identical particles\nobey generalized exclusion principles, leading to exotic free-particle\nthermodynamics distinct from any system of free fermions and bosons. We\nformulate our theory by developing a second quantization of paraparticles,\nwhich naturally includes exactly solvable non-interacting theories, and\nincorporates physical constraints such as locality. We then construct a family\nof one-dimensional quantum spin models where free parastatistical particles\nemerge as quasiparticle excitations. This demonstrates the possibility of a new\ntype of quasiparticle in condensed matter systems, and, more speculatively, the\npotential for previously unconsidered types of elementary particles.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:51:07 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Zhiyuan",""],["Hazzard","Kaden R. A.",""]]}
{"id":"2308.05204","submitter":"Faraz Khoshbakhtian","authors":"Faraz Khoshbakhtian, Hamidreza Validi, Mario Ventresca, Dionne Aleman","title":"Optimal design of vaccination policies: A case study for Newfoundland\n  and Labrador","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC physics.soc-ph q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes pandemic mitigation vaccination policies for Newfoundland\nand Labrador (NL) based on two compact mixed integer programming (MIP) models\nof the distance-based critical node detection problem (DCNDP). Our main focus\nis on two variants of the DCNDP that seek to minimize the number of connections\nwith lengths of at most one (1-DCNDP) and two (2-DCNDP). A polyhedral study for\nthe 1-DCNDP is conducted, and new aggregated inequalities are provided for the\n2-DCNDP. The computational experiments show that the 2-DCNDP with aggregated\ninequalities outperforms the one with disaggregated inequalities for graphs\nwith a density of at least 0.5%. We also study the strategic vaccine allocation\nproblem as a real-world application of the DCNDP and conduct a set of\ncomputational experiments on a simulated contact network of NL. Our\ncomputational results demonstrate that the DCNDP-based strategies can have a\nbetter performance in comparison with the real-world strategies implemented\nduring COVID-19.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:51:17 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 01:11:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Khoshbakhtian","Faraz",""],["Validi","Hamidreza",""],["Ventresca","Mario",""],["Aleman","Dionne",""]]}
{"id":"2308.05205","submitter":"Francisco Javier Rubio","authors":"J. A. Christen and F. J. Rubio","title":"Dynamic survival analysis: modelling the hazard function via ordinary\n  differential equations","comments":"R and Python code available at: https://github.com/FJRubio67/ODESurv","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The hazard function represents one of the main quantities of interest in the\nanalysis of survival data. We propose a general approach for modelling the\ndynamics of the hazard function using systems of autonomous ordinary\ndifferential equations (ODEs). This modelling approach can be used to provide\nqualitative and quantitative analyses of the evolution of the hazard function\nover time. Our proposal capitalises on the extensive literature of ODEs which,\nin particular, allow for establishing basic rules or laws on the dynamics of\nthe hazard function via the use of autonomous ODEs. We show how to implement\nthe proposed modelling framework in cases where there is an analytic solution\nto the system of ODEs or where an ODE solver is required to obtain a numerical\nsolution. We focus on the use of a Bayesian modelling approach, but the\nproposed methodology can also be coupled with maximum likelihood estimation. A\nsimulation study is presented to illustrate the performance of these models and\nthe interplay of sample size and censoring. Two case studies using real data\nare presented to illustrate the use of the proposed approach and to highlight\nthe interpretability of the corresponding models. We conclude with a discussion\non potential extensions of our work and strategies to include covariates into\nour framework.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:52:19 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 10:01:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Christen","J. A.",""],["Rubio","F. J.",""]]}
{"id":"2308.05206","submitter":"Mads Bjerregaard Kristensen","authors":"Mads Bjerregaard Kristensen, Nenad Kralj, Eric Langman, Albert\n  Schliesser","title":"A Long-lived and Efficient Optomechanical Memory for Light","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate a memory for light based on optomechanically induced\ntransparency. We achieve a long storage time by leveraging the ultra-low\ndissipation of a soft-clamped mechanical membrane resonator, which oscillates\nat MHz frequencies. At room temperature, we demonstrate a lifetime $T_1 \\approx\n23\\,\\mathrm{ms}$ and a retrieval efficiency $\\eta \\approx 40\\%$ for classical\ncoherent pulses. We anticipate storage of quantum light to be possible at\nmoderate cryogenic conditions ($T\\approx 10\\,\\mathrm{K}$). Such systems could\nfind applications in emerging quantum networks, where they can serve as\nlong-lived optical quantum memories by storing optical information in a\nphononic mode.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 19:58:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kristensen","Mads Bjerregaard",""],["Kralj","Nenad",""],["Langman","Eric",""],["Schliesser","Albert",""]]}
{"id":"2308.05207","submitter":"Orestis Papadigenopoulos","authors":"Vineet Goyal, Salal Humair, Orestis Papadigenopoulos, Assaf Zeevi","title":"MNL-Prophet: Sequential Assortment Selection under Uncertainty","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to numerous applications in retail and (online) advertising the problem\nof assortment selection has been widely studied under many combinations of\ndiscrete choice models and feasibility constraints. In many situations,\nhowever, an assortment of products has to be constructed gradually and without\naccurate knowledge of all possible alternatives; in such cases, existing\noffline approaches become inapplicable. We consider a stochastic variant of the\nassortment selection problem, where the parameters that determine the revenue\nand (relative) demand of each item are jointly drawn from some known\nitem-specific distribution. The items are observed sequentially in an arbitrary\nand unknown order; upon observing the realized parameters of each item, the\ndecision-maker decides irrevocably whether to include it in the constructed\nassortment, or forfeit it forever. The objective is to maximize the expected\ntotal revenue of the constructed assortment, relative to that of an offline\nalgorithm which foresees all the parameter realizations and computes the\noptimal assortment. We provide simple threshold-based online policies for the\nunconstrained and cardinality-constrained versions of the problem under a\nnatural class of substitutable choice models; as we show, our policies are\n(worst-case) optimal under the celebrated Multinomial Logit choice model. We\nextend our results to the case of knapsack constraints and discuss interesting\nconnections to the Prophet Inequality problem, which is already subsumed by our\nsetting.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:02:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Goyal","Vineet",""],["Humair","Salal",""],["Papadigenopoulos","Orestis",""],["Zeevi","Assaf",""]]}
{"id":"2308.05208","submitter":"Daniel Zhu","authors":"Noga Alon, Colin Defant, Noah Kravitz, and Daniel G. Zhu","title":"Ordering Candidates via Vantage Points","comments":"20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given an $n$-element set $C\\subseteq\\mathbb{R}^d$ and a (sufficiently\ngeneric) $k$-element multiset $V\\subseteq\\mathbb{R}^d$, we can order the points\nin $C$ by ranking each point $c\\in C$ according to the sum of the distances\nfrom $c$ to the points of $V$. Let $\\Psi_k(C)$ denote the set of orderings of\n$C$ that can be obtained in this manner as $V$ varies, and let\n$\\psi^{\\mathrm{max}}_{d,k}(n)$ be the maximum of $\\lvert\\Psi_k(C)\\rvert$ as $C$\nranges over all $n$-element subsets of $\\mathbb{R}^d$. We prove that\n$\\psi^{\\mathrm{max}}_{d,k}(n)=\\Theta_{d,k}(n^{2dk})$ when $d \\geq 2$ and that\n$\\psi^{\\mathrm{max}}_{1,k}(n)=\\Theta_k(n^{4\\lceil k/2\\rceil -1})$. As a step\ntoward proving this result, we establish a bound on the number of sign patterns\ndetermined by a collection of functions that are sums of radicals of\nnonnegative polynomials; this can be understood as an analogue of a classical\ntheorem of Warren. We also prove several results about the set\n$\\Psi(C)=\\bigcup_{k\\geq 1}\\Psi_k(C)$; this includes an exact description of\n$\\Psi(C)$ when $d=1$ and when $C$ is the set of vertices of a vertex-transitive\npolytope.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:06:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Alon","Noga",""],["Defant","Colin",""],["Kravitz","Noah",""],["Zhu","Daniel G.",""]]}
{"id":"2308.05209","submitter":"Luis Gabriel Gomez Diaz PhD","authors":"Gabriel G\\'omez, \\'Angel Rinc\\'on and Norman Cruz","title":"Black Holes with Abelian and Non-Abelian Charges and Their Impact on\n  Matter Accretion Flows","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the black hole spacetime structure of a model consisting of the\nstandard Maxwell theory and a $p$-power-Yang-Mills term. This non-linear\ncontribution introduces a non-Abelian charge into the global solution,\nresulting in a modified structure of the standard Reissner-Nordstr\\\"{o}m black\nhole. Specifically, we focus on the model with $p=1/2$, which gives rise to a\nnew type of modified Reissner-Nordstr\\\"{o}m black hole. For this class of black\nholes, we compute the event horizon, the innermost stable circular orbit, and\nthe conditions to preserve the weak cosmic censorship conjecture. The latter\ncondition sets a well-established relation between the electric and the\nYang-Mills charges. As a first astrophysical implication, the accretion\nproperties of spherical steady flows are investigated in detail. Extensive\nnumerical examples of how the Yang-Mills charge affects the accretion process\nof an isothermal fluid in comparison to the standard Reissner-Nordstr\\\"{o}m and\nSchwarzschild black holes are displayed. Finally, analytical solutions in the\nfully relativistic regime, along with numerical computations, of the mass\naccretion rate for a polytropic fluid in terms of the electric and Yang-Mills\ncharges are obtained. As a main result, the mass accretion rate efficiency is\nconsiderably improved, with respect to the standard Reissner-Nordstr\\\"{o}m and\nSchwarzschild solutions, for negative values of the Yang-Mills charge.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:12:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["G\u00f3mez","Gabriel",""],["Rinc\u00f3n","\u00c1ngel",""],["Cruz","Norman",""]]}
{"id":"2308.05210","submitter":"Emre Gurkanli","authors":"E. Gurkanli, M. K\\\"oksal, A. Guti\\'errez-Rodr\\'iguez, M. A.\n  Hern\\'andez-Ru\\'iz, V. Ari","title":"Expected sensitivity on the anomalous quartic neutral gauge couplings in\n  $\\gamma\\gamma$ collisions at the CLIC","comments":"20 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The presence of multi-boson self-interactions is implied by the non-Abelian\ngauge structure of the Standard Model (SM). Precise measurements of these\ninteractions allow not only testing the nature of the SM but also new physics\ncontribution arising from the beyond SM. The investigation of these\ninteractions can be approached in a model-independent manner using an effective\ntheory approach, which forms the main motivation of this study. In this paper,\nwe examine the anomalous neutral quartic gauge couplings through the process\n$\\gamma \\gamma \\rightarrow Z Z$ at the Compact Linear Collider (CLIC) with the\ncenter-of-mass energy of $\\sqrt{s}=3$ TeV, integrated luminosities of ${\\cal\nL}=5$ $\\rm ab^{-1}$. The anomalous neutral quartic gauge couplings is\nimplemented into FeynRules to generate a UFO module inserted into Madgraph to\ngenerate both background and signal events. These events are then passed\nthrough Pythia 8 for parton showering and Delphes to include realistic detector\neffects. We obtain that the sensitivities on the anomalous quartic neutral\ngauge couplings with $95\\%$ Confidence Level are given as:\n$f_{T0}/\\Lambda^{4}=[-1.06; 1.08]\\times 10^{-3}$ ${\\rm TeV^{-4}}$,\n$f_{T1}/\\Lambda^{4}=[-1.06; 1.08]\\times 10^{-3}$ ${\\rm\nTeV^{-4}}$,$f_{T2}/\\Lambda^{4}=[-1.06; 1.08]\\times 10^{-3}$ ${\\rm\nTeV^{-4}}$,$f_{T0}/\\Lambda^{4}=[-1.06; 1.08]\\times 10^{-3}$ ${\\rm TeV^{-4}}$,\n$f_{T5}/\\Lambda^{4}=[-4.08; 4.08]\\times 10^{-4}$ ${\\rm TeV^{-4}}$ and\n$f_{T8}/\\Lambda^{4}=[-1.10; 1.10]\\times10^{-4}$ ${\\rm TeV^{-4}}$. Our results\non the anomalous quartic neutral gauge couplings are set more stringent\nsensitivity with respect to the recent experimental limits.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:22:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gurkanli","E.",""],["K\u00f6ksal","M.",""],["Guti\u00e9rrez-Rodr\u00edguez","A.",""],["Hern\u00e1ndez-Ru\u00edz","M. A.",""],["Ari","V.",""]]}
{"id":"2308.05211","submitter":"Prashant K Sarswat","authors":"Arun Murali, Rahulkumar Sunil Singh, Michael L Free, and Prashant K\n  Sarswat","title":"Enhanced interfacial charge transfer by Z-scheme in defect-mediated\n  ZnO-CdS nano-composite with rGO as a solid-state electron mediator for\n  efficient photocatalytic applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  ZnO-based photocatalysts are widely investigated photocatalytic materials for\npollutant degradation due to their low cost, abundance, and eco-friendly\ncharacteristics. However, the effectiveness of its photocatalytic properties is\nlimited by inherent challenges such as a wide bandgap, photo-corrosion, and\nrapid recombination of photogenerated charge carriers. In order to overcome\nthese limitations observed in traditional ZnO photocatalysts and enhance their\nphotocatalytic properties, an alternative approach has been proposed. This\nstudy introduces an oxygen defects-mediated Z-scheme mechanism for charge\nseparation in the heterojunction by coupling Ov-ZnO with CdS, alongside the\nincorporation of rGO as an electron mediator. This mechanism aims to enhance\nthe photostability and visible-light-induced photocatalysis properties of ZnO.\nOur work focuses on the development and characterization of trinary\nOv-ZnO-rGO-CdS pho-to-catalysts, aiming to enhance their photocatalytic\nproperties for efficient energy conversion and environmental applications. To\ncharacterize the trinary Ov-ZnO-rGO-CdS photocatalysts, we employed a range of\ncharacterization techniques, including X-ray diffraction, Raman spectroscopy,\nUV-Visible spectroscopy, Electrochemical impedance spectroscopy,\nPhoto-luminescence spectroscopy, and X-ray photoelectron spectroscopy. This\napproach not only provides insights into the defect-dependent interfacial\nmechanism in heterostructure nanocomposites but also opens promising\npossibilities for developing high-performance ZnO-based photocatalysts for\nenergy conversion and environmental applications\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:24:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Murali","Arun",""],["Singh","Rahulkumar Sunil",""],["Free","Michael L",""],["Sarswat","Prashant K",""]]}
{"id":"2308.05212","submitter":"Erik Brekke","authors":"E. Brekke and C. Umland","title":"Rydberg excitation through detuned microwave transition in rubidium","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 study the excitation of Rydberg states in warm rubidium vapor. Using an\ninverted wavelength excitation scheme, we observe the effect of microwave\ncoupling between Rydberg states through electromagnetically induced\ntransparency. We observe AC stark shifts of the Rydberg states from the\nmicrowave coupling, and demonstrate detuned excitation to a secondary Rydberg\nstate. These results show flexibility in excitation process and state selection\nnecessary for a variety of wave-mixing processes using Rydberg states.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:29:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Brekke","E.",""],["Umland","C.",""]]}
{"id":"2308.05213","submitter":"Jayakody Arachchige Don Mahesh Niranjan Jayakody Mr.","authors":"Mahesh N. Jayakody and Eliahu Cohen","title":"Closed-form expressions for the probability distribution of quantum walk\n  on a line","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Theoretical and applied studies of quantum walks are abundant in quantum\nscience and technology thanks to their relative simplicity and versatility.\nHere we derive closed-form expressions for the probability distribution of\nquantum walks on a line. The most general two-state coin operator and the most\ngeneral (pure) initial state are considered in the derivation. The general coin\noperator includes the common choices of Hadamard, Grover, and Fourier coins.\nThe method of Fibonacci-Horner basis for the power decomposition of a matrix is\nemployed in the analysis. Moreover, we also consider mixed initial states and\nderive closed-form expression for the probability distribution of the Quantum\nwalk on a line. To prove the accuracy of our derivations, we retrieve the\nsimulated probability distribution of Hadamard walk on a line using our\nclosed-form expressions. With a broader perspective in mind, we argue that our\napproach has the potential to serve as a helpful mathematical tool in obtaining\nprecise analytical expressions for the time evolution of qubit-based systems in\na general context.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:32:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jayakody","Mahesh N.",""],["Cohen","Eliahu",""]]}
{"id":"2308.05214","submitter":"Daniel Azevedo","authors":"D.O.R. Azevedo, M.L. Bispo, O.M. Del Cima, J.A. Helay\\\"el-Neto","title":"Z $\\to$ 3X decay width from dark matter Standard Model extension","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a Born-Infeld contribution to the $U(1)_{B-L}$ extension of the\nStandard Model to explain the anomalous decay of beryllium by the X17 neutral\nboson, its possible connections to dark matter and the observed MeV gamma-ray\nbursts. The decay width of the $Z^0$ decay into 3$X$ process is computed based\non NA64 experiment data.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:34:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Azevedo","D. O. R.",""],["Bispo","M. L.",""],["Del Cima","O. M.",""],["Helay\u00ebl-Neto","J. A.",""]]}
{"id":"2308.05215","submitter":"Gabriele Levati","authors":"Luca Di Luzio, Gabriele Levati, Paride Paradisi, Xavier Ponce D\\'iaz","title":"Flavour constraints on light spin-1 bosons within a chiral Lagrangian\n  approach","comments":"15 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss the construction of the chiral Lagrangian for a light spin-1\nboson, here denoted as $X$, featuring both vector and axial-vector couplings to\nlight $u,d,s$ quarks. Focusing on $\\Delta S = 1$ transitions, we show that\nthere are model-independent tree-level contributions to $K^\\pm \\to \\pi^\\pm X$,\nsourced by Standard Model charged currents, which receive an $m^2_K / m_X^2$\nenhancement from the emission of a longitudinally polarized $X$. This flavour\nobservable sets the strongest to date model-independent bound on the diagonal\naxial-vector couplings of $X$ to $u,d,s$ quarks for $m_X < m_K - m_\\pi$,\nsuperseding the bounds arising from beam-dump and collider searches.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:35:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Di Luzio","Luca",""],["Levati","Gabriele",""],["Paradisi","Paride",""],["D\u00edaz","Xavier Ponce",""]]}
{"id":"2308.05216","submitter":"Arina Tashchilina","authors":"Nicholas Milson, Arina Tashchilina, Tian Ooi, Anna Czarnecka, Zaheen\n  F. Ahmad, and Lindsay J. LeBlanc","title":"High-dimensional reinforcement learning for optimization and control of\n  ultracold quantum gases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine-learning techniques are emerging as a valuable tool in experimental\nphysics, and among them, reinforcement learning offers the potential to control\nhigh-dimensional, multistage processes in the presence of fluctuating\nenvironments. In this work, we apply reinforcement learning to the preparation\nof an ultracold quantum gas to realize a consistent and large number of atoms\nat microkelvin temperatures. This reinforcement learning agent determines an\noptimal set of thirty control parameters in a dynamically changing environment\nthat is characterized by thirty sensed parameters. By comparing this method to\nthat of training supervised-learning regression models, as well as to\nhuman-driven control schemes, we find that both machine learning approaches\naccurately predict the number of cooled atoms and both result in occasional\nsuperhuman control schemes. However, only the reinforcement learning method\nachieves consistent outcomes, even in the presence of a dynamic environment.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:36:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Milson","Nicholas",""],["Tashchilina","Arina",""],["Ooi","Tian",""],["Czarnecka","Anna",""],["Ahmad","Zaheen F.",""],["LeBlanc","Lindsay J.",""]]}
{"id":"2308.05217","submitter":"Christian Wuthrich","authors":"Christian W\\\"uthrich","title":"The philosophy of causal set theory","comments":"28 pages; written for Cosimo Bambi, Leonardo Modesto, and Ilya\n  Shapiro (eds.), Handbook of Quantum Gravity, to be published with Springer\n  Nature, Singapore","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article presents the most interesting philosophical issues as they arise\nin causal set theory. The first concerns the apparent disappearance of\nspacetime at the fundamental level. It shows how the looming empirical\nincoherence is averted if we adopt spacetime functionalism. Second, classical\nsequential growth dynamics rekindles hope for a fundamental passage of physical\ntime compatible with relativistic physics. The article argues that this hope is\nfaint at best, as a block view offers the most natural interpretation of\ndynamical causal set theory. Third, causal set theory admits a very natural\nstructuralist interpretation, enabling a fruitful interaction between debates\nin philosophy of science concerning structural realism and the metaphysics of\ncausal sets.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:44:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["W\u00fcthrich","Christian",""]]}
{"id":"2308.05218","submitter":"Yang Zhang","authors":"Yang Zhang, Krishna C. Puvvada, Vitaly Lavrukhin, Boris Ginsburg","title":"Conformer-based Target-Speaker Automatic Speech Recognition for\n  Single-Channel Audio","comments":null,"journal-ref":null,"doi":"10.1109/ICASSP49357.2023.10095115","report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose CONF-TSASR, a non-autoregressive end-to-end time-frequency domain\narchitecture for single-channel target-speaker automatic speech recognition\n(TS-ASR). The model consists of a TitaNet based speaker embedding module, a\nConformer based masking as well as ASR modules. These modules are jointly\noptimized to transcribe a target-speaker, while ignoring speech from other\nspeakers. For training we use Connectionist Temporal Classification (CTC) loss\nand introduce a scale-invariant spectrogram reconstruction loss to encourage\nthe model better separate the target-speaker's spectrogram from mixture. We\nobtain state-of-the-art target-speaker word error rate (TS-WER) on\nWSJ0-2mix-extr (4.2%). Further, we report for the first time TS-WER on\nWSJ0-3mix-extr (12.4%), LibriSpeech2Mix (4.2%) and LibriSpeech3Mix (7.6%)\ndatasets, establishing new benchmarks for TS-ASR. The proposed model will be\nopen-sourced through NVIDIA NeMo toolkit.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:51:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhang","Yang",""],["Puvvada","Krishna C.",""],["Lavrukhin","Vitaly",""],["Ginsburg","Boris",""]]}
{"id":"2308.05219","submitter":"Elizabeth Hou","authors":"Elizabeth M. Hou, Gregory Castanon","title":"Decoding Layer Saliency in Language Transformers","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":"  In this paper, we introduce a strategy for identifying textual saliency in\nlarge-scale language models applied to classification tasks. In visual networks\nwhere saliency is more well-studied, saliency is naturally localized through\nthe convolutional layers of the network; however, the same is not true in\nmodern transformer-stack networks used to process natural language. We adapt\ngradient-based saliency methods for these networks, propose a method for\nevaluating the degree of semantic coherence of each layer, and demonstrate\nconsistent improvement over numerous other methods for textual saliency on\nmultiple benchmark classification datasets. Our approach requires no additional\ntraining or access to labelled data, and is comparatively very computationally\nefficient.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:53:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hou","Elizabeth M.",""],["Castanon","Gregory",""]]}
{"id":"2308.05220","submitter":"Samantha Platt","authors":"Samantha Platt","title":"Visual Aspects of Gaussian Periods and Analogues","comments":"Submitted to \"Experimental Mathematics,\" 30 pages, 49 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gaussian periods have been studied for centuries in the realms of number\ntheory, field theory, cryptography, and elsewhere. However, it was only within\nthe last decade or so that they began to be studied from a visual perspective.\nBy plotting Gaussian periods in the complex plane, many interesting and\ninsightful patterns can be seen, leading to various conjectures and theorems\nabout their properties. In this paper, we offer a description of Gaussian\nperiods, along with examples of the structure that can occur when plotting them\nin the complex plane. In addition to this, we offer two ways in which this\nstudy can be generalized to other situations -- one relating to supercharacter\ntheory, the other relating to class field theory -- along with discussions and\nvisual examples of each. We end the paper by including some code for readers to\ngenerate images on their own.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:53:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Platt","Samantha",""]]}
{"id":"2308.05221","submitter":"Hangjie Shi","authors":"Hangjie Shi, Leslie Ball, Govind Thattai, Desheng Zhang, Lucy Hu,\n  Qiaozi Gao, Suhaila Shakiah, Xiaofeng Gao, Aishwarya Padmakumar, Bofei Yang,\n  Cadence Chung, Dinakar Guthy, Gaurav Sukhatme, Karthika Arumugam, Matthew\n  Wen, Osman Ipek, Patrick Lange, Rohan Khanna, Shreyas Pansare, Vasu Sharma,\n  Chao Zhang, Cris Flagg, Daniel Pressel, Lavina Vaz, Luke Dai, Prasoon Goyal,\n  Sattvik Sahai, Shaohua Liu, Yao Lu, Anna Gottardi, Shui Hu, Yang Liu, Dilek\n  Hakkani-Tur, Kate Bland, Heather Rocker, James Jeun, Yadunandana Rao, Michael\n  Johnston, Akshaya Iyengar, Arindam Mandal, Prem Natarajan, Reza Ghanadan","title":"Alexa, play with robot: Introducing the First Alexa Prize SimBot\n  Challenge on Embodied AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Alexa Prize program has empowered numerous university students to\nexplore, experiment, and showcase their talents in building conversational\nagents through challenges like the SocialBot Grand Challenge and the TaskBot\nChallenge. As conversational agents increasingly appear in multimodal and\nembodied contexts, it is important to explore the affordances of conversational\ninteraction augmented with computer vision and physical embodiment. This paper\ndescribes the SimBot Challenge, a new challenge in which university teams\ncompete to build robot assistants that complete tasks in a simulated physical\nenvironment. This paper provides an overview of the SimBot Challenge, which\nincluded both online and offline challenge phases. We describe the\ninfrastructure and support provided to the teams including Alexa Arena, the\nsimulated environment, and the ML toolkit provided to teams to accelerate their\nbuilding of vision and language models. We summarize the approaches the\nparticipating teams took to overcome research challenges and extract key\nlessons learned. Finally, we provide analysis of the performance of the\ncompeting SimBots during the competition.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:56:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shi","Hangjie",""],["Ball","Leslie",""],["Thattai","Govind",""],["Zhang","Desheng",""],["Hu","Lucy",""],["Gao","Qiaozi",""],["Shakiah","Suhaila",""],["Gao","Xiaofeng",""],["Padmakumar","Aishwarya",""],["Yang","Bofei",""],["Chung","Cadence",""],["Guthy","Dinakar",""],["Sukhatme","Gaurav",""],["Arumugam","Karthika",""],["Wen","Matthew",""],["Ipek","Osman",""],["Lange","Patrick",""],["Khanna","Rohan",""],["Pansare","Shreyas",""],["Sharma","Vasu",""],["Zhang","Chao",""],["Flagg","Cris",""],["Pressel","Daniel",""],["Vaz","Lavina",""],["Dai","Luke",""],["Goyal","Prasoon",""],["Sahai","Sattvik",""],["Liu","Shaohua",""],["Lu","Yao",""],["Gottardi","Anna",""],["Hu","Shui",""],["Liu","Yang",""],["Hakkani-Tur","Dilek",""],["Bland","Kate",""],["Rocker","Heather",""],["Jeun","James",""],["Rao","Yadunandana",""],["Johnston","Michael",""],["Iyengar","Akshaya",""],["Mandal","Arindam",""],["Natarajan","Prem",""],["Ghanadan","Reza",""]]}
{"id":"2308.05222","submitter":"Prashant Jain","authors":"Prashant K. Jain","title":"Phase transition of copper (I) sulfide and its implication for purported\n  superconductivity of LK-99","comments":"5 pages, 2 figures","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":"  Lee, Kim, and coworkers have recently claimed ambient temperature and\npressure superconductivity in a modified lead apatite material named LK-99.\nHowever, the polycrystalline material synthesized has a significant fraction of\ncopper (I) sulfide. Copper (I) sulfide has a known phase transition at 104\ndegrees C from an ordered low-temperature phase to a high-temperature\nsuperionic phase. As a result of this phase transition, copper (I) sulfide\nexhibits sharp transitions in electrical resistivity and heat capacity, which\nare expected to coincide with the temperature-induced transitions reported for\nLK-99. This implies that LK-99 must be synthesized without any copper (I)\nsulfide to allow unambiguous validation of the superconducting properties of\nLK-99.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:57:08 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 01:43:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jain","Prashant K.",""]]}
{"id":"2308.05223","submitter":"Michela Mancini","authors":"Michela Mancini, Anton Leykin, John A. Christian","title":"State estimation of a moving frequency source from observations at\n  multiple receivers","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The task of position and velocity estimation of a moving transmitter (with\neither a known or unknown frequency) is a common problem arising in many\ndifferent application domains. Based on the Doppler effect, this work presents\na direct solution using only the frequency measured by a multitude of receivers\nwith a known state. A natural rewriting of the problem as a system of\npolynomial equations allows for the use of homotopy continuation to find the\nglobal solution without any a priori information about the frequency source. We\nshow that the data from six or seven receivers is sufficient in case of known\nor unknown frequency, respectively. After a brief development of the\nmathematics, two simple examples are provided: (1) position and velocity\nestimation of a vocalizing dolphin emitting an acoustic signal and (2) initial\norbit determination of a satellite emitting an electromagnetic signal.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 20:58:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mancini","Michela",""],["Leykin","Anton",""],["Christian","John A.",""]]}
{"id":"2308.05224","submitter":"Devansh Saxena","authors":"Devansh Saxena and Shion Guha","title":"Algorithmic Harms in Child Welfare: Uncertainties in Practice,\n  Organization, and Street-level Decision-Making","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Algorithms in public services such as child welfare, criminal justice, and\neducation are increasingly being used to make high-stakes decisions about human\nlives. Drawing upon findings from a two-year ethnography conducted at a child\nwelfare agency, we highlight how algorithmic systems are embedded within a\ncomplex decision-making ecosystem at critical points of the child welfare\nprocess. Caseworkers interact with algorithms in their daily lives where they\nmust collect information about families and feed it to algorithms to make\ncritical decisions. We show how the interplay between systemic mechanics and\nalgorithmic decision-making can adversely impact the fairness of the\ndecision-making process itself. We show how functionality issues in algorithmic\nsystems can lead to process-oriented harms where they adversely affect the\nnature of professional practice, and administration at the agency, and lead to\ninconsistent and unreliable decisions at the street level. In addition,\ncaseworkers are compelled to undertake additional labor in the form of repair\nwork to restore disrupted administrative processes and decision-making, all\nwhile facing organizational pressures and time and resource constraints.\nFinally, we share the case study of a simple algorithmic tool that centers\ncaseworkers' decision-making within a trauma-informed framework and leads to\nbetter outcomes, however, required a significant amount of investments on the\nagency's part in creating the ecosystem for its proper use.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:01:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Saxena","Devansh",""],["Guha","Shion",""]]}
{"id":"2308.05225","submitter":"Na Young Ahn","authors":"Na Young Ahn, Dong Hoon Lee","title":"IoT Security: On-Chip Secure Deletion Scheme using ECC Modulation in IoT\n  Appliances","comments":"Available online 2 August 2023","journal-ref":"Computers & Security, 2023","doi":"10.1016/j.cose.2023.103422","report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  NAND flash memory-based IoT devices inherently suffer from data retention\nissues. In IoT security, these retention issues are significant and require a\nrobust solution for secure deletion. Secure deletion methods can be categorized\ninto off-chip and on-chip schemes. Off-chip secure deletion schemes, based on\nblock-level erasure operations, are unable to perform real-time trim\noperations. Consequently, they are vulnerable to hacking threats. On the other\nhand, on-chip secure deletion schemes enable real-time trim operations by\nperforming deletion on a page-by-page basis. However, the on-chip scheme\nintroduces a challenge of program disturbance for neighboring page data. The\nproposed on-chip deletion scheme tackles this problem by utilizing ECC code\nmodulation through a partial program operation. This approach significantly\nreduces the program disturbance issue associated with neighboring page data.\nMoreover, the proposed code modulation secure deletion scheme allows for\nreal-time verification of the deletion of original data.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:07:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ahn","Na Young",""],["Lee","Dong Hoon",""]]}
{"id":"2308.05226","submitter":"Xianxin Guo","authors":"James Spall, Xianxin Guo, A. I. Lvovsky","title":"Training neural networks with end-to-end optical backpropagation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optics is an exciting route for the next generation of computing hardware for\nmachine learning, promising several orders of magnitude enhancement in both\ncomputational speed and energy efficiency. However, to reach the full capacity\nof an optical neural network it is necessary that the computing not only for\nthe inference, but also for the training be implemented optically. The primary\nalgorithm for training a neural network is backpropagation, in which the\ncalculation is performed in the order opposite to the information flow for\ninference. While straightforward in a digital computer, optical implementation\nof backpropagation has so far remained elusive, particularly because of the\nconflicting requirements for the optical element that implements the nonlinear\nactivation function. In this work, we address this challenge for the first time\nwith a surprisingly simple and generic scheme. Saturable absorbers are employed\nfor the role of the activation units, and the required properties are achieved\nthrough a pump-probe process, in which the forward propagating signal acts as\nthe pump and backward as the probe. Our approach is adaptable to various analog\nplatforms, materials, and network structures, and it demonstrates the\npossibility of constructing neural networks entirely reliant on analog optical\nprocesses for both training and inference tasks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:11:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Spall","James",""],["Guo","Xianxin",""],["Lvovsky","A. I.",""]]}
{"id":"2308.05227","submitter":"Ha Thanh Hung","authors":"H.V. Quyet, T.T. Hieu, N.T. Tham, N.T.T. Hang and H. T. Hung","title":"Investigation of CP-even Higgs bosons decays $H \\rightarrow \\mu \\tau$\n  within constraints of $l_a \\rightarrow l_b \\gamma$ in a 3-3-1 model with\n  inverse seesaw neutrinos","comments":"33 pages, 34 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a 3-3-1 model with inverse seesaw neutrinos, we use a simple form of Higgs\npotential to give four CP-even Higgs bosons ($H \\equiv\nh^0_1,h^0_2,h^0_3,h^0_4$). We investigate $H \\rightarrow \\mu \\tau$ decays in\nthe parameter space regions satisfying the experimental limits of $l_a\n\\rightarrow l_b \\gamma$ with running parameters being the mass of the charged\nHiggs boson ($m_{H_1^\\pm}$) and the mixing matrix of the heavy neutrinos\n($M_R$). We show that there exist regions of parameter space where all partial\nwidths $\\Gamma (H \\rightarrow \\mu \\tau)$ are less than the current experimental\nlimit ($4.1 \\times 10^{-6} GeV$). Analyzing the contributing components to\n$\\Gamma (H \\rightarrow \\mu \\tau)$, we also compare the mass of the SM-like\nHiggs boson with the corresponding ones of the other CP-even Higgs bosons in\nthis model.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:15:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Quyet","H. V.",""],["Hieu","T. T.",""],["Tham","N. T.",""],["Hang","N. T. T.",""],["Hung","H. T.",""]]}
{"id":"2308.05228","submitter":"Wing Hong Tony Wong","authors":"Ryan Blau, Joshua Harrington, Sarah Lohrey, Eliel Sosis, Tony W. H.\n  Wong","title":"Arithmetic progressions of integers that are relatively prime to their\n  digital sums","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For an integer $b\\geq 2$, we call a positive integer $b$-anti-Niven if it is\nrelatively prime to the sum of the digits in its base-$b$ representation. In\nthis article, we investigate the maximum lengths of arithmetic progressions of\n$b$-anti-Niven numbers.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:21:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Blau","Ryan",""],["Harrington","Joshua",""],["Lohrey","Sarah",""],["Sosis","Eliel",""],["Wong","Tony W. H.",""]]}
{"id":"2308.05229","submitter":"Fernanda Pambianco","authors":"J\\\"urgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco","title":"An asymptotic property of quaternary additive codes","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive\n$[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining\nthe limsup $\\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that\n$n_k(s)/s=\\lambda_k.$ The proof uses geometric language and is elementary.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:22:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bierbrauer","J\u00fcrgen",""],["Marcugini","Stefano",""],["Pambianco","Fernanda",""]]}
{"id":"2308.05230","submitter":"Geeta Yadav","authors":"Anuradha Gupta, Geeta Yadav","title":"Generalized Weighted Composition Operators on Vector-Valued Weighted\n  Bergman Space","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this research article the necessary and sufficient conditions for the norm\nof composition operator $C_{\\Phi}$ on $\\mathcal{A}_{\\alpha}^2(H)$ to be one are\nobtained. Moreover, $C_{\\Phi}$ is unitary on $\\mathcal{A}_{\\alpha}^2(H)$ if and\nonly if it is co-isometry. The necessary and sufficient condition for Hermitian\nand normal composition operators on $\\mathcal{A}_{\\alpha}^2(H)$ are also\nexplored. Also, the characterization for boundeness of generalized weighted\ncomposition operator is obtained under some condition on $\\Phi.$\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:26:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gupta","Anuradha",""],["Yadav","Geeta",""]]}
{"id":"2308.05231","submitter":"Shrobona Bagchi","authors":"Shrobona Bagchi","title":"A review on the questions of spin and spin quantum correlations in the\n  relativistic regime","comments":"14 pages, Review article","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Quantum correlations are one of the most important aspects of the modern day\nquantum information and computation theory. However, the majority of\nunderstanding of the quantum correlations is in the field of non-relativistic\nquantum mechanics. To develop the quantum information and computation tasks\nfully, one must inevitably take into account the relativistic effects. In this\nregard, the spin is one of the central tools to implement these qubit\noperations in almost all quantum information processing tasks. For this\npurpose, it is of paramount importance to understand and characterize fully the\ntheory of spin in relativistic quantum mechanics and relativistic quantum\ninformation theory where the spin states act as qubit. This area is still far\nfrom being resolved as a current state of art. As a result, this article will\nexplore the recent studies of the concepts of the spin and spin quantum\ncorrelations in inertial frames and some apparent paradoxes regarding this\nconcept. We will mainly focus on the problem of characterizing the concept of\nspin, reduced spin density matrices and consequently spin quantum correlations\nin inertial reference frames and the apparent paradoxes involved therein, yet\nto be verified experimentally. Another important aspect is the use of tools of\nquantum field theory to extend concepts in non-relativistic domain to\nrelativistic one. In this regard, we will analyze the development of the theory\nof relativistic secret sharing and a correlation measure namely the\nentanglement of purification. We will also explore how these developments may\nbe mapped to quantum information processing task and discuss the future\npromises.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:29:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bagchi","Shrobona",""]]}
{"id":"2308.05232","submitter":"Meng Wei","authors":"Meng Wei, Charlie Budd, Luis C. Garcia-Peraza-Herrera, Reuben Dorent,\n  Miaojing Shi, Tom Vercauteren","title":"SegMatch: A semi-supervised learning method for surgical instrument\n  segmentation","comments":"preprint under review, 12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Surgical instrument segmentation is recognised as a key enabler to provide\nadvanced surgical assistance and improve computer assisted interventions. In\nthis work, we propose SegMatch, a semi supervised learning method to reduce the\nneed for expensive annotation for laparoscopic and robotic surgical images.\nSegMatch builds on FixMatch, a widespread semi supervised classification\npipeline combining consistency regularization and pseudo labelling, and adapts\nit for the purpose of segmentation. In our proposed SegMatch, the unlabelled\nimages are weakly augmented and fed into the segmentation model to generate a\npseudo-label to enforce the unsupervised loss against the output of the model\nfor the adversarial augmented image on the pixels with a high confidence score.\nOur adaptation for segmentation tasks includes carefully considering the\nequivariance and invariance properties of the augmentation functions we rely\non. To increase the relevance of our augmentations, we depart from using only\nhandcrafted augmentations and introduce a trainable adversarial augmentation\nstrategy. Our algorithm was evaluated on the MICCAI Instrument Segmentation\nChallenge datasets Robust-MIS 2019 and EndoVis 2017. Our results demonstrate\nthat adding unlabelled data for training purposes allows us to surpass the\nperformance of fully supervised approaches which are limited by the\navailability of training data in these challenges. SegMatch also outperforms a\nrange of state-of-the-art semi-supervised learning semantic segmentation models\nin different labelled to unlabelled data ratios.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:30:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wei","Meng",""],["Budd","Charlie",""],["Garcia-Peraza-Herrera","Luis C.",""],["Dorent","Reuben",""],["Shi","Miaojing",""],["Vercauteren","Tom",""]]}
{"id":"2308.05233","submitter":"Zhiqing Zhang","authors":"BABAR Collaboration","title":"Study of additional radiation in the initial-state-radiation processes\n  $e^+e^-\\to \\mu^+\\mu^-\\gamma$ and $e^+e^-\\to \\pi^+\\pi^-\\gamma$ in the BABAR\n  experiment","comments":"6 pages, 3 figures and 1 table, plus 2 additional plots for\n  supplementary material","journal-ref":null,"doi":null,"report-no":"BABAR-PUB-23/005, SLAC-PUB-17736","categories":"hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A dedicated study of additional radiation in $e^+e^-\\to \\mu^+\\mu^-\\gamma$ and\n$e^+e^-\\to \\pi^+\\pi^-\\gamma$ initial-state-radiation events is presented using\nthe full BABAR data sample. Results are presented at next-to- and\nnext-to-next-to-leading order, with one and two additional photons,\nrespectively, for radiation from the initial and final states. Comparison with\npredictions from Phokhara and AfkQed Monte Carlo generators is performed,\nrevealing discrepancies in the one-photon rates and angular distributions for\nthe former. This disagreement has a negligible effect on the BABAR measurement\nof the $e^+e^-\\to \\pi^+\\pi^-(\\gamma)$ cross section, but may affect other\nmeasurements significantly.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:32:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["BABAR Collaboration","",""]]}
{"id":"2308.05234","submitter":"Faisal Hawlader","authors":"Faisal Hawlader, Fran\\c{c}ois Robinet, and Rapha\\\"el Frank","title":"Leveraging the Edge and Cloud for V2X-Based Real-Time Object Detection\n  in Autonomous Driving","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.DC cs.LG cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Environmental perception is a key element of autonomous driving because the\ninformation received from the perception module influences core driving\ndecisions. An outstanding challenge in real-time perception for autonomous\ndriving lies in finding the best trade-off between detection quality and\nlatency. Major constraints on both computation and power have to be taken into\naccount for real-time perception in autonomous vehicles. Larger object\ndetection models tend to produce the best results, but are also slower at\nruntime. Since the most accurate detectors cannot run in real-time locally, we\ninvestigate the possibility of offloading computation to edge and cloud\nplatforms, which are less resource-constrained. We create a synthetic dataset\nto train object detection models and evaluate different offloading strategies.\nUsing real hardware and network simulations, we compare different trade-offs\nbetween prediction quality and end-to-end delay. Since sending raw frames over\nthe network implies additional transmission delays, we also explore the use of\nJPEG and H.265 compression at varying qualities and measure their impact on\nprediction metrics. We show that models with adequate compression can be run in\nreal-time on the cloud while outperforming local detection performance.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:39:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hawlader","Faisal",""],["Robinet","Fran\u00e7ois",""],["Frank","Rapha\u00ebl",""]]}
{"id":"2308.05235","submitter":"Ali Jamali","authors":"Ali Jamali, Swalpa Kumar Roy, Danfeng Hong, Peter M Atkinson, Pedram\n  Ghamisi","title":"Spatial Gated Multi-Layer Perceptron for Land Use and Land Cover Mapping","comments":"Submitted in IEEE","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Convolutional Neural Networks (CNNs) are models that are utilized extensively\nfor the hierarchical extraction of features. Vision transformers (ViTs),\nthrough the use of a self-attention mechanism, have recently achieved superior\nmodeling of global contextual information compared to CNNs. However, to realize\ntheir image classification strength, ViTs require substantial training\ndatasets. Where the available training data are limited, current advanced\nmulti-layer perceptrons (MLPs) can provide viable alternatives to both deep\nCNNs and ViTs. In this paper, we developed the SGU-MLP, a learning algorithm\nthat effectively uses both MLPs and spatial gating units (SGUs) for precise\nland use land cover (LULC) mapping. Results illustrated the superiority of the\ndeveloped SGU-MLP classification algorithm over several CNN and CNN-ViT-based\nmodels, including HybridSN, ResNet, iFormer, EfficientFormer and CoAtNet. The\nproposed SGU-MLP algorithm was tested through three experiments in Houston,\nUSA, Berlin, Germany and Augsburg, Germany. The SGU-MLP classification model\nwas found to consistently outperform the benchmark CNN and CNN-ViT-based\nalgorithms. For example, for the Houston experiment, SGU-MLP significantly\noutperformed HybridSN, CoAtNet, Efficientformer, iFormer and ResNet by\napproximately 15%, 19%, 20%, 21%, and 25%, respectively, in terms of average\naccuracy. The code will be made publicly available at\nhttps://github.com/aj1365/SGUMLP\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:39:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jamali","Ali",""],["Roy","Swalpa Kumar",""],["Hong","Danfeng",""],["Atkinson","Peter M",""],["Ghamisi","Pedram",""]]}
{"id":"2308.05236","submitter":"Navketan Batra","authors":"Navketan Batra, Zezhu Wei, Smitha Vishveshwara, D. E. Feldman","title":"Anyonic Mach-Zehnder interferometer on a single edge of a 2D electron\n  gas","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anyonic Fabry-P\\'erot and Mach-Zehnder interferometers have been proposed\ntheoretically and implemented experimentally as tools to probe electric charges\nand statistics of anyons. The experimentally observed visibility of\nAharonov-Bohm oscillations is maximal at a high transmission through an\ninterferometer but simple theoretical expressions for the electric currents and\nnoises are only available at low visibility. We consider an alternative version\nof a Mach-Zehnder interferometer, in which anyons tunnel between co-propagating\nchiral channels on the edges of quantum Hall liquids at the filling factors\n$n/(2n+1)$. We find simple exact solutions for any transmission. The solutions\nallow a straight-forward interpretation in terms of fractional charges and\nstatistics.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:46:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Batra","Navketan",""],["Wei","Zezhu",""],["Vishveshwara","Smitha",""],["Feldman","D. E.",""]]}
{"id":"2308.05237","submitter":"Nouhaila Innan","authors":"Nouhaila Innan, Muhammad Al-Zafar Khan, and Mohamed Bennai","title":"Financial Fraud Detection: A Comparative Study of Quantum Machine\n  Learning Models","comments":"30 pages, 15 figures, and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG q-fin.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this research, a comparative study of four Quantum Machine Learning (QML)\nmodels was conducted for fraud detection in finance. We proved that the Quantum\nSupport Vector Classifier model achieved the highest performance, with F1\nscores of 0.98 for fraud and non-fraud classes. Other models like the\nVariational Quantum Classifier, Estimator Quantum Neural Network (QNN), and\nSampler QNN demonstrate promising results, propelling the potential of QML\nclassification for financial applications. While they exhibit certain\nlimitations, the insights attained pave the way for future enhancements and\noptimisation strategies. However, challenges exist, including the need for more\nefficient Quantum algorithms and larger and more complex datasets. The article\nprovides solutions to overcome current limitations and contributes new insights\nto the field of Quantum Machine Learning in fraud detection, with important\nimplications for its future development.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:47:50 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Innan","Nouhaila",""],["Khan","Muhammad Al-Zafar",""],["Bennai","Mohamed",""]]}
{"id":"2308.05238","submitter":"Jason Francis Parisi","authors":"J. F. Parisi and W. Guttenfelder and A. O. Nelson and R. Gaur and A.\n  Kleiner and M. Lampert and G. Avdeeva and J. W. Berkery and C. Clauser and M.\n  Curie and A. Diallo and W. Dorland and J. McClenaghan","title":"Kinetic-Ballooning-Limited Pedestals in Spherical Tokamak 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":"  A theoretical model is presented that for the first time matches experimental\nmeasurements of the pedestal width-height Diallo scaling in the\nlow-aspect-ratio high-$\\beta$ tokamak NSTX. Combining linear gyrokinetics with\nself-consistent pedestal equilibrium variation, kinetic-ballooning, rather than\nideal-ballooning plasma instability, is shown to limit achievable confinement\nin spherical tokamak pedestals. Simulations are used to find the novel\nGyrokinetic Critical Pedestal constraint, which determines the steepest\npressure profile a pedestal can sustain subject to gyrokinetic instability.\nGyrokinetic width-height scaling expressions for NSTX pedestals with varying\ndensity and temperature profiles are obtained. These scalings for spherical\ntokamaks depart significantly from that of conventional aspect ratio tokamaks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:49:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Parisi","J. F.",""],["Guttenfelder","W.",""],["Nelson","A. O.",""],["Gaur","R.",""],["Kleiner","A.",""],["Lampert","M.",""],["Avdeeva","G.",""],["Berkery","J. W.",""],["Clauser","C.",""],["Curie","M.",""],["Diallo","A.",""],["Dorland","W.",""],["McClenaghan","J.",""]]}
{"id":"2308.05239","submitter":"Armin Moin","authors":"Armin Moin, Atta Badii, Stephan G\\\"unnemann, Moharram Challenger","title":"AI-Enabled Software and System Architecture Frameworks: Focusing on\n  smart Cyber-Physical Systems (CPS)","comments":"Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Several architecture frameworks for software, systems, and enterprises have\nbeen proposed in the literature. They identified various stakeholders and\ndefined architecture viewpoints and views to frame and address stakeholder\nconcerns. However, the stakeholders with data science and Machine Learning (ML)\nrelated concerns, such as data scientists and data engineers, are yet to be\nincluded in existing architecture frameworks. Therefore, they failed to address\nthe architecture viewpoints and views responsive to the concerns of the data\nscience community. In this paper, we address this gap by establishing the\narchitecture frameworks adapted to meet the requirements of modern applications\nand organizations where ML artifacts are both prevalent and crucial. In\nparticular, we focus on ML-enabled Cyber-Physical Systems (CPSs) and propose\ntwo sets of merit criteria for their efficient development and performance\nassessment, namely the criteria for evaluating and benchmarking ML-enabled\nCPSs, and the criteria for evaluation and benchmarking of the tools intended to\nsupport users through the modeling and development pipeline. In this study, we\ndeploy multiple empirical and qualitative research methods based on literature\nreview and survey instruments including expert interviews and an online\nquestionnaire. We collect, analyze, and integrate the opinions of 77 experts\nfrom more than 25 organizations in over 10 countries to devise and validate the\nproposed framework.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:54:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Moin","Armin",""],["Badii","Atta",""],["G\u00fcnnemann","Stephan",""],["Challenger","Moharram",""]]}
{"id":"2308.05240","submitter":"Yohei Fujishima","authors":"Yohei Fujishima, Kotaro Hisa, Kazuhiro Ishige, Robert Laister","title":"Local solvability and dilation-critical singularities of supercritical\n  fractional heat equations","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 Cauchy problem for fractional semilinear heat equations with\nsupercritical nonlinearities and establish both necessary conditions and\nsufficient conditions for local-in-time solvability. We introduce the notion of\na dilation-critical singularity (DCS) of the initial data and show that such\nsingularities always exist for a large class of supercritical nonlinearities.\nMoreover, we provide exact formulae for such singularities.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:57:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fujishima","Yohei",""],["Hisa","Kotaro",""],["Ishige","Kazuhiro",""],["Laister","Robert",""]]}
{"id":"2308.05241","submitter":"Ricardo Ancheyta","authors":"Ricardo R. Ancheyta","title":"Vacuum radiation versus shortcuts to adiabaticity","comments":"7 pages, Accepted in Phys. Rev. A","journal-ref":"Phys. Rev. A 108, 022217 (2023)","doi":"10.1103/PhysRevA.108.022217","report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nonadiabatic dynamic of the electromagnetic field triggers photons\ngeneration from the quantum vacuum. Shortcuts to adiabaticity, instead, are\nprotocols that mimic the field's adiabatic dynamic in a finite time. Here, we\nshow how the counterdiabatic term of the transitionless tracking algorithm\ncancels out, exactly, the term responsible for the photon production in the\ndynamical Casimir effect. This result suggests that the energy of producing\nphotons out of the vacuum is related to the energetic cost of the shortcut.\nFurthermore, if the system operates under a quantum thermodynamic cycle, we\nconfirm the equivalence between the adiabatic and nonadiabatic work outputs.\nFinally, our study reveals that identifying these unreported observations can\nonly be possible using the so-called effective Hamiltonian approach.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:58:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ancheyta","Ricardo R.",""]]}
{"id":"2308.05242","submitter":"Luv Verma Mr.","authors":"Luv Verma, Varun Mohan","title":"Vector quantization loss analysis in VQGANs: a single-GPU ablation study\n  for image-to-image synthesis","comments":"16 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study performs an ablation analysis of Vector Quantized Generative\nAdversarial Networks (VQGANs), concentrating on image-to-image synthesis\nutilizing a single NVIDIA A100 GPU. The current work explores the nuanced\neffects of varying critical parameters including the number of epochs, image\ncount, and attributes of codebook vectors and latent dimensions, specifically\nwithin the constraint of limited resources. Notably, our focus is pinpointed on\nthe vector quantization loss, keeping other hyperparameters and loss components\n(GAN loss) fixed. This was done to delve into a deeper understanding of the\ndiscrete latent space, and to explore how varying its size affects the\nreconstruction. Though, our results do not surpass the existing benchmarks,\nhowever, our findings shed significant light on VQGAN's behaviour for a smaller\ndataset, particularly concerning artifacts, codebook size optimization, and\ncomparative analysis with Principal Component Analysis (PCA). The study also\nuncovers the promising direction by introducing 2D positional encodings,\nrevealing a marked reduction in artifacts and insights into balancing clarity\nand overfitting.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:02:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Verma","Luv",""],["Mohan","Varun",""]]}
{"id":"2308.05243","submitter":"Giulio Del Zanna","authors":"P.J. Storey, R.P. Dufresne, G. Del Zanna","title":"New atomic data for C I Rydberg states compared with solar UV spectra","comments":"submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the Breit Pauli $R$-matrix method to calculate accurate energies and\nradiative data for states in C I up to $n$=30 and with $l\\le 3$. We provide the\nfull dataset of decays to the five 2s$^2$2p$^2$ ground configuration states\n$^3$P$_{0,1,2}$, $^1$D$_2$, $^1$S$_0$. This is the first complete set of data\nfor transitions from $n\\ge 5$. We compare oscillator strengths and transition\nprobabilities with the few previously calculated values for such transitions,\nfinding generally good agreement (within 10%) with the exception of values\nrecently recommended by NIST, where significant discrepancies are found. We\nthen calculate spectral line intensities originating from the Rydberg states\nusing typical chromospheric conditions and assuming LTE, and compare them with\nwell-calibrated SOHO SUMER UV spectra of the quiet Sun. The relative\nintensities of the Rydberg series are in excellent agreement with observation,\nwhich provides firm evidence for the identifications and blends of nearly 200\nUV lines. Such comparison also resulted in a large number of new\nidentifications of C I lines in the spectra. We also estimate optical depth\neffects and find that these can account for much of the absorption noted in the\nobservations. The atomic data can be applied to model a wide range of solar and\nastrophysical observations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:24:30 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Storey","P. J.",""],["Dufresne","R. P.",""],["Del Zanna","G.",""]]}
{"id":"2308.05244","submitter":"Thomas Mejstrik","authors":"Thomas Mejstrik, Ulrich Reif","title":"Hybrid approach to the joint spectral radius computation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.MS cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we propose a modification to the invariant polytope algorithm\n(ipa) using ideas of the finite expressible tree algorithm (feta) by M\\\"oller\nand Reif. We show that our new feta-flavoured-ipa applies to a wider range of\nmatrix families.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:31:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mejstrik","Thomas",""],["Reif","Ulrich",""]]}
{"id":"2308.05245","submitter":"Daniel P. Arovas","authors":"Jyotsna Gidugu and Daniel P. Arovas","title":"A study of dissipative models based on Dirac matrices","comments":"19 pages, 22 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 generalize the recent work of Shibata and Katsura, who considered a S=1/2\nchain with alternating XX and YY couplings in the presence of dephasing, the\ndynamics of which are described by the GKLS master equation. Their model is\nequivalent to a non-Hermitian system described by the Kitaev formulation in\nterms of a single Majorana species hopping on a two-leg ladder in the presence\nof a nondynamical Z_2 gauge field. Our generalization involves Dirac gamma\nmatrix `spin' operators on the square lattice, and maps onto a non-Hermitian\nsquare lattice bilayer which is also Kitaev-solvable. We describe the\nexponentially many non-equilibrium steady states in this model. We identify how\nthe spin degrees of freedom can be accounted for in the 2d model in terms of\nthe gauge-invariant quantities and then proceed to study the Liouvillian\nspectrum. We use a genetic algorithm to estimate the Liouvillian gap and the\nfirst decay modes for large system sizes. We observe a transition in the first\ndecay modes, similar to that found by Shibata and Katsura. The results we\nobtain are consistent with a perturbative analysis for small and large values\nof the dissipation strength.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:33:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gidugu","Jyotsna",""],["Arovas","Daniel P.",""]]}
{"id":"2308.05246","submitter":"Isamiddin Rakhimov Prof.","authors":"D.Asrorov, U.Bekbaev, I.Rakhimov","title":"Description of all Frobenius algebra structures on two-dimensional\n  vector space over any basic field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the paper we classify all possible Frobenius algebra structures on\ntwo-dimensional vector space over any basic field. We give the lists of\ncanonical representatives of isomorphism classes, explicitly, over basic field\nwith the characteristics not 2,3, characteristic 2 and characteristic 3,\nrespectively.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:36:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Asrorov","D.",""],["Bekbaev","U.",""],["Rakhimov","I.",""]]}
{"id":"2308.05247","submitter":"Emiliano De Cristofaro","authors":"Mohammad Hammas Saeed, Kostantinos Papadamou, Jeremy Blackburn,\n  Emiliano De Cristofaro, Gianluca Stringhini","title":"TUBERAIDER: Attributing Coordinated Hate Attacks on YouTube Videos to\n  their Source Communities","comments":"Accepted for publication at the 18th International AAAI Conference on\n  Web and Social Media (ICWSM 2024). Please cite accordingly","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Alas, coordinated hate attacks, or raids, are becoming increasingly common\nonline. In a nutshell, these are perpetrated by a group of aggressors who\norganize and coordinate operations on a platform (e.g., 4chan) to target\nvictims on another community (e.g., YouTube). In this paper, we focus on\nattributing raids to their source community, paving the way for moderation\napproaches that take the context (and potentially the motivation) of an attack\ninto consideration. We present TUBERAIDER, an attribution system achieving over\n75% accuracy in detecting and attributing coordinated hate attacks on YouTube\nvideos. We instantiate it using links to YouTube videos shared on 4chan's /pol/\nboard, r/The_Donald, and 16 Incels-related subreddits. We use a peak detector\nto identify a rise in the comment activity of a YouTube video, which signals\nthat an attack may be occurring. We then train a machine learning classifier\nbased on the community language (i.e., TF-IDF scores of relevant keywords) to\nperform the attribution. We test TUBERAIDER in the wild and present a few case\nstudies of actual aggression attacks identified by it to showcase its\neffectiveness.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:41:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Saeed","Mohammad Hammas",""],["Papadamou","Kostantinos",""],["Blackburn","Jeremy",""],["De Cristofaro","Emiliano",""],["Stringhini","Gianluca",""]]}
{"id":"2308.05248","submitter":"Sadhan K Adhikari","authors":"Pardeep Kaur, Sandeep Gautam, S. K. Adhikari","title":"Quasi-one- and quasi-two-dimensional Bose-Fermi mixtures from weak\n  coupling to unitarity","comments":null,"journal-ref":"Eur. Phys. J. Plus (2023) 138:754","doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study ultracold superfluid Bose-Fermi mixtures in three dimensions, with\nstronger confinement along one or two directions, using a non-perturbative\nbeyond-mean-field model for bulk chemical potential valid along the\nweak-coupling to unitarity crossover. Although bosons are considered to be in a\nsuperfluid state, we consider two possibilities for the fermions --\nspin-polarized degenerate state and superfluid state. Simplified reduced\nanalytic lower-dimensional models are derived along the weak-coupling to\nunitarity crossover in quasi-one-dimensional (quasi-1D) and\nquasi-two-dimensional (quasi-2D) settings. The only parameters in these models\nare the constants of the beyond-mean-field Bose-Bose and Fermi-Fermi\nLee-Huang-Yang interactions and the respective universal Bertsch parameter at\nunitarity. In addition to the numerical results for a fully-trapped system, we\nalso present results for quasi-2D Bose-Fermi mixtures where one of the\ncomponents is untrapped but localized due to the interaction mediated by the\nother component. We demonstrate the validity of the reduced quasi-1D and\nquasi-2D models via a comparison of the numerical solutions for the ground\nstates obtained from the reduced models and the full three-dimensional (3D)\nmodel.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:46:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kaur","Pardeep",""],["Gautam","Sandeep",""],["Adhikari","S. K.",""]]}
{"id":"2308.05249","submitter":"Oscar Zapata","authors":"Carlos E. Yaguna and \\'Oscar Zapata","title":"A minimal model of fermion FIMP dark matter","comments":"20 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate a simple extension of the standard model (SM) in which the\ndark matter consists of a feebly interacting fermion (FIMP), charged under a\nnew $Z_4$ symmetry, that is produced in the early Universe by the freeze-in\nmechanism. The only other new particle included in the model is a singlet\nscalar, also charged under the $Z_4$, which couples to the fermion via Yukawa\ninteractions and to the SM Higgs. The model is truly minimal, as it admits just\nfive free parameters: two masses and three dimensionless couplings. Depending\non their values, the freeze-in mechanism can be realized in different ways,\neach characterized by its own production processes. For all of them, we\nnumerically study the relic density as a function of the free parameters of the\nmodel and determine the regions consistent with the dark matter constraint. Our\nresults show that this scenario is viable over a wide range of couplings and\ndark matter masses. This model, therefore, not only offers a novel solution to\nthe dark matter problem, but it also provides a minimal realization of\nfreeze-in for fermion dark matter.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:46:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yaguna","Carlos E.",""],["Zapata","\u00d3scar",""]]}
{"id":"2308.05250","submitter":"Peter Kosec","authors":"P. Kosec, D. Pasham, E. Kara and F. Tombesi","title":"Discovery of a variable multi-phase outflow in the X-ray-emitting tidal\n  disruption event ASASSN-20qc","comments":"Accepted for publication in ApJ. 12 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tidal disruption events (TDEs) are exotic transients that can lead to\ntemporary super-Eddington accretion onto a supermassive black hole. Such\naccretion mode is naturally expected to result in powerful outflows of ionized\nmatter. However, to date such an outflow has only been directly detected in the\nX-ray band in a single TDE, ASASSN-14li. This outflow has a low velocity of\njust a few 100 km/s, although there is also evidence for a second, ultra-fast\nphase. Here we present the detection of a low-velocity outflow in a second TDE,\nASASSN-20qc. The high-resolution X-ray spectrum reveals an array of narrow\nabsorption lines, each blueshifted by a few 100 km/s, which cannot be described\nby a single photo-ionization phase. For the first time, we confirm the\nmultiphase nature of a TDE outflow, with at least two phases and two distinct\nvelocity components. One highly ionized phase is outflowing at\n$910^{+90}_{-80}$ km/s, while a lower ionization component is blueshifted by\n$400_{-120}^{+100}$ km/s. We perform time-resolved analysis of the X-ray\nspectrum and detect that, surprisingly, the mildly ionized absorber strongly\nvaries in ionization parameter over the course of a single 60 ks observation,\nindicating that its distance from the black hole may be as low as 400\ngravitational radii. We discuss these findings in the context of TDEs and\ncompare this newly detected outflow with that of ASASSN-14li.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 22:50:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kosec","P.",""],["Pasham","D.",""],["Kara","E.",""],["Tombesi","F.",""]]}
{"id":"2308.05251","submitter":"Nobuyoshi Ohta","authors":"Andrei O. Barvinsky, Guilherme H. S. Camargo, Alexei E. Kalugin,\n  Nobuyoshi Ohta and Ilya L. Shapiro","title":"On the local term in the anomaly-induced action of Weyl quantum gravity","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The finite local nonconformal $R^2$-term emerges in in the one-loop effective\naction in the conformal model of quantum gravity based on the Weyl-squared\nclassical action. The simplest route for deriving this term is through the\nsurface-term divergence $\\square R$. The calculation of this term requires\nevaluating the contributions of the fourth-derivative tensor sector and of the\nnonminimal vector operators in the ghost and weight operator sectors. To ensure\nthe correctness of existing formulas, in the last case we derived (and\nconfirmed) the result using a new, specially developed technique of\ncalculations, based on the heat-kernel representation of the Euclidean Green\nfunctions and the method of universal functional traces. Unlike the quantum\nfield theory on a classical gravity background, in conformal quantum gravity,\nthe $R^2$-term cannot be removed by adding a finite local counterterm. Thus,\nthis term represents the genuine prediction of the theory.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:03:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Barvinsky","Andrei O.",""],["Camargo","Guilherme H. S.",""],["Kalugin","Alexei E.",""],["Ohta","Nobuyoshi",""],["Shapiro","Ilya L.",""]]}
{"id":"2308.05252","submitter":"Ranga-Ram Chary","authors":"D. L. Shupe, F. J. Masci, R. Chary, G. Helou, A. L. Faisst, R. M.\n  Cutri, T. Y. Brooke, J. A. Surace, K. A. Marsh","title":"Annotated Coadds: Concise Metrics for Characterizing Survey Cadence and\n  for Discovering Variable and Transient Sources","comments":"26 pages, 11 figures, PASP in press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In order to study transient phenomena in the Universe, existing and\nforthcoming imaging surveys are covering wide areas of sky repeatedly over\ntime, with a range of cadences, point spread functions, and depths. We describe\nhere a framework that allows an efficient search for different types of\ntime-varying astrophysical phenomena in current and future, large data\nrepositories. We first present a methodology to generate and store key survey\nparameters that enable researchers to determine if a survey, or a combination\nof surveys, allows specific time-variable astrophysical phenomena to be\ndiscovered. To facilitate further exploration of sources in regions of\ninterest, we then generate a few sample metrics that capture the essential\nbrightness characteristics of a sky pixel at a specific wavelength. Together,\nwe refer to these as \"annotated coadds\". The techniques presented here for\nWISE/NEOWISE-R data are sensitive to 10 percent brightness variations at around\n12th Vega magnitude at 4.5 microns wavelength. Application of the technique to\nZTF data also enabled the detection of 0.5 mag variability at 20 AB mag in the\nr-band. We demonstrate the capabilities of these metrics for different classes\nof sources: high proper-motion stars, periodic variable stars, and supernovae,\nand find that each metric has its advantages depending on the nature of\nvariability. We also present a data structure which will ease the search for\ntemporally varying phenomena in future surveys.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:09:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shupe","D. L.",""],["Masci","F. J.",""],["Chary","R.",""],["Helou","G.",""],["Faisst","A. L.",""],["Cutri","R. M.",""],["Brooke","T. Y.",""],["Surace","J. A.",""],["Marsh","K. A.",""]]}
{"id":"2308.05253","submitter":"Michael Cervia","authors":"Andrei Alexandru and Paulo F. Bedaque and Andrea Carosso and Michael\n  J. Cervia and Edison M. Murairi and Andy Sheng","title":"Fuzzy Gauge Theory for Quantum Computers","comments":"16 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-th nucl-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continuous gauge theories, because of their bosonic degrees of freedom, have\nan infinite-dimensional local Hilbert space. Encoding these degrees of freedom\non qubit-based hardware demands some sort of \"qubitization\" scheme, where one\napproximates the behavior of a theory while using only finitely many degrees of\nfreedom. We propose a novel qubitization strategy for gauge theories, called\n\"fuzzy gauge theory,\" building on the success of the fuzzy $\\sigma$-model in\nearlier work. We provide arguments that the fuzzy gauge theory lies in the same\nuniversality class as regular gauge theory, in which case its use would obviate\nthe need of any further limit besides the usual spatial continuum limit.\nFurthermore, we demonstrate that these models are relatively resource-efficient\nfor quantum simulations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:13:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Alexandru","Andrei",""],["Bedaque","Paulo F.",""],["Carosso","Andrea",""],["Cervia","Michael J.",""],["Murairi","Edison M.",""],["Sheng","Andy",""]]}
{"id":"2308.05254","submitter":"Caio Dadauto","authors":"Caio Vinicius Dadauto, Nelson Luis Saldanha da Fonseca and Ricardo da\n  Silva Torres","title":"Data-driven Intra-Autonomous Systems Graph Generator","comments":"12 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper introduces a novel deep-learning based generator of synthetic\ngraphs that represent intra-Autonomous System (AS) in the Internet, named\nDeep-generative graphs for the Internet (DGGI). It also presents a novel\nmassive dataset of real intra-AS graphs extracted from the project Internet\nTopology Data Kit (ITDK), called Internet Graphs (IGraphs). To create IGraphs,\nthe Filtered Recurrent Multi-level (FRM) algorithm for community extraction was\ndeveloped. It is shown that DGGI creates synthetic graphs which accurately\nreproduce the properties of centrality, clustering, assortativity, and node\ndegree. The DGGI generator overperforms existing Internet topology generators.\nOn average, DGGI improves the Maximum Mean Discrepancy (MMD) metric 84.4%,\n95.1%, 97.9%, and 94.7% for assortativity, betweenness, clustering, and node\ndegree, respectively.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:18:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dadauto","Caio Vinicius",""],["da Fonseca","Nelson Luis Saldanha",""],["Torres","Ricardo da Silva",""]]}
{"id":"2308.05255","submitter":"Aurel Bulgac","authors":"Aurel Bulgac","title":"Is the introduction of a fermion localization function justified?","comments":"7 pages","journal-ref":null,"doi":null,"report-no":"NT@UW-23-14","categories":"nucl-th cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Becke and Edgecombe suggested in 1990 a theoretical tool to describe electron\nlocalization in atoms and molecules, an idea which was borrowed by a large\nnumber of nuclear theorists since 2011 to describe nucleon localization in\nnuclear systems. I argue here that these arguments are highly questionable and\ncannot be used in interacting systems, where effects beyond the naive mean\nfield or the simple Hartree-Fock framework are important and the inclusion of\ncorrelations induced by particle interactions is necessary in order to\nintroduce such a localization function.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:29:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bulgac","Aurel",""]]}
{"id":"2308.05256","submitter":"Joel Klipfel","authors":"Karleigh Pine and Joel Klipfel and Jared Bennett and Nathaniel Bade\n  and Christian Manasseh","title":"Social Network Analysis and Validation of an Agent-Based Model","comments":"23 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DM cs.MA q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Agent-based models (ABMs) simulate the formation and evolution of social\nprocesses at a fundamental level by decoupling agent behavior from global\nobservations. In the case where ABM networks evolve over time as a result of\n(or in conjunction with) agent states, there is a need for understanding the\nrelationship between the dynamic processes and network structure. Social\nnetworks provide a natural set of tools for understanding the emergent\nrelationships of these systems. This work examines the utility of a collection\nof network comparison methods for the purpose of tracking network changes in an\nABM over time or between model parameters. Among the techniques examined is a\nnovel graph pseudometric based on heat content asymptotics, which have been\nshown to distinguish many isospectral graphs which are not isomorphic.\nAdditionally, we establish the use of observations about real-world networks\nfrom network science (e.g. fat-tailed degree distribution, small-world\nproperty) for ABM validation in the case where empirical population data is\nunavailable. These methods are all demonstrated on systematic perturbations of\nan original model simulating the formation of friendships in a population of\n20,000 agents in Cincinnati, OH.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:32:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pine","Karleigh",""],["Klipfel","Joel",""],["Bennett","Jared",""],["Bade","Nathaniel",""],["Manasseh","Christian",""]]}
{"id":"2308.05257","submitter":"Xumin Gao","authors":"Xumin Gao, Wenxin Xue, Callum Lennox, Mark Stevens, Junfeng Gao","title":"Advancing Early Detection of Virus Yellows: Developing a Hybrid\n  Convolutional Neural Network for Automatic Aphid Counting in Sugar Beet\n  Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aphids are efficient vectors to transmit virus yellows in sugar beet fields.\nTimely monitoring and control of their populations are thus critical to prevent\nthe large-scale outbreak of virus yellows. However, the manual counting of\naphids, which is the most common practice, is labor-intensive and\ntime-consuming. Additionally, two of the biggest challenges in aphid counting\nare that aphids are small objects and their density distributions are varied in\ndifferent areas of the field. To address these challenges, we proposed a hybrid\nautomatic aphid counting network architecture which integrates the detection\nnetwork and the density map estimation network. When the distribution density\nof aphids is low, it utilizes an improved Yolov5 to count aphids. Conversely,\nwhen the distribution density of aphids is high, its witches to CSRNet to count\naphids. To the best of our knowledge, this is the first framework integrating\nthe detection network and the density map estimation network for counting\ntasks. Through comparison experiments of counting aphids, it verified that our\nproposed approach outperforms all other methods in counting aphids. It achieved\nthe lowest MAE and RMSE values for both the standard and high-density aphid\ndatasets: 2.93 and 4.01 (standard), and 34.19 and 38.66 (high-density),\nrespectively. Moreover, the AP of the improved Yolov5 is 5% higher than that of\nthe original Yolov5. Especially for extremely small aphids and densely\ndistributed aphids, the detection performance of the improved Yolov5 is\nsignificantly better than the original Yolov5. This work provides an effective\nearly warning for the virus yellows risk caused by aphids in sugar beet fields,\noffering protection for sugar beet growth and ensuring sugar beet yield. The\ndatasets and project code are released at:\nhttps://github.com/JunfengGaolab/Counting-Aphids.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:36:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gao","Xumin",""],["Xue","Wenxin",""],["Lennox","Callum",""],["Stevens","Mark",""],["Gao","Junfeng",""]]}
{"id":"2308.05258","submitter":"Bernd Sturmfels","authors":"Fabian Faulstich, Bernd Sturmfels and Svala Sverrisd\\'ottir","title":"Algebraic Varieties in Quantum Chemistry","comments":"25 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop algebraic geometry for coupled cluster (CC) theory of quantum\nmany-body systems. The high-dimensional eigenvalue problems that encode the\nelectronic Schr\\\"odinger equation are approximated by a hierarchy of polynomial\nsystems at various levels of truncation. The exponential parametrization of the\neigenstates gives rise to truncation varieties. These generalize Grassmannians\nin their Pl\\\"ucker embedding. We explain how to derive Hamiltonians, we offer a\ndetailed study of truncation varieties and their CC degrees, and we present the\nstate of the art in solving the CC equations.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:36:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Faulstich","Fabian",""],["Sturmfels","Bernd",""],["Sverrisd\u00f3ttir","Svala",""]]}
{"id":"2308.05259","submitter":"Betania Campello Ms.","authors":"Betania S.C. Campello, Sarah BenAmor, Leonardo T. Duarte, Jo\\~ao\n  Marcos Travassos Romano","title":"Improving preference disaggregation in multicriteria decision making:\n  incorporating time series analysis and a multi-objective approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Preference disaggregation analysis (PDA) is a widely used approach in\nmulticriteria decision analysis that aims to extract preferential information\nfrom holistic judgments provided by decision makers. This paper presents an\noriginal methodological framework for PDA that addresses two significant\nchallenges in this field. Firstly, it considers the multidimensional structure\nof data to capture decision makers' preferences based on descriptive measures\nof the criteria time series, such as trend and average. This novel approach\nenables an understanding of decision makers' preferences in decision-making\nscenarios involving time series analysis, which is common in medium- to\nlong-term impact decisions. Secondly, the paper addresses the robustness issue\ncommonly encountered in PDA methods by proposing a multi-objective and Monte\nCarlo simulation approach. This approach enables the consideration of multiple\npreference models and provides a mechanism to converge towards the most likely\npreference model. The proposed method is evaluated using real data,\ndemonstrating its effectiveness in capturing preferences based on criteria and\ntime series descriptive measures. The multi-objective analysis highlights the\ngeneration of multiple solutions, and, under specific conditions, reveals the\npossibility of achieving convergence towards a single solution that represents\nthe decision maker's preferences.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:48:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Campello","Betania S. C.",""],["BenAmor","Sarah",""],["Duarte","Leonardo T.",""],["Romano","Jo\u00e3o Marcos Travassos",""]]}
{"id":"2308.05260","submitter":"Marco Jiralerspong","authors":"Marco Jiralerspong, Gauthier Gidel","title":"AI4GCC -- Track 3: Consumption and the Challenges of Multi-Agent RL","comments":"Presented at AI For Global Climate Cooperation Competition, 2023\n  (arXiv:cs/2307.06951)","journal-ref":null,"doi":null,"report-no":"AI4GCC/2023/track3/4","categories":"cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The AI4GCC competition presents a bold step forward in the direction of\nintegrating machine learning with traditional economic policy analysis. Below,\nwe highlight two potential areas for improvement that could enhance the\ncompetition's ability to identify and evaluate proposed negotiation protocols.\nFirstly, we suggest the inclusion of an additional index that accounts for\nconsumption/utility as part of the evaluation criteria. Secondly, we recommend\nfurther investigation into the learning dynamics of agents in the simulator and\nthe game theoretic properties of outcomes from proposed negotiation protocols.\nWe hope that these suggestions can be of use for future iterations of the\ncompetition/simulation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:52:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jiralerspong","Marco",""],["Gidel","Gauthier",""]]}
{"id":"2308.05261","submitter":"Wu-Zhong Guo","authors":"Wu-zhong Guo, Jiaju Zhang","title":"Sum rule for pseudo R\\'enyi entropy","comments":"4+8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  By generalizing the density matrix to a transition matrix between two states,\nrepresented as $|\\phi\\rangle$ and $|\\psi\\rangle$, one can define the pseudo\nentropy analogous to the entanglement entropy. In this paper, we derive an\noperator sum rule involving the reduced transition matrix and density matrix of\nthe superposition states of $|\\phi\\rangle$ and $|\\psi\\rangle$. As a special\napplication, we demonstrate that the pseudo R\\'enyi entropy is related to the\nR\\'enyi entropy of the superposition states. We provide a proof of the operator\nsum rule and verify its validity in both finite-dimensional systems and quantum\nfield theory. Our results have potential applications in physics, particularly\ninvolving off-diagonal matrix elements of local and non-local observables.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:53:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Guo","Wu-zhong",""],["Zhang","Jiaju",""]]}
{"id":"2308.05262","submitter":"Haoqing Li","authors":"Haoqing Li, Shuo Tang, Peng Wu, Pau Closas","title":"Robust Interference Mitigation techniques for Direct Position Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Global Navigation Satellite System (GNSS) is pervasive in navigation and\npositioning applications, where precise position and time referencing\nestimations are required. Conventional methods for GNSS positioning involve a\ntwo-step process, where intermediate measurements such as Doppler shift and\ntime delay of received GNSS signals are computed and then used to solve for the\nreceiver's position. Alternatively, Direct Position Estimation (DPE) was\nproposed to infer the position directly from the sampled signal without\nintermediate variables, yielding to superior levels of sensitivity and\noperation under challenging environments. However, the positioning resilience\nof DPE method is still under the threat of various interferences. Robust\nInterference Mitigation (RIM) processing has been studied and proved to be\nefficient against various interference in conventional two-step positioning\n(2SP) methods, and therefore worthy to be explored regarding its potential to\nenhance DPE. This article extends DPE methodology by incorporating RIM\nstrategies that address the increasing need to protect GNSS receivers against\nintentional or unintentional interferences, such as jamming signals, which can\ndeny GNSS-based positioning. RIM, which leverages robust statistics, was shown\nto provide competitive results in two-step approaches and is here employed in a\nhigh-sensitivity DPE framework with successful results. The article also\nprovides a quantification of the loss of efficiency of using RIM when no\ninterference is present and validates the proposed methodology on relevant\ninterference cases, while the approach can be used to mitigate other common\ninterference signals.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 23:59:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Haoqing",""],["Tang","Shuo",""],["Wu","Peng",""],["Closas","Pau",""]]}
{"id":"2308.05263","submitter":"David Frazier","authors":"David T. Frazier, Ryan Covey, Gael M. Martin and Donald Poskitt","title":"Solving the Forecast Combination Puzzle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate that the forecasting combination puzzle is a consequence of\nthe methodology commonly used to produce forecast combinations. By the\ncombination puzzle, we refer to the empirical finding that predictions formed\nby combining multiple forecasts in ways that seek to optimize forecast\nperformance often do not out-perform more naive, e.g. equally-weighted,\napproaches. In particular, we demonstrate that, due to the manner in which such\nforecasts are typically produced, tests that aim to discriminate between the\npredictive accuracy of competing combination strategies can have low power, and\ncan lack size control, leading to an outcome that favours the naive approach.\nWe show that this poor performance is due to the behavior of the corresponding\ntest statistic, which has a non-standard asymptotic distribution under the null\nhypothesis of no inferior predictive accuracy, rather than the {standard normal\ndistribution that is} {typically adopted}. In addition, we demonstrate that the\nlow power of such predictive accuracy tests in the forecast combination setting\ncan be completely avoided if more efficient estimation strategies are used in\nthe production of the combinations, when feasible. We illustrate these findings\nboth in the context of forecasting a functional of interest and in terms of\npredictive densities. A short empirical example {using daily financial returns}\nexemplifies how researchers can avoid the puzzle in practical settings.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:16:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Frazier","David T.",""],["Covey","Ryan",""],["Martin","Gael M.",""],["Poskitt","Donald",""]]}
{"id":"2308.05264","submitter":"Soumyaroop Nandi","authors":"Soumyaroop Nandi, Prem Natarajan, Wael Abd-Almageed","title":"TrainFors: A Large Benchmark Training Dataset for Image Manipulation\n  Detection and Localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The evaluation datasets and metrics for image manipulation detection and\nlocalization (IMDL) research have been standardized. But the training dataset\nfor such a task is still nonstandard. Previous researchers have used\nunconventional and deviating datasets to train neural networks for detecting\nimage forgeries and localizing pixel maps of manipulated regions. For a fair\ncomparison, the training set, test set, and evaluation metrics should be\npersistent. Hence, comparing the existing methods may not seem fair as the\nresults depend heavily on the training datasets as well as the model\narchitecture. Moreover, none of the previous works release the synthetic\ntraining dataset used for the IMDL task. We propose a standardized benchmark\ntraining dataset for image splicing, copy-move forgery, removal forgery, and\nimage enhancement forgery. Furthermore, we identify the problems with the\nexisting IMDL datasets and propose the required modifications. We also train\nthe state-of-the-art IMDL methods on our proposed TrainFors1 dataset for a fair\nevaluation and report the actual performance of these methods under similar\nconditions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:26:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nandi","Soumyaroop",""],["Natarajan","Prem",""],["Abd-Almageed","Wael",""]]}
{"id":"2308.05265","submitter":"Zhexian Li","authors":"Zhexian Li and Ketan Savla","title":"Output-feedback model predictive and model-free control for ramp\n  metering","comments":"10 pages, 4 figures","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 stability of freeway traffic flow under output-feedback ramp\nmetering in cases of incomplete information about the traffic flow state. We\npropose a set-membership estimation method for the cell transmission model with\ncapacity drops and design a model predictive controller accordingly. This\ncontroller has linear running and terminal costs in cell densities, and its\noutput comprises density measurements from a subset of the cells, e.g., through\nloop detectors or connected vehicles. For a line network, we provide sufficient\nconditions under which the traffic system is input-to-state stable, meaning the\nramp queue length remains bounded, on the control horizons, cost coefficients,\nand the inflows at the ramps. To further relax the requirement on exact\nknowledge of model parameters, we design a model-free controller that computes\nmetering rates directly from measurement data. In addition to the proposed\ncontrollers, we provide extensive simulations of other ramp metering algorithms\nin the literature as baselines for evaluating performance. Simulation results\nshow that traffic flow is unstable without ramp metering or with other ramp\nmetering methods under high inflows, congested initial conditions, and\nincomplete state measurements. In contrast, the designed model predictive and\nmodel-free controllers stabilize traffic flow and provide higher throughput\nwith measurements from an arbitrary subset of the cells.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:28:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Zhexian",""],["Savla","Ketan",""]]}
{"id":"2308.05266","submitter":"Karen Kheruntsyan","authors":"R. S. Watson and K. V. Kheruntsyan","title":"An interaction-driven quantum many-body engine enabled by atom-atom\n  correlations","comments":"8 pages, 3 figures, plus Supplemental Material (4 pages)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum heat engines are capable of utilizing uniquely quantum many-body\neffects to enhance the performance of classical engine cycles, implying a\nquantum advantage. Here we propose and investigate the performance of a quantum\nmany-body Otto cycle operating under a sudden interaction quench protocol, with\na one-dimensional (1D) Bose gas as a working fluid. We show that the very\noperation of this Otto cycle as an engine is enabled by atom-atom correlations\nin the system. These correlations are different from those in a classical ideal\ngas, and are a result of the interplay between quantum statistics,\ninterparticle interactions, and thermal fluctuations; extracting positive net\nwork from the system without such correlations would be impossible. We also\ndemonstrate how the performance of the engine can be further enhanced by\nallowing particle exchange between the system and the thermal reservoirs, in\naddition to heat exchange. We evaluate the performance of the engine using\napproximate analytic and exact thermodynamic Bethe ansatz results available for\nthe Lieb-Liniger model that describes the 1D Bose gas, but we emphasise that\nthe broad conclusions arrived at here are not limited to this particular model.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:35:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Watson","R. S.",""],["Kheruntsyan","K. V.",""]]}
{"id":"2308.05267","submitter":"Zhi-Cheng Wang","authors":"Zhi-Cheng Wang, Ye-Ting Shao, Yi-Qiang Lin, Shi-Jie Song, Bai-Zhuo Li,\n  Er-Jian Cheng, Shi-Yan Li, Qin-Qing Zhu, Zhi Ren and Guang-Han Cao","title":"Absence of superconductivity in electron-doped chromium pnictides\n  ThCrAsN$_{1-x}$O$_x$","comments":null,"journal-ref":"Phys. Rev. B 108, 064503 (2023)","doi":"10.1103/PhysRevB.108.064503","report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Theoretical studies predicted possible superconductivity in electron-doped\nchromium pnictides isostructural to their iron counterparts. Here, we report\nthe synthesis and characterization of a new ZrCuSiAs-type Cr-based compound\nThCrAsN, as well as its oxygen-doped variants. All samples of\nThCrAsN$_{1-x}$O$_x$ show metallic conduction, but no superconductivity is\nobserved above 30 mK even though the oxygen substitution reaches 75\\%. The\nmagnetic structure of ThCrAsN is determined to be G-type antiferromagnetic by\nmagnetization measurements and first-principles calculations jointly. The\ncalculations also indicate that the in-plane Cr--Cr direct interaction of\nThCrAsN is robust against the heavy electron doping. The calculated density of\nstates of the orbital occupations of Cr for ThCrAs(N,O) is strongly\nspin-polarized. Our results suggest the similarities between chromium pnictides\nand iron-based superconductors shouldn't be overestimated.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:47:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Zhi-Cheng",""],["Shao","Ye-Ting",""],["Lin","Yi-Qiang",""],["Song","Shi-Jie",""],["Li","Bai-Zhuo",""],["Cheng","Er-Jian",""],["Li","Shi-Yan",""],["Zhu","Qin-Qing",""],["Ren","Zhi",""],["Cao","Guang-Han",""]]}
{"id":"2308.05268","submitter":"Ilya Dumanski","authors":"Ilya Dumanski","title":"A geometric approach to Feigin-Loktev fusion product and cluster\n  relations in coherent Satake category","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math-ph math.AG math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a geometric realization of the Feigin-Loktev fusion product of\ngraded cyclic modules over the current algebra. This allows us to compute it in\nseveral new cases. We also relate the Feigin-Loktev fusion product to the\nconvolution of perverse coherent sheaves on the affine Grassmannian of the\nadjoint group. This relation allows us to establish the existence of exact\ntriples, corresponding to cluster relations in the Grothendieck ring of\ncoherent Satake category.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:58:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dumanski","Ilya",""]]}
{"id":"2308.05269","submitter":"Satwinder Singh PhD","authors":"Satwinder Singh and Feng Hou and Ruili Wang","title":"A Novel Self-training Approach for Low-resource Speech Recognition","comments":"Accepted to Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we propose a self-training approach for automatic speech\nrecognition (ASR) for low-resource settings. While self-training approaches\nhave been extensively developed and evaluated for high-resource languages such\nas English, their applications to low-resource languages like Punjabi have been\nlimited, despite the language being spoken by millions globally. The scarcity\nof annotated data has hindered the development of accurate ASR systems,\nespecially for low-resource languages (e.g., Punjabi and M\\=aori languages). To\naddress this issue, we propose an effective self-training approach that\ngenerates highly accurate pseudo-labels for unlabeled low-resource speech. Our\nexperimental analysis demonstrates that our approach significantly improves\nword error rate, achieving a relative improvement of 14.94% compared to a\nbaseline model across four real speech datasets. Further, our proposed approach\nreports the best results on the Common Voice Punjabi dataset.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:02:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Singh","Satwinder",""],["Hou","Feng",""],["Wang","Ruili",""]]}
{"id":"2308.05270","submitter":"Kleinner Farias","authors":"Luan Lazzari, Kleinner Farias","title":"Uncovering the Hidden Potential of Event-Driven Architecture: A Research\n  Agenda","comments":"8 pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Event-driven architecture has been widely adopted in the software industry,\nemerging as an alternative to modular development to support rapid adaptations\nof constantly evolving systems. However, little is known about the effects of\nevent-driven architecture on performance, stability, and software monitoring,\namong others. Consequently, professionals end up adopting it without any\nempirical evidence about its impact. Even worse, the current literature lacks\nstudies that point to which emerging research directions need to be explored.\nThis article proposes an agenda for future research based on the scarcity of\nliterature in the field of event-oriented architecture. This agenda was derived\nfrom a literature review and a case study carried out, as well as from the\nauthors' experience. Eight main topics were explored in this work: performance\nanalysis, empirical studies, architectural stability, challenges to adopting,\nmonitoring event streams, effects on software performance, broader challenges\nfor adoption, and better monitoring of event-driven architecture. The findings\nreported help the researchers and developers in prioritizing the critical\ndifficulties for uncovering the hidden potential of event-driven architecture.\nFinally, this article seeks to help researchers and professionals by proposing\nan agenda as a starting point for their research.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:03:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lazzari","Luan",""],["Farias","Kleinner",""]]}
{"id":"2308.05271","submitter":"Takeru Utsugi","authors":"Takeru Utsugi, Takuma Kuno, Noriyuki Lee, Ryuta Tsuchiya, Toshiyuki\n  Mine, Digh Hisamoto, Shinichi Saito, and Hiroyuki Mizuno","title":"Single electron routing in a silicon quantum-dot array","comments":"10 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ability to transport single electrons on a quantum dot array dramatically\nincreases the freedom in designing quantum computation schemes that can be\nimplemented on solid-state devices. So far, however, routing schemes to\nprecisely control the transport paths of single electrons have yet to be\nestablished. Here, we propose a silicon single-electron router that transports\npumped electrons along the desired route on the branches of a T-shaped quantum\ndot array by inputting a synchronous phase-controlled signal to multiple gates.\nNotably, we show that it is possible to achieve a routing accuracy above 99% by\nimplementing assist gates in front of the branching paths. The results suggest\nnew possibilities for fast and accurate transport of single electrons on\nquantum dot arrays.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:18:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Utsugi","Takeru",""],["Kuno","Takuma",""],["Lee","Noriyuki",""],["Tsuchiya","Ryuta",""],["Mine","Toshiyuki",""],["Hisamoto","Digh",""],["Saito","Shinichi",""],["Mizuno","Hiroyuki",""]]}
{"id":"2308.05272","submitter":"Yousef El Hasadi","authors":"Yousef El Hasadi and Johan Padding","title":"A Generalized Model for Predicting the Drag Coefficient of Arbitrary\n  Bluff Shaped Bodies at High Reynolds Numbers","comments":"72 pages, and 17 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose an accurate model for the drag coefficient of arbitrary bluff\nbodies that is valid for high Reynolds numbers ($Re$). The model is based on\nthe drag coefficient model derived for the case of a sphere:, $C_D = a_1\n+{\\frac{K a_2}{Re}} +{a_3\\log(Re)+ a_4\\log^2(Re) + a_5\\log^4(Re)}$ (El Hasadi\nand Padding, Chemical Engineering Science, Vol. 265, 2023). The coefficients\n$a_2$, $a_3$, $a_4$, and $a_5$ do not depend on the object's shape or its\norientation with respect to the flow, and $K$ is the Stokes drag correction\nfactor, which for the case of the sphere, is equal to 1.0. The shape and\norientation effects are included in the value of $a_1$ for the high Reynolds\nnumber flow regime. Interestingly, we found a strong correlation between the\nvalue of the $a_1$ coefficient and the frictional drag derived from boundary\nlayer theory. One of the main findings of this investigation is that the rate\nof change of the drag coefficient with respect to the Reynolds number in the\ninertial flow regime is independent of the shape of the body or its\norientation. Our model successfully predicts, with acceptable accuracy, the\nhistorical data of Wieselsberger (Technical Report, 1922) for the case of an\ninfinite cylinder. Additionally, the model predicts the drag coefficient of\nother bluff body geometries such as oblate and prolate spheroids,\nspherocylinders, cubes, normal flat plates and irregular non-spherical\nparticles.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:19:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hasadi","Yousef El",""],["Padding","Johan",""]]}
{"id":"2308.05273","submitter":"Yu Komatsu","authors":"Yu Komatsu, Kenji Furuya","title":"The Automated Reaction-Pathway Search reveals the Energetically\n  Favorable Synthesis of Interstellar CH3OCH3 and HCOOCH3","comments":"Accepted in ACS Earth Space Chem. (22 pages, 7 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.EP physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent astronomical observations have shown that interstellar complex organic\nmolecules (COMs) exist even in cold environments ($\\sim$10 K), while various\ninterstellar COMs have conventionally been detected in the hot gas ($\\gtrsim$\n100 K) in the vicinity of high-mass and low-mass protostars. However, the\nformation pathway of each interstellar COM remains largely unclear. In this\nwork, we demonstrate that an automated reaction path search based on transition\nstate theory, which does not require predetermined pathways, is helpful for\ninvestigating the formation pathways of interstellar COMs in the gas phase. The\nexhaustive search within electronic ground states helps elucidate the complex\nchemical formation pathways of COMs at low temperatures. Here we examine the\nformation pathways of dimethyl ether (CH$_3$OCH$_3$) and methyl formate\n(HCOOCH$_3$), which are often detected in the cold and hot gas of star-forming\nregions. We have identified a barrierless and exothermic formation path of\nCH$_3$OCH$_3$ by reaction between neutral species; CH$_3$O + CH$_3$\n$\\rightarrow$ H$_2$CO $\\cdots$ CH$_4$ $\\rightarrow$ CH$_3$OCH$_3$ is the most\nefficient path in the large chemical network constructed by our automated\nreaction path search and is comparable with previous studies. For HCOOCH$_3$,\nwe obtain complex pathways initiated from reactions between neutral species;\nHCOO and CH$_3$ generate HCOOCH$_3$ and its isomers without external energy.\nHowever, we also identified the competing reaction branches producing CO$_2$ +\nCH$_4$ and CH$_3$COOH, which would be more efficient than the formation of\nHCOOCH$_3$. Then the gas-phase formation of HCOOCH$_3$ through reactions\nbetween neutral species would not be efficient compared to the CH3OCH$_3$\nformation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:24:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Komatsu","Yu",""],["Furuya","Kenji",""]]}
{"id":"2308.05274","submitter":"Xinyu Lyu","authors":"Xinyu Lyu, Jingwei Liu, Yuyu Guo, Lianli Gao","title":"Local-Global Information Interaction Debiasing for Dynamic Scene Graph\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":"  The task of dynamic scene graph generation (DynSGG) aims to generate scene\ngraphs for given videos, which involves modeling the spatial-temporal\ninformation in the video. However, due to the long-tailed distribution of\nsamples in the dataset, previous DynSGG models fail to predict the tail\npredicates. We argue that this phenomenon is due to previous methods that only\npay attention to the local spatial-temporal information and neglect the\nconsistency of multiple frames. To solve this problem, we propose a novel\nDynSGG model based on multi-task learning, DynSGG-MTL, which introduces the\nlocal interaction information and global human-action interaction information.\nThe interaction between objects and frame features makes the model more fully\nunderstand the visual context of the single image. Long-temporal human actions\nsupervise the model to generate multiple scene graphs that conform to the\nglobal constraints and avoid the model being unable to learn the tail\npredicates. Extensive experiments on Action Genome dataset demonstrate the\nefficacy of our proposed framework, which not only improves the dynamic scene\ngraph generation but also alleviates the long-tail problem.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:24:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lyu","Xinyu",""],["Liu","Jingwei",""],["Guo","Yuyu",""],["Gao","Lianli",""]]}
{"id":"2308.05275","submitter":"Pengfei Ding","authors":"Pengfei Ding and Yan Wang and Guanfeng Liu","title":"Cross-heterogeneity Graph Few-shot 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":"  In recent years, heterogeneous graph few-shot learning has been proposed to\naddress the label sparsity issue in heterogeneous graphs (HGs), which contain\nvarious types of nodes and edges. The existing methods have achieved good\nperformance by transferring generalized knowledge extracted from rich-labeled\nclasses in source HG(s) to few-labeled classes in a target HG. However, these\nmethods only consider the single-heterogeneity scenario where the source and\ntarget HGs share a fixed set of node/edge types, ignoring the more general\nscenario of cross-heterogeneity, where each HG can have a different and\nnon-fixed set of node/edge types. To this end, we focus on the unexplored\ncross-heterogeneity scenario and propose a novel model for Cross-heterogeneity\nGraph Few-shot Learning, namely CGFL. In CGFL, we first extract meta-patterns\nto capture heterogeneous information and propose a multi-view heterogeneous\ngraph neural network (MHGN) to learn meta-patterns across HGs. Then, we propose\na score module to measure the informativeness of labeled samples and determine\nthe transferability of each source HG. Finally, by integrating MHGN and the\nscore module into a meta-learning mechanism, CGFL can effectively transfer\ngeneralized knowledge to predict new classes with few-labeled data. Extensive\nexperiments on four real-world datasets have demonstrated the superior\nperformance of CGFL over the state-of-the-art methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:25:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ding","Pengfei",""],["Wang","Yan",""],["Liu","Guanfeng",""]]}
{"id":"2308.05276","submitter":"Hanseob Kim","authors":"Seonghoon Kang, Yechan Yang, Gerard Jounghyun Kim, Hanseob Kim","title":"BalanceVR: VR based Balance Training to Increase Tolerance to VR\n  Sickness","comments":"17 pages, 8 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Virtual reality or cyber-sickness is a serious usability problem. Postural\n(or balance) instability theory has emerged as one of the primary hypotheses\nfor the cause of VR sickness. In this paper, we conducted a two-week-long\nexperiment to observe the trends in user balance learning and sickness\ntolerance under different experimental conditions to analyze the potential\ninter-relationship between them. The experimental results have shown, aside\nfrom the obvious improvement in balance performance itself, that accompanying\nbalance training had a stronger effect of increasing tolerance to VR sickness\nthan mere exposure to VR. In addition, training in VR was found to be more\neffective than using the 2D-based medium, especially for the transfer effect to\nother non-training VR content.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:27:53 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 01:55:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kang","Seonghoon",""],["Yang","Yechan",""],["Kim","Gerard Jounghyun",""],["Kim","Hanseob",""]]}
{"id":"2308.05277","submitter":"Daniel C. McDonald","authors":"Daniel Cooper McDonald","title":"A note on Hadwiger's conjecture: Another proof that every 4-chromatic\n  graph has a $K_4$ minor","comments":"2 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first non-obvious case of Hadwiger's Conjecture states that every graph\n$G$ with chromatic number at least 4 has a $K_4$ minor. We give a new proof\nthat derives the $K_4$ minor from a proper 3-coloring of a subgraph of $G$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:35:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["McDonald","Daniel Cooper",""]]}
{"id":"2308.05278","submitter":"Jo\\~ao Carneiro","authors":"Paulo Trezentos, Ricardo Capote, Tiago Teodoro, Jo\\~ao Carneiro","title":"DCM: A Developers Certification Model for Mobile Ecosystems","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article introduces a distributed model of trust for app developers in\nAndroid and iOS mobile ecosystems. The model aims to allow the co-existence of\nmultiple app stores and distribution channels while retaining a high level of\nsafety for mobile device users and minimum changes to current mobile operating\nsystems. The Developers Certification Model (DCM) is a trust model for Android\nand iOS that aims to distinguish legit applications from security threats to\nuser safeness by answering the question: \"is the developer of this app\ntrustable\"? It proposes security by design, where safety relies on a chain of\ntrust mapping real-world levels of trust across organizations. For the\ntechnical implementation, DCM is heavily inspired by SSL/TLS certification\nprotocol, as a proven model that has been working for over 30 years.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:44:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Trezentos","Paulo",""],["Capote","Ricardo",""],["Teodoro","Tiago",""],["Carneiro","Jo\u00e3o",""]]}
{"id":"2308.05279","submitter":"Ruofan Chen","authors":"Ruofan Chen, Xiansong Xu, Chu Guo","title":"Grassmann Time-Evolving Matrix Product Operators for Quantum Impurity\n  Models","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The time-evolving matrix product operators (TEMPO) method, which makes full\nuse of the Feynman-Vernon influence functional, is the state-of-the-art tensor\nnetwork method for bosonic impurity problems. However, for fermionic impurity\nproblems the Grassmann path integral prohibits application of this method. We\ndevelop Grassmann time-evolving matrix product operators, a full fermionic\nanalog of TEMPO, that can directly manipulates Grassmann path integrals with\nsimilar numerical cost as the bosonic counterpart. We further propose a zipup\nalgorithm to compute expectation values on the fly without explicitly building\na single large augmented density tensor, which boosts the efficiency of our\nmethod on top of the vanilla TEMPO. We demonstrate our method on the\nnon-equilibrium dynamics of the single impurity Anderson models, and find a\nfavorable performance against existing tensor network influence functional\nmethods. Our method could significantly change the application landscape of\ntensor network based impurity solvers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:47:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Ruofan",""],["Xu","Xiansong",""],["Guo","Chu",""]]}
{"id":"2308.05280","submitter":"Ying Chen","authors":"Ying Chen, Zhenhua Chai, Baochang Shi","title":"A general fourth-order mesoscopic multiple-relaxation-time lattice\n  Boltzmann model and equivalent macroscopic finite-difference scheme for\n  two-dimensional diffusion equations","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 work, we first develop a general mesoscopic multiple-relaxation-time\nlattice Boltzmann (MRT-LB) model for the two-dimensional diffusion equation\nwith the constant diffusion coefficient and source term, where the D2Q5 (five\ndiscrete velocities in two-dimensional space) lattice structure is considered.\nThen we exactly derive the equivalent macroscopic finite-difference scheme of\nthe MRT-LB model. Additionally, we also propose a proper MRT-LB model for the\ndiffusion equation with a linear source term, and obtain an equivalent\nmacroscopic six-level finite-difference scheme. After that, we conduct the\naccuracy and stability analysis of the finite-difference scheme and the\nmesoscopic MRT-LB model. It is found that at the diffusive scaling, both of\nthem can achieve a fourth-order accuracy in space based on the Taylor\nexpansion. The stability analysis also shows that they are both unconditionally\nstable. Finally, some numerical experiments are conducted, and the numerical\nresults are also consistent with our theoretical analysis.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:49:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Ying",""],["Chai","Zhenhua",""],["Shi","Baochang",""]]}
{"id":"2308.05281","submitter":"Zihui Ma","authors":"Zihui Ma, Lingyao Li, Libby Hemphill, Gregory B. Baecher","title":"Investigating disaster response through social media data and the\n  Susceptible-Infected-Recovered (SIR) model: A case study of 2020 Western U.S.\n  wildfire season","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CL cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Effective disaster response is critical for affected communities. Responders\nand decision-makers would benefit from reliable, timely measures of the issues\nimpacting their communities during a disaster, and social media offers a\npotentially rich data source. Social media can reflect public concerns and\ndemands during a disaster, offering valuable insights for decision-makers to\nunderstand evolving situations and optimize resource allocation. We used\nBidirectional Encoder Representations from Transformers (BERT) topic modeling\nto cluster topics from Twitter data. Then, we conducted a temporal-spatial\nanalysis to examine the distribution of these topics across different regions\nduring the 2020 western U.S. wildfire season. Our results show that Twitter\nusers mainly focused on three topics:\"health impact,\" \"damage,\" and\n\"evacuation.\" We used the Susceptible-Infected-Recovered (SIR) theory to\nexplore the magnitude and velocity of topic diffusion on Twitter. The results\ndisplayed a clear relationship between topic trends and wildfire propagation\npatterns. The estimated parameters obtained from the SIR model in selected\ncities revealed that residents exhibited a high level of several concerns\nduring the wildfire. Our study details how the SIR model and topic modeling\nusing social media data can provide decision-makers with a quantitative\napproach to measure disaster response and support their decision-making\nprocesses.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:51:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ma","Zihui",""],["Li","Lingyao",""],["Hemphill","Libby",""],["Baecher","Gregory B.",""]]}
{"id":"2308.05282","submitter":"Qin Wang","authors":"Erya Jiang, Bo Qin, Qin Wang, Zhipeng Wang, Qianhong Wu, Jian Weng,\n  Xinyu Li, Chenyang Wang, Yuhang Ding, Yanran Zhang","title":"Decentralized Finance (DeFi): A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Decentralized Finance (DeFi) is a new paradigm in the creation, distribution,\nand utilization of financial services via the integration of blockchain\ntechnology. Our research conducts a comprehensive introduction and meticulous\nclassification of various DeFi applications. Beyond that, we thoroughly analyze\nthese risks from both technical and economic perspectives, spanning multiple\nlayers. Lastly, we point out research directions in DeFi, encompassing areas of\ntechnological advancements, innovative economics, and privacy optimization.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:59:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jiang","Erya",""],["Qin","Bo",""],["Wang","Qin",""],["Wang","Zhipeng",""],["Wu","Qianhong",""],["Weng","Jian",""],["Li","Xinyu",""],["Wang","Chenyang",""],["Ding","Yuhang",""],["Zhang","Yanran",""]]}
{"id":"2308.05283","submitter":"Oleg Utesov I.","authors":"Oleg I. Utesov and Arseny V. Syromyatnikov","title":"Ferromagnetic monolayer with interfacial Dzyaloshinskii-Moriya\n  interaction: magnon spectrum and effect of quenched disorder","comments":"14 pages, 6 pages","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 discuss theoretically a ferromagnetic monolayer with an interfacial\nDzyaloshinskii-Moriya interaction (iDMI) and a small axial anisotropy. It is\nshown that the system has a long-period cycloid magnetic order slightly\ndistorted by the anisotropy whose modulation vector $\\bf k$ can have several\norientations. We find that due to iDMI-induced umklapp terms in the\nHamiltonian, the spectrum of long-wavelength magnons is essentially\nanisotropic: it is linear and quadratic for momenta directed along and\nperpendicular to $\\bf k$, respectively. Due to such a quasi-1D spectrum, the\ntemperature correction to the mean spin value has a power-law singularity\nhampering the magnetic ordering at $T\\ne0$. We demonstrate that the umklapps\nlead to a peculiar band structure of the magnon spectrum similar to electronic\nbands in solids. We discuss also the effect of vacancies and defect bonds on\nsystem properties at $T=0$. Owing to the quasi-1D character of the spectrum,\nthe distortion of the cycloid structure by a single defect bond is described by\nthe field of 1D electric dipole. As a result, even infinitesimal concentrations\nof defects $c$ destroy the long-range order and establish a short-range order\nwhose correlation length shows a power-law dependence on $1/c$. Our findings\nshould also be applicable to ultra-thin films with strong enough iDMI.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:59:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Utesov","Oleg I.",""],["Syromyatnikov","Arseny V.",""]]}
{"id":"2308.05284","submitter":"Otoniel Nogueira da Silva","authors":"Juan Jos\\'e Nu\\~no-Ballesteros, Otoniel Nogueira da Silva and Jo\\~ao\n  Nivaldo Tomazella","title":"On invariants of a map germ from n-space to 2n-space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider $\\mathcal{A}$-finite map germs $f$ from $(\\mathbb{C}^n,0)$ to\n$(\\mathbb{C}^{2n},0)$. First, we show that the number of double points that\nappears in a stabilization of $f$, denoted by $d(f)$, can be calculated as the\nlength of the local ring of the double point set $D^2(f)$ of $f$, given by the\nMond's ideal. In the case where $n\\leq 3$ and $f$ is quasihomogeneous, we also\npresent a formula to calculate $d(f)$ in terms of the weights and degrees of\n$f$. Finally, we consider an unfolding $F(x,t) = (f_t(x),t)$ of $f$ and we find\na set of invariants whose constancy in the family $f_t$ is equivalent to the\nWhitney equisingularity of $F$. As an application, we present a formula to\ncalculate the Euler obstruction of the image of $f$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:01:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nu\u00f1o-Ballesteros","Juan Jos\u00e9",""],["da Silva","Otoniel Nogueira",""],["Tomazella","Jo\u00e3o Nivaldo",""]]}
{"id":"2308.05285","submitter":"Jungseek Hwang","authors":"Hwiwoo Park and Jungseek Hwang","title":"Fermi liquid-like behaviour of cuprates in the pseudogap phase simulated\n  via T-dependent electron-boson spectral density","comments":"22 pages, 8 figures","journal-ref":"Scientific Reports 13, 2527 (2023)","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 investigated the temperature- and frequency-dependent optical scattering\nrates in the pseudogap phase of cuprates using model pseudogap and\nelectron-boson spectral density (EBSD) functions. We obtained the scattering\nrates at various temperatures below and above a given pseudogap temperature\nusing a generalized Allen's (or Sharapov's) formula, which has been used to\nanalyse the measured optical spectra of correlated electron systems with a\nnon-constant density of states at finite temperatures. The pseudogap and EBSD\nfunctions should be temperature dependent to simulate the Fermi liquid-like\nbehaviour of underdoped cuprate systems observed in optical studies. Therefore,\nthe observed Fermi liquid-like behaviour can be understood by considering the\ncombined contribution from the T-dependent EBSD function and the T-dependent\npseudogap. We also obtained the optical conductivity spectra from the optical\nscattering rates and analyzed them to investigate intriguing electronic\nproperties. We expect that our results will aid in understanding the Fermi\nliquid-like optical response in the pseudogap phase and in revealing the\nmicroscopic pairing mechanism for superconductivity in cuprates.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:02:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Park","Hwiwoo",""],["Hwang","Jungseek",""]]}
{"id":"2308.05286","submitter":"Xinyu Lyu","authors":"Lianli Gao, Xinyu Lyu, Yuyu Guo, Yuxuan Hu, Yuan-Fang Li, Lu Xu, Heng\n  Tao Shen and Jingkuan Song","title":"Informative Scene Graph Generation via Debiasing","comments":"arXiv admin note: substantial text overlap with arXiv:2108.13129","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scene graph generation aims to detect visual relationship triplets, (subject,\npredicate, object). Due to biases in data, current models tend to predict\ncommon predicates, e.g. \"on\" and \"at\", instead of informative ones, e.g.\n\"standing on\" and \"looking at\". This tendency results in the loss of precise\ninformation and overall performance. If a model only uses \"stone on road\"\nrather than \"stone blocking road\" to describe an image, it may be a grave\nmisunderstanding. We argue that this phenomenon is caused by two imbalances:\nsemantic space level imbalance and training sample level imbalance. For this\nproblem, we propose DB-SGG, an effective framework based on debiasing but not\nthe conventional distribution fitting. It integrates two components: Semantic\nDebiasing (SD) and Balanced Predicate Learning (BPL), for these imbalances. SD\nutilizes a confusion matrix and a bipartite graph to construct predicate\nrelationships. BPL adopts a random undersampling strategy and an ambiguity\nremoving strategy to focus on informative predicates. Benefiting from the\nmodel-agnostic process, our method can be easily applied to SGG models and\noutperforms Transformer by 136.3%, 119.5%, and 122.6% on mR@20 at three SGG\nsub-tasks on the SGG-VG dataset. Our method is further verified on another\ncomplex SGG dataset (SGG-GQA) and two downstream tasks (sentence-to-graph\nretrieval and image captioning).\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:04:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gao","Lianli",""],["Lyu","Xinyu",""],["Guo","Yuyu",""],["Hu","Yuxuan",""],["Li","Yuan-Fang",""],["Xu","Lu",""],["Shen","Heng Tao",""],["Song","Jingkuan",""]]}
{"id":"2308.05287","submitter":"Lei Dai","authors":"Ruishu Liu, Xiaojie Wang, Lei Dai","title":"An unconditional boundary and dynamics preserving scheme for the\n  stochastic epidemic model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By combining a logarithm transformation with a corrected Milstein-type\nmethod, the present article proposes an explicit, unconditional boundary and\ndynamics preserving scheme for the stochastic susceptible-infected-susceptible\n(SIS) epidemic model that takes value in (0,N). The scheme applied to the model\nis first proved to have a strong convergence rate of order one. Further, the\ndynamic behaviors are analyzed for the numerical approximations and it is shown\nthat the scheme can unconditionally preserve both the domain and the dynamics\nof the model. More precisely, the proposed scheme gives numerical\napproximations living in the domain (0,N) and reproducing the extinction and\npersistence properties of the original model for any time discretization\nstep-size h > 0, without any additional requirements on the model parameters.\nNumerical experiments are presented to verify our theoretical results.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:07:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Ruishu",""],["Wang","Xiaojie",""],["Dai","Lei",""]]}
{"id":"2308.05288","submitter":"Helei Liu","authors":"Helei Liu, Yong Gao, Zhaosheng Li, Akira Dohi, Weiyang Wang, Guoliang\n  Lv and Renxin Xu","title":"EOS-dependent millihertz quasi-periodic oscillation in low-mass X-ray\n  binary","comments":"18 pages, 8 figures, 6 tables, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We studied the frequency and critical mass accretion rate of millihertz\nquasi-periodic oscillations (mHz QPOs) using a one-zone X-ray burst model. The\nsurface gravity is specified by two kinds of equation of states: neutron star\n(NS) and strange star (SS). The base flux, $Q_{b}$, is set in the range of 0-2\nMeV nucleon$^{-1}$. It is found that the frequency of mHz QPO is positively\ncorrelated to the surface gravity but negatively to the base heating. The\nhelium mass fraction has a significant influence on the oscillation frequency\nand luminosity. The observed 7-9 mHz QPOs can be either explained by a heavy\nNS/light SS with a small base flux or a heavy SS with a large base flux. As\nbase flux increases, the critical mass accretion rate for marginally stable\nburning is found to be lower. Meanwhile, the impact of metallicity on the\nproperties of mHz QPOs was investigated using one-zone model. It shows that\nboth the frequency and critical mass accretion rate decrease as metallicity\nincreases. An accreted NS/SS with a higher base flux and metallicity, combined\nwith a lower surface gravity and helium mass fraction, could be responsible for\nthe observed critical mass accretion rate ($\\dot{m}\\simeq 0.3\\dot{m}_{\\rm\nEdd}$). The accreted fuel would be in stable burning if base flux is over than\n$\\sim$2 MeV nucleon$^{-1}$. This finding suggests that the accreting NSs/SSs in\nlow-mass X-ray binaries showing no type I X-ray bursts possibly have a strong\nbase heating.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:08:29 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Helei",""],["Gao","Yong",""],["Li","Zhaosheng",""],["Dohi","Akira",""],["Wang","Weiyang",""],["Lv","Guoliang",""],["Xu","Renxin",""]]}
{"id":"2308.05289","submitter":"Mohamed Abdelhamid","authors":"Mohamed Abdelhamid and Aleksander Czekanski","title":"Density-Based Topology Optimization of High-Fidelity Fluid-Structure\n  Interaction Problems with Large Deformations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The application of modern topology optimization techniques to single physics\nsystems has seen great advances in the last three decades. However, the\napplication of these tools to sophisticated multiphysics systems such as\nfluid-structure interactions is still lagging behind, mainly due to the\nmultidisciplinary and complex nature of such systems. In this work, we\nimplement topology optimization of high-fidelity, fully-coupled fluid-structure\ninteraction problems with large deformations. We use the arbitrary\nLagrangian-Eulerian approach to deform the fluid mesh as a pseudo-structural\nsystem such that structural deformations are completely reflected in the fluid\nflow mesh. The fluid-structure interaction problem is formulated using the\nthree-field formulation and the sensitivity analysis is derived using the\ndiscrete adjoint approach. We show through numerical examples the effect of the\nprojection and interpolation parameters on the convergence and topology of the\noptimized designs and demonstrate the effect of considering the structural\ndeformations in the fluid mesh.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:12:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Abdelhamid","Mohamed",""],["Czekanski","Aleksander",""]]}
{"id":"2308.05290","submitter":"Jungseek Hwang","authors":"Hwiwoo Park, Jun H. Park, and Jungseek Hwang","title":"Planckian behavior of cuprates at the pseudogap critical point simulated\n  via flat electron-boson spectral density","comments":"14 pages, 5 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":"  Planckian behavior has been recently observed in La1.76Sr0.24CuO4 at the\npseudogap critical point. The Planckian behavior takes place in an intriguing\nquantum metallic state at a quantum critical point. Here, the Planckian\nbehavior was simulated with an energy-independent (or flat) and weakly\ntemperature-dependent electron-boson spectral density (EBSD) function by using\na generalized Allen's (Shulga's) formula. We obtained various optical\nquantities from the flat EBSD function, such as the optical scattering rate,\nthe optical effective mass, and the optical conductivity. These quantities are\nwell fitted with the recently observed Planckian behavior. Fermi-liquid\nbehavior was also simulated with an energy-linear and temperature-independent\nEBSD function. The EBSD functions agree well with the overall doping- and\ntemperature-dependent trends of the EBSD function obtained from the optically\nmeasured spectra of cuprate systems, which can be crucial for understanding the\nmicroscopic electron-pairing mechanism for high-Tc superconductivity in\ncuprates.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:13:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Park","Hwiwoo",""],["Park","Jun H.",""],["Hwang","Jungseek",""]]}
{"id":"2308.05291","submitter":"Caiyu Liu","authors":"Caiyu Liu, Xin Wu","title":"Effects of coupling constants on chaos of charged particles in the\n  $Einstein-\\AE$ ther theory","comments":"19 pages, 10 figures","journal-ref":null,"doi":"10.3390/universe9080365","report-no":null,"categories":"gr-qc astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There are two free coupling parameters $c_{13}$ and $c_{14}$ in the\nEinstein-\\AE ther metric describing a non-rotating black hole. This metric is\nthe Reissner-Nordstr\\\"{o}m black hole solution when $0\\leq 2c_{13}<c_{14}<2$,\nbut it is not for $0\\leq c_{14}<2c_{13}<2$. When the black hole is immersed in\nan external asymptotically uniform magnetic field, the Hamiltonian system\ndescribing the motion of charged particles around the black hole is not\nintegrable. However, the Hamiltonian allows for the construction of explicit\nsymplectic integrators. The proposed fourth-order explicit symplectic scheme is\nused to investigate the dynamics of charged particles because it exhibits\nexcellent long-term performance in conserving the Hamiltonian. No universal\nrule can be given to the dependence of regular and chaotic dynamics on varying\none or two parameters $c_{13}$ and $c_{14}$ in the two cases of $0\\leq\n2c_{13}<c_{14}<2$ and $0\\leq c_{14}<2c_{13}<2$. The distributions of order and\nchaos in the binary parameter space $(c_{13},c_{14})$ rely on different\ncombinations of the other parameters and the initial conditions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:13:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Caiyu",""],["Wu","Xin",""]]}
{"id":"2308.05292","submitter":"Jie Peng","authors":"Jie Peng, Weiyu Li, Qing Ling","title":"Byzantine-Robust Decentralized Stochastic Optimization with Stochastic\n  Gradient Noise-Independent Learning Error","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies Byzantine-robust stochastic optimization over a\ndecentralized network, where every agent periodically communicates with its\nneighbors to exchange local models, and then updates its own local model by\nstochastic gradient descent (SGD). The performance of such a method is affected\nby an unknown number of Byzantine agents, which conduct adversarially during\nthe optimization process. To the best of our knowledge, there is no existing\nwork that simultaneously achieves a linear convergence speed and a small\nlearning error. We observe that the learning error is largely dependent on the\nintrinsic stochastic gradient noise. Motivated by this observation, we\nintroduce two variance reduction methods, stochastic average gradient algorithm\n(SAGA) and loopless stochastic variance-reduced gradient (LSVRG), to\nByzantine-robust decentralized stochastic optimization for eliminating the\nnegative effect of the stochastic gradient noise. The two resulting methods,\nBRAVO-SAGA and BRAVO-LSVRG, enjoy both linear convergence speeds and stochastic\ngradient noise-independent learning errors. Such learning errors are optimal\nfor a class of methods based on total variation (TV)-norm regularization and\nstochastic subgradient update. We conduct extensive numerical experiments to\ndemonstrate their effectiveness under various Byzantine attacks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:14:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Peng","Jie",""],["Li","Weiyu",""],["Ling","Qing",""]]}
{"id":"2308.05293","submitter":"Tsuyoshi Miezaki","authors":"Satoru Fukasawa, Tsuyoshi Miezaki","title":"Galois points for a finite graph","comments":"13 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AG math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces the notion of a Galois point for a finite graph, using\nthe theory of linear systems of divisors for graphs discovered by Baker and\nNorine. We present a new characterization of complete graphs in terms of Galois\npoints.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:14:35 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 00:40:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fukasawa","Satoru",""],["Miezaki","Tsuyoshi",""]]}
{"id":"2308.05294","submitter":"Gillian Grindstaff","authors":"Jingjie Yang, Heidi Fang, Jagdeep Dhesi, Iris H.R. Yoon, Joshua A.\n  Bull, Helen M. Byrne, Heather A. Harrington, Gillian Grindstaff","title":"Topological classification of tumour-immune interactions and dynamics","comments":"29 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.CB math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The complex and dynamic crosstalk between tumour and immune cells results in\ntumours that can exhibit distinct qualitative behaviours - elimination,\nequilibrium, and escape - and intricate spatial patterns, yet share similar\ncell configurations in the early stages. We offer a topological approach to\nanalyse time series of spatial data of cell locations (including tumour cells\nand macrophages) in order to predict malignant behaviour. We propose four\ntopological vectorisations specialised to such cell data: persistence images of\nVietoris-Rips and radial filtrations at static time points, and persistence\nimages for zigzag filtrations and persistence vineyards varying in time. To\ndemonstrate the approach, synthetic data are generated from an agent-based\nmodel with varying parameters. We compare the performance of topological\nsummaries in predicting - with logistic regression at various time steps -\nwhether tumour niches surrounding blood vessels are present at the end of the\nsimulation, as a proxy for metastasis (i.e., tumour escape). We find that both\nstatic and time-dependent methods accurately identify perivascular niche\nformation, significantly earlier than simpler markers such as the number of\ntumour cells and the macrophage phenotype ratio. We find additionally that\ndimension 0 persistence applied to macrophage data, representing multi-scale\nclusters of the spatial arrangement of macrophages, performs best at this\nclassification task at early time steps, prior to full tumour development, and\nperforms even better when time-dependent data are included; in contrast,\ntopological measures capturing the shape of the tumour, such as tortuosity and\npunctures in the cell arrangement, perform best at intermediate and later\nstages. The logistic regression coefficients reveal detailed shape differences\nbetween the classes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:27:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yang","Jingjie",""],["Fang","Heidi",""],["Dhesi","Jagdeep",""],["Yoon","Iris H. R.",""],["Bull","Joshua A.",""],["Byrne","Helen M.",""],["Harrington","Heather A.",""],["Grindstaff","Gillian",""]]}
{"id":"2308.05295","submitter":"Yunhao Yang","authors":"Yunhao Yang, Cyrus Neary, Ufuk Topcu","title":"Multimodal Pretrained Models for Sequential Decision-Making: Synthesis,\n  Verification, Grounding, and Perception","comments":"27 pages, 19 figures, submitted to AIJ","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently developed pretrained models can encode rich world knowledge\nexpressed in multiple modalities, such as text and images. However, the outputs\nof these models cannot be integrated into algorithms to solve sequential\ndecision-making tasks. We develop an algorithm that utilizes the knowledge from\npretrained models to construct and verify controllers for sequential\ndecision-making tasks, and to ground these controllers to task environments\nthrough visual observations. In particular, the algorithm queries a pretrained\nmodel with a user-provided, text-based task description and uses the model's\noutput to construct an automaton-based controller that encodes the model's\ntask-relevant knowledge. It then verifies whether the knowledge encoded in the\ncontroller is consistent with other independently available knowledge, which\nmay include abstract information on the environment or user-provided\nspecifications. If this verification step discovers any inconsistency, the\nalgorithm automatically refines the controller to resolve the inconsistency.\nNext, the algorithm leverages the vision and language capabilities of\npretrained models to ground the controller to the task environment. It collects\nimage-based observations from the task environment and uses the pretrained\nmodel to link these observations to the text-based control logic encoded in the\ncontroller (e.g., actions and conditions that trigger the actions). We propose\na mechanism to ensure the controller satisfies the user-provided specification\neven when perceptual uncertainties are present. We demonstrate the algorithm's\nability to construct, verify, and ground automaton-based controllers through a\nsuite of real-world tasks, including daily life and robot manipulation tasks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:29:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yang","Yunhao",""],["Neary","Cyrus",""],["Topcu","Ufuk",""]]}
{"id":"2308.05296","submitter":"Yuki Mifune","authors":"Yuki Mifune","title":"On the finiteness of radii of resolving subcategories","comments":"arXiv admin note: text overlap with arXiv:1111.2902 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let R be a commutative noetherian ring. Denote by mod R the category of\nfinitely generated R-modules. In this paper, we investigate the finiteness of\nthe radii of resolving subcategories of mod R with respect to a fixed\nsemidualizing module. As an application, we give a partial positive answer to a\nconjecture of Dao and Takahashi: we prove that for a Cohen-Macaulay local ring\nR, a resolving subcategory of mod R has infinite radius whenever it contains a\ncanonical module and a non-MCM module of finite injective dimension.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:29:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mifune","Yuki",""]]}
{"id":"2308.05297","submitter":"Vojtech Vlcek","authors":"Xiaohe Lei, Annabelle Canestraight, Vojtech Vlcek","title":"Exceptional spatial variation of charge injection energies on plasmonic\n  surfaces","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":"  Charge injection into a molecule on a metallic interface is a key step in\nmany photo-activated reactions. The energy barrier for injection is paralleled\nwith the lowest particle and hole addition energies. We employ Green's function\nformalism of the many-body perturbation theory and compute the excitation\nenergies, which include non-local correlations due to charge density\nfluctuations on the surface, i.e., the plasmons. We explore a prototypical\nsystem: CO$_2$ molecule on nanoscale plasmonic Au infinite and nanoparticle\nsurface with nearly 3,000 electrons. In contrast to widely used density\nfunctional theory, we demonstrate that the energy barrier varies significantly\ndepending on the molecular position on the surface, creating \"hot spots\" for\npossible carrier injection. These areas arise due to an intertwined competition\nbetween purely plasmonic couplings (charge density fluctuations on the\nsubstrate surface alone) and the degree of hybridization between the molecule\nand the substrate. There are multiple positions found with the lowest energy\nbarrier for the electron/hole injection. We identify that the charge injection\nbarrier to the adsorbate on the plasmonic surface trends down from the facet\nedge to the facet center -- here, the change in molecular orbitals overshadows\nthe role of the charge fluctuations in the substrate. This finding contrasts\nthe typical picture in which the electric field enhancement on the nanoparticle\nedges is considered the most critical factor.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:39:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lei","Xiaohe",""],["Canestraight","Annabelle",""],["Vlcek","Vojtech",""]]}
{"id":"2308.05298","submitter":"Hongbo Kang","authors":"Hongbo Kang, Yong Wang, Mengyuan Liu, Doudou Wu, Peng Liu, Wenming\n  Yang","title":"Double-chain Constraints for 3D Human Pose Estimation in Images and\n  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":"  Reconstructing 3D poses from 2D poses lacking depth information is\nparticularly challenging due to the complexity and diversity of human motion.\nThe key is to effectively model the spatial constraints between joints to\nleverage their inherent dependencies. Thus, we propose a novel model, called\nDouble-chain Graph Convolutional Transformer (DC-GCT), to constrain the pose\nthrough a double-chain design consisting of local-to-global and global-to-local\nchains to obtain a complex representation more suitable for the current human\npose. Specifically, we combine the advantages of GCN and Transformer and design\na Local Constraint Module (LCM) based on GCN and a Global Constraint Module\n(GCM) based on self-attention mechanism as well as a Feature Interaction Module\n(FIM). The proposed method fully captures the multi-level dependencies between\nhuman body joints to optimize the modeling capability of the model. Moreover,\nwe propose a method to use temporal information into the single-frame model by\nguiding the video sequence embedding through the joint embedding of the target\nframe, with negligible increase in computational cost. Experimental results\ndemonstrate that DC-GCT achieves state-of-the-art performance on two\nchallenging datasets (Human3.6M and MPI-INF-3DHP). Notably, our model achieves\nstate-of-the-art performance on all action categories in the Human3.6M dataset\nusing detected 2D poses from CPN, and our code is available at:\nhttps://github.com/KHB1698/DC-GCT.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:41:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kang","Hongbo",""],["Wang","Yong",""],["Liu","Mengyuan",""],["Wu","Doudou",""],["Liu","Peng",""],["Yang","Wenming",""]]}
{"id":"2308.05299","submitter":"Hannah Klawa","authors":"Hannah Klawa","title":"Graded Perinormality","comments":"18 pages, Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An integral domain $R$ is \\emph{perinormal} if every local going-down\noverring is a localization of $R$ and \\emph{globally perinormal} if every\ngoing-down overring is a localization of $R$. In this paper, I introduce\nnotions of graded perinormal and graded globally perinormal domains and show\nthat many results obtained for perinormal and globally perinormal domains have\ngraded analogs. I also give some results for descent of properties between a\ngraded domain and its $0$th graded component.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:41:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Klawa","Hannah",""]]}
{"id":"2308.05300","submitter":"Rajveer Jha Dr.","authors":"Rajveer Jha, Valenta Jarosla, Naohito Tsujii, Takashi Naka, Takeshi\n  Kawahata, Chiduru Kawashima, Hiroki Takahashi, Takao Mori and Yoshikazu\n  Mizuguchi","title":"Evaluation of insulating behavior by Pb Substitution and\n  Pressure-Induced Superconductivity in La2O2Bi3-xPb1+xS6","comments":"10 pages, 8 figures, accepted in Superconductor Science and\n  Technology","journal-ref":null,"doi":"10.1088/1361-6668/aceeba","report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report synthesis, characterization, and physical properties of layered\nbismuth-sulfide compounds La2O2Bi3-xPb1+xS6. We synthesized a new La2O2Bi3PbS6\ncompound, whose crystal structure is similar to those of the La2O2Bi3AgS6\nsuperconductor or La2O2Bi2Pb2S6 (insulator) with a four-layer-type conducting\nlayer. The crystal structure of La2O2Bi3PbS6 is characterized in a tetragonal\nP4/nmm space group, and the lattice parameters are a = 4.084(1) {\\AA} and c =\n19.71(2) {\\AA}. The obtained La2O2Bi3PbS6 sample exhibits narrow gap\nsemiconductor (metallic-like) transport behavior with an anomaly near the 160\nK. A metallic-like to insulator transition has been observed through Pb\nsubstitution, with increasing x in La2O2Bi3-xPb1+xS6. Furthermore, we applied\nexternal pressure for x = 0 and observed pressure-induced superconductivity.\nThe onset of superconductivity appeared at 0.93 GPa, and the highest transition\ntemperature was 3.1 K at 2.21 GPa.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:42:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jha","Rajveer",""],["Jarosla","Valenta",""],["Tsujii","Naohito",""],["Naka","Takashi",""],["Kawahata","Takeshi",""],["Kawashima","Chiduru",""],["Takahashi","Hiroki",""],["Mori","Takao",""],["Mizuguchi","Yoshikazu",""]]}
{"id":"2308.05301","submitter":"Yilin Wang","authors":"Yilin Wang","title":"From random simple curves to the K\\\"ahler geometry of universal\n  Teichm\\\"uller space","comments":"12 pages, 1 figure, for Notices of the American Mathematical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of this expository article is to introduce the Loewner energy (and\nits relation to Schramm-Loewner evolutions) and the universal Liouville action\n(and its relation to the Weil-Petersson Teichm\\\"uller space) and give the\nintuition behind the identity between them.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:42:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Yilin",""]]}
{"id":"2308.05302","submitter":"Koichi Ichimura","authors":"K. Ichimura, H. Ikeda, Y. Kishimoto, M. Kurasawa, A. A. Suzuki, Y.\n  Gando, M. Ikeda, K. Hosokawa, H. Sekiya, H. Ito, A. Minamino, S. Suzuki","title":"Development of a low-background HPGe detector at Kamioka Observatory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new ultra-low background high-purity germanium (HPGe) detector has been\ninstalled at the Kamioka underground experimental site. By cleaning the\nshielding material surface near the HPGe detector with ultra-pure nitric acid,\nthe background count rate is reduced by about 25\\% compared with the first HPGe\ndetector installed in 2016, which has the same detector specification and\nsimilar shielding geometry. This paper describes the shielding configuration,\nincluding the cleaning of the material surface, the comparison of calibration\ndata and simulation, the time variation of the background spectra, the sample\nmeasurement procedure, and some results of the radioactivity in the selected\nsamples.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:45:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ichimura","K.",""],["Ikeda","H.",""],["Kishimoto","Y.",""],["Kurasawa","M.",""],["Suzuki","A. A.",""],["Gando","Y.",""],["Ikeda","M.",""],["Hosokawa","K.",""],["Sekiya","H.",""],["Ito","H.",""],["Minamino","A.",""],["Suzuki","S.",""]]}
{"id":"2308.05303","submitter":"Yulin Yang","authors":"Yulin Yang and Patrick Geneva and Guoquan Huang","title":"Multi-Visual-Inertial System: Analysis, Calibration and Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study state estimation of multi-visual-inertial systems\n(MVIS) and develop sensor fusion algorithms to optimally fuse an arbitrary\nnumber of asynchronous inertial measurement units (IMUs) or gyroscopes and\nglobal and(or) rolling shutter cameras. We are especially interested in the\nfull calibration of the associated visual-inertial sensors, including the IMU\nor camera intrinsics and the IMU-IMU(or camera) spatiotemporal extrinsics as\nwell as the image readout time of rolling-shutter cameras (if used). To this\nend, we develop a new analytic combined IMU integration with intrinsics-termed\nACI3-to preintegrate IMU measurements, which is leveraged to fuse auxiliary\nIMUs and(or) gyroscopes alongside a base IMU. We model the multi-inertial\nmeasurements to include all the necessary inertial intrinsic and IMU-IMU\nspatiotemporal extrinsic parameters, while leveraging IMU-IMU rigid-body\nconstraints to eliminate the necessity of auxiliary inertial poses and thus\nreducing computational complexity. By performing observability analysis of\nMVIS, we prove that the standard four unobservable directions remain - no\nmatter how many inertial sensors are used, and also identify, for the first\ntime, degenerate motions for IMU-IMU spatiotemporal extrinsics and auxiliary\ninertial intrinsics. In addition to the extensive simulations that validate our\nanalysis and algorithms, we have built our own MVIS sensor rig and collected\nover 25 real-world datasets to experimentally verify the proposed calibration\nagainst the state-of-the-art calibration method such as Kalibr. We show that\nthe proposed MVIS calibration is able to achieve competing accuracy with\nimproved convergence and repeatability, which is open sourced to better benefit\nthe community.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:47:36 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 05:06:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Yulin",""],["Geneva","Patrick",""],["Huang","Guoquan",""]]}
{"id":"2308.05304","submitter":"Jin-Lei Yang","authors":"Jin-Lei Yang, Zhao-Feng Ge, Xiu-Yi Yang, Sheng-Kai Cui, Tai-Fu Feng","title":"W boson mass in the NP models with extra $U(1)$ gauge group","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":"  The precise measurement of the W boson mass is closely related to the\ncontributions of new physics (NP), which can significantly constrain the\nparameter space of NP models, particularly those with an additional $U(1)$\nlocal gauge group. The inclusion of a new $Z'$ gauge boson and gauge couplings\nin these models can contribute to the oblique parameters $S$, $T$, $U$ and W\nboson mass at tree level. Taking into account the effects of kinetic mixing, we\ncalculate and analyze the oblique parameters $S$, $T$, $U$ and W boson mass in\nsuch NP models in this study. It is found that the kinetic mixing effects can\nmake significant contributions to the W boson mass, which can satisfy the\nrecently measured W boson mass at CDF II or ATLAS by choosing appropriate\nvalues of gauge coupling constants and extra $U(1)$ group charges of leptons or\nscalar doublets. In addition, if the leptonic Yukawa couplings are invariant\nunder the extra $U(1)$ local gauge group, these contributions can be eliminated\nby redefining the gauge boson fields through eliminating the neutral currents\ninvolving charged leptons, even with nonzero kinetic mixing effects.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:48:49 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 08:45:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yang","Jin-Lei",""],["Ge","Zhao-Feng",""],["Yang","Xiu-Yi",""],["Cui","Sheng-Kai",""],["Feng","Tai-Fu",""]]}
{"id":"2308.05305","submitter":"Wenjian Yao","authors":"Wenjian Yao, Jiajun Bai, Wei Liao, Yuheng Chen, Mengjuan Liu and Yao\n  Xie","title":"From CNN to Transformer: A Review of Medical Image Segmentation Models","comments":"18 pages, 8 figures","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":"  Medical image segmentation is an important step in medical image analysis,\nespecially as a crucial prerequisite for efficient disease diagnosis and\ntreatment. The use of deep learning for image segmentation has become a\nprevalent trend. The widely adopted approach currently is U-Net and its\nvariants. Additionally, with the remarkable success of pre-trained models in\nnatural language processing tasks, transformer-based models like TransUNet have\nachieved desirable performance on multiple medical image segmentation datasets.\nIn this paper, we conduct a survey of the most representative four medical\nimage segmentation models in recent years. We theoretically analyze the\ncharacteristics of these models and quantitatively evaluate their performance\non two benchmark datasets (i.e., Tuberculosis Chest X-rays and ovarian tumors).\nFinally, we discuss the main challenges and future trends in medical image\nsegmentation. Our work can assist researchers in the related field to quickly\nestablish medical segmentation models tailored to specific regions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:48:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yao","Wenjian",""],["Bai","Jiajun",""],["Liao","Wei",""],["Chen","Yuheng",""],["Liu","Mengjuan",""],["Xie","Yao",""]]}
{"id":"2308.05306","submitter":"Wataru Hashimoto","authors":"Wataru Hashimoto, Kazumune Hashimoto, Akifumi Wachi, Xun Shen, Masako\n  Kishida, and Shigemasa Takai","title":"Bayesian Meta-Learning on Control Barrier Functions with Data from\n  On-Board Sensors","comments":"submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider a way to safely navigate the robots in unknown\nenvironments using measurement data from sensory devices. The control barrier\nfunction (CBF) is one of the promising approaches to encode safety requirements\nof the system and the recent progress on learning-based approaches for CBF\nrealizes online synthesis of CBF-based safe controllers with sensor\nmeasurements. However, the existing methods are inefficient in the sense that\nthe trained CBF cannot be generalized to different environments and the\nre-synthesis of the controller is necessary when changes in the environment\noccur. Thus, this paper considers a way to learn CBF that can quickly adapt to\na new environment with few amount of data by utilizing the currently developed\nBayesian meta-learning framework. The proposed scheme realizes efficient online\nsynthesis of the controller as shown in the simulation study and provides\nprobabilistic safety guarantees on the resulting controller.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:51:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hashimoto","Wataru",""],["Hashimoto","Kazumune",""],["Wachi","Akifumi",""],["Shen","Xun",""],["Kishida","Masako",""],["Takai","Shigemasa",""]]}
{"id":"2308.05307","submitter":"Anders S. Buch","authors":"Anders S. Buch and Pierre-Emmanuel Chaput and Nicolas Perrin","title":"Seidel and Pieri products in cominuscule quantum K-theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a collection of formulas for products of Schubert classes in the\nquantum $K$-theory ring $QK(X)$ of a cominuscule flag variety $X$. This\nincludes a $K$-theory version of the Seidel representation, stating that the\nquantum product of a Seidel class with an arbitrary Schubert class is equal to\na single Schubert class times a power of the deformation parameter $q$. We also\nprove new Pieri formulas for the quantum $K$-theory of maximal orthogonal\nGrassmannians and Lagrangian Grassmannians, and give a new proof of the known\nPieri formula for the quantum $K$-theory of Grassmannians of type A. Our\nformulas have simple statements in terms of quantum shapes that represent the\nnatural basis elements $q^d[{\\mathcal O}_{X^u}]$ of $QK(X)$. Along the way we\ngive a simple formula for $K$-theoretic Gromov-Witten invariants of Pieri type\nfor Lagrangian Grassmannians, and prove a rationality result for the points in\na Richardson variety in a symplectic Grassmannian that are perpendicular to a\npoint in projective space.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:52:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Buch","Anders S.",""],["Chaput","Pierre-Emmanuel",""],["Perrin","Nicolas",""]]}
{"id":"2308.05308","submitter":"Zhen-Yan Lu","authors":"Zhi-Jun Ma, Zhen-Yan Lu, Jian-Feng Xu, Guang-Xiong Peng, Xiangyun Fu,\n  Junnian Wang","title":"Cold quark matter in a quasiparticle model: thermodynamic consistency\n  and stellar properties","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE hep-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The strong coupling in the effective quark mass was usually taken as a\nconstant in a quasiparticle model while it is, in fact, running with an energy\nscale. With a running coupling, however, the thermodynamic inconsistency\nproblem appears in the conventional treatment. We show that the renormalization\nsubtraction point should be taken as a function of the summation of the\nbiquadratic chemical potentials if the quark's current masses vanish, in order\nto ensure full thermodynamic consistency. Taking the simplest form, we study\nthe properties of up-down ($ud$) quark matter, and confirm that the revised\nquasiparticle model fulfills the quantitative criteria for thermodynamic\nconsistency. Moreover, we find that the maximum mass of an $ud$ quark star can\nbe larger than two times the solar mass, reaching up to $2.31M_{\\odot}$, for\nreasonable model parameters. However, to further satisfy the upper limit of\ntidal deformability $\\tilde{\\Lambda}_{1.4}\\leq 580$ observed in the event\nGW170817, the maximum mass of an $ud$ quark star can only be as large as\n$2.08M_{\\odot}$, namely $M_{\\text{max}}\\lesssim2.08M_{\\odot}$. In other words,\nour results indicate that the measured tidal deformability for event GW170817\nplaces an upper bound on the maximum mass of $ud$ quark stars, but which does\nnot rule out the possibility of the existence of quark stars composed of $ud$\nquark matter, with a mass of about two times the solar mass.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:52:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ma","Zhi-Jun",""],["Lu","Zhen-Yan",""],["Xu","Jian-Feng",""],["Peng","Guang-Xiong",""],["Fu","Xiangyun",""],["Wang","Junnian",""]]}
{"id":"2308.05309","submitter":"Ming Gu","authors":"Ming Gu, Gaoming Yang, Sheng Zhou, Ning Ma, Jiawei Chen, Qiaoyu Tan,\n  Meihan Liu, Jiajun Bu","title":"Homophily-enhanced Structure Learning for Graph Clustering","comments":"11 pages with 7 figures. Accepted by CIKM'23","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 clustering is a fundamental task in graph analysis, and recent advances\nin utilizing graph neural networks (GNNs) have shown impressive results.\nDespite the success of existing GNN-based graph clustering methods, they often\noverlook the quality of graph structure, which is inherent in real-world graphs\ndue to their sparse and multifarious nature, leading to subpar performance.\nGraph structure learning allows refining the input graph by adding missing\nlinks and removing spurious connections. However, previous endeavors in graph\nstructure learning have predominantly centered around supervised settings, and\ncannot be directly applied to our specific clustering tasks due to the absence\nof ground-truth labels. To bridge the gap, we propose a novel method called\n\\textbf{ho}mophily-enhanced structure \\textbf{le}arning for graph clustering\n(HoLe). Our motivation stems from the observation that subtly enhancing the\ndegree of homophily within the graph structure can significantly improve GNNs\nand clustering outcomes. To realize this objective, we develop two\nclustering-oriented structure learning modules, i.e., hierarchical correlation\nestimation and cluster-aware sparsification. The former module enables a more\naccurate estimation of pairwise node relationships by leveraging guidance from\nlatent and clustering spaces, while the latter one generates a sparsified\nstructure based on the similarity matrix and clustering assignments.\nAdditionally, we devise a joint optimization approach alternating between\ntraining the homophily-enhanced structure learning and GNN-based clustering,\nthereby enforcing their reciprocal effects. Extensive experiments on seven\nbenchmark datasets of various types and scales, across a range of clustering\nmetrics, demonstrate the superiority of HoLe against state-of-the-art\nbaselines.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:53:30 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 01:09:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gu","Ming",""],["Yang","Gaoming",""],["Zhou","Sheng",""],["Ma","Ning",""],["Chen","Jiawei",""],["Tan","Qiaoyu",""],["Liu","Meihan",""],["Bu","Jiajun",""]]}
{"id":"2308.05310","submitter":"Sushree Jagriti Sahoo","authors":"Sushree Jagriti Sahoo, Qimen Xu, Xiangyun Lei, Daniel Staros, Gopal R.\n  Iyer, Brenda Rubenstein, Phanish Suryanarayana, Andrew J. Medford","title":"Self-consistent convolutional density functional approximations:\n  Formulation and application to adsorption at metal surfaces","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":"  The exchange-correlation (XC) functional in density functional theory is used\nto approximate multi-electron interactions. A plethora of different functionals\nis available, but nearly all are based on the hierarchy of inputs commonly\nreferred to as \"Jacob's ladder.\" This paper introduces an approach to construct\nXC functionals with inputs from convolutions of arbitrary kernels with the\nelectron density, providing a route to move beyond Jacob's ladder. We derive\nthe variational derivative of these functionals, showing consistency with the\ngeneralized gradient approximation (GGA), and provide equations for variational\nderivatives based on multipole features from convolutional kernels. A\nproof-of-concept functional, PBEq, which generalizes the PBE$\\alpha$ framework\nwhere $\\alpha$ is a spatially-resolved function of the monopole of the electron\ndensity, is presented and implemented. It allows a single functional to use\ndifferent GGAs at different spatial points in a system, while obeying PBE\nconstraints. Analysis of the results underlines the importance of error\ncancellation and the XC potential in data-driven functional design. After\ntesting on small molecules, bulk metals, and surface catalysts, the results\nindicate that this approach is a promising route to simultaneously optimize\nmultiple properties of interest.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:59:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sahoo","Sushree Jagriti",""],["Xu","Qimen",""],["Lei","Xiangyun",""],["Staros","Daniel",""],["Iyer","Gopal R.",""],["Rubenstein","Brenda",""],["Suryanarayana","Phanish",""],["Medford","Andrew J.",""]]}
{"id":"2308.05311","submitter":"Huilin Zhu","authors":"Huilin Zhu, Jingling Yuan, Xian Zhong, Zhengwei Yang, Zheng Wang, and\n  Shengfeng He","title":"DAOT: Domain-Agnostically Aligned Optimal Transport for Domain-Adaptive\n  Crowd Counting","comments":"11 pages, 12 figures, 5 tables","journal-ref":null,"doi":"10.1145/3581783.3611793","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Domain adaptation is commonly employed in crowd counting to bridge the domain\ngaps between different datasets. However, existing domain adaptation methods\ntend to focus on inter-dataset differences while overlooking the\nintra-differences within the same dataset, leading to additional learning\nambiguities. These domain-agnostic factors, e.g., density, surveillance\nperspective, and scale, can cause significant in-domain variations, and the\nmisalignment of these factors across domains can lead to a drop in performance\nin cross-domain crowd counting. To address this issue, we propose a\nDomain-agnostically Aligned Optimal Transport (DAOT) strategy that aligns\ndomain-agnostic factors between domains. The DAOT consists of three steps.\nFirst, individual-level differences in domain-agnostic factors are measured\nusing structural similarity (SSIM). Second, the optimal transfer (OT) strategy\nis employed to smooth out these differences and find the optimal\ndomain-to-domain misalignment, with outlier individuals removed via a virtual\n\"dustbin\" column. Third, knowledge is transferred based on the aligned\ndomain-agnostic factors, and the model is retrained for domain adaptation to\nbridge the gap across domains. We conduct extensive experiments on five\nstandard crowd-counting benchmarks and demonstrate that the proposed method has\nstrong generalizability across diverse datasets. Our code will be available at:\nhttps://github.com/HopooLinZ/DAOT/.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:59:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhu","Huilin",""],["Yuan","Jingling",""],["Zhong","Xian",""],["Yang","Zhengwei",""],["Wang","Zheng",""],["He","Shengfeng",""]]}
{"id":"2308.05312","submitter":"Elliott Rosenberg","authors":"Elliott W. Rosenberg, Matthias Ikeda, and Ian R. Fisher","title":"The nematic susceptibility of the ferroquadrupolar metal TmAg2 measured\n  via the elastocaloric effect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Elastocaloric measurements of the ferroquadrupolar/nematic rare-earth\nintermetallic TmAg$_2$ are presented. TmAg$_2$ undergoes a cooperative\nJahn-Teller-like ferroquadrupolar phase transition at 5K, in which the\nTm$^{3+}$ ion's local $4f$ electronic ground state doublet spontaneously splits\nand develops an electric quadrupole moment which breaks the rotational symmetry\nof the tetragonal lattice. The elastocaloric effect, which is the temperature\nchange in the sample induced by adiabatic strains the sample experiences, is\nsensitive to quadrupolar fluctuations in the paranematic phase which couple to\nthe induced strain. We show that elastocaloric measurements of this material\nreveal a Curie-Weiss like nematic susceptibility with a Weiss temperature of\n$\\approx 2.7K$, in agreement with previous elastic constant measurements.\nFurthermore, we establish that a magnetic field along the c-axis acts as an\neffective transverse field for the quadrupole moments.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:04:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Rosenberg","Elliott W.",""],["Ikeda","Matthias",""],["Fisher","Ian R.",""]]}
{"id":"2308.05313","submitter":"Ke-Jun Xu","authors":"Ke-Jun Xu, Qinda Guo, Makoto Hashimoto, Zi-Xiang Li, Su-Di Chen,\n  Junfeng He, Yu He, Cong Li, Magnus H. Berntsen, Costel R. Rotundu, Young S.\n  Lee, Thomas P. Devereaux, Andreas Rydh, Dong-Hui Lu, Dung-Hai Lee, Oscar\n  Tjernberg, Zhi-Xun Shen","title":"Bogoliubov Quasiparticle on the Gossamer Fermi Surface in Electron-Doped\n  Cuprates","comments":"Submitted version 30 pages, 4 main figures, 8 extended data figures.\n  Accepted version in press at Nature Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In contrast to hole-doped cuprates, electron-doped cuprates consistently\nexhibit strong antiferromagnetic correlations with a commensurate ({\\pi},\n{\\pi}) ordering wave vector, leading to the prevalent belief that\nantiferromagnetic spin fluctuations mediate Cooper pairing in these\nunconventional superconductors. However, early investigations produced two\nparadoxical findings: while antiferromagnetic spin fluctuations create the\nlargest pseudogap at \"hot spots\" in momentum space, Raman scattering and\nangle-resolved photoemission spectroscopy measurements using the leading-edge\nmethod seem to suggest the superconducting gap is also maximized at these\nlocations. This presented a dilemma for spin-fluctuation-mediated pairing:\nCooper pairing is strongest at momenta where normal state low energy spectral\nweight is most suppressed. Here we investigate this dilemma in Nd2-xCexCuO4\nusing angle-resolved photoemission spectroscopy under significantly improved\nexperimental conditions. The unprecedented signal-to-noise ratio and resolution\nallow us to directly observe the Bogoliubov quasiparticles, demonstrating the\nexistence and importance of two sectors of states: 1. The reconstructed main\nband and the states gapped by the antiferromagnetic pseudogap around the hot\nspots. 2. The gossamer Fermi surface states with distinct dispersion inside the\npseudogap, from which Bogoliubov quasiparticle coherence peaks emerge below Tc.\nSupported by numerical results, we propose that the non-zero modulus of the\nantiferromagnetic order parameter causes the former, while fluctuations in the\nantiferromagnetic order parameter orientation are responsible for the latter.\nOur revelations of the gossamer Fermi surface reconcile the paradoxical\nobservations, deepening our understanding of superconductivity in\nelectron-doped cuprates in particular, and unconventional superconductivity in\ngeneral.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:04:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Xu","Ke-Jun",""],["Guo","Qinda",""],["Hashimoto","Makoto",""],["Li","Zi-Xiang",""],["Chen","Su-Di",""],["He","Junfeng",""],["He","Yu",""],["Li","Cong",""],["Berntsen","Magnus H.",""],["Rotundu","Costel R.",""],["Lee","Young S.",""],["Devereaux","Thomas P.",""],["Rydh","Andreas",""],["Lu","Dong-Hui",""],["Lee","Dung-Hai",""],["Tjernberg","Oscar",""],["Shen","Zhi-Xun",""]]}
{"id":"2308.05314","submitter":"Hanyun Wang","authors":"Shaocong Liu, Tao Wang, Yan Zhang, Ruqin Zhou, Li Li, Chenguang Dai,\n  Yongsheng Zhang, Hanyun Wang","title":"Deep Semantic Graph Matching for Large-scale Outdoor Point Clouds\n  Registration","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current point cloud registration methods are mainly based on geometric\ninformation and usually ignore the semantic information in the point clouds. In\nthis paper, we treat the point cloud registration problem as semantic instance\nmatching and registration task, and propose a deep semantic graph matching\nmethod for large-scale outdoor point cloud registration. Firstly, the semantic\ncategory labels of 3D point clouds are obtained by utilizing large-scale point\ncloud semantic segmentation network. The adjacent points with the same category\nlabels are then clustered together by using Euclidean clustering algorithm to\nobtain the semantic instances. Secondly, the semantic adjacency graph is\nconstructed based on the spatial adjacency relation of semantic instances.\nThree kinds of high-dimensional features including geometric shape features,\nsemantic categorical features and spatial distribution features are learned\nthrough graph convolutional network, and enhanced based on attention mechanism.\nThirdly, the semantic instance matching problem is modeled as an optimal\ntransport problem, and solved through an optimal matching layer. Finally,\naccording to the matched semantic instances, the geometric transformation\nmatrix between two point clouds is first obtained by SVD algorithm and then\nrefined by ICP algorithm. The experiments are cconducted on the KITTI Odometry\ndataset, and the average relative translation error and average relative\nrotation error of the proposed method are 6.6cm and 0.229{\\deg} respectively.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:07:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Shaocong",""],["Wang","Tao",""],["Zhang","Yan",""],["Zhou","Ruqin",""],["Li","Li",""],["Dai","Chenguang",""],["Zhang","Yongsheng",""],["Wang","Hanyun",""]]}
{"id":"2308.05315","submitter":"Xingqin Lin","authors":"Xingqin Lin","title":"An Overview of the 3GPP Study on Artificial Intelligence for 5G New\n  Radio","comments":"7 pages, 5 figures, submitted for possible publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Air interface is a fundamental component within any wireless communication\nsystem. In Release 18, the 3rd Generation Partnership Project (3GPP) delves\ninto the possibilities of leveraging artificial intelligence (AI)/machine\nlearning (ML) to improve the performance of the fifth-generation (5G) New Radio\n(NR) air interface. This endeavor marks a pioneering stride within 3GPP's\njourney in shaping wireless communication standards. This article offers a\ncomprehensive overview of the pivotal themes explored by 3GPP in this domain.\nEncompassing a general framework for AI/ML and specific use cases such as\nchannel state information feedback, beam management, and positioning, it\nprovides a holistic perspective. Moreover, we highlight the potential\ntrajectory of AI/ML for the NR air interface in 3GPP Release 19, a pathway that\npaves the journey towards the sixth generation (6G) wireless communication\nsystems that will feature integrated AI and communication as a key usage\nscenario.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:07:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lin","Xingqin",""]]}
{"id":"2308.05316","submitter":"Xu Feng","authors":"Guo-Yang Li, Xu Feng, Seok-Hyun Yun","title":"Simultaneous tensile and shear measurement of the human cornea in vivo\n  using S0- and A0-wave optical coherence elastography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding corneal stiffness is valuable for improving refractive surgery,\ndetecting corneal abnormalities, and assessing intraocular pressure. However,\naccurately measuring the elastic properties, particularly the tensile and shear\nmoduli that govern mechanical deformation, has been challenging. To tackle this\nissue, we have developed guided-wave optical coherence elastography that can\nsimultaneously excite and analyze symmetric (S0) and anti-symmetric (A0)\nelastic waves in the cornea at frequencies around 10 kHz and allows us to\nextract tensile and shear properties from measured wave dispersion curves. By\napplying acoustoelastic theory that incorporates corneal tension and a\nnonlinear constitutive tissue model, we verified the technique using elastomer\nphantoms and ex vivo porcine corneas and investigated the dependence on\nintraocular pressure. For two healthy human subjects, we measured a mean\ntensile modulus of 3.6 MPa and a mean shear modulus of 76 kPa in vivo with\nestimated errors of < 4%. This technique shows promise for the quantitative\nbiomechanical assessment of the cornea in a clinical setting.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:08:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Guo-Yang",""],["Feng","Xu",""],["Yun","Seok-Hyun",""]]}
{"id":"2308.05317","submitter":"Alexander Hanbo Li","authors":"Alexander Hanbo Li, Mingyue Shang, Evangelia Spiliopoulou, Jie Ma,\n  Patrick Ng, Zhiguo Wang, Bonan Min, William Wang, Kathleen McKeown, Vittorio\n  Castelli, Dan Roth, Bing Xiang","title":"Few-Shot Data-to-Text Generation via Unified Representation and\n  Multi-Source Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel approach for structured data-to-text generation that\naddresses the limitations of existing methods that primarily focus on specific\ntypes of structured data. Our proposed method aims to improve performance in\nmulti-task training, zero-shot and few-shot scenarios by providing a unified\nrepresentation that can handle various forms of structured data such as tables,\nknowledge graph triples, and meaning representations. We demonstrate that our\nproposed approach can effectively adapt to new structured forms, and can\nimprove performance in comparison to current methods. For example, our method\nresulted in a 66% improvement in zero-shot BLEU scores when transferring models\ntrained on table inputs to a knowledge graph dataset. Our proposed method is an\nimportant step towards a more general data-to-text generation framework.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:09:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Alexander Hanbo",""],["Shang","Mingyue",""],["Spiliopoulou","Evangelia",""],["Ma","Jie",""],["Ng","Patrick",""],["Wang","Zhiguo",""],["Min","Bonan",""],["Wang","William",""],["McKeown","Kathleen",""],["Castelli","Vittorio",""],["Roth","Dan",""],["Xiang","Bing",""]]}
{"id":"2308.05318","submitter":"Chang Nie","authors":"Chang Nie, Guangming Wang, Zhe Liu, Luca Cavalli, Marc Pollefeys,\n  Hesheng Wang","title":"RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End\n  Robust Estimation","comments":"Accepted by ICCV2023. Codes are released at\n  https://github.com/IRMVLab/RLSAC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robust estimation is a crucial and still challenging task, which involves\nestimating model parameters in noisy environments. Although conventional\nsampling consensus-based algorithms sample several times to achieve robustness,\nthese algorithms cannot use data features and historical information\neffectively. In this paper, we propose RLSAC, a novel Reinforcement Learning\nenhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC\nemploys a graph neural network to utilize both data and memory features to\nguide exploring directions for sampling the next minimum set. The feedback of\ndownstream tasks serves as the reward for unsupervised training. Therefore,\nRLSAC can avoid differentiating to learn the features and the feedback of\ndownstream tasks for end-to-end robust estimation. In addition, RLSAC\nintegrates a state transition module that encodes both data and memory\nfeatures. Our experimental results demonstrate that RLSAC can learn from\nfeatures to gradually explore a better hypothesis. Through analysis, it is\napparent that RLSAC can be easily transferred to other sampling consensus-based\nrobust estimation tasks. To the best of our knowledge, RLSAC is also the first\nmethod that uses reinforcement learning to sample consensus for end-to-end\nrobust estimation. We release our codes at https://github.com/IRMVLab/RLSAC.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:14:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nie","Chang",""],["Wang","Guangming",""],["Liu","Zhe",""],["Cavalli","Luca",""],["Pollefeys","Marc",""],["Wang","Hesheng",""]]}
{"id":"2308.05319","submitter":"Coskun Bilgi","authors":"Coskun Bilgi and Niema M Pahlevan","title":"Viscosity-model-independent generalized Reynolds number for laminar flow\n  of shear-thinning and viscoplastic fluids","comments":"15 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":"  Understanding the flow dynamics of non-Newtonian fluids is crucial in various\nengineering, industrial, and biomedical applications. However, the existing\ngeneralized Reynolds number formulations for non-Newtonian fluids have limited\napplicability due to their dependencies on their specific viscosity models. In\nthis study, we propose a new viscosity-model-independent formulation for a\ngeneralized Reynolds number. The proposed method is based on the direct\nadaptation of the measurement principles of rotational viscometers for wall\nshear rate estimation. We assess the accuracy of this proposed formulation for\npower-law and Carreau-Yasuda viscosity models through robust friction factor\nexperiments. The experimental results demonstrate the applicability and\neffectiveness of the proposed viscosity-model-independent Reynolds number, as\nthe measured friction factor data align closely with our Reynolds number\npredictions. Furthermore, we compare the accuracy of our Reynolds number\nformulation against established generalized Reynolds formulations for pure\nshear-thinning (Carreau-Yasuda) and viscoplastic (Herschel-Bulkley-extended)\nmodels. The results of the comparative analysis confirm the reliability and\nrobustness of this generalized Reynolds number in characterizing and\ninterpreting flow behavior in systems with visco-inelastic non-Newtonian\nfluids. This unified generalized Reynolds number formulation presents new and\nsignificant opportunities for precise flow characterization and interpretation\nas it is applicable to any visco-inelastic (time-independent) viscosity model\nwithout requiring additional derivations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:35:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bilgi","Coskun",""],["Pahlevan","Niema M",""]]}
{"id":"2308.05320","submitter":"Yanjie Li Mr.","authors":"Yanjie Li, Mingxing Duan, Bin Xiao","title":"Adv-Inpainting: Generating Natural and Transferable Adversarial Patch\n  via Attention-guided Feature Fusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rudimentary adversarial attacks utilize additive noise to attack facial\nrecognition (FR) models. However, because manipulating the total face is\nimpractical in the physical setting, most real-world FR attacks are based on\nadversarial patches, which limit perturbations to a small area. Previous\nadversarial patch attacks often resulted in unnatural patterns and clear\nboundaries that were easily noticeable. In this paper, we argue that generating\nadversarial patches with plausible content can result in stronger\ntransferability than using additive noise or directly sampling from the latent\nspace. To generate natural-looking and highly transferable adversarial patches,\nwe propose an innovative two-stage coarse-to-fine attack framework called\nAdv-Inpainting. In the first stage, we propose an attention-guided StyleGAN\n(Att-StyleGAN) that adaptively combines texture and identity features based on\nthe attention map to generate high-transferable and natural adversarial\npatches. In the second stage, we design a refinement network with a new\nboundary variance loss to further improve the coherence between the patch and\nits surrounding area. Experiment results demonstrate that Adv-Inpainting is\nstealthy and can produce adversarial patches with stronger transferability and\nimproved visual quality than previous adversarial patch attacks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:44:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Yanjie",""],["Duan","Mingxing",""],["Xiao","Bin",""]]}
{"id":"2308.05321","submitter":"Son Nguyen","authors":"A.J. Harris, Son Nguyen","title":"Bulgarian Solitaire: A new representation for depth generating functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bulgarian Solitaire is an interesting self-map on the set of integer\npartitions of a fixed number $n$. As a finite dynamical system, its long-term\nbehavior is well-understood, having recurrent orbits parametrized by necklaces\nof beads with two colors black $B$ and white $W$. However, the behavior of the\ntransient elements within each orbit is much less understood.\n  Recent work of Pham considered the orbits corresponding to a family of\nnecklaces $P^\\ell$ that are concatenations of $\\ell$ copies of a fixed\nprimitive necklace $P$. She proved striking limiting behavior as $\\ell$ goes to\ninfinity: the level statistic for the orbit, counting how many steps it takes a\npartition to reach the recurrent cycle, has a limiting distribution, whose\ngenerating function $H_p(x)$ is rational. Pham also conjectured that $H_P(x),\nH_{P^*}(x)$ share the same denominator whenever $P^*$ is obtained from $P$ by\nreading it backwards and swapping $B$ for $W$.\n  Here we introduce a new representation of Bulgarian Solitaire that is\nconvenient for the study of these generating functions. We then use it to prove\ntwo instances of Pham's conjecture, showing that\n  $$H_{BWBWB \\cdots WB}(x)=H_{WBWBW \\cdots BW}(x)$$ and that $H_{BWWW\\cdots\nW}(x),H_{WBBB\\cdots B}(x)$ share the same denominator.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:48:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Harris","A. J.",""],["Nguyen","Son",""]]}
{"id":"2308.05322","submitter":"Meixiu Long","authors":"Meixiu Long, Siyuan Chen, Xin Du, Jiahai Wang","title":"DegUIL: Degree-aware Graph Neural Networks for Long-tailed User Identity\n  Linkage","comments":"16 pages,4 figures,2 tables;Accepted by ECML-PKDD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  User identity linkage (UIL), matching accounts of a person on different\nsocial networks, is a fundamental task in cross-network data mining. Recent\nworks have achieved promising results by exploiting graph neural networks\n(GNNs) to capture network structure. However, they rarely analyze the realistic\nnode-level bottlenecks that hinder UIL's performance. First, node degrees in a\ngraph vary widely and are long-tailed. A significant fraction of tail nodes\nwith small degrees are underrepresented due to limited structural information,\ndegrading linkage performance seriously. The second bottleneck usually\noverlooked is super head nodes. It is commonly accepted that head nodes perform\nwell. However, we find that some of them with super high degrees also have\ndifficulty aligning counterparts, due to noise introduced by the randomness of\nfollowing friends in real-world social graphs. In pursuit of learning ideal\nrepresentations for these two groups of nodes, this paper proposes a\ndegree-aware model named DegUIL to narrow the degree gap. To this end, our\nmodel complements missing neighborhoods for tail nodes and discards redundant\nstructural information for super head nodes in embeddings respectively.\nSpecifically, the neighboring bias is predicted and corrected locally by two\nmodules, which are trained using the knowledge from structurally adequate head\nnodes. As a result, ideal neighborhoods are obtained for meaningful aggregation\nin GNNs. Extensive experiments demonstrate the superiority of our model. Our\ndata and code can be found at https://github.com/Longmeix/DegUIL.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:48:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Long","Meixiu",""],["Chen","Siyuan",""],["Du","Xin",""],["Wang","Jiahai",""]]}
{"id":"2308.05323","submitter":"Meng He","authors":"Meng He and Chuan Huang","title":"Universal Performance Bounds for Joint Self-Interference Cancellation\n  and Data Detection in Full-Duplex Communications","comments":null,"journal-ref":"IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp.\n  3792-3803, June 2022","doi":"10.1109/TWC.2021.3124018","report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the joint digital self-interference (SI) cancellation and\ndata detection in an orthogonal-frequency-division-multiplexing (OFDM)\nfull-duplex (FD) system, considering the effect of phase noise introduced by\nthe oscillators at both the local transmitter and receiver. In particular, an\nuniversal iterative two-stage joint SI cancellation and data detection\nframework is considered and its performance bound independent of any specific\nestimation and detection methods is derived. First, the channel and phase noise\nestimation mean square error (MSE) lower bounds in each iteration are derived\nby analyzing the Fisher information of the received signal. Then, by\nsubstituting the derived MSE lower bound into the SINR expression, which is\nrelated to the channel and phase noise estimation MSE, the SINR upper bound in\neach iteration is computed. Finally, by exploiting the SINR upper bound and the\ntransition information of the detection errors between two adjacent iterations,\nthe universal bit error rate (BER) lower bound for data detection is derived.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:54:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["He","Meng",""],["Huang","Chuan",""]]}
{"id":"2308.05324","submitter":"Michael Chitayat","authors":"Michael Chitayat","title":"Rationality of weighted hypersurfaces of special degree","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X \\subset \\mathbb{P}(w_0, w_1, w_2, w_3)$ be a quasismooth well-formed\nweighted projective hypersurface and let $L = lcm(w_0,w_1,w_2,w_3)$. We\ncharacterize when $X$ is rational under the assumption that $L$ divides the\ndegree of $X$. As applications, we give examples of families of normal\nprojective rational surfaces with quotient singularities and ample canonical\ndivisor; we also determine precisely which affine Pham-Brieskorn threefolds are\nrational.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:56:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chitayat","Michael",""]]}
{"id":"2308.05325","submitter":"Jungseek Hwang","authors":"Chandan Kumar Panda, Hong Gu Lee, Hwiwoo Park, Soon-Gil Jung, Ki-Young\n  Choi, and Jungseek Hwang","title":"Bosonic spectrum of a correlated multiband system, BaFe1.80Co0.20As2,\n  obtained via infrared spectroscopy","comments":"18 pages, 6 figures","journal-ref":"Results in Physics 50, 106572 (2023)","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 investigated a single crystal BaFe(2-x)CoxAs2 (Co-doped BaFe2As2: Co-doped\nBa122) with x = 0.20 using infrared spectroscopy. We obtained the bosonic\nspectrum from the measured spectrum using an extended Drude-Lorentz model for\nthe normal state and a two-parallel-channel approach for the superconducting\n(SC) state, based on the generalized Allen formula. The coupling constant,\nmaximum SC transition temperature, SC coherence length, and upper critical\nfield were extracted from the bosonic spectrum. The superfluid plasma frequency\nand the London penetration depth were obtained from the optical conductivity.\nWe compared the physical quantities of Co-doped Ba122 and K-doped Ba122 and\nfound some interesting differences. Our results may be helpful for\nunderstanding superconductivity in doped Ba122 systems and may provide useful\ninformation on doped Ba122 systems for their applications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 03:57:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Panda","Chandan Kumar",""],["Lee","Hong Gu",""],["Park","Hwiwoo",""],["Jung","Soon-Gil",""],["Choi","Ki-Young",""],["Hwang","Jungseek",""]]}
{"id":"2308.05326","submitter":"Gustaf Ahdritz","authors":"Gustaf Ahdritz, Nazim Bouatta, Sachin Kadyan, Lukas Jarosch, Daniel\n  Berenberg, Ian Fisk, Andrew M. Watkins, Stephen Ra, Richard Bonneau, Mohammed\n  AlQuraishi","title":"OpenProteinSet: Training data for structural biology at scale","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiple sequence alignments (MSAs) of proteins encode rich biological\ninformation and have been workhorses in bioinformatic methods for tasks like\nprotein design and protein structure prediction for decades. Recent\nbreakthroughs like AlphaFold2 that use transformers to attend directly over\nlarge quantities of raw MSAs have reaffirmed their importance. Generation of\nMSAs is highly computationally intensive, however, and no datasets comparable\nto those used to train AlphaFold2 have been made available to the research\ncommunity, hindering progress in machine learning for proteins. To remedy this\nproblem, we introduce OpenProteinSet, an open-source corpus of more than 16\nmillion MSAs, associated structural homologs from the Protein Data Bank, and\nAlphaFold2 protein structure predictions. We have previously demonstrated the\nutility of OpenProteinSet by successfully retraining AlphaFold2 on it. We\nexpect OpenProteinSet to be broadly useful as training and validation data for\n1) diverse tasks focused on protein structure, function, and design and 2)\nlarge-scale multimodal machine learning research.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:01:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ahdritz","Gustaf",""],["Bouatta","Nazim",""],["Kadyan","Sachin",""],["Jarosch","Lukas",""],["Berenberg","Daniel",""],["Fisk","Ian",""],["Watkins","Andrew M.",""],["Ra","Stephen",""],["Bonneau","Richard",""],["AlQuraishi","Mohammed",""]]}
{"id":"2308.05327","submitter":"Meng He","authors":"Meng He and Chuan Huang","title":"Self-Interference Cancellation for Full-Duplex Massive MIMO OFDM with\n  Single RF Chain","comments":null,"journal-ref":"IEEE Wireless Communications Letters, vol. 9, no. 1, pp. 26-29,\n  Jan. 2020","doi":"10.1109/LWC.2019.2940433","report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, the digital self-interference (SI) cancellation in a single\nradio frequency (RF) chain massive multi-input multi-output (MIMO) full-duplex\n(FD) orthogonal frequency division multiplexing (OFDM) system with phase noise\nis studied. To compensate the phase noise, which introduces SI channel\nestimation error and thus degrades the SI cancellation performance, a weighted\nlinear SI channel estimator is derived to minimize the residual SI power in\neach OFDM symbol. The digital SI cancellation ability of the proposed method,\nwhich is defined as the ratio of the SI power before and after the SI\ncancellation, is analyzed. Simulation results show that the proposed optimal\nlinear SI channel estimator significantly outperforms the conventional least\nsquare (LS) estimator in terms of the SI cancellation ability for the cases\nwith strong SI and low oscillator quality.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:03:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["He","Meng",""],["Huang","Chuan",""]]}
{"id":"2308.05328","submitter":"Paolo Valtancoli","authors":"P. Valtancoli","title":"Bumblebee gravity with cosmological constant","comments":"8 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show how to find exact black hole solutions in bumblebee gravity with\ncosmological constant including BTZ black holes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:08:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Valtancoli","P.",""]]}
{"id":"2308.05329","submitter":"Shidong Liang","authors":"Annan Fan and Shi-Dong Liang","title":"Topological invariants of complex energy plane in non-Hermitian systems","comments":"27 pages, 6 figures, 46 conferences","journal-ref":"Front. Phys. 17(3), 33501 (2022)","doi":"10.1007/s11467-021-1122-5","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-Hermitian systems as theoretical models of open or dissipative systems\nexhibit rich novel physical properties and fundamental issues in condensed\nmatter physics.We propose a generalized local-global correspondence between the\npseudo-boundary states in the complex energy plane and topological invariants\nof quantum states. We find that the patterns of the pseudo-boundary states in\nthe complex energy plane mapped to the Brillouin zone are topological\ninvariants against the parameter deformation. We demonstrate this approach by\nthe non-Hermitian Chern insulator model. We give the consistent topological\nphases obtained from the Chern number and vorticity. We also find some novel\ntopological invariants embedded in the topological phases of the Chern\ninsulator model, which enrich the phase diagram of the non-Hermitian Chern\ninsulators model beyond that predicted by the Chern number and vorticity. We\nalso propose a generalized vorticity and its flipping index to understand\nphysics behind this novel local-global correspondence and discuss the\nrelationships between the local-global correspondence and the Chern number as\nwell as the transformation between the Brillouin zone and the complex energy\nplane. These novel approaches provide insights to how topological invariants\nmay be obtained from local information as well as the global property of\nquantum states, which is expected to be applicable in more generic\nnon-Hermitian systems.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:10:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fan","Annan",""],["Liang","Shi-Dong",""]]}
{"id":"2308.05330","submitter":"Matti Jansson","authors":"Matti Janson, Saskia Philippen, Martin Rongen (for the IceCube\n  Collaboration)","title":"Refining the IceCube detector geometry using muon and LED calibration\n  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-988","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube Neutrino Observatory deployed 5160 digital optical modules (DOMs)\non 86 cables, called strings, in a cubic kilometer of deep glacial ice below\nthe geographic South Pole. These record the Cherenkov light of passing charged\nparticles. Knowledge of the DOM positions is vital for event reconstruction.\nWhile vertical positions have been calibrated, previous in-situ geometry\ncalibration methods have been unable to measure horizontal deviations from the\nsurface positions, largely due to degeneracies with ice model uncertainties.\nThus the lateral position of the surface position of each hole is to date in\nalmost all cases used as the lateral position of all DOMs on a given string.\nWith the recent advances in ice modeling, two new in-situ measurements have now\nbeen undertaken. Using a large sample of muon tracks, the individual positions\nof all DOMs on a small number of strings around the center of the detector have\nbeen fitted.\n  Verifying the results against LED calibration data shows that the\nstring-average corrections improve detector modeling. Directly fitting\nstring-average geometry corrections for the full array using LED data agrees\nwith the average corrections as derived from muons where available. Analyses\nare now ongoing to obtain per-DOM positions using both methods and in addition,\nmethods are being developed to correct the recorded arrival times for the\nexpected scattering delay, allowing for multilateration of the positions using\nnanosecond-precision propagation delays.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:18:30 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Janson","Matti","","for the IceCube\n  Collaboration"],["Philippen","Saskia","","for the IceCube\n  Collaboration"],["Rongen","Martin","","for the IceCube\n  Collaboration"]]}
{"id":"2308.05331","submitter":"Lior Shamir","authors":"Lior Shamir","title":"A simple direct empirical observation of systematic bias of the redshift\n  as a distance indicator","comments":"To be submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent puzzling observations such as the $H_o$ tension, large-scale\nanisotropies, and massive disk galaxies at high redshifts have been challenging\nthe standard cosmological model. While one possible explanation is that the\nstandard model is incomplete, other theories are based on the contention that\nthe redshift model as a distance indicator might be biased. While these\ntheories can explain the recent observations, they are challenged by the\nabsence of a direct empirical reproducible observation that the redshift model\ncan indeed be inconsistent. Here I describe a simple experiment that shows that\nthe spectra of galaxies depend on their rotational velocity relative to the\nrotational velocity of the Milky Way. Moreover, it shows that the redshift of\ngalaxies that rotate in the same direction relative to the Milky Way is\nsignificantly different from the redshift of galaxies that rotate in the\nopposite direction relative to the Milky Way (P$<0.006$). Three different\ndatasets are used independently, each one was prepared in a different manner,\nall of them show similar redshift bias. A fourth dataset of galaxies from the\nSouthern Galactic pole was also analyzed, and shows similar results. All four\ndatasets are publicly available. While a maximum average $\\Delta z$ of\n$\\sim$0.012 observed with galaxies of relatively low redshift (z$<$0.25) might\nnot seem dramatic, the bias is consistent, and can explain puzzling\nobservations such as the $H_o$ tension.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:22:30 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shamir","Lior",""]]}
{"id":"2308.05332","submitter":"Xia Zhao","authors":"Xia Zhao and Peibiao Zhao","title":"Flow by Gauss Curvature to the orlicz Chord Minkowski Problem","comments":"18 pages. arXiv admin note: text overlap with arXiv:2212.01822,\n  arXiv:2001.08862 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The $L_p$ chord Minkowski problem based on Chord measures and $L_p$ chord\nmeasures introduced firstly by Lutwak, Xi, Yang and Zhang [38] is a very\nimportant and meaningful geometric measure problem in the $L_p$ Brunn-Minkowski\ntheory. Xi, Yang, Zhang and Zhao [45] using variational methods gave a measure\nsolution when $p > 1$ and $0<p<1$ in the symmetric case. Recently, Guo, Xi and\nZhao [18] also obtained a measure solution for $0\\leq p<1$ by similar methods\nwithout the symmetric assumption.\n  In the present paper, we investigate and confirm the orlicz chord Minkowski\nproblem, which generalizes the $L_p$ chord Minkowski problem by replacing $p$\nwith a fixed continuous function $\\varphi:(0,\\infty)\\rightarrow(0,\\infty)$, and\nachieve the existence of smooth solutions to the orlicz chord Minkowski problem\nby using methods of Gauss curvature flows.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:28:18 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 04:57:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhao","Xia",""],["Zhao","Peibiao",""]]}
{"id":"2308.05333","submitter":"Qiguang Chen","authors":"Qiguang Chen and Lok Ming Lui","title":"3D Quasiconformal Representation and Solver","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The analysis of mapping relationships and distortions in multidimensional\ndata poses a significant challenge in contemporary research. While Beltrami\ncoefficients offer a precise description of distortions in two-dimensional\nmappings, current tools lack this capability in the context of\nthree-dimensional space. This paper presents a novel approach: a 3D\nquasiconformal representation that captures the local dilation of 3D mappings,\nalong with an algorithm that establishes a connection between this\nrepresentation and the corresponding mapping. Experimental results showcase the\nalgorithm's effectiveness in eliminating foldings in 3D mappings, as well as in\nmapping reconstruction and generation. These features bear a resemblance to the\n2D Linear Beltrami Solver technique. The work presented in this paper offers a\npromising solution for the precise analysis and adjustment of distortions in 3D\ndata and mappings.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:41:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Qiguang",""],["Lui","Lok Ming",""]]}
{"id":"2308.05334","submitter":"Dabin Kim","authors":"Dabin Kim, Matthias Pezzutto, Luca Schenato, and H. Jin Kim","title":"Visibility-Constrained Control of Multirotor via Reference Governor","comments":"8 pages, 6 figures, Accepted to 62nd IEEE Conference on Decision and\n  Control (CDC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For safe vision-based control applications, perception-related constraints\nhave to be satisfied in addition to other state constraints. In this paper, we\ndeal with the problem where a multirotor equipped with a camera needs to\nmaintain the visibility of a point of interest while tracking a reference given\nby a high-level planner. We devise a method based on reference governor that,\ndifferently from existing solutions, is able to enforce control-level\nvisibility constraints with theoretically assured feasibility. To this end, we\ndesign a new type of reference governor for linear systems with polynomial\nconstraints which is capable of handling time-varying references. The proposed\nsolution is implemented online for the real-time multirotor control with\nvisibility constraints and validated with simulations and an actual hardware\nexperiment.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:48:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kim","Dabin",""],["Pezzutto","Matthias",""],["Schenato","Luca",""],["Kim","H. Jin",""]]}
{"id":"2308.05335","submitter":"Davide Pradovera","authors":"Davide Pradovera and Alessandro Borghi","title":"Match-based solution of general parametric eigenvalue problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe a novel algorithm for solving general parametric (nonlinear)\neigenvalue problems. Our method has two steps: first, high-accuracy solutions\nof non-parametric versions of the problem are gathered at some values of the\nparameters; these are then combined to obtain global approximations of the\nparametric eigenvalues. To gather the non-parametric data, we use non-intrusive\ncontour-integration-based methods, which, however, cannot track eigenvalues\nthat migrate into/out of the contour as the parameter changes. Special\nstrategies are described for performing the combination-over-parameter step\ndespite having only partial information on such \"migrating\" eigenvalues.\nMoreover, we dedicate a special focus to the approximation of eigenvalues that\nundergo bifurcations. Finally, we propose an adaptive strategy that allows one\nto effectively apply our method even without any a priori information on the\nbehavior of the sought-after eigenvalues. Numerical tests are performed,\nshowing that our algorithm can achieve remarkably high approximation accuracy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:48:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pradovera","Davide",""],["Borghi","Alessandro",""]]}
{"id":"2308.05336","submitter":"Mehrnoush ShamsFard","authors":"Vahide Tajalli, Fateme Kalantari and Mehrnoush Shamsfard","title":"Developing an Informal-Formal Persian Corpus","comments":"16 pages, 1 Figure and 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Informal language is a style of spoken or written language frequently used in\ncasual conversations, social media, weblogs, emails and text messages. In\ninformal writing, the language faces some lexical and/or syntactic changes\nvarying among different languages. Persian is one of the languages with many\ndifferences between its formal and informal styles of writing, thus developing\ninformal language processing tools for this language seems necessary. Such a\nconverter needs a large aligned parallel corpus of colloquial-formal sentences\nwhich can be useful for linguists to extract a regulated grammar and\northography for colloquial Persian as is done for the formal language. In this\npaper we explain our methodology in building a parallel corpus of 50,000\nsentence pairs with alignments in the word/phrase level. The sentences were\nattempted to cover almost all kinds of lexical and syntactic changes between\ninformal and formal Persian, therefore both methods of exploring and collecting\nfrom the different resources of informal scripts and following the phonological\nand morphological patterns of changes were applied to find as much instances as\npossible. The resulting corpus has about 530,000 alignments and a dictionary\ncontaining 49,397 word and phrase pairs.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:57:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Tajalli","Vahide",""],["Kalantari","Fateme",""],["Shamsfard","Mehrnoush",""]]}
{"id":"2308.05337","submitter":"Zhenqiang Ren","authors":"Zhen-Qiang Ren, Xian-Liang Lu, and Ze-Liang Xiang","title":"Heisenberg-limited spin squeezing in a hybrid system with\n  Silicon-Vacancy centers","comments":"9 pages, 6 figures. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate spin squeezing in a hybrid quantum system\nconsisting of a Silicon-Vacancy (SiV) center ensemble coupled to a diamond\nacoustic waveguide via the strain interaction. Two sets of non-overlapping\ndriving fields, each contains two time-dependent microwave fields, are applied\nto this hybrid system. By modulating these fields, the one-axis twist (OAT)\ninteraction and two-axis two-spin (TATS) interaction can be independently\nrealized. In the latter case the squeezing parameter scales to spin number as\n$\\xi_R^2\\sim1.61N^{-0.64}$ with the consideration of dissipation, which is very\nclose to the Heisenberg limit. Furthermore, this hybrid system allows for the\nstudy of spin squeezing generated by the simultaneous presence of OAT and TATS\ninteractions, which reveals sensitivity to the parity of the number of spins\n$N_{tot}$, whether it is even or odd. Our scheme enriches the approach for\ngenerating Heisenberg-limited spin squeezing in spin-phonon hybrid systems and\noffers the possibility for future applications in quantum information\nprocessing.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:58:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ren","Zhen-Qiang",""],["Lu","Xian-Liang",""],["Xiang","Ze-Liang",""]]}
{"id":"2308.05338","submitter":"Zhicheng Bao","authors":"Zhicheng Bao, Haotai Liang, Chen Dong, Cong Li, Xiaodong Xu, Ping\n  Zhang","title":"MDVSC -- Wireless Model Division Video Semantic Communication","comments":"arXiv admin note: text overlap with arXiv:2305.15799","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a novel method for transmitting video data over noisy\nwireless channels with high efficiency and controllability. The method\nderivates from model division multiple access (MDMA) to extract common semantic\nfeatures from video frames. It also uses deep joint source-channel coding\n(JSCC) as the main framework to establish communication links and deal with\nchannel noise. An entropy-based variable length coding scheme is developed to\nadjust the data amount accurately and explicitly. We name our method as model\ndivision video semantic communication (MDVSC). The main steps of our approach\nare as follows: first, video frames are transformed into a latent space to\nreduce computational complexity and redistribute data. Then, common features\nand individual features are extracted, and variable length coding is applied to\nfurther eliminate redundant semantic information under the communication\nbandwidth constraint. We evaluate our method on standard video test sequences\nand compare it with traditional wireless video coding methods. The results show\nthat MDVSC generally surpasses the conventional methods in terms of quality\nmetrics and has the capability to control code length precisely. Moreover,\nadditional experiments and ablation studies are conducted to demonstrate its\npotential for various tasks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 04:59:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bao","Zhicheng",""],["Liang","Haotai",""],["Dong","Chen",""],["Li","Cong",""],["Xu","Xiaodong",""],["Zhang","Ping",""]]}
{"id":"2308.05339","submitter":"Pengguang Wang","authors":"Pengguang Wang, Hongbin Zhang","title":"Demonstration of a Facile and Efficient Strategy for Yield Stress\n  Determination in Large Amplitude Oscillatory Shear: Algebraic Stress\n  Bifurcation","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 large amplitude oscillatory shear (LAOS) has been extensively studied for\nunderstanding the rheological responses of yield stress fluids. However, the\nemployed methodology for the determination of the yield stress remains\nuncertain albeit the fact that many classical or plausible methods exist in the\nliterature. Along these lines, herein, based on Fourier transform rheology,\nstress decomposition, and stress bifurcation, a new straightforward method\ntermed as algebraic stress bifurcation was developed. More specifically, the\nmain goal was to determine the yield stress and investigate the solid-liquid\ntransition of fluids in LAOS. A simple and efficient mathematical framework was\nestablished and verified by the KVHB model, Saramito model, Giesekus model, and\nFT rheology. The main strength of this approach is that only the data from the\nstress/strain sweep are required instead of Lissajous curves. Alternative\nalgebraic Lissajous curves were also constructed to demonstrate the\nnon-critical role of both higher harmonics and phenomenological Lissajous\ncurves in determining yield stress. The determined start and end yield points\nin the solid-liquid transition were compared with the already existing methods.\nFurthermore, the resulting solid-liquid transition region was analyzed by\nFourier transform rheology, stress decomposition, and SPP technique to obtain\nthe information of nonlinearity and intracycle/intercycle yielding. Our work\nprovides fruitful insights for deeply explaining and reducing the complexities\nof the stress bifurcation technique by using an easy-to-understand and\nimplement format. Therefore, a concise theoretical framework was introduced for\nunderstanding the concept of the yield stress, the intercycle yielding process,\nand the rational choice of yield stress measurement techniques.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:04:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Pengguang",""],["Zhang","Hongbin",""]]}
{"id":"2308.05340","submitter":"Pengguang Wang","authors":"Pengguang Wang, Jiatong Xu, Ziyu Zhou, Hongbin Zhang","title":"New insights into tackling large amplitude oscillatory shear (LAOS): an\n  analytic LAOS approach (aLAOS)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large amplitude oscillatory shear (LAOS) has been widely applied for\nperforming rheological analysis of complex fluids, and the Fourier transform\n(FT) rheology is considered one of the mainstays in LAOS since FT is an\nessential mathematic tool that is applied in numerous fields of signal\nanalysis. However, the challenge of understanding FT, diverse mathematical\nframeworks, and complicated data processing render existing LAOS methods hard\nto be effectively used. As a result, their accessibility and implementation are\nlimited in practice. Thus, the development of novel LAOS methods remains an\nunmet need. In this context, a newly analytic LAOS (aLAOS) approach was deduced\nhere to tackle LAOS by the reverse use of the methodology of the FT rheology.\nMore specifically, the rheological signals and measures can be precisely\nreconstructed based on the established equations involving Fourier coefficients\ninstead of processing numerous discrete points of the Lissajous curves.\nFurthermore, considering the acquired results from the LAOS tests on the\nvarious typical yield stress fluids, it was demonstrated that the aLAOS could\nunify the mainstream LAOS methods into one Fourier coefficient-based framework\nand visually distinguish the contribution of arbitrary higher harmonics.\nConsequently, the proposed approach is arising as a promising candidate for the\nconvenient treatment of LAOS, which could also highly promote the multi-field\napplications of LAOS.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:09:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Pengguang",""],["Xu","Jiatong",""],["Zhou","Ziyu",""],["Zhang","Hongbin",""]]}
{"id":"2308.05341","submitter":"Kristina Schaaff","authors":"Lorenz Mindner, Tim Schlippe, Kristina Schaaff","title":"Classification of Human- and AI-Generated Texts: Investigating Features\n  for ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, generative AIs like ChatGPT have become available to the wide\npublic. These tools can for instance be used by students to generate essays or\nwhole theses. But how does a teacher know whether a text is written by a\nstudent or an AI? In our work, we explore traditional and new features to (1)\ndetect text generated by AI from scratch and (2) text rephrased by AI. Since we\nfound that classification is more difficult when the AI has been instructed to\ncreate the text in a way that a human would not recognize that it was generated\nby an AI, we also investigate this more advanced case. For our experiments, we\nproduced a new text corpus covering 10 school topics. Our best systems to\nclassify basic and advanced human-generated/AI-generated texts have F1-scores\nof over 96%. Our best systems for classifying basic and advanced\nhuman-generated/AI-rephrased texts have F1-scores of more than 78%. The systems\nuse a combination of perplexity, semantic, list lookup, error-based,\nreadability, AI feedback, and text vector features. Our results show that the\nnew features substantially help to improve the performance of many classifiers.\nOur best basic text rephrasing detection system even outperforms GPTZero by\n183.8% relative in F1-score.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:09:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mindner","Lorenz",""],["Schlippe","Tim",""],["Schaaff","Kristina",""]]}
{"id":"2308.05342","submitter":"Yuqing Wang","authors":"Yuqing Wang, Yun Zhao","title":"Metacognitive Prompting Improves Understanding in Large Language Models","comments":"9 pages, in submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In Large Language Models (LLMs), there have been consistent advancements in\ntask-specific performance, largely influenced by effective prompt design. While\nrecent research on prompting has enhanced the reasoning capabilities of LLMs, a\ngap remains in further improving their understanding abilities. In this study,\nwe introduce Metacognitive Prompting (MP), a strategy inspired by human\nintrospective reasoning processes. Using MP, LLMs undergo a systematic series\nof structured, self-aware evaluations, drawing on both their vast inherent\nknowledge and new insights. Our experiments involve five prevalent LLMs:\nLlama2, Vicuna, PaLM, GPT-3.5, and GPT-4, all of which span various general\nnatural language understanding (NLU) tasks from the GLUE and SuperGLUE\nbenchmarks. Results indicate that, although GPT-4 consistently excels in most\ntasks, PaLM, when equipped with MP, approaches its performance level.\nFurthermore, across models and datasets, MP consistently outperforms existing\nprompting methods, including standard and chain-of-thought prompting. This\nstudy underscores the potential to amplify the understanding abilities of LLMs\nand highlights the benefits of mirroring human introspective reasoning in NLU\ntasks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:10:17 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 22:58:04 GMT"},{"version":"v3","created":"Thu, 17 Aug 2023 04:53:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yuqing",""],["Zhao","Yun",""]]}
{"id":"2308.05343","submitter":"Huan-Yu Teng","authors":"Huan-Yu Teng, Bun'ei Sato, Masayuki Kuzuhara, Takuya Takarada, Masashi\n  Omiya, Hiroki Harakawa, Hideyuki Izumiura, Eiji Kambe, Mesut Yilmaz, Ilfan\n  Bikmaev, Selim O. Selam, Timothy D. Brandt, Guang-Yao Xiao, Michitoshi\n  Yoshida, Yoichi Itoh, Hiroyasu Ando, Eiichiro Kokubo, Shigeru Ida","title":"Revisiting Planetary Systems in Okayama Planet Search Program: A new\n  long-period planet, RV astrometry joint analysis, and\n  multiplicity-metallicity trend around evolved stars","comments":"49 figures, 4 tables, accepted by PASJ, RV data will be available\n  online as supplementary after the publication","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we revisit 32 planetary systems around evolved stars observed\nwithin the framework of the Okayama Planet Search Program and its collaborative\nframework of the EAPS-Net to search for additional companions and investigate\nthe properties of stars and giant planets in multiple-planet systems. With our\nlatest radial velocities obtained from Okayama Astrophysical Observatory (OAO),\nwe confirm an additional giant planet in the wide orbit of 75 Cet system\n($P_{\\rm{c}} = 2051.62_{-40.47}^{+45.98}\\ \\rm{d}$, $M_{\\rm{c}}\\sin\ni=0.912_{-0.090}^{+0.088}\\ M_{\\rm{J}}$, and\n$a_{\\rm{c}}=3.929_{-0.058}^{+0.052}\\ \\rm{au}$), along with five stars\nexhibiting long-term radial velocity accelerations, which indicates massive\ncompanions in the wide orbits. We have also found that the radial velocity\nvariations of several planet-harboring stars may indicate additional planet\ncandidates, stellar activities, or other understudied sources. These stars\ninclude $\\epsilon$ Tau, 11 Com, 24 Boo, 41 Lyn, 14 And, HD 32518, and $\\omega$\nSer. We further constrain the orbital configuration of the HD 5608, HD 14067,\nHD 120084, and HD 175679 systems by combining radial velocities with\nastrometry, as their host central stars exhibit significant astrometric\naccelerations. For other systems, we simply refine their orbital parameters.\nMoreover, our study indicates that the OPSP planet-harboring stars are more\nmetal-poor compared to the currently known planet-harboring stars, and this is\nlikely due to the $B-V$ color upper limit at 1.0 for star selection in the\nbeginning of the survey. Finally, by investigating the less-massive giant\nplanets ($< 5 M_{\\rm{J}}$) around currently known planet-harboring evolved\nstars, we have found that metallicity positively correlates with the\nmultiplicity and total planet mass of the system, which can be evidence for the\ncore-accretion planet formation model.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:12:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Teng","Huan-Yu",""],["Sato","Bun'ei",""],["Kuzuhara","Masayuki",""],["Takarada","Takuya",""],["Omiya","Masashi",""],["Harakawa","Hiroki",""],["Izumiura","Hideyuki",""],["Kambe","Eiji",""],["Yilmaz","Mesut",""],["Bikmaev","Ilfan",""],["Selam","Selim O.",""],["Brandt","Timothy D.",""],["Xiao","Guang-Yao",""],["Yoshida","Michitoshi",""],["Itoh","Yoichi",""],["Ando","Hiroyasu",""],["Kokubo","Eiichiro",""],["Ida","Shigeru",""]]}
{"id":"2308.05344","submitter":"Alvaro Fernandez-Quilez","authors":"Alvaro Fernandez-Quilez, Tobias Nordstr\\\"om, Fredrik J\\\"aderling,\n  Svein Reidar Kjosavik and Martin Eklund","title":"Prostate Age Gap (PAG): An MRI surrogate marker of aging for prostate\n  cancer detection","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Background: Prostate cancer (PC) MRI-based risk calculators are commonly\nbased on biological (e.g. PSA), MRI markers (e.g. volume), and patient age.\nWhilst patient age measures the amount of years an individual has existed,\nbiological age (BA) might better reflect the physiology of an individual.\nHowever, surrogates from prostate MRI and linkage with clinically significant\nPC (csPC) remain to be explored. Purpose: To obtain and evaluate Prostate Age\nGap (PAG) as an MRI marker tool for csPC risk. Study type: Retrospective.\nPopulation: A total of 7243 prostate MRI slices from 468 participants who had\nundergone prostate biopsies. A deep learning model was trained on 3223 MRI\nslices cropped around the gland from 81 low-grade PC (ncsPC, Gleason score <=6)\nand 131 negative cases and tested on the remaining 256 participants.\nAssessment: Chronological age was defined as the age of the participant at the\ntime of the visit and used to train the deep learning model to predict the age\nof the patient. Following, we obtained PAG, defined as the model predicted age\nminus the patient's chronological age. Multivariate logistic regression models\nwere used to estimate the association through odds ratio (OR) and predictive\nvalue of PAG and compared against PSA levels and PI-RADS>=3. Statistical tests:\nT-test, Mann-Whitney U test, Permutation test and ROC curve analysis. Results:\nThe multivariate adjusted model showed a significant difference in the odds of\nclinically significant PC (csPC, Gleason score >=7) (OR =3.78, 95% confidence\ninterval (CI):2.32-6.16, P <.001). PAG showed a better predictive ability when\ncompared to PI-RADS>=3 and adjusted by other risk factors, including PSA\nlevels: AUC =0.981 vs AUC =0.704, p<.001. Conclusion: PAG was significantly\nassociated with the risk of clinically significant PC and outperformed other\nwell-established PC risk factors.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:20:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fernandez-Quilez","Alvaro",""],["Nordstr\u00f6m","Tobias",""],["J\u00e4derling","Fredrik",""],["Kjosavik","Svein Reidar",""],["Eklund","Martin",""]]}
{"id":"2308.05345","submitter":"Zhiyao Xie","authors":"Yao Lu, Shang Liu, Qijun Zhang, Zhiyao Xie","title":"RTLLM: An Open-Source Benchmark for Design RTL Generation with Large\n  Language Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inspired by the recent success of large language models (LLMs) like ChatGPT,\nresearchers start to explore the adoption of LLMs for agile hardware design,\nsuch as generating design RTL based on natural-language instructions. However,\nin existing works, their target designs are all relatively simple and in a\nsmall scale, and proposed by the authors themselves, making a fair comparison\namong different LLM solutions challenging. In addition, many prior works only\nfocus on the design correctness, without evaluating the design qualities of\ngenerated design RTL. In this work, we propose an open-source benchmark named\nRTLLM, for generating design RTL with natural language instructions. To\nsystematically evaluate the auto-generated design RTL, we summarized three\nprogressive goals, named syntax goal, functionality goal, and design quality\ngoal. This benchmark can automatically provide a quantitative evaluation of any\ngiven LLM-based solution. Furthermore, we propose an easy-to-use yet\nsurprisingly effective prompt engineering technique named self-planning, which\nproves to significantly boost the performance of GPT-3.5 in our proposed\nbenchmark.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:24:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lu","Yao",""],["Liu","Shang",""],["Zhang","Qijun",""],["Xie","Zhiyao",""]]}
{"id":"2308.05346","submitter":"Pan Mu","authors":"Defang Cai, Pan Mu, Sixian Chan, Zhanpeng Shao, Cong Bai","title":"Towards General and Fast Video Derain via Knowledge Distillation","comments":"6 pages; Accepted at IEEE ICME","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As a common natural weather condition, rain can obscure video frames and thus\naffect the performance of the visual system, so video derain receives a lot of\nattention. In natural environments, rain has a wide variety of streak types,\nwhich increases the difficulty of the rain removal task. In this paper, we\npropose a Rain Review-based General video derain Network via knowledge\ndistillation (named RRGNet) that handles different rain streak types with one\npre-training weight. Specifically, we design a frame grouping-based\nencoder-decoder network that makes full use of the temporal information of the\nvideo. Further, we use the old task model to guide the current model in\nlearning new rain streak types while avoiding forgetting. To consolidate the\nnetwork's ability to derain, we design a rain review module to play back data\nfrom old tasks for the current model. The experimental results show that our\ndeveloped general method achieves the best results in terms of running speed\nand derain effect.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:27:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cai","Defang",""],["Mu","Pan",""],["Chan","Sixian",""],["Shao","Zhanpeng",""],["Bai","Cong",""]]}
{"id":"2308.05347","submitter":"Jun Xu","authors":"Jun Xu, Hermann Wolter, Maria Colonna, Dan Cozma, Pawel Danielewicz,\n  Che Ming Ko, Akira Ono, ManYee Betty Tsang, Ying-Xun Zhang, Hui-Gan Cheng,\n  Natsumi Ikeno, Rohit Kumar, Jun Su, Hua Zheng, Zhen Zhang, Lie-Wen Chen,\n  Zhao-Qing Feng, Christoph Hartnack, Arnaud Le F\\`evre, Bao-An Li, Yasushi\n  Nara, Akira Ohnishi, and Feng-Shou Zhang","title":"Comparing pion production in transport simulations of heavy-ion\n  collisions at 270A MeV under controlled conditions","comments":"37 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Within the Transport Model Evaluation Project (TMEP), we present a detailed\nstudy of Sn+Sn collisions at 270A MeV, which are representative reactions used\nto study the equation of state at suprasaturation densities. We put particular\nemphasis on the production of pions and $\\Delta$ resonances, which have been\nused as probes of the nuclear symmetry energy. In this study, we prescribe a\ncommon and rather simple physical model, and follow in detail the results of 4\nBoltzmann-Uehling-Uhlenbeck (BUU) models and 6 quantum molecular dynamics (QMD)\nmodels. We find that the nucleonic evolution of the collision and the nucleonic\nobservables in these codes do not completely converge, but that the differences\namong the codes can be understood as being due to several reasons: the basic\ndifferences between BUU and QMD models in the representation of the phase-space\ndistributions, computational differences in the mean-field evaluation, and\ndifferences in the adopted strategies for the Pauli blocking in the collision\nintegrals. For pionic observables, we find that a higher maximum density leads\nto an enhanced pion yield and a reduced $\\pi^-/\\pi^+$ yield ratio, while a more\neffective Pauli blocking generally leads to a slightly suppressed pion yield\nand an enhanced $\\pi^-/\\pi^+$ yield ratio, although differences in its\nimplementations do not have a dominating role in the differences among the\ncodes. We specifically investigate the effect of the Coulomb force, and find\nthat it increases the total $\\pi^-/\\pi^+$ yield ratio but reduces the ratio at\nhigh pion energies. Using only the results of codes that strictly follow the\nhomework specifications, we find a convergence of the codes in the final\ncharged pion yield ratio to less than $15\\%$, while the uncertainty is expected\nto be reduced to about $4\\%$ if the same or similar ingredients are\nincorporated in each code.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:33:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Xu","Jun",""],["Wolter","Hermann",""],["Colonna","Maria",""],["Cozma","Dan",""],["Danielewicz","Pawel",""],["Ko","Che Ming",""],["Ono","Akira",""],["Tsang","ManYee Betty",""],["Zhang","Ying-Xun",""],["Cheng","Hui-Gan",""],["Ikeno","Natsumi",""],["Kumar","Rohit",""],["Su","Jun",""],["Zheng","Hua",""],["Zhang","Zhen",""],["Chen","Lie-Wen",""],["Feng","Zhao-Qing",""],["Hartnack","Christoph",""],["F\u00e8vre","Arnaud Le",""],["Li","Bao-An",""],["Nara","Yasushi",""],["Ohnishi","Akira",""],["Zhang","Feng-Shou",""]]}
{"id":"2308.05348","submitter":"Zhiqing Liu","authors":"Zhiqing Liu (on behalf of BESIII Collaboration)","title":"Spectroscopy at $e^+e^-$ colliders","comments":"10 pages, 10 figures. Proceeding for the 21st Conference on Flavor\n  Physics and CP Violation (FPCP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exotic hadron states beyond the conventional $qqq$ baryon and $q\\bar{q}$\nmeson configurations are well expected from QCD. Having been successful in the\npast decades, the heavy quarkonium sector is proved to be an ideal place for\nthe study of exotic hadrons. In this talk, I briefly review the recent progress\non exotic heavy quarkonium-like state at $e^+e^-$ machines, including BESIII,\nBelle/Belle II etc.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:33:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Zhiqing","","on behalf of BESIII Collaboration"]]}
{"id":"2308.05349","submitter":"Jae Hyoung Lee","authors":"Jae Hyoung Lee, Gue Myung Lee, and Tien Son Pham","title":"Existence theorems for optimal solutions in semi-algebraic optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider the problem of minimizing a lower semi-continuous semi-algebraic\nfunction $f \\colon \\mathbb{R}^n \\to \\mathbb{R} \\cup \\{+\\infty\\}$ on an\nunbounded closed semi-algebraic set $S \\subset \\mathbb{R}^n.$ Employing\nadequate tools of semi-algebraic geometry, we first establish some properties\nof the tangency variety of the restriction of $f$ on $S.$ Then we derive\nverifiable necessary and sufficient conditions for the existence of optimal\nsolutions of the problem as well as the boundedness from below and coercivity\nof the restriction of $f$ on $S.$ We also present a computable formula for the\noptimal value of the problem.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:35:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lee","Jae Hyoung",""],["Lee","Gue Myung",""],["Pham","Tien Son",""]]}
{"id":"2308.05350","submitter":"Mahindra Rautela","authors":"Mahindra Rautela, Amin Maghareh, Shirley Dyke, S. Gopalakrishnan","title":"Deep generative models for unsupervised delamination detection using\n  guided waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rising demands for robust structural health monitoring procedures\nfor aerospace structures, the scope of intelligent algorithms and learning\ntechniques is expanding. Supervised algorithms have shown promising results in\nthe field provided a large, balanced, and labeled amount of data for training.\nFor some applications like aerospace, the data collection process is\ncumbersome, time-taking, and costly. Also, generating possible damage scenarios\nin a laboratory setup is challenging because of the complexity of the damage\ninitiation and failure mechanism. Besides this, the uncertainties of the\nreal-time operation restrict the online prediction accuracy with supervised\nlearning. In this paper, deep generative models are proposed for unsupervised\ndelamination prediction as an anomaly detection problem. In this\none-class-based model, the deep learning network is trained to learn the\ndistribution of baseline signals. In the testing phase, damage signals and\nunseen baseline signals are fed into the trained network to predict the state\nof the structure, i.e., healthy or unhealthy (delamination). It is seen that\nthe proposed method can successfully predict the delamination with high\naccuracy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:44:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Rautela","Mahindra",""],["Maghareh","Amin",""],["Dyke","Shirley",""],["Gopalakrishnan","S.",""]]}
{"id":"2308.05351","submitter":"Pavlos Lagoudakis Prof","authors":"Krzysztof Sawicki, Dmitriy Dovzhenko, Yuan Wang, Helgi Sigur{\\dh}sson,\n  and Pavlos G. Lagoudakis","title":"Occupancy-driven Zeeman suppression and inversion in trapped polariton\n  condensates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the magneto-photoluminescence of an optically trapped\nexciton-polariton condensate in a planar semiconductor microcavity with\nmultiple In0.08Ga0.92As quantum wells. Extremely high condensate coherence time\nand continuous control over the polariton confinement are amongst the\nadvantages provided by optical trapping. This allows us to resolve magnetically\ninduced {\\mu}eV fine energy shifts in the condensate, and identify unusual\ndynamical regions in its parameter space. We observe polariton Zeeman splitting\nand, in small traps with tight confinement, demonstrate its full parametric\nscreening when the condensate density exceeds a critical value, reminiscent of\nthe spin- Meissner effect. For larger optical traps, we observe a complete\ninversion in the Zeeman splitting as a function of power, underlining the\nimportance of condensate confinement and interactions with its background\nreservoir excitons.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:44:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sawicki","Krzysztof",""],["Dovzhenko","Dmitriy",""],["Wang","Yuan",""],["Sigur\u00f0sson","Helgi",""],["Lagoudakis","Pavlos G.",""]]}
{"id":"2308.05352","submitter":"Chenyang Zhang","authors":"Chenyang Zhang, Tiansu Chen, Rohan Nedungadi, Eric Shaffer, Elahe\n  Soltanaghai","title":"FocusFlow: Leveraging Focal Depth for Gaze Interaction in Virtual\n  Reality","comments":null,"journal-ref":null,"doi":"10.1145/3586182.3615818","report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current gaze input methods for VR headsets predominantly utilize the gaze ray\nas a pointing cursor, often neglecting depth information in it. This study\nintroduces FocusFlow, a novel gaze interaction technique that integrates focal\ndepth into gaze input dimensions, facilitating users to actively shift their\nfocus along the depth dimension for interaction. A detection algorithm to\nidentify the user's focal depth is developed. Based on this, a layer-based UI\nis proposed, which uses focal depth changes to enable layer switch operations,\noffering an intuitive hands-free selection method. We also designed visual cues\nto guide users to adjust focal depth accurately and get familiar with the\ninteraction process. Preliminary evaluations demonstrate the system's\nusability, and several potential applications are discussed. Through FocusFlow,\nwe aim to enrich the input dimensions of gaze interaction, achieving more\nintuitive and efficient human-computer interactions on headset devices.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:45:31 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 16:04:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Chenyang",""],["Chen","Tiansu",""],["Nedungadi","Rohan",""],["Shaffer","Eric",""],["Soltanaghai","Elahe",""]]}
{"id":"2308.05353","submitter":"Adam Breuer","authors":"Adam Breuer, Nazanin Khosravani, Michael Tingley, Bradford Cottel","title":"Preemptive Detection of Fake Accounts on Social Networks via Multi-Class\n  Preferential Attachment Classifiers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we describe a new algorithm called Preferential Attachment\nk-class Classifier (PreAttacK) for detecting fake accounts in a social network.\nRecently, several algorithms have obtained high accuracy on this problem.\nHowever, they have done so by relying on information about fake accounts'\nfriendships or the content they share with others--the very things we seek to\nprevent. PreAttacK represents a significant departure from these approaches. We\nprovide some of the first detailed distributional analyses of how new fake (and\nreal) accounts first attempt to request friends after joining a major network\n(Facebook). We show that even before a new account has made friends or shared\ncontent, these initial friend request behaviors evoke a natural multi-class\nextension of the canonical Preferential Attachment model of social network\ngrowth. We use this model to derive a new algorithm, PreAttacK. We prove that\nin relevant problem instances, PreAttacK near-optimally approximates the\nposterior probability that a new account is fake under this multi-class\nPreferential Attachment model of new accounts' (not-yet-answered) friend\nrequests. These are the first provable guarantees for fake account detection\nthat apply to new users, and that do not require strong homophily assumptions.\nThis principled approach also makes PreAttacK the only algorithm with provable\nguarantees that obtains state-of-the-art performance on new users on the global\nFacebook network, where it converges to AUC=0.9 after new users send + receive\na total of just 20 not-yet-answered friend requests. For comparison,\nstate-of-the-art benchmarks do not obtain this AUC even after observing\nadditional data on new users' first 100 friend requests. Thus, unlike\nmainstream algorithms, PreAttacK converges before the median new fake account\nhas made a single friendship (accepted friend request) with a human.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:49:30 GMT"}],"update_date":"2023-08-13","authors_parsed":[["Breuer","Adam",""],["Khosravani","Nazanin",""],["Tingley","Michael",""],["Cottel","Bradford",""]]}
{"id":"2308.05354","submitter":"Linhu Li","authors":"Jiang Yao, Linhu Li","title":"Extrinsic higher-order topological corner states in AB-stacked\n  transition-metal dichalcogenides","comments":"11 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Higher-order topological insulators (HOTIs) are a novel type of topological\nphases which supports $d$-dimensional topological boundary states in\n$D$-dimensional systems with $D-d>1$. In this work, we theoretically predict\nthat interlayer couplings in AB-stacked bilayer transition-metal\ndichalcogenides (TMDs) lead to the emergence of extrinsic second-order\ntopological phases, where corner states are induced by the band inversion of\nzigzag edge bands. We find that the systems feature a quantized multiband Berry\nphase defined for a zigzag nanoribbon geometry, unveiling the nontrivial\ntopological properties of its two zigzag edges. With detailed investigation\ninto the bilayer TMDs under different geometries, we find two types of\nboundary-obstructed corner states arising from different corner terminations of\neither the same type of or heterogeneous zigzag edges. The topological nature\nof these corner states and their degeneracy is further analyzed with both the\ncrystalline symmetries of different geometries, and a topological phase\ntransition of the Berry phase induced by a layer-dependent onsite energy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:51:02 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 04:30:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yao","Jiang",""],["Li","Linhu",""]]}
{"id":"2308.05355","submitter":"Xinquan Yang","authors":"Xinquan Yang and Jinheng Xie and Xuechen Li and Xuguang Li and Linlin\n  Shen and Yongqiang Deng","title":"TCSloT: Text Guided 3D Context and Slope Aware Triple Network for Dental\n  Implant Position Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In implant prosthesis treatment, the surgical guide of implant is used to\nensure accurate implantation. However, such design heavily relies on the manual\nlocation of the implant position. When deep neural network has been proposed to\nassist the dentist in locating the implant position, most of them take a single\nslice as input, which do not fully explore 3D contextual information and\nignoring the influence of implant slope. In this paper, we design a Text Guided\n3D Context and Slope Aware Triple Network (TCSloT) which enables the perception\nof contextual information from multiple adjacent slices and awareness of\nvariation of implant slopes. A Texture Variation Perception (TVP) module is\ncorrespondingly elaborated to process the multiple slices and capture the\ntexture variation among slices and a Slope-Aware Loss (SAL) is proposed to\ndynamically assign varying weights for the regression head. Additionally, we\ndesign a conditional text guidance (CTG) module to integrate the text condition\n(i.e., left, middle and right) from the CLIP for assisting the implant position\nprediction. Extensive experiments on a dental implant dataset through five-fold\ncross-validation demonstrated that the proposed TCSloT achieves superior\nperformance than existing methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:51:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yang","Xinquan",""],["Xie","Jinheng",""],["Li","Xuechen",""],["Li","Xuguang",""],["Shen","Linlin",""],["Deng","Yongqiang",""]]}
{"id":"2308.05356","submitter":"Ravshan Ashurov","authors":"Ravshan Ashurov and Marjona Shakarova","title":"Inverse problem for the subdiffusion equation with non-local in time\n  condition","comments":"arXiv admin note: substantial text overlap with arXiv:2211.00081","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the Hilbert space $H$, the inverse problem of determining the right-hand\nside of the abstract subdiffusion equation with the fractional Caputo\nderivative is considered. For the forward problem, a non-local in time\ncondition $u(0)=u(T)$ is taken. The right-hand side of the equation has the\nform $fg(t)$, and the unknown element is $f\\in H$. If function $g(t)$ does not\nchange sign, then under a over-determination condition $ u (t_0)= \\psi $,\n$t_0\\in (0, T)$, it is proved that the solution of the inverse problem exists\nand is unique. An example is given showing the violation of the uniqueness of\nthe solution for some sign-changing functions $g(t)$. For such functions\n$g(t)$, under certain conditions on this function, one can achieve\nwell-posedness of the problem by choosing $t_0$. And for some $g(t)$, for the\nexistence of a solution to the inverse problem, certain orthogonality\nconditions must be satisfied and in this case there is no uniqueness. All the\nresults obtained are also new for the classical diffusion equations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:53:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ashurov","Ravshan",""],["Shakarova","Marjona",""]]}
{"id":"2308.05357","submitter":"Qing Zhou","authors":"Qing Zhou, Xueming Tang, Songfeng Lu, Hao Yang","title":"Quantum-inspired Hash Function Based on Parity-dependent Quantum Walks\n  with Memory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we develop a generic controlled alternate quantum walk model\n(called CQWM-P) by combining parity-dependent quantum walks with distinct\narbitrary memory lengths and then construct a quantum-inspired hash function\n(called QHFM-P) based on this model. Numerical simulation shows that QHFM-P has\nnear-ideal statistical performance and is on a par with the state-of-the-art\nhash functions based on discrete quantum walks in terms of sensitivity of hash\nvalue to message, diffusion and confusion properties, uniform distribution\nproperty, and collision resistance property. Stability test illustrates that\nthe statistical properties of the proposed hash function are robust with\nrespect to the coin parameters, and theoretical analysis indicates that QHFM-P\nhas the same computational complexity as that of its peers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:54:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhou","Qing",""],["Tang","Xueming",""],["Lu","Songfeng",""],["Yang","Hao",""]]}
{"id":"2308.05358","submitter":"Guozhang Liu","authors":"Guozhang Liu, Baochai Peng, Ting Liu, Pan Zhang, Mengke Yuan, Chaoran\n  Lu, Ningning Cao, Sen Zhang, Simin Huang, Tao Wang","title":"Fine-grained building roof instance segmentation based on domain adapted\n  pretraining and composite dual-backbone","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The diversity of building architecture styles of global cities situated on\nvarious landforms, the degraded optical imagery affected by clouds and shadows,\nand the significant inter-class imbalance of roof types pose challenges for\ndesigning a robust and accurate building roof instance segmentor. To address\nthese issues, we propose an effective framework to fulfill semantic\ninterpretation of individual buildings with high-resolution optical satellite\nimagery. Specifically, the leveraged domain adapted pretraining strategy and\ncomposite dual-backbone greatly facilitates the discriminative feature\nlearning. Moreover, new data augmentation pipeline, stochastic weight averaging\n(SWA) training and instance segmentation based model ensemble in testing are\nutilized to acquire additional performance boost. Experiment results show that\nour approach ranks in the first place of the 2023 IEEE GRSS Data Fusion Contest\n(DFC) Track 1 test phase ($mAP_{50}$:50.6\\%). Note-worthily, we have also\nexplored the potential of multimodal data fusion with both optical satellite\nimagery and SAR data.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:54:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Guozhang",""],["Peng","Baochai",""],["Liu","Ting",""],["Zhang","Pan",""],["Yuan","Mengke",""],["Lu","Chaoran",""],["Cao","Ningning",""],["Zhang","Sen",""],["Huang","Simin",""],["Wang","Tao",""]]}
{"id":"2308.05359","submitter":"Jie Hu","authors":"Jie Hu, Chen Chen, Liujuan Cao, Shengchuan Zhang, Annan Shu, Guannan\n  Jiang, and Rongrong Ji","title":"Pseudo-label Alignment for Semi-supervised Instance Segmentation","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pseudo-labeling is significant for semi-supervised instance segmentation,\nwhich generates instance masks and classes from unannotated images for\nsubsequent training. However, in existing pipelines, pseudo-labels that contain\nvaluable information may be directly filtered out due to mismatches in class\nand mask quality. To address this issue, we propose a novel framework, called\npseudo-label aligning instance segmentation (PAIS), in this paper. In PAIS, we\ndevise a dynamic aligning loss (DALoss) that adjusts the weights of\nsemi-supervised loss terms with varying class and mask score pairs. Through\nextensive experiments conducted on the COCO and Cityscapes datasets, we\ndemonstrate that PAIS is a promising framework for semi-supervised instance\nsegmentation, particularly in cases where labeled data is severely limited.\nNotably, with just 1\\% labeled data, PAIS achieves 21.2 mAP (based on\nMask-RCNN) and 19.9 mAP (based on K-Net) on the COCO dataset, outperforming the\ncurrent state-of-the-art model, \\ie, NoisyBoundary with 7.7 mAP, by a margin of\nover 12 points. Code is available at: \\url{https://github.com/hujiecpp/PAIS}.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:56:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hu","Jie",""],["Chen","Chen",""],["Cao","Liujuan",""],["Zhang","Shengchuan",""],["Shu","Annan",""],["Jiang","Guannan",""],["Ji","Rongrong",""]]}
{"id":"2308.05360","submitter":"Mrunmay Jagadale","authors":"Sergei Gukov, Mrunmay Jagadale","title":"$c_{\\text{eff}}$ for 3d $\\mathcal{N}=2$ theories","comments":"18 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on the observed behavior of the superconformal index in\nthree-dimensional $\\mathcal{N}=2$ theories, we propose a quantity that can be\nconsidered as an analogue of the \"effective central charge.\" We discuss the\ngeneral properties of this quantity and ways of computing it in a variety of\ndifferent theories, including simple Lagrangian theories as well as more\ninteresting strongly coupled examples that come from 3d-3d correspondence.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:01:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gukov","Sergei",""],["Jagadale","Mrunmay",""]]}
{"id":"2308.05361","submitter":"Siqiao Xue","authors":"Siqiao Xue, Fan Zhou, Yi Xu, Hongyu Zhao, Shuo Xie, Qingyang Dai,\n  Caigao Jiang, James Zhang, Jun Zhou, Dacheng Xiu, Hongyuan Mei","title":"WeaverBird: Empowering Financial Decision-Making with Large Language\n  Model, Knowledge Base, and Search Engine","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present WeaverBird, an intelligent dialogue system designed specifically\nfor the finance domain. Our system harnesses a large language model of GPT\narchitecture that has been tuned using extensive corpora of finance-related\ntext. As a result, our system possesses the capability to understand complex\nfinancial queries, such as \"How should I manage my investments during\ninflation?\", and provide informed responses. Furthermore, our system\nincorporates a local knowledge base and a search engine to retrieve relevant\ninformation. The final responses are conditioned on the search results and\ninclude proper citations to the sources, thus enjoying an enhanced credibility.\nThrough a range of finance-related questions, we have demonstrated the superior\nperformance of our system compared to other models. To experience our system\nfirsthand, users can interact with our live demo at\nhttps://weaverbird.ttic.edu, as well as watch our 2-min video illustration at\nhttps://www.youtube.com/watch?v=fyV2qQkX6Tc.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:08:20 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 03:11:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xue","Siqiao",""],["Zhou","Fan",""],["Xu","Yi",""],["Zhao","Hongyu",""],["Xie","Shuo",""],["Dai","Qingyang",""],["Jiang","Caigao",""],["Zhang","James",""],["Zhou","Jun",""],["Xiu","Dacheng",""],["Mei","Hongyuan",""]]}
{"id":"2308.05362","submitter":"Yiling He","authors":"Yiling He, Jian Lou, Zhan Qin, Kui Ren","title":"FINER: Enhancing State-of-the-art Classifiers with Feature Attribution\n  to Facilitate Security Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Deep learning classifiers achieve state-of-the-art performance in various\nrisk detection applications. They explore rich semantic representations and are\nsupposed to automatically discover risk behaviors. However, due to the lack of\ntransparency, the behavioral semantics cannot be conveyed to downstream\nsecurity experts to reduce their heavy workload in security analysis. Although\nfeature attribution (FA) methods can be used to explain deep learning, the\nunderlying classifier is still blind to what behavior is suspicious, and the\ngenerated explanation cannot adapt to downstream tasks, incurring poor\nexplanation fidelity and intelligibility. In this paper, we propose FINER, the\nfirst framework for risk detection classifiers to generate high-fidelity and\nhigh-intelligibility explanations. The high-level idea is to gather explanation\nefforts from model developer, FA designer, and security experts. To improve\nfidelity, we fine-tune the classifier with an explanation-guided multi-task\nlearning strategy. To improve intelligibility, we engage task knowledge to\nadjust and ensemble FA methods. Extensive evaluations show that FINER improves\nexplanation quality for risk detection. Moreover, we demonstrate that FINER\noutperforms a state-of-the-art tool in facilitating malware analysis.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:10:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["He","Yiling",""],["Lou","Jian",""],["Qin","Zhan",""],["Ren","Kui",""]]}
{"id":"2308.05363","submitter":"Sumeet Chougule Dr.","authors":"Sumeet Chougule","title":"Explorations in 2+1 AdS Pure Gravity: Path Integral Formulation and\n  Partition Function Analyses in BTZ Mini-Superspace","comments":null,"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 work, we employ the Hamiltonian approach to analyze the Lorentzian\npath integral in 2+1 AdS gravity, with an aim to sum over all possible\ngeometries, including naked singularities and BTZ black holes, between fixed\ninitial and final surfaces. A novel path integral measure, grounded on the\nmetric over mini-superspace, is proposed for executing the path integral.\nShifting to Euclidean geometries, we derive the temperature and angular\npotential of Euclidean naked singularities within the partition function.\nSignificantly, without utilizing conformal field theory, we extract logarithmic\ncorrections to the entropy of BTZ black holes and compute the entropy of naked\nsingularities, along with their log corrections.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:16:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chougule","Sumeet",""]]}
{"id":"2308.05364","submitter":"Christopher A. Metz","authors":"Christopher A. Metz","title":"Machine Learning aided Computer Architecture Design for CNN Inferencing\n  Systems","comments":null,"journal-ref":null,"doi":"10.13140/RG.2.2.25637.47840","report-no":null,"categories":"cs.AR cs.AI cs.DC cs.LG cs.PF","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Efficient and timely calculations of Machine Learning (ML) algorithms are\nessential for emerging technologies like autonomous driving, the Internet of\nThings (IoT), and edge computing. One of the primary ML algorithms used in such\nsystems is Convolutional Neural Networks (CNNs), which demand high\ncomputational resources. This requirement has led to the use of ML accelerators\nlike GPGPUs to meet design constraints. However, selecting the most suitable\naccelerator involves Design Space Exploration (DSE), a process that is usually\ntime-consuming and requires significant manual effort. Our work presents\napproaches to expedite the DSE process by identifying the most appropriate\nGPGPU for CNN inferencing systems. We have developed a quick and precise\ntechnique for forecasting the power and performance of CNNs during inference,\nwith a MAPE of 5.03% and 5.94%, respectively. Our approach empowers computer\narchitects to estimate power and performance in the early stages of\ndevelopment, reducing the necessity for numerous prototypes. This saves time\nand money while also improving the time-to-market period.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:17:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Metz","Christopher A.",""]]}
{"id":"2308.05365","submitter":"Pinxian Zeng","authors":"Jiaqi Cui, Pinxian Zeng, Xinyi Zeng, Peng Wang, Xi Wu, Jiliu Zhou, Yan\n  Wang, and Dinggang Shen","title":"TriDo-Former: A Triple-Domain Transformer for Direct PET Reconstruction\n  from Low-Dose Sinograms","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 obtain high-quality positron emission tomography (PET) images while\nminimizing radiation exposure, various methods have been proposed for\nreconstructing standard-dose PET (SPET) images from low-dose PET (LPET)\nsinograms directly. However, current methods often neglect boundaries during\nsinogram-to-image reconstruction, resulting in high-frequency distortion in the\nfrequency domain and diminished or fuzzy edges in the reconstructed images.\nFurthermore, the convolutional architectures, which are commonly used, lack the\nability to model long-range non-local interactions, potentially leading to\ninaccurate representations of global structures. To alleviate these problems,\nwe propose a transformer-based model that unites triple domains of sinogram,\nimage, and frequency for direct PET reconstruction, namely TriDo-Former.\nSpecifically, the TriDo-Former consists of two cascaded networks, i.e., a\nsinogram enhancement transformer (SE-Former) for denoising the input LPET\nsinograms and a spatial-spectral reconstruction transformer (SSR-Former) for\nreconstructing SPET images from the denoised sinograms. Different from the\nvanilla transformer that splits an image into 2D patches, based specifically on\nthe PET imaging mechanism, our SE-Former divides the sinogram into 1D\nprojection view angles to maintain its inner-structure while denoising,\npreventing the noise in the sinogram from prorogating into the image domain.\nMoreover, to mitigate high-frequency distortion and improve reconstruction\ndetails, we integrate global frequency parsers (GFPs) into SSR-Former. The GFP\nserves as a learnable frequency filter that globally adjusts the frequency\ncomponents in the frequency domain, enforcing the network to restore\nhigh-frequency details resembling real SPET images. Validations on a clinical\ndataset demonstrate that our TriDo-Former outperforms the state-of-the-art\nmethods qualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:20:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cui","Jiaqi",""],["Zeng","Pinxian",""],["Zeng","Xinyi",""],["Wang","Peng",""],["Wu","Xi",""],["Zhou","Jiliu",""],["Wang","Yan",""],["Shen","Dinggang",""]]}
{"id":"2308.05366","submitter":"Quan Wang","authors":"Quan Wang, Mei Zhang, Shangbin Yang, Xiao Yang, Xiaoshuai Zhu","title":"Change ratios of magnetic helicity and magnetic free energy during major\n  solar flares","comments":"17 pages, 5 figures, 2 tables, accepted for publication in RAA","journal-ref":null,"doi":"10.1088/1674-4527/acee4f","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetic helicity is an important concept in solar physics, with a number of\ntheoretical statements pointing out the important role of magnetic helicity in\nsolar flares and coronal mass ejections (CMEs). Here we construct a sample of\n47 solar flares, which contains 18 no-CME-associated confined flares and 29\nCME-associated eruptive flares. We calculate the change ratios of magnetic\nhelicity and magnetic free energy before and after these 47 flares. Our\ncalculations show that the change ratios of magnetic helicity and magnetic free\nenergy show distinct different distributions in confined flares and eruptive\nflares. The median value of the change ratios of magnetic helicity in confined\nflares is $-0.8$%, while this number is $-14.5$% for eruptive flares. For the\nmagnetic free energy, the median value of the change ratios is $-4.3$% for\nconfined flares, whereas this number is $-14.6$% for eruptive flares. This\nstatistical result, using observational data, is well consistent with the\ntheoretical understandings that magnetic helicity is approximately conserved in\nthe magnetic reconnection, as shown by confined flares, and the CMEs take away\nmagnetic helicity from the corona, as shown by eruptive flares.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:20:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Quan",""],["Zhang","Mei",""],["Yang","Shangbin",""],["Yang","Xiao",""],["Zhu","Xiaoshuai",""]]}
{"id":"2308.05367","submitter":"Christian Hofbauer","authors":"Christian Hofbauer, Werner Haselmayr, Hans-Peter Bernhard, and Mario\n  Huemer","title":"Analysis and Compensation of Carrier Frequency Offset Impairments in\n  Unique Word OFDM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unique Word-orthogonal frequency division multiplexing (UW-OFDM) is known to\nprovide various performance benefits over conventional cyclic prefix (CP) based\nOFDM. Most important, UW-OFDM features excellent spectral sidelobe suppression\nproperties and an outstanding bit error ratio (BER) performance. Carrier\nfrequency offset (CFO) induced impairments denote a challenging task for OFDM\nsystems of any kind. In this work we investigate the CFO effects on UW-OFDM and\ncompare it to conventional multi-carrier and single-carrier systems. Different\nCFO compensation approaches with different computational complexity are\nconsidered throughout this work and assessed against each other. A mean squared\nerror analysis carried out after data estimation reveals a significant higher\nrobustness of UW-OFDM over CP-OFDM against CFO effects. Additionally, the\nconducted BER simulations generally support this conclusion for various\nscenarios, ranging from uncoded to coded transmission in a frequency selective\nenvironment.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:23:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hofbauer","Christian",""],["Haselmayr","Werner",""],["Bernhard","Hans-Peter",""],["Huemer","Mario",""]]}
{"id":"2308.05368","submitter":"Jacopo Tagliabue","authors":"Jacopo Tagliabue, Ciro Greco, Luca Bigon","title":"Building a serverless Data Lakehouse from spare parts","comments":"Paper accepted for the Second International Workshop on Composable\n  Data Management Systems (@ VLDB 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.DC cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recently proposed Data Lakehouse architecture is built on open file\nformats, performance, and first-class support for data transformation, BI and\ndata science: while the vision stresses the importance of lowering the barrier\nfor data work, existing implementations often struggle to live up to user\nexpectations. At Bauplan, we decided to build a new serverless platform to\nfulfill the Lakehouse vision. Since building from scratch is a challenge unfit\nfor a startup, we started by re-using (sometimes unconventionally) existing\nprojects, and then investing in improving the areas that would give us the\nhighest marginal gains for the developer experience. In this work, we review\nuser experience, high-level architecture and tooling decisions, and conclude by\nsharing plans for future development.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:24:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Tagliabue","Jacopo",""],["Greco","Ciro",""],["Bigon","Luca",""]]}
{"id":"2308.05369","submitter":"Pradeep Nair","authors":"Kashimul Hossain, Dinesh Kabra, and Pradeep R. Nair","title":"Perovskite solar cells at radiative detailed balance limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.other physics.app-ph physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Here, we report the first experimental demonstration of perovskite solar\ncells at radiative detailed balance limit. To conclusively establish this\nclaim, we theoretically identified a set of quantitative benchmark\ncharacteristics expected from solar cells at radiative detailed balance limits.\nTransient as well as steady state intensity dependent measurements indicate\nthat our solar cells are indeed operating at such limits with interface\npassivation comparable to the champion c-Si technology. Remarkably, our\nanalysis also facilitates novel characterization schemes which enable\nconsistent back extraction of important recombination parameters from\nopto-electrical measurements. These results have significant implications\ntowards fundamental electronic processes in perovskite solar cells and further\nefficiency optimization towards Shockeley-Queisser limits.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:33:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hossain","Kashimul",""],["Kabra","Dinesh",""],["Nair","Pradeep R.",""]]}
{"id":"2308.05370","submitter":"Junnan Hu","authors":"Dongxiang Zhang, Teng Ma, Junnan Hu, Yijun Bei, Kian-Lee Tan, Gang\n  Chen","title":"Co-movement Pattern Mining from Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Co-movement pattern mining from GPS trajectories has been an intriguing\nsubject in spatial-temporal data mining. In this paper, we extend this research\nline by migrating the data source from GPS sensors to surveillance cameras, and\npresenting the first investigation into co-movement pattern mining from videos.\nWe formulate the new problem, re-define the spatial-temporal proximity\nconstraints from cameras deployed in a road network, and theoretically prove\nits hardness. Due to the lack of readily applicable solutions, we adapt\nexisting techniques and propose two competitive baselines using Apriori-based\nenumerator and CMC algorithm, respectively.\n  As the principal technical contributions, we introduce a novel index called\ntemporal-cluster suffix tree (TCS-tree), which performs two-level temporal\nclustering within each camera and constructs a suffix tree from the resulting\nclusters. Moreover, we present a sequence-ahead pruning framework based on\nTCS-tree, which allows for the simultaneous leverage of all pattern constraints\nto filter candidate paths. Finally, to reduce verification cost on the\ncandidate paths, we propose a sliding-window based co-movement pattern\nenumeration strategy and a hashing-based dominance eliminator, both of which\nare effective in avoiding redundant operations.\n  We conduct extensive experiments for scalability and effectiveness analysis.\nOur results validate the efficiency of the proposed index and mining algorithm,\nwhich runs remarkably faster than the two baseline methods. Additionally, we\nconstruct a video database with 1169 cameras and perform an end-to-end pipeline\nanalysis to study the performance gap between GPS-driven and video-driven\nmethods. Our results demonstrate that the derived patterns from the\nvideo-driven approach are similar to those derived from groundtruth\ntrajectories, providing evidence of its effectiveness.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:33:26 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 08:51:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Dongxiang",""],["Ma","Teng",""],["Hu","Junnan",""],["Bei","Yijun",""],["Tan","Kian-Lee",""],["Chen","Gang",""]]}
{"id":"2308.05371","submitter":"Tianchang Shen","authors":"Tianchang Shen, Jacob Munkberg, Jon Hasselgren, Kangxue Yin, Zian\n  Wang, Wenzheng Chen, Zan Gojcic, Sanja Fidler, Nicholas Sharp, Jun Gao","title":"Flexible Isosurface Extraction for Gradient-Based Mesh Optimization","comments":"SIGGRAPH 2023. Project page:\n  https://research.nvidia.com/labs/toronto-ai/flexicubes/","journal-ref":"ACM Transactions on Graphics, Volume 42, Issue 4, Article No.: 37,\n  August 2023","doi":"10.1145/3592430","report-no":null,"categories":"cs.GR cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This work considers gradient-based mesh optimization, where we iteratively\noptimize for a 3D surface mesh by representing it as the isosurface of a scalar\nfield, an increasingly common paradigm in applications including\nphotogrammetry, generative modeling, and inverse physics. Existing\nimplementations adapt classic isosurface extraction algorithms like Marching\nCubes or Dual Contouring; these techniques were designed to extract meshes from\nfixed, known fields, and in the optimization setting they lack the degrees of\nfreedom to represent high-quality feature-preserving meshes, or suffer from\nnumerical instabilities. We introduce FlexiCubes, an isosurface representation\nspecifically designed for optimizing an unknown mesh with respect to geometric,\nvisual, or even physical objectives. Our main insight is to introduce\nadditional carefully-chosen parameters into the representation, which allow\nlocal flexible adjustments to the extracted mesh geometry and connectivity.\nThese parameters are updated along with the underlying scalar field via\nautomatic differentiation when optimizing for a downstream task. We base our\nextraction scheme on Dual Marching Cubes for improved topological properties,\nand present extensions to optionally generate tetrahedral and\nhierarchically-adaptive meshes. Extensive experiments validate FlexiCubes on\nboth synthetic benchmarks and real-world applications, showing that it offers\nsignificant improvements in mesh quality and geometric fidelity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:40:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shen","Tianchang",""],["Munkberg","Jacob",""],["Hasselgren","Jon",""],["Yin","Kangxue",""],["Wang","Zian",""],["Chen","Wenzheng",""],["Gojcic","Zan",""],["Fidler","Sanja",""],["Sharp","Nicholas",""],["Gao","Jun",""]]}
{"id":"2308.05372","submitter":"Jhih-Huang Li","authors":"Jhih-Huang Li, Axel Saenz","title":"Contour Integral Formulas for PushASEP on the Ring","comments":"91 pages, 3 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 give contour integral formulas for the generating function of the joint\ndistribution of the PushASEP on a ring. We obtained these formulas through a\nrigorous treatment of Bethe Ansatz. The approach relies on residue computations\nand controlling the location of the Bethe roots, which we achieve by partially\ndecoupling the Bethe equations through extending the system of equations.\nMoreover, we are able to use our formulas to compute the asymptotic\nfluctuations for the flat and step initial conditions at the relaxation time\nscale.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:40:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Jhih-Huang",""],["Saenz","Axel",""]]}
{"id":"2308.05373","submitter":"Ilmun Kim","authors":"Ilmun Kim, Matey Neykov, Sivaraman Balakrishnan and Larry Wasserman","title":"Conditional Independence Testing for Discrete Distributions: Beyond\n  $\\chi^2$- and $G$-tests","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.CO stat.ME stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is concerned with the problem of conditional independence testing\nfor discrete data. In recent years, researchers have shed new light on this\nfundamental problem, emphasizing finite-sample optimality. The non-asymptotic\nviewpoint adapted in these works has led to novel conditional independence\ntests that enjoy certain optimality under various regimes. Despite their\nattractive theoretical properties, the considered tests are not necessarily\npractical, relying on a Poissonization trick and unspecified constants in their\ncritical values. In this work, we attempt to bridge the gap between theory and\npractice by reproving optimality without Poissonization and calibrating tests\nusing Monte Carlo permutations. Along the way, we also prove that classical\nasymptotic $\\chi^2$- and $G$-tests are notably sub-optimal in a\nhigh-dimensional regime, which justifies the demand for new tools. Our\ntheoretical results are complemented by experiments on both simulated and\nreal-world datasets. Accompanying this paper is an R package UCI that\nimplements the proposed tests.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:41:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kim","Ilmun",""],["Neykov","Matey",""],["Balakrishnan","Sivaraman",""],["Wasserman","Larry",""]]}
{"id":"2308.05374","submitter":"Yang Liu","authors":"Yang Liu, Yuanshun Yao, Jean-Francois Ton, Xiaoying Zhang, Ruocheng\n  Guo, Hao Cheng, Yegor Klochkov, Muhammad Faaiz Taufiq, and Hang Li","title":"Trustworthy LLMs: a Survey and Guideline for Evaluating Large Language\n  Models' Alignment","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":"  Ensuring alignment, which refers to making models behave in accordance with\nhuman intentions [1,2], has become a critical task before deploying large\nlanguage models (LLMs) in real-world applications. For instance, OpenAI devoted\nsix months to iteratively aligning GPT-4 before its release [3]. However, a\nmajor challenge faced by practitioners is the lack of clear guidance on\nevaluating whether LLM outputs align with social norms, values, and\nregulations. This obstacle hinders systematic iteration and deployment of LLMs.\nTo address this issue, this paper presents a comprehensive survey of key\ndimensions that are crucial to consider when assessing LLM trustworthiness. The\nsurvey covers seven major categories of LLM trustworthiness: reliability,\nsafety, fairness, resistance to misuse, explainability and reasoning, adherence\nto social norms, and robustness. Each major category is further divided into\nseveral sub-categories, resulting in a total of 29 sub-categories.\nAdditionally, a subset of 8 sub-categories is selected for further\ninvestigation, where corresponding measurement studies are designed and\nconducted on several widely-used LLMs. The measurement results indicate that,\nin general, more aligned models tend to perform better in terms of overall\ntrustworthiness. However, the effectiveness of alignment varies across the\ndifferent trustworthiness categories considered. This highlights the importance\nof conducting more fine-grained analyses, testing, and making continuous\nimprovements on LLM alignment. By shedding light on these key dimensions of LLM\ntrustworthiness, this paper aims to provide valuable insights and guidance to\npractitioners in the field. Understanding and addressing these concerns will be\ncrucial in achieving reliable and ethically sound deployment of LLMs in various\napplications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:43:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Yang",""],["Yao","Yuanshun",""],["Ton","Jean-Francois",""],["Zhang","Xiaoying",""],["Guo","Ruocheng",""],["Cheng","Hao",""],["Klochkov","Yegor",""],["Taufiq","Muhammad Faaiz",""],["Li","Hang",""]]}
{"id":"2308.05375","submitter":"Ariel Arza","authors":"Ariel Arza and Jason Evans","title":"Electron $g-2$ corrections from axion dark matter","comments":"6 pages, 2 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 consider the effects of a local axion dark matter background on the $g-2$\nof the electron. We calculate loop corrections to the photon-electron vertex\nand determine analytical formulas for the spin and cyclotron frequencies when\nthe electron is in an external magnetic field. By comparing with current\nmeasurements of these observables, we are able to place the strongest\nconstraint on the axion-elecron coupling for axion masses below\n$10^{-15}\\text{eV}$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:44:27 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Arza","Ariel",""],["Evans","Jason",""]]}
{"id":"2308.05376","submitter":"Christian J\\\"akle ChJ","authors":"Christian J\\\"akle, Lena Reichle, Stefan Volkwein","title":"Optimal Control of Dynamic District Heating Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the present paper an optimal control problem for a system of\ndifferential-algebraic equations (DAEs) is considered. This problem arises in\nthe dynamic optimization of unsteady district heating networks. Based on the\nCarath\\'eodory theory existence of a unique solution to the DAE system is\nproved using specific properties of the district heating network model.\nMoreover, it is shown that the optimal control problem possesses optimal\nsolutions. For the numerical experiments different networks are considered\nincluding also data from a real district heating network.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:46:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["J\u00e4kle","Christian",""],["Reichle","Lena",""],["Volkwein","Stefan",""]]}
{"id":"2308.05377","submitter":"Satyabrata Patnaik","authors":"K. Yadav, M. Lamba, M. Singh, A. Kumar, and S. Patnaik","title":"Conventional Type-II Superconductivity in 2H-TaSeS","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.other cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Superconductors based on transition metal dichalcogenides are of substantial\ncurrent relevance, towards attaining topological superconductivity. Here we\nreport a detailed study on the synthesis and electromagnetic characterization\nof high-quality single crystals of TaSeS. A superconducting transition is\nconfirmed at 4.15K with coexisting charge density wave onset at 66K. The\ntemperature dependence of RF penetration depth indicates s-wave characteristics\nin the weak coupling limit. A moderate electronic anisotropy is observed in\nupper critical fields with a value of 1.52. DFT calculations confirm the\npossibility of superconducting behavior of TaSeS and also suggest that the most\nstable structure belongs to P63mc space group. Negative values in phonon\ndispersion curves verify the possibility of co-existing CDW in 2H-TaSeS.\nArrhenius plots show power law dependence of activation energy with respect to\nmagnetic field. Overall all characteristics imply TaSeS to be a classic Type-II\nsuperconductor without any evidence for topological superconductivity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:47:29 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yadav","K.",""],["Lamba","M.",""],["Singh","M.",""],["Kumar","A.",""],["Patnaik","S.",""]]}
{"id":"2308.05378","submitter":"Biao Wang","authors":"Huixi Li, Biao Wang, Chunlin Wang, Shaoyun Yi","title":"On the Covering Systems of Polynomial Rings Over Finite Fields","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1950, Erd\\H{o}s posed a question known as the minimum modulus problem on\ncovering systems for $\\mathbb{Z}$, which asked whether the minimum modulus of a\ncovering system with distinct moduli is bounded. This long-standing problem was\nfinally resolved by Hough in 2015, as he proved that the minimum modulus of any\ncovering system with distinct moduli does not exceed $10^{16}$. In this paper,\nwe apply the distortion method to present a proof that the smallest degree of\nthe moduli in any covering system for $\\mathbb{F}_q[x]$ of multiplicity $s$ is\nbounded by a constant depending only on $s$ and $q$. Consequently, we\nsuccessfully resolve the minimum modulus problem for $\\mathbb{F}_q[x]$ and\ndisprove a conjecture by Azlin.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:47:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Huixi",""],["Wang","Biao",""],["Wang","Chunlin",""],["Yi","Shaoyun",""]]}
{"id":"2308.05379","submitter":"Zeyuan Chen","authors":"Zeyuan Chen, Wei Chen, Jia Xu, Zhongyi Liu, Wei Zhang","title":"Beyond Semantics: Learning a Behavior Augmented Relevance Model with\n  Self-supervised Learning","comments":"Partial content","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Relevance modeling aims to locate desirable items for corresponding queries,\nwhich is crucial for search engines to ensure user experience. Although most\nconventional approaches address this problem by assessing the semantic\nsimilarity between the query and item, pure semantic matching is not\neverything.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:52:53 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 09:49:21 GMT"},{"version":"v3","created":"Wed, 16 Aug 2023 03:59:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Zeyuan",""],["Chen","Wei",""],["Xu","Jia",""],["Liu","Zhongyi",""],["Zhang","Wei",""]]}
{"id":"2308.05380","submitter":"Josef Hanu\\v{s}","authors":"Josef Hanu\\v{s}, David Vokrouhlick\\'y, David Nesvorn\\'y, Josef\n  \\v{D}urech, Robert Stephens, Vladimir Benishek, Julian Oey, Petr Pokorn\\'y","title":"Shape models and spin states of Jupiter Trojans: Testing the streaming\n  instability formation scenario","comments":"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 leading theory for the origin of Jupiter Trojans (JTs) assumes that JTs\nwere captured to their orbits near the Lagrangian points of Jupiter during the\nearly reconfiguration of the giant planets. The natural source region for the\nmajority of JTs would then be the population of planetesimals born in a massive\ntrans-Neptunian disk. If true, JTs represent the most accessible stable\npopulation of small Solar System bodies that formed in the outer regions of the\nSolar System. For this work, we compiled photometric datasets for about 1000\nJTs and applied the convex inversion technique in order to assess their shapes\nand spin states. We obtained full solutions for $79$ JTs, and partial solutions\nfor an additional $31$ JTs. We found that the observed distribution of the pole\nobliquities of JTs is broadly consistent with expectations from the streaming\ninstability, which is the leading mechanism for the formation of planetesimals\nin the trans-Neptunian disk. The observed JTs' pole distribution has a slightly\nsmaller prograde vs. retrograde asymmetry (excess of obliquities $>130^\\circ$)\nthan what is expected from the existing streaming instability simulations.\nHowever, this discrepancy can be plausibly reconciled by the effects of the\npost-formation collisional activity. Our numerical simulations of the\npost-capture spin evolution indicate that the JTs' pole distribution is not\nsignificantly affected by dynamical processes such as the eccentricity\nexcitation in resonances, close encounters with planets, or the effects of\nnongravitational forces. However, a few JTs exhibit large latitude variations\nof the rotation pole and may even temporarily transition between prograde- and\nretrograde-rotating categories.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:52:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hanu\u0161","Josef",""],["Vokrouhlick\u00fd","David",""],["Nesvorn\u00fd","David",""],["\u010eurech","Josef",""],["Stephens","Robert",""],["Benishek","Vladimir",""],["Oey","Julian",""],["Pokorn\u00fd","Petr",""]]}
{"id":"2308.05381","submitter":"Jie JW Wu PhD","authors":"Jie JW Wu","title":"Application of Systems Engineering Process in Building ML-Enabled\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning (ML) components are being added to more and more critical\nand impactful software systems, but the software development process of\nreal-world production systems from prototyped ML models remains challenging\nwith additional complexity and interdisciplinary collaboration challenges. This\nposes difficulties in using traditional software lifecycle models such as\nwaterfall, spiral or agile model when building ML-enabled systems. By\ninterviewing with practitioners from multiple companies, we investigated the\napplication of using systems engineering process in ML-enabled systems. We\ndeveloped a set of propositions and proposed V4ML process model for building\nproducts with ML components. We found that V4ML process model requires more\nefforts on documentation, system decomposition and V&V, but it addressed the\ninterdisciplinary collaboration challenges and additional complexity introduced\nby ML components.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:53:32 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 01:12:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wu","Jie JW",""]]}
{"id":"2308.05382","submitter":"Chihiro Nakatani","authors":"Chihiro Nakatani, Hiroaki Kawashima, Norimichi Ukita","title":"Interaction-aware Joint Attention Estimation Using People Attributes","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":"  This paper proposes joint attention estimation in a single image. Different\nfrom related work in which only the gaze-related attributes of people are\nindependently employed, (I) their locations and actions are also employed as\ncontextual cues for weighting their attributes, and (ii) interactions among all\nof these attributes are explicitly modeled in our method. For the interaction\nmodeling, we propose a novel Transformer-based attention network to encode\njoint attention as low-dimensional features. We introduce a specialized MLP\nhead with positional embedding to the Transformer so that it predicts pixelwise\nconfidence of joint attention for generating the confidence heatmap. This\npixelwise prediction improves the heatmap accuracy by avoiding the ill-posed\nproblem in which the high-dimensional heatmap is predicted from the\nlow-dimensional features. The estimated joint attention is further improved by\nbeing integrated with general image-based attention estimation. Our method\noutperforms SOTA methods quantitatively in comparative experiments. Code:\nhttps://anonymous.4open.science/r/anonymized_codes-ECA4.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 06:55:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nakatani","Chihiro",""],["Kawashima","Hiroaki",""],["Ukita","Norimichi",""]]}
{"id":"2308.05383","submitter":"Jing Liu","authors":"Liangfei Duan, Tong Zhou, Huiqin Yang, Weihua Mu, Zhongshan Deng, Jing\n  Liu and Qingju Liu","title":"Liquid Metal Molecular Scissors","comments":"23 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Molecules are the smallest unit in matters that can exist independently,\nrelatively stable, and maintain physical and chemical activities. The atomic\nspecies, alignment commands, and chemical bonds are key factors to dominate\ntheir structures and properties. Here we disclosed a general chemistry effect\nthat the liquid metals can directly cut off oxygen-containing groups in various\nmolecular matters at room temperature, and then recombine the remaining groups\nto form functional materials including nano semiconductors. Based on this\nunique mechanism, we proposed a basic tool and named it as liquid metal\nscissors for molecular directional clipping and functional transformation. As\nproof-of-concept, we demonstrated the capabilities of eGaIn scissors made of Ga\nand In particles, and revealed that the Ga on the surface of eGaIn could\ndirectly snatch oxygen atoms from various targeted substances such as H2O, CO2\nor CH3OH molecules to form gallium oxides. As illustration, after clipping, the\nremaining hydrogen atoms of H2O molecules recombined to form H2, while the\nremaining groups of CH3OH lead to H2, carbon quantum dots, and other related\nsubstances. If needed, more molecules can also be manipulated via such\nscissors. This finding refreshes the basic knowledge of chemistry and suggests\neasygoing ways for molecular weaving, which may break up the limitations and\nsingle features of molecular substances. It also opens up a universal route for\ninnovating future molecular chemical engineering, life science, energy and\nenvironment, and biomedicine.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:00:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Duan","Liangfei",""],["Zhou","Tong",""],["Yang","Huiqin",""],["Mu","Weihua",""],["Deng","Zhongshan",""],["Liu","Jing",""],["Liu","Qingju",""]]}
{"id":"2308.05384","submitter":"Hongyang Du","authors":"Hongyang Du, Ruichen Zhang, Yinqiu Liu, Jiacheng Wang, Yijing Lin,\n  Zonghang Li, Dusit Niyato, Jiawen Kang, Zehui Xiong, Shuguang Cui, Bo Ai,\n  Haibo Zhou, Dong In Kim","title":"Beyond Deep Reinforcement Learning: A Tutorial on Generative Diffusion\n  Models in Network Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative Diffusion Models (GDMs) have emerged as a transformative force in\nthe realm of Generative Artificial Intelligence (GAI), demonstrating their\nversatility and efficacy across a variety of applications. The ability to model\ncomplex data distributions and generate high-quality samples has made GDMs\nparticularly effective in tasks such as image generation and reinforcement\nlearning. Furthermore, their iterative nature, which involves a series of noise\naddition and denoising steps, is a powerful and unique approach to learning and\ngenerating data. This paper serves as a comprehensive tutorial on applying GDMs\nin network optimization tasks. We delve into the strengths of GDMs, emphasizing\ntheir wide applicability across various domains, such as vision, text, and\naudio generation.We detail how GDMs can be effectively harnessed to solve\ncomplex optimization problems inherent in networks. The paper first provides a\nbasic background of GDMs and their applications in network optimization. This\nis followed by a series of case studies, showcasing the integration of GDMs\nwith Deep Reinforcement Learning (DRL), incentive mechanism design, Semantic\nCommunications (SemCom), Internet of Vehicles (IoV) networks, etc. These case\nstudies underscore the practicality and efficacy of GDMs in real-world\nscenarios, offering insights into network design. We conclude with a discussion\non potential future directions for GDM research and applications, providing\nmajor insights into how they can continue to shape the future of network\noptimization.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:02:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Du","Hongyang",""],["Zhang","Ruichen",""],["Liu","Yinqiu",""],["Wang","Jiacheng",""],["Lin","Yijing",""],["Li","Zonghang",""],["Niyato","Dusit",""],["Kang","Jiawen",""],["Xiong","Zehui",""],["Cui","Shuguang",""],["Ai","Bo",""],["Zhou","Haibo",""],["Kim","Dong In",""]]}
{"id":"2308.05385","submitter":"Tao Zou","authors":"Tao Zou, Le Yu, Leilei Sun, Bowen Du, Deqing Wang, Fuzhen Zhuang","title":"Adaptive Taxonomy Learning and Historical Patterns Modelling for Patent\n  Classification","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Patent classification aims to assign multiple International Patent\nClassification (IPC) codes to a given patent. Recent methods for automatically\nclassifying patents mainly focus on analyzing the text descriptions of patents.\nHowever, apart from the texts, each patent is also associated with some\nassignees, and the knowledge of their applied patents is often valuable for\nclassification. Furthermore, the hierarchical taxonomy formulated by the IPC\nsystem provides important contextual information and enables models to leverage\nthe correlations between IPC codes for more accurate classification. However,\nexisting methods fail to incorporate the above aspects. In this paper, we\npropose an integrated framework that comprehensively considers the information\non patents for patent classification. To be specific, we first present an IPC\ncodes correlations learning module to derive their semantic representations via\nadaptively passing and aggregating messages within the same level and across\ndifferent levels along the hierarchical taxonomy. Moreover, we design a\nhistorical application patterns learning component to incorporate the\ncorresponding assignee's previous patents by a dual channel aggregation\nmechanism. Finally, we combine the contextual information of patent texts that\ncontains the semantics of IPC codes, and assignees' sequential preferences to\nmake predictions. Experiments on real-world datasets demonstrate the\nsuperiority of our approach over the existing methods. Besides, we present the\nmodel's ability to capture the temporal patterns of assignees and the semantic\ndependencies among IPC codes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:02:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zou","Tao",""],["Yu","Le",""],["Sun","Leilei",""],["Du","Bowen",""],["Wang","Deqing",""],["Zhuang","Fuzhen",""]]}
{"id":"2308.05386","submitter":"Fuqiang Zhao","authors":"Fuqiang Zhao, Bidan Huang, Mingchang Li, Mengde Li, Zhongtao Fu, Ziwei\n  Lei, Miao Li","title":"A novel tactile palm for robotic object manipulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tactile sensing is of great importance during human hand usage such as object\nexploration, grasping and manipulation. Different types of tactile sensors have\nbeen designed during the past decades, which are mainly focused on either the\nfingertips for grasping or the upper-body for human-robot interaction. In this\npaper, a novel soft tactile sensor has been designed to mimic the functionality\nof human palm that can estimate the contact state of different objects. The\ntactile palm mainly consists of three parts including an electrode array, a\nsoft cover skin and the conductive sponge. The design principle are described\nin details, with a number of experiments showcasing the effectiveness of the\nproposed design.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:03:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhao","Fuqiang",""],["Huang","Bidan",""],["Li","Mingchang",""],["Li","Mengde",""],["Fu","Zhongtao",""],["Lei","Ziwei",""],["Li","Miao",""]]}
{"id":"2308.05387","submitter":"Guozhang Liu","authors":"Chaoran Lu, Ningning Cao, Pan Zhang, Ting Liu, Baochai Peng, Guozhang\n  Liu, Mengke Yuan, Sen Zhang, Simin Huang, Tao Wang","title":"HGDNet: A Height-Hierarchy Guided Dual-Decoder Network for Single View\n  Building Extraction and Height Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unifying the correlative single-view satellite image building extraction and\nheight estimation tasks indicates a promising way to share representations and\nacquire generalist model for large-scale urban 3D reconstruction. However, the\ncommon spatial misalignment between building footprints and\nstereo-reconstructed nDSM height labels incurs degraded performance on both\ntasks. To address this issue, we propose a Height-hierarchy Guided Dual-decoder\nNetwork (HGDNet) to estimate building height. Under the guidance of synthesized\ndiscrete height-hierarchy nDSM, auxiliary height-hierarchical building\nextraction branch enhance the height estimation branch with implicit\nconstraints, yielding an accuracy improvement of more than 6% on the DFC 2023\ntrack2 dataset. Additional two-stage cascade architecture is adopted to achieve\nmore accurate building extraction. Experiments on the DFC 2023 Track 2 dataset\nshows the superiority of the proposed method in building height estimation\n({\\delta}1:0.8012), instance extraction (AP50:0.7730), and the final average\nscore 0.7871 ranks in the first place in test phase.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:03:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lu","Chaoran",""],["Cao","Ningning",""],["Zhang","Pan",""],["Liu","Ting",""],["Peng","Baochai",""],["Liu","Guozhang",""],["Yuan","Mengke",""],["Zhang","Sen",""],["Huang","Simin",""],["Wang","Tao",""]]}
{"id":"2308.05388","submitter":"Sai Wang","authors":"Sai Wang and Yi Gong","title":"A Generalized Primal-Dual Correction Method for Saddle-Point Problems\n  with the Nonlinear Coupling Operator","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":"  Recently, the generalized primal-dual (GPD) method was developed for\nsaddle-point problems (SPPs) with a linear coupling operator. However, the\ncoupling operator in many engineering applications is nonlinear. In this\nletter, we propose a generalized primal-dual correction method (GPD-CM) to\nhandle SPPs with a nonlinear coupling operator. To achieve this, we customize\nthe proximal matrix and corrective matrix by adjusting the values of\nregularization factors. By the unified framework, the convergence of GPD-CM is\ndirectly obtained. Numerical results on a SPP with an exponential coupling\noperator support theoretical analysis.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:07:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Sai",""],["Gong","Yi",""]]}
{"id":"2308.05389","submitter":"Albert Schwarz","authors":"Albert Schwarz","title":"Singularities of scattering matrix","comments":"9 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":"  Our main result is the analysis of singularities of integrands of integrals\nrepresenting matrix elements of scattering matrix and inclusive scattering\nmatrix in perturbation theory. These results are proven for any quantum field\ntheory in any dimension.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:07:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Schwarz","Albert",""]]}
{"id":"2308.05390","submitter":"Sangeet Jaiswal","authors":"Sangeet Jaiswal, Dhruv Patel, Sreekanth Vempati, Konduru Saiswaroop","title":"Product Review Image Ranking for Fashion E-commerce","comments":"Accepted in Proceedings of ACM SIGIR Workshop on eCommerce (SIGIR\n  eCom'22)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a fashion e-commerce platform where customers can't physically examine the\nproducts on their own, being able to see other customers' text and image\nreviews of the product is critical while making purchase decisions. Given the\nhigh reliance on these reviews, over the years we have observed customers\nproactively sharing their reviews. With an increase in the coverage of User\nGenerated Content (UGC), there has been a corresponding increase in the number\nof customer images. It is thus imperative to display the most relevant images\non top as it may influence users' online shopping choices and behavior. In this\npaper, we propose a simple yet effective training procedure for ranking\ncustomer images. We created a dataset consisting of Myntra (A Major Indian\nFashion e-commerce company) studio posts and highly engaged (upvotes/downvotes)\nUGC images as our starting point and used selected distortion techniques on the\nimages of the above dataset to bring their quality at par with those of bad UGC\nimages. We train our network to rank bad-quality images lower than high-quality\nones. Our proposed method outperforms the baseline models on two metrics,\nnamely correlation coefficient, and accuracy, by substantial margins.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:09:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jaiswal","Sangeet",""],["Patel","Dhruv",""],["Vempati","Sreekanth",""],["Saiswaroop","Konduru",""]]}
{"id":"2308.05391","submitter":"Segev Shlomov","authors":"Sivan Schwartz, Avi Yaeli, Segev Shlomov","title":"Enhancing Trust in LLM-Based AI Automation Agents: New Considerations\n  and Future Challenges","comments":"Accepted to the First International Workshop on the Future of No-Code\n  Digital Apprentices","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Trust in AI agents has been extensively studied in the literature, resulting\nin significant advancements in our understanding of this field. However, the\nrapid advancements in Large Language Models (LLMs) and the emergence of\nLLM-based AI agent frameworks pose new challenges and opportunities for further\nresearch. In the field of process automation, a new generation of AI-based\nagents has emerged, enabling the execution of complex tasks. At the same time,\nthe process of building automation has become more accessible to business users\nvia user-friendly no-code tools and training mechanisms. This paper explores\nthese new challenges and opportunities, analyzes the main aspects of trust in\nAI agents discussed in existing literature, and identifies specific\nconsiderations and challenges relevant to this new generation of automation\nagents. We also evaluate how nascent products in this category address these\nconsiderations. Finally, we highlight several challenges that the research\ncommunity should address in this evolving landscape.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:12:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Schwartz","Sivan",""],["Yaeli","Avi",""],["Shlomov","Segev",""]]}
{"id":"2308.05392","submitter":"Farux Abdulxamidov","authors":"Farrux Abdulxamidov, Javlon Rayimbaev, Ahmadjon Abdujabbarov, and\n  Zden\\v{e}k Stuchl\\'ik","title":"Spinning magnetized particles orbiting magnetized Schwarzschild black\n  holes","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A way to test electromagnetic field and spacetime properties around black\nholes is by considering the dynamics of test particles. In fact, in real\nastrophysical scenarios, it is hard to determine spacetime geometry which is\ndominating due to degeneracy gravitational effects in parameters of gravity\ntheories. In this work, we study for the first time the dynamics of spinning\nparticles that have magnetic dipole moments around Schwarzschild black holes\nimmersed in an external asymptotically uniform magnetic field using the\nMathisson-Papapetrou-Dixon (MPD) equation. There are two combined interactions:\ngravitational interaction between the spin of the particle and\n(electro)magnetic interaction between the external magnetic field and the\nmagnetic dipole moment of the particle to be taken into account. First, we\nderive the effective potential of the test spinning magnetized particles in\nmotion around the black hole. We also study the combined effects of spin and\nmagnetic interactions on innermost stable circular orbits (ISCOs), the energy,\nand angular momentum of the particles at ISCO together with superluminal\nbounds. We investigated the collision of the particles and evaluated the\ncenter-of-mass energy in the collisions. Finally, we consider various cases in\nwhich neutron stars and rotating stellar mass black holes can be treated as\nspinning magnetized particles, evaluating the effects of the spin and magnetic\nmoment of objects around supermassive and intermediate-mass black holes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:13:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Abdulxamidov","Farrux",""],["Rayimbaev","Javlon",""],["Abdujabbarov","Ahmadjon",""],["Stuchl\u00edk","Zden\u011bk",""]]}
{"id":"2308.05393","submitter":"Qi Guo","authors":"Anouar Bahrouni, Qi Guo, Hichem Hajaiej and Yuanyang Yu","title":"Existence and Multiplicity of Normalized Solutions for Dirac Equations\n  with non-autonomous nonlinearities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.FA math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the following nonlinear Dirac equations\n\\begin{align*} \\begin{cases} -i\\sum\\limits_{k=1}^3\\alpha_k\\partial_k u+m\\beta\nu=f(x,|u|)u+\\omega u,\n  \\displaystyle \\int_{\\mathbb{R}^3} |u|^2dx=a^2,\n  \\end{cases} \\end{align*} where $u: \\mathbb{R}^{3}\\rightarrow \\mathbb{C}^{4}$,\n$m>0$ is the mass of the Dirac particle, $\\omega\\in \\mathbb{R}$ arises as a\nLagrange multiplier, $\\partial_k=\\frac{\\partial}{\\partial x_k}$,\n$\\alpha_1,\\alpha_2,\\alpha_3$ are $4\\times 4$ Pauli-Dirac matrices, $a>0$ is a\nprescribed constant, and $f(x,\\cdot)$ has several physical interpretations that\nwill be discussed in the Introduction. Under general assumptions on the\nnonlinearity $f$, we prove the existence of $L^2$-normalized solutions for the\nabove nonlinear Dirac equations by using perturbation methods in combination\nwith Lyapunov-Schmidt reduction. We also show the multiplicity of these\nnormalized solutions thanks to the multiplicity theorem of\nLjusternik-Schnirelmann. Moreover, we obtain bifurcation results of this\nproblem.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:14:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bahrouni","Anouar",""],["Guo","Qi",""],["Hajaiej","Hichem",""],["Yu","Yuanyang",""]]}
{"id":"2308.05394","submitter":"Changkun Liu","authors":"Changkun Liu, Yukun Zhao, Tristan Braud","title":"Robust Localization with Visual-Inertial Odometry Constraints for\n  Markerless Mobile AR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual Inertial Odometry (VIO) is an essential component of modern Augmented\nReality (AR) applications. However, VIO only tracks the relative pose of the\ndevice, leading to drift over time. Absolute pose estimation methods infer the\ndevice's absolute pose, but their accuracy depends on the input quality. This\npaper introduces VIO-APR, a new framework for markerless mobile AR that\ncombines an absolute pose regressor (APR) with a local VIO tracking system.\nVIO-APR uses VIO to assess the reliability of the APR and the APR to identify\nand compensate for VIO drift. This feedback loop results in more accurate\npositioning and more stable AR experiences. To evaluate VIO-APR, we created a\ndataset that combines camera images with ARKit's VIO system output for six\nindoor and outdoor scenes of various scales. Over this dataset, VIO-APR\nimproves the median accuracy of popular APR by up to 36\\% in position and 29\\%\nin orientation, increases the percentage of frames in the high ($0.25 m,\n2^{\\circ}$) accuracy level by up to 112\\% and reduces the percentage of frames\npredicted below the low ($5 m, 10^\\circ$) accuracy greatly. We implement\nVIO-APR into a mobile AR application using Unity to demonstrate its\ncapabilities. VIO-APR results in noticeably more accurate localization and a\nmore stable overall experience.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:21:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Changkun",""],["Zhao","Yukun",""],["Braud","Tristan",""]]}
{"id":"2308.05395","submitter":"Ziyi Yu","authors":"Ziyi Yu and Nikolaos M. Freris","title":"Communication-efficient distributed optimization with adaptability to\n  system heterogeneity","comments":"This paper is accepted by the 62nd IEEE Conference on Decision and\n  Control (CDC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the setting of agents cooperatively minimizing the sum of local\nobjectives plus a regularizer on a graph. This paper proposes a primal-dual\nmethod in consideration of three distinctive attributes of real-life\nmulti-agent systems, namely: (i)expensive communication, (ii)lack of\nsynchronization, and (iii)system heterogeneity. In specific, we propose a\ndistributed asynchronous algorithm with minimal communication cost, in which\nusers commit variable amounts of local work on their respective sub-problems.\nWe illustrate this both theoretically and experimentally in the machine\nlearning setting, where the agents hold private data and use a stochastic\nNewton method as the local solver. Under standard assumptions on Lipschitz\ncontinuous gradients and strong convexity, our analysis establishes linear\nconvergence in expectation and characterizes the dependency of the rate on the\nnumber of local iterations. We proceed a step further to propose a simple means\nfor tuning agents' hyperparameters locally, so as to adjust to heterogeneity\nand accelerate the overall convergence. Last, we validate our proposed method\non a benchmark machine learning dataset to illustrate the merits in terms of\ncomputation, communication, and run-time saving as well as adaptability to\nheterogeneity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:24:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yu","Ziyi",""],["Freris","Nikolaos M.",""]]}
{"id":"2308.05396","submitter":"Lanyun Zhu","authors":"Lanyun Zhu, Tianrun Chen, Jianxiong Yin, Simon See, Jun Liu","title":"Learning Gabor Texture Features for Fine-Grained Recognition","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":"  Extracting and using class-discriminative features is critical for\nfine-grained recognition. Existing works have demonstrated the possibility of\napplying deep CNNs to exploit features that distinguish similar classes.\nHowever, CNNs suffer from problems including frequency bias and loss of\ndetailed local information, which restricts the performance of recognizing\nfine-grained categories. To address the challenge, we propose a novel texture\nbranch as complimentary to the CNN branch for feature extraction. We\ninnovatively utilize Gabor filters as a powerful extractor to exploit texture\nfeatures, motivated by the capability of Gabor filters in effectively capturing\nmulti-frequency features and detailed local information. We implement several\ndesigns to enhance the effectiveness of Gabor filters, including imposing\nconstraints on parameter values and developing a learning method to determine\nthe optimal parameters. Moreover, we introduce a statistical feature extractor\nto utilize informative statistical information from the signals captured by\nGabor filters, and a gate selection mechanism to enable efficient computation\nby only considering qualified regions as input for texture extraction. Through\nthe integration of features from the Gabor-filter-based texture branch and\nCNN-based semantic branch, we achieve comprehensive information extraction. We\ndemonstrate the efficacy of our method on multiple datasets, including\nCUB-200-2011, NA-bird, Stanford Dogs, and GTOS-mobile. State-of-the-art\nperformance is achieved using our approach.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:28:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhu","Lanyun",""],["Chen","Tianrun",""],["Yin","Jianxiong",""],["See","Simon",""],["Liu","Jun",""]]}
{"id":"2308.05397","submitter":"Yiqi Fang","authors":"Yiqi Fang, Meng Han, Peipei Ge, Zhenning Guo, Xiaoyang Yu, Yongkai\n  Deng, Chengyin Wu, Qihuang Gong, Yunquan Liu","title":"Photoelectronic mapping of spin-orbit interaction of intense light\n  fields","comments":"28 pages, 4 figures","journal-ref":"Nature Photonics, 15(2), 115-120 (2021)","doi":"10.1038/s41566-020-00709-3","report-no":null,"categories":"physics.optics physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interaction between a quantum particle's spin angular momentum and its\norbital angular momentum is ubiquitous in nature. In optics, the spin-orbit\noptical phenomenon is closely related with the light-matter interaction and has\nbeen of great interest. With the development of laser technology, the\nhigh-power and ultrafast light sources now serve as a crucial tool in revealing\nthe behaviour of matters under extreme conditions. The comprehensive knowledge\nof the spin-orbit interaction for the intense light is of utmost importance.\nHere, we achieve the in-situ modulation and visualization of the optical\norbital-to-spin conversion in strong-field regime. We show that, through\nmanipulating the morphology of femtosecond cylindrical vector vortex pulses by\na slit, the photons' orbital angular momentum can be controllably transformed\ninto spin after focusing. By employing strong-field ionization experiment, the\norbital-to-spin conversion can be imaged and measured through the photoelectron\nmomentum distributions. Such detection and consequent control of spin-orbit\ndynamics of intense laser fields have implications on controlling the\nphotoelectron holography and coherent extreme ultraviolet radiation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:29:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fang","Yiqi",""],["Han","Meng",""],["Ge","Peipei",""],["Guo","Zhenning",""],["Yu","Xiaoyang",""],["Deng","Yongkai",""],["Wu","Chengyin",""],["Gong","Qihuang",""],["Liu","Yunquan",""]]}
{"id":"2308.05398","submitter":"Yiqi Fang","authors":"Yiqi Fang, Shengyue Lu, Yunquan Liu","title":"Controlling Photon Transverse Orbital Angular Momentum in High Harmonic\n  Generation","comments":"15 pages, 5 figures","journal-ref":"Physical Review Letters, 127(27), 273901 (2021)","doi":"10.1103/PhysRevLett.127.273901","report-no":null,"categories":"physics.optics physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High harmonic generation (HHG) with longitudinal optical orbital angular\nmomentum has attracted much attention over the past decade. Here, we present\nthe first study on the HHG with transverse orbital angular momentum driven by\nthe spatiotemporal optical vortex (STOV) pulses. We show that the produced\nspatial resolved harmonic spectra reveal unique structures, such as the\nspatially spectral tilt and the fine interference patterns. We show these\nspatio-spectral structures originate from both the macroscopic and microscopic\neffect of spatiotemporal optical singularity in HHG. Employing two-color\ncounter-spin and counter-vorticity STOV pulses, we further discuss a robust\nmethod to control the spatiotemporal topological charge and spectral structure\nof high-order harmonics. The conservation rule of photon transverse orbital\nangular momentum in HHG process is also discussed when mixing with photon spin\nangular momenta.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:34:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fang","Yiqi",""],["Lu","Shengyue",""],["Liu","Yunquan",""]]}
{"id":"2308.05399","submitter":"Mihail I Petrov","authors":"Alexander Barulin, Olesia Pashina, Daniil Riabov, Olga Sergaeva,\n  Zarina Sadrieva, Alexey Shcherbakov, Viktoriia Rutckaia, Jorg Schilling,\n  Andrey Bogdanov, Ivan Sinev, Alexander Chernov, Mihail Petrov","title":"Thermo-optical bistability enabled by bound states in the continuum in\n  silicon metasurfaces","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":"  The control of light through all-optical means is a fundamental challenge in\nnanophotonics and a key effect in optical switching and logic. The optical\nbistability effect enables this control and can be observed in various planar\nphotonic systems such as microdisk and photonic crystal cavities and\nwaveguides. However, the recent advancements in flat optics with\nwavelength-thin optical elements require nonlinear elements based on\nmetastructures and metasurfaces. The performance of these systems can be\nenhanced with high-Q bound states in the continuum (BIC), which leads to\nintense harmonic generation, improved light-matter coupling, and pushes forward\nsensing limits. In this study, we report on the enhanced thermo-optical\nnonlinearity and the observation of optical bistability in an all-dielectric\nmetasurface membrane with BICs. Unlike many other nanophotonic platforms,\nmetasurfaces allow for fine control of the quality factor of the BIC resonance\nby managing the radiative losses. This provides an opportunity to control the\nparameters of the observed hysteresis loop and even switch from bistability to\noptical discrimination by varying the angle of incidence. Additionally, we\npropose a mechanism of nonlinear critical coupling that establishes the\nconditions for maximal hysteresis width and minimal switching power, which has\nnot been reported before. Our work suggests that all-dielectric metasurfaces\nsupporting BICs can serve as a flat-optics platform for optical switching and\nmodulation based on strong thermo-optical nonlinearity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:38:08 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 09:22:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Barulin","Alexander",""],["Pashina","Olesia",""],["Riabov","Daniil",""],["Sergaeva","Olga",""],["Sadrieva","Zarina",""],["Shcherbakov","Alexey",""],["Rutckaia","Viktoriia",""],["Schilling","Jorg",""],["Bogdanov","Andrey",""],["Sinev","Ivan",""],["Chernov","Alexander",""],["Petrov","Mihail",""]]}
{"id":"2308.05400","submitter":"Yiqi Fang","authors":"Yiqi Fang, Yunquan Liu","title":"Generation and control of extreme ultraviolet free-space optical\n  skyrmions with high harmonic generation","comments":"17 Pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optical skyrmion serves as a crucial interface between optics and topology.\nRecently, it has attracted great interest in linear optics. Here, we\ntheoretically introduce a framework for the all-optical generation and control\nof freespace optical skyrmions in extreme ultraviolet regions via high harmonic\ngeneration. We show that by employing full Poincare beams, the created extreme\nultraviolet fields manifest as skyrmionic structures in Stokes vector fields,\nwhose skyrmion number is relevant to harmonic orders. We reveal that the\ngeneration of skyrmionics structure is attributed to spatial-resolved spin\nconstraint of high harmonic generation. Through qualifying the geometrical\nparameters of full Poincar\\'e beams, the topological texture of extreme\nultraviolet fields can be completely manipulated, generating the Bloch-type,\nNeel-type, anti-type, and higher-order skyrmions, etc. This work promotes the\ninvestigation of topological optics in optical highly nonlinear processes, with\npotential applications towards ultrafast spintronics with structured light\nfields.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:38:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fang","Yiqi",""],["Liu","Yunquan",""]]}
{"id":"2308.05401","submitter":"Fuqiang Zhao","authors":"Fuqiang Zhao, Mingchang Li, Mengde Li, Zhongtao Fu, Miao Li","title":"Fast calibration for ultrasound imaging guidance based on depth camera","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During the process of robot-assisted ultrasound(US) puncture, it is important\nto estimate the location of the puncture from the 2D US images. To this end,\nthe calibration of the US image becomes an important issue. In this paper, we\nproposed a depth camera-based US calibration method, where an easy-to-deploy\ndevice is designed for the calibration. With this device, the coordinates of\nthe puncture needle tip are collected respectively in US image and in the depth\ncamera, upon which a correspondence matrix is built for calibration. Finally, a\nnumber of experiments are conducted to validate the effectiveness of our\ncalibration method.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:40:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhao","Fuqiang",""],["Li","Mingchang",""],["Li","Mengde",""],["Fu","Zhongtao",""],["Li","Miao",""]]}
{"id":"2308.05402","submitter":"Hemant Singh","authors":"Dimpi and Hemant Kumar Singh","title":"Fixed Point Sets of Involutions on the Product of Three Spheres","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let G = Z2 act on a finitistic space X having mod 2 cohomology of the product\nof three spheres S^n x S^m x S^l. In this paper, we have determined the fixed\npoint sets of involutions on X. This generalizes J. C. Su [12] results for\ninvolutions on the product of two sphere S^n x S^m.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:41:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dimpi","",""],["Singh","Hemant Kumar",""]]}
{"id":"2308.05403","submitter":"Alvin Gonzales","authors":"Alvin Gonzales and Anjala M Babu and Ji Liu and Zain Saleem and Mark\n  Byrd","title":"Fault Tolerant Quantum Error Mitigation","comments":"Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Typically, fault-tolerant operations and code concatenation are reserved for\nquantum error correction due to their resource overhead. Here, we show that\nfault tolerant operations have a large impact on the performance of symmetry\nbased error mitigation techniques. We also demonstrate that similar to results\nin fault tolerant quantum computing, code concatenation in fault-tolerant\nquantum error mitigation (FTQEM) can exponentially suppress the errors to\narbitrary levels. We also provide analytical error thresholds for FTQEM with\nthe repetition code. The post-selection rate in FTQEM can also be increased by\ncorrecting some of the outcomes. The benefits of FTQEM are demonstrated with\nnumerical simulations and hardware demonstrations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:44:41 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 16:59:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gonzales","Alvin",""],["Babu","Anjala M",""],["Liu","Ji",""],["Saleem","Zain",""],["Byrd","Mark",""]]}
{"id":"2308.05404","submitter":"Xianqiang Lyu","authors":"Xianqiang Lyu, and Junhui Hou","title":"Enhancing Low-light Light Field Images with A Deep Compensation\n  Unfolding Network","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":"  This paper presents a novel and interpretable end-to-end learning framework,\ncalled the deep compensation unfolding network (DCUNet), for restoring light\nfield (LF) images captured under low-light conditions. DCUNet is designed with\na multi-stage architecture that mimics the optimization process of solving an\ninverse imaging problem in a data-driven fashion. The framework uses the\nintermediate enhanced result to estimate the illumination map, which is then\nemployed in the unfolding process to produce a new enhanced result.\nAdditionally, DCUNet includes a content-associated deep compensation module at\neach optimization stage to suppress noise and illumination map estimation\nerrors. To properly mine and leverage the unique characteristics of LF images,\nthis paper proposes a pseudo-explicit feature interaction module that\ncomprehensively exploits redundant information in LF images. The experimental\nresults on both simulated and real datasets demonstrate the superiority of our\nDCUNet over state-of-the-art methods, both qualitatively and quantitatively.\nMoreover, DCUNet preserves the essential geometric structure of enhanced LF\nimages much better. The code will be publicly available at\nhttps://github.com/lyuxianqiang/LFLL-DCU.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:53:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lyu","Xianqiang",""],["Hou","Junhui",""]]}
{"id":"2308.05405","submitter":"Shung-Ichi Ando","authors":"Shung-Ichi Ando","title":"Radiative decay of the sub-threshold $1_1^-$ and $2_1^+$ states of\n  $^{16}$O in cluster effective field theory","comments":"22 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Radiative decay of the sub-threshold $1_1^-$ and $2_1^+$ states of $^{16}$O\nis studied in cluster effective field theory. The wave function normalization\nfactors for initial and final states of the radiative decay amplitudes are\ndeduced by using the phase shift data of elastic $\\alpha$-$^{12}$C scattering\nfor $l=0,1,2$, which are related to the asymptotic normalization coefficients\nof $0_1^+$, $1_1^-$, $2_1^+$ states of $^{16}$O for the two-body\n$\\alpha$-$^{12}$C channel; then only one unfixed parameter remains in each of\nthe radiative decay amplitudes. We fit the parameters to the experimental\nradiative decay rates and apply the fitted parameters to the study of radiative\n$\\alpha$ capture on $^{12}$C, $^{12}$C($\\alpha$,$\\gamma$)$^{16}$O. The order of\nmagnitude of astrophysical $S$ factors of $E1$ and $E2$ transitions of\n$^{12}$C($\\alpha$,$\\gamma$)$^{16}$O is reproduced compared to the experimental\ndata, and we discuss an improvement in the calculation of $S$ factors of\n$^{12}$C($\\alpha$,$\\gamma$)$^{16}$O.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:53:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ando","Shung-Ichi",""]]}
{"id":"2308.05406","submitter":"Simona Olmi","authors":"Alejandro Carballosa, Alberto P. Mu\\~nuzuri, Stefano Boccaletti,\n  Alessandro Torcini and Simona Olmi","title":"Bimodal Kuramoto Model with Higher Order Interactions","comments":"18 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO cond-mat.dis-nn math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have examined the synchronization and de-synchronization transitions\nobservable in the Kuramoto model with a standard pair-wise first harmonic\ninteraction plus a higher order (triadic) symmetric interaction for unimodal\nand bimodal Gaussian distributions of the natural frequencies. These\ntransitions have been accurately characterized thanks to a self-consistent\nmean-field approach joined to accurate numerical simulations. The higher-oder\ninteractions favour the formation of two cluster states, which emerge from the\nincoherent regime via continuous (discontinuos) transitions for unimodal\n(bimodal) distributions. Fully synchronized initial states give rise to two\nsymmetric equally populated clusters at a angular distance $\\gamma$, which\nincreases for decreasing pair-wise couplings until it reaches $\\gamma=\\pi$\n(corresponding to an anti-phase configuration) where the cluster state\ndisappears via a saddle-node bifurcation and reforms immediately after with a\nsmaller angle $\\gamma$. For bimodal distributions we have obtained detailed\nphase diagrams involving all the possible dynamical states in terms of standard\nand novel order parameters. In particular, the clustering order parameter, here\nintroduced, appears quite suitable to characterize the two cluster regime. As a\ngeneral aspect, hysteretic (non hysteretic) synchronization transitions, mostly\nmediated by the emergence of standing waves, are observable for attractive\n(repulsive) higher-order interactions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:02:50 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 11:01:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Carballosa","Alejandro",""],["Mu\u00f1uzuri","Alberto P.",""],["Boccaletti","Stefano",""],["Torcini","Alessandro",""],["Olmi","Simona",""]]}
{"id":"2308.05407","submitter":"Francisco Mena","authors":"Francisco Mena, Diego Arenas, Marlon Nuske, Andreas Dengel","title":"A Comparative Assessment of Multi-view fusion learning for Crop\n  Classification","comments":"Accepted at IEEE International Geoscience and Remote Sensing\n  Symposium 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":"  With a rapidly increasing amount and diversity of remote sensing (RS) data\nsources, there is a strong need for multi-view learning modeling. This is a\ncomplex task when considering the differences in resolution, magnitude, and\nnoise of RS data. The typical approach for merging multiple RS sources has been\ninput-level fusion, but other - more advanced - fusion strategies may\noutperform this traditional approach. This work assesses different fusion\nstrategies for crop classification in the CropHarvest dataset. The fusion\nmethods proposed in this work outperform models based on individual views and\nprevious fusion methods. We do not find one single fusion method that\nconsistently outperforms all other approaches. Instead, we present a comparison\nof multi-view fusion methods for three different datasets and show that,\ndepending on the test region, different methods obtain the best performance.\nDespite this, we suggest a preliminary criterion for the selection of fusion\nmethods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:03:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mena","Francisco",""],["Arenas","Diego",""],["Nuske","Marlon",""],["Dengel","Andreas",""]]}
{"id":"2308.05408","submitter":"Shi-Xin Zhang","authors":"Shi-Xin Zhang and Shuai Yin","title":"Universal imaginary-time critical dynamics on a quantum computer","comments":"5 pages, 4 figures and supplemental materials","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computers promise a highly efficient approach to investigate quantum\nphase transitions, which describe abrupt changes between different ground\nstates of many-body systems. At quantum critical points, the divergent\ncorrelation length and entanglement entropy render the ground state preparation\ndifficult. In this work, we explore the imaginary-time evolution for probing\nthe universal critical behavior as the universal information of the ground\nstate can be extracted in the early-time relaxation process. We propose a\nsystematic and scalable scheme to probe the universal behaviors via\nimaginary-time critical dynamics on quantum computers and demonstrate the\nvalidness of our approach by both numerical simulation and quantum hardware\nexperiments. With the full form of the universal scaling function in terms of\nimaginary time, system size, and circuit depth, we successfully probe the\nuniversality by scaling analysis of the critical dynamics at an early time and\nwith shallower quantum circuit depth. Equipped with quantum error mitigation,\nwe also confirm the expected scaling behavior from experimental results on a\nsuperconducting quantum processor which stands as the first experimental\ndemonstration on universal imaginary-time quantum critical dynamics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:04:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhang","Shi-Xin",""],["Yin","Shuai",""]]}
{"id":"2308.05409","submitter":"Alessandro Carlotto","authors":"Alessandro Carlotto, Chao Li","title":"Attaching faces of positive scalar curvature manifolds with corners","comments":"invited contribution; in memory of Robert Bartnik","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a novel desingularization theorem, that allows to smoothly attach\ntwo given manifolds with corners by suitably gluing a pair of isometric faces,\nwith control on both the scalar curvature of the resulting space and the mean\ncurvature of its boundary.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:07:00 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Carlotto","Alessandro",""],["Li","Chao",""]]}
{"id":"2308.05410","submitter":"Mohammad Zohaib","authors":"Mohammad Zohaib and Alessio Del Bue","title":"SC3K: Self-supervised and Coherent 3D Keypoints Estimation from Rotated,\n  Noisy, and Decimated Point Cloud Data","comments":"This paper has been accepted in International Conference on Computer\n  Vision (ICCV) 2023. For code and data, please refer to the following GitHub\n  page: https://github.com/IITPAVIS/SC3K","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a new method to infer keypoints from arbitrary object\ncategories in practical scenarios where point cloud data (PCD) are noisy,\ndown-sampled and arbitrarily rotated. Our proposed model adheres to the\nfollowing principles: i) keypoints inference is fully unsupervised (no\nannotation given), ii) keypoints position error should be low and resilient to\nPCD perturbations (robustness), iii) keypoints should not change their indexes\nfor the intra-class objects (semantic coherence), iv) keypoints should be close\nto or proximal to PCD surface (compactness). We achieve these desiderata by\nproposing a new self-supervised training strategy for keypoints estimation that\ndoes not assume any a priori knowledge of the object class, and a model\narchitecture with coupled auxiliary losses that promotes the desired keypoints\nproperties. We compare the keypoints estimated by the proposed approach with\nthose of the state-of-the-art unsupervised approaches. The experiments show\nthat our approach outperforms by estimating keypoints with improved coverage\n(+9.41%) while being semantically consistent (+4.66%) that best characterizes\nthe object's 3D shape for downstream tasks. Code and data are available at:\nhttps://github.com/IITPAVIS/SC3K\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:10:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zohaib","Mohammad",""],["Del Bue","Alessio",""]]}
{"id":"2308.05411","submitter":"Nicoletta Prentzas","authors":"Nicoletta Prentzas, Antonis Kakas, and Constantinos S. Pattichis","title":"Explainable AI applications in the Medical Domain: a systematic review","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":"  Artificial Intelligence in Medicine has made significant progress with\nemerging applications in medical imaging, patient care, and other areas. While\nthese applications have proven successful in retrospective studies, very few of\nthem were applied in practice.The field of Medical AI faces various challenges,\nin terms of building user trust, complying with regulations, using data\nethically.Explainable AI (XAI) aims to enable humans understand AI and trust\nits results. This paper presents a literature review on the recent developments\nof XAI solutions for medical decision support, based on a representative sample\nof 198 articles published in recent years. The systematic synthesis of the\nrelevant articles resulted in several findings. (1) model-agnostic XAI\ntechniques were mostly employed in these solutions, (2) deep learning models\nare utilized more than other types of machine learning models, (3)\nexplainability was applied to promote trust, but very few works reported the\nphysicians participation in the loop, (4) visual and interactive user interface\nis more useful in understanding the explanation and the recommendation of the\nsystem. More research is needed in collaboration between medical and AI\nexperts, that could guide the development of suitable frameworks for the\ndesign, implementation, and evaluation of XAI solutions in medicine.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:12:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Prentzas","Nicoletta",""],["Kakas","Antonis",""],["Pattichis","Constantinos S.",""]]}
{"id":"2308.05412","submitter":"Nicolas Ledos","authors":"Nicolas Ledos, Shinsuke Takasao, Kentaro Nagamine","title":"Stability and Ly$\\alpha$ emission of Cold Stream in the Circumgalactic\n  Medium: impact of magnetic fields and thermal conduction","comments":"19 pages, 15 figures, 1 video link (https://youtu.be/zhNCGoiUYgE), 3\n  Appendices; submitted to MNRAS (July 3 2023)","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":"  Cold streams of gas with temperatures around $10^4 \\, \\rm K$ play a crucial\nrole in the gas accretion on to high-redshift galaxies. The current resolution\nof cosmological simulations is insufficient to fully capture the stability and\nLy$\\alpha$ emission characteristics of cold stream accretion, underscoring the\nimperative need for conducting idealized high-resolution simulations. We\ninvestigate the impact of magnetic fields at various angles and anisotropic\nthermal conduction (TC) on the dynamics of radiatively cooling streams through\na comprehensive suite of two-dimensional high-resolution simulations. An\ninitially small magnetic field ($\\sim 10^{-3} \\, \\rm \\mu G$), oriented\nnon-parallel to the stream, can grow significantly, providing stability against\nKelvin-Helmholtz instabilities and reducing the Ly$\\alpha$ emission by a factor\nof $<20$ compared to the hydrodynamics case. With TC, the stream evolution can\nbe categorised into three regimes: (1) the Diffusing Stream regime, where the\nstream diffuses into the surrounding hot circumgalactic medium; (2) the\nIntermediate regime, where TC diffuses the mixing layer, resulting in enhanced\nstabilization and reduced emissions; (3) the Condensing Stream regime, where\nthe impact of magnetic field and TC on the stream's emission and evolution\nbecomes negligible. Extrapolating our findings to the cosmological context\nsuggests that cold streams with a radius of $\\leq 1 \\rm \\, \\rm kpc$ may fuel\ngalaxies with cold, metal-enriched, magnetized gas ($B \\sim 0.1\\text{--}1 \\,\n\\rm \\mu G$) for a longer time, leading to a broad range of Ly$\\alpha$\nluminosity signatures of $\\sim 10^{37}\\text{--}10^{40}\\, \\rm \\, erg \\, s^{-1}$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:17:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ledos","Nicolas",""],["Takasao","Shinsuke",""],["Nagamine","Kentaro",""]]}
{"id":"2308.05413","submitter":"Chen Xi","authors":"Yue Ban, and Xi Chen","title":"Scattering of relativistic electrons and analogies with optical\n  phenomena: A study of longitudinal and transverse shifts at step potentials","comments":"9 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":"  We investigate the behavior of relativistic electrons encountering a\npotential step through analogies with optical phenomena. By accounting for the\nconservation of Dirac current, we elucidate that the Goos-H\\\"anchen shift can\nbe understood as a combination of two components: one arising from the current\nentering the transmission region and the other originating from the\ninterference between the incident and reflected beams. This result has been\nproven to be consistent with findings obtained utilizing the stationary phase\nmethod. Moreover, we explore the transverse Imbert-Fedorov shift, by applying\nboth current conservation and total angular momentum conservation, revealing\nintriguing parallel to the spin Hall effect. Beyond enriching our comprehension\nof fundamental quantum phenomena, our findings have potential applications for\ndesigning and characterizing devices using Dirac and topological materials.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:17:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ban","Yue",""],["Chen","Xi",""]]}
{"id":"2308.05414","submitter":"Jiajin Li","authors":"Jose Blanchet, Daniel Kuhn, Jiajin Li, Bahar Taskesen","title":"Unifying Distributionally Robust Optimization via Optimal Transport\n  Theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the past few years, there has been considerable interest in two prominent\napproaches for Distributionally Robust Optimization (DRO): Divergence-based and\nWasserstein-based methods. The divergence approach models misspecification in\nterms of likelihood ratios, while the latter models it through a measure of\ndistance or cost in actual outcomes. Building upon these advances, this paper\nintroduces a novel approach that unifies these methods into a single framework\nbased on optimal transport (OT) with conditional moment constraints. Our\nproposed approach, for example, makes it possible for optimal adversarial\ndistributions to simultaneously perturb likelihood and outcomes, while\nproducing an optimal (in an optimal transport sense) coupling between the\nbaseline model and the adversarial model.Additionally, the paper investigates\nseveral duality results and presents tractable reformulations that enhance the\npractical applicability of this unified framework.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:17:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Blanchet","Jose",""],["Kuhn","Daniel",""],["Li","Jiajin",""],["Taskesen","Bahar",""]]}
{"id":"2308.05415","submitter":"Davide Augusto Bignamini","authors":"Davide Addona and Davide A. Bignamini","title":"Pathwise uniqueness for stochastic heat and damped equations with\n  H\\\"older continuous drift","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 prove pathwise uniqueness for stochastic differential\nequations in infinite dimension. Under our assumptions, we are able to consider\nthe stochastic heat equation up to dimension $3$, the stochastic damped wave\nequation in dimension $1$ and the stochastic Euler-Bernoulli damped beam\nequation up to dimension $3$. We do not require that the so-called {\\it\nstructure condition} holds true.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:17:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Addona","Davide",""],["Bignamini","Davide A.",""]]}
{"id":"2308.05416","submitter":"Gwendal Patat","authors":"Gwendal Patat (SPICY, IRISA, IRISA-D1), Mohamed Sabt (SPICY, IRISA,\n  IRISA-D1), Pierre-Alain Fouque (CAPSULE, IRISA, IRISA-D1)","title":"Your DRM Can Watch You Too: Exploring the Privacy Implications of\n  Browsers (mis)Implementations of Widevine EME","comments":null,"journal-ref":"Proceedings on Privacy Enhancing Technologies, Jul 2023, Lausanne,\n  Switzerland. pp.306-321","doi":"10.56553/popets-2023-0112","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Thanks to HTML5, users can now view videos on Web browsers without installing\nplug-ins or relying on specific devices. In 2017, W3C published Encrypted Media\nExtensions (EME) as the first official Web standard for Digital Rights\nManagement (DRM), with the overarching goal of allowing seamless integration of\nDRM systems on browsers. EME has prompted numerous voices of dissent with\nrespect to the inadequate protection of users. Of particular interest, privacy\nconcerns were articulated, especially that DRM systems inherently require\nuniquely identifying information on users' devices to control content\ndistribution better. Despite this anecdotal evidence, we lack a comprehensive\noverview of how browsers have supported EME in practice and what privacy\nimplications are caused by their implementations. In this paper, we fill this\ngap by investigating privacy leakage caused by EME relying on proprietary and\nclosed-source DRM systems. We focus on Google Widevine because of its\nversatility and wide adoption. We conduct empirical experiments to show that\nbrowsers diverge when complying EME privacy guidelines, which might undermine\nusers' privacy. For instance, we find that many browsers gladly give away the\nidentifying Widevine Client ID with no or little explicit consent from users.\nMoreover, we characterize the privacy risks of users tracking when browsers\nmiss applying EME guidelines regarding privacy. Because of being closed-source,\nour work involves reverse engineering to dissect the contents of EME messages\nas instantiated by Widevine. Finally, we implement EME Track, a tool that\nautomatically exploits bad Widevine-based implementations to break privacy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:18:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Patat","Gwendal","","SPICY, IRISA, IRISA-D1"],["Sabt","Mohamed","","SPICY, IRISA,\n  IRISA-D1"],["Fouque","Pierre-Alain","","CAPSULE, IRISA, IRISA-D1"]]}
{"id":"2308.05417","submitter":"Florian Philipot","authors":"F. Philipot, A.-M. Lagrange, F. Kiefer, P. Rubini, P. Delorme, and A.\n  Chomez","title":"Multi techniques approach to identify and/or constrain radial velocity\n  sub-stellar companions","comments":"72 pages, 61 figures, 13 tables, accepted for publication by A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context. Although more than one thousand sub-stellar companions have already\nbeen detected with the radial velocity (RV) method, many new companions remain\nto be detected in the public RV archives. Aims. We wish to use the archival\ndata obtained with the ESO/HARPS spectrograph to search for sub-stellar\ncompanions. Methods. We use the astronomic acceleration measurements of stars\nobtained with the Hipparcos and Gaia satellites to identify anomalies that\ncould be explained by the presence of a companion. Once hints for a companion\nare found, we combine the RV data with absolute astrometry and, when available,\nrelative astrometry data, using a Markov Chain Monte Carlo (MCMC) algorithm to\ndetermine the orbital parameters and mass of the companion. Results. We find\nand characterize three new brown dwarfs (GJ660.1 C, HD73256 B, and HD165131 B)\nand six new planets (HD75302 b, HD108202 b, HD135625 b, HD185283 b, HIP10337 b,\nand HIP54597 b) with separations between 1 and 6 au and masses between 0.6 and\n100 MJup. We also constrain the orbital inclination of ten known sub-stellar\ncompanions and determine their true mass. Finally, we identify twelve new\nstellar companions. This shows that the analysis of proper motion anomalies\nallows for optimizing the RV search for sub-stellar companions and their\ncharacterization.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:22:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Philipot","F.",""],["Lagrange","A. -M.",""],["Kiefer","F.",""],["Rubini","P.",""],["Delorme","P.",""],["Chomez","A.",""]]}
{"id":"2308.05418","submitter":"Sebastian Schulz","authors":"Sebastian Schulz, Dennis Willsch, Kristel Michielsen","title":"Guided quantum walk","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We utilize the theory of local amplitude transfers (LAT) to gain insights\ninto quantum walks (QWs) and quantum annealing (QA) beyond the adiabatic\ntheorem. By representing the eigenspace of the problem Hamiltonian as a\nhypercube graph, we demonstrate that probability amplitude traverses the search\nspace through a series of local Rabi oscillations. We argue that the amplitude\nmovement can be systematically guided towards the ground state using a\ntime-dependent hopping rate based solely on the problem's energy spectrum.\nBuilding upon these insights, we extend the concept of multi-stage QW by\nintroducing the guided quantum walk (GQW) as a bridge between QW-like and\nQA-like procedures. We assess the performance of the GQW on exact cover,\ntraveling salesperson and garden optimization problems with 9 to 30 qubits. Our\nresults provide evidence for the existence of optimal annealing schedules,\nbeyond the requirement of adiabatic time evolutions. These schedules might be\ncapable of solving large-scale combinatorial optimization problems within\nevolution times that scale linearly in the problem size.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:24:37 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 14:10:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Schulz","Sebastian",""],["Willsch","Dennis",""],["Michielsen","Kristel",""]]}
{"id":"2308.05419","submitter":"Evgeniy Petrov","authors":"Evgeniy Petrov","title":"Fixed point theorem for generalized Kannan type mappings","comments":"8 pages. arXiv admin note: substantial text overlap with\n  arXiv:2308.01003","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new type of mappings in metric spaces which are three-point\nanalogue of the well-known Kannan type mappings and call them generalized\nKannan type mappings. It is shown that such mappings are discontinuous as well\nas Kannan type mappings and that these two classes of mappings are independent.\nThe fixed-point theorem for generalized Kannan type mappings is proved.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:26:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Petrov","Evgeniy",""]]}
{"id":"2308.05420","submitter":"Xianxin Song","authors":"Xianxin Song, Xinmin Li, Xiaoqi Qin, and Jie Xu","title":"Fully-Passive versus Semi-Passive IRS-Enabled Sensing: SNR Analysis","comments":"6 pages, 3 figures","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":"  This paper compares the signal-to-noise ratio (SNR) performance between the\nfully-passive intelligent reflecting surface (IRS)-enabled non-line-of-sight\n(NLoS) sensing versus its semi-passive counterpart. In particular, we consider\na basic setup with one base station (BS), one uniform linear array (ULA) IRS,\nand one point target at the BS's NLoS region, in which the BS and the IRS\njointly design the transmit and reflective beamforming for performance\noptimization. By considering two special cases with the BS-IRS channels being\nline-of-sight (LoS) and Rayleigh fading, respectively, we derive the\ncorresponding asymptotic sensing SNR when the number of reflecting elements $N$\nat the IRS becomes sufficiently large. It is revealed that in the two special\ncases, the sensing SNR increases proportional to $N^2$ for the semi-passive IRS\nsensing system, but proportional to $N^4$ for the fully-passive IRS sensing\nsystem. As such, the fully-passive IRS sensing system is shown to outperform\nthe semi-passive counterpart when $N$ becomes large, which is due to the fact\nthat the fully-passive IRS sensing enjoys additional reflective beamforming\ngain from the IRS to the BS that outweighs the resultant path loss in this\ncase. Finally, numerical results are presented to validate our analysis under\ndifferent transmit and reflective beamforming design schemes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:26:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Song","Xianxin",""],["Li","Xinmin",""],["Qin","Xiaoqi",""],["Xu","Jie",""]]}
{"id":"2308.05421","submitter":"Guangyao Li","authors":"Guangyao Li, Wenxuan Hou, Di Hu","title":"Progressive Spatio-temporal Perception for Audio-Visual Question\n  Answering","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Audio-Visual Question Answering (AVQA) task aims to answer questions about\ndifferent visual objects, sounds, and their associations in videos. Such\nnaturally multi-modal videos are composed of rich and complex dynamic\naudio-visual components, where most of which could be unrelated to the given\nquestions, or even play as interference in answering the content of interest.\nOppositely, only focusing on the question-aware audio-visual content could get\nrid of influence, meanwhile enabling the model to answer more efficiently. In\nthis paper, we propose a Progressive Spatio-Temporal Perception Network\n(PSTP-Net), which contains three modules that progressively identify key\nspatio-temporal regions w.r.t. questions. Specifically, a temporal segment\nselection module is first introduced to select the most relevant audio-visual\nsegments related to the given question. Then, a spatial region selection module\nis utilized to choose the most relevant regions associated with the question\nfrom the selected temporal segments. To further refine the selection of\nfeatures, an audio-guided visual attention module is employed to perceive the\nassociation between auido and selected spatial regions. Finally, the\nspatio-temporal features from these modules are integrated for answering the\nquestion. Extensive experimental results on the public MUSIC-AVQA and AVQA\ndatasets provide compelling evidence of the effectiveness and efficiency of\nPSTP-Net. Code is available at:\n\\href{https://github.com/GeWu-Lab/PSTP-Net}{https://github.com/GeWu-Lab/PSTP-Net}\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:29:36 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Guangyao",""],["Hou","Wenxuan",""],["Hu","Di",""]]}
{"id":"2308.05422","submitter":"Sarah Leyder","authors":"Sarah Leyder, Jakob Raymaekers and Tim Verdonck","title":"TSLiNGAM: DirectLiNGAM under heavy tails","comments":"35 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the established approaches to causal discovery consists of combining\ndirected acyclic graphs (DAGs) with structural causal models (SCMs) to describe\nthe functional dependencies of effects on their causes. Possible\nidentifiability of SCMs given data depends on assumptions made on the noise\nvariables and the functional classes in the SCM. For instance, in the LiNGAM\nmodel, the functional class is restricted to linear functions and the\ndisturbances have to be non-Gaussian.\n  In this work, we propose TSLiNGAM, a new method for identifying the DAG of a\ncausal model based on observational data. TSLiNGAM builds on DirectLiNGAM, a\npopular algorithm which uses simple OLS regression for identifying causal\ndirections between variables. TSLiNGAM leverages the non-Gaussianity assumption\nof the error terms in the LiNGAM model to obtain more efficient and robust\nestimation of the causal structure. TSLiNGAM is justified theoretically and is\nstudied empirically in an extensive simulation study. It performs significantly\nbetter on heavy-tailed and skewed data and demonstrates a high small-sample\nefficiency. In addition, TSLiNGAM also shows better robustness properties as it\nis more resilient to contamination.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:34:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Leyder","Sarah",""],["Raymaekers","Jakob",""],["Verdonck","Tim",""]]}
{"id":"2308.05423","submitter":"Dimitrios Gazoulis","authors":"Dimitrios Gazoulis, Ioannis Gkanis and Charalambos G. Makridakis","title":"On the Stability and Convergence of Physics Informed Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Physics Informed Neural Networks is a numerical method which uses neural\nnetworks to approximate solutions of partial differential equations. It has\nreceived a lot of attention and is currently used in numerous physical and\nengineering problems. The mathematical understanding of these methods is\nlimited, and in particular, it seems that, a consistent notion of stability is\nmissing. Towards addressing this issue we consider model problems of partial\ndifferential equations, namely linear elliptic and parabolic PDEs. We consider\nproblems with different stability properties, and problems with time discrete\ntraining. Motivated by tools of nonlinear calculus of variations we\nsystematically show that coercivity of the energies and associated compactness\nprovide the right framework for stability. For time discrete training we show\nthat if these properties fail to hold then methods may become unstable.\nFurthermore, using tools of $\\Gamma-$convergence we provide new convergence\nresults for weak solutions by only requiring that the neural network spaces are\nchosen to have suitable approximation properties.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:35:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gazoulis","Dimitrios",""],["Gkanis","Ioannis",""],["Makridakis","Charalambos G.",""]]}
{"id":"2308.05424","submitter":"Sai Krishna P.M.S","authors":"P.M.S Sai Krishna","title":"An Algebraic characterization of the affine three space in arbitrary\n  characteristic","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give an algebraic characterization of the affine $3$-space over an\nalgebraically closed field of arbitrary characteristic. We will use this\ncharacterization to reformulate the following question. Let $$A=k[X, Y, Z,\nT]/(XY+Z^{p^e}+T+T^{sp})$$ where $p^e\\nmid sp$, $sp\\nmid p^e$, $e, s\\geq 1$ and\n$k$ is an algebraically closed field of positive characteristic $p$. Is $A\\cong\nk^{[3]}$?\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:39:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Krishna","P. M. S Sai",""]]}
{"id":"2308.05425","submitter":"Igor Pasti","authors":"Aleksandar Z. Jovanovi\\'c (1), Ana S. Dobrota (1), Natalia V.\n  Skorodumova (2 and 3), Igor A. Pa\\v{s}ti (1) ((1) University of Belgrade -\n  Faculty of Physical Chemistry, Belgrade, Serbia, (2) Department of Materials\n  Science and Engineering, School of Industrial Engineering and Management, KTH\n  - Royal Institute of Technology, Stockholm, Sweden, (3) Applied Physics,\n  Division of Materials Science, Department of Engineering Sciences and\n  Mathematics, Lule{\\aa} University of Technology, Sweden)","title":"Reactivity of Stone-Wales defect in graphene lattice -- DFT study","comments":"19 pages, 6517 words, 10 figures, 4 tables, 49 references; includes\n  supplementary information on 6 pages with 7 figures","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":"  Understanding the reactivity of carbon surfaces is crucial for the\ndevelopment of advanced functional materials. In this study, we systematically\ninvestigate the reactivity of graphene surfaces with the Stone-Wales (SW)\ndefect using Density Functional Theory calculations. We explore the atomic\nadsorption of various elements, including rows 1-3 of the Periodic Table,\npotassium, calcium, and selected transition metals. Our results demonstrate\nthat the SW defect enhances binding with the studied adsorbates when compared\nto pristine graphene, with carbon and silicon showing the most significant\ndifferences. Additionally, we examine the effects of mechanical deformation on\nthe lattice by constraining the system with the SW defect to the pristine\ngraphene cell. Interestingly, these constraints lead to even stronger binding\ninteractions. Furthermore, for carbon, nitrogen, and oxygen adsorbates, we\nobserve that mechanical deformation triggers the incorporation of adatoms into\nthe carbon bond network, leading to the reorganization of the SW defect\nstructure. This work establishes a foundation for future studies in the defect\nand strain engineering of graphene, opening avenues for developing advanced\nmaterials and catalysts with enhanced reactivity and performance.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:39:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jovanovi\u0107","Aleksandar Z.","","2 and 3"],["Dobrota","Ana S.","","2 and 3"],["Skorodumova","Natalia V.","","2 and 3"],["Pa\u0161ti","Igor A.",""]]}
{"id":"2308.05426","submitter":"Ruikai Cui Mr.","authors":"Ruikai Cui, Siyuan He, Shi Qiu","title":"Adaptive Low Rank Adaptation of Segment Anything to Salient Object\n  Detection","comments":"13 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Foundation models, such as OpenAI's GPT-3 and GPT-4, Meta's LLaMA, and\nGoogle's PaLM2, have revolutionized the field of artificial intelligence. A\nnotable paradigm shift has been the advent of the Segment Anything Model (SAM),\nwhich has exhibited a remarkable capability to segment real-world objects,\ntrained on 1 billion masks and 11 million images. Although SAM excels in\ngeneral object segmentation, it lacks the intrinsic ability to detect salient\nobjects, resulting in suboptimal performance in this domain. To address this\nchallenge, we present the Segment Salient Object Model (SSOM), an innovative\napproach that adaptively fine-tunes SAM for salient object detection by\nharnessing the low-rank structure inherent in deep learning. Comprehensive\nqualitative and quantitative evaluations across five challenging RGB benchmark\ndatasets demonstrate the superior performance of our approach, surpassing\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:39:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cui","Ruikai",""],["He","Siyuan",""],["Qiu","Shi",""]]}
{"id":"2308.05427","submitter":"Oliver Brammen","authors":"Oliver Brammen","title":"Dynamics of $L^p$-Multiplier for $p\\leq 2$ on Harmonic Manifolds of\n  Purely Exponential Volume Growth","comments":"30 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the dynamics of $L^p$-multipliers on non-compact simply connected\nharmonic manifolds of purely exponential volume growth. These are linear\noperators on the $L^p$-spaces which behave nicely on radial functions under\nFourier transformation. In the process we complement the results of Kingshook\nBiswas and Rudra P. Sarkar by showing that if they are acting nicely on smooth\nfunction with compact support under Fourier transform for $p\\leq 2$ these can\nnot be chaotic. Furthermore, we use this to study the behaviour of the heat\nsemi-group, the resolvent and the convolution algebra arising from convolution\nwith radial functions. In the process, we obtain a Young inequality for the\nconvolution on non-compact simply connected harmonic manifolds, an extension of\nthe Kunz-Stein and study the domain of holomorphicity of the Fourier transform.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:40:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Brammen","Oliver",""]]}